func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; const int N = 100100, M = 32401000, S = 90, oo = 1000000000; int i, j, k, n, m, ch, ff; int s[N]; int F[M]; void R(int &x) { ff = x = 0; while (ch < 0 || 9 < ch) { if (ch == - ) ff = 1; ch = getchar(); } while ( 0 <= ch && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); if (ff) x = -x; } int P(int l, int r, int k) { int t = 0; l--; r--; k--; t = (l * S * 2 + n - r - l + S) * S + k; return t; } int min(const int &x, const int &y) { if (x < y) return x; return y; } int max(const int &x, const int &y) { if (x > y) return x; return y; } int f(int l, int r, int k, int o) { if (r - l + 1 < k) return 0; if (o == 1) { int ans = f(l, r - k, k, 0) - s[r] + s[r - k]; if (r - l + 1 >= k + 1) ans = min(ans, f(l, r - k - 1, k + 1, 0) - s[r] + s[r - k - 1]); return ans; } else { int t = P(l, r, k); if (F[t] < oo) return F[t]; int ans; ans = s[l + k - 1] - s[l - 1] + f(l + k, r, k, 1); if (r - l + 1 >= k + 1) ans = max(ans, s[l + k] - s[l - 1] + f(l + k + 1, r, k + 1, 1)); return F[t] = ans; } } int main() { memset(F, 60, sizeof F); R(n); for (i = 1; i <= n; i++) R(s[i]), s[i] += s[i - 1]; printf( %d n , f(1, n, 1, 0)); }
|
#include <bits/stdc++.h> inline int getx() { char c; int x; for (c = getchar(); c < 0 || c > 9 ; c = getchar()) ; for (x = 0; c >= 0 && c <= 9 ; c = getchar()) x = (x << 3) + (x << 1) + c - 0 ; return x; } bool upmax(int &a, const int &b) { return a < b ? a = b, 1 : 0; } const int MAX_N = 10050; int n, m; int v[MAX_N], c[MAX_N]; int f[MAX_N]; int main() { n = getx(), m = getx(); int c0 = getx(), d0 = getx(); for (int i = c0; i <= n; ++i) upmax(f[i], f[i - c0] + d0); for (int i = 1; i <= m; ++i) { int a = getx(), b = getx(), c = getx(), d = getx(); for (int p = b; p <= a; p += b) { for (int j = n; j >= c; --j) upmax(f[j], f[j - c] + d); } } printf( %d n , f[n]); }
|
#include <bits/stdc++.h> using namespace std; struct guy { int x; int y; int t; }; int r, n; vector<guy> arr; vector<int> dp; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> r >> n; arr = vector<guy>(n); dp = vector<int>(n, 0); for (int i = 0; i < n; i++) { cin >> arr[i].t >> arr[i].x >> arr[i].y; } for (int i = n - 1; i >= 0; i--) { for (int j = i + 1; j < min(n, i + 4 * r); j++) { if (abs(arr[j].y - arr[i].y) + abs(arr[j].x - arr[i].x) <= arr[j].t - arr[i].t) dp[i] = max(dp[i], 1 + dp[j]); } } int ans = 0; for (int i = 0; i < n; i++) { if (abs(1 - arr[i].y) + abs(1 - arr[i].x) <= arr[i].t) { ans = max(ans, 1 + dp[i]); } } cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INFint = 2e9; const long long INF = 1e18; const long long MOD = 1000000007ll; int g[100][100]; vector<int> used; set<int> roots; int n, m; void dfs(int v, int p) { used[v] = 1; for (int i = 0; i < n; i++) { if (i == p || !g[v][i]) continue; if (used[i] || roots.count(i)) { cout << NO ; exit(0); } dfs(i, v); } used[v] = 1; } vector<int> anc; void addCycle(int st, int en) { int v = en; while (v != st) { roots.insert(v); v = anc[v]; } roots.insert(st); } bool cycle(int v, int p = -1) { used[v] = 1; for (int i = 0; i < n; i++) { if (i == p || !g[v][i]) continue; if (used[i]) { addCycle(i, v); return 1; } anc[i] = v; if (cycle(i, v)) return 1; } used[v] = 1; return 0; } vector<int> p; int get(int v) { return p[v] == v ? v : p[v] = get(p[v]); } void unite(int a, int b) { a = get(a); b = get(b); if (a == b) return; if (rand() & 1) swap(a, b); p[a] = b; } int main() { ios_base::sync_with_stdio(0); cin >> n >> m; used.resize(n); p.resize(n); for (int i = 0; i < n; i++) p[i] = i; for (int i = 0; i < m; i++) { int a, b; cin >> a >> b; a--, b--; unite(a, b); g[a][b] = g[b][a] = 1; } int cnt = 0; for (int i = 0; i < n; i++) if (p[i] == i) cnt++; if (cnt != 1) { cout << NO ; return 0; } anc.resize(n); for (int i = 0; i < n; i++) { if (!used[i]) { if (cycle(i)) break; } } if (roots.size() < 3) { cout << NO ; return 0; } used.assign(n, 0); for (auto v : roots) { for (int i = 0; i < n; i++) { if (g[v][i] && !roots.count(i)) { dfs(i, v); } } } cout << FHTAGN! ; fprintf(stderr, nTIME = %lf n , 1.0 * clock() / CLOCKS_PER_SEC); ; return 0; }
|
#include <bits/stdc++.h> long long memo[100005][205]; std::pair<long long, int> pre[100005]; int n; struct q4 { int s, t, d, pin; long long w; bool operator<(const q4& wx) const { return ((w > wx.w) || ((w == wx.w) && (d > wx.d))); } }; std::vector<q4> Q[100005]; std::multiset<q4> X; long long BALLIA(int z, int m) { if (m < 0) return 100000000000000001; else if (z > n) return 0; if (memo[z][m] != -1) return memo[z][m]; long long ans = 100000000000000001; if (pre[z] != std::make_pair(0LL, 0)) ans = std::min(pre[z].first + BALLIA(pre[z].second + 1, m), BALLIA(z + 1, m - 1)); else ans = BALLIA(z + 1, m); memo[z][m] = ans; return ans; } int main(void) { std::ios_base::sync_with_stdio(false); std::cin.tie(NULL); std::cout.tie(NULL); memset(memo, -1, sizeof(memo)); int m, k; std::cin >> n >> m >> k; for (int i = 1; i <= n; i++) pre[i] = std::make_pair(0LL, 0); for (int i = 1; i <= k; i++) { int s, t, d; long long w; std::cin >> s >> t >> d >> w; Q[s].push_back({s, t, d, 1, w}); Q[t + 1].push_back({s, t, d, -1, w}); } for (int i = 1; i <= n; i++) { for (auto u : Q[i]) { if (u.pin == 1) X.insert(u); else X.erase(X.find({u.s, u.t, u.d, 1, u.w})); } if (!X.empty()) pre[i] = std::make_pair((*X.begin()).w, (*X.begin()).d); else pre[i] = std::make_pair(0LL, 0); } long long ans = BALLIA(1, m); std::cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int MAX = 2e5 + 5; long long dis[MAX]; int a[MAX], ans[MAX]; int pos[MAX]; vector<pair<int, int> > adj[MAX]; void dfs(int x, int idx, long long d) { pos[idx] = x; dis[idx] = d; int len = lower_bound(dis, dis + idx + 1, d - a[x]) - dis - 1; ans[pos[len]]--; ans[x]++; for (int i = 0; i < ((int)(adj[x]).size()); i += 1) { dfs(adj[x][i].first, idx + 1, d + adj[x][i].second); ans[x] += ans[adj[x][i].first]; } } int main(int argc, char* argv[]) { if (argc == 2 or argc == 3) freopen(argv[1], r , stdin); if (argc == 3) freopen(argv[2], w , stdout); ios::sync_with_stdio(false); int n, p, w; cin >> n; for (int i = 1; i < n + 1; i += 1) { cin >> a[i]; } for (int i = 2; i < n + 1; i += 1) { cin >> p >> w; adj[p].push_back(make_pair(i, w)); } dis[0] = -1; dfs(1, 1, 0); for (int i = 1; i < n + 1; i += 1) if (i == 1) cout << ans[i] - 1; else cout << << ans[i] - 1; cout << endl; return 0; }
|
#include <bits/stdc++.h> int main(int argc, char const *argv[]) { int n, a, b; while (scanf( %d%d%d , &n, &a, &b) != EOF) printf( %d n , (n - a) < (b + 1) ? (n - a) : (b + 1)); return 0; }
|
#include <bits/stdc++.h> static const int MAXN = 2e5 + 10; int n, m; std::pair<int, int> p[MAXN]; int x_idx[MAXN], x[MAXN]; int a_i, l_i; inline int solve_query(int u, int len) { while (true) { int last_len = len; int p = std::upper_bound(x, x + n, x[u] + len) - x - 1; len -= (x[p] - x[u]); int q = std::lower_bound(x, x + n, x[p] - len) - x; len -= (x[p] - x[q]); if (p == q) return q; else if (u == q) len %= (last_len - len); u = q; } } int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; ++i) { scanf( %d , &p[i].first); p[i].second = i + 1; } std::sort(p, p + n); for (int i = 0; i < n; ++i) { x[i] = p[i].first; x_idx[p[i].second] = i; } for (int i = 0; i < m; ++i) { scanf( %d%d , &a_i, &l_i); printf( %d n , p[solve_query(x_idx[a_i], l_i)].second); } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long a[100010]; int main() { long long n; cin >> n; long long tmp = n; for (int i = 2; (long long)i * i <= tmp; i++) { if (tmp % i == 0) { a[++a[0]] = i; while (tmp % i == 0) { tmp /= i; } } } if (tmp != 1) { a[++a[0]] = tmp; } if (a[0] == 1) { cout << a[1] << endl; } else { puts( 1 ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; long long l; cin >> n >> l; long long *lanterns = new long long[n]; for (long long i = 0; i < n; i++) cin >> lanterns[i]; double maxDistance = 0; sort(lanterns, lanterns + n); for (long long i = 0; i < n - 1; i++) if (lanterns[i + 1] - lanterns[i] > maxDistance) maxDistance = lanterns[i + 1] - lanterns[i]; if (maxDistance < lanterns[0] * 2) maxDistance = lanterns[0] * 2; if (maxDistance < (l - lanterns[n - 1]) * 2) maxDistance = (l - lanterns[n - 1]) * 2; cout << fixed; cout << maxDistance / 2; return 0; }
|
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; set<int> ms; for (int i = 0; i < n; ++i) { int x; cin >> x; if (x) ms.insert(x); } cout << ms.size() << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; double pi = acos(-1); void Open() {} long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } void PrintNumber(int n, int len) { if (!len) return; cout << (n & 1); } void PrintAllSubset(int n) { for (int i = 0; i < (1 << n); i++) { PrintNumber(i, n); cout << n ; } } void trr() {} int main() { std::ios_base::sync_with_stdio(0); cin.tie(NULL); long long n, m; cin >> n >> m; map<pair<int, int>, int> mpp; map<int, int> mp; int x, y; vector<pair<int, int>> a(m); for (int i = 0; i < m; i++) { cin >> x >> y; a[i] = {x, y}; mpp[{x, y}]++; mpp[{y, x}]++; mp[x]++; mp[y]++; } long long h = 0; while (true) { int c = 0; vector<int> r; for (int i = 0; i < a.size(); i++) { if (mp[a[i].first] == 0 || mp[a[i].second] == 0) continue; if (mp[a[i].first] == 1 || mp[a[i].second] == 1) { c++; r.push_back(i); } } for (int i = 0; i < r.size(); i++) { mp[a[r[i]].first]--; mp[a[r[i]].second]--; } if (c > 0) h++; else break; } cout << h; }
|
#include <bits/stdc++.h> int main() { int a, b; scanf( %d%d , &a, &b); if (a == b) printf( %d n , a); else printf( 2 n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; bool visited[100005]; vector<long long> mp[100005]; long long res = 0; long long ans = 0; const long long U = 1e8 + 7; void dfs(long long second) { visited[second] = true; ans++; for (int i = 0; i < mp[second].size(); i++) { res++; if (visited[mp[second][i]] == false) { dfs(mp[second][i]); } } } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long n, m; cin >> n >> m; memset(visited, false, sizeof visited); for (int i = 0; i < m; i++) { long long a, b; cin >> a >> b; mp[a].push_back(b); mp[b].push_back(a); } long long x = 0; for (int i = 0; i < n; i++) { if (visited[i] == false) { res = 0; ans = 0; dfs(i); res = res / 2; if (res == ans - 1) x++; } } cout << x - 1; return 0; }
|
#include <bits/stdc++.h> using namespace std; int m[100005], v[100005], selected[100005]; vector<pair<pair<int, int>, int> > V; int k, n, h; bool check(long double time) { long double pos = 1.0; int id = 0; for (int i = 0; i < n; i++) { if (V[i].first.second * 1.0 * time >= pos * h) { selected[id++] = V[i].second; pos += 1.0; } } return (id >= k); } int main() { V.clear(); cin >> n >> k >> h; for (int i = 0; i < n; ++i) cin >> m[i]; for (int i = 0; i < n; ++i) cin >> v[i]; for (int i = 0; i < n; ++i) V.push_back(make_pair(make_pair(m[i], v[i]), i)); sort((V).begin(), (V).end()); long double l = 0, r = 1000000009, mid; for (int i = 0; i < 200; i++) { mid = (l + r) * 0.5; if (check(mid)) r = mid; else l = mid; } check(r); for (int i = 0; i < k; ++i) { if (i != 0) cout << ; cout << selected[i] + 1; } cout << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; struct dsu { int forests = 0, parent[N], groupsize[N]; void add(int x) { parent[x] = x; groupsize[x] = 1; forests++; } int findset(int node) { if (parent[node] == node) return node; return parent[node] = findset(parent[node]); } bool issameset(int x, int y) { return findset(x) == findset(y); } void link(int i, int j) { int x = findset(i), y = findset(j); if (x == y) return; if (groupsize[x] < groupsize[y]) swap(x, y); groupsize[x] += groupsize[y]; parent[y] = x; forests--; } }; map<long long, int> mp; map<int, vector<pair<int, int>>> e; int main() { ios::sync_with_stdio(0), ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); ; int n, m; cin >> n >> m; dsu mst; for (int i = 1; i <= n; ++i) mst.add(i); for (int i = 1; i <= m; ++i) { int x, y, c; cin >> x >> y >> c; e[c].push_back({x, y}); } long long sum = 0, mx = 0; for (auto u : e) { int add = 0; for (auto uu : u.second) { if (!mst.issameset(uu.first, uu.second)) { add++; } } for (auto uu : u.second) { if (!mst.issameset(uu.first, uu.second)) { add--; mst.link(uu.first, uu.second); } } sum += add; } cout << sum << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { string a, b; long long team1 = 0, team2 = 0; cin >> a; cin >> b; for (int i = 0; i <= a.size(); i++) { if ((a[i] == [ && b[i] == ( ) || (a[i] == 8 && b[i] == [ ) || (a[i] == ( && b[i] == 8 )) { team1++; } else if ((b[i] == [ && a[i] == ( ) || (b[i] == 8 && a[i] == [ ) || (b[i] == ( && a[i] == 8 )) { team2++; } } if (team1 > team2) { cout << TEAM 1 WINS ; } else if (team1 < team2) { cout << TEAM 2 WINS ; } else { cout << TIE ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int q; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> q; while (q--) { bool ch = false; string s; cin >> s; if (s.size() == 1) { if (s[0] == ? ) cout << a ; else cout << s; } else { if (s[0] == ? ) { if (s[1] == a || s[1] == b ) s[0] = c ; else s[0] = a ; } for (int i = 1; i < s.size(); i++) { if (s[i] == ? ) { bool a = 0, b = 0, c = 0; if (s[i - 1] == a || s[i + 1] == a ) a = 1; if (s[i - 1] == b || s[i + 1] == b ) b = 1; if (s[i - 1] == c || s[i + 1] == c ) c = 1; if (!a) s[i] = a ; if (!b) s[i] = b ; if (!c) s[i] = c ; } } if (s[s.size() - 1] == ? ) { if (s[s.size() - 2] == a || s[s.size() - 2] == b ) s[s.size() - 1] = c ; else s[s.size() - 1] = a ; } for (int i = 0; i < s.size() - 1; i++) if (s[i] == s[i + 1]) ch = 1; if (!ch) cout << s; else cout << -1; } cout << n ; } }
|
#include <bits/stdc++.h> using namespace std; int a[300]; int main() { int n, k, cnt = 0; cin >> n >> k; for (int i = 0; i < 2 * n + 1; i++) cin >> a[i]; for (int i = 1; (i <= 2 * n - 1) && (cnt != k); i += 2) { if (a[i] - 1 > a[i - 1] && a[i] - 1 > a[i + 1]) { a[i]--; cnt++; } } for (int i = 0; i < 2 * n + 1; i++) cout << a[i] << ; cout << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; const int N = 1E5; int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); string s; cin >> s; int len = s.size(); int ans = 0; for (int i = 0; i < len; i++) { int l = 0, r = 0; for (int j = i; j < len; j++) { if (s[j] == ( ) { l++, r++; } else if (s[j] == ) ) { l--, r--; } else { l--, r++; } if (r < 0) break; if (l < 0) { l += 2; } if (l == 0) { ans++; } } } cout << ans << endl; }
|
/* Author: Sanskar Agarwal Nick: sanskaragarwal Birla Institute Of Technology, Mesra */ #include <bits/stdc++.h> using namespace std; #define ll long long int #define endl n #define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); #define F(i,a,b) for(ll i = (ll)(a); i <= (ll)(b); i++) #define RF(i,a,b) for(ll i = (ll)(a); i >= (ll)(b); i--) #define INF 100009 #define mod 1000000007 #define pb(x) push_back(x) #define mp(x,y) make_pair(x,y) #define ff first #define ss second #define test while(t--)solve(); void solve() { int n; cin >> n; int pos[32]; int arr[n]; memset(pos, 0, sizeof(pos)); int xo = 0; int pre[n]; for (int i = 0; i < n; ++i) { cin >> arr[i]; xo ^= arr[i]; pre[i] = xo; } bool flag = !xo; for (int i = 0; i < n; ++i) { for (int j = i + 1; j < n; ++j) { int sp1 = pre[i]; int sp2 = pre[j] ^ pre[i]; int sp3 = pre[n - 1] ^ pre[j]; flag |= (sp1 == sp2 && sp2 == sp3); } } if (flag) cout << YES << endl; else cout << NO << endl; } int main() { #ifndef ONLINE_JUDGE freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); #endif fast int t; // t = 1; cin >> t; test; #ifndef ONLINE_JUDGE cout << nTime Elapsed : << 1.0 * clock() / CLOCKS_PER_SEC << s n ; #endif return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 55; int type; const long long int mod = 1e9 + 7; long long C[N][N]; void matrix_mul(long long A[N][N], long long B[N][N]) { for (int i = 0; i < type; i++) { for (int j = 0; j < type; j++) { C[i][j] = 0; for (int k = 0; k < type; k++) { C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % mod; } } } for (int i = 0; i < type; i++) { for (int j = 0; j < type; j++) { A[i][j] = C[i][j]; } } } void pow(long long A[N][N], long long m) { long long res[N][N]; memset(res, 0, sizeof(res)); for (int i = 0; i < type; i++) res[i][i] = 1; while (m) { if (m & 1) matrix_mul(res, A); matrix_mul(A, A); m >>= 1; } for (int i = 0; i < type; i++) { for (int j = 0; j < type; j++) { A[i][j] = res[i][j]; } } } int main() { ios::sync_with_stdio(false); long long n, m, k; cin >> n >> m >> k; type = m; long long M[N][N]; for (int i = 0; i < m; i++) for (int j = 0; j < m; j++) M[i][j] = 1; while (k--) { string str; cin >> str; char x1 = str[0]; int x1n; char x2 = str[1]; int x2n; if (x1 >= a && x1 <= z ) x1n = x1 - a ; else if (x1 >= A && x1 <= Z ) x1n = x1 - A + 26; if (x2 >= a && x2 <= z ) x2n = x2 - a ; else if (x2 >= A && x2 <= Z ) x2n = x2 - A + 26; M[x1n][x2n] = 0; } pow(M, n - 1); long long sum = 0; for (int i = 0; i < m; i++) for (int j = 0; j < m; j++) sum = (sum + M[i][j]) % mod; cout << sum << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class t> inline void rd(t &s) { s = 0; register char c = getchar(); while (!isdigit(c)) c = getchar(); while (isdigit(c)) s = (s << 3) + (s << 1) + (c ^ 48), c = getchar(); return; } int ans[5050]; signed main(void) { register int n, x1, x2, x3, x; scanf( %d , &n); printf( ? 1 2 n ); fflush(stdout); scanf( %d , &x1); printf( ? 2 3 n ); fflush(stdout); scanf( %d , &x2); printf( ? 1 3 n ); fflush(stdout); scanf( %d , &x3); ans[2] = (x1 + x2 - x3) / 2; ans[1] = x1 - ans[2]; ans[3] = x2 - ans[2]; for (int i = 4; i <= n; ++i) { printf( ? %d %d n , i - 1, i); fflush(stdout); scanf( %d , &x); ans[i] = x - ans[i - 1]; } printf( ! ); for (int i = 1; i <= n; ++i) printf( %d , ans[i]); printf( n ); fflush(stdout); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int ZIMAX = 3005; int n, v; int cnt[ZIMAX]; int main() { cin >> n >> v; for (int i = 1; i <= n; ++i) { int ai, bi; cin >> ai >> bi; cnt[ai] += bi; } int ans = 0; int before = 0; for (int i = 0; i < ZIMAX; ++i) { int azi = before; int ramase = v - azi; if (ramase < 0) { ans += v; before = cnt[i]; } else { azi += (cnt[i] <= ramase ? cnt[i] : ramase); ans += azi; before = max(0, cnt[i] - ramase); } } cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, k, a[50]; scanf( %d , &n); scanf( %d , &k); for (int i = 0; i < n; i++) scanf( %d , &a[i]); sort(a, a + n); if (k > n) { cout << -1 << endl; return 0; } if (n == k) { cout << 0 << << 0 << endl; return 0; } if (a[n - k - 1] < a[n - k]) cout << a[n - k - 1] + 1 << << a[n - k - 1] + 1 << endl; else cout << -1 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 10, mod = 1e9 + 7; inline int ad(int x, int y) { int ans = x + y; if (ans > mod) ans -= mod; return ans; } inline int mu(int x, int y) { return 1LL * x * y % mod; } inline int wop(int x, int y) { int ret = 1; while (y) { if (y & 1) ret = mu(ret, x); y >>= 1; x = mu(x, x); } return ret; } int fact[maxn], inv[maxn], lst[maxn], pr[maxn], cnt[maxn]; int num[maxn][20]; int pw[maxn], pww[maxn]; inline void prep() { int n = maxn - 5; fact[0] = 1; for (int i = 1; i < n; i++) fact[i] = mu(fact[i - 1], i); for (int i = 0; i < n; i++) inv[i] = wop(fact[i], mod - 2); pr[0] = pr[1] = 1; for (int i = 2; i < 300005; i++) { if (pr[i] == 0) { lst[i] = i; for (int j = i * 2; j < 300005; j += i) lst[j] = i, pr[j] = 1; } } for (int i = 1; i < n; i++) pw[i] = ad(mu(pw[i - 1], 2), 1); pww[0] = 1; for (int i = 1; i < n; i++) pww[i] = ad(pww[i - 1], pww[i - 1]); } inline int C(int r, int n) { if (r < 0 || r > n) return 0; return mu(mu(fact[n], inv[n - r]), inv[r]); } inline int cal(int x, int y) { if (x < 0 || y < 1) return 0; if (x == 0) return pw[y]; int ans = 0; for (int i = 1; i <= y; i++) ans = ad(ans, mu(pw[i], C(x - 1, x - 1 + y - i))); return ans; } inline int f(int x, int y) { if (y <= x) return cal(x, y); int oth = cal(y, x); int eq = 0; for (int i = 0; i <= min(x, y); i++) eq = ad(eq, mu(C(i, x), C(i, y))); oth = ad(oth, eq); return ad(pww[x + y], mod - oth); } inline int ff(int x, int y) { return f(x + 1, y - 1); } int ps[20], answer[20]; int solve(vector<int> a, bool rev) { int n = a.size(); for (int i = 1; i <= n; i++) ps[i] = ps[i - 1] + a[i - 1]; int ans = 0; for (int j = 1; j < n; j++) { int tmp; if (rev) tmp = f(ps[j] - 1, ps[n] - ps[j]); if (!rev) tmp = ff(ps[j] - 1, ps[n] - ps[j]); answer[j] = tmp; } for (int i = 0; i < n; i++) { int sum = 0; for (int j = i + 1; j < n; j++) sum = ad(sum, answer[j]); ans = ad(ans, mu(sum, a[i])); } return ans; } int main() { prep(); int n; scanf( %d , &n); for (int i = 0; i < n; i++) { int x; scanf( %d , &x); cnt[x]++; } for (int i = 1; i <= 1e6; i++) { if (cnt[i] == 0) continue; int cur = i; while (cur != 1) { int p = lst[cur], tav = 0; while (cur % p == 0) cur /= p, tav++; num[p][tav] += cnt[i]; } } int ans = 0; for (int i = 2; i <= 300000; i++) { if (pr[i]) continue; vector<int> a; int sum = 0; for (int j = 1; j < 20; j++) sum += num[i][j]; if (sum == 0) continue; a.push_back(n - sum); for (int j = 1; j < 20; j++) a.push_back(num[i][j]); ans = ad(ans, solve(a, 0)); reverse(a.begin(), a.end()); ans = ad(ans, solve(a, 1)); } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; vector<int> e[200005], E[200005], v; int vis[200005]; inline void dfs(int u) { if (vis[u]) return; vis[u] = 1; v.push_back(u); int x = E[u][0], y = E[u][1]; if (e[x][0] == e[u][0] || e[x][0] == e[u][1] || e[x][1] == e[u][1] || e[x][1] == e[u][0]) dfs(x); dfs(y); } int main(int argc, char** argv) { int n; cin >> n; for (int i = 1; i <= n; i++) { int x, y; cin >> x >> y; e[i].push_back(y); e[i].push_back(x); E[x].push_back(i); E[y].push_back(i); } dfs(1); for (int i = v.size() - 1; i >= 0; i--) cout << v[i] << ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n; cin >> n; string s1; cin >> s1; vector<pair<char, int> > v; long long int sz = s1.size(); long long int j = 0; while (j < sz) { char ch = s1[j]; if (v.empty() || v.back().first != ch) v.push_back({ch, 1}); else v.back().second++; j++; } long long int ans; if (v.front().second > 1) { ans = v.front().second - 1; } else ans = 1; string s2 = ; s2 += v.front().first; long long int f = 0; for (long long int i = 1; i < v.size(); i++) { if (f) { s2 += v[i].first; f = 0; } else { if (v[i].second == 1) { s2 += v[i].first; f = 1; } else { s2 += v[i].first; s2 += v[i].first; } } } long long int sz2 = s2.size(); if (sz2 == 0 || sz2 % 2 == 0) { cout << n - sz2 << endl; cout << s2 << endl; } else { cout << n - sz2 + 1 << endl; s2[sz2 - 1] = 0 ; long long int j = 0; while (j < sz2 - 1) { cout << s2[j]; j++; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; struct state { int x, y; } bl[100005], rec[100005], cur[100005]; long long n, m; bool cmp(const state& a, const state& b) { if (a.y == b.y) return a.x < b.x; return a.y < b.y; } bool funct() { int counter = 1; rec[0].x = 1, rec[0].y = 1; for (int i = 0; i < (int)m; i++) { if (bl[i].y != bl[i - 1].y + 1) { counter = 1; rec[0].y = n; } int k = i + 1; int tmp = 0; int c = 0; for (k = i + 1; bl[k].y == bl[i].y; k++) ; k = k - 1; for (int j = i; j <= k; j++) { if (bl[j].x > tmp + 1) { cur[c].x = tmp + 1; cur[c].y = bl[j].x - 1; c++; } tmp = bl[j].x; } if (n > tmp) { cur[c].x = tmp + 1; cur[c].y = n; c++; } int t = 0; for (int i = 0; i < counter; i++) { while (cur[t].x <= rec[i].y && t < c) { if (cur[t].y >= rec[i].x) { cur[t].x = max(cur[t].x, rec[i].x); } else { cur[t].x = cur[t].y = -1; } t++; } if (t >= c) break; } counter = 0; for (int i = 0; i < t; i++) if (cur[i].x != -1 && cur[i].y != -1) { rec[counter].x = cur[i].x; rec[counter].y = cur[i].y; counter++; } if (counter == 0) return false; i = k; } if (bl[m - 1].y != n) { return true; } if (rec[counter - 1].y == n) { return true; } else { return false; } } int main() { cin >> n >> m; int xx; int yy; for (int i = 0; i < (int)m; i++) { cin >> xx >> yy; bl[i].x = xx; bl[i].y = yy; } sort(bl, bl + m, cmp); if (funct()) { cout << 2 * n - 2 << endl; } else { printf( -1 n ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long x; int n, d; int res[100010], a[100010], b[100010]; long long getNextX() { x = (x * 37 + 10007) % 1000000007; return x; } void initab() { for (int i = 0; i < n; i++) { a[i] = i + 1; } for (int i = 0; i < n; i++) { swap(a[i], a[getNextX() % (i + 1)]); } for (int i = 0; i < n; i++) { if (i < d) b[i] = 1; else b[i] = 0; } for (int i = 0; i < n; i++) { swap(b[i], b[getNextX() % (i + 1)]); } } void sol1() { for (int i = 0; i < n; i++) if (b[i]) { for (int j = i; j < n; j++) if (res[j] < a[j - i]) res[j] = a[j - i]; } } void sol2() { int k = n - sqrt(n); for (int i = 0; i < n; i++) if (a[i] >= k) { int l = n - i; for (int j = 0; j < l; j++) if (b[j] && res[j + i] < a[i]) res[j + i] = a[i]; } for (int i = 0; i < n; i++) if (!res[i]) { for (int j = 0; j <= i; j++) if (b[i - j] && res[i] < a[j]) res[i] = a[j]; } } int main() { cin >> n >> d >> x; initab(); int sd = sqrt(n) * 4; if (d <= sd) sol1(); else sol2(); for (int i = 0; i < n; i++) printf( %d n , res[i]); }
|
#include <bits/stdc++.h> using namespace std; const int max_n = 2e5 + 10; int n, temp; vector<int> ans; int main() { ios_base::sync_with_stdio(false), cin.tie(0); cin >> n; for (int i = 0; i < n; i++) { cin >> temp; int pos = lower_bound(ans.begin(), ans.end(), temp) - ans.begin(); if (pos == ans.size()) ans.push_back(temp); else ans[pos] = temp; } cout << ans.size() << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, m, k; cin >> n >> m >> k; int r = m * n - 2 * (k - 1); cout << r << ; int i = 0, j = 0; for (; i < n; i++) { if (i % 2 == 0) { for (j = 0; j < m; j++) { cout << i + 1 << << j + 1 << ; r--; if (r == 0) break; } } else { for (j = m; j > 0; j--) { cout << i + 1 << << j << ; r--; if (r == 0) break; } } if (r == 0) break; } if (i % 2 == 0) { if (j != m) j++; else i++; } else { if (j != 0) j--; else i++; } cout << endl; r = 2; for (; i < n; i++) { if (i % 2 == 0) { for (; j < m; j++) { if (r == 2) cout << r << ; cout << i + 1 << << j + 1 << ; r--; if (r == 0) { cout << endl; r = 2; } } } else { for (; j > 0; j--) { if (r == 2) cout << r << ; cout << i + 1 << << j << ; r--; if (r == 0) { cout << endl; r = 2; } } } if (r == 0) r = 2; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int digit(char c) { char digits[] = { 0 , 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 }; for (int i = 0; i < 10; i++) { if (c == digits[i]) return 0; } return 1; } int main() { int t = 0; scanf( %d , &t); while (t--) { string s; cin >> s; int len = s.length(); int d = 1, c = 1, l = 1; int cd = 0, cc = 0, cl = 0; int flag = 0; for (int i = 0; i < len; i++) { if (int(s[i]) >= 48 && int(s[i]) <= 57) { d = 0; ++cd; } else if (tolower(s[i]) == s[i]) { l = 0; ++cl; } else if (toupper(s[i]) == s[i]) { c = 0; ++cc; } if ((d + c + l) == 0) { flag = 1; break; } } if (flag == 1) { cout << s << endl; continue; } if ((d + c + l) == 1) { if (d) { if (cl <= cc) { for (int i = 0; i < len; i++) { if (toupper(s[i]) == s[i]) { s[i] = 7 ; break; } } } else { for (int i = 0; i < len; i++) { if (tolower(s[i]) == s[i]) { s[i] = 7 ; break; } } } d = 0; } if (c) { if (cl <= cd) { for (int i = 0; i < len; i++) { if (int(s[i]) >= 48 && int(s[i]) <= 57) { s[i] = A ; break; } } } else { for (int i = 0; i < len; i++) { if (tolower(s[i]) == s[i] && digit(s[i])) { s[i] = toupper(s[i]); break; } } } c = 0; } if (l) { if (cc <= cd) { for (int i = 0; i < len; i++) { if (int(s[i]) >= 48 && int(s[i]) <= 57) { s[i] = a ; break; } } } else { for (int i = 0; i < len; i++) { if (toupper(s[i]) == s[i] && digit(s[i])) { s[i] = tolower(s[i]); break; } } } } l = 0; } if ((d + c + l) == 2) { if (!d) { s[0] = A ; s[1] = a ; } if (!c) { s[0] = a ; s[1] = 7 ; } if (!l) { s[0] = A ; s[1] = 7 ; } } cout << s << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int root[1000100]; unordered_map<int, int> mp[1000100]; pair<pair<int, int>, int> edge[1000100]; int cnt[1000100]; int find_root(int u) { if (root[u] == u) return u; return root[u] = find_root(root[u]); } bool cmp(pair<pair<int, int>, int> u, pair<pair<int, int>, int> v) { return u.second < v.second; } int main() { int n, m; scanf( %d%d , &n, &m); while (m--) { int u, v; scanf( %d%d , &u, &v); cnt[u]++; cnt[v]++; mp[u][v] = 1; mp[v][u] = 1; } int mn = n, f = 0; for (int i = 1; i <= n; i++) { root[i] = i; if (mn > cnt[i]) { f = i; mn = cnt[i]; } } vector<int> X, Y; X.push_back(f); for (int i = 1; i <= n; i++) { if (i == f) continue; if (!mp[f][i]) { X.push_back(i); root[i] = f; } else Y.push_back(i); } m = 0; for (int i = 0; i < Y.size(); i++) { for (int j = i + 1; j < Y.size(); j++) { int u = Y[i], v = Y[j]; edge[++m] = pair<pair<int, int>, int>(pair<int, int>(u, v), mp[u][v]); } } for (int i = 0; i < Y.size(); i++) { for (int j = 0; j < X.size(); j++) { int u = Y[i], v = X[j]; edge[++m] = pair<pair<int, int>, int>(pair<int, int>(u, v), mp[u][v]); } } sort(edge + 1, edge + m + 1, cmp); int ans = 0; for (int i = 1; i <= m; i++) { int u = edge[i].first.first, v = edge[i].first.second, w = edge[i].second; int fu = find_root(u), fv = find_root(v); if (fu == fv) continue; root[fu] = fv; ans += w; } printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; double gmin = 100000000000000017; int a, b; int Y1[100005], Y2[100005], L[100005]; double dist(double x1, double y1, double x2, double y2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); } double f(int i, int j) { return dist(0, 0, a, Y1[i]) + L[j] + dist(a, Y1[i], b, Y2[j]); } int main() { int t, i, j, c, d, idx1, idx2, m, n, idx; scanf( %d , &n); scanf( %d , &m); scanf( %d , &a); scanf( %d , &b); for (i = 0; i < n; i++) scanf( %d , &Y1[i]); for (i = 0; i < m; i++) scanf( %d , &Y2[i]); for (i = 0; i < m; i++) scanf( %d , &L[i]); for (i = 0; i < m; i++) { int low = 0, high = n - 1; while (high - low >= 3) { int m1 = low + (high - low) / 3; int m2 = high - (high - low) / 3; if (f(m1, i) < f(m2, i)) high = m2; else low = m1; } double mini = 1000000000000; for (j = low; j <= high; ++j) { if (f(j, i) < mini) { mini = f(j, i); idx = j; } } if (mini < gmin) { gmin = mini; idx1 = idx + 1; idx2 = i + 1; } } printf( %d , idx1); printf( %d , idx2); return 0; }
|
#include <bits/stdc++.h> using namespace std; struct Node { char s[110]; int x[30]; } a[2010]; int len, k, n; int main() { scanf( %d , &k); scanf( %s , a[1].s); len = strlen(a[1].s); memset(a[1].x, 0, sizeof(a[1].x)); for (int i = 0; i < len; i++) a[1].x[a[1].s[i] - a ]++; for (int i = 2; i <= k; i++) a[i] = a[i - 1]; scanf( %d , &n); while (n--) { int p; char c; scanf( %d %c , &p, &c); int i = 1; while (p - a[i].x[c - a ] > 0) { p -= a[i].x[c - a ]; i++; } for (int j = 0; j < len; j++) if (a[i].s[j] == c) { p--; if (p == 0) { a[i].s[j] = ! ; a[i].x[c - a ]--; break; } } } for (int i = 1; i <= k; i++) for (int j = 0; j < len; j++) if (a[i].s[j] != ! ) printf( %c , a[i].s[j]); puts( ); return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize(3) using namespace std; const double PI = acos(-1.0); const double eps = 1e-6; 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; } int a[200010]; int main() { int n = read(); int fen = 0, gu = 0; for (int i = 1; i <= n; i++) a[i] = read(); bool ok = 1; for (int i = 2; i <= n; i++) { if (a[i] == a[i - 1]) ok = 0; } if (ok == 0) { printf( NO ); return 0; } for (int i = 2; i <= n - 1; i++) { if (a[i - 1] < a[i] && a[i] > a[i + 1]) fen++; else if (a[i - 1] > a[i] && a[i + 1] > a[i]) gu++; } if (fen <= 1 && gu == 0) printf( YES ); else printf( NO ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int inft = 1000000009; const int MAXN = 2000006; bool P[MAXN]; int SP[MAXN]; int PAL[MAXN]; char S[123]; bool pal(int a) { sprintf(S, %d , a); reverse(S, S + strlen(S)); int q; sscanf(S, %d , &q); return a == q; } int main() { for (int i = 0; i < (MAXN); ++i) P[i] = 1; for (int i = 2; i < MAXN; ++i) if (P[i]) for (int j = 2 * i; j < MAXN; j += i) P[j] = 0; P[0] = P[1] = 0; for (int i = 0; i < (MAXN); ++i) if (i) SP[i] = SP[i - 1] + P[i]; for (int i = 1; i < MAXN; ++i) PAL[i] = PAL[i - 1] + pal(i); int ret = 0; int p, q; scanf( %d%d , &p, &q); for (int i = 0; i < (MAXN); ++i) if (i && q * SP[i] <= p * PAL[i]) ret = i; if (ret) printf( %d n , ret); else printf( Palindromic tree is better than splay tree n ); return 0; }
|
#include <bits/stdc++.h> int main() { char s[1000000], c; int x = 0, y = 0, sum = 0, d; scanf( %d , &d); for (int i = 0; i < d; i++) { scanf( %c , &c); s[i] = c; } for (int i = 0; i < strlen(s); i++) { if (s[i] == L ) x--; if (s[i] == R ) y++; } for (int i = x; i <= y; i++) { sum++; } printf( %d n , sum); return 0; }
|
#include <bits/stdc++.h> using namespace std; void print(int x, int b) { if (x) { print(x / b, b); printf( %d , x % b); } } int main() { int k; cin >> k; for (int i = (1); i <= (k - 1); ++i) for (int j = (1); j <= (k - 1); ++j) print(i * j, k), printf( %c , j == k - 1 ? n : ); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long gcd(long long x, long long y) { return y == 0 ? x : gcd(y, x % y); } bool possible(long long p, long long q, long long x, long long y) { if (q < y) { return false; } if (p < x) { return false; } return q - y >= p - x; } int main() { int t; cin >> t; while (t--) { long long x, y, p, q; cin >> x >> y >> p >> q; long long l = 1, r = 1000000000; while (l < r) { long long mid = (l + r) / 2; if (possible(mid * p, mid * q, x, y)) { r = mid; } else { l = mid + 1; } } if (possible(l * p, l * q, x, y)) { cout << l * q - y << endl; } else { cout << -1 << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int q_pow(int x, int n) { int ret = 1; for (; n; n >>= 1, x = (long long)x * x % 998244353) if (n & 1) ret = (long long)ret * x % 998244353; return ret; } int A[100005 << 2], B[100005 << 2], tmp[100005], tx[100005], ty[100005], Q, n, m; void NTT(int *a, int len, int flag) { int i, j, k, t, w, x, tmp; for (i = k = 0; i < len; i++) { if (i > k) swap(a[i], a[k]); for (j = len >> 1; (k ^= j) < j; j >>= 1) ; } for (k = 2; k <= len; k <<= 1) { t = k >> 1; x = q_pow(3, (998244353 - 1) / k); if (flag == -1) x = q_pow(x, 998244353 - 2); for (i = 0; i < len; i += k) for (w = 1, j = i; j < i + t; j++) { tmp = (long long)a[j + t] * w % 998244353; a[j + t] = (a[j] - tmp + 998244353) % 998244353; a[j] = (a[j] + tmp) % 998244353; w = (long long)w * x % 998244353; } } if (flag == -1) for (t = q_pow(len, 998244353 - 2), i = 0; i < len; i++) a[i] = (long long)t * a[i] % 998244353; } struct poly { vector<int> a; int len; poly() {} poly(int x) { len = 1; a.push_back(x); } void clear() { len = 0; a.clear(); } void rev() { reverse(a.begin(), a.end()); } void resize(int x) { a.resize(x); len = x; } poly operator+(const poly &b) const { poly c; c.len = max(len, b.len); c.resize(c.len); for (int i = 0; i < len; i++) c.a[i] = a[i]; for (int i = 0; i < b.len; i++) c.a[i] = (c.a[i] + b.a[i]) % 998244353; return c; } poly operator-(const poly &b) const { poly c; c.len = max(len, b.len); c.resize(c.len); for (int i = 0; i < len; i++) c.a[i] = a[i]; for (int i = 0; i < b.len; i++) c.a[i] = (c.a[i] - b.a[i] + 998244353) % 998244353; return c; } poly operator*(const poly &b) const { poly c; c.len = len + b.len; int n = 1; while (n < c.len) n <<= 1; for (int i = 0; i < len; i++) A[i] = a[i]; for (int i = len; i < n; i++) A[i] = 0; for (int i = 0; i < b.len; i++) B[i] = b.a[i]; for (int i = b.len; i < n; i++) B[i] = 0; NTT(A, n, 1); NTT(B, n, 1); for (int i = 0; i < n; i++) A[i] = (long long)A[i] * B[i] % 998244353; NTT(A, n, -1); for (int i = 0; i < c.len; i++) c.a.push_back(A[i]); return c; } poly operator+(const int &b) const { poly c; c.len = len; c.a = a; (c.a[0] += b) %= 998244353; return c; } poly operator*(const int &b) const { poly c; c.len = len; for (int i = 0; i < len; i++) c.a.push_back((long long)a[i] * b % 998244353); return c; } void get_inv(poly &b, int n) { if (n == 1) { b.a.push_back(q_pow(a[0], 998244353 - 2)); b.len = 1; return; } get_inv(b, n >> 1); int t = n << 1; int lim = min(len, n); for (int i = 0; i < lim; i++) A[i] = a[i]; for (int i = lim; i < t; i++) A[i] = 0; for (int i = 0; i < b.len; i++) B[i] = b.a[i]; for (int i = b.len; i < t; i++) B[i] = 0; NTT(A, t, 1); NTT(B, t, 1); for (int i = 0; i < t; i++) A[i] = (2 - (long long)A[i] * B[i] % 998244353 + 998244353) * B[i] % 998244353; NTT(A, t, -1); for (int i = 0; i < b.len; i++) b.a[i] = A[i]; for (int i = b.len; i < n; i++) b.a.push_back(A[i]); b.len = n; } poly Dao() { poly c; c.len = len - 1; for (int i = 0; i < c.len; i++) c.a.push_back(a[i + 1] * (i + 1ll) % 998244353); return c; } poly Jifen() { poly c; c.len = len + 1; c.a.push_back(0); for (int i = 0; i < len; i++) c.a.push_back((long long)a[i] * q_pow(i + 1, 998244353 - 2) % 998244353); return c; } poly get_ln(int len) { poly b = Dao(); poly c; get_inv(c, len); return (b * c).Jifen(); } void get_mod(int b) { for (int i = b; i < len; i++) a.pop_back(); len = b; } int get_val(int x) { int ret = a[0]; for (int i = 1, tmp = x; i < len; tmp = (long long)tmp * x % 998244353, i++) ret = (ret + (long long)a[i] * tmp) % 998244353; return ret; } poly operator/(poly b) { rev(); b.rev(); poly c; int n = 1; while (n < (len - b.len + 1)) n <<= 1; b.get_inv(c, n); c.get_mod(len - b.len + 1); n = 1; while (n < len + c.len) n <<= 1; for (int i = 0; i < len; i++) A[i] = a[i]; for (int i = len; i < n; i++) A[i] = 0; for (int i = 0; i < c.len; i++) B[i] = c.a[i]; for (int i = c.len; i < n; i++) B[i] = 0; NTT(A, n, 1); NTT(B, n, 1); for (int i = 0; i < n; i++) A[i] = (long long)A[i] * B[i] % 998244353; NTT(A, n, -1); for (int i = 0; i < c.len; i++) c.a[i] = A[i]; c.rev(); rev(); b.rev(); return c; } poly operator%(poly b) { rev(); b.rev(); poly c; int n = 1; while (n < (len - b.len + 1)) n <<= 1; b.get_inv(c, n); c.get_mod(len - b.len + 1); n = 1; while (n < len + c.len) n <<= 1; for (int i = 0; i < len; i++) A[i] = a[i]; for (int i = len; i < n; i++) A[i] = 0; for (int i = 0; i < c.len; i++) B[i] = c.a[i]; for (int i = c.len; i < n; i++) B[i] = 0; NTT(A, n, 1); NTT(B, n, 1); for (int i = 0; i < n; i++) A[i] = (long long)A[i] * B[i] % 998244353; NTT(A, n, -1); for (int i = 0; i < c.len; i++) c.a[i] = A[i]; c.rev(); rev(); b.rev(); for (int i = 0; i < c.len; i++) A[i] = c.a[i]; for (int i = c.len; i < n; i++) A[i] = 0; for (int i = 0; i < b.len; i++) B[i] = b.a[i]; for (int i = b.len; i < n; i++) B[i] = 0; NTT(A, n, 1); NTT(B, n, 1); for (int i = 0; i < n; i++) A[i] = (long long)A[i] * B[i] % 998244353; NTT(A, n, -1); c.len = b.len; c.resize(c.len); for (int i = 0; i < c.len; i++) c.a[i] = (a[i] - A[i] + 998244353) % 998244353; return c; } } a, b; void get_rot(const poly &a, poly &b, int len) { if (len == 1) { b.a.push_back(1); b.len = 1; return; } get_rot(a, b, len >> 1); poly c; c.clear(); b.get_inv(c, len); b = b + (c * a); b = b * ((998244353 + 1) / 2); b.get_mod(len); } void get_exp(const poly &a, poly &b, int len) { if (len == 1) { b.a.push_back(1); b.len = 1; return; } get_exp(a, b, len >> 1); b = b * ((a - b.get_ln(len)) + 1); b.get_mod(len); } int main() { scanf( %d%d , &n, &m); a.resize(m + 1); a.a[0] = 1; for (int i = 1, x; i <= n; i++) { scanf( %d , &x); if (x <= m) a.a[x] = 998244353 - 4; } int len = 1; while (len <= m) len <<= 1; get_rot(a, b, len); b.a[0]++; a.clear(); b.get_inv(a, len); for (int i = 1; i <= m; i++) printf( %d n , (a.a[i] << 1) % 998244353); }
|
#include <bits/stdc++.h> int main(int argc, char *argv[]) { int i, j; unsigned long long n, result, a[10]; a[0] = 0; a[1] = 9; for (i = 2; i <= 9; i++) a[i] = a[i - 1] * 10 + 9; scanf( %llu , &n); result = 0; i = 9; ; while (n < a[i]) i--; result = result + (n - a[i]) * (i + 1); for (j = 1; j <= i; j++) result = result + (a[j] - a[j - 1]) * j; printf( %llu , result); return 0; }
|
#include <bits/stdc++.h> using namespace std; ifstream f( date.in ); queue<long long> q; long long n, k, fr[1000001]; long long GCD(long long x, long long y) { long long r; do { r = x % y; x = y; y = r; } while (y != 0); return x; } int main() { long long ans; cin >> n >> k; ans = k; for (int i = 1; i <= n; i++) { long long x; cin >> x; ans = GCD(x, ans); } cout << k / ans << n ; for (int i = 0; i < k / ans; i++) cout << i * ans << ; }
|
#include <bits/stdc++.h> using namespace std; int n, a[1000000], k, cnt, ans; int main() { cin >> n; a[0] = 1; a[1] = 1; a[2] = 0; for (int i = 1; i < n; i++) { if (a[i] == 0) { for (int j = i * i; j <= n; j += i) { a[j] = 1; } } } for (int i = 1; i <= n; i++) { cnt = 0; for (int j = i; j > 0; j--) { if (i % j == 0) { k = i / j; } else { continue; } if (a[k] == 0) { cnt++; } } if (cnt == 2) { ans++; } } cout << ans; }
|
#include <bits/stdc++.h> using namespace std; int main() { string p; getline(cin, p); bool f = 0; for (int i = 0; i < p.size(); i++) { if (p[i] >= a && p[i] <= z ) { if (p[i] == a || p[i] == i || p[i] == u || p[i] == e || p[i] == o || p[i] == y ) f = 1; else f = 0; } if (p[i] >= A && p[i] <= Z ) { if (p[i] == A || p[i] == I || p[i] == U || p[i] == E || p[i] == O || p[i] == Y ) f = 1; else f = 0; } } if (f) cout << YES ; else cout << NO ; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long summ(long long n) { return (n * (n + 1)) / 2; } long long sear(long long n, long long k) { if (n == 1 && k == 1) return 0; long long lo = 0, hi = n, mid; long long sum, eaten; while (lo <= hi) { mid = lo + (hi - lo) / 2; sum = summ(n - mid); if (mid + k == sum) return mid; else if (mid + k > sum) hi = mid - 1; else lo = mid + 1; } return mid; } int main() { long long n, k; cin >> n >> k; if (n == 1 && k == 1) { cout << 0 << endl; return 0; } long long ans = sear(n, k); cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long query(long long t, long long i, long long j, long long k) { cout << t << << i << << j << << k << << n ; cout.flush(); long long res; cin >> res; return res; } void solve() { long long n; cin >> n; long long t1 = 1; long long oo = 5e18; vector<pair<long long, long long>> area(n + 1, {-oo, -1}); for (long long i = 1; i <= n; ++i) area[i].second = i; long long t2 = 2; for (long long i = 3; i <= n; ++i) { long long q2 = query(2, t1, t2, i); t2 = (q2 > 0 ? t2 : i); } long long mid = 3, max_s = 0; for (long long i = 2; i <= n; ++i) { if (i == t2) continue; long long q1 = query(1, t1, t2, i); area[i].first = q1; if (q1 > max_s) { max_s = q1; mid = i; } } area[mid].first = 0; for (long long i = 2; i <= n; ++i) { if (i == t2 || i == mid) continue; long long q2 = query(2, t1, mid, i); if (q2 > 0) area[i].first = oo - area[i].first; if (q2 < 0) area[i].first = -oo + area[i].first; } sort(area.begin() + 1, area.end()); cout << 0 ; for (long long i = 1; i <= n; ++i) cout << area[i].second << (i == n ? n : ); } int main() { solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, centru; int l[10]; int r[10]; int vars(int i, int tip) { if (!tip) { if (l[i] <= centru && centru <= r[i]) return centru - l[i]; else if (r[i] < centru) return r[i] - l[i] + 1; return 0; } else if (tip == 1) return ((bool)(l[i] <= centru && centru <= r[i])); else { if (l[i] <= centru && centru <= r[i]) return r[i] - centru; else if (centru < l[i]) return r[i] - l[i] + 1; return 0; } } int tip[10]; int _s[3]; double sum; void backtr(int poz) { if (poz == (n + 1)) { if (!_s[1]) return; if (_s[2] >= 2) return; if (_s[2] == 0) { if (_s[1] == 1) return; } double prod = 1; for (int i = 1; i <= n; i++) prod *= vars(i, tip[i]); sum += centru * prod; return; } for (int i = 0; i < 3; i++) { _s[i]++; tip[poz] = i; backtr(poz + 1); _s[i]--; } } int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> l[i] >> r[i]; for (int i = 1; i <= 10000; i++) { centru = i; backtr(1); } for (int i = 1; i <= n; i++) { sum /= (r[i] - l[i] + 1); } cout << fixed << setprecision(12) << sum << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T> inline T abs(T &a) { return a > 0 ? a : -a; } template <class T> inline T min(T &a, T &b) { return a < b ? a : b; } template <class T> inline T max(T &a, T &b) { return a > b ? a : b; } inline void read(int &x) { char ch; while ((ch = getchar()) && !(ch >= 0 && ch <= 9 )) ; x = ch - 0 ; while ((ch = getchar()) && (ch >= 0 && ch <= 9 )) x = x * 10 + ch - 0 ; } const int N = 2000002; int n, m, w[N], ans[N], dy[N], T = 1, t[N << 2]; void add(int x, int c) { for (t[x += T] += c, x >>= 1; x; x >>= 1) t[x] = t[x << 1] + t[(x << 1) + 1]; } int find(int k, int l, int r) { int x = 1; while (l < r) { int mid = l + r >> 1; if (t[x << 1] >= k) x = x << 1, r = mid; else k -= t[x << 1], x = x << 1 | 1, l = mid + 1; } return l; } int main() { read(n); read(m); int Len = n + m, gs = 0; while (T < Len) T <<= 1, gs++; T--; for (int i = m + 1; i <= n + m; i++) w[i] = i - m, add(i, 1); int x, y; for (int i = m; i >= 1; i--) { read(x); read(y); int p = find(y, 1, T + 1); w[i] = w[p]; add(i, 1); add(p, -1); if (ans[w[i]] && ans[w[i]] != x) { puts( -1 ); return 0; } ans[w[i]] = x; if (dy[x] && dy[x] != w[i]) { puts( -1 ); return 0; } dy[x] = w[i]; } int j = 1; for (int i = 1; i <= n; i++) { if (ans[i]) printf( %d , ans[i]); else { for (; dy[j]; j++) ; printf( %d , j++); } } }
|
#include <bits/stdc++.h> using namespace std; long long a[200005]; map<long long, int> mp; int main() { int t; scanf( %d , &t); while (t--) { long long n; scanf( %lld , &n); long long sum = 0; mp.clear(); for (int i = 1; i <= n; i++) { scanf( %lld , &a[i]); sum += a[i]; } long long res = 0; for (int i = 1; i <= n; i++) { res += mp[2 * sum - n * a[i]]; mp[n * a[i]]++; } printf( %lld n , res); } }
|
#include <bits/stdc++.h> #pragma GCC target( sse,sse2,sse3,ssse3,sse4,abm,mmx,avx,avx2,popcnt,fma ) #pragma GCC optimize( fast-math ) #pragma GCC optimize( unroll-loops ) #pragma GCC optimize( Ofast ) using namespace std; const long long mod = 1e9 + 7, mod2 = 998244353; const long double eps = 1e-6; const long long inf = 1e18; const int base = 1e9; const long double PI = 3.1415926; void deb(long double first){}; int n, a[100 * 1000]; long long k; unsigned int bitcount(unsigned long long val) { return __builtin_popcount(val) + __builtin_popcount(val >> 32); } void local() { freopen( test.in , r , stdin); } void remote() {} void read() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cin >> n >> k; for (int i = 0; i < n; i++) cin >> a[i]; } long long cnt(long long bound, vector<int> &v) { long long res = 0; for (int i = 0; i < n; i++) { int l = 0, r = a[i] + 1; while (r - l > 1) { int m = (r + l) / 2; if (a[i] - 3 * 1ll * m * (m - 1) - 1 >= bound) l = m; else r = m; } v[i] = l; res += l; } return res; } int main() { remote(); read(); vector<int> v(n); long long l = -4e18, r = 4e18; while (l < r) { long long m = l + (r - l) / 2; long long val = cnt(m, v); if (val > k) { l = m + 1; } else r = m; } long long val = cnt(l, v); vector<int> res = v; long long val2 = cnt(l - 1, v); for (int i = 0; i < n; i++) if (v[i] == res[i] + 1 && val < k) res[i]++, val++; for (int i = 0; i < n; i++) cout << res[i] << ; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; cout << 1 + 6 * (n) * (n + 1) / 2 << endl; }
|
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; const int MAX = 200005; int cnt[MAX], pre[MAX], suf[MAX]; int bpow(int a, int b) { int ans = 1; while (b) { if (b & 1) ans = 1LL * ans * a % MOD; b >>= 1; a = 1LL * a * a % MOD; } return ans; } int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; for (int i = 0; i < n; i++) { int val; cin >> val; cnt[val]++; } pre[0] = 1; for (int i = 1; i < MAX; i++) pre[i] = 1LL * pre[i - 1] * (cnt[i - 1] + 1) % (MOD - 1); suf[MAX - 1] = 1; for (int i = MAX - 2; i >= 0; i--) suf[i] = 1LL * suf[i + 1] * (cnt[i] + 1) % (MOD - 1); int ans = 1; for (int i = 0; i < MAX; i++) for (int j = 1; j <= cnt[i]; j++) ans = 1LL * ans * bpow(bpow(i, j), 1LL * pre[i] * suf[i + 1] % (MOD - 1)) % MOD; cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int a[610000], i, j, k, l, n, m, p[610000], t, last, o, r, mid; char c[610000]; bool check(int mid) { int tmp = 1e9, res = 0; p[0] = mid; m = last; for (i = 1; i <= n; ++i) { p[i] = p[i - 1] + a[i]; if (p[i] == 0 && p[i - 1] == -1) m = max(m, i); } if (m == 0) return 1; for (i = 1; i <= m; ++i) { if (p[i - 1] == 0 && p[i] == -1) { o = i; tmp = min(tmp, res + (m - i) * 2); } if (p[i - 1] == -1 && p[i] == 0) { if (i == m) tmp = min(tmp, res + m - o); res += (i - o) * 2; } res++; } tmp = min(tmp, res - 1); return tmp + 1 <= t; } int main() { scanf( %d%d%s , &n, &t, c + 1); for (i = 1; i <= n; ++i) a[i] = c[i] == H ? -1 : c[i] == S ? 1 : 0; for (i = 1; i <= n; ++i) { if (a[i] == -1) r++, last = i; if (a[i] == 1) l--; } l += r; if (l < 0) l = 0; if (last > t) { printf( -1 n ); exit(0); } while (l <= r) { mid = (l + r) / 2; if (check(mid)) r = mid - 1; else l = mid + 1; } printf( %d n , r + 1); }
|
#include <bits/stdc++.h> using namespace std; long long a[200010]; long long l[200010]; long long r[200010]; int main() { ios_base::sync_with_stdio(0); long long n, h; cin >> n >> h; vector<long long> rast2(n + 1, 0); for (int i = 1; i <= n; i++) { cin >> l[i] >> r[i]; rast2[i] = r[i] - l[i]; } for (int i = 1; i <= n; i++) { rast2[i] += rast2[i - 1]; } vector<long long> rast(n + 1, 0); for (int i = 1; i < n; i++) { rast[i] = l[i + 1] - r[i]; } rast[n] = 2e9; for (int i = 1; i <= n; i++) { rast[i] += rast[i - 1]; } long long ans = 0; for (int i = 1; i <= n; i++) { long long r = lower_bound(rast.begin(), rast.end(), h + rast[i - 1]) - (rast.begin()); if (r <= n) ans = max(ans, (rast2[r] - rast2[i - 1]) + h); } cout << ans; }
|
#include <bits/stdc++.h> using namespace std; int n; set<pair<int, int> > s; vector<int> od; int p[512]; vector<int> v[512]; inline void dfs(int b, int pr = -1) { od.push_back(b); p[b] = pr; auto it = s.lower_bound(make_pair(b, -1)); while (it != s.end() && (*it).first == b) { if (it->second == pr) { it = next(it); continue; } dfs(it->second, b); v[b].push_back(it->second); v[it->second].push_back(b); it = next(it); } } bool us[512]; void init() { for (int i = 0; i <= n; i++) { v[i].clear(); us[i] = false; } } int sz[512]; inline pair<int, int> cent(int b, int ALL, int pr) { sz[b] = 1; pair<int, int> ret = make_pair(INT_MAX, -1); int mx = -1; for (int go : v[b]) { if (us[go]) continue; if (go == pr) continue; ret = min(ret, cent(go, ALL, b)); sz[b] += sz[go]; mx = max(mx, sz[go]); } mx = max(mx, ALL - sz[b]); ret = min(ret, make_pair(mx, b)); return ret; } inline void er(int a, int b) { s.erase(make_pair(a, b)); s.erase(make_pair(b, a)); } inline void ins(int a, int b) { s.insert(make_pair(a, b)); s.insert(make_pair(b, a)); } bool ok(vector<int> &vv, int num, int root, int root2) { cout << 1 << endl; cout << root << endl; cout << num + 1 << endl; for (int j = 0; j <= num; j++) { if (j) printf( ); printf( %d , vv[j]); } puts( ); cout << root2 << endl; fflush(stdout); int way; scanf( %d , &way); if (way == num + 1) { return true; } return false; } inline void df(int b, int add) { cent(b, 0, -1); b = cent(b, sz[b], -1).second; vector<int> z; for (int go : v[b]) { z.push_back(go); } us[b] = true; int mint = 0; int maxt = z.size(); if (z.size() && ok(z, 0, add, b) == false) { maxt = mint; } while (mint + 1 < maxt) { int mid = (mint + maxt) / 2; if (ok(z, mid, add, b)) { mint = mid; } else { maxt = mid; } } if (maxt == z.size()) { ins(b, add); return; } if (us[z[maxt]] == false) { df(z[maxt], add); return; } er(z[maxt], b); ins(z[maxt], add); ins(add, b); } int zz[512]; vector<int> o; bool cmp(int a, int b) { return zz[a] > zz[b]; } int main() { cin >> n; zz[1] = n; for (int i = 2; i <= n; i++) { cout << 1 << endl; cout << 1 << endl; cout << n - 1 << endl; for (int j = 2; j <= n; j++) { if (j > 1) printf( ); printf( %d , j); } puts( ); printf( %d n , i); fflush(stdout); int a; scanf( %d , &a); zz[i] = a; } for (int i = 2; i <= n; i++) o.push_back(i); sort(o.begin(), o.end(), cmp); for (int i : o) { od.clear(); init(); dfs(1); reverse(od.begin(), od.end()); df(1, i); } puts( ANSWER ); for (auto it : s) { if (it.first > it.second) continue; printf( %d %d n , it.first, it.second); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int N, M; map<string, string> m1; int main() { cin >> N >> M; string s1; string s2; for (int i = 1; i <= N; i++) { cin >> s1; cin >> s2; m1[s2] = s1; } for (int i = 1; i <= M; i++) { cin >> s1; cin >> s2; s2.erase(s2.begin() + s2.size() - 1); cout << s1 << ; cout << s2 << ; # << m1[s2] << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int p[110]; int main() { int n, cnt; cin >> n; for (int i = 0; i < n; i++) cin >> p[i]; string s; getline(cin, s); for (int i = 0; i < n; i++) { cnt = 0; getline(cin, s); for (int j = 0; j < s.size(); j++) if (s[j] == a || s[j] == e || s[j] == i || s[j] == o || s[j] == u || s[j] == y ) cnt++; if (cnt != p[i]) { cout << NO ; return 0; } } cout << YES ; return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T, typename S> ostream &operator<<(ostream &os, const pair<T, S> &v) { os << ( ; os << v.first << , << v.second << ) ; return os; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { os << [ ; long long sz = v.size(); for (long long i = 0; i < sz; ++i) { os << v[i]; if (i != sz - 1) os << , ; } os << ] n ; return os; } template <typename T> ostream &operator<<(ostream &os, const set<T> &v) { T last = *v.rbegin(); os << [ ; for (auto it : v) { os << it; if (it != last) os << , ; } os << ] n ; return os; } template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &v) { for (auto it : v) { os << it.first << : << it.second << n ; } return os; } long long power(long long a, long long b) { long long res = 1; while (b) { if (b % 2) { res = (res * a) % 1000000007; } b /= 2; a = (a * a) % 1000000007; } return res; } template <typename Arg1> void __f(const char *name, Arg1 &&arg1) { cerr << name << : << arg1 << std::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...); } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n, T; cin >> n >> T; vector<pair<long long, long long> > arr; for (__typeof(1) i = 1; i <= n; i++) { long long t; cin >> t; long long from = t - i; long long to = T - i; if (to > from && to > 0) { arr.push_back({from, 1}); arr.push_back({to, -1}); } } sort((arr).begin(), (arr).end()); long long curr = 0, ans = 0; for (auto it : arr) { curr += it.second; ans = max(ans, curr); } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int32_t main() { long long int t; cin >> t; while (t--) { long long int x = 0; long long int n, m; cin >> n >> m; for (long long int i = 0; i < n; i++) { long long int a, b, c, d; cin >> a >> b >> c >> d; if (b == c && m % 2 != 1 && x != 1) { cout << Yes << endl; x = 1; } } if (x == 0) cout << No << endl; } }
|
#include <bits/stdc++.h> using namespace std; const int N = 200020; long long int n; int main() { cin >> n; for (long long int i = 1; i <= n - 1; i++) { for (long long int j = 1; j <= n - 1; j++) { if (i == j) cout << 0 ; else cout << 1 + (i + j - 2) % (n - 1) << ; } cout << (2 * i - 2) % (n - 1) + 1 << endl; } for (long long int i = 1; i <= n - 1; i++) { cout << (2 * i - 2) % (n - 1) + 1 << ; } cout << 0 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int p[1001][1001], row[1001], col[1001]; int main() { int n, m, k; scanf( %d%d%d , &n, &m, &k); for (int r = 1; r <= n; ++r) row[r] = r; for (int c = 1; c <= m; ++c) col[c] = c; for (int r = 1; r <= n; ++r) for (int c = 1; c <= m; ++c) scanf( %d , &p[r][c]); while (k--) { char s[2]; int x, y; scanf( %s%d%d , s, &x, &y); switch (s[0]) { case r : swap(row[x], row[y]); break; case c : swap(col[x], col[y]); break; case g : printf( %d n , p[row[x]][col[y]]); break; default: break; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; struct P { int x, y; bool operator<(const P &a) const { return x > a.x; } } a[N]; int main() { static int n, b[N * 2]; cin >> n; for (int i = 1; i <= n; i++) scanf( %d , (int *)(a + i)), a[i].y = i * 2 - 1; sort(a + 1, a + 1 + n); for (int i = 1; i < n; i++) printf( %d %d n , a[i].y, a[i + 1].y); for (int i = 1; i <= n; i++) b[i] = a[i].y; for (int i = 1, aid, *bid; i <= n; i++) { aid = a[i].y + 1, bid = b + i + a[i].x; if (!*bid) printf( %d %d n , aid, *(bid - 1)), *bid = aid; else printf( %d %d n , aid, *--bid); } return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<int> graph[100005]; int a[100005], b[100005]; vector<int> ans; void dfs(int source, int parent, int oddlevel, int evenlevel, int depth) { if (depth % 2 == 1) a[source] ^= oddlevel; else a[source] ^= evenlevel; if (a[source] != b[source]) { a[source] ^= 1; if (depth % 2 == 1) oddlevel++; else evenlevel++; oddlevel %= 2, evenlevel %= 2; ans.push_back(source); } for (int i = 0; i < graph[source].size(); i++) { int child = graph[source][i]; if (child == parent) continue; dfs(child, source, oddlevel, evenlevel, depth + 1); } } int main() { int n; cin >> n; for (int i = 1; i < n; i++) { int x, y; cin >> x >> y; graph[x].push_back(y); graph[y].push_back(x); } for (int i = 1; i <= n; i++) { cin >> a[i]; } for (int i = 1; i <= n; i++) cin >> b[i]; dfs(1, 0, 0, 0, 0); cout << ans.size() << endl; for (int i = 0; i < ans.size(); i++) { cout << ans[i] << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; while (cin >> n) { string s; cin >> s; int l[3005], r[3005]; memset(l, -1, sizeof(l)); memset(r, -1, sizeof(r)); int cnt = 0, t1 = 0, t2 = 0; for (int i = 0; i < n; ++i) { if (s[i] == L ) { l[t1++] = i; continue; } if (s[i] == R ) { r[t2++] = i; continue; } } if (l[0] == r[0]) { cout << n << endl; continue; } if (l[0] == -1) { cout << r[0] << endl; continue; } if (r[0] == -1) { cout << n - l[0] - 1 << endl; continue; } if (l[0] < r[0]) { cnt += l[0] + 1; for (int i = 1; i < t1; ++i) { int t = l[i] - r[i - 1]; cnt += t + 1; if (t % 2 == 0) cnt--; } if (t1 == t2) cnt += n - r[t2 - 1]; } else { for (int i = 0; i < t1; ++i) { int t = l[i] - r[i]; cnt += t + 1; if (t % 2 == 0) cnt--; } if (t2 > t1) cnt += n - r[t2 - 1]; } cout << n - cnt << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxN = 100100; const long double INF = 1e100; const long double eps = 1e-6; const long double PI = 3.14159265358979323846264338328; long long x[maxN], y[maxN]; long double Dis(long long a, long long b, long long p, long long q) { long double aa = 1.0 * a, bb = 1.0 * b, pp = 1.0 * p, qq = 1.0 * q; return (aa - pp) * (aa - pp) + (bb - qq) * (bb - qq); } long double DfromL(long long X1, long long Y1, long long aa, long long bb, long long pp, long long qq) { long double X = 1.0 * X1, Y = 1.0 * Y1, a = 1.0 * aa, b = 1.0 * bb, p = 1.0 * pp, q = 1.0 * qq; bool Inf = (a == p); long double m = (Inf) ? INF : ((b - q) / (a - p)); long double c = (Inf) ? INF : ((b - m * a)); bool zero = (!Inf && m == 0.0); long double m1 = (Inf) ? (0) : (zero) ? INF : (-1.0 / m); long double c1 = (Inf) ? (Y) : (zero) ? INF : (Y - m1 * X); long double XX = (Inf) ? (a) : (zero) ? (X) : ((c1 - c) / (m - m1)); long double YY = (Inf) ? (Y) : (zero) ? (b) : ((m * c1 - m1 * c) / (m - m1)); if (XX >= min(a, p) && XX <= max(a, p) && YY >= min(b, q) && YY <= max(b, q)) { if (Inf) return (X - XX) * (X - XX); if (zero) return (Y - YY) * (Y - YY); return ((m * X - Y + c) * (m * X - Y + c)) / (1.0 + m * m); } else return -1.0; } int main() { ios::sync_with_stdio(false); long long n, X, Y; cin >> n >> X >> Y; for (int i = 0; i < n; i++) cin >> x[i] >> y[i]; long double maxR = -1.0, minR = INF; for (int i = 0; i < n; i++) { long double dis = Dis(X, Y, x[i], y[i]); maxR = max(maxR, dis); minR = min(minR, dis); long double diS = DfromL(X, Y, x[i], y[i], x[(i + 1) % n], y[(i + 1) % n]); if (diS != -1.0) { maxR = max(maxR, diS); minR = min(minR, diS); } } long double ans = PI * (maxR - minR); cout << setprecision(20) << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int a[500005]; int q[500005]; int n, k, d; int main() { scanf( %d%d%d , &n, &k, &d); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); sort(a + 1, a + n + 1); int l = 1, r = 1; q[l] = 0; for (int i = k; i <= n; i++) { while (l <= r && a[i] - a[q[l] + 1] > d) l++; if (l <= r && i - q[l] >= k) q[++r] = i; } if (q[r] == n) printf( YES n ); else printf( NO n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, i; cin >> n; if (n == 1 || n == 2) cout << -1 ; else { for (i = n; i >= 1; i--) cout << i << ; cout << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; vector<int> a(n + 1); for (int i = 1; i <= n; ++i) { cin >> a[i]; } sort(a.begin(), a.end()); vector<vector<vector<int>>> dp( 2, vector<vector<int>>(k + 1, vector<int>(k + 1))); dp[0][0][0] = 1; int ans = 0; set<int> sad; for (int i = 1; i <= n; ++i) { for (int j = 0; j <= k; ++j) { for (int l = 0; l <= j; ++l) { int i2 = i % 2; dp[i2][j][l] = dp[abs(i2 - 1)][j][l]; if (a[i] <= j) { dp[i2][j][l] = max(dp[abs(i2 - 1)][j][l], dp[abs(i2 - 1)][j - a[i]][l]); if (a[i] <= l) { dp[i2][j][l] = max(dp[i2][j][l], dp[abs(i2 - 1)][j - a[i]][l - a[i]]); } } if (i == n && j == k && dp[i2][j][l] != 0) { ++ans; sad.insert(l); } } } } cout << ans << endl; for (auto i : sad) { cout << i << ; } }
|
#include <bits/stdc++.h> using namespace std; long long int gcd(long long int m, long long int n) { if (n == 0) return m; return gcd(n, m % n); } int MOD = 1000000000; long long int powmod(long long int a, long long int b) { if (b == 0) return 1; long long int x = powmod(a, b / 2); long long int y = (x * x) % MOD; if (b % 2) return (a * y) % MOD; return y % MOD; } int main() { std::ios::sync_with_stdio(false); int n, k; cin >> n >> k; int z; int a[10000]; for (int i = 0; i < n; i++) cin >> a[i]; int ans = 0; for (int i = 0; i < n - 1; i++) { if (a[i] > 8) { a[i + 1] = a[i + 1] + a[i] - 8; k = k - 8; } else k = k - a[i]; if (k <= 0) { cout << i + 1 << endl; return 0; } } if (k - min(a[n - 1], 8) > 0) cout << -1 << endl; else cout << n << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; bool pid_comp_second(pair<int, double> a, pair<int, double> b) { if (a.second == b.second) return a.first < b.first; return a.second > b.second; } int main() { double x, y, z; cin >> x >> y >> z; map<int, string> expr; expr[1] = x^y^z ; expr[2] = x^z^y ; expr[3] = (x^y)^z ; expr[5] = y^x^z ; expr[6] = y^z^x ; expr[7] = (y^x)^z ; expr[9] = z^x^y ; expr[10] = z^y^x ; expr[11] = (z^x)^y ; vector<pair<int, double> > nums; if (x < 1 || x < 1 || x < 1) { nums.push_back(make_pair(1, pow(y, z) * log(x))); nums.push_back(make_pair(2, pow(z, y) * log(x))); nums.push_back(make_pair(3, y * z * log(x))); nums.push_back(make_pair(5, pow(x, z) * log(y))); nums.push_back(make_pair(6, pow(z, x) * log(y))); nums.push_back(make_pair(7, x * z * log(y))); nums.push_back(make_pair(9, pow(x, y) * log(z))); nums.push_back(make_pair(10, pow(y, x) * log(z))); nums.push_back(make_pair(11, x * y * log(z))); } else { nums.push_back(make_pair(1, z * log(y) + log(log(x)))); nums.push_back(make_pair(2, y * log(z) + log(log(x)))); nums.push_back(make_pair(3, log(y) + log(z) + log(log(x)))); nums.push_back(make_pair(5, z * log(x) + log(log(y)))); nums.push_back(make_pair(6, x * log(z) + log(log(y)))); nums.push_back(make_pair(7, log(x) + log(z) + log(log(y)))); nums.push_back(make_pair(9, y * log(x) + log(log(z)))); nums.push_back(make_pair(10, x * log(y) + log(log(z)))); nums.push_back(make_pair(11, log(x) + log(y) + log(log(z)))); } sort(nums.begin(), nums.end(), pid_comp_second); cout << expr[nums[0].first] << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; ofstream fo( test.out ); ifstream fi( test.inp ); const long long MOD = 1e9 + 7; const long long base = 269; const int N = 1e5 + 5; long long n, m, q, K, pos, t, rs, r; long long cnt10, cnt11; string s, a, b; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n; cin >> a >> b; for (long long(i) = 0; (i) < (n); (i)++) { if (a[i] == 1 && b[i] == 0 ) cnt10++; if (a[i] == 1 && b[i] == 1 ) cnt11++; } for (long long(i) = 0; (i) < (n); (i)++) { if (a[i] == 0 && b[i] == 0 ) { rs += cnt11; rs += cnt10; } if (a[i] == 0 && b[i] == 1 ) rs += cnt10; } cout << rs; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t, n, ind; cin >> t; while (t--) { cin >> n; ind = -1; int a[n]; for (int i = 0; i < n; ++i) { cin >> a[i]; if (a[i] % 2 == 0) ind = i; } if (ind != -1) cout << 1 n << ind + 1 << n ; else if (n > 1) cout << 2 n1 2 n ; else cout << -1 n ; } }
|
#include <bits/stdc++.h> using namespace std; using namespace std; struct my { int a; double b; }; bool Cmp(my a, my b) { return a.b <= b.b; } int main() { int n, m; cin >> n >> m; my mine[n]; for (int i = 0; i < n; ++i) { int a; cin >> a; double b; cin >> b; mine[i].a = a; mine[i].b = b; } sort(mine, mine + n, Cmp); int ord[n]; for (int i = 0; i < n; ++i) { ord[i] = mine[i].a; } int dp[n]; for (int i = 0; i < n; ++i) { dp[i] = 1; } for (int i = 0; i < n; i++) { for (int j = i - 1; j >= 0; j--) { if (ord[j] <= ord[i]) { dp[i] = max(dp[j] + 1, dp[i]); } } } cout << n - *max_element(dp, dp + n) << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int Maxn = 1e7 + 10, M = 998244353; int n, m, k, inv[Maxn], s[Maxn], idk[Maxn]; int mo2(int x) { return (x < 0) ? x + M : x; } int fpow(int a, int p = M - 2) { int ret = 1; for (; p; p >>= 1, a = 1ll * a * a % M) if (p & 1) ret = 1ll * ret * a % M; return ret; } void init(int n) { inv[1] = 1; for (int i = 2; i <= n; i++) inv[i] = M - 1ll * inv[M % i] * (M / i) % M; } void get_idk(int k) { for (int i = 0; i <= k; i++) idk[i] = fpow(i, k); } int main() { scanf( %d%d%d , &n, &m, &k); int p = fpow(m); init(k); s[k] = 1; int pw = 1, C = 1; for (int i = k - 1; i >= 0; i--) { pw = 1ll * pw * (M - p) % M; C = 1ll * C * (n - i - 1 + M) % M * inv[k - i] % M; s[i] = (1ll * (1 - p + M) * s[i + 1] + 1ll * C * pw) % M; } int E = 0; pw = C = 1; get_idk(k); for (int i = 1; i <= k; i++) { pw = 1ll * pw * p % M; C = 1ll * C * (n - i + 1 + M) % M * inv[i] % M; E = (E + 1ll * idk[i] * C % M * pw % M * s[i]) % M; } printf( %d n , E); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 1000000009; const double PI = acos(-1.0); const double eps = 1e-8; const int MAXN = 0; const int MAXM = 0; bool a[5002]; int i, j, k, n, h, m, id, p, hesh; map<int, int> M; char c; int ans = 0; int main() { cin >> h >> m >> n; for (i = 0; i < n; i++) { cin >> c; if (c == - ) { cin >> id; a[M[id]] = 0; } else { cin >> id >> hesh; while (a[hesh] != 0) { hesh = (hesh + m) % h; ans++; } a[hesh] = true; M[id] = hesh; } } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, i, a, b, x, y, ans = 0; scanf( %d , &n); printf( YES n ); for (int i = 1; i <= n; i++) { scanf( %d %d %d %d , &a, &b, &x, &y); x = min(a, x); y = min(y, b); ans = abs(x) % 2; ans = ans * 2 + (abs(y) % 2); printf( %d n , ans + 1); } }
|
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3fll; vector<vector<string> > dp; int n, m; string resp = ; vector<string> a; vector<set<char> > occr; string solve(int at, int estado) { if (at == m) { return ; } if (dp[at][estado] != ) { return dp[at][estado]; } for (char c : occr[at]) { bool pode = true; for (int I = 0; I < n; I++) { if (a[I][at] != c && (estado & (1 << I))) { pode = false; } } if (!pode) { continue; } int temp = estado; for (int I = 0; I < n; I++) { if (a[I][at] != c) { temp |= (1 << I); } } string res = solve(at + 1, temp); if (res != ) { return dp[at][estado] = c + res; } } return dp[at][estado] = ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) { cin >> n >> m; a.clear(); a.resize(n); occr.clear(); occr.resize(m); dp.clear(); dp.resize(11, vector<string>(1030, )); for (int I = 0; I < n; I++) { cin >> a[I]; } for (int I = 0; I < n; I++) { for (int J = 0; J < m; J++) { occr[J].insert(a[I][J]); } } string resp = solve(0, 0); if (resp == ) { cout << -1 << n ; } else { cout << resp << n ; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long MX = 1e5 + 10; long long A[MX]; long long cnt[MX]; vector<long long> pos[MX]; long long ans[MX]; void init(long long n) { for (long long i = 0; i <= n + 2; i++) cnt[i] = 0; for (long long i = 0; i <= n + 2; i++) pos[i].clear(); for (long long i = 0; i <= n + 2; i++) ans[i] = -1; } void salida(long long n, long long val) { for (long long i = 0; i < n; i++) if (ans[i] == -1) ans[i] = val; cout << YES n ; for (long long i = 0; i < n; i++) cout << ans[i] << ; cout << n ; } void solve() { long long n, fijo, tot, x; cin >> n >> fijo >> tot; long long nfijo = tot - fijo; init(n); set<long long> s; for (long long i = 0; i < n; i++) { cin >> x; A[i] = x; cnt[x]++; pos[x].push_back(i); s.insert(x); } long long maxNum = n + 1; priority_queue<pair<long long, long long> > pq; for (long long i = 1; i <= maxNum; i++) { if (cnt[i] != 0) pq.push({cnt[i], i}); } while (!pq.empty() && fijo != 0) { long long cn = pq.top().first; long long val = pq.top().second; pq.pop(); cnt[val]--; if (cnt[val] != 0) pq.push({cnt[val], val}); long long sz = pos[val].size(); ans[pos[val][sz - 1]] = val; pos[val].erase(pos[val].begin() + sz - 1); fijo--; } if (fijo > 0) { cout << NO n ; return; } long long numExtra = -1; for (long long i = 1; i <= maxNum; i++) { if (s.find(i) == s.end()) numExtra = i; } if (nfijo == 0) { salida(n, numExtra); return; } long long falta = 0; for (long long i = 1; i <= maxNum; i++) falta += cnt[i]; long long mxSize = pq.top().first; vector<long long> posi; while (!pq.empty()) { long long val = pq.top().second; pq.pop(); for (long long xx : pos[val]) posi.push_back(xx); } if (mxSize <= falta - mxSize) { long long sz = posi.size(); long long mid = sz / 2; for (long long i = 0; i < sz; i++) { if (nfijo == 0) break; long long cur = i; long long nxt = (i + mid) % sz; ans[posi[cur]] = A[posi[nxt]]; nfijo--; } salida(n, numExtra); } else { reverse(posi.begin(), posi.end()); long long mxPos = falta - mxSize; if (mxPos * 2 < nfijo) { cout << NO n ; return; } long long sz = posi.size(); for (long long i = 0; i < sz; i++) { if (nfijo == 0) break; long long cur = i; long long nxt = i + mxPos; if (nfijo == 0) break; ans[posi[cur]] = A[posi[nxt]]; nfijo--; if (nfijo == 0) break; ans[posi[nxt]] = A[posi[cur]]; nfijo--; } salida(n, numExtra); } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout.precision(10); cout << fixed; long long t; cin >> t; while (t--) solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const double eps = 1e-9; const double pi = acos(-1.0); const double dinf = 1e250; const long long INF = (long long)(2e18); const int inf = (int)(1e9 + 7); struct myt { int d, s, t; }; void out(int a, int b) { cout << a << << b << n ; } vector<int> ind; vector<vector<int> > g; int32_t main() { ios_base::sync_with_stdio(0); cout << fixed << setprecision(10); cin.tie(0); int n; cin >> n; vector<myt> ar(n); for (int i = 0; i < n; ++i) { cin >> ar[i].d; ar[i].s = 2 * i + 1; ar[i].t = 2 * i + 2; } sort(begin(ar), end(ar), [](myt a, myt b) { return a.d > b.d; }); g.resize(2 * n); ind.resize(2 * n, 0); for (int i = 0; i < n; ++i) { int d = ar[i].d; if (ind[i] == 0) ind[i] = ar[i].s; else { --d; g[i].push_back(ar[i].s); } if (d == 0) { out(ar[i].s, ar[i].t); } else if (ind[i + d] == 0) { ind[i + d] = ar[i].t; } else { g[i + d - 1].push_back(ar[i].t); } } for (int i = 0; i < g.size(); ++i) { if (ind[i] == 0) continue; for (auto& it : g[i]) out(ind[i], it); } for (int i = 0; i < ind.size() - 1; ++i) { if (ind[i] == 0) continue; if (ind[i + 1] == 0) continue; out(ind[i], ind[i + 1]); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAX = 100010; long long quick_Mod(long long n) { long long ans = 1; long long x = 2; while (n) { if (n & 1) ans = ans * x % 1000000007; n = n >> 1; x = x * x % 1000000007; } return ans; } void ex_gcd(long long a, long long b, long long &gcd, long long &x, long long &y) { if (b == 0) { gcd = a; y = 0; x = 1; return; } else { ex_gcd(b, a % b, gcd, y, x); y -= x * (a / b); } } long long inverse(long long a) { long long gcd, x, y; ex_gcd(a, 1000000007, gcd, x, y); if (gcd == 1) return (x % 1000000007 + 1000000007) % 1000000007; else return -1; } int main() { char s[MAX]; long long k; scanf( %s , s); scanf( %I64d , &k); long long len = strlen(s); long long ans = 0; for (int i = 0; i < len; i++) { if (s[i] == 0 || s[i] == 5 ) { ans += quick_Mod(i) * inverse(quick_Mod(len) - 1) % 1000000007 * (quick_Mod(k * len) - 1) % 1000000007; } } printf( %I64d n , (ans % 1000000007 + 1000000007) % 1000000007); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, Q; set<int> cut[2]; map<int, int> mx[2]; long long getmx() { map<int, int>::iterator it; it = mx[0].end(); it--; int u = (*it).first; it = mx[1].end(); it--; int v = (*it).first; return 1ll * u * v; } void Insert(int t, int x) { int u, v; set<int>::iterator it = cut[t].lower_bound(x); v = *it; it--; u = *it; mx[t][v - u]--; if (mx[t][v - u] == 0) mx[t].erase(v - u); cut[t].insert(x); mx[t][x - u]++; mx[t][v - x]++; } int main() { char t; int x; scanf( %d %d %d , &n, &m, &Q); cut[0].insert(0); cut[0].insert(n); mx[0][n]++; cut[1].insert(0); cut[1].insert(m); mx[1][m]++; for (int i = 1; i <= Q; i++) { scanf( %c %d , &t, &x); if (t == V ) Insert(0, x); if (t == H ) Insert(1, x); printf( %I64d n , getmx()); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int IINF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3fll; const double DINF = numeric_limits<double>::infinity(); const int MOD = 1000000007; const double EPS = 1e-9; const double PI = acos(-1.0); const int DX[] = {1, 0, -1, 0, 1, -1, 1, -1}; const int DY[] = {0, 1, 0, -1, 1, -1, -1, 1}; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long sqr(long long x) { return x * x; } long long sqr(int x) { return (long long)x * x; } double sqr(double x) { return x * x; } long double sqr(long double x) { return x * x; } mt19937 mmtw(960172); long long rnd(long long x, long long y) { static uniform_int_distribution<long long> d; return d(mmtw) % (y - x + 1) + x; } const int N = 1011; struct Line { vector<int> cs; int si0; }; struct Seg { int x, y1, y2; }; int vc1, vc2; Seg vs1[N], vs2[N]; vector<int> e[N]; int p2[N]; int p1[N]; bool vis1[N]; bool ok1[N], ok2[N]; bool dfs(int v) { if (vis1[v]) return false; vis1[v] = true; for (int nv : e[v]) { if (p2[nv] == -1) { p2[nv] = v; p1[v] = nv; return true; } else if (dfs(p2[nv])) { p2[nv] = v; p1[v] = nv; return true; } } return false; } void dfs2(int v) { if (vis1[v]) return; vis1[v] = 1; for (int nv : e[v]) if (p2[nv] != -1) dfs2(p2[nv]); } int main() { memset(p1, -1, sizeof(p1)); memset(p2, -1, sizeof(p2)); ios::sync_with_stdio(false); int n; scanf( %d , &n); map<int, Line> mx, my; for (int i = 0; i < n; ++i) { int x, y; scanf( %d%d , &x, &y); mx[x].cs.push_back(y); my[y].cs.push_back(x); } for (auto& p : mx) { int x = p.first; Line& l = p.second; sort((l.cs).begin(), (l.cs).end()); l.si0 = vc1; for (int i = 0; i < ((int)((l.cs).size())) - 1; ++i) vs1[vc1++] = {x, l.cs[i], l.cs[i + 1]}; } for (auto& p : my) { int y = p.first; Line& l = p.second; sort((l.cs).begin(), (l.cs).end()); l.si0 = vc2; for (int i = 0; i < ((int)((l.cs).size())) - 1; ++i) vs2[vc2++] = {y, l.cs[i], l.cs[i + 1]}; } for (int i = 0; i < vc1; ++i) for (int j = 0; j < vc2; ++j) { Seg s1 = vs1[i]; Seg s2 = vs2[j]; if (s1.y1 < s2.x && s2.x < s1.y2) if (s2.y1 < s1.x && s1.x < s2.y2) { e[i].push_back(j); } } while (true) { bool was = false; memset(vis1, 0, sizeof(bool) * vc1); for (int i = 0; i < vc1; ++i) if (p1[i] == -1 && dfs(i)) was = true; if (!was) break; } memset(vis1, 0, sizeof(bool) * vc1); for (int i = 0; i < vc1; ++i) if (p1[i] == -1) dfs2(i); for (int i = 0; i < vc1; ++i) if (vis1[i]) ok1[i] = 1; for (int i = 0; i < vc2; ++i) if (p2[i] == -1 || !vis1[p2[i]]) ok2[i] = 1; struct Ans { int x1, y1, x2, y2; }; vector<Ans> ans; for (auto const& p : my) { int y = p.first; Line const& l = p.second; int i = 0; while (i < ((int)((l.cs).size()))) { int j = i; while (j < ((int)((l.cs).size())) - 1) { int id = l.si0 + j; if (ok2[id]) ++j; else break; } ans.push_back({l.cs[i], y, l.cs[j], y}); i = j + 1; } } cout << ((int)((ans).size())) << n ; for (auto s : ans) cout << s.x1 << << s.y1 << << s.x2 << << s.y2 << n ; ans.clear(); for (auto const& p : mx) { int x = p.first; Line const& l = p.second; int i = 0; while (i < ((int)((l.cs).size()))) { int j = i; while (j < ((int)((l.cs).size())) - 1) { int id = l.si0 + j; if (ok1[id]) ++j; else break; } ans.push_back({x, l.cs[i], x, l.cs[j]}); i = j + 1; } } cout << ((int)((ans).size())) << n ; for (auto s : ans) cout << s.x1 << << s.y1 << << s.x2 << << s.y2 << n ; return 0; }
|
#include <bits/stdc++.h> template <class T> std::string toStr(T t); using namespace std; int main() { int statA[4]; int statB[4]; for (__typeof(4) i = 0; i < 4; i++) { cin >> statA[i]; cin >> statB[i]; } int pos[4][4] = {{0, 1, 2, 3}, {1, 0, 2, 3}, {0, 1, 3, 2}, {1, 0, 3, 2}}; int res[4] = {0, 0, 0, 0}; for (__typeof(4) p = 0; p < 4; p++) { if (statA[pos[p][0]] > statB[pos[p][2]] && statB[pos[p][1]] > statA[pos[p][3]]) { res[p] = 1; } if (statA[pos[p][0]] < statB[pos[p][2]] && statB[pos[p][1]] < statA[pos[p][3]]) { res[p] = 2; } } if ((res[0] == 1 && res[2] == 1) || (res[1] == 1 && res[3] == 1)) { cout << Team 1 << endl; return 0; } if ((res[0] == 2 || res[2] == 2) && (res[1] == 2 || res[3] == 2)) { cout << Team 2 << endl; return 0; } cout << Draw << endl; } template <class T> string toStr(T t) { std::stringstream strstream; string resStr; strstream << t; strstream >> resStr; return resStr; }
|
#include <bits/stdc++.h> using namespace std; inline int scan() { int x; scanf( %d , &x); return x; } struct data { int first; int edge_used; int prev; data() { first = 0; edge_used = 0; prev = 0; } }; vector<pair<int, int> > v[100005]; bool edge[100005] = {0}; pair<int, int> edges[100005]; data nodes[100005]; bool visited[100005] = {0}; bool used[100005] = {0}; int dist[100005]; int main() { int n = scan(), m = scan(); for (int i = 1; i <= m; i++) { int x = scan(), y = scan(), z = scan(); v[x].push_back(make_pair(y, i)); v[y].push_back(make_pair(x, i)); edge[i] = z; edges[i] = make_pair(x, y); } queue<int> q; q.push(1); visited[1] = 1; for (int i = 0; i <= n; i++) dist[i] = 999999; dist[1] = 0; bool aslivisit[100001] = {0}; while (!q.empty()) { int node = q.front(); aslivisit[node] = 1; q.pop(); int x = v[node].size(); int num = nodes[node].first; for (int i = 0; i < x; i++) { int next = v[node][i].first; if (aslivisit[next]) continue; int num2 = num; if (edge[v[node][i].second] == 0) { num2++; } if (!visited[next]) { visited[next] = 1; q.push(next); nodes[next].first = num2; nodes[next].edge_used = v[node][i].second; nodes[next].prev = node; dist[next] = dist[node] + 1; } else if (dist[next] >= dist[node] + 1) { if (num2 < nodes[next].first) { nodes[next].first = num2; nodes[next].edge_used = v[node][i].second; nodes[next].prev = node; } } } } int cur = n; while (cur != 0) { used[nodes[cur].edge_used] = 1; cur = nodes[cur].prev; } int counter = 0; queue<pair<pair<int, int>, bool> > ans; for (int i = 1; i <= m; i++) { if (!used[i] && edge[i] == 1) { counter++; ans.push(make_pair(edges[i], 0)); } else if (used[i] && edge[i] == 0) { counter++; ans.push(make_pair(edges[i], 1)); } } printf( %d n , counter); while (!ans.empty()) { printf( %d %d %d n , ans.front().first.first, ans.front().first.second, ans.front().second); ans.pop(); } }
|
#include <bits/stdc++.h> using namespace std; const int MX = 256; vector<vector<vector<vector<vector<int> > > > > dp; char grid[MX][MX]; int R, C, mxmask, MOD = 1e9 + 7; int ison(int x, int bit) { if ((x & (1 << bit))) return 1; return 0; } int turnoff(int x, int bit) { if ((x & (1 << bit))) x ^= (1 << bit); return x; } int turnon(int x, int bit) { x |= (1 << bit); return x; } int calc(int row, int mask, int col, int left, int tok) { if (col == C) return calc(row + 1, mask, 0, 0, tok); if (row == R) return 1; int &ret = dp[row][mask][col][left][tok]; if (ret != -1) return ret; ret = 0; if (grid[row][col] == x ) { return ret = calc(row, turnoff(mask, col), col + 1, 0, tok); } ret += calc(row, turnon(mask, col), col + 1, 1, tok); ret %= MOD; if (left || ison(mask, col)) { ret += calc(row, mask, col + 1, left, tok); ret %= MOD; } else { if (!tok) ret += calc(row, mask, col + 1, left, 1); ret %= MOD; } return ret; } int main() { cin >> R >> C; for (int j = 0; j < R; j++) { for (int i = 0; i < C; i++) { if (R >= C) cin >> grid[j][i]; else cin >> grid[i][j]; } } if (R < C) swap(R, C); mxmask = (1 << C); dp.resize(R + 2); for (auto &pp : dp) { pp.resize(mxmask); for (auto &qq : pp) { qq.resize(C + 2); for (auto &ll : qq) { ll.resize(2); for (auto &nn : ll) { nn.resize(2); nn[0] = nn[1] = -1; } } } } cout << calc(0, 0, 0, 0, 0); }
|
#include <bits/stdc++.h> using namespace std; long long n, a[1234], i; int main() { cin >> n; for (i = 0; i < n; i++) cin >> a[i]; for (i = 0; i < n; i++) if (a[i] % 2 == 0) a[i]--; for (i = 0; i < n; i++) cout << a[i] << ; cout << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T1> void deb(T1 e1) { cout << e1 << endl; } template <class T1, class T2> void deb(T1 e1, T2 e2) { cout << e1 << << e2 << endl; } template <class T1, class T2, class T3> void deb(T1 e1, T2 e2, T3 e3) { cout << e1 << << e2 << << e3 << endl; } template <class T1, class T2, class T3, class T4> void deb(T1 e1, T2 e2, T3 e3, T4 e4) { cout << e1 << << e2 << << e3 << << e4 << endl; } template <class T1, class T2, class T3, class T4, class T5> void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) { cout << e1 << << e2 << << e3 << << e4 << << e5 << endl; } template <class T1, class T2, class T3, class T4, class T5, class T6> void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5, T6 e6) { cout << e1 << << e2 << << e3 << << e4 << << e5 << << e6 << endl; } struct data { int x, y; }; data point[110]; int num[110]; int main() { memset(num, 0, sizeof(num)); int i, j, t, mark = 1, x1 = 0, y1 = 0; for (i = 0; i < 8; i += 2) { scanf( %d%d , &point[i].x, &point[i].y); scanf( %d%d , &point[i + 1].x, &point[i + 1].y); if (point[i].x == point[i + 1].x && point[i].y != point[i + 1].y) { x1++; } else if (point[i].y == point[i + 1].y && point[i].x != point[i + 1].x) { y1++; } else mark = 0; } if ((x1 != 2)) mark = 0; if (y1 != 2) mark = 0; for (i = 0; i < 8; i++) { for (j = 0; j < 8; j++) { if (point[i].x == point[j].x && point[i].y == point[j].y) { num[i]++; } } } for (i = 0; i < 8; i++) { if (num[i] != 2) { mark = 0; } } if (mark == 0) printf( NO ); else printf( YES ); cout << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T, bool MIN> struct ConvexHullTrickAddMonotone { using Line = pair<T, T>; deque<Line> deq; inline bool check(const Line &a, const Line &b, const Line &c) { return (b.first - a.first) * (c.second - b.second) >= (b.second - a.second) * (c.first - b.first); } inline T f(const Line &a, const T x) { return a.first * x + a.second; } void add_line(T a, T b) { if (!MIN) a = -a, b = -b; Line line(a, b); if (deq.empty()) return (void)deq.emplace_back(line); if (deq.front().first <= a) { while (deq.size() >= 2 && check(line, deq.front(), deq[1])) deq.pop_front(); deq.emplace_front(line); } else { while (deq.size() >= 2 && check(deq[deq.size() - 2], deq.back(), line)) deq.pop_back(); deq.emplace_back(line); } } T query_monotone_inc(T x) { while (deq.size() >= 2 && f(deq.front(), x) >= f(deq[1], x)) deq.pop_front(); T res = f(deq.front(), x); return MIN ? res : -res; } T query_monotone_dec(T x) { while (deq.size() >= 2 && f(deq.back(), x) >= f(deq[deq.size() - 2], x)) deq.pop_back(); T res = f(deq.back(), x); return MIN ? res : -res; } }; const long long INF = 1LL << 60; template <class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return 1; } return 0; } int main() { int n, m; cin >> n >> m; int p; cin >> p; vector<int> d(n); for (int i = 0; i < n - 1; i++) { int x; cin >> x; d[i + 1] = d[i] + x; } vector<long long> x(m + 1); for (int i = 0; i < m; i++) { int h, t; cin >> h >> t; h--; x[i + 1] = t - d[h] + 1e9; } sort(begin(x), end(x)); vector<vector<long long>> dp(p + 1, vector<long long>(m + 1, INF)); for (int i = 0; i <= p; i++) dp[i][0] = 0; for (int i = 0; i < p; i++) { ConvexHullTrickAddMonotone<long long, true> cht; for (int j = 1; j <= m; j++) { cht.add_line(-(j - 1), dp[i][j - 1]); dp[i + 1][j] = cht.query_monotone_inc(x[j]) + x[j] * j; } } long long ans = dp[p][m]; for (int i = 0; i <= m; i++) ans -= x[i]; cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long INF = 1000000000000; long long A, B, n, l, t, m, r; bool check(long long len) { long long sum = A + (B * (l - 1)); long long mx = A + (B * (len - 1)); if (mx <= t && mx + sum <= 2 * m * t / (len - l + 1)) return true; else return false; } long long BS(long long L, long long R) { if (L > R) return r; long long mid = L + R >> 1; if (check(mid)) { r = mid; return BS(mid + 1, R); } else return BS(L, mid - 1); } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> A >> B >> n; while (n--) { cin >> l >> t >> m; r = l - 1; BS(l, INF); if (r >= l) cout << r << n ; else cout << -1 << n ; } }
|
#include <bits/stdc++.h> using namespace std; template <typename T> void maxtt(T& t1, T t2) { t1 = max(t1, t2); } template <typename T> void mintt(T& t1, T t2) { t1 = min(t1, t2); } bool debug = 0; int n, m, k; int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; string direc = URDL ; const long long MOD2 = (long long)1000000007 * (long long)1000000007; long long ln, lk, lm; void etp(bool f = 0) { puts(f ? YES : NO ); exit(0); } void addmod(int& x, int y, int mod = 1000000007) { x += y; if (x >= mod) x -= mod; if (x < 0) x += mod; assert(x >= 0 && x < mod); } void et(int x = -1) { printf( %d n , x); exit(0); } long long fastPow(long long x, long long y, int mod = 1000000007) { long long ans = 1; while (y > 0) { if (y & 1) ans = (x * ans) % mod; x = x * x % mod; y >>= 1; } return ans; } long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; } char s[3001335]; int id[3001335], cnt; int mt[3001335]; inline vector<int> cal(int l, int r) { vector<int> ans; if (l + 2 == r) { assert(s[l + 1] == * ); ans.push_back(id[l + 1]); return ans; } bool fg = 1; for (int i = l + 1; i < r;) { vector<int> tmp = cal(i, mt[i]); if (fg) { if (tmp.size() > ans.size()) swap(ans, tmp); for (int z : tmp) ans.push_back(z); } else { if (tmp.size() < ans.size()) swap(ans, tmp); } i = mt[i] + 1; if (i < r) { assert(s[i] == P || s[i] == S ); if (s[i] == S ) fg = 0; i++; } } return ans; } void fmain(int tid) { int r; scanf( %d , &r); n = 0; cnt = 0; while (1) { char x = getchar(); if (x == n ) break; if (x == ) continue; if (x == * ) { s[++n] = ( ; s[++n] = * ; id[n] = ++cnt; s[++n] = ) ; } else s[++n] = x; } vector<int> vp; for (int(i) = 1; (i) <= (int)(n); (i)++) { if (s[i] == ( ) vp.push_back(i); else if (s[i] == ) ) { int x = vp.back(); vp.pop_back(); mt[x] = i; mt[i] = x; } } vector<int> ans = cal(1, n); vector<bool> vis(cnt + 1, 0); for (int z : ans) vis[z] = 1; printf( REVOLTING ); for (int(i) = 1; (i) <= (int)(cnt); (i)++) if (vis[i]) { printf( %lld , (long long)r * ans.size()); } else printf( 0 ); puts( ); } int main() { int t = 1; scanf( %d , &t); for (int(i) = 1; (i) <= (int)(t); (i)++) { fmain(i); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main(int argc, char** argv) { int n, k; scanf( %d %d , &n, &k); if (k > n * 3) { printf( %d , 0); } else { printf( %d , 3 * n - k); } return 0; }
|
#include <bits/stdc++.h> using namespace std; inline void read(int &x) { int v = 0, f = 1; char c = getchar(); while (!isdigit(c) && c != - ) c = getchar(); if (c == - ) f = -1; else v = (c & 15); while (isdigit(c = getchar())) v = (v << 1) + (v << 3) + (c & 15); x = v * f; } inline void read(long long &x) { long long v = 0ll, f = 1ll; char c = getchar(); while (!isdigit(c) && c != - ) c = getchar(); if (c == - ) f = -1; else v = (c & 15); while (isdigit(c = getchar())) v = (v << 1) + (v << 3) + (c & 15); x = v * f; } inline void readc(char &x) { char c; while (((c = getchar()) == ) || c == n ) ; x = c; } inline void writes(string s) { puts(s.c_str()); } inline void writeln() { writes( ); } inline void writei(int x) { if (x < 0) { putchar( - ); x = abs(x); } if (!x) putchar( 0 ); char a[25]; int top = 0; while (x) { a[++top] = (x % 10) + 0 ; x /= 10; } while (top) { putchar(a[top]); top--; } } inline void writell(long long x) { if (x < 0) { putchar( - ); x = abs(x); } if (!x) putchar( 0 ); char a[25]; int top = 0; while (x) { a[++top] = (x % 10) + 0 ; x /= 10; } while (top) { putchar(a[top]); top--; } } int n, m, k, i, j, f[3605][1805], g[3605][1805], c1[3605], c2[3605], s1, s2, x, y, mod = 998244353, fac[3605], inv[3605], first[3605], ans; int p(int x, int y) { if (x < y) return 0; return 1ll * fac[x] * first[x - y] % mod; } int main() { fac[0] = fac[1] = inv[0] = inv[1] = first[0] = first[1] = 1; for ((i) = (2); (i) <= (3600); (i)++) { fac[i] = 1ll * fac[i - 1] * i % mod; inv[i] = 1ll * (mod - mod / i) * inv[mod % i] % mod; first[i] = 1ll * first[i - 1] * inv[i] % mod; } read(n); read(m); read(k); for (((i)) = (1); ((i)) <= ((k)); ((i))++) { read(x); read(y); int lx = x, ly = y; if (++c1[x] > 1) { puts( 0 ); return 0; } if (++c2[y] > 1) { puts( 0 ); return 0; } read(x); read(y); if (lx != x && ++c1[x] > 1) { puts( 0 ); return 0; } if (ly != y && ++c2[y] > 1) { puts( 0 ); return 0; } } c1[0] = c2[0] = 1; f[0][0] = 1; for (((i)) = (1); ((i)) <= ((n)); ((i))++) { if (c1[i] == 0) s1++; for ((j) = (0); (j) <= (i / 2); (j)++) { f[i][j] = f[i - 1][j]; if (c1[i] == 0 && c1[i - 1] == 0) { (f[i][j] += f[i - 2][j - 1]) %= mod; } } } g[0][0] = 1; for (((i)) = (1); ((i)) <= ((m)); ((i))++) { if (c2[i] == 0) s2++; for ((j) = (0); (j) <= (i / 2); (j)++) { g[i][j] = g[i - 1][j]; if (c2[i] == 0 && c2[i - 1] == 0) { (g[i][j] += g[i - 2][j - 1]) %= mod; } } } for ((i) = (0); (i) <= (n / 2); (i)++) for ((j) = (0); (j) <= (m / 2); (j)++) { ans = (ans + 1ll * f[n][i] * g[m][j] % mod * p(s2 - 2 * j, i) % mod * p(s1 - 2 * i, j)) % mod; } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<int> v[188]; int dist[188][188]; int n, m; int dp[188][188]; int best[188]; void dfs(int x, int p) { for (int i = 0; i < v[x].size(); i++) { int t = v[x][i]; if (t != p) dfs(t, x); } best[x] = 1; for (int c = 1; c <= n; c++) { for (int j = 0; j < v[x].size(); j++) { int t = v[x][j]; if (t == p) continue; dp[x][c] += min(dp[t][c], dp[t][best[t]] + m); } dp[x][c] += dist[x][c]; if (dp[x][c] < dp[x][best[x]]) best[x] = c; } } int bel[188]; void process(int x, int p, int c) { bel[x] = c; for (int i = 0; i < v[x].size(); i++) { int t = v[x][i]; if (t == p) continue; if (dp[t][c] < dp[t][best[t]] + m) process(t, x, c); else process(t, x, best[t]); } } int cost[188]; int main() { cin >> n >> m; memset(dist, 0x3f, sizeof(dist)); for (int i = 1; i < n; i++) cin >> cost[i]; dist[1][1] = 0; for (int i = 1; i < n; i++) { dist[i + 1][i + 1] = 0; int x, y; scanf( %d%d , &x, &y); dist[x][y] = dist[y][x] = 1; v[x].push_back(y); v[y].push_back(x); } for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) for (int k = 1; k <= n; k++) dist[j][k] = min(dist[j][i] + dist[i][k], dist[j][k]); for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) dist[i][j] = cost[dist[i][j]]; dfs(1, 0); cout << dp[1][best[1]] + m << n ; process(1, 0, best[1]); for (int i = 1; i <= n; i++) cout << bel[i] << ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int32_t main() { int n; cin >> n; if (n == 2) return cout << -1, 0; cout << 385 n21 n165 n ; for (int i = 0; i < n - 3; i++) { cout << 21 * (i + 100) << endl; } }
|
#include <bits/stdc++.h> using namespace std; long long int binpowmod(long long int a, long long int b, long long int m) { a %= m; long long int res = 1; while (b > 0) { if (b & 1) res = res * a % m; a = a * a % m; b >>= 1; } return res; } unsigned long long modInverse(unsigned long long n, int p) { return binpowmod(n, p - 2, p); } int main() { long long int t, n, j, k, i, f, h, l, r, t1, t2, a, b, x, ans; cin >> t; while (t--) { cin >> n; string s; cin >> s; f = 0; x = -1; for (i = 0; i < n; ++i) { if (s[i] == 0 ) { f = 1; x = i + 1; break; } } if (f) { if (x <= n / 2) { cout << x << << n << << x + 1 << << n << n ; } else { cout << 1 << << x << << 1 << << x - 1 << n ; } } else cout << 1 << << n / 2 << << ((n + 1) / 2) + 1 << << n << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); long long n; cin >> n; string s; while (1) { if (n % 7 == 0) { n = n / 7; for (long long i = 0; i < n; i++) s.push_back( 7 ); break; } else { if (n > 0) { s.push_back( 4 ); n -= 4; } else { cout << -1; return 0; } } } if (s.empty()) cout << -1; else cout << s; }
|
#include <bits/stdc++.h> using namespace std; char s[1000050]; int max(int x, int y) { return (x > y) ? x : y; } int main() { scanf( %s , &s); int len = strlen(s); int cnt = 1, j; int result = 1; for (int i = len; i < 2 * len; i++) { s[i] = s[i - len]; } len = 2 * len; for (int i = 0; i < len; i = j) { for (j = i + 1; j < len; j++) { if (s[j] == s[j - 1]) { break; } } result = max(result, j - i); } if (result > len / 2) { result = len / 2; } printf( %d n , result); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { unsigned long long n, k; cin >> n >> k; unsigned long long r = 1, l = 0, num = n, mid; for (int i = 0; i < n; i++) { r <<= 1; } mid = (l + r) >> 1; while (mid != k) { --num; if (mid > k) r = mid; else l = mid; mid = (l + r) >> 1; } cout << num; return 0; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.