Datasets:
malteklaes
/
cpp-code-code_search_net-style

Dataset card Data Studio Files Community
1
func_code_string
stringlengths
59
71.4k
#include <bits/stdc++.h> using namespace std; int main() { long long int t; cin >> t; while (t--) { long long int x, k; cin >> x >> k; long long int temp = k % 4; long long int i = 1; while (temp--) { if (x % 2) { x += ((k / 4) * 4) + i; } else { x -= ((k / 4) * 4) + i; } i++; } cout << x << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; string s; vector<char> t; int main() { cin >> s; for (int i = 0; i < s.size(); i++) { if (t.size() != 0 and t.back() == s[i]) { t.pop_back(); } else { t.push_back(s[i]); } } for (int i = 0; i < t.size(); i++) { cout << t[i]; } }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, d, i, j, k, s, t, ans; cin >> n >> d; s = 0; for (i = 0; i < n; i++) { cin >> t; s += t; } if (s + (n - 1) * 10 > d) ans = -1; else ans = (d - s) / 5; cout << ans << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { if (a % b == 0) return b; else return gcd(b, a % b); } int a, b, c, d; int main() { scanf( %d %d %d %d , &a, &b, &c, &d); int t, bo; if (a * d >= c * b) { t = b * c; bo = d * a; } else { t = a * d; bo = c * b; } t = bo - t; int cc = gcd(t, bo); printf( %d/%d n , t / cc, bo / cc); }
#include <bits/stdc++.h> using namespace std; long long spf[101]; long long fac[101]; void sieve() { spf[1] = 1; for (long long i = 2; i < 101; i++) spf[i] = i; for (long long i = 4; i < 101; i += 2) spf[i] = 2; for (long long i = 3; i * i < 101; i++) { if (spf[i] == i) { for (long long j = i * i; j < 101; j += i) if (spf[j] == j) spf[j] = i; } } } map<long long, long long> getfactor(long long a) { map<long long, long long> m; while (a > 1) { m[spf[a]]++; a /= spf[a]; } return m; } long long power(long long x, long long y, long long p) { long long res = 1; x = x; if (x == 0) return 0; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } long long gcd(long long a, long long b) { if (a == 0) return b; return gcd(b % a, a); } long long inverse(long long a, long long p) { return power(a, p - 2, p); } long long ncr(long long n, long long r, long long p) { if (r == 0) return 1; return (fac[n] * inverse(fac[r], p) % p * inverse(fac[n - r], p) % p) % p; } long long pre1[200000] = {0}, pre2[200000] = {0}; void solve() { long long n; cin >> n; for (long long i = 1; i <= n; i++) { long long x; cin >> x; pre1[i] += pre1[i - 1] + (x == 1); pre2[i] += pre2[i - 1] + (x == 2); } for (long long i = n + 1; i <= 150000; i++) { pre1[i] += pre1[i - 1] + 1; pre2[i] += pre2[i - 1] + 1; } vector<pair<long long, long long> > v; for (long long i = 1; i <= n; i++) { long long j = 0; long long count1 = 0, count2 = 0; long long counter = 0; while (1) { long long g = lower_bound(pre1 + j, pre1 + 140000, pre1[j] + i) - pre1; long long l = lower_bound(pre2 + j, pre2 + 140000, pre2[j] + i) - pre2; if (g == n && l > n) { count1++; if (count1 > count2) { v.push_back(make_pair(count1, i)); break; } } if (l == n && g > n) { count2++; if (count2 > count1) { v.push_back(make_pair(count2, i)); break; } } if (l > n && g > n) break; if (l < g) { count2++; j = l; } else { count1++; j = g; } } } sort(v.begin(), v.end()); cout << v.size() << n ; for (auto it : v) cout << it.first << << it.second << n ; } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t = 1; while (t--) { solve(); } }
#include <bits/stdc++.h> using namespace std; unsigned long long hs[1050], hL[1 << 15], bs[50]; int main() { mt19937_64 rnd(time(0)); srand(time(0)); int n, s, d; scanf( %d%d%d , &n, &s, &d); for (int i = 0; i < 1050; i++) hs[i] = rnd(); random_shuffle(hs, hs + 1050); for (int i = 0; i < s; i++) { int c; scanf( %d , &c); while (c--) { int k; scanf( %d , &k); bs[i] ^= hs[k]; } } int mid = min(10, s / 2); for (int bits = 0; bits < (1 << mid); bits++) { for (int i = 0; i < mid; i++) { if (bits >> i & 1) { hL[bits] ^= bs[i]; } } } unordered_map<unsigned long long, int> mp; mp[0] = 0; for (int bits = 0; bits < (1 << (s - mid)); bits++) { unsigned long long val = 0; for (int i = 0; i < s - mid; i++) { if (bits >> i & 1) { val ^= bs[i + mid]; } } int cnt = __builtin_popcount(bits); if (!mp.count(val) || mp[val] > cnt) { mp[val] = cnt; } } while (d--) { int c; scanf( %d , &c); unsigned long long v = 0; while (c--) { int k; scanf( %d , &k); v ^= hs[k]; } int res = INT_MAX; for (int bits = 0; bits < (1 << mid); bits++) { unsigned long long val = hL[bits] ^ v; if (mp.count(val)) res = min(res, mp[val] + __builtin_popcount(bits)); } if (res == INT_MAX) puts( -1 ); else printf( %d n , res); } return 0; }
#include <bits/stdc++.h> using namespace std; long long int x_array[5000], y_array[5000]; long long int dx[50001], dy[50001]; int main() { int a; char str[5000]; long long int cnt = 0; scanf( %d , &a); scanf( %s , str); int len = strlen(str); for (int i = 0; i < len; i++) { int j = i + 1; x_array[j] = x_array[j - 1] + str[i] - 0 ; y_array[j] = y_array[j - 1] + str[i] - 0 ; }; for (int i = 1; i <= len; i++) { for (int j = i; j <= len; j++) { dx[x_array[j] - x_array[i - 1]]++; dy[y_array[j] - y_array[i - 1]]++; } } if (a != 0) { for (int i = 1; i < 50000; i++) { if (dx[i] && a % i == 0) { int temp = a / i; if (temp >= 50000) continue; cnt += dx[i] * dy[temp]; } } } else if (a == 0) { for (int i = 1; i < 50000; i++) { cnt += dx[0] * dy[i] + dx[i] * dy[0]; } if (dx[0]) cnt += dx[0] * dy[0]; } printf( %I64d n , cnt); return 0; }
#include <bits/stdc++.h> using namespace std; const int64_t N = 1e6 + 10; string second; int64_t X, Y, n, m; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m; for (int64_t i = 0; i < n; i++) { cin >> second; for (int64_t j = 0; j < second.size(); j++) if (second[j] == * ) X ^= j, Y ^= i; } cout << Y + 1 << << X + 1; return -0; }
#include <bits/stdc++.h> using namespace std; int n, m, d[1002], s[1002], t, f, sum, k; int main() { cin >> m >> k; for (int i = 2; i <= m + 1; i++) { cin >> d[i]; } for (int i = 1; i <= m; i++) { cin >> s[i]; } for (int i = 1; i <= m; i++) { f += s[i]; t = max(t, s[i]); while (f < d[i + 1]) { sum += k, f += t; } sum += d[i + 1], f -= d[i + 1]; } cout << sum; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { vector<long long> arr(3); for (int i = 0; i < 3; i++) cin >> arr[i]; sort(arr.begin(), arr.end()); if (arr[2] <= arr[1] + arr[0] + 1) cout << Yes << endl; else cout << No << endl; } }
#include <bits/stdc++.h> const int mod = 1000000007; using namespace std; int dp[5009][5009]; char s1[5009], s2[5009]; int main() { while (scanf( %s%s , s1, s2) == 2) { memset(dp, 0, sizeof(dp)); int len2 = strlen(s2); for (int i = 1; s1[i - 1]; i++) { for (int j = 1; s2[j - 1]; j++) { if (s1[i - 1] == s2[j - 1]) { dp[i][j] = (dp[i - 1][j - 1] + dp[i][j - 1] + 1) % mod; } else dp[i][j] = dp[i][j - 1]; } } int ans = 0; for (int i = 1; s1[i - 1]; i++) ans = (ans + dp[i][len2]) % mod; printf( %d n , ans); } return 0; }
#include <bits/stdc++.h> using namespace std; template <typename A> ostream &operator<<(ostream &cout, vector<A> const &v); template <typename A, typename B> ostream &operator<<(ostream &cout, pair<A, B> const &p) { return cout << ( << p.first << , << << p.second << ) ; } template <typename A> ostream &operator<<(ostream &cout, vector<A> const &v) { cout << [ ; for (int i = 0; i < v.size(); i++) { if (i) cout << , ; cout << v[i]; } return cout << ] << endl; } const long long mod = 1000000007; bool compare1(vector<int> &a, vector<int> &b) { if (a[0] == b[0]) { return a[1] < b[1]; } return a[0] < b[0]; } bool compare2(vector<int> &a, vector<int> &b) { if (a[1] == b[1]) { return a[0] < b[0]; } return a[1] < b[1]; } void dfs(int cur, int par, vector<vector<int>> &tree, vector<int> &vis, int &c, vector<int> &val) { vis[cur] = 1; c = min(c, val[cur]); for (auto it : tree[cur]) { if (!vis[it]) { dfs(it, cur, tree, vis, c, val); } } } void solve() { int n, k; cin >> n >> k; vector<vector<int>> val(n, vector<int>(4)); vector<vector<int>> tree(n); vector<int> vis(n); vector<int> cost(n); for (int i = 0; i < n; i++) { for (int j = 0; j < 3; j++) { cin >> val[i][j]; } val[i][3] = i; cost[i] = val[i][2]; } sort(val.begin(), val.end(), compare1); for (int i = 1; i < n; i++) { if (val[i][0] == val[i - 1][0] && abs(val[i][1] - val[i - 1][1]) <= k) { tree[val[i][3]].push_back(val[i - 1][3]); tree[val[i - 1][3]].push_back(val[i][3]); } } sort(val.begin(), val.end(), compare2); for (int i = 1; i < n; i++) { if (val[i][1] == val[i - 1][1] && abs(val[i][0] - val[i - 1][0]) <= k) { tree[val[i][3]].push_back(val[i - 1][3]); tree[val[i - 1][3]].push_back(val[i][3]); } } deque<int> st; for (int i = 0; i < n; i++) { if (!vis[i]) { int c = INT_MAX; dfs(i, i, tree, vis, c, cost); st.push_back(c); } } sort(st.begin(), st.end()); int t = 0; while (((int)st.size())) { while (((int)st.size()) && st.front() == t) { st.pop_front(); } if (((int)st.size())) { st.pop_back(); } if (((int)st.size())) { t++; } } cout << t << n ; } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int tc = 1; cin >> tc; while (tc--) { solve(); } return 0; }
#include<stdio.h> #include<vector> #include<algorithm> using namespace std; #define R register int #define I inline #define N 100001 vector<int>G[N],C[N],H[N]; int dep[N],g[448][N],fa[N],b[448],sz[N]; char ans[N]; bool f[448][N]; struct Painter{ char Character; int LeftNum; }; I void DFS(int x){ dep[x]=dep[fa[x]]+1; C[dep[x]].push_back(x); sz[x]=1; for(vector<int>::iterator T=G[x].begin();T!=G[x].end();T++){ DFS(*T); sz[x]+=sz[*T]; } } I bool Compare(int x,int y){ return sz[x]<sz[y]; } I void Swap(Painter&A,Painter&B){ Painter Tem=A; A=B; B=Tem; } int main(){ Painter A,B; A.Character= a ; B.Character= b ; int n,maxdep=0; scanf( %d%d ,&n,&A.LeftNum); B.LeftNum=n-A.LeftNum; for(int i=2;i<=n;i++){ scanf( %d ,fa+i); G[fa[i]].push_back(i); } DFS(1); for(R i=1;i<=n;i++){ if(dep[i]>maxdep){ maxdep=dep[i]; } } for(int i=1;i<=maxdep;i++){ H[C[i].size()].push_back(i); } f[0][0]=true; int tot=0; for(R i=1;i<=n;i++){ if(H[i].empty()==false){ tot++; b[tot]=i; int ct=H[i].size(); for(R j=0;j!=i;j++){ f[tot][j]=f[tot-1][j]; } for(R j=i;j<=n;j++){ if(f[tot-1][j]==true){ f[tot][j]=true; }else{ if(f[tot][j-i]==true){ g[tot][j]=g[tot][j-i]+1; if(g[tot][j]<=ct){ f[tot][j]=true; } } } } } } if(f[tot][A.LeftNum]==true){ printf( %d n ,maxdep); int p=A.LeftNum; for(R i=1;i<=n;i++){ ans[i]= b ; } for(R i=tot;i!=0;i--){ int t=g[i][p]; p-=t*b[i]; for(R j=0;j!=t;j++){ int d=H[b[i]][j]; for(vector<int>::iterator T=C[d].begin();T!=C[d].end();T++){ ans[*T]= a ; } } } }else{ printf( %d n ,maxdep+1); for(R i=1;i<=maxdep;i++){ sort(C[i].begin(),C[i].end(),Compare); if(A.LeftNum<B.LeftNum){ Swap(A,B); } while(C[i].empty()==false&&A.LeftNum!=0){ ans[C[i].back()]=A.Character; A.LeftNum--; C[i].pop_back(); } while(C[i].empty()==false){ ans[C[i].back()]=B.Character; B.LeftNum--; C[i].pop_back(); } } } for(R i=1;i<=n;i++){ putchar(ans[i]); } return 0; }
#include <bits/stdc++.h> using namespace std; string s, u; stack<char> t; vector<char> mins; int main() { cin >> s; u = ; int inicio = 0, tam = s.length(); char ant = z + 1; for (int i = tam - 1; i >= 0; i--) { ant = min(ant, s[i]); mins.push_back(ant); } reverse(mins.begin(), mins.end()); while (inicio < tam) { if (t.empty()) { t.push(s[inicio]); inicio++; } else { if (t.top() <= mins[inicio]) { u += t.top(); t.pop(); } else { t.push(s[inicio]); inicio++; } } } while (!t.empty()) { u += t.top(); t.pop(); } if (inicio < tam) { u += s[inicio]; } cout << u << n ; }
#include <bits/stdc++.h> using namespace std; const long long inf = 1e18; const long double eps = 1e-6; const long long maxn = 1e6 + 100; vector<long long> g[maxn]; long long szc1[maxn], szc2[maxn]; vector<long long> used; void dfsc(long long v, long long col) { used[v] = 1; szc1[col]++; szc2[col]++; for (long long u : g[v]) { if (used[u]) continue; dfsc(u, col); } } bitset<maxn> dp; signed main() { ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr); long long n, k; cin >> n >> k; vector<long long> p(n); for (long long i = 0; i < n; ++i) { cin >> p[i], --p[i]; g[i].push_back(p[i]); g[p[i]].push_back(i); } long long idxc = 0; used.assign(n, 0); for (long long i = 0; i < n; ++i) { if (!used[i]) { dfsc(i, idxc); ++idxc; } } long long ansl = 0, ansr = 0; long long kl = k, kr = k; for (long long i = 0; i < idxc; ++i) { if (szc1[i] >= 2 && kr) { --kr; ansr += 2; } } long long add = 0; for (long long i = 0; i < idxc && kr; ++i) { long long t = szc1[i]; long long x = t / 2 - 1; if (t >= 3 && t % 2) { ++add; } x = min(x, kr); if (x >= 1) { ansr += 2 * x; kr -= x; } } add = min(add, kr); ansr += add; kr -= add; vector<pair<long long, long long>> gg; vector<long long> cnt(n + 1, 0), us(n + 1, 0); for (long long i = 0; i < idxc; ++i) { cnt[szc2[i]]++; } for (long long i = 0; i < idxc; ++i) { if (us[szc2[i]]) continue; gg.push_back({szc2[i], cnt[szc2[i]]}); us[szc2[i]] = 1; } dp[0] = 1; for (long long i = 0; i < (long long)gg.size(); ++i) { for (long long t = 1; t <= gg[i].second; t *= 2) { long long x = t * gg[i].first; auto bb = dp; bb <<= x; dp |= bb; gg[i].second -= t; } long long x = gg[i].second * gg[i].first; auto bb = dp; bb <<= x; dp |= bb; } if (dp[kl]) ansl = kl; else ansl = kl + 1; cout << ansl << << ansr; return 0; }
#include <bits/stdc++.h> using namespace std; int n; vector<vector<int> > adj(1e5 + 1); set<int> rem; vector<int> ord; void search(int pred1, int pred2) { if (ord.size() == n) return; int nxt = 0; for (int j = 0; j < 4 && nxt == 0; j++) { for (int k = 0; k < 4; k++) { int x = adj[pred1][j], y = adj[pred2][k]; if (x == y && rem.find(x) != rem.end()) { nxt = x; rem.erase(x); break; } } } if (nxt) { ord.push_back(nxt); search(nxt, pred1); } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 0; i < 2 * n; i++) { int a, b; cin >> a >> b; adj[a].push_back(b); adj[b].push_back(a); } for (int i = 1; i <= n; i++) { if (adj[i].size() != 4) { cout << -1 << n ; return 0; } } for (int i = 0; i < 4; i++) { for (int j = i + 1; j < 4; j++) { rem.clear(); ord.clear(); for (int k = 2; k <= n; k++) { rem.insert(k); } ord.push_back(adj[1][i]); rem.erase(adj[1][i]); ord.push_back(1); ord.push_back(adj[1][j]); rem.erase(adj[1][j]); search(adj[1][j], 1); if (ord.size() == n) { for (int i = 0; i < n; i++) { cout << ord[i] << ; } cout << n ; return 0; } } } cout << -1 << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const int MAX = 1e5 + 6.66; const int MAXN = MAX << 2; const int N = MAX << 1; pair<int, int> p[MAX]; int up[MAXN]; int down[MAXN]; int uppre[MAXN], upsuf[MAXN], downpre[MAXN], downsuf[MAXN]; int main() { memset(down, 63, sizeof down); memset(downpre, 63, sizeof downpre); memset(downsuf, 63, sizeof downsuf); memset(up, -63, sizeof up); memset(uppre, -63, sizeof uppre); memset(upsuf, -63, sizeof upsuf); int n; cin >> n; for (int i = 0; i < n; i++) cin >> p[i].first >> p[i].second; for (int i = 0; i < n; i++) { int x = p[i].first + p[i].second + N; int y = p[i].first - p[i].second + N; up[x] = max(up[x], y); down[x] = min(down[x], y); } for (int i = 0; i < MAXN; i++) uppre[i] = upsuf[i] = up[i]; for (int i = 0; i < MAXN; i++) downpre[i] = downsuf[i] = down[i]; for (int i = 0; i < MAXN - 2; i++) { uppre[i + 2] = max(uppre[i + 2], uppre[i]); downpre[i + 2] = min(downpre[i + 2], downpre[i]); } for (int i = MAXN - 1; i > 1; i--) { upsuf[i - 2] = max(upsuf[i], upsuf[i - 2]); downsuf[i - 2] = min(downsuf[i - 2], downsuf[i]); } for (int i = 0; i < MAXN; i++) down[i] = max((i - 1 > -1 && i - 1 < MAXN ? downpre[i - 1] : -1e9 - 7), (i + 1 > -1 && i + 1 < MAXN ? downsuf[i + 1] : -1e9 - 7)); for (int i = 0; i < MAXN; i++) up[i] = min((i - 1 > -1 && i - 1 < MAXN ? uppre[i - 1] : 1e9 + 7), (i + 1 > -1 && i + 1 < MAXN ? upsuf[i + 1] : 1e9 + 7)); long long ans = 0; for (int i = 1; i < MAXN - 1; i++) { ans += max(0, up[i] - down[i]) / 2; } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const long long dx[] = {-1, 0, 0, 1}; const long long dy[] = {0, -1, 1, 0}; const int Mass = (int)2e5 + 5; const int inf = (int)1e9 + 5; const long long linf = (long long)1e18 + 5; const long long Mod = (long long)1e9 + 7; long long ModFix(long long a, long long Mod) { return ((((a) % (Mod)) + (Mod)) % (Mod)); } long long ModSum(long long a, long long b, long long Mod) { return ModFix(((a) + (b)), (Mod)); } long long ModSub(long long a, long long b, long long Mod) { return ModFix(((a) - (b)), (Mod)); } long long ModMul(long long a, long long b, long long Mod) { return ModFix(((a) * (b)), (Mod)); } int a[150]; int main() { ios_base ::sync_with_stdio(false); cin.tie(NULL); int n, m; cin >> n; cin >> m; int res = 0; for (int i = 1; i <= n; ++i) cin >> a[i]; for (int i = 1; i <= m; ++i) { int l, r; cin >> l >> r; int sum = 0; for (int j = l; j <= r; ++j) { sum += a[j]; } if (sum >= 0) res += sum; } cout << res; return 0; }
#include <bits/stdc++.h> const int N = 1000 + 10; struct tnode { int x, y; long long val; tnode() {} tnode(int _x, int _y, long long _val) { x = _x; y = _y; val = _val; } }; int n, m, r, c; int a[N][N], b[N][N], f[N][N]; long long sum[N][N]; int Q[N], head, tail; std::vector<tnode> ans, out; bool vis[N][N]; long long S(int x1, int y1, int x2, int y2) { return sum[x2][y2] - sum[x2][y1 - 1] - sum[x1 - 1][y2] + sum[x1 - 1][y1 - 1]; } bool cmp(const tnode& i, const tnode& j) { if (i.val != j.val) return i.val < j.val; else if (i.x != j.x) return i.x < j.x; else return i.y < j.y; } int main() { scanf( %d%d%d%d , &n, &m, &r, &c); for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) { scanf( %d , &a[i][j]); sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + a[i][j]; } for (int i = 1; i <= n; ++i) { head = tail = 0; for (int j = 1; j <= m; ++j) { while (head != tail && a[i][Q[tail - 1]] >= a[i][j]) { if (--tail < 0) tail = N - 1; } while (head != tail && Q[head] < j - c + 1) { if (++head == N) head = 0; } Q[tail++] = j; if (tail == N) tail = 0; if (j >= c) b[i][j - c + 1] = a[i][Q[head]]; } } for (int j = 1; j + c - 1 <= m; ++j) { head = tail = 0; for (int i = 1; i <= n; ++i) { while (head != tail && b[Q[tail - 1]][j] >= b[i][j]) { if (--tail < 0) tail = N - 1; } while (head != tail && Q[head] < i - r + 1) { if (++head == N) head = 0; } Q[tail++] = i; if (tail == N) tail = 0; if (i >= r) f[i - r + 1][j] = b[Q[head]][j]; } } for (int i = 1; i + r - 1 <= n; ++i) for (int j = 1; j + c - 1 <= m; ++j) { ans.push_back(tnode( i, j, S(i, j, i + r - 1, j + c - 1) - (long long)f[i][j] * r * c)); } std::sort(ans.begin(), ans.end(), cmp); for (int i = 0; i < ans.size(); ++i) { if (vis[ans[i].x][ans[i].y]) continue; out.push_back(ans[i]); for (int j = std::max(1, ans[i].x - r + 1); j <= ans[i].x + r - 1; ++j) for (int k = std::max(1, ans[i].y - c + 1); k <= ans[i].y + c - 1; ++k) vis[j][k] = true; } printf( %d n , out.size()); for (int i = 0; i < out.size(); ++i) { printf( %d %d %I64d n , out[i].x, out[i].y, out[i].val); } return 0; }
#include <bits/stdc++.h> using LL = long long; const LL inf = 1LL << 60; const int kN = 14; int a[kN], n; int delta[kN]; int cnt[1 << kN]; LL f[1 << kN]; int decode(char c) { if (c >= 0 && c <= 9 ) return c - 0 ; return c - a + 10; } char encode(int x) { if (x < 10) return x + 0 ; return x - 10 + a ; } LL solve() { for (int mask = 1; mask < 1 << n; ++mask) { int p = __builtin_popcount((mask & -mask) - 1); cnt[mask] = cnt[mask ^ 1 << p] - delta[p]; f[mask] = inf; if (cnt[mask] < 0 || cnt[mask] >= 16) continue; for (int i = 0; i < n; ++i) if (mask >> i & 1) { int q = cnt[mask ^ 1 << i]; if (q < 0 || q >= 16) continue; f[mask] = std::min(f[mask], f[mask ^ 1 << i] + (cnt[mask] * 1LL << 4 * i)); } } return f[(1 << n) - 1]; } int main() { char str[15]; scanf( %s , str); n = strlen(str); for (int i = 0; i < n; ++i) a[i] = decode(str[n - 1 - i]); LL result = inf; for (int mask = 0; mask < 1 << n - 1; ++mask) { bool ok = true; int sum = 0; for (int i = 0; i < n; ++i) { int d = a[i]; if (mask >> i & 1) d -= 16; if (i && (mask >> i - 1 & 1)) d += 1; ok &= -16 < d && d < 16; sum += d; delta[i] = d; } if (ok && sum == 0) result = std::min(result, solve()); } if (result == inf) puts( NO ); else { for (int i = n - 1; i >= 0; --i) putchar(encode(result >> 4 * i & 15)); puts( ); } }
#include <bits/stdc++.h> using namespace std; int n, b, g, ans; int main() { scanf( %d%d%d , &b, &g, &n); for (register int i = 0; i <= n; ++i) { register int a = i, f = n - i; if (a <= b && f <= g) ++ans; } printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int t, a, b, c; int main() { cin >> t; for (; t; t--) { cin >> a >> b >> c; int res = 0; if (c >= b) { swap(b, c); } if (b >= a) { swap(a, b); } if (c > 0) { c--; res++; } if (b > 0) { b--; res++; } if (a > 0) { a--; res++; } if ((a > 0) && (b > 0)) { a--; b--; res++; } if ((c > 0) && (a > 0)) { a--; c--; res++; } if ((c > 0) && (b > 0)) { c--; b--; res++; } if ((c > 0) && (b > 0) && (a > 0)) { a--; b--; c--; res++; } cout << res << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; struct node { long long v; bool c; } arr[12000]; bool comparator(node a, node b) { return a.v < b.v; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long i, j, p, v, l, n = 0, a, ans = 0; cin >> a; string s; cin >> s; l = s.length(); s = + + s; for (i = 0; i < l; i += 3) { v = 0; p = s[i++] == + ? 1 : -1; if (s[i] >= 0 and s[i] <= 9 ) for (; s[i] >= 0 and s[i] <= 9 ; i++) v = v * 10 + s[i] - 48; else v = 1; if (s[i] == * ) i++; n++; arr[n].v = v * p; arr[n].c = s[i] == a ; } sort(arr + 1, arr + 1 + n, comparator); for (i = 1; i <= n; i++) { if (arr[i].c) ans += arr[i].v * a++; else ans += arr[i].v * ++a; } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 3000 + 50; struct Edge { int to, next; long long w; } edge[maxn * 2]; int k = 1, head[maxn]; void add(int u, int v) { edge[++k].to = v; edge[k].next = head[u]; head[u] = k; } long long n, m, b[maxn], w[maxn], v[maxn], sz[maxn], T; pair<long long, long long> dp[maxn][maxn], temp[maxn]; void update(pair<long long, long long> &x, pair<long long, long long> y) { if (y > x) x = y; } void dfs(int u, int f) { sz[u] = 1; dp[u][1] = make_pair(0, v[u]); for (int i = head[u]; i; i = edge[i].next) { if (edge[i].to == f) continue; dfs(edge[i].to, u); for (int j = 1; j <= sz[u] + sz[edge[i].to]; j++) temp[j] = make_pair(-1, 0); for (int j = 1; j <= sz[u]; j++) { for (int k = 1; k <= sz[edge[i].to]; k++) { update(temp[j + k], make_pair(dp[u][j].first + dp[edge[i].to][k].first + (dp[edge[i].to][k].second > 0), dp[u][j].second)); update(temp[j + k - 1], make_pair(dp[u][j].first + dp[edge[i].to][k].first, dp[u][j].second + dp[edge[i].to][k].second)); } } for (int j = 1; j <= sz[u] + sz[edge[i].to]; j++) dp[u][j] = temp[j]; sz[u] += sz[edge[i].to]; } } int main() { cin >> T; while (T--) { cin >> n >> m; for (int i = 1; i <= n; i++) cin >> b[i], v[i] -= b[i]; for (int i = 1; i <= n; i++) cin >> w[i], v[i] += w[i]; for (int i = 1; i < n; i++) { int a, b; cin >> a >> b; add(a, b); add(b, a); } dfs(1, 0); long long ans = dp[1][m].first + (dp[1][m].second > 0); cout << ans << endl; k = 1; memset(head, 0, sizeof(int) * (n + 10)); memset(v, 0, sizeof(long long) * (n + 10)); memset(sz, 0, sizeof(long long) * (n + 10)); } return 0; }
#include <bits/stdc++.h> using namespace std; template <typename T> T gcd(T x, T y) { if (x < y) swap(x, y); while (y > 0) { T f = x % y; x = y; y = f; } return x; } const int maxn = 100007; int BLOCKSIZE = 250; set<int> s[maxn]; int a[maxn]; int nxt[maxn]; int prv[maxn]; int n, m; long long b[maxn]; int d[maxn]; int lst[maxn]; long long query(int block, int R) { int iBlockStart = block * BLOCKSIZE; int iBlockEnd = min((block + 1) * BLOCKSIZE, n); int idx = upper_bound(d + iBlockStart, d + iBlockEnd, R, [](int i, int j) { return i < nxt[j]; }) - d; if (idx == iBlockStart) return 0; return b[idx - 1]; } void updateBlock(int block) { int iBlockStart = block * BLOCKSIZE; int iBlockEnd = min((block + 1) * BLOCKSIZE, n); sort(d + iBlockStart, d + iBlockEnd, [](int i, int j) { return nxt[i] < nxt[j]; }); b[iBlockStart] = nxt[d[iBlockStart]] - d[iBlockStart]; for (int i = iBlockStart + 1; i < iBlockEnd; i++) b[i] = b[i - 1] + nxt[d[i]] - d[i]; } int main(int argc, char *argv[]) { std::cin.sync_with_stdio(false); std::cin.tie(nullptr); cin >> n >> m; { for (int i = 0; i < n; i++) nxt[i] = n, prv[i] = -1, d[i] = i; memset(lst, -1, sizeof(lst)); for (int i = 0; i < n; i++) { cin >> a[i]; int pr = lst[a[i]]; if (pr != -1) { nxt[pr] = i; prv[i] = pr; } lst[a[i]] = i; s[a[i]].insert(i); } for (int i = 0; i * BLOCKSIZE < n; i++) updateBlock(i); for (int i = 0; i < m; i++) { int op; cin >> op; if (op == 1) { int p, x; cin >> p >> x; p--; if (a[p] == x) continue; if (nxt[p] != n) prv[nxt[p]] = prv[p]; if (prv[p] != -1) { nxt[prv[p]] = nxt[p]; if (prv[p] / BLOCKSIZE != p / BLOCKSIZE) updateBlock(prv[p] / BLOCKSIZE); } s[a[p]].erase(p); a[p] = x; nxt[p] = n; prv[p] = -1; auto it = s[x].emplace(p).first; bool updatedNext = false; if (it != s[x].begin()) { int pr = *prev(it); int nx = nxt[pr]; nxt[pr] = p; prv[p] = pr; if (pr / BLOCKSIZE != p / BLOCKSIZE) updateBlock(pr / BLOCKSIZE); if (nx != n) { prv[nx] = p; nxt[p] = nx; updatedNext = true; } } if (!updatedNext) { auto nxiter = next(it); if (nxiter != s[x].end()) { int nx = *nxiter; prv[nx] = p; nxt[p] = nx; } } updateBlock(p / BLOCKSIZE); } else { int l, r, R; cin >> l >> r; l--; r--; R = r; long long res = 0; for (; l <= r && l % BLOCKSIZE; l++) if (nxt[l] <= R) res += nxt[l] - l; for (; l <= r && (r + 1) % BLOCKSIZE; r--) if (nxt[r] <= R) res += nxt[r] - r; if (l <= r) { for (int i = l / BLOCKSIZE, j = r / BLOCKSIZE; i <= j; i++) { res += query(i, R); } } cout << res << endl; } } } return 0; }
#include <bits/stdc++.h> using namespace std; priority_queue<pair<int, int> > p1, p2, p12; int n, s1, s2; int num1[3005]; int num2[3005]; bool vis[3005]; int ans1[3005]; int ans2[3005]; int main() { cin >> n >> s1 >> s2; for (int i = 0; i < n; i++) { scanf( %d , &num1[i]); p1.push(make_pair(num1[i], i)); } for (int i = 0; i < n; i++) { scanf( %d , &num2[i]); p2.push(make_pair(num2[i], i)); } long long ans = 0; for (int i = 0; i < s1; i++) { pair<int, int> u; u = p1.top(); p1.pop(); vis[u.second] = true; ans1[i] = u.second; ans += u.first; p12.push(make_pair(num2[u.second] - num1[u.second], i)); } for (int i = 0; i < s2; i++) { pair<int, int> u, v, w; while (!p1.empty() && vis[p1.top().second]) p1.pop(); while (!p2.empty() && vis[p2.top().second]) p2.pop(); if (!p1.empty()) u = p1.top(); if (!p2.empty()) v = p2.top(); w = p12.top(); if (p2.empty() || u.first + w.first > v.first) { ans2[i] = ans1[w.second]; ans1[w.second] = u.second; vis[u.second] = true; ans += u.first + w.first; p1.pop(); int idx = u.second; p12.push(make_pair(num2[idx] - num1[idx], w.second)); p12.pop(); } else { ans += v.first; ans2[i] = v.second; vis[v.second] = true; p2.pop(); } } cout << ans << endl; for (int i = 0; i < s1; i++) { cout << ans1[i] + 1 << ; } cout << endl; for (int i = 0; i < s2; i++) { cout << ans2[i] + 1 << ; } }
#include <bits/stdc++.h> using namespace std; const int mx = 2e6 + 10; int n, m; bool vis[mx]; int sta[mx], siz, is; int dfn[mx], id[mx]; int be[mx], ty; vector<int> g[mx]; void tarjan(int u) { dfn[u] = id[u] = ++is; sta[++siz] = u; vis[u] = 1; for (int v : g[u]) { if (!dfn[v]) { tarjan(v); id[u] = min(id[u], id[v]); } else if (vis[v]) id[u] = min(id[u], dfn[v]); } if (id[u] == dfn[u]) { ty++; while (sta[siz] != u) { be[sta[siz]] = ty; vis[sta[siz]] = 0; siz--; } be[u] = ty, vis[u] = 0, siz--; } } int cnt_one() { int cnt = 0; for (int i = 1; i <= n; i++) if (be[i] == 1) cnt++; return cnt; } int main() { int t; scanf( %d , &t); while (t--) { scanf( %d%d , &n, &m); for (int i = 1; i <= 2 * n; i++) g[i].clear(); ty = is = siz = 0; for (int i = 1; i <= 2 * n; i++) dfn[i] = vis[i] = 0; for (int i = 0, u, v; i < m; i++) { scanf( %d%d , &u, &v); if (u == v) g[v + n].push_back(u); else g[u].push_back(v + n); } if (n == 1) { puts( No ); continue; } for (int i = 1; i <= n; i++) if (!dfn[i]) tarjan(i); int cnt = cnt_one(); if (cnt == n) puts( No ); else { puts( Yes ); printf( %d %d n , cnt, n - cnt); for (int i = 1; i <= n; i++) if (be[i] == 1) printf( %d , i); puts( ); for (int i = 1; i <= n; i++) if (be[i] != 1) printf( %d , i); puts( ); } } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long n, m, k, i; bool t = 0; cin >> n >> m >> k; if ((2 * m * n) % k > 0) cout << NO ; else { if (k == 2) cout << YES n0 0 n << n << 0 n0 << m; else { k = (2 * m * n) / k; if (m >= n) { for (i = max(1, (int)(k / m)); i <= n; i++) { if (k % i == 0 && k / i <= m) { t = 1; break; } } if (!t) cout << NO ; else cout << YES n0 0 n << i << 0 n0 << k / i; } else { for (i = max(1, (int)(k / n)); i <= m; i++) { if (k % i == 0 && k / i <= n) { t = 1; break; } } if (!t) cout << NO ; else cout << YES n0 0 n << k / i << 0 n0 << i; } } } return 0; }
#include <bits/stdc++.h> using namespace std; inline long long read(long long num = 0, char c = 0) { while (c > 9 || c < 0 ) c = getchar(); while (c >= 0 && c <= 9 ) num = num * 10 + c - 48, c = getchar(); return num; } struct node { int x, y, val, num; void in() { x = read(), y = read(), val = read(); } } p[500010]; int f[2005], n, m, q, l, r; int find(int x) { return f[x] == x ? x : f[x] = find(f[x]); } bool cmp(node a, node b) { return a.val > b.val; } int work() { for (register int i = 1; i <= m; ++i) { if (p[i].num >= l && p[i].num <= r) { if (find(p[i].x) == find(p[i].y)) { return p[i].val; } else { f[find(p[i].x + n)] = f[find(p[i].y)]; f[find(p[i].y + n)] = f[find(p[i].x)]; } } } return -1; } int main() { n = read(), m = read(), q = read(); for (register int i = 1; i <= m; ++i) p[i].in(), p[i].num = i; sort(p + 1, p + 1 + m, cmp); for (register int i = 1; i <= q; ++i) { l = read(), r = read(); for (register int i = 1; i <= 2 * n; ++i) f[i] = i; printf( %d n , work()); } return 0; }
#include <bits/stdc++.h> using namespace std; bool isSafe(const int n, const int m, const int row, const int col) { return row >= 0 && row < n && col >= 0 && col < m; } int main(int argc, char* argv[]) { int n, m; static pair<int, int> pos[] = {{-1, -1}, {-1, 0}, {-1, 1}, {0, -1}, {0, 0}, {0, 1}, {1, -1}, {1, 0}, {1, 1}}; int posLen = sizeof(pos) / sizeof(pos[0]); cin >> n >> m; vector<string> vec(n); for (int i = 0; i < n; i++) { cin >> vec[i]; } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { int count = 0; if (vec[i][j] == * ) { continue; } for (int k = 0; k < posLen; k++) { if (isSafe(n, m, i + pos[k].first, j + pos[k].second) && vec[i + pos[k].first][j + pos[k].second] == * ) { count++; } } if ((count == 0 && vec[i][j] != . ) || (count != 0 && count != vec[i][j] - 0 )) { cout << NO ; return 0; } } } cout << YES ; return 0; }
#include <bits/stdc++.h> using namespace std; struct box { int a, o; int id; }; int n; box x[201000]; int cmp(box a, box b) { return a.a < b.a; } int used[201000]; int main() { int t; scanf( %d , &t); for (int tt = 0; tt < t; tt++) { scanf( %d , &n); n = 2 * n - 1; for (int i = 1; i <= n; i++) used[i] = 0; for (int i = 1; i <= n; i++) { scanf( %d%d , &x[i].a, &x[i].o); x[i].id = i; } printf( YES n ); if (n == 1) { printf( 1 n ); continue; } sort(x + 1, x + n + 1, cmp); for (int i = 1; i < n; i++) if (x[i].o <= x[i + 1].o) { printf( %d , x[i + 1].id); used[i] = 1, used[i + 1] = 1, i++; } int tk = 0; for (int i = 1; i <= n; i++) if (!used[i]) { tk++; if (tk % 2 == 1) printf( %d , x[i].id); } printf( n ); } return 0; }
#include <bits/stdc++.h> #pragma GCC optimize( -O2 ) using namespace std; void err(istream_iterator<string> it) { cerr << endl; } template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << t ; err(++it, args...); } template <typename T1, typename T2> ostream& operator<<(ostream& c, pair<T1, T2>& v) { c << ( << v.first << , << v.second << ) ; return c; } template <template <class...> class TT, class... T> ostream& operator<<(ostream& out, TT<T...>& c) { out << { ; for (auto& x : c) out << x << ; out << } ; return out; } const int LIM = 1.5e3 + 5, MOD = 998244353; const long double EPS = 1e-9; int read() { int xx = 0, ff = 1; char ch = getchar(); while (ch > 9 || ch < 0 ) { if (ch == - ) ff = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { xx = (xx << 3) + (xx << 1) + ch - 0 ; ch = getchar(); } return xx * ff; } mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int n; int link[LIM], sz[LIM], edges[LIM]; long long poly[LIM][LIM]; int find(int x) { if (x == link[x]) return x; return link[x] = find(link[x]); } void polymul(int a, int b) { long long temp[LIM] = {0}; for (int i = 0; i < n + 1; ++i) { for (int j = 0; j + i <= n; j++) { temp[i + j] += (poly[a][i] * poly[b][j]) % MOD; } } for (int i = 0; i < LIM; ++i) { poly[a][i] = temp[i] % MOD; } return; } void unite(int a, int b) { a = find(a); b = find(b); if (sz[a] < sz[b]) swap(a, b); if (a == b) { edges[a]++; if (edges[a] == sz[a] * (sz[a] - 1) / 2) { poly[a][1]++; } return; } link[b] = a; sz[a] += sz[b]; polymul(a, b); edges[a]++; edges[a] += edges[b]; if (edges[a] == sz[a] * (sz[a] - 1) / 2) { poly[a][1]++; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 0; i < n; ++i) { poly[i][1] = 1; link[i] = i; sz[i] = 1; } vector<tuple<int, int, int>> v; for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { int x; cin >> x; if (i < j) { v.push_back({x, i, j}); } } } sort(v.begin(), v.end()); for (auto& r : v) { int cost, first, second; tie(cost, first, second) = r; unite(first, second); } int a = find(0); for (int i = 1; i < n + 1; ++i) { cout << poly[a][i] % MOD << ; } cout << n ; return 0; }
#include <bits/stdc++.h> using namespace std; typedef long long int ll; #define M 1000000007 int main() { std::ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t; cin>>t; while(t--) { string s; cin>>s; for(int i=0; i<s.length(); i++) { if(i%2==0) { if(s[i] != a ) s[i] = a ; else s[i] = b ; } else { if(s[i] != z ) s[i] = z ; else s[i] = y ; } } cout<<s<<endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int Maxlen = 2e5 + 2; long long ans; long long lt[Maxlen], ls[2 * Maxlen]; int n, m, dpt[Maxlen], dps[Maxlen]; char ct[Maxlen], cs[2 * Maxlen]; long long cmp(int pos) { if (cs[0] != ct[pos] || ls[0] > lt[pos]) return 0; if (m == 1) return lt[pos] - ls[0] + 1; pos++; int p1 = 1; while (p1 < m && pos < n && cs[p1] == ct[pos] && ls[p1] == lt[pos]) { pos++; p1++; } if (p1 < m && pos < n && cs[p1] == ct[pos] && ls[p1] < lt[pos]) p1++; if (p1 == m) return 1; return 0; } int kmp() { int res = 0; for (int i = 1; i < n + m; i++) { int j = dps[i - 1]; if (j == m - 2 && cs[i] == cs[j] && ls[i] >= ls[j]) res++; while (j > 0 && (cs[i] != cs[j] || ls[i] != ls[j])) j = dps[j - 1]; if (cs[j] == cs[i]) if (ls[j] == ls[i] || (j == 0 && ls[i] >= ls[j])) ++j; dps[i] = j; } return res; } int main() { scanf( %d%d , &n, &m); scanf( %d-%c , &lt[0], &ct[0]); for (int i = 1; i < n; i++) { scanf( %d-%c , &lt[i], &ct[i]); if (ct[i] == ct[i - 1]) { lt[i - 1] += lt[i]; n--; i--; } } scanf( %d-%c , &ls[0], &cs[0]); for (int i = 1; i < m; i++) { scanf( %d-%c , &ls[i], &cs[i]); if (cs[i] == cs[i - 1]) { ls[i - 1] += ls[i]; m--; i--; } } if (m == 1) { for (int i = 0; i < n; i++) ans = ans + cmp(i); } else { cs[m++] = # ; for (int i = 0; i < n; i++) { cs[m + i] = ct[i]; ls[m + i] = lt[i]; } ans = kmp(); } printf( %I64d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1500; const int MOD = 1e9 + 9; int ing[128]; long long dp[1005][105][15]; int n, m; struct ac_auto { int nxt[maxn][4], fail[maxn], ed[maxn], q[maxn]; int L = 0; void inserta(char buf[]) { int now = 0; int len = strlen(buf); for (int i = 0; buf[i]; i++) { int son = ing[(int)buf[i]]; if (!nxt[now][son]) nxt[now][son] = ++L; now = nxt[now][son]; } ed[now] = len; } void getfail() { int front = 0, back = 0, now = 0; for (int i = 0; i < 4; i++) if (nxt[now][i]) q[++back] = nxt[now][i]; while (front < back) { now = q[++front]; for (int i = 0; i < 4; i++) { if (nxt[now][i]) { fail[nxt[now][i]] = nxt[fail[now]][i]; q[++back] = nxt[now][i]; } else nxt[now][i] = nxt[fail[now]][i]; ed[nxt[now][i]] = max(ed[nxt[now][i]], ed[nxt[fail[now]][i]]); } } } void work() { memset(dp, 0, sizeof dp); dp[0][0][0] = 1; for (int i = 0; i < n; i++) { for (int j = 0; j <= L; j++) { for (int k = 0; k <= 10; k++) for (int f = 0; f < 4; f++) { if (ed[nxt[j][f]] > k) { dp[i + 1][nxt[j][f]][0] += dp[i][j][k]; dp[i + 1][nxt[j][f]][0] %= MOD; } else { dp[i + 1][nxt[j][f]][k + 1] += dp[i][j][k]; dp[i + 1][nxt[j][f]][k + 1] %= MOD; } } } } long long ans = 0; for (int i = 0; i <= L; i++) { ans += dp[n][i][0]; ans %= MOD; } cout << ans << endl; } } ac; char ss[15]; int main() { ing[ A ] = 0, ing[ T ] = 1, ing[ C ] = 2, ing[ G ] = 3; scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) { scanf( %s , ss); ac.inserta(ss); } ac.getfail(); ac.work(); return 0; }
#include <bits/stdc++.h> using namespace std; int r[100005], g[100005], b[100005], nr, ng, nb, pos; long long ans = 9e18; long long calc(long long a, long long b, long long c) { long long temp = (a - b) * (a - b) + (a - c) * (a - c) + (b - c) * (b - c); return temp; } int bsearch(int a[], int len, int k) { int l = 1, r = len, mid, ans = 0; while (l < r) { mid = (l + r) >> 1; if (a[mid] > k) r = mid; else if (a[mid] == k) return mid; else { if (a[mid + 1] > k) return mid; else if (a[mid + 1] == k) return mid + 1; else l = mid + 1; } } return l; } void check(int a[], int b[], int c[], int lena, int lenb, int lenc) { int i, aa, bb, cc1, cc2, pos; for (i = 1; i <= lena; i++) { aa = a[i]; pos = lower_bound(b + 1, b + lenb + 1, aa) - b; if (!(pos >= 1 && pos <= lenb && b[pos] >= aa)) continue; bb = b[pos]; int mid = (aa + bb) / 2; pos = lower_bound(c + 1, c + lenc + 1, mid) - c; if (pos >= 1 && pos <= lenc && c[pos] >= mid) { cc1 = c[pos]; ans = min(ans, calc((long long)aa, (long long)bb, (long long)cc1)); } pos = bsearch(c, lenc, mid); if (pos <= lenc && pos >= 1 && c[pos] <= mid) { cc2 = c[pos]; ans = min(ans, calc((long long)aa, (long long)bb, (long long)cc2)); } } } int main() { int t; cin >> t; while (t--) { ans = 9e18; int i; scanf( %d%d%d , &nr, &ng, &nb); for (i = 1; i <= nr; i++) scanf( %d , &r[i]); for (i = 1; i <= ng; i++) scanf( %d , &g[i]); for (i = 1; i <= nb; i++) scanf( %d , &b[i]); sort(r + 1, r + nr + 1), sort(g + 1, g + ng + 1), sort(b + 1, b + nb + 1); check(r, g, b, nr, ng, nb); check(r, b, g, nr, nb, ng); check(g, r, b, ng, nr, nb); check(g, b, r, ng, nb, nr); check(b, r, g, nb, nr, ng); check(b, g, r, nb, ng, nr); cout << ans << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int a[100005], f[100005]; int l[100005], r[100005]; int main() { int n; while (cin >> n) { memset(a, 0, sizeof(a)); memset(f, 0, sizeof(f)); for (int i = 0; i < n; i++) { cin >> a[i]; } int m; cin >> m; for (int i = 0; i < m; i++) { cin >> f[i]; } memset(l, 0, sizeof(l)); memset(r, 0, sizeof(r)); for (int i = 0; i < n; i++) { if (l[a[i]] == 0) { l[a[i]] = i; } } for (int i = n - 1; i >= 0; i--) { if (r[a[i]] == 0) { r[a[i]] = n - i; } } long long count1 = 0, count2 = 0; for (int i = 0; i < m; i++) { count1 = count1 + l[f[i]] + 1; } for (int i = 0; i < m; i++) { count2 = count2 + r[f[i]]; } cout << count1 << << count2 << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long n, m; int wyn = 0; long long a, b; cin >> n; a = 1; m = 2; while (m <= n) { wyn++; b = m; m += a; a = b; } cout << wyn << n ; }
#include <bits/stdc++.h> using namespace std; int n, m; string s, t; vector<char> vv; int main() { cin >> n >> m; cin >> s; for (int i = 0; i < n; i++) vv.push_back(s[i]); sort(vv.begin(), vv.end()); if (((int)(s).size()) < m) { t = s; for (int i = ((int)(s).size()); i < m; i++) t += vv[0]; cout << t << endl; return 0; } else if (((int)(s).size()) == m) { t = s; int k = 1; while (1) { if (s[((int)(s).size()) - k] == vv[((int)(vv).size()) - 1]) { t[((int)(s).size()) - k] = vv[0]; k++; continue; } int bb = upper_bound((vv).begin(), (vv).end(), t[((int)(s).size()) - k]) - vv.begin(); t[((int)(s).size()) - k] = vv[bb]; break; } cout << t << endl; return 0; } else { t = s.substr(0, m); int k = 1; while (1) { if (s[m - k] == vv[((int)(vv).size()) - 1]) { t[m - k] = vv[0]; k++; continue; } int bb = upper_bound((vv).begin(), (vv).end(), t[m - k]) - vv.begin(); t[m - k] = vv[bb]; break; } cout << t << endl; return 0; } }
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; int main() { ios::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; vector<int> a(n), b(m); for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < m; i++) cin >> b[i]; sort(a.begin(), a.end()); sort(b.begin(), b.end()); if (a[n - 1] > b[0]) { cout << -1 << endl; return 0; } long long sum = 0LL; for (int i = 0; i < m; i++) sum = sum + 1LL * b[i]; for (int i = 0; i < n - 1; i++) sum = sum + 1LL * m * a[i]; if (n > 1 && b[0] > a[n - 1]) sum = sum + a[n - 1] - a[n - 2]; cout << sum << endl; }
#include <bits/stdc++.h> using namespace std; const int N = 100000; const double eps = 1e-15; int n; double p[N + 9], q[N + 9]; void into() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %lf , &p[i]); for (int i = 1; i <= n; ++i) scanf( %lf , &q[i]); } double a[N + 9], b[N + 9]; double Get_root(double a, double b, double c) { return fabs(a) <= eps ? -c / b : (sqrt(max(b * b - 4 * a * c, 0.0)) - b) / (2 * a); } void Get_ans() { for (int i = 1; i <= n; ++i) { double x = p[i] + a[i - 1] * b[i - 1]; double y = p[i] + q[i] + a[i - 1] + b[i - 1]; b[i] = Get_root(1, -y, x); a[i] = y - b[i]; } for (int i = n; i >= 1; --i) a[i] -= a[i - 1], b[i] -= b[i - 1]; } void work() { Get_ans(); } void outo() { for (int i = 1; i <= n; ++i) printf( %.10lf , a[i]); puts( ); for (int i = 1; i <= n; ++i) printf( %.10lf , b[i]); puts( ); } int main() { int T = 1; for (; T--;) { into(); work(); outo(); } return 0; }
#include <bits/stdc++.h> using namespace std; const int OO = (int)1e6; set<pair<int, int> > nods; map<pair<int, int>, bool> vis; pair<int, int> fr, sc; int n, r, a, p, ans, sz; bool ok = true; int rx[] = {1, 1, 1, 0, 0, -1, -1, -1}; int ry[] = {1, 0, -1, 1, -1, 1, 0, -1}; bool val(pair<int, int> per) { return nods.find(per) != nods.end(); } void fun(pair<int, int> pos) { pair<int, int> cur; queue<pair<int, int> > q; ans = 0; q.push(pos); vis[pos] = true; sz = 1; ok = true; for (; !q.empty() && ok; sz = q.size(), ans++) { while (ok && sz--) { pos = q.front(); q.pop(); for (int i = 0; ok && i < 8; i++) { cur.first = (pos.first) + rx[i]; cur.second = (pos.second) + ry[i]; if (val(cur) && !vis[cur]) { q.push(cur); vis[cur] = true; if (cur == sc) ok = false; } } } } } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> fr.first >> fr.second >> sc.first >> sc.second >> n; for (int i = 0; i < n; i++) { cin >> r >> a >> p; for (int j = a; j <= p; j++) { nods.insert({r, j}); vis[{r, j}] = false; } } fun(fr); if (!ok) cout << ans << endl; else cout << -1 << endl; return 0; }
#include <bits/stdc++.h> using namespace std; inline int in() { int x; scanf( %d , &x); return x; } template <typename T> istream &operator>>(istream &in, vector<T> &vec) { for (int i = 0; i < vec.size(); ++i) in >> vec[i]; return in; } template <typename T> ostream &operator<<(ostream &out, const vector<T> &vec) { for (int i = 0; i < vec.size(); ++i) out << vec[i] << ; return out; } const int INT = 1e6 + 1; long long eds = 0; int main() { long long a = in(), b = in(), c, n = 0, jac = 1; vector<int> x(a); vector<int> y(a); vector<bool> f(a); priority_queue<pair<long long, int>> qu; for (int i = 0; i < a; ++i) { x[i] = in(); } for (int i = 0; i < a; ++i) { y[i] = in(); } for (int i = 0; i < a; ++i) { if (x[i] % 100) { qu.push(make_pair(-(100 - x[i] % 100) * y[i], i)); b -= x[i] % 100; if (b < 0) { n += -(qu.top().first); f[qu.top().second] = true; qu.pop(); b += 100; } } } cout << n << endl; for (int i = 0; i < a; ++i) { cout << f[i] + x[i] / 100 << << (f[i] ? 0 : x[i] % 100) << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; using ll = long long; const int N = 2e5 + 5; const int mod = 998244353; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; int t; cin >> t; while (t--) { int n, x; cin >> n >> x; vector<int> g[n + 1]; for (int i = 1; i < n; i++) { int u, v; cin >> u >> v; g[u].push_back(v); g[v].push_back(u); } if (g[x].size() == 1) { cout << Ayush n ; continue; } vector<int> flag(n + 1); for (int k : g[x]) { flag[k] = 1; } int sz = g[x].size(); int cnt = 0; for (int i = 1; i <= n; i++) { if (i != x and flag[i] == 0) cnt++; } 4; int total = cnt + sz - 1; if (total % 2 == 1) { cout << Ashish n ; } else cout << Ayush n ; } }
#include <bits/stdc++.h> using namespace std; vector<int> mark[4]; string sins[4]; int cost[5]; int sta[1010]; int dp[1010][0xffff + 1]; int main() { int n; cin >> n; for (int i = 0; i < 4; i++) cin >> cost[i]; for (int i = 0; i < 4; i++) cin >> sins[i]; for (int j = 0; j < n; j++) { sta[j] = 0; for (int i = 0; i < 4; i++) { sta[j] |= (sins[i][j] == * ) ? (1 << i) : 0; } } int S = 0; for (int i = 0; i < 4; i++) { S |= sta[i] << (i * 4); sta[n + i] = 0; } for (int i = 0; i < 4; i++) { for (int j = 3; j >= i; j--) { int t = 0xffff; for (int k = 0; k <= i; k++) { for (int y = j; y >= j - i; y--) t ^= 1 << (4 * k + y); } mark[i].push_back(t); } } memset(dp, 0x7f, sizeof(dp)); dp[0][S] = 0; for (int i = 0; i < n; i++) { for (int j = 0xffff; j >= 0; j--) { if (dp[i][j] == 0x7f7f7f7f) continue; if ((j & 0xf) == 0) { int S = (((j & 0xffff) >> 4) | (0xf000 & (sta[i + 4] << 12))); dp[i + 1][S] = min(dp[i + 1][S], dp[i][j]); } for (int k = 0; k < 4 && k + i < n; k++) { vector<int>::iterator y; for (y = mark[k].begin(); y != mark[k].end(); y++) { dp[i][j & (*y)] = min(dp[i][j & (*y)], dp[i][j] + cost[k]); } } } } cout << dp[n][0] << endl; }
#include <bits/stdc++.h> using namespace std; enum { DUNNO = -1, AB, BA }; vector<pair<int, int> > E[200010]; map<pair<int, int>, int> edge_id; int dir[200010]; int val[200010]; bool vis[200010]; int main() { int N, M; cin >> N >> M; memset(val, 0, sizeof(val)); memset(vis, 0, sizeof(vis)); memset(dir, DUNNO, sizeof(dir)); int a, b, c; for (int j = (1); j <= (M); ++j) { scanf( %d%d%d , &a, &b, &c); E[a].push_back(make_pair(b, c)); E[b].push_back(make_pair(a, c)); edge_id[make_pair(a, b)] = j; edge_id[make_pair(b, a)] = -j; val[a] += c; val[b] += c; } for (int i = (2); i <= (N - 1); ++i) val[i] /= 2; queue<int> Q; val[1] = 0; Q.push(1); while (!Q.empty()) { int i = Q.front(); Q.pop(); if (vis[i]) continue; vis[i] = true; assert(val[i] == 0); int numE = E[i].size(); for (int x = 0; x < (numE); ++x) { int j = E[i][x].first; int c = E[i][x].second; if (vis[j]) continue; int e = edge_id[make_pair(i, j)]; if (dir[abs(e)] != DUNNO) continue; if (e > 0) dir[e] = 0; else dir[-e] = 1; val[j] -= c; if (!val[j]) Q.push(j); } } for (int j = (1); j <= (M); ++j) cout << dir[j] << endl; }
#include <bits/stdc++.h> int main() { int n, a, b, c, t, i, m, ans = 0; scanf( %d%d%d%d%d , &n, &a, &b, &c, &t); ans = n * a; for (i = 0; i < n; i++) { scanf( %d , &m); ans += (t - m) * (c - b); } if (b >= c) printf( %d , n * a); else printf( %d , ans); return 0; }
#include <bits/stdc++.h> using namespace std; template <typename... T> void read(T &...args) { ((cin >> args), ...); } template <typename... T> void write(T... args) { ((cout << args << ), ...); } const long long MOD = 1000000007; const long long INF = 1000000050; const long long BIG = (long long)2e18 + 50; const long long MX = 200010; const double EPS = 1e-9; long long a[MX]; bool good; long long m; vector<long long> g[MX]; long long sz[MX]; long long cnt[MX]; long long mx = 0; void dfs(long long v) { if (g[v].size() == 0) cnt[v] = 1; else cnt[v] = 0; sz[v] = a[v]; for (auto &to : g[v]) { dfs(to); cnt[v] += cnt[to]; sz[v] += sz[to]; } mx = max(mx, (sz[v] + cnt[v] - 1) / cnt[v]); } void solve() { long long n; cin >> n; long long arr[n]; for (long long i = 0; i < n; i++) cin >> arr[i]; if (n == 1) { cout << 0 << n ; return; } sort(arr, arr + n); long long mid = n / 2; long long ret1 = 0; long long ret2 = 0; long long arr_val[n]; for (long long i = 0; i < n; i++) { arr_val[i] = arr[mid] - mid + i; } if (arr_val[0] <= 0) { long long val = 1 - arr_val[0]; for (long long i = 0; i < n; i++) arr_val[i] += val; } for (long long i = 0; i < n; i++) { ret1 += abs(arr_val[i] - arr[i]); } write( n ); for (long long i = 0; i < n; i++) write(arr_val[i]); if (n % 2 == 0) { mid--; for (long long i = 0; i < n; i++) { arr_val[i] = arr[mid] - mid + i; } if (arr_val[0] <= 0) { long long val = 1 - arr_val[0]; for (long long i = 0; i < n; i++) arr_val[i] += val; } for (long long i = 0; i < n; i++) { ret2 += abs(arr_val[i] - arr[i]); } } write( n ); for (long long i = 0; i < n; i++) write(arr_val[i]); if (n % 2 == 0) cout << min(ret1, ret2); else cout << ret1; cout << n ; } long long arr[201]; long long dp[201][405]; long long n; long long recur(long long index, long long time) { if (index == n) return 0; if (dp[index][time] != -1) return dp[index][time]; long long ret = INT_MAX; for (long long i = time + 1; i <= 405; i++) { ret = min(ret, abs(arr[index] - i) + recur(index + 1, i)); } return dp[index][time] = ret; } void solveA() { cin >> n; memset(dp, -1, sizeof(dp)); for (long long i = 0; i < n; i++) cin >> arr[i]; sort(arr, arr + n); cout << recur(0, 0) << n ; } int32_t main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); srand(chrono::high_resolution_clock::now().time_since_epoch().count()); long long x; cin >> x; while (x--) { solveA(); } }
#include <bits/stdc++.h> using namespace std; vector<int> v[200010]; bool vis[200010]; int amid[200010]; int n, m; int a[200010]; vector<int> vv; vector<pair<int, int> > t; void dfs(int node) { vis[node] = 1; t.push_back({a[node], node}); int sz = v[node].size(); for (int i = 0; i < sz; i++) { int nx = v[node][i]; if (!vis[nx]) dfs(nx); } } void cal() { int d = 0; bool yy = 1; map<int, int> mm; for (int i = 0; i < t.size(); i++) { mm[t[i].first]++; } set<int> s; for (int i = 0; i < t.size(); i++) { int node = t[i].second, r = t[i].first; if (!s.count(r)) d += mm[r]; s.insert(r); amid[node] -= (d - mm[r]); } } int main() { cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> a[i]; vv.push_back(a[i]); } sort(vv.begin(), vv.end()); for (int i = 1; i <= n; i++) { amid[i] = lower_bound(vv.begin(), vv.end(), a[i]) - vv.begin(); } for (int i = 0; i < m; i++) { int x, y; cin >> x >> y; v[x].push_back(y); v[y].push_back(x); } for (int i = 1; i <= n; i++) { int sz = v[i].size(); int r = a[i]; for (int j = 0; j < sz; j++) { int nx = v[i][j]; if (a[nx] < a[i]) amid[i]--; } } for (int i = 1; i <= n; i++) { cout << amid[i] << ; } }
#include <bits/stdc++.h> using namespace std; long long MOD = 1000000007; int d[201][201]; pair<pair<int, int>, int> E[20000]; vector<std::pair<int, int> > Intervals; int n, m; bool check(int idx, int x) { int u = E[idx].first.first, v = E[idx].first.second, w = E[idx].second; Intervals.clear(); for (int i = 0; i < n; ++i) { int d1 = d[u][i], d2 = d[v][i]; if (d1 > x and d2 > x) return 0; int a = 0, b = w; a = min(w, x - d1) + 1; b = max(0, w - (x - d2)) - 1; if (d1 <= x and d2 <= x) { if (a > b) continue; else Intervals.push_back(std::make_pair(a, b)); } else if (d1 <= x) { if (a <= w) Intervals.push_back(std::make_pair(a, w)); } else { if (b >= 0) Intervals.push_back(std::make_pair(0, b)); } } if (Intervals.size() < 1) return 1; sort(Intervals.begin(), Intervals.end()); if (Intervals[0].first > 0) return 1; int maxY = Intervals[0].second; for (int i = 1; i < Intervals.size(); ++i) { if (Intervals[i].first > maxY) return 1; maxY = max(maxY, Intervals[i].second); } return maxY < w; } int solve(int idx) { int u = E[idx].first.first, v = E[idx].first.second; int l = 0, r = 0, m; for (int i = 0; i < n; ++i) { r = max(r, min(d[u][i], d[v][i])); } r += E[idx].second + 10; while (r - l > 1) { m = (l + r) >> 1; bool f = check(idx, m); if (f) r = m; else l = m; } if (check(idx, l)) return l; else return r; } int main() { int u, v, w; scanf( %d %d , &n, &m); for (int i = 0; i < (n); ++i) for (int j = 0; j < (n); ++j) d[i][j] = (i == j ? 0 : MOD); for (int i = 0; i < (m); ++i) { scanf( %d %d %d , &u, &v, &w); u -= 1, v -= 1, w <<= 1; d[u][v] = d[v][u] = w; E[i] = std::make_pair(std::make_pair(u, v), w); } for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) for (int k = 0; k < n; ++k) { d[j][k] = min(d[j][k], d[j][i] + d[i][k]); } } int ans = MOD; for (int i = 0; i < (m); ++i) ans = min(ans, solve(i)); cout << ans / 2.0 << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = (int)1e3 + 10; int n; pair<string, int> a[N]; string ans[N]; int main() { cin >> n; for (int i = 0; i < n; ++i) { char c; cin >> c >> c >> c >> c; cin >> a[i].first; a[i].second = i; if (a[i].first == 9 ) ans[i] = 1989 ; if (a[i].first == 99 ) ans[i] = 1999 ; } sort(a, a + n); for (int i = 0; i < n; ++i) { if (a[i].first.length() == 1) { if (a[i].first == 9 ) continue; ans[a[i].second] = 199 ; ans[a[i].second] += a[i].first; } else if (a[i].first.length() == 2) { if (a[i].first == 99 ) continue; ans[a[i].second] = 20 ; ans[a[i].second] += a[i].first; } else if (a[i].first.length() == 3) { if (a[i].first < 100 && a[i].first != 099 ) { ans[a[i].second] = 3 ; ans[a[i].second] += a[i].first; } else { ans[a[i].second] = 2 ; ans[a[i].second] += a[i].first; } } else if (a[i].first.length() == 4) { if ( 0000 <= a[i].first && a[i].first < 3099 ) ans[a[i].second] = 1 ; ans[a[i].second] += a[i].first; } else if (a[i].first.length() == 5) { if ( 00000 <= a[i].first && a[i].first < 13099 ) ans[a[i].second] = 1 ; ans[a[i].second] += a[i].first; } else if (a[i].first.length() == 6) { if ( 000000 <= a[i].first && a[i].first < 113099 ) ans[a[i].second] = 1 ; ans[a[i].second] += a[i].first; } else if (a[i].first.length() == 7) { if ( 0000000 <= a[i].first && a[i].first < 1113099 ) ans[a[i].second] = 1 ; ans[a[i].second] += a[i].first; } else if (a[i].first.length() == 8) { if ( 00000000 <= a[i].first && a[i].first < 11113099 ) ans[a[i].second] = 1 ; ans[a[i].second] += a[i].first; } else if (a[i].first.length() == 9) { if ( 000000000 <= a[i].first && a[i].first < 111113099 ) ans[a[i].second] = 1 ; ans[a[i].second] += a[i].first; } } for (int i = 0; i < n; ++i) cout << ans[i] << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10, M = 1e6 + 10; struct node { int a, b, w; } e[M]; int fa[N]; bool cmp(node a, node b) { return a.w < b.w; } int find(int x) { if (fa[x] != x) fa[x] = find(fa[x]); return fa[x]; } int du[N]; int main() { int n, m; cin >> n >> m; int a1, b1, w1; for (int i = 1; i <= m; ++i) { scanf( %d%d%d , &e[i].a, &e[i].b, &e[i].w); if (i == 1) { a1 = e[i].a; b1 = e[i].b; } } for (int i = 1; i <= n; ++i) fa[i] = i; sort(e + 2, e + 1 + m, cmp); for (int i = 2; i <= m; ++i) { int f1 = find(e[i].a); int f2 = find(e[i].b); if (f1 == f2) continue; fa[f1] = f2; if (find(a1) == find(b1)) { printf( %d n , e[i].w); return 0; } } printf( 1000000000 n ); }
#include <bits/stdc++.h> using namespace std; long long n, k, a[600000], L, R, r, t, l, f; long long s; bool ok(long long x) { long long r = 0; for (long long i = 0; i < n; i++) if (a[i] > x) r += (a[i] - x); if (r <= t) return 1; return 0; } bool ok1(long long x) { long long r = 0; for (long long i = 0; i < n; i++) if (a[i] < x) r += (x - a[i]); if (r <= t) return 1; return 0; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> t; L = 2e9; for (long long i = 0; i < n; i++) { cin >> a[i]; s += a[i]; L = min(L, a[i]); R = max(R, a[i]); } long long d1 = R, d2 = L; l = L; r = R; while (r - l > 10) { long long mid = (r + l) / 2; if (ok(mid)) r = mid; else l = mid + 1; } for (long long i = l; i <= r; i++) if (ok(i)) d1 = min(d1, i); l = L; r = R; while (r - l > 10) { long long mid = (r + l) / 2; if (ok1(mid)) l = mid; else r = mid - 1; } for (long long i = l; i <= r; i++) if (ok1(i)) d2 = max(d2, i); if (s % n == 0) f = 0; else f = 1; cout << max(f, d1 - d2); }
#include <bits/stdc++.h> using namespace std; int main() { long long n, k, s; cin >> n >> k >> s; if (k > s || k * (n - 1) < s) { cout << NO n ; } else { cout << YES n ; long long h = 1; while (k--) { long long d = min(n - 1, s - k); s -= d; if (h - d <= 0) h += d; else h -= d; cout << h << ; } cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const double EPS = 1e-9; inline int comp(double A, double B = 0) { return (A <= B + EPS) ? (A + EPS < B) ? -1 : 0 : 1; } struct point { double x, y; point(double x = 0, double y = 0) : x(x), y(y) {} bool operator<(const point &other) const { if (!comp(x, other.x)) return comp(y, other.y) < 0; return comp(x, other.x) < 0; } point operator+(const point &other) const { return point(x + other.x, y + other.y); } point operator-(const point &other) const { return point(x - other.x, y - other.y); } }; double inner(const point &A, const point &B) { return A.x * B.x + A.y * B.y; } double outer(const point &A, const point &B) { return A.x * B.y - A.y * B.x; } double dist(const point &A, const point &B) { return sqrt(inner(A - B, A - B)); } double angle(const point &A, const point &O, const point &B) { return acos(inner(A - O, B - O) / (dist(A, O) * dist(B, O))); } int side(const point &A, const point &O, const point &B) { return comp(outer(A - O, B - O)); } vector<point> convex_hull(vector<point> &points) { int size = (int)points.size(); if (size < 3) return points; point O = *min_element(points.begin(), points.end()); sort(points.begin(), points.end(), [O](const point &A, const point &B) { double foo = outer(A - O, B - O); return comp(foo) > 0 or (!comp(foo) and comp(dist(A, O), dist(B, O)) < 0); }); vector<point> polygon = {points.back(), points[0], points[1]}; for (int i = 2; i < size;) if (polygon.size() <= 2 or side(polygon.rbegin()[0], polygon.rbegin()[1], points[i]) > 0) polygon.push_back(points[i++]); else polygon.pop_back(); polygon.pop_back(); return polygon; } vector<int> pre_kmp(const vector<double> &A) { int i = 0, j, size = (int)A.size(); vector<int> back(size + 1); back[0] = j = -1; while (i < size) { while (j >= 0 and comp(A[i], A[j])) j = back[j]; ++i; ++j; back[i] = j; } return back; } vector<int> kmp(const vector<double> &A, const vector<double> &B) { int i = 0, j = 0, sizea = (int)A.size(), sizeb = (int)B.size(); vector<int> match, back = pre_kmp(B); while (i < sizea) { while (j >= 0 and comp(A[i], B[j])) j = back[j]; ++i; ++j; if (j == sizeb) { match.push_back(i - j); j = back[j]; } } return match; } vector<double> stringify(const vector<point> &P) { vector<double> foo; int size = (int)P.size(); for (int i = 0; i < size; ++i) { foo.push_back(dist(P[i], P[(i + 1) % size])); foo.push_back(angle(P[i], P[(i + 1) % size], P[(i + 2) % size])); } return foo; } int main() { int n, m; scanf( %d %d , &n, &m); vector<point> A(n), B(m); for (int i = 0; i < n; ++i) scanf( %lf %lf , &A[i].x, &A[i].y); for (int i = 0; i < m; ++i) scanf( %lf %lf , &B[i].x, &B[i].y); vector<double> X = stringify(convex_hull(A)), Y = stringify(convex_hull(B)); X.insert(X.end(), X.begin(), X.end()); printf( %s n , kmp(X, Y).empty() ? NO : YES ); return 0; }
#include <bits/stdc++.h> using namespace std; bool q[2][1001]; short qf[3][1001], an[1001][1001][50][2]; inline short gt(int l, int r, int p) { return qf[p][r] - qf[p][l - 1]; } int main() { int n, p, k; scanf( %d%d%d , &n, &p, &k); for (int i = 0; i < (int)(2); ++i) { int t; scanf( %d , &t); while (t--) { int t; scanf( %d , &t); q[i][t] = true; } } for (int i = 1; i < (int)(n + 1); ++i) { qf[0][i] = qf[0][i - 1] + q[0][i]; qf[1][i] = qf[1][i - 1] + q[1][i]; qf[2][i] = qf[2][i - 1] + (q[0][i] || q[1][i]); } for (int i = 0; i < (int)(p + 1); ++i) for (int j = 0; j < (int)(n + 1); ++j) for (int w = 0; w < (int)(k); ++w) for (int c = 0; c < (int)(2); ++c) an[i][j][w][c] = -2000; for (int l = 0; l < (int)(p + 1); ++l) for (int i = 0; i < (int)(n + 1); ++i) an[l][i][0][0] = an[l][i][0][1] = 0; for (int l = 1; l < (int)(p + 1); ++l) for (int i = 1; i < (int)(n + 1); ++i) for (int j = 0; j < (int)(min(k, i + 1)); ++j) for (int c = 0; c < (int)(2); ++c) { short &a = an[l][i][j][c]; if (j) a = gt(i, i, c) + an[l - (j == 1)][i - 1][j - 1][c]; else { for (int z = 1; z < (int)(k); ++z) a = max(a, (short)(gt(i, i, c) + an[l][i - 1][z][c])); a = max(a, an[l][i - 1][0][c]); } if (j > 1) a = max(a, an[l][i][j - 1][c]); for (int z = 0; z < (int)(2); ++z) a = max(a, (short)(gt(i, i, c) + an[l - 1][i - 1][0][z])); a = max(a, (short)(gt(i - j + 1, i, 2) + an[l - 1][i - j][j ? k - j : 0][c ^ 1])); } short a = 0; for (int i = 0; i < (int)(k); ++i) for (int j = 0; j < (int)(2); ++j) a = max(a, an[p][n][i][j]); printf( %u n , a); }
#include <bits/stdc++.h> using namespace std; int n, m, s; long long ans = 0; int main() { int i, j, k; int a1, b1, a2, b2; int x1, y1, x2, y2; int p1, p2; cin >> n >> m >> s; for (i = 0; i <= n / 2; i++) { for (j = 0; j <= m / 2; j++) { for (k = 0; k <= n / 2; k++) { a1 = i; b1 = j; a2 = k; x1 = 1 + 2 * a1; y1 = 1 + 2 * b1; x2 = 1 + a2 * 2; if (x2 > x1) { if ((s - x1 * y1) % (x2 - x1) == 0 && (s - x1 * y1) > 0) { y2 = (s - x1 * y1) / (x2 - x1); if (y2 <= y1 && y2 > 0 && y2 % 2 == 1) { b2 = (y2 - 1) / 2; if (((n - 2 * a2) * (m - 2 * b1)) > 0) ans += ((n - 2 * a2) * (m - 2 * b1)); } } if (s % x2 == 0) { y2 = s / x2; if (y2 > y1 && y2 % 2 == 1) { b2 = (y2 - 1) / 2; if (((n - 2 * a2) * (m - 2 * b2)) > 0) ans += ((n - 2 * a2) * (m - 2 * b2)); } } } else if (x2 == x1) { if (x1 * y1 == s) { if (((n - 2 * a1) * (m - 2 * b1) * (b1 + 1)) > 0) ans += ((n - 2 * a1) * (m - 2 * b1) * (b1 + 1)); } if (s % x1 == 0) { y2 = s / x1; if (y2 > y1 && y2 % 2 == 1) { b2 = (y2 - 1) / 2; if (((n - 2 * a1) * (m - 2 * b2)) > 0) ans += ((n - 2 * a1) * (m - 2 * b2)); } } } else { if (s + x2 * y1 - x1 * y1 > 0 && (s + x2 * y1 - x1 * y1) % x2 == 0) { y2 = (s + x2 * y1 - x1 * y1) / x2; if (y2 > y1 && y2 % 2 == 1) { b2 = (y2 - 1) / 2; if (((n - 2 * a1) * (m - 2 * b2)) > 0) ans += ((n - 2 * a1) * (m - 2 * b2)); } } if (x1 * y1 == s) { if (((n - 2 * a1) * (m - 2 * b1) * (b1 + 1)) > 0) ans += ((n - 2 * a1) * (m - 2 * b1) * (b1 + 1)); } } } } } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; long long fib[100005], mod = 1e9 + 7; void pre() { fib[0] = fib[1] = 1; for (int i = 2; i < 100005; i++) fib[i] = (fib[i - 1] + fib[i - 2]) % mod; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); pre(); long long m, n, x; cin >> m >> n; x = (fib[m] + fib[n] - 1) % mod; cout << (2LL * x) % mod; return 0; }
#include <bits/stdc++.h> using namespace std; const long long MAXN = 1e2 + 7; long long p[MAXN], dp[MAXN]; pair<long long, long long> fig[MAXN]; int32_t main() { long long n; cin >> n; for (long long i = 0; i < n; ++i) cin >> fig[i].second >> fig[i].first; sort(fig, fig + n); long long t; cin >> t; for (long long i = 1; i <= t; ++i) cin >> p[i]; p[t + 1] = (1LL << 60); long long pos = 1, ans = 0, sum = 0; for (long long i = 0; i < n; ++i) { while (fig[i].second) { if (p[pos] - sum > fig[i].second) { sum += fig[i].second; ans += fig[i].second * pos * fig[i].first; fig[i].second = 0; } else { ans += fig[i].first * (p[pos] - sum) * pos; fig[i].second -= p[pos] - sum; sum = p[pos]; pos++; } } } cout << ans << n ; }
#include <bits/stdc++.h> int btf(int n) { static int num[10]; memset(num, 0, sizeof(num)); for (int i = 0; i < 4; i++) { num[n % 10]++; n /= 10; } for (int i = 0; i < 10; i++) if (num[i] > 1) return 0; return 1; } void solve(int n) { for (int i = n + 1; 1; i++) if (btf(i)) { printf( %d n , i); return; } } int main() { int n; while (scanf( %d , &n) != EOF) solve(n); return 0; }
#include <bits/stdc++.h> using namespace std; int a, b, m; void deal() { for (int i = 0; i <= a && i < m; i++) { if ((m - (long long int)i * 1000000000 % m) % m > b) { printf( 1 %.9d n , i); return; } } printf( 2 n ); } int main() { while (scanf( %d%d%d , &a, &b, &m) != EOF) { deal(); } return 0; }
#include <bits/stdc++.h> using namespace std; string s; long long ans[2200], MOD = 1000003; long long dp[2200][2200], inv[2200], fac[2200], ifac[2200]; void init_math(int N) { inv[1] = 1LL; for (int i = 2; i <= N; i++) inv[i] = (MOD - ((MOD / i) * inv[MOD % i]) % MOD); fac[0] = 1LL; ifac[0] = 1LL; for (int i = 1; i <= N; i++) { fac[i] = (fac[i - 1] * (long long)(i)) % MOD; ifac[i] = (ifac[i - 1] * inv[i]) % MOD; } } int st[2200], stc, r, len, ms, t[2200], tc; int main() { ios::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); init_math(2000); cin >> s; len = s.size(); ans[1] = 1; for (int i = 1; i <= 2000; i++) ans[i + 1] = inv[i + 1] * fac[i * 2] % MOD * ifac[i] % MOD * ifac[i] % MOD; tc = 0; bool isn = 0, ist; for (int i = 0; i < len; i++) { ist = 0; if (s[i] <= 9 && s[i] >= 0 ) isn = 1; else { if (isn) { t[tc++] = 0; isn = 0; } if (i == 0 || !(s[i - 1] <= 9 && s[i - 1] >= 0 )) { if (s[i] == * || s[i] == / ) { cout << 0 << endl; return 0; } t[tc++] = 1; } else ist = 1; } } if (isn) t[tc++] = 0; if (t[tc - 1] == 1 || ist) { cout << 0 << endl; return 0; } stc = 0; for (int i = 0; i < tc; i++) { if (t[i] == 0) st[stc]++; else stc++; } if (stc == 0) { cout << ans[tc] << endl; return 0; } dp[stc + 1][0] = 1; for (int i = stc; i >= 0; i--) { r = st[i]; if (i) { ms += r; for (int j = 1; j <= ms; j++) for (int k = max(r - j, 0); k <= ms - j; k++) { dp[i][k + 1] += (dp[i + 1][k + j - r] * ans[j]) % MOD; if (dp[i][k + 1] >= MOD) dp[i][k + 1] -= MOD; } } else { for (int j = 0; j <= ms; j++) { dp[i][j + r] += dp[i + 1][j]; if (dp[i][j + r] >= MOD) dp[i][j + r] -= MOD; } } } long long res = 0; for (int i = 1; i <= tc; i++) { res += (dp[0][i] * ans[i]) % MOD; if (res >= MOD) res -= MOD; } cout << res << endl; return 0; }
#include <bits/stdc++.h> using namespace std; inline int two(int x) { return 1 << x; } inline long long TWO(int x) { return (long long)1 << x; } template <class T> void Min(T &x, T y) { if (y < x) x = y; } template <class T> void Max(T &x, T y) { if (y > x) x = y; } template <class T> T _abs(T x) { return x > 0 ? x : -x; } template <class T> T gcd(T a, T b) { return !b ? a : gcd(b, a % b); } const int maxn = 200010; const int mod = 1000000007; int get_val() { int ret(0); char c; while ((c = getchar()) == || c == n || c == r ) ; ret = c - 0 ; while ((c = getchar()) != && c != n && c != r ) ret = ret * 10 + c - 0 ; return ret; } int n, m, k; int a[maxn], b[maxn]; int num[maxn]; int main() { cin >> n >> m >> k; map<int, int> mpa, mpb, mp; for (int i = 0; i < n; i++) a[i] = get_val(), mpa[a[i]]++, mp[a[i]]++; for (int i = 0; i < m; i++) b[i] = get_val(), mpb[b[i]]++, mp[b[i]]--; int tot = 0; for (map<int, int>::iterator it = mp.begin(); it != mp.end(); it++) { if (it->second) num[tot++] = it->second; } long long s1 = 0, s2 = 0; for (int i = tot; i >= 0; i--) { s1 += num[i]; if (s1 > 0) { return puts( YES ), 0; } } puts( NO ); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n1, n2, k, a; cin >> n1 >> n2; vector<int> arr1, arr2; for (int l = 0; l < n1; l++) { cin >> a; arr1.push_back(a); } for (int l = 0; l < n2; l++) { cin >> a; arr2.push_back(a); } sort(arr1.begin(), arr1.end()); sort(arr2.begin(), arr2.end()); for (int k = 0; k < arr1.size(); k++) { for (int l = 0; l < arr2.size(); l++) { if (arr1[k] == arr2[l]) { cout << arr1[k] << n ; return 0; } } } if (arr1[0] < arr2[0]) { k = 10 * arr1[0] + arr2[0]; cout << k << n ; } else { k = 10 * arr2[0] + arr1[0]; cout << k << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; for (int i = 0; i < s.length(); i++) { if (s[i] != a && s[i] != e && s[i] != i && s[i] != o && s[i] != u && s[i] != n ) { if (i != s.length() - 1) { if (s[i + 1] != a && s[i + 1] != e && s[i + 1] != i && s[i + 1] != o && s[i + 1] != u ) { cout << NO << endl; return 0; } } else { cout << NO << endl; return 0; } } } cout << YES << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int n, m; int main() { scanf( %d %d , &n, &m); if (m > n) { printf( -1 ); return 0; } m -= 2; if (n == 1) { printf( a ); return 0; } if (n > 1 && m < 0) { printf( -1 ); return 0; } for (int i = 1; i <= n - m; i++) if (i % 2 == 1) printf( a ); else printf( b ); for (int i = 1; i <= m; i++) printf( %c , char(i + 98)); printf( n ); return 0; }
#include <bits/stdc++.h> using namespace std; const int inf = 1000000007; const long long linf = 1000000000000000000LL; const double eps = 0.000001; const double pi = 3.14159265358979323846; template <class T> T abs(T k) { return k >= 0 ? k : -k; } template <class T> T sqr(T n) { return n * n; } template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; } template <class T> T mod(T a, T b) { return (a % b + b) % b; } template <class T> T addmod(T a, T b, T c) { return (T)((long long)(a + b) % c); } template <class T> T mulmod(T a, T b, T c) { return (T)((long long)a * b % c); } template <class T> T powmod(T a, T b, T c) { return (T)(b ? sqr((long long)powmod(a, b >> 1, c)) % c * (b & 1 ? a : 1) % c : 1); } template <class T> void maxe(T &a, T b) { a = max(a, b); } template <class T> void mine(T &a, T b) { a = min(a, b); } template <class T> void mode(T &a, T b) { a = mod(a, b); } template <class T> void addmode(T &a, T b, T c) { a = addmod(a, b, c); } template <class T> void mulmode(T &a, T b, T c) { a = mulmod(a, b, c); } template <class T> void powmode(T &a, T b, T c) { a = powmod(a, b, c); } void fileio_in_out() { freopen( .in , r , stdin); freopen( .out , w , stdout); } void fileio_txt() { freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); } const int N = 111111; int test; int n, m, k; long long ans; long long d[N], h[N], t[N], s[N], st[N]; long long dp[111][N]; int q[N], head, tail; long long f1(int i, int j, int k) { return dp[i][k] + st[k] - t[j] * k; } long long f2(int i, int j, int k) { return ((dp[i][j] + st[j]) - (dp[i][k] + st[k])) / (j - k); } long long getans() { sort(t + 1, t + 1 + m); for (int i = 1; i <= m; i++) { st[i] = st[i - 1] + t[i]; dp[1][i] = t[i] * i - st[i]; } for (int i = 2; i <= k; i++) { head = tail = 0; for (int j = 1; j <= m; j++) { while (head < tail && f1(i - 1, j, q[head]) >= f1(i - 1, j, q[head + 1])) head++; while (head < tail && f2(i - 1, q[tail - 1], q[tail]) >= f2(i - 1, q[tail], j)) tail--; dp[i][j] = t[j] * j - st[j] + f1(i - 1, j, q[head]); q[++tail] = j; } } return dp[k][m]; } int main() { scanf( %d%d%d , &n, &m, &k); for (int i = 2; i <= n; i++) { scanf( %I64d , &d[i]); s[i] = s[i - 1] + d[i]; } for (int i = 1; i <= m; i++) { scanf( %I64d%I64d , &h[i], &t[i]); t[i] -= s[h[i]]; } ans = getans(); printf( %I64d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int n, m, vmx; long long seed; struct node { int l, r; mutable long long val; bool operator<(const node &x) const { return l < x.l; } }; set<node> tr; set<node>::iterator split(int pos) { set<node>::iterator iter = tr.lower_bound((node){pos}); if (iter != tr.end() && iter->l == pos) return iter; iter--; int L = iter->l, R = iter->r; long long Val = iter->val; tr.erase(iter); tr.insert((node){L, pos - 1, Val}); return tr.insert((node){pos, R, Val}).first; } void assign(int l, int r, long long val) { set<node>::iterator R = split(r + 1), L = split(l); tr.erase(L, R); tr.insert((node){l, r, val}); return; } void add(int l, int r, long long val) { set<node>::iterator R = split(r + 1), L = split(l); for (; L != R; ++L) L->val = L->val + val; return; } struct Lsh { long long val; int sum; } ls[N]; inline bool Lscmp(Lsh a, Lsh b) { return a.val < b.val; } inline long long rnk(int l, int r, int x) { set<node>::iterator R = split(r + 1), L = split(l); int tot = 0; for (; L != R; ++L) ls[++tot].val = L->val, ls[tot].sum = (L->r - L->l + 1); sort(ls + 1, ls + tot + 1, Lscmp); for (int i = 1; i <= tot; i++) { x -= ls[i].sum; if (x <= 0) return ls[i].val; } } inline long long ksm(long long a, long long b, long long mod) { a %= mod; long long ans = 1; while (b) { if (b & 1) ans = ans * a % mod; a = a * a % mod; b >>= 1; } return ans; } inline long long calc(int l, int r, int x, int y) { set<node>::iterator R = split(r + 1), L = split(l); long long ans = 0; for (; L != R; ++L) ans = (ans + ksm(L->val, x, y) * (L->r - L->l + 1) % y) % y; return ans; } inline int rnd() { int ret = seed; seed = (seed * 7 + 13) % 1000000007; return ret; } int op, l, r, x, y; int tot; int main() { scanf( %d%d%lld%d , &n, &m, &seed, &vmx); for (int i = 1; i <= n; i++) tr.insert((node){i, i, rnd() % vmx + 1}); tr.insert((node){n + 1, n + 1, 0}); for (int i = 1; i <= m; i++) { op = rnd() % 4 + 1; l = rnd() % n + 1; r = rnd() % n + 1; if (l > r) swap(l, r); if (op == 3) x = rnd() % (r - l + 1) + 1; else x = rnd() % vmx + 1; if (op == 4) y = rnd() % vmx + 1; if (op == 1) add(l, r, x); else if (op == 2) assign(l, r, x); else if (op == 3) printf( %lld n , rnk(l, r, x)); else printf( %lld n , calc(l, r, x, y)); } return 0; }
#include <bits/stdc++.h> using namespace std; int n; double a[200005], b[200005]; double l = -10001, r = 10001; const double eps = 2e-12; double solve(double x) { for (int i = 1; i <= n; ++i) b[i] = a[i] - x; double res = 0, tmp = 0; for (int i = 1; i <= n; ++i) { if (tmp < 0) tmp = 0; tmp += b[i]; res = max(res, tmp); } tmp = 0; for (int i = 1; i <= n; ++i) { if (tmp < 0) tmp = 0; tmp -= b[i]; res = max(res, tmp); } return res; } int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %lf , &a[i]); } while (r > eps + l) { double ll = (2 * l + r) / 3, rr = (l + 2 * r) / 3; double lll = solve(ll); double rrr = solve(rr); if (lll < rrr) r = rr; else l = ll; } cout << fixed << setprecision(12) << solve((l + r) / 2) << endl; }
#include <bits/stdc++.h> using namespace std; int main() { int n, m, c, i; cin >> n >> m; c = 2 * n; i = 1; while (i <= 2 * n) { if (m > c) { c++; cout << c << ; } cout << i << ; i++; if (m < i) break; } return 0; }
#include <bits/stdc++.h> using namespace std; long long t, sx, sy, ex, ey; int e, s, n, w; string ch; int main() { cin >> t >> sx >> sy >> ex >> ey; if (sx < ex) e = ex - sx; else w = sx - ex; if (sy < ey) n = ey - sy; else s = sy - ey; cin >> ch; long long d = 1; for (long long i = 0; i < t; i++) { if (ch[i] == S ) s--; else if (ch[i] == N ) n--; else if (ch[i] == E ) e--; else w--; if ((s <= 0 && n <= 0) && (e <= 0 && w <= 0)) { d = 0; cout << i + 1 << endl; break; } } if (d == 1) cout << -1 << endl; }
#include<bits/stdc++.h> using namespace std; #define read(x) scanf( %d ,&x) const int N=1e5+10; string s; int main() { int t; read(t); while(t--) { cin>>s; for(int i=0;i<s.size();i++) { if(i%2==0) { if(s[i]!= a ) s[i]= a ; else s[i]= b ; } else { if(s[i]!= z ) s[i]= z ; else s[i]= y ; } } cout<<s<<endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 123456; void solve() { long long n; cin >> n; if (n % 2 == 0) { cout << (10 + n) << 10 ; } else { cout << (9 + n) << 9 ; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t; t = 1; while (t--) solve(); return 0; }
#include <bits/stdc++.h> #pragma GCC optimize( Ofast , inline , -ffast-math ) #pragma GCC target( avx,sse2,sse3,sse4,mmx ) inline long long read() { long long s(0); bool w(1); char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) w = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) s = s * 10 + ch - 0 , ch = getchar(); return s * w; } long long l, r, n, m, x, y, num; int main() { n = read(), x = read(); for (int i = 1; i <= n; i++) { num = read(); l = l * x + num; } scanf( %lld%lld , &m, &y); for (int i = 1; i <= m; i++) { num = read(); r = r * y + num; } puts(l == r ? = : (l > r ? > : < )); }
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c = 0; cin >> a; for (int i = 0; i < a; ++i) { cin >> b; if (b == 1) { c = 1; } } if (c == 0) { cout << EASY n ; } else { cout << HARD n ; } }
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int maxn = 4e3 + 5; const int mod = 1e9 + 7; const double eps = 1e-8; const double pi = asin(1.0) * 2; const double e = 2.718281828459; bool Finish_read; template <class T> inline void read(T &x) { Finish_read = 0; x = 0; int f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) { f = -1; } if (ch == EOF) { return; } ch = getchar(); } while (isdigit(ch)) { x = x * 10 + ch - 0 ; ch = getchar(); } x *= f; Finish_read = 1; }; int main(int argc, char *argv[]) { int n, m; read(n); read(m); vector<int> a; a.push_back(0); for (int i = 1, x; i <= n; ++i) { read(x); a.push_back(x); } a.push_back(m); vector<int> f[2]; f[0].assign(a.size(), 0); f[1].assign(a.size(), 0); for (int i = int(a.size()) - 2; i >= 0; --i) { f[0][i] = f[1][i + 1]; f[1][i] = (a[i + 1] - a[i]) + f[0][i + 1]; } int ans = f[1][0]; for (int i = 0; i + 1 < int(a.size()); ++i) { if (a[i + 1] - a[i] < 2) { continue; } int tp = (i & 1) ^ 1; int pSum = f[1][0] - f[tp][i]; ans = max(ans, pSum + (a[i + 1] - a[i] - 1) + f[tp][i + 1]); } printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; vector<int> Q[123]; int stk[123]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) { int x; scanf( %d , &x); for (int j = 0; j < x; j++) { int u; scanf( %d , &u); Q[i].push_back(u); } } int cnt = 0; int A = 0, B = 0; for (int i = 0; i < n; i++) { if (Q[i].size() % 2 == 1) { stk[cnt++] = Q[i][Q[i].size() / 2]; } for (int j = 0; j < Q[i].size() / 2; j++) A += Q[i][j]; for (int j = 0; j < Q[i].size() / 2; j++) B += Q[i][Q[i].size() - 1 - j]; } sort(stk, stk + cnt); for (int i = cnt - 2; i > -1; i -= 2) B += stk[i]; for (int i = cnt - 1; i > -1; i -= 2) A += stk[i]; cout << A << << B << n ; }
#include <bits/stdc++.h> using namespace std; class Solution { public: void solve(std::istream& in, std::ostream& out) { int T; in >> T; for (int _t = 0; _t < (int)(T); ++_t) { int n, s, t; in >> n >> s >> t; int res = n - min(s, t) + 1; out << res << endl; } } }; void solve(std::istream& in, std::ostream& out) { out << std::setprecision(12); Solution solution; solution.solve(in, out); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); istream& in = cin; ostream& out = cout; solve(in, out); return 0; }
#include <bits/stdc++.h> using namespace std; int a[2001]; int ou, ji; int main() { int n; scanf( %d , &n); long long ans = 0; for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); ans += a[i]; if (a[i] % 2 == 0) ou++; else ji++; } if (ou > ji) ou = ji + 1; else if (ji > ou) ji = ou + 1; sort(a + 1, a + 1 + n); for (int i = n; i >= 1; i--) { if (a[i] % 2 == 0 && ou) { ans -= a[i]; ou--; } else if (a[i] % 2 != 0 && ji) { ans -= a[i]; ji--; } } printf( %lld n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; namespace FGF { const int N = 2e5 + 5; int n, m; long long read() { long long s = 0, w = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) w = -w; ch = getchar(); } while (isdigit(ch)) { s = s * 10 + ch - 0 ; ch = getchar(); } return s * w; } struct Node { long long a, b, tim; Node(){}; Node(long long _a, long long _b, long long _t) : a(_a), b(_b), tim(_t){}; } c[N]; bool operator<(Node x, Node y) { return x.tim > y.tim; } bool check(long long x) { priority_queue<Node> q; while (q.size()) q.pop(); for (int i = 1; i <= n; i++) if (c[i].tim < m) q.push(c[i]); if (q.empty()) return 1; for (int i = 0; i < m; i++) { Node u = q.top(); q.pop(); if (u.tim < i) return 0; u.a += x; u.tim = u.a / u.b; if (u.tim < m) q.push(u); if (q.empty()) return 1; } return 1; } void work() { n = read(), m = read(); for (int i = 1; i <= n; i++) c[i].a = read(); for (int i = 1; i <= n; i++) c[i].b = read(), c[i].tim = c[i].a / c[i].b; long long l = 0, r = 5e12, ans = -1; while (l <= r) { long long mid = (l + r) >> 1; if (check(mid)) { ans = mid; r = mid - 1; } else l = mid + 1; } printf( %lld n , ans); } } // namespace FGF int main() { FGF::work(); return 0; }
#include <bits/stdc++.h> #pragma GCC optimize(3) using namespace std; const double PI = acos(-1.0); const double eps = 1e-6; const int INF = 0x3f3f3f3f; const long long SEED = 19260817; const long long MOD = 1e9 + 9; const int maxn = 2e5 + 11; int N, M, T; char a[maxn]; long long cnt[maxn][26], dif[maxn], cx[maxn], cy[maxn]; void solve(int x, int y, int l) { for (int i = 0; i < 26; i++) { cx[i] = (cnt[x + l - 1][i] - cnt[x - 1][i] * dif[l] % MOD + MOD) % MOD; cy[i] = (cnt[y + l - 1][i] - cnt[y - 1][i] * dif[l] % MOD + MOD) % MOD; } sort(cx, cx + 26); sort(cy, cy + 26); for (int i = 0; i < 26; i++) if (cx[i] != cy[i]) { puts( NO ); return; } puts( YES ); return; } int main() { cin >> N >> M; scanf( %s , a + 1); dif[0] = 1; for (int i = 1; i <= N; i++) { dif[i] = (dif[i - 1] * SEED) % MOD; for (int j = 0; j < 26; j++) cnt[i][j] = cnt[i - 1][j] * SEED % MOD; cnt[i][a[i] - a ] = (cnt[i][a[i] - a ] + 1) % MOD; } while (M--) { int x, y, l; scanf( %d%d%d , &x, &y, &l); solve(x, y, l); } return 0; }
#include <bits/stdc++.h> using namespace std; const long long MAXN = 1e5 + 10; long long tree[MAXN * 4][7][11], s[6][MAXN], a[MAXN]; void Pushup(long long u, long long len) { long long z, i, j; for (z = 2; z <= 6; z++) for (i = 0; i < 2 * (z - 1); i++) tree[u][z][i] = tree[u * 2][z][i] + tree[u * 2 + 1][z][(i + len) % (2 * (z - 1))]; return; } void Build(long long u, long long l, long long r) { long long z, i; if (l == r) { for (z = 2; z <= 6; z++) for (i = 0; i < (z - 1) * 2; i++) tree[u][z][i] = a[l] * s[z][i]; return; } long long mid = (l + r) >> 1; Build(u * 2, l, mid); Build(u * 2 + 1, mid + 1, r); Pushup(u, mid - l + 1); } void Update(long long u, long long l, long long r, long long pos, long long val) { long long z, i; if (l == r) { for (z = 2; z <= 6; z++) for (i = 0; i < 2 * (z - 1); i++) tree[u][z][i] = val * s[z][i]; return; } long long mid = (l + r) >> 1; if (pos <= mid) Update(u * 2, l, mid, pos, val); else Update(u * 2 + 1, mid + 1, r, pos, val); Pushup(u, mid - l + 1); } long long Query(long long u, long long L, long long R, long long l, long long r, long long z, long long i) { if (L == l && R == r) return tree[u][z][i]; long long mid = (L + R) >> 1; if (r <= mid) return Query(u * 2, L, mid, l, r, z, i); if (l > mid) return Query(u * 2 + 1, mid + 1, R, l, r, z, i); return Query(u * 2, L, mid, l, mid, z, i) + Query(u * 2 + 1, mid + 1, R, mid + 1, r, z, (i + mid - l + 1) % (2 * (z - 1))); } int main() { long long n, m, z, i, j; scanf( %lld , &n); for (i = 1; i <= n; i++) scanf( %lld , &a[i]); for (z = 2; z <= 6; z++) { long long mod = 2 * (z - 1); for (i = 1; i <= 100000; i++) { if (i % mod == 0) s[z][i - 1] = 2; else if (i % mod <= z) s[z][i - 1] = i % mod; else s[z][i - 1] = (z * 2) - (i % mod); } } Build(1, 1, n); scanf( %lld , &m); for (i = 1; i <= m; i++) { long long op; scanf( %lld , &op); if (op == 1) { long long pos, val; scanf( %lld %lld , &pos, &val); Update(1, 1, n, pos, val); } else { long long l, r, z; scanf( %lld %lld %lld , &l, &r, &z); printf( %lld n , Query(1, 1, n, l, r, z, 0)); } } return 0; }
#include <bits/stdc++.h> using namespace std; template <class T> void miz(T &a, T b) { if (b < a) a = b; } template <class T> void maz(T &a, T b) { if (b > a) a = b; } template <class T> void clear(T &x) { T t; x.swap(t); } template <class T> T gcd(T a, T b) { while (b) { a %= b; swap(a, b); } return a; } template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; } template <class T> T sqr(T x) { return x * x; } unsigned HASH(const char *p) { unsigned r = 0; while (*p) r = r * 257 + 1 + *p++; return r; } int ROUND(double x) { return x >= 0 ? x + 0.5 : x - 0.5; } int cnt[1000005]; int main() { int k, c, i, now = 0; long long ans = 0; scanf( %d , &k); cnt[0] = 1; for (i = 1; (c = getchar()) != n ; i++) { if (c == 1 ) now++; if (now >= k) ans += cnt[now - k]; cnt[now]++; } cout << ans << endl; return 0; }
/* 西江月·证明 即得易见平凡，仿照上例显然；留作习题答案略，读者自证不难。 反之亦然同理，推论自然成立；略去过程Q.E.D.，由上可知证毕。 result of thinking: Pure. 主要是非内、外向树的情形容易遗漏. AC: */ #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ldouble; template<class T> bool chmin(T &x, const T &y) { return x > y ? (x = y, true) : false; } template<class T> bool chmax(T &x, const T &y) { return x < y ? (x = y, true) : false; } #define maxn 1000005 const ll mod = 998244353; const ll inv2 = 499122177; const ll inv6 = 166374059; int n; ll f[maxn], r[maxn], df[maxn]; int main() { scanf( %d , &n); f[0] = r[0] = 1; for (int i = 1; i <= n; i++) { f[i] = (f[i - 1] * f[i - 1] % mod * inv2 + 3 * f[i - 1] * inv2 + 1) % mod; r[i] = (f[i] + (f[i - 1] * f[i - 1] % mod * f[i - 1] + f[i - 1] * f[i - 1] * 3 + f[i - 1] * 2) % mod * inv6) % mod; } ll ans = ((r[n] - r[n - 1]) * 2 - 1) % mod; df[0] = f[0]; for (int i = 1; i <= n; i++) df[i] = f[i] - f[i - 1]; for (int i = 1; i <= n - 2; i++) { (ans += (df[i] - df[i - 1]) * (df[n - 1 - i] - 1)) %= mod; } printf( %lld n , (ans + mod) % mod); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 201; set<int> graph[N]; map<pair<int, int>, int> edges; pair<int, int> bfs(int node) { int dist[N] = {0}; int vis[N] = {0}; queue<pair<int, int> > q; q.push({0, node}); while (!q.empty()) { int top = q.front().second; q.pop(); if (vis[top]) continue; vis[top] = true; for (set<int>::iterator it = graph[top].begin(); it != graph[top].end(); it++) { int to = *it; if (vis[to]) continue; dist[to] = dist[top] + 1; q.push({dist[to], to}); } } pair<int, int> temp = {node, 0}; for (int i = 1; i <= N; i++) { if (dist[i] > temp.second) { temp.second = dist[i]; temp.first = i; } } return temp; } int find_dia(int node) { pair<int, int> temp = bfs(node); temp = bfs(temp.first); return temp.second; } int main(void) { int n; cin >> n; for (int i = 1; i < n; i++) { int u, v; cin >> u >> v; graph[u].insert(v); graph[v].insert(u); edges[{u, v}] = 1; } int ans = 0; for (map<pair<int, int>, int>::iterator it = edges.begin(); it != edges.end(); it++) { int u = (*it).first.first; int v = (*it).first.second; graph[u].erase(v); graph[v].erase(u); ans = max(ans, find_dia(v) * find_dia(u)); graph[u].insert(v); graph[v].insert(u); } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, n1, n2; scanf( %d%d%d , &n, &n1, &n2); if (n1 > n2) swap(n1, n2); vector<double> X; double x; for (int i = 0; i < n; i++) { scanf( %lf , &x); X.push_back(x); } sort(X.begin(), X.end()); double sum1 = 0, sum2 = 0; for (int i = n - n1 - n2; i < n; i++) { if (i < n - n1) sum2 += X[i]; else sum1 += X[i]; } sum1 /= n1; sum2 /= n2; printf( %.8lf , sum1 + sum2); return 0; }
#include <bits/stdc++.h> using namespace std; const long long N = 100100, mod = 1e9 + 7, mod2 = 1e9 + 9, mod3 = 998244353, sq = 450, base = 727, lg = 30; long long n, m, x, y, z, w, ans, t, l[N], r[N]; int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n; for (int i = 0; i < n; i++) { cin >> l[i] >> r[i]; if (i == 0) { x = l[i]; y = r[i]; continue; } x = min(x, l[i]); y = max(y, r[i]); } for (int i = 0; i < n; i++) { if (l[i] == x && r[i] == y) return cout << i + 1, 0; } cout << -1; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; if (m == 0) { cout << n << n ; return 0; } string hint[m]; getline(cin, hint[0]); vector<vector<string> > h(m); for (int i = 0; i < m; i++) { getline(cin, hint[i]); stringstream ss(hint[i]); string w; while (ss >> w) h[i].push_back(w); } int i; int ans = 0; for (i = 0; i < n; i++) { bool yes = true; for (int j = 0; j < m; j++) { if (h[j][2] == left ) { int k = atoi(h[j][4].c_str()) - 1; if (i >= k) { yes = false; break; } } else if (h[j][2] == right ) { int k = atoi(h[j][4].c_str()) - 1; if (i <= k) { yes = false; break; } } } if (yes) ans++; } if (ans == 0) ans = -1; cout << ans << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int a[200], n, i, s = 0; scanf( %d , &n); for (i = 0; i < 2 * n - 1; i++) { scanf( %d , &a[i]); if (a[i] < 0) s -= a[i]; else s += a[i]; } if (n % 2 == 0) { sort(a, a + 2 * n - 1); for (i = 0; i < 2 * n - 1; i++) { if (a[i] > 0) break; } if (i % 2 == 1) { if (a[i - 1] + a[i] < -a[i - 1] - a[i] || a[i] < 0) s -= fabs(2 * a[i]); else s += 2 * a[i - 1]; } } cout << s << endl; }
#include <bits/stdc++.h> using namespace std; char s[300005]; int n, cnt, p[300005], to[600005], nexti[600005]; int fa[300005], son[300005], dep[300005], len[300005], top[300005], dfsx[300005], st[300005]; void dfs(int x, int lasti) { son[x] = 0; len[x] = 1; for (int i = p[x]; i != -1; i = nexti[i]) if (to[i] != lasti) { fa[to[i]] = x; dep[to[i]] = dep[x] + 1; dfs(to[i], x); len[x] += len[to[i]]; if (!son[x] || len[to[i]] > len[son[x]]) son[x] = to[i]; } } void DFS(int x, int lasti) { st[x] = ++cnt; dfsx[cnt] = x; if (son[x]) top[son[x]] = top[x], DFS(son[x], x); for (int i = p[x]; ~i; i = nexti[i]) if (to[i] != lasti && to[i] != son[x]) top[to[i]] = to[i], DFS(to[i], x); } int pw[300005], pre[300005], suf[300005]; inline int gethash(int l, int r) { if (l < r) return (pre[r] - 1LL * pre[l - 1] * pw[r - l + 1] % 998244353 + 998244353) % 998244353; else return (suf[r] - 1LL * suf[l + 1] * pw[l - r + 1] % 998244353 + 998244353) % 998244353; } struct Path { int l, r; int len() { return abs(r - l) + 1; } Path(int l = 0, int r = 0) : l(l), r(r) {} } x[305], y[305]; int getpath(int u, int v, Path *path) { static Path l[305], r[305]; int totl = 0, totr = 0; while (top[u] != top[v]) { if (dep[top[u]] > dep[top[v]]) { l[++totl] = Path(st[u], st[top[u]]); u = fa[top[u]]; } else { r[++totr] = Path(st[top[v]], st[v]); v = fa[top[v]]; } } if (dep[u] > dep[v]) l[++totl] = Path(st[u], st[v]); else r[++totr] = Path(st[u], st[v]); int tot = 0; for (int i = 1; i <= totl; i++) path[++tot] = l[i]; for (int i = totr; i >= 1; i--) path[++tot] = r[i]; return tot; } inline void getlr(Path pa, int len, int &l, int &r) { if (pa.l < pa.r) l = pa.l, r = l + len - 1; else l = pa.l, r = l - len + 1; } inline void update(Path *pa, int &x, int len) { if (pa[x].len() == len) pa[x++] = Path(); else if (pa[x].l < pa[x].r) pa[x].l += len; else pa[x].l -= len; } bool ck(int cntx, int cnty, int len) { if (len == 0) return true; int l, r; getlr(x[cntx], len, l, r); int hx = gethash(l, r); getlr(y[cnty], len, l, r); int hy = gethash(l, r); if (hx == hy) return true; else return false; } int query(int a, int b, int c, int d) { int xn = getpath(a, b, x), yn = getpath(c, d, y); int cntx = 1, cnty = 1, ret = 0; while (cntx <= xn && cnty <= yn) { int len = min(x[cntx].len(), y[cnty].len()); if (ck(cntx, cnty, len)) { update(x, cntx, len); update(y, cnty, len); ret += len; } else { int ans = 0, L = 0, R = len - 1; while (L < R) { len = (L + R + 1) >> 1; if (ck(cntx, cnty, len)) L = len; else R = len - 1; } return ret + L; } } return ret; } int main() { scanf( %d%s , &n, s + 1); memset(p, -1, sizeof p); for (int i = 1; i < n; i++) { int u, v; scanf( %d%d , &u, &v); cnt++, to[cnt] = v, nexti[cnt] = p[u], p[u] = cnt; cnt++, to[cnt] = u, nexti[cnt] = p[v], p[v] = cnt; } dep[1] = 1; dfs(1, -1); cnt = 0; DFS(1, 1); pw[0] = 1; for (int i = 1; i <= n; i++) pw[i] = 1LL * pw[i - 1] * 29 % 998244353; for (int i = 1; i <= n; i++) pre[i] = (1LL * pre[i - 1] * 29 + s[dfsx[i]] - a + 1) % 998244353; for (int i = n; i >= 1; i--) suf[i] = (1LL * suf[i + 1] * 29 + s[dfsx[i]] - a + 1) % 998244353; int q; scanf( %d , &q); while (q--) { int a, b, c, d; scanf( %d%d%d%d , &a, &b, &c, &d); printf( %d n , query(a, b, c, d)); } return 0; }
#include <bits/stdc++.h> using namespace std; int a[200005], b[200005], c[200005]; int num = 0; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; b[a[i]]++; } for (int i = 1; i <= n; i++) { if (b[i] == 0) c[++num] = i; } cout << num << endl; sort(c + 1, c + 1 + num); int tot = 0; int hson[200005]; memset(hson, 0, sizeof(hson)); for (int i = 1; i <= n; i++) { if (b[a[i]] > 1) { if (c[tot + 1] > a[i] && hson[a[i]] == 0) { hson[a[i]]++; continue; } tot++; b[a[i]]--; a[i] = c[tot]; } } for (int i = 1; i <= n; i++) cout << a[i] << ; cout << endl; return 0; }
#include <bits/stdc++.h> using namespace std; long long int a, b; stack<long long int> st; bool dfs(long long int n) { if (n > b) { return false; } if (n == b) { return true; } bool a1, a2; a1 = dfs(n * 2); if (a1) { st.push(n * 2); return true; } a2 = dfs((n * 10) + 1); if (a2) { st.push((n * 10) + 1); return true; } return false; } int main() { cin >> a >> b; if (dfs(a)) { cout << YES n ; cout << st.size() + 1 << n ; cout << a << ; while (!st.empty()) { cout << st.top() << ; st.pop(); } } else { cout << NO ; } return 0; }
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; void printV(vector<int> &S) { for (int s : S) { cout << s; } cout << endl; } void solve() { int x; cin >> x; string T; cin >> T; vector<int> S; for (int i = 0; i < (int)T.size(); i++) { S.push_back(T[i] - 0 ); } int l = 0; while (x > (int)S.size()) { int end = (int)S.size(); for (int rp = 0; rp < S[l] - 1; rp++) { for (int i = l + 1; i < end; i++) { S.push_back(S[i]); } } l++; } long long len = (long long)S.size() - l - 1; for (int i = l; i < x; i++) { len *= S[i]; len--; len %= MOD; } cout << (len + x + 1 + MOD) % MOD << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); int t; cin >> t; for (int i = 0; i < t; i++) solve(); }
#include <bits/stdc++.h> using namespace std; int a[10010]; int n, cnt; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) if (a[a[i]] == i && a[i] <= i) cnt++; cout << cnt << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const double eps = 1E-8; const int FFTSZ = 1 << 20; const double pi = acos(-1.); struct cp { double real, img; cp(double _r = 0.0, double _i = 0.0) : real(_r), img(_i) {} cp operator+(const cp &c) const { return cp(real + c.real, img + c.img); } cp operator-(const cp &c) const { return cp(real - c.real, img - c.img); } cp operator*(const cp &c) const { return cp(real * c.real - img * c.img, real * c.img + img * c.real); } }; void fft(cp x[], int n, int op) { for (int i = 1, j = 0; i < n; i++) { for (int l = n >> 1; (j ^= l) < l; l >>= 1) ; if (i < j) swap(x[i], x[j]); } for (int h = 2; h <= n; h <<= 1) { cp wn(cos(-op * 2 * pi / h), sin(-op * 2 * pi / h)); for (int j = 0; j < n; j += h) { cp w(1, 0); for (int k = j; k < j + h / 2; k++) { cp u = x[k], v = w * x[k + h / 2]; x[k] = u + v, x[k + h / 2] = u - v; w = w * wn; } } } if (op == -1) for (int i = 0; i < n; i++) x[i].real /= n, x[i].img /= n; } cp x[FFTSZ], y[FFTSZ]; int convolution(int a[], int lena, int b[], int lenb, int c[]) { int len = 1; while (len < lena + lenb - 1) len <<= 1; for (int i = 0; i < len; i++) { if (i < lena) x[i] = cp(a[i] * 1.0, 0.0); else x[i] = cp(0.0, 0.0); } for (int i = 0; i < len; i++) { if (i < lenb) y[i] = cp(b[i] * 1.0, 0.0); else y[i] = cp(0.0, 0.0); } fft(x, len, 1), fft(y, len, 1); for (int i = 0; i < len; i++) x[i] = x[i] * y[i]; fft(x, len, -1); c[len] = 0; for (int i = 0; i < len; i++) c[i] = int(x[i].real + 0.5); return lena + lenb - 1; } const int N = (1 << 20) + 1; int a[N], p[N]; int n, k; int main() { while (~scanf( %d%d , &n, &k)) { (memset(a, 0, sizeof(a))), (memset(p, 0, sizeof(p))); a[0] = 1; int mx = 0; for (int i = 1; i <= n; i++) { int v; scanf( %d , &v); p[v] = 1; mx = max(mx, v); } mx++; while (k) { if (k & 1) convolution(a, mx, p, mx, a); mx = convolution(p, mx, p, mx, p); k >>= 1; for (int i = 0; i < mx; i++) { a[i] = !!a[i]; p[i] = !!p[i]; } } for (int i = 0; i < mx; i++) if (a[i] != 0) printf( %d , i); puts( ); } return 0; }
#include <bits/stdc++.h> using namespace std; long long int powOfPositive(long long int n) { long long int pos = floor(log2(n)); return pos; } int main() { long long int t; cin >> t; while (t--) { long long int n; cin >> n; vector<long long int> arr(n); for (long long int i = 0; i < n; i++) { cin >> arr[i]; } vector<long long int> dp(30, 0); long long int ans = 0; for (long long int i = 0; i < n; i++) { if (arr[i] == 1) { dp[0]++; continue; } long long int x = powOfPositive(arr[i]); dp[x]++; } for (long long int i = 0; i < 30; i++) { if (dp[i] > 0) { ans += ((dp[i]) * (dp[i] - 1)) / 2; } } cout << ans << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; namespace zyt { const int N = 1e6 + 10, CH = 20; int f[1 << CH], n; char s[N]; bool check(const int a, const int p) { return a & (1 << p); } int ctoi(const char c) { return c - a ; } void get_max(int &a, const int b) { a = max(a, b); } int work() { scanf( %s , s); n = strlen(s); for (int i = 0; i < n; i++) { int tmp = 0; for (int j = i; j < n; j++) if (check(tmp, ctoi(s[j]))) break; else get_max(f[tmp |= (1 << ctoi(s[j]))], j - i + 1); } for (int i = 0; i < (1 << CH); i++) for (int j = 0; j < CH; j++) if (check(i, j)) get_max(f[i], f[i ^ (1 << j)]); int ans = 0; for (int i = 1; i < (1 << CH); i++) get_max(ans, f[i] + f[~i & ((1 << CH) - 1)]); printf( %d , ans); return 0; } } // namespace zyt int main() { return zyt::work(); }
#include <bits/stdc++.h> using namespace std; const int nax = 2 * (int)1e5 + 10; const int INF = (int)1e9 + 47; vector<int> g[nax]; int n, k; int lvl[nax], tin[nax], tout[nax]; int cnt = 0; int timer = 0; int ver[nax]; int seen[nax]; int par[nax]; int vr[nax]; vector<pair<int, int>> vec; void dfs(int v, int p = -1) { if (p != -1) lvl[v] = lvl[p] + 1; vec.push_back({lvl[v], v}); par[v] = p; if (g[v].size() == 1 && p != -1) cnt++; if (p != -1) lvl[v] = lvl[p] + 1; for (auto to : g[v]) { if (to == p) continue; dfs(to, v); } } long long f(int red, int blue) { int w = n - red - blue; return w * 1ll * (red - blue); } int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n >> k; for (int i = 0; i < n - 1; i++) { int a, b; cin >> a >> b; --a, --b; g[a].push_back(b); g[b].push_back(a); } dfs(0); sort(vec.begin(), vec.end(), greater<pair<int, int>>()); vector<int> vv; for (int i = 0; i < n; i++) { int cur = vec[i].second; int cc = 0; while (cur != -1 && !seen[cur]) { cc++; seen[cur] = 1; cur = par[cur]; } vv.push_back(cc); } sort(vv.begin(), vv.end(), greater<int>()); int blue = n; long long best_ans = -(long long)1e18; for (int i = 0; i < min(k, cnt); i++) { blue -= vv[i]; int l = 0, r = blue; for (int it = 0; it < 40; it++) { int mid = (l + r) / 2; if (f(i + 1, mid + 1) <= f(i + 1, mid)) l = mid; else r = mid; } if ((f(i + 1, r) > f(i + 1, r + 1) && r + 1 < blue) || (f(i + 1, r - 1) < f(i + 1, r) && r - 1 >= 0)) throw 47; best_ans = max(best_ans, f(i + 1, r)); } while (cnt <= k) { best_ans = max(best_ans, (n - cnt) * 1ll * cnt); cnt++; } cout << best_ans << n ; }
#include <bits/stdc++.h> using namespace std; int main() { int T; cin >> T; while (T--) { int n; cin >> n; vector<long long> v; for (int i = 1; i <= n; i++) { int x; cin >> x; v.push_back(x); } sort(v.begin(), v.end()); long long ans = v[0] * v[v.size() - 1]; int sum = 0, flag = 1; for (long long i = 2; i * i <= ans; i++) { if (ans % i == 0) { if (find(v.begin(), v.end(), i) == v.end() || find(v.begin(), v.end(), ans / i) == v.end()) { flag = 0; break; } sum += 2; if (i * i == ans) sum--; } } if (sum == n && flag == 1) cout << ans << endl; else cout << -1 << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e3 + 10; const int INF = 99999999; const double eps = 1e-4; int dp[MAXN]; int main() { int n, m, c0, d0; cin >> n >> m >> c0 >> d0; memset(dp, 0, sizeof(dp)); for (int i = c0; i <= n; i++) dp[i] = i / c0 * d0; for (int i = 1; i <= m; i++) { int a, b, c, d; cin >> a >> b >> c >> d; for (int j = 1; j <= a / b; j++) { for (int k = n; k >= c; k--) dp[k] = max(dp[k - c] + d, dp[k]); } } cout << dp[n] << endl; return 0; }