func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; int a[105]; int n, k; char s[105]; int main(void) { int i, j, x, y, z; scanf( %d %d , &n, &k); scanf( %s , s); x = 0; for (i = 0; i < s[i]; i++) { a[x++] = s[i] - a + 1; } sort(a, a + n); x = 1; y = a[0]; z = 0; if (x == k) { printf( %d n , y); return 0; } for (i = 1; i < n; i++) { if (a[i] - a[z] > 1) { x++; y += a[i]; z = i; if (x == k) break; } } if (i >= n) { printf( -1 ); return 0; } printf( %d n , y); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m, k = 0, k1 = 0, kol1 = 0, kol2 = 0; cin >> n >> m; int a[n + 10], b[m + 10]; for (int i = 1; i <= n; i++) { cin >> a[i]; if (a[i] % 2 == 1) k++; else k1++; } for (int i = 1; i <= m; i++) { cin >> b[i]; if (b[i] % 2 == 1) kol1++; else kol2++; } cout << min(k, kol2) + min(k1, kol1); } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, a, b, x, y, flag = 0; cin >> n >> a >> x >> b >> y; int in = 0; for (int i = 0; i < n; i++) { a = a % n + 1; b = b - 1; if (b == 0) b = n; if (a == b) { cout << YES ; flag = 1; break; } if (a == x or b == y) break; } if (flag == 0) cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; int a[301]; int l[301], r[301]; void INPUT() { cin >> n >> m; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= m; i++) cin >> l[i] >> r[i]; } void SOLVE() { int res = 0; int ans[301], tam[301]; int sl = 0; int i, j, k; for (i = 1; i <= n; i++) for (j = 1; j <= n; j++) if (i == j) continue; else { int dem = 0; for (k = 1; k <= m; k++) if (l[k] <= j & j <= r[k] & (l[k] > i || r[k] < i)) { dem++; tam[dem] = k; } if (res < a[i] - a[j] + dem) { res = a[i] - a[j] + dem; sl = dem; for (k = 1; k <= sl; k++) ans[k] = tam[k]; } } cout << res << endl; cout << sl << endl; for (i = 1; i <= sl; i++) cout << ans[i] << ; } int main() { INPUT(); SOLVE(); } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 500010; bool f[MAXN]; int main() { int n, d; scanf( %d %d , &n, &d); f[0] = 1; for (int i = 0; i < n; i++) { int x; scanf( %d , &x); for (int j = MAXN - 1 - x; j >= 0; --j) f[j + x] |= f[j]; } int r = 1, sum = 0, ans = 0; while (r < MAXN) { int next = -1; while (r <= sum + d && r < MAXN) { if (f[r]) next = r; r++; } if (next == -1) break; sum = next; ans++; } printf( %d %d n , sum, ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 1e6 + 7; long long a[N]; long long l[N]; long long r[N]; int32_t main() { long long ans = 0, n, i; for (i = 1, scanf( %I64d , &n); i <= n; scanf( %I64d , &a[i++])) ; for (i = 1; i <= n; l[i] = r[i] = i, i++) ; for (i = 2; i <= n; i++) { long long num = i; while (num > 1 && a[num - 1] <= a[i]) num = l[num - 1]; l[i] = num; } for (i = n - 1; i >= 1; i--) { long long num = i; while (num < n && a[num + 1] < a[i]) num = r[num + 1]; r[i] = num; } for (i = 1; i <= n; ans += (i - l[i] + 1) * (r[i] - i + 1) * a[i], i++) ; for (i = 1; i <= n; l[i] = r[i] = i, i++) ; for (i = 2; i <= n; i++) { long long num = i; while (num > 1 && a[num - 1] >= a[i]) num = l[num - 1]; l[i] = num; } for (i = n - 1; i >= 1; i--) { long long num = i; while (num < n && a[num + 1] > a[i]) num = r[num + 1]; r[i] = num; } for (i = 1; i <= n; i++) { ans -= (i - l[i] + 1) * (r[i] - i + 1) * a[i]; } printf( %I64d n , ans); } |
#include <bits/stdc++.h> using namespace std; const int mod = 998244353, inv2 = (mod + 1) / 2; const int N = (1 << 24); int n, m, X, Y, Z, mu, v1, v2, v3, v4, inv; vector<int> a, b, c, ans; inline int add(const int &x, const int &y) { return x + y < mod ? x + y : x + y - mod; } inline int sub(const int &x, const int &y) { return x - y < 0 ? x - y + mod : x - y; } inline int mul(const int &x, const int &y) { return (int)((long long)x * y % mod); } int ksm(int x, int y = mod - 2) { int ss = 1; for (; y; y >>= 1, x = mul(x, x)) if (y & 1) ss = mul(ss, x); return ss; } void fwt(vector<int> &A, int lmt, int opt) { A.resize(lmt); for (int mid = 1; mid < lmt; mid <<= 1) for (int j = 0; j < lmt; j += mid << 1) for (int k = 0; k < mid; k++) { int x = A[j + k], y = A[j + mid + k]; A[j + k] = add(x, y), A[j + mid + k] = sub(x, y); if (opt == -1) { A[j + k] = mul(A[j + k], inv2); A[j + mid + k] = mul(A[j + mid + k], inv2); } } } int main() { scanf( %d%d , &n, &m), m = 1 << m, inv = ksm(4); a.resize(m), b.resize(m), c.resize(m), ans.resize(m); scanf( %d%d%d , &X, &Y, &Z); for (int i = 1, x, y, z; i <= n; i++) { scanf( %d%d%d , &x, &y, &z), mu ^= x; ++a[x ^ y], ++b[x ^ z], ++c[y ^ z]; } fwt(a, m, 1), fwt(b, m, 1), fwt(c, m, 1); v1 = add(X, add(Y, Z)), v2 = add(X, sub(Y, Z)); v3 = add(X, sub(Z, Y)), v4 = sub(X, add(Z, Y)); for (int i = 0; i < m; i++) { int x1 = ksm( v1, ((long long)n + a[i] + b[i] + c[i] + 4ll * mod) % mod * inv % mod); int x2 = ksm( v2, ((long long)n + a[i] - b[i] - c[i] + 4ll * mod) % mod * inv % mod); int x3 = ksm( v3, ((long long)n - a[i] + b[i] - c[i] + 4ll * mod) % mod * inv % mod); int x4 = ksm( v4, ((long long)n - a[i] - b[i] + c[i] + 4ll * mod) % mod * inv % mod); ans[i] = mul(x1, mul(x2, mul(x3, x4))); } fwt(ans, m, -1); for (int i = 0; i < m; i++) printf( %d , ans[i ^ mu]); return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, m, k; int fans = 1; long long getnum(long long x) { long long fx, fy; if (x >= (n - k + 1)) { fx = (n - k + 1 + 1) * (n - k + 1) / 2 + (x - (n - k + 1)) * (n - k + 1); } else { fx = (x - 1 + 1) * (x - 1) / 2 + (n - k + 1); } if (x >= k) { fy = (k + 1) * k / 2 + (x - k) * k; } else { fy = (x - 1 + 1) * (x - 1) / 2 + k; } return fx + fy - x; } void start(int l, int r) { if ((l + r) / 2 == l) { if (getnum((l + r) / 2) <= m) fans = (l + r) / 2; return; } int mid = (l + r) / 2; if (getnum(mid) <= m) { fans = max(fans, mid); start(mid + 1, r); } else start(l, mid); } int main() { cin >> n >> m >> k; start(1, m); cout << fans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; int main() { char ch[106][106]; scanf( %d%d , &n, &m); for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) cin >> ch[i][j]; for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) if (ch[i][j] == C || ch[i][j] == M || ch[i][j] == Y ) { printf( #Color n ); return 0; } printf( #Black&White n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; int cnt[2][2]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m; for (int i = 1; i <= n; i++) { int x; cin >> x; cnt[0][x % 2]++; } for (int i = 1; i <= m; i++) { int x; cin >> x; cnt[1][x % 2]++; } cout << min(cnt[0][0], cnt[1][1]) + min(cnt[0][1], cnt[1][0]) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; long long ans = 0; for (int i = (0); i < (n); ++i) { long long t, T, x, cost; cin >> t >> T >> x >> cost; if (t >= T) { ans += cost + m * x; continue; } long long aux1 = cost; if (m > (T - t)) aux1 += m * x; long long aux2 = (long long)ceil((double)(m - (T - t)) / (T - t)) + 1; aux2 *= cost; ans += min(aux1, aux2); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1000 + 10; int ans[maxn]; bool build(int l, int r, int base, int top, int sum) { if (l > r) return true; int len = r - l + 1; int tmp = len * base; if (tmp > sum) return false; if (tmp == sum) { for (int i = l; i <= r; ++i) ans[i] = base; return true; } if (base == top) return false; if (tmp + len >= sum) { for (int i = l; i <= r; ++i) { sum -= base; ans[i] = base; } for (int i = l; i <= r; ++i) { if (!sum) break; sum--; ans[i]++; } return true; } return false; } int main() { int n, k, l, r, sall, sk; scanf( %d%d%d%d%d%d , &n, &k, &l, &r, &sall, &sk); int lim; for (int i = r; i >= l; --i) { if (build(1, k, i, r, sk)) { lim = i; break; } } for (int i = lim; i >= l; --i) { if (build(k + 1, n, i, lim, sall - sk)) { break; } } for (int i = 1; i <= n; ++i) printf( %d , ans[i]); puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int INF = 2000000000000000000; long long int MOD(long long int a, long long int b) { if (a > b) return a - b; else return b - a; } long long int max3(long long int a, long long int b, long long int c) { return max(c, max(a, b)); } long long int min3(long long int a, long long int b, long long int c) { return min(a, min(b, c)); } long long int power(long long int x, long long int y) { long long int res = 1; while (y > 0) { if (y & 1) res = (res * x) % 1000000007; y = y >> 1; x = (x * x) % 1000000007; } return res; } long long int logg(long long int a) { long long int x = 0; while (a > 1) { x++; a /= 2; } return x; } long long int gcd(long long int a, long long int b) { if (a == 0) return b; return gcd(b % a, a); } int main() { int n, m; cin >> n >> m; vector<string> grid; grid.resize(n); for (int i = 0; i < n; i++) { cin >> grid[i]; } vector<int> columns; columns.resize(n, 0); vector<int> rows; rows.resize(m, 0); for (int i = 0; i < n; i++) { vector<int> cnt; for (int j = 0; j < m; j++) { if (grid[i][j] == # ) { cnt.push_back(j); } } if (!cnt.empty()) { vector<int> b; for (int j = 0; j < n; j++) { if (grid[j][cnt[0]] == # ) { b.push_back(j); } } sort(b.begin(), b.end()); sort(cnt.begin(), cnt.end()); for (int j = 0; j < cnt.size(); j++) { int num = 0; for (int i = 0; i < n; i++) { if (grid[i][cnt[j]] == # && binary_search(b.begin(), b.end(), i) == false) { cout << NO ; return 0; } else { if (grid[i][cnt[j]] == # ) { num++; } } } if (num != b.size()) { cout << NO ; return 0; } } for (int i = 0; i < b.size(); i++) { int num = 0; for (int j = 0; j < m; j++) { if (grid[b[i]][j] == # && binary_search(cnt.begin(), cnt.end(), j) == false) { cout << NO ; return 0; } else { if (grid[b[i]][j] == # ) { num++; } } } if (num != cnt.size()) { cout << NO ; return 0; } } } } cout << YES ; return 0; } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; const long long mod = 1e9 + 7; const int inf = 1 << 30; const int maxn = 900500; const double EPS = 1e-7; struct da { int x, ty; double p; bool operator<(const da& ot) const { return (make_pair(x, make_pair(ty, p)) < make_pair(ot.x, make_pair(ot.ty, ot.p))); } }; vector<da> ev; void solve() { int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < (int)(n); ++i) { int ai, hi, li, ri; scanf( %d%d , &ai, &hi); scanf( %d%d , &li, &ri); double lp = 1.0 - li / 100., rp = 1.0 - ri / 100.; ev.push_back({ai - hi, -1, lp}); ev.push_back({ai - 1, 1, lp}); ev.push_back({ai + 1, -1, rp}); ev.push_back({ai + hi, 1, rp}); } for (int i = 0; i < (int)(m); ++i) { int bj, zj; scanf( %d%d , &bj, &zj); ev.push_back({bj, 0, 1. * zj}); } sort(ev.begin(), ev.end()); int ze = 0; double pr = 0, ret = 0; for (auto e : ev) { if (e.ty == 0) { if (!ze) ret += exp(pr) * e.p; } else if (e.ty == -1) { if (abs(e.p) < 1e-7) ++ze; else pr += log(e.p); } else { if (abs(e.p) < 1e-7) --ze; else pr -= log(e.p); } } printf( %lf n , ret); } int main() { int tc = 1; for (int tt = 0; tt < (int)(tc); ++tt) { solve(); } } |
#include <bits/stdc++.h> using namespace std; int main(int argc, char *argv[]) { int t; cin >> t; while (t--) { int len; cin >> len; string s1, s2; cin >> s1 >> s2; int cnt1 = 0, cnt2 = 0; if (s1[0] > 2 ) { cnt1++; if (s2[0] <= 2 ) { puts( NO ); continue; } cnt2++; } bool flag = true; for (int i = 1; i < s1.size(); ++i) { if (cnt1 % 2) { if (s2[i] > 2 ) { cnt2++; if (s1[i] <= 2 ) { flag = false; break; } cnt1++; } } else { if (s1[i] > 2 ) { cnt1++; if (s2[i] <= 2 ) { flag = false; break; } cnt2++; } } } if (cnt2 % 2 == 0) flag = false; if (flag) { puts( YES ); } else { puts( NO ); } } } |
#include <bits/stdc++.h> using namespace std; mt19937 rnd(time(0)); const long long N = 3e5 + 7; const long long MOD = 1e9 + 7; long long pw(long long b, long long p) { b %= MOD; long long res = 1; while (p > 0) { if (p & 1) res = res * b % MOD; b = b * b % MOD; p >>= 1; } return res; } long long n, m, cur; vector<vector<pair<long long, char>>> g(107); bool vis[107][107][26], dp[107][107][26]; bool dfs(long long u, long long v, char ch) { if (vis[u][v][ch - a ]) return dp[u][v][ch - a ]; for (auto i : g[u]) { if (i.second >= ch && !dfs(v, i.first, i.second)) dp[u][v][ch - a ] = 1; } vis[u][v][ch - a ] = 1; return dp[u][v][ch - a ]; } int32_t main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> m; long long u, v; char ch; for (long long i = 1; i < m + 1; i++) { cin >> u >> v >> ch; g[u].emplace_back(v, ch); } for (long long i = 1; i < n + 1; i++) { for (long long j = 1; j < n + 1; j++) { if (dfs(i, j, a )) cout << A ; else cout << B ; } cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> struct number_iterator : iterator<random_access_iterator_tag, T> { T v; number_iterator(T _v) : v(_v) {} operator T &() { return v; } T operator*() const { return v; } }; template <typename T> struct number_range { T b, e; number_range(T b, T e) : b(b), e(e) {} number_iterator<T> begin() { return b; } number_iterator<T> end() { return e; } }; template <typename T> number_range<T> range(T e) { return number_range<T>(0, e); } template <typename T> number_range<T> range(T b, T e) { return number_range<T>(b, e); } template <typename... Args> void logger(string vars, Args &&...values) { cout << [ << vars << ] << = ; string delim = ; cout << [ << (..., (cout << delim << values, delim = , )) << ] << n ; } template <typename T> void debug(vector<T> v) { cout << { ; for (auto i : range(v.size())) cout << v[i] << (i + 1 == v.size() ? : , ); cout << } << n ; } template <typename T, typename S> void debug(pair<T, S> &p) { cout << ( ; cout << p.first << , << p.second; cout << ) ; } template <typename T, typename S> void debug(vector<pair<T, S>> vp) { cout << { ; for (auto i : range(vp.size())) { debug(vp[i]); cout << (i + 1 == vp.size() ? : , ); } cout << } << n ; } template <typename T> void debug(vector<vector<T>> vv) { cout << [ ; for (auto i : range(vv.size())) debug(vv[i]); cout << ] << n ; } template <typename T> void debug(T a[], long long n) { cout << { ; for (auto i : range(n)) cout << a[i] << (i + 1 == n ? : , ); cout << } << n ; } template <typename T> void debug(set<T> s) { cout << { ; for (auto i = s.begin(); i != s.end();) cout << *i << (++i == s.end() ? : , ); cout << } << n ; } template <typename T> void debug(multiset<T> s) { cout << { ; for (auto i = s.begin(); i != s.end();) cout << *i << (++i == s.end() ? : , ); cout << } << n ; } template <typename T1, typename T2> void debug(map<T1, T2> make_pair) { cout << { ; for (auto i = make_pair.begin(); i != make_pair.end();) cout << ( << i->first << : << i->second << ) << (++i == make_pair.end() ? : , ); cout << } << n ; } long long modExpo(long long a, long long b, long long m = 1000000007) { long long res = 1; while (b > 0) { if (b & 1) res = (res * a) % m; a = (a * a) % m; b = b >> 1; } return res; } void extendEuclids(long long a, long long b, long long *v) { if (b == 0) { v[0] = 1, v[1] = 0, v[2] = a; return; } extendEuclids(b, a % b, v); long long x = v[1]; v[1] = v[0] - v[1] * (a / b); v[0] = x; return; } long long modInv(long long a, long long b) { long long arr[3]; extendEuclids(a, b, arr); return arr[0]; } long long modInv_lil(long long a, long long b) { return modExpo(a, b - 2, b); } long long add(long long a, long long b, long long c = 1000000007) { long long res = a + b; return (res >= c ? res - c : res); } long long mod_mul(long long a, long long b, long long c = 1000000007) { long long res = a * b; return (res >= c ? res % c : res); } long long mod_sub(long long a, long long b, long long m = 1000000007) { a = a % m; b = b % m; return (((a - b) % m) + m) % m; } long long mod_div(long long a, long long b, long long m = 1000000007) { a = a % m; b = b % m; return (mod_mul(a, modInv_lil(b, m), m) + m) % m; } class Solution { public: void Solve() { string t, s; cin >> t >> s; deque<char> a, b; sort((t).begin(), (t).end()); sort((s).begin(), (s).end(), greater<long long>()); long long n = t.length(), i = 0, j = 0, cnt1, cnt2; string ansr, ansl; cnt1 = ceil((double)n / (double)2); cnt2 = n / 2; for (auto i : range(cnt1)) a.push_back(t[i]); for (auto i : range(cnt2)) b.push_back(s[i]); while (i < n) { if (i & 1) { if (!a.empty() && a[0] >= b[0]) { ansr += b.back(); b.pop_back(); } else { ansl += b[0]; b.pop_front(); } } else { if (!b.empty() && a[0] >= b[0]) { ansr += a.back(); a.pop_back(); } else { ansl += a[0]; a.pop_front(); } } i += 1; } reverse((ansr).begin(), (ansr).end()); cout << ansl + ansr; } }; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); Solution ob; { ob.Solve(); } return 0; } template <typename T> inline T Max(const T a, const T b) { return a < b ? b : a; } template <typename T, typename... Args> T Max(const T a, const Args... args) { return Max(a, Max(args...)); } template <typename T> inline T Min(const T a, const T b) { return a < b ? a : b; } template <typename T, typename... Args> T Min(const T a, const Args... args) { return Min(a, Min(args...)); } template <typename T> inline T LCM(const T a, const T b) { return ((a) * (b)) / __gcd((a), (b)); } template <typename T, typename... Args> T LCM(const T a, const Args... args) { return LCM(a, LCM(args...)); } |
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr); int k; cin >> k; int n = 2000; k += n; int arr[n]; arr[0] = -1; for (int i = 1; i < 2000; i++) { if (k >= 1000000) arr[i] = 1000000; else arr[i] = k; k -= arr[i]; } cout << 2000 << n ; for (int i = 0; i < 2000; i++) cout << arr[i] << ; } |
#include <bits/stdc++.h> int ___read_tmp; using namespace std; int fwt[1010000]; int query(int sz) { int sum = 0; sz++; while (sz > 0) { sum += fwt[sz]; sz -= sz & (-sz); } return sum; } void upd(int id, int add) { id++; for (; id < 1010000; id += (id & (-id))) { fwt[id] += add; } } int range(int from, int to) { if (to < from) return 0; int tmp = query(to); if (from > 0) tmp -= query(from - 1); return tmp; } int main() { int n, k; scanf( %d %d , &n, &k); k = min(k, n - k); unsigned long long res = 1; int curr = 0; for (int i = (0); i < (n); i++) { if (curr + k <= n) { res += range(curr + 1, curr + k - 1) + 1; } else { res += range(curr + 1, n - 1) + range(0, (curr + k) % n - 1) + 1; } printf( %I64d , res); upd(curr, 1); curr = (curr + k) % n; upd(curr, 1); } return 0; } |
#include <bits/stdc++.h> long long mod = 1000000007; using namespace std; int n; int b1[200005]; struct node { int x, y; }; bool cmp(node a, node b) { return a.y - a.x > b.y - b.x; } node a1[200005]; long long powmod(long long a, long long b) { long long res = 1; a %= mod; for (; b; b >>= 1) { if (b & 1) res = res * a % mod; a = a * a % mod; } return res; } int main() { int i, j, fl, test, k; scanf( %d%d , &n, &k); for (i = 0; i < n; i++) { scanf( %d , &a1[i].x); } for (i = 0; i < n; i++) { scanf( %d , &a1[i].y); } long long ans = 0; sort(a1, a1 + n, cmp); for (i = 0; i < n; i++) { if (k) { ans += a1[i].x; k--; } else ans += min(a1[i].x, a1[i].y); } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int f[100010], r[2][100010]; vector<int> mat[2][100010]; void DFS(int a, int x) { r[x][a] = 1; if (x == 1 && f[a] == 1) return; for (int i = 0; i < mat[x][a].size(); i++) { int b = mat[x][a][i]; if (!r[x][b]) DFS(b, x); } } int main() { int n, m, a, b; cin >> n >> m; for (int i = 0; i < n; i++) cin >> f[i]; for (int i = 0; i < m; i++) { cin >> a >> b; a--; b--; mat[0][a].push_back(b); mat[1][b].push_back(a); } for (int i = 0; i < n; i++) if (!r[0][i] && f[i] == 1 && mat[0][i].size()) DFS(i, f[i] - 1); else if (!r[1][i] && f[i] == 2) DFS(i, f[i] - 1); for (int i = 0; i < n; i++) if (r[0][i] && r[1][i]) cout << 1 << ; else cout << 0 << ; cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long good[3000]; long long fact[20]; int q = 0; void gen(long long sum, int left) { if (!left) { good[q++] = sum; } else { if (!sum) { gen(sum, left - 1); } gen(sum * 10 + 4, left - 1); gen(sum * 10 + 7, left - 1); } } bool is_lucky(int v) { while (v) { if (v % 10 != 4 && v % 10 != 7) { return false; } v /= 10; } return true; } void true_main() { gen(0, 10); vector<int> per(20); vector<bool> fre(20); int n; long long k; fact[0] = 1; for (int i = 1; i < 20; i++) { fact[i] = fact[i - 1] * i; } cin >> n >> k; if (n < 15) { if (k > fact[n]) { puts( -1 ); return; } } int ans = 0; for (int i = 1; i < q; i++) { if (good[i] <= n - 15) { ans++; } } int m = min(n, 15); k--; for (int i = 0; i < m; i++) { long long q = k / fact[m - i - 1]; k -= q * fact[m - i - 1]; for (int j = 0;; j++) { if (!fre[j]) { if (!q) { fre[j] = true; per[i] = j; break; } q--; } } } for (int i = 0; i < m; i++) { if (is_lucky(n - m + per[i] + 1) && is_lucky(n - m + i + 1)) { ans++; } } cout << ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t = 1; while (t--) { true_main(); cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { long long int n; cin >> n; long long int ans = 0; long long int t = 1; long long int x = 2; while (n - (t * (t + 1) / 2) >= 0) { long long int val = t * (t + 1) / 2; n -= val; t += x; x *= 2; ans++; } cout << ans << endl; } int main() { int t; cin >> t; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5, M = 1e5 + 5, P = 105; int n, m, p; long long d[N]; int h[M], t[M]; long long a[M], s[M]; long long f[P][M]; int q[M]; long long Y(int j, int k) { return f[j - 1][k] + s[k]; } int32_t main() { cin >> n >> m >> p; for (int i = 2; i <= n; ++i) { cin >> d[i]; d[i] += d[i - 1]; } for (int i = 1; i <= m; ++i) { cin >> h[i] >> t[i]; a[i] = t[i] - d[h[i]]; } sort(a + 1, a + 1 + m); for (int i = 1; i <= m; ++i) s[i] = s[i - 1] + a[i]; memset(f[0], 0x3f, sizeof f[0]); f[0][0] = 0; for (int j = 1; j <= p; ++j) { int hh = 0, tt = 0; q[0] = 0; for (int i = 1; i <= m; ++i) { while (hh < tt && (Y(j, q[hh + 1]) - Y(j, q[hh])) <= a[i] * (q[hh + 1] - q[hh])) hh++; int k = q[hh]; f[j][i] = f[j - 1][k] + a[i] * (i - k) - (s[i] - s[k]); while (hh < tt && (Y(j, q[tt]) - Y(j, q[tt - 1])) * (i - q[tt]) >= (Y(j, i) - Y(j, q[tt])) * (q[tt] - q[tt - 1])) tt--; q[++tt] = i; } } cout << f[p][m] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, x, count[8] = {0}; cin >> n; for (int i = 0; i < n; i++) { cin >> x; count[x] = count[x] + 1; } if ((count[5] == 0) && (count[7] == 0) && (count[2] >= count[4]) && (count[1] == count[4] + count[6]) && (count[2] + count[3] == count[4] + count[6])) { for (int i = 0; i < count[4]; i++) { cout << 1 2 4 << endl; } count[2] -= count[4]; for (int i = 0; i < count[2]; i++) { cout << 1 2 6 << endl; } for (int i = 0; i < count[3]; i++) { cout << 1 3 6 << endl; } } else { cout << -1 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int grid[n][n]; int nro = 1; for (int i = 0; i < n; i++) { if (!(i & 1)) for (int j = 0; j < n; j++) grid[j][i] = nro++; else for (int j = 0; j < n; j++) grid[n - 1 - j][i] = nro++; } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) cout << grid[i][j] << ; cout << endl; } } |
#include <bits/stdc++.h> using namespace std; inline long long mod(long long n, long long m) { long long ret = n % m; if (ret < 0) ret += m; return ret; } long long gcd(long long a, long long b) { return (b == 0LL ? a : gcd(b, a % b)); } long long exp(long long a, long long b, long long m) { if (b == 0LL) return 1LL; if (b == 1LL) return mod(a, m); long long k = mod(exp(a, b / 2, m), m); if (b & 1LL) { return mod(a * mod(k * k, m), m); } else return mod(k * k, m); } vector<int> z_function(string s) { int n = s.size(); vector<int> z(n); int L = 0, R = 0; for (int i = 1; i < n; i++) { if (i <= R) { if (i - L + z[i - L] > i - L + (R - i)) { z[i] = R - i + 1; while (i + z[i] < n and s[z[i]] == s[z[i] + i]) { z[i]++; } } else z[i] = z[i - L]; } else { while (i + z[i] < n and s[z[i]] == s[z[i] + i]) { z[i]++; } } if (i + z[i] - 1 > R) { L = i, R = i + z[i] - 1; } } return z; } const int N = 1000100; int n, m, k; vector<int> order[N]; vector<int> get(string s, string t) { string aux = t + # + s; vector<int> z = z_function(aux); for (int i = 0; i < N; i++) order[i].clear(); for (int i = 0; i < n; i++) { if (z[i + m + 1] > 0) order[z[i + m + 1]].push_back(i); } set<int> best; vector<int> res((int)s.size() + 10, -1); for (int x = m; x > 0; x--) { for (int id : order[x]) { best.insert(id); } auto it = best.lower_bound(k - x); if (it == best.end()) continue; res[x] = *it; } return res; } vector<int> lpos, rpos; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; cin >> n >> m >> k; string s, t; cin >> s >> t; string aux = t + # + s; vector<int> z = z_function(aux); for (int i = 0; i < n; i++) { if (z[i + 1 + m] >= m) { cout << Yes << n ; int l = min(i + 1, n - 2 * k + 1); int r = l + k; cout << l << << r << n ; return 0; } } lpos = get(s, t); reverse(s.begin(), s.end()); reverse(t.begin(), t.end()); rpos = get(s, t); for (int i = 1; i <= min(m - 1, k); i++) { if (m - i > k) continue; int id1 = lpos[i], id2 = rpos[m - i]; if (id1 == -1 or id2 == -1) continue; int L = lpos[i] + i - 1, R = rpos[m - i] + (m - i) - 1; if (L + R >= n - 1) continue; id1 = lpos[i] + i - (k - 1); id2 = n - rpos[m - i] - (m - i) + 1; if (id1 + k - 1 < id2 and id2 + k - 1 <= n) { cout << Yes << n ; cout << id1 << << id2 << n ; return 0; } } cout << No << n ; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e3; const double eps = 1e-8; int n; struct point { double x, y, z; } p[maxn], pp; double dis(point a, point b) { return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y) + (a.z - b.z) * (a.z - b.z); } double get(double x, double y, double z) { double res = 0; for (int i = 1; i <= n; i++) res = max(res, dis(point{x, y, z}, p[i])); return res; } double findz(double x, double y) { double l = -1e4, r = 1e4; while (r - l > eps) { double m1 = (l + l + r) / 3; double m2 = (l + r + r) / 3; if (get(x, y, m1) < get(x, y, m2)) r = m2; else l = m1; } pp.z = (l + r) / 2; return get(x, y, (l + r) / 2); } double findy(double x) { double l = -1e4, r = 1e4; while (r - l > eps) { double m1 = (l + l + r) / 3; double m2 = (l + r + r) / 3; if (findz(x, m1) < findz(x, m2)) r = m2; else l = m1; } pp.y = (l + r) / 2; return findz(x, (l + r) / 2); } double findx() { double l = -1e4, r = 1e4; while (r - l > eps) { double m1 = (l + l + r) / 3; double m2 = (l + r + r) / 3; if (findy(m1) < findy(m2)) r = m2; else l = m1; } pp.x = (l + r) / 2; return findy((l + r) / 2); } int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %lf%lf%lf , &p[i].x, &p[i].y, &p[i].z); findx(); printf( %.9lf %.9lf %.9lf n , pp.x, pp.y, pp.z); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long M = 1e9, I = 1e18; const int mxn = 1e5; int t, n; string s, pr, ans; bool fl; void solve() { fl = 0; ans = ; cin >> n; cin >> pr; ans = pr; for (int i = 1; i < n - 2; i++) { cin >> s; if (pr[1] != s[0]) { fl = 1; ans += s[0]; } ans += s[1]; pr = s; } if (!fl) ans = a + ans; cout << ans << endl; } int main() { cin >> t; while (t--) solve(); } |
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:64000000 ) template <class T> inline T sqr(T x) { return x * x; } int n, k; int a[1 << 17]; map<int, int> d; set<pair<int, int> > s; int main() { scanf( %d%d , &n, &k); for (int i = 0; i < n; ++i) scanf( %d , &a[i]); for (int i = 0; i < k; ++i) ++d[a[i]]; for (int i = 0; i < k; ++i) s.insert(make_pair(d[a[i]], -a[i])); for (int i = 0; i + k - 1 < n; ++i) { if (s.begin()->first == 1) printf( %d n , -s.begin()->second); else puts( Nothing ); if (i + k == n) continue; pair<int, int> cur(d[a[i]], -a[i]); s.erase(cur); if (--d[a[i]] == 0) d.erase(a[i]); else { --cur.first; s.insert(cur); } cur = make_pair(d[a[i + k]], -a[i + k]); s.erase(cur); ++d[a[i + k]]; ++cur.first; s.insert(cur); } return 0; } |
#include <bits/stdc++.h> using namespace std; namespace IO { static char buf[1 << 20], *fs, *ft; inline char gc() { if (fs == ft) { ft = (fs = buf) + fread(buf, 1, 1 << 20, stdin); if (fs == ft) return EOF; } return *fs++; } inline int read() { int x = 0, f = 1; char s = getchar(); while (s < 0 || s > 9 ) { if (s == - ) f = -f; s = getchar(); } while (s >= 0 && s <= 9 ) { x = x * 10 + s - 0 ; s = getchar(); } return x * f; } } // namespace IO using IO::read; map<pair<int, int>, int> pos; const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1}; int p[256]; void move(int n) { static char c; while ((c = getchar()) != U and c != L and c != R and c != D ) ; pos.clear(); pair<int, int> now = make_pair(dx[p[c]], dy[p[c]]); pos[make_pair(0, 0)] = 1, pos[now] = 2; int ans = 1 << 30, ansl = 0, ansr = 0; for (int i = 2; i <= n; i++) { c = getchar(); int rex = now.first + dx[p[c]], rey = now.second + dy[p[c]]; pair<int, int> Next = make_pair(rex, rey); if (pos[Next]) { if (i - pos[Next] + 1 < ans) ans = i - pos[Next] + 1, ansl = pos[Next], ansr = i; } pos[now = Next] = i + 1; } if (ansl and ansr) printf( %d %d n , ansl, ansr); else puts( -1 ); } int main() { p[ U ] = 1, p[ D ] = 3; p[ L ] = 2, p[ R ] = 0; int T = read(); while (T--) move(read()); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 200010; const long long MOD = (int)1e9 + 7; const int INF = 1e9; const long long LLINF = 0x3f3f3f3f3f3f3f3f; const long double EPS = 1e-8; int r, g, h, total; inline int add(int a, int b) { return (a + b) % MOD; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; cin >> r >> g; total = r + g; vector<int> ant(MAX, 0); if (g) ant[r] = 1; if (r) ant[r - 1] = 1; int res = 0; for (int l = 2; true; l++) { vector<int> cur(MAX, 0); bool eita = false; for (int red = 0; red <= r; red++) { long long minus = (l * (l - 1)) / 2 - (r - red); if (minus < 0) continue; int green = g - minus; if (red - l >= 0 and ant[red]) { eita = true; cur[red - l] = add(cur[red - l], ant[red]); } if (green - l >= 0 and ant[red]) { eita = true; cur[red] = add(cur[red], ant[red]); } } if (!eita) break; swap(ant, cur); } for (int red = 0; red <= r; red++) { res = (res + ant[red]) % MOD; } cout << res << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; bool check(int x1, int y1, int r1, int x2, int y2, int r2, int R2) { int l = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2); int rr1 = (r1 - r2) * (r1 - r2); int rr2 = (r1 + r2) * (r1 + r2); int RR1 = (r1 - R2) * (r1 - R2); int RR2 = (r1 + R2) * (r1 + R2); if (l <= rr1 && l <= RR1 && (r1 <= r2 || r1 >= R2)) return 1; if (rr2 <= l && RR2 <= l) return 1; return 0; } int main() { int x1, y1, r1, R1, x2, y2, r2, R2; while (scanf( %d %d %d %d , &x1, &y1, &r1, &R1) != EOF) { scanf( %d %d %d %d , &x2, &y2, &r2, &R2); int ans = 0; if (check(x1, y1, r1, x2, y2, r2, R2)) ans++; if (check(x1, y1, R1, x2, y2, r2, R2)) ans++; if (check(x2, y2, r2, x1, y1, r1, R1)) ans++; if (check(x2, y2, R2, x1, y1, r1, R1)) ans++; printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> int ex[] = {1, -1, 0, 0}; int wye[] = {0, 0, 1, -1}; using namespace std; vector<int> vt[10005]; bool visit[10005]; int n, x, y, an; void dfs(int node) { if (visit[node]) return; visit[node] = true; int siz = vt[node].size(); int tmp; for (int i = 0; i < siz; i++) { tmp = vt[node][i]; if (visit[tmp]) continue; dfs(tmp); } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &x); vt[i].push_back(x); vt[x].push_back(i); } for (int i = 1; i <= n; i++) { if (visit[i]) continue; dfs(i); an++; } printf( %d n , an); return 0; } |
#include <bits/stdc++.h> using namespace std; constexpr long long inf = 1e9 + 7, base = 541; constexpr long long mod = 1e9 + 7, N = 1e6 + 7; struct piii { long long sm = 0, an = 0, cn = 0; }; long long n; long long v[N]; long long sum[4 * N], ans[4 * N]; piii calc(piii x, piii y) { x.an += y.an + (y.sm * x.cn - x.sm * y.cn); x.sm += y.sm; x.cn += y.cn; return x; } inline long long pos(long long l, long long tp) { if (tp == 0) return (lower_bound(v, v + n + 1, l) - v); else return (upper_bound(v, v + n + 1, l) - v); } void build(long long s = 0, long long e = n, long long tag = 1) { if (e - s == 1) { sum[tag] = v[s]; return; } long long mid = (s + e) / 2; build(s, mid, tag * 2 + 0); build(mid, e, tag * 2 + 1); sum[tag] = sum[tag * 2] + sum[tag * 2 + 1]; ans[tag] = ans[tag * 2] + ans[tag * 2 + 1] + (sum[tag * 2 + 1] * (mid - s) - sum[tag * 2] * (e - mid)); } piii query(long long l, long long r, long long tag = 1, long long s = 0, long long e = n) { piii x, y; if (s >= r || e <= l) return x; if (s >= l && e <= r) { x.sm = sum[tag], x.cn = e - s, x.an = ans[tag]; return x; } long long mid = (s + e) / 2; x = query(l, r, tag * 2 + 0, s, mid), y = query(l, r, tag * 2 + 1, mid, e); return calc(x, y); } void builq(long long l, long long r, long long tag = 1, long long s = 0, long long e = n) { if (s >= r || e <= l) return; if (s >= l && e <= r) { build(s, e, tag); return; } long long mid = (s + e) / 2; builq(l, r, tag * 2 + 0, s, mid), builq(l, r, tag * 2 + 1, mid, e); sum[tag] = sum[tag * 2] + sum[tag * 2 + 1]; ans[tag] = ans[tag * 2] + ans[tag * 2 + 1] + (sum[tag * 2 + 1] * (mid - s) - sum[tag * 2] * (e - mid)); } long long a[N]; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n; for (long long i = 0; i < n; i++) { cin >> a[i]; v[i] = a[i]; } sort(v, v + n); build(0, n, 1); long long Q; cin >> Q; for (long long i = n; i < n + 100; i++) v[i] = 1e18 + 7; while (Q--) { long long type, l, r; cin >> type >> l >> r; if (type == 2) cout << query(pos(l, 0), pos(r, 1)).an << endl; else { l--; long long x = (0 < pos(a[l], 0) ? pos(a[l], 0) : 0), y = (n - 1 > pos(a[l] + r, 0) ? pos(a[l] + r, 0) : n - 1); long long ps = x; v[x] += r, a[l] += r; while (v[ps] > v[ps + 1]) swap(v[ps], v[ps + 1]), ps++; while (ps && v[ps] < v[ps - 1]) swap(v[ps], v[ps - 1]), ps--; builq((x > y ? y : x), (x < y ? y : x) + 1); } } } |
#include <bits/stdc++.h> using namespace std; int a[1000006], n, v[1000006], t[1000006]; void uma(int x) { int i; for (i = 0; i < n; i++) v[i] = i; for (; x; x >>= 1) { if (x & 1) { for (i = 0; i < n; i++) v[i] = a[v[i]]; } for (i = 0; i < n; i++) t[i] = a[a[i]]; for (i = 0; i < n; i++) a[i] = t[i]; } for (i = 0; i < n; i++) a[i] = v[i]; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int m, i, d, k, j, l, p; string s, os; cin >> s >> m; os = s; n = s.size(); for (i = 0; i < m; i++) { cin >> k >> d; p = 0; for (j = 0; j < d; j++) for (l = j; l < k; l += d) a[p++] = l; for (j = 0; j < k - 1; j++) a[j] = a[j + 1]; for (j = k - 1; j < n - 1; j++) a[j] = j + 1; a[j] = 0; uma(n - k + 1); for (j = 0; a[j]; j++) { } p = 0; for (; j < n; j++) os[p++] = s[a[j]]; for (j = 0; a[j]; j++) os[p++] = s[a[j]]; s = os; cout << s << n ; } } |
#include <bits/stdc++.h> using namespace std; long long dp[31][31]; long long solve(int n, int r) { if (n == r || r == 0) return 1; if (n < r) return 0; if (dp[n][r] != -1) { return dp[n][r]; } return dp[n][r] = solve(n - 1, r - 1) + solve(n - 1, r); } int main() { int t = 1; while (t--) { long long n, m, k; cin >> n >> m >> k; if (k == 1) { long long ans = 1; for (int i = 0; i < n; i++) { ans = (ans * m) % 1000000007; } cout << ans; } else if (k == n) { int s = n / 2; if (n % 2) s++; long long ans = 1; for (int i = 0; i < s; i++) { ans = (ans * m) % 1000000007; } cout << ans; } else if (k > n) { long long ans = 1; for (int i = 0; i < n; i++) { ans = (ans * m) % 1000000007; } cout << ans; } else { if (k % 2 == 0) { cout << m; } else { cout << m * m; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long r = 1000000009; int main() { long long m, n, k; cin >> n >> m >> k; long long d = n % k; d += (n / k) * (k - 1); if (m <= d) { cout << m % r; return 0; } int s = m - d; long long sc = (m - s * k) % r; long long c = 2; if (s < 100000000) { for (int i = s; i > 0; i--) { sc = (c * k + sc) % r; c = (c * 2) % r; } } else { while (s >= 10) { c = (c * 1024) % r; s -= 10; } while (s > 0) { c = (c * 2) % r; s--; } if (c >= 2) { c -= 2; } else { c += r; c -= 2; } c = (c * k) % r; sc = (sc + c) % r; } cout << sc; return 0; } |
#include<bits/stdc++.h> using namespace std; const int maxn=1e2+5; int t,n,m; int f[maxn<<1]; int main() { cin.tie(0); cout.tie(0); ios::sync_with_stdio(0); cin>>t; while(t--){ memset(f,0,sizeof(f)); cin>>n>>m; for(int i=1;i<=n;++i){ for(int j=1;j<=m;++j){ int x; cin>>x; f[i+j]^=x; } } int ans=0; for(int i=2;i<=n+m;++i){ ans|=f[i]; } if(ans) cout<< Ashish <<endl; else cout<< Jeel <<endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, q, dfn[200005], low[200005], ibcc[200005], dfncnt, bcccnt; vector<pair<int, int>> g[200005]; vector<int> ng[200005]; int st[200005], stcnt; void getbcc(int x, int pe) { dfn[x] = low[x] = ++dfncnt; st[stcnt++] = x; for (pair<int, int> &e : g[x]) if (!dfn[e.first]) { getbcc(e.first, e.second); low[x] = min(low[x], low[e.first]); } else if (e.second != pe) { low[x] = min(low[x], dfn[e.first]); } if (dfn[x] == low[x]) { ibcc[x] = ++bcccnt; int y; while ((y = st[--stcnt]) != x) { ibcc[y] = bcccnt; } } } int dep[200005]; int fa[200005][18]; bool vis[200005]; void dfs4lca(int x, int p, int cd) { vis[x] = 1; fa[x][0] = p; dep[x] = cd; for (int &y : ng[x]) if (y != p) { dfs4lca(y, x, cd + 1); } } void init4lca() { for (int i = 1; i <= bcccnt; i++) if (!vis[i]) dfs4lca(i, -1, 0); for (int j = 0; j < 17; j++) { for (int i = 1; i <= bcccnt; i++) { if (fa[i][j] == -1) fa[i][j + 1] = -1; else fa[i][j + 1] = fa[fa[i][j]][j]; } } } int lca(int x, int y) { if (dep[x] < dep[y]) swap(x, y); for (int i = 17; i >= 0; i--) { if (fa[x][i] != -1 && dep[fa[x][i]] >= dep[y]) x = fa[x][i]; } if (x == y) return x; for (int i = 17; i >= 0; i--) { if (fa[x][i] != fa[y][i]) { x = fa[x][i]; y = fa[y][i]; } } return fa[x][0]; } int up[200005], down[200005]; void calc(int x, int p) { vis[x] = 1; for (int &y : ng[x]) if (y != p) { calc(y, x); up[x] += up[y]; down[x] += down[y]; } if (up[x] && down[x]) { puts( No ); exit(0); } } int main() { scanf( %d%d%d , &n, &m, &q); for (int i = 1; i <= m; i++) { int a, b; scanf( %d%d , &a, &b); g[a].emplace_back(b, i); g[b].emplace_back(a, i); } for (int i = 1; i <= n; i++) if (!dfn[i]) getbcc(i, -1); for (int x = 1; x <= n; x++) { for (pair<int, int> &e : g[x]) { if (ibcc[x] != ibcc[e.first]) { ng[ibcc[x]].emplace_back(ibcc[e.first]); } } } init4lca(); memset(vis, 0, sizeof(vis)); while (q--) { int u, v, anc; scanf( %d%d , &u, &v); u = ibcc[u]; v = ibcc[v]; if (u == v) continue; anc = lca(u, v); up[u]++; up[anc]--; down[v]++; down[anc]--; } for (int i = 1; i <= bcccnt; i++) if (!vis[i]) calc(i, -1); puts( Yes ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int otg = 1 << 30, i; for (i = 0; i < m; i++) { int l, r; cin >> l >> r; if (r - l + 1 < otg) otg = r - l + 1; } cout << otg << endl; for (i = 0; i < n; i++) cout << i % otg << ; cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 300005, mod = 998244353; int qp(int a, int b) { int ans = 1; while (b) { if (b & 1) ans = 1ll * ans * a % mod; a = 1ll * a * a % mod; b >>= 1; } return ans; } int rv[N], w[N]; void ntt(vector<int> &a, int f) { int n = a.size(); for (int i = 0; i < n; i++) rv[i] = (rv[i >> 1] >> 1) | ((i & 1) * (n >> 1)); int wn = qp(f ? (mod + 1) / 3 : 3, (mod - 1) / n); w[0] = 1; for (int i = 1; i < n; i++) w[i] = 1ll * w[i - 1] * wn % mod; for (int i = 0; i < n; i++) if (i < rv[i]) swap(a[i], a[rv[i]]); for (int mid = 1; mid < n; mid <<= 1) { for (int i = 0; i < n; i += (mid << 1)) { for (int j = 0; j < mid; j++) { int x = a[i + j], y = 1ll * a[i + j + mid] * w[n / (mid << 1) * j] % mod; a[i + j] = (x + y >= mod ? x + y - mod : x + y); a[i + j + mid] = (x - y < 0 ? x - y + mod : x - y); } } } if (f) { int iv = qp(n, mod - 2); for (int i = 0; i < n; i++) a[i] = 1ll * a[i] * iv % mod; } } vector<int> mul(vector<int> a, vector<int> b) { int n = 1, m = a.size() + b.size() - 1; while (n < m) n <<= 1; a.resize(n), b.resize(n); ntt(a, 0), ntt(b, 0); for (int i = 0; i < n; i++) a[i] = 1ll * a[i] * b[i] % mod; ntt(a, 1); a.resize(m); return a; } vector<int> inv(vector<int> a) { int n = a.size(); if (n == 1) { a[0] = qp(a[0], mod - 2); return a; } int m = 1; while (m < (n << 1)) m <<= 1; vector<int> a0 = a; a0.resize((n + 1) / 2); vector<int> b0 = inv(a0); a.resize(m), b0.resize(m); ntt(a, 0), ntt(b0, 0); for (int i = 0; i < m; i++) a[i] = 1ll * b0[i] * (2 - 1ll * a[i] * b0[i] % mod + mod) % mod; ntt(a, 1); a.resize(n); return a; } vector<int> qd(vector<int> a) { int n = a.size(); for (int i = 1; i < n; i++) a[i - 1] = 1ll * a[i] * i % mod; a.pop_back(); return a; } vector<int> jf(vector<int> a) { int n = a.size(); a.push_back(0); for (int i = n; i >= 1; i--) a[i] = 1ll * a[i - 1] * qp(i, mod - 2) % mod; a[0] = 0; return a; } vector<int> ln(vector<int> a) { a = mul(qd(a), inv(a)); return jf(a); } vector<int> rev(vector<int> &a) { a[0] = 1; for (int i = 1; i < a.size(); i++) a[i] = (mod - a[i]) % mod; return a; } int n, m; int main() { scanf( %d%d , &n, &m); vector<int> a(n + 1), b(n + 1); int h = 1; int hh = 1; int cl = m / 2; for (int i = 1; i <= n; i++) { int t = (m + i) / 2; if ((m + i) & 1) { hh = 1ll * hh * (t - i + 1) % mod; h = 1ll * h * ((cl - i / 2 + mod) % mod) % mod; } else { hh = 1ll * hh * t % mod; h = 1LL * h * (cl + i / 2) % mod; } h = 1ll * h * qp(i, mod - 2) % mod; hh = 1ll * hh * qp(i, mod - 2) % mod; if (m & 1) h = hh; if (i & 1) b[i] = (((i / 2) & 1 ? -1 : 1) * h + mod) % mod; else a[i] = (((i / 2) & 1 ? 1 : -1) * h + mod) % mod; } auto d = mul(b, inv(rev(a))); auto c = rev(d); auto f = ln(inv(a)), g = ln(inv(c)); int ans = 1ll * n * (f[n] + g[n]) % mod; printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long maxN = 2e5 + 13, mod = 1e9 + 7; long long r, g, odp[maxN], ans; bool can(long long x) { if (x * (x + 1) / 2 <= r + g) return 1; return 0; } int32_t main() { cin >> r >> g; long long lf = 0, rg = max(r, g) + 1; while (rg - lf > 1) { long long mid = lf + rg >> 1; if (can(mid)) lf = mid; else rg = mid; } long long h = lf; odp[0] = 1; for (long long j = 0; j <= h; j++) { for (long long i = r; i >= 0; i--) { if (!(i == 0 && j == 0)) odp[i] = (odp[i] + ((i >= j) ? odp[i - j] : 0)) % mod; } } for (long long i = r; i + g >= h * (h + 1) / 2 && i >= 0; i--) { ans = (ans + odp[i]) % mod; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> ostream& operator<<(ostream& out, pair<T1, T2>& p) { out << { << p.first << , << p.second << } ; return out; } template <typename T1, typename T2> istream& operator>>(istream& in, pair<T1, T2>& p) { in >> p.fi > p.se; return in; } template <typename T> istream& operator>>(istream& in, vector<T>& arr) { for (auto& i : arr) in >> i; return in; } template <typename T> ostream& operator<<(ostream& out, vector<T>& arr) { for (auto i : arr) out << i + 1 << ; out << endl; return out; } const int64_t MAXN = 2e5 + 10; vector<pair<int64_t, int64_t>> mon, diam; int64_t n, c, d, t, t1; int64_t b_ans = 0; void read() { for (int64_t i(0); i < n; i++) { int64_t b, p; char c; cin >> b >> p >> c; if (c == D ) { diam.push_back({p, b}); } else { mon.push_back({p, b}); } } } void fnd() { t = 0; t1 = 0; for (int64_t i(0); i < mon.size(); i++) { if (mon[i].first <= c) { t = max(t, mon[i].second); } } for (int64_t i(0); i < diam.size(); i++) { if (diam[i].first <= d) { t1 = max(t1, diam[i].second); } } } void solve(vector<pair<int64_t, int64_t>>& mon, int64_t kek) { multiset<int64_t> s; for (int64_t i(0); i < mon.size(); i++) { s.insert(mon[i].second); } int64_t pt = (int64_t)mon.size() - 1; for (int64_t i(0); i < mon.size() && mon[i].first <= kek; i++) { while (pt >= 0 && mon[pt].first > kek - mon[i].first) { s.erase(s.find(mon[pt].second)); pt--; } if (pt >= i) { s.erase(s.find(mon[i].second)); } if (s.size() != 0) { b_ans = max(b_ans, mon[i].second + *s.rbegin()); } if (pt >= i) { s.insert(mon[i].second); } } } signed main() { ios::sync_with_stdio(false); cin.tie(); cout.tie(); cin >> n >> c >> d; read(); sort(mon.begin(), mon.end()); sort(diam.begin(), diam.end()); fnd(); if (t != 0 && t1 != 0) { b_ans = t + t1; } solve(mon, c); solve(diam, d); cout << b_ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long Mod = 1e9 + 7; long long powmod(long long a, long long b) { long long res = 1; a %= Mod; for (; b; b >>= 1) { if (b & 1) res = res * a % Mod; a = a * a % Mod; } return res; } long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } const int N = 200005; int main() { ios::sync_with_stdio(0); int t; cin >> t; while (t--) { int n; string x; cin >> n >> x; string ans[2]; bool flag = 0; for (auto ch : x) { if (ch == 0 ) { ans[0] += 0 ; ans[1] += 0 ; } if (ch == 2 ) { if (!flag) { ans[0] += 1 ; ans[1] += 1 ; } else { ans[0] += 0 ; ans[1] += 2 ; } } if (ch == 1 ) { if (!flag) { ans[0] += 1 ; ans[1] += 0 ; flag = 1; } else { ans[0] += 0 ; ans[1] += 1 ; } } } cout << ans[0] << n << ans[1] << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int a, b, c, d, l1, r1, l2, r2, k; while (cin >> l1 >> r1 >> l2 >> r2 >> k) { if (l2 > r1) cout << 0 << endl; else if (l1 > r2) cout << 0 << endl; else { long long int ans = 0; if (l2 >= l1 && l2 <= r1 && r2 >= r1) { ans = r1 - l2 + 1; if (k <= r1 && k >= l2) ans--; } else if (l2 >= l1 && l2 <= r1 && r2 <= r1) { ans = r2 - l2 + 1; if (k >= l2 && k <= r2) ans--; } else if (l1 >= l2 && r1 >= r2) { ans = r2 - l1 + 1; if (k >= l1 && k <= r2) ans--; } else if (l1 >= l2 && r1 <= r2) { ans = r1 - l1 + 1; if (k >= l1 && k <= r1) ans--; } cout << ans << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; bool ok(double a, double b) { if (a - b >= 0) return true; else return false; } double a, b; double calc(double x) { int l = 1; int r = 1000000000; while (l < r) { int m = (l + r) / 2 + 1; if (ok(x / ((double)m * 2.0), b)) l = m; else r = m - 1; } return l; } int main() { int aa, bb; cin >> aa >> bb; if (aa == bb) { cout << aa << endl; return 0; } if (aa < bb) { cout << -1 << endl; return 0; } a = aa; b = bb; double ans; double ans0 = (a - b) / (calc(a - b) * 2.0); double ans1 = (a + b) / (calc(a + b) * 2.0); if (ans0 < b) ans = ans1; else ans = min(ans0, ans1); printf( %.10lf n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long TESTS = 1; while (TESTS--) { long long n, x, y; cin >> n >> x >> y; string s; cin >> s; long long cnt = 0; char c = s[0]; for (auto i : s) if (i == c) continue; else { if (c == 0 ) cnt++; c = i; } if (c == 0 ) cnt++; if (!cnt) return cout << 0, 0; if (x < y) cout << x * (cnt - 1) + y; else cout << cnt * y; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 998244353; int a[1005][505]; vector<int> pos[505][505]; bool removed[505]; void remove1(int x, int n, int layerNum = 0){ if(removed[x]){return;} removed[x] = true; vector<int> toRemove; for(int j = 1; j <= n; j ++){ auto it = find(pos[j][a[x][j]].begin(), pos[j][a[x][j]].end(), x); if(layerNum == 0){ if(it != pos[j][a[x][j]].end()){ for(int k: pos[j][a[x][j]]){ if(k != x){ toRemove.push_back(k); } } pos[j][a[x][j]] = vector<int>(); } }else{ if(it != pos[j][a[x][j]].end()){ pos[j][a[x][j]].erase(it); } } } for(int k: toRemove){ remove1(k, n, 1); } } void printPosState(int n){ for(int i = 1; i <= n; i ++){ for(int j = 1; j <= n; j ++){ printf( (%d, %d): , i, j); for(int k: pos[i][j]){ printf( %d , k); } printf( n ); } } } int main(){ int t; scanf( %d , &t); while(t --){ int n; scanf( %d , &n); memset(removed, false, sizeof(removed)); for(int i = 1; i <= n; i ++){ for(int j = 1; j <= n; j ++){ pos[i][j] = vector<int>(); } } for(int i = 1; i <= 2*n; i ++){ for(int j = 1; j <= n; j ++){ scanf( %d , &a[i][j]); pos[j][a[i][j]].push_back(i); } } vector<int> res; //printPosState(n); int cnt = 0; while(1){ bool found = false; for(int i = 1; i <= n; i ++){ for(int j = 1; j <= n; j ++){ if((int)pos[i][j].size() == 1){ int x = pos[i][j][0]; remove1(x, n); //printf( %d removed n n , x); //printPosState(n); res.push_back(x); found = true; break; } } if(found){break;} } if(!found){ cnt ++; for(int i = 1; i <= n; i ++){ for(int j = 1; j <= n; j ++){ if((int)pos[i][j].size() == 2){ int x = pos[i][j][0]; remove1(x, n); //printf( %d removed n n , x); //printPosState(n); res.push_back(x); found = true; break; } } if(found){break;} } } if(!found){break;} } //printf( cnt=%d n , cnt); long long ans = 1; for(int i = 1; i < cnt; i ++){ ans = (ans+ans)%MOD; } printf( %lld n , ans); for(int x: res){ printf( %d , x); } printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long maxn = 400010; const long long mod = 1000000007; const long double eps = 1e-9; const long long inf = ((1ll << 31ll) - 1ll); const long long INF = 2000000000000000000ll; const long double pi = acos(-1); long long qpow(long long b, long long e) { if (!e) return 1; if (e & 1) return qpow(b, e - 1) * b % mod; long long pwur = qpow(b, e >> 1); return pwur * pwur % mod; } long long modinv(long long x) { return qpow(x, mod - 2); } long long tc, n, a[maxn]; vector<long long> ans; bool sorted() { for (long long i = 1; i < n; i++) if (a[i] > a[i + 1]) return 0; return 1; } void shft(long long x) { swap(a[x + 2], a[x + 1]); swap(a[x + 1], a[x]); } void tryl() { for (long long i = 1; i <= n - 2; i++) { pair<long long, long long> mn = {mod, -1}; for (long long j = i; j <= n; j++) { if (mn.first > a[j]) { mn = {a[j], j}; } } while (mn.second != i) { if (mn.second - 2 >= i) { shft(mn.second - 2); mn.second -= 2; ans.push_back(mn.second); } else { shft(mn.second - 1); shft(mn.second - 1); mn.second -= 1; ans.push_back(mn.second); ans.push_back(mn.second); } } } } void tryr() { for (long long i = n; i >= 3; i--) { pair<long long, long long> mx = {-1, -1}; for (long long j = 1; j <= i; j++) { if (mx.first <= a[j]) { mx = {a[j], j}; } } while (mx.second != i) { if (mx.second + 2 <= i) { shft(mx.second); ans.push_back(mx.second); mx.second += 2; } else { shft(mx.second - 1); ans.push_back(mx.second - 1); mx.second += 1; } } } } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.setf(ios::fixed); cout.precision(0); srand(time(NULL)); cin >> tc; while (tc--) { ans.clear(); cin >> n; for (long long i = 1; i <= n; i++) cin >> a[i]; long long bu = 10; while (bu--) { tryl(); tryr(); } for (long long i = 0; i <= 3; i++) { if (i) shft(n - 2); if (a[n - 2] <= a[n - 1] && a[n - 1] <= a[n]) { for (long long j = 1; j <= i; j++) ans.push_back(n - 2); break; } } if (!sorted()) { cout << -1 << n ; continue; } cout << ans.size() << n ; for (auto i : ans) cout << i << ; cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { vector<int> a(3); cin >> a[0] >> a[1] >> a[2]; sort(a.begin(), a.end()); int v = a[0]; int d = min(v, a[2] - a[1]); int ans = d; a[0] -= d; a[2] -= d; d = a[0] / 2 + a[0] % 2; a[2] = a[2] - d; a[1] = a[1] - a[0] / 2; ans += a[0]; ans += min(a[1], a[2]); cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]) { int cases; cin >> cases; while (cases--) { int length, target; cin >> length >> target; vector<vector<int>> BGR(3, vector<int>(length, 0)); string inp; cin >> inp; for (size_t i = 0, tok; i < inp.length(); ++i) { if (inp[i] == B ) tok = 0; else if (inp[i] == G ) tok = 1; else tok = 2; BGR[(tok + i) % 3][i] = 1; } int ans = target; for (auto x : BGR) { size_t j = 0; int init = target; for (; j < target; ++j) init -= x[j]; ans = init < ans ? init : ans; for (size_t i = 0; j < x.size(); ++i, ++j) { init += x[i] - x[j]; ans = init < ans ? init : ans; } } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INFint = 2147483647; const long long INF = 9223372036854775807ll; const long long MOD = 1000000007ll; char f[2020][2020]; int n, m; bool c(int x, int y, int d, int cnt) { int cur = 0; cerr << x << << y << endl; if (x > 0 && y > 0 && x + d - 1 <= n && y + d - 1 <= m) { for (int i = x; i < x + d; i++) { cur += (f[i][y] == w ); cur += (f[i][y + d - 1] == w ); } for (int i = y + 1; i < y + d - 1; i++) { cur += (f[x][i] == w ); cur += (f[x + d - 1][i] == w ); } return (cur == cnt); } return 0; } int main() { ios_base::sync_with_stdio(0); int minx = INFint, miny = INFint, maxx = -INFint, maxy = -INFint; cin >> n >> m; int cnt = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> f[i][j]; if (f[i][j] == w ) { minx = min(minx, i); miny = min(miny, j); maxx = max(maxx, i); maxy = max(maxy, j); cnt++; } } } int d = max(maxx - minx + 1, maxy - miny + 1); cerr << d << endl; if (d == 1) { for (int it = 1; it <= n; it++) { for (int l = 1; l <= m; l++) cout << f[it][l]; cout << endl; } return 0; } int x[3] = {minx, maxx - d + 1, 1}; int y[3] = {miny, maxy - d + 1, 1}; for (int i = 0; i < 3; i++) cerr << x[i] << ; cerr << endl; for (int i = 0; i < 3; i++) cerr << y[i] << ; cerr << endl; for (int i = 0; i < 3; i++) for (int j = 0; j < 3; j++) { if (c(x[i], y[j], d, cnt)) { for (int it = x[i]; it < x[i] + d; it++) { if (f[it][y[j]] != w ) f[it][y[j]] = + ; if (f[it][y[j] + d - 1] != w ) f[it][y[j] + d - 1] = + ; } for (int it = y[j]; it < y[j] + d; it++) { if (f[x[i]][it] != w ) f[x[i]][it] = + ; if (f[x[i] + d - 1][it] != w ) f[x[i] + d - 1][it] = + ; } for (int it = 1; it <= n; it++) { for (int l = 1; l <= m; l++) cout << f[it][l]; cout << endl; } return 0; } } cout << -1 << endl; fprintf(stderr, nTIME = %lf n , 1.0 * clock() / CLOCKS_PER_SEC); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } int count1 = 0; for (int i = 0; i < n; i++) { int sum = 0; for (int j = 0; j < n; j++) { if (i == j) { continue; } else { sum += a[j]; } } if (sum % 2 == 0) { count1++; } } cout << count1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int sgn(double x) { return (x > 1e-8) - (x < -1e-8); } int count_bit(int x) { return x == 0 ? 0 : count_bit(x >> 1) + (x & 1); } template <class T> inline void ckmin(T& a, const T b) { if (b < a) a = b; } template <class T> inline void ckmax(T& a, const T b) { if (b > a) a = b; } const int MAXN = 100000 + 10; struct binary_indexed_tree { int a[MAXN], val[MAXN]; void clear() { memset(a, 0, sizeof(a)); memset(val, 0, sizeof(val)); } void update(int x, int y) { val[x] += y; for (; x < MAXN; x += ((x) & (-(x)))) { a[x] += y; } } int getsum(int x) { int ret = 0; for (; x; x -= ((x) & (-(x)))) { ret += a[x]; } return ret; } int getsum(int l, int r) { int ret = 0; while (l <= r) { if (r - ((r) & (-(r))) + 1 >= l) { ret += a[r]; r -= ((r) & (-(r))); } else { ret += val[r--]; } } return ret; } } bit; void filp_left(int& l, int& r, int len) { for (int i = (1); i <= (len); ++i) { bit.update(l + len + len - i, bit.val[l + i - 1]); } l += len; } void filp_right(int& l, int& r, int len) { for (int i = (1); i <= (len); ++i) { bit.update(r - len - len + i, bit.val[r - i + 1]); } r -= len; } int main() { int n, q; while (scanf( %d%d , &n, &q) != EOF) { bit.clear(); for (int i = 0; i < (n); ++i) { bit.update(i + 1, 1); } int off = 0; int l = 1, r = n; bool rev = false; for (int i = 0; i < (q); ++i) { int optype, flen, cl, cr; scanf( %d , &optype); if (optype == 1) { scanf( %d , &flen); int clen = r - l + 1; if (2 * flen > clen) { if (!rev) { filp_right(l, r, clen - flen); } else { filp_left(l, r, clen - flen); } rev = !rev; } else { if (!rev) { filp_left(l, r, flen); } else { filp_right(l, r, flen); } } } else { scanf( %d%d , &cl, &cr); int ret; if (!rev) { ret = bit.getsum(l + cl, l + cr - 1); } else { ret = bit.getsum(r - cr + 1, r - cl); } printf( %d n , ret); } } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; int c1 = 0, c2 = 0; for (int i = 0; i < n; ++i) { int aux; cin >> aux; c1 += aux == 1; c2 += aux == -1; } for (int i = 0; i < m; ++i) { int a, b; cin >> a >> b; if ((b - a + 1) % 2 == 0) { if (c1 >= (b - a + 1) / 2 && c2 >= (b - a + 1) / 2) cout << 1 n ; else cout << 0 n ; } else cout << 0 n ; } return 0; } |
#include <bits/stdc++.h> int main() { char s[15]; char a; int len; scanf( %s , s); len = strlen(s); a = a - 1; for (int i = 0; i < len; i++) { if (a <= s[i]) { a = s[i]; } } for (int i = 0; i < len; i++) { if (s[i] == a) printf( %c , s[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1000000 + 239; const int inf = (int)1e9 + 1; const long long big = (long long)1e18 + 1; const int P = 31; const int MOD = (int)1e9 + 7; const int MOD1 = (int)1e9 + 9; const double eps = 1e-9; const double pi = atan2(0, -1); int a[N]; vector<int> g[N]; int d[N]; void dfs(int u) { for (int v : g[u]) { dfs(v); d[u] = max(d[u], d[v] + 1); } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.precision(20); int n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 1; i < n; i++) { int p; cin >> p; p--; g[p].push_back(i); } dfs(0); int res = 0; for (int i = 0; i < n; i++) if (d[i] % 2 == 0) res ^= a[i]; map<int, int> cnt; for (int i = 0; i < n; i++) if (d[i] % 2 == 1) cnt[a[i]]++; long long ans = 0; for (int i = 0; i < n; i++) if (d[i] % 2 == 0) ans += cnt[res ^ a[i]]; if (res == 0) { int cnt0 = 0, cnt1 = 0; for (int i = 0; i < n; i++) if (d[i] % 2 == 0) cnt0++; else cnt1++; ans += (long long)cnt0 * (cnt0 - 1) / 2; ans += (long long)cnt1 * (cnt1 - 1) / 2; } cout << ans << endl; return 0; } |
//#pragma GCC target ( avx2 ) //#pragma GCC optimization ( O3 ) //#pragma GCC optimization ( unroll-loops ) #include<bits/stdc++.h> //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> //using namespace __gnu_pbds; #define eps 1e-8 #define eq(x,y) (fabs((x)-(y)) < eps) using namespace std; typedef long long ll; typedef long double ld; typedef pair<int,int>pii; const ll mod= 998244353; long double PI = acosl(-1); const ll infl = 1e17+100; const int inf = 1e9+100; const int nmax = 3e5+5; //const int MAXLG = log2(nmax)+1; //mt19937 rng(chrono::system_clock::now().time_since_epoch().count()); //typedef tree< int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ost; bool vis[nmax]; vector<int>g[nmax]; void dfs(int u){ vis[u] = true; for(int v : g[u]) if(!vis[v]) dfs(v); } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int tc; cin>>tc; while(tc--){ int n,m; cin>>n>>m; for(int i=0; i<m; i++){ int u,v; cin>>u>>v; g[u].push_back(v); g[v].push_back(u); } bool hoise = false; bool unposibol = false; for(int i=1; i<=n; i++){ if(!vis[i]){ if(!hoise){ dfs(i); hoise = true; } else unposibol = true; } } if(unposibol) cout<< NO n ; else{ cout<< YES n ; for(int i=1; i<=n; i++) vis[i] = false; vector<int>ans; set<int>st; st.insert(1); while(st.size()){ int u = *st.begin(); st.erase(u); if(vis[u]) continue; vis[u] = true; ans.push_back(u); vector<int>tmp; for(int v : g[u]) if(!vis[v]){ vis[v] = true; tmp.push_back(v); } for(int v : tmp){ for(int z : g[v]) if(!vis[z]){ st.insert(z); } } } cout<<ans.size()<< n ; for(int x : ans) cout<<x<< ; cout<< n ; } for(int i=1; i<=n; i++) vis[i] = false, g[i].clear(); } } /* */ |
#include <bits/stdc++.h> using namespace std; long long mysqrt(long long x) { long long l = 0; long long r = 1; while (r * r <= x) r *= 2; while (r - l > 1) { long long m = (l + r) / 2; if (m * m <= x) l = m; else r = m; } return l; } int main() { long long n; cin >> n; long long a[n + 2][n + 2]; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cin >> a[i][j]; } } for (int i = 0; i < n; i++) { int j = (i + 1) % n; int k = (j + 1) % n; cout << mysqrt(1ll * a[i][j] * a[i][k] / a[j][k]) << n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, mx = 0, i, j, value; cin >> n; vector<int> v(n + 1, 0); for (i = 1; i <= n; i++) { cin >> v[i]; v[i] += v[i - 1]; } for (i = 1; i <= n; i++) { for (j = 0; j < i; j++) { if ((v[i] - v[j]) > (100 * (i - j))) { mx = max(mx, i - j); break; } } } cout << mx << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; void solve(); string conc(long long int a, long long int b) { return to_string(a) + | + to_string(b); } long long int rev(long long int x) { long long int ans = 0; while (x != 0) { ans = ans * 10 + (x % 10); x /= 10; } return ans; } long long int numdig(long long int x) { long long int ans = 0; while (x != 0) { ans++; x /= 10; } return ans; } void printvec(vector<long long int> &v) { for (long long int i = 0; i < v.size(); i++) cout << v[i] << ; cout << n ; } void printmat(vector<vector<long long int>> &mat) { for (long long int i = 0; i < mat.size(); i++) { for (long long int j = 0; j < mat[0].size(); j++) cout << mat[i][j] << ; cout << n ; } } void solve() { long long int n, k; cin >> n >> k; string s; cin >> s; vector<long long int> f(26, 0); vector<pair<char, long long int>> v; long long int vsize = 0; for (auto c : s) f[c - a ]++; for (long long int i = 0; i < 26; i++) { if (f[i] > 0) { v.push_back({ a + i, f[i]}); vsize++; } } if (v[0].second < k) { long long int count = 0; for (long long int i = 0; i < vsize; i++) { count += v[i].second; if (count >= k) { cout << v[i].first << n ; return; } } return; } string init = ; init = init + v[0].first; vector<string> words(k, init); v[0].second -= k; for (long long int i = 0; i < vsize; i++) { if (i == vsize - 1) { long long int j = 0; long long int c = 0; while (j < k && words[j] == words[0]) j++; while (v[i].second--) { words[c] += v[i].first; c = (c + 1) % j; } } else { while (v[i].second--) { words[0] += v[i].first; } } } sort(words.begin(), words.end()); cout << words[k - 1] << n ; } int main(void) { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int t; t = 1; cin >> t; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 998244353; pair<int, int> calc(int a, int b) { if (a <= b) return {a, 0}; int r = a / b; if (a % b == 0) return {b, r - 1}; return {a / (r + 1), r}; } vector<pair<int, int>> compact(const vector<pair<int, int>>& V) { vector<pair<int, int>> R; int p = -1, c = 0; for (auto [a, b] : V) { if (a != p && p != -1) { R.emplace_back(p, c); c = 0; } p = a; c += b; } R.emplace_back(p, c); return R; } int main() { ios_base::sync_with_stdio(false); int tn; cin >> tn; for (int ti = 0; ti < tn; ++ti) { int n; cin >> n; vector<int> A(n); for (int& a : A) cin >> a; vector<pair<int, int>> B; uint64_t r = 0; for (int i = n - 1; i > 0; --i) { B.emplace_back(A[i], 1); vector<pair<int, int>> C; for (auto [x, y] : B) { auto [z, t] = calc(A[i - 1], x); C.emplace_back(z, y); r = (r + 1ull * t * i * y) % MOD; } sort(C.begin(), C.end()); B = compact(C); } cout << r << endl; } return 0; } |
#include<bits/stdc++.h> #define maxn 1000005 #define inf 9999999999999999 #define mod 100003 typedef long long LL; using namespace std; LL a[maxn]; int main() { ios::sync_with_stdio(false); //freopen( bwxnQAQin.txt , r ,stdin); LL T; cin>>T; while(T--) { LL n; cin>>n; if(n&1) { LL zong=n-1,fuyi=zong/2; for(LL i=zong;i>=1;i--) { for(LL j=1;j<=i-fuyi;j++)cout<< 1 ; for(LL j=1;j<=fuyi;j++)cout<< -1 ; if(fuyi)fuyi--; } cout<<endl; } else { LL zong=n-1,ban=zong/2; for(LL i=1;i<=zong;i++) { for(LL j=i;j<=zong;j++) { if(j<i+ban)cout<< 1 ; else if(j==i+ban)cout<< 0 ; else cout<< -1 ; } } cout<<endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long read() { long long x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } double p[200010]; int n, cnt; double ans; inline void solve(int a, int b) { ans += (double)(a - b) / 2; p[++cnt] = (double)(a + b) / 2; } int main() { n = read(); for (int i = 1; i <= n; i++) { long long a = read(), b = read(), c = read(), d = read(); if (a + b >= c + d) { solve(a, b); solve(c, d); } else { if (a >= d) solve(a - d, d - a); if (b >= c) solve(c - b, b - c); } } sort(p + 1, p + cnt + 1, greater<double>()); for (int i = 1; i <= cnt; i++) { if (i & 1) ans += p[i]; else ans -= p[i]; } printf( %.0f n , ans); } |
#include <bits/stdc++.h> using namespace std; const int N = 1000010; int f[N]; void init() { for (int i = 1; i <= N; i++) { f[i] = f[i - 1] + i * 2 + (i - 1); if (f[i] >= 1e9) { break; } } } int Find(int x) { int l = 0, r = 25820; while (l < r) { int mid = (l + r + 1) / 2; if (f[mid] <= x) l = mid; else r = mid - 1; } return l; } int main() { int T; scanf( %d , &T); init(); while (T--) { int x; scanf( %d , &x); int ans = 0; while (true) { int t = Find(x); if (f[t] <= 0) break; x -= f[t]; ans++; } printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = ~0ull / 2; const int maxn = 100100; int seen[maxn]; int ind[maxn]; int par[maxn][22]; int bd[maxn]; int h[maxn]; vector<int> adj[maxn]; vector<int> adlist[maxn]; vector<int> tree[maxn]; vector<pair<int, int> > edges; void dfs1(int root, int dad = -1) { seen[root] = 1; bd[root] = h[root]; for (auto v : adj[root]) { if (!seen[v]) { h[v] = h[root] + 1; dfs1(v, root); bd[root] = min(bd[v], bd[root]); if (!(bd[v] > h[root])) { adlist[root].push_back(v); adlist[v].push_back(root); } else { edges.push_back(make_pair(root, v)); } } else { if (v != dad) { adlist[root].push_back(v); adlist[v].push_back(root); bd[root] = min(bd[root], h[v]); } } } } void dfs2(int root, int t) { seen[root] = 2; ind[root] = t; for (auto v : adlist[root]) { if (seen[v] == 1) { dfs2(v, t); } } } void dfs3(int root, int dad) { par[root][0] = dad; for (auto v : tree[root]) { if (v != dad) { h[v] = h[root] + 1; dfs3(v, root); } } } int dis(int x, int y) { x = ind[x]; y = ind[y]; if (h[x] < h[y]) swap(x, y); int X = x; int Y = y; int t = 20; while (h[x] != h[y]) { if (h[par[x][t]] >= h[y]) x = par[x][t]; t--; } if (x == y) return h[X] - h[x]; int A; t = 20; while (par[x][0] != par[y][0] and t >= 0) { if (par[x][t] != par[y][t]) { x = par[x][t]; y = par[y][t]; } t--; } A = par[x][0]; return (h[X] + h[Y] - 2 * h[A]); } int main() { ios::sync_with_stdio(false), cin.tie(0); int n, m, k; cin >> n >> m; for (int i = 0; i < m; i++) { int a, b; cin >> a >> b; a--, b--; adj[a].push_back(b); adj[b].push_back(a); } dfs1(0); int t = 1; for (int i = 0; i < n; i++) { if (seen[i] == 1) { dfs2(i, t); t++; } } for (auto e : edges) { int x = e.first; int y = e.second; x = ind[x]; y = ind[y]; tree[x].push_back(y); tree[y].push_back(x); } h[0] = 0; h[1] = 1; dfs3(1, 0); fill(par[0], par[0] + 22, 0); for (int i = 1; i < 22; i++) for (int j = 1; j < t; j++) par[j][i] = par[par[j][i - 1]][i - 1]; cin >> k; for (int i = 0; i < k; i++) { int s, l; cin >> s >> l; s--, l--; cout << dis(s, l) << n ; } } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; double dp[maxn], p[maxn]; int main() { int n; scanf( %d , &n); double ans = 0, d; for (int i = 1; i <= n; i++) { scanf( %lf , &p[i]); ans += p[i]; } for (int i = 2; i <= n; i++) { dp[i] = (dp[i - 1] + p[i - 1]) * p[i]; ans += 2 * dp[i]; } printf( %.10f n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0; char c = getchar(); bool p = 1; for (; !isdigit(c); c = getchar()) if (c == - ) p = 0; for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48); return p ? x : -x; } const int N = 1000105; struct edge { int to, nt; } e[N * 2]; int n, k, x, y, ans, cnt, head[N], rt = 1, du[N]; void add(int u, int v) { e[++cnt] = (edge){v, head[u]}; head[u] = cnt; } int dfs(int u, int fa) { vector<int> v; int i; for (i = head[u]; i; i = e[i].nt) if (e[i].to != fa) v.push_back(dfs(e[i].to, u) + 1); sort(v.begin(), v.end()); for (i = v.size() - 1; i > 0; i--) if (v[i] + v[i - 1] > k) ans++; else break; return v.size() == 0 ? 0 : v[i]; } int main() { n = read(); k = read(); for (int i = 1; i < n; i++) { x = read(); y = read(); add(x, y); add(y, x); du[x]++; du[y]++; if (du[x] > 1) rt = x; if (du[y] > 1) rt = y; } dfs(rt, 0); cout << ans + 1; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int main() { ios_base ::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, m; cin >> n >> m; long long a[n + 1]; for (int i = 1; i <= n; i++) cin >> a[i]; long long v, x, add = 0, y, q; int t; while (m--) { cin >> t; if (t == 1) { cin >> v >> x; a[v] = x - add; } else if (t == 2) { cin >> y; add += y; } else { cin >> q; cout << a[q] + add << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; double areaa(int x1, int x2, int x3, int y1, int y2, int y3); int gcd(int x, int y); int lcm(int x, int y); int egcd(int a, int b, int& x, int& y); vector<int> prime_possible_factors(int n); vector<int> primes_included(int n, int m); map<int, int> factor(int N); bool isPrime(int N); int charType(char c); double areaa(int x1, int x2, int x3, int y1, int y2, int y3) { double area = abs((x1 * (y2 - y3) + x2 * (y3 - y1) + x3 * (y1 - y2)) / 4.0); return area; } int gcd(int x, int y) { return y == 0 ? x : gcd(y, x % y); } int lcm(int x, int y) { return (x * y / gcd(x, y)); } int egcd(int a, int b, int& x, int& y) { if (b == 0) { x = 1; y = 0; return a; } else { int d = egcd(b, a % b, x, y); x -= a / b * y; swap(x, y); return d; } } vector<int> prime_possible_factors(int n) { bool* isPrime = new bool[n]; for (int i = 0; i < n; i++) { isPrime[i] = true; } vector<int> primes; for (int i = 2; i * i <= n; ++i) { if (isPrime[i]) { primes.push_back(i); for (int j = i; j < n; j += i) isPrime[j] = false; } } return primes; } vector<int> primes_included(int n, int m) { bool* isPrime = new bool[m]; for (int i = 0; i < m; i++) { isPrime[i] = true; } vector<int> primes; for (int i = 2; i < m; ++i) { if (isPrime[i]) { if (i >= n) primes.push_back(i); for (int j = i; j < m; j += i) isPrime[j] = false; } } return primes; } map<int, int> factor(int N) { vector<int> primes; primes = primes_included(0, N); map<int, int> factors; for (int i = 0; i < primes.size(); ++i) { int prime = primes[i], power = 0; while (N % prime == 0) { power++; N /= prime; } factors[prime] = power; } return factors; } bool isPrime(int N) { vector<int> check = prime_possible_factors(N); for (int i = 0; i < check.size(); i++) { if (N % check[i] == 0) { return false; } } return true; } int main() { int T; long long int n, s, t; cin >> T; int i = 0; for (i; i < T; i++) { cin >> n >> s >> t; cout << max(n - s, n - t) + 1 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; string s, t, tmp1, tmp2; vector<int> ans; int cnt, n; int main() { cin >> n; cin >> s >> t; tmp1 = s, tmp2 = t; sort(tmp1.begin(), tmp1.end()); sort(tmp2.begin(), tmp2.end()); if (tmp1 != tmp2) return cout << -1, 0; if (s[0] == t[n - 1]) cnt++; while (cnt != n) { int i; for (i = cnt; i < n; i++) { if (s[i] == t[n - cnt - 1]) break; } ans.push_back(n); for (int j = 0; j < n / 2; j++) swap(s[j], s[n - j - 1]); s = s.substr(n - i, i) + s.substr(0, n - i); for (int j = 0; j < i / 2; j++) swap(s[j], s[i - j - 1]); s = s.substr(n - 1, 1) + s.substr(0, n - 1); ans.push_back(i); ans.push_back(1); cnt++; } cout << ans.size() << endl; for (int i = 0; i < (int)ans.size(); i++) cout << ans[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 2; int a[N], b[N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; for (int i = 0; i < (int)n; i++) cin >> a[i], b[i + 1] += b[i] + a[i]; int t = 0; for (int i = 0; i < (int)n; i++) { for (int j = 0; j < (int)i + 1; j++) { if (b[i + 1] - b[j] > 100 * (i - j + 1)) t = max(t, i - j + 1); } } cout << t << n ; } |
#include <bits/stdc++.h> using namespace std; int MIN(int a, int b) { return a < b ? a : b; }; int MAX(int a, int b) { return a > b ? a : b; }; int gcd(int a, int b) { if (b == 0) return a; else return gcd(b, a % b); } int n, m, q; int h; int a[20] = {2, 4, 3, 9, 5, 25, 7, 49, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53}; int main() { int i, j, x, y, T, num, t; string str; t = num = 0; for (i = 0; i < 20; i++) { cout << a[i] << endl; cin >> str; num++; x = a[i]; if (str == yes ) { t++; } if (t > 1) break; } if (i == 20) cout << prime n ; else cout << composite n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; struct edge { int from; int to; int next; } E[500005 << 1]; int head[100005]; int deg[100005]; int tmp[500005]; int used[500005 << 1]; int size = 1; void add_edge(int u, int v) { size++; E[size].from = u; E[size].to = v; E[size].next = head[u]; head[u] = size; } stack<int> s, ans; void euler() { s.push(1); while (!s.empty()) { int x = s.top(); int i = head[x]; while (i != 0 && used[i] == 1) i = E[i].next; if (i != 0) { s.push(E[i].to); used[i] = used[i ^ 1] = 1; head[x] = E[i].next; } else { s.pop(); ans.push(x); } } } int main() { int u, v; scanf( %d %d , &n, &m); for (int i = 1; i <= m; i++) { scanf( %d %d , &u, &v); add_edge(u, v); add_edge(v, u); deg[u]++; deg[v]++; } int pre = 0; int cnt = 0; for (int i = 1; i <= n; i++) { if (deg[i] % 2 == 1) { if (pre != 0) { add_edge(pre, i); add_edge(i, pre); pre = 0; } else pre = i; } } if (((size - 1) / 2) % 2 == 1) { add_edge(1, 1); size++; } euler(); printf( %d n , (size - 1) / 2); int ptr = 0; while (!ans.empty()) { tmp[++ptr] = ans.top(); ans.pop(); } for (int i = 1; i <= ptr - 1; i++) { if (i & 1) printf( %d %d n , tmp[i], tmp[i + 1]); else printf( %d %d n , tmp[i + 1], tmp[i]); } } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1123456; const int MAXINT = 2147483098; const long long MAXLL = 9223372036854775258LL; set<pair<int, int> > s; int ans[MAXN]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m, d, pos = 0, mx = 0; cin >> n >> m >> d; for (int i = 1; i <= n; ++i) { int a; cin >> a; s.insert(make_pair(a, i)); } for (int i = 1; i <= n; ++i) { if (!s.size()) break; ans[s.begin()->second] = i; mx = i; long long val = s.begin()->first; s.erase(s.begin()); while (1) { if (!s.size()) break; auto it = s.lower_bound(make_pair(val + d + 1, 0LL)); if (it == s.end()) break; ans[it->second] = i; val = it->first; s.erase(it); } } cout << mx << n ; for (int i = 1; i <= n; ++i) cout << ans[i] << ; return 0; } |
#include <bits/stdc++.h> char s[200005]; using namespace std; int main() { int n, k; cin >> n >> k; getchar(); cin >> s; int maxn1 = 0; for (int i = 0; i < 26; i++) { char t = a + i; int sum1 = 0; int maxn = 0; for (int j = 0; j < n; j++) { if (s[j] == t && s[j + 1] == t) sum1++; else if (s[j] == t && s[j + 1] != t) { sum1++; maxn += sum1 / k; sum1 = 0; } } maxn1 = max(maxn, maxn1); } cout << maxn1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 200010; vector<int> G[maxn]; int n, k; int u, v; int siz[maxn], dep[maxn]; int val[maxn], fa[maxn]; void dfs(int x, int d) { dep[x] = d; siz[x] = 1; for (int i = 0; i < G[x].size(); ++i) { int to = G[x][i]; if (to == fa[x]) continue; fa[to] = x; dfs(to, d + 1); siz[x] += siz[to]; } val[x] = siz[x] - dep[x]; } int main() { scanf( %d%d , &n, &k); for (int i = 1; i < n; ++i) { scanf( %d%d , &u, &v); G[u].push_back(v); G[v].push_back(u); } dfs(1, 1); sort(val + 1, val + 1 + n); long long ans = 0; for (int i = k + 1; i <= n; ++i) ans += (long long)val[i]; cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, k; cin >> n >> k; pair<long long, long long> a[n]; for (long long i = 0; i < n; i++) { cin >> a[i].first; a[i].second = i; } sort(a, a + n); queue<long long> q; set<long long> s; bool turn = true; long long ans[n]; for (long long i = n - 1; i >= 0; i--) { q.push(a[i].second); s.insert(i); } while (!q.empty()) { long long top = q.front(); q.pop(); if (s.find(top) == s.end()) continue; vector<long long> v; long long count = 0; for (auto itr = prev(s.find(top)); count < k && itr != prev(s.begin()); itr--) { v.push_back(*itr); count++; } count = 0; for (auto itr = s.find(top); count <= k && itr != s.end(); itr++) { v.push_back(*itr); count++; } for (long long i = 0; i < v.size(); i++) { s.erase(v[i]); ans[v[i]] = turn; } turn = !turn; } for (long long i = 0; i < n; i++) { if (ans[i]) cout << 1; else cout << 2; } return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { int n, m; cin >> n >> m; vector<pair<string, int>> a(n); int c = 1; for (auto &t : a) { cin >> t.first; t.second = c++; } for (auto &t : a) { for (int i = 1; i < m; i += 2) { t.first[i] = z - t.first[i] + a ; } } sort(a.begin(), a.end()); for (auto t : a) { cout << t.second << ; } } int main() { solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> g[100005]; double dfs(int i, int ult) { double ans = 0; int c = g[i].size() - (i != 1); for (int j = 0; j < g[i].size(); j++) { if (g[i][j] != ult) { ans += (dfs(g[i][j], i) + 1.0) / c; } } return ans; } int main() { int n; scanf( %d , &n); for (int i = 1; i < n; i++) { int a, b; scanf( %d %d , &a, &b); g[a].push_back(b); g[b].push_back(a); } printf( %.15lf n , dfs(1, 0)); } |
#include <bits/stdc++.h> using namespace std; const long long MXN = 2e5 + 10; const long long LOG = 21; const long long MXM = (1LL << LOG); const long long INF = 1e9; int n, m, ans; int dp[MXN], ps[MXN], Best[LOG][MXM]; string S[MXN]; int Cost(int i, int j) { for (int x = m; x; x--) { if (S[i].substr(m - x + 1, x) == S[j].substr(1, x)) { return m - x; } } return m; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); memset(dp, 31, sizeof dp), memset(Best, 31, sizeof Best); cin >> n, ans = INF; for (int i = 1; i <= n; i++) { cin >> S[i], m = (long long)S[i].size(); S[i] = 0 + S[i]; } ps[1] = dp[1] = m; for (int i = 2; i <= n; i++) ps[i] = ps[i - 1] + Cost(i - 1, i); for (int i = 2; i <= n; i++) { dp[i] = ps[i - 1] + m; long long mask = 0; for (int x = 0; x <= m; x++) { mask = mask * 2 + (S[i][x] - 0 ); if (Best[x][mask] < INF) { dp[i] = min(dp[i], ps[i - 1] + m - x + Best[x][mask]); } } mask = 0; for (int x = 0; x <= m; x++) { if (x && S[i - 1][m - x + 1] == 1 ) { mask += (1LL << (x - 1)); } Best[x][mask] = min(Best[x][mask], dp[i] - ps[i]); } } for (int i = 1; i <= n; i++) ans = min(ans, dp[i] + ps[n] - ps[i]); cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> idb[100002]; int dp[301]; int main() { int n, m, s, e; cin >> n >> m >> s >> e; vector<int> a(n); for (int i = 0; i < n; i++) scanf( %d , &a[i]); for (int i = 0; i < m; i++) { int b; scanf( %d , &b); idb[b].push_back(i); } int ans = 0; memset(dp, 127, sizeof dp); dp[0] = 0; for (int i = 0; i < n; i++) { for (int j = 300; j >= 1; j--) { int pos2array = dp[j - 1]; int nextPos = lower_bound(idb[a[i]].begin(), idb[a[i]].end(), pos2array) - idb[a[i]].begin(); if (nextPos == idb[a[i]].size()) continue; int abspos2ar = idb[a[i]][nextPos]; dp[j] = min(dp[j], abspos2ar + 1); if (i + 1 + dp[j] + j * e <= s) ans = max(ans, j); } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, K, a[100100], f[30030][205][4][2]; bool vis[30030][205][4][2]; void work() { memset(f, -127, sizeof(f)); for (int i = 1; i <= n; i++) { f[i][1][0][0] = -a[i]; f[i][1][2][0] = a[i]; vis[i][1][0][0] = 1; vis[i][1][2][0] = 1; } for (int i = 1; i < n; i++) for (int j = 1; j <= min(K, i); j++) for (int k = 0; k <= 3; k++) for (int l = 0; l <= 1; l++) { if (!vis[i][j][k][l]) continue; int v = f[i][j][k][l], sign = 0; if (k == 0) sign = -2; if (k == 3) sign = 2; if (j == 1) { if (k == 0) sign = -1; if (k == 2) sign = 1; } if (j == K) { if (k == 0 || k == 2) sign = -1; else sign = 1; } if (!l) { vis[i + 1][j][k][l] = 1; f[i + 1][j][k][l] = max(f[i + 1][j][k][l], v + sign * a[i + 1]); } vis[i + 1][j][k][1] = 1; f[i + 1][j][k][1] = max(f[i + 1][j][k][1], v); for (int w = 0; w <= 1; w++) { int s = (w << 1) | ((k & 2) == 0); sign = 0; if (s == 0) sign = -2; if (s == 3) sign = 2; if (j + 1 == K) { if (s == 0 || s == 2) sign = -1; else sign = 1; } vis[i + 1][j + 1][s][0] = 1; f[i + 1][j + 1][s][0] = max(f[i + 1][j + 1][s][0], v + sign * a[i + 1]); } } int ans = 0; for (int i = 0; i <= 3; i++) ans = max(ans, max(f[n][K][i][1], f[n][K][i][0])); cout << ans; } int main() { cin >> n >> K; for (int i = 1; i <= n; i++) scanf( %d , &a[i]); work(); } |
#include <bits/stdc++.h> using namespace std; const int N = 4e5; int T, n, m, k, f[N + 5], ans[N + 5]; struct People { int a, r, d, u, id; } p[N + 5]; struct Info { int opt, l, r; Info() {} Info(int opt, int l, int r) : opt(opt), l(l), r(r) {} }; template <int MAX> struct BIT { static const int N = MAX; int b[N + 5]; void clear() { fill(b + 1, b + N + 1, 0); } void modify(int x, int v) { for (; x <= N; x += x & -x) b[x] += v; } int query(int x) { int ans = 0; for (; x > 0; x ^= x & -x) ans += b[x]; return ans; } int query(int l, int r) { return query(r) - query(l - 1); } }; template <int MAX> struct SegmentTree { static const int N = MAX << 2; int val[N + 5]; void clear() { fill(val + 1, val + N + 1, -1); } void modify(int p, int l, int r, int x, int v) { if (l == r) { val[p] = max(val[p], v); return; } int mid = (l + r) >> 1; if (x <= mid) { modify((p << 1), l, mid, x, v); } else { modify((p << 1 | 1), mid + 1, r, x, v); } val[p] = max(val[(p << 1)], val[(p << 1 | 1)]); } int query(int p, int l, int r, int x, int y) { if (x == l && r == y) return val[p]; int mid = (l + r) >> 1; if (y <= mid) { return query((p << 1), l, mid, x, y); } else if (x > mid) { return query((p << 1 | 1), mid + 1, r, x, y); } else { return max(query((p << 1), l, mid, x, mid), query((p << 1 | 1), mid + 1, r, mid + 1, y)); } } }; BIT<N> bit; SegmentTree<N> seg; vector<Info> que[N + 5]; void disc() { vector<int> u, v; for (int i = 1; i <= n; i++) { u.push_back(p[i].r); v.push_back(p[i].a); v.push_back(p[i].d); v.push_back(p[i].u); } sort(u.begin(), u.end()); sort(v.begin(), v.end()); u.erase(unique(u.begin(), u.end()), u.end()); v.erase(unique(v.begin(), v.end()), v.end()); for (int i = 1; i <= n; i++) { p[i].r = lower_bound(u.begin(), u.end(), p[i].r) - u.begin() + 1; p[i].a = lower_bound(v.begin(), v.end(), p[i].a) - v.begin() + 1; p[i].d = lower_bound(v.begin(), v.end(), p[i].d) - v.begin() + 1; p[i].u = lower_bound(v.begin(), v.end(), p[i].u) - v.begin() + 1; } } void calc() { sort(p + 1, p + n + 1, [](const People &x, const People &y) { return x.r < y.r; }); bit.clear(); for (int i = 1; i <= n;) { int j = i - 1; for (; j < n && p[j + 1].r == p[i].r; j++, bit.modify(p[j].a, 1)) ; for (int k = i; k <= j; k++) { f[p[k].id] = bit.query(p[k].d, p[k].u); } i = j + 1; } sort(p + 1, p + n + 1, [](const People &x, const People &y) { return x.id < y.id; }); } void solve() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %d , &p[i].r); for (int i = 1; i <= n; i++) { scanf( %d , &p[i].a); p[i].d = p[i].a - k; p[i].u = p[i].a + k; p[i].id = i; } disc(); calc(); for (int i = 1; i <= n; i++) { que[p[i].r].push_back(Info(0, p[i].a, f[i])); } scanf( %d , &m); for (int u, v, i = 1; i <= m; i++) { scanf( %d%d , &u, &v); int l = max(p[u].d, p[v].d); int r = min(p[u].u, p[v].u); if (l > r) { ans[i] = -1; } else { que[max(p[u].r, p[v].r)].push_back(Info(i, l, r)); } } seg.clear(); for (int i = n; i >= 1; i--) { for (const auto &t : que[i]) { if (t.opt == 0) { seg.modify(1, 1, 3 * n, t.l, t.r); } else { ans[t.opt] = seg.query(1, 1, 3 * n, t.l, t.r); } } que[i].clear(); } for (int i = 1; i <= m; i++) printf( %d n , ans[i]); } int main() { solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); if ((n / 2) % 2 == 0) { for (int i = 1; i <= n; ++i) { if (i <= n / 2 && i % 2 == 1) { printf( %d , i + 1); } else if (i <= n / 2 && i % 2 == 0) { printf( %d , n - i + 2); } else if (i > (n + 1) / 2 && i % 2 == n % 2) { printf( %d , i - 1); } else if (i > (n + 1) / 2 && i % 2 != n % 2) { printf( %d , n - i); } else { printf( %d , i); } } printf( n ); } else { printf( -1 n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, K, m; set<pair<int, int> > Set; set<int> SS; int O[524288]; struct Tree { int K[524288 + 524288], M[524288 + 524288]; void UDT(int nd) { M[nd] = max(M[nd * 2], M[nd * 2 + 1]); } void init(int nd, int b, int e) { K[nd] = 0; if (b == e) { M[nd] = b; return; } int m = (b + e) >> 1; init(nd * 2, b, m); init(nd * 2 + 1, m + 1, e); UDT(nd); } void Add2(int nd, int x) { M[nd] += x; K[nd] += x; } void Spread(int nd) { Add2(nd * 2, K[nd]); Add2(nd * 2 + 1, K[nd]); K[nd] = 0; } void Add(int nd, int b, int e, int s, int l, int x) { if (s > l) return; if (s <= b && e <= l) { Add2(nd, x); return; } Spread(nd); int m = (b + e) >> 1; if (s <= m) Add(nd * 2, b, m, s, l, x); if (l > m) Add(nd * 2 + 1, m + 1, e, s, l, x); UDT(nd); } int Max(int nd, int b, int e, int s, int l) { if (s > l) return -99999999; if (s <= b && e <= l) return M[nd]; Spread(nd); int m = (b + e) >> 1, r = -99999999; if (s <= m) r = max(r, Max(nd * 2, b, m, s, l)); if (l > m) r = max(r, Max(nd * 2 + 1, m + 1, e, s, l)); return r; } } T; void Solve() { int i; for (i = 1; i < 524288; i++) O[i] = 1; T.init(1, 0, 524288 - 1); scanf( %d%d%d , &n, &K, &m); for (i = 1; i <= m; i++) { int x, y; scanf( %d%d , &x, &y); int t = abs(x - K) + y; if (Set.find(pair<int, int>(x, y)) != Set.end()) { Set.erase(pair<int, int>(x, y)); O[t]++; if (O[t] == 1) SS.erase(t); T.Add(1, 0, 524288 - 1, t, 524288 - 1, 1); } else { Set.insert(pair<int, int>(x, y)); O[t]--; if (O[t] == 0) SS.insert(t); T.Add(1, 0, 524288 - 1, t, 524288 - 1, -1); } if (SS.empty()) { puts( 0 ); continue; } t = *SS.rbegin(); int t1 = T.Max(1, 0, 524288 - 1, 0, t); int t2 = T.Max(1, 0, 524288 - 1, t, t); printf( %d n , max(t + (t1 - t2) - n, 0)); } } int main() { int TC = 1; while (TC--) { Solve(); } } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; int a[maxn], b[maxn]; bool v[maxn]; int main() { int n; cin >> n; a[0] = -1; for (int i = 1; i <= n; ++i) { cin >> a[i]; v[a[i]] = 1; if (a[i] > a[i - 1]) b[i] = a[i - 1]; else b[i] = -1; } int c = 0; for (int i = 1; i <= n; ++i) { if (b[i] == -1) { while (v[c]) c++; b[i] = c++; } } for (int i = 1; i <= n; ++i) cout << b[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; int isTandom(string s, int n) { if (n > s.size() / 2) return 0; for (int i = 0; i < n; i++) if (s[i + n] != && s[i] != s[i + n]) return 0; return 1; } int main() { string s; int k; cin >> s >> k; int len = s.size(); for (int i = 0; i < k; i++) s += ; for (int i = s.size() / 2; i >= 1; i--) for (int j = 0; j + i < s.size(); j++) if (isTandom((s.substr(j, 2 * i)), i)) { cout << 2 * i << endl; return 0; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, i, x, y; cin >> n; long long a[n], b[n - 1], c[n - 2]; for (i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); for (i = 0; i < n - 1; i++) cin >> b[i]; sort(b, b + (n - 1)); for (i = 0; i < n - 2; i++) cin >> c[i]; sort(c, c + (n - 2)); for (i = 0; i < n; i++) { if (a[i] != b[i]) { x = a[i]; break; } } for (i = 0; i < n - 1; i++) { if (b[i] != c[i]) { y = b[i]; break; } } cout << x << endl; cout << y << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, t, x, c, d, ch = 0, caser = 0, lol = 0, sum = 0, rating = -1, upper = 1e9, lower = -1e9; cin >> n; for (int i = 0; i < n; i++) { cin >> c >> d; if (i == 0) { if (d == 1) lower = 1900; else upper = 1899; } else { if (d == 2) { upper = min(upper, sum + 1899); } else { lower = max(lower, sum + 1900); } } sum -= c; } if (upper == 1e9) cout << Infinity n ; else if (lower > upper) cout << Impossible n ; else cout << upper - sum << endl; } |
#include <bits/stdc++.h> using namespace std; long long f[6][10010], b = 1; int main() { for (int i = 1; i <= 5; ++i) for (int j = 1; j <= (i == 5 ? 1 : 10000); ++j) { long long now = f[i - 1][j]; for (int k = 1; k <= j; ++k) now += f[i - 1][min(now + j + 1, 10000ll)] + 1; f[i][j] = now; } for (int i = 5, d; i >= 1; --i) { long long now = 0; printf( %lld , min(b, 10000ll)); for (int j = 1; j <= min(b, 10000ll); ++j) { now += f[i - 1][min(b + now, 10000ll)]; printf( %lld , b + now); ++now; } printf( n ); fflush(stdout); scanf( %d , &d); if (d == -1) break; else { now = 0; for (int j = 1; j <= d; ++j) now += f[i - 1][min(b + now, 10000ll)] + 1; b += now; } } } |
#include <bits/stdc++.h> using namespace std; bool kjg[100002]; int isi[100002]; long long dp[100002]; vector<int> adlis[100002], radlis[100002]; int rut, nvert, u, v; void ruted(int x) { kjg[x] = 1; for (int i = 0; i < adlis[x].size(); i++) { if (!kjg[adlis[x][i]]) { radlis[x].push_back(adlis[x][i]); ruted(adlis[x][i]); } } } long long rek(int x) { if (radlis[x].size() == 0) { return 0; } else if (dp[x] != -1) { return dp[x]; } else { dp[x] = 0; if (x != rut) { isi[x]--; } int jum = 0; vector<long long> cal; cal.clear(); for (int i = 0; i < radlis[x].size(); i++) { if (isi[radlis[x][i]] <= 1) continue; if (rek(radlis[x][i]) > 0) { cal.push_back(rek(radlis[x][i])); } } for (int i = 0; i < radlis[x].size(); i++) { jum += isi[radlis[x][i]]; } sort(cal.begin(), cal.end()); if (cal.size() > 0) { for (int i = cal.size() - 1; i >= 0; i--) { dp[x] += (long long)cal[i]; dp[x] += 2LL; isi[x]--; if (isi[x] == 0) break; } } if (isi[x] > 0) { if (isi[x] < jum) { dp[x] += 2LL * isi[x]; isi[x] = 0; } else { dp[x] += 2LL * jum; isi[x] -= jum; } } return dp[x]; } } int main() { scanf( %d , &nvert); for (int i = 0; i < nvert; i++) { scanf( %d , &isi[i]); } for (int i = 0; i < nvert - 1; i++) { scanf( %d%d , &u, &v); u--; v--; adlis[u].push_back(v); adlis[v].push_back(u); } scanf( %d , &rut); rut--; memset(kjg, 0, sizeof kjg); ruted(rut); memset(dp, -1, sizeof dp); printf( %I64d n , rek(rut)); return 0; } |
#include <bits/stdc++.h> using namespace std; int n; int main() { cin >> n; if ((n % 2) == 0) cout << home ; else cout << contest ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e6 + 7, M = 1e9 + 7; vector<int> primes; bool isp[N]; void sieve() { fill(isp, isp + N, 1); isp[0] = isp[1] = 0; for (int i = 2; i * i < N; i++) if (isp[i]) for (int j = i * i; j < N; j += i) isp[j] = 0; for (int i = 2; i < N; i++) if (isp[i]) primes.push_back(i); } vector<pair<int, int> > factorize(int x) { vector<pair<int, int> > ans; for (int i : primes) { if (i * i > x) break; int cnt = 0; while (x % i == 0) cnt++, x /= i; if (cnt) ans.push_back(make_pair(i, cnt)); } if (x > 1) ans.push_back(make_pair(x, 1)); return ans; } int main() { ios::sync_with_stdio(0); cin.tie(0); sieve(); int n; cin >> n; long long ans = 1; map<int, int> fac; map<int, int> cnt; vector<vector<pair<int, int> > > factors; int pp[n]; for (int i = 0; i < n; i++) cin >> pp[i]; sort(pp, pp + n); reverse(pp, pp + n); for (int i = 1; i <= n; i++) { int p = pp[i - 1]; if (fac.count(p) == 0) { ans = (ans * p) % M; fac[p] = 1; cnt[p] = 1; vector<pair<int, int> > v; v.push_back(make_pair(p, 1)); factors.push_back(v); } else { vector<pair<int, int> > pf = factorize(p - 1); factors.push_back(pf); for (auto pr : pf) { int p = pr.first; int e = pr.second; int dif = e - fac[p]; if (dif < 0) continue; if (dif == 0) { cnt[p]++; continue; } fac[p] += dif; cnt[p] = 1; for (int i = 0; i < dif; i++) ans = (ans * p) % M; } } } for (auto pf : factors) { bool found = true; for (auto pr : pf) { int p = pr.first; int e = pr.second; int mx = fac[p]; assert(e <= mx); if (e == mx && cnt[p] == 1) { found = false; break; } } if (found) { ans++; break; } } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; vector<int> v[26]; int A[26], m; void solve() { string s; cin >> s; for (int i = 0; i < s.length(); i++) v[s[i] - a ].push_back(i); for (int i = 0; i < 26; i++) { if (s.find(i + a ) != string::npos) { m = v[i][0] + 1; for (int j = 1; j < (int)v[i].size(); j++) m = max(m, v[i][j] - v[i][j - 1]); m = max(m, (int)s.length() - v[i][(int)v[i].size() - 1]); A[i] = m; } } m = INT_MAX; for (int i = 0; i < 26; i++) { if (A[i] != 0) m = min(m, A[i]); } cout << m << n ; } signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 5010, mod = 1LL * 1000 * 1000 * 1000 + 7; long long dp[N][N], inv_fact[N], fact[N], n, k; long long Pow(long long a, long long b) { return b ? (b & 1 ? a : 1) % mod * Pow(a * a % mod, b >> 1) % mod : 1; } int C(int r, int n) { if (r > n) return 0; int num = 1; for (int i = n; i >= n - r + 1; i--) num = 1LL * num * i % mod; num = 1LL * num * inv_fact[r] % mod; return num; } int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); fact[0] = 1; for (int i = 1; i < N; i++) fact[i] = 1LL * fact[i - 1] * i % mod; inv_fact[N - 1] = Pow(fact[N - 1], mod - 2); for (int i = N - 2; i >= 0; i--) inv_fact[i] = 1LL * inv_fact[i + 1] * (i + 1) % mod; for (int i = 1; i < N; i++) dp[1][i] = 1; for (int i = 2; i < N; i++) for (int j = i; j < N; j++) dp[i][j] = 1LL * (dp[i - 1][j - 1] + dp[i][j - 1]) % mod * i % mod; cin >> n >> k; long long ans = 0; for (int r = 1; r <= min(k, n); r++) { long long t = Pow(2, n - r); t = 1LL * t * dp[r][k] % mod; t = 1LL * t * C(r, n) % mod; ans = (1LL * ans + t) % mod; } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, k; int haha[105]; int ans = 0; int main() { scanf( %d%d , &n, &k); for (int i = 0; i < n; i++) { scanf( %d , &haha[i]); if (haha[i] == 0) break; else if (i < k) ans++; else if (haha[i] == haha[k - 1]) ans++; else break; } printf( %d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; priority_queue<pair<long long int, int> > pq; vector<pair<int, int> > vp; map<long long int, int> mp, m; const int N = 1e5 + 6; long long int ans[N]; vector<int> v, v1; set<long long int> s, s1; int visit[N]; struct domingo { int val, left, right; } o[N]; bool used[102]; int main() { int a, b, c, ct = 1; cin >> a >> b >> c; a = a % b; a *= 10; for (int i = 0; i < 1e5 + 5; i++) { int x = a / b; a %= b; if (x == c) return cout << ct, 0; a *= 10; ct++; } cout << -1; } |
#include <bits/stdc++.h> using namespace std; const long long M = 1e9 + 7; const long long N = 1e5 + 10; const long long INF = 1e9 + 7; vector<long long> fact(N), ifact(N); long long gcd(long long x, long long y) { if (y % x == 0) return x; return gcd(y % x, x); } long long inv(long long x) { long long res = 1; long long b = M - 2; while (b) { if (b & 1) res = (res * x) % M; x = (x * x) % M; b >>= 1; } return res; } bool prime[1000006]; void SieveOfEratosthenes(long long n) { for (long long p = 2; p * p <= n; p++) { if (prime[p] == true) { for (long long i = p * p; i <= n; i += p) prime[i] = false; } } } void init() { fact[0] = 1; for (long long i = 1; i < N; i++) fact[i] = (fact[i - 1] * i) % M; ifact[(long long)2e5] = inv(fact[(long long)2e5]); for (long long i = (long long)2e5 - 1; i >= 0; i--) ifact[i] = (ifact[i + 1] * (i + 1)) % M; } long long ncr(long long n, long long r) { if (r > n) return 0; long long res = fact[n]; res = (res * ifact[r]) % M; res = (res * ifact[n - r]) % M; return res; } long long power(long long x, long long y, long long p) { long long res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } long long lowbit(long long x) { for (long long i = 0;; i++) { if (x & (1 << i)) return 1 << i; } } string decimal_to_binary(long long n) { long long t = 0; long long tt = n; while (tt > 0) { t++; tt /= 2; } bitset<32> s = bitset<32>(n); string str = ; for (long long i = 0; i < s.size(); i++) { str += s[i] + 0 ; } reverse(str.begin(), str.end()); return str; } bool checkPrime(long long x) { if (x == 1) { return false; } if (x <= 3) { return true; } long long t = 2; if (x % 2 == 0) { return false; } t = 3; for (t; t <= sqrt(x); t += 2) { if (x % t == 0) { return false; } } return true; } vector<long long> primeDivisor(long long x) { if (x <= 3) { vector<long long> r = {x}; return r; } long long n = floor(sqrt(x)); vector<long long> res; for (long long i = 2; i <= n; i++) { if (x % i == 0) { res.push_back(i); } while (x % i == 0) { x = x / i; } if (x < 2) { break; } } if (x > 2) { res.push_back(x); } return res; } struct comp { bool operator()(const pair<long long, long long> &x, const pair<long long, long long> &y) { return x.first < y.first; } }; void solve() { int a, b, c; cin >> a >> b >> c; int ans = 0; if (a) { a--; ans++; } if (b) { b--; ans++; } if (c) { c--; ans++; } if (c == 1) { if (a && b) { a--; b--; ans++; } if (a && c) { a--; c--; ans++; } if (b && c) { b--; c--; ans++; } } else { if (a && c) { a--; c--; ans++; } if (b && c) { b--; c--; ans++; } if (a && b) { a--; b--; ans++; } } if (a && b && c) { a--; b--; c--; ans++; } cout << ans << endl; return; } signed main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); long long t = 1; cin >> t; while (t--) { solve(); } return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.