Datasets:
malteklaes
/
cpp-code-code_search_net-style

Dataset card Data Studio Files Community
1
func_code_string
stringlengths
59
71.4k
#include <bits/stdc++.h> using namespace std; int N; vector<int> a, b; int main() { int n, m, k, x; cin >> n >> m >> k; for (int i = 0; i < n; ++i) { cin >> x; a.push_back(x); } for (int i = 0; i < m; ++i) { cin >> x; b.push_back(x); } sort(a.begin(), a.end()); sort(b.begin(), b.end()); int i = a.size() - 1; int j = b.size() - 1; while (i >= 0 && j >= 0 && a[i] <= b[j]) { --i; --j; } if (i >= 0) cout << YES << endl; else cout << NO << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int n, m; int main() { ios_base::sync_with_stdio(false); cin >> n >> m; if (m == 3 && n != 4 && n != 3) { cout << -1; return false; } int x = 0, y = 0; for (int i = 1; i <= m; i++) { cout << x << << y << endl; x++; y += i; } x = 1000000, y = 0; for (int i = 1; i <= n - m; i++) { cout << x << << y << endl; x--; y += i; } }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 100, M = 10 + 10, SQ = 333; pair<int, int> nxt[N][M]; char a[N][M]; bool mark[N][M]; int n, m, q; bool OK(pair<int, int> x) { return x.first > 0 && x.second > 0 && x.second <= m; } pair<int, int> go(int x, int y) { if (!OK({x, y})) return {x, y}; if (nxt[x][y].first != -2) return nxt[x][y]; if (a[x][y] == ^ ) return x % SQ ? nxt[x][y] = go(x - 1, y) : nxt[x][y] = {x - 1, y}; if (mark[x][y]) return nxt[x][y] = {-1, -1}; mark[x][y] = true; if (a[x][y] == > ) nxt[x][y] = go(x, y + 1); if (a[x][y] == < ) nxt[x][y] = go(x, y - 1); mark[x][y] = false; return nxt[x][y]; } int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); for (int i = 0; i < N; i++) for (int j = 0; j < M; j++) nxt[i][j] = {-2, -2}; cin >> n >> m >> q; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) cin >> a[i][j]; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) go(i, j); while (q--) { char tp; int x, y; cin >> tp >> x >> y; if (tp == A ) { pair<int, int> tmp = {x, y}; while (OK(tmp)) tmp = nxt[tmp.first][tmp.second]; cout << tmp.first << << tmp.second << n ; } else { cin >> a[x][y]; int A = 0; while (A <= x) A += SQ; for (int i = x; i <= min(A, n); i++) for (int j = 1; j <= m; j++) nxt[i][j] = {-2, -2}; for (int i = x; i <= min(A, n); i++) for (int j = 1; j <= m; j++) go(i, j); } } }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin.tie(0); cout.tie(0); int n; cin >> n; int arr[n]; for (auto& elem : arr) { cin >> elem; } for (int i = 1; i <= n; ++i) { for (int j = 0; j < n; ++j) { if (arr[j] == i) { cout << j + 1 << ; } } } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 505; const int mod = 1000000007; int a, b, c, d, e, f, g, h, i, j; int Mi[N * N]; int F[N][N], K; void Work() { Mi[0] = 1; for (int ii = 1; ii <= a * a; ii++) Mi[ii] = (Mi[ii - 1] << 1) % mod; F[0][0] = 1; for (int ii = 1; ii <= a; ii++) for (int jj = 1; jj <= K; jj++) { for (int kk = 0; kk < ii; kk++) (F[ii][jj] += (long long)F[kk][jj - 1] * (Mi[ii - kk] - 1) % mod * (Mi[(ii - kk) * kk]) % mod) %= mod; } int an = 0; for (int ii = 0; ii <= a; ii++) (an += (long long)F[ii][K] * Mi[(a - ii) * ii] % mod) %= mod; cout << an << endl; } int main() { cin >> a >> K; Work(); return 0; }
#include <bits/stdc++.h> using namespace std; long long q, a[555555], k, l, m, n, o, p; const long long mod = 1e9 + 7; queue<long long> qq[100005]; struct node { node *left, *right; long long val; node() { val = 0; left = right = this; } node(node *le, node *re, long long va) { le = left, re = right; val = va; } }; node *ver[555555]; void build(long long s, long long e, node *r) { if (s == e) { return; } r->left = new node(NULL, NULL, 0); r->right = new node(NULL, NULL, 0); build(s, ((s + e) / 2), r->left), build(((s + e) / 2) + 1, e, r->right); } void update(long long s, long long e, long long id, long long val, node *r1, node *r2) { if (s > id || e < id) return; if (s == e) { r2->val = val; return; } if (id <= ((s + e) / 2)) { r2->right = r1->right; r2->left = new node(NULL, NULL, 0); update(s, ((s + e) / 2), id, val, r1->left, r2->left); } else { r2->left = r1->left; r2->right = new node(NULL, NULL, 0); update(((s + e) / 2) + 1, e, id, val, r1->right, r2->right); } r2->val = r2->left->val + r2->right->val; } long long query(long long s, long long e, node *r1, long long l, long long r) { if (l > e || s > r) return 0; if (l <= s && e <= r) return r1->val; return query(s, ((s + e) / 2), r1->left, l, r) + query(((s + e) / 2) + 1, e, r1->right, l, r); } void solve() { cin >> n >> m; ver[0] = new node(); for (long long i = 1; i <= n; i++) cin >> a[i]; for (long long i = 1; i <= n; i++) { k = a[i]; ver[i * 2 - 1] = new node(NULL, NULL, 0); ver[i * 2] = new node(NULL, NULL, 0); update(1, n, i, 1, ver[i * 2 - 2], ver[i * 2 - 1]); if (qq[k].size() == m) { long long op = qq[k].front(); qq[k].pop(); update(1, n, op, 0, ver[i * 2 - 1], ver[i * 2]); } else ver[i * 2] = ver[i * 2 - 1]; qq[k].push(i); } long long last = 0, s, e; cin >> l; while (l--) { cin >> s >> e; o = (s + last) % n + 1; p = (e + last) % n + 1; if (o > p) swap(o, p); last = query(1, n, ver[2 * p], o, n); cout << last << endl; } } int main() { q = 1; while (q--) { solve(); } }
#include <bits/stdc++.h> using namespace std; long long dp[5010][5010]={}; long long cnt[5010]={}; long long a[5000]; long long mod=1e9+7; signed main() { int n,k,q; cin>>n>>k>>q; for(int i=0;i<n;i++){ cin>>a[i]; } for(int i=0;i<n;i++)dp[i][0]=1; for(int j=1;j<=k;j++){ dp[0][j]=dp[1][j-1]; for(int i=1;i<n-1;i++){ dp[i][j]=dp[i-1][j-1]+dp[i+1][j-1]; dp[i][j]%=mod; } dp[n-1][j]=dp[n-2][j-1]; } long long b; long long sum=0; for(int i=0;i<n;i++){ for(int j=0;j<=k;j++){ b=dp[i][j]*dp[i][k-j]; b%=mod; cnt[i]+=b; cnt[i]%=mod; } sum+=(cnt[i]*a[i])%mod; sum%=mod; } for(int i=0;i<q;i++){ long long x,y; cin>>x>>y; long long f=cnt[x-1]*(y),g=cnt[x-1]*a[x-1]; sum+=mod+(f%mod+mod)%mod-(g%mod+mod)%mod; sum%=mod; a[x-1]=y; cout<<sum<< n ; } }
#include <bits/stdc++.h> using namespace std; int main() { char a[200]; char c; int i = 0; while ((c = getchar()) != n ) { a[i] = c; i++; } for (int k = 0; k < i - 2; k++) { if (a[k] == W && a[k + 1] == U && a[k + 2] == B ) { a[k] = ; a[k + 1] = ; a[k + 2] = ; } } int s; for (s = 0; s < i; s++) { if (a[s] != ) { cout << a[s]; break; } } for (int j = s + 1; j < i; j++) { if (a[j] != && a[j - 1] != ) cout << a[j]; if (a[j] != && a[j - 1] == ) cout << << a[j]; } }
#include <bits/stdc++.h> using namespace std; int main() { string t; cin >> t; string s; bool a = true; for (int i = 0; i < t.size(); i++) { if (a && t[i] == 0 ) { a = false; continue; } s.push_back(t[i]); } if (a) s.erase(s.begin()); cout << s << endl; return 0; }
#include <bits/stdc++.h> int a[105]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; ++i) scanf( %d , &a[i]); int s = 0; for (int i = 0; i < n; ++i) { int t = 0; for (int j = i; j < n; ++j) { t ^= a[j]; if (s < t) s = t; } } printf( %d n , s); return 0; }
#include <bits/stdc++.h> using namespace std; map<pair<long long, long long>, long long> O; map<pair<long long, long long>, long long>::iterator oit; map<long long, long long> X, Y; map<long long, long long>::iterator it; int main() { int n; cin >> n; for (int i = 0; i < n; ++i) { double x, y; cin >> x >> y; O[make_pair(x, y)]++; X[x]++; Y[y]++; } long long cnt = 0; for (it = X.begin(); it != X.end(); ++it) if (it->second > 1) cnt += (it->second - 1) * (it->second) / 2; for (it = Y.begin(); it != Y.end(); ++it) if (it->second > 1) cnt += (it->second - 1) * (it->second) / 2; for (oit = O.begin(); oit != O.end(); ++oit) if (oit->second > 1) cnt -= (oit->second - 1) * (oit->second) / 2; cout << cnt << endl; return 0; }
#include <bits/stdc++.h> using namespace std; vector<int> num, con, a; vector<vector<int> > g(1000001); bool used[1000001]; void dfs(int v) { num.push_back(v); con.push_back(a[v - 1]); used[v] = true; if (g[v].empty()) return; for (int i = 0; i < g[v].size(); i++) if (!used[g[v][i]]) dfs(g[v][i]); return; } int main() { int n, m; cin >> n >> m; int x, y; a.assign(n, 0); for (int i = 0; i < n; i++) scanf( %d , &a[i]); for (int i = 0; i < m; i++) { scanf( %d%d , &x, &y); g[x].push_back(y); g[y].push_back(x); } for (int i = 1; i <= n; i++) { num.resize(0); con.resize(0); if (used[i]) continue; dfs(a[i - 1]); sort(num.begin(), num.end()); sort(con.rbegin(), con.rend()); for (int j = 0; j < num.size(); j++) { a[num[j] - 1] = con[j]; } } for (int i = 0; i < n; i++) cout << a[i] << ; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 2e6 + 7; const int M = 2e6 + 7; const int lim = 1e6; const int mod = 1e9 + 7; const int inf = 0x3f3f3f3f; long long ksm(long long a, long long b, long long p) { long long ret = 1; while (b) { if (b & 1) (ret *= a) %= p; (a *= a) %= p; b >>= 1; } return ret; } long long inv(long long x) { return ksm(x, mod - 2, mod); } int main() { long long k, x, a = 1, b = 1, f1 = 0, f2 = 0; scanf( %lld , &k); for (int i = 1; i <= k; i++) { scanf( %lld , &x); if (x % 2 == 0) f1 = 1; if (x == 0) f2 = 1; (b *= x % (mod - 1)) %= mod - 1; (a *= x % 2) %= 2; } b = (b - 1 + mod - 1) % (mod - 1); long long bb = ksm(2, b, mod); if (f1 == 0) f1 = -1; long long aa = (bb + f1 + mod) % mod, t = ksm(2, (a - 1 + 2) % 2, 3); t = (t + f1 + 3) % 3; if (t == 0) aa = aa * inv(3) % mod; else bb *= 3; printf( %lld/%lld n , aa, bb); return 0; }
#include <bits/stdc++.h> inline long long gcd(long long a, long long b) { return (b ? gcd(b, a % b) : a); } inline long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; } inline int cmp(double x, double y = 0, double tol = 1e-7) { return (x <= y + tol) ? (x + tol < y) ? -1 : 0 : 1; } using namespace std; const int MAXN = 1e5 + 5; vector<int> adj[MAXN]; int y[MAXN]; int qy[MAXN]; void G(int n, int pai) { y[n] = 0; for (int i = 0; i < adj[n].size(); i++) { int x = adj[n][i]; if (x != pai && adj[x].size() <= 2) G(x, n); } } int main() { int n, a, b, x; cin >> n; for (int i = 0; i < n - 1; i++) { scanf( %d %d , &a, &b); adj[a].push_back(b); adj[b].push_back(a); } for (int i = 0; i < MAXN; i++) y[i] = 1; memset(qy, 0, sizeof qy); for (int i = 1; i < n + 1; i++) { if (adj[i].size() == 1 && y[i]) G(i, -1); } for (int i = 1; i < n + 1; i++) { int a = 0, b = 0; for (int j = 0; j < adj[i].size(); j++) { x = adj[i][j]; if (y[x]) a++; else b++; } qy[i] = a + max(b - 2, 0); } bool ans = true; for (int i = 1; i < n + 1; i++) { if (!y[i]) continue; int cnt = 0; for (int j = 0; j < adj[i].size(); j++) { a = adj[i][j]; if (qy[a] > 1) cnt++; } if (cnt > 2) { ans = false; break; } } cout << (ans ? Yes n : No n ); }
#include <bits/stdc++.h> #define ln n #define all(dat) dat.begin(), dat.end() #define loop(i, to) for (int i = 0; i < to; ++i) #define cont(i, to) for (int i = 1; i <= to; ++i) #define circ(i, fm, to) for (int i = fm; i <= to; ++i) #define foreach(i, dat) for (__typeof(dat.begin()) i = dat.begin(); i != dat.end(); ++i) typedef long long num; using namespace std; const int nsz = 2e5; bool on[nsz + 5], vis[nsz + 5]; int n, m, rt = 1, dis[nsz + 5], ans[nsz + 5]; int pr[nsz + 5], dep[nsz + 5], siz[nsz + 5], mxs[nsz + 5]; struct graph { int sz, hd[nsz + 5]; struct edge { int nxt, to; edge() {} edge(int nxt, int to) { this->nxt = nxt, this->to = to; } } e[2 * nsz + 5]; inline edge& operator [] (int id) { return e[id]; } void inline link(int u, int v) { e[++sz] = edge(hd[u], v), hd[u] = sz; e[++sz] = edge(hd[v], u), hd[v] = sz; } }; graph g; struct fenwick_tree { int t, tr[nsz + 5], tm[nsz + 5]; void inline clear() { ++t; } void inline chg(int u) { if (tm[u] != t) tm[u] = t, tr[u] = 0; } void inline upd(int u, int w) { for (++u; u > 0; u -= u & -u) chg(u), tr[u] = max(tr[u], w); } int inline qry(int u) { int res = 0; for (++u; u <= n + 1; u += u & -u) chg(u), res = max(res, tr[u]); return res; } }; fenwick_tree tr; void inline bfs() { static int q[nsz + 5]; int ql = 0, qr = 0; cont (u, n) dis[u] = n; cont (u, n) if (on[u]) dis[u] = 0, q[qr++] = u; for (; ql != qr;) { int u = q[ql++]; for (int i = g.hd[u]; i; i = g[i].nxt) { int v = g[i].to; if (dis[v] > dis[u] + 1) dis[v] = dis[u] + 1, q[qr++] = v; } } } void dfs1(vector<int> &nd, int u, int p = -1) { siz[u] = mxs[u] = 1; nd.push_back(u); for (int i = g.hd[u]; i; i = g[i].nxt) { int v = g[i].to; if (v == p || vis[v]) continue; dfs1(nd, v, u); siz[u] += siz[v]; mxs[u] = max(mxs[u], siz[v]); } } void dfs2(int u, int p = -1) { for (int i = g.hd[u]; i; i = g[i].nxt) { int v = g[i].to; if (v == p || vis[v]) continue; dep[v] = dep[u] + 1; dfs2(v, u); } } int inline find_rt(vector<int> &nd, int u) { dfs1(nd, u); int sz = siz[u]; loop (i, nd.size()) { int u = nd[i], cur = max(mxs[u], sz - siz[u]); if (cur * 2 <= sz) return u; } return u; } void inline calc(vector<int> &nd, int u) { dep[u] = 0, dfs2(u); loop (i, nd.size()) { int u = nd[i], k = dis[u] - dep[u] - 1; if (k >= 0) tr.upd(k, dis[u]); } loop (i, nd.size()) { int u = nd[i], k = dep[u]; ans[u] = max(ans[u], tr.qry(k)); } tr.clear(); } void solve(int u = rt) { vector<int> nd; u = find_rt(nd, u); calc(nd, u); vis[u] = 1; for (int i = g.hd[u]; i; i = g[i].nxt) { int v = g[i].to; if (!vis[v]) solve(v); } } int main() { scanf( %d , &n); cont (i, n - 1) { int u, v; scanf( %d%d , &u, &v); g.link(u, v); } scanf( %d , &m); cont (i, m) { int u; scanf( %d , &u); on[u] = 1; } bfs(); solve(); cont (u, n) printf( %d%c , ans[u], n [u < n]); }
#include <bits/stdc++.h> using namespace std; int a, b, c, d, k, t; int main() { cin >> t; while (t--) { cin >> a >> b >> c >> d >> k; bool isok = 0; for (int i = 1; i <= k; i++) { if (i * c >= a && (k - i) * d >= b) { isok = 1; cout << i << << k - i << endl; break; } } if (!isok) cout << -1 << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 200002; double eps = 1e-9; int T, N, M, K, mx, sum, ans; int a, b, c; bool visit[MAXN], call[MAXN]; int color[MAXN]; vector<int> v[MAXN]; map<int, int> mp; void dfs(int n) { mp[color[n]]++; for (auto i : v[n]) if (!visit[i]) { visit[i] = 1; dfs(i); } } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> N >> M >> K; for (int i = 0; i < N; i++) cin >> color[i]; for (int i = 0; i < M; i++) { cin >> a >> b; --a, --b; call[a] = call[b] = 1; v[a].push_back(b); v[b].push_back(a); } for (int i = 0; i < N; i++) if (call[i] && !visit[i]) { visit[i] = 1; mp.clear(); dfs(i); mx = 0; sum = 0; for (auto i : mp) { mx = max(mx, i.second); sum += i.second; } ans += (sum - mx); } cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; char arr[1001][1001]; long long int used[1001][1001]; long long int ans[1001][1001]; long long int n, m; long long int inf = 1e18; long long int p = 1e9 + 7; long long int phi(long long int n) { long long int result = n; for (long long int i = 2; i * i <= n; i++) { if (n % i == 0) { while (n % i == 0) n /= i; result -= result / i; } } if (n > 1) result -= result / n; return result; } long long int power(long long int x, long long int y, long long int p) { long long int res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } long long int modInverse(long long int n, long long int p) { return power(n, p - 2, p); } long long int dfs(long long int x, long long int y) { long long int cur = 0; long long int temp = 0; char s = arr[x][y]; char f; if (used[x][y] == 2) { return ans[x][y]; } ans[x][y] = 0; used[x][y] = 1; if (s == D ) f = I ; else if (s == I ) f = M ; else if (s == M ) f = A ; else f = D ; if (x + 1 <= n && arr[x + 1][y] == f) { if (used[x + 1][y] != 1) { temp = std::max(temp, 1 + dfs(x + 1, y)); } else if (used[x + 1][y] == 1) return inf; } if (x - 1 >= 0 && arr[x - 1][y] == f) { if (used[x - 1][y] != 1) { temp = std::max(temp, 1 + dfs(x - 1, y)); } else if (used[x - 1][y] == 1) return inf; } if (y + 1 <= m && arr[x][y + 1] == f) { if (used[x][y + 1] != 1) { temp = std::max(temp, 1 + dfs(x, y + 1)); } else if (used[x][y + 1] == 1) return inf; } if (y - 1 >= 0 && arr[x][y - 1] == f) { if (used[x][y - 1] != 1) { temp = std::max(temp, 1 + dfs(x, y - 1)); } else if (used[x][y - 1] == 1) return inf; } if (temp >= inf) temp = inf; used[x][y] = 2; ans[x][y] = temp; return ans[x][y]; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int i, j, t, a, b, temp, k, x, y, ctr; cin >> n >> m; long long int ans = 0; memset(used, 0, sizeof(used)); for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) cin >> arr[i][j]; } for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { if (arr[i][j] == D && used[i][j] == 0) { ans = std::max(ans, 1 + dfs(i, j)); } } } if (ans >= inf) cout << Poor Inna! ; else { ans /= 4; if (ans == 0) cout << Poor Dima! ; else cout << ans; } return 0; }
#include <bits/stdc++.h> using namespace std; const long long inf = (long long)1e9; const long long MOD = (long long)1e9 + 7; const long long P = 239; const long long MAX_N = 1000; const long long CNT = 5; const long double pi = 3.1415926535897932384626; const long double eps = 1e-6; int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long n, l, v1, v2, k; cin >> n >> l >> v1 >> v2 >> k; long long cnt = (n + k - 1) / k; long double f = (long double)(v2 - v1) / (v2 + v1); long double t = (long double)l / (v2 * cnt - v2 * (cnt - 1) * f); cout.precision(30); t = t * cnt + t * f * (cnt - 1); cout << t; return 0; }
#include <bits/stdc++.h> using namespace std; const int max_n = 3e5 + 10, inf = 1000111222; struct node { int p0, p1; int cnt; node() { p0 = p1 = 0; cnt = 0; } }; int root = 1; node A[max_n * 33]; int last_used = 1; int new_node() { return ++last_used; } int a[max_n]; long long cost_if_set[33][2]; void add_number(int a) { int cur = root; for (int i = 30; i >= 0; i--) { if (a & (1ll << i)) { if (A[cur].p0) { cost_if_set[i][0] += A[A[cur].p0].cnt; } if (!A[cur].p1) { A[cur].p1 = new_node(); } cur = A[cur].p1; A[cur].cnt++; } else { if (A[cur].p1) { cost_if_set[i][1] += A[A[cur].p1].cnt; } if (!A[cur].p0) { A[cur].p0 = new_node(); } cur = A[cur].p0; A[cur].cnt++; } } } int n; void calc_costs() { for (int i = n; i >= 1; i--) { add_number(a[i]); } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } calc_costs(); long long ans = 0; int x = 0; for (int i = 0; i < 31; i++) { if (cost_if_set[i][0] <= cost_if_set[i][1]) { ans += cost_if_set[i][0]; } else { x |= (1ll << i); ans += cost_if_set[i][1]; } } cout << ans << << x << n ; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int tc; cin >> tc; while (tc--) { long long l, r; cin >> l >> r; long long i = 1; while ((l | i) <= r) { l |= i; i <<= 1; } cout << l << n ; } }
#include <bits/stdc++.h> using namespace std; basic_string<int> e[500005][2]; basic_string<int> f[500005][2]; int n, m; int d[500005], w[500005][2]; const int inf = 123123123; int main() { ios::sync_with_stdio(!cin.tie(0)); cin >> n >> m; for (int i = 0; i < m; i++) { int u, v, t; cin >> u >> v >> t; e[u][t] += v; f[v][t] += u; } for (int i = 1; i <= n; i++) { d[i] = w[i][0] = w[i][1] = inf; } d[n] = 0; set<pair<int, int>> pq; pq.insert({d[n], n}); while (pq.size()) { auto [dx, x] = *pq.begin(); pq.erase(pq.begin()); for (int c = 0; c < 2; c++) { for (int y : f[x][c]) { w[y][c] = min(w[y][c], dx); int dy = max(w[y][0], w[y][1]) + 1; if (dy < d[y]) { pq.erase({d[y], y}); d[y] = dy; pq.insert({d[y], y}); } } } } cout << (d[1] > inf / 2 ? -1 : d[1]) << n ; for (int i = 1; i <= n; i++) { cout << (w[i][0] < w[i][1]); } }
#include <bits/stdc++.h> using namespace std; const int MAXS = 75, MAXK = 10, MAXQ = 30; const long long INF = 0x3f3f3f3f3f3f3f3f; int x, k, n, q, c[MAXK]; struct node { int p, w; } d[MAXQ]; bool operator<(const node &aa, const node &bb) { return aa.p < bb.p; } int sta[MAXS], scn, cnt[300], id[300]; struct Matrix { long long s[MAXS][MAXS]; Matrix() { memset(s, 0x3f, sizeof(s)); } } X, A, pw[30]; Matrix operator*(const Matrix &aa, const Matrix &bb) { Matrix cc; for (int i = 1; i <= scn; i++) for (int j = 1; j <= scn; j++) for (int k = 1; k <= scn; k++) cc.s[i][j] = min(cc.s[i][j], aa.s[i][k] + bb.s[k][j]); return cc; } void build_pw() { pw[0] = X; for (int i = 1; i < 30; i++) pw[i] = pw[i - 1] * pw[i - 1]; } Matrix get(int a) { Matrix ret; for (int i = 1; i <= scn; i++) ret.s[i][i] = 0; for (int i = 0; i < 30; i++) if (a >> i & 1) ret = ret * pw[i]; return ret; } int main() { scanf( %d%d%d%d , &x, &k, &n, &q); for (int i = 1; i <= k; i++) scanf( %d , &c[i]); for (int i = 1; i <= q; i++) scanf( %d%d , &d[i].p, &d[i].w); sort(d + 1, d + q + 1); for (int s = 1; s < (1 << k); s++) { cnt[s] = cnt[s >> 1] + (s & 1); if (cnt[s] == x) sta[++scn] = s, id[s] = scn; } for (int i = 1; i <= scn; i++) { if (sta[i] & 1) { for (int j = 1; j <= k; j++) if (!(sta[i] >> j & 1)) X.s[i][id[(sta[i] | (1 << j)) >> 1]] = c[j]; } else X.s[i][id[sta[i] >> 1]] = 0; } build_pw(); int cur = 1; long long delta = 0; for (int i = 1; i <= scn; i++) A.s[i][i] = 0; for (int i = 1; i <= q; i++) { if (d[i].p > n - x) delta += d[i].w; else { A = A * get(d[i].p - cur), cur = d[i].p; for (int j = 1; j <= scn; j++) for (int k = 1; k <= scn; k++) if (sta[k] & 1) A.s[j][k] += d[i].w; } } A = A * get(n - x + 1 - cur); printf( %lld n , A.s[1][1] + delta); return 0; }
#include <bits/stdc++.h> using namespace std; const long long N = 507; const long long INF = 1e9 + 7; long long n, m, mod; long long Pow(long long x, long long y) { long long ans = 1, now = x; while (y) { if (y & 1) ans = ans * now % mod; now = now * now % mod; y >>= 1; } return ans; } long long fac[N], inv[N], f[N], g[N], F[N][N], G[N][N]; long long C(long long x, long long y) { return fac[x] * inv[y] % mod * inv[x - y] % mod; } int main() { scanf( %lld%lld%lld , &n, &m, &mod); fac[0] = 1; for (long long i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % mod; inv[n] = Pow(fac[n], mod - 2); for (long long i = n; i; i--) inv[i - 1] = inv[i] * i % mod; f[0] = 1; for (long long i = 1; i <= n; i++) { f[i] = g[i] = 0; for (long long j = 1; j <= i; j++) { f[i] = (f[i] + f[j - 1] * f[i - j] % mod * C(i - 1, j - 1) % mod * (i + 1)) % mod; g[i] = (g[i] + f[j - 1] * g[i - j] % mod * C(i - 1, j - 1) % mod * (i + 1)) % mod; g[i] = (g[i] + g[j - 1] * f[i - j] % mod * C(i - 1, j - 1) % mod * (i + 1)) % mod; g[i] = (g[i] + f[j - 1] * f[i - j] % mod * C(i - 1, j - 1) % mod * ((j - 1) * j / 2 + (i - j) * (i - j + 1) / 2)) % mod; } } F[0][0] = 1; for (long long i = 1; i <= n; i++) { F[i][i] = f[i]; G[i][i] = g[i]; } for (long long i = 0; i <= n - 1; i++) { for (long long j = 0; j <= m + 1 - 1; j++) { F[i + 1][j] = (F[i + 1][j] + F[i][j]) % mod; G[i + 1][j] = (G[i + 1][j] + G[i][j]) % mod; for (long long k = 1; k <= n; k++) { if (j + k > m || i + k + 1 > n) break; F[i + k + 1][j + k] = (F[i + k + 1][j + k] + F[i][j] * f[k] % mod * C(j + k, k)) % mod; G[i + k + 1][j + k] = (G[i + k + 1][j + k] + (G[i][j] * f[k] + F[i][j] * g[k]) % mod * C(j + k, k)) % mod; } } } printf( %lld n , G[n][m]); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t-- > 0) { int n; string s; cin >> n >> s; vector<int> a(n, 0), b(n, 0), c; int flag1 = 1, flag2 = 1; for (int i = 0; i < n - 1; i++) { if (s[i] == < ) { b[i] = flag1++; } } for (int i = n - 2; i >= 0; i--) { if (s[i] == < ) { while (i > 0 && s[i - 1] == < ) { i--; } int x = i; while (s[x] == < ) { a[x] = flag2++; x++; } } } for (int i = n - 1; i >= 0; i--) { if (b[i] == 0) { b[i] = flag1++; } if (a[i] == 0) { a[i] = flag2++; } } for (int i = 0; i < n; i++) { cout << a[i] << ; } cout << n ; for (int i = 0; i < n; i++) { cout << b[i] << ; } cout << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, x[100005], h[100005]; cin >> n; for (int i = 0; i < n; ++i) cin >> x[i] >> h[i]; int count = 1; int newarr[100005]; newarr[1] = x[0] - h[0]; for (int i = 1; i < n - 1; ++i) { if ((x[i] - h[i] > x[i - 1]) && (x[i] - h[i] > newarr[count])) { count++; newarr[count] = x[i] - h[i]; } else if (x[i] + h[i] < x[i + 1]) { count++; newarr[count] = x[i] + h[i]; } else continue; } if (n == 1) puts( 1 ); else cout << count + 1 << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int n, q; vector<vector<pair<int, int> > > graph; vector<pair<int, int> > edges; class SegmentTree { struct node_t { int best[2]; int lazy; node_t() { best[0] = 0; best[1] = 0; lazy = 0; } node_t operator+(const node_t &other) const { node_t ans; for (int i = 0; i < 2; i++) { ans.best[i] = max(this->best[i], other.best[i]); } ans.lazy = 0; return ans; } void propag(int lazy) { if (lazy) { swap(best[0], best[1]); this->lazy ^= lazy; } } }; int n; vector<node_t> aint; void propag(int nod, int st, int dr) { if (st == dr || aint[nod].lazy == 0) { return; } aint[nod * 2].propag(aint[nod].lazy); aint[nod * 2 + 1].propag(aint[nod].lazy); aint[nod].lazy = 0; } void build(int nod, int st, int dr, const vector<int> &lvl, const vector<int> &tp) { if (st == dr) { aint[nod].best[tp[st]] = lvl[st]; aint[nod].best[tp[st] ^ 1] = 0; return; } int mid = (st + dr) / 2; build(nod * 2, st, mid, lvl, tp); build(nod * 2 + 1, mid + 1, dr, lvl, tp); aint[nod] = aint[nod * 2] + aint[nod * 2 + 1]; } void flip(int nod, int st, int dr, int l, int r) { propag(nod, st, dr); if (dr < l || st > r) { return; } if (l <= st && dr <= r) { aint[nod].propag(1); return; } int mid = (st + dr) / 2; flip(nod * 2, st, mid, l, r); flip(nod * 2 + 1, mid + 1, dr, l, r); aint[nod] = aint[nod * 2] + aint[nod * 2 + 1]; } public: SegmentTree(int n, const vector<int> &lvl, const vector<int> &tp) { this->n = n; aint = vector<node_t>(4 * n + 5, node_t()); build(1, 1, n, lvl, tp); } SegmentTree() { ; } void flip(int l, int r) { flip(1, 1, n, l, r); } int query() { return aint[1].best[0]; } }; class TreeWrapper { SegmentTree aint; vector<int> lvl; vector<int> tp; vector<int> l; vector<int> r; int lst = 0; void dfs(int nod, pair<int, int> tata, const vector<vector<pair<int, int> > > &graph) { l[nod] = ++lst; lvl[l[nod]] = 1 + lvl[l[tata.first]]; tp[l[nod]] = tp[l[tata.first]] ^ tata.second; for (auto it : graph[nod]) { if (it.first == tata.first) { continue; } dfs(it.first, {nod, it.second}, graph); } r[nod] = lst; } public: TreeWrapper(int root, const vector<vector<pair<int, int> > > &graph) { lst = 0; l = vector<int>(graph.size(), 0); r = vector<int>(graph.size(), 0); lvl = vector<int>(graph.size(), 0); tp = vector<int>(graph.size(), 0); dfs(root, {0, 0}, graph); aint = SegmentTree((int)graph.size() - 1, lvl, tp); } void flip(pair<int, int> a) { if (lvl[l[a.first]] > lvl[l[a.second]]) { swap(a.first, a.second); } aint.flip(l[a.second], r[a.second]); } int query() { return aint.query(); } }; pair<int, int> dfs(int nod, int tata) { pair<int, int> ans = {0, nod}; for (auto it : graph[nod]) { if (it.first == tata) { continue; } pair<int, int> tmp = dfs(it.first, nod); tmp.first++; ans = max(ans, tmp); } return ans; } int main() { scanf( %d , &n); graph = vector<vector<pair<int, int> > >(n + 1, vector<pair<int, int> >()); edges = vector<pair<int, int> >(n, {0, 0}); for (int i = 1; i < n; i++) { int x, y, t; scanf( %d %d %d , &x, &y, &t); graph[x].push_back({y, t}); graph[y].push_back({x, t}); edges[i] = {x, y}; } int a = dfs(1, 0).second; int b = dfs(a, 0).second; TreeWrapper fst(a, graph), snd(b, graph); scanf( %d , &q); while (q--) { int id; scanf( %d , &id); fst.flip(edges[id]); snd.flip(edges[id]); printf( %d n , max(fst.query(), snd.query()) - 1); } return 0; }
#include <bits/stdc++.h> using namespace std; map<int, int> cnt1, cnt2; const int maxn = 1e5 * 3; int x[maxn]; int y[maxn]; int main() { int n = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> x[i] >> y[i]; cnt1[x[i] - y[i]]++; cnt2[x[i] + y[i]]++; } long long ans = 0; for (int i = 0; i < n; i++) { long long c1 = cnt1[x[i] - y[i]]; long long c2 = cnt2[x[i] + y[i]]; ans += c1 + c2 - 2; } cout << ans / 2; }
#include <bits/stdc++.h> using namespace std; void solve() { long long n; cin >> n; string s[n]; for (long long i = 0; i < n; i++) { for (long long j = 0; j <= i; j++) cout << ( ; for (long long j = 0; j <= i; j++) cout << ) ; for (long long j = 0; j < n - i - 1; j++) cout << () ; cout << n ; } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t = 1, x = 0; cin >> t; while (t--) { x++; solve(); } }
#include <bits/stdc++.h> using namespace std; const int K = 269; const int MS = 2; const int MOD[MS] = {(int)1e9 + 7, (int)1e9 + 9}; const int MAXN = 1e6 + 69; using hsh = vector<long long>; struct hj { int shift = MS == 1 ? 0 : 32 / (MS - 1); size_t operator()(const hsh& h) const { long long res = 0; for (int M = 0; M < MS; M++) res <<= shift, res ^= h[M]; return res; } }; int t; int n; set<int> a[MAXN]; unordered_map<hsh, int, hj> mp; vector<string> str; int check[MAXN]; int cnt; int ans; void build(hsh& h, char c) { for (int M = 0; M < MS; M++) h[M] = (c + h[M] * K) % MOD[M]; } void init() { for (int i = 1; i <= cnt; i++) { a[i].clear(); check[i] = 0; } mp.clear(); cnt = 0; ans = 0; } bool dfs(int u) { check[u] = 1; int tookChild = 0; for (int v : a[u]) if (!check[v]) tookChild |= dfs(v); ans += tookChild ^ 1; return tookChild ^ 1; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> t; while (t--) { init(); cin >> n; str.resize(n + 1); for (int i = 1; i <= n; i++) cin >> str[i], str[i] = + str[i]; for (int i = 1; i <= n; i++) { string& s = str[i]; hsh h(MS); for (int j = 1; j < (int)s.size(); j++) { build(h, s[j]); if (!mp.count(h)) mp[h] = ++cnt; } } for (int i = 1; i <= n; i++) { string& s = str[i]; hsh h(MS), h2(MS); for (int j = 1; j < (int)s.size(); j++) { build(h, s[j]); if (j >= 2) { build(h2, s[j]); if (mp.count(h2)) { int u = mp[h], v = mp[h2]; a[u].insert(v); a[v].insert(u); } } } } for (int i = 1; i <= cnt; i++) if (!check[i]) dfs(i); cout << ans << n ; } }
#include <bits/stdc++.h> using namespace std; int a, b; int dp[55][55][4]; int f(int n, int m, int p) { if ((n == m && n == 0) || (n == 0 && p == 1) || (m == 0 && p == 2)) { return dp[n][m][p] = 0; } if (dp[n][m][p] != -1) { return dp[n][m][p]; } bool g = 0; if (p == 1) { for (int i = 1; i <= min(a, n); i++) { g = (g || (!f(n - i, m, 2))); } } else { for (int i = 1; i <= min(b, m); i++) { g = (g || (!f(n, m - i, 1))); } } return dp[n][m][p] = g; } int main() { int n, m; cin >> n >> m >> a >> b; memset(dp, -1, sizeof(dp)); if (f(n, m, 1)) { cout << First ; } else { cout << Second ; } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 40 + 2; int n, m, q, dp[maxn][maxn][maxn][maxn], ones[maxn][maxn], a, b, c, d; int main() { ios::sync_with_stdio(false); char ch; cin >> n >> m >> q; for (int _b = (n), i = (1); i <= _b; ++i) for (int _b = (m), j = (1); j <= _b; ++j) { cin >> ch; ones[i][j] = ones[i - 1][j] + ones[i][j - 1] - ones[i - 1][j - 1] + ch - 0 ; } for (int _b = (n - 1), h = (0); h <= _b; ++h) for (int _b = (m - 1), w = (0); w <= _b; ++w) for (int _b = (n - h), i = (1); i <= _b; ++i) for (int _b = (m - w), j = (1); j <= _b; ++j) { a = i, b = j, c = i + h, d = j + w; dp[a][b][c][d] = ((ones[c][d] - ones[a - 1][d] - ones[c][b - 1] + ones[a - 1][b - 1]) == 0); for (int _b = ((1 << 4) - 1), mask = (1); mask <= _b; ++mask) { dp[a][b][c][d] += (-1 + 2 * (__builtin_popcount(mask) & 1)) * dp[a + (mask >> 0 & 1)][b + (mask >> 1 & 1)] [c - (mask >> 2 & 1)][d - (mask >> 3 & 1)]; } } while (q--) { cin >> a >> b >> c >> d; cout << dp[a][b][c][d] << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int n, k, mas[1000], ans[1000], anss; int main() { cin >> n >> k; for (int i = 1; i <= n; i++) cin >> mas[i]; for (int i = 2; i <= n; i++) { if (mas[i] + mas[i - 1] < k) { anss += k - mas[i - 1] - mas[i]; mas[i] = k - mas[i - 1]; } } cout << anss << n ; for (int i = 1; i <= n; i++) cout << mas[i] << ; }
#include <bits/stdc++.h> using namespace std; inline long long read() { long long num = 0, neg = 1; char c = getchar(); while (!isdigit(c)) { if (c == - ) neg = -1; c = getchar(); } while (isdigit(c)) { num = (num << 3) + (num << 1) + c - 0 ; c = getchar(); } return num * neg; } int got[21], n, m, id[1000010], id_cnt; int stk[21], tot, f[2000010]; bool vis[1000010]; int cnt, to[2000010], nxt[2000010], head[1000010], in[1000010], out[1000010]; inline void insert(int x, int y) { to[++cnt] = y, nxt[cnt] = head[x], head[x] = cnt; out[x]++, in[y]++; } inline void dfs(int u, int s) { vis[u] = s; if (id[u]) { got[s] |= (1 << id[u] - 1); } for (int i = head[u]; i; i = nxt[i]) { int v = to[i]; if (vis[v] == s) continue; dfs(v, s); } return; } inline int getcnt(int x) { int res = 0; while (x) res++, x -= x & -x; return res; } int main() { n = read(), m = read(); for (int i = 1, x, y; i <= m; i++) x = read(), y = read(), insert(x, y); for (int i = 1; i <= n; i++) if (!out[i]) id[i] = ++id_cnt; for (int i = 1; i <= n; i++) if (!in[i]) { stk[++tot] = i; dfs(i, i); } for (int i = 1; i <= tot; i++) for (int j = 0; j < (1 << tot); j++) f[j | (1 << i - 1)] |= got[stk[i]]; for (int j = 1; j < (1 << tot) - 1; j++) { if (getcnt(j) == getcnt(f[j])) { printf( NO n ); return 0; } } printf( YES n ); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 200005; long long c[N << 2], a[N]; void pushup(int rt) { c[rt] = c[rt << 1] | c[rt << 1 | 1]; } void build(int rt, int l, int r) { if (l == r) { scanf( %I64d , c + rt); a[l] = c[rt]; return; } int mid = (l + r) >> 1; build(rt << 1, l, mid); build(rt << 1 | 1, mid + 1, r); pushup(rt); } long long query(int rt, int l, int r, int x, int y) { if (x > y) return 0; if (x <= l && r <= y) { return c[rt]; } int mid = (l + r) >> 1; long long ret = 0; if (x <= mid) ret |= query(rt << 1, l, mid, x, y); if (mid < y) ret |= query(rt << 1 | 1, mid + 1, r, x, y); return ret; } int main() { int n, k, c; while (~scanf( %d%d%d , &n, &c, &k)) { long long tmp = 1; for (int i = 1; i <= c; i++) { tmp *= k; } build(1, 1, n); long long ans = (tmp * a[1]) | query(1, 1, n, 2, n); ans = max(ans, (tmp * a[n]) | query(1, 1, n, 1, n - 1)); for (int i = 2; i < n; i++) { ans = max(ans, query(1, 1, n, 1, i - 1) | (tmp * a[i]) | query(1, 1, n, i + 1, n)); } printf( %I64d n , ans); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int n; cin >> n; string s; cin >> s; set<int> col[26]; vector<int> ans; int cnt = 0; for (int i = 0; i < n; i++) { set<int> used; for (int j = s[i] - a + 1; j < 26; j++) for (int num : col[j]) used.insert(num); int newCol = 1; while (used.count(newCol)) newCol++; col[s[i] - a ].insert(newCol); ans.push_back(newCol); cnt = max(cnt, newCol); } cout << cnt << n ; for (int i : ans) cout << i << ; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; double ans; int a[N]; int n, u, p; int main() { scanf( %d%d , &n, &u); ans = 0; for (int i = 1; i <= n; i++) { scanf( %d , a + i); } for (int i = 1; i <= n; i++) { if (i <= n - 2) { p = lower_bound(a + i + 2, a + n + 1, a[i] + u) - a; if (p > n || a[i] + u != a[p]) p--; if (p >= i + 2) { ans = max(ans, (a[p] - a[i + 1]) * 1.0 / (a[p] - a[i])); } } } if (ans == 0) printf( -1 n ); else printf( %.11lf n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int n, k, ans = -1, dist[2020]; vector<int> adj[2020], vet; int main() { scanf( %d%d , &n, &k); for (int(i) = (0); (i) < (k); (i)++) { int v; scanf( %d , &v); vet.push_back(v - n); } sort((vet).begin(), (vet).end()); vet.resize(unique((vet).begin(), (vet).end()) - vet.begin()); for (int(i) = (0); (i) < (2020); (i)++) for (int(j) = (0); (j) < (((int)(vet).size())); (j)++) if (i + vet[j] >= 0 && i + vet[j] < 2020) adj[i].push_back(i + vet[j]); queue<int> fila; fila.push(1010); while (!fila.empty()) { int v = fila.front(); fila.pop(); if (v == 1010 && dist[v]) { ans = dist[v]; break; } for (int(i) = (0); (i) < (((int)(adj[v]).size())); (i)++) if (!dist[adj[v][i]]) dist[adj[v][i]] = dist[v] + 1, fila.push(adj[v][i]); } printf( %d n , ans); }
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > upd; struct query { int l, r, t, id, ans; query() {} query(int _l, int _r, int _t, int _id) { l = _l; r = _r; t = _t; id = _id; } }; vector<query> que; stack<pair<int, int> > S; vector<int> V; int M[1005][105]; int sz[1005]; int cnt[300005]; int data[100005]; int B; int l = 1, r = 0, t = 0, Ans = 1; int cmp(query a, query b) { if (a.l / B != b.l / B) return a.l < b.l; if (a.r / B != b.r / B) return a.r < b.r; return a.t < b.t; } int cmpid(query a, query b) { return a.id < b.id; } int Upd() { for (int i = (Ans / 100); i < (1000); i++) if (sz[i] < 100) { for (int j = (0); j < (100); j++) if (!M[i][j]) { return i * 100 + j; } } } void Add(int a) { if (!M[a / 100][a % 100]) sz[a / 100]++; M[a / 100][a % 100]++; if (Ans == a) Ans = Upd(); } void Del(int a) { M[a / 100][a % 100]--; if (!M[a / 100][a % 100]) { sz[a / 100]--; if (Ans > a) Ans = a; } } void add(int a) { Del(cnt[a]); Add(++cnt[a]); } void del(int a) { Del(cnt[a]); Add(--cnt[a]); } int main() { M[0][0] = 1e9; int n, m; scanf( %d%d , &n, &m); B = pow(n, 2.0 / 3); for (int i = (1); i < (n + 1); i++) scanf( %d , &data[i]), V.push_back(data[i]); while (m--) { int co, a, b; scanf( %d%d%d , &co, &a, &b); if (co == 1) que.push_back(query(a, b, (int)(upd).size(), (int)(que).size())); else upd.push_back(make_pair(a, b)), V.push_back(b); } sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end()); for (int i = (1); i < (n + 1); i++) data[i] = lower_bound(V.begin(), V.end(), data[i]) - V.begin() + 1; for (int i = (0); i < ((int)(upd).size()); i++) upd[i].second = lower_bound(V.begin(), V.end(), upd[i].second) - V.begin() + 1; sort(que.begin(), que.end(), cmp); for (int i = (0); i < ((int)(que).size()); i++) { while (l > que[i].l) { l--; add(data[l]); } while (r < que[i].r) { r++; add(data[r]); } while (r > que[i].r) { del(data[r]); r--; } while (l < que[i].l) { del(data[l]); l++; } while (t < que[i].t) { int pos = upd[t].first; S.push(make_pair(pos, data[pos])); if (l <= pos && pos <= r) del(data[pos]); data[pos] = upd[t].second; if (l <= pos && pos <= r) add(data[pos]); t++; } while (t > que[i].t) { t--; int pos = S.top().first; if (l <= pos && pos <= r) del(data[pos]); data[pos] = S.top().second; if (l <= pos && pos <= r) add(data[pos]); S.pop(); } que[i].ans = Ans; } sort(que.begin(), que.end(), cmpid); for (int i = (0); i < ((int)(que).size()); i++) printf( %d n , que[i].ans); return 0; }
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const long long N = 1e5 + 7; long long p[N], cnt; bool vis[N]; long long res1 = 0; long long res2 = 0; long long res3 = 0; inline void init(long long NN) { res1 = res2 = res3 = 0; for (long long i = 2; i <= NN + res1 + res2 + res3; i++) { res1 = res2 = res3 = 0; if (vis[i]) continue; p[++cnt] = i + res1 + res2 + res3; res1 = res2 = res3 = 0; for (long long j = 2; i * j <= NN; j++) vis[i * j] = true; res1 = res2 = res3 = 0; } } void solve() { long long a, b; cin >> a >> b; res1 = res2 = res3 = 0; long long now = b; res1 = res2 = res3 = 0; if (a % b) printf( %lld n , a + res1 + res2 + res3); else { res1 = res2 = res3 = 0; long long ans = 1; res1 = res2 = res3 = 0; for (long long j = 1; j <= cnt + res1 + res2 + res3; j++) { res1 = res2 = res3 = 0; if (b % p[j] == 0) { res1 = res2 = res3 = 0; long long tmp = a; res1 = res2 = res3 = 0; while (tmp % now == 0) tmp /= p[j]; res1 = res2 = res3 = 0; ans = max(ans, tmp) + res1 + res2 + res3; res1 = res2 = res3 = 0; while (b % p[j] == 0) b /= p[j]; res1 = res2 = res3 = 0; } } long long tmp = a; if (b != 1) { res1 = res2 = res3 = 0; while (tmp % now == 0) tmp /= b; res1 = res2 = res3 = 0; ans = max(ans, tmp) + res1 + res2 + res3; res1 = res2 = res3 = 0; } printf( %lld n , ans + res1 + res2 + res3); } } signed main() { long long t = 1; res1 = res2 = res3 = 0; init(100000); cin >> t; res1 = res2 = res3 = 0; while (t--) solve(); return 0; }
#include <bits/stdc++.h> using namespace std; long long fib[100], A[100], B[100]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t, n, najwieksza = 2; fib[0] = 1; fib[1] = 1; for (; fib[najwieksza - 1] + fib[najwieksza - 2] <= 1e18; najwieksza++) fib[najwieksza] = fib[najwieksza - 1] + fib[najwieksza - 2]; cin >> t; while (t--) { cin >> n; vector<int> miejsca; for (int i = najwieksza - 1; i > 0; i--) if (fib[i] <= n) { n -= fib[i]; miejsca.push_back(i); } miejsca.push_back(0); reverse(miejsca.begin(), miejsca.end()); A[1] = 1; B[1] = (miejsca[1] - 1) / 2; for (int i = 2; i < (int)miejsca.size(); i++) { A[i] = A[i - 1] + B[i - 1]; B[i] = A[i - 1] * ((miejsca[i] - miejsca[i - 1] - 1) / 2) + B[i - 1] * ((miejsca[i] - miejsca[i - 1]) / 2); } cout << A[miejsca.size() - 1] + B[miejsca.size() - 1] << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int mediana(vector<int> &v) { if (int(v.size()) % 2 == 1) return v[int(v.size()) / 2]; return v[int(v.size()) / 2 - 1]; } bool esta(vector<int> &v, int x) { for (int i = 0; i < int(v.size()); i++) if (v[i] == x) return true; return false; } int main() { int n, x; cin >> n >> x; vector<int> v(n); for (int i = 0; i < n; i++) cin >> v[i]; sort(v.begin(), v.end()); int amount = 0; while (mediana(v) != x) { if (not esta(v, x)) v.push_back(x); else if (mediana(v) < x) v.push_back(1000000001); else v.push_back(-1); amount++; sort(v.begin(), v.end()); } cout << amount << endl; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1e2 + 10; const long long mod = 998244353; const long long inf = (long long)4e17 + 5; const int INF = 1e9 + 7; const double pi = acos(-1.0); long long inv(long long b) { if (b == 1) return 1; return (mod - mod / b) * inv(mod % b) % mod; } inline long long read() { long long x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } int n; int ans[105]; int more[maxn], les[maxn]; int mmax, mmin; int nex[maxn], pre[maxn]; inline void ask_m(int x) { printf( ? ); fflush(stdout); for (int i = 1; i <= n; i++) { if (i == x) printf( 2 ); else printf( 1 ); } puts( ); fflush(stdout); scanf( %d , more + x); if (more[x] == 0) { ans[x] = n; mmax = x; } } inline void ask_l(int x) { printf( ? ); fflush(stdout); for (int i = 1; i <= n; i++) { if (i == x) printf( 1 ); else printf( 2 ); } puts( ); fflush(stdout); scanf( %d , les + x); if (les[x] == 0) { ans[x] = 1; mmin = x; } } void solve() { for (int i = 1; i <= n; i++) { ask_m(i); } for (int i = 1; i <= n; i++) { ask_l(i); } for (int i = 1; i <= n; i++) { if (more[i] == i || !more[i]) continue; nex[i] = more[i]; pre[more[i]] = i; } for (int i = 1; i <= n; i++) { if (les[i] == i || !les[i]) continue; nex[les[i]] = i; pre[i] = les[i]; } int fr; for (int i = 1; i <= n; i++) { if (!nex[i]) { fr = i; break; } } for (int i = n; i >= 1; i--) { ans[fr] = i; fr = pre[fr]; } printf( ! ); for (int i = 1; i <= n; i++) printf( %d , ans[i]); puts( ); fflush(stdout); } int main() { scanf( %d , &n); solve(); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 3e5; int n, ans; int Dpos[N + 3]; char str[N + 10], Nstr[N + 10]; int main() { scanf( %d%s , &n, str + 1); int Ncnt = 0, Ned = n, Nmin = 0; for (int i = 1; i <= n; i++) { if (str[i] == ( ) Ncnt++; else Ncnt--; if (Nmin > Ncnt) { Nmin = Ncnt; Ned = i; } } if (Ncnt) printf( 0 n1 1 n ), exit(0); int Npos = 1; for (int i = Ned + 1; i <= n; i++) Dpos[Npos] = i, Nstr[Npos++] = str[i]; for (int i = 1; i <= Ned; i++) Dpos[Npos] = i, Nstr[Npos++] = str[i]; for (int i = 1, Icnt = 0; i <= n; i++) { if (Nstr[i] == ( ) Icnt++; else Icnt--; if (!Icnt) ans++; } int fans = ans; int ansl = 1, ansr = 1; for (int i = 1; i <= n;) { int Pcnt = 0; int j; for (j = i; j <= n; j++) { if (Nstr[j] == ( ) Pcnt++; else Pcnt--; if (!Pcnt) break; } vector<pair<int, int> > vec; Pcnt = 0; int Ptot = 0; for (int k = i + 1; k < j; k++) { if (Nstr[k] == ( ) Pcnt++; else Pcnt--; if (Pcnt == 0) { if (vec.empty()) vec.push_back(make_pair(i + 1, k)); else vec.push_back(make_pair(vec.back().second + 1, k)); } } for (auto it : vec) { int L = it.first, R = it.second; int Kcnt = 0, Ktot = 0; for (int k = L + 1; k <= R - 1; k++) { if (Nstr[k] == ( ) Kcnt++; else Kcnt--; if (!Kcnt) Ktot++; } if (ans < fans - 1 + 2 + Ktot) { ans = fans - 1 + 2 + Ktot; ansl = L; ansr = R; } } Ptot = vec.size(); if (ans < Ptot + 1) { ans = Ptot + 1; ansl = i; ansr = j; } i = j + 1; } ansl = Dpos[ansl]; ansr = Dpos[ansr]; if (ansl > ansr) swap(ansl, ansr); printf( %d n%d %d n , ans, ansl, ansr); return 0; }
#include <bits/stdc++.h> using namespace std; int a[5005] = {0}; void ge(int a) { if (a == 1) printf( one n ); else if (a == 2) printf( two n ); else if (a == 3) printf( three n ); else if (a == 4) printf( four n ); else if (a == 5) printf( five n ); else if (a == 6) printf( six n ); else if (a == 7) printf( seven n ); else if (a == 8) printf( eight n ); else if (a == 9) printf( nine n ); } int main() { std::ios::sync_with_stdio(false); int n; cin >> n; if (n == 0) printf( zero n ); else if (n == 1) printf( one n ); else if (n == 2) printf( two n ); else if (n == 3) printf( three n ); else if (n == 4) printf( four n ); else if (n == 5) printf( five n ); else if (n == 6) printf( six n ); else if (n == 7) printf( seven n ); else if (n == 8) printf( eight n ); else if (n == 9) printf( nine n ); else if (n == 10) printf( ten n ); else if (n == 11) printf( eleven n ); else if (n == 12) printf( twelve n ); else if (n == 13) printf( thirteen n ); else if (n == 14) printf( fourteen n ); else if (n == 15) printf( fifteen n ); else if (n == 16) printf( sixteen n ); else if (n == 17) printf( seventeen n ); else if (n == 18) printf( eighteen n ); else if (n == 19) printf( nineteen n ); else if (n == 20) printf( twenty n ); else if (n > 20 && n <= 29) { printf( twenty- ); int k = n % 10; ge(k); } else if (n == 30) { printf( thirty n ); } else if (n > 30 && n <= 39) { printf( thirty- ); int k = n % 10; ge(k); } else if (n == 40) printf( forty n ); else if (n > 40 && n <= 49) { printf( forty- ); int k = n % 10; ge(k); } else if (n == 50) printf( fifty n ); else if (n > 50 && n <= 59) { printf( fifty- ); int k = n % 10; ge(k); } else if (n == 60) printf( sixty n ); else if (n > 60 && n <= 69) { printf( sixty- ); int k = n % 10; ge(k); } else if (n == 70) printf( seventy n ); else if (n > 70 && n <= 79) { printf( seventy- ); int k = n % 10; ge(k); } else if (n == 80) printf( eighty n ); else if (n > 80 && n <= 89) { printf( eighty- ); int k = n % 10; ge(k); } else if (n == 90) printf( ninety n ); else if (n > 90 && n <= 99) { printf( ninety- ); int k = n % 10; ge(k); } return 0; }
#include <bits/stdc++.h> using namespace std; struct point { double x, y, alpha; int num; }; int n, c[1510] = {}, ans[1510] = {}; vector<int> a[1510]; point p[1510]; int rec(int v, int pr) { int r = 0; for (int i = 0; i < a[v].size(); i++) if (a[v][i] != pr) r += rec(a[v][i], v); return (c[v] = r) + 1; } bool comp(point p1, point p2) { return (p1.alpha < p2.alpha); } int rec2(int v, int t, int pr) { int s = t; for (int i = t + 1; i <= t + c[v]; i++) if (p[i].x < p[s].x || (p[i].x == p[s].x && p[i].y < p[s].y)) s = i; swap(p[s], p[t]); for (int i = t + 1; i <= t + c[v]; i++) if (p[i].x != p[t].x) p[i].alpha = atan((p[i].y - p[t].y) / (p[i].x - p[t].x)); else if (p[i].y > p[t].y) p[i].alpha = 3.1415926536 / 2; else p[i].alpha = -3.1415926536 / 2; sort(p + t + 1, p + t + c[v] + 1, comp); ans[p[t++].num] = v; for (int i = 0; i < a[v].size(); i++) if (a[v][i] != pr) t += rec2(a[v][i], t, v); return c[v] + 1; } int main() { cin >> n; for (int i = 0; i < n - 1; i++) { int u, v; cin >> u >> v; u--; v--; a[u].push_back(v); a[v].push_back(u); } for (int i = 0; i < n; i++) { cin >> p[i].x >> p[i].y; p[i].num = i; } rec(0, -1); rec2(0, 0, -1); for (int i = 0; i < n; i++) cout << ans[i] + 1 << ; }
#include <bits/stdc++.h> const int maxn = (int)1e6; const int mod = (int)1e9 + 7; using namespace std; int n; long long dp[maxn]; long long a[maxn]; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { cin >> a[i]; } dp[0] = abs(a[0]); for (int i = 1; i < n; i++) { dp[i] = abs(a[i] - a[i - 1]) + dp[i - 1]; } cout << dp[n - 1]; return 0; }
#include <bits/stdc++.h> using namespace std; bool mycomp(vector<long long int> a, vector<long long int> b) { long long int acost = min(2 * a[0], a[1]) - min(a[0], a[1]); long long int bcost = min(2 * b[0], b[1]) - min(b[0], b[1]); return acost > bcost; } long long int fn(vector<vector<long long int> > arr, long long int n, long long int f) { sort(arr.begin(), arr.end(), mycomp); long long int productSold = 0; for (long long int i = 0; i < f; i++) { productSold += min(2 * arr[i][0], arr[i][1]); } for (long long int i = f; i < n; i++) { productSold += min(arr[i][0], arr[i][1]); } return productSold; } int32_t main() { long long int n, f; cin >> n >> f; vector<vector<long long int> > arr(n); for (long long int i = 0; i < n; i++) { long long int k, l; cin >> k >> l; arr[i].push_back(k); arr[i].push_back(l); } long long int ans = fn(arr, n, f); cout << ans; }
#include <bits/stdc++.h> using namespace std; long long n, m, k; long long f(int x, int len) { if (len == 0) return 0; if (x > len) return (long long)len * (2 * x - len - 1) / 2; else return (long long)x * (x - 1) / 2 + len - x + 1; } bool ok(int x) { if (f(x, k - 1) + f(x, n - k) + x <= m) return 1; else return 0; } int main() { cin >> n >> m >> k; int l = 1, r = 1e9; while (r - l > 1) { int mid = (l + r) / 2; if (ok(mid)) { l = mid; } else { r = mid; } } int res = 0; if (ok(l)) res = l; if (ok(r)) res = r; cout << res << endl; }
#include <bits/stdc++.h> using namespace std; int arr[310], nex[310], T, N; bool can, isRoot[310]; void dfs(int x, int val) { if (T < 0) return; arr[x] += val; if (nex[x] != -1) { T -= arr[x]; dfs(nex[x], arr[x]); } } long long int memo[310][100000 + 100]; long long int solve(int pos, int val) { if (pos == 0) return val == 0; if (val <= 0) return val == 0; if (memo[pos][val] != -1) return memo[pos][val]; long long int ret = solve(pos - 1, val); if (val - arr[pos] >= 0) ret = (ret + solve(pos, val - arr[pos])) % 1000000007; return memo[pos][val] = ret; } long long int t[100000 + 100]; int main() { int Q, x, y; while (cin >> N >> Q >> T) { for (int i = 1; i <= N; i++) scanf( %d , &arr[i]); memset(nex, -1, sizeof nex); memset(isRoot, true, sizeof isRoot); for (int i = 0; i < Q; i++) { scanf( %d %d , &x, &y); nex[x] = y; isRoot[y] = false; } bool in = false; for (int i = 1; i <= N; i++) if (isRoot[i] && nex[i] != -1) { in = true; dfs(i, 0); } if ((Q > 0 && in == false) || T < 0) { cout << 0 << endl; return 0; } memset(memo, -1, sizeof memo); t[0] = 1; for (int i = 1; i <= N; i++) for (int j = 0; j <= T; j++) { if (j - arr[i] >= 0) t[j] = (t[j] + t[j - arr[i]]) % 1000000007; } cout << t[T] << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 150, M = 150, OO = 0x3f3f3f3f; int n, arr[2005], temp, ans; void DFS(int u) { temp++; if (arr[u] == -1) return; DFS(arr[u]); } int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d , arr + i); } for (int i = 1; i <= n; ++i) { temp = 0; DFS(i); ans = max(ans, temp); } printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int convert(int k) { if (k < 2) return k; else if (k < 5) return k - 1; else return k - 2; } int main() { string s[6]; int A[6][6] = {3, 3, 4, 4, 3, 3, 3, 3, 4, 4, 3, 3, 2, 2, 3, 3, 2, 2, 2, 2, 3, 3, 2, 2, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 1, 1}; for (int i = 0; i < 6; i++) { cin >> s[i]; } int best = 0, besti = 0, bestj = 0; for (int i = 0; i < 6; i++) { for (int j = 0; j < 8; j++) { if (s[i][j] == . ) { if (A[i][convert(j)] > best) { best = A[i][convert(j)]; besti = i; bestj = j; } } } } s[besti][bestj] = P ; for (int i = 0; i < 6; i++) { cout << s[i] << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; template <class T> inline void checkmin(T &a, T b) { if (a > b) a = b; } template <class T> inline void checkmax(T &a, T b) { if (a < b) a = b; } const int oo = 1 << 30; const double eps = 1e-7; const int N = 1 << 10; const int M = 1; const long long P = 1000000007; long long dp[N][N]; int mx; char s[N]; inline int is(int k) { return 4 == k || 7 == k; } inline int to(int f, int flag) { flag = is(flag); if (0 == f) return 0; if (1 == f || mx + 1 == f) return flag ? f - 1 : (mx + 1); return flag ? 0 : f - 1; } long long dfs(int id, int f) { if (id < 0) return !f; long long &r = dp[id][f]; if (-1 != r) return r; r = 0; id--; r += 8 * dfs(id, to(f, 0)); r += 2 * dfs(id, to(f, 4)); return r %= P; } void pre() { (memset((dp), -1, sizeof(dp))); dfs(1001, mx + 1); } long long dfs_d(int id, int f) { if (id < 0) return !f; int k, u; long long r = 0; u = s[id]; id--; for (k = 0; k < (u); k++) r += dfs(id, to(f, k)); r += dfs_d(id, to(f, k)); return r %= P; } long long doit(int flag) { (memset((s), 0, sizeof(s))); scanf( %s , s); int i, sn; sn = strlen(s); for (i = 0; i < (sn); i++) s[i] -= 0 ; reverse(s, s + sn); s[0] -= flag; for (i = 0; s[i] < 0; i++) { s[i] = 9; s[i + 1]--; } return dfs_d(sn, mx + 1); } int main() { int T, _ = 0; long long ans = 0; scanf( %d %d , &T, &mx); pre(); while (_++ < T) { ans = -doit(1); ans += doit(0); ans = (ans % P + P) % P; printf( %I64d n , ans); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int a; int b; int c; int d; int e; cin >> a; int aa[a]; for (b = 0; b < a; ++b) { cin >> aa[b]; } d = aa[0]; c = 0; b = 0; vector<int> ab; while (b < a) { if (aa[b] > d) d = aa[b]; if ((b + 1) == d) c = c + 1; b = b + 1; } cout << c << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int q, a[100100], head, tail; long long n; long long solve(long long n, long long k) { if (k & 1) return (k + 1) / 2; if (n & 1) if (k == 2) return solve(n / 2, n / 2) + (n + 1) / 2; else return solve(n / 2, k / 2 - 1) + (n + 1) / 2; else return solve(n / 2, k / 2) + n / 2; } int main() { scanf( %I64d , &n); for (scanf( %d , &q); q--;) { long long x; scanf( %I64d , &x); printf( %I64d n , solve(n, x)); } return 0; }
#include <bits/stdc++.h> using namespace std; long long int n, k; vector<long long int> v[100005]; vector<long long int> res; long long int ares[100005]; long long int was[100005]; int dfs(long long int ind, long long int c) { if (c > 100005) { return -1; } if (ares[ind]) return 1; if (!v[ind].size()) { ares[ind] = 1; res.push_back(ind); return 1; } for (auto i : v[ind]) { int r = dfs(i, c + 1); if (r < 0) { return -1; } } ares[ind] = 1; res.push_back(ind); return 1; } int main() { cin >> n >> k; long long int *arr = new long long int[k]; for (long long int i = 0; i < k; i++) { cin >> arr[i]; arr[i]--; } for (long long int i = 0; i < n; i++) { ares[i] = 0; long long int a, b; cin >> b; for (long long int j = 0; j < b; j++) { cin >> a; a--; v[i].push_back(a); } } for (long long int i = 0; i < k; i++) { int r = dfs(arr[i], 0); if (r < 0) { cout << -1; return 0; } } cout << res.size() << endl; for (auto i : res) { cout << (i + 1) << ; } return 0; }
#include <bits/stdc++.h> using namespace std; const double EPS = 1e-9; const double PI = acos(-1.0); const int MOD = 1000 * 1000 * 1000 + 7; const int INF = 2000 * 1000 * 1000; const int MAXN = 55; template <typename T> inline T sqr(T n) { return n * n; } int n; long long m; long long weight[MAXN]; int ans[MAXN]; int main() { scanf( %d%I64d , &n, &m); weight[0] = 1ll << (n - 1); for (int i = 1; i <= n; i++) { weight[i] = max(weight[i - 1] >> 1, 1ll); } int l = 1, r = n; int num = 1; long long cur = 0; while (l <= r) { if (l == r || cur + weight[num] >= m) { ans[l] = num; l++; } else { cur += weight[num]; ans[r] = num; r--; } num++; } for (int i = 1; i <= n; i++) { printf( %d%c , ans[i], n [i == n]); } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 32005; int n, m, i, j, f; int a[N]; long long ans; int main() { scanf( %d%d , &n, &m); for (i = m + 1; i <= (n + 1) / 2; i++) { for (j = m + 1; j < 2 * i; j++) { f = (i * (2 * i - j) + (n + 1) * (2 * j - i)) / (i + j); f = max(f, m); if (f > n - m) continue; a[i] += n - m - f; } } for (i = m + 1; i <= (n + 1) / 2; i++) ans += 2 * a[i]; if (n & 1) ans -= a[i - 1]; printf( %I64d n , 3 * ans); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; const long long mod = 1e9 + 7; long long n, m; struct mat { int a[105][105]; mat() { memset(a, 0, sizeof(a)); } mat operator*(const mat &b) const { mat c; for (int i = (1); i < (m + 1); i++) { for (int j = (1); j < (m + 1); j++) { for (int k = (1); k < (m + 1); k++) { c.a[i][j] = (c.a[i][j] + a[i][k] % mod * b.a[k][j] % mod) % mod; } } } return c; } }; mat mod_pow(mat x, long long n) { mat res; for (int i = (1); i < (m + 1); i++) res.a[i][i] = 1; while (n > 0) { if (n & 1) res = res * x; x = x * x; n >>= 1; } return res; } int main() { cin >> n >> m; mat b, x, ans; for (int i = (1); i < (m + 1); i++) b.a[i][1] = 1; for (int i = (2); i < (m + 1); i++) x.a[i][i - 1] = 1; x.a[1][1] = 1; x.a[1][m] = 1; ans = mod_pow(x, n - m + 1) * b; cout << ans.a[1][1]; return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 210000; int n; int oke[maxn], okp[maxn]; struct edge { int y, nex; } a[maxn << 1]; int len, fir[maxn]; inline void ins(const int x, const int y) { a[++len] = (edge){y, fir[x]}; fir[x] = len; } int siz[maxn], mxs[maxn]; void dfs(const int x, const int fa) { siz[x] = 1; for (int k = fir[x], y = a[k].y; k; k = a[k].nex, y = a[k].y) if (y != fa) { dfs(y, x); siz[x] += siz[y]; mxs[x] = max(mxs[x], siz[y]); } } int root, t1, t2; int d[maxn], f[maxn], f2[maxn]; bool cmp(const int x, const int y) { return f[x] == f[y] ? f2[x] < f2[y] : f[x] < f[y]; } int t[maxn], tp; void Hash(const int x, const int fa) { siz[x] = 1; for (int k = fir[x], y = a[k].y; k; k = a[k].nex, y = a[k].y) if (y != fa && oke[k]) Hash(y, x), siz[x] += siz[y]; tp = 0; for (int k = fir[x], y = a[k].y; k; k = a[k].nex, y = a[k].y) if (y != fa && oke[k]) t[++tp] = y; sort(t + 1, t + tp + 1, cmp); d[x] = tp + (fa != 0); f[x] = f2[x] = siz[x]; for (int i = 1; i <= tp; i++) { int y = t[i]; f[x] = f[x] * (siz[y] + 1) * f[y]; f2[x] = f2[x] + (siz[y] + 2) * (f2[y] + 1); } } int ans[maxn]; void cal(const int x, const int fa) { if (okp[x] && d[x] < 4) ans[x]++; for (int k = fir[x], y = a[k].y; k; k = a[k].nex, y = a[k].y) if (y != fa && oke[k]) cal(y, x); tp = 0; for (int k = fir[x], y = a[k].y; k; k = a[k].nex, y = a[k].y) if (y != fa && oke[k]) t[++tp] = y; sort(t + 1, t + tp + 1, cmp); for (int i = 1; i <= tp; i++) { int y = t[i], ty = t[i - 1]; if (f[y] != f[ty] || f2[y] != f2[ty]) ans[x] += ans[y]; } } int main() { scanf( %d , &n); for (int i = 1; i < n; i++) { int x, y; scanf( %d%d , &x, &y); ins(x, y), ins(y, x); } dfs(1, 0); for (int i = 1; i <= n; i++) if (mxs[i] * 2 <= n && (n - siz[i]) * 2 <= n) { if (!t1) t1 = i; else t2 = i; } for (int i = 1; i <= len; i++) oke[i] = 1; for (int i = 1; i <= n; i++) okp[i] = 1; if (t2) { for (int k = fir[t1], y = a[k].y; k; k = a[k].nex, y = a[k].y) if (y == t2) oke[k] = 0; for (int k = fir[t2], y = a[k].y; k; k = a[k].nex, y = a[k].y) if (y == t1) oke[k] = 0; okp[root = ++n] = 0; ins(root, t1), ins(root, t2); oke[len - 1] = oke[len] = 1; } else root = t1; Hash(root, 0); cal(root, 0); printf( %d n , ans[root]); return 0; }
#include <bits/stdc++.h> using namespace std; mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count()); int main() { ios::sync_with_stdio(0); cin.tie(0); int ts; cin >> ts; while (ts--) { string s, t; cin >> s >> t; int n = (int)s.size(); map<string, int> cnt; for (int i = 0; i < n; i += 2) { string cur = ; cur += s[i]; cur += s[i + 1]; sort(cur.begin(), cur.end()); cnt[cur]++; } for (int i = 0; i < n; i += 2) { string cur = ; cur += t[i]; cur += t[i + 1]; sort(cur.begin(), cur.end()); cnt[cur]--; } bool bad = false; for (auto c : cnt) { if (c.second != 0) { bad = true; } } if (bad) { cout << -1 << n ; continue; } while (true) { int start = rnd() % (n / 2 + 1); vector<int> ord; if (start != 0) { ord.push_back(start - 1); } string cur = s, me = t; reverse(cur.begin(), cur.begin() + 2 * start); int its = 0; bool bad = false; while (cur.size() > 0) { int ind = (int)me.size() - 2; vector<int> sh; for (int i = (int)cur.size() - 2; i >= 0; i -= 2) { sh.push_back(i); } shuffle(sh.begin() + 1, sh.end(), rnd); bool mda = false; for (int i : sh) { if (cur[i] == me[ind] && cur[i + 1] == me[ind + 1]) { if (i + 2 != (int)cur.size()) { ord.push_back(i / 2); reverse(cur.begin(), cur.begin() + i + 2); ord.push_back(ind / 2); reverse(cur.begin(), cur.end()); } mda = true; break; } } if (!mda) { vector<int> sh; for (int i = 0; i < (int)cur.size(); i += 2) { sh.push_back(i); } shuffle(sh.begin(), sh.end(), rnd); for (int i : sh) { if (cur[i] == me[ind + 1] && cur[i + 1] == me[ind]) { ord.push_back(i / 2); reverse(cur.begin(), cur.begin() + i + 2); ord.push_back(0); reverse(cur.begin(), cur.begin() + 2); ord.push_back(ind / 2); reverse(cur.begin(), cur.end()); break; } } } if (ord.size() > n + 1) { bad = true; break; } for (int it = 0; it < 2; it++) { cur.pop_back(), me.pop_back(); } } if (bad) { continue; } else { cout << ord.size() << n ; string f = s, g = t; for (int a : ord) { cout << 2 * (a + 1) << ; } cout << n ; break; } } } }
#include <bits/stdc++.h> using namespace std; string s; long long n; bool len(char x) { return x == a || x == e || x == i || x == o || x == u || x == y ; } int main() { cin >> n; cin >> s; cout << s[0]; for (int i = 1; i < n; i++) { if (len(s[i]) && len(s[i - 1])) continue; cout << s[i]; } cout << endl; return 0; }
#include <bits/stdc++.h> #pragma GCC optimize(3, Ofast , inline ) using namespace std; mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count()); const long long maxn = (long long)1e6 + 5; const long long mod = 998244353; const long long inf = 0x3f3f3f3f; long long T = 1; vector<long long> v[maxn], vec[maxn]; long long dep[maxn], pre[maxn]; long long maxx; void dfs(long long now) { maxx = max(maxx, dep[now]); vec[dep[now]].push_back(now); for (auto &to : v[now]) { if (dep[to]) continue; pre[to] = now; dep[to] = dep[now] + 1; dfs(to); } } void solve() { long long n, m; cin >> n >> m; maxx = 1; for (long long i = 1; i <= n; ++i) v[i].clear(), vec[i].clear(), dep[i] = 0; for (long long i = 1; i <= m; ++i) { long long x, y; cin >> x >> y; v[x].push_back(y); v[y].push_back(x); } dep[1] = 1; dfs(1); if (maxx > (n + 1) / 2) { cout << PATH n ; stack<long long> s; long long now = vec[maxx][0]; while (now) { s.push(now); now = pre[now]; } cout << s.size() << n ; while (!s.empty()) { cout << s.top() << ; s.pop(); } cout << n ; return; } cout << PAIRING n ; long long ans = 0; for (long long i = 1; i <= maxx; ++i) { ans += vec[i].size() / 2; } cout << ans << n ; for (long long i = 1; i <= maxx; ++i) { for (long long j = 0; j + 1 < vec[i].size(); j += 2) { cout << vec[i][j] << << vec[i][j + 1] << n ; } } } signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; cin >> T; while (T--) solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); long long n; cin >> n; vector<long long> vec(n); for (long long i = 0; i < n; i++) { cin >> vec[i]; } vec.push_back(vec.back()); long long ans = 1; long long cnt = 1; for (long long i = 1; i < n; i++) { if (vec[i] > vec[i - 1] * 2) { ans = max(ans, cnt); cnt = 0; } cnt++; } ans = max(ans, cnt); cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; const int oo = 0x3f3f3f3f; const double eps = 1e-9; int main() { int n; scanf( %d , &n); double inch = (double)n / 3; int ninch = (int)inch; if (inch - (double)ninch >= 0.5) ++ninch; printf( %d %d n , ninch / 12, ninch % 12); return 0; }
#include <bits/stdc++.h> #pragma comment(linker, /STACK:20000000 ) using namespace std; int main() { int n, m; cin >> n >> m; vector<string> a; string s; for (int i = (0); (i) < (n); (i)++) { cin >> s; a.push_back( # + s + # ); } int x = 1; long long r = 0; bool g = true; for (int i = 0; i < n - 1; i++) { if (a[i + 1][x] == . ) { r++; continue; } int left = x, right = x; int wall = 0; bool down = false; while (!down) { if (g) { if (a[i + 1][right] == . ) { r += right - x + 1; x = right; break; } for (int j = right + 1;; j++) { if (a[i][j] == + ) { wall = 0; right = j; r += j - x; x = j - 1; g = false; break; } else if (a[i][j] == # ) { wall++; right = j - 1; r += j - x; x = j - 1; g = false; break; } else if (a[i + 1][j] == . ) { r += j - x + 1; x = j; down = true; break; } } } else { if (a[i + 1][left] == . ) { r += x - left + 1; x = left; break; } for (int j = left - 1;; j--) { if (a[i][j] == + ) { wall = 0; left = j; r += x - j; x = j + 1; g = true; break; } else if (a[i][j] == # ) { wall++; left = j + 1; r += x - j; x = j + 1; g = true; break; } else if (a[i + 1][j] == . ) { r += x - j + 1; x = j; down = true; break; } } } if (wall == 2) { cout << Never ; return 0; } } } cout << r; return 0; }
#include <bits/stdc++.h> using namespace std; struct node { node *l, *r, *p; long long v, s, z, w, t, k, i; node(long long v, long long i) : l(0), r(0), p(0), v(v), s(1), z(0), w(0), t(v), k(1), i(i) {} }; inline bool is_root(node *n) { return n->p == NULL || n->p->l != n && n->p->r != n; } inline bool left(node *n) { return n == n->p->l; } inline long long size(node *n) { return n ? n->s + n->z : 0; } inline long long tot(node *n) { return n ? n->t : 0; } inline void push(node *n) { n->s += n->z; n->w += n->z; n->k += 2 * n->z * (n->s - n->w); if (n->l) n->l->z += n->z; if (n->r) n->r->z += n->z; n->z = 0; } inline void update(node *n) { push(n); n->t = tot(n->l) + tot(n->r) + n->v * (n->s - n->w); } inline void connect(node *n, node *p, bool l) { (l ? p->l : p->r) = n; if (n) n->p = p; } inline void rotate(node *n) { node *p = n->p, *g = p->p; bool l = left(n); connect(l ? n->r : n->l, p, l); if (!is_root(p)) connect(n, g, left(p)); else n->p = g; connect(p, n, !l); update(p), update(n); } inline void splay(node *n) { while (!is_root(n)) { node *p = n->p, *g = p->p; if (!is_root(p)) push(g); push(p), push(n); if (!is_root(p)) rotate(left(n) ^ left(p) ? n : p); rotate(n); } push(n); } inline node *find_root(node *n) { if (n == NULL) return NULL; while (n->l) { push(n); n = n->l; } return n; } inline node *expose(node *n) { node *last = NULL; for (node *m = n; m; m = m->p) { splay(m); m->w = size(find_root(last)); m->r = last; last = m; update(m); } splay(n); return last; } void link(node *m, node *n) { expose(m), expose(n); m->p = n; n->z += size(m); } void cut(node *n) { expose(n); n->l->z -= size(n); n->l->p = NULL; n->l = NULL; } node *lca(node *m, node *n) { expose(m); return expose(n); } const int MAXN = 50005; long long N, M, P[MAXN], A, B, ans; char C; node *V[MAXN]; int main() { cin >> N; cout << fixed << setprecision(9); for (int i = 1; i < N; i++) { cin >> P[i]; P[i]--; } for (int i = 0; i < N; i++) { int v; cin >> v; V[i] = new node(v, i); ans += v; } for (int i = 1; i < N; i++) { link(V[i], V[P[i]]); ans += 2 * tot(V[P[i]]) * size(V[i]); } cout << 1.0 * ans / N / N << n ; cin >> M; while (M--) { cin >> C >> A >> B; if (C == P ) { node *v = V[A - 1], *u = V[B - 1]; if (lca(u, v) == v) swap(u, v); expose(v); ans -= 2 * tot(v->l) * size(v); cut(v); link(v, u); ans += 2 * tot(u) * size(v); } else { node *v = V[A - 1]; expose(v); update(v); ans += (B - v->v) * v->k; v->v = B; } cout << 1.0 * ans / N / N << n ; } }
#include <bits/stdc++.h> using namespace std; constexpr int N = 3e3; uint16_t a[N], lst[N], nxt[N], cnxt[20], dp[N][N]; int main() { cin.tie(0), ios::sync_with_stdio(0); int t, n; cin >> t; while (t--) { cin >> n; for (int i = 0; i < n; ++i) { cin >> a[i], --a[i]; } memset(lst, 0, n * sizeof *lst); for (int i = 0; i < n; ++i) { ++lst[a[i]]; } int w = -1, r = 0, purged = 0; while (r < n) { if (w >= 0 && a[w] == a[r]) { if (--lst[a[r++]] == 1) { --w; ++purged; } } else if (lst[a[r]] == 1) { ++r; ++purged; } else { a[++w] = a[r++]; } } memset(lst, -1, n * sizeof *lst); n = w + 1; memset(nxt, 127, n * sizeof *nxt); for (int i = 0; i < n; ++i) { if (lst[a[i]] != (uint16_t)-1) { nxt[lst[a[i]]] = i; } lst[a[i]] = i; } for (int i = n - 1; i > -1; --i) { auto* cnxte = cnxt; for (int z = nxt[i]; z < n; z = nxt[z]) { *cnxte++ = z; } *cnxte = n; cnxte = cnxt; for (int j = i + 1; j < n; ++j) { if (a[j] == a[i]) { ++cnxte; } int t = dp[i + 1][j] - 1; #pragma GCC unroll 20 for (const auto* z = cnxt; z < cnxte; ++z) { t = max(t, dp[i + 1][*z - 1] + dp[*z][j]); } dp[i][j] = t + 1; } } cout << (n ? n - dp[0][n - 1] : 0) - 1 + purged << n ; ; } }
#include <bits/stdc++.h> using namespace std; pair<int, int> seg[2100000], lazy[2100000]; pair<int, int> Merge(pair<int, int> l, pair<int, int> r) { if (l < r) return l; else return r; } void Propagate(int n, int l, int r) { if (lazy[n] != make_pair(0x3f3f3f3f, 0)) { if (l != r) { lazy[n << 1] = Merge(lazy[n << 1], lazy[n]); lazy[n << 1 | 1] = Merge(lazy[n << 1 | 1], lazy[n]); } seg[n] = Merge(seg[n], lazy[n]); lazy[n] = make_pair(0x3f3f3f3f, 0); } } pair<int, int> Update(int L, int R, pair<int, int> val, int n, int l, int r) { Propagate(n, l, r); if (r < L || R < l) return seg[n]; if (L <= l && r <= R) { lazy[n] = Merge(lazy[n], val); Propagate(n, l, r); return seg[n]; } int mid = l + r >> 1; return seg[n] = Merge(Update(L, R, val, n << 1, l, mid), Update(L, R, val, n << 1 | 1, mid + 1, r)); } pair<int, int> Query(int L, int R, int n, int l, int r) { Propagate(n, l, r); if (r < L || R < l) return make_pair(0x3f3f3f3f, 0); if (L <= l && r <= R) return seg[n]; int mid = l + r >> 1; return Merge(Query(L, R, n << 1, l, mid), Query(L, R, n << 1 | 1, mid + 1, r)); } int N, M; vector<pair<int, int> > v[300001]; pair<int, int> dp[300001]; int main() { for (int i = 0; i < 2100000; i++) seg[i] = lazy[i] = make_pair(0x3f3f3f3f, 0); ios::sync_with_stdio(0); cin.tie(0); cin.exceptions(ios::badbit | ios::failbit); cin >> N >> M; vector<int> com; for (int i = 1; i <= M; i++) { int n, l, r; cin >> n >> l >> r; r++; v[n].push_back({l, r}); com.push_back(l); com.push_back(r); } sort(com.begin(), com.end()); com.erase(unique(com.begin(), com.end()), com.end()); for (int i = 1; i <= N; i++) for (auto &[l, r] : v[i]) { l = lower_bound(com.begin(), com.end(), l) - com.begin(); r = lower_bound(com.begin(), com.end(), r) - com.begin(); } for (int i = 1; i <= N; i++) { dp[i] = {i - 1, 0}; for (auto [l, r] : v[i]) { auto it = Query(l, r - 1, 1, 0, (int)com.size() - 1); dp[i] = min(dp[i], make_pair(it.first + i, it.second)); } for (auto [l, r] : v[i]) { Update(l, r - 1, make_pair(dp[i].first - i - 1, i), 1, 0, (int)com.size() - 1); } } int res = 0x3f3f3f3f, n = 0; for (int i = 1; i <= N; i++) { int val = dp[i].first + (N - i); if (res > val) res = val, n = i; } set<int> s; for (int i = 1; i <= N; i++) s.insert(i); while (n) { s.erase(n); n = dp[n].second; } cout << res << n ; if (res) { for (int i : s) cout << i << ; cout << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, x; cin >> n >> x; long long count = 0; if (n >= x) { for (long long i = 1; i < n + 1; i++) { if (x % i == 0) { count++; } } } else { for (long long i = 2; i < n + 1; i++) { if (x % i == 0 && ((x / i) <= n)) { count++; } } } cout << count; }
#include <bits/stdc++.h> using namespace std; void show_trace() { cout << endl; } template <typename Start, typename... Rem> void show_trace(Start S, Rem... R) { cout << << S; show_trace(R...); } const int INFi = 2139062143; const long long INF = 1e18; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n; string s, t; cin >> s >> t; int ct1 = count(s.begin(), s.end(), a ) + count(t.begin(), t.end(), a ); int ct2 = count(s.begin(), s.end(), b ) + count(t.begin(), t.end(), b ); if (ct1 % 2 != 0 || ct2 % 2 != 0) { cout << -1 << n ; return 0; } vector<int> ab, ba; for (int i = 0; i < n; i++) { if (s[i] == t[i]) continue; if (s[i] == a && t[i] == b ) ab.push_back(i); else ba.push_back(i); } int sz1 = ab.size(); int sz2 = ba.size(); vector<pair<int, int> > ans; for (int i = 1; i < sz1 - (sz1 % 2); i += 2) { ans.push_back({ab[i], ab[i - 1]}); } for (int i = 1; i < sz2 - (sz2 % 2); i += 2) { ans.push_back({ba[i], ba[i - 1]}); } assert(sz1 % 2 == sz2 % 2); if (sz1 % 2) { ans.push_back({ab[sz1 - 1], ab[sz1 - 1]}); ans.push_back({ab[sz1 - 1], ba[sz2 - 1]}); } cout << ans.size() << n ; for (auto [x, y] : ans) cout << x + 1 << << y + 1 << n ; }
#include <bits/stdc++.h> using namespace std; void solve() { long long n; cin >> n; string s; cin >> s; vector<string> all; for (long long i = 0; i <= 9; i++) { all.push_back(s); for (char &c : s) if (c == 9 ) c = 0 ; else c++; } string ans = s; for (string &x : all) { for (long long i = 0; i < n; i++) { string y = x; rotate(y.begin(), y.begin() + y.size() - i, y.end()); ans = min(y, ans); } } cout << ans << n ; } void solve(bool testcase) { long long t; cin >> t; while (t--) solve(); } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); solve(); return 0; }
#include <bits/stdc++.h> using namespace std; long double a[100009][2]; long double maxi(long double a, long double b) { if (a > b) return a; else return b; } bool solve(long double mid, int n, long double p) { long double req = 0; for (int i = 0; i < n; i++) { req += maxi(0.00, mid * a[i][0] - a[i][1]); } if (req > mid * p) return false; else return true; } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); long double n, p, sum = 0, count = 0, m, flag = 0, ans = 0, k; cin >> n >> p; long double l = 0, r = 1e10; for (int i = 0; i < n; i++) { cin >> a[i][0] >> a[i][1]; } while (flag < 1000) { long double m = (l + r) / 2; if (solve(m, n, p)) ans = m, l = m; else r = m; flag++; } if (ans >= 1e10) { cout << -1; return 0; } cout << setprecision(8) << ans; return 0; }
#include <bits/stdc++.h> using namespace std; void FREOPEN() {} inline double Time() { return (clock() * 1.0) / CLOCKS_PER_SEC; } const int N = (int)2000, inf = (int)2e9, MOD = (int)1e9 + 7, alph = 26; char CH[N]; const long long INF = (long long)1e18; const int dx[] = {1, -1, 0, 0, -1, 1, -1, 1}; const int dy[] = {0, 0, 1, -1, -1, 1, 1, -1}; const int dp[] = {8, 9, 1, 13, 3, 12, 7, 5, 0, 2, 4, 11, 6, 10, 15, 14}; int a[N][N]; int main() { FREOPEN(); int n; cin >> n; int num = 0; for (int bi = 0; bi < n; bi += 4) { for (int bj = 0; bj < n; bj += 4) { for (int i = bi; i < bi + 4; i++) { for (int j = bj; j < bj + 4; j++) { int p = (i - bi) * 4 + (j - bj); a[i][j] = (dp[p] ^ num); } } num += 16; } } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) printf( %d , a[i][j]); printf( n ); } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 2000000 + 7; const int M = 26; const int mod = 999983; const int inf = 1e9 + 7; const double pi = acos(-1); const int maxn = N * 2; const double PI = acos(-1); int n, m; int a[N]; int dp[22][N]; string s; void solve() { cin >> n >> m; for (int i = (0); i < (n); i++) { cin >> s; for (int j = (0); j < (m); j++) { int u = s[j] - 0 ; a[j] = (a[j] << 1) | u; } } for (int i = (0); i < (m); i++) { dp[0][a[i]]++; } for (int k = (1); k < (n + 1); k++) { for (int mask = (0); mask < (1 << n); mask++) { if (k >= 2) dp[k][mask] = (k - 2 - n) * dp[k - 2][mask]; for (int p = (0); p < (n); p++) dp[k][mask] += dp[k - 1][mask ^ (1 << p)]; dp[k][mask] /= k; } } int ans = inf; for (int mask = (0); mask < (1 << n); mask++) { int cur = 0; for (int k = (0); k < (n + 1); k++) cur += min(k, n - k) * dp[k][mask]; ans = min(ans, cur); } cout << ans; } int main() { int T = 1; for (int i = (1); i < (T + 1); i++) { solve(); } }
#include <bits/stdc++.h> using namespace std; char s[2005]; char p[505]; int dp[2005][2005]; int len[2005]; int main() { scanf( %s , s); scanf( %s , p); int len_s = strlen(s); int len_p = strlen(p); for (int i = 0; i < len_s; i++) { int tot = i; if (s[i] != p[0]) { len[i] = -1; continue; } for (int j = 0; j < len_p; j++) { while (tot < len_s && s[tot] != p[j]) tot++; tot++; } if (tot >= len_s + 1) len[i] = -1; else len[i] = tot - 1; } for (int i = 0; i <= len_s; i++) for (int j = 0; j <= len_s; j++) dp[i][j] = 0x3f3f3f3f; dp[0][0] = 0; int all = len_s / len_p; len[len_s] = -1; for (int i = 0; i <= len_s; i++) { if (i) { for (int j = 0; j <= all; j++) dp[i][j] = min(dp[i][j], dp[i - 1][j]); } if (len[i] != -1) { for (int j = 0; j <= all; j++) { dp[len[i] + 1][j + 1] = min(dp[len[i] + 1][j + 1], dp[i][j] + len[i] - i + 1 - len_p); } } } int temp = 1; while (dp[len_s][temp] <= 2000 && dp[len_s][temp] - dp[len_s][temp - 1] >= 0 && temp <= all) { for (int i = 0; i < dp[len_s][temp] - dp[len_s][temp - 1]; i++) printf( %d , temp - 1); temp++; } temp -= 1; int a = len_s - temp * len_p - dp[len_s][temp] + 1; while (a > 0 && a--) printf( %d , temp); for (int i = temp * len_p - 1; i >= 0; i--) { printf( %d , i / len_p); } }
#include <bits/stdc++.h> using namespace std; long long input[100000], n, output, table[100000], a, tlg, go, high, lg; int main(int argc, char** argv) { int i, j, k; while (scanf( %d , &n) == 1) { output = 0; lg = 1; tlg = 1; scanf( %d , &input[0]); for (i = 1; i < n; i++) { scanf( %d , &a); if (a != input[lg - 1]) { input[lg] = a; lg++; } } table[0] = input[0]; input[lg] = 1000000000; for (i = 1; i < lg; i++) { if ((input[i] < input[i - 1] && input[i] < input[i + 1]) || (input[i] > input[i - 1] && input[i] > input[i + 1])) { table[tlg] = input[i]; tlg++; } } table[tlg] = 1000000000; high = table[0]; for (i = 0; i < tlg; i++) { if (table[i] > table[i + 1] && table[i + 1] < table[i + 2]) { if (high > table[i + 2]) { output += table[i + 2] - table[i + 1]; i++; } else { output += high - table[i + 1]; high = table[i + 2]; i++; } } else { high = table[i + 1]; } } cout << output << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 333333; const long long mod = 1000000009ll; int n, m; struct node { int l, r; long long sum, f1, f2; } t[N * 6]; long long a[N], F[N]; inline long long read() { long long x = 0; char c = getchar(); while (!isdigit(c)) c = getchar(); while (isdigit(c)) { x = x * 10ll + c - 0 ; c = getchar(); } return x; } void calc_Fibonacci(int n) { F[1] = 1; F[2] = 1; for (int i = (3); i <= (N); i++) F[i] = (F[i - 1] + F[i - 2]) % mod; } long long calc(long long a, long long b, long long n) { if (n == 1) return a; else if (n == 2) return b; else return (a * F[n - 2] % mod + b * F[n - 1] % mod) % mod; } long long calc_range(long long a, long long b, long long n) { if (n == 1) return a; else if (n == 2) return (a + b) % mod; else return (calc(a, b, n + 2) - b + mod) % mod; } void build(int x, int l, int r) { int mid = (l + r) / 2, lc = x * 2, rc = x * 2 + 1; t[x].l = l; t[x].r = r; if (l == r) { t[x].sum = a[l]; t[x].f1 = t[x].f2 = 0; return; } build(lc, l, mid); build(rc, mid + 1, r); t[x].sum = (t[lc].sum + t[rc].sum) % mod; t[x].f1 = t[x].f2 = 0; } void pushdown(int x) { int l = t[x].l, r = t[x].r; int mid = (l + r) / 2, lc = x * 2, rc = x * 2 + 1; t[lc].f1 = (t[lc].f1 + t[x].f1) % mod; t[lc].f2 = (t[lc].f2 + t[x].f2) % mod; t[lc].sum += calc_range(t[x].f1, t[x].f2, mid - l + 1); t[lc].sum %= mod; t[rc].f1 = (t[rc].f1 + calc(t[x].f1, t[x].f2, mid - l + 2)) % mod; t[rc].f2 = (t[rc].f2 + calc(t[x].f1, t[x].f2, mid - l + 3)) % mod; t[rc].sum += calc_range(t[x].f1, t[x].f2, r - l + 1) - calc_range(t[x].f1, t[x].f2, mid - l + 1); t[rc].sum = (t[rc].sum + mod) % mod; t[x].f1 = t[x].f2 = 0; } void update(int x, int l, int r, int ql, int qr) { int mid = (l + r) / 2, lc = x * 2, rc = x * 2 + 1; if (l >= ql && r <= qr) { t[x].f1 = (t[x].f1 + F[l - ql + 1]) % mod; t[x].f2 = (t[x].f2 + F[l - ql + 2]) % mod; t[x].sum += calc_range(F[l - ql + 1], F[l - ql + 2], r - l + 1); t[x].sum %= mod; return; } pushdown(x); if (ql <= mid) update(lc, l, mid, ql, qr); if (qr > mid) update(rc, mid + 1, r, ql, qr); t[x].sum = (t[lc].sum + t[rc].sum) % mod; return; } long long query(int x, int l, int r, int ql, int qr) { int mid = (l + r) / 2, lc = x * 2, rc = x * 2 + 1; if (l >= ql && r <= qr) return t[x].sum; pushdown(x); long long ans_left = 0, ans_right = 0; if (ql <= mid) ans_left = query(lc, l, mid, ql, qr); if (qr > mid) ans_right = query(rc, mid + 1, r, ql, qr); return (ans_left + ans_right) % mod; } int main() { n = read(); m = read(); calc_Fibonacci(n); for (int i = (1); i <= (n); i++) a[i] = read(); build(1, 1, n); for (int i = (1); i <= (m); i++) { int tag, l, r; tag = read(); l = read(); r = read(); if (tag == 1) update(1, 1, n, l, r); else printf( %lld n , query(1, 1, n, l, r)); } return 0; }
#include <bits/stdc++.h> using namespace std; const int M = 100000 + 10; int a[M]; vector<int> ans[M]; int main() { int n, k; cin >> n >> k; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); int num = 0; while (num < k) { for (int i = n; i >= 0 && num < k; i--) { for (int j = 0; j < i; j++) { for (int x = n - 1; x >= i; x--) { ans[num].push_back(a[x]); } ans[num].push_back(a[j]); num++; if (num == k) { break; } } } } for (int i = 0; i < num; i++) { cout << ans[i].size() << ; for (int j = 0; j < ans[i].size(); j++) { cout << ans[i][j] << ; } cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; inline int Pow(int x, int y, int mod) { long long t = x, r = 1; for (; y; y >>= 1, t = t * t % mod) y& 1 ? r = r * t % mod : 0; return r; } inline int Get() { int res = 0, q = 1; char ch = getchar(); while ((ch < 0 || ch > 9 ) && ch != - ) ch = getchar(); if (ch == - ) q = -1, ch = getchar(); while (ch >= 0 && ch <= 9 ) res = res * 10 + ch - 0 , ch = getchar(); return res * q; } const double eps = 1e-12, pi = M_PI; const int oo = (int)2.1e9, mod = (int)1e9 + 7; const long long INF = (long long)1e17; const int N = 110; int n; int dp[N][3]; int a[N]; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d , a + i); dp[1][0] = 1; dp[1][1] = a[1] == 1 || a[1] == 3 ? 0 : oo; dp[1][2] = a[1] == 2 || a[1] == 3 ? 0 : oo; for (int i = 2; i <= n; ++i) { dp[i][0] = min(min(dp[i - 1][0], dp[i - 1][1]), dp[i - 1][2]) + 1; if (a[i] == 1 || a[i] == 3) dp[i][1] = min(dp[i - 1][0], dp[i - 1][2]); else dp[i][1] = oo; if (a[i] == 2 || a[i] == 3) dp[i][2] = min(dp[i - 1][0], dp[i - 1][1]); else dp[i][2] = oo; } printf( %d n , min(dp[n][0], min(dp[n][1], dp[n][2]))); return 0; }
#include <bits/stdc++.h> long long n, i, j, h, k, t, d; long double a, m, b; using namespace std; long double pow(long double a, long long b) { if (b == 0) return 1; if (b == 1) return a; long double t = pow(a, b / 2); t = t * t; if (b % 2 == 0) return t; else return t * a; } int main() { cin >> m >> n; a = m; for (i = 1; i < m; i++) { b = i / m; a -= pow(b, n); } cout << a; }
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; int main() { ios::sync_with_stdio(false); int _; cin >> _; while (_--) { int n; cin >> n; int ans = 1e9 + 10; for (int i = 1; i * i <= n; i++) { int res = i - 1 + ceil(1.0 * n / (1.0 * i)) - 1; ans = min(res, ans); } cout << ans << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int cycle; vector<int> adj[26], topo; int color[26]; void dfs(int i) { color[i] = 1; for (auto nx : adj[i]) if (!color[nx]) dfs(nx); else if (color[nx] == 1) cycle = 1; topo.push_back(i); color[i] = 2; } int main() { int n; scanf( %d , &n); string a[110]; for (int i = 0; i < n; i++) { cin >> a[i]; } if (n == 1) { for (char c = a ; c <= z ; c++) { cout << c; } return 0; } for (int i = 1; i < n; i++) { int flag = 0; for (int j = 0; j < (int)min(a[i - 1].size(), a[i].size()); j++) { if (a[i - 1][j] != a[i][j]) { adj[a[i - 1][j] - a ].push_back(a[i][j] - a ); flag = 1; break; } } if (!flag && a[i - 1].size() > a[i].size()) { puts( Impossible ); return 0; } } for (int i = 0; i < 26; i++) { if (!color[i]) dfs(i); } if (cycle) { puts( Impossible ); return 0; } reverse(topo.begin(), topo.end()); for (auto x : topo) cout << char(x + a ); return 0; }
#include <bits/stdc++.h> using namespace std; int n, m, ans, col[1000005], flag[1000005], tot, res[1000005]; int k = 1, la[1000005], ff[1000005 * 2], check[1000005], pre[1000005], pos, del[1000005]; int cnt, f[1000005], g[1000005]; struct node { int a, b; } e[1000005 * 2]; map<pair<int, int>, int> MAP; void add(int a, int b) { e[++k] = (node){a, b}; ff[k] = la[a]; la[a] = k; e[++k] = (node){b, a}; ff[k] = la[b]; la[b] = k; } void dfs(int x, int fa) { check[x] = flag[x] = 1; col[x] = -col[fa]; for (int a = la[x]; a; a = ff[a]) { if (e[a].b == fa) continue; if (!check[e[a].b]) { pre[e[a].b] = a; dfs(e[a].b, x); f[x] += f[e[a].b]; g[x] += g[e[a].b]; continue; } if (col[e[a].b] == col[x]) { if (flag[e[a].b]) { if (!cnt) pos = a; cnt++; f[x]++; } else f[x]--; } else { if (flag[e[a].b]) g[x]++; else g[x]--; } } flag[x] = 0; } int main() { int a, b; scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) { scanf( %d%d , &a, &b), add(a, b); int num = MAP[make_pair(a, b)]; if (num) del[i] = 1, del[num] = 1; MAP[make_pair(a, b)] = i; } col[0] = 1; for (int i = 1; i <= n; i++) if (!check[i]) dfs(i, 0); if (!cnt) for (int i = 1; i <= m; i++) res[++tot] = i; else { if (cnt == 1 && !del[pos >> 1]) res[++tot] = (pos >> 1); for (int i = 1; i <= n; i++) { if (f[i] == cnt && !g[i] && !del[pre[i] >> 1]) if (!pre[i]) { for (int a = la[i]; a; a = ff[a]) if (e[a].b == i && !del[a >> 1]) res[++tot] = (a >> 1); } else res[++tot] = (pre[i] >> 1); } } sort(res + 1, res + tot + 1); tot = unique(res + 1, res + tot + 1) - res - 1; printf( %d n , tot); for (int i = 1; i < tot; i++) printf( %d , res[i]); if (tot) printf( %d n , res[tot]); return 0; }
#include <bits/stdc++.h> using namespace std; int who(int n) { if (n < 5) { return n; } else { n -= 5; return who(n / 2); } } int main(int argc, char** argv) { int n, m; cin >> n >> m; vector<vector<char> > snake(n, vector<char>(m, # )); for (int i = 1; i < n; i += 2) { for (int j = (i / 2) % 2; j < m - 1 + (i / 2) % 2; ++j) { snake[i][j] = . ; } } for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { cout << snake[i][j]; } cout << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e5, K = 4; vector<int> g[N]; set<int> s; int a[N]; int get_index(const vector<int> x) { static map<vector<int>, int> m; static int cnt; if (m.find(x) == m.end()) m[x] = cnt++; return m[x]; } void dfs_pre(int u, int fa) { vector<int> x; for (int v : g[u]) if (v != fa) { dfs_pre(v, u); x.push_back(a[v]); } sort(x.begin(), x.end()); a[u] = get_index(x); } void dfs(int u, int fa) { vector<int> x; if (g[u].size() < K) { for (int v : g[u]) x.push_back(a[v]); sort(x.begin(), x.end()); s.insert(get_index(x)); } sort(g[u].begin(), g[u].end(), [](int x, int y) { return a[x] < a[y]; }); x.clear(); for (int i = 1; i < g[u].size(); i++) x.push_back(a[g[u][i]]); int t = a[u]; for (int i = 0; i < g[u].size(); i++) { if (g[u][i] != fa) { a[u] = get_index(x); dfs(g[u][i], u); } if (i < g[u].size() - 1) x[i] = a[g[u][i]]; } a[u] = t; } int main() { ios::sync_with_stdio(false); int n; cin >> n; for (int i = 0; i < n - 1; i++) { int x, y; cin >> x >> y; x--, y--; g[x].push_back(y); g[y].push_back(x); } dfs_pre(0, -1); dfs(0, -1); cout << s.size() << endl; }
#include <bits/stdc++.h> using namespace std; int main() { int t; int a[] = {1, 2, 3, 4, 6, 12}; int b[] = {12, 6, 4, 3, 2, 1}; cin >> t; while (t--) { string s; cin >> s; int ans[20]; int count = 0, n = 0, no; for (int i = 0; i < 6; i++) { for (int j = 0; j < b[i]; j++) { no = 0; for (int k = 0; k < a[i]; k++) { if (s[j + k * b[i]] != X ) { no = 1; break; } } if (!no) { ans[count++] = i; n++; break; } } } cout << n << ; for (int i = 0; i < n; i++) { cout << a[ans[i]] << x << b[ans[i]] << ; } cout << endl; } }
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) #pragma GCC optimize( unroll-loops ) using namespace std; const int arr = 2e5 + 10; const int ar = 2e3 + 10; const long double pi = acos(-1); const long double eps = 1e-10; const long long md = 1e9 + 7; vector<int> reb1[arr]; vector<int> reb2[arr]; bool use[arr]; int comp[arr]; const int M = 70 / 4 + 1; int dist[1ll << M][71]; void dfs(int now, int c) { comp[now] = c; use[now] = 1; for (auto wh : reb1[now]) { if (!use[wh]) { dfs(wh, c); } } } int main() { int n, m, a, b; cin >> n >> m >> a >> b; for (int i = 0; i < m; i++) { int u, v, c; cin >> u >> v >> c; if (c == a) { reb1[u].push_back(v); reb1[v].push_back(u); } if (c == b) { reb2[u].push_back(v); reb2[v].push_back(u); } } int c = 0; int cc = 1e5; for (int i = 1; i <= n; i++) { if (!use[i]) { dfs(i, ++c); int cnt = 0; for (int j = 1; j <= n; j++) { if (comp[j] == c) { cnt++; } } if (cnt <= 3) { for (int j = 1; j <= n; j++) { if (comp[j] == c) { comp[j] = cc; } } cc--; c--; } } } set<pair<int, pair<int, int>>> s; int start_mask = 0; if (comp[1] <= c) { start_mask |= (1ll << (comp[1] - 1)); } for (int m = 0; m < (1ll << c); m++) { for (int j = 1; j <= n; j++) { if (j == 1 && m == start_mask) { dist[m][j] = 0; } else { dist[m][j] = 2e9 + 1; } s.insert(make_pair(dist[m][j], make_pair(m, j))); } } function<bool(int, int)> have_bit = [&](int m, int bit) { return m & (1ll << bit); }; while (!s.empty()) { pair<int, int> now = s.begin()->second; s.erase(s.begin()); for (auto wh : reb1[now.second]) { if (comp[wh] > c || comp[now.second] == comp[wh] || !have_bit(now.first, comp[wh] - 1)) { int to_m = now.first | (comp[wh] > c ? 0 : (1ll << (comp[wh] - 1))); if (dist[to_m][wh] > dist[now.first][now.second] + a) { s.erase(make_pair(dist[to_m][wh], make_pair(to_m, wh))); dist[to_m][wh] = dist[now.first][now.second] + a; s.insert(make_pair(dist[to_m][wh], make_pair(to_m, wh))); } } } for (auto wh : reb2[now.second]) { if ((comp[wh] > c || !have_bit(now.first, comp[wh] - 1)) && (comp[wh] != comp[now.second])) { int to_m = now.first | (comp[wh] > c ? 0 : (1ll << (comp[wh] - 1))); if (dist[to_m][wh] > dist[now.first][now.second] + b) { s.erase(make_pair(dist[to_m][wh], make_pair(to_m, wh))); dist[to_m][wh] = dist[now.first][now.second] + b; s.insert(make_pair(dist[to_m][wh], make_pair(to_m, wh))); } } } } for (int j = 1; j <= n; j++) { int ans = 2e9 + 1; for (int m = 0; m < (1ll << c); m++) { ans = min(ans, dist[m][j]); } cout << ans << ; } cout << n ; }
#include <bits/stdc++.h> using namespace std; vector<pair<long long, long long> > v; bool cmp(pair<long long, long long> a, pair<long long, long long> b) { if (a.first == b.first) a.second < b.second; return a.first > b.first; } int main() { long long t, n, arr[200005], brr[200005], i; cin >> t; while (t--) { cin >> n; for (i = 0; i < n; i++) cin >> arr[i]; for (i = 0; i < n; i++) cin >> brr[i]; for (i = 0; i < n; i++) v.push_back({arr[i], brr[i]}); sort(v.begin(), v.end(), cmp); long long self = 0; long long deli = v[0].first; long long mx = max(self, deli); long long mn = deli; for (i = 1; i < n; i++) { self += v[i - 1].second; deli = v[i].first; mx = max(self, deli); mn = min(mn, mx); } mn = min(mn, self + v[n - 1].second); cout << mn << endl; v.clear(); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, s; cin >> n >> s; int a[n + 1]; int b[n + 1]; bool isCrossable = false; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) cin >> b[i]; if (a[1] == 0 || (a[s] == 0 && b[s] == 0)) { cout << NO ; return 0; } for (int i = 1; i <= n; i++) { if (i >= s && a[i] == 1 && b[i] == 1) isCrossable = true; } if (a[s]) { cout << YES ; return 0; } if (b[s] && isCrossable) { cout << YES ; return 0; } cout << NO ; return 0; }
#include <bits/stdc++.h> using namespace std; struct interval { int l, r; bool operator<(const interval &t) const { return r < t.r; } }; set<interval> itree[20]; set<interval>::iterator l, r; long long ans; long long f(int type, int num) { return (1LL << type) * ((num + 1LL) * num) / 2; } void add(int type, int pos, int val) { interval unit = {pos, pos}; l = r = itree[type].lower_bound(unit); if (val == 0) { if (r->l <= pos && pos <= r->r) { interval new_left = {r->l, pos - 1}, new_right = {pos + 1, r->r}; ans -= f(type, (r->r) - (r->l) + 1); ans += f(type, new_left.r - new_left.l + 1); ans += f(type, new_right.r - new_right.l + 1); itree[type].erase(r); if (new_left.l <= new_left.r) itree[type].insert(new_left); if (new_right.l <= new_right.r) itree[type].insert(new_right); } } else { if (r->l <= pos && pos <= r->r) { return; } if (!itree[type].empty()) { if (l != itree[type].begin() && (--l)->r == pos - 1) { unit.l = l->l; ans -= f(type, l->r - l->l + 1); itree[type].erase(l); } if (r != itree[type].end() && r->l == pos + 1) { unit.r = r->r; ans -= f(type, r->r - r->l + 1); itree[type].erase(r); } } itree[type].insert(unit); ans += f(type, unit.r - unit.l + 1); } } int main() { int n, m; cin >> n >> m; for (int i = 1; i <= n; ++i) { int a; cin >> a; for (int j = 0; j < 20; ++j) { if (a % 2 != 0) add(j, i, a % 2); a /= 2; } } for (int i = 0; i < m; ++i) { int pos, val; cin >> pos >> val; for (int j = 0; j < 20; ++j) { add(j, pos, val % 2); val /= 2; } cout << ans << n ; } }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long long n, a, b; cin >> a >> b >> n; if (n % 2 == 0) cout << (n / 2) * (a - b) << endl; else cout << ((n / 2) * (a - b)) + a << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 2000005; long long n, L, t; long long K; long long a[maxn]; double ans; int main() { scanf( %I64d%I64d%I64d , &n, &L, &t); t += t; K = t / L; t = t - L * K; ans += 0.25 * (double)K * n * (n - 1); for (int i = 1; i <= n; i++) scanf( %I64d , &a[i]), a[i + n] = a[i]; for (int i = 1; i <= n; i++) { int l = i, r = i + n - 1; while (l < r) { int mid = (l + r + 1) / 2; if (mid > n) { if (L - a[i] + a[mid] <= t) l = mid; else r = mid - 1; } else { if (a[mid] - a[i] <= t) l = mid; else r = mid - 1; } } ans += 0.25 * (l - i); } printf( %lf n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); int n; cin >> n; vector<int> a(n); set<int> s; int g = 0; for (int i = 0; i < n; i++) { cin >> a[i]; g ^= a[i]; s.insert(a[i]); } if (n == 3) { printf( YES n ); printf( 1 n ); printf( 1 2 3 n ); return 0; } if (n % 2 == 0 and g > 0) { printf( NO n ); return 0; } if (n % 2 == 0) { printf( YES n ); vector<pair<int, pair<int, int>>> v; for (int i = 1;; i += 2) { if (i + 2 > n) break; v.push_back(make_pair(i, make_pair(i + 1, i + 2))); } for (int i = 1;; i += 2) { if (i + 3 == n) break; v.push_back(make_pair(i, make_pair(i + 1, n))); } printf( %d n , v.size()); for (auto p : v) { printf( %d %d %d n , p.first, p.second.first, p.second.second); } return 0; } else { printf( YES n ); vector<pair<int, pair<int, int>>> v; for (int i = 1;; i += 2) { if (i + 2 > n) break; v.push_back(make_pair(i, make_pair(i + 1, i + 2))); } for (int i = 1;; i += 2) { if (i + 2 == n) break; v.push_back(make_pair(i, make_pair(i + 1, n))); } printf( %d n , v.size()); for (auto p : v) { printf( %d %d %d n , p.first, p.second.first, p.second.second); } return 0; } }
#include <bits/stdc++.h> using namespace std; const int MAXN = 1100; int N, M; int WX, WY, BX, BY; int wdist[MAXN][MAXN]; int wprev[MAXN][MAXN]; int bdist[MAXN][MAXN]; int bprev[MAXN][MAXN]; int xc[8] = {-2, 2, -1, 1, -2, 2, -1, 1}; int yc[8] = {-1, -1, -2, -2, 1, 1, 2, 2}; bool is_white; void await() { int nx, ny; cin >> nx >> ny; if (nx == -1) exit(0); if (is_white) { BX = nx; BY = ny; } else { WX = nx; WY = ny; } } void wsolve(int sx, int sy) { wdist[sx][sy] = 0; wprev[sx][sy] = -1; vector<pair<int, int> > q; q.push_back(make_pair(sx, sy)); for (int i = 0; i < q.size(); i++) { int cx = q[i].first, cy = q[i].second; int cdist = wdist[cx][cy]; for (int j = 0; j < 8; j++) { int x = cx + xc[j], y = cy + yc[j]; if (x < 1 || y < 1 || x > N || y > M) continue; if (wdist[x][y] <= cdist + 1) continue; wdist[x][y] = cdist + 1; wprev[x][y] = j; q.push_back(make_pair(x, y)); } } } void bsolve(int sx, int sy) { bdist[sx][sy] = 0; bprev[sx][sy] = -1; vector<pair<int, int> > q; q.push_back(make_pair(sx, sy)); for (int i = 0; i < q.size(); i++) { int cx = q[i].first, cy = q[i].second; int cdist = bdist[cx][cy]; for (int j = 0; j < 8; j++) { int x = cx + xc[j], y = cy + yc[j]; if (x < 1 || y < 1 || x > N || y > M) continue; if (bdist[x][y] <= cdist + 1) continue; bdist[x][y] = cdist + 1; bprev[x][y] = j; q.push_back(make_pair(x, y)); } } } bool wwin(int bmove) { int wturns = wdist[WX][WY]; int wblock = bdist[WX][WY]; int bturns = bdist[BX][BY]; int bblock = wdist[BX][BY]; if (bmove) { if (bturns <= wturns) { if (bturns < wblock) return false; if (bturns % 2 == wblock % 2) return true; return false; } else { if (wturns < bblock - 1) return true; if (wturns % 2 != bblock % 2) return false; return true; } } else { if (wturns <= bturns) { if (wturns < bblock) return true; if (wturns % 2 == bblock % 2) return false; return true; } else { if (bturns < wblock - 1) return false; if (bturns % 2 != wblock % 2) return true; return false; } } } int main() { cin >> N >> M >> WX >> WY >> BX >> BY; for (int i = 0; i < MAXN; i++) for (int j = 0; j < MAXN; j++) wdist[i][j] = bdist[i][j] = 1e9; wsolve(N / 2, M / 2); bsolve(N / 2 + 1, M / 2); if (wwin(0)) { is_white = true; cout << WHITE n ; } else { is_white = false; cout << BLACK n ; await(); } while (true) { int bloc = -1, bturns = 1e9; for (int i = 0; i < 8; i++) { if (is_white) { WX += xc[i]; WY += yc[i]; if (WX >= 1 && WX <= N && WY >= 1 && WY <= M) { if (wwin(1)) { if (wdist[WX][WY] < bturns) { bturns = wdist[WX][WY]; bloc = i; } } } WX -= xc[i]; WY -= yc[i]; } else { BX += xc[i]; BY += yc[i]; if (BX >= 1 && BX <= N && BY >= 1 && BY <= M) { if (!wwin(0)) { if (bdist[BX][BY] < bturns) { bturns = bdist[BX][BY]; bloc = i; } } } BX -= xc[i]; BY -= yc[i]; } } if (is_white) { WX += xc[bloc]; WY += yc[bloc]; cout << WX << << WY << n << flush; } else { BX += xc[bloc]; BY += yc[bloc]; cout << BX << << BY << n << flush; } if (is_white && WX == N / 2 && WY == M / 2) break; if (!is_white && BX == N / 2 + 1 && BY == M / 2) break; if (WX == BX && WY == BY) break; await(); } }
#include <bits/stdc++.h> using namespace std; void Read(int &x) { char c; while (c = getchar(), c != EOF) if (c >= 0 && c <= 9 ) { x = c - 0 ; while (c = getchar(), c >= 0 && c <= 9 ) x = x * 10 + c - 0 ; ungetc(c, stdin); return; } } int n, a, b; stack<int> s; bool dfs(long long now) { if (now > b) return 0; if (now == b) { s.push(b); return 1; } if (dfs(now << 1)) { s.push(now); return 1; } if (dfs(now * 10 + 1)) { s.push(now); return 1; } return 0; } int main() { Read(a), Read(b); if (dfs(a)) { puts( YES ); printf( %u n , s.size()); while (!s.empty()) { printf( %d , s.top()); s.pop(); } } else puts( NO ); }
#include <bits/stdc++.h> using namespace std; int main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0); int t; cin >> t; while (t--) { long long l, r; cin >> l >> r; cout << l << << l * 2 << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; pair<long long, int> ar[200003 + 2]; long long DP[200003 + 2][2]; long long n; long long dp(int i, bool fl) { if (i == n + 1) { if (fl == 0) return 0; return 2e18; } if (i > n + 1) return 2e18; long long &ret = DP[i][fl]; if (ret != -1) return ret; ret = 2e18; if (fl == 0) ret = min(ret, -ar[i].first + dp(i + 2, 1)); else { ret = min(ret, dp(i + 1, 1)); ret = min(ret, +ar[i].first + dp(i + 1, 0)); } return ret; } int team[200003 + 2]; long long res; int cnt = 0; void print(int i, bool fl) { if (i == n + 1) return; if (fl == 0) { res += ar[i].first; team[ar[i].second] = ++cnt; team[ar[i + 1].second] = cnt; print(i + 2, 1); } else { long long kop = dp(i + 1, 1); if (kop == res) { team[ar[i].second] = cnt; print(i + 1, 1); } else { team[ar[i].second] = cnt; res -= ar[i].first; print(i + 1, 0); } } } int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> ar[i].first; ar[i].second = i; } sort(ar + 1, ar + n + 1); memset(DP, -1, sizeof DP); res = dp(1, 0); long long ans = res; print(1, 0); cout << ans << << cnt << endl; for (int i = 1; i <= n; i++) { if (i > 1) cout << ; cout << team[i]; } cout << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int MX = 500000; int m, i, j, ii; long long l, r, k, R, h, s, a[2][2], b[2][2], f[2][2]; void upd(long long h) { if (r / h - (l - 1) / h >= k) R = max(R, h); } int main() { scanf( %d%I64d%I64d%I64d , &m, &l, &r, &k); for (h = 1; h <= MX; h++) upd(h); for (h = 1; r / h > MX; h++) upd(r / h); for (h = 1; (l - 1) / h > MX; h++) upd((l - 1) / h); R--; a[0][0] = 0; a[0][1] = 1 % m; a[1][0] = 1 % m; a[1][1] = 1; f[0][0] = 1 % m; f[0][1] = 0; f[1][0] = 0; f[1][1] = 1 % m; for (ii = 60; ii >= 0; ii--) { for (i = 0; i < 2; i++) for (j = 0; j < 2; j++) { b[i][j] = 0; for (int k = 0; k < 2; k++) b[i][j] = (b[i][j] + f[i][k] * f[k][j]) % m; } if (R & (1LL << ii)) for (i = 0; i < 2; i++) for (j = 0; j < 2; j++) { f[i][j] = 0; for (int k = 0; k < 2; k++) f[i][j] = (f[i][j] + b[i][k] * a[k][j]) % m; } else for (i = 0; i < 2; i++) for (j = 0; j < 2; j++) f[i][j] = b[i][j]; } printf( %I64d n , f[1][1] % m); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, h; cin >> n >> h; double s = 1.0 * h / n; double t = s; for (int i = 0; i < n - 1; i++) { double ans = sqrt(1.0 * s * h); s += t; printf( %.12llf n , ans); } return 0; }