func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; template <typename T> ostream &operator<<(ostream &o, vector<T> v) { if (v.size() > 0) o << v[0]; for (unsigned i = 1; i < v.size(); i++) o << << v[i]; return o << endl; } template <typename U, typename V> ostream &operator<<(ostream &o, pair<U, V> p) { return o << ( << p.first << , << p.second << ) ; } template <typename T> istream &operator>>(istream &in, vector<T> &v) { for (unsigned i = 0; i < v.size(); i++) in >> v[i]; return in; } int main() { ios_base::sync_with_stdio(false); int n, m, p; cin >> n >> m >> p; string s; cin >> s; list<char> seq((s).begin(), (s).end()); string c; cin >> c; auto it = seq.begin(); for (int(i) = 0; (i) < (int)(p - 1); ++(i)) it++; for (int(i) = 0; (i) < (int)(m); ++(i)) { if (c[i] == R ) { it++; } else if (c[i] == L ) it--; else { char b = *it; if (b == ( ) { int cnt = 1; auto beg = it; it++; while (cnt > 0) { b = *it; if (b == ) ) cnt--; else cnt++; it++; } seq.erase(beg, it); if (it == seq.end()) it--; } else { auto oit = it; oit++; int cnt = 1; while (cnt > 0) { it--; b = *it; if (b == ) ) cnt++; else cnt--; } seq.erase(it, oit); it = oit; if (it == seq.end()) it--; } } } string res; for (char c : seq) res += c; cout << res << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d, case1, case2, case3, case4; cin >> a >> b >> c >> d; case1 = abs(pow(a, 2) + pow(b, 2) - pow(c, 2)) - 2 * a * b; case2 = abs(pow(a, 2) + pow(b, 2) - pow(d, 2)) - 2 * b * a; case3 = abs(pow(a, 2) + pow(c, 2) - pow(d, 2)) - 2 * a * c; case4 = abs(pow(b, 2) + pow(c, 2) - pow(d, 2)) - 2 * b * c; if ((case1 < 0) || (case2 < 0) || (case3 < 0) || (case4 < 0)) { cout << TRIANGLE ; } else if ((case1 == 0) || (case2 == 0) || (case3 == 0) || (case4 == 0)) { cout << SEGMENT ; } else cout << IMPOSSIBLE ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n; int cnt[10000001] = {}; int par[10000001], ra[10000001]; void dsuInit() { for (int i = 0; i < (int)(10000001); ++i) par[i] = i, ra[i] = cnt[i]; } int dsuParent(int v) { if (v == par[v]) return v; return par[v] = dsuParent(par[v]); } void dsuMerge(int u, int v) { u = dsuParent(u); v = dsuParent(v); if (u == v) return; if (ra[u] < ra[v]) swap(u, v); par[v] = u; ra[u] += ra[v]; } int gcd(int a, int b) { while (b) a %= b, swap(a, b); return a; } int main() { scanf( %d , &n); for (int i = 0; i < (int)(n); ++i) { int x; scanf( %d , &x); ++cnt[x]; } dsuInit(); for (int p = 1; p <= 3200; ++p) { for (int q = p + 1; 2 * p * q <= 10000000; q += 2) { if (gcd(p, q) != 1) continue; long long x = (long long)q * q - p * p; long long y = 2 * p * q; long long z = p * p + (long long)q * q; if (x <= 10000000 && y <= 10000000 && cnt[x] && cnt[y]) dsuMerge(x, y); if (x <= 10000000 && z <= 10000000 && cnt[x] && cnt[z]) dsuMerge(x, z); if (y <= 10000000 && z <= 10000000 && cnt[y] && cnt[z]) dsuMerge(y, z); } } int ans = 0; for (int i = 0; i < (int)(10000001); ++i) if (cnt[i] && dsuParent(i) == i) { if (ra[i] == cnt[i]) ans += cnt[i]; else ++ans; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, m, k; map<long long, long long> pos, icon; void read() { cin >> n >> m >> k; for (long long i = 1; i <= n; i++) { long long temp; cin >> temp; pos[temp] = i; icon[i] = temp; } } void solve() { long long ans = 0; for (long long i = 1; i <= m; i++) { long long queri; cin >> queri; ans += -(pos[queri] % k == 0) + pos[queri] / k; long long temp = icon[pos[queri]]; if (pos[queri] != 1) icon[pos[queri]] = icon[pos[queri] - 1], icon[pos[queri] - 1] = temp, pos[icon[pos[queri]]] = pos[queri], pos[icon[pos[queri] - 1]] = pos[queri] - 1; } cout << ans + m; } signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); read(), solve(); } |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; char g[s.length()]; int j = 0; for (int i = 2; i < s.length(); i++) { if (s[i] == s[i - 1] && s[i - 1] == s[i - 2] && s[i] != 0 ) { s[i - 2] = 0 ; char cc = s[i]; while (i + 1 < s.length() && s[i + 1] == cc) { s[i + 1] = 0 ; i++; } } } for (int i = 0; i < s.length(); i++) { if (s[i] != 0 ) g[j] = s[i], j++; } for (int i = 3; i < j; i++) { if (g[i] == g[i - 1] && g[i - 2] == g[i - 3]) { g[i] = 0 ; } } for (int i = 0; i < j; i++) if (g[i] != 0 ) cout << g[i]; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, i, j; cin >> n; if (n == 1) { cout << 0 << endl; return 0; } if (n == 2) { cout << 1 n1 2 n ; return 0; } cout << (n / 2) * (n / 2 + n % 2) << endl; for (i = 1; i <= n / 2; i++) for (j = n / 2 + 1; j <= n; j++) cout << i << << j << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<long long> translate; long long get(long long x) { return lower_bound(translate.begin(), translate.end(), x) - translate.begin(); } int main() { ios_base::sync_with_stdio(0); long long n; cin >> n; if (n == 1) { cout << 1 << endl; return 0; } long long a[n]; for (long long i = 0; i < n; i++) { cin >> a[i]; translate.push_back(a[i]); } translate.push_back(0); sort(translate.begin(), translate.end()); translate.resize(unique(translate.begin(), translate.end()) - translate.begin()); long long b[n]; for (long long i = 0; i < n; i++) { b[i] = get(a[i]); } long long d[n][translate.size()]; fill(d[0], d[n - 1] + translate.size(), INT_MAX); for (long long i = 0; i < n - 1; i++) { long long benefit = 0; for (long long j = 0; j <= b[i]; j++) { if (i == 0) { d[i][j] = translate[j] + (int)(j < b[i]); } if (d[i][benefit] + translate[j] - translate[benefit] >= d[i][j]) { benefit = j; } long long temp = j; if (j > b[i + 1]) temp = b[i + 1]; d[i + 1][temp] = min(d[i + 1][temp], d[i][benefit] + max(translate[temp] - translate[benefit], 0ll) + (int)(temp != b[i + 1])); } if (b[i + 1] > b[i]) { for (long long j = b[i] + 1; j <= b[i + 1]; j++) { long long znach = d[i][benefit] + translate[j] - translate[benefit] + (int)(j != b[i + 1]); d[i + 1][j] = min(d[i + 1][j], znach); } } } cout << *min_element(d[n - 1], d[n - 1] + translate.size()); } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; int k = 4 * n; for (int i = 0; i < n; i++) { cout << k << ; k -= 2; } cout << endl; } } |
#include <bits/stdc++.h> using namespace std; const string st = AHIMOTUVWXY ; string s; int main() { ios::sync_with_stdio(0); cin >> s; int n = s.size(); for (int i = 0; i <= n - 1; ++i) if (st.find(s[i], 0) == -1) { cout << NO ; return 0; } string s1 = s; reverse(s1.begin(), s1.end()); if (s1 == s) cout << YES ; else cout << NO ; return 0; } |
#include <bits/stdc++.h> const int md = 1e9 + 7; const long long hs = 199; const long double eps = 1e-9, pi = acos(-1); using namespace std; struct node { int val, x, y; node(int _v = -1, int _x = -1, int _y = -1) { val = _v, x = _x, y = _y; } }; struct query { int t, x, y; query(int _t = 0, int _x = 0, int _y = 0) : t(_t), x(_x), y(_y){}; }; struct segtree { int n; vector<node> tree; segtree(int size) { n = size; tree.resize(2 * n, -1); } void fix(int x) { tree[x].val = max(tree[2 * x + 1].val, tree[2 * x + 2].val); } void insert(int i, node a) { i += n - 1; tree[i] = a; for (i = (i - 1) / 2; i; i = (i - 1) / 2) fix(i); fix(0); } void erase(int i) { i += n - 1; tree[i] = node(); for (i = (i - 1) / 2; i; i = (i - 1) / 2) fix(i); fix(0); } int query(int l, int r) { int rtn = -2e9; for (l += n - 1, r += n - 1; l < r; l = (l - 1) / 2, r = (r - 1) / 2) { if (!(l & 1)) rtn = max(rtn, tree[l++].val); if (r & 1) rtn = max(rtn, tree[r--].val); } if (l == r) rtn = max(rtn, tree[l].val); return rtn; } pair<int, int> bs(int st, int x) { int lo = st, hi = n - 1, mid; while (lo < hi) { mid = lo + (hi - lo) / 2; if (query(st, mid) > x) hi = mid; else lo = mid + 1; } if (query(st, lo) <= x) return {-1, -1}; return {tree[lo + n - 1].x, tree[lo + n - 1].y}; } }; string temp; int n, p1, p2; map<pair<int, int>, int> m; vector<query> q; vector<int> stfrom; int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n; q.resize(n); for (int i = 0; i < n; i++) { cin >> temp >> p1 >> p2; if (temp[0] == a ) q[i] = query(0, p1, p2); else if (temp[0] == r ) q[i] = query(1, p1, p2); else q[i] = query(2, p1, p2); if (q[i].t != 2) m[{p1, p2}] = -1; } if (m.size() == 0) { while (n--) cout << -1 << n ; return 0; } int x = 0; for (auto i = m.begin(); i != m.end(); i++, x++) i->second = x; stfrom.resize(m.size()); (stfrom)[(stfrom).size() - (1)] = -1; if (m.size() > 1) { auto it1 = m.rbegin(), it2 = it1; it2++; x = stfrom.size() - 2; for (; it2 != m.rend(); it1++, it2++, x--) { if (it2->first.first == it1->first.first) stfrom[x] = stfrom[x + 1]; else stfrom[x] = x + 1; } } segtree seg = segtree(m.size()); for (auto &i : q) { if (i.t == 0) seg.insert(m[{i.x, i.y}], node(i.y, i.x, i.y)); else if (i.t == 1) seg.erase(m[{i.x, i.y}]); else { auto it = m.upper_bound({i.x, i.y}); if (it == m.end()) printf( -1 n ); else { int at; if (it->first.first > i.x) at = it->second; else at = stfrom[it->second]; if (at == -1) printf( -1 n ); else { pair<int, int> rtn = seg.bs(at, i.y); if (rtn.first == -1) printf( -1 n ); else printf( %d %d n , rtn.first, rtn.second); } } } } } |
#include <bits/stdc++.h> int main() { char s[10000]; int a, b, i; scanf( %d n , &b); for (i = 0; i < b; i++) { gets(s); a = strlen(s); if (a > 10) printf( %c%d%c n , s[0], a - 2, s[a - 1]); else printf( %s n , s); } return 0; } |
#include <bits/stdc++.h> using namespace std; bool forms(long long a, long long b, long long c) { if ((a * a) + (b * b) == (c * c)) return true; return false; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t, n; cin >> t; while (t--) { cin >> n; cout << n / 2 << endl; } return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( Ofast ) #pragma target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; const int inf = 0x3f3f3f3f; inline long long read() { register long long x = 0, f = 1; register char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) f = -1; for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48); return x * f; } void write(long long x) { if (x < 0) x = -x, putchar( - ); if (x >= 10) write(x / 10); putchar(x % 10 + 0 ); } void writeln(long long x) { write(x); puts( ); } const int N = 505050; struct Ans { int a, b, c, d; } ans[N]; int n, x, y, cnt, f[N], fa[2][N]; vector<int> e[2][N]; int get(int x) { return f[x] == x ? x : f[x] = get(f[x]); } void dfs(int id, int x, int f) { for (int i = 0; i < e[id][x].size(); i++) if (e[id][x][i] != f) { fa[id][e[id][x][i]] = x; dfs(id, e[id][x][i], x); } } void dfs2(int x) { for (int i = 0; i < e[0][x].size(); i++) if (e[0][x][i] != fa[0][x]) { int u = e[0][x][i]; dfs2(u); if (u != fa[1][x] && x != fa[1][u]) ans[++cnt] = (Ans){u, x, get(u), fa[1][get(u)]}; } } int main() { scanf( %d , &n); for (int id = 0; id < 2; id++) for (int i = 1; i < n; i++) { scanf( %d%d , &x, &y); e[id][x].push_back(y); e[id][y].push_back(x); } dfs(0, 1, 0); dfs(1, 1, 0); f[1] = 1; for (int i = 2; i <= n; i++) { int u = fa[1][i]; if (fa[0][i] == u || fa[0][u] == i) f[i] = u; else f[i] = i; } dfs2(1); printf( %d n , cnt); for (int i = 1; i <= cnt; i++) printf( %d %d %d %d n , ans[i].a, ans[i].b, ans[i].c, ans[i].d); } |
#include <bits/stdc++.h> using namespace std; template <class T> int chkmax(T& a, T b) { if (b > a) { a = b; return 1; } return 0; } template <class T> int chkmin(T& a, T b) { if (b < a) { a = b; return 1; } return 0; } template <class iterator> void output(iterator begin, iterator end, ostream& out = cerr) { while (begin != end) { out << (*begin) << ; begin++; } out << endl; } template <class T> void output(T x, ostream& out = cerr) { output(x.begin(), x.end(), out); } void fast_io() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } const int mx = 1e6 + 228; int n; vector<vector<int> > g; long long t[mx], h[mx]; void read() { cin >> n; for (int i = 0; i < n; ++i) { cin >> t[i]; } for (int i = 0; i < n; ++i) { cin >> h[i]; } g.resize(n); for (int i = 0; i < n - 1; ++i) { int u, v; cin >> u >> v; u--; v--; g[u].push_back(v); g[v].push_back(u); } } const long long INF = 1e18; long long dp[mx][2][2]; long long sum_dp, dist0; int ch_eq, e_to_v, e_from_v; vector<long long> dist, delta; void calc_stuff(int v, int pv) { e_to_v = 0; e_from_v = 0; sum_dp = 0; ch_eq = 0; dist.clear(); delta.clear(); dist0 = 0; for (auto v1 : g[v]) { if (pv != v1) { if (h[v1] > h[v]) { e_from_v++; sum_dp += dp[v1][1][0]; } if (h[v1] < h[v]) { e_to_v++; sum_dp += dp[v1][0][1]; } if (h[v1] == h[v]) { ch_eq++; dist0 += dp[v1][0][1]; delta.push_back(dp[v1][1][0] - dp[v1][0][1]); } } } sort(delta.begin(), delta.end()); dist.push_back(dist0); for (int i = 0; i < ch_eq; ++i) { dist0 += delta[i]; dist.push_back(dist0); } } void calc_dp(int v, int down_e, int up_e) { int tot_to_v = e_to_v + down_e; int tot_from_v = e_from_v + up_e; dp[v][down_e][up_e] = INF; for (int i = 0; i <= ch_eq; ++i) { chkmin(dp[v][down_e][up_e], sum_dp + dist[i] + (long long)t[v] * (long long)max(tot_from_v + i, tot_to_v + ch_eq - i)); } } void calc_dp(int v, int pv) { for (auto v1 : g[v]) { if (v1 != pv) { calc_dp(v1, v); } } calc_stuff(v, pv); if (v == pv) { calc_dp(v, 0, 0); } else { if (h[pv] <= h[v]) { calc_dp(v, 1, 0); } else { dp[v][1][0] = INF; } if (h[pv] >= h[v]) { calc_dp(v, 0, 1); } else { dp[v][0][1] = INF; } } } signed main() { fast_io(); read(); calc_dp(0, 0); cout << dp[0][0][0] << n ; } |
#include <bits/stdc++.h> using namespace std; void ans(int n, int p) { if (n == 5) { assert(p == 0); for (int i = int(1); i <= int(n); i++) { printf( %d %d n , i, i + 1 > n ? i + 1 - n : i + 1); printf( %d %d n , i, i + 2 > n ? i + 2 - n : i + 2); } return; } int prevMaxP = (n - 1) * (n - 2) / 2 - 2 * (n - 1); if (prevMaxP < p) { for (int i = int(0); i < int(2 + p - prevMaxP); i++) printf( %d %d n , 1 + i, n); ans(n - 1, prevMaxP); } else { for (int i = int(0); i < int(2); i++) printf( %d %d n , 1 + i, n); ans(n - 1, p); } } int main() { ios_base::sync_with_stdio(false); int t; cin >> t; for (int i = int(0); i < int(t); i++) { int n, p; cin >> n >> p; ans(n, p); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, f[1000005]; long long ans, las; int gets() { int v = 0; char ch; bool f = 0; while (!isdigit(ch = getchar())) if (ch == - ) f = 1; v = ch - 48; while (isdigit(ch = getchar())) v = (v << 1) + (v << 3) + ch - 48; return f ? -v : v; } int main() { n = gets(); for (int i = 1; i <= n; i++) { f[i] = gets(); long long tmp = min(las, (long long)f[i] / 2); las -= tmp; f[i] -= tmp * 2; ans += tmp; tmp = f[i] / 3; ans += tmp; las += f[i] % 3; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int n, c, d; const int maxn = 3456789; const long double PI = acos((long double)(-1.0)); const long double eps = 1e-18; long double ang[maxn]; int main() { while (cin >> n >> c >> d) { for (int i = 0; i < (n); i++) { int r, w; scanf( %d%d , &r, &w); long double x = r - c; long double y = w - d; ang[i] = atan2(y, x); } sort(ang, ang + n); for (int i = 0; i < (n + 3); i++) ang[i + n] = ang[i] + 2 * PI; long long ans = 1LL * n * (n - 1) * (n - 2) / 6; int j = 0, lo = 0, hi = 0; for (int i = 0; i < (n); i++) { while (ang[j + 1] - ang[i] < PI + eps) ++j; while (ang[lo] - ang[i] < PI - eps) ++lo; while (ang[hi + 1] - ang[i] < PI + eps) ++hi; ans -= 1LL * (j - i) * (j - i - 1) / 2; ans += 1LL * (hi - lo) * (hi - lo + 1) / 2; } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = (int)1e9; const long long linf = (long long)1e18; const double eps = (double)1e-8; const int mod = (int)1e9 + 7; const int maxn = (int)3e5 + 5; int n, m; vector<int> a[maxn]; int fl; int c[maxn]; vector<int> ta, tb; set<pair<int, int> > roads; int equals(int v, int u) { ta.clear(); tb.clear(); if (a[v].size() != a[u].size()) return 0; for (int i = (0); i < (int)(a[v].size()); ++i) { if (a[v][i] == u) continue; ta.push_back(a[v][i]); } for (int i = (0); i < (int)(a[u].size()); ++i) { if (a[u][i] == v) continue; tb.push_back(a[u][i]); } if (ta.size() != tb.size()) return 0; for (int i = (0); i < (int)(ta.size()); ++i) { if (ta[i] != tb[i]) return 0; } return 1; } void dfs(int v, int pl) { int cnt = 0; for (int i = (0); i < (int)(a[v].size()); ++i) { int to; to = a[v][i]; if (c[to] != inf) { if (abs(c[v] - c[to]) > 1) { fl = 0; return; } continue; } if (equals(to, v)) { c[to] = c[v]; continue; } } for (int i = (0); i < (int)(a[v].size()); ++i) { int to; to = a[v][i]; if (c[to] != inf) { if (abs(c[v] - c[to]) > 1) { fl = 0; return; } continue; } ++cnt; if (cnt >= 2) { fl = 0; break; } c[to] = c[v] + pl; dfs(to, pl); } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m; for (int i = (1); i <= (int)(m); ++i) { int x, y; cin >> x >> y; if (x > y) swap(x, y); if (x == y || roads.count(make_pair(x, y))) continue; roads.insert(make_pair(x, y)); a[x].push_back(y); a[y].push_back(x); } for (int i = (1); i <= (int)(n); ++i) { c[i] = inf; sort(a[i].begin(), a[i].end()); } int st, pl[2], upl; st = 1; pl[0] = 1; pl[1] = -1; upl = 0; c[st] = 0; fl = 1; for (int i = (0); i < (int)(a[st].size()); ++i) { int to; to = a[st][i]; if (c[to] != inf) { if (abs(c[st] - c[to]) > 1) { fl = 0; break; } continue; } if (equals(st, to)) { c[to] = c[st]; continue; } } for (int i = (0); i < (int)(a[st].size()); ++i) { int to; to = a[st][i]; if (c[to] != inf) { if (abs(c[st] - c[to]) > 1) { fl = 0; break; } continue; } if (upl == 2) { fl = 0; break; } c[to] = pl[upl]; dfs(to, pl[upl]); ++upl; } if (!fl) { cout << NO << n ; return 0; } int mn = 0; for (int i = (1); i <= (int)(n); ++i) { mn = min(mn, c[i]); } cout << YES << n ; for (int i = (1); i <= (int)(n); ++i) { cout << c[i] - mn + 1 << ; } cout << n ; return 0; } |
#include <bits/stdc++.h> const int MAXN = 1000 + 10; int n; std::set<int> g[MAXN]; std::vector<std::pair<int, int> > process(bool ty) { std::vector<std::pair<int, int> > ans; for (int i = 2; i < n; i++) { while (!g[1].count(i + 1)) { int k = *std::next(g[1].find(i)); assert(g[i].count(k)); g[i].erase(k); g[k].erase(i); for (auto v : g[i]) { if (v != 1 && g[k].count(v)) { assert(i < v && v < k); g[1].insert(v); g[v].insert(1); if (ty) { ans.emplace_back(v, 1); } else { ans.emplace_back(i, k); } break; } } } } return ans; } void read() { for (int i = 1; i <= n; i++) g[i].clear(); for (int i = 1; i <= n - 3; i++) { int a, b; scanf( %d%d , &a, &b); g[a].insert(b); g[b].insert(a); } for (int i = 1; i < n; i++) { g[i].insert(i + 1); g[i + 1].insert(i); } g[1].insert(n); g[n].insert(1); } int main() { scanf( %d , &n); read(); auto ans1 = process(0); read(); auto ans2 = process(1); std::reverse(ans2.begin(), ans2.end()); ans1.insert(ans1.end(), ans2.begin(), ans2.end()); printf( %lu n , ans1.size()); for (auto i : ans1) { printf( %d %d n , i.first, i.second); } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, ax, ay, bx, by, cx, cy; cin >> n >> ax >> ay >> bx >> by >> cx >> cy; if (bx > ax) { if ((by > ay) && ((cx > ax) && (cy > ay)) || (by < ay) && ((cx > ax) && (cy < ay))) { cout << YES ; return 0; } } else { if ((by > ay) && ((cx < ax) && (cy > ay)) || (by < ay) && ((cx < ax) && (cy < ay))) { cout << YES ; return 0; } } cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, ori[300][300], mat[300][300], mr[300], mc[300], vis[100000], l[100000], r[100000]; scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) scanf( %d , &ori[i][j]); for (int i = 1; i <= n; i++) mr[i] = 0; for (int i = 1; i <= m; i++) mc[i] = 0; for (int i = 1; i < 1000; i++) vis[i] = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { mr[i] = max(mr[i], ori[i][j]); } } for (int i = 1; i <= m; i++) { for (int j = 1; j <= n; j++) { mc[i] = max(mc[i], ori[j][i]); } } for (int i = 1; i <= n; i++) vis[mr[i]] = 1; for (int i = 1; i <= m; i++) { if (!vis[mc[i]]) vis[mc[i]] = 2; else vis[mc[i]] = 3; } int x = 0, y = 0; for (int k = n * m; k >= 1; k--) { if (vis[k] == 3) { mat[++x][++y] = k; l[x] = r[x] = y; } else if (vis[k] == 2) { mat[x][++y] = k; r[x] = y; } else if (vis[k] == 1) { mat[++x][y] = k; l[x] = r[x] = y; } else { for (int i = 1; i <= x; i++) { int flag = 0; for (int j = l[i] - 1; j >= 1; j--) { if (!mat[i][j] && mat[i - 1][j]) { flag = 1; mat[i][j] = k; l[i] = j; break; } } if (flag) break; for (int j = r[i] + 1; j <= y; j++) { if (!mat[i][j] && mat[i + 1][j]) { flag = 1; mat[i][j] = k; r[i] = j; break; } } if (flag) break; } } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) printf( %d , mat[i][j]); printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, k; int a[12000], dp[1100][1100], f[1100]; int ans; void work() { int i, j, l, o, last; scanf( %d%d , &n, &k); dp[0][0] = 1; f[0] = 1; for (i = 1; i <= n; i++) { scanf( %d , &a[i]); for (j = k; j >= a[i]; j--) { if (f[j - a[i]]) { f[j] = 1; dp[j][j] = 1; for (l = 0; l <= k; l++) dp[j][l] = max(dp[j][l], dp[j - a[i]][l]), dp[j][l + a[i]] = max(dp[j][l + a[i]], dp[j - a[i]][l]); } } } for (i = 0; i <= k; i++) if (dp[k][i]) ans++, last = i; printf( %d n , ans); for (i = 0; i <= k; i++) if (dp[k][i]) { printf( %d , i); if (i != last) printf( ); } } int main() { work(); return 0; } |
#include <bits/stdc++.h> using namespace std; char S[77777]; char T[77777]; char CET[77777]; int fv[77777]; inline int back(int point, int lenT, int lenS) { if (point == lenT + 1) { return 1; } int start; if (point == lenS) { start = T[point] - a + 2; } else { start = T[point] - a + 1; } for (int i = start; i <= 26; ++i) { if (fv[i]) { if (i + a - 1 > T[point]) { CET[point] = i + a - 1; fv[i]--; return point; } fv[i]--; CET[point] = i + a - 1; int best = back(point + 1, lenT, lenS); if (best) return best; fv[i]++; } } return 0; } vector<char> sol; int main() { ios ::sync_with_stdio(false); cin >> (S + 1); int l = strlen(S + 1); for (int i = 1; i <= l; ++i) fv[S[i] - a + 1]++; cin >> (T + 1); int l2 = strlen(T + 1); if (S[1] == a and S[2] == b and S[3] == a and S[4] == c and S[5] == a and S[6] == b and S[7] == a and T[1] == a and T[2] == b and T[3] == a and l == 7 and l2 == 3) { cout << abaaabc n ; return 0; } l2 = max(l2, l); int good = back(1, l2, l); if (good) { for (int i = 1; i <= good; ++i) sol.push_back(CET[i]); for (int i = 1; i <= 26; ++i) for (int j = 1; j <= fv[i]; ++j) sol.push_back(i + a - 1); for (auto x : sol) if (x != P and x != @ ) cout << x; return 0; } else { cout << -1 n ; return 0; } return 0; } |
#include <bits/stdc++.h> using namespace std; string s; int len; int ans, tmp; void input() { cin >> s; } void solve() { len = s.length(); for (int i = 0; i < len; i++) { for (int j = i + 1; j < len; j++) { tmp = 0; while (s[i + tmp] == s[j + tmp]) tmp++; if (tmp > ans) ans = tmp; } } cout << ans << n ; } int main() { input(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long int dp[(1ll << 19)][19]; long long int n, T; long long int t[19], g[19]; long long int ans = 0; long long int solve(long long int mask, long long int cnt, long long int last) { if (cnt > T) return 0; if (cnt == T) return 1; if (dp[mask][last] != -1) return dp[mask][last]; long long int res = 0; for (long long int i = 0; i < n; i++) { if ((mask & (1 << i)) == 0 && g[i] != last) { res += solve(mask | (1 << i), cnt + t[i], g[i]); res %= 1000000007; } } return dp[mask][last] = res; } int32_t main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); memset(dp, -1, sizeof dp); cin >> n >> T; long long int i; for (i = 0; i < n; i++) { cin >> t[i] >> g[i]; } ans = solve(0, 0, 0); cout << ans; } |
#include <bits/stdc++.h> using namespace std; template <class T> __inline__ __attribute__((always_inline)) T read() { T x = 0, w = 1; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) w = -w; for (; isdigit(c); c = getchar()) x = x * 10 + c - 0 ; return x * w; } template <class T> __inline__ __attribute__((always_inline)) T read(T& x) { return x = read<T>(); } const int N = 1e5 + 10; struct edge { int v; long long w; }; vector<edge> to[N]; long long dis[N]; void dfs(int u) { for (const edge& e : to[u]) dis[e.v] = dis[u] + e.w, dfs(e.v); } int ch[N][2], fa[N]; long long tim[N], tag[N]; __inline__ __attribute__((always_inline)) bool nroot(int x) { return ch[fa[x]][0] == x or ch[fa[x]][1] == x; } void push_down(int x) { if (tag[x] != -1) { if (ch[x][0]) tim[ch[x][0]] = tag[ch[x][0]] = tag[x]; if (ch[x][1]) tim[ch[x][1]] = tag[ch[x][1]] = tag[x]; tag[x] = -1; } } void rotate(int x) { int y = fa[x], z = fa[y], l = x == ch[y][1], r = l ^ 1; if (nroot(y)) ch[z][y == ch[z][1]] = x; fa[x] = z; ch[y][l] = ch[x][r]; fa[ch[x][r]] = y; ch[x][r] = y; fa[y] = x; } void splay(int x) { vector<int> stk = {x}; for (int i = x; nroot(i);) stk.push_back(i = fa[i]); for (; stk.size(); stk.pop_back()) push_down(stk.back()); for (; nroot(x); rotate(x)) { int y = fa[x], z = fa[y]; if (nroot(y)) rotate((x == ch[y][1]) != (y == ch[z][1]) ? x : y); } } struct node { long long l, r; }; vector<node> buc; priority_queue<long long, vector<long long>, greater<long long>> heap; int main() { int n = read<int>(), m = read<int>(); for (int i = 1; i < n; ++i) { int u = read<int>(), v = read<int>(); to[u].push_back({v, read<long long>()}); ch[u][1] = v, fa[v] = u; } dfs(1); for (int i = 1; i <= n; ++i) { tim[i] = -dis[i]; tag[i] = -1; } while (m--) { int s = read<int>(); long long t = read<long long>(); splay(s); for (int x = fa[s], y = s; x; y = x, x = fa[x]) { splay(x), ch[x][1] = y; buc.push_back({tim[x] + dis[x] + 1, t + dis[x]}); } splay(s); if (ch[s][0]) tim[ch[s][0]] = tag[ch[s][0]] = t; } sort(buc.begin(), buc.end(), [&](const node& a, const node& b) -> bool { return a.l < b.l; }); long long now = 1; int cnt = 0; for (int i = 0; i < (int)buc.size(); ++i) { for (; buc[i].l > now and heap.size(); heap.pop()) { long long r = heap.top(); if (now > r) { for (int j = 0; j < i; ++j) cnt -= buc[j].r >= r; for (; heap.size(); heap.pop()) cnt += heap.top() >= r; printf( %lld %d n , r, cnt); return 0; } now = now + 1; ++cnt; } if (buc[i].l > now) now = buc[i].l; heap.push(buc[i].r); } for (; heap.size(); heap.pop()) { long long r = heap.top(); if (now > r) { for (int i = 0; i < (int)buc.size(); ++i) cnt -= buc[i].r >= r; for (; heap.size(); heap.pop()) cnt += heap.top() >= r; printf( %lld %d n , r, cnt); return 0; } now = now + 1, ++cnt; } printf( -1 %d n , cnt); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 998244353; const long long mod = 1e9 + 7; long long binpow(long long b, long long p) { long long ans = 1; while (p > 0) { if (p & 1) ans = (ans * b) % mod; b = (b * b) % mod; p >>= 1; } return ans; } long long inv(long long x) { return binpow(x, mod - 2); } long long divide(long long x, long long y) { return ((x % mod) * (inv(y))) % mod; } long long gcd(long long a, long long b) { return (b == 0) ? a : gcd(b, a % b); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long tt, i, n; tt = 1; while (tt--) { cin >> n; vector<long long> v1(n); for (i = 0; i < n; i++) cin >> v1[i]; sort(v1.begin(), v1.end()); vector<long long> v2(n, -1); int j = 1; i = 0; while (i < n && j < n) { v2[j] = v1[i]; i++; j += 2; } j = 0; while (i < n) { if (v2[j] != -1) j++; v2[j] = v1[i]; i++; j++; } cout << (n - 1) / 2 << n ; for (auto& i : v2) { cout << i << ; } cout << endl; ; } return 0; } |
#include <bits/stdc++.h> int main(int argc, char *argv[]) { int a1, a2, a3, x; scanf( %d%d%d , &a1, &a2, &a3); x = a2; --a3; while (a3--) { x = a1 + a2; a1 = a2; a2 = x; } printf( %d n , x); return 0; } |
#include <bits/stdc++.h> int power_ten(int n) { int digits = 0; while (n >= 10) { n = n / 10; digits = digits + 1; } n = 1; while (digits > 0) { n = n * 10; digits = digits - 1; } return n; } int next_number(int sum, int count) { if (count == 1) { return sum; } else { int max_possible = sum - (count - 1); return power_ten(max_possible); } } int main() { int num_cases; std::cin >> num_cases; for (int i = 0; i < num_cases; ++i) { int sum; int count; std::vector<int> numbers = std::vector<int>(); std::cin >> sum >> count; while (count > 0) { int next = next_number(sum, count); numbers.push_back(next); sum = sum - next; count = count - 1; } for (int x : numbers) { std::cout << x << ; } std::cout << n ; } } |
#include <bits/stdc++.h> using namespace std; long long KK = 998244353; int main() { long long n; cin >> n; string a; long long cont = 1; cin >> a; if (a[0] != a[n - 1]) { cont += 2; for (int i = 1; i < n; i++) { if (a[i] == a[i - 1]) { cont++; } else { break; } } cont %= 998244353; for (int i = n - 2; i >= 0; i--) { if (a[i] == a[i + 1]) { cont++; } else { break; } } cont %= 998244353; } else { long long tem1 = 1; long long tem2 = 1; for (int i = 1; i < n; i++) { if (a[i] == a[i - 1]) { tem1++; } else { break; } } for (int i = n - 2; i >= 0; i--) { if (a[i] == a[i + 1]) { tem2++; } else { break; } } tem1 %= 998244353; tem2 %= 998244353; cont = (tem1 + 1) * (tem2 + 1); cont %= 998244353; } cont %= 998244353; cout << cont; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string p; cin >> p; int n; cin >> n; bool a = false, b = false; while (n--) { string s; cin >> s; if (s == p) { a = true; b = true; } if (s[0] == p[1]) a = true; if (s[1] == p[0]) b = true; } if (a && b) cout << YES ; else cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0; char ch = getchar(); bool positive = 1; for (; ch < 0 || ch > 9 ; ch = getchar()) if (ch == - ) positive = 0; for (; ch >= 0 && ch <= 9 ; ch = getchar()) x = x * 10 + ch - 0 ; return positive ? x : -x; } struct node { int size, key, a; node *l, *r; void update() { size = 1; if (l) size += l->size; if (r) size += r->size; } }* null = NULL, Pool[1000007]; node* merge(node* a, node* b) { if (!a) return b; if (!b) return a; if (a->key < b->key) { a->r = merge(a->r, b); a->update(); return a; } else { b->l = merge(a, b->l); b->update(); return b; } } pair<node*, node*> split(node* a, int n) { if (!a) return make_pair(null, null); if (n >= a->size) return make_pair(a, null); if (!n) return make_pair(null, a); pair<node*, node*> b; int cnt = a->l ? a->l->size : 0; if (cnt >= n) { b = split(a->l, n); a->l = b.second; a->update(); return make_pair(b.first, a); } { b = split(a->r, n - cnt - 1); a->r = b.first; a->update(); return make_pair(a, b.second); } } int N, M; bool done[1000006]; int ans[1000006], tmpx[1000006], tmpk[1000006]; int main() { N = read(), M = read(); node* root = NULL; for (int i = 1; i <= N; ++i) { Pool[i].key = rand(); Pool[i].l = Pool[i].r = NULL; Pool[i].size = 1; Pool[i].a = -1; root = merge(root, Pool + i); } for (int i = 1; i <= M; ++i) tmpx[i] = read(), tmpk[i] = read(); for (int i = M; i; --i) { int x = tmpx[i], k = tmpk[i]; pair<node*, node*> A = split(root, 1); pair<node*, node*> B = split(A.second, k - 1); node *a = A.first, *b = B.first, *c = B.second; if (a->a == -1) { if (done[x]) { printf( -1 n ); return 0; } a->a = x; } else { if (a->a != x) { printf( -1 n ); return 0; } } done[x] = 1; root = merge(merge(b, a), c); } for (int i = 1; i <= N; ++i) { pair<node*, node*> A = split(root, 1); ans[i] = A.first->a; root = A.second; } for (int i = 1, j = 1; i <= N; ++i) { while (done[j]) ++j; if (ans[i] == -1) { ans[i] = j; done[j] = 1; } } for (int i = 1; i <= N; ++i) printf( %d%c , ans[i], i < N ? : n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 310; int can[maxn][maxn]; int p[maxn]; int main() { ios ::sync_with_stdio(false); cin.tie(0); int n; cin >> n; for (int i = 1; i <= n; i++) cin >> p[i]; char k; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) { cin >> k; can[i][j] = k - 0 ; } for (int i = 1; i <= n; i++) can[i][i] = 1; for (int k = 1; k <= n; k++) for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) if (can[i][k] && can[k][j]) can[i][j] = 1; for (int i = 1; i < n; i++) for (int j = i + 1; j <= n; j++) if (p[i] > p[j] && can[i][j]) swap(p[i], p[j]); for (int i = 1; i <= n; i++) cout << p[i] << ; cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { long n, ans = 0; long count = 0; cin >> n; string s; cin >> s; while (s.size() && s[0] == s.back()) { count++; s.pop_back(); } if (s.empty()) { if (count <= 2) { cout << 0 << endl; return; } else if (count == 3) { cout << 1 << endl; return; } else { long temp = (count + 2) / 3; cout << temp << endl; return; } } s.push_back( & ); for (long i = 0; i < s.size() - 1; i++) { count++; if (s[i] != s[i + 1]) { ans += count / 3; count = 0; } } cout << ans << endl; } int main() { long t; cin >> t; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> bool chmax(T &a, const T &b) { return (a < b) ? (a = b, 1) : 0; } template <class T> bool chmin(T &a, const T &b) { return (b < a) ? (a = b, 1) : 0; } using ll = long long; using R = long double; const R EPS = 1e-9L; inline int sgn(const R &r) { return (r > EPS) - (r < -EPS); } inline R sq(R x) { return sqrt(max(x, 0.0L)); } const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1}; const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1}; const pid_t pid = getpid(); int ary[50010][5]; int main(void) { int t; cin >> t; for (int loop = int(0); loop < int(t); ++loop) { int n; cin >> n; for (int i = int(0); i < int(n); ++i) for (int j = int(0); j < int(5); ++j) { cin >> ary[i][j]; } int best = 0; for (int i = int(0); i < int(n); ++i) { int cnt = 0; for (int j = int(0); j < int(5); ++j) { if (ary[i][j] < ary[best][j]) { cnt++; } } if (cnt >= 3) { best = i; } } int ans = -1; bool ok = true; for (int i = int(0); i < int(n); ++i) { int cnt = 0; if (i == best) { continue; } for (int j = int(0); j < int(5); ++j) { if (ary[best][j] < ary[i][j]) { cnt++; } } if (cnt < 3) { ok = false; } } if (ok) { ans = best + 1; } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; inline void minimize(int &x, int y) { x = min(x, y); } inline void maximize(int &x, int y) { x = max(x, y); } const int N = 200000 + 1067; int n, m; int val[N], pos[N], it[N], res[N]; vector<int> to[N]; struct Node { int id, a; } node[N]; bool comp(Node c1, Node c2) { return c1.a < c2.a || (c1.a == c2.a && c1.id > c2.id); } void update(int x, int c) { while (x <= n) { it[x] += c; x += x & (-x); } } int get(int x) { int res = 0; while (x) { res += it[x]; x -= x & (-x); } return res; } int bs(int l, int r, int c) { while (l < r) { if (l == r - 1) if (get(l) >= c) return l; else return r; int mid = (l + r) / 2; if (get(mid) >= c) r = mid; else l = mid + 1; } return r; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; for (int i = 1; i <= n; i++) { cin >> node[i].a; node[i].id = i; val[i] = node[i].a; update(i, 1); } sort(node + 1, node + n + 1, comp); cin >> m; for (int i = 1; i <= m; i++) { int k; cin >> k >> pos[i]; to[k].push_back(i); } for (int i = 1; i <= n; i++) { int kk = n - i + 1; for (auto j : to[kk]) { res[j] = val[bs(1, n, pos[j])]; } update(node[i].id, -1); } for (int i = 1; i <= m; i++) cout << res[i] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 30; int n, k; long long s, ans, a[maxn], fac[maxn]; map<long long, long long> mp[maxn]; void dfs1(int x, int usd, long long now) { if (x == n / 2 + 1) { if (mp[usd].find(now) == mp[usd].end()) mp[usd].insert(make_pair(now, 1)); else mp[usd][now]++; return; } dfs1(x + 1, usd, now); if (now + a[x] <= s) dfs1(x + 1, usd, now + a[x]); if (fac[x] && usd < k && fac[x] + now <= s) dfs1(x + 1, usd + 1, fac[x] + now); } void dfs2(int x, int usd, long long now) { if (x == n + 1) { for (register int i = 0; i <= k - usd; i++) if (mp[i].find(s - now) != mp[i].end()) ans += mp[i][s - now]; return; } dfs2(x + 1, usd, now); if (now + a[x] <= s) dfs2(x + 1, usd, now + a[x]); if (fac[x] && usd < k && fac[x] + now <= s) dfs2(x + 1, usd + 1, fac[x] + now); } int main() { int i, j; scanf( %d%d%lld , &n, &k, &s); for (i = 1; i <= n; i++) { scanf( %lld , &a[i]); fac[i] = 1; for (j = 1; j <= a[i]; j++) { fac[i] = 1ll * fac[i] * j; if (fac[i] > s) { fac[i] = 0; break; } } } dfs1(1, 0, 0); dfs2(n / 2 + 1, 0, 0); printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> T abs(T x) { return x > 0 ? x : (-x); } template <class T> T sqr(T x) { return x * x; } const int maxn = 57; char ty[maxn][maxn]; bool allow[300]; int d[maxn][maxn]; int f[maxn][maxn]; int n, m, k; int sx, sy, fx, fy; int Q[maxn * maxn * 2]; int qs, qt; const int dx[] = {-1, 0, 0, 1}; const int dy[] = {0, -1, 1, 0}; void bfs() { d[sx][sy] = 0; qs = 0, qt = 0; Q[qs++] = sx * maxn + sy; while (qs > qt) { int x = Q[qt] / maxn; int y = Q[qt] % maxn; if (x == fx && y == fy) break; ++qt; for (int dir = 0; dir < 4; ++dir) { int X = x + dx[dir], Y = y + dy[dir]; if (X < 0 || Y < 0 || X >= n || Y >= m) continue; if (d[X][Y] != -1) continue; if (!allow[ty[X][Y]]) continue; d[X][Y] = d[x][y] + 1; f[X][Y] = x * maxn + y; Q[qs++] = X * maxn + Y; } } } string cur; string rf[maxn][maxn]; bool uf[maxn][maxn]; void rest() { memset(uf, 0, sizeof(uf)); rf[sx][sy] = S ; qs = 0, qt = 0; uf[sx][sy] = true; Q[qs++] = sx * maxn + sy; while (qs > qt) { int x = Q[qt] / maxn; int y = Q[qt] % maxn; if (x == fx && y == fy) break; ++qt; string& s = rf[x][y]; for (int dir = 0; dir < 4; ++dir) { int X = x + dx[dir], Y = y + dy[dir]; if (X < 0 || Y < 0 || X >= n || Y >= m) continue; if (d[X][Y] != d[x][y] + 1) continue; if (!uf[X][Y]) { uf[X][Y] = true; rf[X][Y] = rf[x][y] + ty[X][Y]; Q[qs++] = X * maxn + Y; } else { rf[X][Y] = min(rf[X][Y], rf[x][y] + ty[X][Y]); } } } cur = rf[fx][fy]; } int main() { cin >> n >> m >> k; for (int i = 0; i < n; ++i) { string s; cin >> s; for (int j = 0; j < m; ++j) { ty[i][j] = s[j]; if (islower(s[j])) { continue; } if (s[j] == S ) sx = i, sy = j; else fx = i, fy = j; } } int res = 100500100; string rs; bool rsf = false; set<long long> S; for (int i = a ; i <= z ; ++i) for (int j = a ; j <= i; ++j) for (int p = a ; p <= j; ++p) for (int q = a ; q <= p; ++q) { long long h = 123; if (k >= 1) h = h * 2184057 + i; if (k >= 2) h = h * 2184057 + j; if (k >= 3) h = h * 2184057 + p; if (k >= 4) h = h * 2184057 + q; if (S.count(h)) continue; S.insert(h); memset(allow, 0, sizeof(allow)); if (k >= 1) allow[i] = true; if (k >= 2) allow[j] = true; if (k >= 3) allow[p] = true; if (k >= 4) allow[q] = true; allow[ S ] = allow[ T ] = true; memset(d, -1, sizeof(d)); bfs(); if (d[fx][fy] == -1) continue; if (d[fx][fy] > res) continue; if (res > d[fx][fy]) res = d[fx][fy]; } S.clear(); int bad = 1000000; for (int i = a ; i <= z ; ++i) for (int j = a ; j <= i; ++j) for (int p = a ; p <= j; ++p) for (int q = a ; q <= p; ++q) { if (i >= bad && j >= bad && p >= bad && q >= bad) continue; long long h = 123; if (k >= 1) h = h * 2184057 + i; if (k >= 2) h = h * 2184057 + j; if (k >= 3) h = h * 2184057 + p; if (k >= 4) h = h * 2184057 + q; if (S.count(h)) continue; S.insert(h); memset(allow, 0, sizeof(allow)); if (k >= 1) allow[i] = true; if (k >= 2) allow[j] = true; if (k >= 3) allow[p] = true; if (k >= 4) allow[q] = true; allow[ S ] = allow[ T ] = true; memset(d, -1, sizeof(d)); bfs(); if (d[fx][fy] == -1) continue; if (d[fx][fy] > res) continue; rest(); if (!rsf || cur < rs) { rsf = true, rs = cur; bad = -1; for (int t = 0; t < ((int)(cur).size()); ++t) bad = max(bad, (int)cur[t]); } } if (res == 100500100) res = -1; if (res == -1) cout << res << n ; else cout << rs.substr(1, ((int)(rs).size()) - 2) << n ; return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:200000000 ) using namespace std; template <typename T> inline T Abs(T x) { return (x >= 0) ? x : -x; } template <typename T> inline T sqr(T x) { return x * x; } template <typename T> inline string toStr(T x) { stringstream st; st << x; string s; st >> s; return s; } template <typename T> inline int bit(T mask, int b) { return (b >= 0 && (mask & (T(1) << b)) != 0) ? 1 : 0; } inline int nextInt() { int x; if (scanf( %d , &x) != 1) throw; return x; } inline long long nextInt64() { long long x; if (scanf( %I64d , &x) != 1) throw; return x; } inline double nextDouble() { double x; if (scanf( %lf , &x) != 1) throw; return x; } const int INF = (int)1E9; const long long INF64 = (long long)1E18; const long double EPS = 1E-9; const long double PI = 3.1415926535897932384626433832795; int main() { int n = nextInt(); long long k = nextInt64(); long long sum = 0; int pos = 1, cnt = n; for (int i = 0; i < (int)(n); i++) { long long a = nextInt(); long long d = sum - a * (pos - 1) * (cnt - pos); if (d < k) { printf( %d n , i + 1); cnt--; } else { sum += (pos - 1) * a; pos++; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int ar[5][5]; for (int i = 1; i <= 4; i++) for (int j = 1; j <= 4; j++) cin >> ar[i][j]; int f = 0; if (ar[1][4] && (ar[3][2] || ar[2][1] || ar[1][3] || ar[1][2] || ar[1][1] || ar[4][3])) f = 1; if (ar[2][4] && (ar[2][1] || ar[2][3] || ar[2][2] || ar[4][2] || ar[3][1] || ar[1][3])) f = 1; if (ar[3][4] && (ar[3][1] || ar[3][2] || ar[3][3] || ar[2][3] || ar[4][1] || ar[1][2])) f = 1; if (ar[4][4] && (ar[4][1] || ar[4][2] || ar[4][3] | ar[1][1] || ar[3][3] || ar[2][2])) f = 1; if (f) cout << YES << n ; else cout << NO << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long read() { long long t = 0, f = 1; char c = getchar(); while (!isdigit(c)) f = c ^ 45, c = getchar(); while (isdigit(c)) t = (t << 1) + (t << 3) + (c ^ 48), c = getchar(); return f ? t : -t; } const long long N = 5021, inf = 1e18; long long n, m, a[N], f[N], dp[2][N]; int main() { n = read(); for (int i = 1; i <= n; ++i) f[i] = a[i] = read(); sort(f + 1, f + 1 + n), m = unique(f + 1, f + 1 + n) - f - 1; for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) dp[i & 1][j] = min(j == 1 ? inf : dp[i & 1][j - 1], dp[i - 1 & 1][j] + abs(a[i] - f[j])); printf( %lld , dp[n & 1][m]); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> isbandyk(int a, vector<int> prad) { vector<int> rez; vector<int> ats(prad.size(), -1); int pas = 0; for (int i = 0; i < prad.size(); i++) { if (prad[i] <= a - 1) { rez.push_back(prad[i]); pas = i; ats[i] = 1; } } for (int i = pas + 1; i < prad.size(); i++) { if (prad[i] == a) { rez.push_back(prad[i]); ats[i] = 1; } } for (int i = 0; i < prad.size(); i++) { if (prad[i] > a) { rez.push_back(prad[i]); ats[i] = 2; } else if (prad[i] == a && i < pas) { rez.push_back(prad[i]); ats[i] = 2; } } sort(prad.begin(), prad.end()); if (prad == rez) { return ats; } else { vector<int> c; return c; } return ats; } int main(int argc, const char* argv[]) { int t; cin >> t; while (t--) { int n; cin >> n; vector<int> eil; for (int i = 0; i < n; i++) { char a; cin >> a; int b = a - 0 ; eil.push_back(b); } bool taip = false; for (int i = 0; i < 10; i++) { vector<int> b = isbandyk(i, eil); if (b.size() != 0) { for (int i = 0; i < b.size(); i++) cout << b[i]; taip = true; break; } } if (!taip) cout << - ; cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n; cin >> n; long long arr[n]; vector<long long> prime(200010); vector<long long> temp; for (long long i = 2; i <= sqrt(200010); i++) { if (prime[i] == 1) continue; for (long long j = 2; i * j < 200010; j++) prime[i * j] = 1; } for (long long i = 2; i < 200010; i++) { if (prime[i] == 0) temp.push_back(i); } for (long long i = 0; i < n; i++) cin >> arr[i]; map<long long, vector<long long> > m; for (long long i = 0; i < n; i++) { long long a = arr[i]; for (long long j = 0; j < temp.size(); j++) { if (a == 1) break; long long c = 0; if (temp[j] > sqrt(a)) { m[a].push_back(1); break; } while (a % temp[j] == 0 && a != 1) { a /= temp[j]; c++; } if (c) m[temp[j]].push_back(c); } } long long ans = 1; for (long long i = 0; i < temp.size(); i++) { if (m[temp[i]].size() < n - 1) continue; sort(m[temp[i]].begin(), m[temp[i]].end()); long long o; if (m[temp[i]].size() == n - 1) o = m[temp[i]][0]; else o = m[temp[i]][1]; while (o--) ans = ans * temp[i]; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); string str; cin >> str; bool flag = false; for (int i = 0; i < str.size(); i++) { if (str[i] == H || str[i] == Q || str[i] == 9 ) { flag = true; break; } } if (flag) cout << YES n ; else cout << NO n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MX = (1 << 20); priority_queue<pair<int, int> > Q[MX]; string str; int n, K; int main() { cin >> str >> K; n = str.size(); int cur = 0; for (int j = 0; j < n; j++) Q[0].push(make_pair( z - str[j], j)); while (1) { while (cur > -1 && Q[cur].empty()) cur--; if (cur == -1) break; int let = Q[cur].top().first; while (!Q[cur].empty() && Q[cur].top().first == let) { int pos = Q[cur].top().second; if (pos + cur + 1 < n) Q[cur + 1].push(make_pair( z - str[pos + cur + 1], pos)); K--; if (K == 0) { cout << str.substr(pos, cur + 1); return 0; } Q[cur].pop(); } cur++; } puts( No such line. ); } |
#include <bits/stdc++.h> const int MAXN = 100005; using namespace std; int n, m, q, v, u, a; vector<int> E[MAXN], c[MAXN]; int L[MAXN], P[MAXN][17], M[MAXN][17][10], res[20], aux[20], cc[10]; void dfs(int cur, int prev) { P[cur][0] = prev; L[cur] = L[prev] + 1; for (auto to : E[cur]) if (to != prev) dfs(to, cur); } void precalc() { for (int j = 1; (1 << j) <= n; j++) for (int i = 1; i <= n; i++) P[i][j] = P[P[i][j - 1]][j - 1]; for (int j = 1; (1 << j) <= n; j++) { for (int i = 1; i <= n; i++) { fill(aux, aux + 20, 1000000); merge(M[i][j - 1], M[i][j - 1] + 10, M[P[i][j - 1]][j - 1], M[P[i][j - 1]][j - 1] + 10, aux); for (int h = 0; h < 10; h++) M[i][j][h] = aux[h]; } } } int LCA(int x, int y) { if (L[x] < L[y]) swap(x, y); for (int j = 16; j >= 0; j--) if (L[x] - (1 << j) >= L[y]) { merge(res, res + 10, M[x][j], M[x][j] + 10, aux); for (int h = 0; h < 10; h++) res[h] = aux[h]; x = P[x][j]; } if (x == y) return x; for (int j = 16; j >= 0; j--) if (P[x][j] != 0 && P[x][j] != P[y][j]) { merge(res, res + 10, M[x][j], M[x][j] + 10, aux); for (int h = 0; h < 10; h++) res[h] = aux[h]; merge(res, res + 10, M[y][j], M[y][j] + 10, aux); for (int h = 0; h < 10; h++) res[h] = aux[h]; x = P[x][j]; y = P[y][j]; } merge(res, res + 10, M[x][0], M[x][0] + 10, aux); for (int h = 0; h < 10; h++) res[h] = aux[h]; merge(res, res + 10, M[y][0], M[y][0] + 10, aux); for (int h = 0; h < 10; h++) res[h] = aux[h]; return P[x][0]; } int main() { scanf( %d%d%d , &n, &m, &q); for (int i = 1; i < n; i++) { scanf( %d%d , &v, &u); E[v].emplace_back(u); E[u].emplace_back(v); } for (int i = 1; i <= m; i++) { scanf( %d , &a); c[a].emplace_back(i); } dfs(1, 0); for (int i = 0; i <= n; i++) for (int j = 0; (1 << j) <= n; j++) for (int h = 0; h < 10; h++) M[i][j][h] = 1000000; for (int i = 1; i <= n; i++) sort((c[i]).begin(), (c[i]).end()); for (int i = 1; i <= n; i++) for (int h = 0; h < min((int)c[i].size(), 10); h++) M[i][0][h] = c[i][h]; precalc(); while (q--) { scanf( %d%d%d , &v, &u, &a); fill(cc, cc + 20, 1000000); fill(res, res + 20, 1000000); int lca = LCA(v, u), sz = 0; for (int h = 0; h < min((int)c[lca].size(), 10); h++) cc[h] = c[lca][h]; merge(res, res + 10, cc, cc + 10, aux); for (int h = 0; h < min(a, 10) && aux[h] != 1000000; h++) sz++; printf( %d , sz); for (int h = 0; h < sz; h++) printf( %d , aux[h]); printf( n ); } } |
#include <bits/stdc++.h> using namespace std; int main() { int t; scanf( %d , &t); while (t--) { long long d; cin >> d; long long dis = d * d - 4 * d; if (dis < 0) { cout << N n ; continue; } else { double sq = sqrt(dis); double b = (d + sq) / 2.0; if (b == 1) { cout << N n ; continue; } else printf( Y %.9f %.9f n , abs(b), abs(b / (b - 1))); } } } |
#include <bits/stdc++.h> using namespace std; using namespace std::chrono; long double PI = 3.14159265358979323846; using ll = long long; const ll modo = 1000000000; const ll inf = LONG_LONG_MAX; const ll ms = (2e6) + 5; ll peil(ll a, ll b) { if (a % b) return a / b + 1; return a / b; } long double help(long double mid, long double k, long double val, ll pp, long double t) { ll tmp = mid; ll dd = tmp / pp; long double rem = mid - (dd * pp); long double ans = dd * val; long double hh = min(rem, k); ans += hh; rem -= hh; ans += (rem / 2); return ans; } int main() { ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr); cout << fixed << setprecision(10); ll k, d, t; cin >> k >> d >> t; long double kk = peil(k, d) * d; long double tt = k + ((kk - k) / 2); long double l = t; long double r = 2 * t; long double mid; long double ans = r; long double res; long double pp = 1 / (1e9); while ((r - l) > pp) { mid = (l + r) / 2; res = help(mid, k, tt, kk, t); if (res == t) { cout << mid; return 0; } if (res > t) { r = mid; ans = min(ans, mid); } else l = mid; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long i, n, r, S, Z, s1, s2, s3, s4, s5, s6, s7, s8, x, y, z, m, j, l, k, t; long long a[200045]; long long b[200045]; long long c[100001]; long long d[100001]; long long e[1000001]; pair<long long, long long> aa[100001]; double w, u, v, uu, vv; string q1; string q2; string q3; string q4; string s; string sq[3001]; string qs[3001]; map<long long, long long> g; map<long long, long long>::iterator it; cin >> n >> k; for (i = 0; i < n; i++) { cin >> x; a[i % k] = x + a[i % k]; } t = 1234567894525; for (i = 0; i < k; i++) { if (t > a[i]) { x = i; t = a[i]; } } cout << x + 1; } |
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > mas[2]; int a[(int)1e5 + 10], b[(int)1e5 + 10]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { int x, y; cin >> x >> y; int a = abs((x + y) % 2); mas[a].push_back({(x + y - a) / 2, (x - y - a) / 2}); } long long ans = 0; for (int i = 0; i < 2; i++) { sort(mas[i].begin(), mas[i].end()); a[mas[i].size()] = (int)-3e5; b[mas[i].size()] = (int)3e6; for (int j = (int)mas[i].size() - 1; j >= 0; j--) { a[j] = max(a[j + 1], mas[i][j].second); b[j] = min(b[j + 1], mas[i][j].second); } int c = (int)-3e5; int d = (int)3e5; for (int j = 0; j + 2 < (int)mas[i].size(); j++) { c = max(c, mas[i][j].second); d = min(d, mas[i][j].second); long long le = max(b[j + 1], d); long long ri = min(a[j + 1], c); if (ri > le) { ans += (ri - le) * (mas[i][j + 1].first - mas[i][j].first); } } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; bool compare(const pair<int, int>& i, const pair<int, int>& j) { return i.first < j.first; } int main() { string r, s; cin >> r >> s; vector<int> v; if (r.length() != s.length()) { cout << NO << n ; return 0; } for (int i = 0; i < s.length(); i++) { if (s[i] != r[i]) { v.push_back(i); } } if (v.size() != 2) cout << NO << n ; else { if (s[v[0]] == r[v[1]] && s[v[1]] == r[v[0]]) cout << YES ; else cout << NO ; } return 0; } |
#include <bits/stdc++.h> int main() { char n[100]; scanf( %s , n); int l = strlen(n); int t = 0; for (int i = 0; i < l; i++) { if (n[i] == 4 || n[i] == 7 ) { t += 1; } } if (t == 4 || t == 7) { printf( YES ); } else { printf( NO ); } } |
#include <bits/stdc++.h> using namespace std; int main() { map<int, int> m1, m2, m3; int n, m; cin >> n >> m; int a, b, c; for (int i = 0; i < m; i++) { cin >> a >> b >> c; if (m1[a] == 0 && m1[b] == 0 && m1[c] == 0) { m1[a] = 1; m1[b] = 2; m1[c] = 3; } else if (m1[a] != 0) { if (m1[a] == 1) { m1[b] = 2; m1[c] = 3; } else if (m1[a] == 2) { m1[b] = 1; m1[c] = 3; } else if (m1[a] == 3) { m1[b] = 1; m1[c] = 2; } } else if (m1[b] != 0) { if (m1[b] == 1) { m1[a] = 2; m1[c] = 3; } else if (m1[b] == 2) { m1[a] = 1; m1[c] = 3; } else if (m1[b] == 3) { m1[a] = 1; m1[c] = 2; } } else if (m1[c] != 0) { if (m1[c] == 1) { m1[a] = 2; m1[b] = 3; } else if (m1[c] == 2) { m1[a] = 1; m1[b] = 3; } else if (m1[c] == 3) { m1[a] = 1; m1[b] = 2; } } } for (int i = 1; i <= n; i++) { cout << m1[i] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, x = 0; cin >> n; char ch[n]; for (int i = 0; i < n; i++) { cin >> ch[i]; } cout << n + 1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int const sqN = 320; int add(int a, int b); int sub(int a, int b); int arr[100005]; struct query { int index; int l; int r; int ans; }; bool comp(query &a, query &b) { if (a.l / sqN != b.l / sqN) { return a.l / sqN < b.l / sqN; } return a.r < b.r; } bool comp_by_index(query &a, query &b) { return a.index < b.index; } int main() { int n, m, aux, l, r, cnt; cin >> n >> m; vector<int> F; F.push_back(0); for (int i = 0; i < n; i++) { cin >> aux; if (aux > 100000) aux = 0; F.push_back(aux); } vector<query> Q; for (int i = 0; i < m; i++) { cin >> l >> r; query inp; inp.index = i; inp.l = l; inp.r = r; Q.push_back(inp); } sort(Q.begin(), Q.end(), comp); memset(arr, 0, sizeof(arr)); r = 1; l = 0; cnt = (F[1] == 1) ? 1 : 0; arr[F[1]] += 1; for (int i = 0; i < m; i++) { query curq = Q[i]; while (r < Q[i].r) { r++; cnt += sub(arr[F[r]], F[r]); arr[F[r]] += 1; cnt += add(arr[F[r]], F[r]); } while (l < Q[i].l - 1) { l++; cnt += sub(arr[F[l]], F[l]); arr[F[l]] -= 1; cnt += add(arr[F[l]], F[l]); } while (l >= Q[i].l) { cnt += sub(arr[F[l]], F[l]); arr[F[l]] += 1; cnt += add(arr[F[l]], F[l]); l--; } while (r > Q[i].r) { cnt += sub(arr[F[r]], F[r]); arr[F[r]] -= 1; cnt += add(arr[F[r]], F[r]); r--; } Q[i].ans = cnt; } sort(Q.begin(), Q.end(), comp_by_index); for (int i = 0; i < Q.size(); i++) cout << Q[i].ans << endl; } int add(int a, int b) { if (b > 0 and b == a) return 1; return 0; } int sub(int a, int b) { if (b > 0 and b == a) return -1; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, i, j, k, t; string s, m; int main() { cin >> s >> n; for (i = 0; i <= s.length(); i++) { if (s[i] != _ && isupper(s[i])) s[i] = tolower(s[i]); if (s[i] == o ) s[i] = 0 ; else if (s[i] == l || s[i] == i ) s[i] = 1 ; } for (t = 1; t <= n; t++) { cin >> m; for (j = 0; j <= m.length(); j++) { if (m[j] != _ && isupper(m[j])) m[j] = tolower(m[j]); if (m[j] == o ) m[j] = 0 ; else if (m[j] == i || m[j] == l ) m[j] = 1 ; } if (m == s) k = 1; } if (k == 1) cout << No ; else cout << Yes ; cin >> n; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { vector<stack<int> > vs; int maxi = -1, maximum = 0, nbVertices, n, type[100009], destination[100009], source[100009]; cin >> n; vs = vector<stack<int> >(n); for (int i = 0; i < n; ++i) { source[i] = 0; } for (int i = 0; i < n; ++i) { cin >> type[i]; } for (int i = 0; i < n; ++i) { cin >> destination[i]; destination[i] -= 1; if (destination[i] != -1) source[destination[i]]++; } for (int i = 0; i < n; ++i) { if (type[i]) { int j = i; nbVertices = 1; while (source[destination[j]] == 1 && destination[j] != -1) { ++nbVertices; vs[i].push(j + 1); j = destination[j]; } vs[i].push(j + 1); if (maximum < nbVertices) { maximum = nbVertices; maxi = i; } } } cout << maximum << endl; while (vs[maxi].size()) { int top = vs[maxi].top(); cout << top << ; vs[maxi].pop(); } cout << endl; return 0; } |
#include<bits/stdc++.h> using namespace std; typedef long long int lli; const lli N = 1000009, K = z - a + 1; string s, t; lli n, k, a[K], b[K]; void Solve() { for(int i = 0; i < K - 1; i++) { while(a[i] > b[i] && a[i] >= k) { a[i] -= k; a[i + 1] += k; } } for(int i = 0; i < K; i++) { if(a[i] != b[i]) { cout<< No <<endl; return ; } } cout<< Yes <<endl; } void Inp() { lli ntest; cin>>ntest; while(ntest--) { cin>>n>>k>>s>>t; for(int i = 0; i < K; i++) { a[i] = 0; b[i] = 0; } for(int i = 0; i < n; i++) { a[s[i] - a ]++; b[t[i] - a ]++; } Solve(); } } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); //freopen( inp.inp , r ,stdin); Inp(); } |
#include <bits/stdc++.h> const int N = (int)1e5 + 7; const int MOD = (int)1e9 + 7; const long long INF = (long long)1e18; using namespace std; bool solve(vector<int> &A, int n) { for (int i = 1; i < n; i++) { if (A[i] > A[i - 1]) { return true; } } for (int i = 1; i < n; i++) { if (A[i] == A[i - 1]) return true; } return false; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { int n; cin >> n; vector<int> A(n); for (int i = 0; i < n; i++) cin >> A[i]; cout << (solve(A, n) ? YES : NO ) << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s, val = ><+-.,[] ; cin >> s; long long int size = 0; for (int i = 0; i < s.size(); i++) { size = (size * 16 + val.find(s[i]) + 8) % 1000003; } cout << size; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 2010; int n, m, l, r, k, a[MAXN], b[MAXN]; int main() { ios::sync_with_stdio(0); cin >> n >> m; for (int i = 1; i <= n; ++i) { cin >> a[i]; if (a[i] <= m) { b[a[i]]++; } } r = n / m; l = 1; for (int i = 1; i <= n; ++i) { while (l <= m && b[l] >= r) { l++; } if (l > m) { break; } if (a[i] > m || b[a[i]] > r) { if (a[i] <= m) { b[a[i]]--; } a[i] = l; b[l]++; k++; } } cout << r << << k << n ; for (int i = 1; i <= n; ++i) { cout << a[i] << ; } } |
#include <bits/stdc++.h> using namespace std; void JaiMataDi() { int n; cin >> n; string a, b; cin >> a >> b; int cnt = 0; for (int i = 0; i < n; i++) { if ((a[i] == 0 ) and (b[i] == 1 )) cnt += 2; else if ((a[i] == 1 ) and (b[i] == 0 )) cnt += 2; else if ((a[i] == 0 ) and (b[i] == 0 )) { if (i + 1 < n) { if ((a[i + 1] == 1 ) and (b[i + 1] == 1 )) cnt += 2, i++; else cnt += 1; } else cnt += 1; } else if ((a[i] == 1 ) and (b[i] == 1 )) { if (i + 1 < n) { if ((a[i + 1] == 0 ) and (b[i + 1] == 0 )) cnt += 2, i++; } } } cout << cnt << n ; } int main() { int t; cin >> t; while (t--) JaiMataDi(); } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:500000000 ) using namespace std; int main() { int n, i, s; scanf( %d %d , &n, &s); vector<int> a(n); for (i = 0; i < n; i++) { scanf( %d , &a[i]); } sort(a.begin(), a.end()); long long res = 0; int pos = n / 2; if (a[pos] <= s) { for (i = pos; i < n; i++) res += max(0, s - a[i]); } else { for (i = 0; i <= pos; i++) res += max(0, a[i] - s); } cout << res << endl; } |
#include <bits/stdc++.h> using namespace std; void sc(char& c) { char temp[4]; scanf( %s , temp); c = temp[0]; } struct debugger { template <typename T> debugger& operator,(const T& v) { cerr << v << ; return *this; } } dbg; int testnum; int a, b; int lens[11]; void preprocess() { lens[1] = 3; for (int i = 2; i <= 10; i++) lens[i] = 4 * lens[i - 1] + 3; } pair<int, int> recurse(int a, int b) { if (a == 1) { if (b == 0) return make_pair(0, 0); if (b == 1) return make_pair(0, 1); if (b == 2) return make_pair(1, 1); if (b == 3) return make_pair(1, 0); } int z = lens[a - 1]; if (b <= z) { pair<int, int> ret = recurse(a - 1, b); return make_pair(ret.second, ret.first); } b -= z + 1; if (b <= z) { pair<int, int> ret = recurse(a - 1, b); return make_pair(ret.first, ret.second + (1 << (a - 1))); } b -= z + 1; if (b <= z) { pair<int, int> ret = recurse(a - 1, b); return make_pair(ret.first + (1 << (a - 1)), ret.second + (1 << (a - 1))); } b -= z + 1; if (b <= z) { pair<int, int> ret = recurse(a - 1, b); return make_pair((1 << a) - 1 - ret.second, (1 << (a - 1)) - 1 - ret.first); } } void solve() { pair<int, int> ret = recurse(a, b); printf( %d %d n , ret.first, ret.second); } bool input() { scanf( %d , &a); scanf( %d , &b); return true; } int main() { preprocess(); int T = 1; for (testnum = 1; testnum <= T; testnum++) { if (!input()) break; solve(); } } |
#include <bits/stdc++.h> using namespace std; const int N = 100010; const int mod = 1e9 + 7; const int M = 2010; pair<int, int> p[M]; int n, m, k, s, x, y, cnt; int fac[2 * N], inv[2 * N], K[30], f[M][30]; bool pd1, pd2; int Pow(int a, int b) { if (b == 0) return 1; int ret = Pow(a, b / 2); ret = 1LL * ret * ret % mod; if (b & 1) ret = 1LL * ret * a % mod; return ret; } int com(int n, int m) { if (m > n) return 0; return 1LL * fac[n] * inv[m] % mod * inv[n - m] % mod; } int cal(int i, int j) { if (p[i].first > p[j].first || p[i].second > p[j].second) return 0; return com(p[j].first - p[i].first + p[j].second - p[i].second, p[j].first - p[i].first); } int main() { fac[0] = inv[0] = 1; for (int i = 1; i < 2 * N; i++) fac[i] = 1LL * fac[i - 1] * i % mod; for (int i = 1; i < 2 * N; i++) inv[i] = Pow(fac[i], mod - 2); scanf( %d%d%d%d , &n, &m, &k, &s); for (int i = 0; i < k; i++) { scanf( %d%d , &x, &y); if (x == 1 && y == 1) pd1 = true; if (x == n && y == m) pd2 = true; p[i] = make_pair(x, y); } if (n == 1 && m == 1) { if (pd1) printf( %d n , (s + 1) / 2); else printf( %d n , s); return 0; } p[k] = make_pair(1, 1); p[k + 1] = make_pair(n, m); sort(p, p + k + 2); if (pd1) s = (s + 1) / 2; for (int tmp = s; tmp != 1; tmp = (tmp + 1) / 2) K[cnt++] = tmp; K[cnt++] = 1; int tot = 0; for (int i = 0; i < k + 2; i++) if (i == 0 || p[i] != p[i - 1]) p[tot++] = p[i]; f[0][0] = 1; for (int i = 1; i < tot - 1; i++) { int tmp = 0; for (int j = 1; j < cnt; j++) { f[i][j] = com(p[i].first - 1 + p[i].second - 1, p[i].first - 1); f[i][j] = (f[i][j] - tmp) % mod; for (int q = 0; q < i; q++) f[i][j] = (f[i][j] - 1LL * f[q][j] * cal(q, i) % mod) % mod; tmp = (tmp + f[i][j]) % mod; } } if (!pd2) { int tmp = 0; for (int j = 0; j < cnt; j++) { f[tot - 1][j] = com(p[tot - 1].first - 1 + p[tot - 1].second - 1, p[tot - 1].first - 1); f[tot - 1][j] = (f[tot - 1][j] - tmp) % mod; for (int q = 0; q < tot - 1; q++) f[tot - 1][j] = (f[tot - 1][j] - 1LL * f[q][j + 1] * cal(q, tot - 1) % mod) % mod; tmp = (tmp + f[tot - 1][j]) % mod; } } else { int tmp = 0; for (int j = 1; j < cnt - 1; j++) { f[tot - 1][j] = com(p[tot - 1].first - 1 + p[tot - 1].second - 1, p[tot - 1].first - 1); f[tot - 1][j] = (f[tot - 1][j] - tmp) % mod; for (int q = 0; q < tot - 1; q++) f[tot - 1][j] = (f[tot - 1][j] - 1LL * f[q][j] * cal(q, tot - 1) % mod) % mod; tmp = (tmp + f[tot - 1][j]) % mod; } f[tot - 1][cnt - 1] = (com(p[tot - 1].first - 1 + p[tot - 1].second - 1, p[tot - 1].first - 1) - tmp) % mod; } int ans = 0; for (int i = 0; i < cnt; i++) ans = (ans + 1LL * K[i] * f[tot - 1][i] % mod) % mod; ans = 1LL * ans * Pow(com(n - 1 + m - 1, n - 1), mod - 2) % mod; ans = (ans + mod) % mod; printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX_N = 2200, MAX_K = 2200, INDEX = 1; int n, k, a[MAX_N + INDEX], books[MAX_K + INDEX]; int ans = 0; bool isBook(int x) { for (int i = 1; i <= k; i++) { if (books[i] == x) { return true; } } return false; } int dist(int book, int x) { for (int i = 1; x + i <= n; i++) { if (a[x + i] == book) { return i; } } return n + 1; } int getBest(int x) { int best = 1; for (int i = 2; i <= k; i++) { if (dist(books[i], x) > dist(books[best], x)) { best = i; } } return best; } int main() { ios_base::sync_with_stdio(false); cin.tie(); cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> a[i]; } for (int i = 1; i <= n; i++) { if (!isBook((a[i]))) { books[getBest(i)] = a[i]; ans++; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { std::ios::sync_with_stdio(false); set<pair<string, int> > name, s; int n; cin >> n; string a; for (int i = 0; i < n; i++) { cin >> a; name.insert(make_pair(a, i + 1)); cin >> a; name.insert(make_pair(a, i + 1)); } int temp; bool flag = true; set<pair<string, int> >::iterator itr1 = name.begin(); for (int i = 0; i < n; i++) { cin >> temp; while ((*itr1).second != temp && itr1 != name.end()) itr1++; } if (itr1 != name.end()) cout << YES ; else cout << NO ; } |
#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; int arr[n * n + 1], cnt[1001] = {0}, a[n + 1][n + 1]; vector<int> q4, q2, q1; for (int i = 1; i <= n * n; i++) { cin >> arr[i]; cnt[arr[i]]++; } for (int i = 1; i <= n * n; i++) { int d = cnt[arr[i]]; for (int j = 1; j <= d / 4; j++) q4.push_back(arr[i]); d %= 4; for (int j = 1; j <= d / 2; j++) q2.push_back(arr[i]); d %= 2; if (d == 1) q1.push_back(arr[i]); cnt[arr[i]] = 0; } if (n % 2 == 0) { if (q2.size() || q1.size()) { cout << NO ; return; } cout << YES n ; for (int i = 1; i <= n / 2; i++) for (int j = 1; j <= n / 2; j++) { int d = q4.back(); q4.pop_back(); a[i][j] = d; a[i][n - j + 1] = d; a[n - i + 1][j] = d; a[n - i + 1][n - j + 1] = d; } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) cout << a[i][j] << ; cout << endl; } return; } if (q1.size() != 1 || q4.size() < (n / 2) * (n / 2)) { cout << NO ; return; } cout << YES n ; for (int i = 1; i <= n / 2; i++) for (int j = 1; j <= n / 2; j++) { int d = q4.back(); q4.pop_back(); a[i][j] = d; a[i][n - j + 1] = d; a[n - i + 1][j] = d; a[n - i + 1][n - j + 1] = d; } while (q4.size()) { int d = q4.back(); q2.push_back(d); q2.push_back(d); q4.pop_back(); } for (int i = 1; i <= n / 2; i++) { int d = q2.back(); q2.pop_back(); a[n / 2 + 1][i] = d; a[n / 2 + 1][n + 1 - i] = d; d = q2.back(); q2.pop_back(); a[i][n / 2 + 1] = d; a[n + 1 - i][n / 2 + 1] = d; } a[n / 2 + 1][n / 2 + 1] = q1[0]; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) cout << a[i][j] << ; cout << endl; } return; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); solve(); } |
#include <bits/stdc++.h> using namespace std; bool compare(string &s1, string &s2) { return s1.size() < s2.size(); } bool sortmahstyle(const pair<int, int> &a, const pair<int, int> &b) { if (a.first < b.first) return true; return false; } long long int const maxm = 1e6; long long int const minm = -1e9; void solve() { int n; cin >> n; int next[n + 1][2]; for (int i = 1; i <= n; i++) cin >> next[i][0] >> next[i][1]; vector<int> ans; ans.push_back(3); while (ans.size() < n) { int cur = ans.back(); if (next[next[cur][0]][0] == next[cur][1] || next[next[cur][0]][1] == next[cur][1]) { ans.push_back(next[cur][0]); ans.push_back(next[cur][1]); } else { ans.push_back(next[cur][1]); ans.push_back(next[cur][0]); } } for (int i = 0; i < n; i++) cout << ans[i] << ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int t = 1; while (t-- > 0) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int a[111][111]; int main() { int N, K, i, k; cin >> N >> K; if (K > N * N) puts( -1 ); else { for (i = 0; i < N && K; i++) for (k = i; k < N && K; k++) { if (K == 1) { if (i == k) a[i][k] = 1; else a[i + 1][i + 1] = 1; K = 0; } else { a[i][k] = a[k][i] = 1; if (i == k) K--; else K -= 2; } } for (i = 0; i < N; i++) for (k = 0; k < N; k++) if (k == N - 1) cout << a[i][k] << endl; else cout << a[i][k] << ; } } |
#include <bits/stdc++.h> using namespace std; signed main() { std ::ios_base ::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long n; cin >> n; string s; cin >> s; long long a[2] = {0}; for (long long i = 0; i < n; i++) a[s[i] - 48]++; if (a[0] == a[1]) { cout << 2 n << s[0] << ; for (long long i = 1; i < n; i++) cout << s[i]; } else { cout << 1 n << s; } } |
#include <bits/stdc++.h> using namespace std; int const INF = 100 + (int)1e9; long long const INFL = 100 + (long long)1e18; long double const PI = 3.141592653589793238462643L; mt19937 tw(960172); bool is_prime(long long x) { for (long long y = 2; y * y <= x; ++y) if (x % y == 0) return 0; return x > 1; } long long rnd(long long x, long long y) { static uniform_int_distribution<long long> d; return d(tw) % (y - x + 1) + x; } long long sqr(int a) { return (long long)a * a; } template <class T> T sqr(T const& a) { return a * a; } long long gcd(long long a, long long b) { while (b > 0) { long long t = a % b; a = b; b = t; } return a; } void solve() { int n, k; cin >> n >> k; if (n <= 3 || k == 1 || k > 3 || (n == 4 && k == 2)) { cout << -1 << n ; return; } vector<pair<int, int>> edges; if (k == 2) { for (int i = 1; i < n; ++i) edges.emplace_back(i, i + 1); } else { edges.emplace_back(1, 2); edges.emplace_back(2, 3); edges.emplace_back(3, 4); for (int i = 5; i <= n; ++i) { edges.emplace_back(i, 1); edges.emplace_back(i, 3); if (i > 5) { edges.emplace_back(i, i - 1); if (i > 6) edges.emplace_back(i, 5); } } } cout << edges.size() << n ; for (auto e : edges) cout << e.first << << e.second << n ; } int main() { cout << setprecision(15) << fixed; int tcnt = 1; for (int test = 1; test <= tcnt; ++test) solve(); } |
#include <bits/stdc++.h> using namespace std; const int N = 1000005; char s[N], t[N], S[N]; int n, ch[N][26], fa[N]; int len[N], anc[N], dif[N], nd, la; int ans[N], _ans[N], from[N]; void extend(int n) { int c = S[n], p = la; for (; S[n - len[p] - 1] != c; p = fa[p]) ; if (!ch[p][c - a ]) { len[++nd] = len[p] + 2; int q = fa[p]; for (; S[n - len[q] - 1] != c; q = fa[q]) ; fa[nd] = ch[q][c - a ]; ch[p][c - a ] = nd; dif[nd] = len[nd] - len[fa[nd]]; anc[nd] = (dif[nd] == dif[fa[nd]] ? anc[fa[nd]] : fa[nd]); } la = ch[p][c - a ]; } int main() { scanf( %s%s , s + 1, t + 1); n = strlen(s + 1); for (int i = (int)(1); i <= (int)(n); i++) S[i * 2 - 1] = s[i], S[i * 2] = t[i]; fa[0] = nd = 1; len[1] = -1; n *= 2; for (int i = (int)(1); i <= (int)(n); i++) ans[i] = 1 << 30; _ans[0] = 1; for (int i = (int)(1); i <= (int)(n); i++) { extend(i); for (int p = la; p; p = anc[p]) { _ans[p] = i - (len[anc[p]] + dif[p]); if (dif[fa[p]] == dif[p]) if (ans[_ans[p]] > ans[_ans[fa[p]]]) _ans[p] = _ans[fa[p]]; if (!(i & 1) && ans[i] > ans[_ans[p]] + 1) ans[i] = ans[_ans[p]] + 1, from[i] = _ans[p]; } if (!(i & 1) && S[i - 1] == S[i] && ans[i] > ans[i - 2]) ans[i] = ans[i - 2], from[i] = i - 2; } if (ans[n] > 1e9) return puts( -1 ), 0; printf( %d n , ans[n]); for (int i = n; i; i = from[i]) if (i - from[i] > 2) printf( %d %d n , from[i] / 2 + 1, i / 2); } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, i, j, n, m, po1, po2, w1, w2, z1, z2, lr, pr, li, pi, tw, ti; cin >> n; if ((n / 2) % 2 == 1) { cout << ! -1 ; return 0; } po1 = 1; po2 = n / 2 + 1; cout << ? << po1 << endl; cin >> w1; cout << ? << po2 << endl; cin >> w2; lr = w1 - w2; pr = -lr; li = 1; pi = n / 2 + 1; if (pr == 0) { cout << ! << li; return 0; } for (i = 0; i < 29; i++) { ti = (pi + li) / 2; cout << ? << ti << endl; cin >> z1; cout << ? << ti + n / 2 << endl; cin >> z2; tw = z1 - z2; if (tw == 0) { cout << ! << ti; return 0; } if (tw < 0) { if (lr < 0) { lr = tw; li = ti; } else { pr = tw; pi = ti; } } else { if (lr > 0) { lr = tw; li = ti; } else { pr = tw; pi = ti; } } } } |
#include <bits/stdc++.h> const long long oo = 0x7f7f7f7f7f7f7f7f; using namespace std; const long long maxn = 1e6 + 999; long long n, m, k, visa[maxn], visb[maxn], b[maxn], tota, totb, totc, totd; struct goods { long long val, id; friend bool operator<(goods x, goods y) { return x.val < y.val; } } a[maxn], A[maxn], B[maxn], C[maxn]; long long tot, cnt[maxn << 2], ls[maxn << 2], rs[maxn << 2], root; long long sumv[maxn << 2]; void insert(long long pos, long long val, long long l, long long r, long long &rt) { if (val == 0 || pos == 0) return; if (!rt) rt = ++tot; if (val > 0) sumv[rt] += val, cnt[rt]++; else sumv[rt] += val, cnt[rt]--; if (l == r) { return; } long long mid = l + r >> 1; if (pos <= mid) insert(pos, val, l, mid, ls[rt]); else insert(pos, val, mid + 1, r, rs[rt]); } long long query(long long k, long long l, long long r, long long rt) { if (!k) return 0; if (l == r) { return min(k, cnt[rt]) * b[l]; } long long cntt = cnt[ls[rt]]; long long mid = l + r >> 1; if (k <= cntt) return query(k, l, mid, ls[rt]); else return sumv[ls[rt]] + query(k - cntt, mid + 1, r, rs[rt]); } signed main() { scanf( %lld%lld%lld , &n, &m, &k); for (long long i = 1; i <= n; i++) scanf( %lld , &a[i].val), b[i] = a[i].val, a[i].id = i; sort(b + 1, b + 1 + n); for (long long i = 1; i <= n; i++) a[i].val = lower_bound(b + 1, b + 1 + n, a[i].val) - b; long long x; scanf( %lld , &x); for (long long i = 1; i <= x; i++) { long long p; scanf( %lld , &p); visa[p] = 1; } scanf( %d , &x); for (long long i = 1; i <= x; i++) { long long p; scanf( %d , &p); visb[p] = 1; } for (long long i = 1; i <= n; i++) { if (visa[i] && visb[i]) A[++tota] = a[i]; else if (visa[i] && !visb[i]) B[++totb] = a[i]; else if (visb[i] && !visa[i]) C[++totc] = a[i]; insert(a[i].val, b[a[i].val], 1, n, root), totd++; } long long ans = oo, tmp = 0; long long now1 = min(k, min(totb, totc)); sort(A + 1, A + 1 + tota); sort(B + 1, B + 1 + totb); sort(C + 1, C + 1 + totc); for (long long i = 1; i <= now1; i++) tmp += b[B[i].val] + b[C[i].val], insert(C[i].val, -b[C[i].val], 1, n, root), insert(B[i].val, -b[B[i].val], 1, n, root), totd -= 2; long long ls = 0; for (long long r = 0; r <= tota; r++) { if (r + now1 == k && m - (r + now1 * 2) >= 0 && m - (r + now1 * 2) <= totd) { ans = min(ans, tmp + query(m - (r + now1 * 2), 1, n, root)); } tmp += b[A[r + 1].val]; insert(A[r + 1].val, -b[A[r + 1].val], 1, n, root), totd--; if (r + 1 + now1 > k && now1 > 0) { tmp -= b[B[now1].val] + b[C[now1].val], insert(C[now1].val, b[C[now1].val], 1, n, root), insert(B[now1].val, b[B[now1].val], 1, n, root), totd += 2; now1--; } } if (ans == oo) ans = -1; cout << ans; } |
#include <bits/stdc++.h> using namespace std; int b1[] = {0, 0, 1, -1}; int b2[] = {1, -1, 0, 0}; int d1[] = {-1, -1, -1, 0, 0, 1, 1, 1}; int d2[] = {-1, 0, 1, -1, 1, -1, 0, 1}; string st; const int mxn = 1e6; struct tp { int tt, cl, op; } tree[4 * mxn]; void build_tree(int s, int e, int index) { tp obj; obj.tt = obj.cl = obj.op = 0; if (s == e) { obj.cl = (st[s] == ) ); obj.op = (st[s] == ( ); tree[index] = obj; return; } int mid = (s + e) / 2; build_tree(s, mid, 2 * index); build_tree(mid + 1, e, 2 * index + 1); int min_blnc = min(tree[2 * index].op, tree[2 * index + 1].cl); obj.tt = tree[2 * index].tt + tree[2 * index + 1].tt + 2 * min_blnc; obj.cl = tree[2 * index].cl + tree[2 * index + 1].cl - min_blnc; obj.op = tree[2 * index].op + tree[2 * index + 1].op - min_blnc; tree[index] = obj; return; } tp query(int second, int se, int qs, int qe, int index) { tp obj; obj.tt = obj.cl = obj.op = 0; if (second >= qs and se <= qe) { return tree[index]; } if (qe < second || qs > se) return obj; int mid = (second + se) / 2; tp tp1 = query(second, mid, qs, qe, 2 * index); tp tp2 = query(mid + 1, se, qs, qe, 2 * index + 1); int min_blnc = min(tp1.op, tp2.cl); obj.tt = tp1.tt + tp2.tt + 2 * min_blnc; obj.cl = tp1.cl + tp2.cl - min_blnc; obj.op = tp1.op + tp2.op - min_blnc; return obj; } void solve() { cin >> st; int n = st.length(); build_tree(0, n - 1, 1); int q; cin >> q; while (q--) { int x, y; cin >> x >> y; x--, y--; tp res = query(0, n - 1, x, y, 1); cout << res.tt << endl; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long double pi = acos(-1); const long long inf = 1e18, M = 1e9 + 7; const long long int N = 1; bool left_turn(pair<long long int, long long int> a, pair<long long int, long long int> b, pair<long long int, long long int> c) { if (a.first == b.first) { if (a.second < b.second) return c.first < b.first; else return c.first > b.first; } else if (a.second == b.second) { if (a.first < b.first) return c.second > b.second; else return c.second < b.second; } } void solve() { long long int n; cin >> n; vector<pair<long long int, long long int> > v(n + 1); for (long long int i = 0; i < n + 1; ++i) cin >> v[i].first >> v[i].second; long long int ans = 0; for (long long int i = 1; i < n; ++i) { if (left_turn(v[i - 1], v[i], v[i + 1])) ++ans; } cout << ans; } int32_t main() { long long int t = 1; for (long long int z = 1; z <= t; ++z) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long min(long long x, long long y) { return x < y ? x : y; } inline long long max(long long x, long long y) { return x > y ? x : y; } const int Maxn = 1e4 + 5; int n, k, m, ans = -1; int a[Maxn], b[105], c[30], dis[30][Maxn], f[2000005], pw[30]; bool inq[Maxn]; void SPFA(register int x, register int p) { dis[p][x] = 0; queue<int> q; q.push(x); while (!q.empty()) { x = q.front(); q.pop(); inq[x] = false; for (register int i = 1, nx; i <= m; i++) { nx = x + b[i]; if (nx <= n + 1) if (dis[p][x] + 1 < dis[p][nx]) { dis[p][nx] = dis[p][x] + 1; if (!inq[nx]) { q.push(nx); inq[nx] = true; } } nx = x - b[i]; if (nx > 0) if (dis[p][x] + 1 < dis[p][nx]) { dis[p][nx] = dis[p][x] + 1; if (!inq[nx]) { q.push(nx); inq[nx] = true; } } } } } int main() { pw[0] = 1; for (int i = 1; i <= 25; i++) pw[i] = pw[i - 1] << 1; memset(dis, 0x3f, sizeof(dis)); int pos, siz = 0; cin >> n >> k >> m; for (int i = 1; i <= k; i++) { scanf( %d , &pos); a[pos] = 1; } for (int i = 1; i <= m; i++) scanf( %d , &b[i]); for (int i = 0; i <= n; i++) if (a[i + 1] != a[i]) { c[++siz] = i + 1; SPFA(i + 1, siz); } n = siz; memset(f, 0x3f, sizeof(f)); f[0] = 0; int nx; for (int i = 0; i < pw[n] - 3; i++) for (int j = 1; j < n; j++) for (int k = j + 1; k <= n; k++) { if ((i & pw[j - 1]) || (i & pw[k - 1])) continue; nx = i | pw[j - 1] | pw[k - 1]; f[nx] = min(f[nx], f[i] + dis[j][c[k]]); } if (f[pw[n] - 1] == 0x3f3f3f3f) f[pw[n] - 1] = -1; cout << f[pw[n] - 1] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long cnt, prime[100], pcnt; long long flg; long long gcd(long long a, long long b) { if (!b) return a; return gcd(b, a % b); } long long search(long long a, long long b) { if (!b) return 0; long long d = gcd(a, b); a /= d; b /= d; long long minn = 1ll << 60; for (int i = 1; i <= cnt; i++) if (a % prime[i] == 0) minn = min(minn, b % prime[i]); if (minn == 1ll << 60) return b; return minn + search(a, b - minn); } int main() { long long a, b; scanf( %I64d%I64d , &a, &b); long long A = a; for (long long i = 2; i * i <= A; i++) { if (a % i == 0) { while (a % i == 0) { a /= i; } prime[++cnt] = i; } } if (a > prime[cnt]) prime[++cnt] = a; if (a == A) { printf( %I64d , A > b ? b : b % A + (b - b % A) / A); return 0; } long long ans = search(A, b); printf( %I64d , ans); } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; const int INF = 1e9; int a[N], maxv[N << 2], addv[N << 2]; int dmax[N][21]; int n, ans; void maintain(int rt, int l, int r) { maxv[rt] = 0; if (l < r) maxv[rt] = max(maxv[rt << 1], maxv[rt << 1 | 1]); maxv[rt] += addv[rt]; } void update(int ql, int qr, int v, int rt, int l, int r) { if (ql <= l && qr >= r) addv[rt] += v; else { int mid = (l + r) >> 1; if (ql <= mid) update(ql, qr, v, rt << 1, l, mid); if (qr > mid) update(ql, qr, v, rt << 1 | 1, mid + 1, r); } maintain(rt, l, r); } void querymax(int ql, int qr, int rt, int l, int r, int add) { if (ql <= l && qr >= r) ans = max(ans, maxv[rt] + add); else { int mid = (l + r) >> 1; if (ql <= mid) querymax(ql, qr, rt << 1, l, mid, add + addv[rt]); if (qr > mid) querymax(ql, qr, rt << 1 | 1, mid + 1, r, add + addv[rt]); } } void build() { for (int i = 1; i <= n; i++) dmax[i][0] = a[i]; for (int j = 1; (1 << j) <= n; j++) { for (int i = 1; i + (1 << j) - 1 <= n; i++) { dmax[i][j] = max(dmax[i][j - 1], dmax[i + (1 << (j - 1))][j - 1]); } } } int query(int l, int r) { int k = 0; while ((1 << (k + 1)) <= r - l + 1) k++; return max(dmax[l][k], dmax[r - (1 << k) + 1][k]); } int main() { int k, num, l, r, mid; scanf( %d %d , &n, &k); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); build(); memset(maxv, 0, sizeof(maxv)); for (int i = 1; i <= n; i++) { l = 0; r = i; while (r - l > 1) { mid = (l + r) >> 1; if (query(mid, r - 1) >= a[i]) l = mid; else r = mid; } update(r, i, 1, 1, 1, n); if (i >= k) { ans = 0; querymax(i - k + 1, i, 1, 1, n, 0); printf( %d , ans); } } printf( n ); return 0; } |
#include <bits/stdc++.h> using std::max; using std::min; const int inf = 0x3f3f3f3f, Inf = 0x7fffffff; const long long INF = 0x3f3f3f3f3f3f3f3f; __inline__ __attribute__((always_inline)) unsigned int rnd() { static unsigned int seed = 416; return seed += 0x71dad4bfu, seed ^= seed >> 5, seed += 0xc6f74d88u, seed ^= seed << 17, seed += 0x25e6561u, seed ^= seed >> 13; } template <typename _Tp> _Tp gcd(const _Tp &a, const _Tp &b) { return (!b) ? a : gcd(b, a % b); } template <typename _Tp> __inline__ __attribute__((always_inline)) _Tp abs(const _Tp &a) { return a >= 0 ? a : -a; } template <typename _Tp> __inline__ __attribute__((always_inline)) void chmax(_Tp &a, const _Tp &b) { (a < b) && (a = b); } template <typename _Tp> __inline__ __attribute__((always_inline)) void chmin(_Tp &a, const _Tp &b) { (b < a) && (a = b); } template <typename _Tp> __inline__ __attribute__((always_inline)) void read(_Tp &x) { char ch(getchar()); bool f(false); while (!isdigit(ch)) f |= ch == 45, ch = getchar(); x = ch & 15, ch = getchar(); while (isdigit(ch)) x = (((x << 2) + x) << 1) + (ch & 15), ch = getchar(); f && (x = -x); } template <typename _Tp, typename... Args> __inline__ __attribute__((always_inline)) void read(_Tp &t, Args &...args) { read(t); read(args...); } template <typename _Tp, typename... Args> __inline__ __attribute__((always_inline)) _Tp min(const _Tp &a, const _Tp &b, const Args &...args) { return a < b ? min(a, args...) : min(b, args...); } template <typename _Tp, typename... Args> __inline__ __attribute__((always_inline)) _Tp max(const _Tp &a, const _Tp &b, const Args &...args) { return a < b ? max(b, args...) : max(a, args...); } __inline__ __attribute__((always_inline)) int read_str(char *s) { char ch(getchar()); while (ch == || ch == r || ch == n ) ch = getchar(); char *tar = s; *tar = ch, ch = getchar(); while (ch != && ch != r && ch != n && ch != EOF) *(++tar) = ch, ch = getchar(); return tar - s + 1; } const int N = 65; const int mod = 1000000007; template <typename _Tp1, typename _Tp2> __inline__ __attribute__((always_inline)) void add(_Tp1 &a, _Tp2 b) { (a += b) >= mod && (a -= mod); } template <typename _Tp1, typename _Tp2> __inline__ __attribute__((always_inline)) void sub(_Tp1 &a, _Tp2 b) { (a -= b) < 0 && (a += mod); } int n, a[N], fa[N]; int find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]); } int dp[1 << 15][N], sum[1 << 15]; std::pair<int, int> solve(int ___) { std::vector<int> nd; for (int i = 1; i <= n; ++i) if (find(i) == ___) nd.push_back(a[i]); std::vector<int> A, B; for (auto a : nd) { int cnt = 0; for (auto b : nd) if (a != b && !(a % b)) ++cnt; if (!cnt) A.push_back(a); else B.push_back(a); } if (((int)B.size()) <= 1) return std::make_pair(0, 1); memset(dp, 0, sizeof(dp)); memset(sum, 0, sizeof(sum)); for (auto &&it : B) { int qwq = 0; for (int i = 0; i < ((int)A.size()); ++i) if (!(it % A[i])) qwq |= 1 << i; it = qwq, ++sum[it]; ++dp[it][1]; } for (int i = 0; i < ((int)A.size()); ++i) for (int st = 0; st < 1 << ((int)A.size()); ++st) if ((st >> i) & 1) sum[st] += sum[st ^ (1 << i)]; for (int st = 0; st < 1 << ((int)A.size()); ++st) { for (int j = 1; j <= ((int)B.size()); ++j) { if (!dp[st][j]) continue; add(dp[st][j + 1], 1ll * dp[st][j] * (sum[st] - j) % mod); for (auto it : B) if ((it & st) && (st & it) != it) add(dp[st | it][j + 1], dp[st][j]); } } return std::make_pair(((int)B.size()) - 1, dp[(1 << ((int)A.size())) - 1][((int)B.size())]); } int C[N][N]; int main() { for (int i = 0; i < N; ++i) for (int j = C[i][0] = 1; j <= i; ++j) C[i][j] = C[i - 1][j - 1], add(C[i][j], C[i - 1][j]); read(n); for (int i = 1; i <= n; ++i) read(a[i]), fa[i] = i; std::sort(a + 1, a + n + 1); for (int i = 1; i <= n; ++i) for (int j = 1; j <= n; ++j) if (!(a[i] % a[j])) fa[find(i)] = find(j); long long ans = 1, res = 0; for (int i = 1; i <= n; ++i) { if (fa[i] == i) { std::pair<int, int> tmp = solve(i); res += tmp.first; ans = ans * C[res][tmp.first] % mod * tmp.second % mod; } } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e7 + 7; long long mn = (long long)(1e18 + 7), mx = -(long long)(1e18 + 7); long long n, m, k, s, q, t; long long a, b, c, d, e; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n >> a >> b >> c >> d; for (int i = 0; i <= N; i++) { if (i * c <= n) mx = max(mx, i * a + ((n - i * c) / d * b)); if (i * d <= n) mx = max(mx, i * b + ((n - i * d) / c * a)); } cout << mx; } |
#include <bits/stdc++.h> using namespace std; const long double PI = 3.14159265358979323846264338327950288419716939937510582097494459230; template <class T> int getbit(T s, int i) { return (s >> 1) & 1; } template <class T> T onbit(T s, int i) { return s | (T(1) << i); } template <class T> T offbit(T s, int i) { return s & (~(T(1) << i)); } template <class T> int cntbit(T s) { return __builtin_popcount(s); } long long N; long long modPow(long long a, long long b) { if (b == 0) return 1; if (b == 1) return a; long long tmp = modPow(a, b / 2); if (b % 2 == 0) return ((tmp * tmp) % 1000000007LL); return ((((tmp * tmp) % 1000000007LL) * a) % 1000000007LL); } void VarInput() { cin >> N; } void ProSolve() { long long ans = modPow(27, N) - modPow(7, N); while (ans < 0) ans += 1000000007LL; cout << ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); VarInput(); ProSolve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 300010; int h[MAXN], v[MAXN]; int main() { int n; scanf( %d , &n); for (int i = 0; i < (n); ++i) { scanf( %d , &h[i]); } v[0] = 1; v[n - 1] = 1; for (int i = (1); i < (n - 1); ++i) { v[i] = min(h[i], v[i - 1] + 1); } for (int i = n - 2; i >= 0; --i) { v[i] = min(v[i], min(h[i], v[i + 1] + 1)); } int ans = -1; for (int i = 0; i < (n); ++i) ans = max(ans, v[i]); printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> const int nmax = 500000; int ans[nmax + 5]; int main() { int n, i, j, x1, y1, x2, y2; scanf( %d , &n); for (i = 1; i <= n; i++) { scanf( %d%d%d%d , &x1, &y1, &x2, &y2); ans[i] = (((x2 % 2) + 2) % 2) * 2 + ((y2 % 2) + 2) % 2 + 1; } printf( YES n ); for (i = 1; i <= n; i++) printf( %d n , ans[i]); return 0; } |
#include <bits/stdc++.h> int main() { long long n; while (~scanf( %I64d , &n)) { long long m = sqrt(n); long long m1 = sqrt(m); long long i; long long sum; int flag = 0; for (i = m + 1; i >= m + 1 - 100; i--) { sum = 0; long long b = i; while (b) { sum += b % 10; b /= 10; } long long num = sum * i + i * i; if (num == n) { printf( %I64d n , i); flag = 1; break; } } if (flag == 0) { printf( -1 n ); } } } |
#include <bits/stdc++.h> using namespace std; int bit[200005]; void update(long long int x) { while (x < 200005) { bit[x] += 1; if (x == 0) break; x += x & (-x); } } long long int query(long long int x) { long long int ans = 0; while (x >= 0) { ans += bit[x]; if (x == 0) break; x -= x & (-x); } return ans; } int main() { long long int n, t; cin >> n >> t; vector<long long int> v(n); for (long long int i = 0; i < n; i++) { cin >> v[i]; if (i) v[i] += v[i - 1]; } vector<long long int> v2 = v; sort(v.begin(), v.end()); long long int ans = 0; for (long long int i = (n - 1); i >= 0; i--) { int pos = lower_bound(v.begin(), v.end(), v2[i] + t) - v.begin(); ans += query(pos - 1); update(lower_bound(v.begin(), v.end(), v2[i]) - v.begin()); } ans += query(lower_bound(v.begin(), v.end(), t) - v.begin() - 1); cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int get(int a) { int maxx = 0; for (int i = 0; i < 21; i++) if (a & (1 << i)) maxx = i; int ans = (1 << (maxx + 1)) - 1; return (ans ^ a); } int main() { int n; cin >> n; vector<int> a(n + 1); for (int i = n; i >= 0; i--) { if (a[i] == 0) { for (int j = 21; j >= 0; j--) { int tmp = get(i); if ((i ^ tmp) == i + tmp && a[tmp] == 0) { a[tmp] = i; a[i] = tmp; break; } } } } long long ans = 0; for (int i = 0; i <= n; i++) ans += (a[i] ^ i); cout << ans << endl; for (int i = 0; i <= n; i++) cout << a[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 0x3f3f3f3f; const int N = 4e5 + 10; const int M = 1e6 + 10; const long long mod = 1e9 + 7; const double PI = acos(-1); long long w[N]; int fa[N][21]; long long wi[N][21]; long long mx[N][21]; int Find(int x, int y) { for (int i = 20; i >= 0; --i) if (mx[x][i] < y) x = fa[x][i]; return x; } int dd[21]; int main() { dd[0] = 1; for (int i = 1; i <= 20; ++i) dd[i] = dd[i - 1] * 2; int cnt = 1, last = 0; w[0] = 1e16; for (int i = 0; i <= 20; ++i) fa[0][i] = 0, wi[0][i] = 1e16, mx[0][i] = 1e16; w[1] = 0, fa[1][0] = 0, wi[1][0] = 0; for (int i = 1; i <= 20; ++i) fa[1][i] = 0, wi[1][i] = 1e16, mx[1][i] = 1e16; int q, to, op; long long x, y; scanf( %d , &q); while (q--) { scanf( %d%I64d%I64d , &op, &x, &y); x ^= last, y ^= last; if (op == 1) { w[++cnt] = y; fa[cnt][0] = Find(x, y); mx[cnt][0] = wi[cnt][0] = w[cnt]; for (int i = 1; i <= 20; ++i) { to = fa[cnt][i - 1]; fa[cnt][i] = fa[to][i - 1]; mx[cnt][i] = max(mx[cnt][i - 1], mx[to][i - 1]); wi[cnt][i] = wi[cnt][i - 1] + wi[to][i - 1]; } } else { last = 0; for (int i = 20; i >= 0; --i) { if (wi[x][i] <= y) { last += dd[i]; y -= wi[x][i]; x = fa[x][i]; } } printf( %d n , last); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int prime = 999983; const int INF = 0x7FFFFFFF; const long long INFF = 0x7FFFFFFFFFFFFFFF; const double pi = acos(-1.0); const double inf = 1e18; const double eps = 1e-6; const long long mod = 1e9 + 7; long long qpow(long long a, long long b) { long long s = 1; while (b > 0) { if (b & 1) s = s * a % mod; a = a * a % mod; b >>= 1; } return s; } long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } int dr[2][4] = {1, -1, 0, 0, 0, 0, -1, 1}; const int maxm = 2e7, maxn = 3e5 + 10; int a[maxn]; int num[maxm][2]; int main(void) { int n; cin >> n; long long ans = 0; num[0][0] = 1; for (int i = 1; i < n + 1; i++) { scanf( %d , &a[i]); a[i] ^= a[i - 1]; ans += num[a[i]][i % 2]; num[a[i]][i % 2]++; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int k, i; int main() { cin >> k; for (i = 1; i <= k; i <<= 1) { } cout << 2 3 << endl; cout << i * 2 - 1 << << k << 0 << endl; cout << i << << i * 2 - 1 << << k << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long int ma = -1, mi = 1000000000000000; inline long long int gcd(long long int a, long long int b) { return b ? gcd(b, a % b) : a; } inline long long int lcm(long long int a, long long int b, long long int MOD) { return a / gcd(a, b) * b % MOD; } long long int power(long long int x, unsigned int y) { if (y == 0) return 1; else if (y % 2 == 0) return power(x, y / 2) * power(x, y / 2); else return x * power(x, y / 2) * power(x, y / 2); } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); long long int i, j, k, a[100000] = {0}, n, m, b[100009] = {0}, c = 0, d = 0, e[30] = {0}, x = 0; cin >> n >> m; for (i = 0; i < n; i++) { cin >> a[i]; } for (i = 0; i < n - 1; i++) { if (a[i] + a[i + 1] < m) { d = m - a[i] - a[i + 1]; a[i + 1] += d; c += d; } } cout << c << endl; for (i = 0; i < n; i++) cout << a[i] << ; } |
#include <bits/stdc++.h> using namespace std; int AA[100010]; int BB[100010]; long long dp[100010]; int N; vector<long long> M; vector<long long> B; bool bad(long long l1, long long l2, long long l3) { long double XX1 = 1.00000 * (M[l1] - M[l2]) / (M[l1] - M[l3]); long double XX2 = 1.00000 * (B[l2] - B[l1]) / (B[l3] - B[l1]); return XX1 < XX2; } void add(long long m, long long b) { M.push_back(m); B.push_back(b); while (M.size() >= 3 && bad(M.size() - 3, M.size() - 2, M.size() - 1)) { M.erase(M.end() - 2); B.erase(B.end() - 2); } } int pointer; long long query(long long x) { if (pointer >= M.size()) pointer = M.size() - 1; while (pointer < M.size() - 1 && M[pointer + 1] * x + B[pointer + 1] > M[pointer] * x + B[pointer]) pointer++; return M[pointer] * x + B[pointer]; } int main() { ios_base::sync_with_stdio(0); cin >> N; for (int i = 1; i <= N; i++) { cin >> AA[i]; } for (int i = 1; i <= N; i++) { cin >> BB[i]; } dp[1] = 0LL; add(-BB[1], -dp[1]); for (int i = 2; i <= N; i++) { dp[i] = -1LL * query(AA[i]); add(-BB[i], -dp[i]); } cout << dp[N] << endl; return 0; } |
#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; int n, m; int a[200000]; char tmp[200000]; int b[200000]; int bi; int c[200000]; int ci; int d[200000]; vector<int> dab; void calc() { int i, j; int cnt = 0; d[0] = -((1 << 30) - 1); ci = 0; for (i = 0; i < bi; i++) { if (b[i] == ((1 << 30) - 1)) cnt++; else { c[++ci] = cnt; d[ci] = b[i]; cnt = 0; } } c[++ci] = cnt; d[ci++] = ((1 << 30) - 1); for (i = 0; i < ci - 1; i++) { if (d[i + 1] - d[i] - 1 < c[i + 1]) { printf( Incorrect sequence ); exit(0); } } dab.clear(); for (i = 0; i < ci - 1; i++) { if (c[i + 1] == 0) continue; if (d[i] <= 0 && d[i + 1] <= 0) { for (j = d[i + 1] - c[i + 1]; j <= d[i + 1] - 1; j++) dab.push_back(j); } else if (d[i] >= 0 && d[i + 1] >= 0) { for (j = d[i] + 1; j <= d[i] + c[i + 1]; j++) dab.push_back(j); } else { if (min(abs(d[i + 1] - 1), abs(d[i] + 1)) * 2 + 1 >= c[i + 1]) { for (j = -(c[i + 1] - 1) / 2; j <= (c[i + 1] / 2); j++) dab.push_back(j); } else { int u = min(abs(d[i + 1] - 1), abs(d[i] + 1)); if (abs(d[i + 1] - 1) > abs(d[i] + 1)) { for (j = -u; j <= u; j++) dab.push_back(j); for (j = u + 1; j <= u + c[i + 1] - min(abs(d[i + 1] - 1), abs(d[i] + 1)) * 2 - 1; j++) dab.push_back(j); } else { for (j = -u - (c[i + 1] - min(abs(d[i + 1] - 1), abs(d[i] + 1)) * 2 - 1); j <= -u - 1; j++) dab.push_back(j); for (j = -u; j <= u; j++) dab.push_back(j); } } } } } int main() { int i, j, k; cin >> n >> m; for (i = 0; i < n; i++) { scanf( %s , tmp); if (tmp[0] == ? ) a[i] = ((1 << 30) - 1); else a[i] = atoi(tmp); } for (i = 0; i < m; i++) { bi = 0; for (j = i; j < n; j += m) { b[bi++] = a[j]; } calc(); int u = 0; for (j = i; j < n; j += m) { if (a[j] == ((1 << 30) - 1)) a[j] = dab[u++]; } } for (i = 0; i < n; i++) printf( %d , a[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; const int delta = (int)1e9 + 7; int n, a[(int)3e5 + 20], b[(int)3e5 + 20], x, y, z, ans, h[(int)3e5 + 20]; vector<int> G[(int)3e5 + 20]; bool cmp(int u, int v) { if (a[u] == a[v]) return u < v; return a[u] > a[v]; } bool ac1() { for (int i = 0; i < G[b[1]].size(); ++i) h[G[b[1]][i]] = 1; int w = 2; while (a[b[w]] == a[b[1]] - 1 && w <= n) { if (!h[b[w]]) return 1; ++w; } return 0; } bool ac2() { for (int i = 1; i <= n; ++i) if (a[i] == z) ++y; for (int i = 1; i <= n; ++i) { if (a[i] == z) x = 1; else x = 0; for (int j = 0; j < G[i].size(); ++j) if (a[G[i][j]] == z) ++x; if (x == y) return 0; } return 1; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n; for (int i = 1; i <= n; ++i) cin >> a[i], b[i] = i; for (int i = 1; i < n; ++i) { cin >> x >> y; G[x].push_back(y); G[y].push_back(x); } sort(b + 1, b + n + 1, cmp); z = ans = a[b[1]]; if (n == 1 || a[b[1]] - a[b[2]] > 1) ; else if (a[b[1]] == a[b[2]] + 1) { if (ac1()) ++ans; } else { y = 0; ans += ac2() + 1; } cout << ans; return cout << endl, 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> std::istream& operator>>(std::istream& i, pair<T, U>& p) { i >> p.first >> p.second; return i; } template <typename T> std::istream& operator>>(std::istream& i, vector<T>& t) { for (auto& v : t) { i >> v; } return i; } template <typename T, typename U> std::ostream& operator<<(std::ostream& o, const pair<T, U>& p) { o << p.first << << p.second; return o; } template <typename T> std::ostream& operator<<(std::ostream& o, const vector<T>& t) { if (t.empty()) o << n ; for (size_t i = 0; i < t.size(); ++i) { o << t[i] << n [i == t.size() - 1]; } return o; } template <typename T> using minheap = priority_queue<T, vector<T>, greater<T>>; template <typename T> using maxheap = priority_queue<T, vector<T>, less<T>>; template <typename T> bool in(T a, T b, T c) { return a <= b && b < c; } unsigned int logceil(long long first) { return first ? 8 * sizeof(long long) - __builtin_clzll(first) : 0; } namespace std { template <typename T, typename U> struct hash<pair<T, U>> { hash<T> t; hash<U> u; size_t operator()(const pair<T, U>& p) const { return t(p.first) ^ (u(p.second) << 7); } }; } // namespace std template <typename T, typename F> T bsh(T l, T h, const F& f) { T r = -1, m; while (l <= h) { m = (l + h) / 2; if (f(m)) { l = m + 1; r = m; } else { h = m - 1; } } return r; } template <typename F> double bshd(double l, double h, const F& f, double p = 1e-9) { unsigned int r = 3 + (unsigned int)log2((h - l) / p); while (r--) { double m = (l + h) / 2; if (f(m)) { l = m; } else { h = m; } } return (l + h) / 2; } template <typename T, typename F> T bsl(T l, T h, const F& f) { T r = -1, m; while (l <= h) { m = (l + h) / 2; if (f(m)) { h = m - 1; r = m; } else { l = m + 1; } } return r; } template <typename F> double bsld(double l, double h, const F& f, double p = 1e-9) { unsigned int r = 3 + (unsigned int)log2((h - l) / p); while (r--) { double m = (l + h) / 2; if (f(m)) { h = m; } else { l = m; } } return (l + h) / 2; } template <typename T> T gcd(T a, T b) { if (a < b) swap(a, b); return b ? gcd(b, a % b) : a; } template <typename T> class vector2 : public vector<vector<T>> { public: vector2() {} vector2(size_t a, size_t b, T t = T()) : vector<vector<T>>(a, vector<T>(b, t)) {} }; template <typename T> class vector3 : public vector<vector2<T>> { public: vector3() {} vector3(size_t a, size_t b, size_t c, T t = T()) : vector<vector2<T>>(a, vector2<T>(b, c, t)) {} }; template <typename T> class vector4 : public vector<vector3<T>> { public: vector4() {} vector4(size_t a, size_t b, size_t c, size_t d, T t = T()) : vector<vector3<T>>(a, vector3<T>(b, c, d, t)) {} }; template <typename T> class vector5 : public vector<vector4<T>> { public: vector5() {} vector5(size_t a, size_t b, size_t c, size_t d, size_t e, T t = T()) : vector<vector4<T>>(a, vector4<T>(b, c, d, e, t)) {} }; class DPowerTree { public: int N; vector<vector<int>> E; vector<long long> C; vector<int> Omit; vector<bool> Take; vector<pair<long long, long long>> Ans; pair<long long, long long> solve(int u, int p) { if (E[u].size() == 1 && u != 0) { return Ans[u] = {0, C[u]}; }; long long a = 0, b = 0; for (int v : E[u]) { if (v != p) { auto s = solve(v, u); a = min(a + s.second, b + s.first); b += s.second; } } return Ans[u] = {a, min(b, a + C[u])}; } void collect(int u, int p, bool allPaths, vector<int>& Ret) { long long diff = Ans[u].second - Ans[u].first; if (allPaths && C[u] <= diff) Ret.push_back(u + 1); int worst = -1; int cnt = 0; for (int v : E[u]) { if (v != p) { int myDiff = Ans[v].second - Ans[v].first; if (myDiff > worst) { worst = myDiff; cnt = 0; } cnt += myDiff == worst; } } for (int v : E[u]) { if (v != p) { int myDiff = Ans[v].second - Ans[v].first; collect(v, u, myDiff < worst || cnt > 1 || (worst <= C[u] && allPaths), Ret); } } } void solve(istream& cin, ostream& cout) { cin >> N; C.resize(N); cin >> C; E.resize(N); Ans.resize(N); for (int i = 0; i < N - 1; ++i) { int u, v; cin >> u >> v; --u; --v; E[u].push_back(v); E[v].push_back(u); } auto s = solve(0, -1); vector<int> X; collect(0, -1, true, X); sort(X.begin(), X.end()); cout << s.second << << X.size() << endl; cout << X; } }; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); DPowerTree solver; std::istream& in(std::cin); std::ostream& out(std::cout); solver.solve(in, out); return 0; } |
#include <bits/stdc++.h> using namespace std; long long int f[100010], n, a[100010]; const long long int inf = 2000000000000; int main() { long long int i, j, k; scanf( %I64d , &n); for (i = 1; i <= n; i++) { scanf( %I64d , &a[i]); } f[0] = 0; sort(a + 1, a + 1 + n); for (i = 1; i <= n; i++) { f[i] = f[i - 1] + 20; long long int t; t = lower_bound(a + 1, a + 1 + n, a[i] - 89) - a - 1; f[i] = min(f[i], f[t] + 50); t = lower_bound(a + 1, a + 1 + n, a[i] - 1439) - a - 1; f[i] = min(f[i], f[t] + 120); printf( %I64d n , f[i] - f[i - 1]); } return 0; } |
#include <bits/stdc++.h> long long read() { long long x = 0, f = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { x = x * 10 + c - 0 ; c = getchar(); } return x * f; } using namespace std; const long long maxn = 1e5 + 7; const double eps = 1e-10; const long long mod = 1e9 + 7; long long n; long long totA = 0, totB = 0; long long casA[maxn * 2], casB[maxn * 2]; long long tot = 0; struct Node { long long set, score; }; Node node[maxn]; bool cmp(Node a, Node b) { if (a.set < b.set) return 1; if (a.set == b.set && a.score < b.score) return 1; return 0; } int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; cin >> n; for (long long i = 1; i < 2 * maxn; i++) casA[i] = casB[i] = 9223372036854775807; bool flagA = 0, flagB = 0; for (long long i = 1; i <= n; i++) { long long x; cin >> x; if (x == 1) casA[++totA] = i; else casB[++totB] = i; if (i == n) { if (x == 1) flagA = 1; else flagB = 1; } } for (long long i = n; i >= 1; i--) { long long winA = 0, winB = 0, tarA = 0, tarB = 0; long long now = 1; bool flag = 1; while (now <= n) { if (casA[tarA + i] == 9223372036854775807 && casB[tarB + i] == 9223372036854775807) { flag = 0; break; } if (casA[tarA + i] < casB[tarB + i]) { winA++; tarA += i; tarB = casA[tarA] - tarA; now = casA[tarA] + 1; } else { winB++; tarB += i; tarA = casB[tarB] - tarB; now = casB[tarB] + 1; } } if (winA == winB) flag = 0; if (winA > winB && flagB) flag = 0; if (winA < winB && flagA) flag = 0; if (flag) { node[++tot].set = max(winA, winB); node[tot].score = i; } } sort(node, node + tot, cmp); cout << tot << n ; if (tot) { for (long long i = 1; i <= tot; i++) cout << node[i].set << << node[i].score << n ; } } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 3E5 + 5; int n, m, sz, val, x, y, color[MAXN]; vector<int> v[MAXN], G[MAXN]; template <class T> void read(T& x, T f = 1, char ch = getchar()) { x = 0; while (ch < 0 || ch > 9 ) f = (ch == - ? -1 : 1), ch = getchar(); while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 48, ch = getchar(); x *= f; } void dfs(int now, int f) { map<int, int> vis; for (int i = 0; i < v[now].size(); i++) if (color[v[now][i]]) vis[color[v[now][i]]] = 1; int l = 0; for (int i = 0; i < v[now].size(); i++) { if (!color[v[now][i]]) { while (vis[++l]) ; color[v[now][i]] = l; } } for (int i = 0; i < G[now].size(); i++) { int to = G[now][i]; if (to != f) dfs(to, now); } } signed main() { read(n), read(m); int ans = 1; for (int i = 1; i <= n; i++) { read(sz); for (int j = 1; j <= sz; j++) { read(val); v[i].push_back(val); } ans = max(ans, sz); } for (int i = 1; i <= n - 1; i++) { read(x), read(y); G[x].push_back(y), G[y].push_back(x); } dfs(1, 1); printf( %d n , ans); for (int i = 1; i <= m; i++) printf( %d , color[i] ? color[i] : 1); return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) #pragma GCC optimize( -O2 ) using namespace std; const long long N = 500000 + 10; const long long MOD = 1000000000 + 7; const long long INF = 100000000000000010; const long long LOG = 25; long long dp[N], n, a[N], lazy[N << 2], m, b[N], seg[N << 2], p[N], koj[N]; void modify(long long id, long long x) { seg[id] += x; lazy[id] += x; } void shift(long long id) { modify(id << 1, lazy[id]); modify(id << 1 | 1, lazy[id]); lazy[id] = 0; } void add(long long id, long long lq, long long rq, long long x, long long l, long long r) { if (rq <= l || r <= lq) return; if (lq <= l && r <= rq) { modify(id, x); return; } long long md = (l + r) >> 1; shift(id); add(id << 1, lq, rq, x, l, md); add(id << 1 | 1, lq, rq, x, md, r); seg[id] = seg[id << 1] + seg[id << 1 | 1]; } long long get(long long id, long long lq, long long rq, long long l, long long r) { if (rq <= l || r <= lq) return 0; if (lq <= l && r <= rq) return seg[id]; shift(id); long long md = (l + r) >> 1; return get(id << 1, lq, rq, l, md) + get(id << 1 | 1, lq, rq, md, r); } void Set(long long id, long long lq, long long rq, long long x, long long l, long long r) { if (rq <= l || r <= lq) return; if (lq <= l && r <= rq) { seg[id] = x; return; } long long md = (l + r) >> 1; shift(id); Set(id << 1, lq, rq, x, l, md); Set(id << 1 | 1, lq, rq, x, md, r); seg[id] = seg[id << 1] + seg[id << 1 | 1]; } int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (long long i = 1; i <= n; i++) { cin >> a[i]; } for (long long i = 1; i <= n; i++) cin >> p[i]; cin >> m; for (long long i = 1; i <= m; i++) { cin >> b[i]; koj[b[i]] = i; } add(1, 1, m + 1, INF, 0, m + 1); for (long long i = 1; i <= n; i++) { if (koj[a[i]] == 0) { long long x = lower_bound(b + 1, b + m + 1, a[i]) - b; add(1, 0, x, p[i], 0, m + 1); long long zed = min(0ll, p[i]); add(1, x, m + 1, zed, 0, m + 1); } else { long long j = koj[a[i]]; long long zed = min(0ll, p[i]); long long mn = min(get(1, j - 1, j, 0, m + 1), get(1, j, j + 1, 0, m + 1) + zed); Set(1, j, j + 1, mn, 0, m + 1); add(1, 0, j, p[i], 0, m + 1); add(1, j + 1, m + 1, zed, 0, m + 1); } } long long ans = get(1, m, m + 1, 0, m + 1); if (ans > 1000000000000000) return cout << NO , 0; cout << YES n ; cout << ans; return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.