func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; vector<int> q[200010], g[200010]; int n, m, a[200010], b[200010]; unsigned long long A, B, C, ans; unsigned long long calc(unsigned long long a, unsigned long long b, unsigned long long c) { unsigned long long s[3] = {a, b, c}; sort(s, s + 3); return s[0] * A + s[1] * B + s[2] * C; } int main() { scanf( %d%d , &n, &m); scanf( %lld%lld%lld , &A, &B, &C); for (int i = 1; i <= m; i++) { scanf( %d%d , &a[i], &b[i]); if (a[i] > b[i]) swap(a[i], b[i]); q[a[i]].push_back(b[i]), q[b[i]].push_back(a[i]); } for (int i = 0; i < n; i++) { ans += (unsigned long long)i * A * ((unsigned long long)(n - i - 1) * (n - i - 2) / 2LL); ans += (unsigned long long)i * B * ((unsigned long long)(i) * (n - i - 1)); ans += (unsigned long long)i * C * ((unsigned long long)(i) * (i - 1) / 2LL); } for (int i = 1; i <= m; i++) { ans -= (unsigned long long)a[i] * a[i] * B + (unsigned long long)a[i] * b[i] * C + (unsigned long long)a[i] * (a[i] - 1) / 2LL * A; ans -= (unsigned long long)(b[i] - a[i] - 1) * a[i] * A + (unsigned long long)(b[i] - a[i] - 1) * b[i] * C + (unsigned long long)(b[i] - a[i] - 1) * (a[i] + b[i]) / 2LL * B; ans -= (unsigned long long)(n - b[i] - 1) * a[i] * A + (unsigned long long)(n - b[i] - 1) * b[i] * B + (unsigned long long)(n - b[i] - 1) * (n + b[i]) / 2LL * C; } for (int i = 0; i < n; i++) sort(q[i].begin(), q[i].end()); for (int i = 0; i < n; i++) { unsigned long long pre = 0, pre_tot = 0; for (int j = 0; j < q[i].size(); j++) { int to = q[i][j]; if (to > i) continue; ans += pre_tot * i * C + pre * A + to * pre_tot * B; pre += to; pre_tot++; } unsigned long long nex = 0, nex_tot = 0; for (int j = 0; j < q[i].size(); j++) { int to = q[i][j]; if (to < i) continue; ans += nex_tot * i * A + nex * B + to * nex_tot * C; nex += to; nex_tot++; } ans += pre_tot * nex_tot * i * B + pre_tot * nex * C + nex_tot * pre * A; } for (int i = 1; i <= m; i++) { if (q[a[i]].size() < q[b[i]].size()) g[a[i]].push_back(b[i]); else g[b[i]].push_back(a[i]); } for (int i = 0; i < n; i++) sort(g[i].begin(), g[i].end()); for (int i = 1; i <= m; i++) { int t1 = 0, t2 = 0; while (t1 < g[a[i]].size() && t2 < g[b[i]].size()) { if (g[a[i]][t1] < g[b[i]][t2]) t1++; else if (g[a[i]][t1] > g[b[i]][t2]) t2++; else { ans -= calc(a[i], b[i], g[a[i]][t1]); t1++, t2++; } } } printf( %llu n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, a[100005]; int main() { ; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); if (a[n - 1] == 1) a[n - 1] = 2; else a[n - 1] = 1; sort(a, a + n); for (int i = 0; i < n; i++) cout << a[i] << ; } |
#include <bits/stdc++.h> using namespace std; const int N = 2010; int n; string s; int a[N], tot, vis[N]; bitset<N> d, ba[N], sel[N]; void Trans(string s) { reverse(s.begin(), s.end()); while (s.size() % 8) s += 0 ; int L = s.size() / 8; for (int i = 0; i < L; i++) { a[i] = 0; for (int j = 7; ~j; j--) a[i] = a[i] * 10 + s[i * 8 + j] - 0 ; } long long S = 0; tot = 0; while (L) { S = 0; for (int i = L - 1; ~i; i--) { S = S * 100000000LL + a[i]; a[i] = S >> 32; S %= (1LL << 32); } for (int i = 0; i < 32; i++) d[tot++] = ((S >> i) & 1); while (L && a[L - 1] == 0) --L; } } int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> s; Trans(s); bitset<N> ns; int flg = 1; for (int j = tot - 1; ~j; j--) if (d[j]) if (vis[j]) { d ^= ba[j]; ns ^= sel[j]; } else { flg = 0; ns.flip(i); ba[j] = d; sel[j] = ns; vis[j] = 1; break; } if (!flg) { cout << 0 << endl; continue; } else { cout << ns.count() << ; for (int i = 0; i < N; i++) if (ns[i]) cout << i << ; cout << endl; } } return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:102400000,102400000 ) using namespace std; const long long mod = 1000000007; const int N = 201000; int n, y[N]; double k; int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) scanf( %d , &y[i]); int b = -1; for (int i = 2; i < n; ++i) if ((long long)(y[i] - y[0]) * (i - 1) != (long long)(y[i] - y[1]) * i) { b = i; break; } if (~b) { bool ans = 0, tans = 1; for (int i = 2; i < n; ++i) if (i != b) { bool t = (long long)(y[i] - y[0]) * (i - 1) != (long long)(y[i] - y[1]) * i; bool s = (long long)(y[i] - y[b]) != (long long)(y[1] - y[0]) * (i - b); if (s && t) { tans = 0; break; } } ans |= tans; tans = 1; for (int i = 2; i < n; ++i) if (i != b) { bool t = (long long)(y[i] - y[0]) * (i - b) != (long long)(y[i] - y[b]) * i; bool s = (long long)(y[i] - y[1]) * b != (long long)(y[b] - y[0]) * (i - 1); if (s && t) { tans = 0; break; } } ans |= tans; tans = 1; for (int i = 2; i < n; ++i) if (i != b) { bool t = (long long)(y[i] - y[1]) * (i - b) != (long long)(y[i] - y[b]) * (i - 1); bool s = (long long)(y[i] - y[0]) * (b - 1) != (long long)(y[b] - y[1]) * i; if (s && t) { tans = 0; break; } } ans |= tans; puts(ans ? Yes : No ); } else { puts( No ); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> inline T gcd(T a, T b) { return b ? gcd(b, a % b) : a; } template <typename T> inline T lowbit(T x) { return x & -x; } template <typename S, typename T> void debug(S s, T t) { cerr << s << == << t << n ; } template <typename T> void debug(T t) { cerr << t << n ; } template <typename T> void debug(T t[], long long st, long long ed) { for (long long i = st; i <= ed; ++i) { cerr << t[i] << ; } cerr << n ; } template <typename T> void debug(const vector<T>& t) { for (long long i = 0; i < t.size(); ++i) cerr << t[i] << ; cerr << n ; } const long long N = 2e5 + 10; void solve() { long long x, y; cin >> x >> y; if (y < x) cout << x + y << n ; else if (x == y) cout << x << n ; else cout << y - (y % x) / 2 << n ; } signed main() { long long _; cin >> _; while (_--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[100005], tmp[100005], b[100005]; bool die[100005]; int n, m; vector<long long> candidate; bool solve(int pos) { candidate.clear(); for (int i = 1; i <= n; i++) if ((!die[i]) && (a[i] & (1ll << pos))) { candidate.push_back(a[i]); die[i] = true; } for (int i = 1; i <= m; i++) tmp[i] = b[i]; int len_tmp = m; int cur = 1; m = 0; for (int i = 0; i < candidate.size(); i++) { b[++m] = candidate[i]; while (cur <= len_tmp && !(tmp[cur] & (1ll << pos))) { b[++m] = tmp[cur]; cur++; } if (cur > len_tmp && i != candidate.size() - 1) return false; b[++m] = tmp[cur]; cur++; } while (cur <= len_tmp) { b[++m] = tmp[cur]; cur++; } return true; } int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 59; i >= 0; i--) if (!solve(i)) { printf( No ); return 0; } cout << Yes n ; for (int i = 1; i <= n; i++) cout << b[i] << ; } |
#include <bits/stdc++.h> using namespace std; long long modpow(long long a, long long b, long long m = 998244353) { a %= m; long long res = 1; while (b) { if (b & 1) res = res * a % m; a = a * a % m; b >>= 1; } return res; } long long bpow(long long a, long long b) { long long res = 1; while (b) { if (b & 1) res = res * a; a = a * a; b >>= 1; } return res; } long long modinv(long long a) { return modpow(a, 998244353 - 2, 998244353); } void graph(vector<vector<int> > &adj, int m) { int x, y; for (int i = 0; i < m; i++) { cin >> x >> y; adj[x - 1].push_back(y - 1); adj[y - 1].push_back(x - 1); } } const int N = 23; struct NTT { int root, root_1, root_pw = 1 << N, c = (998244353 - 1) >> N; NTT(bool init = true) { if (init) { vector<int> pf; int n = 998244353 - 1, phi = n; for (int i = 2; i * i <= n; i++) { if (n % i == 0) { pf.push_back(i); while (n % i == 0) n /= i; } } if (n > 1) pf.push_back(n); for (int r = 2; r <= phi; r++) { bool ok = true; for (auto &x : pf) { if (modpow(r, phi / x) == 1) { ok = false; break; } } if (ok) { root = modpow(r, c), root_1 = modinv(root); break; } } } } void transform(vector<int> &a, bool invert) { int n = a.size(); for (int i = 1, j = 0; i < n; i++) { int bit = n >> 1; for (; j & bit; bit >>= 1) j ^= bit; j ^= bit; if (i < j) swap(a[i], a[j]); } for (int len = 2; len <= n; len <<= 1) { int wlen = invert ? root_1 : root; for (int i = len; i < root_pw; i <<= 1) wlen = (int)(1LL * wlen * wlen % 998244353); for (int i = 0; i < n; i += len) { int w = 1; for (int j = 0; j < len / 2; j++) { int u = a[i + j], v = (int)(1LL * a[i + j + len / 2] * w % 998244353); a[i + j] = u + v < 998244353 ? u + v : u + v - 998244353; a[i + j + len / 2] = u - v >= 0 ? u - v : u - v + 998244353; w = (int)(1LL * w * wlen % 998244353); } } } if (invert) { int n_1 = modinv(n); for (int &x : a) x = (int)(1LL * x * n_1 % 998244353); } } vector<int> multiply(vector<int> const &a, vector<int> const &b) { vector<int> fa(a.begin(), a.end()), fb(b.begin(), b.end()); int n = 1, total = a.size() + b.size(); while (n < total) n <<= 1; fa.resize(n); fb.resize(n); transform(fa, false); transform(fb, false); for (int i = 0; i < n; i++) fa[i] = (fb[i] * 1LL * fa[i]) % 998244353; transform(fa, true); fa.resize(total - 1); return fa; } }; NTT ntt; vector<int> exp(vector<int> &a, int n) { if (n == 1) return a; vector<int> res = exp(a, n / 2); res = ntt.multiply(res, res); if (n & 1) { res = ntt.multiply(res, a); } return res; } void solve() { int n, k, x; cin >> n >> k; vector<int> coeff(10, 0); for (int i = 0; i < k; i++) cin >> x, coeff[x] = 1; x = n / 2; vector<int> power = exp(coeff, x); long long ans = 0; ; for (auto &k : power) ans = (ans + k * 1LL * k) % 998244353; cout << ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t = 1, tt = 1; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; struct node { int st, en; } TV[200010]; bool cmp(node a, node b) { if (a.st == b.st) { return a.en < b.en; } return a.st < b.st; } int main() { int n; int tv1, tv2; int flag; cin >> n; tv1 = -1; tv2 = -1; flag = 1; for (int i = 0; i < n; i++) { cin >> TV[i].st >> TV[i].en; } sort(TV, TV + n, cmp); for (int i = 0; i < n && flag; i++) { if (tv1 < TV[i].st) { tv1 = TV[i].en; } else { if (tv2 < TV[i].st) { tv2 = TV[i].en; } else { flag = 0; } } } if (flag) { cout << YES << endl; } else { cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( O3 ) #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) ifstream fin( input.txt ); ofstream fout( output.txt ); bool isPrime(int x) { if (x <= 4 || x % 2 == 0 || x % 3 == 0) return x == 2 || x == 3; for (int i = 5; i * i <= x; i += 6) if (x % i == 0 || x % (i + 2) == 0) return 0; return 1; } int NumDigits(int x) { return ( x < 10 ? 1 : (x < 100 ? 2 : (x < 1000 ? 3 : (x < 10000 ? 4 : (x < 100000 ? 5 : (x < 1000000 ? 6 : (x < 10000000 ? 7 : (x < 100000000 ? 8 : (x < 1000000000 ? 9 : 10))))))))); } inline void boostIO() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout << fixed << setprecision(10); } long long int Pow10[19] = { (long long int)1, (long long int)1e1, (long long int)1e2, (long long int)1e3, (long long int)1e4, (long long int)1e5, (long long int)1e6, (long long int)1e7, (long long int)1e8, (long long int)1e9, (long long int)1e10, (long long int)1e11, (long long int)1e12, (long long int)1e13, (long long int)1e14, (long long int)1e15, (long long int)1e16, (long long int)1e17, (long long int)1e18}; long long int gcd(long long int a, long long int b) { return b ? gcd(b, a % b) : a; } long long int lcm(long long int a, long long int b) { return a * b / gcd(a, b); } long long Mod = 998244353; template <class T> struct Fenwick { vector<T> V; Fenwick(long long n) : V(n) {} void add(size_t i, T x) { for (; i < V.size(); i |= i + 1) V[i] += x; } T sum(long long i) { T r = T(); for (--i; i >= 0; i = (i & (i + 1)) - 1) r += V[i]; return r; } T sum(long long l, long long r) { return sum(r) - sum(l); } }; long long mul(long long a, long long b, long long c = 1, long long d = 1, long long e = 1, long long g = 1) { a %= Mod; b %= Mod; c %= Mod; d %= Mod; e %= Mod; g %= Mod; return (a * b % Mod * c % Mod * d % Mod * e % Mod * g % Mod); } long long Pow(long long a, long long b) { if (b == 0) return 1; if (b % 2 == 0) { long long x = Pow(a, b / 2); return mul(x, x); } else { long long x = Pow(a, b / 2); return mul(a, x, x); } } long long inf = 1e18; struct My { long long a = inf; long long b = inf; long long solved = 0; long long fee = 0; }; struct comp { bool operator()(My const& a, My const& b) const {} }; struct Tree { long long n = 1; vector<long long> t; Tree(long long nn) { while (n < nn) n *= 2; t.assign(n * 2, 0); } Tree(vector<long long>& A) { while (n < A.size()) n *= 2; t.assign(n * 2, 0); for (long long i = 0; i < (A.size()); ++i) { t[i + n] = A[i]; } for (long long i = A.size() - 1; i >= 1; --i) { t[i] = t[i + i] + t[i + i + 1]; } } long long get(long long i) { long long res = t[i += n]; for (i /= 2; i; i /= 2) { res += t[i]; } return res; } void set(long long l, long long r, long long x) { for (l += n, r += n; l <= r; l /= 2, r /= 2) { if (l & 1) t[l++] += x; ; if (~r & 1) t[r--] += x; } } }; long long gcdex(long long a, long long b, long long& x, long long& y) { if (a == 0) { x = 0; y = 1; return b; } long long x1, y1; long long d = gcdex(b % a, a, x1, y1); x = y1 - (b / a) * x1; y = x1; return d; } long long mypow(long long a, long long b = Mod - 2, long long k = Mod) { if (b == 0) return 1; long long tmp = mypow(a, b / 2, k); if ((b % 2) == 1) return mul(tmp, tmp, a); else return mul(tmp, tmp); } long long mypow2(long long a, long long m = Mod) { long long x, y; long long g = gcdex(a, m, x, y); x = (x % m + m) % m; return x; } int32_t main() { boostIO(); long long T; cin >> T; for (long long t = 0; t < T; ++t) { long long n; cin >> n; vector<long long> A(n); long long Sum = 0; long long Xor = 0; for (long long i = 0; i < (n); ++i) { cin >> A[i]; Sum += A[i]; Xor ^= A[i]; } vector<long long> ans; bitset<64> B = Xor; long long Add = 0; for (long long i = 1; i < 55; ++i) { if (B[i] == 0) { Add += (1LL << i); } } if (B[0] == 1) Add += 1; ans.push_back(Add); Sum += Add; Xor ^= Add; long long dif = Xor * 2 - Sum; ans.push_back(dif / 2); ans.push_back(dif / 2); Sum += dif / 2; Sum += dif / 2; Xor ^= dif / 2; Xor ^= dif / 2; if (Xor * 2 != Sum) { cerr << ERROR << n ; return 0; } cerr << ans = ; cout << ans.size() << n ; for (auto x : ans) { cout << x << ; } cout << n ; } return 0; } |
#include<bits/stdc++.h> using namespace std; const int Maxn=2021; const int Mod=998244353; int C[Maxn<<1|5][Maxn<<1|5]; int w[Maxn+5][Maxn+5]; int sum[Maxn+5][Maxn+5]; int ans; void init(){ C[0][0]=1; for(int i=1;i<=(Maxn<<1);i++){ C[i][0]=C[i][i]=1; for(int j=1;j<i;j++){ C[i][j]=(C[i-1][j]+C[i-1][j-1])%Mod; } } } void solve(int n,int m,int k){ for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ int t_1=C[i-1+m-j][m-j],t_2=C[i+j-1][j-1]; w[i][j]=1ll*t_1*t_2%Mod; sum[i][j]=(sum[i][j-1]+w[i][j])%Mod; } } for(int i=1;i<n;i++){ for(int j=1;j<m;j++){ ans=(ans+1ll*w[i][j]*sum[n-i][m-j])%Mod; if(k==1){ ans=(ans-1ll*w[i][j]*w[n-i][m-j]%Mod+Mod)%Mod; } } } } int main(){ init(); int n,m; scanf( %d%d ,&n,&m); solve(n,m,1); solve(m,n,0); ans=(ans<<1)%Mod; printf( %d n ,ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N_ = 1050; int N; int P[N_]; char S[N_]; int group[N_]; int find_group(int x) { if (x == group[x]) return x; return group[x] = find_group(group[x]); } void merge_group(int a, int b) { a = find_group(a); b = find_group(b); if (a != b) group[a] = b; } vector<int> pos[N_]; int cnt[N_]; int main() { scanf( %d , &N); for (int i = 1; i <= N; i++) group[i] = i; for (int i = 1; i <= N; i++) scanf( %d , &P[i]); for (int i = 1; i <= N; i++) { scanf( %s , S + 1); for (int j = 1; j <= N; j++) if (S[j] == 1 ) merge_group(i, j); } for (int i = 1; i <= N; i++) pos[find_group(i)].push_back(P[i]); for (int i = 1; i <= N; i++) sort(pos[i].begin(), pos[i].end()); for (int i = 1; i <= N; i++) { int g = find_group(i); printf( %d%c , pos[g][cnt[g]++], (i == N) ? n : ); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long int a, b, c, d, n, i, cnt = 0, snt = 0; float f, flo, fload = 0; string s, h, o, name; int main() { ios_base::sync_with_stdio(0); setlocale(LC_ALL, Russian ); ; string t; size_t i; getline(cin, t, n ); while ((i = t.find( )) != string::npos) t.erase(i, 1); s = t; reverse(s.begin(), s.end()); for (int i = 0; i < s.size(); i++) s[i] = tolower(s[i]); for (int i = 0; i < s.size(); i++) { if (s[i] >= 65 and s[i] <= 122) { if (s[i] == a or s[i] == e or s[i] == u or s[i] == i or s[i] == y or s[i] == o ) { cout << YES ; ; return 0; ; } else { cout << NO ; ; return 0; ; } } } } |
#include <bits/stdc++.h> using namespace std; const int maxn = int(3e5) + 5, inf = int(1e9) + 5; int H[maxn], sz[maxn], start[maxn], en[maxn], res[maxn]; pair<int, int> st[4 * maxn]; vector<pair<pair<int, int>, int>> Q; vector<int> dis, graph[maxn]; inline int left(int node) { return (node << 1); } inline int right(int node) { return (node << 1) + 1; } void upd(int node, int L, int R, int idx, pair<int, int> v) { if (L == R) { st[node] = v; } else { if (idx <= (L + R) / 2) upd(left(node), L, (L + R) / 2, idx, v); else upd(right(node), (L + R) / 2 + 1, R, idx, v); st[node] = max(st[left(node)], st[right(node)]); } } pair<int, int> qry(int node, int L, int R, int a, int b) { if (a > R || b < L) return {-inf, -inf}; else if (a <= L && R <= b) return st[node]; else return max(qry(left(node), L, (L + R) / 2, a, b), qry(right(node), (L + R) / 2 + 1, R, a, b)); } void dfs(int node, int ht) { sz[node] = 1, H[node] = ht; start[node] = int(dis.size()); dis.push_back(node); for (auto it : graph[node]) { dfs(it, ht + 1); sz[node] += sz[it]; } en[node] = int(dis.size()) - 1; } int main(void) { int n, q, p, node; scanf( %d%d , &n, &q); for (int i = 0; i < 4 * maxn; i++) st[i] = {-inf, -inf}; for (int i = 1; i < n; i++) { scanf( %d , &p); p--; graph[p].push_back(i); } dfs(0, 0); for (int i = 0; i < q; i++) { scanf( %d , &node); node--; Q.push_back({{sz[node] / 2, node}, i}); } vector<pair<int, int>> szs; for (int i = 0; i < n; i++) szs.push_back({sz[i], i}); sort(szs.rbegin(), szs.rend()), sort(Q.rbegin(), Q.rend()); int ptr = 0; for (auto it : Q) { if (ptr != n) { while (szs[ptr].first > it.first.first) { int node = szs[ptr].second; upd(1, 0, int(dis.size()) - 1, start[node], {H[node], node}); ptr++; if (ptr == n) break; } } res[it.second] = qry(1, 0, int(dis.size()) - 1, start[it.first.second], en[it.first.second]) .second; } for (int i = 0; i < q; i++) printf( %d n , res[i] + 1); } |
#include <bits/stdc++.h> using namespace std; int main() { int n, x, a, c1 = 0, c2 = 0; vector<int> v; cin >> n; for (int i = 1; i <= n; i++) { cin >> x; if (x & 1) { x /= 2; for (int j = 1; j <= x; j++) { cin >> a; c1 += a; } cin >> a; v.push_back(a); for (int j = 1; j <= x; j++) { cin >> a; c2 += a; } } else { x /= 2; for (int j = 1; j <= x; j++) { cin >> a; c1 += a; } for (int j = 1; j <= x; j++) { cin >> a; c2 += a; } } } sort(v.begin(), v.end()); int i = v.size() - 1; while (i >= 0) { c1 += v[i]; i--; if (i == -1) break; c2 += v[i]; i--; } cout << c1 << << c2 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; struct Point { long long x, y; Point() {} Point(long long a, long long b) : x(a), y(b) {} Point operator-(Point b) { return Point(x - b.x, y - b.y); } }; long long cross(Point x, Point y) { return x.x * y.y - x.y * y.x; } Point st[100005]; int top; long long calc(Point x, long long k) { return x.x * k + x.y; } void insert(Point p) { while (top > 1 && cross(p - st[top], st[top] - st[top - 1]) >= 0) top--; st[++top] = p; } int a[100005], b[100005], num[100005]; long long up[100005]; void convex(int n, int m, long long lb, long long rb) { long long s = 0; for (int i = 1; i <= n; i++) s += a[i]; top = 0; for (int i = n; i >= 0; i--) { insert(Point(n - i, s)); s -= a[i]; } int r = 1; for (int i = 1; i <= m; i++) { while (r < top && calc(st[r + 1], m - i) <= calc(st[r], m - i)) r++; up[i] = max(up[i], lb - calc(st[r], m - i)); } s = 0; for (int i = 1; i <= n; i++) s += b[i]; top = 0; for (int i = n; i >= 0; i--) { insert(Point(n - i, s)); s -= b[i]; } r = 1; for (int i = 1; i <= m; i++) { while (r < top && calc(st[r + 1], m - i) <= calc(st[r], m - i)) r++; up[i] = max(up[i], rb - calc(st[r], m - i)); } } bool solve1(int n, long long rb) { long long s1 = 0, s2 = 0, maxn = 0; int last2 = 0; for (int i = 1; i <= n; i++) if (num[i] != -1) { if (maxn > num[i]) return 0; s1 += num[i]; s2 += (long long)(i - last2 - 1) * (num[i] - maxn); if (s1 < up[i]) { if (s1 + s2 < up[i]) return 0; s2 -= up[i] - s1; s1 = up[i]; } last2 = i; maxn = num[i]; } else { s1 += maxn; if (s1 < up[i]) { if (s1 + s2 >= up[i]) { s2 -= up[i] - s1; s1 = up[i]; } else { long long v = up[i] - s1 - s2, t = (v + i - last2 - 1) / (i - last2); maxn += t; s1 = up[i]; s2 = t * (i - last2) - v; } } } return s1 <= rb && (s1 + s2 >= rb || num[n] != -1); } int solve2(int n, int k, long long rb) { long long s1 = 0, s2 = 0, maxn = 0; int last2 = 0; for (int i = 1; i <= n - k; i++) if (num[i] != -1) { s1 += num[i]; s2 += (long long)(i - last2 - 1) * (num[i] - maxn); if (s1 < up[i]) { s2 -= up[i] - s1; s1 = up[i]; } last2 = i; maxn = num[i]; } else { s1 += maxn; if (s1 < up[i]) { if (s1 + s2 >= up[i]) { s2 -= up[i] - s1; s1 = up[i]; } else { long long v = up[i] - s1 - s2, t = (v + i - last2 - 1) / (i - last2); maxn += t; s1 = up[i]; s2 = t * (i - last2) - v; } } } long long t = -1; for (int i = n - k + 1; i <= n; i++) if (num[i] != -1) { if (t == -1) t = num[i]; else if (t != num[i]) return -1; } if (t == -1) t = (rb - s1) / k; long long v = rb - (long long)t * k; if (s1 > v || maxn > t) return -1; return (s1 + s2 + (long long)(n - k - last2) * (t - maxn) >= v) ? t : -1; } int main() { memset(num, 255, sizeof(num)); int n, m; scanf( %d%d , &n, &m); long long lb = 0, s = 0; for (int i = 1; i <= n; i++) { scanf( %d%d , &a[i], &b[i]); lb += a[i]; s += b[i]; } sort(a + 1, a + n + 1); sort(b + 1, b + n + 1); int k; scanf( %d , &k); for (int i = 1; i <= k; i++) { int x, y; scanf( %d%d , &x, &y); num[m - x + 1] = y; } long long rb = 0; scanf( %lld , &rb); if (lb > rb || s < rb) { puts( -1 -1 ); return 0; } convex(n, m, lb, rb); if (!solve1(m, rb)) { puts( -1 -1 ); return 0; } int l = 1, r = m; while (l < r) { int mid = ((l + r) >> 1) + 1; if (solve2(m, mid, rb) != -1) l = mid; else r = mid - 1; } int ans = solve2(m, l, rb); printf( %d %d n , l, ans); return 0; } |
#include <bits/stdc++.h> int main() { long q; scanf( %ld , &q); while (q--) { long n; scanf( %ld , &n); long div = n / 4; if (n <= 3 || n == 5 || n == 7 || n == 11) { puts( -1 ); continue; } if (n & 1) { --div; } printf( %ld n , div); } return 0; } |
#include <bits/stdc++.h> using namespace std; string s; int mynum(int x, int y) { int temp; stringstream ss; ss << (s.substr(x, y - x)); ss >> temp; if (temp > 1000000 || (y - x != 1 && s[x] == 0 ) || x == y) return -1; return temp; } int main() { int mx = -1, x, y, z; cin >> s; for (int i = 0; i < s.length(); i++) { for (int j = i + 1; j < s.length(); j++) { x = mynum(0, i); y = mynum(i, j); z = mynum(j, s.length()); if (x != -1 && y != -1 && z != -1 && x + y + z > mx) mx = x + y + z; } } cout << mx; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1000 * 100 + 5; int n, l, k; long long a[maxn]; void input() { scanf( %d %d , &n, &l); for (int i = 0; i < n; i++) scanf( %lld , &a[i]); scanf( %d , &k); } long long first() { long long javab = 0, MAX = 0, x; int y; set<pair<long long, int> > second, t; for (int i = 0; i < l; i++) if (a[i] < 0) second.insert(make_pair(a[i], i)); while ((int)second.size() > k) { t.insert(*(--second.end())); second.erase(--second.end()); } for (int i = 0; i < l; i++) { if (second.find(make_pair(a[i], i)) == second.end()) javab += a[i]; else javab -= a[i]; } MAX = abs(javab); for (int i = l; i < n; i++) { if (second.find(make_pair(a[i - l], i - l)) == second.end()) { t.erase(make_pair(a[i - l], i - l)); javab -= a[i - l]; } else { javab += a[i - l]; second.erase(make_pair(a[i - l], i - l)); } if (a[i] < 0) { javab -= a[i]; second.insert(make_pair(a[i], i)); } else javab += a[i]; if ((int)t.size()) { x = t.begin()->first; y = t.begin()->second; javab -= (2 * x); second.insert(make_pair(x, y)); t.erase(make_pair(x, y)); } while ((int)second.size() > k) { x = (--second.end())->first; y = (--second.end())->second; t.insert(make_pair(x, y)); javab += (2 * x); second.erase(make_pair(x, y)); } MAX = max(MAX, javab); } return MAX; } void output() { long long javab = first(); for (int i = 0; i < n; i++) a[i] *= -1; printf( %lld n , max(javab, first())); } int main() { ios::sync_with_stdio(false); input(); output(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long int gcd(long long int a, long long int b) { return (b == 0LL ? a : gcd(b, a % b)); } long double dist(long double x, long double arayikhalatyan, long double x2, long double y2) { return sqrt((x - x2) * (x - x2) + (arayikhalatyan - y2) * (arayikhalatyan - y2)); } long long int S(long long int a) { return (a * (a + 1LL)) / 2LL; } mt19937 rnd(363542); char vow[] = { a , e , i , o , u }; int dx[] = {0, -1, 0, 1, -1, -1, 1, 1, 0}; int dy[] = {-1, 0, 1, 0, -1, 1, -1, 1, 0}; const int N = 5e5 + 30; const long long int mod = 998244353; const long double pi = acos(-1); const long double e = 1e-13; long long int bp(long long int a, long long int b = mod - 2LL) { long long int ret = 1; while (b) { if (b & 1) ret *= a, ret %= mod; a *= a; a %= mod; b >>= 1; } return ret; } ostream& operator<<(ostream& c, pair<int, int> a) { c << a.first << << a.second; return c; } struct pt { long long int x, y; int ind; int bl; bool operator==(const pt& a) { return ind == a.ind; } bool operator<(const pt& b) { if (x == b.x) return y < b.y; return x < b.x; } }; int n, m, t, k; vector<int> g[N]; int sz[N]; unordered_map<int, int> mp[N]; bool stg(int v) { vector<int> fp; for (int p : g[v]) if (sz[p] >= k - 1) fp.push_back(p); for (int i = 0; i < fp.size(); i++) for (int j = i + 1; j < fp.size(); j++) if (!mp[fp[i]][fp[j]]) return 0; return 1; } void cl() { for (int i = 1; i <= n; i++) { mp[i].clear(); g[i].clear(); sz[i] = 0; } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; cin >> t; while (t--) { cin >> n >> m >> k; for (int i = 0; i < m; i++) { int a, b; cin >> a >> b; mp[a][b] = 1; mp[b][a] = 1; g[a].push_back(b); g[b].push_back(a); } if (k > 500) { cout << -1 << endl; cl(); continue; } queue<int> q, q1; for (int i = 1; i <= n; i++) { sz[i] = g[i].size(); if (sz[i] < k) q.push(i); } int qn = n; while (q.size()) { int v = q.front(); qn--; sz[v] = 0; q.pop(); for (auto p : g[v]) { sz[p]--; if (sz[p] == k - 1) q.push(p); } } if (qn) { cout << 1 << << qn << endl; for (int i = 1; i <= n; i++) if (sz[i] >= k) cout << i << ; cl(); cout << n ; continue; } for (int i = 1; i <= n; i++) { sz[i] = g[i].size(); if (sz[i] < k - 1) q.push(i); else if (sz[i] == k - 1) q1.push(i); } bool bl = 0; while ((int)q.size() + (int)q1.size()) { if (q.size()) { int v = q.front(); sz[v] = 0; q.pop(); for (auto p : g[v]) { sz[p]--; if (sz[p] == k - 1) q1.push(p); else if (sz[p] == k - 2) q.push(p); } } else { int v = q1.front(); q1.pop(); if (sz[v] < k - 1) { continue; } if (stg(v)) { cout << 2 << endl; cout << v << ; for (int p : g[v]) if (sz[p] >= k - 1) cout << p << ; cout << n ; bl = 1; break; } q.push(v); } } if (!bl) cout << -1 << endl; cl(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; const int size = 31; const int mod = 1e8 + 7; long long hash1[maxn], jec[maxn], hash2[maxn]; int cnt[maxn]; char s[maxn]; int main() { int n; scanf( %d , &n); scanf( %s , s + 1); jec[0] = 1; for (int i = 1; i <= n; ++i) jec[i] = jec[i - 1] * size % mod; for (int i = 1; i <= n; ++i) cnt[i] = cnt[i - 1] + !(s[i] - 0 ); for (int i = 1; i <= n; ++i) { if (s[i] == 0 ) { hash1[i] = hash1[i - 1] * size + ((i & 1) + 0 ); hash2[i] = hash2[i - 1] * size + !(i & 1) + 0 ; hash1[i] %= mod; hash2[i] %= mod; } else { hash1[i] = hash1[i - 1]; hash2[i] = hash2[i - 1]; } } int q; scanf( %d , &q); while (q--) { int l, r, len; scanf( %d%d%d , &l, &r, &len); long long p, pp; if (l & 1) p = (hash1[l + len - 1] - hash1[l - 1] * jec[cnt[l + len - 1] - cnt[l - 1]] % mod + mod) % mod; else p = (hash2[l + len - 1] - hash2[l - 1] * jec[cnt[l + len - 1] - cnt[l - 1]] % mod + mod) % mod; if (r & 1) pp = (hash1[r + len - 1] - hash1[r - 1] * jec[cnt[r + len - 1] - cnt[r - 1]] % mod + mod) % mod; else pp = (hash2[r + len - 1] - hash2[r - 1] * jec[cnt[r + len - 1] - cnt[r - 1]] % mod + mod) % mod; if (p == pp) printf( Yes n ); else printf( No n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = (int)1e9 + 7; const int FFTMOD = 119 << 23 | 1; const int INF = (int)1e9 + 23111992; const long long LINF = (long long)1e18 + 23111992; 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; } inline unsigned long long isqrt(unsigned long long k) { unsigned long long r = sqrt(k) + 1; while (r * r > k) r--; return r; } inline long long icbrt(long long k) { long long 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); } mt19937 mt(chrono::high_resolution_clock::now().time_since_epoch().count()); inline int mrand() { return abs((int)mt()); } void chemthan() { int n; cin >> n; vector<long long> a(n); for (int i = (0); i < (n); ++i) cin >> a[i]; vector<int> vals; for (int i = (0); i < (n); ++i) vals.push_back(i); vector<int> pv_order(n), dp(n + 1); for (int k = (1); k < (63); ++k) { sort((vals).begin(), (vals).end(), [&](int u, int v) { return make_pair(a[u] & (1LL << k) - 1, pv_order[u]) < make_pair(a[v] & (1LL << k) - 1, pv_order[v]); }); int x = 0, y = 0; for (int i = (0); i < (n); ++i) { if (!(((a[i]) >> (k - 1)) & 1)) { x++; } } vector<int> st(n + 1 << 1); auto upd = [&](int p, int val) { for (st[p += n + 1] = val; 1 < p;) p >>= 1, st[p] = min(st[p << 1], st[p << 1 | 1]); }; auto query = [&](int l, int r) { int res = INF; for (l += n + 1, r += n + 2; l < r; l >>= 1, r >>= 1) { if (l & 1) chkmin(res, st[l++]); if (r & 1) chkmin(res, st[--r]); } return res; }; for (int i = (0); i < (n + 1); ++i) upd(i, dp[i]); vector<int> ndp(n + 1); int lo = 0; int hi = n; if (1 < k && !(((a[vals[0]]) >> (k - 1)) & 1)) { hi = pv_order[vals[0]] - 1; } ndp[0] = x + (1 < k ? query(lo, hi) : 0); for (int i = (1); i < (n + 1); ++i) { int lo = pv_order[vals[i - 1]]; int hi = n; if (i < n && (((a[vals[i - 1]]) >> (k - 1)) & 1) == (((a[vals[i]]) >> (k - 1)) & 1)) { hi = pv_order[vals[i]] - 1; } if (!(((a[vals[i - 1]]) >> (k - 1)) & 1)) { x--; ndp[i] = x + (1 < k ? query(lo, hi) : 0); if (i == n || (((a[vals[i]]) >> (k - 1)) & 1)) { chkmin(ndp[i], n - y + (1 < k ? query(0, hi) : 0)); } } else { y++; ndp[i] = n - y + (1 < k ? query(lo, hi) : 0); } } for (int i = (0); i < (n); ++i) { pv_order[vals[i]] = i + 1; } dp = ndp; } cout << dp.back() << n ; } int main(int argc, char* argv[]) { ios_base::sync_with_stdio(0), cin.tie(0); if (argc > 1) { assert(freopen(argv[1], r , stdin)); } if (argc > 2) { assert(freopen(argv[2], wb , stdout)); } chemthan(); cerr << nTime elapsed: << 1000 * clock() / CLOCKS_PER_SEC << ms n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const pair<int, int> queen[8] = {pair<int, int>(-1, 0), pair<int, int>(-1, 1), pair<int, int>(0, 1), pair<int, int>(1, 1), pair<int, int>(1, 0), pair<int, int>(1, -1), pair<int, int>(0, -1), pair<int, int>(-1, -1)}; const int maxN = 1e5 + 11; int N, A[maxN], BIT[maxN]; vector<int> pos[maxN]; pair<int, int> operator+(const pair<int, int> &a, const pair<int, int> &b) { return pair<int, int>(a.first + b.first, a.second + b.second); } void update(int x, int v) { for (int i = x; i <= N; i += i & (i ^ (i - 1))) BIT[i] += v; } int get_BIT(int x) { int res = 0; for (int i = x; i >= 1; i -= i & (i ^ (i - 1))) res += BIT[i]; return res; } int get_BIT(int l, int r) { return get_BIT(r) - get_BIT(l - 1); } int main() { cin >> N; for (int i = 1; i <= N; i++) cin >> A[i], pos[A[i]].push_back(i); long long ans = 0; for (int i = 1; i <= N; i++) update(i, 1); for (int i = 1, p = 1; i <= 1e5; i++) { if (pos[i].empty()) continue; int q = lower_bound(pos[i].begin(), pos[i].end(), p) - pos[i].begin(); for (int j = 0; j < (int)pos[i].size(); j++) { q %= (int)pos[i].size(); if (p <= pos[i][q]) ans += get_BIT(p, pos[i][q]); else ans += get_BIT(1, pos[i][q]) + get_BIT(p, N); update(pos[i][q], -1); p = pos[i][q]; q++; } } cout << ans; } |
#include <bits/stdc++.h> using namespace std; long long N = 10000000000000000; int points = 0; int main() { long long xo, yo, ax, ay, bx, by; cin >> xo >> yo >> ax >> ay >> bx >> by; long long x, y, t; cin >> x >> y >> t; long long X[100], Y[100]; X[0] = xo, Y[0] = yo; for (int i = 1; i < 55; i++) { X[i] = ax * X[i - 1] + bx; Y[i] = ay * Y[i - 1] + by; points++; if (X[i] >= N || Y[i] >= N) break; } long long maxi = 0; for (int i = 0; i <= points; i++) { for (int j = 0; j <= points; j++) { long long tmpx = X[i], tmpy = Y[i], tt = t, ans = 0; tt -= abs(X[i] - x) + abs(y - Y[i]); if (tt >= 0) ans = 1; int k = i + 1; if (i > j) k = i - 1; for (;;) { if ((k > i && k > j) || (k < i && k < j)) break; long long curx = X[k], cury = Y[k]; tt -= abs(tmpx - curx) + abs(tmpy - cury); tmpx = curx, tmpy = cury; if (tt < 0) break; ans++; if (i <= j) k++; else k--; } maxi = max(maxi, ans); } } cout << maxi << endl; } |
#include <bits/stdc++.h> #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; const int maxn = 1500 + 5; int count(vector<int>& rec, vector<int>& temp, int l, int h) { if (h - l < 1) return 0; int m = (l + h) / 2; int ans = count(rec, temp, l, m) + count(rec, temp, m + 1, h); int a = l, b = m + 1; int i = l; for (i = l; i < h; ++i) { if (a > m || b > h) break; if (temp[a] > temp[b]) { ans += m - a + 1; rec[i] = temp[b]; ++b; } else { rec[i] = temp[a]; ++a; } } while (a <= m) { rec[i++] = temp[a++]; } while (b <= h) { rec[i++] = temp[b++]; } for (int i = l; i <= h; ++i) { temp[i] = rec[i]; } return ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector<int> pr(n), tem(n); for (int i = 0; i < n; ++i) { cin >> pr[i]; tem[i] = pr[i]; } int toi = count(pr, tem, 0, n - 1); toi %= 2; int m; cin >> m; while (m--) { int l, r; cin >> l >> r; int le = r - l + 1; int res = le * (le - 1) / 2; toi += res; toi %= 2; if (toi == 0) cout << even n ; else cout << odd n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, i, sum; int xx[10005], yy[10005], a[10005]; while (scanf( %d , &n) != EOF) { sum = 0; for (i = 0; i <= n; i++) { scanf( %d %d , &xx[i], &yy[i]); } for (i = 0; i < n; i++) { if (xx[i] == xx[i + 1] && yy[i + 1] > yy[i]) a[i] = 1; if (xx[i] < xx[i + 1] && yy[i + 1] == yy[i]) a[i] = 2; if (xx[i] == xx[i + 1] && yy[i + 1] < yy[i]) a[i] = 3; if (xx[i] > xx[i + 1] && yy[i + 1] == yy[i]) a[i] = 4; } for (i = 0; i < n - 1; i++) { if (a[i] > a[i + 1]) sum++; } printf( %d n , sum); } } |
#include <bits/stdc++.h> using namespace std; const int N = 1e8 + 5; long long MAX = 1e9; long long MOD = 1e9 + 7; long long Mod = 1e9 + 7; double EPS = 0.0001; long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); } long long lcm(long long a, long long b) { return ((a * b) / gcd(a, b)); } const int dx[] = {1, -1, 0, 0, 0, 0}; const int dy[] = {0, 0, 1, -1, 0, 0}; int main() { int wait; long long n, k; int prin = 0; scanf( %I64d , &n); scanf( %I64d , &k); long long check = k * (k - 1); if (check < n) { cout << NO n ; return 0; } cout << YES n ; for (long long i = 1; i < k + 1; i++) { for (long long j = i + 1; j < k + 1; j++) { cout << i << << j << endl; prin++; if (prin == n) return 0; cout << j << << i << endl; prin++; if (prin == n) return 0; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1000000LL * 1000000LL * 1000000LL; int n, k; int tyl, l, sum; int T[1000][1000]; int main() { scanf( %d %d , &n, &k); tyl = n * n; for (int i = 1; i <= n; i++) { for (int j = n; j >= k; j--) { T[i][j] = tyl; tyl--; } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (j == k) { sum += T[i][j]; } if (T[i][j] == 0) { l++; T[i][j] = l; } } } printf( %d n , sum); for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { printf( %d , T[i][j]); } printf( n ); } } |
#include <bits/stdc++.h> using namespace std; void solve() { string s; cin >> s; vector<long long> cnt(26, 0); for (auto x : s) { cnt[x - a ]++; } deque<long long> d; for (long long i = 0; i < 26; i++) { if (cnt[i]) { d.push_back(i); } } deque<long long> ans; if ((long long)d.size() == 2) { if (d[0] + 1 == d[1]) { cout << No answer << n ; return; } ans = d; } else if ((long long)d.size() == 3) { if (d[0] + 1 == d[1] && d[1] + 1 == d[2]) { cout << No answer << n ; return; } else if (d[0] + 1 == d[1]) { ans.push_back(d[0]); ans.push_back(d[2]); ans.push_back(d[1]); } else { ans.push_back(d[1]); ans.push_back(d[0]); ans.push_back(d[2]); } } else { long long fl = 1; while ((long long)d.size() > 1) { if (fl) { ans.push_back(d.front()); d.pop_front(); } else { ans.push_back(d.back()); d.pop_back(); } fl ^= 1; } ans.push_front(d[0]); } for (auto x : ans) { for (long long i = 0; i < cnt[x]; i++) { cout << (char)(x + a ); } } cout << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int tc; tc = 1; cin >> tc; for (int i = 1; i <= tc; i++) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int dx[] = {0, -1, 0, 1}; int dy[] = {1, 0, -1, 0}; int c[2010][2010], edge[2010]; long double s[2010], C[2010][2010]; int main(int argc, char *argv[]) { int n, k; scanf( %d%d , &n, &k); for (int i = (1); i <= (n); ++i) { C[i][0] = 1; for (int j = (1); j <= (i); ++j) C[i][j] = C[i][j - 1] * (i - j + 1) / j; } for (int i = (1); i <= (n - 1); ++i) for (int j = (i + 1); j <= (n); ++j) { scanf( %d , &c[i][j]); c[j][i] = c[i][j]; } long double m = 0; for (int i = (1); i <= (n); ++i) { edge[i] = 0; for (int j = (1); j <= (n); ++j) if (c[i][j] >= 0 && i != j) edge[i]++; s[i] = 0; if (edge[i] < k) continue; s[i] = C[edge[i]][k]; m += s[i]; } long double ans = 0; for (int i = (1); i <= (n); ++i) { if (edge[i] <= 0) continue; long double p = (s[i] * k) / (m * edge[i]); long double sum = 0; for (int j = (1); j <= (n); ++j) if (c[i][j] >= 0 && i != j) sum += (long double)c[i][j]; ans += sum * p; } ans = ans + 1e-5; printf( %I64d n , (long long)ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, h, a; vector<int> home, away; cin >> n; vector<int> cnt(100000, 0); vector<int> ans_home(n, 0); vector<int> ans_away(n, 0); for (int i = 0; i < n; i++) { cin >> h >> a; home.push_back(h); away.push_back(a); } for (int i = 0; i < n; i++) cnt[home[i] - 1]++; for (int i = 0; i < n; i++) { ans_home[i] = n - 1 + cnt[away[i] - 1]; ans_away[i] = 2 * (n - 1) - ans_home[i]; } for (int i = 0; i < n; i++) cout << ans_home[i] << << ans_away[i] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int mod = 1e9 + 7; const int inf = 1e9; const int N = 1e5; vector<long long int> tot(N); vector<bool> vis(N); vector<int> adj[N]; void dfs(int node) { vis[node] = true; for (auto &i : adj[node]) { if (!vis[i]) { dfs(i); tot[node] += tot[i]; } } if ((int)adj[node].size() == 1 && node != 0) tot[node]++; } void solve() { vector<tuple<int, int, long long int, int>> vc; int n, u, v, x; long long int s, w; cin >> n >> s; for (int i = 0; i < n - 1; i++) { cin >> u >> v >> w >> x; u--, v--; adj[u].push_back(v); adj[v].push_back(u); vc.push_back({u, v, w, x}); } dfs(0); int cnt = 0; long long int sum = 0; priority_queue<tuple<long long int, long long int, long long int>> q1, q2; for (auto &i : vc) { u = get<0>(i); v = get<1>(i); w = get<2>(i); x = get<3>(i); long long int tp = min(tot[u], tot[v]); sum += tp * w; if (x == 1) q1.push({tp * w - tp * (w / 2), tp, w / 2}); else q2.push({tp * w - tp * (w / 2), tp, w / 2}); } long long int r1, r2, r3; while (sum > s) { tuple<long long int, long long int, long long int> x; tuple<long long int, long long int, long long int> y; r1 = r2 = r3 = 0; if (!q1.empty()) x = q1.top(); if (!q2.empty()) y = q2.top(); if (!q1.empty()) { long long int a = get<0>(x); long long int b = get<1>(x); long long int c = get<2>(x); r1 = a; q1.pop(); if (q1.empty()) r3 = b * c - b * (c / 2); else { r3 = max(get<0>(q1.top()), b * c - b * (c / 2)); } q1.push(x); } if (!q2.empty()) r2 = get<0>(y); if (r1 >= r2 || sum - r1 <= s) { cnt++; long long int a = get<0>(x); long long int b = get<1>(x); long long int c = get<2>(x); sum -= a; q1.pop(); q1.push({b * c - b * (c / 2), b, c / 2}); } else { if (r1 + r3 >= r2) { long long int a = get<0>(x); long long int b = get<1>(x); long long int c = get<2>(x); sum -= a; q1.pop(); q1.push({b * c - b * (c / 2), b, c / 2}); cnt++; } else { long long int a = get<0>(y); long long int b = get<1>(y); long long int c = get<2>(y); sum -= a; q2.pop(); q2.push({b * c - b * (c / 2), b, c / 2}); cnt += 2; } } } cout << cnt << n ; for (int i = 0; i < n; i++) { tot[i] = 0; vis[i] = false; adj[i].clear(); } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> void Get(int &T) { char C; bool F = 0; for (; C = getchar(), C < 0 || C > 9 ;) if (C == - ) F = 1; for (T = C - 0 ; C = getchar(), C >= 0 && C <= 9 ; T = T * 10 + C - 0 ) ; F && (T = -T); } int L[2005][2005]; int R[2005][2005]; bool Rot; int N, M, K; int GetL(int X, int Y) { if (L[X][Y] == Y) return Y; return L[X][Y] = GetL(X, L[X][Y]); } int GetR(int X, int Y) { if (R[X][Y] == Y) return Y; return R[X][Y] = GetR(X, R[X][Y]); } void Init() { Get(N); Get(M); Get(K); if (N > M) { std::swap(N, M); Rot = 1; } for (int i = 1; i <= N; i++) for (int j = 1; j <= M + 1; j++) L[i][j] = R[i][j] = j; } int Ans; int AnsX, AnsY; int X0, Y0; void Fresh(int X, int Y) { if (X < 1 || X > N) return; if (Y < 1 || Y > M) return; int Dis = std::abs(X - X0) + std::abs(Y - Y0); if (Rot) { std::swap(X, Y); } if (Ans > Dis) { Ans = Dis; AnsX = X; AnsY = Y; } else if (Ans == Dis) { if (AnsX > X) { AnsX = X; AnsY = Y; } else if (AnsX == X && AnsY > Y) { AnsX = X; AnsY = Y; } } } void Work() { for (int k = 1; k <= K; k++) { Ans = 0x2f2f2f2f; Get(X0); Get(Y0); if (Rot) std::swap(X0, Y0); for (int d = 0; d <= Ans; d++) { int X; int Y; if (X0 - d > 0) { X = X0 - d; Y = L[X][Y0]; Fresh(X, Y); Y = R[X][Y0]; Fresh(X, Y); } if (X0 + d <= N) { X = X0 + d; Y = L[X][Y0]; Fresh(X, Y); Y = R[X][Y0]; Fresh(X, Y); } } printf( %d %d n , AnsX, AnsY); if (Rot) { std::swap(AnsX, AnsY); } L[AnsX][AnsY] = L[AnsX][AnsY - 1]; R[AnsX][AnsY] = R[AnsX][AnsY + 1]; for (int j = AnsY + 1; L[AnsX][j] != j; j++) L[AnsX][j] = L[AnsX][AnsY]; for (int j = AnsY - 1; L[AnsX][j] != j; j--) R[AnsX][j] = R[AnsX][AnsY]; } } int main() { Init(); Work(); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long inf = 0x3f3f3f3f; const double eps = 1e-6; const long long mod = 1000000007; inline string getstr(string &s, long long l, long long r) { string ret = ; for (long long i = l; i <= r; i++) ret.push_back(s[i]); return ret; } long long modpow(long long x, long long y, long long md = mod) { long long ret = 1; do { if (y & 1) ret = (long long)ret * x % md; x = (long long)x * x % md; } while (y >>= 1); return ret; } long long n, mn; vector<pair<long long, long long> > g[3003]; long long dfs(long long x, long long p, long long cur, long long mv) { long long ret = 0; mn = min(mn, cur - mv); for (auto to : g[x]) if (to.first != p) { ret += (to.second > 0); ret += dfs(to.first, x, cur - to.second, max(mv, cur - to.second)); } return ret; } signed main() { cin >> n; for (long long i = 1; i < n; i++) { long long x, y; cin >> x >> y; g[x].push_back(make_pair(y, -1)); g[y].push_back(make_pair(x, 1)); } long long ans = 1e9; for (long long i = 1; i <= n; i++) { mn = inf; ans = min(ans, dfs(i, -1, 0, 0) + mn); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n; vector<pair<int, int>> vp; int chk() { bool ok = true; int d = vp[2].first - vp[1].first; for (int i = 2; i < n; i++) if (vp[i].first - vp[i - 1].first != d) ok = false; if (ok) { printf( %d n , vp[0].second + 1); exit(0); } d = vp[2].first - vp[0].first; ok = true; for (int i = 3; i < n; ++i) if (vp[i].first - vp[i - 1].first != d) ok = false; if (ok) { printf( %d n , vp[1].second + 1); exit(0); } d = vp[1].first - vp[0].first; int cnt = 0, index = 0; ok = true; for (int i = 1; i < n; i++) { if (vp[i].first - vp[i - 1].first == d) continue; cnt++; if (i == n - 1 or vp[i + 1].first - vp[i - 1].first != d) ok = false; index = vp[i].second; i++; } if (ok and cnt == 1) { cout << index + 1 << endl; exit(0); } } int main() { scanf( %d , &n); vp.resize(n); for (int i = 0; i < n; ++i) { scanf( %d , &vp[i].first); vp[i].second = i; } sort(begin(vp), end(vp)); chk(); if (n < 4) return !printf( 1 n ); reverse(begin(vp), end(vp)); chk(); cout << -1 << endl; } |
#include <bits/stdc++.h> using namespace std; int buff1, buff2; void solution(vector<int> v) { map<int, int> counter; for (int n : v) counter[n]++; vector<int> counts; for (auto it : counter) { counts.push_back(it.second); } sort(counts.begin(), counts.end(), greater<int>()); int cur = INT_MAX, ret = 0; for (int n : counts) { if (cur <= 1) { break; } cur = min(cur - 1, n); ret += cur; } cout << ret << endl; } int main() { int nTest; cin >> nTest; for (int i = 0; i < nTest; i++) { int N; cin >> N; vector<int> v; for (int i = 0; i < N; i++) { cin >> buff1; v.push_back(buff1); } solution(v); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; int main() { cin >> n; for (int i = 0, c = 2 % n; i < n - 1; i++, c = (c + i + 1) % n) { if (c) cout << c << ; else cout << n << endl; } cout << endl; return 0; } |
#include <bits/stdc++.h> int ss[250000], ff[250000], cc[250000], rr[250000], ii[250000]; int compare(const void *a, const void *b) { int i = *(int *)a; int j = *(int *)b; return rr[i] - rr[j]; } int main() { static int aa[400]; typedef int ian[400]; static ian dp_[400], dq_[400], *dp = dp_, *dq = dq_, *tmp; int n, m, h, h_, i, r, s, f; long long v; scanf( %d%d , &n, &m); for (i = 0; i < n; i++) scanf( %d , &aa[i]); for (h = 0; h < m; h++) { scanf( %d%d%d%d , &ss[h], &ff[h], &cc[h], &rr[h]); ss[h]--; ff[h]--; ii[h] = h; } qsort(ii, m, sizeof *ii, compare); for (s = 0; s < n; s++) for (f = s + 1; f < n; f++) dp[s][f] = aa[f] - aa[s]; v = 0; for (r = 0, h_ = 0; r <= n; r++) { while (h_ < m && rr[h = ii[h_]] == r) { long long x; if (v < (x = (long long)dp[ss[h]][ff[h]] * cc[h])) v = x; h_++; } for (s = 0; s < n; s++) { i = s; for (f = s + 1; f < n; f++) { while (i < f && dp[s][i] < aa[f] - aa[i]) i++; dq[s][f] = aa[f] - aa[i - 1]; if (dq[s][f] > dp[s][i]) dq[s][f] = dp[s][i]; } } tmp = dp; dp = dq; dq = tmp; } printf( %lld n , v); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, k; int ans; inline int f(int n) { int rt = 0; for (int i = 0; n / pow(k, i) != 0; i++) rt += n / pow(k, i); return rt; } void bin_search() { int s = 1, e = n; int m; while (s <= e) { m = (s + e) / 2; if (f(m) >= n) { e = m - 1; ans = m; } else s = m + 1; } } int main() { cin >> n >> k; bin_search(); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long f[200][200], a[200], x[200], y[200], d; int n; long long dist(int i, int j) { return abs(x[i] - x[j]) + abs(y[i] - y[j]); } int main() { cin >> n >> d; for (int i = 2; i <= n - 1; i++) cin >> a[i]; for (int i = 1; i <= n; i++) cin >> x[i] >> y[i]; memset(f, 61, sizeof(f)); for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) if (i != j) f[i][j] = dist(i, j) * d - a[i]; for (int i = 1; i <= n; i++) f[i][i] = 0; for (int k = 1; k <= n; k++) for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) f[i][j] = min(f[i][j], f[i][k] + f[k][j]); if (f[1][n] <= 0) cout << 0; else cout << f[1][n]; return 0; } |
#include <bits/stdc++.h> using namespace std; const int mx = 4e5 + 10; int sum[mx]; int x[mx]; int n, m; void add(int x) { while (x <= 2 * n + 1) { sum[x]++; x += x & (-x); } } int query(int x) { int ans = 0; while (x) { ans += sum[x]; x -= x & (-x); } return ans; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %d , &x[i]); int cnt = n + 1; long long int a = 0, b = 0; add(cnt); for (int i = 1; i <= n; i++) { if (x[i] < m) cnt--; else cnt++; a += query(cnt - 1); add(cnt); } cnt = n + 1; memset(sum, 0, sizeof(sum)); add(cnt); for (int i = 1; i <= n; i++) { if (x[i] <= m) cnt--; else cnt++; b += query(cnt - 1); add(cnt); } printf( %I64d n , a - b); return 0; } |
#include <bits/stdc++.h> using namespace std; void topsort(long long int s, vector<vector<long long int>> &graph, vector<long long int> &vis, vector<long long int> &ans) { vis[s] = 1; for (long long int i = 0; i < graph[s].size(); i++) { if (vis[graph[s][i]] == 0) topsort(graph[s][i], graph, vis, ans); } ans.push_back(s); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n; cin >> n; vector<long long int> v; for (long long int i = 0; i < n; i++) { long long int num; cin >> num; v.push_back(num); } vector<vector<long long int>> graph(n); for (long long int i = 0; i < n; i++) { for (long long int j = 0; j < n; j++) { if ((v[i] % 3 == 0 && v[j] == v[i] / 3) || v[j] == v[i] * 2) graph[i].push_back(j); } } vector<long long int> ans; vector<long long int> vis(n, 0); for (long long int i = 0; i < n; i++) { if (vis[i] == 0) topsort(i, graph, vis, ans); } reverse(ans.begin(), ans.end()); for (long long int i = 0; i < ans.size(); i++) { cout << v[ans[i]] << ; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 4e5 + 11; set<int> ans; int n, m, len; int a[N], b[N], c[N], p[N]; inline void manacher() { c[0] = -2; for (register int i = 0; i <= n + n - 2; ++i) c[++len] = b[i], c[++len] = -1; c[len + 1] = -3; int id = 0, mx = 0; for (register int i = 1; i <= len; ++i) { if (mx > i) p[i] = min(mx - i, p[id + id - i]); else p[i] = 1; while (c[i + p[i]] == c[i - p[i]]) ++p[i]; if (p[i] + i > mx) id = i, mx = i + p[i]; } } int main() { scanf( %d%d , &n, &m); for (register int i = 0; i <= n - 1; ++i) scanf( %d , a + i); sort(a, a + n); for (register int i = 1; i <= n; ++i) b[i - 1] = (a[i % n] - a[i - 1] + m) % m; for (register int i = 0; i <= n - 1; ++i) b[i + n] = b[i]; manacher(); for (int i = 2; i <= len; i += 2) if (p[i] / 2 >= n / 2 && (a[(i / 2 - 1 + n) % n] + a[(i / 2 + 1) % n]) % m == a[i / 2 % n] * 2 % m) ans.insert(a[i / 2 % n] * 2 % m); if (n % 2 == 0) { for (int i = 1; i <= len; i += 2) if (p[i] >= n) ans.insert((a[i / 2 % n] + a[(i / 2 + 1) % n]) % m); } printf( %d n , ans.size()); for (auto v : ans) printf( %d , v); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000000 + 1; int a[MAXN], parent[MAXN], rnk[MAXN], p[10 * MAXN]; int n; void make_set(int v) { parent[v] = v; rnk[v] = 0; } int find_set(int v) { if (v == parent[v]) return v; return parent[v] = find_set(parent[v]); } void union_sets(int u, int v) { u = find_set(u); v = find_set(v); if (u != v) { if (rnk[u] < rnk[v]) swap(u, v); parent[v] = u; if (rnk[u] == rnk[v]) ++rnk[u]; } } int gcd(int x, int y) { return x ? gcd(y % x, x) : y; } bool check(int m[3]) { return gcd(m[0], m[1]) == 1 && gcd(m[1], m[2]) == 1 && gcd(m[0], m[2]) == 1; } int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) { scanf( %d , &a[i]); make_set(i); p[a[i]] = i + 1; } sort(a, a + n); for (int i = 2; i * i <= 2 * a[n - 1]; ++i) for (int j = 1; j < i; ++j) { int t[3] = {i * i - j * j, 2 * i * j, i * i + j * j}; if (!check(t)) continue; int pos[3]; for (int k = 0; k < 3; ++k) if (t[k] <= a[n - 1]) pos[k] = p[t[k]]; if (t[0] <= a[n - 1] && t[1] <= a[n - 1] && pos[0] && pos[1]) union_sets(pos[0] - 1, pos[1] - 1); if (t[1] <= a[n - 1] && t[2] <= a[n - 1] && pos[1] && pos[2]) union_sets(pos[1] - 1, pos[2] - 1); if (t[0] <= a[n - 1] && t[2] <= a[n - 1] && pos[0] && pos[2]) union_sets(pos[0] - 1, pos[2] - 1); } set<int> f; for (int i = 0; i < n; ++i) f.insert(find_set(i)); printf( %d , f.size()); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<pair<int, int>> edges; vector<int> g[300001]; int police[300001]; int nearest[300001]; int stat[300001]; void dfs1(int beta, int baap) { int mini = (police[beta] ? 0 : (int)1e9), minpos = (police[beta] ? beta : -1); for (int i = 0; i < g[beta].size(); i++) { int pota = g[beta][i]; if (pota == baap) continue; dfs1(pota, beta); if (mini > 1 + nearest[pota]) { mini = 1 + nearest[pota]; minpos = stat[pota]; } } nearest[beta] = mini; stat[beta] = minpos; } void dfs2(int beta, int baap) { int up = (baap == -1 ? (int)1e9 : 1 + nearest[baap]); if (up < nearest[beta]) { nearest[beta] = up; stat[beta] = stat[baap]; } for (int i = 0; i < g[beta].size(); i++) { int pota = g[beta][i]; if (pota == baap) continue; dfs2(pota, beta); } } int main() { int n, k, d; scanf( %d %d %d , &n, &k, &d); for (int i = 0; i < k; i++) { int x; scanf( %d , &x); police[x] = 1; } for (int i = 0; i < n - 1; i++) { int x, y; scanf( %d %d , &x, &y); g[x].push_back(y); g[y].push_back(x); edges.push_back(make_pair(x, y)); } dfs1(1, -1); dfs2(1, -1); vector<int> ans; for (int i = 0; i < n - 1; i++) { int u = edges[i].first, v = edges[i].second; if (stat[u] != stat[v]) ans.push_back(i + 1); } printf( %d n , (int)ans.size()); for (int i = 0; i < ans.size(); i++) { printf( %d , ans[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; void _split(vector<string>& vc, const string& str, char ch) { string temp; for (int i = 0; i <= str.size(); i++) if (i == str.size() || str[i] == ch) { vc.emplace_back(temp); temp = ; } else { temp += str[i]; } } void _output(vector<string>::iterator _) { cerr << n ; cerr.flush(); } template <typename T, typename... Args> void _output(vector<string>::iterator it, T val, Args... args) { cerr << *it << = << val << ; _output(++it, args...); } const size_t MAX_N = 1000 + 5; int n, a[MAX_N], b[MAX_N], cnt[MAX_N]; bool used[MAX_N]; inline bool check() { int cnt = 0; memset(used, 0, sizeof used); for (int i = 0; i < n; i++) if (a[i] != b[i]) cnt++; if (cnt != 1) return false; for (int i = 0; i < n; i++) used[a[i]] = true; for (int i = 1; i <= n; i++) if (!used[i]) return false; return true; } int main() { int diff_cnt = 0, i, j, k; scanf( %d , &n); for (i = 0; i < n; i++) scanf( %d , a + i); for (i = 0; i < n; i++) scanf( %d , b + i); for (i = 0; i < n; i++) diff_cnt += a[i] != b[i]; if (!diff_cnt) { for (i = 0; i < n; i++) cnt[a[i]]++; for (i = 0; i < n; i++) cnt[b[i]]++; for (j = 1; j <= n; j++) if (cnt[j] == 4) break; for (k = 1; k <= n; k++) if (cnt[k] == 0) break; for (i = 0; i < n; i++) if (a[i] == j) { printf( %d , k); break; } else { printf( %d , a[i]); } for (; i < n; i++) printf( %d , a[i]); } else if (diff_cnt == 1) { for (i = 0; i < n; i++) if (a[i] == b[i]) cnt[a[i]]++; for (j = 1; j <= n; j++) if (!cnt[j]) break; for (i = 0; i < n; i++) if (a[i] == b[i]) printf( %d , a[i]); else printf( %d , j); } else { vector<int> lft, pos; for (i = 0; i < n; i++) if (a[i] == b[i]) cnt[a[i]]++; else pos.emplace_back(i); for (i = 1; i <= n; i++) if (!cnt[i]) lft.emplace_back(i); for (int x : pos) for (int l : lft) if (l != a[x]) { int t = a[x]; a[x] = l; if (check()) { for (i = 0; i < n; i++) printf( %d , a[i]); return 0; } a[x] = t; } } } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const long long INF = 1e18; const int MAXN = 3e5 + 10; const int MAXM = 1e4 + 500; const int N = 5600 + 15; const double EPS = 1e-9; double len(complex<long long> a) { return sqrt(a.real() * a.real() + a.imag() * a.imag()); } long long sq(complex<long long> a) { return a.real() * a.real() + a.imag() * a.imag(); } complex<long long> perp(complex<long long> p) { return {-p.imag(), p.real()}; } long long dotProduct(complex<long long> a, complex<long long> b) { return (conj(a) * b).real(); } long long crossProduct(complex<long long> a, complex<long long> b) { return (conj(a) * b).imag(); } long long orient(complex<long long> a, complex<long long> b, complex<long long> c) { return crossProduct(b - a, c - a); } bool inDisk(complex<long long> a, complex<long long> b, complex<long long> p) { return dotProduct(a - p, b - p) <= 0; } bool onSegment(complex<long long> a, complex<long long> b, complex<long long> p) { return orient(a, b, p) == 0 && inDisk(a, b, p); }; struct cmpX { bool operator()(complex<long long> a, complex<long long> b) { return make_pair(a.real(), a.imag()) < make_pair(b.real(), b.imag()); } }; struct line { complex<long long> v; long long c; line(complex<long long> v, long long c) : v(v), c(c) {} line(long long a, long long b, long long c) : v({b, -a}), c(c) {} line(complex<long long> p, complex<long long> q) : v(q - p), c(crossProduct(v, p)) {} long long side(complex<long long> p) { return crossProduct(v, p) - c; } double dist(complex<long long> p) { return abs(side(p)) / len(v); } line perpThrough(complex<long long> p) { return {p, p + perp(v)}; } bool cmpProj(complex<long long> p, complex<long long> q) { return dotProduct(v, p) < dotProduct(v, q); } line translate(complex<long long> t) { return {v, c + crossProduct(v, t)}; } complex<long long> proj(complex<long long> p) { return p - perp(v) * side(p) / sq(v); } }; double segPoint(complex<long long> a, complex<long long> b, complex<long long> p) { if (a != b) { line l(a, b); if (l.cmpProj(a, p) && l.cmpProj(p, b)) return l.dist(p); } return min(abs(p - a), abs(p - b)); } bool inAngle(complex<long long> a, complex<long long> b, complex<long long> c, complex<long long> p) { if (orient(a, b, c) < 0) swap(b, c); return orient(a, b, p) >= 0 && orient(a, c, p) <= 0; } bool isInsidePol(vector<complex<long long> > &a, complex<long long> b) { int n = a.size(); int pos = 0, neg = 0; for (int i = 0; i < n - 1; i++) { if (onSegment(a[i], a[(i + 1) % n], b)) return false; line l(a[i], a[i + 1]); if (l.side(b) > 0) pos++; else neg++; } line l(a[n - 1], a[0]); if (l.side(b) > 0) pos++; else neg++; return ((!pos && neg == n) || (!neg && pos == n)); } long long i, j, k; long long n, m, t; long long binpow(long long val, long long deg) { if (!deg) return 1; if (deg & 1) return binpow(val, deg - 1) * val % MOD; long long res = binpow(val, deg >> 1); return (res * res) % MOD; } long long inv(long long a, long long m) { return binpow(a, m - 2); } long long add(long long a, long long b) { return (a += b) < MOD ? a : a - MOD; } long long mul(long long a, long long b) { return a * b % MOD; } long long cleverMulMod(long long a, long long b) { if (b == 0) return 0; long long s = cleverMulMod(a, b / 2); if (b % 2 == 1) return (a % MOD + 2ll * (s % MOD)) % MOD; else return (2ll * (s % MOD)) % MOD; } class Matrix { public: vector<vector<long long> > A; int dim; Matrix(int n) : dim(n) { A.assign(n, vector<long long>(n)); } vector<long long> &operator[](int n) { return A[n]; } }; Matrix operator*(Matrix A, Matrix B) { int n = A.dim; Matrix C(n); for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) for (int k = 0; k < n; k++) { C[i][j] = add(C[i][j], mul(A[i][k], B[k][j])); } return C; } Matrix operator^(Matrix A, long long k) { int n = A.dim; Matrix R(n); for (int i = 0; i < n; i++) R[i][i] = 1; while (k > 0) { if (k % 2) R = R * A; A = A * A; k /= 2; } return R; } long long first, second, need; bool check(long long k) { long long total = 2 * k * (k + 1) + 1; k++; if (k > first) { total -= (k - first) * (k - first); } if (k > second) { total -= (k - second) * (k - second); } if (k > n - first) { total -= (k - (n - first)) * (k - (n - first)); } if (k > n - second) { total -= (k - (n - second)) * (k - (n - second)); } if (k > first + second) { total += (k - (first + second)) * (k - (first + second) + 1) / 2; } if (k + first > n + second) { total += (k + first - n - second) * (k + first - n - second + 1) / 2; } if (k + first + second - n - n > 0) { total += (k + first + second - n - n) * (k + first + second - n - n + 1) / 2; } if (k + second > n + first) { total += (k + second - n - first) * (k + second - n - first + 1) / 2; } return total >= need; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> first >> second >> need; n++; long long left = 0, right = 1e9 + 3; while (right - left > 1) { long long mid = (right + left) / 2; if (check(mid)) right = mid; else left = mid; } if (check(left)) right = left; cout << right << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; pair<int, long long> solve(long long n) { if (!n) return {0, 0}; long long a = 1; while ((a + 1) * (a + 1) * (a + 1) <= n) a++; pair<int, long long> r1 = solve(n - a * a * a), r2 = solve((a * a * a) - 1 - (a - 1) * (a - 1) * (a - 1)); if (r1.first > r2.first) return {1 + r1.first, r1.second + a * a * a}; if (r1.first < r2.first) return {1 + r2.first, r2.second + (a - 1) * (a - 1) * (a - 1)}; return {1 + r1.first, max(a * a * a + r1.second, (a - 1) * (a - 1) * (a - 1) + r2.second)}; } int main() { long long n; scanf( %lld , &n); pair<int, long long> r = solve(n); printf( %d %lld n , r.first, r.second); return 0; } |
#include <bits/stdc++.h> using namespace std; unordered_map<int, int> X, pre; unordered_map<int, int>::iterator it; int Find(int u) { it = pre.find(u); if (it == pre.end()) { X[u] = 0; return u; } int v = it->second; int tmp = Find(v); X[u] ^= X[v]; return pre[u] = tmp; } bool join(int a, int b, int x) { int c = Find(a), d = Find(b); if (c == d) return false; pre[d] = c; X[d] = X[a] ^ X[b] ^ x; return true; } int main() { int q, last = 0; scanf( %d , &q); while (q--) { int tp, a, b; scanf( %d%d%d , &tp, &a, &b); a ^= last; b ^= last; if (a > b) swap(a, b); b++; if (tp == 1) { int x; scanf( %d , &x); join(a, b, x ^ last); } else { if (Find(a) != Find(b)) last = -1; else last = X[a] ^ X[b]; printf( %d n , last); last = abs(last); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[1000]; int m = 0; for (int i = 0; i < n; i++) { cin >> a[i]; m = max(m, a[i]); } for (int i = 1; i <= m; i++) { for (int j = 0; j < n; j++) a[j]--; bool f[1000]; f[0] = (a[0] > 0); for (int i = 1; i < n; i++) f[i] = (a[i] > 0 && (f[i - 1] || (i > 1 && f[i - 2]))); if (!f[n - 1]) { cout << i; break; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int tc; cin >> tc; while (tc--) { int test = 0; int t[1005]; int n, x, nb1 = 0, nb2 = 0, i; cin >> n >> x; for (i = 0; i < n; i++) { cin >> t[i]; if (t[i] % 2 == 0) nb1++; else nb2++; } if (nb1 > 0 && x - nb1 > 0 && nb2 >= x - nb1 && (x - nb1) % 2 != 0) cout << Yes << endl; else if (nb1 > 0 && x - nb1 + 1 > 0 && nb2 >= x - nb1 + 1 && (x - nb1 + 1) % 2 != 0) cout << Yes << endl; else if (nb1 > 0 && x - nb1 <= 0 && nb2 >= 1) cout << Yes << endl; else if (nb1 == 0 && x % 2 != 0 && nb2 >= x) cout << Yes << endl; else cout << No << endl; } } |
#include <bits/stdc++.h> using namespace std; char a[55][55]; int n, m, x; int dist(int p, int q, int r, int s) { return (p - r) * (p - r) + (q - s) * (q - s); } int ok[128] = {}, appear[128] = {}; char s[1000000]; int main(void) { scanf( %d%d%d , &n, &m, &x); for (int i = 0; i < n; i++) scanf( %s , a[i]); int S = 0; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) if (a[i][j] == S ) { S = 1; for (int u = 0; u < n; u++) for (int v = 0; v < m; v++) if (dist(i, j, u, v) <= x * x) { ok[(int)a[u][v]] = 1; } } else appear[(int)a[i][j]] = 1; scanf( %d , &n); scanf( %s , s); int ans = 0, f = 0; for (int i = 0; s[i]; i++) if (s[i] >= A && s[i] <= Z ) { if (!S || !appear[s[i] + 32]) f = 1; ans += !ok[s[i] + 32]; } else if (!appear[(int)s[i]]) f = 1; if (f) ans = -1; printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int oo = 0x3f3f3f3f; const long long ooo = 9223372036854775807ll; const int _cnt = 1000 * 1000 + 7; const int _p = 1000 * 1000 * 1000 + 7; const int N = 300005; const double PI = acos(-1.0); const double eps = 1e-9; int o(int x) { return x % _p; } int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int lcm(int a, int b) { return a / gcd(a, b) * b; } void file_put() { freopen( filename.in , r , stdin); freopen( filename.out , w , stdout); } int n, a[N], L, t; long long ret = 0; int main() { scanf( %d , &n); for (int i = (1); i <= (n); ++i) scanf( %d , &a[i]), ret += a[i]; for (int i = (1); i <= (n); ++i) { if (a[i] >= 2) t = ((a[i] >> 1) < (L) ? (a[i] >> 1) : (L)), a[i] -= t << 1, L -= t; a[i] %= 3, L += a[i]; } printf( %lld n , (ret - L) / 3); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<vector<int>> gr; vector<long long> c; vector<int> parent; vector<int> size; vector<char> used; void make_set(int v) { parent[v] = v; size[v] = 1; } int find_set(int v) { if (v == parent[v]) return v; return parent[v] = find_set(parent[v]); } void union_sets(int a, int b) { a = find_set(a); b = find_set(b); if (a != b) { if (size[a] < size[b]) swap(a, b); parent[b] = a; size[a] += size[b]; } } long long binpow(long long a, int n) { long long res = 1; while (n) { if (n & 1) { res *= a; res %= 1000000007; } a *= a; a %= 1000000007; n >>= 1; } return res; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, m; long long k; cin >> n >> m >> k; c.resize(n); for (int i = 0; i < n; ++i) cin >> c[i]; vector<map<long long, int>> adjacent(n); vector<pair<int, int>> edges(m); parent.resize(m); size.resize(m); used.resize(m, 0); for (int i = 0; i < m; ++i) { make_set(i); int a, b; cin >> a >> b; --a, --b; edges[i].first = a; edges[i].second = b; } for (int i = 0; i < m; ++i) { int from = edges[i].first; int to = edges[i].second; long long xr = c[to] ^ c[from]; { auto found = adjacent[from].find(xr); if (found != adjacent[from].end()) { union_sets(i, found->second); } else { adjacent[from][xr] = i; } } { auto found = adjacent[to].find(xr); if (found != adjacent[to].end()) { union_sets(i, found->second); } else { adjacent[to][xr] = i; } } } vector<set<int>> subgraphs(m); for (int i = 0; i < m; ++i) { int comp = find_set(i); int from = edges[i].first; int to = edges[i].second; subgraphs[comp].insert(from); subgraphs[comp].insert(to); } long long ans = binpow(2, n + k); map<long long, long long> q; for (int i = 0; i < m; ++i) { int comp = find_set(i); if (!used[comp]) { used[comp] = 1; int from = edges[i].first; int to = edges[i].second; long long xr = c[to] ^ c[from]; q[xr] += subgraphs[comp].size() - 1; } } for (auto it = q.begin(); it != q.end(); ++it) { ans -= binpow(2, n); if (ans < 0) ans += 1000000007; ans += binpow(2, n - it->second); ans %= 1000000007; } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, a[100005], b[100005]; int l[100005], r[100005]; using pii = pair<int, int>; using ppi = pair<pii, int>; int tr[100005 * 2]; int get(int k) { int res = 0; for (; k; k -= k & -k) res += tr[k]; return res; } void update(int k) { for (; k <= m; k += k & -k) tr[k]++; } void calc(int *g, int *gg) { vector<ppi> V; for (int i = 1; i <= n; i++) V.push_back(ppi(pii(min(a[i], b[i]), max(a[i], b[i])), i)); sort(V.begin(), V.end(), [](const ppi &x, const ppi &y) { return x.first.second < y.first.second; }); int cnt = 0; memset(tr, 0, sizeof tr); for (auto x : V) { g[x.second] = cnt - get(x.first.first); update(x.first.first); cnt++; } reverse(V.begin(), V.end()); memset(tr, 0, sizeof tr); cnt = 0; for (auto x : V) { gg[x.second] = cnt - get(x.first.second) + get(x.first.first); update(x.first.first); cnt++; } memset(tr, 0, sizeof tr); for (auto x : V) update(x.first.second); for (auto x : V) gg[x.second] += get(x.first.first); return; } int main() { scanf( %d , &n); m = 2 * n; for (int i = 1; i <= n; i++) scanf( %d %d , &a[i], &b[i]); calc(l, r); long long ans = 0; for (int i = 1; i <= n; i++) { int t = n - 1 - l[i] - r[i]; ans += 1ll * t * (l[i] + r[i]); } ans >>= 1; for (int i = 1; i <= n; i++) ans += 1ll * l[i] * r[i]; ans = 1ll * n * (n - 1) * (n - 2) / 6 - ans; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %i , &n); vector<pair<int, int>> tree(n); for (int x = 0; x < n; x++) { scanf( %i%i , &tree[x].first, &tree[x].second); } sort(tree.begin(), tree.end()); int current_day = 0; for (int i = 0; i < n; i++) { current_day = (tree[i].second < tree[i].first && tree[i].second >= current_day) ? tree[i].second : tree[i].first; } printf( %i n , current_day); return 0; } |
#include <bits/stdc++.h> using namespace std; string s; vector<string> ss; double check(const string& x) { double res = 0; if (x.size() < 3) { for (char c : x) { res = res * 10 + (int)c - 0 ; } return res; } if (x[x.size() - 3] == . ) { for (int i = 0; i < x.size() - 3; ++i) { if (x[i] == . ) continue; res = res * 10 + (int)x[i] - 0 ; } res += ((int)x[x.size() - 2] - 0 ) / 10.0; res += ((int)x[x.size() - 1] - 0 ) / 100.0; return res; } else { for (int i = 0; i < x.size(); ++i) { if (x[i] == . ) continue; res = res * 10 + (int)x[i] - 0 ; } return res; } } int main(int argc, const char* argv[]) { cin >> s; for (int i = 0; i < s.size(); ++i) { if (s[i] >= 0 && s[i] <= 9 ) { for (int j = i; j < s.size(); ++j) { if (j == s.size() - 1) { ss.emplace_back(s.substr(i, j - i + 1)); i = j; continue; } if (s[j] >= a && s[j] <= z ) { ss.emplace_back(s.substr(i, j - i)); i = j - 1; break; } } } } double ans = 0; for (auto& x : ss) { ans += check(x); } char sans[5000]; sprintf(sans, %.2f , ans); int len = (int)strlen(sans); int cnt = (len - 3) % 3; if (cnt == 0) cnt = 3; for (int i = 0; i < cnt; ++i) putchar(sans[i]); for (int i = cnt; i < len - 3; i += 3) { if (cnt) putchar( . ); putchar(sans[i]); putchar(sans[i + 1]); putchar(sans[i + 2]); } if (sans[len - 1] != 0 || sans[len - 2] != 0 ) { putchar( . ); putchar(sans[len - 2]); putchar(sans[len - 1]); } puts( ); return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:100000000000000 ) using namespace std; int n; double a[500001], b[500001], p, q; string st; double calc(double y1) { double y2 = 1.; for (int i = 0; i < n; i++) { y2 = min(y2, (1. - (a[i] * y1)) / b[i]); } double ret = p * y1 + q * y2; return ret; } int main() { cin >> n >> p >> q; double maxi = 0; for (int i = 0; i < n; i++) { cin >> a[i] >> b[i]; maxi = max(a[i], maxi); } double l = 0, r = 1. / maxi; for (int i = 0; i < 100; i++) { double m1 = (fabs(l - r)) / 3; double x1 = calc(l + m1), x2 = calc(r - m1); if (x1 >= x2) r = r - m1; else l = l + m1; } printf( %.10lf n , calc(l)); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 5; vector<vector<int> > col; vector<vector<int> > adj; int color[N]; void dfs(int v, int p) { set<int> st; int toapply = 1; for (int i = 0; i < col[v].size(); i++) { int c = col[v][i]; if (color[c] != -1) st.insert(color[c]); } for (int i = 0; i < col[v].size(); i++) { int c = col[v][i]; if (color[c] != -1) continue; while (st.find(toapply) != st.end()) toapply++; color[c] = toapply; toapply++; } for (int i = 0; i < adj[v].size(); i++) { int u = adj[v][i]; if (u == p) continue; dfs(u, v); } } int main() { int n, m; scanf( %d%d , &n, &m); col.resize(n + 5); adj.resize(n + 5); memset(color, -1, sizeof(color)); int mx = 1; for (int i = 1; i <= n; i++) { int s; scanf( %d , &s); mx = max(mx, s); while (s--) { int t; scanf( %d , &t); col[i].push_back(t); } } for (int i = 1; i < n; i++) { int u, v; scanf( %d%d , &u, &v); adj[u].push_back(v); adj[v].push_back(u); } dfs(1, -1); printf( %d n , mx); for (int i = 1; i <= m; i++) if (color[i] == -1) color[i] = 1; for (int i = 1; i <= m; i++) printf( %d , color[i]); printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long maxn = 3e3 + 100; const long long mod = 1e9 + 7; const long long inf = 1e18; long long n, dsu[maxn], sz[maxn], t[maxn], a[maxn], mx, s, ans; pair<long long, pair<long long, long long> > e[maxn]; void init() { mx = 0; for (long long i = 1; i <= n; i++) { dsu[i] = i; sz[i] = 1; t[i] = a[i] + sz[i]; mx = max(mx, t[i]); } } long long root(long long v) { if (dsu[v] == v) return v; return root(dsu[v]); } bool Union(long long v, long long u) { long long x = root(v), y = root(u); if (x == y) return 1; if (sz[x] < sz[y]) swap(x, y); sz[x] += sz[y]; t[x] += t[y]; mx = max(mx, t[x]); dsu[y] = x; return 0; } bool isval(long long x) { init(); for (long long i = 0; i < n - 1; i++) { if (e[i].first < x) { Union(e[i].second.first, e[i].second.second); } } return (mx <= s); } int main() { long long v, u, c; ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; cin >> n; for (long long i = 0; i < n - 1; i++) { cin >> e[i].second.first >> e[i].second.second >> e[i].first; } for (long long i = 1; i <= n; i++) { cin >> a[i]; s += a[i]; } long long l = 0, r = 2e4, mid; while (r - l > 1) { mid = (l + r) / 2; if (isval(mid)) l = mid; else r = mid; } cout << l; return 0; } |
#include <bits/stdc++.h> using namespace std; const int mn = 1e6 + 10; const long long mod = 998244353; int a[100], t[100]; string s[100]; int dp[21][1 << 20]; int main() { int n, m; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , a + i); sort(a, a + n, greater<int>()); scanf( %d , &m); for (int i = 0; i < m; i++) cin >> s[i] >> t[i]; for (int i = m - 1; i >= 0; i--) { if (s[i] == p ) { for (int j = 1; j < 1 << m; j++) { int l = __builtin_ctz(j); if (t[i] == 1) dp[i][j] = a[l] + dp[i + 1][j - (1 << l)]; else dp[i][j] = -a[l] + dp[i + 1][j - (1 << l)]; } } else { if (t[i] == 1) { for (int j = 0; j < 1 << m; j++) { dp[i][j] = dp[i + 1][j]; for (int k = 0; k < m; k++) if ((j >> k) & 1) { dp[i][j] = max(dp[i][j], dp[i + 1][j - (1 << k)]); } } } else { for (int j = 0; j < 1 << m; j++) { dp[i][j] = dp[i + 1][j]; for (int k = 0; k < m; k++) if ((j >> k) & 1) { dp[i][j] = min(dp[i][j], dp[i + 1][j - (1 << k)]); } } } } } printf( %d , dp[0][(1 << m) - 1]); } |
#include <bits/stdc++.h> int min(int a, int b) { return a > b ? b : a; } int max(int a, int b) { return a < b ? b : a; } int main() { int n, a, b, c, d, i, pos; int sum, next; while (~scanf( %d , &n)) { int ans = 0; for (i = 1; i <= 4; i++) { scanf( %d%d%d%d , &a, &b, &c, &d); a = min(a, b); b = max(a, b); c = min(c, d); d = max(c, d); if (a + c <= n) { ans = 1; pos = i; next = a; } } if (ans) printf( %d %d %d n , pos, next, n - next); else printf( -1 n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; unsigned long long l, r, x, y; unsigned long long gcd(unsigned long long a, unsigned long long b) { while (b > 0) { unsigned long long t = b; b = a % b; a = t; } return a; } int main() { cin >> l >> r >> x >> y; if (x == y) { if (x >= l && x <= r) { cout << 1; return 0; } } unsigned long long number = 0; l = 1 + ((l - 1) / x); l *= x; for (unsigned long long i = l; i * i <= x * y; i += x) { unsigned long long p = x * y / i; if (p * i == x * y && p >= l && p <= r && i <= r) { if (gcd(p, i) == x) { number += 2; if (i == p) number--; } } } cout << number; } |
#include <bits/stdc++.h> using namespace std; long long i, j, k, l, n, m, c, d, a[2005][2005], b[10005], f, mod = 1e9 + 7; vector<long long> v; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n; a[0][0] = 1; for (i = 1; i <= n; i++) for (j = 0; j <= i; j++) { if (j - 1 < 0) k = 0; else k = a[j - 1][i - 1]; a[j][i] = (k + a[j + 1][i - 1]) % mod; } for (i = n + 1; i <= 2 * n; i++) for (j = 0; j <= n - (i - 1) % n - 1; j++) { if (j - 1 < 0) k = 0; else k = a[j - 1][i - 1]; a[j][i] = (k + a[j + 1][i - 1]) % mod; } for (i = 1; i <= 2 * n; i++) { for (j = 0; j <= n; j++) b[i] = (b[i] + a[j][i]) % mod; } k = 0; for (i = 1; i <= 2 * n; i = i + 2) k = (k + b[i]) % mod; cout << k; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; string s; cin >> n; getline(cin, s); while (n--) { getline(cin, s); bool L = false, M = false; if (s.length() < 5) { cout << OMG>.< I don t know! << endl; continue; } if (s.substr(0, 5) == miao. ) { M = true; } if (s.substr(s.length() - 5) == lala. ) { L = true; } if (M && L) { cout << OMG>.< I don t know! << endl; } else if (M) { cout << Rainbow s << endl; } else if (L) { cout << Freda s << endl; } else { cout << OMG>.< I don t know! << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long t; t = 1; while (t--) { int n; cin >> n; int a[n + 1]; a[1] = 0; for (int i = 2; i <= n; i++) cin >> a[i]; vector<int> v; v.push_back(n); n = a[n]; v.push_back(n); while (n != 1) { v.push_back(a[n]); n = a[n]; } reverse(v.begin(), v.end()); for (auto x : v) cout << x << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(false); long long n; cin >> n; set<long long> s = {-2, -1}; vector<long long> arr(n, 0); while (n--) { long long x; cin >> x; --x; if ((*prev(s.end())) > x && (*prev(prev(s.end()))) < x) ++arr[(*prev(s.end()))]; if ((*prev(s.end())) < x) --arr[x]; s.insert(x); } cout << (max_element(arr.begin(), arr.end()) - arr.begin() + 1) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int s[105], d[105], c[105]; int ans[105] = {0}; vector<pair<int, int>> v; int main() { int tc; tc = 1; while (tc--) { int n, m; cin >> n >> m; int flag = 1; for (int i = 1; i <= m; i++) { cin >> s[i] >> d[i] >> c[i]; if (d[i] - s[i] < c[i]) flag = 0; ans[d[i]] = m + 1; v.push_back({i, d[i]}); } if (flag == 0) { cout << -1 << n ; continue; } sort(v.begin(), v.end(), [](pair<int, int> &a, pair<int, int> &b) { return a.second < b.second; }); flag = 1; for (int i = 0; i < m; i++) { int now = v[i].first; int cnt = 0; for (int j = s[now]; j < d[now] and cnt < c[now]; j++) { if (ans[j] == 0) { ans[j] = now; cnt++; } } if (cnt < c[now]) { flag = 0; break; } } if (flag == 0) cout << -1 << n ; else { for (int i = 1; i <= n; i++) cout << ans[i] << ; cout << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; int t, n, m, a[3005] = {0}; string ans[3005]; vector<pair<string, int> > v[3005]; map<string, int> mp; map<int, string> mp1; vector<string> v1[3005]; int F(int x, int vis[]) { int i, i1, i2, idx; for (i = 0; i < v1[x].size(); i++) { string s = v1[x][i]; i1 = mp[s]; if (!vis[i1]) { vis[i1] = 1; if (a[i1] < 0 || F(a[i1], vis)) { a[i1] = x; ans[x] = s; return 1; } } } return 0; } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); int i, j, k, x, y, vis[3005] = {0}; string s1, s2; cin >> n; int cc = 1; memset(a, -1, sizeof a); for (i = 0; i < n; i++) { cin >> s1 >> s2; string temp = s1.substr(0, 3), temp1 = s1.substr(0, 2) + s2[0]; if (mp[temp] == 0) mp[temp] = cc++; if (mp[temp1] == 0) mp[temp1] = cc++; v[mp[temp]].push_back({temp1, i}); mp1[mp[temp]] = temp; } for (i = 1; i < cc; i++) { s2 = mp1[i]; if (v[i].size() == 1) { k = v[i][0].second; s1 = v[i][0].first; v1[k].push_back(s1); v1[k].push_back(s2); continue; } for (j = 0; j < v[i].size(); j++) { s1 = v[i][j].first; k = v[i][j].second; v1[k].push_back(s1); } } m = mp.size(); for (i = 0; i < n; i++) { for (j = 0; j < m + 2; j++) vis[j] = 0; if (F(i, vis)) continue; else { cout << NO ; return 0; } } cout << YES n ; for (i = 0; i < n; i++) cout << ans[i] << n ; cerr << n << Time elapsed : << clock() * 1000.0 / CLOCKS_PER_SEC << ms n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, k, a[100100], sum = 0, Min = 1e6; int main() { cin >> n >> k; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) { if (a[i] < 0 && k) a[i] *= -1, k--; Min = min(Min, abs(a[i])); sum += a[i]; } if (k & 1) sum -= Min * 2; cout << sum; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f, MOD = 1e9 + 7; long long power(long long a, long long n) { long long p = 1; while (n > 0) { if (n % 2) { p = p * a; } n >>= 1; a *= a; } return p; } long long power(long long a, long long n, long long mod) { long long p = 1; while (n > 0) { if (n % 2) { p = p * a; p %= mod; } n >>= 1; a *= a; a %= mod; } return p % mod; } void swap(char *a, char *b) { char temp = *a; *a = *b; *b = temp; } long long int nCr(int n, int r) { long long int C[r + 1]; memset(C, 0, sizeof(C)); C[0] = 1; for (int i = 1; i <= n; i++) { for (int j = min(i, r); j > 0; j--) C[j] = (C[j] + C[j - 1]); } return C[r]; } long long int countDer(int n) { int der[n + 1]; der[0] = 1; der[1] = 0; der[2] = 1; for (int i = 3; i <= n; ++i) der[i] = (i - 1) * (der[i - 1] + der[i - 2]); return der[n]; } int digitsum(long long a) { int ans = 0; while (a > 0) { ans = ans + a % 10; a = a / 10; } return ans; } int count(long long a) { int temp = 0; while (a > 0) { a = a / 10; temp++; } return temp; } int main() { int n; cin >> n; char s[n]; for (int i = 0; i < n; i++) cin >> s[i]; sort(s, s + n); for (int i = 0; i < n; i++) cout << s[i]; cout << endl; } |
#include <bits/stdc++.h> using namespace std; const int maxN = 1005, maxD = 10, oo = 1e9; int Len, dp[maxN][maxN]; int t[maxN][maxN], s[maxN], tool[maxN]; int n, perm[maxN], cost[maxD], cnt[maxN][maxD], lost[maxN]; bool flag = 0; inline void solve(int i, int j, int d) { int jp = 0, sum = 0; for (int d2 = 0; d2 < maxD; d2++) { int td = cnt[j][d2]; int fl = (d + 1 + d2) >= 10; jp += fl * td; sum += td * cost[(d + 1 + d2) % 10]; td = cnt[n][d2] - cnt[j][d2]; if (d2 == 0 && d == 0 && flag) td -= lost[n] - lost[j]; fl = (d + d2) >= 10; jp += fl * td; sum += td * cost[(d + d2) % 10]; } dp[i + 1][jp] = max(dp[i + 1][jp], dp[i][j] + sum); return; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); string r; cin >> r; int sz = r.size(); for (int i = 0; i < sz; i++) { if (r[i] == ? ) s[sz - i - 1] = -1; else s[sz - i - 1] = r[i] - 0 ; } Len = max(Len, sz); cin >> n; for (int i = 0; i < n; i++) { string tmp; cin >> tmp; int cz = tmp.size(); for (int j = 0; j < cz; j++) t[i][cz - j - 1] = tmp[j] - 0 ; Len = max(Len, cz); tool[i] = cz; } for (int i = 0; i < maxD; i++) cin >> cost[i]; dp[0][0] = 0; for (int j = 1; j <= n; j++) dp[0][j] = -oo; for (int i = 1; i < maxN; i++) for (int j = 0; j < maxN; j++) dp[i][j] = -oo; for (int i = 0; i < n; i++) perm[i] = i; for (int i = 0; i < Len; i++) { for (int j = 1; j <= n; j++) { for (int d = 0; d < maxD; d++) cnt[j][d] = cnt[j - 1][d]; int d = t[perm[j - 1]][i]; cnt[j][d]++; lost[j] = lost[j - 1]; if (tool[perm[j - 1]] <= i) lost[j]++; } if (i >= sz) flag = true; for (int j = 0; j <= n; j++) { if (s[i] != -1) solve(i, j, s[i]); else { int st = 0; if (i == sz - 1) st = 1; for (int d = st; d < maxD; d++) solve(i, j, d); } } vector<int> vc; for (int d = maxD - 1; d >= 0; d--) for (int j = 0; j < n; j++) if (t[perm[j]][i] == d) vc.push_back(perm[j]); for (int j = 0; j < n; j++) perm[j] = vc[j]; } int ans = 0; for (int j = 0; j <= n; j++) ans = max(ans, dp[Len][j] + j * cost[1]); cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e6 + 7; const int INF = 0x7fffffff; long long c[maxn], s[maxn]; long long a[maxn], num[maxn]; int main() { long long n, x, y; while (cin >> n >> x >> y) { long long ans = n * x; memset(num, 0, sizeof(num)); for (int i = 1; i <= n; i++) { cin >> a[i]; num[a[i]]++; } c[0] = s[0] = 0; for (int i = 1; i <= 2e6; i++) { c[i] = c[i - 1] + num[i]; s[i] = s[i - 1] + i * num[i]; } long long p = (x + y - 1) / y; for (int i = 2; i <= 1e6; i++) { long long cur = 0; for (int j = i; j <= 1e6 + i && cur < ans; j += i) { int l = j - i, r = j; int k = r - p; k = max(k, l); long long temp = (c[r] - c[k]) * j - (s[r] - s[k]); cur += temp * y; cur += (c[k] - c[l]) * x; } ans = min(ans, cur); } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct st { int x, y; bool operator<(const st o) const { return y < o.y || (y == o.y && x < o.x); } }; long long a[1000000][2]; long long n, m, x, y; long long M[1000000][2]; int main() { cin >> n >> m; cin >> M[0][0] >> M[0][1]; for (int i = 0; i < (int)(n); i++) { for (int j = 0; j < (int)(2); j++) { cin >> a[i][j]; } } for (int i = 1; i < 2 * n; i++) { for (int j = 0; j < (int)(2); j++) { M[i][j] = 2 * (a[(i - 1) % n][j]) - M[i - 1][j]; } } cout << M[m % (2 * n)][0] << << M[m % (2 * n)][1]; return 0; } |
#include <bits/stdc++.h> using namespace std; int yee[6][3] = {{0, 1, 2}, {1, 0, 2}, {1, 2, 0}, {2, 1, 0}, {2, 0, 1}, {0, 2, 1}}; int main() { ios::sync_with_stdio(0); cin.tie(0); int n, x; cin >> n >> x; n %= 6; cout << yee[n][x] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long a, b, c, d, n; int main() { while (~scanf( %I64d%I64d%I64d%I64d%I64d , &n, &a, &b, &c, &d)) { long long mi = min(b - c, min(a - d, a + b - c - d)), ma = max(b - c, max(a - d, a + b - c - d)); long long num1 = min(n - ma, n), num2 = max(1 - mi, (long long)1), ans = 0; ; if (num1 < num2) ans = 0; else ans = num1 - num2 + 1; printf( %I64d n , n * ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int binarySearch(int arr[], int l, int r, int x) { while (l <= r) { int m = l + (r - l) / 2; if (arr[m] == x) return m; if (arr[m] < x) l = m + 1; else r = m - 1; } return -1; } bool isprime(int n) { if (n <= 1) return false; for (int i = 2; i < n; i++) if (n % i == 0) return false; return true; } long long int factorial(int n) { if (n == 0) return 1; return n * factorial(n - 1); } int countDigit(long long n) { int count = 0; while (n != 0) { n = n / 10; ++count; } return count; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int v1, v2, t, d, sum = 0; cin >> v1 >> v2 >> t >> d; for (int i = 0; i < t; i++) sum += min(v2 + (t - 1 - i) * d, v1 + i * d); cout << sum; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = (int)(1e5 + 1e1); const double PI = acos(-1.0); long long a, m, t; int main() { cin >> m >> a; if (a == 0 && m > 1) { cout << No solution ; return 0; } cout << a; for (int i = 1; i < m; i++) cout << 0; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { bool ok[999]; memset(ok, false, sizeof(ok)); ok[ A ] = true; ok[ H ] = true; ok[ I ] = true; ok[ M ] = true; ok[ O ] = true; ok[ T ] = true; ok[ U ] = true; ok[ V ] = true; ok[ W ] = true; ok[ X ] = true; ok[ Y ] = true; static char s[199919]; scanf( %s , s + 1); int n = strlen(s + 1); bool flag = true; for (int i = 1, j = n; i <= j; ++i, --j) if (s[i] != s[j] || !ok[s[i]]) flag = false; printf( %s n , flag ? YES : NO ); return 0; } |
#include <bits/stdc++.h> int dx[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1}; int dy[] = {-1, 0, 1, -1, 0, 1, -1, 0, 1}; using namespace std; void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } long long to_int(string s) { long long ans = 0; for (int i = 0; i < s.size(); i++) { ans = ans * 10 + (s[i] - 48); } return ans; } int l[100001]; int r[100001]; int a[100001]; int main() { fast(); int d1, d2, d3, ans = 0; cin >> d1 >> d2 >> d3; if (d2 < d1) swap(d2, d1); ans += d1; ans += min(d3, d1 + d2); ans += min(d2, d3 + d1); cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; long long f[2][200500], g[2][200500], sf[2][200500], sg[2][200500], ans; int a, b, k, t; const long long MOD = 1000000007; int main() { scanf( %d%d%d%d , &a, &b, &k, &t); f[0][a + 100210] = 1; g[0][b + 100210] = 1; for (int j = -100000; j <= 100100; j++) { sf[0][j + 100210] = (sf[0][j + 100209] + f[0][j + 100210]) % MOD; sg[0][j + 100210] = (sg[0][j + 100209] + g[0][j + 100210]) % MOD; } for (int i = 1; i <= t; i++) { for (int j = -100000; j <= 100100; j++) { f[i & 1][j + 100210] = (sf[(i - 1) & 1][min(100210 + a + k * i, j + k + 100210)] - sf[(i - 1) & 1][max(100209 + a - k * i, j - k + 100209)]) % MOD; if (f[i & 1][j + 100210] < 0) f[i & 1][j + 100210] += MOD; sf[i & 1][j + 100210] = (sf[i & 1][j + 100209] + f[i & 1][j + 100210]) % MOD; } for (int j = -100000; j <= 100100; j++) { g[i & 1][j + 100210] = (sg[(i - 1) & 1][min(100210 + b + k * i, j + k + 100210)] - sg[(i - 1) & 1][max(100209 + b - k * i, j - k + 100209)]) % MOD; if (g[i & 1][j + 100210] < 0) g[i & 1][j + 100210] += MOD; sg[i & 1][j + 100210] = (sg[i & 1][j + 100209] + g[i & 1][j + 100210]) % MOD; } } for (int j = -100000; j <= 100100; j++) { ans = (ans + f[t & 1][j + 100210] * sg[t & 1][j + 100209]) % MOD; } printf( %lld n , ans); } |
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); const double eps = 1e-7; const long long MOD = 1000000007LL; const int INF = 0x3f3f3f3f; const int _NAN = -0x3f3f3f3f; const double EULC = 0.5772156649015328; const int NIL = -1; template <typename T> void read(T &x) { x = 0; char ch = getchar(); long long f = 1; while (!isdigit(ch)) { if (ch == - ) f *= -1; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + ch - 48; ch = getchar(); } x *= f; } const int maxn = 2e5 + 10; int arr[maxn]; int main(void) { ios::sync_with_stdio(false); int n; while (cin >> n) { if (~n & 1) { cout << NO n ; continue; } for (int i = 1; i <= n; ++i) { if (i & 1) { arr[i] = 2 * i - 1; arr[i + n] = 2 * i; } else { arr[i] = 2 * i; arr[i + n] = 2 * i - 1; } } cout << YES n ; for (int i = 1; i <= 2 * n; ++i) cout << arr[i] << (i == 2 * n ? n : ); } return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { long long n; cin >> n; string s; cin >> s; long long o = 0; long long z = 0; for (long long i = 0; i < n; i++) if (s[i] == n ) o++; else if (s[i] == z ) z++; while (o--) cout << 1 << ; while (z--) cout << 0 << ; } int main() { long long t; t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 998244353; int add(int a, int b) { a += b; if (a >= MOD) a -= MOD; if (a < 0) a += MOD; return a; } int mul(int a, int b) { return a * 1ll * b % MOD; } int binpow(int a, int b) { int res = 1; while (b) { if (b & 1) res = mul(res, a); a = mul(a, a); b >>= 1; } return res; } vector<int> pr; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; vector<int> c(n); for (int i = 0; i < int(n); i++) cin >> c[i]; sort(c.begin(), c.end(), greater<int>()); pr.push_back(0); for (int i = 0; i < int(n); i++) { pr.push_back(add(pr.back(), c[i])); } int invn = binpow(n, MOD - 2); for (int k = 1; k <= n; ++k) { int ans = 0; for (int i = 0, j = 0; i < n; i += k, ++j) { ans = add(ans, mul(j, add(pr[min(n, i + k)], -pr[i]))); } cout << mul(ans, invn) << ; } cout << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, cnt = 0; long long a[623456], b[623456], v[9999999]; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; v[a[i]] = 1; } for (int i = 1; i <= n; i++) { cin >> b[i]; v[b[i]] = 1; } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { long long x = a[i] ^ b[j]; if (v[x]) { cnt++; } } } if (cnt % 2 == 0) cout << Karen ; else cout << Koyomi ; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 200010; struct Node { long long dis, mxdis; int id; bool operator<(const Node &rhs) const { if (dis == rhs.dis) return mxdis < rhs.mxdis; return dis < rhs.dis; } } p[MAXN]; struct NO { long long dis, mxdis; int id; NO(long long x, long long y, int z) { dis = x, mxdis = y; id = z; } bool operator<(const NO &rhs) const { return mxdis > rhs.mxdis; } }; priority_queue<NO> q; long long l[MAXN], r[MAXN]; struct Node1 { long long val; int id; bool operator<(const Node1 &rhs) const { return val < rhs.val; } } a[MAXN]; int ans[MAXN]; int main() { int n, m, i; while (scanf( %d%d , &n, &m) == 2) { for (i = 0; i < n; i++) { scanf( %lld%lld , &l[i], &r[i]); if (i > 0) { p[i].dis = l[i] - r[i - 1]; p[i].mxdis = r[i] - l[i - 1]; p[i].id = i; } } sort(p + 1, p + n); for (i = 0; i < m; i++) { scanf( %lld , &a[i].val); a[i].id = i; } sort(a, a + m); int left = 1; while (!q.empty()) q.pop(); int ok = 1; if (n > m + 1) { printf( No n ); continue; } for (i = 0; i < m; i++) { while (a[i].val >= p[left].dis && left < n) { q.push(NO(p[left].dis, p[left].mxdis, p[left].id)); left++; } if (!q.empty()) { NO x = q.top(); q.pop(); if (x.mxdis >= a[i].val) ans[x.id] = a[i].id + 1; else { ok = 0; break; } } } if (ok && q.empty() && left == n) { printf( Yes n ); for (i = 1; i < n; i++) printf( %d%c , ans[i], (i == n - 1) ? n : ); } else printf( No n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> T modpow(T base, T exp) { T result = 1; while (exp > 0) { if (exp & 1) result = (result * base); base = (base * base); exp >>= 1; } return result; } int main() { queue<string> poss; long long int n, q; string x, y, poss1; ios_base::sync_with_stdio(false); cin.tie(0); cin >> n >> q; map<string, vector<string> > m; for (long long int(i) = (0); (i) < (q); (i)++) { cin >> x >> y; m[y].push_back(x); } map<string, vector<string> >::iterator it; it = m.begin(); if ((*it).first != a ) { cout << 0 << endl; return 0; } else { for (long long int(i) = (0); (i) < (m[ a ].size()); (i)++) poss.push((m[ a ])[i]); int cnt = 2; while (cnt != n) { while ((poss.front()).length() != cnt + 1) { string c = (poss.front()).substr(0, 1); if (m.find(c) != m.end()) { string str = poss.front(); poss.pop(); str = str.substr(1, str.length() - 1); for (long long int(j) = (0); (j) < (m[c].size()); (j)++) poss.push(m[c][j] + str); } else poss.pop(); if (poss.empty()) { cout << 0 << endl; return 0; } } cnt++; } } cout << poss.size() << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long int arr[100005]; map<long long int, int> m; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %I64d , &arr[i]); } for (int i = 1; i <= n; i++) { arr[i] += arr[i - 1]; m[arr[i]]++; } int maxVal = 0; for (int i = 1; i <= n; i++) { maxVal = max(maxVal, m[arr[i - 1]]); } printf( %d , n - maxVal); } |
#include <bits/stdc++.h> using namespace std; string solve() { int a, b, n; string number = ; cin >> a >> b >> n; bool added; added = false; a *= 10; for (int j = 1; j < 11; j++) { if (a % b == 0) { added = true; break; } a++; } if (!added) return -1 ; number = to_string(a); for (int i = 0; i < n - 1; i++) number += 0 ; return number; } int main(void) { cout << solve() << n ; } |
#include <bits/stdc++.h> using namespace std; vector<int> adj[3003]; int cost[3003], par[3003]; bool vis[3003]; map<pair<int, int>, bool> mark; void path(int x, int y) { if (x == y) return; cost[x] = 0; path(par[x], y); } void dfs(int u) { vis[u] = true; for (int v : adj[u]) { if (vis[v]) { if (par[u] != v) { cost[v] = 0; if (!mark[{u, v}]) { path(u, v); mark[{u, v}] = mark[{v, u}] = true; } } } else par[v] = u, dfs(v); } } void bfs(int src) { queue<int> q; q.push(src); while (q.size()) { int u = q.front(); q.pop(); for (int v : adj[u]) { if (cost[v] == -1) { cost[v] = cost[u] + 1; q.push(v); } } } } int main() { int n, x, y; cin >> n; for (int i = 0; i < n; i++) { cin >> x >> y; adj[x].push_back(y); adj[y].push_back(x); } memset(cost, -1, sizeof cost); par[1] = 1; dfs(1); memset(vis, false, sizeof vis); for (int i = 1; i <= n; i++) { if (cost[i] == 0) bfs(i); } for (int i = 1; i <= n; i++) cout << cost[i] << ; } |
#include <bits/stdc++.h> using namespace std; long long a[200010]; vector<int> v[70]; int main() { int i, j, n; scanf( %d , &n); for (i = 0; i < n; i++) { scanf( %lld , &a[i]); for (j = 1; j < 63; j++) { if (a[i] % (1LL << j)) { v[j].push_back(i); break; } } } int ans = 0, tmp = 0; for (i = 1; i < 63; i++) { if (ans < v[i].size()) { ans = v[i].size(); tmp = i; } } printf( %d n , n - ans); for (i = 1; i < 63; i++) { if (i == tmp) continue; for (auto j : v[i]) printf( %lld , a[j]); } return 0; } |
#include <bits/stdc++.h> using namespace std; char a[100010]; vector<int> qe[710000]; map<pair<int, int>, int> dp; long long hehe[20]; long long find(int x, int y) { int k = y, n = 1; while (k) { n++; k /= 10; } return hehe[n] * x + y; } int get(char a[], int n) { int ans = 0; for (int i = 0; i < n; i++) { ans = ans * 27 + a[i] - a + 1; } return ans; } int getans(int x, int y, int n1, int n2) { int ans = 78974453; int ll, rr, l, r; for (int i = 0; i < qe[x].size(); i++) { l = qe[x][i]; r = l + n1; int p = int(lower_bound(qe[y].begin(), qe[y].end(), l) - qe[y].begin()); if (p < qe[y].size()) { rr = qe[y][p] + n2; if (r > rr) rr = r; ans = min(ans, rr - l); } p--; if (p >= 0) { rr = qe[y][p] + n2; if (r > rr) rr = r; ans = min(ans, rr - qe[y][p]); } } return ans; } int main() { int n, i, j, k, m; int x, y; char s1[5], s2[5]; hehe[1] = 1; for (i = 2; i <= 15; i++) hehe[i] = hehe[i - 1] * 10; scanf( %s , a); n = strlen(a); for (i = 0; i < n; i++) { for (j = 1; j < 5; j++) { if (j + i > n) break; k = get(a + i, j); qe[k].push_back(i); } } scanf( %d , &m); while (m--) { scanf( %s%s , s1, s2); int xx = strlen(s1); int yy = strlen(s2); x = get(s1, xx); y = get(s2, yy); if (qe[x].size() > qe[x].size() || (qe[x].size() == qe[y].size() && x > y)) { swap(x, y); swap(xx, yy); } int &ans = dp[pair<int, int>(x, y)]; if (!ans) ans = getans(x, y, xx, yy); printf( %d n , ans == 78974453 ? -1 : ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int p[100]; queue<int> q; int main() { ios::sync_with_stdio(false); int n, m, k, t; cin >> n >> m >> k; for (int i = 0; i < k; ++i) cin >> p[i]; for (int i = 0; i < m * n; ++i) { cin >> t; q.push(t); } int an = 0; for (int i = 0; i < m * n; ++i) { for (int j = 0; j < k; ++j) { if (p[j] == q.front()) for (int h = j; h > 0; --h) { swap(p[h], p[h - 1]); an++; } } an++; q.pop(); } cout << an; return 0; } |
#include <bits/stdc++.h> using namespace std; const string alf = abcdefghijklmnopqrstuvwxyz ; const int hashP = 239017; const int N = 1e5 + 10; const int MOD = 1e9 + 7; const int MOD2 = 998244353; const int INF = 1e9; const long long INF2 = 1e18; template <typename T> bool umn(T &a, T b) { return (a > b ? (a = b, 1) : 0); } template <typename T> bool umx(T &a, T b) { return (a < b ? (a = b, 1) : 0); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n; cin >> n; string s = to_string(n); long long dl = s.size(); long long ans = 0; for (long long mask = 1; mask <= (1 << dl); mask++) { long long ch = 0; vector<long long> a; for (int i = 0; i < dl; i++) { long long c = (mask >> i) & 1; a.push_back(c); } reverse(a.begin(), a.end()); for (int i = 0; i < dl; i++) { ch *= 10; long long c = a[i]; ch += c; } if (n >= ch) ans++; } cout << ans - 1; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 2e9; FILE* stream; mt19937 rng(1337); void solve() { int n; cin >> n; vector<int> a(n); for (int i = 0; i < int(n); i++) { cin >> a[i]; } vector<int> b(n); for (int i = 0; i < int(n); i++) { if (i % 2) { b[i] = a[i - 1]; } else { b[i] = -a[i + 1]; } } for (int i = 0; i < int(n); i++) cout << b[i] << ; cout << endl; return; } signed main() { int t; cin >> t; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m, a[4005], b[4005]; bitset<4005> adj[4005]; cin >> n >> m; vector<int> tam(n + 1); for (int i = 0; i < m; i++) { cin >> a[i] >> b[i]; adj[a[i]][b[i]] = 1; adj[b[i]][a[i]] = 1; tam[a[i]]++; tam[b[i]]++; } int res = 1e9; for (int i = 0; i < m; i++) { for (int j = i + 1; j < m; j++) { vector<int> v = {a[i], b[i], a[j], b[j]}; sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); if (v.size() != 3) continue; if (adj[v[0]][v[1]] && adj[v[1]][v[2]] && adj[v[2]][v[0]]) { res = min(res, tam[v[0]] + tam[v[1]] + tam[v[2]] - 6); } } } if (res == 1e9) cout << -1 << n ; else cout << res << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int i, j, k, l, s[4], s_indx = 0, m, n, o, p; int main() { float x[8], y[8], x1, y1, x2, y2, sq = 0, r = 0, indx = 0, a, b, c, d, square[3]; for (int i = 0; i < 8; i++) { cin >> x[i] >> y[i]; } for (i = 0; i <= 4 && indx == 0; i++) { for (j = i + 1; j <= 5 && indx == 0; j++) { for (k = j + 1; k <= 6 && indx == 0; k++) { for (l = k + 1; l <= 7 && indx == 0; l++) { x1 = (x[i] + x[j] + x[k] + x[l]) / 4; y1 = (y[i] + y[j] + y[k] + y[l]) / 4; a = sqrt(pow(x1 - x[i], 2) + pow(y1 - y[i], 2)); b = sqrt(pow(x1 - x[j], 2) + pow(y1 - y[j], 2)); c = sqrt(pow(x1 - x[k], 2) + pow(y1 - y[k], 2)); d = sqrt(pow(x1 - x[l], 2) + pow(y1 - y[l], 2)); if (a == b && a == c && a == d) { indx = 1; } } } } } i -= 1; j -= 1; k -= 1; l -= 1; for (int x = 0; x < 8; x++) { if (x != i && x != j && x != k && x != l) { s[s_indx] = x; s_indx += 1; } } m = s[0]; n = s[1]; o = s[2]; p = s[3]; if (indx == 1) { square[0] = sqrt(pow(x[i] - x[j], 2) + pow(y[i] - y[j], 2)); square[1] = sqrt(pow(x[i] - x[k], 2) + pow(y[i] - y[k], 2)); square[2] = sqrt(pow(x[i] - x[l], 2) + pow(y[i] - y[l], 2)); sort(square, square + 3); if (square[0] == square[1]) { sq = 1; } else { r = 1; } x2 = (x[m] + x[n] + x[o] + x[p]) / 4; y2 = (y[m] + y[n] + y[o] + y[p]) / 4; a = sqrt(pow(x2 - x[m], 2) + pow(y2 - y[m], 2)); b = sqrt(pow(x2 - x[n], 2) + pow(y2 - y[n], 2)); c = sqrt(pow(x2 - x[o], 2) + pow(y2 - y[o], 2)); d = sqrt(pow(x2 - x[p], 2) + pow(y2 - y[p], 2)); if (a == b && a == c && a == d) { square[0] = sqrt(pow(x[m] - x[n], 2) + pow(y[m] - y[n], 2)); square[1] = sqrt(pow(x[m] - x[o], 2) + pow(y[m] - y[o], 2)); square[2] = sqrt(pow(x[m] - x[p], 2) + pow(y[m] - y[p], 2)); sort(square, square + 3); if (square[0] == square[1] && sq == 0) { sq = 2; } else { r = 2; } } if (sq != 0 && r != 0) { cout << YES << endl; if (sq == 1) { cout << i + 1 << << j + 1 << << k + 1 << << l + 1 << endl; cout << m + 1 << << n + 1 << << o + 1 << << p + 1 << endl; } else { cout << m + 1 << << n + 1 << << o + 1 << << p + 1 << endl; cout << i + 1 << << j + 1 << << k + 1 << << l + 1 << endl; } } else { cout << NO ; } } else { cout << NO ; } } |
#include <bits/stdc++.h> using namespace std; #define fastIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); #define FF first #define SS second #define pb push_back #define sz(x) (int)x.size() #define oo 1e9 #define eps 1e-9 #define PI acos(-1.0) #define lb lower_bound #define ub upper_bound #define all(a) (a).begin(), (a).end() #define log2i(x) (64 - __builtin_clzll(1ll*(x)) - 1) #define INF 0x7f7f7f7f typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> ii; typedef pair<ii, ii> Li; const int N = 2e5+7, M=100+7; const int MOD = 1e9+7; const int base=30; int n, m, k, t; int fac[N]{1}, invf[N]{1}; int add(int a, int b) { a+=b; if(a>MOD) a-=MOD; return a; } int mul(int a, int b) {return (1LL*a*b)%MOD;} void gcd(int a, int b, int &x, int &y) { if(!b) {x=1, y=0; return;} int tx, ty; gcd(b, a%b, tx, ty); x=ty, y=tx-(a/b)*ty; } int inv(int a) { int x, y; gcd(a, MOD, x, y); return (x%MOD+MOD)%MOD; } int nCk(int n, int k) { if(n<k||k<0) return 0; return mul(fac[n], mul(invf[n-k], invf[k])); } signed main() { //freopen( test.inp , r , stdin); //freopen( test.out , w , stdout); //fastIO; scanf( %d , &t); for(int i=1;i<N;i++) { fac[i]=mul(fac[i-1], i); invf[i]=inv(fac[i]); } while(t--) { scanf( %d%d%d , &n, &m, &k); int r=min(1-m, k-n), ans=nCk(n, n/2); if(n&1) ans=mul(ans, 2); ans=mul(ans, r); for(int pos, neg, i=r+1; i<=r+n;i++) { pos=max(0, m+i-1), neg=max(0, n-k+i); int tmp=n-pos-neg; if(tmp<0) break; ans=add(ans, nCk(tmp, n/2-pos)); if(n&1) ans=add(ans, nCk(tmp, n/2-neg)); } printf( %d n , ans); } return 0; } /* stuff you should look for - int overflow, array bounds - special cases (n=1?) - do smth instead of do nothing and stay organized - WRITE STUFF DOWN - DONT JUST STICK ON ONE APPROACH */ |
#include <bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]) { int n, m; std::cin >> n >> m; if (n == 1 && m == 2) { std::cout << 0 << n ; std::cout << 1 1 << n ; std::cout << 1 2 << n ; std::cout << 1 1 << n ; return 0; } if (n == 2 && m == 1) { std::cout << 0 << n ; std::cout << 1 1 << n ; std::cout << 2 1 << n ; std::cout << 1 1 << n ; return 0; } if ((n * m % 2 == 0 && n != 1 && m != 1)) { std::cout << 0 << n ; std::cout << 1 1 << n ; if (n % 2 == 0) { for (int i = 0; i < n; i++) { if (i % 2 == 0) { for (int j = 0; j < m - 1; j++) { std::cout << i + 1 << << j + 2 << n ; } } if (i % 2 == 1) { for (int j = 0; j < m - 1; j++) { std::cout << i + 1 << << m - j << n ; } } } for (int i = 0; i < n; i++) { std::cout << n - i << << 1 << n ; } } else { for (int i = 0; i < m; i++) { if (i % 2 == 0) { for (int j = 0; j < n - 1; j++) { std::cout << j + 2 << << i + 1 << n ; } } if (i % 2 == 1) { for (int j = 0; j < n - 1; j++) { std::cout << n - j << << i + 1 << n ; } } } for (int i = 0; i < m; i++) { std::cout << 1 << << m - i << n ; } } } else { std::cout << 1 << n ; std::cout << n << << m << ; std::cout << 1 1 << n ; for (int i = 0; i < n; i++) { if (i % 2 == 0) { for (int j = 0; j < m; j++) { std::cout << i + 1 << << j + 1 << n ; } } if (i % 2 == 1) { for (int j = 0; j < m; j++) { std::cout << i + 1 << << m - j << n ; } } } std::cout << 1 1 << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; int ar[50][50]; int dp[51][51]; bool leaf[50]; vector<int> adj[50]; vector<int> adjw[50]; vector<int> leafs; int bad; vector<int> pos; int go(int rem, int now) { if (rem == 0) { return 0; } if (dp[rem][now] != -1) { return dp[rem][now]; } int low = 0; int high = 12500000; while (low < high) { int mid = (low + high + 1) / 2; int temp = rem; for (int i = 0; i < n; i++) { if (!leaf[i] || i == now) { continue; } int cur = 0; while (temp > 0 && ar[now][i] + go(rem - cur - 1, i) >= mid) { cur++; temp--; } } if (temp == 0) { low = mid; } else { high = mid - 1; } } dp[rem][now] = low; return low; } void dfs(int now, int from) { if (leaf[now]) { leafs.push_back(now); } for (int i = 0; i < pos.size(); i++) { if (now == pos[i]) { bad++; } } for (int i = 0; i < adj[now].size(); i++) { int to = adj[now][i]; if (to != from) { dfs(to, now); } } } void dfs(int now, int from, int root, int dist) { ar[root][now] = dist; for (int i = 0; i < adj[now].size(); i++) { int to = adj[now][i]; if (to != from) { dfs(to, now, root, dist + adjw[now][i]); } } } int main() { std::ios::sync_with_stdio(false); cin.tie(0); cin >> n; int maxw = 0; for (int i = 1; i < n; i++) { int a, b, w; cin >> a >> b >> w; a--; b--; adj[a].push_back(b); adj[b].push_back(a); adjw[a].push_back(w); adjw[b].push_back(w); } for (int i = 0; i < n; i++) { dfs(i, -1, i, 0); } for (int i = 0; i <= 50; i++) { for (int j = 0; j <= 50; j++) { dp[i][j] = -1; } } for (int i = 0; i < n; i++) { leaf[i] = adj[i].size() == 1; } int start, m; cin >> start >> m; start--; for (int i = 0; i < m; i++) { int x; cin >> x; x--; pos.push_back(x); } int ans = 12500000; for (int i = 0; i < adj[start].size(); i++) { leafs.clear(); leafs.resize(0); bad = 0; dfs(adj[start][i], start); if (bad == 0) { continue; } int low = 0; int high = 1250000; while (low < high) { int mid = (low + high + 1) / 2; int temp = bad; for (int z = 0; z < leafs.size(); z++) { int cl = leafs[z]; if (cl == start) { continue; } int cur = 0; while (temp > 0 && ar[start][cl] + go(m - cur - 1, cl) >= mid) { cur++; temp--; } } if (temp == 0) { low = mid; } else { high = mid - 1; } } ans = min(ans, low); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ii = pair<int, int>; const int maxn = 5e5 + 5; int n, k; vector<ii> g[maxn]; ll dp[maxn][2]; void solve(int u, int par) { for (ii e : g[u]) { int v = e.first; ll w = e.second; if (v - par) { solve(v, u); } } ll tot0 = 0; vector<ll> pot; for (ii e : g[u]) { int v = e.first; ll w = e.second; if (v - par) { tot0 += dp[v][0]; pot.emplace_back(w + dp[v][1] - dp[v][0]); } } sort(pot.begin(), pot.end()); reverse(pot.begin(), pot.end()); dp[u][0] = dp[u][1] = tot0; for (int i = 0; i < k and i < pot.size() and pot[i] > 0; i++) { dp[u][0] += pot[i]; } for (int i = 0; i < k - 1 and i < pot.size() and pot[i] > 0; i++) { dp[u][1] += pot[i]; } } int main(int argc, char const *argv[]) { int tc; scanf( %d , &tc); while (tc--) { scanf( %d %d , &n, &k); for (int i = 1; i <= n; i++) { g[i].clear(); } for (int i = 1; i < n; i++) { int u, v, w; scanf( %d %d %d , &u, &v, &w); g[u].emplace_back(v, w); g[v].emplace_back(u, w); } solve(1, -1); printf( %lld n , dp[1][0]); } return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.