func_code_string stringlengths 59 71.4k |
|---|
#include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <ctime> #include <iostream> #include <algorithm> #include <queue> #include <map> #include <set> #include <vector> #include <string> #include <stack> #include <numeric> #include <cassert> #define endl n #define sp #define pb push_back #define mp make_pair #define ff first #define ss second using namespace std; typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,ll> pll; const int maxn = 2e5+5; set<pair<int,char>> adj[maxn]; int main(){ ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);cerr.tie(nullptr); int n,m;cin>>n>>m; set<pii> cift, samecift; for(int q=0;q<m;q++){ char t;cin>>t; if(t == + ){ int u,v;char c;cin>>u>>v>>c; pair<int,char> p = {v,c}; adj[u].emplace(v,c); auto it = adj[v].lower_bound({u,0}); if(it != adj[v].end() && it->ff == u){ int setu = min(u,v); int setv = max(u,v); cift.emplace(setu,setv); if(it->ss == c){ samecift.emplace(setu,setv); } } } else if(t == - ){ int u,v;cin>>u>>v; auto it = adj[u].lower_bound({v,0}); assert(it != adj[u].end()); adj[u].erase(it); int setu = min(u,v); int setv = max(u,v); auto it2 = cift.find({setu,setv}); if(it2 != cift.end()){ cift.erase(it2); it2 = samecift.find({setu,setv}); if(it2 != samecift.end()){ samecift.erase(it2); } } } else{ int k;cin>>k; if(k&1){ if(cift.size()){ cout << YES << endl; } else cout << NO << endl; } else{ if(samecift.size()){ cout << YES << endl; } else{ cout << NO << endl; } } } } } |
#include <bits/stdc++.h> using namespace std; const int N = 4e5 + 10; int rd() { int x = 0, w = 1; char ch = 0; while (ch < 0 || ch > 9 ) { if (ch == - ) w = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + (ch ^ 48); ch = getchar(); } return x * w; } int to[N], nt[N], hd[N], tot = 1; void adde(int x, int y) { ++tot, to[tot] = y, nt[tot] = hd[x], hd[x] = tot; } char cc[N]; int n, ans, f[N], g[N], s[N * 50], ch[N * 50][2], rt[N], tz; void inst(int o, int x) { s[o] = x; int l = 1, r = n; while (l < r) { int mid = (l + r) >> 1; if (x <= mid) o = ch[o][0] = ++tz, r = mid; else o = ch[o][1] = ++tz, l = mid + 1; s[o] = x; } } int merg(int o1, int o2) { if (!o1 || !o2) return o1 + o2; int o = ++tz; s[o] = max(s[o1], s[o2]); ch[o][0] = merg(ch[o1][0], ch[o2][0]); ch[o][1] = merg(ch[o1][1], ch[o2][1]); return o; } int quer(int o, int l, int r, int ll, int rr) { if (!o || ll > rr) return s[0]; if (ll <= l && r <= rr) return s[o]; int an = s[0], mid = (l + r) >> 1; if (ll <= mid) an = max(an, quer(ch[o][0], l, mid, ll, rr)); if (rr > mid) an = max(an, quer(ch[o][1], mid + 1, r, ll, rr)); return an; } int fa[N], tn[N][26], len[N], la = 1, tt = 1; void extd(int xx, int i) { int np = ++tt, p = la; len[np] = len[p] + 1, inst(rt[np] = ++tz, i), la = np; while (p && !tn[p][xx]) tn[p][xx] = np, p = fa[p]; if (!p) fa[np] = 1; else { int q = tn[p][xx]; if (len[q] == len[p] + 1) fa[np] = q; else { int nq = ++tt; fa[nq] = fa[q], len[nq] = len[p] + 1, memcpy(tn[nq], tn[q], sizeof(int) * 26); fa[np] = fa[q] = nq; while (p && tn[p][xx] == q) tn[p][xx] = nq, p = fa[p]; } } } void dfs1(int x) { for (int i = hd[x]; i; i = nt[i]) { int y = to[i]; dfs1(y), rt[x] = merg(rt[x], rt[y]); } } void dfs2(int x) { if (x > 1) { if (fa[x] == 1 || quer(rt[g[x]], 1, n, s[rt[x]] - len[x] + len[g[x]], s[rt[x]] - 1) > 0) ++f[x], g[x] = x; } ans = max(ans, f[x]); for (int i = hd[x]; i; i = nt[i]) { int y = to[i]; f[y] = f[x], g[y] = g[x], dfs2(y); } } int main() { n = rd(), scanf( %s , cc + 1); s[0] = -(1 << 25); for (int i = 1; i <= n; ++i) extd(cc[i] - a , i); for (int i = 2; i <= tt; ++i) adde(fa[i], i); dfs1(1); dfs2(1); printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1 << 29; int main() { ios::sync_with_stdio(0); int n; cin >> n; int a[n]; for (int i = 0; i < (n); i++) cin >> a[i]; int b[n]; for (int i = 0; i < (n); i++) cin >> b[i]; set<int> rem; int top = 0; for (int i = 0; i < (n); i++) { int curr = 0; if (rem.find(b[i]) != rem.end()) { cout << curr << ; continue; } while (top < n) { if (a[top + curr] != b[i]) { rem.insert(a[top + curr]); ++curr; } else { rem.insert(a[top + curr]); break; } } top += curr + 1; cout << curr + 1 << ; } cout << endl; return 0; } |
#include <bits/stdc++.h> int main() { int a[5], maxx = -1, k; for (int i = 0; i < 4; i++) { scanf( %d , &a[i]); if (maxx < a[i]) { maxx = a[i]; k = i; } } for (int i = 0; i < 4; i++) { if (k == i) continue; printf( %d , maxx - a[i]); } printf( n ); } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin>>t; while(t--) { int x,y; cin>>x>>y; int count =0; while(x>0&&y>0) { x--; y--; count+=2; } if(x!=0||y!=0) count =count+2*max(x,y)-1; cout<<count<< n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long n, mod = 1000000007, a[26], f[1000] = {}, l[1000] = {}, g[1000]; string s; cin >> n >> s; for (int i = 0; i < 26; i++) cin >> a[i]; f[0] = l[0] = g[0] = 1; for (int i = 1; i < n; i++) { long long z = i, b[26] = {}; while (z >= 0) { b[s[z] - a ] = 1; long long flag = 1; for (int j = 0; j < 26; j++) if (b[j] && a[j] < i - z + 1) { flag = 0; break; } if (!flag) break; z--; } g[i] = i + 1; for (long long j = z + 1; j <= i; j++) { f[i] = (f[i] + (j ? f[j - 1] : 1)) % mod; l[i] = max({l[i], i - j + 1, (j ? l[j - 1] : 0)}); g[i] = min(g[i], 1 + (j ? g[j - 1] : 0)); } } cout << f[n - 1] << endl << l[n - 1] << endl << g[n - 1]; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n; while (scanf( %lld , &n) != EOF) { long long tpn = n; long long ninenum = 0; long long tezheng; while (tpn) { tpn /= 10; ninenum++; } ninenum--; long long sum = 1; while (ninenum) { sum = sum * 10; ninenum--; } long long fivesum = 5 * sum; if (fivesum <= n) { tezheng = fivesum; sum = sum * 10; } else { tezheng = fivesum / 10; } long long ans = 0; if (tezheng != 0) { long long yunum = n % sum; long long geshu = n / sum; if (yunum <= tezheng - 1) { ans = yunum * (geshu + 1) * (geshu) + (tezheng - 1 - yunum) * geshu * geshu; ans += geshu * geshu; } else { if (yunum == sum - 1) { ans += (yunum - 1 - tezheng + 1) * (geshu + 1) * (geshu + 1) + (tezheng - 1 - (yunum - 1 - tezheng + 1)) * (geshu + 1) * (geshu); ans += geshu * (geshu + 1); } else { ans += (yunum - tezheng + 1) * (geshu + 1) * (geshu + 1) + (tezheng - 1 - (yunum - tezheng + 1)) * (geshu + 1) * (geshu); ans += geshu * geshu; } } } else { ans = n * (n - 1) / 2; } printf( %lld n , ans); } } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const long long INF = 1e18; const long long MAX = 100100; void pre() {} void solve() { long long n; cin >> n; vector<long long> p(n), c(n); for (long long i = 0; i < n; ++i) cin >> p[i] >> c[i]; for (long long i = 0; i < n; ++i) { if (c[i] > p[i]) { cout << NO << n ; return; } } for (long long i = 1; i < n; ++i) { if (p[i] < p[i - 1]) { cout << NO << n ; return; } if (c[i] < c[i - 1]) { cout << NO << n ; return; } if ((p[i] - p[i - 1]) < (c[i] - c[i - 1])) { cout << NO << n ; return; } } cout << YES << n ; } signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); pre(); long long t = 1; cin >> t; for (long long CASE = 1; CASE <= t; ++CASE) { solve(); } {}; return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( O2 ) #pragma GCC optimize( unroll-loops ) using namespace std; long long power(long long a, long long b, long long md) { return (!b ? 1 : (b & 1 ? a * power(a * a % md, b / 2, md) % md : power(a * a % md, b / 2, md) % md)); } const int xn = 2e2 + 10; const int xm = -20 + 10; const int sq = 300; const int inf = 1e9 + 10; const long long INF = 1e18 + 10; const int mod = 1e6 + 7; const int base = 257; const int SIG = 26; struct matrix { long long n, m, a[xn][xn]; matrix(int n1, int m1, long long x = -INF) { n = n1; m = m1; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) a[i][j] = x; } matrix operator*(const matrix &t) { matrix r = matrix(n, t.m); for (int i = 0; i < n; i++) for (int j = 0; j < t.m; j++) for (int k = 0; k < m; k++) r.a[i][j] = max(r.a[i][j], a[i][k] + t.a[k][j]); return r; } matrix operator=(const int &t) { for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) a[i][j] = t; } }; matrix Pow(matrix a, long long b) { matrix res = matrix(a.n, a.m); for (int i = 0; i < a.n; i++) res.a[i][i] = 0; for (; b; b = b >> 1) { if (b & 1) res = res * a; a = a * a; } return res; } int n, a[xn], F[xn], nxt[SIG][xn]; int ahoq[xn], ptr, ps[xn], par[xn]; long long l, ans; string S; vector<int> vec[xn], adj[xn]; void build_aho() { int L = 0, R = 0; for (int i = 0; i < SIG; ++i) if (nxt[i][0]) ahoq[R++] = nxt[i][0]; while (L < R) { int v = ahoq[L++]; adj[F[v]].push_back(v); for (int i = 0; i < SIG; ++i) { if (nxt[i][v]) F[nxt[i][v]] = nxt[i][F[v]], ahoq[R++] = nxt[i][v]; else nxt[i][v] = nxt[i][F[v]]; } } } void DFS(int v) { vec[v].push_back(v); for (int u : adj[v]) { ps[u] += ps[v]; DFS(u); for (int x : vec[u]) vec[v].push_back(x); } } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; cin >> n >> l; for (int i = 1; i <= n; ++i) cin >> a[i]; for (int i = 1; i <= n; ++i) { cin >> S; int v = 0; for (int j = 0; j < int(S.size()); ++j) { int c = S[j] - a ; if (!nxt[c][v]) nxt[c][v] = ++ptr; par[nxt[c][v]] = v; v = nxt[c][v]; } ps[v] += a[i]; } matrix m(ptr + 1, 1), c(ptr + 1, ptr + 1); build_aho(), DFS(0); for (int i = 0; i <= ptr; ++i) for (int v : vec[par[i]]) c.a[i][v] = ps[i]; m.a[0][0] = 0; m = Pow(c, l) * m; for (int i = 0; i <= ptr; ++i) ans = max(ans, m.a[i][0]); cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (b == 0LL) return a; return gcd(b, a % b); } long long bigmod(long long a, long long b, long long mod) { if (b == 0LL) return 1LL; long long sq = bigmod(a, b / 2LL, mod); sq = (sq * sq) % mod; if (b & 1LL) return (sq * (a % mod)) % mod; return sq; } vector<int> primes; vector<int> sieve(const int n) { vector<int> primes(n + 1, 0); primes[1] = 1; for (int p = 2; p * p <= n; p++) { if (!primes[p]) { for (int i = p * p; i <= n; i += p) primes[i] = p; } } for (int i = 2; i <= n; i++) if (!primes[i]) primes[i] = i; return primes; } map<int, int> getDivs(int x) { map<int, int> divs; while (x > 1) { int div = primes[x]; int cnt = 0; while (x % div == 0) { x /= div; cnt++; } divs[div] = cnt; } return divs; } void solve() { int n; cin >> n; vector<int> a(n); vector<int> cm(n + 1, 100000000); for (auto &x : (a)) { cin >> x; } for (int i = n - 1; i >= 0; i--) { cm[i] = min(cm[i + 1], a[i]); } int ans = 0; for (int i = 1; i < n; i++) { if (cm[i] < a[i - 1]) ans++; } cout << ans << endl; } int main() { int t = 1; cin >> t; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100 * 1000; int n; long long dp[2][N]; int c[N], a[N]; bool read() { if (!(cin >> n)) return false; for (int i = 0; i < int(n); ++i) { cin >> a[i]; c[i] = a[i]; } return true; } void upd(long long &a, long long b) { if (a == -1) a = b; a = min(a, b); } void solve() { int t = 0; sort(c, c + n); memset(dp, -1, sizeof dp); dp[t][0] = 0; for (int i = 0; i < int(n); ++i) { memset(dp[!t], -1, sizeof(dp[!t])); long long mn = -1; for (int j = 0; j < int(n); ++j) { if (dp[t][j] != -1) upd(mn, dp[t][j]); upd(dp[!t][j], mn + abs(a[i] - c[j])); } t = !t; } long long res = -1; for (int i = 0; i < int(n); ++i) if (dp[t][i] != -1) upd(res, dp[t][i]); cout << res << endl; } int main() { while (read()) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long dp[55][2]; int main() { long long X, Y; scanf( %lld %lld , &Y, &X); dp[51][0] = 1; for (int i = 50; i >= 0; i--) { for (int flag = 0; flag <= 1; flag++) { bool x = (X >> i) & 1, y = (Y >> i) & 1; if (x) dp[i][flag] += dp[i + 1][(flag + 1) / 2] * (flag != y) * 2; else { dp[i][flag] += dp[i + 1][(flag + 2) / 2] * (flag == y); dp[i][flag] += dp[i + 1][0] * (flag == y); } } } if (!X) assert(dp[0][0] - (X == Y) * 2 == (!(Y & 1))); printf( %lld n , dp[0][0] - (X == Y) * 2); return 0; } |
#include <bits/stdc++.h> using namespace std; int a[120][120] = {0}, n; int main() { int i, j, k; scanf( %d , &n); if (n == 1) { puts( 0 ); return 0; } if (n == 2) { puts( 1 n1 2 ); return 0; } if (n == 3) { puts( 2 n1 2 n2 3 ); return 0; } int x = n / 2; int y = n - x; for (i = 0; i < x; i++) { for (j = 0; j < x; j++) { a[i][j] = -1; } } for (i = x; i < n; i++) { for (j = x; j < n; j++) { a[i][j] = -1; } } for (i = 0; i < n; i++) { for (j = 0; j < n; j++) { if (!a[i][j]) a[i][j] = 1; } } for (i = 0; i < n; i++) { for (j = 0; j < n; j++) { if (a[i][j] == -1) a[i][j] = 0; } } int ans = 0; for (i = 0; i < n; i++) { for (j = 0; j < n; j++) { ans += a[i][j]; } } ans /= 2; printf( %d n , ans); for (i = 0; i < n; i++) { for (j = i + 1; j < n; j++) { if (a[i][j]) { printf( %d %d n , i + 1, j + 1); } } } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> constexpr T inf = numeric_limits<T>::max() / 2; long long calc(long long border, const vector<int> &h, const vector<long long> &acc, const vector<long long> &acc_rev, int a, int r, int m) { int n = h.size(); if (border > h[n - 1] || border < h[0]) return inf<long long>; int pos = -1; for (int i = 0; (i) < (int)(n); (i)++) { if (h[i] <= border && (i == n - 1 || h[i + 1] > border)) { pos = i; break; } } assert(pos != -1); long long x = border * (pos + 1) - acc[pos]; long long y = (pos == n - 1 ? 0 : acc_rev[pos + 1] - border * (n - pos - 1)); if (y >= x) { return (long long)(y - x) * r + (long long)x * m; } else { return (long long)(x - y) * a + (long long)y * m; } } int main() { int n, a, r, m; scanf( %d%d%d%d , &n, &a, &r, &m); m = min(m, a + r); vector<int> h(n); for (int i = 0; (i) < (int)(n); (i)++) { scanf( %d , &h[i]); } sort(h.begin(), h.end()); vector<long long> acc(n), acc_rev(n); acc[0] = h[0]; for (int i = 0; (i) < (int)(n); (i)++) if (i) acc[i] = acc[i - 1] + h[i]; acc_rev[n - 1] = h[n - 1]; for (int i = n - 2; i >= 0; i--) acc_rev[i] = acc_rev[i + 1] + h[i]; long long lb = h[0], ub = h[n - 1] + 1; while (ub - lb > 3) { long long ml = (2 * lb + ub) / 3; long long mr = (lb + 2 * ub) / 3; long long cl = calc(ml, h, acc, acc_rev, a, r, m); long long cr = calc(mr, h, acc, acc_rev, a, r, m); if (cl < cr) { ub = mr; } else { lb = ml; } } long long ans = inf<long long>; for (int p = lb - 3; p <= lb + 10; p++) { ans = min(ans, calc(p, h, acc, acc_rev, a, r, m)); } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> int main() { int n, flag = 0; while (scanf( %d , &n) != EOF) { int a[n]; for (int i = 0; i < n; i++) { scanf( %d , &a[i]); if (a[i] == 1) { flag = 1; } } if (flag == 1) printf( -1 n ); else printf( 1 n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long w, m; cin >> w >> m; vector<int> f; while (m) { f.push_back(m % w); m /= w; } f.push_back(0); f.push_back(0); reverse(f.begin(), f.end()); for (int i = f.size() - 1; i >= 0; i--) { if (i > 1) f[i - 1] += f[i] / w; f[i] %= w; if (f[i] == 0) continue; if (f[i] == 1) continue; if (f[i] == w - 1) { f[i - 1]++; continue; } cout << NO ; return 0; } cout << YES ; } |
#include <bits/stdc++.h> using namespace std; int n, a[211111]; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } long long l = 0; long long r = 0; long long suml = 0; long long sumr = 0; for (int i = 0; i < n; i++) { if (a[i] == 1) { r++; } if (a[i] == 0) { suml += r; } } for (int i = n - 1; i >= 0; i--) { if (a[i] == 0) { l++; } if (a[i] == 1) { sumr += l; } } cout << min(sumr, suml); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000; int from[MAXN + 5]; void Gauss(int n, int d, double a[][MAXN + 5], double *Ans) { for (int i = 1; i <= n; i++) from[i] = i; for (int i = 1; i <= n; i++) { if (!a[i][i]) for (int j = i + 1; j <= min(n, i + d); j++) if (a[i][j]) { for (int k = max(1, i - d); k <= min(n, i + d); k++) swap(a[k][i], a[k][j]); swap(from[i], from[j]); break; } for (int j = i + 1; j <= min(n, i + d); j++) { double div = a[j][i] / a[i][i]; for (int k = i; k <= min(n, i + d); k++) a[j][k] -= a[i][k] * div; a[j][n + 1] -= a[i][n + 1] * div; } } for (int i = n; i >= 1; i--) { Ans[from[i]] = a[i][n + 1]; for (int j = i + 1; j <= min(i + d, n); j++) Ans[from[i]] -= Ans[from[j]] * a[i][j]; Ans[from[i]] /= a[i][i]; } } int n, m, x, y; double a[MAXN + 5][MAXN + 5], Ans[MAXN + 5][MAXN + 5]; int main() { scanf( %d %d %d %d , &n, &m, &x, &y); if (m == 1) { printf( %.4f n , 2.0 * (n - x)); return 0; } for (int i = n - 1; i >= 1; i--) { a[1][1] = 2.0 / 3; a[1][2] = -1.0 / 3; a[1][m + 1] = 1.0 / 3 * Ans[i + 1][1] + 1; for (int j = 2; j <= m - 1; j++) { a[j][j - 1] = -1.0 / 4; a[j][j] = 3.0 / 4; a[j][j + 1] = -1.0 / 4; a[j][m + 1] = 1.0 / 4 * Ans[i + 1][j] + 1; } a[m][m - 1] = -1.0 / 3; a[m][m] = 2.0 / 3; a[m][m + 1] = 1.0 / 3 * Ans[i + 1][m] + 1; Gauss(m, 1, a, Ans[i]); } printf( %.4f n , Ans[x][y]); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 6e3; const int M = 2 * 5e3 + 2; int n, m; int G[N], H[N]; int q[N], qf, qb; int dG[N][N], bG[N][3], szG[N]; int dH[N][N], bH[N][3], szH[N]; int ansv[4], aux[6], as; int to[M], nx[M], es; void calculate(int* ad, int d[][N], int b[][3], int sz[N]) { for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) d[i][j] = n << 1; d[i][n] = -N; d[i][i] = 0; qf = qb = 0; q[qb++] = i; while (qb - qf > 0) { int j = q[qf++]; for (int e = ad[j]; e; e = nx[e]) if (d[i][to[e]] > d[i][j] + 1) { d[i][to[e]] = d[i][j] + 1; q[qb++] = to[e]; } } int k = 0; for (int j = qf - 1; j && k < 3; --j) b[i][k++] = q[j]; sz[i] = k; } } int main() { scanf( %d%d , &n, &m); for (int i = 0; i < m; i++) { int j, k; scanf( %d%d , &j, &k); --j; --k; dG[j][k] = 1; } es = 1; for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (dG[i][j]) { to[es] = j; nx[es] = G[i]; G[i] = es++; to[es] = i; nx[es] = H[j]; H[j] = es++; } calculate(G, dG, bG, szG); calculate(H, dH, bH, szH); for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) { if (dG[i][j] == (n << 1)) dG[i][j] = -N; if (dH[i][j] == (n << 1)) dH[i][j] = -N; } int ans = 0; for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (i != j) { for (int _i = 0; _i < szH[i]; _i++) for (int _j = 0; _j < szG[j]; _j++) { int k = bH[i][_i], l = bG[j][_j]; if (k == l || k == j || i == l) continue; if (dH[i][k] + dG[i][j] + dG[j][l] > ans) { ans = dH[i][k] + dG[i][j] + dG[j][l]; ansv[0] = k, ansv[1] = i, ansv[2] = j, ansv[3] = l; } } } for (int i = 0; i < 4; i++) printf( %d%c , 1 + ansv[i], n [i == 3]); } |
#include <bits/stdc++.h> using namespace std; long long n; pair<long long, long long> loc[2001]; long long cp[2001]; long long cw[2001]; pair<long long, pair<long long, long long> > road[4000001]; long long ct = 0; long long val[2001]; long long ans = 0; long long ansleft; long long ansr = 0; bool cs[4000001]; struct node { long long r, f; } opt[100001]; long long fd(long long x) { if (x != opt[x].f) opt[x].f = fd(opt[x].f); return opt[x].f; } void mdf(long long x, long long y) { x = fd(x), y = fd(y); if (x == y) return; if (opt[x].r < opt[y].r) opt[x].f = y, opt[y].r += opt[x].r; else opt[y].f = x, opt[x].r += opt[y].r; } long long dis(long long x, long long y) { return abs(loc[x].first - loc[y].first) + abs(loc[x].second - loc[y].second); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long i, j; for (long long i = 1; i <= 100000; i++) opt[i].f = i, opt[i].r = 1; cin >> n, ansleft = n; for (i = 1; i <= n; i++) cin >> loc[i].first >> loc[i].second; for (i = 1; i <= n; i++) cin >> cp[i]; for (i = 1; i <= n; i++) cin >> cw[i]; for (i = 1; i <= n; i++) val[i] = cp[i]; for (i = 1; i <= n; i++) ans += cp[i]; for (i = 1; i <= n; i++) for (j = i + 1; j <= n; j++) road[++ct] = pair<long long, pair<long long, long long> >( dis(i, j) * (cw[i] + cw[j]), pair<long long, long long>(i, j)); sort(road + 1, road + ct + 1); for (i = 1; i <= ct; i++) { pair<long long, pair<long long, long long> > f = road[i]; long long aa = fd(f.second.first), bb = fd(f.second.second); if (aa != bb && f.first < max(val[aa], val[bb])) { mdf(aa, bb); long long father = fd(aa); ans -= max(val[aa], val[bb]) - f.first; val[father] = min(val[aa], val[bb]); ansleft--, ansr++; cs[i] = true; } } cout << ans << endl; cout << ansleft << endl; for (i = 1; i <= n; i++) { if (cp[i] == val[fd(i)]) cout << i << , val[fd(i)] = -1; } cout << endl; cout << ansr << endl; for (i = 1; i <= ct; i++) if (cs[i]) cout << road[i].second.first << << road[i].second.second << endl; return 0; } |
#include <bits/stdc++.h> #pragma GCC target( avx2 ) #pragma GCC optimize( unroll-loops ) #pragma GCC optimize( Ofast ) constexpr long long INF = 200000000000000001LL; constexpr int INF32 = 2100000001; size_t seed42 = std::chrono::system_clock::now().time_since_epoch().count(); std::mt19937 rng(seed42); std::uniform_int_distribution<int> unidistrib; int randint() { return unidistrib(rng); } using namespace std; unsigned long long modulo = 998244353; int modulo32 = 998244353; unsigned long long poww(unsigned long long x, unsigned long long n) { if (n == 0) return 1; unsigned long long answ = poww(x, n / 2); answ = (answ * answ) % modulo; if (n % 2) answ = (answ * x) % modulo; return answ; } pair<int, int> operator+(const pair<int, int>& lhs, pair<int, int>& rhs) { return {lhs.first + rhs.first, lhs.second + rhs.second}; } template <class T> ostream& operator<<(ostream& lhs, pair<T, T>& rhs) { return (lhs << rhs.first << : << rhs.second); } struct Node { Node(int p, int a, int c) : p(p), a(a), c(c), p2(1, p) {} int p; int a; int c; vector<int> p2; }; int main() { ios::sync_with_stdio(false); std::cin.tie(0); int n, m, t; cin >> n >> m; string s; cin >> s; map<string, vector<int>> dp; vector<string> ss = { abc , acb , bac , bca , cab , cba }; for (auto mask : ss) { dp[mask] = vector<int>(n); for (int i = 0; i < n; ++i) { dp[mask][i] = (i > 0 ? dp[mask][i - 1] : 0) + (s[i] != mask[i % 3]); } } while (m--) { int l, r; cin >> l >> r; --r; --l; int minn = INF32; for (auto mask : ss) { minn = min(minn, dp[mask][r] - (l > 0 ? dp[mask][l - 1] : 0)); } cout << minn << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int dx[] = {0, 1, 0, -1}; int dy[] = {1, 0, -1, 0}; int dp[1005][1005]; bool vis[1005][1005]; int sx, sy, x, y; vector<string> v; bool valid(int xx, int yy) { if (xx >= 0 && yy >= 0 && xx < x && yy < y && v[xx][yy] != * ) return 1; return 0; } int bfs() { int wx, wy, ans = 0; vector<pair<int, int> > vaa; queue<pair<int, int> > q; q.push(make_pair(sx, sy)); vis[sx][sy] = 1; while (!q.empty()) { sx = q.front().first; sy = q.front().second; vaa.push_back(make_pair(sx, sy)); q.pop(); for (int i = 0; i < 4; i++) { wx = sx + dx[i]; wy = sy + dy[i]; if (!valid(wx, wy)) ans++; if (valid(wx, wy) && !vis[wx][wy]) { vis[wx][wy] = 1; q.push(pair<int, int>(wx, wy)); } } } for (int i = 0; i < vaa.size(); i++) dp[vaa[i].first][vaa[i].second] = ans; return ans; } int main() { memset(dp, -1, sizeof(dp)); for (int i = 0; i < 1005; i++) for (int j = 0; j < 1005; j++) vis[i][j] = 0; int t; string s; cin >> x >> y >> t; for (int i = 0; i < x; i++) { cin >> s; v.push_back(s); } while (t--) { cin >> sx >> sy; sx--; sy--; if (dp[sx][sy] != -1) printf( %d n , dp[sx][sy]); else printf( %d n , bfs()); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100001; int h, t; set<int> G[N]; vector<int> g[N]; bool check(int gr, int ji) { int sw = 0; int com = 0; if (((int)g[gr].size()) > ((int)g[ji].size())) swap(gr, ji), sw = 1; for (int i = 0; i < ((int)g[gr].size()); i++) com += G[ji].count(g[gr][i]); if (sw) swap(gr, ji); int l = ((int)g[gr].size()) - 1 - com; int r = ((int)g[ji].size()) - 1 - com; if (h + t > l + r + com || h > l + com || t > r + com) return 0; vector<int> f, m, s; for (int i = 0; i < ((int)g[gr].size()); i++) { int to = g[gr][i]; if (to == ji) continue; if (!G[ji].count(to)) f.push_back(to); else m.push_back(to); } for (int i = 0; i < ((int)g[ji].size()); i++) { int to = g[ji][i]; if (to == gr) continue; if (!G[gr].count(g[ji][i])) s.push_back(to); } int cur = 0; while (((int)f.size()) < h) f.push_back(m[cur++]); while (((int)s.size()) < t) s.push_back(m[cur++]); puts( YES ); printf( %d %d n , gr + 1, ji + 1); for (int i = 0; i < h; i++) printf( %d , f[i] + 1); printf( n ); for (int i = 0; i < t; i++) printf( %d , s[i] + 1); printf( n ); return 1; } int main() { int n, m; scanf( %d %d %d %d , &n, &m, &h, &t); for (int i = 0; i < m; i++) { int s, e; scanf( %d %d , &s, &e); --s; --e; g[s].push_back(e); g[e].push_back(s); G[s].insert(e); G[e].insert(s); } for (int i = 0; i < n; i++) { if (((int)g[i].size()) < h) continue; for (int j = 0; j < ((int)g[i].size()); j++) { int ji = g[i][j]; if (((int)g[ji].size()) < t) continue; if (check(i, ji)) return 0; } } puts( NO ); return 0; } |
#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; using ld = long double; template <class T> using Table = vector<vector<T>>; const ld eps = 1e-9; template <class S, class T> ostream &operator<<(ostream &os, const pair<S, T> v) { os << ( << v.first << , << v.second << ) ; return os; } template <class T> ostream &operator<<(ostream &os, const vector<T> &v) { for (int i = 0; i < v.size(); i++) { if (i > 0) { os << ; } os << v[i]; } return os; } template <class T> ostream &operator<<(ostream &os, const vector<vector<T>> &v) { for (int i = 0; i < v.size(); i++) { if (i > 0) { os << endl; } os << v[i]; } return os; } template <class T> ostream &operator<<(ostream &os, const vector<set<T>> &v) { for (int i = 0; i < v.size(); i++) { if (i > 0) { os << endl; } os << v[i]; } return os; } template <class T> ostream &operator<<(ostream &os, const map<T, T> &v) { int i = 0; for (auto it : v) { if (i > 0) { os << ; } os << it.first << << it.second; i++; } return os; } using ll = long long; const int mod = 998244353; struct Mod { public: int num; Mod() : Mod(0) { ; } Mod(long long int n) : num((n % mod + mod) % mod) { static_assert(mod < INT_MAX / 2, mod is too big, please make num long long int from int ); } Mod(int n) : Mod(static_cast<long long int>(n)) { ; } operator int() { return num; } }; Mod operator+(const Mod a, const Mod b) { return Mod((a.num + b.num) % mod); } Mod operator+(const long long int a, const Mod b) { return Mod(a) + b; } Mod operator+(const Mod a, const long long int b) { return b + a; } Mod operator++(Mod &a) { return a + Mod(1); } Mod operator-(const Mod a, const Mod b) { return Mod((mod + a.num - b.num) % mod); } Mod operator-(const long long int a, const Mod b) { return Mod(a) - b; } Mod operator--(Mod &a) { return a - Mod(1); } Mod operator*(const Mod a, const Mod b) { return Mod(((long long)a.num * b.num) % mod); } Mod operator*(const long long int a, const Mod b) { return Mod(a) * b; } Mod operator*(const Mod a, const long long int b) { return Mod(b) * a; } Mod operator*(const Mod a, const int b) { return Mod(b) * a; } Mod operator+=(Mod &a, const Mod b) { return a = a + b; } Mod operator+=(long long int &a, const Mod b) { return a = a + b; } Mod operator-=(Mod &a, const Mod b) { return a = a - b; } Mod operator-=(long long int &a, const Mod b) { return a = a - b; } Mod operator*=(Mod &a, const Mod b) { return a = a * b; } Mod operator*=(long long int &a, const Mod b) { return a = a * b; } Mod operator*=(Mod &a, const long long int &b) { return a = a * b; } Mod operator^(const Mod a, const int n) { if (n == 0) return Mod(1); Mod res = (a * a) ^ (n / 2); if (n % 2) res = res * a; return res; } Mod mod_pow(const Mod a, const long long n) { if (n == 0) return Mod(1); Mod res = mod_pow((a * a), (n / 2)); if (n % 2) res = res * a; return res; } Mod inv(const Mod a) { return a ^ (mod - 2); } Mod operator/(const Mod a, const Mod b) { assert(b.num != 0); return a * inv(b); } Mod operator/(const long long int a, const Mod b) { return Mod(a) / b; } Mod operator/=(Mod &a, const Mod b) { return a = a / b; } Mod fact[1024000], factinv[1024000]; void init(const int amax = 1024000) { fact[0] = Mod(1); factinv[0] = 1; for (int i = 0; i < amax - 1; ++i) { fact[i + 1] = fact[i] * Mod(i + 1); factinv[i + 1] = factinv[i] / Mod(i + 1); } } Mod comb(const int a, const int b) { return fact[a] * factinv[b] * factinv[a - b]; } using Value = pair<Mod, Mod>; const Value ini = make_pair(Mod(1), Mod(0)); Value connect(Value al, const Value ar) { return make_pair(al.first * ar.first, al.second * ar.first + ar.second); } Value dat[800001]; struct segtree { int N; segtree() {} segtree(int n) { N = 1; while (N < n) N *= 2; for (int x = 0; x < N; ++x) { { dat[x + N - 1] = ini; } } for (int x = N - 2; x >= 0; --x) { dat[x] = connect(dat[x * 2 + 1], dat[x * 2 + 2]); } } void update(int k, const Value &a) { k += N - 1; dat[k] = a; while (k > 0) { k = (k - 1) >> 1; dat[k] = connect(dat[k * 2 + 1], dat[k * 2 + 2]); } } Value query(int a, int b) { return query(a, b, 0, 0, N); } Value query(int a, int b, int k, int l, int r) { if (r <= a or b <= l) return ini; if (a <= l and r <= b) return dat[k]; const int m = (l + r) / 2; return connect(query(a, b, k * 2 + 1, l, m), query(a, b, k * 2 + 2, m, r)); } }; pair<Mod, Mod> dp[2010][2010]; int flag[2010][2010]; string st; pair<Mod, Mod> solve(int l, int r) { if (flag[l][r]) { return dp[l][r]; } flag[l][r] = true; if (l == r) { return dp[l][r] = make_pair(Mod(st[l] == ? ? 2 : 1), Mod(0)); } else if (l - 1 == r) { return dp[l][r] = make_pair(Mod(1), Mod(0)); } if (st[l] == ( ) { if (st[r] == ( ) { dp[l][r] = solve(l, r - 1); } else if (st[r] == ? ) { auto ap = solve(l + 1, r - 1); auto bp = solve(l, r - 1); dp[l][r] = make_pair(ap.first + bp.first, ap.second + bp.second + ap.first); } else { auto ap = solve(l + 1, r - 1); dp[l][r] = make_pair(ap.first, ap.second + ap.first); } } else if (st[l] == ) ) { dp[l][r] = solve(l + 1, r); } else { if (st[r] == ( ) { dp[l][r] = solve(l, r - 1); } else if (st[r] == ? ) { auto ap = solve(l + 1, r - 1); auto bp = solve(l, r - 1); auto cp = solve(l + 1, r); auto ep = solve(l + 1, r - 1); ap.second += ap.first; dp[l][r].first += ap.first + bp.first + cp.first - ep.first; dp[l][r].second += ap.second + bp.second + cp.second - ep.second; } else { auto ap = solve(l + 1, r - 1); ap.second += ap.first; auto bp = solve(l + 1, r); dp[l][r] = make_pair(ap.first + bp.first, ap.second + bp.second); } } return dp[l][r]; } int main() { ios::sync_with_stdio(false); cin >> st; auto answer = solve(0, int(st.size()) - 1); cout << answer.second << endl; return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:66777216 ) using namespace std; const int N = 1e6 + 7; int d[1024], k, ver[1024], ans[1024], num[1024]; map<pair<string, int>, int> M; map<string, bool> was; vector<vector<int> > v(1024); string name[1024]; bool comp(int a, int b) { if (name[a] < name[b]) { return true; } if (name[a] > name[b]) { return false; } if (ver[a] > ver[b]) { return true; } return false; } void calc() { for (int i = 1; i < k; i++) { d[i] = -1; } int l = 0, r = 1; vector<int> p; was[name[0]] = 1; for (int i = 0; i < k; i++) { p.clear(); for (int j = 0; j < k; j++) { if (d[j] == i) { for (int g = 0; g < v[j].size(); g++) { int to = v[j][g]; if (!was[name[to]] && num[to] == 0) { p.push_back(to); num[to] = 1; } } } } sort(p.begin(), p.end(), comp); for (int j = 0; j < p.size(); j++) { int to = p[j]; if (!was[name[to]]) { was[name[to]] = 1; ans[to] = 1; d[to] = i + 1; } } } set<pair<string, int> > S; for (int i = 0; i < k; i++) { if (ans[i]) { S.insert({name[i], ver[i]}); } } cout << S.size() << endl; while (S.size()) { cout << S.begin()->first << << S.begin()->second << endl; S.erase(S.begin()); } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; string s, ss; int c, m, cc; for (int i = 0; i < n; i++) { cin >> s >> c; if (M[{s, c}] == 0) { name[k] = s; ver[k] = c; M[{s, c}] = k++; } cin >> m; for (int j = 0; j < m; j++) { cin >> ss >> cc; if (M[{ss, cc}] == 0) { name[k] = ss; ver[k] = cc; M[{ss, cc}] = k++; } v[M[{s, c}]].push_back(M[{ss, cc}]); } } calc(); cin >> n; return 0; } |
#include <bits/stdc++.h> using namespace std; char s[2002000], t[2002000]; int n; int a = 0, b = 0, c = 0, d = 0; int main() { cin >> n >> s >> t; for (int i = 0; i < 2 * n; i++) { if (s[i] == 1 && t[i] == 1 ) a++; else if (s[i] == 1 ) b++; else if (t[i] == 1 ) c++; else d++; } int ans1 = 0, ans2 = 0; int m = 2 * n; while (m) { if (a) ans1 += 1, a--; else if (b) ans1 += 1, b--; else if (c) c--; else d--; if (a) ans2++, a--; else if (c) ans2++, c--; else if (b) b--; else d--; m -= 2; } if (ans1 > ans2) puts( First ); else if (ans1 < ans2) puts( Second ); else puts( Draw ); return 0; } |
#include <bits/stdc++.h> using namespace std; bool visited[300000]; long long int parent[300000]; void initialise() { for (long long int i = 0; i < 300000; i++) { visited[i] = false; parent[i] = i; } } pair<long long int, long long int> dfs( vector<pair<long long int, long long int>> adj[], long long int A[], long long int v, long long int i) { visited[i] = true; pair<long long int, long long int> r, s; long long int j, k = adj[i].size(); long long int d = 0, f = 0; r.first = A[i]; for (j = 0; j < k; j++) { if (!visited[adj[i][j].first]) { s = dfs(adj, A, v, adj[i][j].first); r.first = max(r.first, s.first); r.first = max(r.first, d + s.second + adj[i][j].second + A[i]); d = max(d, s.second + adj[i][j].second); } } r.second = d + A[i]; return r; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int u, v, x, y, a, b, i, k, l, p, n, m, w, maxi = 0, ans; pair<long long int, long long int> j; cin >> v; vector<pair<long long int, long long int>> adj[v]; long long int A[v]; initialise(); for (i = 0; i < v; i++) { cin >> A[i]; } for (i = 0; i < v - 1; i++) { cin >> x >> y >> w; x--; y--; adj[x].push_back(make_pair(y, -w)); adj[y].push_back(make_pair(x, -w)); } j = dfs(adj, A, v, 0); cout << j.first; } |
#include <bits/stdc++.h> using namespace std; int q; int k; int main() { cin >> q; for (int i = 0; i < q; ++i) { cin >> k; if (k % 4 == 0) cout << (k / 4 <= 0 ? -1 : k / 4); if (k % 4 == 1) cout << (k / 4 - 1 <= 0 ? -1 : k / 4 - 1); if (k % 4 == 2) cout << (k / 4 <= 0 ? -1 : k / 4); if (k % 4 == 3) cout << (k / 4 - 2 <= 0 ? -1 : k / 4 - 1); cout << endl; } } |
#include <bits/stdc++.h> using namespace std; const int N = 2010; struct P { long long x, y; int id; bool operator<(P B) const { if (y != B.y) return y < B.y; return x < B.x; } } p[N], op; long long cross(P A, P B, P C) { return (A.x - B.x) * (C.y - B.y) - (C.x - B.x) * (A.y - B.y); } bool cmp(P A, P B) { return cross(A, op, B) < 0; } char a[N]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %lld%lld , &p[i].x, &p[i].y); p[i].id = i; } scanf( %s , a + 1); sort(p + 1, p + n + 1); op = p[1]; for (int i = 2; i < n; i++) { sort(p + i, p + n + 1, cmp); if (a[i - 1] == L ) swap(p[i], p[n]); op = p[i]; } for (int i = 1; i <= n; i++) { printf( %d , p[i].id); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> void printVector(std::vector<std::vector<T>> const &matrix) { for (std::vector<T> row : matrix) { for (T val : row) { std::cout << val; } std::cout << n ; } } static void solve() { int n; cin >> n; char D = D ; char star = * ; std::vector<std::vector<char>> matrix(n, std::vector<char>(n, star)); int mid = n / 2; int from = mid; int to = mid; for (int i = 0; i < n; i++) { for (int j = from; j <= to; j++) { matrix[i][j] = D; } if (i >= mid) { from++; to--; } else { from--; to++; } } printVector(matrix); } int main() { solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { printf( YES n ); int n, a, b, c, d; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d%d%d%d , &a, &b, &c, &d); if (!(a % 2) && !(b % 2)) printf( 3 n ); else if (!(a % 2) && (b % 2)) printf( 4 n ); else if ((a % 2) && !(b % 2)) printf( 2 n ); else printf( 1 n ); } return 0; } |
#include <bits/stdc++.h> int power(int x, int y) { int res = 1; x = x % 1000000007; while (y > 0) { if (y & 1) res = (res * x) % 1000000007; y = y >> 1; x = (x * x) % 1000000007; } return res; } int ncr(int n, int r) { int res = 1; if (r > n - r) r = n - r; for (int i = 0; i < r; i++) { res *= (n - i); res /= (i + 1); } return res; } int gcd(int a, int b) { if (a == 0) return b; return gcd(b % a, a); } int lcm(int a, int b) { return (a / gcd(a, b) * b); } int max(int a, int b) { int ans = a > b ? a : b; return ans; } using namespace std; int main() { unsigned long long int n; cin >> n; unsigned long long int a[n]; for (int i = 0; i < n; ++i) { cin >> a[i]; } for (int i = 1; i < n - 1; ++i) { if (a[i] < a[i - 1] && a[i] < a[i + 1]) { cout << NO ; return 0; } } cout << YES ; return 0; } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-6; long long sum[200005]; long long sum2[200005]; long long a[200005]; int n; int sgn(double x) { if (fabs(x) < eps) return 0; return x > 0 ? 1 : -1; } struct point { long long x, y; point(){}; point(long long x, long long y) : x(x), y(y){}; }; long long dot(point A, point B) { return A.x * B.x + A.y * B.y; } double getlv(point A, point B) { return 1.0 * (B.y - A.y) / (1.0 * (B.x - A.x)); } point stk[200005]; void init() { sum[0] = 0; sum2[0] = 0; for (int i = 1; i <= n; i++) { sum[i] = sum[i - 1] + a[i]; sum2[i] = sum2[i - 1] + a[i] * i; } } void Compute() { int top = 0; long long ans = 0; for (int i = 1; i <= n; i++) { point temp = point(i - 1, (i - 1) * sum[i - 1] - sum2[i - 1]); while (top > 1 && sgn(getlv(stk[top], temp) - getlv(stk[top - 1], stk[top])) > 0) top--; stk[++top] = temp; int l = 1; int r = top; point a = point(-sum[i], 1); while (l < r) { int m1 = l + (r - l) / 3; int m2 = r - (r - l) / 3; if (dot(a, stk[m1]) < dot(a, stk[m2])) l = m1 + 1; else r = m2 - 1; } ans = max(ans, sum2[i] + dot(a, stk[l])); } printf( %I64d n , ans); } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %I64d , &a[i]); init(); Compute(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string a; int b; cin >> b >> a; for (int i = 2; i <= b; i++) { if (b % i == 0) { reverse(a.begin(), a.begin() + i); } } cout << a; } |
#include <bits/stdc++.h> using namespace std; const int N = 300100; int arr[N]; #pragma warning(disable : 6031) #pragma warning(disable : 4996) int t, n; bool c1[N], c2[N]; int main() { scanf( %d , &t); while (t--) { scanf( %d , &n); bool f1 = 1, f2 = 1; bool f3 = 1; for (int i = 1; i <= n; i++) scanf( %d , arr + i); memset(c1, 0, sizeof c1); memset(c2, 0, sizeof c2); c1[1] = 1; for (int i = 2; i <= n; i++) { if (c1[i - 1] && arr[i] >= i - 1) { c1[i] = 1; } else { break; } } c2[n] = 1; for (int i = n - 1; i >= 1; i--) { if (c2[i + 1] && arr[i] >= n - i) { c2[i] = 1; } else break; } f1 = c1[n]; f2 = c2[1]; f3 = 0; for (int i = 1; i <= n; i++) { if (c1[i] && c2[i]) { f3 = 1; } } if (f1 || f2 || f3) puts( Yes ); else puts( No ); } return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using vi = vector<int>; using pii = pair<int, int>; using pll = pair<ll, ll>; template <typename T> using vec = vector<T>; template <typename T> using Prior = priority_queue<T>; template <typename T> using prior = priority_queue<T, vector<T>, greater<T>>; const int INF = 1e9; const int nINF = -1e9; const ll llINF = 4 * 1e18; const int MOD = 1e9 + 7; ll& pmod(ll& a, ll b) { a = (a + b) % MOD; return a; } ll& pmod(ll& a, ll b, ll c) { a = (a + b) % c; return a; } ll& mmod(ll& a, ll b) { a = (a - b + MOD) % MOD; return a; } ll& mmod(ll& a, ll b, ll c) { a = (a - b + c) % c; return a; } ll& tmod(ll& a, ll b) { a = (a * b) % MOD; return a; } ll mul(ll a, ll b) { return (a * b) % MOD; } ll mul(ll a, ll b, ll c) { return (a * b) % c; } ll POW(ll a, ll b) { ll res = 1; do { if (b % 2) tmod(res, a); tmod(a, a); } while (b >>= 1); return res; } ll FAC(ll a) { ll res = 1; for (int i = 1; i <= a; i++) tmod(res, i); return res; } template <typename T1, typename T2> ostream& operator<<(ostream& out, pair<T1, T2> a) { cout << a.first << << a.second; return out; } int main() { ios_base::sync_with_stdio(false), cin.tie(0); int n, d, t; cin >> n >> d >> t; if ((d == 1 and n != 2) or t < (d + 1) / 2) cout << -1; else { int tmp = 1, count = 2; for (int i = 0; i < t; i++) { cout << tmp << << count << n ; tmp = count; count++; } tmp = 1; for (int i = 0; i < d - t; i++) { cout << tmp << << count << n ; tmp = count; count++; } for (; count <= n; count++) cout << (t == d ? 2 : 1) << << count << n ; } } |
#include <bits/stdc++.h> using namespace std; const int INF = INT_MAX; const long long INFL = LLONG_MAX; const long double pi = acos(-1); const int MOD = 1e9 + 7; int ans; int N; inline long long mod(long long a) { a %= MOD; a += MOD; a %= MOD; return a; } inline int add(int a, int b) { return int(mod(mod(a) + mod(b))); } inline int mul(int a, int b) { return int(mod(mod(a) * 1LL * mod(b))); } map<int, int> DP[1 << 16]; int dfs(int n, int used, int seen) { if (n == N) { return 1; } if (DP[used].find(seen) != DP[used].end()) return DP[used][seen]; int& cnt = DP[used][seen]; for (int(i) = 0, j123 = N; (i) < j123; (i)++) { if (!((used >> i) & 1)) { int k = (n + i) % N; if (!((seen >> k) & 1)) { int r = dfs(n + 1, used | (1 << i), seen | (1 << k)); cnt = add(r, cnt); } } } return cnt; } int main() { ios_base::sync_with_stdio(0); cout.precision(15); cout << fixed; cout.tie(0); cin >> N; if (N == 15) { ans = 150347555; } else if (N & 1) { ans = dfs(0, 0, 0); for (int(i) = 1, j123 = N; (i) <= j123; (i)++) ans = mul(i, ans); } cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; const int N = (int)3e3; int p[N], n, m, deg[N], d[N]; char a[N][N]; vector<int> adj[N]; queue<int> q; bool visited[N]; int findSet(int u) { return p[u] == u ? p[u] : p[u] = findSet(p[u]); } void unionSet(int u, int v) { int x = findSet(u), y = findSet(v); p[x] = y; } int main() { scanf( %d %d n , &n, &m); for (int i = 1; i <= n; ++i) { scanf( %s n , a[i] + 1); p[i] = i; } for (int i = 1; i <= m; ++i) p[n + i] = n + i; for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) if (a[i][j] == = ) unionSet(i, n + j); for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) { if (a[i][j] == > ) adj[findSet(n + j)].push_back(findSet(i)), deg[findSet(i)]++; else if (a[i][j] == < ) adj[findSet(i)].push_back(findSet(n + j)), deg[findSet(n + j)]++; } bool ans = 1; for (int i = 1; i <= n + m; ++i) if (deg[findSet(i)] == 0 && !visited[findSet(i)]) { d[findSet(i)] = 1; visited[findSet(i)] = 1; q.push(findSet(i)); } while (!q.empty()) { int u = q.front(); q.pop(); for (int v : adj[u]) if (!visited[v]) { d[v] = max(d[v], d[u] + 1); deg[v]--; if (deg[v] == 0) { q.push(v); visited[v] = 1; } } } for (int i = 1; i <= n + m; ++i) if (!visited[findSet(i)]) { ans = 0; break; } if (ans) { printf( Yes n ); for (int i = 1; i <= n; ++i) printf( %d , d[findSet(i)]); printf( n ); for (int i = 1; i <= m; ++i) printf( %d , d[findSet(n + i)]); printf( n ); } else printf( No n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MaxN = 1e6; const long long Inf = 0x3f3f3f3f3f3f3f3f; const int inf = 0x3f3f3f3f; const long long mod = 1e9 + 7; const double eps = 1e-7; template <class T> inline void read(T &res) { char c; T flag = 1; while ((c = getchar()) < 0 || c > 9 ) if (c == - ) flag = -1; res = c - 0 ; while ((c = getchar()) >= 0 && c <= 9 ) res = res * 10 + c - 0 ; res *= flag; } long long dp[MaxN + 5][2], r1, r2, r3, d; long long a[MaxN + 5]; int n; int main() { memset(dp, 0x3f, sizeof dp); cin >> n >> r1 >> r2 >> r3 >> d; for (int i = 1; i <= n; ++i) cin >> a[i]; dp[1][0] = a[1] * r1 + r3; dp[1][1] = min((a[1] + 1) * r1, r2); for (int i = 1; i < n; ++i) { dp[i + 1][0] = min(dp[i + 1][0], dp[i][0] + d + a[i + 1] * r1 + r3); dp[i + 1][0] = min(dp[i + 1][0], dp[i][1] + d + (a[i + 1] + 1) * r1 + 2 * d + r1 + r1); dp[i + 1][0] = min(dp[i + 1][0], dp[i][1] + d + r2 + d + r1 + d + r1); dp[i + 1][0] = min(dp[i + 1][0], dp[i][1] + d + a[i + 1] * r1 + r3 + 2 * d + r1); dp[i + 1][1] = min(dp[i + 1][1], dp[i][0] + d + min((a[i + 1] + 1) * r1, r2)); dp[i + 1][1] = min(dp[i + 1][1], dp[i][1] + d + r2 + d + r1 + d); dp[i + 1][1] = min(dp[i + 1][1], dp[i][1] + d + 2 * d + r1 + (a[i + 1] + 1) * r1); if (i + 1 == n) { dp[i + 1][0] = min(dp[i + 1][0], dp[i][1] + d + a[i + 1] * r1 + r3 + d + r1); } } cout << dp[n][0] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int howfar(const std::string& s) { const int N = s.length(); int r(0); int d(1); for (int i = 0; i != N; ++i) { switch (s[i]) { case F : r += d; break; case T : d = -d; break; default: assert(0); } } return abs(r); } char invert(char c) { return c == T ? F : T ; } int solve(const std::string& s, int n) { const int N = s.length(); if (n > 0 && n % 2 == 0) { int rm(-10000); std::string sm; std::string s2 = s; for (int i1 = 0; i1 != N; ++i1) { for (int i2 = 0; i2 != N; ++i2) { s2[i1] = invert(s2[i1]); s2[i2] = invert(s2[i2]); const int r2 = howfar(s2); if (r2 > rm) { rm = r2; sm = s2; } s2[i2] = invert(s2[i2]); s2[i1] = invert(s2[i1]); } } return solve(sm, n - 2); } else if (n > 0) { int rm(-10000); std::string sm = s; for (int i = 0; i != N; ++i) { std::string s2 = s; s2[i] = invert(s2[i]); const int r = howfar(s2); if (r > rm) { rm = r; sm = s2; } } return solve(sm, n - 1); } return howfar(s); } int main(int argc, char* argv[]) { std::string s; cin >> s; int n; cin >> n; cout << solve(s, n) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, q; long long dp[15][(1 << 13) + 10][15]; struct E { int a, b; } e[20]; struct Lca { int a, b, c; } lca[100 + 10]; int num[(1 << 13) + 10]; bool il(int u, int state, int last) { for (int i = 1; i <= q; i++) { int xx = ((state >> lca[i].a - 1) & 1) + ((state >> lca[i].b - 1) & 1) + ((state >> lca[i].c - 1) & 1); if (xx == 2 && (u != lca[i].c || last == 0)) return true; else if (xx == 1 && ((state >> lca[i].c - 1) & 1) && last == 0) return true; else if (xx == 3 && (u == lca[i].a || u == lca[i].b) && u != lca[i].c) return true; } for (int i = 1; i <= m; i++) { int xx = ((state >> e[i].a - 1) & 1) + ((state >> e[i].b - 1) & 1); if (xx == 1 && u != e[i].a && u != e[i].b) return true; } return false; } long long dfs(int u, int state, int last) { if (dp[u][state][last] != -1) return dp[u][state][last]; dp[u][state][last] = 0; if (il(u, state, last)) return dp[u][state][last]; if (num[state] == 1) { return dp[u][state][last] = 1; } int full = state ^ (1 << u - 1); for (int x = full; x; x = (x - 1) & full) { int ok = true; int y = full ^ x; for (int i = 1; i <= m; i++) { if ((((x >> (e[i].a - 1)) & 1) && ((y >> (e[i].b - 1)) & 1)) || (((y >> (e[i].a - 1)) & 1) && ((x >> (e[i].b - 1)) & 1))) { ok = false; break; } } if (!ok) continue; for (int i = last + 1; i <= n; i++) if ((x >> (i - 1)) & 1) dp[u][state][last] += dfs(u, y | (1 << u - 1), i) * dfs(i, x, 0); } return dp[u][state][last]; } int main() { scanf( %d%d%d , &n, &m, &q); for (int i = 1; i <= m; i++) { scanf( %d%d , &e[i].a, &e[i].b); } for (int i = 1; i <= q; i++) { scanf( %d%d%d , &lca[i].a, &lca[i].b, &lca[i].c); } for (int i = 0; i < (1 << n); i++) { int x = i; while (x) { num[i] += x & 1; x >>= 1; } } memset(dp, -1, sizeof(dp)); printf( %I64d n , dfs(1, (1 << n) - 1, 0)); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 1e3 + 7; int n, m, tot, root[N]; long long p, ans; struct node { int ls, rs; long long sum; } t[N * 30]; void insert(int x, int &y, int l, int r, int v) { y = ++tot; t[y] = t[x]; t[y].sum++; if (l == r) return; int mid = (l + r) >> 1; if (v <= mid) insert(t[x].ls, t[y].ls, l, mid, v); else insert(t[x].rs, t[y].rs, mid + 1, r, v); } long long query(int l, int r, int x, int y, int L, int R) { if (L > R || l > r || L > r || R < l) return 0; if (l >= L && r <= R) return t[y].sum - t[x].sum; int mid = (l + r) >> 1; return query(l, mid, t[x].ls, t[y].ls, L, R) + query(mid + 1, r, t[x].rs, t[y].rs, L, R); } long long cal(long long x) { return x * (x - 1) / 2; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { int x; scanf( %d , &x); insert(root[i - 1], root[i], 1, n, x); } while (m--) { int l, r, u, v; scanf( %d%d%d%d , &l, &r, &u, &v); ans = (long long)n * (long long)(n - 1) / 2; p = query(1, n, root[0], root[n], 1, r - 1); ans -= cal(p); p = query(1, n, root[0], root[n], v + 1, n); ans -= cal(p); p = query(1, n, root[0], root[l - 1], 1, n); ans -= cal(p); p = query(1, n, root[u], root[n], 1, n); ans -= cal(p); p = query(1, n, root[0], root[l - 1], 1, r - 1); ans += cal(p); p = query(1, n, root[0], root[l - 1], v + 1, n); ans += cal(p); p = query(1, n, root[u], root[n], 1, r - 1); ans += cal(p); p = query(1, n, root[u], root[n], v + 1, n); ans += cal(p); printf( %I64d n , ans); } } |
#include <bits/stdc++.h> using namespace std; char _buf[100000], *_op(_buf), *_ed(_buf); inline int getint() { int _s = 0, _f = 1; char _ch = (_op == _ed && (_ed = (_op = _buf) + fread(_buf, 1, 100000, stdin), _op == _ed) ? EOF : *_op++); while (!( 0 <= _ch && _ch <= 9 )) (_ch == - ) && (_f = -1), _ch = (_op == _ed && (_ed = (_op = _buf) + fread(_buf, 1, 100000, stdin), _op == _ed) ? EOF : *_op++); while (( 0 <= _ch && _ch <= 9 )) _s = _s * 10 + _ch - 48, _ch = (_op == _ed && (_ed = (_op = _buf) + fread(_buf, 1, 100000, stdin), _op == _ed) ? EOF : *_op++); return _s * _f; } const int N = 2e5 + 1, mod = 1e9 + 7; inline void check(int& x) { x -= mod, x += x >> 31 & mod; } inline void cmax(int& x, int y) { if (x - y >> 31) x = y; } inline void cmin(int& x, int y) { if (y - x >> 31) x = y; } int n, m, ans; int Sx, Sy, Fx, Fy; int X[N], Y[N], tag[N]; int idx[N], idy[N], posx[N], posy[N]; inline int dis(int x, int y, int p) { return min(abs(X[p] - x), abs(Y[p] - y)); } priority_queue<pair<int, int> > q; inline void input() { n = getint(), m = getint(); Sx = getint(), Sy = getint(), Fx = getint(), Fy = getint(); for (int i = 1; i <= m; i++) X[i] = getint(), Y[i] = getint(); ans = abs(Fx - Sx) + abs(Fy - Sy); for (int i = 1; i <= m; i++) q.push(pair<int, int>(-dis(Sx, Sy, i), i)); } inline int cmpx(int x, int y) { return X[x] < X[y]; } inline int cmpy(int x, int y) { return Y[x] < Y[y]; } inline void init() { for (int i = 1; i <= m; i++) idx[i] = i; sort(idx + 1, idx + 1 + m, cmpx); for (int i = 1; i <= m; i++) posx[idx[i]] = i; for (int i = 1; i <= m; i++) idy[i] = i; sort(idy + 1, idy + 1 + m, cmpy); for (int i = 1; i <= m; i++) posy[idy[i]] = i; } inline void work() { for (int u, w, v; !q.empty();) { w = -q.top().first, u = q.top().second, q.pop(); if (tag[u]) continue; tag[u] = 1, ans = min(0ll + ans, 0ll + w + abs(X[u] - Fx) + abs(Y[u] - Fy)); if ((v = idx[posx[u] - 1]) && !tag[v]) q.push(pair<int, int>(-w - X[u] + X[v], v)); if ((v = idx[posx[u] + 1]) && !tag[v]) q.push(pair<int, int>(-w - X[v] + X[u], v)); if ((v = idy[posy[u] - 1]) && !tag[v]) q.push(pair<int, int>(-w - Y[u] + Y[v], v)); if ((v = idy[posy[u] + 1]) && !tag[v]) q.push(pair<int, int>(-w - Y[v] + Y[u], v)); } cout << ans << n ; } int main() { input(); init(); work(); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, K; char maze[2010][2010]; int up[2010][2010], down[2010][2010]; struct Segtree { int key[2010 * 4], ans[2010 * 4]; void add(deque<pair<int, int> > &que, int pos, int val) { while (!que.empty() && val < que.back().second) que.pop_back(); que.push_back(make_pair(pos, val)); } void remove(deque<pair<int, int> > &que, int pos) { while (!que.empty() && que.front().first <= pos) que.pop_front(); } void cal(int l, int r, int step) { int mid = l + r >> 1; deque<pair<int, int> > qU, qD; int i = 0, j = 0; key[step] = 0; for (; j < m; j++) { int a, b; add(qU, j, mid - max(l - 1, up[mid][j])); if (mid < r) add(qD, j, b = (min(r + 1, down[mid + 1][j]) - mid - 1)); else add(qD, j, b = 0); key[step] = max(key[step], min(j - i + 1, qU.front().second + qD.front().second)); while (i < j && j - i + 1 > qU.front().second + qD.front().second) { remove(qU, i); remove(qD, i); i++; key[step] = max(key[step], min(j - i + 1, qU.front().second + qD.front().second)); } } } void build(int l, int r, int step) { cal(l, r, step); if (l == r) return; int mid = l + r >> 1; build(l, mid, step * 2); build(mid + 1, r, step * 2 + 1); ans[step] = max(key[step], max(ans[step * 2], ans[step * 2 + 1])); } void update(int l, int r, int pos, int step) { cal(l, r, step); if (l == r) return; int mid = l + r >> 1; if (pos <= mid) update(l, mid, pos, step * 2); else update(mid + 1, r, pos, step * 2 + 1); ans[step] = max(key[step], max(ans[step * 2], ans[step * 2 + 1])); } } tree; int main() { scanf( %d%d%d , &n, &m, &K); for (int i = 0; i < (n); i++) scanf( %s , maze[i]); for (int j = 0; j < (m); j++) up[0][j] = maze[0][j] == . ? -1 : 0; for (int i = 1; i < n; i++) for (int j = 0; j < (m); j++) up[i][j] = maze[i][j] == . ? up[i - 1][j] : i; for (int j = 0; j < (m); j++) down[n - 1][j] = maze[n - 1][j] == . ? n : n - 1; for (int i = n - 2; i >= 0; i--) for (int j = 0; j < (m); j++) down[i][j] = maze[i][j] == . ? down[i + 1][j] : i; tree.build(0, n - 1, 1); while (K--) { int x, y; scanf( %d%d , &x, &y); x--, y--; maze[x][y] = # ; up[0][y] = maze[0][y] == . ? -1 : 0; for (int i = 1; i < n; i++) up[i][y] = maze[i][y] == . ? up[i - 1][y] : i; down[n - 1][y] = maze[n - 1][y] == . ? n : n - 1; for (int i = n - 2; i >= 0; i--) down[i][y] = maze[i][y] == . ? down[i + 1][y] : i; tree.update(0, n - 1, x, 1); printf( %d n , tree.ans[1]); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; vector<pair<int, int> > v[1000007]; vector<int> rv[1000007]; int comp[1000007]; vector<pair<int, int> > g[1000007]; long long sm[1000007]; int used[1000007]; int stver; stack<int> s; vector<int> srt; bool val[100000002]; long long hval[1000007]; long long dp[1000007]; map<int, int> ZX; void dfs(int vertex) { used[vertex] = 1; int i; int sz = v[vertex].size(); for (i = 0; i < sz; i++) { if (used[v[vertex][i].first] == 0) { dfs(v[vertex][i].first); } } s.push(vertex); } void revdfs(int vertex, int id) { comp[vertex] = id; int i; int sz = rv[vertex].size(); for (i = 0; i < sz; i++) { if (comp[rv[vertex][i]] == 0) { revdfs(rv[vertex][i], id); } } } void precalc() { int i; long long cur = 0; int br = 1; if (val[0] == true) { hval[0] = 1; } for (i = 1; i < 100000002; i++) { cur = cur + br; if (i >= (br * (br + 1) / 2)) { br++; } if (val[i] == true) { hval[ZX[i]] = cur; } } } void calc_dp(int vertex) { used[vertex] = 1; int i; int sz = g[vertex].size(); for (i = 0; i < sz; i++) { if (used[g[vertex][i].first] == 0) { calc_dp(g[vertex][i].first); } if (dp[vertex] < dp[g[vertex][i].first] + g[vertex][i].second) { dp[vertex] = dp[g[vertex][i].first] + g[vertex][i].second; } } dp[vertex] += sm[vertex]; } void input() { scanf( %d%d , &n, &m); int i; for (i = 1; i <= m; i++) { int x, y, z; scanf( %d%d%d , &x, &y, &z); v[x].push_back(make_pair(y, z)); rv[y].push_back(x); srt.push_back(z); val[z] = true; } if (srt.size() != 0) { sort(srt.begin(), srt.end()); ZX[srt[0]] = 1; for (i = 1; i < m; i++) { if (srt[i] == srt[i - 1]) { continue; } ZX[srt[i]] = ZX[srt[i - 1]] + 1; } } scanf( %d , &stver); precalc(); } void solve() { int i, j; for (i = 1; i <= n; i++) { if (used[i] == 0) { dfs(i); } } int tp = 1; while (s.empty() == false) { int u = s.top(); s.pop(); if (comp[u] != 0) { continue; } revdfs(u, tp); tp++; } for (i = 1; i <= n; i++) { int sz = v[i].size(); for (j = 0; j < sz; j++) { if (comp[v[i][j].first] == comp[i]) { sm[comp[i]] += hval[ZX[v[i][j].second]]; } else { g[comp[i]].push_back(make_pair(comp[v[i][j].first], v[i][j].second)); } } } for (i = 1; i <= n; i++) { used[i] = 0; } stver = comp[stver]; calc_dp(stver); printf( %I64d n , dp[stver]); } int main() { ios_base ::sync_with_stdio(false); cin.tie(NULL); input(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int INF = 2e18; bool isPrime(long long int n) { if (n <= 1) return false; if (n <= 3) return true; if (n % 2 == 0 || n % 3 == 0) return false; for (long long int i = 5; i * i <= n; i = i + 6) { if (n % i == 0 || n % (i + 2) == 0) return false; } return true; } long long int exp(long long int x, long long int n) { long long int res = 1; while (n > 0) { if (n % 2 == 1) res = (res * x) % 1000000007; x = (x * x) % 1000000007; n = n / 2; } return res; } void null() { long long int n, l, r; cin >> n >> l >> r; vector<long long int> a, b; for (long long int i = 0; i < n; i++) { long long int x; cin >> x; a.push_back(x); } for (long long int i = 0; i < n; i++) { long long int x; cin >> x; b.push_back(x); } for (long long int i = 0; i < l - 1; i++) { if (a[i] != b[i]) { cout << LIE ; return; } } for (long long int i = r; i < n; i++) { if (a[i] != b[i]) { cout << LIE ; return; } } cout << TRUTH ; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int t = 1; clock_t start, end; start = clock(); cout << fixed << setprecision(20); while (t--) { null(); } end = clock(); double time_taken = double(end - start) / double(CLOCKS_PER_SEC); } |
#include <bits/stdc++.h> using namespace std; int n, m, a[105], rev[105], b[105]; long double ans = 0, cnt = 0, f[2][35][35], g[31][31]; void dfs(int u) { if (!u) { for (int i = 1; i <= n; i++) for (int j = i + 1; j <= n; j++) if (a[i] > a[j]) ans++; cnt++; return; } for (int i = 1; i <= n; i++) { for (int j = i; j <= n; j++) { for (int k = i; k <= (i + j) / 2; k++) swap(a[k], a[j - (k - i)]); dfs(u - 1); for (int k = i; k <= (i + j) / 2; k++) swap(a[k], a[j - (k - i)]); } } } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); long double kk = n * (n + 1) / 2.0; for (int i = 1; i <= n; i++) for (int j = i + 1; j <= n; j++) if (a[i] > a[j]) f[0][i][j] = 1; for (int o = 1; o <= m; o++) { int p = o & 1; memset(f[p], 0, sizeof(f[p])); for (int i = 1; i <= n; i++) { for (int j = i; j <= n; j++) { for (int k = 1; k <= n; k++) b[k] = k; for (int k = i; k <= (j + i) / 2; k++) swap(b[k], b[j - k + i]); for (int x = 1; x <= n; x++) for (int y = x + 1; y <= n; y++) if (b[x] < b[y]) f[p][b[x]][b[y]] += f[p ^ 1][x][y] / kk; else f[p][b[y]][b[x]] += (1 - f[p ^ 1][x][y]) / kk; } } } long double ans = 0; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) ans += f[m & 1][i][j]; printf( %.10lf n , (double)ans); return 0; } |
#include <bits/stdc++.h> using namespace std; long long int inv[32][2]; void rec(vector<int>& a, int b) { if (b < 0 || a.size() == 0) return; int c[2] = {0}; vector<int> v[2]; for (int x : a) { int val; if ((x & (1 << b)) > 0) val = 1; else val = 0; if (val == 0) inv[b][0] += c[1]; else inv[b][1] += c[0]; c[val]++; v[val].push_back(x); } rec(v[0], b - 1); rec(v[1], b - 1); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; rec(a, 30); long long int x = 0, ans = 0; for (int i = 0; i <= 30; i++) { ans += min(inv[i][0], inv[i][1]); if (inv[i][0] > inv[i][1]) x += (1 << i); } cout << ans << << x << n ; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; vector<int> g[N]; void dfs(int u, vector<int>& dep, int par = -1, int h = 0) { dep[u] = h; for (int v : g[u]) { if (v == par) continue; dfs(v, dep, u, h + 1); } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n, x; cin >> n >> x; for (int i = 0; i < n - 1; i++) { int u, v; cin >> u >> v; g[u].push_back(v); g[v].push_back(u); } vector<int> dep_r(n + 1); vector<int> dep_x(n + 1); dfs(1, dep_r); dfs(x, dep_x); int mx = -1; for (int i = 1; i <= n; i++) { if (dep_x[i] < dep_r[i]) { mx = max(mx, dep_r[i] << 1); } } cout << mx << n ; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const long long inf = 1e18; const int maxn = 1e5 + 10; const double eps = 1e-7; const double pi = 3.14159265359; int n, m, t[maxn]; int par[maxn]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m; for (int i = 0; i < n; i++) { cin >> t[i]; } par[0] = t[0]; for (int i = 1; i < n; i++) { par[i] = par[i - 1] + t[i]; } for (int i = 0; i < n; i++) { if (i == 0) { cout << 0 << ; continue; } sort(t, t + i); int res = 0; int s = par[i]; int id = i - 1; while (s > m) { s -= t[id]; id--; res++; } cout << res << ; } } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 100; int b[10] = {0, 2, 3, 1}, a[maxn]; int main() { int t; scanf( %d , &t); while (t--) { long long n, ans = 1; cin >> n; int m = n % 3; n = (n + 2) / 3; while (n > ans) { n -= ans; ans *= 4; } int cnt = 0; long long ans1 = ans + n - 1, ans2 = ans * 2; n--; while (n) { a[++cnt] = n % 4; n /= 4; } long long now = 1; for (int i = 1; i <= cnt; i++) ans2 += b[a[i]] * now, now *= 4; if (m == 1) cout << ans1 << endl; else if (m == 2) cout << ans2 << endl; else if (m == 0) cout << (ans1 ^ ans2) << endl; } } |
#include <bits/stdc++.h> using namespace std; long long int q; void solve(long long int x) { for (long long int i = 2; i * i <= x; i++) { if (x % i == 0) { long long int temp = x / i; for (long long int j = 2; j * j <= temp; j++) { if (temp % j == 0) { cout << 1 << n ; cout << i * j; return; } } cout << 2; return; } } cout << 1 << n ; cout << 0; return; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> q; if (q == 1) { cout << 1 << n ; cout << 0; return 0; } solve(q); return 0; } |
#include <bits/stdc++.h> int n; int x[200050]; int f[200050]; int ans = 0; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &x[i]); for (int i = 0; i < n; i++) scanf( %d , &f[i]); int k = 0, l = 0; while (l < n) { if (x[k] == f[l]) k++, l++; else ans++, l++; } printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; int n, m; struct point { double x, y, z; } P[5200]; inline double sqr(double x) { return x * x; } inline double dist(point a, point b) { return sqrt(sqr(a.x - b.x) + sqr(a.y - b.y) + sqr(a.z - b.z)); } inline double len(point a, point b, point c) { return dist(a, b) + dist(a, c) + dist(b, c); } int main() { cin >> n; double ans = 1e100; for (int i = 0; i < n; i++) cin >> P[i].x >> P[i].y >> P[i].z; for (int i = 1; i < n; i++) for (int j = i + 1; j < n; j++) ans = min(ans, len(P[0], P[i], P[j])); cout.precision(11); cout << ans / 2 << endl; } |
#include <bits/stdc++.h> int main() { int m, n, i, j, p, q; scanf( %d %d , &m, &n); scanf( %d %d , &p, &q); int ar[m], br[n]; for (i = 0; i < m; i++) { scanf( %d , &ar[i]); } for (i = 0; i < n; i++) { scanf( %d , &br[i]); } if (ar[p - 1] < br[n - q]) printf( YES n ); else printf( NO n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int A[100005]; int F[100005]; int main() { int n, x; cin >> n >> x; for (int i = 1; i <= n; i++) { scanf( %d , &A[i]); F[A[i]]++; } int idx = (n + 1) / 2; bool wasPresent = true; if (!F[x]) { wasPresent = false; A[n + 1] = x; n++; } sort(A + 1, A + n + 1); int ans = 100005; for (int i = 1; i <= n; i++) { if (A[i] == x) { int add = 0; if ((i - 1) > (n - i)) { add = (i - 1) - (n - i); } else if ((i - 1) < (n - i)) { add = (n - i) - (i - 1) - 1; } ans = min(ans, add); } } if (!wasPresent) ans++; printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1000000000000000000; map<pair<long long, int>, long long> memo; long long solve(long long n, int x) { pair<long long, int> p = make_pair(n, x); if (memo.find(p) != memo.end()) return memo[p]; if (n == 0) return memo[p] = 0; if (n == 1) return memo[p] = (x == 0) ? 1 : 0; return memo[p] = solve((n + 1) / 2, x) + (x ? solve(n / 2, x - 1) : 0); } int main() { ios_base::sync_with_stdio(false); long long n, t; cin >> n >> t; for (int i = 0; (1ll << i) <= t; ++i) if (t == (1ll << i)) { cout << solve(n + 2, i + 1) - solve(2, i + 1); return 0; } cout << 0; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int n = s.size(); int a = 0, b = 0, c = 0, d = 0; for (int i = 0; i < n; i++) { if (s[i] >= A && s[i] <= Z ) a = 1; else if (s[i] >= a && s[i] <= z ) b = 1; else if (s[i] >= 0 && s[i] <= 9 ) c = 1; } if (n >= 5) { if (a && b && c) cout << Correct << endl; else cout << Too weak << endl; } else cout << Too weak << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[200010]; int main() { int n; while (~scanf( %lld , &n)) { long long ans = 0; for (int i = 0; i < n; ++i) scanf( %lld , &a[i]); for (int i = 0; i < n;) { ans++; long long j = i; while (j < n && a[j] == -1) j++; if (j == n) break; long long k = j + 1; while (k < n && a[k] == -1) k++; if (k == n) break; long long d = k - j; if ((a[k] - a[j]) % d) { i = k; continue; } long long s = (a[k] - a[j]) / d; if (s > 0 && a[j] - s * (j - i) <= 0) { i = k; continue; } long long r = k + 1; while (r < n) { long long e = a[k] + s * (r - k); if (a[r] != -1 && a[r] != e) break; if (e <= 0) break; r++; } i = r; } printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( -O2 ) using namespace std; void err(istream_iterator<string> it) {} template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << endl; err(++it, args...); } const int LIM = 1e5 + 5, MOD = 1e9 + 7; int t, n, m, k, x, y; int is_com[LIM]; vector<int> pr; void sieve() { for (int i = 2; i < LIM; i++) { if (!is_com[i]) pr.push_back(i); for (auto &it : pr) { if (it * i >= n) break; is_com[i * it] = 1; if (i % it == 0) { break; } } } } long long int powm(long long int x, long long int pw, long long int MOD) { long long int res = 1; while (pw) { if (pw & 1LL) res = ((res * x)) % MOD; pw >>= 1; x = ((x * x)) % MOD; } return res; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); sieve(); long long int x, y; cin >> x >> y; long long int ans = 0; if (y % x == 0) { map<int, int> fac; y /= x; long long int cp = y; for (auto &it : pr) { if (cp == 1) break; while (cp % it == 0) fac[it]++, cp /= it; } if (cp > 1) fac[cp]++; for (long long int i = 1; i < (long long int)1e5; ++i) { if (i * i > y) break; if (y % i == 0) { map<int, int> f; cp = i; for (auto &it : fac) { if (cp == 1) break; while (cp % it.first == 0) f[it.first]++, cp /= it.first; } int mu = 1; for (auto &it : f) { if (it.second > 1) mu = 0; else mu *= -1; } ans += mu * powm(2, y / i - 1, MOD); if (y / i != i) { map<int, int> f; cp = y / i; for (auto &it : fac) { if (cp == 1) break; while (cp % it.first == 0) f[it.first]++, cp /= it.first; } int mu = 1; for (auto &it : f) { if (it.second > 1) mu = 0; else mu *= -1; } ans += mu * powm(2, i - 1, MOD); } ans %= MOD; } } cout << (ans + MOD) % MOD << n ; } else cout << 0 << n ; return 0; } |
#include <bits/stdc++.h> int main() { int n, m; char ch[51]; scanf( %s , &ch); n = strlen(ch); if (n == 1) printf( %c , ch[0]); else { if (n % 2 == 0) m = (n / 2) - 1; else m = (n / 2); printf( %c , ch[m]); int j = 1; for (int i = 1; i <= n / 2; i++) { if (j < n) printf( %c , ch[m + i]); j++; if (j < n) printf( %c , ch[m - i]); j++; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int i, j, k, m, n, a = 0, b = 0; cin >> n >> m; k = n; k = k / 9; n = n % 9; if (n != 0) k++; for (i = 0; i < k; i++) cout << 54; cout << endl; for (i = 0; i < k - 1; i++) cout << 45; cout << 46; cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, k; int query(int l, int r) { if (l < 1 || r > n) return false; string re; cout << 1 << << l << << r << endl; cin >> re; return re == TAK ; } int get(int l, int r) { if (l > r) return false; while (l < r) { int mid = (l + r) >> 1; if (query(mid, mid + 1)) r = mid; else l = mid + 1; } return l; } int main() { cin >> n >> k; int x, y; x = get(1, n); y = get(1, x - 1); if (!query(y, x)) y = get(x + 1, n); cout << 2 << << x << << y << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long m, tot, cnt; long long geta(long long limit) { long long res = 1; while (res * res * res <= limit) res++; return res - 1; } void dfs(long long limit, long long num, long long vol) { if (limit == 0) { if (cnt < num) { cnt = num; tot = vol; } return; } long long a = geta(limit); dfs(limit - a * a * a, num + 1, vol + a * a * a); if (a > 1) { dfs(a * a * a - 1 - (a - 1) * (a - 1) * (a - 1), num + 1, vol + (a - 1) * (a - 1) * (a - 1)); } } int main() { while (scanf( %I64d , &m) != EOF) { cnt = 0, tot = 0; dfs(m, 0, 0); printf( %I64d %I64d n , cnt, tot); } } |
#include <bits/stdc++.h> using namespace std; template <typename T, typename C> class mcmf { public: static constexpr T eps = (T)1e-9; struct edge { int from; int to; T c; T f; C cost; }; vector<vector<int> > g; vector<edge> edges; vector<C> d; vector<int> q; vector<bool> in_queue; vector<int> pe; int n; int st, fin; T flow; C cost; mcmf(int _n, int _st, int _fin) : n(_n), st(_st), fin(_fin) { assert(0 <= st && st < n && 0 <= fin && fin < n && st != fin); g.resize(n); d.resize(n); in_queue.resize(n); pe.resize(n); flow = 0; cost = 0; } void clear_flow() { for (const edge &e : edges) { e.f = 0; } flow = 0; } void add(int from, int to, T forward_cap, T backward_cap, C cost) { assert(0 <= from && from < n && 0 <= to && to < n); g[from].push_back((int)edges.size()); edges.push_back({from, to, forward_cap, 0, cost}); g[to].push_back((int)edges.size()); edges.push_back({to, from, backward_cap, 0, -cost}); } bool expath() { fill(d.begin(), d.end(), numeric_limits<C>::max()); q.clear(); q.push_back(st); d[st] = 0; in_queue[st] = true; int beg = 0; bool found = false; while (beg < (int)q.size()) { int i = q[beg++]; if (i == fin) { found = true; } in_queue[i] = false; for (int id : g[i]) { const edge &e = edges[id]; if (e.c - e.f > eps && d[i] + e.cost < d[e.to]) { d[e.to] = d[i] + e.cost; pe[e.to] = id; if (!in_queue[e.to]) { q.push_back(e.to); in_queue[e.to] = true; } } } } if (d[fin] >= 0) found = 0; if (found) { T push = numeric_limits<T>::max(); int v = fin; while (v != st) { const edge &e = edges[pe[v]]; push = min(push, e.c - e.f); v = e.from; } v = fin; while (v != st) { edge &e = edges[pe[v]]; e.f += push; edge &back = edges[pe[v] ^ 1]; back.f -= push; v = e.from; } flow += push; cost += push * d[fin]; } return found; } pair<T, C> max_flow_min_cost() { while (expath()) { } return make_pair(flow, cost); } }; const int MG1 = 1e5; int n1, n2, m, r, b; string s1, s2; int eu[200], ev[200], er[200]; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n1 >> n2 >> m >> r >> b >> s1 >> s2; mcmf<int, int> a(n1 + n2 + 2, n1 + n2, n1 + n2 + 1); memset(er, -1, sizeof(er)); for (int i = 0, j = 0; i < m; ++i) { cin >> eu[i] >> ev[i], --eu[i], --ev[i]; if (s1[eu[i]] == U && s2[ev[i]] == U ) continue; if (s1[eu[i]] == U && s2[ev[i]] == R ) { a.add(n1 + n2, n1 + ev[i], 1, 0, r); er[i] = j++; continue; } if (s1[eu[i]] == U && s2[ev[i]] == B ) { a.add(n1 + ev[i], n1 + n2 + 1, 1, 0, b); er[i] = j++; continue; } if (s1[eu[i]] == R && s2[ev[i]] == U ) { a.add(eu[i], n1 + n2 + 1, 1, 0, r); er[i] = j++; continue; } if (s1[eu[i]] == B && s2[ev[i]] == U ) { a.add(n1 + n2, eu[i], 1, 0, b); er[i] = j++; continue; } a.add(eu[i], n1 + ev[i], 1, 0, r); a.add(n1 + ev[i], eu[i], 1, 0, b); er[i] = j; j += 2; } int tmg = 0; for (int i = 0; i < n1; ++i) { if (s1[i] == R ) { a.add(n1 + n2, i, 1, 0, -MG1); a.add(n1 + n2, i, 200, 0, 0); tmg -= MG1; } else if (s1[i] == B ) { a.add(i, n1 + n2 + 1, 1, 0, -MG1); a.add(i, n1 + n2 + 1, 200, 0, 0); tmg -= MG1; } } for (int i = 0; i < n2; ++i) { if (s2[i] == R ) { a.add(n1 + i, n1 + n2 + 1, 1, 0, -MG1); a.add(n1 + i, n1 + n2 + 1, 200, 0, 0); tmg -= MG1; } else if (s2[i] == B ) { a.add(n1 + n2, n1 + i, 1, 0, -MG1); a.add(n1 + n2, n1 + i, 200, 0, 0); tmg -= MG1; } } pair<int, int> p = a.max_flow_min_cost(); int cost = p.second - tmg; if (cost >= MG1) { cout << -1; return 0; } cout << cost << n ; for (int i = 0; i < m; ++i) { if (s1[eu[i]] == U && s2[ev[i]] == U ) { cout << U ; continue; } if (s1[eu[i]] == U && s2[ev[i]] == R ) { if (a.edges[2 * er[i]].f) cout << R ; else cout << U ; continue; } if (s1[eu[i]] == U && s2[ev[i]] == B ) { if (a.edges[2 * er[i]].f) cout << B ; else cout << U ; continue; } if (s1[eu[i]] == R && s2[ev[i]] == U ) { if (a.edges[2 * er[i]].f) cout << R ; else cout << U ; continue; } if (s1[eu[i]] == B && s2[ev[i]] == U ) { if (a.edges[2 * er[i]].f) cout << B ; else cout << U ; continue; } if (a.edges[2 * er[i]].f) cout << R ; else if (a.edges[2 * (er[i] + 1)].f) cout << B ; else cout << U ; } } |
#include <bits/stdc++.h> #pragma GCC optimize( O2,unroll-loops ) using namespace std; const int inf = 1000000010; const long long INF = 10000000000000010LL; const int mod = 1000000007; const int MAXN = 300010, LOG = 20; int n, m, k, u, v, x, y, t, a, b, ans; int par[MAXN], h[MAXN], leaf[MAXN]; vector<int> G[MAXN]; void dfs(int node) { h[node] = h[par[node]] + 1; leaf[node] = 1; for (int v : G[node]) if (!h[v]) { par[v] = node; dfs(v); leaf[node] = 0; } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m >> k; while (m--) { cin >> u >> v; G[u].push_back(v); G[v].push_back(u); } dfs(1); for (int v = 1; v <= n; v++) if (h[v] * k >= n) { cout << PATH << h[v] << n ; while (v) { cout << v << ; v = par[v]; } return 0; } cout << CYCLES n ; for (int v = 2; v <= n && k; v++) if (leaf[v]) { k--; int done = 0, x = 0, y = 0; for (int u : G[v]) if (u != par[v]) { if ((h[v] - h[u] + 1) % 3) { cout << h[v] - h[u] + 1 << n ; x = v; while (1) { cout << x << ; if (x == u) break; x = par[x]; } cout << n ; done = 1; break; } if (x) y = u; else x = u; } if (done) continue; assert(x && y); cerr << { << x << , << y << } = { << (x) << , << (y) << } << endl; if (h[x] < h[y]) swap(x, y); cout << h[x] - h[y] + 2 << n ; while (1) { cout << x << ; if (x == y) break; x = par[x]; } cout << v << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int oo = 1 << 30; int ds[500500], par[500500], parEdge[500500], depth[500500], anc[500500], ans[500500]; vector<pair<int, int>> a[500500]; int get(int ds[], int x) { return x == ds[x] ? x : ds[x] = get(ds, ds[x]); } void dfs(int x) { for (auto [y, id] : a[x]) if (y != par[x]) { par[y] = x; parEdge[y] = id; depth[y] = depth[x] + 1; dfs(y); } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, k, m; cin >> n >> k >> m; for (int i = 1; i <= n; i++) ds[i] = i; for (int i = 0; i < k; i++) { int x, y; cin >> x >> y; a[x].push_back({y, i}); a[y].push_back({x, i}); ds[get(ds, x)] = get(ds, y); ans[i] = oo; } vector<tuple<int, int, int>> unusedEdges; for (int i = 0; i < m; i++) { int x, y, z; cin >> x >> y >> z; int dx = get(ds, x), dy = get(ds, y); if (dx == dy) unusedEdges.push_back({x, y, z}); else { ds[dx] = dy; a[x].push_back({y, -1}); a[y].push_back({x, -1}); } } dfs(1); for (int i = 1; i <= n; i++) anc[i] = i; for (auto [x, y, z] : unusedEdges) while (1) { x = get(anc, x); y = get(anc, y); if (x == y) break; int dx = depth[x], dy = depth[y]; if (dx >= dy) { if (parEdge[x] >= 0 && ans[parEdge[x]] == oo) ans[parEdge[x]] = z; x = anc[x] = par[x]; } if (dy >= dx) { if (parEdge[y] >= 0 && ans[parEdge[y]] == oo) ans[parEdge[y]] = z; y = anc[y] = par[y]; } } long long sum = 0; for (int i = 0; i < k; i++) if (ans[i] < oo) sum += ans[i]; else { cout << -1 << endl; return 0; } cout << sum << endl; } |
#include <bits/stdc++.h> using namespace std; const int N = 112345; vector<int> v[N]; int read() { int x; scanf( %d , &x); return x; } int cnt[N]; bool used[N]; bool t[N]; bool never[N]; int main() { int n, m, i, j, x, y; n = read(); for (i = 2; i <= n; i++) { x = read(); y = read(); v[x].push_back(y); cnt[x]++; cnt[y]++; v[y].push_back(x); } queue<int> q; for (int i = 1; i <= n; i++) { if (cnt[i] == 1) { q.push(i); used[i] = 1; } } while (!q.empty()) { int x = q.front(); q.pop(); for (int i = 0; i < v[x].size(); i++) { int to = v[x][i]; if (!used[to]) { if (cnt[to] <= 2 && !t[x] && !never[to]) { used[to] = 1; q.push(to); } else if (cnt[to] == 3 && !t[x] && !never[to]) { t[to] = 1; } else { never[to] = 1; } cnt[to]--; } } } for (i = 1; i <= n; i++) { if (cnt[i] >= 3) { puts( no ); return 0; } } puts( yes ); } |
#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]; for (int i = 0; i < n; ++i) a.push_back(a[i]); int Max = 0, cur = 0; for (int i = 0; i < 2 * n; ++i) { if (a[i] == 1) cur++; else { Max = max(Max, cur); cur = 0; } } cout << Max; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, co; int a[100019]; cin >> n >> co; int count = 0; for (int i = 0; i < n; i++) { cin >> a[i]; count += a[i] / 10; a[i] %= 10; } sort(a, a + n); reverse(a, a + n); for (int i = 0; i < n; i++) { if (co >= 10 - a[i]) { count++; co -= (10 - a[i]); } } cout << min(10 * n, count + co / 10) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int mod = 1e9 + 7; const double pi = acos(-1); void print() { cout << n ; } template <typename T, typename... Params> void print(const T& var1, const Params&... var2) { cout << var1 << ; print(var2...); } template <typename T> void pr(const T& v) { for (auto c : v) cout << c << ; cout << n ; } long long int power(long long int a, long long int b, long long int p) { if (b == 0) return 1; long long int c = power(a, b / 2, p); if (b % 2 == 0) return (c * c) % p; else return (((c * c) % p) * a) % p; } long long int invmod(long long int n, long long int p) { return power(n, p - 2, p); } bool isPrime(long long int n) { if (n <= 1) return false; if (n <= 3) return true; if (n % 2 == 0 || n % 3 == 0) return false; for (long long int i = 5; i * i <= n; i = i + 6) if (n % i == 0 || n % (i + 2) == 0) return false; return true; } const int maxN = 100001; int tree[4 * maxN][2]; int A[100000], n; void build(int node, int start, int end) { if (start == end) tree[node][0] = A[start], tree[node][1] = start; else { int mid = (start + end) / 2; build(2 * node, start, mid); build(2 * node + 1, mid + 1, end); tree[node][0] = min(tree[2 * node][0], tree[2 * node + 1][0]); if (tree[2 * node][0] < tree[2 * node + 1][0]) tree[node][1] = tree[2 * node][1]; else tree[node][1] = tree[2 * node + 1][1]; } } pair<int, int> query(int node, int start, int end, int l, int r) { if (r < start or end < l) { return {1e9, 1e9}; } if (l <= start and end <= r) { return make_pair(tree[node][0], tree[node][1]); } int mid = (start + end) / 2; pair<int, int> p1 = query(2 * node, start, mid, l, r); pair<int, int> p2 = query(2 * node + 1, mid + 1, end, l, r); if (p1.first < p2.first) return p1; else return p2; } vector<pair<int, int> > v; int count(int l, int r, int val) { if (l > r) return 0; pair<int, int> q = query(1, 0, n - 1, l, r); int mini = q.first; int idx = q.second; mini -= val; for (long long int i = 0; i < mini; i++) v.push_back({l + 1, r + 1}); return (mini + count(l, idx - 1, val + mini) + count(idx + 1, r, val + mini)); } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n; for (long long int i = 0; i < n; i++) cin >> A[i]; build(1, 0, n - 1); print(count(0, n - 1, 0)); for (long long int i = 0; i < ((long long int)(v).size()); i++) print(v[i].first, v[i].second); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; int n; double a, d; double p[maxn], t[maxn], v[maxn], s[maxn]; int main() { scanf( %d %lf %lf , &n, &a, &d); for (int i = 0; i < n; i++) scanf( %lf%lf , &t[i], &v[i]), p[i] = t[i] + v[i] / a; s[0] = t[0] + v[0] / a + (d - 0.5 * a * v[0] / a * v[0] / a) / v[0]; if (0.5 * a * v[0] / a * v[0] / a > d) s[0] = min(s[0], t[0] + sqrt((d * 2) / a)); for (int i = 1; i < n; i++) { s[i] = t[i] + v[i] / a + (d - 0.5 * a * v[i] / a * v[i] / a) / v[i]; if (0.5 * a * v[i] / a * v[i] / a > d) s[i] = min(s[i], t[i] + sqrt((d * 2) / a)); s[i] = max(s[i], s[i - 1]); } for (int i = 0; i < n; i++) printf( %.6f n , s[i]); } |
#include <bits/stdc++.h> using namespace std; int main() { char a[5], b[5], aa[5][5]; for (int i = 1; i <= 3; i++) { scanf( %s , aa[i]); a[i] = aa[i][0]; b[i] = aa[i][1]; } if ((a[1] == a[2]) && (a[2] == a[3]) && (b[1] == b[2]) && (b[2] == b[3])) { printf( 0 n ); return 0; } if (!(strcmp(aa[1], aa[2])) || !strcmp(aa[2], aa[3]) || !strcmp(aa[1], aa[3])) { printf( 1 n ); return 0; } int c[5], d[5]; for (int i = 1; i <= 3; i++) { c[i] = a[i] - 48; d[i] = a[i] - 48; } sort(c + 1, c + 4); if (((c[3] - c[2]) == 1) && ((c[2] - c[1]) == 1) && (b[1] == b[2]) && (b[2] == b[3])) { printf( 0 n ); return 0; } if (b[1] == b[2]) { if ((abs(d[1] - d[2]) == 1) || (abs(d[1] - d[2]) == 2)) { printf( 1 n ); return 0; } } if (b[2] == b[3]) { if ((abs(d[2] - d[3]) == 1) || (abs(d[3] - d[2]) == 2)) { printf( 1 n ); return 0; } } if (b[1] == b[3]) { if ((abs(d[1] - d[3]) == 1) || (abs(d[1] - d[3]) == 2)) { printf( 1 n ); return 0; } } printf( 2 n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; const long long inf = 9e18; struct NODE { long long v, id; bool operator<(const NODE& other) const { return v > other.v || (v == other.v && id > other.id); } } node[N]; long long a[N], b[N]; long long n; long long f(long long x, long long y) { return x - 3LL * y * y + 3LL * y - 1; } long long find(long long v, long long x) { long long l, r, mid; l = 0; r = x + 1; while (r - l > 1) { mid = (l + r) >> 1; if (f(x, mid) >= v) l = mid; else r = mid; } return l; } long long solve(long long x) { long long tot = 0, i; for (i = 1; i <= n; i++) { tot += (b[i] = find(x, a[i])); } return tot; } int main() { long long k, i, cnt = 0; long long l = inf, r = -inf, mid, tot; cin >> n >> k; for (i = 1; i <= n; i++) { cin >> a[i]; l = min(l, f(a[i], a[i])); r = max(r, f(a[i], 1)); } while (r - l > 1) { mid = (l + r) >> 1; if (solve(mid) <= k) r = mid; else l = mid; } tot = solve(r); for (i = 1; i <= n; i++) if (b[i] < a[i]) node[++cnt].v = f(a[i], b[i] + 1), node[cnt].id = i; sort(node + 1, node + cnt + 1); for (i = 1; i <= cnt; i++) { if (tot == k) break; b[node[i].id]++; tot++; } for (i = 1; i <= n; i++) cout << b[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 10 + 1e5; const int MOD = 1e9 + 7; int n, m; int a[MAXN], c[MAXN]; void Inout() { freopen( ABC .inp , r , stdin); freopen( ABC .out , w , stdout); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; long long ans = 0; for (int i = 1; i <= n; ++i) { cin >> a[i]; c[i] = max(c[i - 1], a[i] + 1); } for (int i = n - 1; i; --i) c[i] = max(c[i], c[i + 1] - 1); for (int i = 1; i <= n; ++i) { ans += c[i] - a[i] - 1; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; const long long mod = 1e9 + 7; const long long N = 2e5 + 10; inline long long add(long long x, long long y) { x += y; if (x >= mod) x -= mod; return x; } inline long long mul(long long x, long long y) { x = (1LL * x * y) % mod; return x; } long long first[N]; long long lvl[N]; int32_t main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); long long n, k; cin >> n >> k; long long maxv = 0; vector<long long> v(n); for (long long i = 0; i <= n - 1; ++i) { cin >> v[i]; first[v[i]]++; maxv = max(maxv, v[i]); } long long ans = INF; for (long long i = 0; i <= maxv; ++i) { queue<long long> q; q.push(i); lvl[i] = 0; long long val = 0; long long cc = 0; while (!q.empty()) { long long x = q.front(); q.pop(); if (cc + first[x] > k) { val += (k - cc) * lvl[x]; cc = k; break; } else { cc += first[x]; val += first[x] * lvl[x]; if (i == 0) { } } if (cc >= k) break; if (2 * x <= 2e5 and x > 0) { q.push(2 * x); lvl[2 * x] = 1 + lvl[x]; } if (2 * x + 1 <= 2e5) { q.push(2 * x + 1); lvl[2 * x + 1] = 1 + lvl[x]; } } if (cc < k) val = INF; ans = min(ans, val); } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int A[1000000]; map<char, int> M; int main() { for (int i = 0; i <= 63; i++) for (int j = 0; j <= 63; j++) A[i & j]++; for (int i = 0; i <= 9; i++) M[i + 0 ] = i; for (int i = 0; i < 26; i++) M[i + A ] = i + 10; for (int i = 0; i < 26; i++) M[i + a ] = i + 36; M[ _ ] = 63, M[ - ] = 62; string s; cin >> s; long long ans = 1; long long mod = 1e9 + 7; for (int i = 0; i < s.size(); i++) ans = ans * A[M[s[i]]] % mod; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const int maxn = 1000 + 10; int n, maxLevel; vector<int> edge[maxn]; vector<int> gu; int dis[maxn]; vector<int> level[maxn]; int fa[maxn]; bool used[maxn]; void print(int a[], int n, int st = 0) { for (int i = 0; i < n; i++) { if (i != 0) printf( ); printf( %d , a[i + st]); } printf( n ); } void init() { scanf( %d , &n); for (int i = 1; i <= n; i++) edge[i].clear(); for (int i = 0; i < n - 1; i++) { int x, y; scanf( %d%d , &x, &y); edge[x].push_back(y); edge[y].push_back(x); } } void guess(vector<int> a, int &u, int &value) { printf( ? %d , int(a.size())); for (int i = 0; i < a.size(); i++) printf( %d , a[i]); printf( n ); fflush(stdout); scanf( %d%d , &u, &value); } void answer(int u1, int u2) { char s[20]; printf( ! %d %d n , u1, u2); fflush(stdout); scanf( %s , s); } void dfs(int u) { for (int i = 0; i < edge[u].size(); i++) { int v = edge[u][i]; if (dis[v] == -1) { dis[v] = dis[u] + 1; fa[v] = u; maxLevel = max(maxLevel, dis[v]); level[dis[v]].push_back(v); dfs(v); } } } void doit() { int r, len, k1, k2; gu.clear(); for (int i = 1; i <= n; i++) gu.push_back(i); guess(gu, r, len); for (int i = 0; i <= n; i++) level[i].clear(); for (int i = 0; i <= n; i++) dis[i] = -1; dis[r] = 0; level[0].push_back(r); maxLevel = 0; dfs(r); int left = (len + 1) / 2, right = min(len, maxLevel), mid, ans, u, d; while (left <= right) { mid = (left + right) >> 1; guess(level[mid], u, d); if (d <= len) { ans = mid; k1 = u; left = mid + 1; } else { right = mid - 1; } } if (ans == len) { answer(r, k1); return; } u = k1; for (int i = 1; i <= n; i++) used[i] = false; while (u != r) { used[u] = true; u = fa[u]; } gu.clear(); for (int i = 0; i < level[len - ans].size(); i++) { if (!used[level[len - ans][i]]) { gu.push_back(level[len - ans][i]); } } guess(gu, k2, d); answer(k1, k2); } int main() { int t; scanf( %d , &t); while (t--) { init(); doit(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int i, ans, n, a[3001]; while (cin >> n) { for (i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); if (a[0] > 1) ans = 1; else { for (i = 1; i < n; i++) { if (a[i] - a[i - 1] > 1) { ans = a[i - 1] + 1; break; } } } if (ans <= 0) ans = a[n - 1] + 1; cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct event { long long x, type; event() {} event(long long _x, long long _type) { x = _x; type = _type; } }; string a, b; long long n; long double ans = 0; vector<long long> v[500]; vector<event> d[500]; bool operator<(const event& a, const event& b) { return a.x < b.x || (a.x == b.x && a.type < b.type); } int main() { cin >> n; cin >> a >> b; for (long long i = 0; i < n; i++) { v[a[i]].push_back(i); d[a[i]].push_back(event(i, 0)); d[b[i]].push_back(event(i, 1)); } long long all = 0; for (long long i = 1; i <= n; i++) { all += i * i; } for (long long i = 0; i < 500; i++) { sort(d[i].begin(), d[i].end()); long long x = 0, y = 0; for (long long j = 0; j < d[i].size(); j++) { event q = d[i][j]; y += (n - q.x) * (1 - q.type); } for (long long j = 0; j < d[i].size(); j++) { event q = d[i][j]; if (!q.type) { y -= n - q.x; x += q.x + 1; } else { ans += (long double)((q.x + 1) * y) / (long double)all; ans += (long double)((n - q.x) * x) / (long double)all; } } } cout.precision(18); cout << ans; return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:300000000 ) const long double eps = 1e-20; const long double pi = acos(-1.0); const long long inf = 1000 * 1000 * 1000 * 1000 * 1000 * 1000; const long long base = 1000 * 1000 * 1000 + 7; using namespace std; int n, m, z, a[111111], x, y; bool fl; set<int> g[111111]; int main() { ios_base ::sync_with_stdio(false); cin >> n >> m; for (int i = 0; i < (m); i++) { cin >> x >> y; x; y; g[x].insert(y); g[y].insert(x); } for (int i = 0; i < (n); i++) a[i] = i + 1; if (n < 9) { do { z = 0; fl = true; for (int i = 0; i < (n); i++) { if (z == m) break; if (g[a[i]].find(a[(i + 1) % n]) != g[a[i]].end()) { fl = false; break; } if (!fl) break; z++; } if (fl && z == m) { z = 0; for (int i = 0; i < (n); i++) { if (z == m) return 0; cout << a[i] << << a[(i + 1) % n] << endl; z++; } return 0; } } while (next_permutation(a, a + n)); cout << -1 ; return 0; } for (int test = 0; test < (666); test++) { random_shuffle(a, a + n); z = 0; fl = true; for (int i = 0; i < (n); i++) { if (z == m) break; if (g[a[i]].find(a[(i + 1) % n]) != g[a[i]].end()) { fl = false; break; } if (!fl) break; z++; } if (fl && z == m) { z = 0; for (int i = 0; i < (n); i++) { if (z == m) return 0; cout << a[i] << << a[(i + 1) % n] << endl; z++; } return 0; } } cout << -1 ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; while (cin >> n) { vector<long long> nums(n); for (int i = 0; i < n; i++) { cin >> nums[i]; } bool hasAns = false; for (int i = 31; i >= 0; i--) { long long num = 1; num = num << i; bool hasRes = false; long long res = 0; int count = 0; for (int j = 0; j < nums.size(); j++) { if (nums[j] & num) { if (hasRes) { res &= nums[j]; } else { res = nums[j]; } count++; hasRes = true; } } if (count == 0 || (res % num)) { continue; } hasAns = true; cout << count << endl; for (int j = 0; j < nums.size(); j++) { if (nums[j] & num) { cout << nums[j] << ; } } cout << endl; break; } if (!hasAns) { cout << nums.size() << endl; for (int j = 0; j < nums.size(); j++) { cout << nums[j] << ; } cout << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int add = 1e9; const int INF = 2e9; const long long mod = 1e9 + 7; const long long mod1 = 3e9 + 19; const long long mod2 = 3e9 - 71; const long long longINF = 3e18; const long long ph = 31; const long double pi = acos(-1); const long double eps = 1e-8; const int M = 1 << 18; int n, a[105], res; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; if (!(n & 1)) { cout << No ; return 0; } for (int i = 0; i < n; i++) cin >> a[i]; if (a[0] % 2 == 0 || a[n - 1] % 2 == 0) { cout << No ; return 0; } cout << Yes ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int tu[200], a[200]; int f[200]; int n, m, k; int min; int i, j; scanf( %d %d %d , &n, &m, &k); for (i = 0; i < m; i++) { scanf( %d , &f[i]); a[i] = 0; } for (i = 0; i < k; i++) scanf( %d , &tu[i]); for (i = 0; i < m; i++) for (j = 0; j < k; j++) if (tu[j] % f[i] == 0) a[i] += 1; min = 1000; for (i = 0; i < m; i++) { if (min > a[i]) min = a[i]; } j = 0; for (i = 0; i < m; i++) { if (a[i] == min) tu[j++] = i; } for (i = 0; i < j; i++) { for (k = i + 1; k < j; k++) { if (tu[i] > tu[k]) { min = tu[k]; tu[k] = tu[i]; tu[i] = min; } } } printf( %d n , j); for (i = 0; i < j; i++) printf( %d , tu[i] + 1); printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int t; cin >> t; while (t--) { string s; cin >> s; string word = ; for (auto x : s) { if (x == _ ) { word = ; } else { word = word + x; } } if (word.substr(word.length() - 2) == po ) cout << FILIPINO n ; else if (word.substr(word.length() - 4) == desu || word.substr(word.length() - 4) == masu ) cout << JAPANESE n ; else if (word.substr(word.length() - 5) == mnida ) cout << KOREAN n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t; t = 1; while (t--) { long long int n; cin >> n; long long int x, y, i; long long int suma = 0, sumb = 0; bool found = false; vector<char> v; for (i = 0; i < n; i++) { cin >> x >> y; suma += x; if (abs(suma - sumb) <= 500 && !found) v.push_back( A ); else { suma -= x; sumb += y; if (abs(suma - sumb) <= 500 && !found) v.push_back( G ); else found = true; } } if (found) cout << -1 n ; else { for (i = 0; i < v.size(); i++) cout << v[i]; cout << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 7; const int MOD = 1e9 + 7; const int MAXN = 1e6 + 3; long long gcd(long long a, long long b) { if (b == 0) return a; else return gcd(b, a % b); } long long power(long long x, long long y) { long long res = 1; while (y > 0) { if (y & 1) res = res * x; y = y >> 1; x = x * x; } return res; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t; cin >> t; while (t--) { long long n; cin >> n; vector<long long> a(n + 1); set<long long> st; for (long long i = 1; i <= (n); ++i) { cin >> a[i]; st.insert(a[i]); } if (st.size() == 1) cout << n << n ; else cout << 1 << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 20; const int MOD = 1e9 + 7; const int INF = 0x3f3f3f3f; const long long LLINF = 0x3f3f3f3f3f3f3f3f; const double PI = acos(-1.0); const double RATE = 0.995; const double eps = 1e-4; int arr[MAXN]; signed main() { int n; long long k; scanf( %d%lld , &n, &k); for (int i = 1; i <= n; ++i) { scanf( %d , &arr[i]); } sort(arr + 1, arr + 1 + n); long long ans = arr[n] - arr[1]; for (int i = 1; i < (n + 1) / 2; ++i) { long long t = min(1ll * (arr[n - i + 1] - arr[n - i] + arr[i + 1] - arr[i]), k / i); ans -= t; k -= i * t; } if (n % 2 == 0) { long long t = min(1ll * (arr[n / 2 + 1] - arr[n / 2]), k / (n / 2)); ans -= t; } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int mxN = (int)1e5 + 5; int n, ar[mxN]; void solve() { ar[0] = 0; cin >> n; for (int i = 1; i <= n; i++) cin >> ar[i]; int mx = 0; for (int i = 1; i <= n; i++) { mx = max(mx, ar[i]); } cout << mx; } int main() { ios::sync_with_stdio(0); cin.tie(0); int t = 1, i = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, k, h[300005], tot; map<pair<int, int>, int> c; struct edge { int to, nxt, val; } e[300005 << 1]; void add(int x, int y, int z) { e[++tot].nxt = h[x]; h[x] = tot; e[tot].to = y; e[tot].val = z; } priority_queue<pair<long long, int> > q; vector<int> a[300005]; long long d[300005]; int v[300005], fa[300005]; void dij() { memset(d, 0x3f, sizeof(d)); d[1] = 0; q.push(make_pair(0, 1)); while (!q.empty()) { int x = q.top().second; q.pop(); v[x] = 1; for (int i = h[x]; i; i = e[i].nxt) if (d[x] + e[i].val < d[e[i].to]) { d[e[i].to] = d[x] + e[i].val; fa[e[i].to] = x; q.push(make_pair(-d[e[i].to], e[i].to)); } while (!q.empty() && v[q.top().second]) q.pop(); } for (int i = 2; i <= n; i++) a[fa[i]].push_back(i); } void dfs(int x) { if (k && x != 1) k--, printf( %d , c[make_pair(fa[x], x)]); if (!k) return; for (int i = 0; i < (int)a[x].size(); i++) dfs(a[x][i]); } int main() { scanf( %d%d%d , &n, &m, &k); k = min(k, n - 1); for (int i = 1; i <= m; i++) { int x, y, z; scanf( %d%d%d , &x, &y, &z); add(x, y, z); add(y, x, z); c[make_pair(x, y)] = c[make_pair(y, x)] = i; } dij(); printf( %d n , k); dfs(1); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int count = 0; int n, d; cin >> n >> d; int arr[n]; for (int i = 0; i < n; i++) cin >> arr[i]; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (i == j) continue; if (abs(arr[i] - arr[j]) <= d) count++; } } cout << count << endl; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; long long x = 0; bool vis[100010] = {false}; vector<int> adj[100010]; long long pow(long long a, long long b, long long m) { stack<int> k; int j = 128; int l = 1; int an = 1; while (b) { if (b >= j) { k.push(j); b -= j; } j /= 2; } while (!k.empty()) { if (k.top() == l) { an = (an * a) % mod; k.pop(); } a = (a * a) % mod; l *= 2; } return an; } long long gcd(long a, long b) { return b == 0 ? (a < 0 ? -a : a) : gcd(b, a % b); } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); int n, m, k; cin >> n >> m >> k; int ma = 0, mi = 10000; for (int i = 0; i < n; ++i) { int t; cin >> t; if (t < mi) { mi = t; } } for (int i = 0; i < m; ++i) { int t; cin >> t; if (t > ma) { ma = t; } } if (ma > mi) { int j = k / mi; k -= (j)*mi; k += j * ma; } cout << k << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; using Int = long long; constexpr static int mod = 1e9 + 7; constexpr static int inf = (1 << 30) - 1; constexpr static Int infll = (1LL << 61) - 1; int Competitive_Programming = (ios_base::sync_with_stdio(false), cin.tie(nullptr), cout << fixed << setprecision(15), 0); #pragma GCC target( avx2 ) #pragma GCC optimize( O3 ) #pragma GCC optimize( unroll-loops ) template <typename A, typename B> string to_string(pair<A, B> p); template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p); template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p); string to_string(const string &s) { return + s + ; } string to_string(const char *s) { return to_string((string)s); } string to_string(bool b) { return (b ? true : false ); } string to_string(vector<bool> v) { bool first = true; string res = { ; for (int i = 0; i < static_cast<int>(v.size()); i++) { if (!first) { res += , ; } first = false; res += to_string(v[i]); } res += } ; return res; } template <size_t N> string to_string(bitset<N> v) { string res = ; for (size_t i = 0; i < N; i++) { res += static_cast<char>( 0 + v[i]); } return res; } template <typename A> string to_string(A v) { bool first = true; string res = { ; for (const auto &x : v) { if (!first) { res += , ; } first = false; res += to_string(x); } res += } ; return res; } template <typename A, typename B> string to_string(pair<A, B> p) { return ( + to_string(p.first) + , + to_string(p.second) + ) ; } template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p) { return ( + to_string(get<0>(p)) + , + to_string(get<1>(p)) + , + to_string(get<2>(p)) + ) ; } template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p) { return ( + to_string(get<0>(p)) + , + to_string(get<1>(p)) + , + to_string(get<2>(p)) + , + to_string(get<3>(p)) + ) ; } void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << << to_string(H); debug_out(T...); } int func(string &s) { int ret = 0, ctr = 0, mi = inf; for (int i = 0; i < s.size(); i++) { if (s[i] == ( ) ctr++; else ctr--; mi = min(ctr, mi); } ctr = 0; for (int i = 0; i < s.size(); i++) { if (s[i] == ( ) ctr++; else ctr--; if (ctr == mi) ret++; } return ret; } int main() { int N; cin >> N; string s; cin >> s; int op = 0, ed = 0; for (int i = 0; i < N; i++) { if (s[i] == ( ) op++; else ed++; } if (op != ed) { cout << 0 << n ; cout << 1 << << 1 << n ; return 0; } int ans = 0, l = 1, r = 1; for (int i = 0; i < N; i++) { for (int j = i + 1; j < N; j++) { swap(s[i], s[j]); int cnt = func(s); if (cnt > ans) { ans = cnt, l = i + 1, r = j + 1; } swap(s[i], s[j]); } } cout << ans << n ; cout << l << << r << n ; } |
#include <bits/stdc++.h> using namespace std; long long MOD; inline void modulas(long long a) { MOD = a; } inline void normal(long long &a) { a %= MOD; (a < 0) && (a += MOD); } inline long long modMul(long long a, long long b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a * b) % MOD; } inline long long modAdd(long long a, long long b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a + b) % MOD; } inline long long modSub(long long a, long long b) { a %= MOD, b %= MOD; normal(a), normal(b); a -= b; normal(a); return a; } inline long long modPow(long long b, long long p) { long long r = 1; while (p) { if (p & 1) r = modMul(r, b); b = modMul(b, b); p >>= 1; } return r; } inline long long modInverse(long long a) { return modPow(a, MOD - 2); } inline long long modDiv(long long a, long long b) { return modMul(a, modInverse(b)); } vector<bool> isPrime(10000010, true); inline void seivePrime(long long L, long long R) { long long lim = sqrt(R); for (long long i = 2; i <= lim; ++i) { for (long long j = max(i * i, (L + i - 1) / i * i); j <= R; j += i) isPrime[j - L] = false; } if (L == 1) isPrime[0] = false; } inline long long chckPrime(long long L, long long prme) { return isPrime[prme - L]; } inline long long cntPrime(long long L, long long R) { return count(isPrime.begin(), isPrime.begin() + R - L + 1, true); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int t = 1; cin >> t; while (t--) { int n; cin >> n; int ar[n]; for (int i = 0; i < n; i++) cin >> ar[i]; int s = 0, sum = 0; for (int i = 0; i < n; i++) { if (ar[i] == 0) { ar[i] = 1; s++; } sum += ar[i]; } if (sum == 0) { sort(ar, ar + n); if (ar[n - 1] > 0) cout << s + 1 << n ; else if (ar[0] == -1) cout << s + 2 << n ; else cout << s + 1 << n ; } else cout << s << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; bool solve() { int n; bool ret = false; int m = 0; scanf( %d , &n); int a; scanf( %d , &a); while ((a & 1) == 0) a >>= 1; while (a % 3 == 0) a /= 3; m = a; for (int i = 1; i < n; i++) { int a; scanf( %d , &a); while ((a & 1) == 0) a >>= 1; while (a % 3 == 0) a /= 3; if (m != a) return false; } return true; } int main() { if (solve()) puts( Yes ); else puts( No ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = (int)1e9 + 7; const int INF = (int)1e9; const long long LINF = (long long)1e18; const long double PI = acos((long double)-1); const long double EPS = 1e-9; inline long long gcd(long long a, long long b) { long long r; while (b) { r = a % b; a = b; b = r; } return a; } inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } inline long long fpow(long long n, long long k, int p = MOD) { long long r = 1; for (; k; k >>= 1) { if (k & 1) r = r * n % p; n = n * n % p; } return r; } template <class T> inline int chkmin(T& a, const T& val) { return val < a ? a = val, 1 : 0; } template <class T> inline int chkmax(T& a, const T& val) { return a < val ? a = val, 1 : 0; } template <class T> inline T isqrt(T k) { T r = sqrt(k) + 1; while (r * r > k) r--; return r; } template <class T> inline T icbrt(T k) { T r = cbrt(k) + 1; while (r * r * r > k) r--; return r; } inline void addmod(int& a, int val, int p = MOD) { if ((a = (a + val)) >= p) a -= p; } inline void submod(int& a, int val, int p = MOD) { if ((a = (a - val)) < 0) a += p; } inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; } inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); } inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; } inline int sign(long double x, long double y) { return sign(x - y); } int p = (int)1e9 + 7; template <class T, class mul, class dvd> struct FiniteField { T x; template <class G> T normalize(G x) { if (x >= 0 && x < p) return x; x %= p; if (x < 0) x += p; else if (x >= p) x -= p; return x; } FiniteField() : x(0) {} template <class G> FiniteField(const G& y) { x = normalize(y); } FiniteField(const FiniteField& rhs) : x(rhs.x) {} template <class G> FiniteField operator()(const G& y) { x = normalize(y); return *this; } template <class G> FiniteField operator=(const G& y) { x = normalize(y); return *this; } int operator==(const FiniteField& rhs) const { return x == rhs.x; } int operator!=(const FiniteField& rhs) const { return x != rhs.x; } int operator<(const FiniteField& rhs) const { return x < rhs.x; } FiniteField operator++(int) { FiniteField res = *this; if ((++x) >= p) x -= p; return res; } FiniteField operator++() { if ((++x) >= p) x -= p; return *this; } FiniteField operator--(int) { FiniteField res = *this; if ((--x) < 0) x += p; return res; } FiniteField operator--() { if ((--x) < 0) x += p; return *this; } template <class G> FiniteField operator+=(const G& y) { if ((x += normalize(y)) >= p) x -= p; return *this; } template <class G> FiniteField operator-=(const G& y) { if ((x -= normalize(y)) < 0) x += p; return *this; } FiniteField operator+=(const FiniteField& rhs) { if ((x += rhs.x) >= p) x -= p; return *this; } FiniteField operator-=(const FiniteField& rhs) { if ((x -= rhs.x) < 0) x += p; return *this; } FiniteField operator+(const FiniteField& rhs) const { FiniteField res; res.x = x + rhs.x; if (res.x >= p) res.x -= p; return res; } FiniteField operator-(const FiniteField& rhs) const { FiniteField res; res.x = x - rhs.x; if (res.x < 0) res.x += p; return res; } template <class G> FiniteField operator*=(const G& y) { x = mul()(x, normalize(y), p); return *this; } template <class G> FiniteField operator/=(const G& y) { x = dvd()(x, normalize(y), p); return *this; } template <class G> FiniteField operator*(const G& y) const { FiniteField res; res.x = mul()(x, res.normalize(y), p); return res; } template <class G> FiniteField operator/(const G& y) const { FiniteField res; res.x = dvd()(x, res.normalize(y), p); return res; } FiniteField operator*(const FiniteField& rhs) const { FiniteField res; res.x = mul()(x, rhs.x, p); return res; } FiniteField operator/(const FiniteField& rhs) const { FiniteField res; res.x = dvd()(x, rhs.x, p); return res; } template <class G> friend FiniteField operator*(const G& y, const FiniteField& rhs) { FiniteField res; res.x = res.normalize(y); return res * rhs; } template <class G> friend FiniteField operator/(const G& y, const FiniteField& rhs) { FiniteField res; res.x = res.normalize(y); return res / rhs; } template <class G> FiniteField operator^=(G k) { if (k == 0) { x = 1; return *this; } T t = x; k--; while (k > 0) { if (k & 1) x = mul()(x, t, p); t = mul()(t, t, p); k >>= 1; } return *this; } template <class G> FiniteField operator^(G k) const { if (k == 0) return 1; T r = x, t = x; k--; while (k > 0) { if (k & 1) r = mul()(r, t, p); t = mul()(t, t, p); k >>= 1; } return r; } friend istream& operator>>(istream& is, FiniteField& rhs) { is >> rhs.x; return is; } friend ostream& operator<<(ostream& os, const FiniteField& rhs) { os << rhs.x; return os; } }; template <class T> class mul { public: T operator()(const T& x, const T& y, const T& p) { return (long long)x * y % p; } }; template <class T> class dvd { public: T operator()(const T& x, const T& y, const T& p) { pair<T, T> r = euclid(y, p); return mul<T>()(x, (r.first % p + p) % p, p); } private: pair<T, T> euclid(T a, T b) { if (b == 0) return make_pair(1, 0); pair<T, T> r = euclid(b, a % b); return make_pair(r.second, r.first - a / b * r.second); } }; const int maxn = 100000 + 5; int m, n; FiniteField<int, mul<int>, dvd<int> > a[maxn]; map<FiniteField<int, mul<int>, dvd<int> >, int> hs; void solve() { cin >> m >> n; p = m; for (int i = (0); i < (n); i++) cin >> a[i]; if (n == 1) { cout << a[0] << << 0 << n ; return; } if (n == p) { cout << 0 << << 1 << n ; return; } FiniteField<int, mul<int>, dvd<int> > sum = 0, sqsum = 0; for (int i = (0); i < (n); i++) sum += a[i], sqsum += a[i] * a[i], hs[a[i]]; for (int i = (0); i < (n); i++) { FiniteField<int, mul<int>, dvd<int> > x = a[i]; FiniteField<int, mul<int>, dvd<int> > d = (sum / n - x) * 2 / (n - 1); if (d == 0) continue; if (sqsum != x * x * n + x * d * n * (n - 1) + d * d * (n - 1) * n * (2 * n - 1) / 6) continue; int ok = 1; for (int j = (0); j < (n); j++) { if (!hs.count(x + j * d)) { ok = 0; break; } } if (ok) { cout << x << << d << n ; return; } } cout << -1 << n ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c; cin >> a >> b >> c; int n, x; cin >> n; int i = 0; while (n--) { cin >> x; if (x > b && x < c) i++; } cout << i; } |
#include <bits/stdc++.h> using namespace std; int main() { int A[3][3], B[3][3]; for (int i = 0; i < 3; i++) { for (int j = 0; j < 3; j++) { cin >> A[i][j]; B[i][j] = 1; } } for (int i = 0; i < 3; i++) { for (int j = 0; j < 3; j++) { if (A[i][j] % 2 != 0) { B[i][j] = !B[i][j]; if (i >= 0 and i <= 2 and j - 1 >= 0 and j - 1 <= 2) { B[i][j - 1] = !B[i][j - 1]; } if (i >= 0 and i <= 2 and j + 1 >= 0 and j + 1 <= 2) { B[i][j + 1] = !B[i][j + 1]; } if (i - 1 >= 0 and i - 1 <= 2 and j >= 0 and j <= 2) { B[i - 1][j] = !B[i - 1][j]; } if (i + 1 >= 0 and i + 1 <= 2 and j >= 0 and j <= 2) { B[i + 1][j] = !B[i + 1][j]; } } } } for (int i = 0; i < 3; i++) { for (int j = 0; j < 3; j++) { cout << B[i][j]; } cout << endl; } } |
#include <bits/stdc++.h> using namespace std; template <class T> T By(T x, T y, T P) { T F1 = 0; while (y) { if (y & 1) { F1 += x; if (F1 < 0 || F1 >= P) F1 -= P; } x <<= 1; if (x < 0 || x >= P) x -= P; y >>= 1; } return F1; } template <class T> T Mul(T x, T y, T P) { T F1 = 1; x %= P; while (y) { if (y & 1) { F1 = By(F1, x, P); } x = By(x, x, P); y >>= 1; } return F1; } template <class T> T Gcd(T x, T y) { if (y == 0) return x; T z; while (z = x % y) { x = y, y = z; } return y; } struct EDGE { int T; EDGE *Nxt; }; template <class T> void UpdataMin(T &x, T y) { if (y < x) { x = y; } } template <class T> void UpdataMax(T &x, T y) { if (x < y) { x = y; } } int F[100001]; int L, R, N, M, QN; int main() { cin >> N >> M; QN = N; for (int i = 1; i <= (N); ++i) { cin >> F[i]; } sort(F + 1, F + N + 1); L = lower_bound(F + 1, F + N + 1, M) - F; R = upper_bound(F + 1, F + N + 1, M) - F - 1; while (L > (N + 1) / 2 || R < (N + 1) / 2) { ++N; ++R; } cout << N - QN << endl; cin >> N; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long inf = 1e18, minf = 1e18 * (-1); int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int k, b; cin >> k >> b; int xyr[k][2], xyb[b][2]; for (long long i = 0; i < k; i++) cin >> xyr[i][0] >> xyr[i][1]; for (long long i = 0; i < b; i++) cin >> xyb[i][0] >> xyb[i][1]; if (k != b) cout << No ; else cout << Yes ; return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.