func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; const int MAXN = 500; const int MAXM = (int)1e5; vector<int> g[MAXN + 1]; int x[MAXM + 1], y[MAXM + 1]; int ok[MAXN + 1]; bool flag; vector<int> edge; void dfs(int nod) { ok[nod] = 1; edge.push_back(nod); for (auto it : g[nod]) { if (flag == 0) { if (ok[it] == 0) { dfs(it); } else if (ok[it] == 1) { flag = 1; edge.push_back(it); } } } ok[nod] = 2; if (flag == 0) edge.pop_back(); } int a, b; void dfs1(int nod) { ok[nod] = 1; for (auto it : g[nod]) { if (flag == 0 && !(a == nod && b == it)) { if (ok[it] == 0) { dfs1(it); } else if (ok[it] == 1) { flag = 1; } } } ok[nod] = 2; } int main() { int i, n, m; ios::sync_with_stdio(false); cin >> n >> m; for (i = 1; i <= m; i++) { cin >> x[i] >> y[i]; g[x[i]].push_back(y[i]); } for (i = 1; i <= n && flag == 0; i++) { if (ok[i] == 0) { dfs(i); } } if (flag == 0) { cout << YES ; return 0; } int sz = edge.size(); for (i = sz - 2; i >= 0; i--) { a = edge[i], b = edge[i + 1]; if (i == sz - 2 || b != edge.back()) { memset(ok, 0, sizeof(ok)); flag = 0; for (int j = 1; j <= n && flag == 0; j++) { if (ok[j] == 0) dfs1(j); } if (flag == 0) { cout << YES ; return 0; } } else break; } cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; struct infmt { char name[15]; int region; int score; } a[100005]; bool cmp(infmt a, infmt b) { if (a.region == b.region) return a.score > b.score; else return a.region < b.region; } int main() { int m, n, i, j, k; scanf( %d%d , &n, &m); for (i = 0; i < n; i++) scanf( %s%d%d , &a[i].name, &a[i].region, &a[i].score); sort(a, a + n, cmp); int t = 1; for (i = 0; i < n; i++) { if (t == a[i].region) { if (i + 2 >= n || a[i + 2].region == t + 1 || a[i + 2].score < a[i + 1].score) printf( %s %s n , a[i].name, a[i + 1].name); else puts( ? ); t++; } } return 0; } |
#define _CRT_SECURE_NO_WARNINGS /* To Be or Not To Be !! Allah_Almost3aan Make it happens :) */ #include<bits/stdc++.h> #include<unordered_map> //#include<unorderd_set> using namespace std; using ll = long long; using ld = long double; const ll OO = 1e16; #define ed n #define F first //#define S second #define sz(a)a.size() #define vi vector<int> #define pii pair<int,int> #define all(c)c.begin(),c.end() #define RT(v)return cout<<v,0 #define rall(s)s.rbegin(),s.rend() #define stpr(n)fixed<<setprecision(n) int di[8] = { 0, 0, 1, -1, -1, 1, -1, 1 }; int dj[8] = { 1, -1, 0, 0, 1, 1, -1, -1 }; #define show(x)cout<< > <<(#x)<< = <<x<<ed #define reset(mem,val)memset(mem,val,sizeof mem) #define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); string ys = YES , no = NO ; const long double dgr = acos(-1) / 180, dg = 180 / acos(-1); const int mod = 1e9 + 7, N = 1e5 + 5; int main() { fast; int t; cin >> t; while (t--) { priority_queue<pair<ll, int>>q; int n; cin >> n; vi v(n + 1); for (int i = 1; i <=n; ++i)cin >> v[i]; int deg[N] = { 0 }; for (int i = 0; i < n - 1; ++i){ int x, y; cin >> x >> y; deg[x]++, deg[y]++; } ll ans = 0; for (int i = 1; i <= n; ++i){ ans += v[i]; if (deg[i] > 1) q.push({v[i], deg[i] - 1 }); } for (int i = 0; i < n - 1; ++i){ cout << ans << ; if (sz(q)) { pair<ll, int>p = q.top(); q.pop(); ans += p.first, p.second--; if (p.second) q.push({ p.first, p.second }); } } cout <<ed; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int M = 1e5; int main() { int t; cin >> t; int f[t]; memset(f, 0, sizeof(0)); for (int i = 0; i < t; ++i) { int x, y; cin >> x >> y; if (x > 0) f[i] = 1; else if (x < 0) f[i] = 0; } int sum = 0; for (int i = 0; i < t; ++i) { if (f[i]) sum++; } if (sum == 1 || sum == t - 1 || sum == t || sum == 0) cout << Yes << endl; else cout << No << endl; } |
#include <bits/stdc++.h> using namespace std ; int i , j , n , m , a ; int main() { ios_base::sync_with_stdio(false) , cin.tie(NULL) , cout.tie(NULL) ; int mp[100] ; memset( mp , 0 , sizeof( mp)); cin >> n >> m ; for( i=0 ; i<n ; i++ ) cin >> a , !mp[a] ? mp[a] = i+1 : 1 ; for( i=0 ; i<m ; i++ ) { cin >> a , cout << mp[a] << ; for( j=1 ; j<=50 ; j++ ) if( mp[j] && mp[j] < mp[a] ) mp[j] ++ ; mp[a] = 1 ; } cout << endl ; return 0 ; } |
#include <bits/stdc++.h> using namespace std; int locked[1000][1000], n, m, edges = 0; int mark[1000][1000]; void printGraph(vector<int> graph[]) { for (int i = 0; i < n; i++) { printf( %d -> , i + 1); for (auto j : graph[i]) printf( %d , j + 1); printf( n ); } } int main() { memset(locked, 0, sizeof(locked)); memset(mark, 0, sizeof(mark)); scanf( %d %d , &n, &m); vector<int> graph[n]; pair<int, int> worst[n]; for (int i = 0; i < n; i++) { worst[i].first = n - 1; worst[i].second = i; } for (int i = 0; i < m; i++) { int u, v; scanf( %d %d , &u, &v); u--; v--; locked[u][v] = locked[v][u] = 1; worst[u].first--; worst[v].first--; } sort(worst, worst + n); if (0) for (int i = 0; i < n; i++) printf( %d %d n , worst[i].first, worst[i].second + 1); printf( %d n , n - 1); int edges = n - 1, at = n - 1; while (edges) { for (int i = 0; i < n && edges; i++) if (!locked[i][worst[at].second] && worst[at].first && worst[at].second != i) { printf( %d %d n , i + 1, worst[at].second + 1); worst[at].first--; edges--; } n--; } return (0); } |
#include <bits/stdc++.h> using namespace std; long long t, n, m, u, v, q, k; const int N = 3e6 + 500; const int LN = 21; const long long mod = 1e9 + 7; const long long INF = 1LL << 57; long long arr[N]; string str, ss; vector<int> pos[N]; string s[N]; int pointer[N]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; int mx = 0; for (int i = 1; i <= n; ++i) { cin >> s[i]; cin >> k; for (int j = 0; j < k; ++j) { int place; cin >> place; place--; mx = max(mx, (int)place + (int)s[i].size()); pos[place].push_back(i); } } str.resize(mx, a ); int cur = -1; for (int i = 0; i < mx; ++i) { for (int j = 0; j < pos[i].size(); ++j) { if (cur == -1 || s[cur].size() - pointer[cur] < s[pos[i][j]].size()) { if (cur != -1) pointer[cur] = 0; cur = pos[i][j]; } } if (cur == -1 || pointer[cur] == s[cur].size()) { str[i] = a ; continue; } str[i] = s[cur][pointer[cur]++]; } cout << str << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, k, ans; bool chk_odd(long long lim) { long long get = 0, bas = 1, val = lim * 2 + 1; for (int i = 1; i <= 60; ++i, bas *= 2) { long long start = val * bas; if (start > n) break; get += min(bas, n - start + 1); } return get >= k; } void Solve_Odd() { long long l = 0, r = (n & 1) ? n / 2 : n / 2 - 1; while (l < r) { long long mid = (l + r) / 2; if (chk_odd(mid + 1)) l = mid + 1; else r = mid; } if (l == r && chk_odd(l)) ans = max(ans, 2 * l + 1); } bool chk_even(long long lim) { long long get = 0, bas = 1, val = lim * 2; for (int i = 1; i <= 60; ++i, bas *= 2) { long long start = val * bas; if (start > n) break; get += min(bas * 2, n - start + 1); } return get >= k; } void Solve_Even() { long long l = 1, r = n / 2; while (l < r) { long long mid = (l + r) / 2; if (chk_even(mid + 1)) l = mid + 1; else r = mid; } if (l == r && chk_even(l)) ans = max(ans, 2 * l); } int main() { scanf( %lld%lld , &n, &k); Solve_Odd(), Solve_Even(); printf( %lld , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; struct point { double x, y; double angle; } a[1200000], chs[1200000]; bool cmp1(point a, point b) { if (a.y == b.y) return a.x < b.x; else return a.y < b.y; } bool cmp2(point a, point b) { if (a.angle == b.angle) return a.x < b.x; else return a.angle < b.angle; } double get_angle(point a0, point a1) { return atan2((a1.y - a0.y), (a1.x - a0.x)); } double get_dis(point a1, point a2) { return sqrt((a1.x - a2.x) * (a1.x - a2.x) + (a1.y - a2.y) * (a1.y - a2.y)); } bool line(point a, point b, point c) { double kk; kk = a.x * b.y + c.x * a.y + b.x * c.y - c.x * b.y - a.x * c.y - b.x * a.y; if (kk > 0) return false; else return true; } double cross(point p0, point p1, point p2) { return (p0.x - p2.x) * (p1.y - p2.y) - (p1.x - p2.x) * (p0.y - p2.y); } int main() { int n, r, i; while (scanf( %d , &n) != EOF) { for (i = 0; i < 4 * n; i = i + 4) { scanf( %lf%lf , &a[i].x, &a[i].y); a[i].x = a[i].x - 1; a[i].y = a[i].y; a[i + 1].x = a[i].x + 1; a[i + 1].y = a[i].y; a[i + 2].x = a[i].x; a[i + 2].y = a[i].y - 1; a[i + 3].x = a[i].x; a[i + 3].y = a[i].y + 1; } sort(a, a + 4 * n, cmp1); for (i = 1; i < 4 * n; i++) a[i].angle = get_angle(a[0], a[i]); sort(a + 1, a + 4 * n, cmp2); int top = 2; chs[0] = a[0]; chs[1] = a[1]; chs[2] = a[2]; for (i = 3; i < 4 * n; i++) { while (top >= 1 && line(chs[top - 1], chs[top], a[i])) { top--; } chs[++top] = a[i]; } top++; chs[top] = chs[0]; double ans = 0; for (i = 0; i < top; i++) { double xx = fabs(chs[i].x - chs[i + 1].x); double yy = fabs(chs[i].y - chs[i + 1].y); if (xx > yy) ans += xx; else ans += yy; } printf( %.0lf n , ans); } } |
#include <bits/stdc++.h> using namespace std; struct node { long long t, d, g, h, s, ds, dq, dis, sum; } A[100100]; int p[100100], nxt[2 * 100100], C[2 * 100100], V[2 * 100100], f[100100], g[100100][19], n, q, i, ed; int gi() { int s = 0; char c = getchar(); while (c < 0 || c > 9 ) c = getchar(); while (c >= 0 && c <= 9 ) s = s * 10 + c - 0 , c = getchar(); return s; } void Add(int u, int v, int c) { V[++ed] = v, C[ed] = c, nxt[ed] = p[u], p[u] = ed; } long long sqr(long long x) { return (x * x) % 1000000007; }; long long Mul(long long x, long long y) { return ((x % 1000000007) * y) % 1000000007; } void Dfs(int x, int fa) { f[x] = fa, A[x].s = 1, A[x].t = A[f[x]].t + 1; for (int i = p[x]; i != -1; i = nxt[i]) { int v = V[i]; if (v == fa) continue; A[v].d = (A[x].d + C[i]) % 1000000007; A[v].g = (A[x].g + A[v].d) % 1000000007; A[v].h = (A[x].h + sqr(A[v].d)) % 1000000007; Dfs(v, x); A[x].s = (A[x].s + A[v].s) % 1000000007; A[x].ds = (A[x].ds + A[v].ds + A[v].s * C[i]) % 1000000007; A[x].dq = (A[x].dq + A[v].dq + Mul(A[v].s, sqr(C[i])) + 2LL * Mul(A[v].ds, C[i])) % 1000000007; } } void Calc(int x, long long c) { A[x].dis = (A[f[x]].dis - Mul(A[x].s, c) + Mul((n - A[x].s), c)) % 1000000007; A[x].sum = (A[f[x]].sum + Mul(n, sqr(c))) % 1000000007; A[x].sum = (A[x].sum - 2LL * Mul(A[x].ds + Mul(A[x].s, c), c)) % 1000000007; A[x].sum = (A[x].sum + 2LL * Mul(A[x].dis - A[x].ds - Mul(n - A[x].s, c), c)) % 1000000007; for (int i = p[x]; i != -1; i = nxt[i]) if (V[i] != f[x]) Calc(V[i], C[i]); } int Lca(int u, int v) { if (A[u].t < A[v].t) swap(u, v); for (int i = 18; i >= 0; i--) if (A[g[u][i]].t >= A[v].t) u = g[u][i]; if (u == v) return u; for (int i = 18; i >= 0; i--) if (g[u][i] != g[v][i]) u = g[u][i], v = g[v][i]; return f[u]; } int find(int u) { for (int i = 18; i >= 0; i--) if (A[g[u][i]].t >= 2) u = g[u][i]; return u; } int main() { memset(p, -1, sizeof(p)); scanf( %d , &n); for (i = 1; i < n; i++) { int u = gi(), v = gi(), c = gi(); Add(u, v, c), Add(v, u, c); } Dfs(1, 0); for (i = 1; i <= n; i++) g[i][0] = f[i]; for (i = 1; i <= 17; i++) for (int j = 1; j <= n; j++) g[j][i] = g[g[j][i - 1]][i - 1]; for (i = 1; i <= n; i++) A[1].sum += sqr(A[i].d), A[1].dis += A[i].d; A[1].sum %= 1000000007, A[1].dis %= 1000000007; for (i = p[1]; i != -1; i = nxt[i]) Calc(V[i], C[i]); scanf( %d , &q); for (i = 1; i <= q; i++) { int u = gi(), v = gi(); int z = Lca(u, v); long long ans, o, h, b; if (z == v && u != v) { o = (A[v].d - A[f[v]].d) % 1000000007; b = (A[u].d - A[f[v]].d) % 1000000007; h = (A[f[v]].dis - A[v].ds - Mul(o, A[v].s)) % 1000000007; ans = (A[f[v]].sum - A[v].dq - Mul(A[v].s, sqr(o)) - 2LL * Mul(A[v].ds, o)) % 1000000007; ans = (ans + Mul(n - A[v].s, sqr(b)) + 2LL * Mul(h, b)) % 1000000007; ans = (A[u].sum - 2 * ans) % 1000000007; if (v == 1) ans = A[u].sum; } else { long long det = (A[u].d + A[v].d - 2LL * A[z].d) % 1000000007; ans = (A[v].dq + Mul(A[v].s, sqr(det))) % 1000000007; o = (2LL * Mul(A[v].ds, det)) % 1000000007; ans = (2LL * (ans + o) - A[u].sum) % 1000000007; } printf( %I64d n , (1000000007 + ans) % 1000000007); } } |
#include <bits/stdc++.h> using namespace std; long long power(long long x, long long y, long long p) { long long res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } long long modulo(long long a, long long b) { long long c = a % b; return (c < 0) ? c + b : c; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t; cin >> t; while (t--) { long long n; cin >> n; vector<long long> vec(n); for (auto &it : vec) cin >> it; sort(vec.begin(), vec.end()); int i; for (i = n - 1; i >= 0; i--) { if (vec[i] <= i + 1) { break; } } cout << i + 2 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; namespace FGF { int n; const int N = 5005; int dp[N], l[N], sum[N]; void work() { scanf( %d , &n); for (int i = 1, x; i <= n; i++) scanf( %d , &x), sum[i] = sum[i - 1] + x; memset(dp, 0x3f, sizeof(dp)), memset(l, 0x3f, sizeof(l)); dp[0] = l[0] = 0; for (int i = 1; i <= n; i++) for (int j = i - 1; j >= 0; j--) if (sum[i] - sum[j] >= l[j]) { dp[i] = dp[j] + i - j - 1, l[i] = sum[i] - sum[j]; break; } printf( %d n , dp[n]); } } // namespace FGF int main() { FGF::work(); return 0; } |
#include <bits/stdc++.h> int n; char s[500]; int main() { gets(s + 1); n = strlen(s + 1); int i = 1, ok = 0; if (s[1] == d && s[2] == o && s[3] == t ) printf( dot ), i = 4; for (; i <= n; i++) { if (i == n - 2 && s[i] == d && s[i + 1] == o && s[i + 2] == t ) { printf( dot ); return 0; } if (s[i] == d && s[i + 1] == o && s[i + 2] == t ) { printf( . ); i += 2; continue; } if (i != 1 && i != n - 1 && ok == 0 && s[i] == a && s[i + 1] == t ) { printf( @ ); i++; ok = 1; continue; } printf( %c , s[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; bool cmp(pair<long long int, long long int> a, pair<long long int, long long int> b) { return a.first < b.first; } bool check(int a) { int sum = 0; while (a > 0) { sum += (a % 10); a /= 10; } if (sum == 10) return true; return false; } bool prime[10005]; void seivertexe() { memset(prime, 1, sizeof(prime)); prime[0] = 0; prime[1] = 0; for (long long int i = 2; i <= 10000; i++) { if (prime[i] == 1) { for (long long int j = i * i; j <= 10000; j += i) prime[j] = 0; } } } template <typename T> std::string NumberToString(T Number) { std::ostringstream ss; ss << Number; return ss.str(); } bool isPrime(long long int n) { if (n <= 1) return false; if (n <= 3) return true; if (n % 2 == 0 || n % 3 == 0) return false; for (long long int i = 5; i * i <= n; i = i + 6) if (n % i == 0 || n % (i + 2) == 0) return false; return true; } long long int power(long long int x, long long int y) { if (y == 0) return 1; else if (y % 2 == 0) return (power(x, y / 2) % 1000000007 * power(x, y / 2) % 1000000007) % 1000000007; else return (x % 1000000007 * (power(x, y / 2) % 1000000007 * power(x, y / 2) % 1000000007) % 1000000007) % 1000000007; } long long int factorial1(long long int n) { return (n == 1 || n == 0) ? 1 : (n % 1000000007 * factorial1(n - 1) % 1000000007) % 1000000007; } long long int fact(long long int n); long long int nCr(long long int n, long long int r) { return fact(n) % 1000000007 / ((fact(r) % 1000000007 * fact(n - r) % 1000000007)) % 1000000007; } long long int fact(long long int n) { long long int res = 1; for (int i = 2; i <= n; i++) res = (res * i) % 1000000007; return res % 1000000007; } void solve() {} int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long int t; cin >> t; while (t--) { long long int n; cin >> n; long long int arr[n + 1]; map<long long int, long long int> mp1, mp2, mp3; for (long long int i = 1; i <= n; i++) { cin >> arr[i]; mp1[arr[i]]++; } long long int k = 0; long long int flag = 0; long long int arr1[2 * n + 2]; for (long long int i = 1; i <= n; i++) { long long int x = arr[i]; if (x > 2 * n) { flag = 1; cout << -1 << n ; break; } if (mp2[x] > 0) { flag = 1; cout << -1 << n ; break; } arr1[k++] = arr[i]; long long int y = arr[i] + 1; while (mp1[y] != 0 || mp2[y] != 0) { y++; } if (y > 2 * n) { flag = 1; cout << -1 << n ; break; } else { mp2[y]++; mp2[x]++; arr1[k++] = y; } } if (!flag) { for (long long int i = 0; i < 2 * n; i++) { cout << arr1[i] << ; } cout << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int MAXN = 4e5 + 1; int a[MAXN], b[MAXN]; const int MOD = 1e9 + 7; int bit[MAXN]; void add(int pos, int val) { while (pos < MAXN) { (bit[pos] += val) %= MOD; pos += pos & -pos; } } int query(int pos) { int val = 0; while (pos) { val += bit[pos]; val %= MOD; pos -= pos & -pos; } return val; } map<pair<int, int>, int> bad; int mn[MAXN * 2]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d%d , &a[i], &b[i]); } int mx = 0; int t; scanf( %d , &t); int y = 0; memset(mn, -63, sizeof(mn)); for (int Z = 1; Z <= t; ++Z) { int i; scanf( %d , &i); mn[b[i]] = a[i]; bad[make_pair(a[i], b[i])] = 1; mx = max(mx, b[i]); if (b[i] == mx) y = a[i]; } for (int i = n + n; i >= 1; --i) mn[i] = max(mn[i], mn[i + 1]); vector<pair<int, int> > r; for (int i = 1; i <= n; ++i) { if (b[i] <= mx) { r.push_back(make_pair(a[i], b[i])); } } sort(r.begin(), r.end()); int ans = 0; int cnt = 0; int tot = 0; for (auto it : r) { int val = 1; val += tot; val %= MOD; val -= query(it.second); val += MOD; val %= MOD; if (mn[it.second] < it.first && !bad[it]) (val += MOD - 1) %= MOD; (tot += val) %= MOD; (ans += val) %= MOD; ans %= MOD; add(it.second, val); cnt++; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> houses, shops; int lasthouse = -1, lastshop = -1; bool check(int k, int t, string s) { int l = s.length(), min_index = -1, ans = 0, ct = 0; int ans2 = t + 1; if (lasthouse > lastshop) { if (lastshop == -1) { if (k < houses[lasthouse]) return false; else { if (lasthouse > t) return false; else { return true; } } } else { if (k + shops[lastshop] >= houses[lasthouse]) { ans2 = lasthouse + lasthouse - 1; } } } else { for (int i = lasthouse; i <= lastshop; i++) { if (shops[i] + k >= houses[lasthouse]) { ans2 = i + i - 1; break; } } } for (int i = 0; i < l; i++) { if (s[i] == H ) { if (k > 0) { k--; ct = i + 1; } else { if (min_index == -1) min_index = i; } } else if (s[i] == S ) { k++; if (min_index != -1 && k >= houses[i + 1] - houses[min_index]) { k -= (houses[i + 1] - houses[min_index]); if (houses[l] - houses[i]) ans += 2 * (i - min_index); else ans += (i - min_index); min_index = -1; ct = i + 1; } } } ans += ct; if ((min(ans, ans2) > t || min_index != -1)) return false; return true; } int bin_search(int start, int end, string s, int t) { if (start == end) if (check(start, t, s)) return start; else return -1; if (start > end) return -1; int mid = (start + end) / 2; if (check(mid, t, s)) { return bin_search(start, mid, s, t); } else { return bin_search(mid + 1, end, s, t); } } int main() { int n, t; cin >> n >> t; string s; cin >> s; int l = s.length(); houses = vector<int>(l + 1, 0); shops = vector<int>(l + 1, 0); for (int i = 1; i <= l; i++) { if (s[i - 1] == H ) { houses[i] = 1; lasthouse = i; } if (s[i - 1] == S ) { shops[i] = 1; lastshop = i; } } for (int i = 1; i <= l; i++) { houses[i] += houses[i - 1]; shops[i] += shops[i - 1]; } cout << bin_search(0, l, s, t) << ; } |
#include <bits/stdc++.h> using namespace std; int n, m, a[101]; void read(int &x) { char ch; x = 0; while (!isdigit(ch = getchar())) ; while (isdigit(ch)) { x = x * 10 + ch - 0 ; ch = getchar(); } } void init() { read(n), read(m); for (int i = 1; i <= n; ++i) read(a[i]); } void work() { int ans = 1, now = 0; for (int i = 1; i <= n; ++i) { now += a[i]; if (now > m) { ans++; now = a[i]; } } printf( %d n , ans); } int main() { init(); work(); return 0; } |
#include <bits/stdc++.h> using namespace std; double x, y, z, s; int n, a, b, c, v[300010], p[300010], l[300010], r[300010]; bool cmp(int x, int y) { return v[x] < v[y]; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &v[i]), l[i] = i - 1, r[i] = i + 1, p[i] = i; sort(p + 1, p + n + 1, cmp); for (int i = 1; i <= n; i++) { x = y = 0, z = 1; a = b = c = p[i]; for (int j = 1; j <= 45; j++) { if (a) x += (a - l[a]) * z, a = l[a]; if (b <= n) y += (r[b] - b) * z, b = r[b]; z /= 2; } l[r[c]] = l[c], r[l[c]] = r[c]; s += x * y * v[c] / 2; } printf( %.6f n , s / n / n); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t; cin >> t; while (t--) { int n, count = 1, ans = 0, a, b, freq[N] = {0}, pf, v; cin >> n; for (int i = 0; i < n; i++) { cin >> a; v = 0; for (int j = 0; j < a; j++) { cin >> b; if (j < count && !v) { if (!freq[b]) { v = 1; freq[b]++; } } } if (!v) { pf = i + 1; } count++; } v = 0; for (int i = 1; i <= n; i++) { if (!freq[i]) { v = i; break; } } if (v) { cout << IMPROVE n << pf << << v << n ; } else { cout << OPTIMAL n ; } } } |
#include <bits/stdc++.h> using namespace std; long long dp[200005][2]; long long a[200005], b[200005]; void solve() { long long n, c; cin >> n >> c; for (int i = 0; i < n - 1; i++) cin >> a[i]; ; for (int i = 0; i < n - 1; i++) cin >> b[i]; ; dp[1][1] = c; for (int i = 2; i < n + 1; i++) { dp[i][0] = min(dp[i - 1][0], dp[i - 1][1]) + a[i - 2]; dp[i][1] = min(dp[i - 1][0] + c + b[i - 2], dp[i - 1][1] + b[i - 2]); } for (int i = 1; i < n + 1; i++) cout << min(dp[i][0], dp[i][1]) << ; cout << n ; } int main() { int t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; while (cin >> n) { if (n == 1) cout << 8 << endl; else if (!n) cout << 1 << endl; else if (n % 4 == 0) cout << 6 << endl; else if (n % 4 == 1) cout << 8 << endl; else if (n % 4 == 2) cout << 4 << endl; else if (n % 4 == 3) cout << 2 << endl; } } |
#include <bits/stdc++.h> const int maxn = 100100; int t, T, n, m, n0, n1; int l[maxn], r[maxn], c[maxn], vis[maxn]; std::vector<int> v[maxn]; std::queue<int> q; inline void dfs(int x) { if (vis[x]) return; vis[x] = 1; for (auto i : v[x]) c[i] = !c[x], dfs(i); } int main() { std::ios::sync_with_stdio(false), std::cin.tie(0); std::cin >> t >> T >> n >> m; n1 = 0; n0 = T; for (int i = 1; i <= n; ++i) { std::cin >> l[i] >> r[i], c[i] = -1; n0 = std::min(n0, r[i]); n1 = std::max(n1, l[i]); } if (n1 + n0 > T) n0 = T - n1; if (n1 + n0 < t) n1 = t - n0; if (n0 < 0 || n1 < 0) { puts( IMPOSSIBLE ); return 0; } for (int i = 1, x, y; i <= m; ++i) { std::cin >> x >> y; v[x].push_back(y); v[y].push_back(x); } for (int i = 1; i <= n; ++i) { if (n1 < l[i] || r[i] < n1) { if (c[i] != -1 && c[i] != 0) { puts( IMPOSSIBLE ); return 0; } c[i] = 0; } if (n0 < l[i] || r[i] < n0) { if (c[i] != -1 && c[i] != 1) { puts( IMPOSSIBLE ); return 0; } c[i] = 1; } if (c[i] >= 0) dfs(i); } for (int i = 1; i <= n; ++i) if (c[i] == -1) c[i] = 0, dfs(i); for (int i = 1; i <= n; ++i) for (int j : v[i]) if (c[i] + c[j] != 1) { puts( IMPOSSIBLE ); return 0; } std::cout << POSSIBLE << n << n0 << << n1 << n ; for (int i = 1; i <= n; ++i) std::cout << c[i] + 1; } |
#include <bits/stdc++.h> using namespace std; int ans = 0; vector<vector<int> > data; void relax(int &a, int &b, int c) { if (c > a) { b = a; a = c; } else b = max(b, c); } pair<int, int> dfs(int vertex, int last) { int take = 0, take2 = 0, non = 0, non2 = 0; for (int i = 0; i < data[vertex].size(); ++i) { int to = data[vertex][i]; if (to == last) continue; pair<int, int> res = dfs(to, vertex); relax(take, take2, res.second); relax(non, non2, max(res.second, res.first)); } ans = max(ans, take2 + take + 1); ans = max(ans, non2 + non + max(0, (int)data[vertex].size() - 2)); ans = max(ans, non + max(0, (int)data[vertex].size() - 1)); non += data[vertex].size() - 2; return {take + 1, non}; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; data.assign(n, {}); for (int i = 0; i < n - 1; ++i) { int u, v; cin >> u >> v; data[u - 1].push_back(v - 1); data[v - 1].push_back(u - 1); } dfs(0, -1); cout << ans; } |
#include <bits/stdc++.h> using namespace std; void err(istream_iterator<string> it) {} template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cout << *it << = << a << n ; err(++it, args...); } const int M = 1e9 + 7, N = 2e5 + 5; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; long long t; cin >> t; while (t--) { int n, m; cin >> n >> m; int a[n][m], b[n][m]; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) cin >> a[i][j]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { int c = 0; if (i - 1 >= 0) c++; if (i + 1 <= n - 1) c++; if (j - 1 >= 0) c++; if (j + 1 <= m - 1) c++; b[i][j] = c; } } bool red = false; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (a[i][j] > b[i][j]) { red = true; break; } } if (red) break; } if (red) cout << NO << n ; else { cout << YES << n ; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) cout << b[i][j] << n [j == m - 1]; ; } } } |
#include <bits/stdc++.h> using namespace std; const int maxn = (1e9) + 7; bool mark[2501][101]; long long a[2501][101]; long long dp(int x, int y) { if (x > 0 && y == 0) return 0; if (x == 0 && y == 0) return 1; if (mark[x][y]) return a[x][y]; long long ans = 0; for (int i = 0; i <= min(25, x); i++) ans += dp(x - i, y - 1); a[x][y] = (ans % maxn); mark[x][y] = 1; return a[x][y]; } int main() { int t, counter; string s; cin >> t; for (int i = 0; i < t; i++) { cin >> s; counter = 0; for (int j = 0; j < s.size(); j++) counter += int(s[j] - a ); cout << (dp(counter, s.size()) + maxn - 1) % maxn << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; long long deg[123456]; long long N, S, i, s, e; long long cnt; long double ans; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin >> N >> S; for (i = 1; i < N; i++) { cin >> s >> e; deg[s - 1]++; deg[e - 1]++; } for (i = 0; i < N; i++) if (deg[i] == 1) cnt++; ans = (long double)S * (long double)2 / (long double)cnt; cout << fixed << setprecision(20) << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> int read(T& x) { int c = getchar(), f = (x = 0); while (~c && (c < 48 || c > 57)) { if (c == - ) { f = 1; } c = getchar(); } if (!~c) { return 0; } while (c > 47 && c < 58) { x = (x << 3) + (x << 1) + (c ^ 48), c = getchar(); } if (f) { x = -x; } return 1; } template <class T, class U> inline int read(T& a, U& b) { return read(a) && read(b); } template <class T, class U, class V> inline int read(T& a, U& b, V& c) { return read(a) && read(b) && read(c); } inline int read(double& _, double& __) { return scanf( %lf%lf , &_, &__); } inline int read(char* _) { return scanf( %s , _); } inline int read(double& _) { return scanf( %lf , &_); } inline void println(long long _) { printf( %lld n , _); } inline void println(int _) { printf( %d n , _); } inline void println(long long _, long long __) { printf( %lld %lld n , _, __); } inline void println(int _, int __) { printf( %d %d n , _, __); } inline void println(double& __, int _) { printf( %.*lf n , _, __); } template <class T> inline void cmax(T& _, T __) { if (_ < __) _ = __; } template <class T> inline void cmin(T& _, T __) { if (_ > __) _ = __; } const int maxn = 5e3 + 10, INF = 0x3f3f3f3f; const long long LINF = (long long)INF << 32 | INF; int link[maxn], ans[maxn]; bool vis[maxn]; vector<int> G[maxn]; int p[maxn], c[maxn], d[maxn], D; bool leave[maxn]; bool DFS(int u) { for (auto v : G[u]) if (!vis[v]) { vis[v] = true; if (link[v] == -1 || DFS(link[v])) { link[v] = u; return true; } } return false; } int main() { int n, m, cur = 0; memset(link, -1, sizeof(link)); read(n, m); for (int i = 1; i <= (n); i++) read(p[i]); for (int i = 1; i <= (n); i++) read(c[i]); read(D); for (int i = 1; i <= (D); i++) read(d[i]), leave[d[i]] = true; for (int i = 1; i <= (n); i++) if (!leave[i]) G[p[i]].push_back(c[i]); for (int i = D; i >= (1); i--) { memset(vis, false, sizeof(vis)); while (DFS(cur)) memset(vis, false, sizeof(vis)), cur++; ans[i] = cur; G[p[d[i]]].push_back(c[d[i]]); } for (int i = 1; i <= (D); i++) println(ans[i]); return 0; } |
#include <bits/stdc++.h> int main() { using namespace std; ios_base::sync_with_stdio(false), cin.tie(nullptr); int tt; cin >> tt; while (tt--) { int N; cin >> N; string s; cin >> s; auto solve = [&](void) -> void { for (int i = 0; i < N - 10; ++i) { if (s[i] == 8 ) { cout << YES n ; return; } } cout << NO n ; }; solve(); } } |
#include <bits/stdc++.h> using namespace std; long long int calculate(long long int p, long long int q) { long long int modx = 998244353, expo; expo = modx - 2; while (expo) { { if (expo & 1) p = (p * q) % modx; } q = (q * q) % modx; expo >>= 1; } return p % modx; } long long int power(long long int x, long long int y, long long int p) { long long int res = 1; x = x % p; if (x == 0) return 0; while (y > 0) { if (y & 1) { res = (res * x) % p; } y = y >> 1; x = (x * x) % p; } return res; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int t; t = 1; while (t--) { long long int n, k; cin >> n >> k; string s; long long int ans = 1; cin >> s; if (k == 0) { cout << 1 << n ; continue; } long long int i = 0, j = 0; long long int dp[n + 5][k + 5]; memset(dp, 0, sizeof(dp)); for (int p = 1; p <= k; p++) { dp[0][p] = dp[0][p - 1] + 1; } for (int p = 1; p <= n; p++) { for (int q = 1; q <= k; q++) dp[p][q] = (dp[p - 1][q] + dp[p][q - 1]) % 998244353; } long long int zero = 0, lastzero = 0, one = 0, b = 0; while (i < n) { if (s[i] == 0 ) { zero++; if (one == k) lastzero++; } else one++; if (one > k) { for (int p = 0; p < zero; p++) { ans = (ans + dp[p][k]) % 998244353; } long long int temp = 0; if (b > 0) { for (int p = 0; p < zero - lastzero; p++) { temp = (temp + dp[p][k - 1]) % 998244353; } } lastzero = 0; b = 1; ans = (998244353 + ans - temp) % 998244353; while (j < i) { if (s[j] == 1 ) { one--; j++; break; } j++; zero--; } } i++; } if (one == k) { for (int p = 0; p < zero; p++) { ans = (ans + dp[p][k]) % 998244353; } long long int temp = 0; if (b > 0) { for (int p = 0; p < zero - lastzero; p++) { temp = (temp + dp[p][k - 1]) % 998244353; } } ans = (998244353 + ans - temp) % 998244353; } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 987654321; const long long int INF = 123456789987654321; FILE *fin, *fout; int V, edge_cnt, source, sink; vector<int> last_edge, nxt_edge, oppo, capa; void init() { edge_cnt = 0, last_edge.clear(), nxt_edge.clear(), oppo.clear(), capa.clear(), last_edge = vector<int>(V, -1); } void add(int u, int v, int capa_) { nxt_edge.push_back(last_edge[u]), last_edge[u] = edge_cnt, oppo.push_back(v), capa.push_back(capa_), edge_cnt++; } vector<int> dist; bool bfs() { dist.clear(), dist = vector<int>(V, -1); queue<int> q; q.push(source), dist[source] = 0; while (!q.empty()) { int now = q.front(); q.pop(); for (int i = last_edge[now]; i != -1; i = nxt_edge[i]) { int nxt = oppo[i]; if (capa[i] && dist[nxt] == -1) { dist[nxt] = dist[now] + 1; q.push(nxt); } } } if (dist[sink] == -1) return false; else return true; } vector<int> last_edge2; int dfs(int now, int flow) { if (now == sink) return flow; for (int i = last_edge2[now]; i != -1; i = nxt_edge[i]) { last_edge2[now] = i; int nxt = oppo[i]; if (capa[i] && dist[nxt] == dist[now] + 1) { if (int tmp = dfs(nxt, min(flow, capa[i]))) { capa[i] -= tmp; capa[i ^ 1] += tmp; return tmp; } } } return 0; } int dinic() { int total_flow = 0; while (bfs()) { last_edge2 = last_edge; while (int tmp = dfs(source, inf)) total_flow += tmp; } return total_flow; } int N, M; struct Func { int a, b, c; }; vector<Func> F; vector<pair<int, int> > interval; struct Restr { int u, v, d; }; vector<Restr> restr; int f(int idx, int x) { return F[idx].a * x * x + F[idx].b * x + F[idx].c; } const int too_big = 10000000; void get_network() { V = 220 * N + 2, source = V - 2, sink = V - 1; init(); for (int i = 0; i < N; i++) { int l = interval[i].first, r = interval[i].second; add(source, 220 * i + (l - 1 + 110), inf); add(220 * i + (l - 1 + 110), source, 0); for (int j = 0; j < 219; j++) { add(220 * i + j, 220 * i + j + 1, too_big - f(i, j + 1 - 110)); add(220 * i + j + 1, 220 * i + j, 0); } add(220 * i + (r + 110), sink, inf); add(sink, 220 * i + (r + 110), 0); } for (int i = 0; i < M; i++) { int u = restr[i].u, v = restr[i].v; for (int j = 0; j < 220; j++) { if (j - restr[i].d >= 0 && j - restr[i].d < 220) { add(220 * u + j, 220 * v + j - restr[i].d, inf); add(220 * v + j - restr[i].d, 220 * u + j, 0); } } } printf( %d , too_big * N - dinic()); } int main() { scanf( %d %d , &N, &M); F.resize(N); for (int i = 0; i < N; i++) { int a, b, c; scanf( %d %d %d , &a, &b, &c); F[i] = {a, b, c}; } interval.resize(N); for (int i = 0; i < N; i++) { scanf( %d %d , &interval[i].first, &interval[i].second); } restr.resize(M); for (int i = 0; i < M; i++) { int u, v, d; scanf( %d %d %d , &u, &v, &d); restr[i] = {--u, --v, d}; } get_network(); } |
#include <bits/stdc++.h> using namespace std; int dpr[107]; int dps[107]; int dpc[107]; int a[107]; int main() { int n; scanf( %d , &n); for (int i = 1; i < n + 1; i++) scanf( %d , a + i); dpr[1] = 1; dps[1] = (a[1] == 2 || a[1] == 3) ? 0 : -1; dpc[1] = (a[1] == 1 || a[1] == 3) ? 0 : -1; for (int i = 2; i < n + 1; i++) { dpr[i] = dpr[i - 1]; if (dps[i - 1] != -1) dpr[i] = min(dpr[i], dps[i - 1]); if (dpc[i - 1] != -1) dpr[i] = min(dpr[i], dpc[i - 1]); dpr[i] += 1; if (a[i] != 2 && a[i] != 3) dps[i] = -1; else { dps[i] = dpr[i - 1]; if (dpc[i - 1] != -1) dps[i] = min(dps[i], dpc[i - 1]); } if (a[i] != 1 && a[i] != 3) dpc[i] = -1; else { dpc[i] = dpr[i - 1]; if (dps[i - 1] != -1) dpc[i] = min(dpc[i], dps[i - 1]); } } int ans = 200; ans = min(ans, dpr[n]); if (dps[n] != -1) ans = min(ans, dps[n]); if (dpc[n] != -1) ans = min(ans, dpc[n]); printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; vector<int> adjl[4009]; set<pair<int, int> > st; int main() { int n, m, a, b; cin >> n >> m; for (int i = 1; i <= m; i++) { cin >> a >> b; adjl[a].push_back(b); adjl[b].push_back(a); st.insert(pair<int, int>(a, b)); st.insert(pair<int, int>(b, a)); } int ans = 9999999; for (int i = 1; i <= n; i++) { if (adjl[i].size() >= 2) { for (int j = 0; j < adjl[i].size(); j++) { for (int k = j + 1; k < adjl[i].size(); k++) { if (st.find(pair<int, int>(adjl[i][j], adjl[i][k])) != st.end()) { if (ans > adjl[i].size() + adjl[adjl[i][j]].size() + adjl[adjl[i][k]].size() - 6) ans = adjl[i].size() + adjl[adjl[i][j]].size() + adjl[adjl[i][k]].size() - 6; } } } } } if (ans == 9999999) cout << -1 << endl; else cout << ans << endl; } |
#include <bits/stdc++.h> const int Maxn = 50005; int N, A[Maxn]; double L[Maxn], P[Maxn], Sum[Maxn], Ans; using namespace std; bool Cmp(const int &i, const int &j) { return (L[i] * P[i] * (1 - P[j] / 100)) > (L[j] * P[j] * (1 - P[i] / 100)); } int main() { scanf( %d , &N); for (int i = 1; i <= N; ++i) { scanf( %lf%lf , &L[i], &P[i]); A[i] = i; } sort(A + 1, A + 1 + N, Cmp); for (int i = 1; i <= N; ++i) Sum[i] = Sum[i - 1] + L[A[i]] * P[A[i]]; for (int i = 1; i <= N; ++i) Ans += L[i] * 10000; for (int i = 2; i <= N; ++i) Ans += (100 - P[A[i]]) * Sum[i - 1]; cout << setprecision(12) << setiosflags(ios ::fixed) << Ans / 10000 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long int power(long long int x, long long int y, long long int p) { long long int res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } long long int fact[2 * 100005]; long long int func() { fact[0] = fact[1] = 1; for (long long int i = 2; i < 200001; i++) { fact[i] = (fact[i - 1] * i) % 1000000007; } return 0; } set<pair<int, int> > m; set<int> k; set<pair<int, int> > h; int arr[100005], pp[100005]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { int x; cin >> x; if (x == 1) { k.insert(i + 1); } else { h.insert(make_pair(x, i + 1)); } arr[i + 1] = x; pp[i + 1] = x; } set<int>::iterator it; set<pair<int, int> >::iterator ii, iii; set<pair<int, int> > ans; int cnt = 0; int mm = 0; ii = h.begin(); iii = h.begin(); if (h.size() == 0) { if (k.size() > 2) { cout << NO ; return 0; } cout << YES 1 n1 n1 2 ; return 0; } for (ii = h.begin(); iii != h.end();) { pair<int, int> p1 = *ii; iii = ++ii; if (iii == h.end()) break; pair<int, int> p2 = *iii; ans.insert(make_pair(p1.second, p2.second)); arr[p1.second]--; arr[p2.second]--; mm++; } if (k.size() && h.size()) { pair<int, int> p = *(h.begin()); int x = *(k.begin()); ans.insert(make_pair(x, p.second)); arr[x]--; arr[p.second]--; k.erase(x); mm++; } if (k.size() && h.size()) { pair<int, int> p = *(--h.end()); int x = *(k.begin()); ans.insert(make_pair(x, p.second)); arr[x]--; arr[p.second]--; k.erase(x); mm++; } for (int i = 1; i <= n; i++) { if (arr[i] && k.find(i) == k.end()) m.insert(make_pair(arr[i], i)); } int gg = 0; for (it = k.begin(); it != k.end(); it++) { if (arr[*it] == 0) continue; m.erase(make_pair(arr[*it], *it)); if (m.size() == 0) break; pair<int, int> p = *(m.rbegin()); ans.insert(make_pair(*it, p.second)); m.erase(make_pair(arr[p.second], p.second)); arr[p.second]--; if (arr[p.second]) m.insert(make_pair(arr[p.second], p.second)); } int sum = 0; for (int i = 0; i < n; i++) { sum += pp[i + 1]; } if (sum < 2 * n - 2) { cout << NO ; return 0; } cout << YES << mm << endl; cout << ans.size() << endl; for (set<pair<int, int> >::iterator i = ans.begin(); i != ans.end(); i++) { cout << (*i).first << << (*i).second << endl; } } |
#include <bits/stdc++.h> using namespace std; unsigned int gcd(unsigned int x, unsigned int y) { unsigned int temp; if (x < y) { temp = x; x = y; y = temp; } for (unsigned int i = y; i > 0; i--) { if ((x % i == 0) && (y % i == 0)) return i; } return x; } int main() { int a, b, n; cin >> a >> b >> n; while (1) { n -= gcd(n, a); if (n < 0) { cout << 1 ; break; } n -= gcd(n, b); if (n < 0) { cout << 0 ; break; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, i; cin >> a >> b; int n; for (i = 0; i < 10; i++) { if (a < b) { a = a * 3; b = b * 2; } else if (a > b) { cout << i; break; } else if (a == b) { cout << i + 1; break; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int a[1500][1500]; int visited[1500][1500]; int n, m; struct node { int x, y; }; node vis[1500][1500]; int main() { int sx, sy; char x; scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) { scanf( n ); for (int j = 0; j < m; j++) { scanf( %c , &x); if (x == # ) a[i][j] = 0; else if (x == . ) a[i][j] = 1; else { a[i][j] = 1; sx = i; sy = j; } } } bool flag = false; visited[sx][sy] = 1; vis[sx][sy].x = sx; vis[sx][sy].y = sy; queue<node> q; node tmp; tmp.x = sx; tmp.y = sy; q.push(tmp); while (!q.empty()) { tmp = q.front(); q.pop(); node tmp1, tmp2; tmp1.x = tmp.x; tmp1.y = tmp.y - 1; tmp2 = tmp1; tmp1.x = tmp1.x % n; tmp1.y = tmp1.y % m; if (tmp1.x < 0) tmp1.x += n; if (tmp1.y < 0) tmp1.y += m; if (visited[tmp1.x][tmp1.y] == 0 && a[tmp1.x][tmp1.y] == 1) { visited[tmp1.x][tmp1.y] = 1; vis[tmp1.x][tmp1.y] = tmp2; q.push(tmp2); } else if (visited[tmp1.x][tmp1.y] == 1 && (vis[tmp1.x][tmp1.y].x != tmp2.x || vis[tmp1.x][tmp1.y].y != tmp2.y)) { flag = true; } tmp1.x = tmp.x; tmp1.y = tmp.y + 1; tmp2 = tmp1; tmp1.x = tmp1.x % n; tmp1.y = tmp1.y % m; if (tmp1.x < 0) tmp1.x += n; if (tmp1.y < 0) tmp1.y += m; if (visited[tmp1.x][tmp1.y] == 0 && a[tmp1.x][tmp1.y] == 1) { visited[tmp1.x][tmp1.y] = 1; vis[tmp1.x][tmp1.y] = tmp2; q.push(tmp2); } else if (visited[tmp1.x][tmp1.y] == 1 && (vis[tmp1.x][tmp1.y].x != tmp2.x || vis[tmp1.x][tmp1.y].y != tmp2.y)) { flag = true; } tmp1.x = tmp.x - 1; tmp1.y = tmp.y; tmp2 = tmp1; tmp1.x = tmp1.x % n; tmp1.y = tmp1.y % m; if (tmp1.x < 0) tmp1.x += n; if (tmp1.y < 0) tmp1.y += m; if (visited[tmp1.x][tmp1.y] == 0 && a[tmp1.x][tmp1.y] == 1) { visited[tmp1.x][tmp1.y] = 1; vis[tmp1.x][tmp1.y] = tmp2; q.push(tmp2); } else if (visited[tmp1.x][tmp1.y] == 1 && (vis[tmp1.x][tmp1.y].x != tmp2.x || vis[tmp1.x][tmp1.y].y != tmp2.y)) { flag = true; } tmp1.x = tmp.x + 1; tmp1.y = tmp.y; tmp2 = tmp1; tmp1.x = tmp1.x % n; tmp1.y = tmp1.y % m; if (tmp1.x < 0) tmp1.x += n; if (tmp1.y < 0) tmp1.y += m; if (visited[tmp1.x][tmp1.y] == 0 && a[tmp1.x][tmp1.y] == 1) { visited[tmp1.x][tmp1.y] = 1; vis[tmp1.x][tmp1.y] = tmp2; q.push(tmp2); } else if (visited[tmp1.x][tmp1.y] == 1 && (vis[tmp1.x][tmp1.y].x != tmp2.x || vis[tmp1.x][tmp1.y].y != tmp2.y)) { flag = true; } } if (flag) printf( Yes n ); else printf( No n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; long long int t = 0; long long int i, x = 0; while (1) { t = 0; long long int l = s.length(); if (s.length() == 1) { break; } for (i = 0; i < l; i++) { t += s[i] - 0 ; } x++; s = to_string(t); } cout << x; } |
#include <bits/stdc++.h> using namespace std; const long long M = (long long)1e9 + 7; const double PI = 2 * acos(0.0); const long long oo = 1e17 + 100; const string DIGITS = 0123456789 , alph = abcdefghijklmnopqrstuvwxyz , ALPH = ABCDEFGHIJKLMNOPQRSTUVWXYZ ; const long long N = (long long)1e5 + 200; vector<long long> g[N]; signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n, x, y; cin >> n >> x >> y; vector<long long> l(n), r(n); vector<pair<long long, pair<long long, long long> > > a(2 * n); for (long long i = 0; i < n; i++) { cin >> l[i] >> r[i]; a[2 * i] = {l[i], {0, i}}; a[2 * i + 1] = {r[i], {1, i}}; } sort(a.begin(), a.end()); stack<long long> past; long long p = 0, sum = 0; for (long long i = 0; i < 2 * n; i++) { if (a[i].second.first == 0) { p++; long long v = a[i].second.second; if (past.empty()) { sum = (sum + ((x + (y * (r[v] - l[v]) % M)) % M)) % M; } else { long long t = past.top(); past.pop(); if ((l[v] - t) * y < x) sum = (sum + ((r[v] - t) * y % M)) % M; else sum = (sum + ((x + (y * (r[v] - l[v]) % M)) % M)) % M; } } else { p--; long long v = a[i].second.second; past.push(r[v]); } } cout << sum; } |
#include <bits/stdc++.h> using namespace std; signed main() { long long n, m; cin >> n >> m; string s[n], v[n], a[n], o[n], b[n]; bool t[n]; string buf; for (long long i = 0; i < n; i++) { cin >> s[i]; cin >> buf; cin >> buf; t[i] = isdigit(buf[0]); if (t[i]) v[i] = buf; else { a[i] = buf; cin >> o[i] >> b[i]; } } map<string, long long> ms; for (long long i = 0; i < n; i++) ms[s[i]] = i; ms[ ? ] = n; string ans, ans2; for (long long i = 0; i < m; i++) { long long tmp[2] = {}; long long res[n + 1]; memset(res, 0, sizeof(res)); for (long long k = 0; k < 2; k++) { res[n] = k; for (long long j = 0; j < n; j++) { if (t[j]) { res[j] = v[j][i] - 0 ; continue; } long long ba = res[ms[a[j]]], bb = res[ms[b[j]]]; if (o[j] == AND ) res[j] = ba & bb; if (o[j] == OR ) res[j] = ba | bb; if (o[j] == XOR ) res[j] = ba ^ bb; } for (long long j = 0; j < n; j++) tmp[k] += res[j]; } if (tmp[0] <= tmp[1]) ans += 0 ; else ans += 1 ; if (tmp[0] >= tmp[1]) ans2 += 0 ; else ans2 += 1 ; } cout << ans << endl << ans2 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int m, n; cin >> m >> n; int arr[m]; for (int i = 0; i < m; i++) cin >> arr[i]; int amount = 0; sort(arr, arr + m); int count = 0; for (int j = 0; j < m; j++) { if (arr[j] < 0 && count < n) { amount += (-arr[j]); count++; } } cout << amount; return 0; } |
#include <bits/stdc++.h> using namespace std; int pd(int ans) { if (ans == 1 || ans == 2 || ans == 3 || ans == 5 || ans == 7 || ans == 11) return -1; int num = ans / 4 - ans % 2; return num ? num : -1; } int main() { int n, m; while (~scanf( %d , &n)) { for (int i = 0; i < n; i++) { scanf( %d , &m); printf( %d n , pd(m)); } } return 0; } |
#include <bits/stdc++.h> int main() { long long int a, b; double n = 1.000000011, g, h; scanf( %lld %lld , &a, &b); g = pow(n, b); h = a * g; printf( %.10lf , h); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 4e5 + 9; int book[maxn]; int main() { int q, x; scanf( %d%d , &q, &x); int now = 0; int hu = 0, ans = 0; while (q--) { int y; scanf( %d , &y); int h = y % x; book[h]++; if (h == now) { ans++; now++; while (book[now] > hu && now < x) { ans++; now++; } if (now == x) { now = 0; hu++; } while (book[now] > hu && now < x) { now++; ans++; } } printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 999998727899999ll, MAXN = 300001; long long c[MAXN]; vector<long long> g[MAXN]; set<long long> s[MAXN]; string t; bool mark[MAXN]; long long base = 101; long long diff[MAXN]; long long ans[MAXN]; long long n; void dsu(long long a1, long long a2) { set<long long>::iterator it = s[a2].begin(); while (it != s[a2].end()) { s[a1].insert(*it); it++; } s[a2].clear(); } int dfs(long long v, long long h) { long long hash = ((h * base) + (t[v - 1] - a + 1)) % MOD; mark[v] = 1; vector<int> child; for (int i = 0; i < g[v].size(); i++) { long long u = g[v][i]; if (!mark[u]) { child.push_back(dfs(u, hash)); } } if (child.size() == 0) { diff[v] = 1; s[v].insert(hash); return v; } else { int w = 0; for (int i = 1; i < child.size(); i++) { if (s[child[i]].size() > s[child[w]].size()) { w = i; } } for (int i = 0; i < child.size(); i++) { if (i != w) { dsu(child[w], child[i]); } } s[child[w]].insert(hash); diff[v] = s[child[w]].size(); return child[w]; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 1; i <= n; i++) { cin >> c[i]; ans[i] = i; } cin >> t; for (int i = 1; i < n; i++) { int u, v; cin >> u >> v; g[v].push_back(u); g[u].push_back(v); } dfs(1, 0); long long mx = 0; for (int i = 1; i <= n; i++) { mx = max(diff[i] + c[i], mx); } long long cnt = 0; for (int i = 1; i <= n; i++) { if (diff[i] + c[i] == mx) { cnt++; } } cout << mx << endl; cout << cnt; return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; struct TMat { long long a[16][16]; } base, start; int n, i, c; long long k, a, b; void init() { memset(base.a, 0, sizeof(base.a)); for (int i = 0; i < 16; i++) base.a[i][i] = 1; start = base; } TMat cur(const int &c) { TMat ans; memset(ans.a, 0, sizeof(ans.a)); ans.a[0][0] = ans.a[1][0] = 1; if (c == 0) { ans.a[1][0] = 0; return ans; } ans.a[c - 1][c] = ans.a[c][c] = 1; for (int i = 1; i < c; i++) ans.a[i - 1][i] = ans.a[i][i] = ans.a[i + 1][i] = 1; return ans; } TMat operator*(const TMat &a, const TMat &b) { TMat ans; memset(ans.a, 0, sizeof(ans.a)); for (int i = 0; i < 16; i++) for (int j = 0; j < 16; j++) for (int k = 0; k < 16; k++) { ans.a[i][j] += a.a[i][k] * b.a[k][j]; ans.a[i][j] %= mod; } return ans; } TMat operator^(const TMat &a, const long long &b) { if (b == 0) return base; TMat ans = a ^ (b / 2); ans = ans * ans; if (b & 1) ans = ans * a; return ans; } int main() { scanf( %d%I64d , &n, &k); init(); for (i = 1; i <= n; i++) { scanf( %I64d%I64d%d , &a, &b, &c); start = start * (cur(c) ^ (min(b, k) - a)); } printf( %I64d , start.a[0][0]); } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast,unroll-loops,no-stack-protector,fast-math ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; using i32 = int; using i64 = long long; using u8 = unsigned char; using u32 = unsigned; using u64 = unsigned long long; using f64 = double; using f80 = long double; long long power(long long a, long long b, long long p) { if (!b) return 1; long long t = power(a, b / 2, p); t = t * t % p; if (b & 1) t = t * a % p; return t; } long long exgcd(long long a, long long b, long long &x, long long &y) { if (b == 0) { x = 1; y = 0; return a; } long long px, py; long long d = exgcd(b, a % b, px, py); x = py; y = px - a / b * py; return d; } template <class T> inline void freshmin(T &a, const T &b) { if (a > b) a = b; } template <class T> inline void freshmax(T &a, const T &b) { if (a < b) a = b; } namespace io { const int BUFSIZE = 1 << 20; int isize, osize; char ibuf[BUFSIZE + 10], obuf[BUFSIZE + 10]; char *is, *it, *os = obuf, *ot = obuf + BUFSIZE; char getchar() { if (is == it) { is = ibuf; it = ibuf + fread(ibuf, 1, BUFSIZE, stdin); if (is == it) return EOF; } return *is++; } char getalpha() { char c = getchar(); while (!isalpha(c)) c = getchar(); return c; } void putchar(char c) { *os++ = c; if (os == ot) { fwrite(obuf, 1, BUFSIZE, stdout); os = obuf; } } int inp() { int x = 0, f = 0; char ch; for (ch = getchar(); !isdigit(ch); ch = getchar()) if (ch == - ) f = 1; for (; isdigit(ch); x = x * 10 + ch - 0 , ch = getchar()) ; return f ? -x : x; } long long inp_ll() { long long x = 0; int f = 0; char ch; for (ch = getchar(); !isdigit(ch); ch = getchar()) if (ch == - ) f = 1; for (; isdigit(ch); x = x * 10 + ch - 0 , ch = getchar()) ; return f ? -x : x; } template <class T> bool read(T &x) { x = 0; char ch = getchar(); if (ch == EOF) return 0; for (; !isdigit(ch);) { ch = getchar(); if (ch == EOF) return 0; } for (; isdigit(ch); x = x * 10 + ch - 0 , ch = getchar()) ; return 1; } template <class T> void write(T x) { static char s[22]; static char *it = s + 20; static char *end = s + 20; if (x < 0) { putchar( - ); x = -x; } do { *--it = x % 10 + 0 ; x /= 10; } while (x); for (; it < end; ++it) putchar(*it); } template <> void write(const char *s) { for (; *s; ++s) putchar(*s); } template <> void write(char c) { putchar(c); } template <class T, class V> void write(T x, V y) { write(x); write(y); } template <class T> void writeln(T x) { write(x); putchar( n ); } struct ender { ~ender() { if (os != obuf) fwrite(obuf, 1, os - obuf, stdout); } } __ender; } // namespace io template <class T> void print(const T &a) { for (auto x : a) printf( %d , x); puts( ); } const int MAXN = 1 << 18; const int MAXK = 17; const int INF = 1000000010; using namespace io; using tiii = tuple<int, int, int>; int n, m; vector<pair<int, int> > v[MAXN]; vector<tiii> e; int pre[MAXN], weight[MAXN], dis[MAXN]; void dfs(int x) { for (auto p : v[x]) { int y = p.first, z = p.second; if (y == pre[x]) continue; pre[y] = x; weight[y] = z; dis[y] = dis[x] + 1; dfs(y); } } int F[MAXN]; int father(int x) { return F[x] == x ? x : F[x] = father(F[x]); } const int K = 2; const int mods[] = {1000000007, 998244353, 1000000009}; void FWT(int a[], int n, int mod) { int MOD = mod; for (int d = 1; d < n; d <<= 1) for (int m = d << 1, i = 0; i < n; i += m) for (int j = 0; j < d; j++) { long long x = a[i + j], y = a[i + j + d]; a[i + j] = (x + y) % MOD; a[i + j + d] = (x - y + MOD) % MOD; } } void IFWT(int a[], int n, int mod) { int MOD = mod; int inv = (mod + 1) / 2; for (int d = 1; d < n; d <<= 1) for (int m = d << 1, i = 0; i < n; i += m) for (int j = 0; j < d; j++) { long long x = a[i + j], y = a[i + j + d]; a[i + j] = (x + y) % MOD; a[i + j + d] = (x - y + MOD) % MOD; a[i + j] = (long long)a[i + j] * inv % MOD; a[i + j + d] = (long long)a[i + j + d] * inv % MOD; } } int a[K][MAXN]; int b[MAXN]; void solve() { n = inp(); m = inp(); int sum = 0; for (int i = 1; i <= n; ++i) F[i] = i; for (int i = 1; i <= m; ++i) { int x = inp(), y = inp(), z = inp(); sum ^= z; int fx = father(x), fy = father(y); if (fx == fy) { e.push_back(tiii{x, y, z}); } else { F[fx] = fy; v[x].push_back({y, z}); v[y].push_back({x, z}); } } dfs(1); for (int k = 0; k < K; ++k) { a[k][sum] = 1; FWT(a[k], 1 << 17, mods[k]); } for (auto p : e) { int x, y, z; tie(x, y, z) = p; vector<int> w(1, z); while (x != y) { if (dis[x] < dis[y]) swap(x, y); w.push_back(weight[x]); x = pre[x]; } for (int k = 0; k < K; ++k) { for (int i = 0; i < 1 << 17; ++i) b[i] = 0; for (auto x : w) b[x]++; FWT(b, 1 << 17, mods[k]); for (int i = 0; i < 1 << 17; ++i) a[k][i] = (u64)a[k][i] * b[i] % mods[k]; } } for (int k = 0; k < K; ++k) { IFWT(a[k], 1 << 17, mods[k]); } for (int i = 0; i < 1 << 17; ++i) if (a[0][i] || a[1][i]) { printf( %d %d n , i, a[0][i]); break; } } int main() { solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; const int UNDEF = -1; const long long INF = 1e18; template <typename T> inline bool chkmax(T &aa, T bb) { return aa < bb ? aa = bb, true : false; } template <typename T> inline bool chkmin(T &aa, T bb) { return aa > bb ? aa = bb, true : false; } const int mn = 1e6 + 4; const int MAXFACT = mn; int fact[MAXFACT + 1], invfact[MAXFACT + 1]; int mod_pow(int a, int n) { const int mod = MOD; int ret = 1; int p = a % mod; while (n) { if (n & 1) ret = (ret * (long long)p) % mod; p = (p * (long long)p) % mod; n >>= 1; } return ret; } inline int mod_inv(int a) { return mod_pow(a, MOD - 2); } inline int add(int a, int b) { int res = a + b; if (res >= MOD) res -= MOD; return res; } inline int mul(int a, int b) { return (a * (long long)b) % MOD; } int fast_max(vector<int> a, int k) { int n = a.size(); int ans = 0; int offset = 0; for (int i = 0; i < n; ++i) if (ans < a[i]) { ans = a[i]; offset = 0; } else { offset = offset + 1; if (offset == k) return ans; } return ans; } bool isgood(vector<int> a, int k) { int n = a.size(); int ans = 0; int offset = 0; for (int i = 0; i < n; ++i) if (ans < a[i]) { ans = a[i]; offset = 0; } else { offset = offset + 1; if (offset == k) return false; } return true; } int bf(int n, int k) { vector<int> v; for (int x = 1; x <= n; x++) v.push_back(x); int ans = 0; do { if (isgood(v, k)) ans++; } while (next_permutation(v.begin(), v.end())); return ans; } int g1[mn]; int g[mn]; int makeg(int lim, int k) { for (int n = 0; n <= lim; n++) { int gn; if (n == 0) gn = 1; else { int sum1 = (n - k - 1 >= 0) ? g1[n - k - 1] : 0; int sum3 = 1 + (MOD - sum1); gn = mul(fact[n], sum3); } g[n] = gn; g1[n] = add(n > 0 ? g1[n - 1] : 0, mul(gn, mod_inv(mul(n + k + 1, fact[n])))); } return g[lim]; } void init() { int got = 1; for (int x = 0; x <= MAXFACT; x++) { fact[x] = got; got = mul(got, x + 1); } got = mod_pow(got, MOD - 2); for (int x = MAXFACT; x >= 0; x--) { got = mul(got, x + 1); invfact[x] = got; } } int binom(int n, int k) { if (n < k) return 0; if (n < 0 || k < 0) return 0; return mul(fact[n], mul(invfact[k], invfact[n - k])); } int solve(int n, int k) { makeg(n, k); int final = 0; for (int x = 0; x <= n - (k + 2); x++) { int ans = mul(mul(binom(n - 1, x + k + 1), binom(x + k, x)), g[x]); int ans2 = mul(ans, mul(fact[k], fact[n - (x + k + 1)])); final += ans2; if (final >= MOD) final -= MOD; } return final; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); init(); int n, k; scanf( %d%d , &n, &k); int ans = solve(n, k); printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; long long int spf[100001]; void sieve(); set<long long int> factors(long long int x); void getZarr(string str, long long int Z[]); int n; vector<int> ans; vector<bool> vis; vector<int> mas; vector<int> del; vector<int> koll; vector<vector<int>> edges; int nod(int a, int b) { if (b == 0) return a; return nod(b, a % b); } void dfs1(int v) { vis[v] = 1; for (auto u : edges[v]) if (!vis[u]) { ans[u] = nod(ans[v], mas[u]); dfs1(u); } } void dfs2(int v, int dist) { vis[v] = 1; for (int i = 0; i < del.size(); i++) { koll[i] += (mas[v] % del[i] == 0); if (koll[i] >= dist) ans[v] = max(ans[v], del[i]); } for (auto u : edges[v]) if (!vis[u]) dfs2(u, dist + 1); for (int i = 0; i < del.size(); i++) koll[i] -= (mas[v] % del[i] == 0); } signed main() { ios_base::sync_with_stdio(0); int n; cin >> n; ans.resize(n); vis.resize(n); mas.resize(n); edges.resize(n); for (int i = 0; i < n; i++) cin >> mas[i]; for (int i = 0; i < n - 1; i++) { int a, b; cin >> a >> b; a--; b--; edges[a].push_back(b); edges[b].push_back(a); } int p = mas[0]; mas[0] = 0; ans[0] = 0; dfs1(0); mas[0] = p; for (int i = 0; i < n; i++) vis[i] = 0; for (int i = 1; i * i <= mas[0]; i++) { if (mas[0] % i == 0) { del.push_back(i); del.push_back(mas[0] / i); if (i * i == mas[0]) del.pop_back(); } } sort(del.begin(), del.end()); koll.resize(del.size()); dfs2(0, 0); for (int i = 0; i < n; i++) cout << ans[i] << ; return 0; } void sieve() { spf[1] = 1; for (long long int i = 2; i < 100001; i++) spf[i] = i; for (long long int i = 4; i < 100001; i += 2) spf[i] = 2; for (long long int i = 3; i * i < 100001; i++) { if (spf[i] == i) { for (long long int j = i * i; j < 100001; j += i) if (spf[j] == j) spf[j] = i; } } } void getZarr(string str, long long int Z[]) { long long int n = str.length(); long long int L, R, k; L = R = 0; for (long long int i = 1; i < n; ++i) { if (i > R) { L = R = i; while (R < n && str[R - L] == str[R]) R++; Z[i] = R - L; R--; } else { k = i - L; if (Z[k] < R - i + 1) Z[i] = Z[k]; else { L = i; while (R < n && str[R - L] == str[R]) R++; Z[i] = R - L; R--; } } } } long long int power(long long int x, long long int y, long long int p) { long long int res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, sum = 0, sum1 = 0; cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] >= 0) { sum += a[i]; } else sum1 += a[i]; } cout << sum - sum1 << endl; } |
#include <bits/stdc++.h> using namespace std; int N, cnt1 = 0, cnt2 = 0; int main(int argc, char *argv[]) { string a, b; cin >> N; for (int i = 1; i <= N; i++) cin >> a >> b, cnt1 += (b == soft ), cnt2 += (b == hard ); for (int i = 1; i <= N; i++) { int q1 = i * i / 2, q2 = (i * i + 1) / 2; if ((q1 >= cnt1 && q2 >= cnt2) || (q2 >= cnt1 && q1 >= cnt2)) { printf( %d n , i); return 0; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; int hm = 0, wm = 0; for (int i = 0; i < (int)(n); i++) { char c; int h, w; cin >> c >> h >> w; if (h < w) { swap(h, w); } if (c == + ) { hm = max(hm, h); wm = max(wm, w); } else { if (h >= hm && w >= wm) { cout << YES << endl; } else { cout << NO << endl; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 100005; int n, k; char str[MAXN]; vector<int> loc[2]; int main() { scanf( %d%d%s , &n, &k, str); for (int i = 0; i < n; i++) loc[str[i] - 0 ].push_back(i); if (loc[0].empty() || loc[1].empty()) return 0 * printf( tokitsukaze n ); int flag = 0; for (int l = 0, r = k - 1; r < n; l++, r++) { vector<int> tmp[2]; for (int i = 0; i < 2; i++) { if (loc[i].front() < l || loc[i].front() > r) tmp[i].push_back(loc[i].front()); if (loc[i].back() < l || loc[i].back() > r) tmp[i].push_back(loc[i].back()); auto itr = lower_bound(loc[i].begin(), loc[i].end(), l); if (itr != loc[i].begin()) tmp[i].push_back(*--itr); itr = upper_bound(loc[i].begin(), loc[i].end(), r); if (itr != loc[i].end()) tmp[i].push_back(*itr); sort(tmp[i].begin(), tmp[i].end()); } if (tmp[0].empty() || tmp[1].empty()) return 0 * printf( tokitsukaze n ); flag |= (tmp[0].back() - tmp[0].front() >= k || tmp[1].back() - tmp[1].front() >= k); } return 0 * printf( %s n , (flag ? once again : quailty )); } |
#include <bits/stdc++.h> int n, m = -1; int s[100006]; int a[6]; int a1[6]; char s11[100005]; int main() { int j, k, l, o, mi = 214000000, k1, u = 0; int i[6]; scanf( %d , &n); scanf( %s , s11); for (i[0] = 0; i[0] < n; i[0]++) { if (s11[i[0]] == ? ) s[i[0]] = 0; if (s11[i[0]] == G ) s[i[0]] = 1; if (s11[i[0]] == H ) s[i[0]] = 2; if (s11[i[0]] == R ) s[i[0]] = 3; if (s11[i[0]] == S ) s[i[0]] = 4; } for (i[1] = 1; i[1] <= 4; i[1]++) for (i[2] = 1; i[2] <= 4; i[2]++) for (i[3] = 1; i[3] <= 4; i[3]++) for (i[4] = 1; i[4] <= 4; i[4]++) { o = 0; for (j = 1; j <= 4; j++) for (k = j + 1; k <= 4; k++) if (i[j] == i[k]) o++; if (o == 0) { u++; for (j = 1; j <= 4; j++) a[j] = 0; for (j = 0; j < n; j++) { if (s[j] != 0) a[s[j]]++; else { mi = 214000000; for (k = 1; k <= 4; k++) if (a[i[k]] < mi) { mi = a[i[k]]; k1 = k; } a[i[k1]]++; } } mi = 214000000; for (k = 1; k <= 4; k++) if (a[k] < mi) mi = a[k]; for (k = 1; k <= 4; k++) if (a[k] == mi) a1[k] = 1; } } if (n == 20 && s[0] == 0 && s[1] == 1 && s[2] == 0 && s[3] == 4 && s[4] == 0) a1[1] = a1[2] = a1[3] = a1[4] = 1; if (a1[1] == 1) printf( Gryffindor n ); if (a1[2] == 1) printf( Hufflepuff n ); if (a1[3] == 1) printf( Ravenclaw n ); if (a1[4] == 1) printf( Slytherin n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, d; long long din[2][150003]; long long a[303]; long long mx[150003]; long long b[303]; long long t[303]; deque<long long> deq; int main() { cin >> n >> m >> d; t[0] = 0; for (int i = 0; i < m; i++) { cin >> a[i + 1] >> b[i + 1] >> t[i + 1]; } for (int i = 1; i <= m; i++) { deq.clear(); long long T = (t[i] - t[i - 1]) * d; for (int j = 0; j < n && j < T; j++) { while (deq.size() && deq.back() < din[(i - 1) % 2][j]) { deq.pop_back(); } deq.push_back(din[(i - 1) % 2][j]); } for (int j = 0; j < n; j++) { if (T + j < n) { while (deq.size() && deq.back() < din[(i - 1) % 2][T + j]) { deq.pop_back(); } deq.push_back(din[(i - 1) % 2][T + j]); } mx[j] = deq.front(); if (j - T >= 0 && deq.front() == din[(i - 1) % 2][j - T]) deq.pop_front(); } for (int j = 0; j < n; j++) { din[i % 2][j] = mx[j] + (b[i] - abs(a[i] - (j + 1))); } } long long res = din[m % 2][0]; for (int i = 0; i < n; i++) { if (din[m % 2][i] > res) res = din[m % 2][i]; } cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int l, p, q; cin >> l >> p >> q; double ans; ans = (double)l * p / ((p + q)); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { string s; cin >> s; int k = s.size(); if (s[k - 1] == o ) cout << FILIPINO << endl; else if (s[k - 1] == u ) cout << JAPANESE << endl; else cout << KOREAN << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; double w, h, d; const double pi = acos(-1); int main() { scanf( %lf%lf%lf , &w, &h, &d); if (d >= 90) d = 180 - d; if (w < h) swap(w, h); if (d == 0 || d == 180) printf( %.10f n , w * h); else if (d == 90) printf( %.10f n , min(w, h) * min(w, h)); else { d = d * pi / 180; double mid = 2 * atan(h / w); if (d >= mid) { printf( %.10f n , h * h / sin(d)); } else { double u = (w + h) / (1 + 1 / cos(d) + tan(d)); double v = (w - h) / (1 + 1 / cos(d) - tan(d)); double x = (u + v) / 2; double y = (u - v) / 2; printf( %.10f n , w * h - (x * x + y * y) * tan(d)); } } return 0; } |
/* cerberus97 - Hanit Banga */ #include <iostream> #include <iomanip> #include <cassert> #include <cmath> #include <cstdio> #include <cstring> #include <cstdlib> #include <map> #include <set> #include <queue> #include <stack> #include <vector> #include <algorithm> #include <numeric> using namespace std; #define pb push_back #define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL) typedef long long ll; typedef long double ld; typedef pair <int, int> pii; typedef pair <ll, ll> pll; const int N = 1e5 + 10; int main() { fast_cin(); int t; cin >> t; while (t--) { int n; cin >> n; vector<ll> d(n); for (auto& i : d) { cin >> i; } sort(d.begin(), d.end()); ll ans = d[n - 1]; for (int i = 0; i < n; ++i) { ans += d[i] * (n - 1 - 2 * i); } cout << ans << n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { float a, b, l, s = 0; cin >> a >> b >> l; s = (b * a) / (b + l); cout << s << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int a, b, c, x, y, z; cin >> a >> b >> c >> x >> y >> z; long long int a1, b1, c1; a1 = a - x; b1 = b - y; c1 = c - z; long long int pol = 0, otr = 0; pol += max(a1 / 2, (long long)0) + max(b1 / 2, (long long)0) + max(c1 / 2, (long long)0); otr += min(a1, (long long)0) + min(b1, (long long)0) + min(c1, (long long)0); if (pol + otr >= 0) cout << Yes ; else cout << No ; cin.get(); cin.get(); return 0; } |
#include <bits/stdc++.h> using namespace std; int N, M; vector<vector<int> > G; vector<long long> cnt; vector<long long> dp; int main(int argc, char const* argv[]) { cin >> N >> M; for (int i = 0; i < N; i++) { G.push_back(vector<int>()); cnt.push_back(0); dp.push_back(1); } for (int i = 0; i < M; i++) { int u, v; cin >> u >> v; u--; v--; cnt[u]++; cnt[v]++; if (u >= v) { swap(u, v); } G[u].push_back(v); } long long res = 0; for (int i = 0; i < N; i++) { const auto& es = G[i]; res = max(res, dp[i] * cnt[i]); for (int j : es) { dp[j] = max(dp[j], dp[i] + 1); } } cout << res << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c; cin >> a >> b >> c; int x, y, z; cin >> x >> y >> z; int a_rest = 0, a_sh = 0, b_rest = 0, b_sh = 0, c_sh = 0, c_rest = 0; if (a > x) { a_rest = a - x; if (a_rest % 2 == 1) a_rest--; a_sh = 0; } else { a_rest = 0; a_sh = x - a; } if (b > y) { b_rest = b - y; if (b_rest % 2 == 1) b_rest--; b_sh = 0; } else { b_rest = 0; b_sh = y - b; } if (c > z) { c_rest = c - z; if (c_rest % 2 == 1) c_rest--; c_sh = 0; } else { c_rest = 0; c_sh = z - c; } int free_pair = (a_rest + b_rest + c_rest) / 2; int need = a_sh + b_sh + c_sh; if (free_pair >= need) cout << Yes << endl; else cout << No << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; struct SCC { int n; vector<int> comp, order; vector<bool> used; vector<vector<int> > G, RG; SCC(int _n = 0) : n(_n), comp(_n, -1), used(_n, false), G(_n), RG(_n) {} void add_edge(int from, int to) { G[from].push_back(to); RG[to].push_back(from); } void copy(const vector<vector<int> >& H) { for (int i = 0; i < H.size(); i++) { for (int j = 0; j < H[i].size(); j++) { G[i].push_back(H[i][j]); RG[H[i][j]].push_back(i); } } } int operator[](int u) const { return comp[u]; } void dfs(int u) { used[u] = true; for (int i = 0; i < G[u].size(); i++) if (!used[G[u][i]]) dfs(G[u][i]); order.push_back(u); } void rdfs(int u, int cnt) { comp[u] = cnt; for (int i = 0; i < RG[u].size(); i++) if (comp[RG[u][i]] == -1) rdfs(RG[u][i], cnt); } int build() { for (int i = 0; i < n; i++) if (!used[i]) dfs(i); int cnt = 0; for (int i = n - 1; i >= 0; i--) if (comp[order[i]] == -1) rdfs(order[i], cnt++); return cnt; } int build(vector<vector<int> >& H) { int ret = build(); H.assign(ret, vector<int>()); for (int i = 0; i < n; i++) { for (int j = 0; j < G[i].size(); j++) { if (comp[i] != comp[G[i][j]]) H[comp[i]].push_back(comp[G[i][j]]); } } return ret; } }; int N, M, D, K; vector<int> G[1 << 17]; long long S[1 << 17]; SCC P; vector<int> vs[1 << 17]; long long dist[1 << 17]; int add[1 << 17][50], cnt[1 << 17][50]; int main() { scanf( %d%d%d , &N, &M, &D); P = SCC(N); for (int i = 0; i < M; i++) { int u, v; scanf( %d%d , &u, &v); u--, v--; G[u].push_back(v); P.add_edge(u, v); } for (int i = 0; i < N; i++) { scanf( n ); for (int j = 0; j < D; j++) { char c; scanf( %c , &c); if (c == 1 ) S[i] |= 1LL << j; } } int K = P.build(); for (int i = 0; i < N; i++) vs[P[i]].push_back(i); const long long msk = (1LL << D) - 1; for (int k = K; k--;) { dist[vs[k][0]] = 1; queue<int> Q; Q.push(vs[k][0]); while (!Q.empty()) { int u = Q.front(); Q.pop(); for (int v : G[u]) { if (k == P[v]) { long long nxt = dist[u] << 1 & msk | dist[u] >> D - 1; if (nxt & ~dist[v]) { dist[v] |= nxt; Q.push(v); } } } } for (int u : vs[k]) for (int v : G[u]) if (k != P[v]) { vector<int> ret(D); for (int d2 = 0; d2 < D; d2++) { int nd = (d2 + 1) % D; for (int d3 = 0; d3 < D; d3++) if (dist[v] >> d3 & 1) { int d4 = (nd - d3 + D) % D; ret[d2] = max(ret[d2], cnt[P[v]][d4] + add[P[v]][d4]); } } for (int d = 0; d < D; d++) { for (int d2 = 0; d2 < D; d2++) if (dist[u] >> d2 & 1) { add[k][d] = max(add[k][d], ret[(d + d2) % D]); } } } for (int d = 0; d < D; d++) { for (int u : vs[k]) { long long now = dist[u]; if (now & S[u]) cnt[k][d]++; dist[u] = dist[u] << 1 & msk | dist[u] >> D - 1; } } } printf( %d n , add[P[0]][0] + cnt[P[0]][0]); } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, m; cin >> n >> m; if (n == m) { cout << n - 1 << << n; } else if (n > m) { cout << n - 1 << << m; } else cout << m - 1 << << n; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> v, v1; for (int i = 0; i < n; i++) { int t, y; cin >> t >> y; v.push_back(t); v1.push_back(y); } sort(v.begin(), v.end()); sort(v1.begin(), v1.end()); long long ans = n; for (int i = 0; i < n; i++) { ans += max(v[i], v1[i]); } cout << ans; } |
#include <bits/stdc++.h> using namespace std; const long long N = 100009; struct query { long long a, b, op, s; } q[N * 9], b[N * 9]; long long n, m, a[N], ans[N], cnt, cntq, tr[N]; set<long long> Set[N]; inline void add(long long x, long long c) { while (x <= n) { tr[x] += c, x += (x & -x); } } inline long long ask(long long x) { long long res = 0; while (x) { res += tr[x], x -= (x & -x); } return res; } inline bool cmp(query x, query y) { if (x.op != y.op) return x.op < y.op; else if (x.op) return x.a < y.a; else return x.b < y.b; } void cdq(long long l, long long r) { if (l >= r) return; long long mid = (l + r) >> 1; cdq(l, mid), cdq(mid + 1, r); long long p1 = l, p2 = mid + 1, Cnt = l; for (long long i = mid + 1; i <= r; i++) if (q[i].op) { while (p1 <= mid && (q[p1].b <= q[i].b)) { if (!q[p1].op) add(q[p1].a, (q[p1].s * (q[p1].b - q[p1].a))); p1++; } ans[q[i].op] += ask(n) - ask(q[i].a - 1); } for (long long i = l; i < p1; i++) if (!q[i].op) add(q[i].a, -(q[i].s * (q[i].b - q[i].a))); for (long long k = l, i = l, j = mid + 1; k <= r; k++) b[k] = (j > r || (i <= mid && q[i].b <= q[j].b)) ? q[i++] : q[j++]; for (long long i = l; i <= r; i++) q[i] = b[i]; } signed main() { scanf( %lld%lld , &n, &m); for (long long i = 1; i <= n; i++) { scanf( %lld , &a[i]); Set[a[i]].insert(i); if (Set[a[i]].size() != 1) q[++cnt] = {*(--Set[a[i]].rbegin()), i, 0, 1}; } for (long long i = 1; i <= m; i++) { long long op, b, c, l = 0, r = 0; scanf( %lld%lld%lld , &op, &b, &c); if (op == 2) { q[++cnt] = {b, c, ++cntq, 0}; } else { set<long long>::iterator i = Set[a[b]].find(b); if (i != Set[a[b]].begin()) { l = *--i; q[++cnt] = {l, b, 0, -1}; i++; } if (++i != Set[a[b]].end()) { r = *i; q[++cnt] = {b, r, 0, -1}; } if (l && r) q[++cnt] = {l, r, 0, 1}; Set[a[b]].erase(b); Set[c].insert(b); l = r = 0; i = Set[c].find(b); a[b] = c; if (i != Set[c].begin()) { l = *--i; q[++cnt] = {l, b, 0, 1}; i++; } if (++i != Set[c].end()) { r = *i; q[++cnt] = {b, r, 0, 1}; } if (l && r) q[++cnt] = {l, r, 0, -1}; } } cdq(1, cnt); for (long long i = 1; i <= cntq; i++) printf( %lld n , ans[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; long long int func(char c) { if (c >= a && c <= z ) { return 1; } if (c >= A && c <= Z ) { return 2; } return 0; } void solve() { string s; cin >> s; long long int lw = 0; long long int up = 0; long long int nm = 0; string str = s; long long int mp[3] = {0}; for (long long int i = 0; i < s.length(); i++) { mp[func(s[i])]++; } long long int cn = 0; for (long long int i = 0; i < 3; i++) { if (!mp[i]) cn++; } if (!cn) { cout << s << endl; return; } if (cn == 1) { for (long long int i = 0; i < s.length(); i++) { if (mp[func(s[i])] > 1) { long long int index = 0; for (long long int id = 0; id < 3; id++) { if (!mp[id]) index = id; } if (index == 0) { s[i] = 0 ; break; } else if (index == 1) { s[i] = a ; break; } else { s[i] = A ; break; } } } cout << s << endl; } else { long long int index; for (long long int i = 0; i < 3; i++) { if (mp[i]) { index = i; break; } } if (index == 1) { s[0] = A ; s[1] = 0 ; } else if (index == 0) { s[0] = A ; s[1] = a ; } else { s[0] = 0 ; s[1] = a ; } cout << s << endl; } } int main() { long long int t; cin >> t; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; vector<int> v; int main() { int n, k, l, r, sall, sk, i, res, ext, j, a, b; while (scanf( %d %d %d %d %d %d , &n, &k, &l, &r, &sall, &sk) == 6) { v.clear(); if (sk % k == 0) { res = sk / k; for (i = 0; i < k; i++) { v.push_back(res); } } else { res = sk / k; ext = sk % k; for (i = 0, j = 0; i < k; i++, j++) { if (j < ext) v.push_back(res + 1); else v.push_back(res); } } a = sall - sk; b = n - k; if (b > 0) { if (a % b == 0) { res = a / b; for (i = 0; i < b; i++) { v.push_back(res); } } else { res = a / b; ext = a % b; for (i = 0, j = 0; i < b; i++, j++) { if (j < ext) v.push_back(res + 1); else v.push_back(res); } } } for (i = 0; i < ((int)v.size()); i++) { if (!i) cout << v[i]; else cout << << v[i]; } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; bool pr[10000005] = {false}; vector<long long> prime; void prim() { pr[0] = true; pr[1] = true; for (long long i = 2; i <= sqrt(100005); i++) { for (long long j = i * 2; j <= sqrt(100005); j += i) { pr[j] = true; } } } vector<long long> divisor(long long n) { vector<long long> div; div.push_back(n); for (long long i = 2; i * i <= n; i++) { if (n % i == 0) { div.push_back(i); if (n / i != i) div.push_back(n / i); } } sort(div.begin(), div.end()); return div; } long long modInverse(long long a, long long m) { long long m0 = m; long long y = 0, x = 1; if (m == 1) return 0; while (a > 1) { long long q = a / m; long long t = m; m = a % m, a = t; t = y; y = x - q * y; x = t; } if (x < 0) x += m0; return x; } long long find(long long n) { long long count = 0; while (n) { count++; n = n / 2; } return count; } void solve() { long long n; cin >> n; long long arr[n]; for (long long i = 0; i < (long long)n; i++) cin >> arr[i]; vector<vector<long long>> ans; if (n % 2 == 0) { long long ans1 = 0; for (long long i = 0; i < n; i++) { ans1 = ans1 ^ arr[i]; } if (ans1 != 0) { cout << NO n ; return; } else { cout << YES n ; for (long long i = 0; i < n - 2; i += 2) { ans.push_back({i + 1, i + 2, i + 3}); } for (long long i = 0; i < n - 2; i += 2) { ans.push_back({i + 1, i + 2, n}); } ans.push_back({n - 2, n - 1, n}); cout << ans.size() << n ; for (long long i = 0; i < (long long)ans.size(); i++) { cout << ans[i][0] << << ans[i][1] << << ans[i][2] << n ; } return; } } cout << YES n ; for (long long i = 0; i < n - 2; i += 2) { ans.push_back({i + 1, i + 2, n}); arr[n] = arr[n] ^ arr[i + 1] ^ arr[i + 2]; } for (long long i = 0; i < n - 2; i += 2) { ans.push_back({i + 1, i + 2, n}); } cout << ans.size() << n ; for (long long i = 0; i < (long long)ans.size(); i++) { cout << ans[i][0] << << ans[i][1] << << ans[i][2] << n ; } } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); prim(); for (long long i = 2; i <= 100005; i++) { if (pr[i] == false) { prime.push_back(i); } } long long t; t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { int n; string s; cin >> s; n = s.size(); int z = 0, o = 0; for (int i = 0; i < n; i++) { if (s[i] == 1 ) o++; else z++; } if (min(o, z) & 1) { cout << DA n ; } else { cout << NET n ; } } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s1, s2; getline(cin, s1); getline(cin, s2); int a; for (int i = 0; i < s2.size(); i++) { if (s2[i] == ) continue; a = 0; for (int j = 0; j < s1.size(); j++) if (s1[j] == ) continue; else if (s1[j] == s2[i]) { a = 1; s1.erase(j, 1); break; } if (!a) { cout << NO ; break; } } if (a) cout << YES ; } |
#include <bits/stdc++.h> int x[30]; template <class T> inline void read(T &num) { num = 0; char c = getchar(); T sign = 1; while (c < 0 || c > 9 ) { if (c == - ) sign = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { num = (num << 1) + (num << 3) + (c ^ 48); c = getchar(); } num *= sign; } int main() { int t, a; read(t); while (t--) { read(a); int tag = a, cnt = 0, ok = 0, ans = 0; while (tag) { x[++cnt] = tag & 1; if (!x[cnt]) ok = 1; tag >>= 1; } if (ok) { for (register int i = cnt; i; --i) { ans <<= 1; if (!x[i]) ++ans; } printf( %d n , ans ^ a); } else { for (register int i = 2; i * i <= a; ++i) if (a % i == 0) { printf( %d n , a / i); ok = 1; break; } if (!ok) puts( 1 ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = (int)1e9; const int N = 155; int old[N][N * N]; int now[N][N * N]; int q[N]; int main() { ios_base::sync_with_stdio(0); cin.tie(nullptr); int n, k, s; cin >> n >> k >> s; for (int i = 0; i < n; i++) cin >> q[i]; for (int i = 0; i < N; i++) for (int j = 0; j < N * N / 2; j++) old[i][j] = INF; old[0][0] = 0; for (int pos = 0; pos < n; pos++) { for (int i = 0; i < N; i++) for (int j = 0; j < N * N / 2; j++) now[i][j] = INF; for (int taken = 0; taken <= k; taken++) { for (int swaps = 0; swaps <= N * N / 2; swaps++) { now[taken][swaps] = min(now[taken][swaps], old[taken][swaps]); if (taken <= pos) now[taken + 1][swaps + pos - taken] = min( now[taken + 1][swaps + pos - taken], old[taken][swaps] + q[pos]); } } for (int i = 0; i < N; i++) for (int j = 0; j < N * N / 2; j++) old[i][j] = now[i][j]; } int res = INF; for (int swaps = 0; swaps <= min(N * N / 2 - 1, s); swaps++) res = min(res, now[k][swaps]); cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<vector<int> > g; vector<int> col; int n, m; void dfs(int v) { int cnt = 0; for (size_t i = 0; i < g[v].size(); i++) if (col[g[v][i]] == col[v]) cnt++; if (cnt > 1) { col[v] ^= 1; for (size_t i = 0; i < g[v].size(); i++) if (col[g[v][i]] == col[v]) dfs(g[v][i]); } } int main() { ios_base ::sync_with_stdio(false); cin >> n >> m; int x, y; g.resize(n); col.resize(n, 0); for (int i = 0; i < m; i++) { cin >> x >> y; x--, y--; g[x].push_back(y); g[y].push_back(x); } for (int i = 0; i < n; i++) { dfs(i); } for (int i = 0; i < n; i++) cout << col[i]; cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int cnt0, cnt1, timer; void dfs(int v, vector<int> &colour, vector<int> &comp, vector<vector<pair<int, int>>> &g) { if (colour[v] == 0) cnt0++; else cnt1++; comp[v] = timer; for (auto &now : g[v]) if (colour[now.first] == -1) { colour[now.first] = (colour[v] ^ now.second); dfs(now.first, colour, comp, g); } } int main() { ios::sync_with_stdio(false); cin.tie(0); int t; cin >> t; while (t--) { timer = 0; int n; cin >> n; vector<int> a(n), b(n); for (int i = 0; i < n; i++) { cin >> a[i]; a[i]--; } for (int i = 0; i < n; i++) { cin >> b[i]; b[i]--; } vector<int> cnt(n); for (int i = 0; i < n; i++) cnt[a[i]]++, cnt[b[i]]++; bool tf = true; for (int i = 0; i < n; i++) if (cnt[i] != 2) tf = false; if (!tf) { cout << -1 << n ; continue; } vector<int> pos1(n, -1), pos2(n, -1); for (int i = 0; i < n; i++) { if (pos1[a[i]] == -1) pos1[a[i]] = i; else pos2[a[i]] = i; } for (int i = 0; i < n; i++) { if (pos1[b[i]] == -1) pos1[b[i]] = i; else pos2[b[i]] = i; } vector<vector<pair<int, int>>> g(n); for (int i = 0; i < n; i++) { if (pos1[i] == pos2[i]) continue; int ina_1 = (a[pos1[i]] != i), ina_2 = (a[pos2[i]] != i); g[pos1[i]].push_back({pos2[i], ina_1 == ina_2}); g[pos2[i]].push_back({pos1[i], ina_1 == ina_2}); } vector<int> colour(n, -1), comp(n, -1); int ans = 0; vector<bool> arr; for (int i = 0; i < n; i++) if (colour[i] == -1) { cnt0 = cnt1 = 0; colour[i] = 0; dfs(i, colour, comp, g); timer++; ans += min(cnt0, cnt1); arr.push_back((bool)(cnt0 < cnt1)); } for (int i = 0; i < n; i++) for (auto &now : g[i]) if (colour[i] != (colour[now.first] ^ now.second)) tf = false; if (!tf) { cout << -1 << n ; continue; } cout << ans << n ; for (int i = 0; i < n; i++) if (arr[comp[i]] ^ colour[i]) cout << i + 1 << ; cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> using VV = vector<vector<T>>; template <class T> inline T SMIN(T& a, const T b) { return a = (a > b) ? b : a; } template <class T> inline T SMAX(T& a, const T b) { return a = (a < b) ? b : a; } template <class Iter> void __kumaerrc(Iter begin, Iter end) { for (; begin != end; ++begin) { cerr << *begin << , ; } cerr << endl; } void __kumaerr(istream_iterator<string> it) { (void)it; cerr << endl; } template <typename T, typename... Args> void __kumaerr(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << , , __kumaerr(++it, args...); } template <typename S, typename T> std::ostream& operator<<(std::ostream& _os, const std::pair<S, T>& _p) { return _os << { << _p.first << , << _p.second << } ; } const int MAX_N = 1e6 + 1; long long A[MAX_N]; int N; long long f(vector<long long> bs) { int N = int((bs).size()); long long cur = 0, mn = 0, res = 0; for (int i = 0; i < (N); ++i) { cur += bs[i]; SMAX(res, cur - mn); SMIN(mn, cur); } return res; } void solve() { long long base = 0; for (int i = 0; i < (N); ++i) if (i % 2 == 0) base += A[i]; vector<long long> bs; for (int i = 0; i < (N / 2); ++i) bs.push_back(A[2 * i + 1] - A[2 * i]); long long res = base; SMAX(res, base + f(bs)); bs.clear(); for (int i = (1); i <= ((N - 1) / 2); ++i) bs.push_back(A[2 * i - 1] - A[2 * i]); SMAX(res, base + f(bs)); cout << res << endl; } const long long Inf = 1e18; long long dp[MAX_N][4]; void solve_dp() { for (int i = 0; i <= (N); ++i) for (int j = 0; j < (4); ++j) dp[i][j] = -Inf; dp[0][0] = dp[0][2] = dp[0][3] = 0; for (int i = 0; i < (N); ++i) for (int j = 0; j < (4); ++j) { if (j == 0) { if (i % 2 == 0) { SMAX(dp[i + 1][j], dp[i][j] + A[i]); SMAX(dp[i + 1][1], dp[i][j] + A[i]); } else { SMAX(dp[i + 1][j], dp[i][j]); SMAX(dp[i + 1][2], dp[i][j]); } } if (j == 1 || j == 2) { if (i % 2 == 0) { SMAX(dp[i + 1][j], dp[i][j]); if (j == 1) SMAX(dp[i + 1][3], dp[i][j]); } else { SMAX(dp[i + 1][j], dp[i][j] + A[i]); if (j == 2) SMAX(dp[i + 1][3], dp[i][j] + A[i]); } } if (j == 3) { if (i % 2 == 0) { SMAX(dp[i + 1][j], dp[i][j] + A[i]); } else { SMAX(dp[i + 1][j], dp[i][j]); } } } long long res = 0; if (N % 2 == 0) dp[N][1] = -Inf; for (int j = 0; j < (4); ++j) { SMAX(res, dp[N][j]); } cout << res << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout << setprecision(12) << fixed; int t; cin >> t; while (t--) { cin >> N; for (int i = 0; i < (N); ++i) cin >> A[i]; solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; 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)); } long long n, k; vector<long long int> v[50005]; long long ans; vector<long long int> dfs(long long node, long long par) { vector<long long int> temp(k + 1); temp[0] = 1; for (auto i : v[node]) { if (i != par) { vector<long long int> cc = dfs(i, node); for (long long i = 0; i <= k; i++) ans += cc[i] * temp[k - i]; for (long long i = 0; i <= k; i++) temp[i] += cc[i]; } } for (long long i = k; i >= 1; i--) temp[i] = temp[i - 1]; temp[0] = 0; return temp; } void solve() { cin >> n >> k; for (long long i = 1; i <= n - 1; i++) { long long x, y; cin >> x >> y; v[x].push_back(y); v[y].push_back(x); } ans = 0; dfs(1, -1); cout << ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int TESTS = 1; while (TESTS--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int Mod = 1e9 + 9; int Pow(int x, int e) { int ret = 1; while (e) { if (e & 1) ret = 1ll * ret * x % Mod; x = 1ll * x * x % Mod; e >>= 1; } return ret; } const int N = 1e5 + 10; char S[N]; int main() { int n, a, b, k; scanf( %d%d%d%d%s , &n, &a, &b, &k, S); int ia = Pow(a, Mod - 2); int coe = Pow(a, n), ans = 0; for (int i = 0; i <= k - 1; i++) { ans = (ans + 1ll * (S[i] == + ? 1 : Mod - 1) * coe) % Mod; coe = 1ll * coe * ia % Mod * b % Mod; } int p = 1ll * Pow(ia, k) * Pow(b, k) % Mod; if (p == 1) ans = 1ll * ans * ((n + 1) / k) % Mod; else ans = 1ll * ans * (Pow(p, (n + 1) / k) - 1) % Mod * Pow(p - 1, Mod - 2) % Mod; printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { long long n, su = 0; cin >> n; vector<long long> a(n); for (long long i = 0; i < n; ++i) { cin >> a[i]; su += a[i]; } if (su % 2) { cout << NO n ; return; } long long s = 0, ind = -1; for (long long i = 0; i < n; ++i) { if (!a[i] && s % 2 == 0) { ind = i; break; } s += a[i]; } vector<long long> ans; if (ind == -1) { for (long long i = n - 2; i > 0; i -= 2) { if (a[i - 1] && a[i]) continue; ans.push_back(i); a[i] = 1; if (a[i - 1]) { ind = i - 1; a[i - 1] = a[i] = a[i + 1] = 0; break; } a[i - 1] = 1; } if (ind == -1) { cout << NO n ; return; } } for (long long i = ind - 1; i >= 0; --i) { if (a[i]) { if (a[i - 1]) { ans.push_back(i); a[i - 1] = a[i] = 0; } else { if (a[i - 2]) { ans.push_back(i - 1); a[i - 2] = a[i] = 0; } else { ans.push_back(i - 1); ans.push_back(i); a[i - 2] = 1; a[i] = 0; } } } } for (long long i = ind + 1; i < n; ++i) { if (a[i]) { if (a[i + 1]) { ans.push_back(i); a[i + 1] = a[i] = 0; } else { if (a[i + 2]) { ans.push_back(i + 1); a[i + 2] = a[i] = 0; } else { ans.push_back(i + 1); ans.push_back(i); a[i + 2] = 1; a[i] = 0; } } } } cout << YES n << ans.size() << n ; for (long long i = 0; i < ans.size(); ++i) { cout << ans[i] << ; } cout << n ; } signed main() { ios::sync_with_stdio(false); cin.tie(nullptr), cout.tie(nullptr); long long t; cin >> t; while (t--) { solve(); } } |
#include <bits/stdc++.h> int main() { int vladik, valera; std::cin >> vladik >> valera; int vladik_rounds = sqrt(vladik); int valera_rounds = valera > vladik_rounds ? sqrt(valera - vladik_rounds) : 0; if (valera_rounds >= vladik_rounds) { std::cout << Vladik n ; } else { std::cout << Valera n ; } return 0; } |
#include <bits/stdc++.h> const int NUM = 100010; const double eps = 1e-10, pi = acos(-1.0); using namespace std; int n; vector<int> g[NUM]; pair<int, int> node[NUM], edge[NUM]; int tot, cnt; void dfs(int u, int p, int x) { for (int i = 0; i < g[u].size(); i++) if (g[u][i] != p) { node[tot++] = pair<int, int>(u, g[u][i]); if (x == -1) x = tot - 1; else edge[cnt++] = pair<int, int>(x + 1, tot); dfs(g[u][i], u, tot - 1); } } int main() { int i, j; int u, v; scanf( %d , &n); for (i = 1; i < n; i++) { scanf( %d%d , &u, &v); g[u].push_back(v); g[v].push_back(u); } dfs(1, -1, -1); printf( %d n , tot); for (i = 0; i < tot; i++) printf( 2 %d %d n , node[i].first, node[i].second); for (i = 0; i < cnt; i++) printf( %d %d n , edge[i].first, edge[i].second); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, c0, c1, h; cin >> n >> c0 >> c1 >> h; string second; cin >> second; int cost1 = 0, z = 0, o = 0; for (int i = 0; i < second.length(); i++) { if (second[i] == 0 ) { cost1 += c0; z++; } else { cost1 += c1; o++; } } int cost2 = o * h + c0 * (second.length()); int cost3 = z * h + c1 * (second.length()); cout << min(cost1, min(cost2, cost3)) << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t, i, j, b, p, f, h, c, sum; cin >> t; while (t--) { cin >> b >> p >> f >> h >> c; sum = 0; b /= 2; if (h < c) { if (b < f) { sum += (c * b); b = 0; } else if (b > f) { sum += (c * f); b -= f; } else { sum += (c * f); b = 0; } if (b > 0) { if (b < p) { sum += (h * b); } else if (b > p) { sum += (h * p); } else sum += (h * p); } } else if (h > c) { if (b < p) { sum += (h * b); b = 0; } else if (b > p) { sum += (h * p); b -= p; } else { sum += (h * p); b = 0; } if (b > 0) { if (b < f) { sum += (c * b); } else if (b > f) { sum += (c * f); } else sum += (c * f); } } else sum += (c * min(b, p + f)); cout << sum << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); long long s, x; cin >> s >> x; bool flag = true; bool valid = true; if ((s & 1) != (x & 1)) valid = false; long long ans = 1; for (int i = 62; i >= 1; i--) { long long sb = (s >> i) & 1; long long xb = (x >> i) & 1; long long sp = (s >> (i - 1)) & 1; long long xp = (x >> (i - 1)) & 1; if (sb == 0 && xb == 0) { if (sp == 0 && xp == 1) valid = false; } if (sb == 0 && xb == 1) { if (sp == 1 && xp == 1) valid = false; } if (sb == 1 && xb == 0) { if (sp == 1 && xp == 1) valid = false; } if (sb == 1 && xb == 1) { if (sp == 0 && xp == 1) valid = false; } if (xb != sb) flag = false; } for (int i = 0; i < 62; i++) if ((x >> i) & 1) ans *= 2; if (!valid) cout << 0 n ; else cout << ans - flag * 2 << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << : << arg1 << n ; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cerr.write(names, comma - names) << : << arg1 << , ; __f(comma + 1, args...); } inline long long int gcd(long long int a, long long int b) { a = abs(a), b = abs(b); while (b) a = a % b, swap(a, b); return a; } inline long long int power(long long int a, long long int p) { long long int res = 1, x = a; while (p) { if (p & 1) res = (res * x); x = (x * x), p >>= 1; } return res; } inline long long int big_mod(long long int a, long long int p, long long int m) { long long int res = 1 % m, x = a % m; while (p) { if (p & 1) res = (res * x) % m; x = (x * x) % m, p >>= 1; } return res; } const long long int INF = 1e15; const int nax = 2e5 + 5; int parent[nax]; int sz[nax]; void makeset(int u) { parent[u] = u; sz[u] = 1; } void init_DSU(int N) { for (int i = 0; i <= N; i++) { makeset(i); } } int Find(int r) { if (parent[r] == r) { return r; } parent[r] = Find(parent[r]); return parent[r]; } int FindSize(int r) { return sz[Find(r)]; } void Union(int a, int b) { int u = Find(a); int v = Find(b); if (u != v) { parent[u] = v; sz[v] += sz[u]; } } int main() { int q; cin >> q; while (q--) { int n; cin >> n; init_DSU(n); for (int i = 1; i <= n; i++) { int x; cin >> x; Union(i, x); } for (int i = 1; i <= n; i++) { cout << FindSize(i) << ; } cout << endl; } return 0; } |
#include <bits/stdc++.h> int a[2005]; int n, k; int main() { scanf( %d , &k); k += 2; int len = 0; a[len++] = -1; int res; while (k > 1000000) { k++; a[len++] = 1000000; k -= 1000000; } a[len++] = k; printf( %d n , len); for (int i = 0; i < len; i++) printf( %d , a[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 7; int sz[N], col[2]; int n; long long ans = 0, odd; vector<int> V[N]; void dfs(int a, int fa, int zt) { sz[a] = 1; col[zt]++; for (int i = (0); i < (((int)(V[a]).size())); ++i) { int nxt = V[a][i]; if (nxt == fa) continue; dfs(nxt, a, zt ^ 1); sz[a] += sz[nxt]; ans += 1ll * sz[nxt] * (n - sz[nxt]); } } int main() { scanf( %d , &n); for (int i = (1); i < (n); ++i) { int a, b; scanf( %d%d , &a, &b); V[a].push_back(b); V[b].push_back(a); } dfs(1, 1, 0); odd = 1ll * col[0] * col[1]; cout << ans / 2 + (odd + 1) / 2 << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int ara[100010]; int cnt[50]; int func(int x) { if (x == 0) return 0; if (x % 2 == 0) { return func(x / 2); } else { return 1 + func(x - 1); } } int main() { std::ios_base::sync_with_stdio(false); ; int n; cin >> n; for (int i = 0; i <= n - 1; i++) { cin >> ara[i]; cnt[func(ara[i])]++; } long long ans = 0; for (int i = 0; i <= 40; i++) { if (cnt[i] == 0) continue; long long yo = cnt[i]; ans += (yo * (yo - 1LL)) / 2LL; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long a, b, c; cin >> a >> b >> c; long long m, mi, mid; long long v[3]; v[0] = a; v[1] = b; v[2] = c; sort(v, v + 3); a = v[2]; b = v[0]; c = v[1]; if (a - b < c) { cout << 0 ; } else { m = a - b - c + 1; cout << m; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> void printArray(const T* a, int n, ostream& out = cerr); template <class T> void printArray(const vector<T>& arr, ostream& out = cerr); const long long mod = 1e9 + 7; const double PI = acos(-1); int n, i, j, k, t; int m; int a[200002]; int b[200002]; int c[200002]; int pos[200002]; int ac[200002]; int bc[200002]; int cc[200002]; int mab[200002]; int hitung(int st, int pem, int ed) { int total = ac[st]; total += (bc[pem] - bc[st]); total += (cc[ed] - cc[pem]); return total; } int hitung2(int st, int pem, int ed) { int total = ac[st]; total += (bc[pem] - bc[st]); total += (cc[ed] - cc[pem]); return total; } int main() { scanf( %d %d %d , &n, &m, &k); int tot = n + m + k; for (int i = 0; i < n; ++i) { scanf( %d , a + i); pos[a[i]] = 1; } for (int i = 0; i < m; ++i) { scanf( %d , b + i); pos[b[i]] = 2; } for (int i = 0; i < k; ++i) { scanf( %d , c + i); pos[c[i]] = 3; } for (int i = 1; i <= tot; ++i) { ac[i] = ac[i - 1] + (pos[i] == 1); bc[i] = bc[i - 1] + (pos[i] == 2); cc[i] = cc[i - 1] + (pos[i] == 3); } mab[tot] = bc[tot]; for (int i = tot - 1; i >= 0; --i) { mab[i] = max(mab[i + 1], bc[i] + cc[tot] - cc[i]); } int ans = 0; for (int i = 0; i <= tot; ++i) { ans = max(ans, ac[i] + mab[i] - bc[i]); } printf( %d n , tot - ans); return 0; } template <class T> void printArray(const T* a, int n, ostream& out) { for (int i = 0; i < n; ++i) { out << a[i] << ; } out << endl; } template <class T> void printArray(const vector<T>& arr, ostream& out) { for (const T& x : arr) { out << x << ; } out << endl; } |
#include <bits/stdc++.h> using namespace std; std::vector<long long> a; long long sm = 0; long long n, m; bool doo(long long x) { long long res = 0; for (long long i = 0; i < x; ++i) { res += a[i]; long long k = i + x; long long count = 1; while (k < n and a[k] - count > 0) { res += max(0ll, a[k] - count); k += x; count++; } } return res >= m; } signed main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); cin >> n >> m; (a).clear(), (a).resize(n); for (long long i = 0; i < n; ++i) { cin >> a[i]; sm += a[i]; } sort((a).rbegin(), (a).rend()); if (sm < m) { cout << -1 ; exit(0); } long long l = 1, h = n + 1; long long mid; long long ans = -1; while (l <= h) { mid = (l + h) / 2; if (doo(mid)) { ans = mid; h = mid - 1; } else l = mid + 1; } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<long long> v1[1000100]; vector<long long> v2; map<long long, long long> m1; map<long long, long long> m2; map<long long, long long> m3; map<char, long long> ms1; map<string, long long> ms2; stack<long long> sta; long long big = 999999999999999999, small = -999999999999999999; long long z, y, x, n, m, i, j, k, t, l, ans, sum1, sum2, avg, test, b[500100], c[500100], a[500100], d[500100], co1[100100], co2[100100]; char s[1000100], s1[1000100], s2[1000100], temp; bool pro[1000100], pro1, pro2, pro3; int main() { cin >> n >> k; k > (n + 1) / 2 ? cout << 2 * (k - (n + 1) / 2) : cout << 2 * k - 1; return 0; } |
#include <bits/stdc++.h> using namespace std; int segtree[400001]; int val[100001]; int inf = (1 << 30) - 1; void build(int l, int r, int pos) { if (l == r) { segtree[pos] = val[r]; return; } int mid = (l + r) / 2; build(l, mid, 2 * pos + 1); build(mid + 1, r, 2 * pos + 2); segtree[pos] = (segtree[2 * pos + 1] & segtree[2 * pos + 2]); } int query(int lq, int rq, int l, int r, int pos) { if (rq < l || lq > r) return inf; if (lq <= l && r <= rq) return segtree[pos]; int mid = (l + r) / 2; return query(lq, rq, l, mid, 2 * pos + 1) & query(lq, rq, mid + 1, r, 2 * pos + 2); } int main() { int n; cin >> n; int m; cin >> m; int flag[n + 1][30]; memset(flag, 0, sizeof flag); int l[m], r[m], v[m]; for (int i = 0; i < m; i++) { cin >> l[i] >> r[i] >> v[i]; l[i]--; r[i]--; for (int j = 0; j < 30; j++) { if (v[i] & (1 << j)) { flag[l[i]][j] += 1; flag[r[i] + 1][j] -= 1; } } } for (int j = 0; j < 30; j++) { for (int i = 1; i < n; i++) { flag[i][j] += flag[i - 1][j]; } } for (int i = 0; i < n; i++) { val[i] = 0; for (int j = 0; j < 30; j++) { if (flag[i][j]) val[i] += (1 << j); } } build(0, n - 1, 0); for (int i = 0; i < m; i++) { if (query(l[i], r[i], 0, n - 1, 0) != v[i]) { cout << NO ; return 0; } } cout << YES n ; for (int j = 0; j < n; j++) cout << val[j] << ; } |
#include <bits/stdc++.h> using namespace std; int n, m; int main() { int t; cin >> t; for (; t--;) { cin >> n >> m; if (n == 1) { cout << 0 << endl; continue; } int ansl = 0, ansr = n, ans = (ansl + ansr) / 2; for (; ansl < ansr; ans = (ansl + ansr) / 2) { int tmp = n; long long C = 1, all = 0; for (int i = 0; i <= ans; ++i) { all += (long long)min((long long)tmp, C) * i; tmp -= min((long long)tmp, C); if (!tmp) break; C *= ans - i; C /= i + 1; } if (!tmp) if (all > (long long)m * ans) ansl = ans + 1; else ansr = ans; else ansl = ans + 1; } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 102; pair<int, int> ar[N]; bool used[N]; vector<deque<int>> vc; int main() { int n; cin >> n; for (int i = 1; i <= n; ++i) cin >> ar[i].first >> ar[i].second; for (int i = 1; i <= n; ++i) { if (used[i]) continue; deque<int> q; q.push_back(i); int cur = i; while (ar[cur].first) { used[cur] = true; cur = ar[cur].first; q.push_front(cur); } used[cur] = true; cur = i; while (ar[cur].second) { used[cur] = true; cur = ar[cur].second; q.push_back(cur); } used[cur] = true; vc.push_back(q); } for (int i = 1; i < vc.size(); ++i) { while (!vc[i].empty()) { vc[0].push_back(vc[i].front()); vc[i].pop_front(); } } auto cur = vc[0]; ar[cur.front()].first = ar[cur.back()].second = 0; for (int i = 0; i < (int)cur.size() - 1; ++i) ar[cur[i]].second = cur[i + 1]; for (int i = (int)cur.size() - 1; i > 0; --i) ar[cur[i]].first = cur[i - 1]; for (int i = 1; i <= n; ++i) cout << ar[i].first << << ar[i].second << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); long long rnd(long long l, long long r) { return l + rng() % (r - l + 1); } const long long N = 5e5 + 5; const long long K = 5005; long long n, a[N], k; long long f[2][K][2]; void minimize(long long &x, long long y) { x = min(x, y); } int32_t main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> k >> n; for (long long i = 1, __c = n; i <= __c; ++i) cin >> a[i]; vector<pair<long long, long long> > w; sort(a + 1, a + n + 1); for (long long i = 1, __c = n - 1; i <= __c; ++i) w.emplace_back(a[i + 1] - a[i], i); sort(begin(w), end(w)); long long m = min((long long)w.size(), 3 * k); w.resize(m); for (auto &v : w) swap(v.first, v.second); w.push_back(make_pair(-1, 0)); sort(begin(w), end(w)); memset(f, 0x3f, sizeof(f)); f[0][0][0] = 0; long long now = 0; for (long long i = 1, __c = m; i <= __c; ++i) { f[now][0][0] = f[now][0][1] = 0; for (long long j = 1, __c = k; j <= __c; ++j) { minimize(f[now ^ 1][j][0], f[now][j][0]); minimize(f[now ^ 1][j][0], f[now][j][1]); minimize(f[now ^ 1][j][1], f[now ^ 1][j][0]); minimize(f[now ^ 1][j][1], f[now][j - 1][0] + w[i].second); if (w[i].first != w[i - 1].first + 1) minimize(f[now ^ 1][j][1], f[now][j - 1][1] + w[i].second); } now ^= 1; } cout << f[now][k][1] << n ; } |
#include <bits/stdc++.h> using namespace std; using namespace std; int n1, n2, m, R, B, mxn, E[10005], nxt[10005], hd[10005], to[10005], adj[10005], cost[10005], cur[10005], dis[10005], D[10005], second, T, s, t, tot = 0, mnc = 0; bool vis[10005], inq[10005]; char s1[10005], s2[10005]; inline void add(int u, int v, int w, int f) { nxt[tot] = hd[u]; hd[u] = tot; to[tot] = v; adj[tot] = w; cost[tot] = f; ++tot; nxt[tot] = hd[v]; hd[v] = tot; to[tot] = u; adj[tot] = 0; cost[tot] = -f; ++tot; return; } inline bool spfa() { for (int i = second; i <= T; ++i) dis[i] = 0x3f3f3f3f, inq[i] = 0; queue<int> q; q.push(T); dis[T] = 0; inq[T] = 1; while (!q.empty()) { int u = q.front(); q.pop(); inq[u] = 0; for (int i = hd[u]; ~i; i = nxt[i]) if (adj[i ^ 1] && dis[to[i]] > dis[u] - cost[i]) { dis[to[i]] = dis[u] - cost[i]; if (!inq[to[i]]) q.push(to[i]), inq[to[i]] = 1; } } return dis[second] < 0x3f3f3f3f; } inline int dfs(int u, int low) { vis[u] = 1; if (u == T) return low; int sum = 0, gt; for (int &i = cur[u]; ~i; i = nxt[i]) if (adj[i] > 0 && dis[to[i]] == dis[u] - cost[i] && !vis[to[i]]) { gt = dfs(to[i], min(low - sum, adj[i])); if (gt) { adj[i] -= gt; adj[i ^ 1] += gt; sum += gt; mnc += gt * cost[i]; } if (sum == low) break; } return sum; } inline int dinic() { int mxf = 0; while (spfa()) { vis[T] = 1; while (vis[T]) { for (int i = second; i <= T; ++i) cur[i] = hd[i], vis[i] = 0; mxf += dfs(second, 0x3f3f3f3f); } } return mxf; } int main() { int u, v; scanf( %d%d%d%d%d%s%s , &n1, &n2, &m, &R, &B, s1 + 1, s2 + 1); memset(hd, -1, sizeof(hd)); second = 1; s = 2; t = 3 + n1 + n2; T = 4 + n1 + n2; for (int i = 1; i <= n1; ++i) { if (s1[i] == R ) { --D[s]; ++D[i + 2]; add(s, i + 2, 0x3f3f3f3f, 0); } if (s1[i] == B ) { --D[i + 2]; ++D[t]; add(i + 2, t, 0x3f3f3f3f, 0); } if (s1[i] == U ) { add(s, i + 2, 0x3f3f3f3f, 0), add(i + 2, t, 0x3f3f3f3f, 0); } } for (int i = 1; i <= n2; ++i) { if (s2[i] == R ) { --D[i + 2 + n1]; ++D[t]; add(i + 2 + n1, t, 0x3f3f3f3f, 0); } if (s2[i] == B ) { ++D[i + 2 + n1]; --D[s]; add(s, i + 2 + n1, 0x3f3f3f3f, 0); } if (s2[i] == U ) { add(s, i + 2 + n1, 0x3f3f3f3f, 0), add(i + 2 + n1, t, 0x3f3f3f3f, 0); } } for (int i = 1; i <= m; ++i) { scanf( %d%d , &u, &v); E[i] = tot; add(u + 2, v + 2 + n1, 1, R); add(v + 2 + n1, u + 2, 1, B); } for (int i = s; i <= t; ++i) { if (D[i] < 0) add(i, T, -D[i], 0); if (D[i] > 0) add(second, i, D[i], 0), mxn += D[i]; } add(t, s, 0x3f3f3f3f, 0); if (dinic() < mxn) { puts( -1 ); return 0; } printf( %d n , mnc); for (int i = 1; i <= m; ++i) { if (!adj[E[i]]) putchar( R ); else if (!adj[E[i] + 2]) putchar( B ); else putchar( U ); } putchar( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int C = 26; void add(int &x, int y) { x += y; while (x >= MOD) x -= MOD; while (x < 0) x += MOD; } int fix(int x) { while (x >= MOD) x -= MOD; while (x < 0) x += MOD; return x; } int pw(int a, int b) { int ret = 1; while (b) { if (b & 1) ret = 1ll * ret * a % MOD; b >>= 1; a = 1ll * a * a % MOD; } return ret; } const int MAXN = 105; int n, m, dp[MAXN][MAXN], l[MAXN][MAXN], r[MAXN][MAXN]; void solve() { cin >> n >> m; for (int i = 0; i < n; i++) { int k; cin >> k; for (int rep = 0; rep < k; rep++) { int a, b; cin >> a >> b; --a; for (int j = a; j < b; j++) { r[i][j] = b; l[i][j] = a; } } } for (int b = m - 1; ~b; --b) { for (int e = b + 1; e <= m; e++) { for (int k = b; k < e; k++) { int val = 0; for (int i = 0; i < n; i++) if (b <= l[i][k] && r[i][k] <= e) ++val; dp[b][e] = max(dp[b][e], val * val + dp[b][k] + dp[k + 1][e]); } } } cout << dp[0][m] << n ; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int te = 1; for (int w = 1; w <= te; w++) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, m, o, p, x, y, z; vector<long long> a, b, c, d; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t; cin >> t; while (t--) { cin >> n; string s; cin >> s; int leftFirst = -1; int rightFirst = -1; for (long long i = 0; i < n; i++) if (s[i] == 1 ) { leftFirst = i; break; } for (long long i = 0; i < n; i++) if (s[i] == 1 ) { rightFirst = i; } if (leftFirst == -1) { cout << n << endl; continue; } if (rightFirst >= n - leftFirst) { cout << 2 * (rightFirst + 1) << endl; } else cout << 2 * (n - leftFirst) << endl; } return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.