func_code_string
stringlengths
59
71.4k
#include <bits/stdc++.h> using namespace std; const int N = 5005; int n, m, ans[N]; pair<int, int> p[N]; vector<pair<int, int> > g[N]; void dfs(int v, int pr = -1) { for (auto it : g[v]) { int to = it.first; if (to != pr) { p[to] = make_pair(v, it.second); dfs(to, v); } } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 1; i < n; i++) { int x, y; cin >> x >> y; g[x].push_back(make_pair(y, i)); g[y].push_back(make_pair(x, i)); } cin >> m; vector<pair<int, pair<int, int> > > e; for (int i = 1; i <= m; i++) { int x, y, z; cin >> x >> y >> z; e.push_back(make_pair(z, make_pair(x, y))); } sort(e.begin(), e.end()); for (auto it : e) { int x = it.second.first, y = it.second.second, val = it.first; dfs(x); while (y != x) { ans[p[y].second] = it.first; y = p[y].first; } } for (auto it : e) { int x = it.second.first, y = it.second.second, val = it.first; dfs(x); int mn = 1e9; while (y != x) { mn = min(mn, ans[p[y].second]); y = p[y].first; } if (mn != val) { return cout << -1 , 0; } } for (int i = 1; i < n; i++) { cout << (ans[i] == 0 ? (int)1e6 : ans[i]) << ; } }
#include <bits/stdc++.h> using namespace std; const int N = 1001; char s[N]; bool check(char a, char b) { if (a == b) return true; if (a > b) swap(a, b); if (b - a > 2) return false; if (b - a == 2) return true; if (b - a == 1) return false; } bool solve() { int n; scanf( %d%s , &n, s); for (int i = 0; i < n; i++) if (!check(s[i], s[n - 1 - i])) return false; return true; } int main() { int t; scanf( %d , &t); while (t--) { if (solve()) printf( YES n ); else printf( NO n ); } return 0; }
#include <bits/stdc++.h> using namespace std; long long mod = 1000000007; int main() { int num, dig; scanf( %d%d , &num, &dig); vector<int> a, b; for (int i = 0; i < num / dig; i++) { int z; scanf( %d , &z); a.push_back(z); } for (int i = 0; i < num / dig; i++) { int z; scanf( %d , &z); b.push_back(z); } int t = 1; for (int i = 0; i < dig - 1; i++) t *= 10; long long ret = 1; for (int i = 0; i < num / dig; i++) { long long r = 0; for (int j = 0; j < 10; j++) { if (j != b[i]) { r += (t * (j + 1) + a[i] - 1) / a[i]; r -= (t * j + a[i] - 1) / a[i]; } } ret *= r; ret %= mod; } printf( %I64d n , ret); }
#include <bits/stdc++.h> #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( Ofast , unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; const long long inf = numeric_limits<long long>::max() / 2; const long double eps = 1e-9; const long double pi = acos(-1); template <typename T> inline bool mineq(T& a, T b) { return (a > b) ? (a = b, 1) : 0; } template <typename T> inline bool maxeq(T& a, T b) { return (a < b) ? (a = b, 1) : 0; } inline void solve(), read(); const string file = ; int main() { if (file != ) { freopen((file + .in ).c_str(), r , stdin); freopen((file + .out ).c_str(), w , stdout); } ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); ; read(); solve(); return 0; } const long long R = 998244353; string a, l, r; long long n; vector<long long> dp, suff; vector<long long> zl, zr; void zet(string s, vector<long long>& z) { long long n = (long long)((s).size()); z.assign(n, 0); z[0] = 0; for (long long i = 1, l = 0, r = 0; i < n; i++) { if (i <= r) { z[i] = min(z[i - l], r - i); } while (i + z[i] < n && s[z[i]] == s[i + z[i]]) { ++z[i]; } if (i + z[i] - 1 > r) { r = i + z[i] - 1; l = i; } } } inline void solve() { zet(l + # + a, zl); zet(r + # + a, zr); dp.assign(n + 2, 0); suff.assign(n + 2, 0); long long ans = 0; dp[n] = 1; suff[n] = 1; for (long long i = n - 1; i >= 0; i--) { if (a[i] == 0 ) { if (l == 0 ) { dp[i] = dp[i + 1]; } suff[i] = (dp[i] + suff[i + 1]) % ::R; continue; } long long L = i + (long long)((l).size()); long long R = i + (long long)((r).size()); long long sleft = zl[(long long)((l).size()) + 1 + i]; long long sright = zr[(long long)((r).size()) + 1 + i]; if (sleft != (long long)((l).size())) { if (a[i + sleft] < l[sleft]) { ++L; } } if (sright != (long long)((r).size())) { if (a[i + sright] > r[sright]) { --R; } } if (L <= R && L <= n) { mineq(R, n); dp[i] = (suff[L] - suff[R + 1] + ::R) % ::R; } suff[i] = (dp[i] + suff[i + 1]) % ::R; } cout << dp[0] << n ; } inline void read() { cin >> a >> l >> r; n = (long long)((a).size()); }
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7, MAXN = 4e5 + 10; int dp[MAXN], dp2[MAXN]; int *cur = dp2, *prv = dp; int main() { int r, g; cin >> r >> g; int b = r + g; int n; for (n = 1; n * (n + 1) / 2 <= b; n++) ; n--; cur[0] = 1; for (int i = 1; i <= n; i++) { swap(cur, prv); for (int j = 0; j <= i * (i + 1) / 2; j++) { cur[j] = (prv[j] + (j >= i ? prv[j - i] : 0)) % MOD; } } int ans = 0, sum = n * (n + 1) / 2; for (int i = 0; i <= r; i++) { if (i <= r && sum - i <= g) { ans = (ans + cur[i]) % MOD; } } cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 100; int num; int sa[N], fir[N], sec[N], t[N]; int height[N], L[N], R[N], st[N]; char c[N]; inline long long SA(int len, char s[]) { num = 300; for (int i = 1; i <= num; i++) t[i] = 0; for (int i = 1; i <= len; i++) ++t[fir[i] = s[i]]; for (int i = 1; i <= num; i++) t[i] += t[i - 1]; for (int i = len; i >= 1; i--) sa[t[fir[i]]--] = i; for (int k = 1; k <= len; k <<= 1) { int cnt = 0; for (int i = len - k + 1; i <= len; i++) sec[++cnt] = i; for (int i = 1; i <= len; i++) if (sa[i] > k) sec[++cnt] = sa[i] - k; for (int i = 1; i <= num; i++) t[i] = 0; for (int i = 1; i <= len; i++) ++t[fir[i]]; for (int i = 1; i <= num; i++) t[i] += t[i - 1]; for (int i = len; i >= 1; i--) sa[t[fir[sec[i]]]--] = sec[i], sec[i] = 0; swap(fir, sec); fir[sa[1]] = 1, cnt = 1; for (int i = 2; i <= len; i++) fir[sa[i]] = (sec[sa[i]] == sec[sa[i - 1]] && sec[sa[i] + k] == sec[sa[i - 1] + k]) ? cnt : ++cnt; if (cnt == len) break; num = cnt; } int j, k = 0; for (int i = 1; i <= len; i++) { if (k) k--; int j = sa[fir[i] - 1]; while (i + k <= len && j + k <= len && s[i + k] == s[j + k]) k++; height[fir[i]] = k; } int top = 1; st[top] = 1; for (int i = 2; i <= len; i++) { while (top && height[i] < height[st[top]]) R[st[top--]] = i; L[i] = st[top]; st[++top] = i; } while (top) R[st[top--]] = len + 1; long long ans = 1ll * len * (len + 1) / 2ll; for (int i = 2; i <= len; i++) { ans += 2ll * height[i] * (R[i] - i) * (i - L[i]); } return ans; } int main() { int t; scanf( %d , &t); while (t--) { scanf( %s , c + 1); printf( %lld n , SA(strlen(c + 1), c)); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { map<int, int> m; string s; int n, a; cin >> n >> s; for (int i = 1; i < 10; ++i) { cin >> a; m[i] = a; } for (int i = 0; i < n; ++i) { if (s[i] - 0 < m[s[i] - 0 ]) { while (s[i] - 0 <= m[s[i] - 0 ]) { s[i] = 0 + m[s[i] - 0 ]; ++i; } break; } } cout << s; return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 15000; int d[maxn]; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < m; i++) { int maxx = -1, maxi = 0; int x; for (int j = 1; j <= n; j++) { scanf( %d , &x); if (x > maxx) { maxx = x; maxi = j; } } d[maxi]++; } int ans = 1; for (int i = 1; i <= n; i++) { if (d[i] > d[ans]) { ans = i; } } printf( %d n , ans); return 0; }
#pragma GCC optimize(4) #include<bits/stdc++.h> #define FOR(i,a,b) for(int i=a;i<=b;++i) #define REP(u) for(int i=p[u];i!=-1;i=e[i].nxt) #define ll long long #define rd (rand()<<16^rand()) #define PII pair<int,int> #define pb push_back #define sz(x) (int)(x.size()) #define gc (_p1==_p2&&(_p2=(_p1=_buf)+fread(_buf,1,100000,stdin),_p1==_p2)?EOF:*_p1++) using namespace std; char _buf[100000],*_p1=_buf,*_p2=_buf; inline int gi() { int x=0,f=1;char ch=gc; while(ch> 9 ||ch< 0 ){if(ch== - )f=-1;ch=gc;} while(ch>= 0 &&ch<= 9 ){x=(x<<3)+(x<<1)+(ch^48);ch=gc;} return (f==1)?x:-x; } inline int max(int a,int b){return a>b?a:b;} inline int min(int a,int b){return a<b?a:b;} const int maxn=105; int T,n,m,a[maxn][maxn],sum[maxn*2]; inline void init() { memset(sum,0,sizeof(sum)); } inline void input() { n=gi(),m=gi(); } inline void solve() { FOR(i,1,n)FOR(j,1,m)a[i][j]=gi(); FOR(i,1,n)FOR(j,1,m)sum[i+j]^=a[i][j]; FOR(i,2,n+m)if(sum[i]){printf( Ashish n );return ;} printf( Jeel n ); } int main() { T=gi(); while(T--) { init(); input(); solve(); } return 0; } ///
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int t; cin >> t; int n, x; while (t--) { cin >> n >> x; if (n == 1 || n == 2) cout << 1 << endl; else { if ((n - 2) % x == 0) cout << (n - 2) / x + 1 << endl; else cout << (n - 2) / x + 2 << endl; } } }
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); inline int rand(int x, int y) { ++y; return (rng() % (y - x)) + x; } int n, k, A[300006], dp[35006][56]; vector<pair<int, int> > v; struct node { int second, e, m; int v = 0; node *l, *r; node(int _s, int _e, bool prog) { second = _s, e = _e, m = (second + e) / 2; v = 0; if (second != e && prog) { l = new node(second, m, 1); r = new node(m + 1, e, 1); } else l = NULL, r = NULL; } node *update(int x, int nv) { node *tmp = new node(second, e, 0); if (second == e) { assert(v == 0); tmp->v = v + nv; return tmp; } if (x > m) { tmp->l = l; assert(r != NULL); tmp->r = r->update(x, nv); } else { assert(l != NULL); tmp->l = l->update(x, nv); tmp->r = r; } tmp->v = tmp->l->v + tmp->r->v; return tmp; } int rmq(int x, int y) { if (second == x && e == y) return v; if (x > m) return r->rmq(x, y); else if (y <= m) return l->rmq(x, y); else return l->rmq(x, m) + r->rmq(m + 1, y); } } * seg[35006]; int ubdd(pair<int, int> x) { int st = -1, en = v.size(), mid = 0; while (en - st > 1) { mid = (st + en) >> 1; if (x.first > v[mid].first) en = mid; else st = mid; } return en + 1; } unordered_map<int, int> mp[35006]; int RMQ(int x, int y) { if (mp[y].count(x)) return mp[y][x]; auto itr = ubdd(pair<int, int>(y + 1, -(long long)1e18)) - 1; return mp[y][x] = (itr > 0 ? seg[itr]->rmq(x, y) : 0); set<int> second; for (int i = x; i < y + 1; i++) second.insert(A[i]); return second.size(); } void dnc(int st, int en, int x, int y, int k) { if (st > en) return; int opt_pos = x; int mid = (st + en) / 2; for (int i = min(y, mid); i >= x; i--) { if (dp[mid][k] < dp[i - 1][k - 1] + RMQ(i, mid)) { opt_pos = i; dp[mid][k] = dp[i - 1][k - 1] + RMQ(i, mid); } } if (st < mid) dnc(st, mid - 1, x, opt_pos, k); if (mid < en) dnc(mid + 1, en, opt_pos, y, k); } vector<int> val[35006]; void solve() { for (int i = 1; i < n + 1; i++) { assert(A[i] <= 35000); val[A[i]].push_back(i); } for (int i = 1; i < n + 1; i++) { val[A[i]].push_back(n + 1); } for (int i = 1; i < n + 1; i++) v.push_back(pair<int, int>( *upper_bound((val[A[i]]).begin(), (val[A[i]]).end(), i), i)); sort((v).begin(), (v).end(), greater<pair<int, int> >()); seg[0] = new node(1, n + 1, 1); for (int i = 0; i < v.size(); i++) { seg[i + 1] = seg[i]->update(v[i].second, 1); } return; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n >> k; for (int i = 1; i < n + 1; i++) cin >> A[i]; solve(); unordered_set<int> second; for (int i = 1; i < n + 1; i++) { second.insert(A[i]); dp[i][1] = second.size(); } for (int i = 2; i < k + 1; i++) { dnc(1, n, 1, n, i); } cout << dp[n][k] << n ; }
#include <bits/stdc++.h> namespace io { const char endl = n ; template <typename T> inline void chkmin(T &a, T b) { a > b ? a = b : 0; } template <typename T> inline void chkmax(T &a, T b) { a < b ? a = b : 0; } struct Stream { template <class T> Stream operator>>(T &x) { x = 0; register int f = 1; register char c; while (!isdigit(c = getchar())) if (c == - ) f = -1; while (x = (x << 1) + (x << 3) + (c ^ 48), isdigit(c = getchar())) ; return x *= f, *this; } Stream operator>>(char *str) { return scanf( %s , str), *this; } template <class T> Stream operator<<(T x) { static char out[35]; static unsigned int top = 0; if (x < 0) x = -x, putchar( - ); while (out[++top] = x % 10 ^ 48, x /= 10, x) ; while (putchar(out[top--]), top) ; return *this; } Stream operator<<(char *str) { return printf( %s , str), *this; } Stream operator<<(char ch) { return putchar(ch), *this; } } cin, cout; } // namespace io const int N = 3e5 + 10; int ver[N * 2], nxt[N * 2], head[N], tot, n, m, stk[N], top, L[N]; inline void add(int u, int v) { ver[++tot] = v, nxt[tot] = head[u], head[u] = tot; } bool vis[N], loop[N]; void DFS(int u, int fa) { vis[u] = 1; stk[++top] = u; for (int i = head[u]; i; i = nxt[i]) { int v = ver[i]; if (loop[v] or v == fa) continue; if (!vis[v]) DFS(v, u); else { int Max = 0, Min = n + 1; for (int j = top, y;; j--) { y = stk[j]; io::chkmin(Min, y); io::chkmax(Max, y); loop[y] = 1; if (stk[j] == v) break; } if (!L[Max]) L[Max] = Min; else io::chkmax(L[Max], Min); } } top--; } long long sum[N]; int main() { io::cin >> n >> m; for (register unsigned int i = 1, iend = m; i <= iend; ++i) { int u, v; io::cin >> u >> v; add(u, v), add(v, u); } for (register unsigned int i = 1, iend = n; i <= iend; ++i) if (!vis[i]) DFS(i, i); for (register unsigned int i = 1, iend = n; i <= iend; ++i) { io::chkmax(L[i], L[i - 1]); sum[i] = sum[i - 1] + L[i]; } int Q; io::cin >> Q; while (Q--) { int x, y; io::cin >> x >> y; int l = x, r = y, p = y + 1; long long ans = 0; while (l <= r) { int mid = (l + r) >> 1; if (L[mid] >= x) r = mid - 1, p = mid; else l = mid + 1; } ans = 1ll * (x + y) * (y - x + 1) / 2 - (sum[y] - sum[p - 1]) - 1ll * (x - 1) * (p - x); io::cout << ans << io::endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int INF = 100005; const long long LL_INF = (long long)2e18 + 5; inline int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } const long long mod = 1000000007; bool isprime(long long n) { for (long long i = 2; i * i <= n; ++i) { if (n % i == 0) { return false; } } return true; } long long factorial(long long n) { return (n == 1 || n == 0) ? 1 : n * factorial(n - 1); } long long power(long long x, long long y) { long long res = 1; x = x % mod; while (y > 0) { if (y & 1) res = ((res % mod) * (x % mod)) % mod; y = y >> 1; x = ((x % mod) * (x % mod)) % mod; } return res; } long long ncr(long long n, long long r) { long long res = 1; if (r > n) return 0; if (r > n - r) r = n - r; for (long long i = 0; i < r; i++) { res = ((res % mod) * ((n - i) % mod)) % mod; res = ((res % mod) * (power(i + 1, mod - 2)) % mod) % mod; } return res; } long long gcd(long long a, long long b) { if (a == 0) return b; return gcd(b % a, a); } long long lcm(long long a, long long b) { return (a / gcd(a, b) * b); } long long max(long long a, long long b) { long long sol = a > b ? a : b; return sol; } long long min(long long a, long long b) { long long sol = a < b ? a : b; return sol; } map<long long, long long> mp; inline void solve() { long long n, k; long long a[26] = {0}; cin >> n >> k; string s; cin >> s; char ch; while (k--) { cin >> ch; a[ch - a ]++; } long long prev = -1, r; long long ans = 0; for (int i = 0; i < n; i++) { if (a[s[i] - a ] == 0) { r = i - prev - 1; ans += ((r * (r + 1)) / 2); prev = i; } } r = n - prev - 1; ans += ((r * (r + 1)) / 2); cout << ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; solve(); }
#include <bits/stdc++.h> using namespace std; string p; bool cap = false, l = false, dig = false; char digits[10] = { 0 , 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 }; int main() { cin >> p; int s = p.length(); if (s < 5) { cout << Too weak ; return 0; } for (int i = 0; i < s; i++) { if (isupper(p[i])) cap = true; else if (islower(p[i])) l = true; for (int j = 0; j < 10; j++) if (p[i] == digits[j]) dig = true; } if (cap == true && l == true && dig == true) cout << Correct ; else cout << Too weak ; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; int n1, n2, n3; cin >> n1 >> n2 >> n3; vector<int> v[n + 1]; for (int i = 0; i < m; i++) { int a, b; cin >> a >> b; v[a].push_back(b); v[b].push_back(a); } auto out = []() { cout << NO n ; exit(0); }; if (n2 == 0) { if (m == 0) { cout << YES n ; cout << string(n1, 1 ) + string(n3, 3 ) << n ; exit(0); } else out(); } vector<int> vis(n + 1, 0); vector<vector<int>> one; vector<vector<int>> two; vector<vector<array<int, 2>>> dp(n + 1, vector<array<int, 2>>(n + 1, {0, 0})); dp[0][0] = {-1, 1}; int comp = 0; for (int i = 1; i <= n; i++) { if (vis[i] != 0) continue; comp++; queue<int> q; q.push(i); vis[i] = 1; vector<int> d[3]; vector<int> cnt(3, 0); d[1].push_back(i); cnt[1] = 1; while (!q.empty()) { int x = q.front(); q.pop(); for (int to : v[x]) { if (vis[to] == 0) { q.push(to); vis[to] = 3 - vis[x]; d[vis[to]].push_back(to); cnt[vis[to]]++; } else if (vis[to] == vis[x]) out(); } } one.push_back(d[1]); two.push_back(d[2]); for (int j = 0; j <= n; j++) { if (dp[comp - 1][j][1] == 0) continue; for (int k = 1; k <= 2; k++) if (dp[comp][j + cnt[k]][1] == 0) dp[comp][j + cnt[k]] = {(int)one.size() - 1, k}; } } if (dp[comp][n2][1] == 0) out(); string res(n + 1, 0 ); int c = comp; int now = n2; while (now > 0) { if (dp[c][now][1] == 1) { for (int x : one[dp[c][now][0]]) res[x] = 2 ; now -= one[dp[c][now][0]].size(); } else { for (int x : two[dp[c][now][0]]) res[x] = 2 ; now -= two[dp[c][now][0]].size(); } c--; } for (int i = 1; i <= n; i++) { if (res[i] == 2 ) continue; if (n1 > 0) { res[i] = 1 ; n1--; } else res[i] = 3 ; } cout << YES n ; cout << res.substr(1, n) << n ; return 0; }
#include <bits/stdc++.h> #pragma GCC optimize(2) #pragma GCC optimize(3) using namespace std; inline int read() { int x = 0, neg = 1; char op = getchar(); while (!isdigit(op)) { if (op == - ) neg = -1; op = getchar(); } while (isdigit(op)) { x = 10 * x + op - 0 ; op = getchar(); } return neg * x; } inline void print(int x) { if (x < 0) { putchar( - ); x = -x; } if (x >= 10) print(x / 10); putchar(x % 10 + 0 ); } const int N = 1000005; long long f[N], g[N]; int k, q, mul = 1; void ckmax(long long &a, long long b) { if (a < b) a = b; } void work() { int tmp = k, t = 1, x; x = read(); memset(g, 192, sizeof(g)); for (int v = 0; v < 10; v++) { long long cost = 1ll * mul * v; long long w = v % 3 == 0 ? 1ll * (v / 3) * x : 0; for (int i = 0; i < N - cost; i++) { ckmax(g[i + cost], f[i] + w); } } memcpy(f, g, sizeof(g)); while (tmp > t) { tmp -= t; long long cost = 1ll * mul * t; cost *= 3; long long w = 1ll * x * t; if (cost < N) { for (int i = N - 1; i >= cost; i--) { ckmax(f[i], f[i - cost] + w); } } t <<= 1; } long long cost = 1ll * mul * tmp; cost *= 3; long long w = 1ll * x * tmp; if (cost < N) { for (int i = N - 1; i >= cost; i--) { ckmax(f[i], f[i - cost] + w); } } mul *= 10; } int main() { k = (read() - 1) * 3; memset(f, 192, sizeof(f)), f[0] = 0; for (int i = 1; i <= 6; i++) work(); q = read(); while (q--) { int x = read(); printf( %lld n , f[x]); } return 0; }
#include <bits/stdc++.h> using namespace std; typedef pair<long long, long long> pii; typedef vector<long long> vi; typedef vector<pii> vpii; typedef vector<vi> vvi; double prob[20][20]; double dp[(1 << 19)]; double pmove(long long prev_mask, long long j, long long n) { long long k = __builtin_popcount(prev_mask); long long den = k * (k - 1) / 2; double moveprob = 0; for (long long i = (0); i < (n); i += 1) { if ((1 << i) & prev_mask) { moveprob += prob[i][j]; } } return moveprob / (1.0 * den); } double get_ans(long long mask, long long n) { long long alive = __builtin_popcount(mask); if (alive == n) return 1; if (dp[mask] > -0.9) return dp[mask]; double ans = 0; for (long long i = (0); i < (n); i += 1) { if (!(mask & (1 << i))) { long long prev_mask = mask ^ (1 << i); ans += get_ans(prev_mask, n) * pmove(prev_mask, i, n); } } return dp[mask] = ans; } void solve() { long long n; cin >> n; memset(dp, -1, sizeof dp); for (long long i = (0); i < (n); i += 1) for (long long j = (0); j < (n); j += 1) cin >> prob[i][j]; for (long long i = (0); i < (n); i += 1) { printf( %.6lf , get_ans((1 << i), n)); } } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t = 1; while (t--) { solve(); } }
#include <bits/stdc++.h> using namespace std; const int oo = 1e9; int n, q; int a[400005]; struct rmq { int tree[1050000], lim; void init(int n) { memset(tree, 0, sizeof(tree)); for (lim = 1; lim <= n; lim <<= 1) ; } void add(int x, int v) { x += lim; tree[x] = max(tree[x], v); while (x > 1) { x >>= 1; tree[x] = max(tree[2 * x], tree[2 * x + 1]); } } int query(int s, int e) { s += lim; e += lim; int ret = 0; while (s < e) { if (s % 2 == 1) ret = max(ret, tree[s++]); if (e % 2 == 0) ret = max(ret, tree[e--]); s >>= 1; e >>= 1; } if (s == e) ret = max(ret, tree[s]); return ret; } } rmq; int dpl[400005], dpr[400005], lis; int cnt[400005]; bool check_indep(int x) { return cnt[dpr[x]] != 1 || dpl[x] + dpr[x] != lis + 1; } int is_indep[400005]; int aux[400005], ret[400005]; struct query { int x, y, idx; bool operator<(const query &q) const { return x < q.x; } }; int main() { scanf( %d %d , &n, &q); vector<int> v; for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); v.push_back(a[i]); } sort(v.begin(), v.end()); v.resize(unique(v.begin(), v.end()) - v.begin()); for (int i = 1; i <= n; i++) { a[i] = lower_bound(v.begin(), v.end(), a[i]) - v.begin() + 1; } rmq.init(n); for (int i = 1; i <= n; i++) { dpl[i] = rmq.query(1, a[i] - 1) + 1; rmq.add(a[i], dpl[i]); } rmq.init(n); for (int i = n; i; i--) { dpr[i] = rmq.query(a[i] + 1, n) + 1; rmq.add(a[i], dpr[i]); } for (int i = 1; i <= n; i++) { lis = max(lis, dpl[i]); } for (int i = 1; i <= n; i++) { if (dpl[i] + dpr[i] == lis + 1) { cnt[dpr[i]]++; } } for (int i = 1; i <= n; i++) { is_indep[i] = check_indep(i); } vector<query> qr; for (int i = 0; i < q; i++) { int x, y; scanf( %d %d , &x, &y); if (is_indep[x]) { ret[i] = lis; } else ret[i] = lis - 1; qr.push_back({x, y, i}); } sort(qr.begin(), qr.end()); rmq.init(n); int pnt = 1; for (int i = 0; i < q; i++) { while (pnt <= n && pnt < qr[i].x) { rmq.add(a[pnt], dpl[pnt]); pnt++; } int sy = lower_bound(v.begin(), v.end(), qr[i].y) - v.begin(); aux[qr[i].idx] += rmq.query(1, sy); } pnt = n; rmq.init(n); for (int i = q - 1; i >= 0; i--) { while (pnt && pnt > qr[i].x) { rmq.add(a[pnt], dpr[pnt]); pnt--; } int ey = upper_bound(v.begin(), v.end(), qr[i].y) - v.begin() + 1; aux[qr[i].idx] += rmq.query(ey, n); } for (int i = 0; i < q; i++) { ret[i] = max(ret[i], aux[i] + 1); printf( %d n , ret[i]); } }
#include <bits/stdc++.h> using namespace std; const int n0 = 1 << 17; const long long inf = 1e18; int n, a[n0], q; long long d[n0], gaps; struct Node { int l = 0, r = 0; long long val[3]; Node() { val[0] = val[1] = val[2] = -inf; } void init(int pos) { l = r = pos; if (l < 2 || l > n - 1) { val[0] = val[1] = val[2] = -inf; return; } long long d1 = d[l - 1], d2 = d[l]; long long t = -abs(d1) - abs(d2); val[0] = d1 - d2 + t; val[1] = max(d1 + d2, -d1 - d2) + t; val[2] = -d1 + d2 + t; } void merge(Node &x, Node &y) { if (!x.l) { x = y; return; } l = x.l, r = y.r; for (int i = 0; i < 3; i++) val[i] = max(x.val[i], y.val[i]); } long long get(long long x) { return max({-2 * x + val[0], val[1], 2 * x + val[2]}); } }; struct Segtree { Node t[n0 << 1]; void build() { for (int i = (n0 << 1) - 1; i > 0; i--) { if (i >= n0) t[i].init(i - n0); else t[i].merge(t[i << 1], t[i << 1 | 1]); } } void upd(int x) { t[x + n0].init(x); for (x += n0; x > 1; x /= 2) t[x >> 1].merge(t[x], t[x ^ 1]); } Node get(int l, int r) { r++; Node res; for (l += n0, r += n0; l < r; l /= 2, r /= 2) { if (l & 1) res.merge(res, t[l++]); if (r & 1) res.merge(res, t[--r]); } return res; } }; Segtree st; void upd(int x, int y) { gaps -= abs(d[x]); d[x] += y; gaps += abs(d[x]); st.upd(x), st.upd(x + 1); } long long get(int l, int r, long long x) { long long res = st.get(l, r).get(x); if (l == 1) res = max(res, abs(d[1] + x) - abs(d[1])); if (r == n) res = max(res, abs(d[n - 1] - x) - abs(d[n - 1])); return gaps + res; } int main() { ios_base::sync_with_stdio(0), cin.tie(0); cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n - 1; i++) d[i] = a[i] - a[i + 1], gaps += abs(d[i]); st.build(); cin >> q; while (q--) { int t, l, r, x; cin >> t >> l >> r >> x; if (t == 1) { cout << get(l, r, x) << n ; } else { upd(l - 1, -x), upd(r, x); } } }
#include <bits/stdc++.h> using namespace std; const long double eps = 1e-7; const int inf = 1000000010; const int mod = 1000000007; const int MAXN = 1010; int n, m, t, x, y, xx, yy, ans, v, u, q, a, b, c, cnt; string A[MAXN]; int dist[MAXN][MAXN]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> A[i]; A[i] = . + A[i]; for (int j = 1; j <= m; j++) { if (A[i][j] == S ) { xx = i; yy = j; } if (A[i][j] == E ) { x = i; y = j; } } } queue<pair<int, int> > q; q.push({x, y}); memset(dist, 63, sizeof(dist)); dist[x][y] = 0; while (!q.empty()) { int x = q.front().first, y = q.front().second; q.pop(); if (dist[x][y] > dist[xx][yy]) break; if (x < 1 || y < 1 || x > n || y > m || A[x][y] == T ) continue; if (dist[x][y] + 1 < dist[x + 1][y]) { dist[x + 1][y] = dist[x][y] + 1; q.push({x + 1, y}); } if (dist[x][y] + 1 < dist[x][y + 1]) { dist[x][y + 1] = dist[x][y] + 1; q.push({x, y + 1}); } if (dist[x][y] + 1 < dist[x - 1][y]) { dist[x - 1][y] = dist[x][y] + 1; q.push({x - 1, y}); } if (dist[x][y] + 1 < dist[x][y - 1]) { dist[x][y - 1] = dist[x][y] + 1; q.push({x, y - 1}); } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (A[i][j] == S || A[i][j] == E || A[i][j] == T ) continue; if (dist[i][j] <= dist[xx][yy]) ans += A[i][j] - 0 ; } } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int maxt = 1000000, maxn = maxt + 7; int h[7][7]; char s[5][maxn]; void output(int n) { for (int i = 1; i <= 4; i++) { for (int j = 1; j <= n; j++) printf( %c , s[i][j]); puts( ); } } bool DoIt_2(int I, int n, int tot) { for (int i = 1; i <= n; i++) if (s[2][i] != s[I][i]) tot--; if (tot < 0) return false; if (tot == 0) return true; if (tot % 2 == 1) return false; vector<int> A, B; A.clear(), B.clear(); for (int i = 1; i <= n; i++) if (s[2][i] == s[I][i]) { if (s[2][i] == a ) A.push_back(i); if (s[2][i] == b ) B.push_back(i); } for (int i = 0; i < min(A.size(), B.size()); i++) { int x = A[i], y = B[i]; tot -= 2; swap(s[I][x], s[I][y]); if (tot == 0) return true; } return false; } bool DoIt_3(int I, int n, int tot) { for (int i = 1; i <= n; i++) if (s[3][i] != s[I][i]) tot--; if (tot < 0) return false; if (tot == 0) return true; if (tot % 2 == 1) return false; vector<int> AA, AB, BA, BB; AA.clear(), AB.clear(), BA.clear(), BB.clear(); for (int i = 1; i <= n; i++) if (s[3][i] == s[I][i]) { if (s[2][i] == a && s[3][i] == a ) AA.push_back(i); if (s[2][i] == a && s[3][i] == b ) AB.push_back(i); if (s[2][i] == b && s[3][i] == a ) BA.push_back(i); if (s[2][i] == b && s[3][i] == b ) BB.push_back(i); } for (int i = 0; i < min(AA.size(), AB.size()); i++) { int x = AA[i], y = AB[i]; tot -= 2; swap(s[I][x], s[I][y]); if (tot == 0) return true; } for (int i = 0; i < min(BA.size(), BB.size()); i++) { int x = BA[i], y = BB[i]; tot -= 2; swap(s[I][x], s[I][y]); if (tot == 0) return true; } return false; } bool check(int n) { for (int i = 1; i <= 4; i++) for (int j = 1; j <= n; j++) s[i][j] = a ; for (int i = 2; i <= 4; i++) for (int j = 1; j <= h[1][i]; j++) s[i][j] = b ; for (int i = 3; i <= 4; i++) if (!DoIt_2(i, n, h[2][i])) return false; if (!DoIt_3(4, n, h[3][4])) return false; return true; } int main() { for (int i = 1; i <= 4; i++) for (int j = i + 1; j <= 4; j++) scanf( %d , &h[i][j]); int head = 1, tail = maxt; while (head <= tail) { int mid = (head + tail) / 2; if (check(mid)) tail = mid - 1; else head = mid + 1; } int n = tail + 1; if (n > maxt) { puts( -1 ); return 0; } printf( %d n , n); check(n); output(n); }
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e6 + 5; map<pair<int, long long>, bool> vis; map<pair<int, long long>, int> memo; int grundy(int x, long long mask) { for (int i = 61; i > x; i--) { if ((mask >> i) & 1) mask ^= (1ll << i); } if (vis[{x, mask}]) return memo[{x, mask}]; vis[{x, mask}] = 1; set<int> s; for (int i = 1; i <= x; i++) { if ((mask >> i) & 1) { s.insert(grundy(x - i, mask ^ (1ll << i))); } } int res = 0; while (s.find(res) != s.end()) res++; return memo[{x, mask}] = res; } int n; int s[MAXN]; int main() { scanf( %d , &n); int res = 0; for (int i = 1; i <= n; i++) { scanf( %d , s + i); res ^= grundy(s[i], (1ll << 61) - 1); } if (res) puts( NO ); else puts( YES ); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; int div[] = {1, 2, 3, 4, 6, 12}; while (t--) { string s; cin >> s; vector<pair<int, int> > dimen; int n, m; int i, j, k; for (k = 0; k < 6; k++) { n = div[k]; m = 12 / n; for (j = 0; j < m; j++) { for (i = 0; i < n; i++) { if (s[i * m + j] != X ) break; } if (i == n) { dimen.push_back(make_pair(n, m)); break; } } } cout << dimen.size() << ; for (int i = 0; i < dimen.size(); i++) cout << dimen[i].first << x << dimen[i].second << ; cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; string gen[100]; string merge(string s1, string s2) { int e = s1.size() - 1; for (int i = 0; i < s2.size(); i++) { if (s1[0] == s2[i]) { int k = s2.size() - i; if (k <= s1.size()) { s1.erase(0, k); return s2 + s1; } return s2; } if (s1[e] == s2[i]) { if (e - i >= 0) { s1.erase(e - i, i + 1); return s1 + s2; } return s2; } } return 0 ; } int main() { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> gen[i]; } bool f = true; for (int k = 0; k < n; k++) { f = true; while (f && gen[k] != ) { f = false; for (int i = k + 1; i < n; i++) { if (gen[i] != ) { string s; if (gen[i].length() < gen[k].length()) { s = merge(gen[i], gen[k]); } else { s = merge(gen[k], gen[i]); } if (s != 0 ) { gen[k] = s; gen[i] = ; f = true; break; } } } } } string s3; for (int i = 0; i < n; i++) { s3 += gen[i]; } cout << s3; return 0; }
#include <bits/stdc++.h> using namespace std; map<long long, long long> frequency(vector<long long> v) { map<long long, long long> m; for (long long i = 0; i < v.size(); i++) { if (m.find(v[i]) != m.end()) m[v[i]]++; else { m.insert({v[i], 1}); } } return m; } void input(vector<long long>& v, long long n) { for (long long i = 0; i < (long long)(n); i++) { long long in; cin >> in; v.push_back(in); } } void output(vector<long long> v) { for (long long i = 0; i < (long long)(v.size()); i++) cout << v[i] << ; } void solve() { long long a, b, c, d; cin >> a >> b >> c >> d; long long m = max((3 * a) / 10, a - (a / 250) * c); long long v = max((3 * b) / 10, b - (b / 250) * d); if (m > v) { cout << Misha << endl; } else if (v > m) { cout << Vasya << endl; } else { cout << Tie << endl; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, i, m, x, s = 0; cin >> n >> m; for (i = 1; i <= n; i++) { cin >> x; s += x; } if (s == m) cout << YES ; else cout << NO ; cout << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; const long long bl_size = 320; int n, m; long long k; long long res; long long a[100005]; unordered_map<long long, long long> cnt; struct Query { int l, r, id; bool operator<(Query other) const { if (l / bl_size != other.l / bl_size) return l < other.l; else return (l / bl_size & 1) ? (r < other.r) : (r > other.r); } }; void add(long long x) { long long y = x ^ k; res += cnt[y]; cnt[x]++; } void rem(long long x) { long long y = x ^ k; if (y != x) res -= (cnt[y]); else res -= (cnt[y] - 1); cnt[x]--; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); scanf( %d%d%d , &n, &m, &k); long long prev[n + 10]; prev[0] = 0; for (int i = 1; i <= n; i++) scanf( %d , &a[i]), prev[i] = prev[i - 1] ^ a[i]; Query q[100005]; for (int i = 1; i <= m; i++) { scanf( %d%d , &q[i].l, &q[i].r); q[i].l--; q[i].id = i; } sort(q + 1, q + n + 1); res = 0; long long ans[m + 10]; int cur_l = 0, cur_r = -1; for (int i = 1; i <= m; i++) { while (cur_l > q[i].l) { cur_l--; add(prev[cur_l]); } while (cur_l < q[i].l) { rem(prev[cur_l]); cur_l++; } while (cur_r > q[i].r) { rem(prev[cur_r]); cur_r--; } while (cur_r < q[i].r) { cur_r++; add(prev[cur_r]); } ans[q[i].id] = res; } for (int i = 1; i <= m; i++) cout << ans[i] << endl; }
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int N = 1e5 + 10; const int LG = 20; int power(int a, int b) { int res = 1; while (b > 0) { if (b & 1) { res = 1LL * res * a % mod; } a = 1LL * a * a % mod; b >>= 1; } return res; } int seg[4 * N], lazy[4 * N]; void update(int node, int start, int end, int l, int r, int val) { if (lazy[node]) { seg[node] += lazy[node]; if (start != end) { lazy[node << 1] += lazy[node]; lazy[node << 1 | 1] += lazy[node]; } lazy[node] = 0; } if (start > end || r < start || end < l) return; if (l <= start && end <= r) { seg[node] += val; if (start != end) { lazy[node << 1] += val; lazy[node << 1 | 1] += val; } return; } int mid = (start + end) >> 1; update(node << 1, start, mid, l, r, val); update(node << 1 | 1, mid + 1, end, l, r, val); seg[node] = min(seg[node << 1], seg[node << 1 | 1]); } int query(int node, int start, int end, int l, int r) { if (lazy[node]) { seg[node] += lazy[node]; if (start != end) { lazy[node << 1] += lazy[node]; lazy[node << 1 | 1] += lazy[node]; } lazy[node] = 0; } if (start > end || r < start || end < l) return 1e9; if (l <= start && end <= r) { return seg[node]; } int mid = (start + end) >> 1; return min(query(node << 1, start, mid, l, r), query(node << 1 | 1, mid + 1, end, l, r)); } int main() { int n, m, a[N], ans = 0, idx = 0; vector<pair<int, int> > lft[N], rght[N]; scanf( %d %d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); update(1, 1, n, i, i, a[i]); } for (int i = 1; i <= m; i++) { int l, r; scanf( %d %d , &l, &r); lft[r].push_back({l, i}); rght[l].push_back({r, i}); } for (int i = 1; i <= n; i++) { int val = a[i] - query(1, 1, n, 1, i - 1); if (val > ans) { idx = i; ans = val; } for (auto l : lft[i]) { update(1, 1, n, l.first, i, -1); } } memset(seg, 0, sizeof(seg)); memset(lazy, 0, sizeof(lazy)); for (int i = 1; i <= n; i++) { update(1, 1, n, i, i, a[i]); } for (int i = n; i >= 1; i--) { int val = a[i] - query(1, 1, n, i + 1, n); if (val > ans) { idx = -i; ans = val; } for (auto r : rght[i]) { update(1, 1, n, i, r.first, -1); } } printf( %d n , ans); vector<int> res; if (idx > 0) { for (int i = 1; i < idx; i++) { for (auto j : lft[i]) { res.push_back(j.second); } } } else if (idx < 0) { for (int i = n; i > abs(idx); i--) { for (auto j : rght[i]) { res.push_back(j.second); } } } printf( %d n , res.size()); for (int pp : res) { printf( %d , pp); } return 0; }
#include <bits/stdc++.h> const int MAXN = 1e5 * 5; const int INF = 1e9 + 7; using namespace std; long long f[501][501]; long long a[501][501]; int n, p[501]; long long ans[501]; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) cin >> a[i][j]; for (int i = 1; i <= n; i++) cin >> p[i]; for (int t = n; t >= 1; --t) { int u = p[t]; long long res = 0; for (int i = t + 1; i <= n; i++) { int x = p[i]; f[u][x] = a[u][x]; f[x][u] = a[x][u]; for (int j = t + 1; j <= n; j++) if (i != j) { int y = p[j]; f[u][x] = min(f[u][x], a[u][y] + f[y][x]); f[x][u] = min(f[x][u], f[x][y] + a[y][u]); } } for (int i = t + 1; i <= n; i++) for (int j = t + 1; j <= n; j++) { int x = p[i], y = p[j]; f[x][y] = min(f[x][y], f[x][u] + f[u][y]); } for (int i = t; i <= n; i++) for (int j = t; j <= n; j++) res += f[p[i]][p[j]]; ans[t] = res; } for (int i = 1; i <= n; i++) cout << ans[i] << ; return 0; }
#include <bits/stdc++.h> using namespace std; const int mn = 100010; long long x[mn], y[mn]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %lld %lld , &x[i], &y[i]); if (n <= 4) { printf( YES n ); return 0; } bool flag = 0; for (int i = 1; i <= 2; i++) { for (int j = i + 1; j <= 3; j++) { long long a = y[j] - y[i]; long long b = x[i] - x[j]; long long c = y[i] * x[j] - y[j] * x[i]; long long xa, ya, xb, yb; int t = 0; int k = 1; for (k = 1; k <= n; k++) { if (a * x[k] + b * y[k] + c == 0) continue; else { t++; if (t == 1) xa = x[k], ya = y[k]; else if (t == 2) xb = x[k], yb = y[k]; else break; } } if (t <= 2) { flag = 1; break; } long long ta = yb - ya; long long tb = xa - xb; long long tc = ya * xb - yb * xa; bool q = 0; for (int p = k; p <= n; p++) { if ((a * x[p] + b * y[p] + c == 0) || ta * x[p] + tb * y[p] + tc == 0) continue; else q = 1; if (q) break; } if (!q) { flag = 1; break; } } if (flag) break; } if (!flag) printf( NO n ); else printf( YES n ); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 100005; vector<int> divs[N]; vector<int> mult[N]; int mu[N], a[N], n; int cnt[N]; long long res = 0; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); mu[1] = 1; for (int i = 1; i < N; i++) { divs[i].push_back(i); for (int j = 2 * i; j < N; j += i) { divs[j].push_back(i); mu[j] -= mu[i]; } } cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; for (int e : divs[a[i]]) mult[e].push_back(a[i] / e); } for (int i = 1; i < N; i++) { sort(mult[i].begin(), mult[i].end(), [](int first, int second) { return first > second; }); stack<int> st; for (int e : mult[i]) { int ans = 0; for (int div : divs[e]) { ans -= mu[div] * cnt[div]; } while (ans != 0) { int u = st.top(); st.pop(); for (int div : divs[u]) { cnt[div]--; if (e % div == 0) ans += mu[div]; } if (ans == 0) res = max(res, 1LL * i * e * u); } st.push(e); for (int div : divs[e]) cnt[div]++; } for (int e : mult[i]) { for (int div : divs[e]) cnt[div] = 0; } } cout << res; return 0; }
#include <bits/stdc++.h> const double PI = acos(-1.0); int main() { double n, r; scanf( %lf%lf , &n, &r); double p1 = PI / n, p2 = PI / (2 * n), p3 = PI - p1 - p2; double l3 = r, l2 = l3 / sin(p3) * sin(p2); double s = l3 * l2 * sin(p1); printf( %.15f n , n * s); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, k; int tas[101], cal[101]; int dp1[10001], dp2[10001]; int w1[101][3], w2[101][3]; while ((cin >> n >> k)) { int s = 0, t = 0; int sum1 = 0, sum2 = 0, sum = 0; for (int i = 1; i <= n; ++i) cin >> tas[i]; for (int j = 1; j <= n; ++j) cin >> cal[j]; for (int i = 1; i <= n; ++i) { int data; data = tas[i] - k * cal[i]; if (data > 0) { w1[++s][1] = data; w1[s][2] = tas[i]; sum1 += data; } else if (data < 0) { data = -data; w2[++t][1] = data; w2[t][2] = tas[i]; sum2 += data; } else sum += tas[i]; } int max = sum1 <= sum2 ? sum1 : sum2; int temp = 0; for (int i = 1; i <= max; ++i) { memset(dp1, -10000000, sizeof(dp1)); memset(dp2, -10000000, sizeof(dp2)); dp1[0] = dp2[0] = 0; for (int j = 1; j <= s; ++j) { for (int v = i; v >= w1[j][1]; --v) { if (dp1[v] < dp1[v - w1[j][1]] + w1[j][2]) dp1[v] = dp1[v - w1[j][1]] + w1[j][2]; } } for (int j = 1; j <= t; ++j) { for (int v = i; v >= w2[j][1]; --v) { if (dp2[v] < dp2[v - w2[j][1]] + w2[j][2]) dp2[v] = dp2[v - w2[j][1]] + w2[j][2]; } } if (dp1[i] > 0 && dp2[i] > 0) { if (dp1[i] + dp2[i] > temp) temp = dp1[i] + dp2[i]; } } sum += temp; if (sum == 0) cout << -1 << endl; else cout << sum << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long n, m, k, t, mx; cin >> t; while (t--) { cin >> n >> m >> k; mx = min(n / k, m); cout << (m >= mx ? mx - ceil((long double)(m - mx) / (k - 1)) : mx) << n ; } }
#include <bits/stdc++.h> using namespace std; string s = FESTIVAL ; long long dp[1010][10]; int a[1010]; int main(void) { int i, j, k; dp[0][0] = 1; for ((i) = 0; (i) < (int)(1000); (i)++) for ((j) = 0; (j) < (int)(8); (j)++) for ((k) = 0; (k) < (int)(8); (k)++) if (j <= k) dp[i + 1][k] = min(dp[i + 1][k] + dp[i][j], (1ll << 60)); long long K; cin >> K; for (i = 25; i >= 1; i--) { a[i] = K / dp[i][7]; K %= dp[i][7]; } string s; for ((i) = 0; (i) < (int)(25); (i)++) { s += FESTIVA ; for ((j) = 0; (j) < (int)(a[i + 1]); (j)++) s += L ; } cout << s << << FESTIVAL << endl; return 0; }
#include <bits/stdc++.h> using namespace std; inline long long read() { long long x = 0, f = 1; char c = getchar(); while (!isdigit(c)) { if (c == - ) f = -1; c = getchar(); } while (isdigit(c)) { x = x * 10 + c - 0 , c = getchar(); } return x * f; } const int MAXN = 1e5 + 10; const long long INF = 3e18; int n; long long x[MAXN], y[MAXN], z[MAXN], foo, bar, baz; inline void Min(long long &x, long long y) { if (x > y) x = y; } inline void Max(long long &x, long long y) { if (x < y) x = y; } inline bool check(long long mid) { static long long L[5], R[5]; for (int i = 1; i <= 4; i++) L[i] = -INF, R[i] = INF; for (int i = 1; i <= n; i++) { long long A = x[i], B = y[i], C = z[i]; Max(L[1], A + B + C - mid); Min(R[1], A + B + C + mid); Max(L[2], -A + B + C - mid); Min(R[2], -A + B + C + mid); Max(L[3], A - B + C - mid); Min(R[3], A - B + C + mid); Max(L[4], A + B - C - mid); Min(R[4], A + B - C + mid); } for (int i = 0; i < 2; i++) { static long long l[5], r[5]; for (int j = 1; j <= 4; j++) l[j] = ((L[j] & 1) == i) ? L[j] : L[j] + 1, r[j] = ((R[j] & 1) == i) ? R[j] : R[j] - 1; long long low = l[2] + l[3] + l[4]; long long high = r[2] + r[3] + r[4]; for (int j = 1; j <= 4; j++) if (l[j] > r[j]) goto finish; if (low > r[1] || high < l[1]) goto finish; l[1] -= low, r[1] -= low; if (l[1] <= 0) { foo = l[2]; bar = l[3]; baz = l[4]; return 1; } for (int j = 2; j <= 4; j++) r[j] -= l[j]; if (l[1] <= r[2]) { foo = l[2] + l[1]; bar = l[3]; baz = l[4]; return 1; } l[1] -= r[2]; if (l[1] <= r[3]) { foo = l[2] + r[2]; bar = l[3] + l[1]; baz = l[4]; return 1; } l[1] -= r[3]; if (l[1] <= r[4]) { foo = l[2] + r[2]; bar = l[3] + r[3]; baz = l[4] + l[1]; return 1; } finish:; } return 0; } int main() { int t = read(); while (t--) { n = read(); for (int i = 1; i <= n; i++) x[i] = read(), y[i] = read(), z[i] = read(); long long l = 0, r = 3e18, ans = -1; while (l <= r) { long long mid = (l + r) >> 1; if (check(mid)) r = mid - 1, ans = mid; else l = mid + 1; } assert(ans != -1); printf( %lld %lld %lld n , (bar + baz) / 2, (foo + baz) / 2, (foo + bar) / 2); } return 0; }
#include <bits/stdc++.h> using namespace std; const long long inf(101010101010101010LL); int n; struct uf { int par[1005]; uf() { for (int i(0); i < (n); i++) par[i] = i; } int ff(int x) { return par[x] == x ? x : par[x] = ff(par[x]); } void uu(int x, int y) { x = ff(x), y = ff(y); if (x - y) par[x] = y; } }; vector<pair<int, int> > edges; vector<int> eA, eB; char col[20]; int main() { cin >> n; int m; cin >> m; edges.resize(m); uf fA, fB; for (int id(0); id < (m); id++) { int x, y; scanf( %d%d%s , &x, &y, col); x--, y--; edges[id] = make_pair(x, y); if (col[0] == S ) { if (fA.ff(x) == fA.ff(y)) continue; eA.push_back(id), fA.uu(x, y); } else { if (fB.ff(x) == fB.ff(y)) continue; eB.push_back(id), fB.uu(x, y); } } uf fAB_1; for (__typeof((eA).end()) it((eA).begin()); it != (eA).end(); ++it) { int id(*it), x(edges[id].first), y(edges[id].second); fAB_1.uu(x, y); } vector<int> eB_selected; for (__typeof((eB).end()) it((eB).begin()); it != (eB).end(); ++it) { int id(*it), x(edges[id].first), y(edges[id].second); if (fAB_1.ff(x) != fAB_1.ff(y)) { eB_selected.push_back(id); fAB_1.uu(x, y); } } uf fAB_2; int nA(0), nB(((int)(eB_selected).size())); for (__typeof((eB_selected).end()) it((eB_selected).begin()); it != (eB_selected).end(); ++it) { int id(*it), x(edges[id].first), y(edges[id].second); fAB_2.uu(x, y); } for (__typeof((eB).end()) it((eB).begin()); it != (eB).end(); ++it) if (nB < (n - 1) / 2) { int id(*it), x(edges[id].first), y(edges[id].second); if (fAB_2.ff(x) != fAB_2.ff(y)) { eB_selected.push_back(id); fAB_2.uu(x, y); nB++; } } vector<int> eA_selected; for (__typeof((eA).end()) it((eA).begin()); it != (eA).end(); ++it) { int id(*it), x(edges[id].first), y(edges[id].second); if (fAB_2.ff(x) != fAB_2.ff(y)) { eA_selected.push_back(id); fAB_2.uu(x, y); nA++; } } if (nA != (n - 1) / 2 || nB != (n - 1) / 2) { puts( -1 ); return 0; } cout << (n - 1) << endl; vector<int> selected; for (__typeof((eA_selected).end()) it((eA_selected).begin()); it != (eA_selected).end(); ++it) selected.push_back(*it); for (__typeof((eB_selected).end()) it((eB_selected).begin()); it != (eB_selected).end(); ++it) selected.push_back(*it); for (__typeof((selected).end()) it((selected).begin()); it != (selected).end(); ++it) { if (it != (selected).begin()) cout << ; cout << (*it) + 1; } cout << endl; }
#include <bits/stdc++.h> using namespace std; class SegmentTree { private: vector<long long> tree; vector<long long> lazy; vector<long long> num; long long build(long long ind, long long l, long long r) { if (l == r) { tree[ind] = num[l]; return tree[ind]; } tree[ind] = min(build(2 * ind, l, (l + r) / 2), build(2 * ind + 1, (l + r) / 2 + 1, r)); return tree[ind]; } long long rngq(long long ind, long long l, long long r, long long ql, long long qr) { if (lazy[ind] != 0) { tree[ind] += lazy[ind]; if (l != r) { lazy[2 * ind + 1] += lazy[ind]; lazy[2 * ind] += lazy[ind]; } lazy[ind] = 0; } if (ql > r || qr < l) return (long long)1e18; if (ql <= l && qr >= r) { return tree[ind]; } return min(rngq(2 * ind, l, (l + r) / 2, ql, qr), rngq(2 * ind + 1, (l + r) / 2 + 1, r, ql, qr)); } long long update(long long ind, long long l, long long r, long long ql, long long qr, long long val) { if (lazy[ind] != 0) { tree[ind] += lazy[ind]; if (l != r) { lazy[2 * ind + 1] += lazy[ind]; lazy[2 * ind] += lazy[ind]; } lazy[ind] = 0; } if (ql > r || qr < l) return tree[ind]; if (ql <= l && qr >= r) { tree[ind] += val; if (l != r) { lazy[2 * ind + 1] += val; lazy[2 * ind] += val; } return tree[ind]; } return tree[ind] = min(update(2 * ind, l, (l + r) / 2, ql, qr, val), update(2 * ind + 1, (l + r) / 2 + 1, r, ql, qr, val)); } public: void buildTree(vector<long long> arr) { long long n = arr.size(); tree.resize(4 * n); lazy.resize(4 * n, 0); num = arr; build(1, 0, n - 1); } long long query(long long l, long long r) { return rngq(1, 0, num.size() - 1, l, r); } void rngup(long long l, long long r, long long val) { update(1, 0, num.size() - 1, l, r, val); } }; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n; cin >> n; vector<long long> arr(n); for (int i = 0; i < n; i++) cin >> arr[i]; SegmentTree segtree; segtree.buildTree(arr); long long q; cin >> q; while (q--) { long long l, r; cin >> l >> r; if (cin.peek() == n ) { if (r < l) { cout << min(segtree.query(l, n - 1), segtree.query(0, r)) << endl; } else cout << segtree.query(l, r) << endl; } else { long long val; cin >> val; if (r < l) { segtree.rngup(l, n - 1, val); segtree.rngup(0, r, val); } else segtree.rngup(l, r, val); } } return 0; }
#include <bits/stdc++.h> using namespace std; int n, m; pair<int, int> t[500050]; bitset<2020> P[2020], B[2020]; void solve() { scanf( %d%d , &n, &m); for (int i = 0; i < m; i++) { int x, y; scanf( %d%d , &x, &y); t[i] = pair<int, int>(x, y); P[x][y] = 1; } for (int i = 1; i <= n; i++) B[i][i] = 1; for (int i = 1; i <= n; i++) { int f = -1; for (int j = i; j <= n; j++) if (P[j].test(i)) { f = j; break; } swap(P[f], P[i]); swap(B[f], B[i]); for (int j = 1; j <= n; j++) if (i != j && P[j][i]) { P[j] ^= P[i]; B[j] ^= B[i]; } } for (int i = 0; i < m; i++) { if (B[t[i].second][t[i].first]) puts( NO ); else puts( YES ); } } int main() { int Tc = 1; for (int tc = 1; tc <= Tc; tc++) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; const int M = 1000000007; const int N = 100003; int ld[N]; int a[N]; void sieve() { for (int i = 2; i * i < N; ++i) if (ld[i] == 0) for (int j = i * i; j < N; j += i) if (ld[j] == 0) ld[j] = i; for (int i = 2; i < N; ++i) if (ld[i] == 0) ld[i] = i; } vector<int> p; vector<int> k; vector<int> d; void genDivisors(int i, int x) { if (i == (int)p.size()) { d.push_back(x); return; } for (int c = 0; c <= k[i]; ++c) { genDivisors(i + 1, x); x *= p[i]; } } int expMod(int a, int n) { int res = 1; while (n > 0) { if (n & 1) res = (long long)res * a % M; n >>= 1; a = (long long)a * a % M; } return res; } int main() { sieve(); int n; scanf( %d , &n); for (int i = 0; i < n; ++i) scanf( %d , a + i); sort(a, a + n); int res = 0; for (int x = 1; x <= a[n - 1]; ++x) { p.clear(); k.clear(); d.clear(); int y = x; while (y > 1) { int z = ld[y]; p.push_back(ld[y]); k.push_back(1); y /= z; while (y % z == 0) { y /= z; ++k.back(); } } genDivisors(0, 1); sort(d.begin(), d.end()); k.clear(); k.resize(d.size()); for (int i = 0; i < (int)d.size(); ++i) k[i] = n - (lower_bound(a, a + n, d[i]) - a); y = 1; for (int i = 0; i < (int)d.size() - 1; ++i) { k[i] -= k[i + 1]; y = (long long)y * expMod(i + 1, k[i]) % M; } int z = (expMod(d.size(), k.back()) - expMod((int)d.size() - 1, k.back()) + M) % M; y = (long long)y * z % M; res = (res + y) % M; } printf( %d n , res); return 0; }
#include <bits/stdc++.h> using namespace std; int n; string s; struct str { int len; bool vis; string pre, suf; void push_front(char ch) { if (!len) vis = 0; else if (ch ^ pre[0]) vis = ch < pre[0]; pre = ch + pre; if (len < 2) suf = ch + suf; else if (pre.length() > 10) pre.pop_back(); len++; } } ans[100005]; int main() { int i; cin >> s; n = s.length(); ans[n].len = ans[n].vis = 0; ans[n].pre = ans[n].suf = ; s += # ; for (i = n - 1; i >= 0; i--) if (s[i] ^ s[i + 1]) ans[i] = ans[i + 1], ans[i].push_front(s[i]); else { ans[i] = ans[i + 2]; if (s[i] < ans[i].pre[0] || s[i] == ans[i].pre[0] && ans[i].vis) { ans[i].push_front(s[i]); ans[i].push_front(s[i]); } } for (i = 0; i < n; i++) { cout << ans[i].len << ; if (ans[i].len <= 10) cout << ans[i].pre << endl; else cout << ans[i].pre.substr(0, 5) << ... << ans[i].suf << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int M = 1e9 + 7; long long int n, k; string s, s1; void hi() { for (int i = k; i < s.length(); i++) { s[i] = s[i - k]; } } int main() { cout.precision(10); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> k >> s; s1 = s; hi(); if (s >= s1) { cout << n << endl; cout << s; } else { bool ok = true; int i = k - 1; if (s[i] != 9 ) { s[i] = s[i] + 1; hi(); cout << n << endl; cout << s; } else { s[i] = 0 ; for (int j = i - 1; j >= 0; j--) { if (s[j] != 9 ) { s[j]++; ok = false; hi(); cout << n << endl; cout << s; break; } else { s[j] = 0 ; } } if (ok) { cout << n + 1 << endl; cout << s1[0] + 1; for (int i = 0; i < n; i++) { cout << 0 ; } } } } return 0; } long long int nChooseR(long long int n, long long int k) { if (k > n) return 0; if (k * 2 > n) k = n - k; if (k == 0) return 1; long long int result = n; for (int i = 2; i <= k; ++i) { result *= (n - i + 1); result /= i; } return result; } long long int power(long long int a, long long int b) { if (b == 1) { return a % M; } else { if (b % 2 == 0) return (power(a, b / 2) % M * power(a, b / 2) % M) % M; else return (((power(a, b / 2) % M * power(a, b / 2) % M) % M) * a % M) % M; } }
#include <bits/stdc++.h> using namespace std; const int N = 1E5 + 10; const int inf = 1 << 30; long long read() { long long a = 0; char b = 1, c; do if ((c = getchar()) == 45) b = -1; while (c < 48 || c > 57); do a = (a << 3) + (a << 1) + (c & 15); while ((c = getchar()) > 47 && c < 58); return a * b; } void write(long long x, char c) { if (x < 0) putchar(45), x = -x; char a[20], s = 0; do a[++s] = x % 10 | 48; while (x /= 10); do putchar(a[s]); while (--s); putchar(c); } int fa[N], _fa[N]; int find(int x) { return fa[x] ^ x ? fa[x] = find(fa[x]) : x; } int _find(int x) { return _fa[x] ^ x ? _fa[x] = _find(_fa[x]) : x; } vector<int> q, _q; int main() { int n = read(), y = read(), z = read(); write(n - 1 - max(y, z), n ); for (int i = 1; i <= n; ++i) fa[i] = _fa[i] = i; while (y--) { int u = find(read()), v = find(read()); if (u > v) swap(u, v); fa[v] = u; } while (z--) { int u = _find(read()), v = _find(read()); if (u > v) swap(u, v); _fa[v] = u; } for (int i = 2; i <= n; ++i) { int u = find(i), v = _find(i); if (u ^ 1 && v ^ 1) { fa[u] = _fa[v] = 1; printf( %d 1 n , i); } } for (int i = 2; i <= n; ++i) { if (find(i) == i) q.push_back(i); if (_find(i) == i) _q.push_back(i); } for (int i = min(q.size(), _q.size()); i--;) printf( %d %d n , q[i], _q[i]); }
#include <bits/stdc++.h> using namespace std; int main() { int n, t = 0, k; cin >> n >> k; if (n > k) n = k; long long unsigned int sum = 1; while (n != 1) { sum *= n; n--; } cout << sum; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c; while (~scanf( %d %d %d , &a, &b, &c)) { int ans = a + b + c; ans = max(ans, a * b * c); ans = max((a + b) * c, ans); ans = max(a * (b + c), ans); printf( %d n , ans); } return 0; }
#include <bits/stdc++.h> using namespace std; int gi() { int res = 0, w = 1; char ch = getchar(); while (ch != - && !isdigit(ch)) ch = getchar(); if (ch == - ) w = -1, ch = getchar(); while (isdigit(ch)) res = res * 10 + ch - 0 , ch = getchar(); return res * w; } const int MAX_N = 1e6 + 5; const int V = 1e6 + 1; int mn[MAX_N << 2], tag[MAX_N << 2], cnt[MAX_N << 2]; void pushup(int o) { mn[o] = min(mn[(o << 1)], mn[(o << 1 | 1)]), cnt[o] = 0; if (mn[(o << 1)] == mn[o]) cnt[o] += cnt[(o << 1)]; if (mn[(o << 1 | 1)] == mn[o]) cnt[o] += cnt[(o << 1 | 1)]; } void puttag(int o, int v) { tag[o] += v, mn[o] += v; } void pushdown(int o) { if (!tag[o]) return; puttag((o << 1), tag[o]), puttag((o << 1 | 1), tag[o]); tag[o] = 0; } void modify(int o, int l, int r, int ql, int qr, int v) { if (ql <= l && r <= qr) return puttag(o, v); pushdown(o); int mid = (l + r) >> 1; if (ql <= mid) modify((o << 1), l, mid, ql, qr, v); if (qr > mid) modify((o << 1 | 1), mid + 1, r, ql, qr, v); pushup(o); } void mdy(int o, int l, int r, int pos, int v) { if (l == r) return (void)(cnt[o] += v); pushdown(o); int mid = (l + r) >> 1; if (pos <= mid) mdy((o << 1), l, mid, pos, v); else mdy((o << 1 | 1), mid + 1, r, pos, v); pushup(o); } int query(int o, int l, int r, int ql, int qr) { if (ql <= l && r <= qr) return mn[o] == 1 ? cnt[o] : 0; pushdown(o); int mid = (l + r) >> 1, res = 0; if (ql <= mid) res = query((o << 1), l, mid, ql, qr); if (qr > mid) res += query((o << 1 | 1), mid + 1, r, ql, qr); return res; } void upd(int l, int r, int v) { if (l == r) return (void)puts( xgzc ak ioi ); if (l > r) swap(l, r); modify(1, 0, V, l, r - 1, v); } int N, Q, a[MAX_N]; int main() { N = gi(), Q = gi(); for (int i = 1; i <= N; i++) a[i] = gi(); a[0] = V, a[N + 1] = 0; for (int i = 0; i <= N; i++) upd(a[i], a[i + 1], 1), mdy(1, 0, V, a[i], 1); while (Q--) { int p = gi(), v = gi(); upd(a[p - 1], a[p], -1), upd(a[p], a[p + 1], -1), mdy(1, 0, V, a[p], -1); a[p] = v; upd(a[p - 1], a[p], 1), upd(a[p], a[p + 1], 1), mdy(1, 0, V, a[p], 1); printf( %d n , query(1, 0, V, 1, V - 1)); } return 0; }
#include <bits/stdc++.h> using namespace std; long long bef[1000100], af[1000100]; long long calc(long long n) { return (n * (n + 1)) / 2; } int main() { int k; string s; cin >> k >> s; memset(bef, 0, sizeof bef); memset(af, 0, sizeof af); long long last(1000010), cur(1), i(0); vector<int> ones; long long incase(0); while (i < s.size()) { while (s[i] == 0 ) { ++i; ++cur; } incase += calc(cur - 1); if (i < s.size()) { bef[i] = cur; cur = 1; ones.push_back(i); } ++i; } if (!k) { cout << incase; return 0; } i = s.size() - 1; cur = 1; while (i >= 0) { while (s[i] == 0 ) { --i; ++cur; } if (i >= 0) { af[i] = cur; cur = 1; } --i; } long long ans(0); for (int j = 0; j + k - 1 < ones.size(); ++j) { ans += bef[ones[j]] * af[ones[j + k - 1]]; } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long a, b = 0, c = 0, n, t; cin >> t; for (int o = 1; o <= t; o++) { b = 0; c = 0; cin >> n; for (int i = 1; i <= n; i++) { cin >> a; if (a != 1) { c = 1; } else { if (c == 0) { b = b + 1; } } } if (n == 1) { cout << First ; } else { if (c == 0) { if (n % 2 == 0) { cout << Second ; } else { cout << First ; } } else { if (b % 2 == 0) { cout << First ; } else { cout << Second ; } } } cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > G[500005]; int sz[500005]; vector<int> *vec[500005]; int cnt[(1 << 23) + 5]; int lazy[500005]; int len[500005]; int res[500005]; void get_ready(int u, int par, int mask, int hh) { sz[u] = 1; len[u] = hh; lazy[u] = mask; for (auto v : G[u]) if (v.first != par) get_ready(v.first, u, mask ^ v.second, hh + 1), sz[u] += sz[v.first]; } void DFS(int u, int par, int keep, int mask) { int node = -1, mx = 0, xr = 0; for (auto x : G[u]) { int v = x.first; if (par != v and sz[v] > mx) { mx = sz[v], node = v, xr = x.second; } } for (auto x : G[u]) { int v = x.first; if (v != par and v != node) DFS(v, u, 0, x.second); } if (node != -1) { DFS(node, u, 1, xr); vec[u] = vec[node]; res[u] = max(res[u], res[node]); } else vec[u] = new vector<int>; for (int i = 1; i <= (1 << 22); i <<= 1) { res[u] = max(res[u], cnt[lazy[u] ^ i] - len[u]); } res[u] = max(res[u], cnt[lazy[u]] - len[u]); cnt[lazy[u]] = max(cnt[lazy[u]], len[u]); vec[u]->push_back(u); for (auto x : G[u]) { int v = x.first; if (v != par and v != node) { res[u] = max(res[u], res[v]); for (auto vv : *vec[v]) { for (int i = 1; i <= (1 << 22); i <<= 1) { res[u] = max(res[u], len[vv] + cnt[lazy[vv] ^ i] - 2 * len[u]); } res[u] = max(res[u], len[vv] + cnt[lazy[vv]] - 2 * len[u]); } for (auto vv : *vec[v]) { int temp = lazy[vv]; cnt[temp] = max(cnt[temp], len[vv]); vec[u]->push_back(vv); } vec[v]->clear(); } } if (!keep) { for (auto v : *vec[u]) cnt[lazy[v]] = -1000000000; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; for (int i = 0; i < (1 << 23) + 5; i++) cnt[i] = -1000000000; int N; cin >> N; for (int i = 2; i <= N; i++) { string ch; int p; cin >> p >> ch; G[p].push_back({i, 1 << (ch[0] - a )}); G[i].push_back({p, 1 << (ch[0] - a )}); } get_ready(1, -1, 0, 0); DFS(1, -1, 1, 0); for (int i = 1; i <= N; i++) cout << res[i] << ; }
#include <bits/stdc++.h> using namespace std; int n; int main() { cin >> n; cout << (n + 1) / 2; return 0; }
#include <bits/stdc++.h> using namespace std; signed main() { long long int n, i, j, k, t; scanf( %lld , &n); long long int prev = 0, ans = 0, count = 0, diff = 0, sum = 0, powe = 0; long long int a[n]; for (i = 0; i < n; i++) scanf( %lld , &a[i]); sort(a, a + n); if (n == 1) { cout << 0 << endl; return 0; } prev = a[1] - a[0]; ans = prev; count = 2; for (i = 2; i < n; i++) { count = (count * 2) % 1000000007; powe = (count - 1) % 1000000007; diff = (a[i] - a[i - 1]) % 1000000007; sum = ((2 * prev) % 1000000007 + (diff * powe) % 1000000007) % 1000000007; ans = ((ans) % 1000000007 + (sum) % 1000000007) % 1000000007; prev = sum % 1000000007; } cout << ans % 1000000007 << endl; }
#include <bits/stdc++.h> using namespace std; long long sum[500000 + 10]; int data[500000 + 10]; int main() { int n, l, r, ql, qr; scanf( %d%d%d%d%d , &n, &l, &r, &ql, &qr); for (int i = 1; i <= n; ++i) { scanf( %d , &data[i]); sum[i] += (sum[i - 1] + data[i] * r); } long long ans = 100000000000000; long long tem = 0; for (int i = 0; i <= n; ++i) { tem += data[i] * l; if (0 == i) ans = min(ans, sum[n] + (n - 1) * qr); else if (n == i) ans = min(ans, tem + (n - 1) * ql); else if (i == (n - i)) { ans = min(ans, tem + sum[n] - sum[i]); } else if (i < (n - i)) ans = min(ans, tem + sum[n] - sum[i] + (n - i - i - 1) * qr); else ans = min(ans, tem + sum[n] - sum[i] + (2 * i - n - 1) * ql); } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; vector<int> v; int n, x; char s[3]; int main() { cin >> n; while (n--) { cin >> s; if (s[0] == a ) { cin >> x; v.insert(lower_bound(v.begin(), v.end(), x), x); } if (s[0] == d ) { cin >> x; v.erase(lower_bound(v.begin(), v.end(), x)); } if (s[0] == s ) { long long ans = 0; for (int i = 2; i < v.size(); i += 5) { ans += v[i]; } cout << ans << endl; } } return 0; }
#include <bits/stdc++.h> using namespace std; const long long N = 1e6 + 1; const long long M = 1e5 + 1; vector<int> len; vector<int> dist[N]; vector<long long> pre[N]; long long n, m; void mer(long long v, long long l, long long addl, long long r, long long addr) { dist[v].push_back(0); long long sl = dist[l].size(); long long sr = dist[r].size(); long long pl = 0; long long pr = 0; while (pl < sl && pr < sr) { if (dist[l][pl] + addl <= dist[r][pr] + addr) { dist[v].push_back(dist[l][pl] + addl); pl++; } else { dist[v].push_back(dist[r][pr] + addr); pr++; } } while (pl < sl) { dist[v].push_back(dist[l][pl] + addl); pl++; } while (pr < sr) { dist[v].push_back(dist[r][pr] + addr); pr++; } return; } void bfs(long long v) { if (v > n) return; long long l = 2 * v; long long r = 2 * v + 1; bool cl = false, cr = false; if (l <= n) { bfs(l); cl = true; } if (r <= n) { bfs(r); cr = true; } if (cl && cr) { long long addl = len[2 * v - 1]; long long addr = len[2 * v]; mer(v, l, addl, r, addr); } else if (cl && !cr) { long long addl = len[2 * v - 1]; dist[v].push_back(0); for (long long x : dist[l]) dist[v].push_back(addl + x); } else if (cr && !cl) { long long addr = len[2 * v]; dist[v].push_back(0); for (long long x : dist[r]) dist[v].push_back(addr + x); } else { dist[v].push_back(0); } long long sze = dist[v].size(); pre[v].resize(sze); long long prev = 0ll; for (long long i = 0; i < sze; i++) { pre[v][i] = prev + dist[v][i]; prev = pre[v][i]; } return; } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); len.push_back(-1); cin >> n >> m; for (long long i = 0; i < n - 1; i++) { long long x; cin >> x; len.push_back(x); } bfs(1); for (long long i = 0; i < m; i++) { long long ans = 0ll; long long a, h; cin >> a >> h; long long opt = 3; while (a >= 1) { if (h < 0) break; if (opt == 3) { long long cnt = (upper_bound(dist[a].begin(), dist[a].end(), h) - dist[a].begin()); if (cnt > 0) ans += (cnt)*h - pre[a][cnt - 1]; } else if (opt == 2) { ans += h; if (2 * a <= n) { long long cnt = (upper_bound(dist[2 * a].begin(), dist[2 * a].end(), h - len[2 * a - 1]) - dist[2 * a].begin()); if (cnt > 0) ans += (cnt) * (h - len[2 * a - 1]) - pre[2 * a][cnt - 1]; } } else { if (h > 0) ans += h; if (2 * a + 1 <= n) { long long cnt = (upper_bound(dist[2 * a + 1].begin(), dist[2 * a + 1].end(), h - len[2 * a]) - dist[2 * a + 1].begin()); if (cnt > 0) ans += (cnt) * (h - len[2 * a]) - pre[2 * a + 1][cnt - 1]; } } if (a % 2) { h -= len[2 * (a / 2)]; opt = 2; } else { h -= len[2 * (a / 2) - 1]; opt = 1; } a /= 2; } cout << ans << endl; } }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int sum = 0; int d; for (int i = 0; i < n; i++) { cin >> d; sum += d; } int count = 5; for (int i = 1; i <= 5; i++) { if ((sum + i) % (n + 1) == 1) { count--; } } cout << count << endl; }
#include <bits/stdc++.h> using namespace std; long long arr1[1000001]; template <typename T> T myMax(T x, T y) { return (x > y) ? x : y; } template <typename T> T myMin(T x, T y) { return (x < y) ? x : y; } template <typename T> T sum(T x, T y) { return (x + y); } template <typename T> T Mean(T x, T y) { return (x + ((y - x) / 2)); } void seive() { for (long long i = 0; i <= 1000000; i++) { arr1[i] = 1; } for (long long i = 2; i * i <= 1000000; i++) { if (arr1[i] == 1) { arr1[i] = 1; for (long long j = i * i; j <= 1000000; j = j + i) { arr1[j] = 0; } } } } long long find_occurances(string s) { string s1 = ; long long c = 0; for (long long i = 0; i < 3; i++) { s1 = s1 + s[i]; } if (s1 == abc ) { c++; } long long n = s.size(); long long l = 0; long long r = 2; while (r < n - 1) { s1.erase(s1.begin()); l++; r++; s1 += s[r]; if (s1 == abc ) { c++; } } return c; } bool check_power_of_2(long long x) { if ((x & (x - 1)) == 0) { return true; } return false; } bool cmp(pair<long long, pair<long long, long long>> x, pair<long long, pair<long long, long long>> y) { if (x.first == y.first) { return x.second.second < y.second.second; } return x.first < y.first; } bool cmp1(pair<long long, long long> p, pair<long long, long long> q) { return p.first < q.second; } bool check(vector<long long>& v) { if (v[0] == 1) { bool flag1 = true; for (long long i = 1; i < v.size(); i++) { if (v[i] != v[i - 1]) { flag1 = false; break; } } return flag1; } else { return false; } } bool check_prime(long long x) { if (x == 2) { return true; } if (x == 3) { return true; } if ((x % 2) == 0) { return false; } if ((x % 3) == 0) { return false; } for (long long i = 5; i * i <= x; i = i + 6) { if ((x % i) == 0) { return false; } if ((x % (i + 2)) == 0) { return false; } } return true; } bool check_array(vector<long long>& v) { for (long long i = 1; i < v.size(); i++) { if (v[i] == v[i - 1]) return false; } return true; } bool is_vowel(char x) { if ((x == a ) || (x == e ) || (x == o ) || (x == i ) || (x == u )) { return true; } return false; } signed main() { long long t; cin >> t; while (t--) { long long n; cin >> n; long long arr[n]; long long sum = 0; for (long long i = 0; i < n; i++) { cin >> arr[i]; sum += arr[i]; } if ((sum % n) == 0) { cout << 0 << n ; } else { cout << 1 << n ; } } return 0; }
#include <bits/stdc++.h> using namespace std; long long ini; struct TrieNode { long long value; TrieNode *arr[2]; }; TrieNode *newNode() { TrieNode *temp = new TrieNode; temp->value = 0; temp->arr[0] = temp->arr[1] = NULL; return temp; } void insert(TrieNode *root, long long pre_xor) { TrieNode *temp = root; for (int i = 41 - 1; i >= 0; i--) { bool val = pre_xor & (1LL << i); if (temp->arr[val] == NULL) temp->arr[val] = newNode(); temp = temp->arr[val]; } temp->value = pre_xor; } long long query(TrieNode *root, long long pre_xor) { TrieNode *temp = root; for (int i = 41 - 1; i >= 0; i--) { bool val = pre_xor & (1LL << i); if (temp->arr[1 - val] != NULL) temp = temp->arr[1 - val]; else if (temp->arr[val] != NULL) temp = temp->arr[val]; } return pre_xor ^ (temp->value); } long long maxSubarrayXOR(long long arr[], long long n) { TrieNode *root = newNode(); insert(root, 0); long long result = ini, pre_xor = 0; for (int i = 0; i < n; i++) { pre_xor = pre_xor ^ arr[i]; insert(root, pre_xor); result = max(result, query(root, pre_xor ^ ini)); } return result; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long arr[100000], n; cin >> n; for (int i = 0; i < n; i++) cin >> arr[i], ini ^= arr[i]; cout << maxSubarrayXOR(arr, n); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long long number; cin >> number; if (number == 2) { cout << 0 << endl; } else if (number == 1) { cout << 0 << endl; } else { if (number % 2 == 0) { cout << number / 2 - 1 << endl; } else { cout << number / 2 << endl; } } } return 0; }
#include <bits/stdc++.h> using namespace std; int n, u[6], v[6], x; int main() { scanf( %d , &n); for (int i = (1); i <= (n); i++) { scanf( %d , &x); u[x]++; } for (int i = (1); i <= (n); i++) { scanf( %d , &x); v[x]++; } int dif = 0; for (int i = (1); i <= (5); i++) if ((u[i] + v[i]) & 1) { printf( -1 n ); return 0; } else dif += max(0, (u[i] - v[i]) / 2); printf( %d n , dif); return 0; }
#include <bits/stdc++.h> long long int min(long long int x, long long int y) { return (x < y) ? x : y; } long long int max(long long int x, long long int y) { return (x > y) ? x : y; } long long int fastexpo(long long int base, long long int power) { long long int res = 1; while (power) { if (power % 2 == 0) { base *= base; power /= 2; } else { res *= base; power--; } } return res; } long long int modexpo(long long int base, long long int power, long long int mod) { long long int res = 1; while (power) { if (power % 2 == 0) { base = (base * base) % mod; power /= 2; } else { res = (base * res) % mod; power--; } } return res; } const long long int SN = 1e7; bool prime[SN + 1]; void SEIVE(int n) { memset(prime, true, sizeof(prime)); for (int p = 2; p * p <= n; p++) { if (prime[p] == true) { for (int i = p * p; i <= n; i += p) prime[i] = false; } } prime[0] = false; prime[1] = false; } using namespace std; int x[26], par[200010]; int find(int n) { if (par[n] == n) return n; else return par[n] = find(par[n]); } void solve() { int n; cin >> n; for (long long int i = 0; i < n + 1; i++) par[i] = i; for (long long int i = 1; i < n + 1; i++) { string s; cin >> s; for (long long int j = 0; j < s.size(); j++) { if (!x[s[j] - a ]) x[s[j] - a ] = i; else par[find(i)] = par[x[s[j] - a ]]; } } int ans = 0; for (long long int i = 1; i < n + 1; i++) { if (par[i] == i) ans++; } cout << ans; cout << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ; solve(); }
#include <bits/stdc++.h> using namespace std; void solve() { int n, x, y, c1 = 0, c2 = 0, m; cin >> n; for (int i = 0; i < n; i++) { cin >> x >> y; if (x > 0) c1++; else c2++; } m = min(c1, c2); if (m <= 1) cout << YES << endl; else cout << NO << endl; } int main() { ios::sync_with_stdio(0); cin.tie(0); { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; const long long UNDEF = -1; const long long INF = 1e18; template <typename T> inline bool chkmax(T &aa, T bb) { return aa < bb ? aa = bb, true : false; } template <typename T> inline bool chkmin(T &aa, T bb) { return aa > bb ? aa = bb, true : false; } static char stdinBuffer[1024]; static char *stdinDataEnd = stdinBuffer + sizeof(stdinBuffer); static const char *stdinPos = stdinDataEnd; void readAhead(size_t amount) { size_t remaining = stdinDataEnd - stdinPos; if (remaining < amount) { memmove(stdinBuffer, stdinPos, remaining); size_t sz = fread(stdinBuffer + remaining, 1, sizeof(stdinBuffer) - remaining, stdin); stdinPos = stdinBuffer; stdinDataEnd = stdinBuffer + remaining + sz; if (stdinDataEnd != stdinBuffer + sizeof(stdinBuffer)) *stdinDataEnd = 0; } } int rint() { readAhead(16); int x = 0; bool neg = false; while (*stdinPos == || *stdinPos == n ) ++stdinPos; if (*stdinPos == - ) { ++stdinPos; neg = true; } while (*stdinPos >= 0 && *stdinPos <= 9 ) { x *= 10; x += *stdinPos - 0 ; ++stdinPos; } return neg ? -x : x; } char rch() { readAhead(16); while (*stdinPos == || *stdinPos == n ) ++stdinPos; char ans = *stdinPos; ++stdinPos; return ans; } long long rlong() { readAhead(32); long long x = 0; bool neg = false; while (*stdinPos == || *stdinPos == n ) ++stdinPos; if (*stdinPos == - ) { ++stdinPos; neg = true; } while (*stdinPos >= 0 && *stdinPos <= 9 ) { x *= 10; x += *stdinPos - 0 ; ++stdinPos; } return neg ? -x : x; } int nim(int x) { return x; } map<int, map<int, int> > g[2]; map<int, vector<pair<int, int> > > z[2]; int lim[2]; map<int, pair<int, int> > h; int main() { ios_base::sync_with_stdio(false); cin.tie(0); lim[0] = rint(), lim[1] = rint(); int k = rint(); for (int i = 0; i < k; i++) { int xb = rint(), yb = rint(), xe = rint(), ye = rint(); if (xb == xe) { if (yb > ye) swap(yb, ye); g[0][xb][yb]++; g[0][xb][ye]--; } else { if (xb > xe) swap(xb, xe); g[1][yb][xb]++; g[1][yb][xe]--; } } int nimber = 0; for (int t = 0; t < 2; t++) for (auto &o : g[t]) { int cnt = 0; int last = 0; int sumlen = 0; for (auto &w : o.second) { int oldcnt = cnt; int pos = w.first; cnt += w.second; if (oldcnt == 0 && cnt > 0) { int len = pos - last; if (len) { z[t][o.first].push_back(make_pair(last, pos)); sumlen += len; } } if (oldcnt > 0 && cnt == 0) { last = pos; } } { int pos = lim[t ^ 1]; int len = pos - last; if (len) { z[t][o.first].push_back(make_pair(last, pos)); sumlen += len; } } h[sumlen] = make_pair(t, o.first); nimber ^= sumlen; } for (int t = 0; t < 2; t++) { int unseen = lim[t] - 1 - g[t].size(); int num = lim[t ^ 1]; if (unseen & 1) nimber ^= num; if (unseen > 0) { int have = -1; int want = 1; for (auto &w : g[t]) { if (want != w.first) { have = want; break; } want++; } if (have == -1) have = lim[t] - 1; assert(g[t].count(have) == 0); h[num] = make_pair(t, have); z[t][have].push_back(make_pair(0, lim[t ^ 1])); } } if (nimber == 0) { printf( SECOND n ); } else { printf( FIRST n ); for (auto w : h) { int len = w.first; int go = len ^ nimber; if (go > len) continue; int rm = len - go; int t = w.second.first; int o = w.second.second; int solution = -1; for (auto &q : z[t][o]) { int start = q.first, end = q.second; if (rm <= end - start) { solution = start + rm; break; } else rm -= end - start; } assert(solution != -1); if (t == 0) { printf( %d %d %d %d n , o, 0, o, solution); } else { printf( %d %d %d %d n , 0, o, solution, o); } return 0; } } }
#include <bits/stdc++.h> static const int MOD = 1000000007; using ll = long long; using u32 = unsigned; using u64 = unsigned long long; using namespace std; template <class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208; char buf[200001]; int main() { int q; cin >> q; while (q--) { int n; cin >> n; string s, t; cin >> s >> t; int a = 1, b = 0; for (int i = 0; i < n; ++i) { if (s[i] <= 2 && t[i] <= 2 ) { } else if (s[i] <= 2 ) b = 0; else if (t[i] <= 2 ) a = 0; else { swap(a, b); } } puts(b ? YES : NO ); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int k, r; cin >> k >> r; int count = 1; int aux = k; while (true) { if ((k % 10 == 0) || (abs(k - r) % 10 == 0)) { break; } else { k += aux; count++; } } cout << count << endl; }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); long long n, d; cin >> n >> d; vector<long long> delta(n); vector<long long> rs(n); for (int i = 0; i < n; ++i) cin >> delta[i]; rs[0] = delta[0]; for (int i = 1; i < n; ++i) rs[i] = rs[i - 1] + delta[i]; vector<long long> maxTotDeposit(n); long long mxSoFar = LLONG_MIN; for (int i = n - 1; i >= 0; --i) { mxSoFar = max(mxSoFar, rs[i]); maxTotDeposit[i] = d - mxSoFar; if (mxSoFar > d) { cout << -1; return 0; } } long long dep = 0; int ans = 0; for (int i = 0; i < n; ++i) { if (!delta[i] && rs[i] + maxTotDeposit[i] < 0) { cout << -1; return 0; } if (!delta[i] && rs[i] + dep < 0) { ++ans; dep = maxTotDeposit[i]; } } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; template <class T> inline void read(T &x) { x = 0; char c = getchar(); int f = 1; while (!isdigit(c)) { if (c == - ) f = -1; c = getchar(); } while (isdigit(c)) x = x * 10 - 0 + c, c = getchar(); x *= f; } const int N = 1e5 + 10; int buc[N], L, R, a[N]; long long ans; void update(int c, int d) { ans += d * buc[c] * (long long)(buc[c] - 1) / 2; } long long cal(int l, int r) { while (L < l) update(a[L], -1), buc[a[L]]--, update(a[L], 1), L++; while (L > l) L--, update(a[L], -1), buc[a[L]]++, update(a[L], 1); while (R < r) R++, update(a[R], -1), buc[a[R]]++, update(a[R], 1); while (R > r) update(a[R], -1), buc[a[R]]--, update(a[R], 1), R--; return ans; } long long dp[22][N]; int cur; void solve(int lb, int rb, int l, int r) { if (lb > rb || l > r) return; int mid = l + r >> 1; int d = 0; long long res = 1e18; for (int i = lb; i <= min(rb, mid - 1); ++i) { long long tmp = cal(i + 1, mid); if (res > dp[cur - 1][i] + tmp) res = dp[cur - 1][i] + tmp, d = i; } dp[cur][mid] = res; solve(lb, d, l, mid - 1), solve(d, rb, mid + 1, r); } int main() { memset(dp, 0x3f, sizeof(dp)); dp[0][0] = 0; int n, m; read(n), read(m); for (int i = 1; i <= n; ++i) read(a[i]); buc[a[1]]++, L = R = 1; for (cur = 1; cur <= m; ++cur) solve(0, n - 1, 1, n); printf( %lld , dp[m][n]); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; int arr[t]; for (int i = 0; i < t; i++) { int y; cin >> y; y = y + i; arr[i] = y; } sort(arr, arr + t); for (int i = 0; i < t; i++) { arr[i] -= i; } int check = 1; for (int i = 0; i < t - 1; i++) { if (arr[i] > arr[i + 1]) { check = 0; break; } } if (check == 0) cout << :( n ; else { for (int i = 0; i < t; i++) { cout << arr[i] << ; } } return 0; }
#include <bits/stdc++.h> #pragma comment(linker, /STACK:1024000000,1024000000 ) using namespace std; const int N = 1e5 + 15, M = 105, T = 1e7 + 5; long long maxi[N], l[N], r[N]; pair<long long, long long> f[N]; pair<long long, int> bsd(pair<long long, int> a, pair<long long, int> b) { if (a.first > b.first || a.first == b.first && a.second < b.second) return a; else return b; } int get(long long n, long long target, long long j) { while (j <= n && target > r[j]) ++j; return j; } int main() { long long j = 1, g = 1, n, i, p, t, L, t0, x; cin >> L >> n >> p >> t; for (i = 1; i <= n; i++) cin >> l[i] >> r[i]; for (i = 1; i <= n; i++) { maxi[i] = max(maxi[i], maxi[i - 1]); f[i] = bsd(f[i], make_pair(maxi[i] + (r[i] - l[i]) / p, l[i] + ((r[i] - l[i]) / p) * p)); t0 = f[i].second + t; j = get(n, t0, j); if (j > n) continue; if (l[j] >= t0) { maxi[j] = max(maxi[j], f[i].first); continue; } f[j] = bsd(f[j], make_pair(f[i].first + (r[j] - t0) / p, t0 + ((r[j] - t0) / p) * p)); maxi[j + 1] = max(maxi[j + 1], f[i].first); } long long ret = 0; for (i = 1; i <= n; ++i) ret = max(ret, f[i].first); cout << ret << endl; }
#include <bits/stdc++.h> using namespace std; const int N = 300005, T = 100000; int n, m, a[N], l[N], r[N]; int main() { ios::sync_with_stdio(false); cin >> n >> m; for (int i = 1; i <= m; i++) cin >> a[i]; if (n == 1) { cout << 0 << endl; return 0; } for (int i = m; i > 0; --i) { l[a[i] + T + i] = l[a[i] + T + i + 1] + 1; r[a[i] + T - i] = r[a[i] + T - i - 1] + 1; } long long ans = 0; for (int i = 1; i <= n; i++) ans += min(n, i + (m + 1) - r[i + T]) - max(1, i - (m + 1) + l[i + T]) + 1; cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int n, i, j, k, e, x, l[7], r[7]; double p, c, res, f[7][7][3]; int main() { scanf( %d , &n); for (i = 0; i < n; i++) scanf( %d%d , &l[i], &r[i]); for (i = 1; i <= 10000; i++) { memset(f, 0, sizeof(f)); f[0][0][0] = 1; for (j = 0; j < n; j++) { p = 1. / (r[j] - l[j] + 1.); for (k = 0; k <= j; k++) for (e = 0; e < 2; e++) if (f[j][k][e]) { x = min(r[j] + 1, i) - l[j]; if (x > 0) f[j + 1][k][e] += f[j][k][e] * x * p; if (i >= l[j] && i <= r[j]) f[j + 1][k + 1][e] += f[j][k][e] * p; x = r[j] - max(l[j] - 1, i); if (x > 0) f[j + 1][k][e + 1] += f[j][k][e] * x * p; } } for (c = 0, k = 1; k <= j; k++) for (e = 0; e < 2; e++) if ((k > 1 && e == 0) || e == 1) c += f[n][k][e]; res += c * i; } printf( %.15lf n , res); return 0; }
#include <bits/stdc++.h> int gcd(int x, int y) { if (y == 0) return x; else return gcd(y, x % y); } int main() { int n, a; scanf( %d , &n); for (int i = 1; i <= n / 2; i++) { if (gcd(i, n - i) == 1) a = i; } printf( %d %d , a, n - a); }
#include <bits/stdc++.h> int main() { char str[5010]; memset(str, 0, sizeof(str)); scanf( %s , str); int n; n = strlen(str); int res = 0; for (int i = 0; i < n; i++) { int l = 0, sum = 0; for (int j = i; j < n; j++) { if (str[j] == ( ) l++; else if (str[j] == ) ) l--; else l--, sum++; if (!l) res++; if (l < 0 && sum > 0) { l += 2; sum--; } else if (l < 0 && sum <= 0) { break; } } } printf( %d n , res); }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int r1, r2, c1, c2; cin >> r1 >> c1 >> r2 >> c2; if (r1 == r2 || c1 == c2) { cout << 1 << ; } else { cout << 2 << ; } if ((r1 + c1) % 2 != (r2 + c2) % 2) { cout << 0 << ; } else { if (r1 + c1 == r2 + c2 || r1 - c1 == r2 - c2) { cout << 1 << ; } else { cout << 2 << ; } } cout << max(abs(r1 - r2), abs(c1 - c2)) << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d; cin >> a >> b >> c >> d; if (d > 2 * c || 2 * d < c || d >= b) { printf( -1 n ); return 0; } int tmp = max(c, d); cout << max(d * 2 + 2, a) << endl; cout << max(d * 2 + 1, b) << endl; cout << tmp << endl; }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 20; unsigned long long bit[N][20], ans, s; int main() { int n, k, a; cin >> n >> k; for (int x = 1; x < N; x += x & (-x)) bit[x][0]++; for (int i = 0; i < n; i++) { cin >> a; for (int j = k + 1; j > 0; j--) { s = 0; for (int x = a; x > 0; x -= x & (-x)) s += bit[x][j - 1]; for (int x = a; x < N; x += x & (-x)) bit[x][j] += s; } } for (int x = n; x > 0; x -= x & (-x)) ans += bit[x][k + 1]; cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; const int dr[] = {-1, 0, 1, 0}; const int dc[] = {0, 1, 0, -1}; string FILE_NAME = testcase.C ; string NAME; string itos(int n) { stringstream ss; ss << n; return ss.str(); } int main() { int n, k; cin >> n >> k; if (k >= n * (n - 1) / 2) { cout << no solution << endl; } else { for (int i = 0; i < (n); i++) { cout << 0 << << i << endl; } } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 5e4; bitset<maxn * 25> f[50][25]; int n; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n; vector<int> a(n * 2); for (int i = 1; i <= n * 2; i++) cin >> a[i - 1]; sort(a.begin(), a.end()); vector<vector<int>> ans(2); ans[0].push_back(a[0]), ans[1].push_back(a[1]); int sum = 0; for (int i = 2; i <= n * 2 - 1; i++) sum += a[i]; int lim = sum / 2; f[1][0].set(0); for (int i = 2; i <= n * 2 - 1; i++) for (int j = 0; j <= min(i, n - 1); j++) { f[i][j] |= f[i - 1][j]; if (j) f[i][j] |= f[i - 1][j - 1] << a[i]; } int s1 = -1, cnt = n - 1, id = 2 * n - 1; for (int i = lim; i >= 0; i--) { if (f[id][cnt][i]) { s1 = i; break; } } assert(s1 >= 0); for (int i = id; i >= 2; i--) { assert(f[i][cnt][s1]); if (cnt >= 1 && s1 >= a[i] && f[i - 1][cnt - 1][s1 - a[i]]) { ans[0].push_back(a[i]); s1 -= a[i], cnt--; } else ans[1].push_back(a[i]); } sort(ans[0].begin(), ans[0].end()); sort(ans[1].begin(), ans[1].end(), greater<int>()); for (int i = 0; i <= 1; i++) { for (auto x : ans[i]) cout << x << ; cout << n ; } }
#include <bits/stdc++.h> using namespace std; int a[100100], b[100100]; int n, x; multiset<int> st; multiset<int>::iterator it; int main() { scanf( %d%d , &n, &x); for (int i = 0; i < n; i++) scanf( %d , a + i); for (int i = 0; i < n; i++) { int w; scanf( %d , &w); st.insert(w); } sort(a, a + n); reverse(a, a + n); int res = 1; for (int i = 0; i < n; i++) { int w = x - a[i]; it = st.lower_bound(w); if (it != st.end()) { st.erase(it); res = i + 1; } } printf( 1 %d , res); }
#include <bits/stdc++.h> using namespace std; const int MAX = 1e5 + 9; long long n, a, b, val[MAX], incc[MAX], decc[MAX]; vector<int> g[MAX]; void dfs(int v, int p) { for (auto u : g[v]) if (u != p) dfs(u, v), decc[v] = max(decc[v], decc[u]), incc[v] = max(incc[v], incc[u]); long long meg = val[v] + incc[v] - decc[v]; if (meg < 0) incc[v] += -meg; else decc[v] += meg; } int main() { cin >> n; for (int i = 0; i < n - 1; i++) cin >> a >> b, a--, b--, g[a].push_back(b), g[b].push_back(a); for (int i = 0; i < n; i++) cin >> val[i]; dfs(0, -1); cout << incc[0] + decc[0]; }
#include <bits/stdc++.h> using namespace std; int n; long long ans, p; int main() { scanf( %d , &n); p = 2; for (int i = 1; i <= n; i++) { cout << (long long)i * (i + 1) * (i + 1) - p / i << endl; p = (long long)i * (i + 1); } }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int x1, x2, y1, y2; cin >> x1 >> y1 >> x2 >> y2; if (x1 == x2) { int w = max(y1, y2) - min(y1, y2); cout << x1 + w << << y1 << << x2 + w << << y2 << endl; } else if (y1 == y2) { int w = max(x1, x2) - min(x1, x2); cout << x1 << << y1 + w << << x2 << << y2 + w << endl; } else if (abs(x1 - x2) == abs(y1 - y2)) { cout << x1 << << y2 << << x2 << << y1 << endl; } else { cout << -1 << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, t = 0; string s; cin >> n; for (int i = 0; i < n; i++) { cin >> s; if (s[0] >= 0 && s[0] <= 9 ) { if (s.size() == 1 || (s.size() == 2 && s < 18 )) t++; } else if (s == ABSINTH || s == CHAMPAGNE || s == TEQUILA || s == WINE || s == WHISKEY || s == VODKA || s == SAKE || s == RUM || s == GIN || s == BRANDY || s == BEER ) t++; } cout << t; return 0; }
#include <bits/stdc++.h> #pragma GCC optimize( O3,inline,unroll-loops ) using namespace std; int f[4020][4020][2][2]; inline int Mod(int x) { return x + ((x >> 31) & 1000000007); } inline void Modadd(int &x, int y) { x = Mod(x + y - 1000000007); return; } int Modular(string &a, int b) { string c; int i; long long t; c = string(a.size(), 0 ); for (i = t = 0; i < (signed)a.size(); i++) { t = t * 10 + a[i] - 48; c[i] = t / b + 48; t %= b; } for (i = 0; i < (signed)c.size() && c[i] == 0 ; i++) ; a = c.substr(i); return (int)t; } int main(void) { int p, k; string a; vector<int> b; int i, j, o; int w[6]; cin >> p >> k >> a; while (!a.empty()) b.push_back(Modular(a, p)); reverse(b.begin(), b.end()); f[0][0][1][0] = 1; for (i = 0; i < (signed)b.size(); i++) { w[0] = (long long)p * (p + 1) / 2 % 1000000007; w[1] = (long long)p * (p - 1) / 2 % 1000000007; w[2] = (long long)b[i] * (b[i] + 1) / 2 % 1000000007; w[3] = (long long)b[i] * (b[i] - 1) / 2 % 1000000007; w[4] = (long long)b[i] * (p + p - b[i] - 1) / 2 % 1000000007; w[5] = (long long)b[i] * (p + p - b[i] + 1) / 2 % 1000000007; for (j = 0; j <= i + 1; j++) { Modadd(f[i + 1][j][0][0], (long long)f[i][j][0][0] * w[0] % 1000000007); Modadd(f[i + 1][j][0][0], (long long)f[i][j][1][0] * w[2] % 1000000007); Modadd(f[i + 1][j][0][1], (long long)f[i][j][0][0] * w[1] % 1000000007); Modadd(f[i + 1][j][0][1], (long long)f[i][j][1][0] * w[3] % 1000000007); Modadd(f[i + 1][j][1][0], (long long)f[i][j][1][0] * (b[i] + 1) % 1000000007); Modadd(f[i + 1][j][1][1], (long long)f[i][j][1][0] * b[i] % 1000000007); Modadd(f[i + 1][j + 1][0][0], (long long)f[i][j][0][1] * w[1] % 1000000007); Modadd(f[i + 1][j + 1][0][0], (long long)f[i][j][1][1] * w[4] % 1000000007); Modadd(f[i + 1][j + 1][0][1], (long long)f[i][j][0][1] * w[0] % 1000000007); Modadd(f[i + 1][j + 1][0][1], (long long)f[i][j][1][1] * w[5] % 1000000007); Modadd(f[i + 1][j + 1][1][0], (long long)f[i][j][1][1] * (p - b[i] - 1) % 1000000007); Modadd(f[i + 1][j + 1][1][1], (long long)f[i][j][1][1] * (p - b[i]) % 1000000007); } } for (i = k, o = 0; i <= (signed)b.size(); i++) Modadd(o, Mod(f[b.size()][i][0][0] + f[b.size()][i][1][0] - 1000000007)); cout << o << endl; return 0; }
#include <bits/stdc++.h> using namespace std; double cooy1, cooy2, cooyw, cooxb, cooyb, r; double s1, s2; int main() { ios_base::sync_with_stdio(false); cin >> cooy1 >> cooy2 >> cooyw >> cooxb >> cooyb >> r; cooy1 += r; cooy2 -= r; cooyw -= r; s1 = 2 * cooyw - cooy1; s2 = 2 * cooyw - cooy2; double xx1 = cooxb * (cooyw - s1) / (cooyb - s1); double xx2 = cooxb * (cooyw - s2) / (cooyb - s2); double dd1 = sqrt(cooxb * cooxb + (s1 - cooyb) * (s1 - cooyb)) * r / cooxb; double dd2 = sqrt(cooxb * cooxb + (s2 - cooyb) * (s2 - cooyb)) * r / cooxb; if (s1 - dd1 < s2 - r) { if (s2 - dd2 < s2 - r) { cout << -1; return 0; } cout.precision(30); cout << xx2; return 0; } else { cout.precision(30); cout << xx1; } }
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; long long power(long long a, long long b) { a = a % mod; long long ans = 1; while (b > 0) { if (b % 2 == 1) { ans = (ans * a) % mod; } b = b / 2; a = (a * a) % mod; } return ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t; cin >> t; while (t--) { long long n; cin >> n; long long loc[n + 1]; long long a[n]; for (long long i = 0; i < n; i++) { cin >> a[i]; loc[a[i]] = i; } map<long long, long long> p; long long m = 0; for (long long i = 1; i <= n; i++) { for (long long j = loc[i]; j - 1 >= 0 && p[j - 1] == 0; j--) { if (m > (n - 1)) { break; } if (a[j - 1] > a[j]) { swap(loc[a[j]], loc[a[j - 1]]); swap(a[j], a[j - 1]); p[j - 1]++; m++; } else { break; } } } for (long long i = 0; i < n; i++) { cout << a[i] << ; } cout << endl; } }
#include <bits/stdc++.h> using namespace std; const long long maxn = 3e5 + 10; long long ans; long long n, k; long long s[maxn]; long long l[maxn]; long long r[maxn]; long long seg[4 * maxn]; long long lazy[4 * maxn]; vector<long long> bois[maxn]; void in(); void solve(); long long doaz(long long); long long get(long long, long long, long long, long long, long long); void upd(long long, long long, long long, long long, long long); void push(long long, long long, long long); void out(); int main() { ios::sync_with_stdio(false); cin.tie(0); in(); solve(); out(); } void in() { cin >> n >> k; for (long long i = 0; i < n; i++) cin >> s[i]; for (long long i = 0; i < k; i++) cin >> l[i] >> r[i]; } void solve() { sort(s, s + n); for (long long i = 0; i < k; i++) { l[i] = lower_bound(s, s + n, l[i]) - s; r[i] = upper_bound(s, s + n, r[i]) - s; bois[l[i]].push_back(i); bois[r[i]].push_back(i); } for (long long i = 0; i < n; i++) { l[k + i] = i; r[k + i] = i + 1; bois[i].push_back(k + i); } ans = n * (n - 1) * (n - 2) / 6; for (long long i = 0; i < n; i++) { for (auto j : bois[i]) upd(1, 0, n, l[j], r[j]); ans -= doaz(get(1, 0, n, 0, n) - get(1, 0, n, i, i + 1)); } } long long get(long long id, long long l, long long r, long long L, long long R) { if (r <= L || R <= l) return 0; if (L <= l && r <= R) return seg[id]; if (lazy[id]) push(id, l, r); long long mid = (l + r) >> 1; return get(id << 1, l, mid, L, R) + get(id << 1 | 1, mid, r, L, R); } void upd(long long id, long long l, long long r, long long L, long long R) { if (r <= L || R <= l) return; if (L <= l && r <= R) { seg[id] = r - l - seg[id]; lazy[id] = 1 - lazy[id]; return; } if (lazy[id]) push(id, l, r); long long mid = (l + r) >> 1; upd(id << 1, l, mid, L, R); upd(id << 1 | 1, mid, r, L, R); seg[id] = seg[id << 1] + seg[id << 1 | 1]; } void push(long long id, long long l, long long r) { long long mid = (l + r) >> 1; lazy[id] = 0; lazy[id << 1] = 1 - lazy[id << 1]; lazy[id << 1 | 1] = 1 - lazy[id << 1 | 1]; seg[id << 1] = mid - l - seg[id << 1]; seg[id << 1 | 1] = r - mid - seg[id << 1 | 1]; } bool cmp(long long i, long long j) { return s[i] < s[j]; } long long doaz(long long x) { return x * (x - 1) / 2; } void out() { cout << ans; }
#include <bits/stdc++.h> using namespace std; void dbg() { std::cout << # n ; } template <typename T, typename... Args> void dbg(T a, Args... args) { std::cout << a << ; dbg(args...); } const long long maxn = 2e5 + 10; const long long MAX = 1000; const long long inf = 0x3f3f3f3f; const long long mod = 1e9 + 7; long long n, d, m; long long a[maxn]; long long b[maxn]; multiset<long long> small; void solve() { cin >> n >> d >> m; for (long long i = (1); i <= (n); ++i) { cin >> a[i]; } sort(a + 1, a + 1 + n); long long pos = upper_bound(a + 1, a + 1 + n, m) - a; long long cans = 0; long long ans = 0; for (long long i = (1); i <= (pos - 1); ++i) small.insert(a[i]), cans += a[i]; long long forsmall = n - 1; ans = max(cans, ans); for (long long i = (1); i <= (n - pos + 1); ++i) { if (forsmall < 0) break; while (small.size() > forsmall) { cans -= *small.begin(); small.erase(small.begin()); } cans += a[n - i + 1]; ans = max(ans, cans); forsmall -= (d + 1); } cout << (ans) << endl; } signed main() { long long TestCase = 1; while (TestCase--) { solve(); } char EndFile = getchar(); EndFile = getchar(); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int arr[101], n, imin = 0, imax = 0; cin >> n; for (int i = 1; i <= n; i++) { cin >> arr[i]; if (arr[i] == 1) imin = i; else if (arr[i] == n) imax = i; } int a; if (imax < imin) swap(imax, imin); int rsp = abs(imin - imax) + max(n - imax, imin - 1); cout << rsp; return 0; }
#include <bits/stdc++.h> using namespace std; void solve() { long long n; cout << fixed; setprecision(15); double x, y; cin >> n >> x >> y; long long p1 = 0, p2 = 0, ans = 0; set<double> s; for (long long i = 0; i < n; i++) { double a, b; cin >> a >> b; if (a == x) { if (s.find((double)1e7) == s.end()) { s.insert((double)1e7); } continue; } if (b == y) { if (s.find((double)1e6) == s.end()) { s.insert((double)1e6); } continue; } double slope = (double)(b - y) / (a - x); if (s.find(slope) == s.end()) { s.insert(slope); } } cout << (long long)s.size() << n ; } signed main() { ios_base ::sync_with_stdio(0); cin.tie(0); solve(); }
#include <bits/stdc++.h> using namespace std; int par[200010]; bool isLeaf[200010]; vector<int> adj[200010]; long long f[200010], dp[200010], s[200010], ans = 0, n; void duyet(int u) { s[u] = 1; f[u] = 0; for (int i = 0; i < adj[u].size(); i++) { int v = adj[u][i]; if (par[u] != v) { par[v] = u; duyet(v); s[u] += s[v]; f[u] += f[v]; } } f[u] += s[u]; } void cal(int u) { long long tong = 0; dp[u] = dp[par[u]] - 2 * s[u] + n; ans = max(ans, dp[u]); for (int i = 0; i < adj[u].size(); i++) { int v = adj[u][i]; if (par[u] != v) { cal(v); } } } void solve() { cin >> n; for (int i = 1; i < n; i++) { int x, y; cin >> x >> y; par[i] = 0; adj[x].push_back(y); adj[y].push_back(x); } par[n] = 0; duyet(1); dp[1] = f[1]; for (int i = 0; i < adj[1].size(); i++) { int v = adj[1][i]; cal(v); } cout << ans << endl; } int main() { solve(); return 0; }
#include <bits/stdc++.h> using namespace std; constexpr long long maxn = 2e5 + 5, inf = 0x3f3f3f3f, mod = 1e9 + 7; long long n, m, du[maxn], vis[maxn], f[maxn]; long long res, ans = 1; vector<long long> e[maxn]; map<pair<long long, long long>, long long> mp; inline long long ksm(long long a, long long b) { long long k = 1; while (b) { if (b & 1) k = k * a % mod; a = a * a % mod; b >>= 1; } return k; } void topo() { queue<long long> q; for (long long i = 1; i <= n; i++) { if (du[i] == 1) { q.push(i); vis[i] = i; } } while (!q.empty()) { long long u = q.front(); q.pop(); for (auto v : e[u]) { du[v]--; if (du[v] <= 1 && !vis[v]) { vis[v] = v; q.push(v); } } } } void dfs(long long u, long long fa) { vis[u] = fa; f[fa]++; for (auto v : e[u]) { if (!vis[v] && du[v] > 1) { dfs(v, fa); } } } signed main() { cin >> n; long long flag = 0; for (long long i = 1; i <= n; i++) { long long x; cin >> x; e[i].emplace_back(x); e[x].emplace_back(i); du[i]++; du[x]++; } topo(); for (long long i = 1; i <= n; i++) { if (!vis[i] && du[i] > 1) { dfs(i, i); } } for (long long i = 1; i <= n; i++) { if (vis[i] == i && f[i] == 0) { res++; } else if (vis[i] == i && f[i] > 1) { ans = ans * (ksm(2, f[i]) - 2) % mod; } } cout << ans * ksm(2, res) % mod; }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); long long int n, s, p, q; char d; map<long long int, long long int> p1, p2; cin >> n >> s; for (long long int i = 1; i <= n; i++) { cin >> d >> p >> q; if (d == B ) p1[p] += q; else if (d == S ) p2[p] += q; } map<long long int, long long int>::reverse_iterator rit; map<long long int, long long int>::iterator it; vector<pair<long long int, long long int> > p3; long long int cnt = 0; for (it = p2.begin(); it != p2.end(); it++) { if (cnt < s) { p3.push_back(make_pair(it->first, it->second)); cnt++; } } cnt = 0; reverse(p3.begin(), p3.end()); vector<pair<long long int, long long int> >::iterator it2; for (it2 = p3.begin(); it2 != p3.end(); ++it2) { if (cnt < s) { cout << S << << it2->first << << it2->second << endl; cnt++; } } cnt = 0; for (rit = p1.rbegin(); rit != p1.rend(); ++rit) { if (cnt < s) { cout << B << << rit->first << << rit->second << endl; cnt++; } } return 0; }
#include <bits/stdc++.h> using namespace std; char s[1005][1005]; int sum[1005][1005]; int mn = 1000000007, area = 0; int X, Y, n, m; int extend(int x, int y, int dx, int dy) { int mx = 0; if (x + dx <= n && y + dy - 1 <= m && sum[x + dx][y + dy - 1] - sum[x + dx][y - 1] - sum[x][y + dy - 1] + sum[x][y - 1] == dx * dy) mx = dy + extend(x + 1, y, dx, dy); else if (y + dy <= m && x + dx - 1 <= n && sum[x + dx - 1][y + dy] - sum[x + dx - 1][y] - sum[x - 1][y + dy] + sum[x - 1][y] == dx * dy) mx = dx + extend(x, y + 1, dx, dy); return mx; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m; for (int i = 1; i <= n; i++) cin >> (s[i] + 1); int x, y; for (x = 1; x <= n; x++) { for (y = 1; y <= m; y++) if (s[x][y] == X ) break; if (y < m + 1) break; } X = x, Y = y; int extX = 0, extY = 0; for (int i = x; i <= n; i++) if (s[i][y] == X ) extX++; for (int i = y; i <= m; i++) if (s[x][i] == X ) extY++; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { sum[i][j] = (sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + (s[i][j] == X )), area += (s[i][j] == X ); } for (int dx = 1; dx <= extX; dx++) { if (dx * extY > mn) break; if (sum[x + dx - 1][y + extY - 1] - sum[x + dx - 1][y - 1] - sum[x - 1][y + extY - 1] + sum[x - 1][y - 1] == dx * extY) { int dArea = dx * extY + extend(x, y, dx, extY); if (dArea == area && dx * extY < mn) mn = dx * extY; } } for (int dy = 1; dy <= extY; dy++) { if (dy * extX > mn) break; if (sum[x + extX - 1][y + dy - 1] - sum[x + extX - 1][y - 1] - sum[x - 1][y + dy - 1] + sum[x - 1][y - 1] == extX * dy) { int dArea = dy * extX + extend(x, y, extX, dy); if (dArea == area && extX * dy < mn) mn = extX * dy; } } if (mn == 1000000007) cout << -1 << endl; else cout << mn << endl; }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int n, q; cin >> n >> q; set<int> s; multiset<int> m; auto add = [&](int x) { auto it = s.insert(x).first; if (next(it) != s.end() && it != s.begin()) m.erase(m.find(*next(it) - *prev(it))); if (next(it) != s.end()) m.insert(*next(it) - x); if (it != s.begin()) m.insert(x - *prev(it)); }; auto rm = [&](int x) { s.erase(x); auto it = s.lower_bound(x); if (it != s.end()) m.erase(m.find(*it - x)); if (it != s.begin()) m.erase(m.find(x - *prev(it))); if (it != s.end() && it != s.begin()) m.insert(*it - *prev(it)); }; for (int i = 0; i < n; i++) { int x; cin >> x; add(x); } auto solve = [&]() -> long long { if (s.size() <= 1) return 0; else return (*s.rbegin() - *s.begin() - *m.rbegin()); }; cout << solve() << n ; while (q--) { int t, x; cin >> t >> x; if (t == 0) rm(x); else add(x); cout << solve() << n ; } return 0; }
// author: sharad12arse #include<bits/stdc++.h> using namespace std; #define ll long long #define ull unsigned long long #define gcd __gcd #define INF LONG_LONG_MAX void solve(){ int n; cin>>n; ll a1=0,a2=0,x=0; vector<ll> arr(n); for(int i=0;i<n;i++){ cin>>arr[i]; x^=arr[i]; } a2=x; for(int i=0;i<n-1;i++){ a1^=arr[i]; a2^=arr[i]; if(a1==a2){ cout<< YES n ; return; } } a1=0,a2=0; for(int i=0;i<n-1;i++){ a1^=arr[i]; a2=0; for(int j=n-1;j>i;j--){ a2^=arr[j]; if(a1==a2&&((x^a1)^a2)==a1){ cout<< YES n ; return; } } } cout<< NO n ; } int main(){ ios_base::sync_with_stdio(0); cin.tie(0); int t=1; cin>>t; while(t--){ solve(); } }
#include <bits/stdc++.h> using namespace std; const int MX = 200005; const int MD = 998244353; void add(int& a, int b) { a += b; if (a >= MD) a -= MD; } void sub(int& a, int b) { a -= b; if (a < 0) a += MD; } int mod_mult(long long a, long long b) { return (a * b) % MD; } int h[MX]; int fact[MX]; int inv_fact[MX]; int exp(int a, int b) { int res = 1; while (b) { if (b % 2 == 1) res = mod_mult(res, a); a = mod_mult(a, a); b /= 2; } return res; } int C(int n, int k) { int tmp = fact[n]; tmp = mod_mult(tmp, inv_fact[k]); tmp = mod_mult(tmp, inv_fact[n - k]); return tmp; } int f(int x) { int tmp = exp(2, x); if (x % 2 == 0) { sub(tmp, C(x, x / 2)); } tmp = mod_mult(tmp, inv_fact[2]); return tmp; } int main() { fact[0] = 1; for (int i = 1; i < MX; i++) { fact[i] = mod_mult(fact[i - 1], i); } inv_fact[MX - 1] = exp(fact[MX - 1], MD - 2); for (int i = MX - 2; i >= 0; i--) { inv_fact[i] = mod_mult(inv_fact[i + 1], i + 1); } int n, k; ignore = scanf( %d %d , &n, &k); for (int i = 0; i < n; i++) { ignore = scanf( %d , h + i); } int mult_at_end = 1; int B = 0; for (int i = 0; i < n; i++) { if (h[i] == h[(i + 1) % n]) { mult_at_end = mod_mult(mult_at_end, k); } else { B++; } } int ans = 0; for (int c = 0; c <= B; c++) { int tmp = exp(k - 2, c); tmp = mod_mult(tmp, C(B, c)); tmp = mod_mult(tmp, f(B - c)); add(ans, tmp); } ans = mod_mult(ans, mult_at_end); printf( %d n , ans); }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; while (n--) { long long s, a, b, c; cin >> s >> a >> b >> c; s /= c; s += (s / a) * b; cout << s << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 10; const int M = 2; struct Node { int parent, rela; void set(int p, int r) { parent = p; rela = r; } } node[maxn]; int Find(int x) { int tmp_p; if (node[x].parent != x) { tmp_p = node[x].parent; node[x].parent = Find(node[x].parent); node[x].rela = (node[x].rela + node[tmp_p].rela) % M; } return node[x].parent; } void Merge(int a, int b, int p, int q, int d) { node[p].parent = q; node[p].rela = (node[b].rela - node[a].rela - d + M) % M; } int n, m; const long long mod = 1e9 + 7; void init() { for (int i = 0; i < maxn; ++i) { node[i].parent = i, node[i].rela = 0; } } long long powerMod(int x, int k) { long long res = 1; long long base = x; while (k) { if (k & 1) res = res * base % mod; base = base * base % mod; k >>= 1; } return res; } int main() { init(); int num = 0; cin >> n >> m; int res = 1; for (int i = 0; i < m; ++i) { int a, b, c; cin >> a >> b >> c; int p = Find(a); int q = Find(b); if (p != q) Merge(a, b, p, q, c ^ 1); else { if ((node[a].rela - node[b].rela + 2) % 2 != 1 - c) res = 0; } } if (res == 0) cout << res << endl; else { for (int i = 1; i <= n; ++i) if (Find(i) == i) num++; cout << powerMod(2, num - 1) << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const long long maxn = 2e6 + 6; const long long MOD = 1e9 + 7; bool comparator(long long i, long long j) { return (i < j); } struct setCompare { bool operator()(const int64_t& lhs, const int64_t& rhs) const {} }; long long power(long long x, long long i) { long long ans = 1; while (i > 0) { if (i & 1) ans = (ans * x) % MOD; i >>= 1; x = (x * x) % MOD; } return ans; } long long power(long long x, long long i, long long mod) { long long ans = 1; while (i > 0) { if (i & 1) ans = (ans * x) % mod; i >>= 1; x = (x * x) % mod; } return ans; } long long modInverse(long long x, long long mod) { return power(x, mod - 2, mod); } bool isPalindrome(string s) { long long limit = s.length() / 2; for (long long i = 0; i < limit; i++) if (s[i] != s[s.length() - i - 1]) return false; return true; } long long gcd(long long x, long long y) { long long t; while (y != 0) t = x % y, x = y, y = t; return x; } bool isVowel(char ch) { if (ch == a || ch == i || ch == e || ch == u || ch == o || ch == y ) { return true; } return false; } bool isPrime(long long n) { long long root = sqrt(n); for (long long i = 2; i <= root; i++) if (n % i == 0) return 0; return 1; } long double getDisSquare(long double asdfg, long double qwert, long double gfdsa, long double trewq) { return ((asdfg - gfdsa) * (asdfg - gfdsa) + (qwert - trewq) * (qwert - trewq)); } bool isSquareHelper(long long asdfg, long long qwert, long long gfdsa, long long trewq, long long x3, long long y3, long long x4, long long y4) { long double d1, d2, d3, d4, d5, d6; d1 = getDisSquare(asdfg, qwert, gfdsa, trewq); d2 = getDisSquare(gfdsa, trewq, x3, y3); d3 = getDisSquare(x3, y3, x4, y4); d4 = getDisSquare(x4, y4, asdfg, qwert); if (d1 == d2 && d1 == d3 && d1 == d4) { d5 = getDisSquare(asdfg, qwert, x3, y3); d6 = getDisSquare(gfdsa, trewq, x4, y4); if (d5 == d6) { return 1; } } return 0; } bool isSquare(long long asdfg, long long qwert, long long gfdsa, long long trewq, long long x3, long long y3, long long x4, long long y4) { if (isSquareHelper(asdfg, qwert, gfdsa, trewq, x3, y3, x4, y4) || isSquareHelper(asdfg, qwert, gfdsa, trewq, x4, y4, x3, y3) || isSquareHelper(asdfg, qwert, x3, y3, gfdsa, trewq, x4, y4)) return 1; else return 0; } bool isEqualateralTriangle(long long asdfg, long long qwert, long long gfdsa, long long trewq, long long x3, long long y3) { long long d1 = getDisSquare(asdfg, qwert, gfdsa, trewq); long long d2 = getDisSquare(gfdsa, trewq, x3, y3); long long d3 = getDisSquare(x3, y3, asdfg, qwert); if (d1 == d2 && d1 == d3) { return 1; } else return 0; } bool isRightAngleTriangleHelper(long long asdfg, long long qwert, long long gfdsa, long long trewq, long long x3, long long y3) { long long d1 = getDisSquare(asdfg, qwert, gfdsa, trewq); long long d2 = getDisSquare(gfdsa, trewq, x3, y3); long long d3 = getDisSquare(x3, y3, asdfg, qwert); if (d2 == (d1 + d3)) { return 1; } return 0; } bool isRightAngleTriangle(long long asdfg, long long qwert, long long gfdsa, long long trewq, long long x3, long long y3) { if (isRightAngleTriangleHelper(asdfg, qwert, gfdsa, trewq, x3, y3) || isRightAngleTriangleHelper(gfdsa, trewq, x3, y3, asdfg, qwert) || isRightAngleTriangleHelper(x3, y3, asdfg, qwert, gfdsa, trewq)) return 1; return 0; } bool areCollinear(long long asdfg, long long qwert, long long gfdsa, long long trewq, long long x3, long long y3) { return ((x3 - asdfg) * (trewq - qwert) == (y3 - qwert) * (gfdsa - asdfg)); } long long n, a, b, c, t[maxn], k; void getInput() { cin >> n >> a >> b >> c >> k; for (long long i = 0; i < n; i++) cin >> t[i]; } void getAnswer() {} void solve() { sort(t, t + n); long long ans = 0; long long x, y; x = a / b; y = a % b; for (long long i = 0; i < n; i++) { if (b >= c) { ans += a; } else { long long tt = k - t[i]; ans += (a - b * tt + c * tt); } } cout << ans << n ; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t = 1; while (t--) getInput(), solve(); return 0; }
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const long long MX = 1e9; const long long INF = 1e9; void solve() { string s; cin >> s; int n = s.length(), mx[n + 1], c = 0; for (int i = 0; i < s.length(); ++i) { if (s[i] == 1 ) ++c; else if (c) --c; mx[i] = c; } mx[n + 1] = c; for (int i = n - 1; i >= 0; --i) mx[i] = min(mx[i], mx[i + 1]); int nz = 0; for (int i = 0; i < n; ++i) { if (s[i] == 1 ) { if (nz < mx[i + 1]) { s[i] = 0 ; ++nz; } } } cout << s << n ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); return 0; }