func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; inline void read(int &first) { first = 0; while (1) { char ch = getchar(); if (ch == || ch == n ) break; first = first * 10 + ch - 0 ; } } inline void write(int first) { char wr[12]; int k = 0; if (!first) ++k, wr[k] = 0 ; while (first) { ++k; wr[k] = char(first % 10 + 0 ); first /= 10; } for (int i = k; i >= 1; --i) putchar(wr[i]); } const int N = 1e5 + 5; int n, k, s[N], a[N]; char ch; bool f(int len) { for (int i = 1; i <= n; ++i) { if (!a[i]) continue; int s1 = s[min(n, i + len)] - s[i - 1]; int s2 = s[i] - s[max(0, i - len - 1)]; if (s1 + s2 - a[i] >= k + 1) return 1; } return 0; } int main() { ios_base::sync_with_stdio(0); cin >> n >> k; for (int i = 1; i <= n; ++i) cin >> ch, s[i] = s[i - 1] + (ch == 0 ), a[i] = ch == 0 ; int l = 1, r = n; while (r - l > 1) { int mid = (l + r) >> 1; if (f(mid)) r = mid; else l = mid; } if (f(l)) cout << l; else cout << r; } |
#include <bits/stdc++.h> int n, m, k, s; int u[9][4]; int main() { scanf( %d%d%d%d , &n, &m, &k, &s); for (int i = 0; i < 9; i++) { u[i][0] = -0x3f3f3f3f; u[i][1] = 0x3f3f3f3f; u[i][2] = -0x3f3f3f3f; u[i][3] = 0x3f3f3f3f; } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { int c; scanf( %d , &c); c--; u[c][0] = ((u[c][0]) > (i + j) ? (u[c][0]) : (i + j)); u[c][1] = ((u[c][1]) < (i + j) ? (u[c][1]) : (i + j)); u[c][2] = ((u[c][2]) > (i - j) ? (u[c][2]) : (i - j)); u[c][3] = ((u[c][3]) < (i - j) ? (u[c][3]) : (i - j)); } } int last; scanf( %d , &last); last--; int res = 0; for (int i = 1; i < s; i++) { int cur; scanf( %d , &cur); cur--; res = ((res) > (((((u[last][0] - u[cur][1]) > (u[cur][0] - u[last][1]) ? (u[last][0] - u[cur][1]) : (u[cur][0] - u[last][1]))) > (((u[last][2] - u[cur][3]) > (u[cur][2] - u[last][3]) ? (u[last][2] - u[cur][3]) : (u[cur][2] - u[last][3]))) ? (((u[last][0] - u[cur][1]) > (u[cur][0] - u[last][1]) ? (u[last][0] - u[cur][1]) : (u[cur][0] - u[last][1]))) : (((u[last][2] - u[cur][3]) > (u[cur][2] - u[last][3]) ? (u[last][2] - u[cur][3]) : (u[cur][2] - u[last][3]))))) ? (res) : (((((u[last][0] - u[cur][1]) > (u[cur][0] - u[last][1]) ? (u[last][0] - u[cur][1]) : (u[cur][0] - u[last][1]))) > (((u[last][2] - u[cur][3]) > (u[cur][2] - u[last][3]) ? (u[last][2] - u[cur][3]) : (u[cur][2] - u[last][3]))) ? (((u[last][0] - u[cur][1]) > (u[cur][0] - u[last][1]) ? (u[last][0] - u[cur][1]) : (u[cur][0] - u[last][1]))) : (((u[last][2] - u[cur][3]) > (u[cur][2] - u[last][3]) ? (u[last][2] - u[cur][3]) : (u[cur][2] - u[last][3])))))); last = cur; } printf( %d n , res); return 0; } |
#include <bits/stdc++.h> using namespace std; int prime[100010]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; int cnt = 0; for (int i = 2; i <= n; i++) { if (!prime[i]) { cnt++; for (int j = i; j <= n; j += i) prime[j] = cnt; } } for (int i = 2; i <= n; i++) cout << prime[i] << ; cout << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int _ = 1e2; const int maxn = 2e6 + _; const int mod = 998244353; inline int ad(int x, int y) { return x >= mod - y ? x - mod + y : x + y; } inline int re(int x, int y) { return x < y ? x - y + mod : x - y; } inline int mu(int x, int y) { return (long long)x * y % mod; } inline int qp(int x, long long y) { int r = 1; while (y) { if (y & 1) r = mu(r, x); x = mu(x, x); y >>= 1; } return r; } inline int iv(int x) { return qp(x, mod - 2); } inline int dv(int x, int y) { return mu(x, qp(y, mod - 2)); } inline int gcd(int x, int y) { return x ? gcd(y % x, x) : y; } int a[maxn]; char ss[maxn]; set<int> S; set<int>::iterator it, jt, kt; int main() { int n, mx = 0; scanf( %d , &n); for (int i = 0; i <= 2000001; i++) S.insert(i); for (int i = 1; i <= n; i++) { int len; scanf( %s , ss + 1); len = strlen(ss + 1); int m, l, r; scanf( %d , &m); for (int j = 1; j <= m; j++) { scanf( %d , &l), r = l + len - 1; mx = max(mx, r); it = S.lower_bound(l), jt = S.lower_bound(r + 1); for (kt = it; kt != jt;) a[*kt] = ss[(*kt) - l + 1] - a , S.erase(kt++); } } for (int i = 1; i <= mx; i++) printf( %c , a + a[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; inline void _redirect_streams(const string input = , const string output = ) { if (not input.empty()) assert(freopen(input.c_str(), r , stdin) != nullptr); if (not output.empty()) assert(freopen(output.c_str(), w , stdout) != nullptr); } inline void _speed_up_iostreams() { ios_base::sync_with_stdio(false); cin.tie(nullptr); } inline void _prepare() { _speed_up_iostreams(); } long double a, b, c, d; inline pair<long double, long double> prod(pair<long double, long double> a, pair<long double, long double> b) { vector<long double> v = {a.first * b.first, a.first * b.second, a.second * b.first, a.second * b.second}; return {*min_element(v.begin(), v.end()), *max_element(v.begin(), v.end())}; } inline bool f(long double m) { pair<long double, long double> p1 = prod({a - m, a + m}, {d - m, d + m}); pair<long double, long double> p2 = prod({b - m, b + m}, {c - m, c + m}); if (p1.first <= p2.first and p2.first <= p1.second) return true; if (p1.first <= p2.second and p2.second <= p1.second) return true; if (p2.first <= p1.first and p1.first <= p2.second) return true; return p2.first <= p1.second and p1.second <= p2.second; } int main() { _prepare(); cin >> a >> b >> c >> d; long double l = 0, r = 1e18; const long double EPS = 1e-10; cout.precision(20); while (r - l > EPS) { long double m = (l + r) / 2; if (f(m)) r = m; else l = m; } cout.precision(30); cout << l << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, x, y, z, k, w; char S[10005]; int dp[10005]; int ok[20005]; bool check(int x, int y, int pos) { for (int i = (0); i < (pos); i++) if (S[i + x] != S[i + y]) return 1; return 0; } struct node { char S[4]; } ANS[20005]; bool cmp(const node& a, const node& b) { return strcmp(a.S, b.S) < 0; } int main() { scanf( %s , S); n = strlen(S); dp[n - 2] = 2; dp[n] = -1; dp[n - 3] = 1; for (int i = (n - 4); i >= (5); i--) { if (dp[i + 3] == 1 && check(i, i + 3, 3)) dp[i] += 1; else if (dp[i + 3] == 2 || dp[i + 3] == 3) dp[i] += 1; if (dp[i + 2] == 2 && check(i, i + 2, 2)) dp[i] += 2; else if (dp[i + 2] == 1 || dp[i + 2] == 3) dp[i] += 2; } for (int i = (5); i < (n); i++) { if (dp[i] >= 2) { dp[i] -= 2; ANS[w].S[0] = S[i]; ANS[w].S[1] = S[i + 1]; w++; } if (dp[i] >= 1) { ANS[w].S[0] = S[i]; ANS[w].S[1] = S[i + 1]; ANS[w].S[2] = S[i + 2]; w++; } } sort(ANS, ANS + w, cmp); for (int i = (1); i < (w); i++) if (strcmp(ANS[i].S, ANS[i - 1].S) == 0) ok[i] = 1; x = 0; for (int i = (0); i < (w); i++) if (ok[i] == 0) x++; printf( %d n , x); for (int i = (0); i < (w); i++) if (ok[i] == 0) printf( %s n , ANS[i].S); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; vector<long long> fac, ifac; long long fast_pow(long long a, long long b, long long mod) { if (!b) return 1; long long l = fast_pow(a, b >> 1, mod); l = l * l % mod; if (b & 1) l = l * a % mod; return l; } long long nk(int n, int k) { if (n - k < 0) return 0; return fac[n] * ifac[k] % mod * ifac[n - k] % mod; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); int h, w, n; cin >> h >> w >> n; int mx = 2 * max(h, w) + 1; fac.resize(mx); ifac.resize(mx); fac[0] = ifac[0] = 1; for (int i = 1; i < mx; ++i) fac[i] = fac[i - 1] * i % mod, ifac[i] = fast_pow(fac[i], mod - 2, mod); vector<pair<int, int> > bad(n); for (auto &el : bad) cin >> el.first >> el.second; sort(bad.begin(), bad.end()); auto f = [&](pair<int, int> &x, pair<int, int> &y) { return x.first <= y.first && x.second <= y.second; }; vector<long long> dp(n); for (int i = 0; i < n; ++i) { dp[i] = nk(bad[i].first + bad[i].second - 2, bad[i].first - 1); for (int j = 0; j < i; ++j) if (f(bad[j], bad[i])) { long long x = nk(bad[i].first - bad[j].first + bad[i].second - bad[j].second, bad[i].first - bad[j].first); dp[i] = (dp[i] - (dp[j] * x % mod) + mod) % mod; } } for (int i = 0; i < n; ++i) dp[i] = dp[i] * nk(h + w - bad[i].first - bad[i].second, h - bad[i].first) % mod; long long ans = accumulate(dp.begin(), dp.end(), 0ll) % mod; ans = (nk(h + w - 2, w - 1) - ans + mod) % mod; cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; long long int dp[503][5030]; long long int cnt[100100]; long long int fav[100100]; int t[550]; int used[100100]; long long int h[15]; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); cin >> n >> m; for (int i = 0; i < n * m; i++) { int x; cin >> x; cnt[x]++; } for (int i = 0; i < n; i++) { cin >> t[i]; fav[t[i]]++; } for (int i = 0; i < m; i++) { cin >> h[i]; } long long int ans = 0; for (int i = 0; i < n; i++) { if (used[t[i]]) continue; used[t[i]] = 1; cnt[t[i]] = min(cnt[t[i]], fav[t[i]] * (long long int)m); for (int j = 0; j <= fav[t[i]]; j++) { for (int k = 0; k <= cnt[t[i]]; k++) { dp[j][k] = -1e15; } } dp[0][0] = 0; for (int j = 0; j < fav[t[i]]; j++) { for (int k = 0; k <= cnt[t[i]]; k++) { if (dp[j][k] < 0) continue; for (int l = 0; l <= min((int)m, (int)cnt[t[i]] - k); l++) { dp[j + 1][k + l] = max(dp[j + 1][k + l], dp[j][k] + (l == 0 ? 0 : (long long int)h[l - 1])); } } } long long int ma = 0; for (int j = 0; j <= cnt[t[i]]; j++) { ma = max(ma, dp[fav[t[i]]][j]); } ans += ma; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); clock_t startTime; double getCurrentTime() { return (double)(clock() - startTime) / CLOCKS_PER_SEC; } void solve() { int n; cin >> n; vector<int> a(n); int totalXor = 0; for (int i = 0; i < n; ++i) { cin >> a[i]; totalXor ^= a[i]; } if (totalXor == 1) { cout << NO n ; return; } auto solve = [](int l, int r) { assert((r - l + 1) % 2 == 1); vector<int> res; for (int i = l; i <= r - 2; i += 2) { res.push_back(i); } for (int i = r - 4; i >= l; i -= 2) { res.push_back(i); } return res; }; if (n % 2 == 1) { auto res = solve(0, n - 1); cout << YES n ; cout << res.size() << n ; for (auto x : res) { cout << x + 1 << ; } cout << n ; } else { bool ok = false; int prefXor = 0; for (int i = 0; i < n; ++i) { prefXor ^= a[i]; if (prefXor == 0 && i % 2 == 0) { auto res1 = solve(0, i); auto res2 = solve(i + 1, n - 1); cout << YES n ; cout << res1.size() + res2.size() << n ; for (auto x : res1) { cout << x + 1 << ; } for (auto x : res2) { cout << x + 1 << ; } cout << n ; ok = true; break; } } if (!ok) cout << NO n ; } } int main() { startTime = clock(); ios_base::sync_with_stdio(false); cin.tie(nullptr); int tests; cin >> tests; for (int t = 0; t < tests; ++t) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, k, t, s, x, i, count; vector<long long int> a; vector<pair<long long int, pair<long long int, long long int> > > r; cin >> n >> k; for (int i = 0; i < n; i++) { cin >> x; a.push_back(x); } long long int mcount = -1; long long int ind = 0; for (long long int i = 0; i < n; i++) { count = 1; t = 1; for (long long int j = i + 1; j < n; j++) { if (a[j] == a[i] + t * k) count++; t++; } if (count > mcount && a[i] > i * k) { mcount = count; ind = i; } } vector<long long int> res(n); res[ind] = a[ind]; for (long long int i = ind - 1; i >= 0; i--) { res[i] = res[i + 1] - k; } for (long long int i = ind + 1; i < n; i++) { res[i] = res[i - 1] + k; } for (long long int i = 0; i < n; i++) { if (a[i] > res[i]) { s = a[i] - res[i]; r.push_back(make_pair(-1, make_pair(i + 1, s))); } else if (a[i] < res[i]) { s = res[i] - a[i]; r.push_back(make_pair(1, make_pair(i + 1, s))); } } cout << r.size() << endl; for (int i = 0; i < (int)r.size(); i++) { if (r[i].first == 1) cout << + ; else cout << - ; cout << r[i].second.first << << r[i].second.second << endl; } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; const int maxn = 100001, inf = 2147483647; const long long mod = 1 ? 998244353 : 1000000007, linf = 9223372036854775807; const double pi = acos(-1); inline long long mi(long long a, long long b, long long mm = mod) { a %= mm; long long u = 1; while (b) { if (b & 1) u = u * a % mm; a = a * a % mm, b >>= 1; } return u; } inline long long gcd(long long a, long long b) { long long c = a % b; while (c) a = b, b = c, c = a % b; return b; } inline void mem(int* a, int p = 0, int len = maxn) { for (int i = 0; i < len; i++) a[i] = p; } struct p { } e; int t, n, a[maxn], b[maxn], x; signed main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> t; while (t--) { cin >> n; map<int, int> ma; x = 0; for (int i = 0; i < n; i++) cin >> b[i], ma[b[i]]++, x = max(x, ma[b[i]]); if (x > 1) cout << YES n ; else cout << NO n ; } } |
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 10; vector<int> g[N]; bool visited[N]; vector<int> z; void dfs(int v, int depth) { visited[v] = true; bool isLeaf = true; for (auto& i : g[v]) { if (!visited[i]) { dfs(i, depth + 1); isLeaf = false; } } if (isLeaf) z.push_back(depth); } int main() { int n; scanf( %d , &n); for (int i = 0; i < n - 1; i++) { int a, b; scanf( %d %d , &a, &b); g[a].push_back(b); g[b].push_back(a); } int ans = -1; visited[1] = true; for (auto& j : g[1]) { z.clear(); dfs(j, 0); sort(z.begin(), z.end()); int prev = z[0], cur = -1; for (int i = 1; i < z.size(); i++) { cur = max(z[i], prev + 1); prev = cur; } ans = max(ans, prev + 1); } printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; long long a[maxn], n, b[maxn], f[maxn]; int main() { scanf( %lld , &n); for (int i = 1; i <= n; i++) scanf( %lld , &a[i]), b[i] = a[i]; sort(b + 1, b + n + 1); for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) if (j == 1) f[j] += abs(b[j] - a[i]); else f[j] = min(f[j - 1], f[j] + abs(b[j] - a[i])); printf( %lld n , f[n]); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100010; pair<int, int> a[N]; int s[N], ss[N]; int main() { int n, m; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d%d , &ss[i], &a[i].first); a[i].second = i; } s[n - 1] = ss[n - 1]; for (int i = n - 2; i >= 0; i--) s[i] = ss[i] + s[i + 1]; sort(a, a + n); int now = n, ans = 0; for (int i = 0; i < n; i++) { if (a[i].second < now) { ans += (a[i].first * (s[a[i].second] - s[now])); now = a[i].second; } } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int k, n, x[10000], y[10000], z[10000], ans, xx[10000], yy[10000], r, la[10][10000], d[10000]; bool flag[10000], ff[10000]; struct lsg { int x, y; } a[10000], b[10000]; int gcd(int x, int y) { return y == 0 ? x : gcd(y, x % y); } bool dfs(int l) { if (l > r) return true; int rr = r; for (int i = 1; i <= k; i++) if (!flag[i]) { while (r > rr) ff[d[r--]] = false; for (int j = la[i][d[l]]; j; j = la[i][j]) if (!ff[j]) d[++r] = j, ff[j] = true; if (r > k) continue; flag[i] = true; if (dfs(l + 1)) return true; flag[i] = false; } return false; } signed main() { ios::sync_with_stdio(false); cin >> k >> n; for (int i = 1; i <= k; i++) cin >> b[i].x >> b[i].y; for (int i = 1; i <= n; i++) cin >> a[i].x >> a[i].y; for (int l = 1; l <= k; l++) { for (int i = 1; i <= n; i++) x[i] = a[i].x - b[l].x, y[i] = a[i].y - b[l].y, z[i] = gcd(abs(x[i]), abs(y[i])), xx[i] = x[i] / z[i], yy[i] = y[i] / z[i]; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) if (xx[i] == xx[j] && yy[i] == yy[j]) { if (i == j) continue; if (z[i] > z[j]) { if (!la[l][i] || z[la[l][i]] < z[j]) la[l][i] = j; } else if (!la[l][j] || z[la[l][j]] < z[i]) la[l][j] = i; } } for (int i = 1; i <= n; i++) { r = 1; d[1] = i; memset(flag, 0, sizeof(flag)); memset(ff, 0, sizeof(ff)); if (dfs(1)) ans++; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, sum; cin >> n >> sum; if (n == 0 || (sum == 0 && n > 1)) cout << -1 << << -1 << endl; else { int ma; string t = ; int x = sum; while (x > 0 && t.length() != n) { if ((x - 9) >= 0) { t = t + 9 ; x = x - 9; } else { char c = x + 0 ; t = t + c; x = 0; } } if (t.length() == n && x != 0) cout << -1 << << -1 << endl; else { int ctr = 0; int x = (n - t.length()); if (t.length() != n) { for (int i = 1; i <= x; i++) { t = t + 0 ; } } int a[t.length()]; for (int i = 0; i < t.length(); i++) a[i] = ((int)t[i] - 48); int flag = 0; for (int i = t.length() - 1; i >= 0; i--) { if (t[t.length() - 1] == 0 && t.length() != 1) { t[t.length() - 1] = 1 ; flag = 1; } if (flag == 0) break; if (t[i] != 0 && i != t.length() - 1 && flag) { int r = (int)t[i] - 48; r = r - 1; char c = r + 0 ; t[i] = c; break; } } int y[t.length()]; for (int i = t.length() - 1; i >= 0; i--) { y[i] = (t[i] - 0 ); } for (int i = t.length() - 1; i >= 0; i--) cout << y[i]; cout << ; for (int i = 0; i < t.length(); i++) cout << a[i]; } } } |
#include <bits/stdc++.h> bool match(const char* text, const char* pattern, int n, int m) { int post = 0, posp = 0; while (post < n && posp < m) { if (text[post] == pattern[posp]) { ++post; ++posp; } else ++post; } return (posp == m); } char data[200002], filt[200002], srch[200002], pat[200002]; int perm[200002]; int main() { scanf( %s , data + 1); scanf( %s , pat); int n = strlen(data + 1); int m = strlen(pat); for (int _k = (1), _n = (n), i = _k; i <= _n; ++i) { scanf( %d , &perm[i]); } int lo = 0; int hi = n; while (lo <= hi) { int mid = (lo + hi) / 2; memcpy(filt + 1, data + 1, n + 1); for (int _k = (1), _n = (mid), i = _k; i <= _n; ++i) filt[perm[i]] = -1; int pos = 0; memset(srch, 0, n); for (int _k = (1), _n = (n), i = _k; i <= _n; ++i) if (filt[i] != -1) srch[pos++] = filt[i]; if (!match(srch, pat, pos, m)) hi = mid - 1; else lo = mid + 1; } int answer = hi; printf( %d n , answer); return 0; } |
#include <bits/stdc++.h> using namespace std; int T, n; int a[200010]; int sum; int ans[200010]; map<int, vector<pair<int, int> > > o; int exgcd(int a, int b, int &x, int &y) { if (!b) { x = 1, y = 0; return a; } int t = exgcd(b, a % b, y, x); y -= a / b * x; return t; } int main() { scanf( %d%d , &T, &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); sum = (sum + a[i]) % T; a[i] = i == 1 ? 0 : (a[i] + a[i - 1]) % T; } int x, y; int len = exgcd(sum, T, x, y); int tot = T / len; for (int i = 1; i <= n; i++) { int cas = a[i] % len, num = tot - a[i] / len; num = 1ll * num * x % tot; o[cas].push_back(make_pair(num, i)); } for (pair<int, vector<pair<int, int> > > u : o) { vector<pair<int, int> > p = u.second; sort(p.begin(), p.end()); int last = p.back().first - tot; for (pair<int, int> v : p) ans[v.second] = v.first - last, last = v.first; } for (int i = 1; i <= n; i++) printf( %d%c , ans[i], i == n ? n : ); } |
#include <bits/stdc++.h> int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); int n; std::cin >> n; std::vector<std::vector<int>> a(n, std::vector<int>(n)); for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { a[i][j] = 4 * (i % (n / 2) * (n / 2) + j % (n / 2)) + i / (n / 2) * 2 + j / (n / 2); } } for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { std::cout << a[i][j] << ; } std::cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int64_t n, k, m; cin >> n >> k >> m; int64_t ans = 0; vector<vector<int64_t>> dp(n + 1, vector<int64_t>(k + 1)); vector<int64_t> u(n + 1); vector<int64_t> g(n + 1); dp[0][0] = 1; u[1] = 1; for (int64_t i = 2; i <= n; i++) u[i] = u[i - 1] * 10 % k; g[1] = 9; g[0] = 1; for (int64_t i = 2; i <= n; i++) g[i] = g[i - 1] * 10 % m; for (int64_t i = 1; i <= n; i++) { for (int64_t j = 0; j <= k - 1; j++) { for (int64_t l = 0; l <= 9; l++) { if ((l) && ((j + l * u[i]) % k == 0)) { ans = (ans + dp[i - 1][j] * g[n - i]) % m; } else dp[i][(j + l * u[i]) % k] = (dp[i][(j + l * u[i]) % k] + dp[i - 1][j]) % m; } } } cout << ans; } |
#include <bits/stdc++.h> using namespace std; inline long long qr() { long long x = 0, f = 1; char ch; while (!isdigit(ch = getchar())) if (ch == - ) f = -1; for (; isdigit(ch); x = x * 10 + ch - 48, ch = getchar()) ; return x * f; } const int N = 100010; int n, k, a[N], res; int s[N], top, b[N], c[N]; int lt[N], nt[N]; vector<int> ans[500]; int LIS() { for (int i = 1; i <= top; ++i) b[i] = lt[i] = nt[i] = 0; s[top = 1] = 1e5 + 1; for (int i = 1; i <= n; ++i) { int p = upper_bound(s + 1, s + 1 + top, a[i]) - s; s[p] = a[i]; lt[i] = b[p]; b[p] = i; nt[i] = b[p - 1]; if (p == top) s[++top] = 1e5 + 1; } return top - 1; } void Find(int x) { ans[++res].clear(); for (int i = b[x]; i; i = nt[i]) ans[res].push_back(a[i]), a[i] = -1; } void Div(int n) { for (int i = 1; i <= n; ++i) { ans[++res].clear(); for (int j = b[i]; j; j = lt[j]) ans[res].push_back(a[j]); } } int main() { int kase = qr(); while (kase--) { n = qr(); res = 0; for (int i = 1; i <= n; ++i) a[i] = qr(); while (n) { int k = LIS(); if (1LL * k * (k + 1) > 2 * n) Find(k); else { Div(k); break; } int ct = 0; for (int i = 1; i <= n; ++i) if (a[i] != -1) a[++ct] = a[i]; n = ct; } printf( %d n , res); for (int i = 1; i <= res; ++i) { int l = ans[i].size(); printf( %d , l); for (int j = l - 1; j >= 0; --j) printf( %d , ans[i][j]); puts( ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, x; cin >> n >> x; vector<int> v[n + 1]; for (int i = 0; i < n - 1; i++) { int a, b; cin >> a >> b; v[a].push_back(b); v[b].push_back(a); } bool vstd[n + 1]; int dst1[n + 1]; int dst2[n + 1]; memset(vstd, false, sizeof vstd); memset(dst1, 0x7f, sizeof dst1); memset(dst2, 0x7f, sizeof dst2); queue<int> q; q.push(1); dst1[1] = 0; while (q.size()) { int node = q.front(); q.pop(); if (vstd[node]) continue; vstd[node] = true; for (auto u : v[node]) { dst1[u] = min(dst1[u], dst1[node] + 1); q.push(u); } } q.push(x); dst2[x] = 0; memset(vstd, false, sizeof vstd); while (q.size()) { int node = q.front(); q.pop(); if (vstd[node]) continue; vstd[node] = true; for (auto u : v[node]) { dst2[u] = min(dst2[u], dst2[node] + 1); q.push(u); } } int ans = 0; for (int i = 1; i <= n; i++) { if (dst1[i] > dst2[i]) { ans = max(ans, max(2 * dst1[i], 2 * dst2[i])); } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, s; pair<int, int> A[200000]; pair<pair<int, int>, int> B[200000]; set<pair<pair<int, int>, int> > candidates; pair<int, int> q[200000]; int sp, st; int answer[200000]; bool check(int days) { int j = n - 1; sp = st = 0; int used = 0; candidates.clear(); for (int i = m - 1; i >= 0; --i) { while (j >= 0 && B[j].first.first >= A[i].first) { candidates.insert(make_pair( make_pair(B[j].first.second, B[j].first.first), B[j].second)); --j; } if (st < sp) { answer[A[i].second] = q[st].second + 1; --q[st].first; if (q[st].first == 0) ++st; } else { if (candidates.size() == 0) return false; pair<pair<int, int>, int> best = *candidates.begin(); candidates.erase(candidates.begin()); used += best.first.first; if (used > s) return false; answer[A[i].second] = best.second + 1; if (days > 1) q[sp++] = make_pair(days - 1, best.second); } } return true; } int main() { scanf( %d %d %d , &n, &m, &s); for (int i = 0; i < m; ++i) { scanf( %d , &A[i].first); A[i].second = i; } for (int i = 0; i < n; ++i) { scanf( %d , &B[i].first.first); B[i].second = i; } for (int i = 0; i < n; ++i) scanf( %d , &B[i].first.second); sort(A, A + m); sort(B, B + n); int left = 1, right = m; while (left < right) { int middle = (left + right) / 2; if (check(middle)) right = middle; else left = middle + 1; } if (check(left)) { printf( YES n%d , answer[0]); for (int i = 1; i < m; ++i) printf( %d , answer[i]); printf( n ); } else { printf( NO n ); } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,tune=native ) using namespace std; template <typename T> inline bool chkmax(T& aa, T bb) { return aa < bb ? aa = bb, true : false; } template <typename T> inline bool chkmin(T& aa, T bb) { return aa > bb ? aa = bb, true : false; } int rint(); char rch(); long long rlong(); const int MOD = 1000000007; int extgcd(int a, int b, int& x, int& y) { for (int u = y = 1, v = x = 0; a;) { int q = b / a; swap(x -= q * (long long)u, u); swap(y -= q * (long long)v, v); swap(b -= q * (long long)a, a); } return b; } int mod_inv(int a, int m) { int x, y; extgcd(a, m, x, y); return (m + x % m) % m; } int mod_pow(int a, int n, int mod) { int ret = 1; int p = a % mod; while (n) { if (n & 1) ret = (ret * (long long)p) % mod; p = (p * (long long)p) % mod; n >>= 1; } return ret; } template <int _MAXSEG> class MinSegTree { public: static const int MAXSEG = _MAXSEG; int segn = _MAXSEG; long long t[2 * MAXSEG]; long long identity = LLONG_MAX; long long combine(const long long& lefts, const long long& rights) { return min(lefts, rights); } void init(int n) { segn = n; } void build() { int n = segn; for (int i = n - 1; i > 0; --i) t[i] = combine(t[i << 1], t[i << 1 | 1]); } void sset(int p, const long long& value) { int n = segn; for (t[p += n] = value; p >>= 1;) t[p] = combine(t[p << 1], t[p << 1 | 1]); } long long query(int l, int r) { r++; int n = segn; long long resl = identity, resr = identity; for (l += n, r += n; l < r; l >>= 1, r >>= 1) { if (l & 1) resl = combine(resl, t[l++]); if (r & 1) resr = combine(t[--r], resr); } return combine(resl, resr); } }; const int mn = 100000 + 4; int inp[mn]; long long vdiff[mn]; int n; MinSegTree<mn> at, abt; pair<long long, long long> getab(int x) { long long l = max(0ll, -vdiff[x - 1]); long long r = max(0ll, vdiff[x]); return make_pair(l, r); } void change(int x) { pair<long long, long long> got = getab(x); long long a = min(got.first, got.second), b = max(got.first, got.second); at.sset(x, a); abt.sset(x, a + b); } void place(int x) { pair<long long, long long> got = getab(x); long long a = min(got.first, got.second), b = max(got.first, got.second); at.t[x + at.segn] = a; abt.t[x + abt.segn] = a + b; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); n = rint(); int segn = n + 1; at.init(segn); abt.init(segn); for (int x = 1; x <= n; x++) inp[x] = rint(); long long allsum = 0; for (int x = 1; x <= n - 1; x++) { vdiff[x] = inp[x + 1] - inp[x]; allsum += abs(vdiff[x]); } for (int x = 1; x <= n; x++) { place(x); } at.build(); abt.build(); int qlim = rint(); for (int qi = 0; qi < qlim; qi++) { int t = rint(), l = rint(), r = rint(), val = rint(); if (t == 1) { long long mina = at.query(l, r); long long minsum = abt.query(l, r); long long ansleft = max(-2 * mina, -2LL * val); long long ansright = 2 * (val - minsum); long long ans = max(ansleft, ansright); long long final = allsum + ans; printf( %lld n , final); } else { { allsum -= abs(vdiff[l - 1]); vdiff[l - 1] += val; allsum += abs(vdiff[l - 1]); change(l); if (l - 1 >= 1) change(l - 1); } if (r != n) { allsum -= abs(vdiff[r]); vdiff[r] -= val; allsum += abs(vdiff[r]); change(r); if (r + 1 <= n) change(r + 1); } } } } static char stdinBuffer[1024]; static char* stdinDataEnd = stdinBuffer + sizeof(stdinBuffer); static const char* stdinPos = stdinDataEnd; void readAhead(size_t amount) { size_t remaining = stdinDataEnd - stdinPos; if (remaining < amount) { memmove(stdinBuffer, stdinPos, remaining); size_t sz = fread(stdinBuffer + remaining, 1, sizeof(stdinBuffer) - remaining, stdin); stdinPos = stdinBuffer; stdinDataEnd = stdinBuffer + remaining + sz; if (stdinDataEnd != stdinBuffer + sizeof(stdinBuffer)) *stdinDataEnd = 0; } } int rint() { readAhead(16); int x = 0; bool neg = false; while (*stdinPos == || *stdinPos == n ) ++stdinPos; if (*stdinPos == - ) { ++stdinPos; neg = true; } while (*stdinPos >= 0 && *stdinPos <= 9 ) { x *= 10; x += *stdinPos - 0 ; ++stdinPos; } return neg ? -x : x; } char rch() { readAhead(16); while (*stdinPos == || *stdinPos == n ) ++stdinPos; char ans = *stdinPos; ++stdinPos; return ans; } long long rlong() { readAhead(32); long long x = 0; bool neg = false; while (*stdinPos == || *stdinPos == n ) ++stdinPos; if (*stdinPos == - ) { ++stdinPos; neg = true; } while (*stdinPos >= 0 && *stdinPos <= 9 ) { x *= 10; x += *stdinPos - 0 ; ++stdinPos; } return neg ? -x : x; } |
#include <bits/stdc++.h> using namespace std; namespace debug { void __(short x) { cout << x; } void __(int x) { cout << x; } void __(long long x) { cout << x; } void __(unsigned long long x) { cout << x; } void __(double x) { cout << x; } void __(long double x) { cout << x; } void __(char x) { cout << x; } void __(const char* x) { cout << x; } void __(const string& x) { cout << x; } void __(bool x) { cout << (x ? true : false ); } template <class P1, class P2> void __(const pair<P1, P2>& x) { __( ( ), __(x.first), __( , ), __(x.second), __( ) ); } template <class T> void __(const vector<T>& x) { __( { ); bool _ffs = 0; for (const auto& v : x) __(_ffs ? , : ), __(v), _ffs = 1; __( } ); } void screm() { __( n ); } template <class T1, class... T2> void screm(const T1& t1, const T2&... t2) { __(t1); if (sizeof...(t2)) __( | ), screm(t2...); else __( n ); } void pr() { __( n ); } template <class T1, class... T2> void pr(const T1& t1, const T2&... t2) { __(t1); if (sizeof...(t2)) __( ), pr(t2...); else __( n ); } } // namespace debug using namespace debug; long long h, m, k, ans, h1, h2, m1, m2, ms, mh, mmm; int main() { scanf( %lld%lld%lld%lld%lld%lld%lld , &h, &m, &k, &h1, &m1, &h2, &m2); long long sw = m - 1; while (sw) { if (sw % 10 != 0) ms++; sw /= 10; } sw = h - 1; while (sw) { if (sw % 10 != 0) mh++; sw /= 10; } int ch = max(0LL, k - ms - 1); long long mn = 1, hr = 1; for (int i = 0; i < k - 1; i++) mn *= 10; for (int i = 0; i < ch; i++) hr *= 10; if (h1 == h2 && m1 <= m2) { ans += (m2 / mn); if (m1 > 1) ans -= (m1 / mn); printf( %lld n , ans); return 0; } if (m1) ans += ((m - 1) / mn) - (m1 / mn); long long rr = h1; ans -= (h1 / hr); int flg = 0; if (m1) { h1++; m1 = 0; if (h1 == h) { h1 = 0; if (ms + mh >= k) ans++; } else if ((h1 / hr) != (rr / hr)) ans++, flg = 1; } if (m2) ans += (m2 / mn), m2 = 0; long long kek = (m - 1) / mn; if (h1 > h2) { ans += ((h - 1) / hr) + (h2 / hr) - flg; long long delta = (h - h1) + (h2); ans += delta * kek; if (ms + mh >= k) ans++; } else { ans += (rr / hr) - (h1 / hr) + (h2 / hr) + kek * (h2 - h1); } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); vector<int> a(n); long long sum = 0; for (int& x : a) { scanf( %d , &x); sum += x; } if (sum != 0) { puts( YES ); puts( 1 ); printf( %d %d n , 1, n); exit(0); } sum = 0; for (int i = 0; i < n; i++) { sum += a[i]; if (sum != 0) { puts( YES ); puts( 2 ); printf( %d %d n , 1, i + 1); printf( %d %d n , i + 2, n); exit(0); } } puts( NO ); } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, s, ans = 0, mid = 0; scanf( %lld %lld , &n, &s); long long int a[n]; for (int i = 0; i < n; i++) scanf( %lld , &a[i]); sort(a, a + n); mid = n / 2; if (s >= a[mid]) { for (int i = n / 2; i < n; i++) { if (a[i] >= s) break; else ans += abs(s - a[i]); } } else { for (int i = n / 2; i >= 0; i--) { if (a[i] <= s) break; else ans += abs(a[i] - s); } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, tot, ans, Head[100000 + 5], q[100000 + 5], T[100000 + 5], Deg[100000 + 5]; bool Flag[100000 + 5]; struct Edge { int next, node; } h[100000 + 5 << 1]; inline void addedge(int u, int v) { h[++tot].next = Head[u], Head[u] = tot; h[tot].node = v; } inline void dfs(int z) { if (Flag[z]) return; Flag[z] = 1; q[++q[0]] = z; for (int i = Head[z]; i; i = h[i].next) { int d = h[i].node; dfs(d); } } inline bool T_Sort() { int l = 1, r = 0; for (int i = 1; i <= q[0]; i++) if (!Deg[q[i]]) T[++r] = q[i]; while (l <= r) { int z = T[l++]; for (int i = Head[z]; i; i = h[i].next) { if (i + 1 & 1) continue; int d = h[i].node; Deg[d]--; if (!Deg[d]) T[++r] = d; } } return r == q[0]; } int main() { scanf( %d%d , &n, &m); for (int i = 1, u, v; i <= m; i++) { scanf( %d%d , &u, &v); addedge(u, v), addedge(v, u); Deg[v]++; } for (int i = 1; i <= n; i++) { if (Flag[i]) continue; q[0] = 0; dfs(i); ans += T_Sort() ? q[0] - 1 : q[0]; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int mas[105] = {0}; int n; scanf( %d , &n); int res = -1; int resl = -1; for (int i = 0; i < n; i++) scanf( %d , &mas[i]); for (int i = 0; i < n; i++) { int len = 0; int mest = 0; for (int j = i; j < n; j++) { len++; mest ^= mas[j]; if (mest > res) { res = mest; resl = len; } } } cout << res; return 0; } |
#include <bits/stdc++.h> using namespace std; int A[1001][1001]; int n, m, k, i, j, l, r, a, b, x, y, p, q; int main() { cin >> n >> a >> b; x = n / 2; y = n - x; p = 1; q = 2; for (i = 1; i <= a; i++) for (j = 1; j <= b; j++) { l = A[i - 1][j] % 2; r = A[i][j - 1] % 2; if (j == 1) r = l; if (i == 1) l = r; if (l != r) continue; if (l == 1 && x) A[i][j] = q, q += 2, x--; else if (l == 0 && y) A[i][j] = p, p += 2, y--; } if (x != 0 || y != 0) { cout << -1; return 0; } for (i = 1; i <= a; i++) { for (j = 1; j <= b; j++) cout << A[i][j] << ; cout << endl; } } |
#include <bits/stdc++.h> using namespace std; const int maxN = (int)2e5 + 10; const int maxM = (int)4e5 + 10; int n, m, k, type[maxN], a[maxN], pa[maxN]; long long d[maxN]; vector<int> c[maxN], w[maxN]; set<pair<long long, int> > s; int en, ea[maxM], eb[maxM], ep[maxM]; long long ew[maxM]; inline bool wless(int i, int j) { return ew[i] < ew[j]; } int get(int v) { return v == pa[v] ? v : (pa[v] = get(pa[v])); } int main() { scanf( %d%d , &n, &m); for (int i = 0; i < (int)(m); i++) { int a, b, x; scanf( %d%d%d , &a, &b, &x), a--, b--; c[a].push_back(b), w[a].push_back(x); c[b].push_back(a), w[b].push_back(x); } scanf( %d , &k); for (int i = 0; i < (int)(n); i++) d[i] = (long long)1e18; for (int i = 0; i < (int)(k); i++) { scanf( %d , &a[i]), a[i]--; d[a[i]] = 0, type[a[i]] = i; } for (int i = 0; i < (int)(n); i++) s.insert(make_pair(d[i], i)); while ((int)(s).size()) { int v = s.begin()->second; s.erase(s.begin()); for (int i = 0; i < (int)((int)(c[v]).size()); i++) { int u = c[v][i]; long long tmp = d[v] + w[v][i]; if (d[u] > tmp) { s.erase(make_pair(d[u], u)); d[u] = tmp, type[u] = type[v]; s.insert(make_pair(d[u], u)); } } } for (int v = 0; v < (int)(n); v++) for (int i = 0; i < (int)((int)(c[v]).size()); i++) { int u = c[v][i]; if (type[v] != type[u]) { ea[en] = type[v]; eb[en] = type[u]; ep[en] = en; ew[en] = d[v] + d[u] + w[v][i]; en++; } } long long ans = d[0]; sort(ep, ep + en, wless); for (int i = 0; i < (int)(k); i++) pa[i] = i; for (int _i = 0; _i < (int)(en); _i++) { int i = ep[_i]; if (get(ea[i]) != get(eb[i])) pa[get(ea[i])] = get(eb[i]), ans += ew[i]; } printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int arr[300005]; int main() { int n; cin >> n; cout << 1 << ; int right = n; for (int i = 1; i <= n; i++) { int temp; scanf( %d , &temp); arr[temp] = 1; while (arr[right]) right--; printf( %d , i - (n - right) + 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; bool good(int64_t a, int64_t b) { if (a == 0) return false; if (!good(b % a, a)) return true; int64_t c = b / a; return (c % (a + 1)) % 2 == 0; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); int t; cin >> t; while (t--) { int64_t a, b; cin >> a >> b; if (a > b) swap(a, b); cout << (good(a, b) ? First : Second ) << n ; } } |
#include <bits/stdc++.h> using namespace std; const int D = 1e6 + 3; const int MAXN = 110; int F[MAXN]; struct Mt { int v[MAXN][MAXN]; int N, M; Mt() { for (int i = 0; i < MAXN; i++) { for (int j = 0; j < MAXN; j++) { v[i][j] = 0; } } } void I() { for (int i = 0; i < N; i++) { for (int j = 0; j < M; j++) { v[i][j] = 0; } v[i][i] = 1; } } void pr() { for (int i = 0; i < N; i++) { for (int j = 0; j < M; j++) { cout << v[i][j]; } cout << endl; } } }; Mt operator*(Mt A, Mt B) { Mt Res; Res.N = A.N; Res.M = B.M; for (int k = 0; k < A.M; k++) { for (int i = 0; i < Res.N; i++) { for (int j = 0; j < Res.M; j++) { Res.v[i][j] += (1ll * A.v[i][k] * B.v[k][j]) % D; Res.v[i][j] %= D; } } } return Res; } Mt pw(Mt A, int p) { Mt Res; Res.N = A.N; Res.M = A.M; Res.I(); while (p) { if (p & 1) { Res = Res * A; } A = A * A; p >>= 1; } return Res; } int main() { int C, W, H; cin >> C >> W >> H; F[0] = 1; for (int i = 1; i < W + 1; i++) { F[i] = H * F[i - 1]; F[i] %= D; } Mt A; A.N = W + 1; A.M = W + 1; for (int i = 0; i < W; i++) { A.v[i][i + 1] = 1; } for (int i = 0; i < W + 1; i++) { A.v[W][i] = F[W - i]; } Mt ans = pw(A, C); cout << (ans.v[W][W] + ans.v[W][W - 1]) % D << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; char c[1000]; int i, n, d, t, q; int main() { cin >> c; n = strlen(c); i = 0; while (i < n && c[i] != @ ) { if (!isalnum(c[i]) && c[i] != _ ) { cout << NO ; return 0; } i++; } i++; t = i; if (i == n || i > 16 || i < 1) { cout << NO ; return 0; } while (i < n && c[i] != / ) { d = 0; q = i; while (i < n && c[i] != . && c[i] != / ) { if (!isalnum(c[i]) && c[i] != _ ) { cout << NO ; return 0; } i++; d = 1; } if (i - q > 16 || i - q < 1) { cout << NO ; return 0; } if (c[i] != / ) i++; } if (i - t > 32 || i - t < 1 || (i == n && c[i - 1] == . )) { cout << NO ; return 0; } if (c[i] == / ) { if (i == n) { cout << NO ; return 0; } t = i + 1; i++; while (i < n) { if (!isalnum(c[i]) && c[i] != _ ) { cout << NO ; return 0; } i++; } if (i - t > 16 || i - t < 1) { cout << NO ; return 0; } } cout << YES ; return 0; } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; const int dir[8][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}, {1, 1}, {1, -1}, {-1, -1}, {-1, 1}}; const int mod = 1e9 + 7, gakki = 5 + 2 + 1 + 19880611 + 1e9; const int MAXN = 1e6 + 5, MAXM = 1e6 + 5; const int MAXQ = 100010, INF = 1e9; inline void read(int &v) { v = 0; char c = 0; int p = 1; while (c < 0 || c > 9 ) { if (c == - ) { p = -1; } c = getchar(); } while (c >= 0 && c <= 9 ) { v = (v << 3) + (v << 1) + c - 0 ; c = getchar(); } v *= p; } int n, m; int len; int anser = INT_MAX; int num[55]; void dfs(int x, int where, int sum) { for (int i = x + 1; i <= len; i++) { if (num[i] >= num[x] + 2) { if (where == m - 1) { anser = min(anser, sum + num[i]); return; } dfs(i, where + 1, sum + num[i]); break; } } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m; string ch; cin >> ch; len = ch.size(); for (int i = 0; i < len; i++) { num[i + 1] = (ch[i] - a ) + 1; } sort(num + 1, num + 1 + len); num[len + 1] = INT_MAX; if (m == 1) { cout << num[1] << endl; return 0; } for (int i = 1; i <= len - m + 1; i++) { dfs(i, 1, num[i]); } if (anser == INT_MAX) { cout << -1 << endl; } else { cout << anser << endl; } return 0; } |
#include <bits/stdc++.h> const int MAXN = 100005; int n, q, A[MAXN], B[MAXN]; double ans, f[MAXN][105]; int main() { scanf( %d , &n); for (register int i = 1; i <= n; ++i) scanf( %d , A + i), f[i][B[i] = A[i]] = 1, ans += f[i][0]; scanf( %d , &q); register int u, v, k; while (q--) { scanf( %d%d%d , &u, &v, &k); ans -= f[u][0]; for (register int i = 1; i <= k; ++i) for (register int j = 0; j <= A[u]; ++j) f[u][j] = f[u][j] * (B[u] - i + 1 - j) / (B[u] - i + 1) + f[u][j + 1] * (j + 1) / (B[u] - i + 1); ans += f[u][0]; B[u] -= k; B[v] += k; printf( %.12lf n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; int l = 2, h = 1e5; int ans = 2; while (l <= h) { int m = l + (h - l) / 2; if ((long long)m * (m - 1) / 2 <= n) { ans = m; l = m + 1; } else { h = m - 1; } } int rem = n - (long long)ans * (ans - 1) / 2; cout << 133 ; for (int i = 1; i <= rem; i++) cout << 7; for (int i = 1; i <= ans - 2; i++) cout << 3; cout << 7 << n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, t; cin >> n >> t; for (int i = 1; i <= n; i++) { int a; cin >> a; t -= 86400 - a; if (t <= 0) { cout << i << endl; return 0; } } } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-10; const double PI = 3.1415926535897932; const int dir[4][2] = {-1, 0, 0, -1, 1, 0, 0, 1}; const int maxn = 2e5 + 5; const int MOD = 998244353; int n, m; int d[maxn]; long long sum[maxn]; long long qpow(long long a, long long p) { long long ans = 1; while (p) { if (p & 1) ans = ans * a % MOD; a = a * a % MOD; p >>= 1; } return ans; } long long inv(long long a) { return qpow(a, MOD - 2); } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %d , &d[i]); sort(d + 1, d + 1 + n); for (int i = 1; i <= n; i++) sum[i] = (sum[i - 1] + d[i]) % MOD; while (m--) { long long A, B; scanf( %lld%lld , &A, &B); int st = lower_bound(d + 1, d + 1 + n, B) - d; if (n - st + 1 < A) { printf( 0 n ); continue; } long long k = n - st + 1; long long kk = (k - A) * inv(k) % MOD; long long ans = (sum[n] - sum[st - 1]) % MOD * kk % MOD; kk = (k - A + 1) * inv(k + 1) % MOD; ans = (ans + sum[st - 1] * kk % MOD) % MOD; ans = (ans + MOD) % MOD; printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MX = 1000; int dp[MX][MX], a[MX], x[MX], y[MX], n, d; int dis(int i, int j) { return abs(x[i] - x[j]) + abs(y[i] - y[j]); } int main() { cin >> n >> d; for (int i = 2; i < n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) cin >> x[i] >> y[i]; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) { if (i != j) dp[i][j] = dis(i, j) * d - a[i]; } for (int k = 1; k <= n; k++) for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) if (dp[i][j] > dp[i][k] + dp[k][j]) dp[i][j] = dp[i][k] + dp[k][j]; cout << dp[1][n] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> g[100005]; int n, m; vector<int> c[100005]; int nc; bool b[100005]; int v[100005]; vector<pair<int, int> > e; int s0[100005], s1[100005]; int w[100005]; void add(int x, int y) { e.push_back(make_pair(x, y)); if (((int)e.size()) == m) { for (auto p : e) printf( %d %d n , p.first + 1, p.second + 1); exit(0); } } void add2(int i, int j) { add(i, j); if (s0[j] == s0[i]) s0[s0[i]] = -1, s0[i] = s0[j] = s1[i] = s1[j] = -1; else { s1[s0[i]] = s1[s0[j]]; s0[s0[j]] = s0[s0[i]]; } n--; } void dfs(int x) { if (v[x] >= 0) return; v[x] = nc; c[nc].push_back(x); for (int y : g[x]) dfs(y); } priority_queue<pair<int, int> > q; int main() { scanf( %d%d , &n, &m); for (int _ = 0, ThxDem = m; _ < ThxDem; ++_) { int x, y; scanf( %d%d , &x, &y); x--; y--; g[x].push_back(y); g[y].push_back(x); } memset(v, -1, sizeof(v)); for (int i = 0, ThxDem = n; i < ThxDem; ++i) if (!((int)g[i].size())) b[nc] = true, v[i] = nc, c[nc++] = {i}; for (int i = 0, ThxDem = n; i < ThxDem; ++i) if (((int)g[i].size()) == 1 && v[i] < 0) dfs(i), b[nc++] = false; for (int i = 0, ThxDem = n; i < ThxDem; ++i) if (v[i] < 0) dfs(i), b[nc++] = true; if (nc == 1) { if (n >= 5) for (int i = 0, ThxDem = n; i < ThxDem; ++i) add(c[0][i], c[0][(i + 2) % n]); else if (n == 4 && !b[0]) { add(c[0][1], c[0][3]); add(c[0][3], c[0][0]); add(c[0][0], c[0][2]); assert(0); } } else { for (int i = 0, ThxDem = n; i < ThxDem; ++i) s0[i] = s1[i] = i; pair<int, int> t = make_pair(-1, -1); for (int i = 0, ThxDem = nc; i < ThxDem; ++i) t = max(t, make_pair(((int)c[i].size()), i)); int k = t.second; if (((int)c[k].size()) > n - ((int)c[k].size())) { if (((int)c[k].size()) == 2) { add(c[k][0], c[k ^ 1][0]); assert(0); } if (((int)c[k].size()) == 3) { if (!b[k]) add2(c[k][0], c[k][2]); } else if (((int)c[k].size()) == 4 && b[k]) { add2(c[k][0], c[k][2]); if (((int)c[k].size()) - 1 > n - (((int)c[k].size()) - 1)) add2(c[k][1], c[k][3]); } else if (((int)c[k].size()) == 4) { add2(c[k][1], c[k][3]); if (((int)c[k].size()) - 1 > n - (((int)c[k].size()) - 1)) { add2(c[k][3], c[k][0]); if (((int)c[k].size()) - 2 > n - (((int)c[k].size()) - 2)) add2(c[k][0], c[k][2]); } } else { for (int i = 0, ThxDem = ((int)c[k].size()); i < ThxDem; ++i) { add2(c[k][i], c[k][(i + 2) % ((int)c[k].size())]); if (((int)c[k].size()) - i - 1 <= n - (((int)c[k].size()) - i - 1)) break; } } vector<int> t; for (int x : c[k]) if (s0[x] == x) t.push_back(x); c[k] = t; } int l = -1; for (int i = 0, ThxDem = nc; i < ThxDem; ++i) q.push(make_pair(((int)c[i].size()), i == k ? i : -i)); while (!q.empty()) { auto p = q.top(); q.pop(); int i = abs(p.second); if (l >= 0 && v[l] == i) { if (q.empty()) break; auto qwe = p; p = q.top(); q.pop(); q.push(qwe); i = abs(p.second); } if (l >= 0) add(s1[l], s0[c[i][w[i]]]); l = c[i][w[i]++]; if (p.first > 1) q.push(make_pair(p.first - 1, i == k ? i : -i)); } if (v[l] != k) { add(s1[l], s0[c[k][0]]); } } puts( -1 ); return 0; } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-9; int main() { cout << fixed << setprecision(12); int n, k; cin >> n >> k; vector<vector<int>> y(n, vector<int>(k + 1)); for (auto &yi : y) for (auto &yij : yi) cin >> yij; vector<double> sum(n); for (int j = 0; j < k; j++) { vector<tuple<int, int, int>> v; for (int i = 0; i < n; i++) { v.emplace_back(y[i][j + 1] - y[i][j], y[i][j], i); } sort(begin(v), end(v)); auto calc = [&](int k) { vector<double> x(n + 1), y(n + 1); x[0] = 0.0, y[0] = 0.0; x[1] = 1.0, y[1] = 0.0; int sz = 2; for (auto &t : v) if (get<2>(t) < k) { auto a = get<0>(t), b = get<1>(t); auto f = [&](double x) { return a * x + b; }; int p = sz - 1; while (p >= 0 && f(x[p]) + eps >= y[p]) p--; if (p == -1) { y[0] = f(x[0] = 0.0); y[1] = f(x[1] = 1.0); sz = 2; } else if (p != sz - 1) { double a2 = (y[p + 1] - y[p]) / (x[p + 1] - x[p]); double b2 = y[p] - x[p] * a2; double x2 = (b2 - b) / (a - a2); y[p + 1] = f(x[p + 1] = x2); y[p + 2] = f(x[p + 2] = 1.0); sz = p + 3; } } double sum = 0.0; for (int i = 0; i + 1 < sz; i++) { sum += (x[i + 1] - x[i]) * (y[i + 1] + y[i]) / 2; } return sum; }; vector<double> acc(n + 1); for (int i = 0; i < n; i++) acc[i + 1] = calc(i + 1); for (int i = 0; i < n; i++) sum[i] += acc[i + 1] - acc[i]; } for (int i = 0; i < n; i++) cout << sum[i] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 200010; int a[maxn]; int f[maxn]; int miss[maxn]; int sum[maxn]; int main() { int n, s; cin >> n >> s; for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); } int ans1 = 0; if (a[s] != 0) { ans1++; a[s] = 0; } int zero = 0; for (int i = 1; i <= n; i++) { f[a[i]]++; if (a[i] == 0) { zero++; } } zero--; int i = 0; while (zero--) { while (f[i] != 0) { i++; } f[0]--; f[i]++; ans1++; } sum[0] = 1; for (int i = 1; i < n; i++) { if (f[i] == 0) { miss[i] = miss[i - 1] + 1; } else { miss[i] = miss[i - 1]; } sum[i] = sum[i - 1] + f[i]; } int ans2 = 1e9; for (int i = n - 1; i >= 1; i--) { int tmp = max((n - sum[i]), miss[i]); ans2 = min(ans2, tmp); } if (n == 1) { ans2 = 0; } cout << ans1 + ans2 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long double PI = acos(-1); long double DEL = 1e-10; int M = 1e9 + 7; const int N = 3e5 + 10; #define ftt cin>>tc;for(int cas=1;cas<=tc;++cas) #define all(a) a.begin(),a.end() #define vpii vector<pair<int,int> > #define vvi vector<vector<int> > #define va(x) vector<array<int,(x)> > #define pii pair<int,int> #define vi vector<int> #define sq(a) ((a)*(a)) #define double long double #define dbg cout<< nhi n ; #define int long long #define nl cout<< n #define sp << << #define S second #define F first template<class T> using minpq = priority_queue<T,vector<T>,greater<T> >; struct DSU { vi par,size; DSU (int n) { par.resize(n+1); size.resize(n+1); for(int i=0;i<=n;i++) { par[i] = i; size[i] = 1; } } int find(int x) { return par[x] = (x == par[x]? par[x]:find(par[x])); } void join(int x,int y) { int parx = find(x),pary = find(y); if(parx == pary) { return; } if(size[parx] > size[pary]) { size[parx] += size[pary]; par[pary] = parx; } else { size[pary] += size[parx]; par[parx] = pary; } } }; int fpow(int x, int n) { int res = 1; x %= M; while(n) { if(n&1)res = res * x % M; x = x * x % M; n>>=1; } return res; } int gcd(int a,int b) { if(b == 0)return a; return gcd(b,a % b); } int lcm(int a,int b) { return a*(b/gcd(a,b)); } int popcount(int x) { return bitset<65>(x).count(); } vector<int> fac(N),inv(N); void create_fac(int n) { fac[0] = inv[0] = 1; for(int i=1;i<=n;i++) { fac[i] = fac[i-1]*i % M; inv[i] = fpow(fac[i],M-2); } } int ncr(int n,int r) { if(r > n)return 0; return fac[n] * (inv[r] * inv[n-r] % M) % M; return fac[n] * (fpow(fac[r],M-2) * fpow(fac[n-r],M-2) % M ) % M; } void sieve (int n) { vector<int> pf(N); pf[0] = pf[1] = 1; for (int i = 2; i <= n; i++) { if (!pf[i]) { pf[i] = i; for (int j = i * i; j <= n; j += i){ pf[j] = i; } } } } //**************************************** CHECK CONSTRAINTS *************************************** int cnt, sum, mid, mx, mn, ans, a[N], b[N]; int n, m, d, i, j, k, l, p, q, r, t, w, x, y, z, tc; string s; vvi dp(402,vi(402)); int32_t main() { ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); #ifndef ONLINE_JUDGE freopen( /Users/jenish/XCode/cp/input.txt , r ,stdin); #endif cin >> n >> M; // dp[i][j] => done till i and had j gaps. for(int i = 1;i <= n;i++){ dp[i][0] = fpow(2,i-1); } create_fac(n+2); for(int i = 2;i <= n;i++){ for(int gaps = 1;gaps <= i - 2;gaps++){ //lgp = last gap position for(int lgp = 2;lgp < i;lgp++){ //cout << i sp gaps sp lgp;nl; //cout << dp[lgp - 1][gaps - 1] sp fpow(2,i - lgp - 1) sp ncr(i - gaps,i - lgp);nl; dp[i][gaps] += (dp[lgp - 1][gaps - 1] * fpow(2,i - lgp - 1) % M) * ncr(i - gaps,i - lgp) % M; dp[i][gaps] %= M; } } } for(int gaps = 0;gaps < n - 1;gaps++){ //cout<<gaps sp dp[n][gaps];nl; ans += dp[n][gaps]; ans %= M; } cout << ans; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const string nl = n ; vector<int> readVector(int n) { vector<int> ret(n); for (int i = 0; i < n; i++) cin >> ret[i]; return ret; } void setIO(string name) { freopen((name + .in ).c_str(), r , stdin); freopen((name + .out ).c_str(), w , stdout); } int recur(vector<int> vec, int sig) { vector<int> s1, s0; for (int i = 0; i < vec.size(); i++) { if ((vec[i] & (1 << sig)) == 0) { s0.push_back(vec[i]); } else s1.push_back(vec[i]); } if (s1.size() < 2 && s0.size() < 2) return 0; if (s1.size() < 2) return recur(s0, sig - 1); if (s0.size() < 2) return recur(s1, sig - 1); return min(s0.size() - 1 + recur(s1, sig - 1), s1.size() - 1 + recur(s0, sig - 1)); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; int n; cin >> n; vector<int> a = readVector(n); cout << recur(a, 30) << nl; return 0; } |
#include <bits/stdc++.h> int n, m; char map[1010][1010], ans[1010][1010]; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %s , map[i] + 1); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) ans[i][j] = . ; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { if (map[i][j] != b ) continue; int c = a + 2 * ((i / 2 + j / 2) % 2) + i % 2; if (map[i - 1][j] == w && map[i + 1][j] == w ) ans[i - 1][j] = ans[i][j] = ans[i + 1][j] = c, map[i - 1][j] = map[i][j] = map[i + 1][j] = . ; else if (map[i][j - 1] == w && map[i][j + 1] == w ) ans[i][j - 1] = ans[i][j] = ans[i][j + 1] = c, map[i][j - 1] = map[i][j] = map[i][j + 1] = . ; } bool ok = true; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) if (map[i][j] != . ) ok = false; puts(ok ? YES : NO ); if (ok) for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) putchar(ans[i][j]); putchar( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n; struct mat { long long** val; mat() { val = new long long*[6]; for (int i = 0; i < 6; i++) { val[i] = new long long[6]; for (int j = 0; j < 6; j++) val[i][j] = 0; val[i][i] = 1; } } mat(long long v[6][6]) { val = new long long*[6]; for (int i = 0; i < 6; i++) { val[i] = new long long[6]; for (int j = 0; j < 6; j++) val[i][j] = v[i][j]; } } mat operator*(const mat& b) { mat ans; for (int i = 0; i < 6; i++) { for (int j = 0; j < 6; j++) { ans.val[i][j] = 0; for (int k = 0; k < 6; k++) { ans.val[i][j] += (val[i][k] * b.val[k][j]) % n; ans.val[i][j] %= n; } } } return ans; } mat& operator=(const mat& b) { for (int i = 0; i < 6; i++) { for (int j = 0; j < 6; j++) val[i][j] = b.val[i][j]; } return *this; } }; long long rec[6][6] = {{2, 1, 1, 0, 1, 2}, {1, 2, 0, 1, 1, 2}, {1, 1, 1, 0, 1, 2}, {1, 1, 0, 1, 1, 2}, {0, 0, 0, 0, 1, 1}, {0, 0, 0, 0, 0, 1}}; mat matrec; mat matexp(long long e) { if (e == 0ll) return mat(); mat tmp = matexp(e / 2ll); tmp = (tmp * tmp); if (e & 1) return tmp * matrec; return tmp; } int main() { ios::sync_with_stdio(0); matrec = mat(rec); long long sx, sy, dx, dy, t; cin >> n >> sx >> sy >> dx >> dy >> t; if (t == 0ll) { cout << sx << << sy << n ; return 0; } sx--; sy--; dx %= n; dy %= n; while (dx < 0) dx += n; while (dy < 0) dy += n; long long vec[] = {sx, sy, dx, dy, 0, 1}; mat ans = matexp(t); long long ansx = 0, ansy = 0; for (int i = 0; i < 6; i++) { ansx += (vec[i] * ans.val[0][i]) % n; ansy += (vec[i] * ans.val[1][i]) % n; ansx %= n; ansy %= n; } cout << ansx + 1 << << ansy + 1 << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 100; const int mod = 1e9 + 7; int main() { ios::sync_with_stdio(0); int t; cin >> t; while (t--) { int n, x, y; cin >> n >> x >> y; cout << max(min(n, x + y - n + 1), 1) << << min(x + y - 1, n) << endl; } } |
#include <bits/stdc++.h> using namespace std; using ll = long long; namespace SCCKosaraju { vector<vector<int>> adj, radj; vector<int> todo, comp, curr; vector<bool> vis; void dfs1(int x) { vis[x] = 1; for (int y : adj[x]) if (!vis[y]) dfs1(y); todo.push_back(x); } void dfs2(int x, int i) { comp[x] = i; curr.push_back(x); for (int y : radj[x]) if (comp[y] == -1) dfs2(y, i); } vector<int> scc(vector<vector<int>>& _adj) { adj = _adj; int time = 0, n = adj.size(); comp.resize(n, -1), radj.resize(n), vis.resize(n); for (int x = 0; x < n; x++) for (int y : adj[x]) radj[y].push_back(x); for (int x = 0; x < n; x++) if (!vis[x]) dfs1(x); reverse(todo.begin(), todo.end()); for (int x : todo) if (comp[x] == -1) dfs2(x, time++); return comp; } }; // namespace SCCKosaraju int main() { cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit); const ll MOD = 1000000007; int n; cin >> n; vector<int> cost(n); for (int& x : cost) cin >> x; vector<vector<int>> adj(n); int m; cin >> m; for (int i = 0; i < m; i++) { int u, v; cin >> u >> v; adj[u - 1].push_back(v - 1); } vector<int> comp = SCCKosaraju::scc(adj); vector<ll> add(comp.size(), (int)1e9 + 10); vector<ll> cnt(comp.size(), 1); int ncomps = 0; for (int i = 0; i < n; i++) { ncomps = max(ncomps, comp[i] + 1); if (cost[i] < add[comp[i]]) { add[comp[i]] = cost[i]; cnt[comp[i]] = 1; } else if (cost[i] == add[comp[i]]) cnt[comp[i]]++; } ll ans = 0, ways = 1; for (int i = 0; i < ncomps; i++) ans += add[i]; for (int i = 0; i < ncomps; i++) ways = (ways * cnt[i]) % MOD; cout << ans << << ways << n ; } |
#include <bits/stdc++.h> using namespace std; const int Maxn = 10000005, p = 1e9 + 7; int n, k, cnt, phi[Maxn], prim[Maxn], sum[Maxn], ct[Maxn]; long long ans; bool vis[Maxn]; void init(void) { phi[1] = 1; for (int i = 2; i <= n; i++) { if (!vis[i]) prim[++cnt] = i, phi[i] = i - 1; for (int j = 1; j <= cnt && i * prim[j] <= n; j++) { vis[i * prim[j]] = true; if (i % prim[j] == 0) { phi[i * prim[j]] = phi[i] * prim[j]; break; } phi[i * prim[j]] = phi[i] * (prim[j] - 1); } } } long long get_inv(int x) { if (x <= 1) return 1; return (p - p / x) * get_inv(p % x) % p; } int main() { scanf( %d%d , &n, &k); init(); for (int i = 2; i <= n; i++) sum[i] = (sum[i - 1] + phi[i]) % p; for (int i = 1; i <= n; i++) ct[i] = n - i - 1; for (int i = 1; i < n; i++) { int l = (n - 1) / i; (ct[i] += sum[l + 1]) %= p; (ct[(l + 1) * i - n] += p - phi[l + 1]) %= p; } long long now = 1; for (int i = 1; i < n; i++) { now = now * k % p; (ans += ct[i] * now) %= p; } printf( %lld , ans * get_inv(now * k % p) % p); return 0; } |
#include <bits/stdc++.h> using namespace std; int a[100010], diff[100010]; int main() { int i, j, k, n, neg1, neg2, pos, ans, mx = -1, df, d; cin >> n; for (i = 0; i < n; i++) cin >> a[i]; for (i = 0; i < n - 1; i++) { diff[i] = a[i] - a[i + 1]; } i = 0; while (i < n - 1) { neg1 = neg2 = pos = ans = d = 0; while (i < n - 1 && diff[i] < 0) { neg1++; i++; } while (i < n - 1 && diff[i] >= 0) { pos++; i++; } if (pos) { if (pos == 1) { if ((i + 1 < n && a[i + 1] - a[i - 1] > 1) || (i - 2 >= 0 && a[i] - a[i - 2] > 1)) { j = i; while (j < n - 1 && diff[j] < 0) { neg2++; j++; } } ans = neg1 + neg2 + 1; d = 1; } else { ans = neg1 + 1; d = 1; } } else { ans = neg1; d = 0; } if (ans > mx || ((ans == mx) && (d == 0))) { mx = ans; df = d; } } if (n < 3) cout << n; else if (mx == 0) cout << 2 ; else { if (df == 0 && mx + 1 < n) cout << mx + 2; else cout << mx + 1; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; char s[100000 + 10]; int num[30]; int main() { scanf( %d , &n); scanf( %s , s); sort(s, s + n); printf( %s n , s); } |
#include <bits/stdc++.h> using namespace std; void fileioe() { freopen( input.txt , r , stdin); freopen( xyz.txt , w , stdout); freopen( error.txt , w , stderr); } const long long mod = 1000000007; const long long INF = 1e18; const long long MAX = 100001; void solve() { long long n; cin >> n; string s; cin >> s; string str1, str2; int flag1 = 0, flag0 = 0; for (int i = 0; i < n; i++) { if (s[i] == 1 ) { flag1 = 1; for (int j = 0; j < i; j++) { if (s[j] == 0 ) str1 += 0 ; } break; } } for (int i = n - 1; i >= 0; i--) { if (s[i] == 0 ) { flag0 = 1; str2 = s.substr(i); break; } } if (flag1 == 0 || flag0 == 0) { cout << s << endl; return; } string res = str1 + str2; if (res.length() > n) { cout << res.substr(1) << endl; return; } cout << res << endl; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long t; t = 1; cin >> t; for (int i = 1; i <= t; i++) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long lkd(long long a, long long b) { while (b > 0) { long long c = b; b = a % b; a = c; } return a; } int main() { long long a, s, b = 1; cin >> a >> s; for (long long i = 0; i < s; i++) b = b * 10; cout << (a * b) / lkd(a, b); } |
#include <bits/stdc++.h> using namespace std; const int M = 110000; long long a[M], b[M], c[M], be[M]; long long n, d, x; long long getNextX() { x = (x * 37 + 10007) % 1000000007; return x; } void initAB() { long long i; for (i = 0; i < n; i = i + 1) { a[i] = i + 1; } for (i = 0; i < n; i = i + 1) { swap(a[i], a[getNextX() % (i + 1)]); } for (i = 0; i < n; i = i + 1) { if (i < d) b[i] = 1; else b[i] = 0; } for (i = 0; i < n; i = i + 1) { swap(b[i], b[getNextX() % (i + 1)]); } } int main() { long long i, j, k; while (~scanf( %I64d%I64d%I64d , &n, &d, &x)) { initAB(); vector<int> vt; memset(be, 0, sizeof(be)); int cnt = 0; for (i = 0; i < n; i++) if (b[i]) cnt++; if (cnt <= sqrt(n)) { for (i = 0; i < n; i++) if (b[i]) vt.push_back(i); for (i = 0; i < n; i++) { long long mx = 0; for (j = 0; j < vt.size(); j++) { k = vt[j]; if (k > i) break; c[i] = max(c[i], a[i - k]); } } } else { vector<pair<int, int> > vc; for (i = 0; i < n; i++) vc.push_back(make_pair(a[i], i)); sort(vc.begin(), vc.end()); for (i = 0; i < n; i++) { for (j = n - 1; j >= 0; j--) { if (vc[j].second <= i && b[i - vc[j].second]) { c[i] = vc[j].first; break; } } } } for (i = 0; i < n; i++) cout << c[i] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 5; int ans[N << 1]; int main() { int n; cin >> n; int b1 = n + 1; int b2 = 2 * n - 1; int a1 = 1; int a2 = n; int cnt = 1; for (int i = 1; i <= n - 1; ++i) { if (cnt & 1) ans[a1++] = i, ans[a2--] = i; else ans[b1++] = i, ans[b2--] = i; cnt++; } for (int i = 1; i <= 2 * n; ++i) if (ans[i] == 0) cout << n << ; else cout << ans[i] << ; } |
#include <bits/stdc++.h> typedef struct { long long s, l, r, m; } value; long long maxll(long long a, long long b) { return a > b ? a : b; } void sum(value *v, value *l, value *r) { v->s = l->s + r->s; v->l = maxll(l->l, l->s + r->l); v->r = maxll(r->r, r->s + l->r); v->m = maxll(l->r + r->l, maxll(l->m, r->m)); } value t[4 * 150000]; long long a[150000]; void build(int i, int l, int r) { if (l == r) { t[i].s = a[l]; t[i].l = t[i].r = t[i].m = maxll(a[l], 0); } else { int m = (l + r) / 2; build(2 * i + 1, l, m); build(2 * i + 2, m + 1, r); sum(&t[i], &t[2 * i + 1], &t[2 * i + 2]); } } value get(int ll, int rr, int i, int l, int r) { if (rr < l || r < ll) { value v = {0, 0, 0, 0}; return v; } if (ll <= l && r <= rr) return t[i]; int m = (l + r) / 2; value lv, rv, av; lv = get(ll, rr, 2 * i + 1, l, m); rv = get(ll, rr, 2 * i + 2, m + 1, r); sum(&av, &lv, &rv); return av; } int main() { int n, m, c; scanf( %d%d%d , &n, &m, &c); int i, x[150000]; for (i = 0; i < n; i++) scanf( %d , &x[i]); int p[150000]; for (i = 0; i < n - 1; i++) scanf( %d , &p[i]); for (i = 0; i < n - 1; i++) a[i] = 1LL * (x[i + 1] - x[i]) * 50 - c * p[i]; build(0, 0, n - 2); long long s = 0; for (i = 0; i < m; i++) { int l, r; scanf( %d%d , &l, &r); l--; r--; r--; s += get(l, r, 0, 0, n - 2).m; } printf( %.2lf n , 1. * s / 100); return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> inline void read(T &x) { x = 0; char c = getchar(); bool f = 0; for (; !isdigit(c); c = getchar()) f ^= c == - ; for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ 48); x = f ? -x : x; } int n, x, len, res, minn = 0x7fffffff; char s[400001]; string ans, c[6] = { RGB , RBG , BRG , BGR , GRB , GBR }; int main() { read(n); scanf( %s , s), len = strlen(s); for (int i = 0; i < 6; i++) { res = 0, x = 0; for (int j = 0; j < len; j++) { if (s[j] != c[i][x++]) res++; if (x == 3) x = 0; } if (res < minn) { minn = res; ans = c[i]; } } x = 0; cout << minn << n ; for (int j = 0; j < len; j++) { putchar(ans[x++]); if (x == 3) x = 0; } putchar( n ); return 0; } |
#include <bits/stdc++.h> #pragma optimization_level 3 #pragma GCC optimize( Ofast,no-stack-protector,unroll-loops,fast-math,O3 ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx ) using namespace std; const long double PI = 3.14159265358979323846; const long long mod = 1e+9 + 7; const int INFi = INT_MAX; const long long INF = (long long)1e+9 + 7; const int N = 1200300, LOGN = 30, V = N * LOGN; long long dx4[] = {0, 1, 0, -1}, dy4[] = {1, 0, -1, 0}; int t = 1; long long a, b, c, ans; string second; void MAIN() { cin >> a >> b >> c; ans = 0; ans = max(ans, a / 3 + b / 3 + c / 3); if (a > 0 && b > 0 && c > 0) ans = max(ans, 1 + (a - 1) / 3 + (b - 1) / 3 + (c - 1) / 3); if (a > 1 && b > 1 && c > 1) ans = max(ans, 2 + (a - 2) / 3 + (b - 2) / 3 + (c - 2) / 3); cout << ans << endl; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout << fixed; cout << setprecision(10); ; mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); ; while (t--) { MAIN(); } } |
#include <bits/stdc++.h> using namespace std; const int maxn = 3005; int prv[maxn], nxt[maxn], cnt[maxn]; int le[maxn]; int r, c, n, k; vector<int> pos[maxn]; signed main(void) { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> r >> c >> n >> k; for (int i = 1; i <= n; ++i) { int x, y; cin >> x >> y; pos[y].emplace_back(x); } long long res = 0; for (int i = 1; i <= c; ++i) { set<int> second; second.insert(0); second.insert(r + 1); for (int j = 0; j <= r; ++j) cnt[j] = 0, le[j] = 0; nxt[0] = r + 1; prv[r + 1] = 0; long long sum = 0; for (int j = i; j <= c; ++j) { for (int val : pos[j]) { if (!cnt[val]) { int l = *prev(second.lower_bound(val)); int r = *(second.upper_bound(val)); nxt[l] = val; nxt[val] = r; prv[r] = val; prv[val] = l; sum -= 1ll * le[l] * (nxt[val] - val); second.insert(val); } cnt[val]++; int cur = val, now = 0; while (cur != 0) { now += cnt[cur]; if (now >= k) break; cur = prv[cur]; } int total = cnt[val]; if (cur > le[val]) { sum += 1ll * (cur - le[val]) * (nxt[val] - val); le[val] = cur; } while (true) { val = nxt[val]; total += cnt[val]; now += cnt[val]; if (val > r || total > k) break; while (cur < val && now - cnt[cur] >= k) { now -= cnt[cur]; cur = nxt[cur]; } if (cur > le[val]) { assert(now >= k); sum += 1ll * (cur - le[val]) * (nxt[val] - val); le[val] = cur; } } } res += sum; } } cout << res; } |
#include <bits/stdc++.h> using namespace std; string s[555]; int dp[555], v[555], ones[555]; vector<pair<int, int> > vc[555]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, m, k; cin >> n >> m >> k; for (int i = 1; i <= n; i++) { cin >> s[i]; int cnt = 0; for (int j = 0; j < m; j++) { if (s[i][j] == 1 ) ones[cnt++] = j + 1; } memset(v, 0, sizeof(v)); v[cnt] = m; for (int j = 0; j < cnt; j++) { for (int k = j; k < cnt; k++) { int len = cnt - (k - j + 1); int value = m - (ones[k] - ones[j] + 1); v[len] = max(v[len], value); } } for (int j = 0; j <= k; j++) { if (v[j]) vc[i].push_back(make_pair(j, v[j])); } } for (int i = 1; i <= n; i++) { for (int j = k; j >= 0; j--) { for (int k = 0; k < vc[i].size(); k++) { if (j >= vc[i][k].first) dp[j] = max(dp[j], dp[j - vc[i][k].first] + vc[i][k].second); } } } cout << n * m - dp[k] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MaxN = int(2e5) + 256; const int INF = int(1e9); const int mod = (int)(1e9) + 7; const double pi = 3.1415926535897932384626433832795; long long n, m, ans, A[MaxN], k, a, b, q; long long t[MaxN * 8], t1[MaxN * 8]; void upd(int v, int l, int r, int pos, int val) { if (l == r) { t[v] += val; t1[v] += val; t[v] = min(a, t[v]); t1[v] = min(t1[v], b); return; } int m = (l + r) / 2; if (pos <= m) { upd(v + v, l, m, pos, val); } else upd(v + v + 1, m + 1, r, pos, val); t[v] = t[v + v] + t[v + v + 1]; t1[v] = t1[v + v] + t1[v + v + 1]; } long long get(int v, int l, int r, int tl, int tr) { if (l > tr || r < tl) return 0; if (tl <= l & r <= tr) return t[v]; int m = (l + r) / 2; return get(v + v, l, m, tl, tr) + get(v + v + 1, m + 1, r, tl, tr); } long long get1(int v, int l, int r, int tl, int tr) { if (l > tr || r < tl) return 0; if (tl <= l & r <= tr) return t1[v]; int m = (l + r) / 2; return get1(v + v, l, m, tl, tr) + get1(v + v + 1, m + 1, r, tl, tr); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n >> k >> a >> b >> q; while (q--) { int type; cin >> type; if (type == 1) { int x, y; cin >> x >> y; upd(1, 1, n, x, y); } else { int p; cin >> p; int S = 0; if (p > 1) { S = get1(1, 1, n, 1, p - 1); } int S1 = 0; if (p + k <= n) { S1 = get(1, 1, n, p + k, n); } cout << S + S1 << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, i, j; cin >> n; long long int a[n], b[n], t[n]; for (i = 1; i < n; i++) cin >> a[i]; for (i = 1; i < n; i++) cin >> b[i]; for (i = 0; i < 4; i++) { t[0] = i; for (j = 1; j < n; j++) { if (a[j] == 3 && b[j] == 0) { if (t[j - 1] == 1) t[j] = 2; else if (t[j - 1] == 2) t[j] = 1; else if (t[j - 1] == 3) t[j] = 0; else t[j] = 3; continue; } if (a[j] < b[j]) { cout << NO ; return 0; } if (a[j] == 2 && b[j] == 1) { cout << NO ; return 0; } if (t[j - 1] == a[j]) t[j] = b[j]; else if (t[j - 1] == b[j]) t[j] = a[j]; else break; } if (j == n) break; } if (i == 4) { cout << NO ; return 0; } cout << YES << endl; for (i = 0; i < n; i++) cout << t[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, depth = 0; string loc[500]; string comm; int main() { cin >> n; for (int i = 0; i < n; ++i) { cin >> comm; if (comm == cd ) { cin >> comm; int pos = 0; if (comm[0] == / ) { depth = 0; pos = 1; } string dir = ; for (; pos < comm.length(); ++pos) { if (comm[pos] != / ) dir += comm[pos]; if (comm[pos] == / || pos == comm.length() - 1) { if (dir == .. ) depth--; else loc[depth++] = dir; dir = ; } } } else { for (int i = 0; i < depth; ++i) cout << / << loc[i]; cout << / << endl; } } } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int n, p; cin >> n >> p; if (p == 0) { cout << __builtin_popcount(n); return 0; } if (p > 0) { long long int a = n; long long int cnt = 0; while (a > 0) { long long int temp = __builtin_popcount(a); long long int c = 0, k = 0; while (a) { if (a & 1) { k += (c + 1); } a = a / 2; c++; } if (temp <= cnt) { if (k >= cnt) { cout << cnt; return 0; } } cnt++; a = n - cnt * p; } } else { long long int a = n; long long int cnt = 0; while (cnt < 1000) { long long int temp = __builtin_popcount(a); long long int c = 0, k = 0; while (a) { if (a & 1) { k += (c + 1); } a = a / 2; c++; } if (temp <= cnt) { if (k >= cnt) { cout << cnt; return 0; } } cnt++; a = n - cnt * p; } } cout << -1; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long oo = 1000000000000000000; const int N = 100005; int main() { int n, x; scanf( %d , &n); multiset<int> a, b; for (int i = 0; i < int(n); i++) { scanf( %d , &x); a.insert(x); } for (int i = 0; i < int(n - 1); i++) { scanf( %d , &x); b.insert(x); a.erase(a.find(x)); } printf( %d n , *a.begin()); a.clear(); swap(a, b); for (int i = 0; i < int(n - 2); i++) { scanf( %d , &x); b.insert(x); a.erase(a.find(x)); } printf( %d n , *a.begin()); return 0; } |
#include <bits/stdc++.h> using namespace std; const long double Eps = 1e-8; char what[27] = A??????HI???M?O????TUVWXY? ; char str[100005]; void input() { scanf( %s , str); } bool good() { int N = strlen(str); for (int i = 0; i < N; i++) { if (str[i] != what[str[N - i - 1] - A ]) return false; } return true; } int main() { input(); printf(good() ? YES n : NO n ); } |
#include <bits/stdc++.h> using namespace std; int main() { int h, w, x, y, star = 0, sum, flag; char arr[505][505]; cin >> h >> w; for (int i = 1; i <= h; i++) { for (int j = 1; j <= w; j++) { cin >> arr[i][j]; if (arr[i][j] == * ) { star++; if (arr[i][j - 1] == * && arr[i - 1][j] == * ) { sum = 3; x = i; y = j; } } } } if (sum == 3) { if (arr[x][y + 1] == * && arr[x + 1][y] == * ) { sum = sum + 2; } if (sum == 5) { flag = 1; if (x + 2 <= h) { for (int i = x + 2; i <= h; i++) { if (arr[i][y] == * ) sum++; else break; } } if (x - 2 > 0) { for (int i = x - 2; i > 0; i--) { if (arr[i][y] == * ) sum++; else break; } } if (y + 2 <= w) for (int i = y + 2; i <= w; i++) { if (arr[x][i] == * ) sum++; else break; } if (y - 2 > 0) { for (int i = y - 2; i > 0; i--) { if (arr[x][i] == * ) sum++; else break; } } } } if (star == sum && sum >= 5) cout << YES ; else cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n; long long s, x; int main() { srand(time(NULL)); cin >> n; n--; s = 1; x = 12; while (n) { s += x; x += 12; n--; } cout << s << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int M = 1e5 + 10; int a[M], col[M], flag; bool vis[M]; vector<int> vc[M]; vector<pair<int, int> > node[M]; void bfs(int sta) { col[sta] = 0; vis[sta] = true; queue<int> q; q.push(sta); while (!q.empty()) { int u = q.front(); q.pop(); int len = node[u].size(); for (int i = 0; i < len; i++) { int co = col[u]; pair<int, int> v = node[u][i]; if (v.second == 0) { co ^= 1; } if (vis[v.first] && col[v.first] != co) { flag = false; return; } if (!vis[v.first]) { col[v.first] = co; vis[v.first] = true; q.push(v.first); } } } } int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); } for (int i = 1; i <= m; i++) { int sz; scanf( %d , &sz); for (int j = 1; j <= sz; j++) { int x; scanf( %d , &x); vc[x].push_back(i); } } for (int i = 1; i <= n; i++) { int u = vc[i][0], v = vc[i][1]; node[v].push_back(make_pair(u, a[i])); node[u].push_back(make_pair(v, a[i])); } memset(vis, false, sizeof(vis)); memset(col, -1, sizeof(col)); flag = true; for (int i = 1; i <= m; i++) { if (!vis[i]) { bfs(i); } } if (flag) printf( YES n ); else printf( NO n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int i, j, k, l; int n, m, d, a[100010][4]; int ms[11111]; double cx, cy, ccx, ccy; int x1, stupid_cmath, x2, y2; int main() { cin >> n; for (i = 0; i < n; ++i) { cin >> x1 >> stupid_cmath >> x2 >> y2; a[i][0] = ((x1) < (x2) ? (x1) : (x2)); a[i][1] = ((stupid_cmath) < (y2) ? (stupid_cmath) : (y2)); a[i][2] = ((x1) > (x2) ? (x1) : (x2)); a[i][3] = ((stupid_cmath) > (y2) ? (stupid_cmath) : (y2)); ms[i] = (a[i][2] - a[i][0]) * (a[i][2] - a[i][0]) * (a[i][2] - a[i][0]); } for (i = 0; i < n; ++i) { for (j = i - 1; j >= 0; --j) { cx = cy = 0; m = 0; for (k = j + 1; k <= i; ++k) { cx += (a[k][0] + a[k][2]) / 2. * ms[k]; cy += (a[k][1] + a[k][3]) / 2. * ms[k]; m += ms[k]; } cx /= m; cy /= m; if (cx < a[j][0] || cx > a[j][2] || cy < a[j][1] || cy > a[j][3]) { cout << i << endl; return 0; } } } cout << n; return 0; } |
#include <bits/stdc++.h> using namespace std; int a, b, c, n; int main() { ios_base::sync_with_stdio(false); ; cin >> a >> b >> c >> n; if (a - c < 0 || b - c < 0) return cout << -1, 0; if (a + b - c >= n) return cout << -1, 0; cout << n - (a + b - c); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 5; int n; string s; int main() { cin >> n; cin >> s; bool tmp = false; for (int i = 0; i <= s.size() - 1; i++) { if (s[i] > s[i + 1]) { tmp = true; s.erase(i, 1); break; } } if (!tmp) s.erase(s.size() - 1, 1); cout << s; } |
#include <bits/stdc++.h> using namespace std; const int mx = 1e5 + 10; long long len, ans, val[26], s[mx]; char str[mx]; map<pair<long long, char>, long long> dp; int main() { for (int i = 0; i < 26; i++) scanf( %I64d , &val[i]); scanf( %s , str); len = strlen(str); s[0] = val[str[0] - a ]; for (int i = 1; i < len; i++) s[i] = s[i - 1] + val[str[i] - a ]; for (int i = 0; i < len; i++) { ans += dp[make_pair(s[i - 1], str[i])]; dp[make_pair(s[i], str[i])]++; } printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, t, sum = 0, x; cin >> n >> x; while (n--) { cin >> t; sum += t; } if (sum < 0) sum *= -1; int ans = sum / x + bool(sum % x); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> int main() { int n; scanf( %d , &n); int p = 0; int a[100100]; for (int i = 0; i < n; i++) scanf( %d , &a[i]); int s = n + n - 1; for (int i = 0; i < n; i++) { s += fabs(a[i] - p); p = a[i]; } printf( %d n , s); } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:100000000000000 ) using namespace std; const long long int INF = 2e9 + 1; char s[50000], s2[50000]; struct automato { struct leaf { int link, len; map<char, int> nex; bool cl; leaf() : cl(false) {} }; vector<leaf> tree; vector<int> cnt, used; int sz, pre; automato() {} void init() { sz = 1; pre = 0; tree.resize(2 * 50000); cnt.resize(2 * 50000, 0); used.resize(2 * 50000, 0); tree[0].link = -1; tree[0].len = 0; }; void add_s(char c) { int cur = sz++; tree[cur].len = tree[pre].len + 1; int temp = pre; for (; temp != -1 && !tree[temp].nex.count(c); temp = tree[temp].link) { tree[temp].nex[c] = cur; } if (temp == -1) { tree[cur].link = 0; } else { int p = tree[temp].nex[c]; if (tree[p].len == tree[temp].len + 1) { tree[cur].link = p; } else { int clone = sz++; tree[clone].nex = tree[p].nex; tree[clone].len = tree[temp].len + 1; tree[clone].link = tree[p].link; tree[clone].cl = true; tree[p].link = clone; tree[cur].link = clone; for (; temp != -1 && tree[temp].nex.count(c) && tree[temp].nex[c] == p; temp = tree[temp].link) { tree[temp].nex[c] = clone; } } } pre = cur; }; void add_str(char *s) { int n = strlen(s); for (int i = 0; i < (n); i++) { add_s(s[i]); } } void dfs() { vector<pair<int, int> > len; for (int i = 0; i < (sz); i++) { len.push_back(make_pair(tree[i].len, i)); } sort(len.begin(), len.end()); reverse(len.begin(), len.end()); for (int i = 0; i < (sz); i++) { int id = len[i].second; if (!tree[id].cl) cnt[id]++; if (tree[id].link != -1) cnt[tree[id].link] += cnt[id]; } } int nx(int id, char c) { if (!tree[id].nex.count(c)) return -1; return tree[id].nex[c]; } int get_cnt(int now) { return cnt[now]; } }; int main() { scanf( %s%s , &s, &s2); int n = strlen(s), m = strlen(s2); automato a, b; a.init(); b.init(); a.add_str(s); b.add_str(s2); a.dfs(); b.dfs(); int out = INF; for (int i = 0; i < n; i++) { int st = 0, st2 = 0; for (int j = i; j < n; j++) { st = a.nx(st, s[j]); st2 = b.nx(st2, s[j]); if (st == -1 || st2 == -1) break; if (a.get_cnt(st) == 1 && b.get_cnt(st2) == 1) { out = min(out, j - i + 1); break; } } } cout << (out == INF ? -1 : out); } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); double n, k; cin >> n >> k; double a, b; cin >> a >> b; n--; double len = 0; while (n--) { double x, y; cin >> x >> y; len += ((double)sqrt(pow(x - a, 2) + pow(y - b, 2))); a = x; b = y; } len *= k; cout << fixed << setprecision(9) << len / (double)50 << n ; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e4; const int T = 24 * 60 * 60; int was, n, M, add, cnt, ans[N]; vector<int> ind[T]; int main() { scanf( %d%d%d , &n, &M, &add); for (int i = 0; i < (int)(n); i++) { int h, m, s; scanf( %d:%d:%d , &h, &m, &s); ind[s + 60 * (m + 60 * h)].push_back(i); } set<pair<int, int> > s; for (int i = 0; i < (int)(T); i++) { while ((int)(s).size() && s.begin()->first <= i) s.erase(s.begin()); for (int j : ind[i]) { if ((int)(s).size() < M) ans[j] = ++cnt; else { ans[j] = s.rbegin()->second; s.erase(*s.rbegin()); } s.insert(pair<int, int>(i + add, ans[j])); } was |= (int)(s).size() == M; } if (!was) puts( No solution ); else { printf( %d n , cnt); for (int i = 0; i < (int)(n); i++) printf( %d n , ans[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 998244353; int sum(int a, int b) { return (a + b) % MOD; } int prod(int a, int b) { return a * 1ll * b % MOD; } int mpow(int b, int e) { if (e == 0) return 1; if (e & 1) return prod(b, mpow(b, e - 1)); return mpow(prod(b, b), e / 2); } int main() { ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0); cout << fixed << setprecision(15); const int HALF = mpow(2, MOD - 2); int N; cin >> N; vector<vector<int> > adj(N); for (int i = 0; i < N - 1; i++) { int u, v; cin >> u >> v; adj[u - 1].push_back(v - 1); adj[v - 1].push_back(u - 1); } int ans = 0; function<int(int, int)> calc = [&](int loc, int par) { int nm = 1; for (int nbr : adj[loc]) { if (nbr == par) continue; int unv = calc(nbr, loc); unv = sum(unv, prod(HALF, sum(1, MOD - unv))); nm = prod(nm, unv); } nm = sum(1, MOD - nm); ans = sum(ans, nm); return nm; }; calc(0, 0); for (int i = 0; i < N; i++) ans = prod(ans, 2); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n; bool a = false; cin >> n; for (long long i = 1; i < n; i++) { for (long long j = 1; j < n; j++) { if (((n - i - j) % 3) != 0 && (i % 3) != 0 && (j % 3) != 0) { cout << i << << j << << (n - i - j) << endl; a = true; break; } } if (a) break; } return 0; } |
#include <bits/stdc++.h> using namespace std; int gi() { int x = 0, w = 1; char ch = getchar(); while ((ch < 0 || ch > 9 ) && ch != - ) ch = getchar(); if (ch == - ) w = 0, ch = getchar(); while (ch >= 0 && ch <= 9 ) x = (x << 3) + (x << 1) + ch - 0 , ch = getchar(); return w ? x : -x; } const int N = 3e5 + 5; int q, fa[N + N], top; pair<int, int> sz[N + N], sta[N]; map<pair<int, int>, int> M; vector<pair<int, int> > vec[N << 2]; long long ans; pair<int, int> operator+(pair<int, int> a, pair<int, int> b) { return make_pair(a.first + b.first, a.second + b.second); } pair<int, int> operator-(pair<int, int> a, pair<int, int> b) { return make_pair(a.first - b.first, a.second - b.second); } int find(int x) { return x == fa[x] ? x : find(fa[x]); } void modify(int x, int l, int r, int ql, int qr, pair<int, int> p) { if (l >= ql && r <= qr) { vec[x].push_back(p); return; } int mid = l + r >> 1; if (ql <= mid) modify(x << 1, l, mid, ql, qr, p); if (qr > mid) modify(x << 1 | 1, mid + 1, r, ql, qr, p); } void dfs(int x, int l, int r) { int tt = top; for (pair<int, int> p : vec[x]) if (find(p.first) != find(p.second)) { int u = find(p.first), v = find(p.second); if (sz[u].first + sz[u].second < sz[v].first + sz[v].second) swap(u, v); sta[++top] = make_pair(u, v); ans -= 1ll * sz[u].first * sz[u].second; ans -= 1ll * sz[v].first * sz[v].second; fa[v] = u; sz[u] = sz[u] + sz[v]; ans += 1ll * sz[u].first * sz[u].second; } if (l == r) printf( %lld , ans); else { int mid = l + r >> 1; dfs(x << 1, l, mid); dfs(x << 1 | 1, mid + 1, r); } while (top > tt) { int u = sta[top].first, v = sta[top].second; --top; ans -= 1ll * sz[u].first * sz[u].second; fa[v] = v; sz[u] = sz[u] - sz[v]; ans += 1ll * sz[u].first * sz[u].second; ans += 1ll * sz[v].first * sz[v].second; } } int main() { q = gi(); for (int i = 1; i <= q; ++i) { int x = gi(), y = gi() + N; if (M.find(make_pair(x, y)) == M.end()) M[make_pair(x, y)] = i; else modify(1, 1, q, M[make_pair(x, y)], i - 1, make_pair(x, y)), M.erase(make_pair(x, y)); } for (auto it = M.begin(); it != M.end(); ++it) modify(1, 1, q, (*it).second, q, (*it).first); for (int i = 1; i < N + N; ++i) fa[i] = i, sz[i] = make_pair(i < N, i >= N); dfs(1, 1, q); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, s, k; vector<int> a; void Input() { cin >> n >> s >> k; a.clear(); a.resize(k); for (auto &z : a) cin >> z; } void Solve() { for (int i = 0; i <= k; i++) { if (s - i >= 1 && find(a.begin(), a.end(), s - i) == a.end()) { cout << i << n ; return; } if (s + i <= n && find(a.begin(), a.end(), s + i) == a.end()) { cout << i << n ; return; } } assert(false); } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); int T; cin >> T; while (T--) { Input(); Solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, i, j, a[102][102]; scanf( %d , &n); ; for (i = 0; i < n; i++) { for (j = 0; j < n; j++) scanf( %d , &a[i][j]); ; } if (i == 1) { printf( 0 n ); return 0; } for (i = 0; i < n; i++) { int f[32] = {0}; for (j = 0; j < n; j++) { if (i == j) continue; int x = a[i][j], c = 0; while (x > 0) { if (x & 1) f[c] = 1; c++; x /= 2; } } int ans = 0, k; j = 1; for (k = 0; k < 32; k++) { if (f[k]) ans += j; j *= 2; } printf( %d , ans); } printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; int a[t]; for (int i = 0; i < t; i++) { cin >> a[i]; if (360 % (180 - a[i]) == 0) cout << YES << endl; else cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> void chmax(T &a, T b) { if (a < b) a = b; } template <class T> void chmin(T &a, T b) { if (a > b) a = b; } constexpr long long INF = 1000000000000000000; constexpr long long mod = 1000000007; constexpr long double eps = 1e-8; const long double pi = acos(-1); long long dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; long long Random(long long mi, long long ma) { random_device rnd; mt19937 mt(rnd()); uniform_int_distribution<long long> engine(mi, ma); return engine(mt); } long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } bool prime(long long a) { if (a == 1) return false; for (long long i = 2; i * i <= a; i++) { if (a % i == 0) return false; } return true; } long long modpow(long long a, long long b) { if (b == 0) return 1; if (b % 2) return modpow(a, b - 1) * a % mod; long long memo = modpow(a, b / 2); return memo * memo % mod; } vector<long long> kaijo, invkaijo; void init_fact(long long n) { kaijo.resize(n + 1); invkaijo.resize(n + 1); kaijo[0] = 1; for (long long i = 1; i <= n; i++) { kaijo[i] = kaijo[i - 1] * i; kaijo[i] %= mod; } for (long long i = 0; i < n + 1; i++) invkaijo[i] = modpow(kaijo[i], mod - 2); } long long comb(long long a, long long b) { if (a < b) return 0; if (a < 0 || b < 0) return 0; return kaijo[a] * modpow(kaijo[a - b], mod - 2) % mod * modpow(kaijo[b], mod - 2) % mod; } long long inv(long long x) { x = modpow(x, mod - 2); return x; } struct BIT { long long n, beki = 1; vector<long long> bit; BIT(long long x) { bit.resize(x + 1, 0); n = x; while (beki * 2 <= n) beki *= 2; } long long sum(long long i) { long long res = 0; while (i > 0) { res += bit[i]; i -= i & -i; } return res; } void add(long long i, long long x) { while (i <= n) { bit[i] += x; i += i & -i; } } long long lowerbound(long long w) { if (w <= 0) return 0; long long x = 0; for (long long k = beki; k > 0; k >>= 1) { if (x + k <= n && bit[x + k] < w) { w -= bit[x + k]; x += k; } } return x + 1; } }; signed main() { cin.tie(0); ios::sync_with_stdio(false); long long n, k; cin >> n >> k; vector<pair<long long, long long> > v[200010]; BIT bit(200001); for (long long i = 0; i < n; i++) { long long l, r; cin >> l >> r; bit.add(l, 1); bit.add(r + 1, -1); v[l].push_back({r, i + 1}); } priority_queue<pair<long long, long long> > q; vector<long long> ans; for (long long i = 1; i <= 200000; i++) { for (pair<long long, long long> j : v[i]) q.push(j); while (bit.sum(i) > k) { bit.add(i, -1); bit.add(q.top().first + 1, 1); ans.push_back(q.top().second); q.pop(); } } cout << ans.size() << endl; for (long long i : ans) cout << i << ; cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; void data() {} const int N = 1e6 + 100; const long long mod = 998244353; const long long mod2 = 1e9 + 7; map<int, int> was, was2; int main() { data(); int t; cin >> t; while (t--) { int n; cin >> n; int a[n + 1]; for (int i = 1; i <= n; i++) { cin >> a[i]; } int len = 0; for (int i = 1; i <= n - 1 && a[i] == 1; i++) { len++; } if (len % 2 == 0) { cout << First n ; } else { cout << Second n ; } } } |
#include <bits/stdc++.h> using namespace std; struct edge { int u, v; long long w; }; long long MOD = 1000000007; long long _MOD = 1000000009; double EPS = 1e-10; long long c[100][100]; long long C(long long n, long long k) { if (n < 100) return c[n][k]; long long ans = 1; for (int i = 0; i < k; i++) ans *= n - i; for (int i = 1; i <= k; i++) ans /= i; return ans; } class NumberMagic { public: int theMin(int _N, int _M) { if (_N == 1) return 0; for (int i = 0; i < 100; i++) { c[i][0] = 1; for (int j = 1; j <= i; j++) c[i][j] = c[i - 1][j - 1] + c[i - 1][j]; } long long N = _N, M = _M; long long lb = 0, ub = N - 1; while (ub - lb > 1) { long long mid = (lb + ub) / 2; long long n = N, sum = 0; for (long long k = 0; k <= mid && n; k++) { long long unko = min(n, C(mid, k)); n -= unko; sum += k * unko; } if (!n && sum <= mid * M) ub = mid; else lb = mid; } return ub; } }; int main() { NumberMagic nm; int T; cin >> T; while (T--) { int N, M; cin >> N >> M; cout << nm.theMin(N, M) << endl; } } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:256000000 ) using namespace std; mt19937 ggen; int n, s; int a[200010]; int ctr[200010]; vector<int> v; void solve() { cin >> n >> s; s--; for (int i = 0; i < n; i++) cin >> a[i]; int ans = 0; if (a[s] != 0) ans++; for (int i = 0; i < n; i++) { if (i != s) { if (a[i] == 0) a[i] = 200009; ctr[a[i]]++; v.push_back(a[i]); } } sort(v.begin(), v.end()); for (int i = 1; !v.empty() && i <= v.back(); i++) { if (ctr[i] == 0) { ans++; ctr[v.back()]--; v.pop_back(); } } cout << ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); ggen = mt19937(13); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T, bool maximum_mode = false> struct RMQ { int n = 0, levels = 0; vector<vector<T>> range_min; RMQ(const vector<T> &values = {}) { if (!values.empty()) build(values); } static int largest_bit(int x) { return 31 - __builtin_clz(x); } static T better(T a, T b) { return maximum_mode ? max(a, b) : min(a, b); } void build(const vector<T> &values) { n = values.size(); levels = largest_bit(n) + 1; range_min.resize(levels); for (int k = 0; k < levels; k++) range_min[k].resize(n - (1 << k) + 1); if (n > 0) range_min[0] = values; for (int k = 1; k < levels; k++) for (int i = 0; i <= n - (1 << k); i++) range_min[k][i] = better(range_min[k - 1][i], range_min[k - 1][i + (1 << (k - 1))]); } T query_value(int a, int b) const { assert(0 <= a && a < b && b <= n); int level = largest_bit(b - a); return better(range_min[level][a], range_min[level][b - (1 << level)]); } }; template <typename T_string> struct suffix_array { int n = 0; T_string str; vector<int> suffix; vector<int> rank; vector<int> lcp; RMQ<int> rmq; suffix_array() {} suffix_array(const T_string &_str, bool build_rmq = true) { build(_str, build_rmq); } void build(const T_string &_str, bool build_rmq = true) { str = _str; n = str.size(); suffix.resize(n); for (int i = 0; i < n; i++) suffix[i] = i; bool large_alphabet = false; for (int i = 0; i < n; i++) if (str[i] < 0 || str[i] >= 128) large_alphabet = true; if (large_alphabet) { sort(suffix.begin(), suffix.end(), [&](int a, int b) { return str[a] < str[b]; }); } else { vector<int> freq(128, 0); for (int i = 0; i < n; i++) freq[str[i]]++; for (int c = 1; c < 128; c++) freq[c] += freq[c - 1]; for (int i = 0; i < n; i++) suffix[--freq[str[i]]] = i; } rank.resize(n); rank[suffix[0]] = 0; for (int i = 1; i < n; i++) rank[suffix[i]] = str[suffix[i]] == str[suffix[i - 1]] ? rank[suffix[i - 1]] : i; vector<int> next_index(n); vector<int> values(n); bool done = false; for (int len = 1; len < n && !done; len *= 2) { for (int i = 0; i < n; i++) next_index[i] = i; for (int i = n - len; i < n; i++) values[next_index[rank[i]]++] = i; for (int i = 0; i < n; i++) { int prev = suffix[i] - len; if (prev >= 0) values[next_index[rank[prev]]++] = prev; } swap(suffix, values); values[suffix[0]] = 0; done = true; for (int i = 1; i < n; i++) { int s = suffix[i], prev = suffix[i - 1]; if (s + len < n && prev + len < n && rank[s] == rank[prev] && rank[s + len] == rank[prev + len]) { values[s] = values[prev]; done = false; } else { values[s] = i; } } swap(rank, values); } compute_lcp(); if (build_rmq) rmq.build(lcp); } void compute_lcp() { lcp.assign(n, 0); int match = 0; for (int i = 0; i < n; i++) { if (rank[i] == 0) continue; int a = suffix[rank[i]] + match; int b = suffix[rank[i] - 1] + match; while (a < n && b < n && str[a++] == str[b++]) match++; lcp[rank[i]] = match; match = max(match - 1, 0); } } int get_lcp_from_ranks(int a, int b) const { if (a == b) return n - suffix[a]; if (a > b) swap(a, b); return rmq.query_value(a + 1, b + 1); } int get_lcp(int a, int b) const { if (a >= n || b >= n) return 0; if (a == b) return n - a; return get_lcp_from_ranks(rank[a], rank[b]); } int compare(int a, int b, int length = -1) const { if (length < 0) length = n; if (a == b) return 0; int common = get_lcp(a, b); if (common >= length) return 0; if (a + common >= n || b + common >= n) return a + common >= n ? -1 : 1; return str[a + common] < str[b + common] ? -1 : (str[a + common] == str[b + common] ? 0 : 1); } }; string str; suffix_array<string> SA; vector<long long> prefix_sum; int search_index(int start, int end, int i, int character) { int low = start, high = end; while (low < high) { int mid = (low + high) / 2; if (str[SA.suffix[mid] + i] >= character) high = mid; else low = mid + 1; } return low; } long long compute_substring_count(int i, int start, int end) { return prefix_sum[end] - prefix_sum[start] - (long long)i * (end - start); } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); long long K; cin >> str >> K; int N = str.size(); if (K > (long long)N * (N + 1) / 2) { cout << No such line. << n ; return 0; } assert(1 <= K && K <= (long long)N * (N + 1) / 2); SA.build(str); prefix_sum.assign(N + 1, 0); for (int i = 0; i < N; i++) prefix_sum[i + 1] = prefix_sum[i] + N - SA.suffix[i]; int start = 0, end = N; string substring = ; for (int i = 0; i < N; i++) { if (SA.suffix[start] + i == N) start++; int low = start, high = end; while (low < high) { int mid = (low + high) / 2; long long additional = compute_substring_count(i, start, mid); if (additional >= K) high = mid; else low = mid + 1; } assert(low > start); int c = str[SA.suffix[low - 1] + i]; substring += c; int c_start = search_index(start, low, i, c); K -= compute_substring_count(i, start, c_start); start = c_start; end = search_index(low, end, i, c + 1); K -= end - start; if (K <= 0) break; } cout << substring << n ; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e4 + 7; const long long INF = 1e18; const int maxn = 6e5 + 5; int n, m, k; struct edge { int to, cost; edge() {} edge(int to, int cost) : to(to), cost(cost) {} }; vector<edge> G[maxn]; int d[maxn]; pair<int, int> p[maxn]; map<pair<int, int>, int> mp; int dx[4] = {0, 0, 1, -1}; int dy[4] = {1, -1, 0, 0}; void dijkstra(int s) { priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > q; fill(d, d + maxn, 0x7fffffff); d[s] = 0; q.push(pair<int, int>(0, s)); while (!q.empty()) { pair<int, int> p = q.top(); q.pop(); int v = p.second; if (d[v] < p.first) continue; for (int i = 0; i < G[v].size(); i++) { edge e = G[v][i]; if (d[e.to] > d[v] + e.cost) { d[e.to] = d[v] + e.cost; q.push(pair<int, int>(d[e.to], e.to)); } } } } int main() { cin >> n >> m >> k; int dd = 1e4 + 5; mp.clear(); for (int i = 1; i <= k; i++) { int r, c; scanf( %d%d , &r, &c); G[i].push_back(edge(r + dd, 1)); G[i].push_back(edge(c + dd * 2, 1)); G[i].push_back(edge(r + 1 + dd, 1)); G[i].push_back(edge(r - 1 + dd, 1)); G[i].push_back(edge(c + dd * 2 + 1, 1)); G[i].push_back(edge(c + dd * 2 - 1, 1)); G[r + dd].push_back(edge(i, 0)); G[c + dd * 2].push_back(edge(i, 0)); G[r + 1 + dd].push_back(edge(i, 0)); G[r - 1 + dd].push_back(edge(i, 0)); G[c + dd * 2 + 1].push_back(edge(i, 0)); G[c + dd * 2 - 1].push_back(edge(i, 0)); p[i] = pair<int, int>(r, c); mp[pair<int, int>(r, c)] = i; } for (int i = 1; i <= k; i++) { for (int j = 0; j < 4; j++) { int x = p[i].first + dx[j]; int y = p[i].second + dy[j]; if (mp.find(pair<int, int>(x, y)) != mp.end()) G[i].push_back(edge(mp[pair<int, int>(x, y)], 0)); } } if (mp.find(pair<int, int>(n, m)) == mp.end()) { G[n + dd].push_back(edge(k + 1, 0)); G[m + 2 * dd].push_back(edge(k + 1, 0)); } int ans; dijkstra(mp[pair<int, int>(1, 1)]); if (mp.find(pair<int, int>(n, m)) == mp.end()) { ans = d[k + 1]; } else ans = d[mp[pair<int, int>(n, m)]]; if (ans == 0x7fffffff) ans = -1; cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a, b, c; int f1, f2, s1, s2, t1, t2; cin >> f1 >> f2 >> s1 >> s2 >> t1 >> t2; int sum1 = f1 + s1 + t1; a = f1; b = s1; c = t1; n -= sum1; if (n > 0) { f2 = f2 - f1; if (f2 < n) { a += f2; s2 = s2 - s1; n -= f2; if (s2 < n) { b += s2; t2 = t2 - t1; n -= s2; if (t2 < n) c += t2; else c += n; } else b += n; } else a += n; } cout << a << << b << << c << endl; } |
#include <bits/stdc++.h> using namespace std; int a[105]; int main() { int n, c, max = 0, t; scanf( %d%d , &n, &c); for (int i = 0; i < n; i++) scanf( %d , &a[i]); for (int i = 0; i < n - 1; i++) { t = a[i] - c; if (t < 0) continue; else { t -= a[i + 1]; if (t > max) max = t; } } printf( %d n , max); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 1e5 + 10; int main() { int a, b, c; while (cin >> a >> b >> c) { int s[MAX] = {0}; s[a]++; s[b]++; s[c]++; if (s[1] >= 1 || s[2] >= 2 || s[3] >= 3 || (s[2] == 1 && s[4] == 2)) printf( YES n ); else printf( NO n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000000; const int MAX = 100005; const int RIGHT = 131072; const int SIZE = 263000; double L[MAX], R[MAX], T[SIZE]; int X[MAX], H[MAX], N, M; pair<int, int> Mush[MAX]; void update(int l, int r, double p, int n, int a, int b) { if (a > r || b < l) return; if (a >= l && b <= r) { T[n] *= p; return; } int mid = (a + b) / 2; update(l, r, p, 2 * n, a, mid); update(l, r, p, 2 * n + 1, mid + 1, b); } double query(int x, int n, int a, int b) { if (a > x || b < x) return 1.0; if (a == b) return T[n]; int mid = (a + b) / 2; return T[n] * query(x, 2 * n, a, mid) * query(x, 2 * n + 1, mid + 1, b); } int main() { scanf( %d%d , &N, &M); for (int i = (1); i <= (N); i++) scanf( %d%d%lf%lf , &X[i], &H[i], &L[i], &R[i]); for (int i = (1); i <= (N); i++) L[i] /= 100.0, R[i] /= 100.0; for (int i = (1); i <= (M); i++) scanf( %d%d , &Mush[i].first, &Mush[i].second); sort(Mush + 1, Mush + 1 + M); for (int i = (1); i <= (SIZE - 1); i++) T[i] = 1.0; for (int i = (1); i <= (N); i++) { int a, b; a = lower_bound(Mush + 1, Mush + M + 1, make_pair(X[i] - H[i], 0)) - Mush; b = lower_bound(Mush + 1, Mush + M + 1, make_pair(X[i], 0)) - Mush - 1; update(a, b, 1.0 - L[i], 1, 1, RIGHT); a = upper_bound(Mush + 1, Mush + M + 1, make_pair(X[i], 1000000005)) - Mush; b = upper_bound(Mush + 1, Mush + M + 1, make_pair(X[i] + H[i], 1000000005)) - Mush - 1; update(a, b, 1.0 - R[i], 1, 1, RIGHT); } double ans = 0; for (int i = (1); i <= (M); i++) ans += query(i, 1, 1, RIGHT) * Mush[i].second; cout << setprecision(15) << fixed << ans; } |
#include <bits/stdc++.h> using namespace std; const int N = (int)1e5 + 5, mod = (int)0; int best[N], q[N]; int main() { string s; cin >> s; int n = (int)s.size(); best[n] = 1e9; for (int j = n - 1; j >= 0; --j) { s[j] -= a ; best[j] = min(best[j + 1], (int)s[j]); } string res = ; int t = 0; for (int j = 0; j < n; ++j) { q[t++] = s[j]; while (t > 0 && q[t - 1] <= best[j + 1]) res += char(q[t - 1] + a ), --t; } cout << res << endl; } |
#include <bits/stdc++.h> using namespace std; string nb; int main() { int N; cin >> N; cin >> nb; string m; m.append(N, 9 ); string act = nb; for (int shift = 0; shift < N; shift++) { for (int p = 0; p <= 9; p++) { m = min(m, act); for (int i = 0; i < N; i++) act[i] = ((act[i] - 0 + 1) % 10 + 0 ); } char first = act[0]; for (int i = 1; i < N; i++) act[i - 1] = act[i]; act[N - 1] = first; } cout << m << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, m, l, a[100001], i, t = 0, p, d, k, w; cin >> n >> m >> l; for (i = 0; i < n; i++) cin >> a[i]; if (a[0] > l) t++; for (i = 1; i < n; i++) { if (a[i] > l && a[i - 1] <= l) t++; } for (i = 0; i < m; i++) { cin >> k; if (k == 0) { cout << t << endl; } else { cin >> p >> d; w = a[p - 1]; a[p - 1] += d; if (p == 1) { if (a[p] <= l && a[p - 1] > l && w <= l) t++; } else if (p == n) { if (a[p - 2] <= l && a[p - 1] > l && w <= l) t++; } else { if (a[p - 1] > l && a[p - 2] <= l && a[p] <= l && w <= l) t++; else if (a[p - 1] > l && a[p - 2] > l && a[p] > l && w <= l) t--; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string b, b1, b2, e1, e2, e; cin >> b1 >> b2 >> e1 >> e2; swap(b2[0], b2[1]); swap(e2[0], e2[1]); b = b1 + b2; e = e1 + e2; b.erase(b.find( X ), 1); e.erase(e.find( X ), 1); if ((b + b).find(e) != string::npos) { cout << YES ; } else cout << NO ; return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.