func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; int a[200009]; int s1[200009]; int s2[200009]; int id1[200009]; int id2[200009]; int main() { int n; cin >> n; for (int i = 1; i <= 2 * n; ++i) id1[i] = -1; for (int i = 1; i <= 2 * n; ++i) id2[i] = -1; for (int i = 0; i < n; ++i) { cin >> a[i]; if (i > 0) { s1[i] += s1[i - 1]; s2[i] += s2[i - 1]; } if (a[i] == 1) s1[i]++; else s2[i]++; if (id1[s1[i]] == -1) id1[s1[i]] = i; if (id2[s2[i]] == -1) id2[s2[i]] = i; } vector<pair<int, int> > ans; for (int t = 1; t <= max(s1[n - 1], s2[n - 1]); ++t) { int ans1 = 0, ans2 = 0; int i = 0; bool f = false; while (i < n) { int i1, i2; if (s1[i] + t - (a[i] == 1) > s1[n - 1]) i1 = n; else { if (a[i] == 1) i1 = id1[s1[i] + t - 1]; else i1 = id1[s1[i] + t]; } if (s2[i] + t - (a[i] == 2) > s2[n - 1]) i2 = n; else { if (a[i] == 2) i2 = id2[s2[i] + t - 1]; else i2 = id2[s2[i] + t]; } if (i1 == n && i2 == n) { f = false; break; } f = false; if (i1 < i2) { ++ans1; if (ans1 > ans2) f = true; } else { ++ans2; if (ans2 > ans1) f = true; } i = min(i1, i2) + 1; } if (f && ans1 != ans2) { ans.push_back(make_pair(max(ans1, ans2), t)); } } sort(ans.begin(), ans.end()); cout << (int)ans.size() << endl; for (int i = 0; i < (int)ans.size(); ++i) cout << ans[i].first << << ans[i].second << n ; } |
#include <bits/stdc++.h> using namespace std; void per() { cerr << endl; } template <typename Head, typename... Tail> void per(Head H, Tail... T) { cerr << H << ; per(T...); } template <class T> bool uin(T& a, T b) { return a > b ? (a = b, true) : false; } template <class T> bool uax(T& a, T b) { return a < b ? (a = b, true) : false; } template <class U, class V> ostream& operator<<(ostream& out, const pair<U, V>& a) { return out << ( << a.first << , << a.second << ) ; } template <class U, class V> istream& operator>>(istream& in, pair<U, V>& a) { return in >> a.first >> a.second; } template <typename W, typename T = typename enable_if<!is_same<W, string>::value, typename W::value_type>::type> ostream& operator<<(ostream& out, const W& v) { out << { ; for (const auto& first : v) out << first << , ; return out << } ; } template <class T> void readArr(T from, T to) { for (auto i = from; i != to; ++i) cin >> *i; } mt19937 mrand(1337); unsigned int myRand32() { return mrand() & (unsigned int)(-1); } unsigned long long myRand64() { return ((unsigned long long)myRand32() << 32) ^ myRand32(); } const int mod = 1000000007; void add(int& a, int b) { a += b; if (a >= mod) a -= mod; } void dec(int& a, int b) { a -= b; if (a < 0) a += mod; } int mult(int a, int b) { return a * (long long)b % mod; } int bp(int a, int b) { int res = 1; while (b > 0) { if (b & 1) res = mult(res, a); a = mult(a, a); b >>= 1; } return res; } struct Vertex { int l; int r; int father; int cnt; }; Vertex rmq[4000007]; int ptr = 0; vector<int> want[4000007]; int create(int vertex) { rmq[ptr++] = {-1, -1, vertex, 0}; want[ptr - 1] = {}; return ptr - 1; } void go(int vertex, long long l, long long r, long long l1, long long r1) { if (l1 >= r1) return; if (l == l1 && r == r1) { rmq[vertex].cnt = 1; return; } if (rmq[vertex].l == -1) { rmq[vertex].l = create(vertex); } if (rmq[vertex].r == -1) { rmq[vertex].r = create(vertex); } long long mid = (l + r) / 2; go(rmq[vertex].l, l, mid, l1, min(r1, mid)); go(rmq[vertex].r, mid, r, max(l1, mid), r1); rmq[vertex].cnt = rmq[rmq[vertex].l].cnt + rmq[rmq[vertex].r].cnt; } struct Node { int p, r, f; }; struct DSU { static const int SZ = 10000007; Node t[SZ]; DSU() { reset(SZ); } void reset(int n) { for (int i = 0; i < n; ++i) { t[i].p = i; t[i].r = 0; t[i].f = 1; } } int get(int v) { if (t[v].p == v) return v; return t[v].p = get(t[v].p); } int get_func(int v) { return t[get(v)].f; } void merge(int a, int b) { a = get(a), b = get(b); if (a != b) { if (t[a].r < t[b].r) swap(a, b); t[b].p = a; t[a].f += t[b].f; if (t[a].r == t[b].r) ++t[a].r; } } }; DSU dsu; bool good(int vertex) { if (vertex == -1) return false; if (rmq[vertex].cnt) return false; return true; } void restore(int vertex) { if (good(rmq[vertex].father)) dsu.merge(vertex, rmq[vertex].father); if (good(rmq[vertex].l)) dsu.merge(vertex, rmq[vertex].l); if (good(rmq[vertex].r)) dsu.merge(vertex, rmq[vertex].r); for (auto to : want[vertex]) dsu.merge(vertex, to); int W = vertex; vector<int> bits; while (true) { int t = rmq[vertex].father; if (t == -1) break; if (rmq[t].l == vertex) bits.push_back(0); else bits.push_back(1); vertex = t; } reverse(bits.begin(), bits.end()); int start = 0; for (int i = 0; i < bits.size() && start != -1; ++i) { bits[i] ^= 1; int now = start; for (int j = i; j < bits.size(); ++j) { int first = bits[j]; if (first == 0) { if (rmq[now].l == -1) { break; } now = rmq[now].l; } else { if (rmq[now].r == -1) { break; } now = rmq[now].r; } } if (good(now)) { dsu.merge(W, now); } else want[now].push_back(W); bits[i] ^= 1; if (bits[i] == 0) start = rmq[start].l; if (bits[i] == 1) start = rmq[start].r; } } void go_back(int vertex, long long l, long long r, long long l1, long long r1) { if (l1 >= r1) return; if (l == l1 && r == r1) { rmq[vertex].cnt = 0; restore(vertex); return; } long long mid = (l + r) / 2; go_back(rmq[vertex].l, l, mid, l1, min(r1, mid)); go_back(rmq[vertex].r, mid, r, max(l1, mid), r1); int W = rmq[vertex].cnt; rmq[vertex].cnt = rmq[rmq[vertex].l].cnt + rmq[rmq[vertex].r].cnt; if (rmq[vertex].cnt == 0 && W != 0) restore(vertex); } int n, m; int gg(long long first) { int now = 0; for (int i = n - 1; i >= 0; --i) { int t = (((1LL << i) & first) > 0); if (t == 0) { if (rmq[now].l == -1) return now; now = rmq[now].l; } else { if (rmq[now].r == -1) return now; now = rmq[now].r; } } return now; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); create(-1); rmq[0].l = create(0); rmq[0].r = create(0); vector<tuple<int, long long, long long> > queries; cin >> n >> m; for (int i = 0; i < m; ++i) { string s; cin >> s; if (s == ask ) { long long l, r; cin >> l >> r; queries.push_back(make_tuple(0, l, r)); } else { long long l, r; cin >> l >> r; queries.push_back(make_tuple(1, l, r)); go(0, 0, (1ll << n), l, r + 1); } } vector<int> ans; dsu.reset(ptr); for (int i = 0; i < ptr; ++i) { if (!rmq[i].cnt) { restore(i); } } reverse(queries.begin(), queries.end()); for (auto first : queries) { int tp = get<0>(first); long long l = get<1>(first); long long r = get<2>(first); if (tp == 1) { go_back(0, 0, (1ll << n), l, r + 1); } else { int A = gg(l), B = gg(r); if (dsu.get(A) == dsu.get(B) && !rmq[A].cnt && !rmq[B].cnt) ans.push_back(1); else ans.push_back(0); } } reverse(ans.begin(), ans.end()); for (auto first : ans) cout << first << n ; } |
#include<bits/stdc++.h> #include<algorithm> #define ll long long using namespace std; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int testcases; cin>>testcases; while(testcases--){ int n,k; cin>>n>>k; unsigned ll sum = 0 ; cin>>sum; unsigned ll diff = 0; for (int i = 0; i < n-1; ++i) { ll current; cin>>current; double thiscase = (1.00*sum) / current ; if(thiscase < (100.00/k)){ ll currentdiff = ceil((100.00*current) / k) - sum; diff += currentdiff; sum += currentdiff; } sum+= current; } cout<<diff<< n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, q; long long ans = 0; vector<int> graph[100005]; int depth[100005]; int parent[100005]; int weight[100005]; int ancestor[100005][17]; int comp[100005]; vector<int> comp_members[100005]; int comp_root[100005]; long long ansv[100005]; void merge_comp(int a, int b) { if (comp_members[a].size() > comp_members[b].size()) swap(a, b); ans -= (long long)(comp_members[a].size()) * ansv[a]; ans -= (long long)(comp_members[b].size()) * ansv[b]; for (int i = 0; i < comp_members[a].size(); i++) { int x = comp_members[a][i]; comp_members[b].push_back(x); comp[x] = b; } if (depth[comp_root[a]] < depth[comp_root[b]]) { long long up_p2_sum = ((long long)(n - 1) * (long long)((n - 1) - 1)) - ansv[a] - ((long long)(weight[comp_root[b]]) * (long long)((weight[comp_root[b]]) - 1)); ansv[b] += ((long long)(n - weight[comp_root[b]]) * (long long)((n - weight[comp_root[b]]) - 1)) - up_p2_sum; comp_root[b] = comp_root[a]; } else { long long down_p2_sum = ((long long)(n - 1) * (long long)((n - 1) - 1)) - ansv[a] - ((long long)(n - weight[comp_root[a]]) * (long long)((n - weight[comp_root[a]]) - 1)); ansv[b] += ((long long)(weight[comp_root[a]]) * (long long)((weight[comp_root[a]]) - 1)) - down_p2_sum; } ans += (long long)(comp_members[b].size()) * ansv[b]; comp_members[a].clear(); } void merge_chain(int from, int to) { while (comp[from] != comp[to]) { from = comp_root[comp[from]]; merge_comp(comp[from], comp[parent[from]]); } } void dfs(int node, int prt) { ansv[node] += ((long long)(n - 1) * (long long)((n - 1) - 1)); depth[node] = depth[prt] + 1; parent[node] = prt; weight[node] = 1; for (int i = 0; i < graph[node].size(); i++) { int nxt = graph[node][i]; if (nxt == prt) continue; dfs(nxt, node); weight[node] += weight[nxt]; ansv[node] -= ((long long)(weight[nxt]) * (long long)((weight[nxt]) - 1)); } long long above = n - weight[node]; ansv[node] -= ((long long)(above) * (long long)((above)-1)); ans += ansv[node]; } int lca(int A, int B) { if (depth[A] < depth[B]) swap(A, B); for (int i = 0; i < 17; i++) { if ((depth[A] - depth[B]) & (1 << i)) A = ancestor[A][i]; } if (A == B) return A; for (int i = 17 - 1; i >= 0; i--) { if (ancestor[A][i] != ancestor[B][i]) { A = ancestor[A][i]; B = ancestor[B][i]; } } return parent[A]; } void inputtree(int siz, int root = 1) { for (int i = 1; i < siz; i++) { int u, v; scanf( %d%d , &u, &v); graph[u].push_back(v); graph[v].push_back(u); } dfs(root, 0); for (int i = 1; i <= siz; i++) ancestor[i][0] = parent[i]; for (int pwr = 1; pwr < 17; pwr++) { for (int i = 1; i <= siz; i++) { ancestor[i][pwr] = ancestor[ancestor[i][pwr - 1]][pwr - 1]; } } } int main() { scanf( %d , &n); inputtree(n); for (int i = 1; i <= n; i++) { comp[i] = i; comp_members[i].push_back(i); comp_root[i] = i; } printf( %lld n , ans); scanf( %d , &q); for (int qry = 1; qry <= q; qry++) { int u, v; scanf( %d%d , &u, &v); int lcanode = lca(u, v); merge_chain(u, lcanode); merge_chain(v, lcanode); printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = pow(10, 9) + 7; int main() { ios_base::sync_with_stdio(false); int k; cin >> k; string s; cin >> s; int n = s.length(); int l = 0, r = 0; long long ans = 0LL; long long count1 = 0; while (l < n && k != 0) { long long countL = 0, countr = 0; bool found = false; while (r < n) { if (s[r] == 1 ) count1++; r++; if (count1 == k) { found = true; break; } } while (r < n && s[r] != 1 ) { countr++; r++; } while (l < n && s[l] != 1 ) { countL++; l++; } if (found) ans += (countL + 1) * (countr + 1); count1--; l++; } long long z = 0LL; if (k == 0) { for (int i = 0; i < n; i++) { if (s[i] == 0 ) z++; else { ans += (z * (z + 1)) / 2; z = 0; } } } cout << (ans + (z * (z + 1)) / 2); cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, x, k, i, j, t; vector<int> b, a; vector<bool> v; cin >> n >> k; v.resize(n, false); for (i = 0; i < n; i++) { cin >> x; b.push_back(x); if (x == 0) { v[i] = true; a.push_back(i + 1); } } for (i = n - 1; i >= 0; i--) { if (!v[i]) { t = 0; for (j = 0; j < (int)a.size(); j++) { if (a[j] >= i + 1 + k) { t++; } if (t == b[i]) { break; } } a.insert(a.begin() + j + 1, i + 1); } } for (i = 0; i < n; i++) { cout << a[i] << ; } cout << endl; } |
#include <bits/stdc++.h> using namespace std; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n, k; cin >> n >> k; long long a[n + 2][n + 2], i, j; string s; memset(a, 0, sizeof(a)); for (i = 1; i <= n; i++) { cin >> s; for (j = 1; j <= n; j++) a[i][j] = (s[j - 1] == B ? 1 : 0); } long long left[n + 2][n + 2], right[n + 2][n + 2], top[n + 2][n + 2], bot[n + 2][n + 2]; memset(left, 0, sizeof(left)); memset(right, 0, sizeof(right)); memset(bot, 0, sizeof(bot)); memset(top, 0, sizeof(top)); for (i = 1; i <= n; i++) { for (j = 1; j <= n; j++) left[i][j] = left[i][j - 1] + a[i][j]; for (j = n; j >= 1; j--) right[i][j] = right[i][j + 1] + a[i][j]; } for (j = 1; j <= n; j++) { for (i = 1; i <= n; i++) top[i][j] = top[i - 1][j] + a[i][j]; for (i = n; i >= 1; i--) bot[i][j] = bot[i + 1][j] + a[i][j]; } long long row[n + 2], col[n + 2]; memset(row, 0, sizeof(row)); memset(col, 0, sizeof(col)); for (i = 1; i <= n; i++) row[i] = row[i - 1] + (right[i][1] == 0); for (j = 1; j <= n; j++) col[j] = col[j - 1] + (bot[1][j] == 0); long long dpcol[n + 2][n + 2]; memset(dpcol, 0, sizeof(dpcol)); for (i = 1; i <= n; i++) { for (j = 1; j <= n; j++) { dpcol[i][j] = (top[i - 1][j] == 0); if (i + k <= n) dpcol[i][j] = dpcol[i][j] && (bot[i + k][j] == 0); } } for (i = 1; i <= n; i++) { for (j = 1; j <= n; j++) dpcol[i][j] += dpcol[i][j - 1]; } long long dprow[n + 2][n + 2]; memset(dprow, 0, sizeof(dprow)); for (i = 1; i <= n; i++) { for (j = 1; j <= n; j++) { dprow[i][j] = (left[i][j - 1] == 0); if (j + k <= n) dprow[i][j] = dprow[i][j] && (right[i][j + k] == 0); } } for (j = 1; j <= n; j++) for (i = 1; i <= n; i++) dprow[i][j] += dprow[i - 1][j]; long long ans = 0; for (i = 1; i <= n - k + 1; i++) { for (j = 1; j <= n - k + 1; j++) { long long temp = col[j - 1] + col[n] - col[j + k - 1] + row[i - 1] + row[n] - row[i + k - 1]; temp += (dpcol[i][j + k - 1] - dpcol[i][j - 1]); temp += (dprow[i + k - 1][j] - dprow[i - 1][j]); ans = max(ans, temp); } } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> bool compare(T x, U y) { return (abs(x - y) <= 1e-9); } const int MOD = 1e9 + 7; void solve() { long long a, b; cin >> a >> b; if (b == a) { cout << 1; return; } if ((b - a) >= 10) cout << 0; else { long long c = a + 1; long long prod = 1; while (c <= b) { prod = (prod * c) % 10; c++; } cout << prod; } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; t = 1; while (t--) { solve(); cout << n ; } } |
#include <bits/stdc++.h> using namespace std; int solve(string &s) { int len = s.length(); int ret = 0; for (int i = 0; i < len; ++i) { if (s[i] == V && i + 1 < len && s[i + 1] == K ) { ++ret; } } return ret; } int main() { string s; while (cin >> s) { int ans = solve(s); int len = s.length(); char c; for (int i = 0; i < len; ++i) { c = s[i]; if (s[i] == V ) { s[i] = K ; } else { s[i] = V ; } ans = max(ans, solve(s)); s[i] = c; } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int a[100000], k, i, n, j; char c; int main() { string s; cin >> k; i = 0; int p = 0; getline(cin, s); getline(cin, s); for (j = 0; j < s.length(); j++) { c = s[j]; p++; if (c == ? || c == . || c == ! ) { if (p > k) { cout << Impossible << endl; return 0; } a[i] = p; p = -1; i++; } } n = i; int g = 0, res = 0; for (i = 0; i < n; i++) { if (i == 0) { if (g + a[i] <= k) g += a[i]; } else if (g + a[i] + 1 <= k) g += (a[i] + 1); else { res++; g = a[i]; } } cout << res + 1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:60777216 ) const int N = 1111111; char s[N]; int n, k; const int mod = 1000000007; int f[N], g[N], h[N], ps[N], pW[N], pX[N], pB[N], p2[N], pr[N]; inline void solve(int *f, int *g, char W, char B, char X) { pW[0] = pX[0] = pB[0] = 0; if (s[0] == W) pW[0] = 1; else if (s[0] == B) pB[0] = 1; else if (s[0] == X) pX[0] = 1; for (int i = 1; i < n; ++i) { pW[i] = pW[i - 1]; pB[i] = pB[i - 1]; pX[i] = pX[i - 1]; if (s[i] == W) pW[i]++; else if (s[i] == B) pB[i]++; else if (s[i] == X) pX[i]++; } f[0] = 0; g[0] = 0; if (k == 1) { if (s[0] == W || s[0] == X) { f[0]++; } if (s[0] == B || s[0] == X) { g[0]++; } } else { g[0]++; if (s[0] == X) g[0]++; } ps[0] = 0; if (s[0] == X) ps[0] = 1; int lb = -1; if (s[0] == B) lb = 0; for (int i = 1; i < n; ++i) { if (i >= k - 1) { int cW = pW[i]; if (i > k - 1) cW -= pW[i - k]; int cB = pB[i]; if (i > k - 1) cB -= pB[i - k]; int cX = pX[i]; if (i > k - 1) cX -= pX[i - k]; if (cB == 0) { if (i == k - 1) f[i] = 1; else { if (s[i - k] == B) { f[i] = g[i - k]; } else if (s[i - k] == W) { f[i] = 0; } else { if (i == k) f[i] = 1; else f[i] = g[i - k - 1]; } } } else f[i] = 0; g[i] = 0; if (s[i] == B || s[i] == X) g[i] += g[i - 1]; if (s[i] == W || s[i] == X) { if (cB) { g[i] += ps[i - 1]; if (g[i] >= mod) g[i] -= mod; g[i] += mod - ps[lb]; if (g[i] >= mod) g[i] -= mod; g[i] += g[lb]; if (g[i] >= mod) g[i] -= mod; } else { g[i] += ps[i - 1]; if (g[i] >= mod) g[i] -= mod; if (i >= k) { g[i] += mod - ps[i - k]; if (g[i] >= mod) g[i] -= mod; } } } } else { f[i] = 0; g[i] = p2[pX[i]]; } ps[i] = ps[i - 1]; if (s[i] == X ) ps[i] += g[i - 1]; if (ps[i] >= mod) ps[i] -= mod; if (s[i] == B) lb = i; } } inline long long solution() { solve(f, h, B , W , X ); reverse(s, s + n); solve(g, h, W , B , X ); reverse(g, g + n); reverse(s, s + n); pX[0] = 0; if (s[0] == X ) pX[0] = 1; for (int i = 1; i < n; ++i) { pX[i] = pX[i - 1]; if (s[i] == X ) pX[i]++; } for (int i = 1; i < n; ++i) { g[i] = ((long long)g[i] * p2[pX[i - 1]]) % mod; } ps[n - 1] = g[n - 1]; for (int i = n - 2; i >= 0; --i) { ps[i] = ps[i + 1] + g[i]; if (ps[i] >= mod) ps[i] -= mod; } int ans = 0; for (int i = 0; i < n; ++i) { int cur = ((long long)f[i] * ps[i + 1]) % mod; cur = ((long long)cur * pr[pX[i]]) % mod; ans = (ans + cur) % mod; } return ans; } int main() { gets(s); sscanf(s, %d%d , &n, &k); gets(s); p2[0] = 1; for (int i = 1; i <= n; ++i) { p2[i] = p2[i - 1] * 2; if (p2[i] >= mod) p2[i] -= mod; } pr[0] = 1; pr[1] = mod / 2 + 1; for (int i = 2; i <= n; ++i) pr[i] = ((long long)pr[i - 1] * pr[1]) % mod; cout << solution() << endl; } |
#include <bits/stdc++.h> using namespace std; int inf = INT_MAX >> 1; double PI = 3.1415926535897932384626433832795; set<vector<char> > st; int ans = 0; void rotX(vector<char> &c); void rotY(vector<char> &c); void solve(string s) { vector<char> c(6); for (int i = 0; i < s.size(); i++) c[i] = s[i]; bool found = 0; set<vector<char> > ss; for (int i = 0; i < 4; i++) { rotX(c); for (int j = 0; j < 4; j++) { rotY(c); if (st.find(c) != st.end()) { found = 1; break; } ss.insert(c); } } if (!found) { for (auto it : ss) st.insert(it); ans++; } } int main() { string s; cin >> s; sort(s.begin(), s.end()); do { solve(s); } while (next_permutation(s.begin(), s.end())); printf( %d n , ans); return 0; } void rotX(vector<char> &c) { swap(c[0], c[1]); swap(c[0], c[4]); swap(c[0], c[3]); } void rotY(vector<char> &c) { swap(c[0], c[5]); swap(c[0], c[4]); swap(c[0], c[2]); } |
#include <bits/stdc++.h> using namespace std; int main() { long long t; long n; cin >> t; int a[t]; for (int i = 0; i < t; i++) { cin >> a[i]; } for (int i = 0; i < t; i++) { if (a[i] <= 2) { cout << 0 << endl; } else { n = (a[i] / 2.0); if (a[i] % 2 == 0) { cout << n - 1 << endl; } else { cout << n << endl; } } } } |
#include <bits/stdc++.h> using namespace std; char str[120][120]; int n; int grid[26][26]; int ru[26], vis[26]; char ans[30]; int cheat; void cmp(int a, int b) { int lena = strlen(str[a]); int lenb = strlen(str[b]); int len = min(lena, lenb); for (int i = 0; i < len; i++) { if (str[a][i] != str[b][i]) { int from = str[a][i] - a ; int to = str[b][i] - a ; grid[from][to] = 1; return; } } if (lena > lenb) cheat = 1; } void topoSort() { int i, j, t = 0; for (i = 0; i < 26; i++) { for (j = 0; j < 26; j++) { if (i != j && grid[i][j]) { ru[j]++; } } } while (1) { int found = 0; for (i = 0; i < 26; i++) { if (!vis[i] && ru[i] == 0) { found = 1; char ch = i + a ; ans[t++] = ch; for (j = 0; j < 26; j++) { if (grid[i][j]) { ru[j]--; } } vis[i] = 1; break; } } if (!found) break; } if (strlen(ans) != 26) cout << Impossible << endl; else printf( %s n , ans); } int main() { memset(grid, 0, sizeof(grid)); memset(ru, 0, sizeof(ru)); memset(vis, 0, sizeof(vis)); cin >> n; int i, j; for (i = 0; i < n; i++) { scanf( %s , str[i]); } for (i = 0; i < n; i++) { for (j = i + 1; j < n; j++) { cheat = 0; cmp(i, j); if (cheat) { cout << Impossible << endl; return 0; } } } topoSort(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int tt; cin >> tt; while (tt--) { long long n; cin >> n; string s = to_string(n); int c = 0; for (int i = 0; i < s.size(); i++) { if (s[i] != 0 ) c++; } cout << c; cout << n ; for (int i = 0; i < s.size(); ++i) { if (!(s[i] == 0 )) { cout << s[i]; int temp = s.size() - i - 1; while (temp--) cout << 0; cout << ; } } } } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; const int N = (int)5e5 + 100; const int M = (int)2e6 + 100; const int inf = (int)1e9 + 100; string s, t; long long mod = 998244353; bool was[3001][3001]; long long table[3001][3001]; long long f(int x, int y) { if (x < 0) return 1; if (was[x][y]) return table[x][y]; was[x][y] = 1; long long o = 0; if (y == t.length()) { o += 2 * f(x - 1, y) % mod; o %= mod; return table[x][y] = o; } if (s[x] == t[y]) { o += f(x - 1, y + 1); o %= mod; } if (x + 1 + y <= t.length()) { if (s[x] == t[y + x]) { o += f(x - 1, y); o %= mod; } } else { o += f(x - 1, y); o %= mod; } return table[x][y] = o; } int main() { mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); srand(time(0)); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> s >> t; long long ans = 0; int i; for ((i) = (t.length() - 1); (i) < (s.length()); (i)++) { ans += f(i, 0); ans %= mod; } cout << ans; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 998244353LL; typedef struct EDGE { int from, to, type, vis; EDGE() { vis = 0; } EDGE(int _f, int _t, int _ty) : from(_f), to(_t), type(_ty) { vis = 0; } } Edge; char s[2010]; vector<Edge> edges; vector<int> G[2010]; int n, vis[2010], tot, nodes[2010]; inline void addEdge(int from, int to, int type) { edges.push_back(Edge(from, to, type)); edges.push_back(Edge(to, from, type)); G[from].push_back(tot++); G[to].push_back(tot++); } void build(int k) { for (int i = 0; i <= n + k; i++) { G[i].clear(); vis[i] = 0; nodes[i] = -1; } edges.clear(); tot = 0; nodes[0] = 0; nodes[n + 1] = 1; int u, v; for (int i = 0; i < n; i++) { if (s[i] == ? ) continue; if (i < n - k) addEdge(0, i + 1, s[i] - 0 ); else addEdge(i + 1 + k, i + 1, s[i] - 0 ); } u = 1; v = n; while (u < v) { addEdge(u, v, 0); u++; v--; } u = n + 1; v = n + k; while (u < v) { addEdge(u, v, 0); u++; v--; } } long long dfs(int u) { vis[u] = 1; int Gs = G[u].size(); for (int i = 0; i < Gs; i++) { Edge &e = edges[G[u][i]]; Edge &eo = edges[G[u][i] ^ 1]; if (e.vis) continue; if (nodes[e.to] != -1 && nodes[e.to] ^ e.type != nodes[u]) return 0; nodes[e.to] = nodes[u] ^ e.type; e.vis = 1; eo.vis = 1; if (!dfs(e.to)) return 0; } return 1LL; } long long qpow(long long a, long long t) { long long ret = 1LL; while (t) { ret = t & 1 ? ret * a % mod : ret; a = a * a % mod; t >>= 1; } return ret; } void disp(int N) { for (int i = 0; i <= N; i++) { cout << i << ( << vis[i] << ) ; } cout << endl; } int main() { while (cin >> s) { n = strlen(s); long long ans = 0; for (int k = 1; k < n; k++) { build(k); int cur = dfs(0) && dfs(n + 1) ? 0 : -1; for (int i = 0; cur >= 0 && i <= n + k; i++) { if (!vis[i]) { nodes[i] = 0; cur = dfs(i) ? cur + 1 : -1; } } ans = cur >= 0 ? (ans + qpow(2LL, cur)) % mod : ans; } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int seed = 131; const long long LLMAX = 2e18; const int MOD = 1e9 + 7; const double eps = 1e-8; const int MAXN = 1e6 + 10; const int hmod1 = 0x48E2DCE7; const int hmod2 = 0x60000005; inline long long sqr(long long x) { return x * x; } inline int sqr(int x) { return x * x; } inline double sqr(double x) { return x * x; } long long __gcd(long long a, long long b) { return b == 0 ? a : __gcd(b, a % b); } long long qpow(long long a, long long n) { long long sum = 1; while (n) { if (n & 1) sum = sum * a % MOD; a = a * a % MOD; n >>= 1; } return sum; } inline int dcmp(double x) { if (fabs(x) < eps) return 0; return (x > 0 ? 1 : -1); } long long p1[MAXN], p2[MAXN], hash1[MAXN], hash2[MAXN]; int main(void) { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); string s, t; cin >> s >> t; long long n = s.size(), m = t.size(), zero = 0, one = 0, ans = 0; s = # + s, t = # + t; for (long long i = 1; i <= n; i++) { if (s[i] == 0 ) zero++; else one++; } p1[0] = p2[0] = 1; for (long long i = 1; i <= m; i++) { p1[i] = p1[i - 1] * seed % hmod1; p2[i] = p2[i - 1] * seed % hmod2; hash1[i] = (hash1[i - 1] * seed + (t[i] - a + 1)) % hmod1; hash2[i] = (hash2[i - 1] * seed + (t[i] - a + 1)) % hmod2; } for (long long len0 = 1; len0 < m; len0++) if ((m - zero * len0) % one == 0) { long long len1 = (m - zero * len0) / one, sum00 = -1, sum01 = -1, sum10 = -1, sum11 = -1, flag = 0; if (len1 <= 0) continue; for (long long i = 1, j = 0; i <= n && !flag; i++) { if (s[i] == 0 ) { j += len0; if (sum00 == -1) { sum00 = (hash1[j] - hash1[j - len0] * p1[len0] % hmod1 + hmod1) % hmod1; sum01 = (hash2[j] - hash2[j - len0] * p2[len0] % hmod2 + hmod2) % hmod2; } else if (sum00 != (hash1[j] - hash1[j - len0] * p1[len0] % hmod1 + hmod1) % hmod1 || sum01 != (hash2[j] - hash2[j - len0] * p2[len0] % hmod2 + hmod2) % hmod2) flag = 1; } else { j += len1; if (sum10 == -1) { sum10 = (hash1[j] - hash1[j - len1] * p1[len1] % hmod1 + hmod1) % hmod1; sum11 = (hash2[j] - hash2[j - len1] * p2[len1] % hmod2 + hmod2) % hmod2; } else if (sum10 != (hash1[j] - hash1[j - len1] * p1[len1] % hmod1 + hmod1) % hmod1 || sum11 != (hash2[j] - hash2[j - len1] * p2[len1] % hmod2 + hmod2) % hmod2) flag = 1; } } if ((sum00 != sum10 || sum01 != sum11) && !flag) ans++; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> inline void smin(T &a, U b) { if (a > b) a = b; } template <typename T, typename U> inline void smax(T &a, U b) { if (a < b) a = b; } template <class T> inline void gn(T &first) { char c, sg = 0; while (c = getchar(), (c > 9 || c < 0 ) && c != - ) ; for ((c == - ? sg = 1, c = getchar() : 0), first = 0; c >= 0 && c <= 9 ; c = getchar()) first = (first << 1) + (first << 3) + c - 0 ; if (sg) first = -first; } pair<long long, long long> p[100011]; int n; int a, b, c, d; long long arr[100011]; long long dp[100011]; void solve() { cin >> n; scanf( %d / %d %d / %d , &a, &b, &c, &d); for (int i = 1; i <= n; i++) { int u, v; gn(u); gn(v); p[i] = pair<long long, long long>((long long)c * u - (long long)d * v, (long long)b * v - (long long)a * u); } sort(p + 1, p + n + 1, [&](pair<long long, long long> u, pair<long long, long long> v) { if (u.first == v.first) return u.second > v.second; return u.first < v.first; }); int nn = 0; for (int i = 1; i <= n; i++) { arr[nn++] = p[i].second; if (p[i].first < 0) arr[nn - 1] = 0; } int ans = 0; for (int i = 0; i <= nn + 2; i++) dp[i] = 1e18; for (int i = 0; i < nn; i++) { if (arr[i] <= 0) continue; int id = lower_bound(dp, dp + nn, arr[i]) - dp; dp[id] = arr[i]; smax(ans, id + 1); } cout << ans << endl; } int main() { solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; struct option { int s; int t; bool operator<(const option &next) const { if (this->s == next.s) return this->t < next.t; else return this->s < next.s; } }; vector<int> num1; vector<int> num2; vector<option> oLis; int n, sum1, sum2; int winner; bool solve(int); int main() { scanf( %d , &n); int a; sum1 = 0; sum2 = 0; for (int i = 0; i < n; i++) { scanf( %d , &a); if (a == 1) sum1++; else sum2++; if (i == n - 1) winner = a; num1.push_back(sum1); num2.push_back(sum2); } if (sum1 == sum2) { printf( 0 n ); return 0; } int sum = sum1 > sum2 ? sum1 : sum2; for (int i = 1; i <= sum; i++) solve(i); sort(oLis.begin(), oLis.end()); printf( %d n , oLis.size()); for (int i = 0; i < (int)oLis.size(); i++) printf( %d %d n , oLis[i].s, oLis[i].t); return 0; } bool solve(int x) { int tmp1, tmp2; int pos1, pos2; int score1, score2; bool flag = true; pos1 = 0; pos2 = 0; score1 = 0; score2 = 0; for (int i = 0; i < n; i++) { tmp1 = lower_bound(num1.begin(), num1.end(), pos1 + x) - num1.begin(); tmp2 = lower_bound(num2.begin(), num2.end(), pos2 + x) - num2.begin(); if (tmp1 != n || tmp2 != n) { if (tmp1 < tmp2) { score1++; pos1 = num1[tmp1]; pos2 = num2[tmp1]; } else { score2++; pos1 = num1[tmp2]; pos2 = num2[tmp2]; } } else { tmp1 = tmp2 = n - 1; if (num1[tmp1] != pos1 || num2[tmp2] != pos2) flag = false; break; } } if (flag) { if ((winner == 1 && score2 > score1) || (winner == 2 && score1 > score2) || (score1 == score2)) return false; option tem; tem.s = score1 > score2 ? score1 : score2; tem.t = x; oLis.push_back(tem); return true; } return false; } |
#include <bits/stdc++.h> using namespace std; int a[26], b[26]; long long int q; int comp(long long int k) { long long int qs = q; for (int i = 0; i < 26; i++) qs -= max(b[i] * k - a[i], 0LL); return qs >= 0; } int main() { cin.tie(0); cin.sync_with_stdio(0); cout.precision(10); string s, t; cin >> s; cin >> t; for (char c : s) if (c == ? ) q++; else a[c - a ]++; for (char c : t) b[c - a ]++; int l = 0, r = 10E5 + 1; while (r - l > 1) { int p = (l + r) / 2; if (comp(p)) l = p; else r = p; } for (int i = 0; i < 26; i++) b[i] *= l; int j = 0; for (int i = 0; i < s.size(); i++) { if (s[i] == ? ) { while (b[j] - a[j] <= 0 && j < 26) j++; if (j < 26) { s[i] = j + a ; b[j]--; } else s[i] = a ; } } cout << s; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 3005; queue<int> q; vector<int> G[MAXN]; int d[MAXN][MAXN]; bool vis[MAXN]; void bfs(int s) { memset(vis, 0, sizeof(vis)); vis[s] = true; d[s][s] = 0; q.push(s); while (!q.empty()) { int u = q.front(); q.pop(); for (int i = 0; i < G[u].size(); i++) { int v = G[u][i]; if (!vis[v]) { vis[v] = true; d[s][v] = d[s][u] + 1; q.push(v); } } } } int main() { int n, m, s1, t1, l1, s2, t2, l2; scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) { int a, b; scanf( %d%d , &a, &b); G[a].push_back(b); G[b].push_back(a); } scanf( %d%d%d%d%d%d , &s1, &t1, &l1, &s2, &t2, &l2); for (int i = 1; i <= n; i++) bfs(i); if (d[s1][t1] > l1 || d[s2][t2] > l2) { printf( -1 ); return 0; } int ans = max(0, m - d[s1][t1] - d[s2][t2]); for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) { int d1 = d[s1][i] + d[i][j] + d[j][t1], d2 = min(d[s2][i] + d[j][t2], d[s2][j] + d[i][t2]) + d[i][j]; if (d1 <= l1 && d2 <= l2) ans = max(ans, m - d1 - d2 + d[i][j]); } printf( %d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; priority_queue<pair<int, char> > pr; bool is_prime(int n) { if (n == 1) return 0; for (int i = 2; i * i <= n; i++) if (n % i == 0) return 0; return 1; } vector<int> prime, pos[1004]; map<int, int> mark, mark2; map<int, int>::iterator it; bool vis[10000]; void solve(int n, int prm, int idx) { vis[prm] = 1; int rng = n / prm; for (int j = 1; j <= rng; j++) { int x = prm * j; if (!mark2[x]) pos[idx].push_back(x); mark2[x] = 1; for (int k = 2; k * k <= x; k++) { if (x % k == 0) { while (x % k == 0) x /= k; if (!vis[k] && k <= n) solve(n, k, idx); } } if (x > 1 && !vis[x]) solve(n, x, idx); } } int main() { int n; string tmp, str; str += 1 ; cin >> tmp; str += tmp; n = tmp.size(); char ans[10000]; for (int i = 0; i <= n; i++) ans[i] = 1 ; for (int i = 2; i <= n / 2; i++) if (is_prime(i)) prime.push_back(i); bool flg = 1; int sz = 0; for (int i = 0; i < prime.size(); i++) if (!vis[prime[i]]) solve(n, prime[i], sz++); for (int i = 1; i <= n; i++) mark[str[i]]++; for (it = mark.begin(); it != mark.end(); it++) pr.push(make_pair(it->second, it->first)); for (int i = 0; i < sz; i++) { if (pos[i].size() <= pr.top().first) { for (int j = 0; j < pos[i].size(); j++) ans[pos[i][j]] = pr.top().second; int x = pr.top().first - pos[i].size(); char ch = pr.top().second; pr.pop(); pr.push(make_pair(x, ch)); } else { flg = 0; break; } } if (flg) { printf( YES n ); for (int i = 1; i <= n; i++) { if (ans[i] == 1 ) { while (!pr.top().first) pr.pop(); ans[i] = pr.top().second; int x = pr.top().first - 1; char ch = pr.top().second; pr.pop(); pr.push(make_pair(x, ch)); } } for (int i = 1; i <= n; i++) printf( %c , ans[i]); printf( n ); } else printf( NO n ); } |
#include <bits/stdc++.h> using namespace std; int n, t, k, cnt = 0; int a[200005], st[200005]; struct hehe { int x, y; } e[200005]; void add(int x, int y) { cnt++; e[cnt].x = x; e[cnt].y = y; } void solve() { int i, j; int minn = 1, maxx = 1; a[0] = 1; st[0] = 1; for (i = 1; i <= t; i++) { maxx = maxx + a[i] - 1; st[i] = st[i - 1] + a[i - 1]; if (a[i] >= a[i - 1]) minn += a[i] - a[i - 1]; } if (minn > k || maxx < k) { printf( -1 n ); return; } printf( %d n , n); for (i = st[1]; i <= st[1] + a[1] - 1; i++) add(1, i); for (i = 1; i <= t - 1; i++) { if (minn < k) { for (j = 1; j <= a[i + 1] - a[i] && j <= a[i + 1]; j++) add(st[i], st[i + 1] + j - 1); int zuida; if (a[i + 1] >= a[i]) zuida = a[i] - 1; else zuida = a[i + 1] - 1; if (minn + zuida < k) { int delta = max(0, a[i + 1] - a[i]); minn += zuida; for (j = st[i + 1] + delta; j <= st[i + 1] + a[i + 1] - 1; j++) add(st[i], j); } else { int delta = max(0, a[i + 1] - a[i]); int xiaid; int zhiqian; if (a[i + 1] >= a[i]) zhiqian = 0; else zhiqian = a[i] - a[i + 1]; for (j = 1; j <= a[i] - (zhiqian + (k - minn)); j++) { xiaid = st[i + 1] + delta + j - 1; add(st[i] + j - 1, xiaid); } for (j = xiaid + 1; j <= st[i + 1] + a[i + 1] - 1; j++) add(st[i], j); minn = k; } } else { for (j = 1; j <= a[i + 1] - a[i]; j++) add(st[i], st[i + 1] + j - 1); int id = st[i]; int delta = max(0, a[i + 1] - a[i]); for (j = st[i + 1] + delta; j <= st[i + 1] + a[i + 1] - 1; j++) { add(id, j); id++; } } } for (i = 1; i <= cnt; i++) cout << e[i].x << << e[i].y << endl; } int main() { while (scanf( %d%d%d , &n, &t, &k) != EOF) { int i; cnt = 0; for (i = 1; i <= t; i++) scanf( %d , &a[i]); solve(); } return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:1024000000,1024000000 ) using namespace std; long long qp(long long a, long long b, long long mod) { long long t = 1; while (b) { if (b & 1) t = t * a % mod; b >>= 1; a = a * a % mod; } return t; } struct DOT { int x; int y; }; inline void read(int &x) { int k = 0; char f = 1; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) f = -1; for (; isdigit(c); c = getchar()) k = k * 10 + c - 0 ; x = k * f; } void ex() { puts( -1 ); exit(0); } const int dx[4] = {-1, 0, 1, 0}; const int dy[4] = {0, 1, 0, -1}; const int inf = 0x3f3f3f3f; const long long Linf = 0x3f3f3f3f3f3f3f3fll; const long long mod = 1e9 + 7; const double pi = acos(-1.0); const double eps = 1e-7; const int maxn = 5e5 + 344; int n, k; map<int, int> mp; int a[maxn], b[maxn]; int main() { scanf( %d%d , &n, &k); int rembk = k; long long sum = 0; for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); sum += a[i]; mp[a[i]]++; } int tot = 0; sort(a + 1, a + 1 + n); for (int i = 1; i <= n; i++) { if (a[i] != a[i - 1]) { b[++tot] = a[i]; } } int mov = 0; int mnto = b[1]; for (int i = 1; i <= tot; i++) { if (1ll * mov * (b[i] - b[i - 1]) <= 1ll * k) { k -= mov * (b[i] - b[i - 1]); mnto = b[i]; mov += mp[b[i]]; } else break; } mnto += k / mov; k = rembk; mov = 0; int mxto = b[tot]; b[tot + 1] = b[tot]; for (int i = tot; i >= 1; i--) { if (1ll * mov * (b[i + 1] - b[i]) <= 1ll * k) { k -= mov * (b[i + 1] - b[i]); mxto = b[i]; mov += mp[b[i]]; } else break; } mxto -= k / mov; if (mxto <= mnto) { if (sum % n == 0) { puts( 0 ); } else puts( 1 ); } else { printf( %d n , mxto - mnto); } } |
#include <bits/stdc++.h> const int MAX = 1e3 + 5; using namespace std; int edge, mx, ans, seen[MAX], a, n, m, k, spec[MAX], check[MAX][MAX]; vector<int> adj[MAX]; vector<int> cur; void dfs(int node) { if (seen[node] == 1) return; seen[node] = 1; cur.push_back(node); for (int i = int(0); i <= int(adj[node].size() - 1); i++) dfs(adj[node][i]); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n >> m >> k; for (int i = int(1); i <= int(k); i++) cin >> a, spec[a] = 1; for (int i = int(1); i <= int(m); i++) { int u, v; cin >> u >> v; adj[u].push_back(v); adj[v].push_back(u); check[u][v] = check[v][u] = 1; } for (int i = int(1); i <= int(n); i++) if (spec[i] == 1) { dfs(i); mx = max(int(cur.size()), mx); int comb = (cur.size() == 1 ? 0 : (cur.size() * (cur.size() - 1) / 2)); for (int i = int(0); i <= int(cur.size() - 1); i++) { for (int j = int(i + 1); j <= int(cur.size() - 1); j++) edge += check[cur[i]][cur[j]]; } ans += comb - edge; cur.clear(); edge = 0; } for (int i = int(1); i <= int(n); i++) { if (seen[i] == 1) continue; dfs(i); int comb = (cur.size() == 1 ? 0 : (cur.size() * (cur.size() - 1) / 2)); for (int i = int(0); i <= int(cur.size() - 1); i++) { for (int j = int(i + 1); j <= int(cur.size() - 1); j++) edge += check[cur[i]][cur[j]]; } ans += comb - edge; ans += mx * int(cur.size()); mx += cur.size(); cur.clear(); edge = 0; } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long int po(int a) { if (a == 0) return 1; long long int x = po(a / 2); x = x * x; x %= 1000000007; if (a % 2 == 0) { return x; } else { x = x * 2; x %= 1000000007; return x; } } int main() { int x, y; cin >> x >> y; if (y % x != 0) { cout << 0 << endl; } else { y = y / x; vector<int> val; for (int i = 1; i * i <= y; i++) { if (y % i == 0) { val.push_back(i); if (i * i != y) { val.push_back(y / i); } } } sort(val.begin(), val.end()); vector<int> ans(val.size(), 0); ans[0] = 1; for (int i = 1; i < val.size(); i++) { ans[i] = po(val[i] - 1); for (int j = 0; j < i; j++) { if (val[i] % val[j] != 0) continue; ans[i] -= ans[j]; ans[i] = ans[i] % 1000000007; } } if (ans[val.size() - 1] < 0) { ans[val.size() - 1] += 1000000007; } cout << ans[val.size() - 1] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX_N = 1e6 + 5; const double delta = 1e-6; const long long mod = 1e9 + 7; struct ev { double coord; int type; int mincost; }; const bool operator<(const ev& f, const ev& s) { return f.coord < s.coord; } void init() {} class fenwick { vector<int> sums; public: fenwick(int n) { sums.resize(n + 3); } void add(int pos, int delta) { for (pos++; pos < sums.size(); pos += pos & (-pos)) sums[pos] += delta; } int size() { return sums.size() - 2; } int pref_sum(int pos) { if (pos < -1) return 0; int answer = 0; for (pos++; pos > 0; pos -= pos & (-pos)) answer += sums[pos]; return answer; } int get_sum(int left, int right) { return pref_sum(right) - pref_sum(left - 1); } }; const bool cmppp(const pair<int, int>& f, const pair<int, int>& s) { return (f.second == s.second) ? (f.first < s.first) : (f.second > s.second); } vector<int> unique_xs; void compress() { sort(unique_xs.begin(), unique_xs.end()); unique_xs = vector<int>(unique_xs.begin(), unique(unique_xs.begin(), unique_xs.end())); } int get_num(int dt) { return lower_bound(unique_xs.begin(), unique_xs.end(), dt) - unique_xs.begin(); } class dsu { public: vector<int> a; vector<int> sizes; dsu(int n, vector<int>& sizes) : sizes(sizes) { a.resize(n); for (int i = 0; i < n; i++) { a[i] = i; } } int get_parent(int x) { return (a[x] == x) ? x : (a[x] = get_parent(a[x])); } void unite(int l, int r) { int par_1 = get_parent(l); int par_2 = get_parent(r); if (par_1 == par_2) return; if (sizes[par_1] < sizes[par_2]) swap(par_1, par_2); sizes[par_1] += sizes[par_2]; sizes[par_2] = 0; a[par_2] = par_1; } }; bool is_prime(int number) { for (int i = 2; i * i <= number; i++) { if (number % i == 0) { return false; } } return true; } string s; string left_answer = ; string right_answer = ; void squeeze(int& l, int& r) { if (l == r) { left_answer += s[l]; l++; return; } if (s[l] == s[r]) { left_answer += s[l]; right_answer += s[r]; l++; r--; return; } if (l + 1 >= r && s[l] != s[r]) { left_answer += s[l]; l++; r--; return; } if (s[l + 1] == s[r]) { left_answer += s[l + 1]; right_answer += s[r]; l += 2; r--; return; } if (s[l] == s[r - 1]) { left_answer += s[l]; right_answer += s[r - 1]; l++; r -= 2; return; } l++; r--; } void solve() { cin >> s; int left = 0; int right = s.size() - 1; while (left <= right) { squeeze(left, right); } reverse(right_answer.begin(), right_answer.end()); cout << left_answer << right_answer << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); srand(58164); solve(); } |
#include <bits/stdc++.h> using namespace std; int dp[4010][4010]; int pa[4010][4010], pb[4010][4010]; char a[4010], b[4010]; int ti, td, tr, te; int la, lb; int main() { scanf( %d%d%d%d , &ti, &td, &tr, &te); scanf( %s%s , a + 1, b + 1); la = strlen(a + 1); lb = strlen(b + 1); for (int i = 1; i <= la; i++) { for (int j = 1; j <= lb; j++) { pa[i][j] = pa[i][j - 1]; if (a[i] == b[j]) pa[i][j] = j; } } for (int i = 1; i <= lb; i++) { for (int j = 1; j <= la; j++) { pb[i][j] = pb[i][j - 1]; if (a[j] == b[i]) pb[i][j] = j; } } for (int i = 0; i <= la; i++) { for (int j = 0; j <= lb; j++) { if (!i && !j) continue; dp[i][j] = 1e9; if (j) dp[i][j] = min(dp[i][j], dp[i][j - 1] + ti); if (i) dp[i][j] = min(dp[i][j], dp[i - 1][j] + td); if (i && j) { if (a[i] == b[j]) dp[i][j] = min(dp[i][j], dp[i - 1][j - 1]); else dp[i][j] = min(dp[i][j], dp[i - 1][j - 1] + tr); int li = pb[j][i - 1], lj = pa[i][j - 1]; if (li && lj) { dp[i][j] = min(dp[i][j], dp[li - 1][lj - 1] + td * (i - li - 1) + ti * (j - lj - 1) + te); } } } } printf( %d , dp[la][lb]); return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int MOD = 1e9 + 7; int n, k; long long quick(long long A, long long B) { if (B == 0) return 1; long long tmp = quick(A, B >> 1); tmp *= tmp; tmp %= MOD; if (B & 1) tmp *= A, tmp %= MOD; return tmp; } int fact[100000 + 20], invfact[100000 + 20]; int suf[100000 + 20]; int tot; int rest = 0; long long c(int A, int B) { if (B == 0) return 1; if (B < 0) return 0; if (A < B) return 0; return 1ll * fact[A] * invfact[A - B] % MOD * invfact[B] % MOD; } int main() { scanf( %d%d , &n, &k); string s; cin >> s; for (int i = n - 1; i >= 1; --i) suf[i] = suf[i + 1] + (s[i - 1] - 0 ); fact[0] = 1; for (int i = 1; i <= n; ++i) { fact[i] = 1ll * fact[i - 1] * i % MOD; } invfact[n] = quick(fact[n], MOD - 2); for (int i = n - 1; i >= 0; --i) invfact[i] = 1ll * invfact[i + 1] * (i + 1) % MOD; tot = 0; int bad = 0, ten = 1; for (int i = 1; i <= n - 2; ++i) { tot -= bad; tot += MOD; tot %= MOD; tot = 10ll * tot % MOD; bad += 1ll * ten * (s[n - 1 - i] - 0 ) % MOD; bad %= MOD; ten = 10ll * ten % MOD; (tot += suf[i + 1]) %= MOD; (rest += 1ll * tot * c(n - 2 - i, k - 2) % MOD) %= MOD; } int tmp = 0; for (int i = 1; i <= n - 1; ++i) { tmp = 10ll * tmp % MOD; (tmp += (s[i - 1] - 0 )) %= MOD; (rest += 1ll * tmp * c(n - 1 - i, k - 1) % MOD) %= MOD; } int z = 1; tmp = 0; for (int i = 1; i <= n; ++i) { (tmp += 1ll * (s[n - i] - 0 ) * z % MOD) %= MOD; z = 10ll * z % MOD; (rest += 1ll * tmp * c(n - 1 - i, k - (i != n)) % MOD) %= MOD; } cout << rest << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, m; cin >> n >> m; char **a = new char *[n]; for (int i = 0; i < n; i++) { a[i] = new char[m + 1]; cin >> a[i]; } for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) for (int k = 0; k < n; k++) for (int l = 0; l < m; l++) { if (i == k && j == l) { continue; } if (a[i][j] == W || a[k][l] == W ) { continue; } bool found1 = true; for (int i1 = j; i1 <= l; i1++) { if (a[i][i1] == W ) { found1 = false; break; } } for (int i1 = i; i1 <= k; i1++) { if (a[i1][l] == W ) { found1 = false; break; } } if (found1) { continue; } found1 = true; for (int i1 = i; i1 <= k; i1++) { if (a[i1][j] == W ) { found1 = false; break; } } for (int i1 = j; i1 <= l; i1++) { if (a[k][i1] == W ) { found1 = false; break; } } if (found1) { continue; } else { cout << NO ; return 0; } } cout << YES ; } |
#include <bits/stdc++.h> using namespace std; mt19937 gen(chrono::system_clock::now().time_since_epoch().count()); const int N = 1e6 + 10; const long long MOD = 1e9 + 7; const long long p1 = 57, M1 = 1e9 + 3; const int rx[4] = {-1, 0, 1, 0}; const int ry[4] = {0, 1, 0, -1}; const int hx[8] = {-2, -2, -1, 1, 2, 2, 1, -1}; const int hy[8] = {-1, 1, 2, 2, 1, -1, -2, -2}; const long double eps = 1e-7; const double pi = acos(-1.0); const long long INF = 1e14 + 1000; struct segtree { vector<pair<int, int> > t; vector<int> lazy; int nw; segtree(int n) { nw = (1 << (32 - __builtin_clz(n) - (__builtin_popcount(n) == 1))); t.resize(nw << 1, {0, 1}); lazy.resize(nw << 1); for (int i = nw - 1; i > 0; i--) { t[i].second = t[i * 2].second + t[i * 2 + 1].second; } } void push(int v) { t[v * 2].first += lazy[v]; t[v * 2 + 1].first += lazy[v]; lazy[v * 2] += lazy[v]; lazy[v * 2 + 1] += lazy[v]; lazy[v] = 0; } void upd(int v, int cl, int cr, int l, int r, int x) { if (cl >= l && cr <= r) { t[v].first += x; lazy[v] += x; return; } if (cl >= r || cr <= l) return; push(v); int mid = (cl + cr) / 2; upd(v * 2, cl, mid, l, r, x); upd(v * 2 + 1, mid, cr, l, r, x); if (t[v * 2].first < t[v * 2 + 1].first) { t[v] = t[v * 2]; } else if (t[v * 2 + 1].first < t[v * 2].first) { t[v] = t[v * 2 + 1]; } else { t[v] = t[v * 2]; t[v].second += t[v * 2 + 1].second; } } void upd(int l, int r, int x) { upd(1, 1, nw + 1, l, r + 1, x); } int kol(int v, int cl, int cr, int l, int r) { if (cl >= l && cr <= r) { if (t[v].first == 0) return t[v].second; else return 0; } if (cl >= r || cr <= l) return 0; push(v); int mid = (cl + cr) / 2; return kol(v * 2, cl, mid, l, r) + kol(v * 2 + 1, mid, cr, l, r); } int kol(int l, int r) { return kol(1, 1, nw + 1, l, r + 1); } }; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; a[i]--; } vector<int> pos[n]; long long res = 0; segtree sgt(n); for (int i = 0; i < n; i++) { pos[a[i]].push_back(i); int sz = pos[a[i]].size(); if (sz == 1) { sgt.upd(1, i + 1, 1); } else if (sz == 2) { sgt.upd(1, pos[a[i]][0] + 1, -1); sgt.upd(1, i + 1, 1); } else if (sz == 3) { sgt.upd(1, pos[a[i]][1] + 1, -1); sgt.upd(pos[a[i]][0] + 2, i + 1, 1); } else if (sz == 4) { sgt.upd(pos[a[i]][0] + 2, pos[a[i]][2] + 1, -1); sgt.upd(1, pos[a[i]][0] + 1, 1); sgt.upd(pos[a[i]][1] + 2, i + 1, 1); } else { sgt.upd(1, pos[a[i]][sz - 5] + 1, -1); sgt.upd(pos[a[i]][sz - 4] + 2, pos[a[i]][sz - 2] + 1, -1); sgt.upd(1, pos[a[i]][sz - 4] + 1, 1); sgt.upd(pos[a[i]][sz - 3] + 2, i + 1, 1); } res += sgt.kol(1, i + 1); } cout << res << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { long long int n, k; cin >> n >> k; string s; cin >> s; string ans = ; long long int reqd = k / 2, op = 0, cl = 0; for (auto x : s) { if (op < reqd) { if (x == ( ) { ans.push_back(x); op++; } } if (cl < reqd) { if (x == ) ) { ans.push_back(x); cl++; } } if (op == reqd and cl == reqd) { break; } } cout << ans << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); solve(); } |
#include <bits/stdc++.h> using namespace std; int main() { int n, i, j, s1 = 0, s2 = 0, s3 = 0, s4 = 0; int a[105][105]; cin >> n; int k = (n + 1) / 2; for (i = 1; i <= n; i++) { for (j = 1; j <= n; j++) { cin >> a[i][j]; } cout << endl; } for (i = 1; i <= n; i++) { s1 += a[i][k]; } for (j = 1; j <= n; j++) { s2 += a[k][j]; } for (int m = 1, x = 1, y = n; m < k; m++, x++, y--) { s3 += a[m][x] + a[m][y]; } for (int m = n, x = 1, y = n; m > k; m--, x++, y--) { s4 += a[m][x] + a[m][y]; } cout << s1 + s2 + s3 + s4 - a[k][k] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(0); int64_t n, m, d; cin >> n >> m >> d; vector<pair<int64_t, int64_t> > a1(n), a2(m); for (auto &e : a1) { cin >> e.first >> e.second; e.second = -e.second; } for (auto &e : a2) { cin >> e.first >> e.second; e.second = -e.second; } sort(a1.begin(), a1.end()); sort(a2.begin(), a2.end()); reverse(a1.begin(), a1.end()); reverse(a2.begin(), a2.end()); vector<int64_t> p2c(m), p2w(m); int64_t ans = 0; for (int64_t i = 0; i < m; i++) { p2c[i] = a2[i].first; p2w[i] = -a2[i].second; if (i > 0) { p2c[i] += p2c[i - 1]; p2w[i] += p2w[i - 1]; } } int64_t Len = 0, C = 0; for (int64_t i = 0; i < n; i++) { C += a1[i].first; d += a1[i].second; int64_t idx = upper_bound(p2w.begin(), p2w.end(), d) - p2w.begin(); if (idx == 0) break; ans = max(ans, C + p2c[idx - 1]); } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, b; cin >> n >> b; if (n - b <= b) { cout << -1; } else { cout << b * n << n ; for (int i = 1; i <= n; i++) { for (int j = i + 1; j <= b + i; j++) { cout << i << ; if (j % n == 0) { cout << j << n ; } else { cout << j % n << n ; } } } } } |
#include <bits/stdc++.h> using namespace std; template <typename T> inline bool chkmin(T &x, T y) { return y < x ? x = y, 1 : 0; } template <typename T> inline bool chkmax(T &x, T y) { return x < y ? x = y, 1 : 0; } const int INF = 0x3f3f3f3f; const int N = 2e3 + 10, mod = 1e9 + 7; int dir[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}}; int vis[N][N]; char Map[N][N]; struct node { int x, y; } dis[N][N]; deque<node> Q; inline int read() { int x = 0, flag = 1; char ch = getchar(); while (!isdigit(ch) && ch != - ) ch = getchar(); if (ch == - ) flag = -1, ch = getchar(); while (isdigit(ch)) x = (x << 3) + (x << 1) + (ch - 0 ), ch = getchar(); return x * flag; } int main() { int n = read(), m = read(), X = read(), Y = read(), L = read(), R = read(); for (int i = (1), iend = (n); i <= iend; i++) scanf( %s , Map[i] + 1); int cnt = 1; Q.push_back((node){X, Y}), vis[X][Y] = true; while (!Q.empty()) { node cur = Q.front(); Q.pop_front(); int x = cur.x, y = cur.y; for (int i = (0), iend = (3); i <= iend; i++) { int Nx = x + dir[i][0], Ny = y + dir[i][1], curdL = dis[x][y].x, curdR = dis[x][y].y; if (Nx <= 0 || Ny <= 0 || Nx > n || Ny > m || vis[Nx][Ny] || Map[Nx][Ny] == * ) continue; if (i == 2) curdR++; if (i == 3) curdL++; if (curdL > L || curdR > R) continue; if (i == 2 || i == 3) Q.push_back((node){Nx, Ny}); else Q.push_front((node){Nx, Ny}); dis[Nx][Ny] = (node){curdL, curdR}; vis[Nx][Ny] = true, cnt++; } } printf( %d n , cnt); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 100010; long long int tmp = 85; long long int a[MAXN], b[MAXN], ind[MAXN]; vector<long long int> o; long long int n, d, x; long long int getNextX() { x = (x * 37 + 10007) % 1000000007; return x; } int main() { cin >> n >> d >> x; for (long long int i = 0; i < n; i = i + 1) { a[i] = i + 1; } for (long long int i = 0; i < n; i = i + 1) { swap(a[i], a[getNextX() % (i + 1)]); } for (long long int i = 0; i < n; i = i + 1) { if (i < d) b[i] = 1; else b[i] = 0; } for (int i = 0; i < n; i = i + 1) { swap(b[i], b[getNextX() % (i + 1)]); } for (int i = 0; i < n; i++) { ind[a[i]] = i; } for (int i = 0; i < n; i++) { if (b[i] == 1) { o.push_back(i); } } for (int i = 0; i < n; i++) { long long int cur = n; bool check = false; while (cur >= 0 and cur >= n - tmp) { if (ind[cur] <= i and b[i - ind[cur]] == 1) { cout << cur << endl; check = true; break; } cur--; } if (check == true) { continue; } long long int cur_ans = 0; for (int j = 0; j < o.size(); j++) { if (o[j] <= i) { cur_ans = max(cur_ans, a[i - o[j]]); } } cout << cur_ans << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int a = 1; for (int i = 1; i < s.size(); i++) { if (s[i] == 1 ) { a += 10; } else { a += s[i] - 0 ; } } cout << a << n ; } |
#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); string s; cin >> s; long long i; bool flag = true; for (i = 0; i < s.length(); i++) { if (s[i] == 0 ) { s.erase(i, 1); flag = false; break; } } if (flag) { s.erase(s.begin()); } cout << s << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 998244353; int add(int x, int y) { x += y; while (x >= MOD) x -= MOD; while (x < 0) x += MOD; return x; } int mul(int x, int y) { return (x * 1ll * y) % MOD; } int power(int n, int m, int p) { int res = 1; while (m > 0) { if (m & 1) res = (res * 1ll * n) % p; n = (n * 1ll * n) % p; m /= 2; } return res; } int solve() { int n; cin >> n; int d = power(100, MOD - 2, MOD); vector<int> arr(n), p(n), q(n); for (int i = 0; i < n; i++) { cin >> arr[i]; p[i] = mul(arr[i], d); q[i] = mul(100 - arr[i], d); } int cur = 1, res = 0, x = 0; for (int i = 0; i < n; i++) { int tmp = mul(cur, p[i]), tmq = mul(cur, q[i]); res = add(res, add(tmp, tmq)); x = add(x, tmq); cur = tmp; } res = mul(res, power(add(1, -x), MOD - 2, MOD)); return res; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cout << solve() << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; void itval(istream_iterator<string> it) {} template <typename T, typename... Args> void itval(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << endl; itval(++it, args...); } const long long int MOD = 1e9 + 7; template <typename T> inline void print(T x) { cout << x << n ; } template <typename T> inline void printvec(T x) { for (auto a : x) cout << a << ; cout << n ; } struct custom { bool operator()(const pair<long long int, long long int> &p1, const pair<long long int, long long int> &p2) const { return p1.first < p2.first; } }; long long int get_pow(long long int a, long long int b, long long int M = MOD) { long long int res = 1; while (b) { if (b & 1) res = (res * a) % M; a = (a * a) % M; b >>= 1; } return res; } const long long int N = 2e5 + 5, inf = 4e18, M = 302; void solve() { long long int c, p, q, a, b; cin >> c >> p >> q >> a >> b; long long int x = c / a; long long int ans = 0; for (long long int i = (long long int)max(0ll, x - 10000); i < (long long int)(x + 10000); i++) { if (i * a <= c) { ans = max(ans, i * p + ((c - i * a) / b) * q); } else break; } long long int y = c / b; for (long long int i = (long long int)max(0ll, y - 10000); i < (long long int)(y + 10000); i++) { if (i * b <= c) { ans = max(ans, i * q + ((c - i * b) / a) * p); } else break; } if (p * b == q * a) { long long int x = c / a / 2; for (long long int i = (long long int)max(0ll, x - 10000); i < (long long int)(x + 10000); i++) { if (i * a <= c) { ans = max(ans, i * p + ((c - i * a) / b) * q); } else break; } long long int y = c / b / 2; for (long long int i = (long long int)max(0ll, y - 10000); i < (long long int)(y + 10000); i++) { if (i * b <= c) { ans = max(ans, i * q + ((c - i * b) / a) * p); } else break; } } cout << ans << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int test = 1; clock_t z = clock(); for (long long int tes = (long long int)0; tes < (long long int)(test); tes++) { solve(); } fprintf(stderr, Total Time:%.4f n , (double)(clock() - z) / CLOCKS_PER_SEC), fflush(stderr); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INFL = 1LL << 60; const long long INF = 1 << 30; long long MOD = 1000000007; vector<long long> dy = {0, 1, 0, -1, 1, 1, -1, -1, 0}; vector<long long> dx = {1, 0, -1, 0, 1, -1, 1, -1, 0}; void pres(double A, long long x = 10) { cout << fixed << setprecision(x) << A << endl; } void BinarySay(long long x, long long y = 60) { for (long long i = 0; i < (y); i++) cout << (x >> (y - 1 - i) & 1); cout << endl; } long long cnt_bit(long long x) { return __builtin_popcountll(x); } long long pow_long(long long x, long long k) { long long res = 1; while (k > 0) { if (k % 2) res *= x; x *= x; k /= 2; } return res; } long long pow_mod(long long x, long long k) { long long res = 1; while (k > 0) { if (k % 2) { res *= x; res %= MOD; } x *= x; x %= MOD; k /= 2; } return res; } long long inverse(long long x) { return pow_mod(x, MOD - 2); }; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }; vector<long long> Row[100010]; vector<long long> Col[100010]; void solve() { long long N, M, K; cin >> N >> M >> K; for (long long i = 0; i < (K); i++) { long long a, b; cin >> a >> b; Row[a].push_back(b); Col[b].push_back(a); } for (long long i = 0; i <= M + 1; i++) { Row[0].push_back(i); Col[i].push_back(0); Row[N + 1].push_back(i); Col[i].push_back(N + 1); } for (long long i = 0; i <= N + 1; i++) { Col[0].push_back(i); Row[i].push_back(0); Col[M + 1].push_back(i); Row[i].push_back(M + 1); } for (long long i = 0; i < (N + 1); i++) { sort(Row[i].begin(), Row[i].end()); Row[i].erase(unique(Row[i].begin(), Row[i].end()), Row[i].end()); } for (long long i = 0; i < (M + 1); i++) { sort(Col[i].begin(), Col[i].end()); Col[i].erase(unique(Col[i].begin(), Col[i].end()), Col[i].end()); } long long Cnt = 0; for (long long i = 1; i <= N; i++) { long long x = *lower_bound(Row[i].begin(), Row[i].end(), 1); if (x == 1) break; Cnt++; } if (Cnt == N * M - K) { cout << Yes << endl; return; } long long y = 1, x = 1; long long dir = 1; long long cnt = 1; long long L = 0, R = M + 1, U = 1, D = N + 1; while (true) { long long dif = -cnt; if (dir == 1) { long long nx = *lower_bound(Row[y].begin(), Row[y].end(), x); nx = min(nx - 1, R - 1); cnt += nx - x; x = nx; R = x; } if (dir == 2) { long long ny = *lower_bound(Col[x].begin(), Col[x].end(), y); ny = min(ny - 1, D - 1); cnt += ny - y; y = ny; D = y; } if (dir == 3) { auto itr = lower_bound(Row[y].begin(), Row[y].end(), x); itr--; long long nx = *itr; nx = max(nx + 1, L + 1); cnt += x - nx; x = nx; L = x; } if (dir == 4) { auto itr = lower_bound(Col[x].begin(), Col[x].end(), y); itr--; long long ny = *itr; ny = max(ny + 1, U + 1); cnt += y - ny; y = ny; U = y; } dif += cnt; if (dif == 0) break; dir++; if (dir == 5) dir = 1; } if (cnt == N * M - K) { cout << Yes << endl; } else { cout << No << endl; } } int main() { cin.tie(0); ios::sync_with_stdio(false); solve(); } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int n, x, m, tmp, ans, sum, t; int a[N], b[N], h[N]; string s, p; map<string, int> pol; vector<int> nei[N]; bool mark[N]; void read_input() { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; if (a[i] > 1 && tmp == 0) tmp = i; sum += a[i]; } if (sum == n) { cout << (n % 2 ? First n : Second n ); return; } cout << (tmp % 2 ? First n : Second n ); } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> t; while (t--) { sum = 0; tmp = 0; read_input(); } return 0; } |
#include <bits/stdc++.h> using pi = std::pair<int, int>; using vec = std::vector<pi>; const int N = 300007, P = 1019260817; char str[N]; int n, fa[N], size[N], dep[N], son[N], top[N], dfn[N], id[N], pw[N], ipw[N], h[N][2]; std::vector<int> e[N]; int sgn(int x) { return x < 0 ? -1 : 1; } int sub(int a, int b) { return a -= b, a += a >> 31 & P; } int mul(int a, int b) { return 1ll * a * b % P; } int read() { int x = 0, c = getchar(); while (!isdigit(c)) c = getchar(); while (isdigit(c)) (x *= 10) += c & 15, c = getchar(); return x; } void dfs1(int u, int f) { size[u] = 1, dep[u] = dep[fa[u] = f] + 1, h[u][0] = (str[u] + 233ll * h[f][0]) % P, h[u][1] = (h[f][1] + 1ll * str[u] * pw[dep[u] - 1]) % P; for (int v : e[u]) if (v ^ f) dfs1(v, u), size[u] += size[v], son[u] = size[v] > size[son[u]] ? v : son[u]; } void dfs2(int u, int t) { static int T; top[u] = t, id[dfn[u] = ++T] = u; if (son[u]) dfs2(son[u], t); for (int v : e[u]) if (v ^ fa[u] && v ^ son[u]) dfs2(v, v); } vec split(int u, int v) { vec l, r; while (top[u] ^ top[v]) dep[top[u]] > dep[top[v]] ? (l.push_back({u, top[u]}), u = fa[top[u]]) : (r.push_back({top[v], v}), v = fa[top[v]]); l.push_back({u, v}), std::reverse(r.begin(), r.end()), l.insert(l.end(), r.begin(), r.end()); return l; } int ask(int x, int fx, int d) { return fx == 1 ? mul(sub(h[x][1], h[fa[id[dfn[x] - d + 1]]][1]), ipw[dep[x] - d]) : sub(h[id[dfn[x] + d - 1]][0], mul(h[fa[x]][0], pw[d])); } int cal(int u, int fu, int v, int fv, int lim) { if (ask(u, fu, lim) == ask(v, fv, lim)) return lim; int l = 1, r = lim - 1; for (int mid; l <= r;) mid = (l + r) / 2, ask(u, fu, mid) == ask(v, fv, mid) ? l = mid + 1 : r = mid - 1; return r; } void solve() { int a = read(), b = read(), c = read(), d = read(), ans = 0; vec l = split(a, b), r = split(c, d); for (int pl = 0, pr = 0, l1, l2, f1, f2, d, x; pl < (int)l.size() && pr < (int)r.size();) { l1 = abs(dep[l[pl].first] - dep[l[pl].second]) + 1, l2 = abs(dep[r[pr].first] - dep[r[pr].second]) + 1, f1 = sgn(dep[l[pl].first] - dep[l[pl].second]), f2 = sgn(dep[r[pr].first] - dep[r[pr].second]), d = std::min(l1, l2); ans += x = cal(l[pl].first, f1, r[pr].first, f2, d); if (d ^ x) break; (l1 == d ? ++pl : l[pl].first = id[dfn[l[pl].first] - f1 * d]), (l2 == d ? ++pr : r[pr].first = id[dfn[r[pr].first] - f2 * d]); } printf( %d n , ans); } int main() { n = read(), scanf( %s , str + 1), pw[0] = ipw[0] = 1; for (int i = 1; i <= n; ++i) pw[i] = mul(233, pw[i - 1]), ipw[i] = mul(78741179, ipw[i - 1]); for (int i = 1, u, v; i < n; ++i) u = read(), v = read(), e[u].push_back(v), e[v].push_back(u); dfs1(1, 0), dfs2(1, 1); for (int m = read(); m; --m) solve(); } |
#include <bits/stdc++.h> using namespace std; default_random_engine generator; uniform_int_distribution<int> distribution(1, INT_MAX); vector<vector<long long> > one(int sz) { vector<vector<long long> > ret; ret.resize(sz); for (int i = 0; i < ret.size(); i++) { ret[i].resize(sz); for (int j = 0; j < ret.size(); j++) { ret[i][j] = (i == j); } } return ret; } vector<vector<long long> > mult(vector<vector<long long> > a, vector<vector<long long> > b) { vector<vector<long long> > ret; ret.resize(a.size()); for (int i = 0; i < ret.size(); i++) { ret[i].resize(a.size()); for (int j = 0; j < ret.size(); j++) { ret[i][j] = 0; } } for (int k = 0; k < ret.size(); k++) { for (int i = 0; i < a.size(); i++) { for (int j = 0; j < b.size(); j++) { ret[i][j] = (ret[i][j] + a[i][k] * b[k][j]); ret[i][j] %= 998244353; } } } return ret; } vector<vector<long long> > pw(vector<vector<long long> > a, long long b) { if (b == 0) return one((int)a.size()); if (b % 2) return mult(a, pw(a, b - 1)); return pw(mult(a, a), b / 2); } long long my_rand(long long a = 0, long long b = INT_MAX) { return a + distribution(generator) % b; } inline int mul(int a, int b) { return int(a * 1ll * b % 998244353); } inline int norm(int a) { if (a >= 998244353) a -= 998244353; if (a < 0) a += 998244353; return a; } inline int binPow(int a, int k) { int ans = 1; while (k > 0) { if (k & 1) ans = mul(ans, a); a = mul(a, a); k >>= 1; } return ans; } inline int subtract(int a, int b) { return norm(a - b); } inline int inv(int a) { return binPow(a, 998244353 - 2); } long long ceil_int(long long a, long long b) { return a / b + (a % b != 0); } long long gcd(long long a, long long b) { if (a == 0) return b; return gcd(b % a, a); } long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); } int main() { generator.seed(chrono::system_clock::now().time_since_epoch().count()); cin.sync_with_stdio(false); cin.tie(0); int x; cin >> x; int cnt = 0; vector<int> op; int ok = 0; do { int k = x; int pos = -1; int j = 0; while (k > 0) { if ((k & 1) == 0) { pos = j; } j++; k >>= 1; } if (pos == -1) break; else if (cnt % 2 == 0) op.push_back(pos + 1); if (cnt % 2 == 0) { x = x ^ ((1 << (pos + 1)) - 1); } else { x++; } cnt++; } while (1); cout << cnt << endl; for (int i = 0; i < op.size(); i++) { cout << op[i] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( O3 ) #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( Ofast,unroll-loops,no-stack-protector,fast-math ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) const long long mod = 1e9 + 7; const long long N = 1e5 + 5; void solve(void) { long long a, flag = 0; string b; cin >> a >> b; long long n = b.length(); for (long long i = 0; i < n; i++) { if (b[i] != 9 ) { flag = 1; break; } } n -= flag; cout << n * a << n ; } int main(void) { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout << fixed << setprecision(10); ; long long ___ = 1; cin >> ___; while (___--) { solve(); } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize(3, Ofast , inline ) #pragma GCC target( avx,avx2 ) using namespace std; template <class t> inline t read(t &x) { char c = getchar(); bool f = 0; x = 0; while (!isdigit(c)) f |= c == - , c = getchar(); while (isdigit(c)) x = (x << 1) + (x << 3) + (c ^ 48), c = getchar(); if (f) x = -x; return x; } template <class t> inline void write(t x) { if (x < 0) putchar( - ), write(-x); else { if (x > 9) write(x / 10); putchar( 0 + x % 10); } } const int mod = 1e9, N = 2e5 + 5; int tr0[N << 2], tr1[N << 2], tg[N << 2], n, m, f[N], sum[N]; int trans(int x, int len) { if (!len) return tr0[x]; if (len == 1) return tr1[x]; return (1ll * tr0[x] * f[len - 2] + 1ll * tr1[x] * f[len - 1]) % mod; } void pushup(int x, int l, int r) { int mid = l + r >> 1; tr0[x] = tr0[x << 1] + trans(x << 1 | 1, mid - l + 1); if (tr0[x] > mod) tr0[x] -= mod; tr1[x] = tr1[x << 1] + trans(x << 1 | 1, mid - l + 2); if (tr1[x] > mod) tr1[x] -= mod; } void build(int x, int l, int r) { if (l == r) { tr0[x] = read(tr1[x]); return; } int mid = l + r >> 1; build(x << 1, l, mid); build(x << 1 | 1, mid + 1, r); pushup(x, l, r); } void add(int x, int len, int v) { tg[x] += v; if (tg[x] > mod) tg[x] -= mod; tr0[x] = (tr0[x] + 1ll * sum[len - 1] * v) % mod; tr1[x] = (tr1[x] + 1ll * (sum[len] - 1 + mod) * v) % mod; } void pushdown(int x, int l, int r) { if (!tg[x]) return; int mid = l + r >> 1; add(x << 1, mid - l + 1, tg[x]); add(x << 1 | 1, r - mid, tg[x]); tg[x] = 0; } void mfy(int x, int l, int r, int p, int v) { if (l == r) { tr0[x] = tr1[x] = v; return; } pushdown(x, l, r); int mid = l + r >> 1; if (p <= mid) mfy(x << 1, l, mid, p, v); else mfy(x << 1 | 1, mid + 1, r, p, v); pushup(x, l, r); } void up(int x, int l, int r, int p, int q, int v) { if (p <= l && r <= q) { add(x, r - l + 1, v); return; } pushdown(x, l, r); int mid = l + r >> 1; if (p <= mid) up(x << 1, l, mid, p, q, v); if (q > mid) up(x << 1 | 1, mid + 1, r, p, q, v); pushup(x, l, r); } int que(int x, int l, int r, int p, int q) { if (p <= l && r <= q) return trans(x, l - p); pushdown(x, l, r); int mid = l + r >> 1, res = 0; if (p <= mid) res += que(x << 1, l, mid, p, q); if (q > mid) res += que(x << 1 | 1, mid + 1, r, p, q); if (res > mod) res -= mod; return res; } signed main() { read(n); read(m); f[0] = f[1] = 1; sum[0] = 1; sum[1] = 2; for (int i = 2; i <= n; i++) { f[i] = f[i - 1] + f[i - 2]; if (f[i] > mod) f[i] -= mod; sum[i] = sum[i - 1] + f[i]; if (sum[i] > mod) sum[i] -= mod; } build(1, 1, n); while (m--) { int op; read(op); if (op == 1) { int p, v; read(p); read(v); mfy(1, 1, n, p, v); } if (op == 2) { int l, r; read(l); read(r); write(que(1, 1, n, l, r)); puts( ); } if (op == 3) { int l, r, v; read(l); read(r); read(v); up(1, 1, n, l, r, v); } } } |
#include <bits/stdc++.h> using namespace std; int now, ot, mi, last, cnt, le, d[10010], st[10010][15], len[10010], ans[10010], trs[10010][26], fa[10010], tot[10010], lev[10010]; char s[10010]; inline int ext(int x) { for (now = last; s[le - len[now]] ^ x; now = fa[now]) ; if (trs[now][x]) return last = trs[now][x]; for (ot = fa[now]; s[le - len[ot]] ^ x; ot = fa[ot]) ; ++d[fa[++cnt] = trs[ot][x]]; len[trs[now][x] = cnt] = len[now] + 2; return last = cnt; } inline void topo() { int dl[10010], l = 0, r = 0; for (int i = 0; i <= cnt; ++i) if (!d[i]) dl[++r] = i; while (l < r) { int v = fa[dl[++l]]; tot[v] += tot[dl[l]]; if (!--d[v]) dl[++r] = v; } } int main() { len[last = cnt = 1] = -1; fa[1] = fa[0] = 1; for (s[le + 1] = getchar(); s[le + 1] != n ; s[++le + 1] = getchar()) { ext(s[le + 1] -= a - 1); ++tot[last]; if (!lev[last]) { st[last][0] = fa[last]; for (int i = 1; i <= 13; ++i) st[st[last][i - 1]][i - 1]; if (len[last] == 1) lev[last] = 1; else { for (mi = 13, now = last; mi >= 0;) { while (mi >= 0 && len[st[now][mi]] < len[last] >> 1) --mi; if (mi >= 0) now = st[now][mi]; } if (len[now] == len[last] >> 1) lev[last] = lev[now] + 1; else lev[last] = 1; } } } topo(); for (int i = 2; i <= cnt; ++i) ans[lev[i]] += tot[i]; for (int i = le; i; --i) ans[i - 1] += ans[i]; for (int i = 1; i <= le; ++i) printf( %d , ans[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long n; cin >> n; long count1 = 0, count2 = 0; int f = 0; while (n != 1) { if (n % 3 == 0) { n = n / 3; count1++; } if (n % 2 == 0) { n = n / 2; count2++; } if (n % 3 != 0 and n % 2 != 0 and n != 1) { f = 1; break; } } if (f == 1) cout << -1 << endl; else if (count1 >= count2 and f == 0) { long ans = count1 - count2; if (count1 - count2 != 0) ans += count1; else ans = count1; cout << ans << endl; } else cout << -1 << endl; } } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 100000 + 10; struct Edge { int v; bool used; Edge(int v, int used) : v(v), used(used) {} }; vector<int> adj[MAXN], odd, ans; vector<Edge> edges; int p, n, m, deg[MAXN]; int cur[MAXN]; void dfs(int u) { for (auto &idx = cur[u]; idx < adj[u].size(); ++idx) { if (!edges[adj[u][idx]].used) { edges[adj[u][idx]].used = 1; edges[adj[u][idx] ^ 1].used = 1; dfs(edges[adj[u][idx]].v); } } ans.push_back(u); } int main() { cin >> n >> m; for (int i = 0; i < m; ++i) { int u, v; cin >> u >> v; ++deg[u], ++deg[v]; edges.emplace_back(v, 0); edges.emplace_back(u, 0); int sz = edges.size(); adj[u].push_back(sz - 2); adj[v].push_back(sz - 1); } for (int i = (1); i < (n + 1); ++i) if (deg[i] & 1) { odd.push_back(i); } for (int i = 0; i < (int)odd.size(); i += 2) { int u = odd[i], v = odd[i + 1]; edges.emplace_back(v, 0); edges.emplace_back(u, 0); int sz = edges.size(); adj[u].push_back(sz - 2); adj[v].push_back(sz - 1); } p = m + (odd.size() / 2); dfs(1); if (ans.size() % 2 == 0) { ++p; ans.push_back(1); } cout << p << n ; for (int i = 1; i < (int)ans.size(); ++i) { int u = ans[i - 1], v = ans[i]; if (!(i & 1)) { swap(u, v); } cout << u << << v << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long double PI = acos(-1.0); const long double eps = 1e-6; const int maxw = 1e6 + 10; const int maxn = 5e2 + 10; int n, m, K; char s[maxn][maxn]; vector<int> res[maxn]; int num[maxn][maxn], dp[maxn][maxn]; void solve() { for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (s[i][j] == 1 ) { res[i].push_back(j); } } } int ret, tmp; for (int i = 1; i <= n; i++) { if (res[i].empty()) { for (int j = 0; j <= K; j++) { num[i][j] = 0; } continue; } for (int j = 0; j <= m; j++) { num[i][j] = maxw; } for (int j = 0; j < (int)res[i].size(); j++) { for (int k = j; k < (int)res[i].size(); k++) { ret = (int)res[i].size() - (k - j + 1); num[i][ret] = min(num[i][ret], res[i][k] - res[i][j] + 1); } } num[i][(int)res[i].size()] = 0; } for (int i = 0; i <= n; i++) { for (int j = 0; j <= K; j++) { dp[i][j] = maxw; } } memset(dp[0], 0, sizeof(dp[0])); for (int i = 1; i <= n; i++) { for (int j = K; j >= 0; j--) { for (int k = 0; k <= j; k++) { dp[i][j] = min(dp[i][j], dp[i - 1][j - k] + num[i][k]); } } } printf( %d n , dp[n][K]); } int main(void) { scanf( %d %d %d , &n, &m, &K); for (int i = 1; i <= n; i++) { scanf( %s , s[i] + 1); } solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long t, x, y, n; int main() { cin.tie(NULL); ios::sync_with_stdio(false); cin >> t; while (t--) { cin >> n >> x >> y; vector<int> ans; int number = y - x; for (int i = 1; i <= number; i++) { if (number % i) continue; if (number / i + 1 > n) continue; number = i; break; } for (int i = y; i >= 1 && ans.size() < n; i -= number) ans.push_back(i); for (int i = y + number; i <= (int)1e9 && ans.size() < n; i += number) ans.push_back(i); for (auto here : ans) cout << here << ; cout << n ; } } |
#include <bits/stdc++.h> const int dx[4] = {1, 0, -1, 0}; const int dy[4] = {0, -1, 0, 1}; using namespace std; char str[5001]; class Point { public: int Left; int Right; int Up; int Down; }; Point f1[5001], f2[5001]; int ans1, ans2, n, m; int dfs(int p, int tot) { int tmp; if (str[p] == D ) tmp = f2[p].Down; else if (str[p] == U ) tmp = f2[p].Up; else if (str[p] == L ) tmp = f2[p].Left; else tmp = f2[p].Right; if (f2[p].Left != -1) f2[f2[p].Left].Right = f2[p].Right; if (f2[p].Right != -1) f2[f2[p].Right].Left = f2[p].Left; if (f2[p].Up != -1) f2[f2[p].Up].Down = f2[p].Down; if (f2[p].Down != -1) f2[f2[p].Down].Up = f2[p].Up; if (ans1 == tot) ans2++; if (ans1 < tot) { ans1 = tot; ans2 = 1; } if (tmp != -1) dfs(tmp, tot + 1); return 0; } int work() { scanf( %d%d , &n, &m); getchar(); for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) str[i * m + j] = getchar(); getchar(); } memset(f1, -1, sizeof(f1)); memset(f2, -1, sizeof(f2)); int k; for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) { int p = i * m + j; if (str[p] == . ) continue; { k = i + 1; while (str[k * m + j] == . && k < n) k++; if (k < n) { f1[p].Down = k * m + j; f1[k * m + j].Up = p; } } { k = i - 1; while (str[k * m + j] == . && k >= 0) k--; if (k >= 0) { f1[p].Up = k * m + j; f1[k * m + j].Down = p; } } { k = j - 1; while (str[i * m + k] == . && k >= 0) k--; if (k >= 0) { f1[p].Left = i * m + k; f1[i * m + k].Right = p; } } { k = j + 1; while (str[i * m + k] == . && k < m) k++; if (k < m) { f1[p].Right = i * m + k; f1[i * m + k].Left = p; } } } ans1 = ans2 = 0; for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) if (str[i * m + j] != . ) { for (int k = 0; k < 5001; ++k) f2[k] = f1[k]; dfs(i * m + j, 1); } printf( %d %d n , ans1, ans2); return 0; } int main() { work(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n == 2) { cout << 1 2 << endl; return 0; } bool usedN = false; for (int i = 0; i < n; i++) { int maxi = 0; for (int j = 0; j < n; j++) { int a; cin >> a; if (a > maxi) { maxi = a; } } if (maxi == n - 1 && !usedN) { usedN = true; maxi = n; } cout << maxi << ; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; int a[3003]; double f[3003 * 3003]; int main() { int n; scanf( %d , &n); for (int i = 1; i < n + 1; i++) scanf( %d , &a[i]); int cnt = 0; for (int i = 1; i < n + 1; i++) { for (int j = i + 1; j < n + 1; j++) { if (a[i] > a[j]) cnt++; } } f[0] = 0; f[1] = 1; for (int i = 2; i < cnt + 1; i++) f[i] = f[i - 2] + 4; printf( %.6f , f[cnt]); return 0; } |
#include <bits/stdc++.h> using namespace std; class DSU { public: vector<int> parent; int total_components; DSU(int n) { parent.resize(n + 1); for (int i = 1; i <= n; i++) { parent[i] = i; } total_components = n; } int get(int x) { if (parent[x] == x) { return x; } return parent[x] = get(parent[x]); } bool unite(int x, int y) { int p1 = get(x); int p2 = get(y); if (p1 == p2) { return true; } parent[p1] = p2; total_components--; return false; } }; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n, m; cin >> n >> m; bool cycle = false; DSU g(n); while (m--) { int u, v; cin >> u >> v; if (g.unite(u, v)) { cycle = true; } } if (cycle || g.total_components > 1) { cout << no << endl; } else { cout << yes << endl; } cout.flush(); return 0; } |
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); const int N = 10003; const long long oo = 1e18; int get(int x, int l, int r) { if (x <= l) return l - x; if (r <= x) return x - r; return 0; } int l[N], r[N], zn[N]; long long d1[N], d2[N]; vector<int> st; map<int, int> mp; int main() { if (0) { freopen( input.txt , w , stdout); return 0; } int i, u, n, m, x, li, ri, xp; long long tt, ans; scanf( %d%d , &n, &x); st.push_back(x); for (i = 0; i < n; ++i) { scanf( %d%d , &li, &ri); l[i] = li; r[i] = ri; st.push_back(li); st.push_back(ri); } sort(st.begin(), st.end()); m = 0; for (i = 0; i < st.size(); ++i) if ((i + 1 == st.size()) || (st[i] != st[i + 1])) { zn[m] = st[i]; mp[st[i]] = m++; } xp = mp[x]; for (i = 0; i < m; ++i) d1[i] = oo; d1[xp] = 0; for (u = 0; u < n; ++u) { for (i = 0; i < m; ++i) d2[i] = oo; li = l[u]; ri = r[u]; tt = oo; for (i = 0; i < m; ++i) { if (i) tt += zn[i] - zn[i - 1]; tt = min(tt, d1[i]); if (tt >= oo) { tt = oo; continue; } d2[i] = min(d2[i], tt + get(zn[i], li, ri)); } tt = oo; for (i = m - 1; i >= 0; --i) { if (i != m - 1) tt += zn[i + 1] - zn[i]; tt = min(tt, d1[i]); if (tt >= oo) { tt = oo; continue; } d2[i] = min(d2[i], tt + get(zn[i], li, ri)); } for (i = 0; i < m; ++i) d1[i] = d2[i]; } ans = oo; for (i = 0; i < m; ++i) ans = min(ans, d1[i]); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long int pows[51]; vector<int> base_3(long long int n) { vector<int> f(51); int r = 0; while (n > 0) { f[r++] = (int)n % 3; n /= 3; } return f; } int main() { int q; cin >> q; pows[1] = 3; pows[0] = 1; for (int i = 1; i <= 50; i++) { pows[i] = pows[i - 1] * 3; } while (q--) { long long int n; cin >> n; vector<int> v = base_3(n); int ind = -1; for (int j = 50; j >= 0; j--) { if (v[j] == 2 && ind == -1) { ind = j; } } if (ind == -1) { cout << n << n ; } else { int r = ind + 1; while (r < 50 && v[r] == 1) { r++; } v[r] = 1; for (int i = 0; i < r; i++) { v[i] = 0; } long long int ans = 0; for (int j = 0; j < 51; j++) { ans += v[j] * pows[j]; } cout << ans << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int qq = 3e5 + 10; vector<int> G[qq]; multiset<int, greater<int> > myset; int num[qq]; void Del(int x) { auto t = myset.find(x); myset.erase(t); } int main() { int ans = 2e9 + 10; int n; scanf( %d , &n); int a, b; for (int i = 1; i <= n; ++i) { scanf( %d , num + i); myset.insert(num[i]); } for (int i = 1; i <= n - 1; ++i) { scanf( %d%d , &a, &b); G[a].push_back(b), G[b].push_back(a); } for (int i = 1; i <= n; ++i) { Del(num[i]); int ma = num[i]; for (int y : G[i]) { Del(num[y]); ma = max(ma, num[y] + 1); } if (!myset.empty()) { ma = max(ma, *myset.begin() + 2); } for (int y : G[i]) { myset.insert(num[y]); } myset.insert(num[i]); ans = min(ans, ma); } printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; void debug_out() { cerr << endl; } template <class T> ostream& prnt(ostream& out, T v) { out << v.size() << n ; for (auto e : v) out << e << ; return out; } template <class T> ostream& operator<<(ostream& out, vector<T> v) { return prnt(out, v); } template <class T> ostream& operator<<(ostream& out, set<T> v) { return prnt(out, v); } template <class T1, class T2> ostream& operator<<(ostream& out, map<T1, T2> v) { return prnt(out, v); } template <class T1, class T2> ostream& operator<<(ostream& out, pair<T1, T2> p) { return out << ( << p.first << << p.second << ) ; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << << H; debug_out(T...); } const long double PI = acos(-1); int n, m, c, st[2 * 20005], dr[2 * 20005], a, b; bool uz[20005]; vector<int> v[2 * 20005]; bool cup(int nod) { uz[nod] = 1; for (auto it : v[nod]) { if (!dr[it]) { dr[it] = nod; st[nod] = it; return 1; } } for (auto it : v[nod]) { if (!uz[dr[it]] && cup(dr[it])) { dr[it] = nod; st[nod] = it; return 1; } } return 0; } struct edge { int a, b, c; }; vector<edge> E2; int _try(int x) { for (int i = 0; i <= 2 * n + 1; i++) { v[i].clear(); } memset(st, 0, sizeof(st)); memset(dr, 0, sizeof(dr)); for (auto it : E2) { if (it.c > x) continue; v[it.a].push_back(it.b); v[it.b].push_back(it.a); } int ok = 1; while (ok) { ok = 0; memset(uz, 0, sizeof(uz)); for (int i = 1; i <= n; i++) if (!st[i] && !uz[i]) ok |= cup(i); } int nr = 0; for (int i = 1; i <= n; i++) if (st[i]) nr++; return nr == n; } int main() { ios::sync_with_stdio(false); cin >> n >> m; for (long long i = 1; i <= m; i++) { int p, q, c; cin >> p >> q >> c; q += n; E2.push_back({p, q, c}); } int p = 1, st = 0; for (; p <= 1e9; p <<= 1) ; for (; p >= 1; p >>= 1) { if (st + p < 1e9 && !_try(st + p)) { st += p; } } st++; if (!_try(st)) { cout << -1 n ; } else cout << st << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int a[10][5]; int ulx, uly, drx, dry; bool isd(int x, int y) { return x <= drx && x >= ulx && y <= dry && y >= uly; } bool vis[210]; int numtot; int pos; int len; int abs(int x) { return x < 0 ? -x : x; } bool isd2(int x, int y) { return abs(x - a[pos][2]) + abs(y - a[pos + 1][2] + len) <= len; } bool crss(int a, int b, int c, int d, int e, int f, int g, int h) { if (a > c) swap(a, c); if (b > d) swap(b, d); if (e > g) swap(e, g), swap(f, h); if (b == d) { if (h > f) return b >= f && b <= h && e + b - f >= a && e + b - f <= c; return b >= h && b <= f && e + f - b >= a && e + f - b <= c; } if (h > f) return a >= e && a <= g && f + a - e >= b && f + a - e <= d; return a >= e && a <= g && f + e - a >= b && f + e - a <= d; } int main() { int tmp = -0x7fffffff; for (int k = 1; k <= 2; k++) for (int i = 1; i <= 8; i++) scanf( %d , &a[i][k]); for (int i = 1; i <= 8; i += 2) if (!vis[a[i][1] + 101]) numtot++, vis[a[i][1] + 101] = true; if (numtot > 2) for (int i = 1; i <= 8; i++) swap(a[i][1], a[i][2]); ulx = min(a[1][1], a[5][1]); uly = min(a[2][1], a[6][1]); drx = max(a[1][1], a[5][1]); dry = max(a[2][1], a[6][1]); if (isd(a[1][2], a[2][2]) && isd(a[3][2], a[4][2]) && isd(a[5][2], a[6][2]) && isd(a[7][2], a[8][2])) return puts( yes ), 0; for (int i = 2; i <= 8; i += 2) if (a[i][2] > tmp) tmp = a[i][2], pos = i - 1; len = abs(a[pos - 2 < 1 ? pos - 2 + 8 : pos - 2][2] - a[pos + 2 > 8 ? pos + 2 - 8 : pos + 2][2]) / 2; if (isd2(a[1][1], a[2][1]) && isd2(a[3][1], a[4][1]) && isd2(a[5][1], a[6][1]) && isd2(a[7][1], a[8][1])) return puts( yes ), 0; for (int i = 1; i <= 4; i++) for (int j = 1; j <= 4; j++) if (crss(a[i * 2 - 1][1], a[i * 2][1], a[(i + 1 == 5 ? 1 : i + 1) * 2 - 1][1], a[(i + 1 == 5 ? 1 : i + 1) * 2][1], a[j * 2 - 1][2], a[j * 2][2], a[(j + 1 == 5 ? 1 : j + 1) * 2 - 1][2], a[(j + 1 == 5 ? 1 : j + 1) * 2][2])) return puts( yes ), 0; return puts( no ), 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, S, T, du[10010]; struct edge { int u, v, cap, flow; edge() {} edge(int u, int v, int c, int f) : u(u), v(v), cap(c), flow(f) {} }; vector<edge> edges; vector<int> e[10010]; inline void add_edge(int u, int v, int c) { edges.push_back(edge(u, v, c, 0)); edges.push_back(edge(v, u, 0, 0)); int m = edges.size(); e[u].push_back(m - 2); e[v].push_back(m - 1); } int vis[10010], dis[10010], cur[10010]; bool bfs(int s, int t) { memset(vis, 0, sizeof(vis)); queue<int> que; que.push(s); vis[s] = 1; dis[s] = 0; while (!que.empty()) { int now = que.front(); que.pop(); for (int i = 0; i < (e[now].size()); i++) { edge& nxt = edges[e[now][i]]; if (!vis[nxt.v] && nxt.cap > nxt.flow) { vis[nxt.v] = 1; dis[nxt.v] = dis[now] + 1; que.push(nxt.v); } } } return vis[t]; } int dfs(int st, int t, int low) { if (st == t || low == 0) return low; int flow = 0, f; for (int& i = cur[st]; i < e[st].size(); i++) { edge& nxt = edges[e[st][i]]; if (dis[nxt.v] == dis[st] + 1 && (f = dfs(nxt.v, t, min(low, nxt.cap - nxt.flow))) > 0) { nxt.flow += f; edges[e[st][i] ^ 1].flow -= f; flow += f; low -= f; if (low == 0) break; } } return flow; } int Dinic(int s, int t) { int ans = 0; while (bfs(s, t)) { memset(cur, 0, sizeof(cur)); ans += dfs(s, t, 0x3f3f3f3f); } return ans; } pair<int, int> pp[10010]; bool check(int mid) { edges.clear(); for (int i = 0; i <= n + m + 1; i++) e[i].clear(); for (int i = 1; i <= m; i++) { add_edge(S, i, 1); add_edge(i, m + pp[i].first, 1); add_edge(i, m + pp[i].second, 1); } for (int i = 1; i <= n; i++) add_edge(m + i, T, min(du[i], mid)); int ans = Dinic(S, T); if (ans < m) return false; return true; } int main() { scanf( %d %d , &n, &m); S = 0, T = n + m + 1; for (int i = 1; i <= m; i++) { int u, v; scanf( %d %d , &u, &v); pp[i] = make_pair(u, v); du[u]++; du[v]++; } int L = 1, R = min(m, n - 1), ans = min(m, n - 1); while (L <= R) { int mid = (L + R) >> 1; if (check(mid)) { ans = mid; R = mid - 1; } else L = mid + 1; } printf( %d n , ans); check(ans); int tmp = 0; for (int i = 0; i < edges.size(); i += 2) { if (edges[i].u <= m && edges[i].u >= 1 && edges[i].v >= m + 1 && edges[i].v <= n + m && edges[i].cap == edges[i].flow) { int nxt = pp[edges[i].u].first; if (nxt == edges[i].v - m) nxt = pp[edges[i].u].second; printf( %d %d n , edges[i].v - m, nxt); } } } |
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); const int N = 1005; int n, m; int a[N], ans[N], pre[N]; int main() { int i, j, k, t, nc = 0; while (scanf( %d%d , &n, &m) != EOF) { int tmin = -1, tpre = -1; for (i = 1; i <= m; i++) { scanf( %d , &a[i]); if (tmin < a[i]) { k = i; tmin = a[i]; } } bool work = true; ans[1] = k; a[k]--; for (i = 1; i <= m; i++) pre[i] = N; pre[k] = 1; for (i = 2; i < n; i++) { tmin = -1; for (j = 1; j <= m; j++) { if (a[j] == 0 || j == ans[i - 1]) continue; if (tmin < a[j] || tmin == a[j] && pre[j] < tpre) { k = j; tmin = a[j]; tpre = pre[j]; } } if (tmin == N) break; ans[i] = k; a[k]--; pre[k] = i; } if (i < n) work = false; else { for (i = 1; i <= m; i++) { if (a[i] > 0 && i != ans[1] && i != ans[n - 1]) { ans[n] = i; break; } } if (i > m) work = false; } if (!work) printf( -1 n ); else { for (i = 1; i <= n; i++) { printf( %d , ans[i]); if (i < n) printf( ); else printf( n ); } } } return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; class FKuroniAndThePunishment { public: vector<long long> primes; void pre(int n) { vector<bool> isPrime(n + 1, true); isPrime[1] = false; isPrime[0] = false; for (int i = 2; i <= n; i++) { if (isPrime[i]) for (int j = 2 * i; j <= n; j += i) isPrime[j] = false; if (isPrime[i]) primes.push_back(i); } } void solve(std::istream &in, std::ostream &out) { int n; in >> n; vector<long long> ar(n); for (long long &i : ar) in >> i; long long mn = LLONG_MIN; for (long long i : ar) mn = max(mn, i); pre(1000000); int idx = primes.size(); for (long long i = max(1ll, mn - n); i <= mn + n; i++) primes.push_back(i); long long first = primes[idx]; for (int i = 0; i < idx; i++) { long long index = idx + (first % primes[i] == 0 ? 0 : primes[i] - (first % primes[i])); for (long long j = index; j < primes.size(); j += primes[i]) while (primes[j] % primes[i] == 0) primes[j] /= primes[i]; } long long ans = n; for (long long &i : primes) { if (i == 1) continue; long long res = 0; for (long long &j : ar) { if (j < i) res += (i - j); else res += min(j % i, (i - (j % i))); if (res >= ans) break; } ans = min(ans, res); } out << ans << n ; } }; int main() { FKuroniAndThePunishment solver; std::ios_base::sync_with_stdio(false); cin.tie(NULL); std::istream &in(std::cin); std::ostream &out(std::cout); solver.solve(in, out); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; int n, k, now, last; long long dp[2][505][505], sum[505], ans = 0, s; int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> n >> k; memset(dp[1], 0, sizeof dp[1]); dp[1][1][1] = 1; for (int i = 2; i <= n; i++) { now = i & 1; last = now ^ 1; memset(dp[now], 0, sizeof dp[now]); for (int j = 1; j < i; j++) { for (int k = 1; k < i; k++) { if (j != k) dp[now][j][k + 1] = (dp[now][j][k + 1] + dp[last][j][k]) % mod; else dp[now][j + 1][k + 1] = (dp[now][j + 1][k + 1] + dp[last][j][k]) % mod; dp[now][j][1] = (dp[now][j][1] + dp[last][j][k]) % mod; } } } memset(sum, 0, sizeof sum); for (int i = 1; i <= n; i++) for (int j = 1; j <= i; j++) sum[i] = (sum[i] + dp[now][i][j]) % mod; s = 0; for (int i = 1; i <= n; i++) s = (s + sum[i]) % mod; int t = n; for (int i = 1; i <= n; i++) { while (t * i >= k) { s = (s - sum[t] + mod) % mod; t--; } ans = (ans + sum[i] * s % mod) % mod; } ans = ans * 2 % mod; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; bool poss = true; int n, rt = 0; vector<int> v, res; vector<vector<int>> adj; vector<pair<int, int>> dfs(int second, int p) { vector<pair<int, int>> cur; for (auto i : adj[second]) { if (i != p) { vector<pair<int, int>> ch = dfs(i, second); for (auto i : ch) { cur.push_back(i); } } } sort(cur.begin(), cur.end()); for (int i = 0; i < cur.size(); ++i) { if (i < v[second]) cur[i].first = i; else cur[i].first = i + 1; } if (v[second] > cur.size()) poss = false; cur.push_back({v[second], second}); return cur; } int main() { cin >> n; adj.assign(n, vector<int>()); v.assign(n, 0); res.assign(n, 0); for (int i = 0; i < n; ++i) { int x; cin >> x >> v[i]; x--; if (x != -1) { adj[x].push_back(i); adj[i].push_back(x); } else rt = i; } vector<pair<int, int>> cur = dfs(rt, rt); for (auto i : cur) { res[i.second] = i.first + 1; } if (!poss) { cout << NO ; return 0; } cout << YES n ; for (auto i : res) { cout << i << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, q; struct matrix { int val; } matr[109][109]; matrix* mat[109][109]; int main() { scanf( %d %d %d , &n, &m, &q); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { matr[i][j].val = 0; mat[i][j] = &matr[i][j]; } int t1, t2, t3, t4, t5; matrix* tmp; for (int i = 0; i < q; i++) { scanf( %d , &t1); if (t1 == 1) { scanf( %d , &t2); tmp = mat[t2][1]; for (int j = 1; j < m; j++) { mat[t2][j] = mat[t2][j + 1]; } mat[t2][m] = tmp; } else if (t1 == 2) { scanf( %d , &t2); tmp = mat[1][t2]; for (int i = 1; i < n; i++) { mat[i][t2] = mat[i + 1][t2]; } mat[n][t2] = tmp; } else if (t1 == 3) { scanf( %d %d %d , &t3, &t4, &t5); mat[t3][t4]->val = t5; } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { printf( %d , matr[i][j].val); } printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 100; const int maxpow = 1 << 17; const int inf = 1e9 + 7; long long h[maxn]; int par[maxn]; struct node { pair<int, int> a; node(pair<int, int> _a) : a(_a) {} node() : a(0, -1) {} void merge(node x, node y) { a = max(x.a, y.a); } }; node tree[maxpow * 2]; node query(int i, int ns, int ne, int qs, int qe) { if (qe <= ns || qs >= ne) { return node(); } if (ns >= qs && ne <= qe) { return tree[i]; } int mid = (ns + ne) / 2; node res1 = query(2 * i, ns, mid, qs, qe); node res2 = query(2 * i + 1, mid, ne, qs, qe); node res; res.merge(res1, res2); return res; } void update(int i, int ns, int ne, int qs, pair<int, int> v) { if (qs + 1 <= ns || qs >= ne) { return; } if (ns + 1 == ne) { tree[i] = node(v); return; } int mid = (ns + ne) / 2; update(2 * i, ns, mid, qs, v); update(2 * i + 1, mid, ne, qs, v); tree[i].merge(tree[2 * i], tree[2 * i + 1]); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, d; cin >> n >> d; vector<long long> a; for (long long i = 0; i < n; i++) { cin >> h[i]; a.push_back(h[i]); } sort(a.begin(), a.end()); a.erase(unique(a.begin(), a.end()), a.end()); pair<int, int> mx(-1, -1); for (int i = 0; i < n; i++) { int left = lower_bound(a.begin(), a.end(), h[i] - d + 1) - a.begin(); int right = lower_bound(a.begin(), a.end(), h[i] + d) - a.begin(); int cur = lower_bound(a.begin(), a.end(), h[i]) - a.begin(); node ans1 = query(1, 0, maxpow, 0, left); node ans2 = query(1, 0, maxpow, right, n); pair<int, int> ans = max(ans1.a, ans2.a); ans.first += 1; par[i] = ans.second; ans.second = i; mx = max(mx, ans); update(1, 0, maxpow, cur, ans); } cout << mx.first << endl; int ind = mx.second; vector<int> res; while (ind != -1) { res.push_back(ind); ind = par[ind]; } reverse(res.begin(), res.end()); for (int i = 0; i < res.size(); i++) { cout << res[i] + 1 << ; } cout << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, r = 0, l = 0; vector<int> d; cin >> n; d.resize(n); for (int i = 0; i < n; ++i) { int x, y; cin >> x >> y; l += x; r += y; d[i] = x - y; } int maxx = abs(r - l), n_max = -1; for (int i = 0; i < n; ++i) { int dl = l - d[i], dr = r + d[i]; if (abs(dr - dl) > maxx) { maxx = abs(dr - dl); n_max = i + 1; } } if (n_max == -1) cout << 0 << endl; else cout << n_max; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int TC; cin >> TC; while (TC--) { int p, f, cnts, cntw, s, w; cin >> p >> f >> cnts >> cntw >> s >> w; if (s < w) { swap(s, w); swap(cnts, cntw); } int maxi = 0; for (int i = 0; i <= min(p / w, cntw); i++) { int pw = i; int ps = min((p - i * w) / s, cnts); int fw, fs; int cntW = cntw - i; int cntS = cnts - ps; fw = min(cntW, f / w); if (f / w > cntW) { fs = min(cntS, (f - cntW * w) / s); } else { fs = 0; } int total = ps + pw + fs + fw; maxi = max(maxi, total); } cout << maxi << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<bool> vis; vector<vector<long long>> adj; void dfs(long long node) { vis[node] = true; for (long long child : adj[node]) { if (vis[child]) continue; dfs(child); } } signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n; cin >> n; vector<long long> arr(n - 1); vector<long long> deg(n + 1, 1); for (long long i = 0; i < n - 1; ++i) { cin >> arr[i]; ++deg[arr[i]]; } set<pair<long long, long long>> st; for (long long i = 1; i <= n; ++i) { if (deg[i] == 1) { st.insert({i, i}); } } cout << arr[0] << n ; for (long long i = n - 2; i >= 0; --i) { const long long node = arr[i]; auto it = st.begin(); long long currMx = it->first; long long currRoot = it->second; st.erase(it); cout << currRoot << << node << n ; --deg[node]; if (deg[node] == 1) { st.insert({max(currMx, node), node}); } } } |
#include <bits/stdc++.h> using namespace std; static const double EPS = 1e-10; template <typename T, typename S> vector<T>& operator<<(vector<T>& a, S b) { a.push_back(b); return a; } template <typename T> void operator>>(vector<T>& a, int b) { while (b--) if (!a.empty()) a.pop_back(); } bool isprime(int n) { if (n < 2) return false; for (int i = 2; i * i <= n; i++) if (n % i == 0) return false; return true; } long long b_pow(long long x, long long n) { return n ? b_pow(x * x, n / 2) * (n % 2 ? x : 1) : 1ll; } string itos(int n) { stringstream ss; ss << n; return ss.str(); } string read() { string s; char c; while (cin >> c && c != > ) s += c; if (s.size() == 0) exit(0); return s.substr(1); } int f(string s) { return s[0] == / ; } string get(string s) { if (s[0] == / ) return s.substr(1); return s; } int main() { ios_base::sync_with_stdio(false); int n, m, ret = 0; stack<string> s; while (1) { string t = read(); if (t == ) return 0; if (s.size() == 0 || (!f(t) || get(s.top()) != get(t))) { cout << string(s.size() * 2, ) << < << t << > << endl; s.push(t); } else { s.pop(); cout << string(s.size() * 2, ) << < << t << > << endl; } } } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long ti; cin >> ti; for (long long io = 0; io < ti; io++) { long long n, m; cin >> n >> m; vector<long long> a, ao, b; for (long long i = 0; i < m; i++) { long long x, y; cin >> x >> y; a.push_back(x); ao.push_back(x); b.push_back(y); } sort(a.begin(), a.end()); long long sf[m + 1]; long long sm = 0; for (long long i = m - 1; i >= 0; i--) { sm += a[i]; sf[m - i] = sm; } long long ans = 0; if (n <= m) ans = sf[n]; for (long long i = 0; i < m; i++) { long long v = b[i]; long long idx = upper_bound(a.begin(), a.end(), v) - a.begin() + 1; long long avl = m - idx + 1; if (idx > m) { ans = max(ans, ao[i] + (n - 1) * b[i]); } else if (avl < n) { long long as = 0; as = as + sf[avl]; long long rm = n - avl; if (ao[i] <= b[i]) { as += ao[i]; rm--; } as += rm * b[i]; ans = max(ans, as); } } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct ed { int a, b, w; } p[600010]; int n, m, fa[600010], d[600010], ans; bool cmp(ed a, ed b) { return (a.w > b.w); } int gf(int x) { return (fa[x] != x) ? fa[x] = gf(fa[x]) : x; } int main() { cin >> n >> m; for (int i = 1; i <= m; i++) cin >> p[i].a >> p[i].b >> p[i].w; sort(p + 1, p + m + 1, cmp); for (int i = 1; i <= n; i++) fa[i] = i, d[i] = 1; for (int i = 1; i <= m; i++) { int x = gf(p[i].a), y = gf(p[i].b); if (x != y && d[x] + d[y] > 0) fa[y] = x, ans += p[i].w, d[x] = d[x] & d[y]; else if (x == y && d[x]) { d[x] = 0, ans += p[i].w; } } cout << ans << endl; } |
#include <bits/stdc++.h> int arr[100005]; int k; void unsort(int left, int right) { if (k <= 0 || left >= right - 1) return; int mid = (left + right) / 2; std::swap(arr[mid - 1], arr[mid]); --k; unsort(left, mid); unsort(mid, right); } int main() { int n; scanf( %d%d , &n, &k); if (k % 2 == 0 || k > 2 * n) { printf( -1 n ); return 0; } for (int i = 0; i < n; ++i) { arr[i] = i + 1; } k /= 2; unsort(0, n); for (int i = 0; i < n; ++i) { printf( %d , arr[i]); } printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n, i, j, res = 0, k, v1, v2; cin >> n; vector<long long> v; for (i = 0; i < n; i++) { cin >> j; v.emplace_back(j); } if (n == 1) { cout << v[0] << n ; return 0; } else if (n == 2) { cout << (v[0] | v[1]) << n ; return 0; } for (i = 0; i < n; i++) { for (j = i + 1; j < n; j++) { v2 = v[i] | v[j]; for (k = j + 1; k < n; k++) { v1 = v2 | v[k]; res = max(res, v1); } } } cout << res << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 100010; string nick[MAX]; int ara[MAX], ord[MAX], b[MAX]; int save[MAX]; bool cmp(int a, int b) { if (ara[a] == ara[b]) return nick[a] < nick[b]; return ara[a] > ara[b]; } deque<int> D; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n, m; cin >> n; if (n == 0) { cout << 0 << << 0 << endl; return 0; } for (int i = 1; i <= n; i++) { cin >> nick[i] >> ara[i]; save[i] = ara[i]; } cin >> m; for (int i = 1; i <= m; i++) cin >> b[i], D.push_back(b[i]); sort(D.begin(), D.end()); string s; cin >> s; int id = -1; for (int i = 1; i <= n; i++) { if (s == nick[i]) { if (id == -1) id = i; else assert(false); } } for (int i = 1; i <= n; i++) ord[i] = i; sort(ord + 1, ord + n + 1, cmp); int ans1, ans2; if (m == 0) { for (int i = 1; i <= n; i++) if (ord[i] == id) { ans2 = ans1 = i; break; } cout << ans1 << << ans2 << endl; return 0; } int cur; for (int i = 1; i <= n; i++) if (ord[i] == id) cur = i; if (n == m) { ara[id] += D.front(); D.pop_front(); } int parbo = n - cur; int bad = D.size() - parbo; for (int i = cur - 1; i >= 1 and bad > 0; i--, bad--) { ara[ord[i]] += D.front(); D.pop_front(); } int need; for (int i = cur + 1; i <= n; i++) { need = (ara[id] + 1) - ara[ord[i]]; int paic = 0; while (D.size() > 0) { if (D.front() >= need) { paic = D.front(); D.pop_front(); break; } else D.pop_front(); } ara[ord[i]] += paic; } sort(ord + 1, ord + n + 1, cmp); for (int i = 1; i <= n; i++) if (ord[i] == id) ans2 = i; for (int i = 1; i <= n; i++) ara[i] = save[i]; D.clear(); for (int i = 1; i <= m; i++) D.push_back(b[i]); sort(D.begin(), D.end()); ara[id] += D.back(); D.pop_back(); sort(ord + 1, ord + n + 1, cmp); for (int i = n; i >= 1 and D.size() > 0; i--) { if (ord[i] == id) continue; ara[ord[i]] += D.back(); D.pop_back(); } sort(ord + 1, ord + n + 1, cmp); for (int i = 1; i <= n; i++) if (ord[i] == id) ans1 = i; cout << ans1 << << ans2 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 100; vector<int> a[N]; int d[N]; void work(int l, int r) { d[l]++; d[r + 1]--; } int main() { cin.tie(0); cin.sync_with_stdio(false); memset(d, 0, sizeof(d)); int n, c, m, tp, i, j, x, y; cin >> n >> c; int sum = 0, flag = 1; for (i = 1; i <= n; i++) { cin >> m; a[i].push_back(m); for (j = 1; j <= a[i][0]; j++) { cin >> m; a[i].push_back(m); } } for (i = 1; i < n; i++) { tp = min(a[i][0], a[i + 1][0]); for (j = 1; j <= tp; j++) { x = a[i][j]; y = a[i + 1][j]; if (x != y) break; } if (j > tp && a[i][0] > a[i + 1][0]) { cout << -1 << endl; return 0; } if (y > x) { work(0, c - y); work(c + 1 - x, c - 1); } else if (x > y) { work(c + 1 - x, c - y); } else work(0, c - 1); } for (int i = 0; i < c; i++) { sum += d[i]; if (sum == n - 1) { cout << i << endl; flag = 0; break; } } if (flag) cout << -1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2005, M = N * N; bool vis[N]; char s[N][2][25]; int n, m, dfn[N], low[N], tt, S[N], col[N]; int hd[N], V[M], nx[M], fs[N], q[N], id[N], in[N]; vector<int> e[N]; void add(int u, int v) { nx[++tt] = hd[u]; V[hd[u] = tt] = v; } void tarjan(int x) { dfn[x] = low[x] = ++tt; S[++S[0]] = x; vis[x] = 1; for (int i = hd[x]; i; i = nx[i]) { if (!dfn[V[i]]) tarjan(V[i]), low[x] = min(low[x], low[V[i]]); else if (vis[V[i]]) low[x] = min(low[x], dfn[V[i]]); } if (dfn[x] == low[x]) { col[x] = ++col[0]; while (S[S[0]] != x) vis[S[S[0]]] = 0, col[S[S[0]--]] = col[0]; S[0]--; vis[x] = 0; } } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %s%s , s[i][0], s[i][1]); for (int i = 1; i <= n; i++) for (int j = i + 1; j <= n; j++) { bool J = 1; for (int k = 0; k < 3; k++) J &= (s[i][0][k] == s[j][0][k]); if (J) add(i, i + n), add(j, j + n); J = (s[i][1][0] == s[j][1][0]); for (int k = 0; k < 2; k++) J &= (s[i][0][k] == s[j][0][k]); if (J) add(i + n, j), add(j + n, i); J = (s[i][0][2] == s[j][1][0]); for (int k = 0; k < 2; k++) J &= (s[i][0][k] == s[j][0][k]); if (J) add(i, j), add(j + n, i + n); J = (s[i][1][0] == s[j][0][2]); for (int k = 0; k < 2; k++) J &= (s[i][0][k] == s[j][0][k]); if (J) add(j, i), add(i + n, j + n); } tt = 0; for (int i = 1; i <= n + n; i++) if (!dfn[i]) tarjan(i); for (int i = 1; i <= n; i++) if (col[i] == col[i + n]) { puts( NO ); return 0; } puts( YES ); for (int i = 1; i <= n + n; i++) for (int j = hd[i]; j; j = nx[j]) if (col[V[j]] != col[i]) e[col[i]].push_back(col[V[j]]), in[col[V[j]]]++; int l = 1, r = 0; for (int i = 1; i <= col[0]; i++) if (!in[i]) q[id[i] = ++r] = i; while (l <= r) { int x = q[l++], z = e[x].size(); for (int v, i = 0; i < z; i++) if (!(--in[v = e[x][i]])) q[id[v] = ++r] = v; } for (int i = 1; i <= n; i++) { if (id[col[i]] < id[col[i + n]]) s[i][0][2] = s[i][1][0]; for (int k = 0; k < 3; k++) putchar(s[i][0][k]); puts( ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { char c; int ans = 0; for (int i = 0; i < 8; i++) { for (int j = 0; j < 8; j++) { cin >> c; if (c == . ) continue; if (c == Q ) ans += 9; if (c == q ) ans -= 9; if (c == R ) ans += 5; if (c == r ) ans -= 5; if (c == B ) ans += 3; if (c == b ) ans -= 3; if (c == N ) ans += 3; if (c == n ) ans -= 3; if (c == P ) ans += 1; if (c == p ) ans -= 1; } } if (ans == 0) { cout << Draw << endl; } else if (ans > 0) { cout << White << endl; } else { cout << Black << endl; } } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const long long base = 31; int xx[4] = {0, 0, 1, -1}; int yy[4] = {-1, 1, 0, 0}; string step = URDL ; long long Pow(long long a, long long b) { long long res = 1; if (b <= 0) return 1; while (b > 0) { if (b % 2) { res = (res % mod * a % mod); res %= mod; } a = (a % mod * a % mod) % mod; b /= 2; } return res % mod; } const int maxn = 1e6 + 1; long long a[maxn], b[maxn]; string s; void solve() { cin >> s; int n = s.size(); for (int i = 0; i < n; i++) { a[i + 1] = a[i]; b[i + 1] = b[i]; if (s[i] == a ) a[i + 1]++; else b[i]++; } long long res = 0; for (int i = 0; i < n; i++) { if (s[i] == b ) { res = (res % mod + (Pow(2, a[i + 1]) - 1)) % mod; } } cout << res; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; t = 1; while (t--) { solve(); } } |
#include <bits/stdc++.h> long long int n, k; long long int a[100010], max; long long int print[100010], pc; int main(void) { long long int i, j, f, l, mid; long long int sum, baki = 2147483647; scanf( %I64d %I64d , &n, &k); for (i = 1; i <= n; i++) { scanf( %I64d , &a[i]); if (max < a[i]) max = a[i]; } if (k == 0) { for (i = 1; i <= n; i++) { printf( %I64d , i); } return false; } f = 1, l = max; for (;;) { mid = (f + l) / 2; sum = 0; for (i = 1; i <= n; i++) { if (a[i] >= mid) sum += mid; else sum += a[i]; } if (sum >= k) { if (baki > mid) baki = mid; l = mid - 1; } else { f = mid + 1; } if (f > l) break; } if (baki == 2147483647) { printf( -1 n ); return false; } for (i = 1; i <= n; i++) { if (baki > a[i]) k -= a[i]; else k -= baki - 1; } for (i = 1; i <= n; i++) { if (baki <= a[i]) k--; if (k == 0) break; } if (k > 0) { printf( -1 n ); return false; } for (j = i + 1; j <= n; j++) { if (baki <= a[j]) { print[++pc] = j; } } for (j = 1; j <= i; j++) { if (baki < a[j]) { print[++pc] = j; } } for (i = 1; i <= pc; i++) { printf( %I64d , print[i]); } return false; } |
#include <bits/stdc++.h> using namespace std; template <class T> void pr(const string& name, T t) { cerr << name << : << t << endl; } template <typename T, typename... Types> void pr(const string& names, T t, Types... rest) { auto comma_pos = names.find( , ); cerr << names.substr(0, comma_pos) << : << t << , ; auto next_name_pos = names.find_first_not_of( t n , comma_pos + 1); pr(string(names, next_name_pos), rest...); } template <class T, class U> ostream& operator<<(ostream& o, const pair<T, U>& v) { return o << ( << v.first << , << v.second << ) ; } template <class T> ostream& operator<<(ostream& o, const vector<T>& v) { o << { ; for (int i = 0; i < (int)((int)((v).size())); ++i) o << (i ? , : ) << v[i]; return o << } ; } const int dx[] = {0, 1, 0, -1}; const int dy[] = {-1, 0, 1, 0}; const int MAX_N = 2e5 + 10; vector<int> G[MAX_N]; vector<int> rG[MAX_N]; int cmp[MAX_N]; bool vis[MAX_N]; int V; vector<int> vs; void dfs(int v) { vis[v] = true; for (auto e : G[v]) if (!vis[e]) dfs(e); vs.push_back(v); } void rdfs(int v, int k) { vis[v] = true; cmp[v] = k; for (auto e : rG[v]) if (!vis[e]) rdfs(e, k); } int scc() { vs.clear(); memset(vis, 0, sizeof(vis)); for (int i = 0; i < (int)(V); ++i) if (!vis[i]) dfs(i); memset(vis, 0, sizeof(vis)); int k = 0; reverse((vs).begin(), (vs).end()); for (auto e : vs) if (!vis[e]) rdfs(e, k++); return k; } int un[MAX_N]; int find(int x) { if (un[x] == x) return x; return un[x] = find(un[x]); } void unit(int a, int b) { un[find(a)] = find(b); } int main(int argc, char* argv[]) { ios::sync_with_stdio(0); cin.tie(0); memset(un, -1, sizeof(un)); int n, m; cin >> n >> m; for (int i = 0; i < (int)(n); ++i) un[i] = i; for (int i = 0; i < (int)(m); ++i) { int a, b; cin >> a >> b; --a, --b; G[a].push_back(b); rG[b].push_back(a); unit(a, b); } V = n; scc(); map<int, set<int> > app; for (int i = 0; i < (int)(n); ++i) app[find(i)].insert(i); int ans = 0; for (auto& e : app) { if ((int)((e.second).size()) == 1) continue; set<int> cnum; for (auto v : e.second) cnum.insert(cmp[v]); if ((int)((cnum).size()) != (int)((e.second).size())) ans += (int)((e.second).size()); else ans += (int)((e.second).size()) - 1; } cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < 10; i++) { } set<int> s(a.begin(), a.end()); if (s.size() < k) { cout << NO << endl; } else { cout << YES << endl; int cnt = 0; for (auto item : s) { if (cnt == k) { break; } for (int i = 0; i < n; i++) { if (a[i] == item) { cout << i + 1 << ; cnt++; break; } } } for (int i = 0; i < 10; i++) { } cout << endl; } for (int i = 0; i < 10; i++) { } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> G[100005]; vector<int> rG[100005]; int f[100005]; int n, m; bool canUsing[100005]; bool canAss[100005]; void dfs0(int u) { canUsing[u] = 1; if (f[u] == 1) return; for (int i = 0; i < rG[u].size(); i++) { int v = rG[u][i]; if (canUsing[v]) continue; dfs0(v); } } void dfs1(int u) { canAss[u] = 1; for (int i = 0; i < G[u].size(); i++) { int v = G[u][i]; if (canAss[v]) continue; dfs1(v); } } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %d , &f[i]); for (int i = 1; i <= m; i++) { int u, v; scanf( %d%d , &u, &v); G[u].push_back(v); rG[v].push_back(u); } for (int i = 1; i <= n; i++) { if (f[i] == 2 && canUsing[i] == 0) dfs0(i); if (f[i] == 1 && canAss[i] == 0) dfs1(i); } for (int i = 1; i <= n; i++) { int t = canAss[i] & canUsing[i]; printf( %d n , t); } return 0; } |
#include <bits/stdc++.h> using namespace std; bool letras[26]; int main() { list<char> kbd; list<char>::iterator i; int t, j; bool foundKbd; string s; for (cin >> t; t > 0; t--) { foundKbd = true; cin >> s; for (j = 0; j < s.size() && foundKbd; j++) { if (kbd.size() == 0) { kbd.push_back(s.at(j)); letras[s.at(j) - a ] = true; } else if (letras[s.at(j) - a ] == false) { for (i = kbd.begin(); i != kbd.end() && *i != s.at(j - 1); i++) ; if (i == kbd.begin()) { kbd.push_front(s.at(j)); letras[s.at(j) - a ] = true; } else if (i == --kbd.end()) { kbd.push_back(s.at(j)); letras[s.at(j) - a ] = true; } else foundKbd = false; } else { for (i = kbd.begin(); i != kbd.end() && *i != s.at(j - 1); i++) ; if (*(++i) == s.at(j)) --i; else if (*(--(--i)) != s.at(j)) foundKbd = false; } } if (foundKbd) { cout << YES << endl; for (j = 0; j < 26; j++) if (letras[j] == false) kbd.push_back( a + j); for (i = kbd.begin(); i != kbd.end(); i++) cout << *i; cout << endl; } else cout << NO << endl; kbd.clear(); for (j = 0; j < 26; j++) letras[j] = false; } } |
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 1; char ch = getchar(); for (; !isdigit(ch); ch = getchar()) { if (ch == - ) f = -1; } for (; isdigit(ch); ch = getchar()) { x = x * 10 + ch - 48; } return x * f; } const int mxN = 1e5; const int P = 998244353; struct Element { long long x, v, p; } a[mxN + 3]; struct Event { int u, x, y; long long t1, t2; bool operator<(const Event &arg) const { return t1 * arg.t2 < t2 * arg.t1; } } ev[mxN * 2 + 3]; int f[mxN + 3][2][2]; int n, m; long long quickpow(long long x, long long y) { long long cur = x, ret = 1ll; for (int i = 0; y; i++) { if (y & (1ll << i)) { y -= (1ll << i); ret = ret * cur % P; } cur = cur * cur % P; } return ret; } long long mulinv(long long x) { return quickpow(x, P - 2); } struct SgTNode { long long x[2][2]; } sgt[mxN * 4 + 3]; void pushup(int u, int mid) { for (int i = 0; i < 2; i++) for (int j = 0; j < 2; j++) sgt[u].x[i][j] = 0ll; for (int i = 0; i < 2; i++) for (int j = 0; j < 2; j++) if (!f[mid][i][j]) { for (int ii = 0; ii < 2; ii++) for (int jj = 0; jj < 2; jj++) { sgt[u].x[ii][jj] += sgt[u << 1].x[ii][i] * sgt[u << 1 | 1].x[j][jj]; } } for (int i = 0; i < 2; i++) for (int j = 0; j < 2; j++) { sgt[u].x[i][j] %= P; } } void build(int u, int le, int ri) { if (le == ri) { sgt[u].x[0][0] = P + 1 - a[le].p, sgt[u].x[1][1] = a[le].p; return; } int mid = (le + ri) >> 1; build(u << 1, le, mid); build(u << 1 | 1, mid + 1, ri); pushup(u, mid); } void update(int u, int le, int ri, int pos) { if (le == ri) { return; } int mid = (le + ri) >> 1; if (pos <= mid) { update(u << 1, le, mid, pos); } else { update(u << 1 | 1, mid + 1, ri, pos); } pushup(u, mid); } long long query() { return (sgt[1].x[0][0] + sgt[1].x[0][1] + sgt[1].x[1][0] + sgt[1].x[1][1]) % P; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %I64d%I64d%I64d , &a[i].x, &a[i].v, &a[i].p); a[i].p = a[i].p * mulinv(100) % P; } for (int i = 1; i < n; i++) { ev[++m].u = i, ev[m].x = 1, ev[m].y = 0, ev[m].t1 = a[i + 1].x - a[i].x, ev[m].t2 = a[i].v + a[i + 1].v; if (a[i].v < a[i + 1].v) { ev[++m].u = i, ev[m].x = 0, ev[m].y = 0, ev[m].t1 = a[i + 1].x - a[i].x, ev[m].t2 = a[i + 1].v - a[i].v; } else if (a[i].v > a[i + 1].v) { ev[++m].u = i, ev[m].x = 1, ev[m].y = 1, ev[m].t1 = a[i + 1].x - a[i].x, ev[m].t2 = a[i].v - a[i + 1].v; } } sort(ev + 1, ev + m + 1); long long ans = 0ll, prob = 1ll; build(1, 1, n); for (int i = 1; i <= m; i++) { f[ev[i].u][ev[i].x][ev[i].y] = 1; update(1, 1, n, ev[i].u); long long tmp = query(), tim = ev[i].t1 * mulinv(ev[i].t2) % P; ans = (ans + (prob - tmp + P) * tim) % P; prob = tmp; } printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> T gi() { T x = 0; bool f = 0; char c = getchar(); while (c != - && (c < 0 || c > 9 )) c = getchar(); if (c == - ) f = 1, c = getchar(); while (c >= 0 && c <= 9 ) x = x * 10 + c - 0 , c = getchar(); return f ? -x : x; } const int N = 2e5 + 10; struct node { int to, nxt, w; } g[N << 1]; int lst[N], gl, w[N]; void add(int z, int y, int x) { g[++gl] = (node){y, lst[x], z}; lst[x] = gl; g[++gl] = (node){x, lst[y], z}; lst[y] = gl; } int ans1; double ans2; int siz[N], mx, rt, sum; bool vis[N]; void getroot(int u, int ff) { siz[u] = 1; int s = 0; for (int i = lst[u]; i; i = g[i].nxt) { int v = g[i].to; if (v == ff || vis[v]) continue; getroot(v, u); siz[u] += siz[v]; s = max(s, siz[v]); } s = max(s, sum - siz[u]); if (s < mx) mx = s, rt = u; } double sd[N], sumd, ans; void dfs(int u, int ff, int tp, int dep) { ans += pow(dep, 1.5) * w[u]; sumd += 1.5 * sqrt(dep) * w[u]; sd[tp] += 1.5 * sqrt(dep) * w[u]; for (int i = lst[u]; i; i = g[i].nxt) { int v = g[i].to; if (v == ff) continue; dfs(v, u, tp, dep + g[i].w); } } void solve(int u) { vis[u] = 1; ans = sumd = 0; for (int i = lst[u]; i; i = g[i].nxt) sd[g[i].to] = 0, dfs(g[i].to, u, g[i].to, g[i].w); if (ans2 > ans) ans1 = u, ans2 = ans; for (int i = lst[u]; i; i = g[i].nxt) { int v = g[i].to; if (vis[v]) continue; if (sumd - sd[v] > sd[v]) continue; mx = sum = siz[v]; getroot(v, u); solve(rt); } } int main() { int n = gi<int>(); for (int i = 1; i <= n; i++) w[i] = gi<int>(); for (int i = 1; i < n; i++) add(gi<int>(), gi<int>(), gi<int>()); ans2 = 1e20; mx = sum = n; getroot(1, 0); solve(rt); printf( %d %.10lf n , ans1, ans2); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k, i; double sum = 0, num, av, av1; cin >> n >> k; int a[n]; for (i = 0; i < n; i++) { cin >> a[i]; sum = sum + a[i]; } av1 = sum / n; if (av1 >= (k - .5)) { cout << 0 << endl; return 0; } else { for (i = 1;; i++) { sum = sum + k; num = n + i; av = sum / num; if (av >= (k - 0.5)) { cout << i << endl; return 0; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } namespace Mymath { long long qp(long long x, long long p, long long mod) { long long ans = 1; while (p) { if (p & 1) ans = ans * x % mod; x = x * x % mod; p >>= 1; } return ans; } long long inv(long long x, long long mod) { return qp(x, mod - 2, mod); } long long C(long long N, long long K, long long fact[], long long mod) { return fact[N] * inv(fact[K], mod) % mod * inv(fact[N - K], mod) % mod; } template <typename Tp> Tp gcd(Tp A, Tp B) { if (B == 0) return A; return gcd(B, A % B); } template <typename Tp> Tp lcm(Tp A, Tp B) { return A * B / gcd(A, B); } }; // namespace Mymath namespace fwt { using namespace Mymath; void FWT(int a[], int n, long long mod) { for (int d = 1; d < n; d <<= 1) for (int m = d << 1, i = 0; i < n; i += m) for (int j = 0; j < d; j++) { int x = a[i + j], y = a[i + j + d]; a[i + j] = (x + y) % mod, a[i + j + d] = (x - y + mod) % mod; } } void UFWT(int a[], int n, long long mod) { long long rev = inv(2, mod); for (int d = 1; d < n; d <<= 1) for (int m = d << 1, i = 0; i < n; i += m) for (int j = 0; j < d; j++) { int x = a[i + j], y = a[i + j + d]; a[i + j] = 1LL * (x + y) * rev % mod, a[i + j + d] = (1LL * (x - y) * rev % mod + mod) % mod; } } void solve(int a[], int b[], int n, long long mod) { FWT(a, n, mod); FWT(b, n, mod); for (int i = 0; i < n; i++) a[i] = 1LL * a[i] * b[i] % mod; UFWT(a, n, mod); } }; // namespace fwt namespace Maxflow { const int Maxn = 1005; struct edge { int to, rev, cap; edge(int _to, int _rev, int _cap) { to = _to, rev = _rev, cap = _cap; } }; int src = 1002, snk = 1003; vector<edge> G[Maxn]; int dist[Maxn], seen[Maxn]; int n; void Clear() { for (int i = 0; i < Maxn; i++) G[i].clear(); } void bfs(int s) { for (int i = 0; i < Maxn; i++) dist[i] = -1; dist[s] = 0; queue<int> Q; Q.push(s); while (!Q.empty()) { int x = Q.front(); Q.pop(); for (int i = 0; i < G[x].size(); i++) { edge &e = G[x][i]; if (e.cap && dist[e.to] == -1) { dist[e.to] = dist[x] + 1; Q.push(e.to); } } } } int dfs(int now, int dest, int fl) { if (now == dest) return fl; for (int &i = seen[now]; i < G[now].size(); i++) { edge &ed = G[now][i]; if (ed.cap && dist[ed.to] == dist[now] + 1) { int f = dfs(ed.to, dest, min(fl, ed.cap)); if (f) { ed.cap -= f; G[ed.to][ed.rev].cap += f; return f; } } } return 0; } int dinic(int s = src, int t = snk) { int ret = 0; while (1) { memset(seen, 0, sizeof(seen)); bfs(s); if (dist[t] == -1) return ret; int f = dfs(s, t, 2147483647); while (f) { ret += f; f = dfs(s, t, 2147483647); } } } }; // namespace Maxflow namespace Geometry { struct iP { long long x, y; iP(long long _x, long long _y) { x = _x, y = _y; } iP() { x = y = 0; } iP operator+(iP p) { return iP(x + p.x, y + p.y); } iP operator-(iP p) { return iP(x - p.x, y - p.y); } iP operator*(long long k) { return iP(x * k, y * k); } long long det(iP p) { return x * p.y - y * p.x; } long long dot(iP p) { return x * p.x + y * p.y; } long long dist() { return x * x + y * y; } bool operator<(const iP &p) const { if (x != p.x) return x < p.x; return y < p.y; } }; struct dP { double x, y; dP(double _x, double _y) { x = _x, y = _y; } dP() { x = y = 0.0; } dP operator+(dP p) { return dP(x + p.x, y + p.y); } dP operator-(dP p) { return dP(x - p.x, y - p.y); } dP operator*(double k) { return dP(x * k, y * k); } double det(dP p) { return x * p.y - y * p.x; } double dot(dP p) { return x * p.x + y * p.y; } double dist() { return x * x + y * y; } bool operator<(const dP &p) const { if (x != p.x) return x < p.x; return y < p.y; } }; vector<iP> convex_hull(iP X[], int l) { vector<iP> ret; sort(X + 1, X + 1 + l); ret.push_back(X[1]); for (int i = 2; i <= l; i++) { while (ret.size() >= 2 && (ret[ret.size() - 2] - X[i]).det(ret[ret.size() - 1] - X[i]) >= 0) { ret.pop_back(); } ret.push_back(X[i]); } int rs = ret.size() + 1; for (int i = l - 1; i >= 1; i--) { while (ret.size() >= rs && (ret[ret.size() - 2] - X[i]).det(ret[ret.size() - 1] - X[i]) >= 0) { ret.pop_back(); } ret.push_back(X[i]); } return ret; } }; // namespace Geometry const int Maxn = 2e5 + 5; const int Maxm = 5500005; int n, q; int a[Maxn]; bool isp[Maxm]; vector<int> P; vector<int> p[Maxn]; void _init() { memset(isp, true, sizeof(isp)); isp[0] = isp[1] = false; for (int i = 2; i < Maxm; i++) { if (isp[i]) { P.push_back(i); for (int j = i + i; j < Maxm; j += i) { isp[j] = false; } } } } long long Ha(vector<int> &V) { long long ret = 12384722; for (int i = 0; i < V.size(); i++) { ret = ret * 94333337 + V[i]; } return ret; } vector<long long> H[Maxn]; struct node { vector<pair<int, int> > st; long long hh; node *nxt; node(long long _hh) { hh = _hh; nxt = NULL; st.clear(); } }; const int ss = 5000000; node *Mp[ss]; void Add(long long HH, int Siz, int Pos) { long long pp = HH % (long long)ss; if (pp < 0) pp += ss; if (Mp[pp] == NULL) { Mp[pp] = new node(HH); Mp[pp]->st.push_back(make_pair(Siz, Pos)); return; } node *tmp = Mp[pp]; bool Find = false; while (tmp) { if (tmp->hh == HH) { Find = true; break; } if (tmp->nxt == NULL) break; tmp = tmp->nxt; } if (Find) { while (!tmp->st.empty() && tmp->st.back().first >= Siz) { tmp->st.pop_back(); } tmp->st.push_back(make_pair(Siz, Pos)); return; } tmp->nxt = new node(HH); tmp->nxt->st.push_back(make_pair(Siz, Pos)); } vector<pair<int, int> > Get(long long HH) { long long pp = HH % ss; if (pp < 0) pp += ss; vector<pair<int, int> > ept; if (!Mp[pp]) return ept; node *tmp = Mp[pp]; while (tmp) { if (tmp->hh == HH) return tmp->st; if (tmp->nxt == NULL) return ept; tmp = tmp->nxt; } return ept; } void Ckm(int &x, int y) { if (y < x) x = y; } int imp[Maxn][19]; vector<pair<int, int> > Q[Maxn]; int ans[2000000]; int tree[Maxn * 4], tag[Maxn * 4]; void Push(int p) { tag[p * 2] = min(tag[p * 2], tag[p]); tag[p * 2 + 1] = min(tag[p * 2 + 1], tag[p]); tree[p * 2] = min(tree[p * 2], tag[p]); tree[p * 2 + 1] = min(tree[p * 2 + 1], tag[p]); tag[p] = 1e9; } void modify(int p, int l, int r, int lo, int hi, int val) { if (lo > hi) return; if (hi > r) hi = r; if (lo <= l && r <= hi) { tag[p] = min(tag[p], val); tree[p] = min(tree[p], val); return; } Push(p); int mid = l + r >> 1; if (lo <= mid) { modify(p * 2, l, mid, lo, min(hi, mid), val); } if (hi > mid) { modify(p * 2 + 1, mid + 1, r, max(lo, mid + 1), hi, val); } tree[p] = min(tree[p * 2], tree[p * 2 + 1]); } int query(int p, int l, int r, int lo, int hi) { if (lo > hi) return 1e9; if (lo <= l && r <= hi) { return tree[p]; } Push(p); int mid = l + r >> 1; int ans = 1e9; if (lo <= mid) { ans = min(ans, query(p * 2, l, mid, lo, min(hi, mid))); } if (hi > mid) { ans = min(ans, query(p * 2 + 1, mid + 1, r, max(lo, mid + 1), hi)); } tree[p] = min(tree[p * 2], tree[p * 2 + 1]); return ans; } int main() { _init(); n = read(); q = read(); for (int i = 1; i <= n; i++) { a[i] = read(); int tmp = a[i]; for (int j = 0; j < P.size(); j++) { if (P[j] * P[j] > tmp) break; int f = 0; while (tmp % P[j] == 0) { tmp /= P[j]; f ^= 1; } if (f) p[i].push_back(P[j]); } if (tmp != 1) p[i].push_back(tmp); int s = p[i].size(); vector<int> T; for (int j = 0; j < (1 << s); j++) { T.clear(); for (int k = 0; k < s; k++) { if (j >> k & 1) T.push_back(p[i][k]); } H[i].push_back(Ha(T)); } } for (int i = n; i >= 1; i--) { int s = p[i].size(); vector<int> T; for (int j = 0; j < 16; j++) imp[i][j] = 1e9; for (int j = 0; j < (1 << s); j++) { int vv = __builtin_popcount(j); vector<pair<int, int> > GG = Get(H[i][j]); for (int k = 0; k < GG.size(); k++) { Ckm(imp[i][s - vv * 2 + GG[k].first], GG[k].second); } } for (int j = 0; j < H[i].size(); j++) { Add(H[i][j], s, i); } for (int j = 1; j < 16; j++) { imp[i][j] = min(imp[i][j], imp[i][j - 1]); } } for (int i = 0; i < q; i++) { int l, r; l = read(); r = read(); Q[l].push_back(make_pair(r, i)); } for (int i = 0; i < 4 * Maxn; i++) { tag[i] = 1e9; tree[i] = 1e9; } for (int i = n; i >= 1; i--) { if (i != n) { int lst = i + 1; for (int j = 14; j >= 0; j--) { if (imp[i][j] == imp[i][j + 1]) continue; modify(1, 1, n, lst, imp[i][j] - 1, j + 1); lst = imp[i][j]; } modify(1, 1, n, lst, n, 0); } for (int j = 0; j < Q[i].size(); j++) { int id = Q[i][j].second, r = Q[i][j].first; ans[id] = query(1, 1, n, i + 1, r); } } for (int i = 0; i < q; i++) { printf( %d n , ans[i]); } return ~~(0 ^ 0 ^ 0); } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k, sum = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> k; sum += (int)abs(k); } cout << sum << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { bool check = false; int left, right; cin >> left >> right; for (int i = left; i <= right; i++) { int num = i; bool ch[10] = {false}; while (num > 0) { if (ch[num % 10]) break; ch[num % 10] = true; num /= 10; } if (num == 0) { cout << i; check = true; break; } } if (!check) cout << -1 ; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename Arg1> void __f(const char *name, Arg1 &&arg1) { cerr << name << : << arg1 << endl; } template <typename Arg1, typename... Args> void __f(const char *names, Arg1 &&arg1, Args &&...args) { const char *comma = strchr(names + 1, , ); cerr.write(names, comma - names) << : << arg1 << | ; __f(comma + 1, args...); } using ll = long long; using P = pair<int, int>; using vi = vector<int>; const char nl = n ; const int inf = 2e9; const ll INF = (ll)2e18; const ll mod = 1e9 + 7; const int N = 2e6 + 15; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, x; cin >> n; vi a(n), pos(n + 1); vi bucket(n, 0); for (int i = 0; i < n; ++i) cin >> a[i]; for (int i = 0; i < n; ++i) { cin >> x; pos[x] = i; } for (int i = 0; i < n; ++i) { if (pos[a[i]] <= i) { bucket[i - pos[a[i]]]++; } else { bucket[i + n - pos[a[i]]]++; } } int ans = 0; for (int i = 0; i < n; ++i) { ans = max(ans, bucket[i]); } cout << ans << nl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int A[n], ans = 0, maxi = -1; for (int i = 0; i < n; i++) { cin >> A[i]; if (A[i] == 1) ans++; else { maxi = max(ans, maxi); ans = 0; } } for (int i = 0; i < n; i++) { if (A[i] == 1) ans++; else { maxi = max(ans, maxi); ans = 0; } } cout << maxi; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>; long long pl, pr, vl, vr; int k; long long inter(long long a, long long b, long long c, long long d) { return max(0LL, min(b, d) - max(a, c) + 1); } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> pl >> pr >> vl >> vr >> k; long double ans = 0; vector<long long> lucky; for (int len = (0); len < (11); len++) { for (int x = (0); x < ((1 << len)); x++) { long long y = 0; for (int i = (0); i < (len); i++) { if ((x >> i) & 1) { y = y * 10 + 4; } else { y = y * 10 + 7; } } lucky.push_back(y); } } sort((lucky).begin(), (lucky).end()); int n = ((int)(lucky).size()); for (int i = (1); i < (n - k); i++) { int j = i + k; ans += 1.0 * inter(pl, pr, lucky[i - 1] + 1, lucky[i]) * inter(vl, vr, lucky[j - 1], lucky[j] - 1); ans += 1.0 * inter(vl, vr, lucky[i - 1] + 1, lucky[i]) * inter(pl, pr, lucky[j - 1], lucky[j] - 1); if (k == 1 && pl <= lucky[i] && lucky[i] <= pr && vl <= lucky[i] && lucky[i] <= vr) ans--; } ans /= 1.0 * (pr - pl + 1) * (vr - vl + 1); cout << fixed << setprecision(11) << ans << n ; } |
#include <bits/stdc++.h> using namespace std; int dx[4] = {0, 0, 1, -1}; int dy[4] = {1, -1, 0, 0}; const int maxn = 1e5 + 10; char dir[4] = { R , L , D , U }; vector<vector<int> > a, ind, nxt; pair<int, int> rh[maxn]; vector<int> vect[maxn], pos_undo; int nxt2[maxn], pos[maxn], n, m, mt[maxn], cnt, r; bool outside(int x, int y) { if (x > n || x < 1 || y > m || y < 1) return true; return false; } void add_edge(int x, int y) { vect[x].push_back(y); vect[y].push_back(x); } bool srt(int x, int y) { return nxt2[x] < nxt2[y]; } int kuhn(int x, int tip) { if (pos[x]) return 0; pos[x] = 1; pos_undo.push_back(x); for (int i = 0; i < vect[x].size(); i++) { int id = vect[x][i]; if (tip == 1 && nxt2[id] == 1) break; if (mt[id] == -1 || kuhn(mt[id], tip)) { mt[id] = x; mt[x] = id; return 1; } } return 0; } void random_matching() { for (int i = 1; i <= cnt; i++) { if (mt[i] != -1) continue; if (nxt2[i] != 0) continue; for (int j = 0; j < vect[i].size(); j++) { int id = vect[i][j]; if (mt[id] != -1) continue; if (nxt2[id] != 0) continue; mt[i] = id; mt[id] = i; r -= 2; break; } } } int main() { int t; scanf( %d , &t); while (t--) { scanf( %d %d , &n, &m); a.clear(); nxt.clear(); ind.clear(); a.resize(n + 2, vector<int>(m + 2)); nxt.resize(n + 2, vector<int>(m + 2)); ind.resize(n + 2, vector<int>(m + 2)); cnt = 0; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { scanf( %d , &a[i][j]); nxt[i][j] = -1; nxt2[cnt] = 0; ind[i][j] = ++cnt; rh[cnt] = {i, j}; mt[cnt] = -1; vect[cnt].clear(); } int fucked = 0; r = 0; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { int e = 0; for (int k = 0; k < 4; k++) { int idx = i + dx[k]; int idy = j + dy[k]; if (outside(idx, idy)) continue; if (a[idx][idy] < a[i][j]) { nxt[i][j] = k; nxt2[ind[i][j]] = 1; } else if (a[idx][idy] == a[i][j]) { e = 1; if ((i + j) % 2) add_edge(ind[i][j], ind[idx][idy]); } } if (e == 0 && nxt[i][j] == -1) fucked = 1; if (nxt[i][j] == -1) r++; } if (fucked) { printf( NO n ); continue; } for (int i = 1; i <= cnt; i++) sort(vect[i].begin(), vect[i].end(), srt); random_matching(); for (int i = 1; i <= cnt; i++) { if (nxt[rh[i].first][rh[i].second] != -1 || mt[i] != -1) continue; if (kuhn(i, 1)) r -= 2; for (int j = 0; j < pos_undo.size(); j++) pos[pos_undo[j]] = 0; pos_undo.clear(); } for (int i = 1; i <= cnt; i++) { if (nxt[rh[i].first][rh[i].second] != -1 || mt[i] != -1) continue; if (kuhn(i, 0)) r -= 1; for (int j = 0; j < pos_undo.size(); j++) pos[pos_undo[j]] = 0; pos_undo.clear(); } if (r > 0) { printf( NO n ); continue; } printf( YES n ); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (mt[ind[i][j]] != -1) { if ((i + j) % 2) printf( %d , a[i][j] / 2 + (a[i][j] % 2)); else printf( %d , a[i][j] / 2); } else { printf( %d , a[i][j] - a[i + dx[nxt[i][j]]][j + dy[nxt[i][j]]]); } } printf( n ); } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (mt[ind[i][j]] != -1) { for (int k = 0; k < 4; k++) { int idx = i + dx[k]; int idy = j + dy[k]; if (ind[idx][idy] == mt[ind[i][j]]) { printf( %c , dir[k]); break; } } } else { printf( %c , dir[nxt[i][j]]); } } printf( n ); } } return 0; } |
#include <bits/stdc++.h> const int N = 1e6 + 10; using namespace std; inline int min(int a, int b) { return a < b ? a : b; } int main() { int a, b, c; while (~scanf( %d%d%d , &a, &b, &c)) { int k = min(min(a / 3, b / 2), c / 2); a -= 3 * k; b -= 2 * k; c -= 2 * k; if (a == 0 && b == 0 && c == 0) { printf( %d n , k * 7); } else { if (a == 0) { if (b == 0 || c == 0) { printf( %d n , k * 7 + 1); } else { printf( %d n , k * 7 + 2); } } else if (b == 0) { if (c == 0) { if (a > 2) { printf( %d n , k * 7 + 2); } else { printf( %d n , k * 7 + 1); } } else { if (c >= 2) { printf( %d n , k * 7 + 3); } else { printf( %d n , k * 7 + 2); } } } else if (c == 0) { if (a >= 2 && b >= 2) { printf( %d n , k * 7 + 4); } else if (b < 2 && a >= 2) { printf( %d n , k * 7 + 3); } else if (a < 2) { printf( %d n , k * 7 + 2); } } else { int kk = min(min(a, b), c), sum = 0; if (kk == a) { if (a == 1) { if (c >= 2) { if (b >= 2) { b = 2; } printf( %d n , k * 7 + a + b + 2); } else { printf( %d n , k * 7 + 3); } } else { printf( %d n , k * 7 + 6); } } else { if (b == 1) { if (c >= 2) { if (a >= 3) { a = 3; } printf( %d n , k * 7 + a + 3); } else if (c == 1) { if (a >= 3) { a = 3; } printf( %d n , k * 7 + a + 2); } } else if (c == 1) { if (b >= 2) { if (a >= 3) { a = 3; } printf( %d n , k * 7 + a + 3); } else if (b == 1) { if (a >= 3) { a = 3; } printf( %d n , k * 7 + a + 2); } } } } } } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << : << arg1 << std::endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cout.write(names, comma - names) << : << arg1 << | ; __f(comma + 1, args...); } bool isV(char x) { if (x == a || x == e || x == i || x == o || x == u ) { return 1; } return 0; } bool isP(long long n) { for (long long i = 2; i * i <= n; i++) { if (n % i == 0) return 0; } return 1; } void fio() { ios_base::sync_with_stdio(false); cin.tie(NULL); } void print(long long* a, long long n) { long long i; for (i = 0; i < (long long)n; i++) { cout << a[i] << ; } cout << endl; } void print2d(long long a[][1000], long long m, long long n) { long long i, j; for (i = 0; i < (long long)m; i++) { for (j = 0; j < (long long)n; j++) { cout << setw(2) << a[i][j]; } cout << endl; } } int32_t main() { fio(); long long n; cin >> n; long long* a = new long long[n]; long long i; for (i = 0; i < (long long)n; i++) { cin >> a[i]; } long long* suf = new long long[n]; suf[n - 1] = 0; stack<long long> s; for (i = n - 1; i >= (long long)0; i--) { while (s.size() > 0 && a[i] <= a[s.top()]) s.pop(); if (s.size() != 0) { suf[i] = suf[s.top()] + (s.top() - i - 1) * a[i] + a[s.top()]; } else { suf[i] = (n - (i + 1)) * a[i]; } s.push(i); } long long* temp = new long long[n]; long long* pref = new long long[n]; pref[0] = 0; long long m = 0, mi = -1; stack<long long> x; for (i = 0; i < (long long)n; i++) { while (x.size() > 0 && a[x.top()] > a[i]) x.pop(); if (x.size() == 0) pref[i] = i * a[i]; else pref[i] = pref[x.top()] + (i - x.top() - 1) * a[i] + a[x.top()]; x.push(i); if (m < pref[i] + suf[i] + a[i]) { m = pref[i] + suf[i] + a[i]; mi = i; } } for (i = mi + 1; i < (long long)n; i++) { if (a[i] > a[i - 1]) a[i] = a[i - 1]; } for (i = mi - 1; i >= (long long)0; i--) { if (a[i] > a[i + 1]) a[i] = a[i + 1]; } for (i = 0; i < (long long)n; i++) cout << a[i] << ; } |
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); const int N = 1234567; int x[N], y[N]; int n; double areas[N]; void line(int i, int j, double &a, double &b, double &c) { i %= n; j %= n; a = y[j] - y[i]; b = x[i] - x[j]; c = -a * x[i] - b * y[i]; } void intersect(double a, double b, double c, double aa, double bb, double cc, double &dx, double &dy) { double d = a * bb - b * aa; dx = (b * cc - c * bb) / d; dy = (c * aa - a * cc) / d; } int main() { int q; scanf( %d %d , &n, &q); for (int i = 0; i < n; i++) scanf( %d %d , x + i, y + i); reverse(x, x + n); reverse(y, y + n); areas[0] = 0; for (int i = 0; i < 4 * n; i++) areas[i + 1] = areas[i] + (x[i % n] - x[(i + 1) % n]) * 1.0 * (y[i % n] + y[(i + 1) % n]); double total_area = 0.0; for (int i = 0; i < n; i++) total_area += (x[i] - x[(i + 1) % n]) * 1.0 * (y[i] + y[(i + 1) % n]); for (int i = 0; i < q; i++) { int qx, qy; scanf( %d %d , &qx, &qy); double low = 0, high = pi; double zero = -1.0; bool found = false; double ans = -1.0; for (int it = 0; it < 120; it++) { double mid = 0.5 * (low + high); if (mid == low || mid == high) break; if (it == 0) mid = low; double dx = cos(mid); double dy = sin(mid); double a = dy; double b = -dx; double c = -a * qx - b * qy; double u0 = a * x[0] + b * y[0] + c; double u1 = a * x[1] + b * y[1] + c; bool flag = false; if (u0 > u1) { flag = true; u0 = -u0; u1 = -u1; a = -a; b = -b; c = -c; } int ll = 0, rr = n - 1; while (ll < rr) { int i = (ll + rr + 1) >> 1; int j = (i + 1) % n; double ui = a * x[i] + b * y[i] + c; double uj = a * x[j] + b * y[j] + c; if (ui <= uj && ui >= 0.5 * (u0 + u1)) ll = i; else rr = i - 1; } int id_max = (ll + 1) % n; ll = id_max + 1, rr = id_max + n - 1; while (ll < rr) { int i = (ll + rr) >> 1; int j = i + 1; double ui = a * x[i % n] + b * y[i % n] + c; double uj = a * x[j % n] + b * y[j % n] + c; if (ui > uj) ll = i + 1; else rr = i; } int id_min = ll; int last, first; { ll = id_max, rr = id_min; while (ll < rr) { int i = (ll + rr + 1) >> 1; double ui = a * x[i % n] + b * y[i % n] + c; if (ui > 0) ll = i; else rr = i - 1; } last = ll + n; } { ll = id_min, rr = id_max + n; while (ll < rr) { int i = (ll + rr) >> 1; double ui = a * x[i % n] + b * y[i % n] + c; if (ui < 0) ll = i + 1; else rr = i; } first = ll; } double xf, yf, xl, yl; double aa, bb, cc; line(first - 1, first, aa, bb, cc); intersect(a, b, c, aa, bb, cc, xf, yf); line(last, last + 1, aa, bb, cc); intersect(a, b, c, aa, bb, cc, xl, yl); double res = 0.0; res += (xf - x[first % n]) * (yf + y[first % n]); res += areas[last] - areas[first]; res += (x[last % n] - xl) * (y[last % n] + yl); res += (xl - xf) * (yl + yf); if (flag) res = total_area - res; if (it == 0) { zero = res; continue; } { double res1 = 0.5 * res; double res2 = 0.5 * (total_area - res); double diff = fabs(res1 - res2); double sum = 0.5 * total_area; if (diff / sum < 1e-6) { found = true; ans = mid; break; } } if ((res > 0.5 * total_area) == (zero > 0.5 * total_area)) low = mid; else high = mid; } printf( %.17f n , found ? ans : (0.5 * (low + high))); } return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.