func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; namespace Elaina { template <class T> inline T Max(const T x, const T y) { return x < y ? y : x; } template <class T> inline T Min(const T x, const T y) { return x < y ? x : y; } template <class T> inline T fab(const T x) { return x < 0 ? -x : x; } template <class T> inline void getMax(T& x, const T y) { x = Max(x, y); } template <class T> inline void getMin(T& x, const T y) { x = Min(x, y); } template <class T> T gcd(const T x, const T y) { return y ? gcd(y, x % y) : x; } template <class T> inline T readin(T x) { x = 0; int f = 0; char c; while ((c = getchar()) < 0 || 9 < c) if (c == - ) f = 1; for (x = (c ^ 48); 0 <= (c = getchar()) && c <= 9 ; x = (x << 1) + (x << 3) + (c ^ 48)) ; return f ? -x : x; } template <class T> void fwrit(const T x) { if (x < 0) return putchar( - ), fwrit(-x); if (x > 9) fwrit(x / 10); putchar(x % 10 ^ 48); } } // namespace Elaina using namespace Elaina; const int maxn = 3e5; const int jzm = 1000000007; char fuck[maxn + 5]; int min_len; char s[maxn + 5]; int n; int tot[maxn + 5][4]; int sy = 0; int ans[maxn + 5]; inline void addchar(const char c, const int i) { ++n; s[n] = c, ++tot[n][i]; } inline void init() { min_len = (1 << 30); for (int id = 1, id_end_ = 3; id <= id_end_; ++id) { scanf( %s , fuck + 1); int len = strlen(fuck + 1); for (int i = 1, i_end_ = len; i <= i_end_; ++i) addchar(fuck[i], id); addchar( z + id, 0); min_len = Min(min_len, len); } --n; } int sa[maxn + 5], x[maxn * 2 + 5], y[maxn * 2 + 5], c[maxn + 5], lev; inline void getsa() { lev = z + 3; for (int i = 1, i_end_ = n; i <= i_end_; ++i) ++c[x[i] = s[i]]; for (int i = 2, i_end_ = lev; i <= i_end_; ++i) c[i] += c[i - 1]; for (int i = n, i_end_ = 1; i >= i_end_; --i) sa[c[x[i]]--] = i; for (int k = 1; k <= n; k <<= 1) { int sz = 0; for (int i = n - k + 1, i_end_ = n; i <= i_end_; ++i) y[++sz] = i; for (int i = 1, i_end_ = n; i <= i_end_; ++i) if (sa[i] > k) y[++sz] = sa[i] - k; for (int i = 1, i_end_ = lev; i <= i_end_; ++i) c[i] = 0; for (int i = 1, i_end_ = n; i <= i_end_; ++i) ++c[x[i]]; for (int i = 2, i_end_ = lev; i <= i_end_; ++i) c[i] += c[i - 1]; for (int i = n, i_end_ = 1; i >= i_end_; --i) sa[c[x[y[i]]]--] = y[i], y[i] = 0; swap(x, y); x[sa[1]] = 1; int level = 1; for (int i = 2, i_end_ = n; i <= i_end_; ++i) x[sa[i]] = (y[sa[i]] == y[sa[i - 1]] && y[sa[i] + k] == y[sa[i - 1] + k]) ? level : ++level; if (level == n) break; lev = level; } } int heit[maxn + 5], rk[maxn + 5]; inline void getheit() { int h = 0; for (int i = 1, i_end_ = n; i <= i_end_; ++i) rk[sa[i]] = i; for (int i = 1, i_end_ = n; i <= i_end_; ++i) { if (rk[i] == 1) continue; if (h) --h; int j = sa[rk[i] - 1]; while (i + h <= n && j + h <= n && s[i + h] == s[j + h]) ++h; heit[rk[i]] = h; } } struct node { int x, v; inline int operator<(const node rhs) const { return v > rhs.v; } } v[maxn + 5 + 5]; int fa[maxn + 5]; int find(const int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); } int cock(const int x) { return 1ll * tot[x][1] * tot[x][2] % jzm * tot[x][3] % jzm; } inline void merge(int x, int y) { x = find(x), y = find(y); if (x == y) return; sy -= cock(x); if (sy < 0) sy += jzm; sy -= cock(y); if (sy < 0) sy += jzm; fa[x] = y; for (int j = 1, j_end_ = 3; j <= j_end_; ++j) tot[y][j] += tot[x][j]; sy += cock(y); if (sy >= jzm) sy -= jzm; } inline void solve() { for (int i = 1, i_end_ = n; i <= i_end_; ++i) v[i] = node{sa[i], heit[i]}; for (int i = 1, i_end_ = n; i <= i_end_; ++i) fa[i] = i; sort(v + 1, v + n + 1); int now = 1; for (int i = min_len, i_end_ = 1; i >= i_end_; --i) { while (now <= n && v[now].v >= i) { int pre = sa[rk[v[now].x] - 1]; merge(pre, v[now].x); ++now; } ans[i] = sy; } for (int i = 1, i_end_ = min_len; i <= i_end_; ++i) printf( %d , ans[i]); } signed main() { init(); getsa(); getheit(); solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int inf = 1000000007; const long double eps = 1e-9; const long double pi = 3.141592653589793; const long double e = 2.718281828459045; int dp[100005], h[100005]; int n, mmm; int main() { memset(dp, -1, sizeof(dp)); memset(h, 0, sizeof(h)); mmm = 0; scanf( %d , &n); dp[0] = 0; dp[n + 1] = 0; for (int i = 1; i <= n; i++) { scanf( %d , &h[i]); } for (int i = 1; i <= n; i++) { dp[i] = min(dp[i - 1] + 1, h[i]); } for (int i = n; i >= 1; i--) { dp[i] = min(dp[i], dp[i + 1] + 1); mmm = max(mmm, dp[i]); } cout << mmm << endl; return 0; }
|
//THINK ALOUD !! #include <bits/stdc++.h> #define debug(x) cout << -> [ << #x << = << x << ] n #define debug2(x, y) cout << -> [ << #x << = << x << , << #y << = << y << ] n #define debug3(x, y, z) cout << -> [ << #x << = << x << , << #y << = << y << , << #z << = << z << ] n ; #define debug4(x, y, z, xx) cout << -> [ << #x << = << x << , << #y << = << y << , << #z << = << z << , << #xx << = << xx << ] n ; using namespace std; using ll=long long int; using lld=long double; #define mp make_pair #define pb push_back #define accu accumulate #define pll pair<ll, ll> #define pii pair<int, int> #define pci pair<char, int> #define pic pair<int, char> #define pls pair<ll, string> #define psl pair<string, ll> #define pis pair<int, string> #define psi paid<string, int> // #define x first // #define y second #define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); #define rep(i, a, n) for (ll i = a; i < n; i++) #define per(i, a, n) for (ll i = n-1; i >= a; i--) #define repp(i, a, n, p) for (ll i = a; i < n; i += p) #define all(c) (c).begin(), (c).end() #define lla(c) (c).rbegin(), (c).rend() #define print_arr(arr, n) for (int i = 0; i < n; i++) std::cout << arr[i] << ; std::cout << n ; #define mod 1000000007 #define primeSize 2000000 #define Size 1e6 template <typename t> inline void print(const t & v) { for (const auto& i : v) { std::cout << i << ; } std::cout << n ; } template <typename t> inline void printt(const t & v) { for (const auto& i : v) { std::cout << i.first << << i.second << n ; } std::cout << n ; } template <typename INT> INT GCD(INT a, INT b) { // if (b == 0) return a; // return gcd(b, a%b); return b ? gcd(b, a%b) : a; } template <typename INT> INT LCM(INT a, INT b) { return a / gcd(a, b) * b; } template <typename INT> std::map<INT, int> factorize(INT n) { map<INT, int> mp; for (INT i = 2; i * i <= n; i++) { while (n % i == 0) { n /= i; mp[i] ++; } } if (n > 1) mp[n] += 1; return mp; } ll bin_pow(ll a, ll b) { if (b == 0) return 1; long long res = bin_pow(a, b / 2); if (b % 2) return res * res * a; else return res * res; } int totalDigits(ll i) { return i > 0 ? (int) log10 ((double) i) + 1 : 1; } vector<bool> isPrime(primeSize, true); vector<int> arePrimes; void make_seive() { isPrime[0] = false; isPrime[1] = false; for (int i = 2; i <= sqrt(primeSize); i++) { if (isPrime[i]) { for (int j = i * 2; j <= primeSize; j += i) { isPrime[j] = false; } } } for (int i = 2; i < primeSize; i++) { if (isPrime[i]) { arePrimes.push_back(i); } } } void solve() { int n; cin >> n; vector<ll> X; vector<ll> Y; for (int i = 0; i < 2 * n; i++) { int a, b; cin >> a >> b; a = abs(a); b = abs(b); if (a == 0) X.push_back(b); else Y.push_back(a); } sort(all(X)); sort(lla(Y)); lld ans = 0; lld ans2 = 0; for (int i = 0; i < n; i++) ans += sqrt(X[i]*X[i] + Y[i]*Y[i]); sort(all(Y)); for (int i = 0; i < n; i++) ans2 += sqrt(X[i]*X[i] + Y[i]*Y[i]); lld final_ans = 0; final_ans = min(ans, ans2); cout << setprecision(20) << final_ans << n ; } int main() { fast; int t = 1; //make_seive(); cin >> t; while (t--) solve(); } /* Tips: -- for queries involving sum using queue or minimum sum of size k, do also consider prefix sum. */ /* Build and running g++ --std=c++17 -Wall -Wextra -Wshadow -fsanitize=undefined -fsanitize=address FILE.cpp && ./a.out < in Naming -for types (class/struct name) UpperCamelCase: Point, Info, SegTree -functions and variable lowerCamelCase: someMethod, someVariable -MACROS and constants all capital letters separated by _ : SOME_MACRO, MAX_N, MOD */
|
#include <bits/stdc++.h> using namespace std; const int inft = 1000000009; const int MAXN = 1000006; int n, T[MAXN], A[MAXN], B[MAXN]; int main() { scanf( %d , &n); for (int i = 0; i < (n); ++i) scanf( %d , &T[i]); A[0] = 1; for (int i = 1; i < n; ++i) A[i] = min(A[i - 1] + 1, T[i]); B[n - 1] = 1; for (int i = n - 2; i >= 0; --i) B[i] = min(B[i + 1] + 1, T[i]); int ret = 0; for (int i = 0; i < (n); ++i) ret = max(ret, min(A[i], B[i])); printf( %d n , ret); return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T> T mymax(T a, T b) { return a > b ? a : b; } template <class T> T mymin(T a, T b) { return a < b ? a : b; } int main() { int n; int a[1001]; int s[1001] = {0}, sz, ymax = -1; int i, j, k; cin >> n; for (i = 1; i <= n; i++) { cin >> a[i]; s[i] = a[i] + s[i - 1]; } sz = s[n] + 1; char M[2002][sz]; for (j = 2001; j >= 1; j--) { for (i = 0; i <= sz - 1; i++) { M[j][i] = ; } } int x = 1, y = 1000; for (i = 1; i <= n; i++) { j = a[i]; int al; if (i % 2 == 1) { for (al = 1; al <= j; al++) { M[y][x] = / ; x++; y++; } y--; } else { for (al = 1; al <= j; al++) { M[y][x] = ; x++; y--; } y++; } } for (j = 2001; j >= 1; j--) { int f = 0; for (i = 1; i <= s[n]; i++) { if (M[j][i] != ) f = 1; } if (f) { for (i = 1; i <= s[n]; i++) { cout << M[j][i]; } cout << n ; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long K = 1000000000000000000; map<int, int> M; int q, mn, w[600005], nxt[600005], Q[600005], anc[600005], r; char opt[5], s[600005]; long long ans0, ans, g, ansx, ansy; int mask((1 << 30) - 1); int calc(int x) { return w[Q[lower_bound(Q + 1, Q + r + 1, x) - Q]]; } int main() { mn = 1 << 30; scanf( %d , &q); int j(0); for (int i = 1; i <= q; ++i) { scanf( %s%d , opt, &w[i]); s[i] = (ansy + opt[0] - a ) % 26 + a ; w[i] ^= (ansx & mask); mn = min(mn, w[i]); if (i == 1) { printf( %lld n , ans = w[i]); ansx = ans & mask; ansy = w[i] % 26; while (r && w[Q[r]] >= w[i]) --r; Q[++r] = i; continue; } while (j && s[j + 1] != s[i]) j = nxt[j]; if (s[j + 1] == s[i]) ++j; nxt[i] = j; if (s[i] == s[nxt[i - 1] + 1]) anc[i - 1] = anc[nxt[i - 1]]; else anc[i - 1] = nxt[i - 1]; for (int j = (s[i - 1] == s[1] ? i - 1 : nxt[i - 1]); j;) { if (s[j + 1] == s[i]) j = anc[j]; else { int o(calc(i - j)); g -= o; map<int, int>::iterator it = M.lower_bound(o); assert(it != M.end()); --it->second; if (!it->second) M.erase(it); j = nxt[j]; } } while (r && w[Q[r]] >= w[i]) --r; Q[++r] = i; int cnt(s[i] == s[1]); map<int, int>::iterator it = M.lower_bound(w[i]); while (it != M.end()) { g -= (long long)it->first * it->second; cnt += it->second; M.erase(it); it = M.lower_bound(w[i]); } g += (long long)cnt * w[i]; M.insert(make_pair(w[i], cnt)); ans += g, ans += mn; if (ans >= K) ++ans0, ans -= K; ansx = (ansx + g + mn) & mask; ansy = (ansy + g + mn) % 26; if (!ans0) printf( %lld n , ans); else { cout << ans0 << setw(18) << setfill( 0 ) << ans << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; long double chance[100005]; int main() { int n, p; while (cin >> n >> p) { memset(chance, 0, sizeof chance); long double tmp; for (int i = 0; i < n; i++) { int a, b; cin >> a >> b; int tem = b / p - (a - 1) / p; tmp = (long double)tem / (b - a + 1); chance[i] = tmp; } long double ans = 0; for (int i = 1; i < n; i++) { ans += chance[i] + chance[i - 1] - chance[i] * chance[i - 1]; } ans += chance[0] + chance[n - 1] - chance[n - 1] * chance[0]; cout << fixed << setprecision(10) << ans * 2000.0 << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const int _inf = 0xc0c0c0c0; const long long INF = 0x3f3f3f3f3f3f3f3f; const long long _INF = 0xc0c0c0c0c0c0c0c0; const long long mod = (int)1e9 + 7; const int N = 4e5 + 100; int n, m; vector<int> vc[N]; int to[N]; multiset<int> st; void Ac() { for (int i = 1, v; i <= n; ++i) { scanf( %d , &v); to[v] = i; } st.insert(n + 1); for (int i = 1, u, v; i <= m; ++i) { scanf( %d%d , &u, &v); u = to[u]; v = to[v]; if (u > v) swap(u, v); vc[u].push_back(v); st.insert(v); } long long ans = 0; for (int i = 1; i <= n; ++i) { ans += (*st.begin()) - i; for (int v : vc[i]) { st.erase(st.lower_bound(v)); } } printf( %I64d n , ans); } int main() { while (~scanf( %d%d , &n, &m)) { Ac(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; map<long long, long long>::iterator itr; void c_p_c() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int32_t main() { c_p_c(); long long t; cin >> t; while (t--) { long long num, k; cin >> num >> k; vector<long long> v; vector<long long> v1; for (long long i = 0; i < num; i++) { long long x; cin >> x; v.push_back(x); } for (long long i = 0; i < num; i++) { long long x; cin >> x; v1.push_back(x); } sort(v.begin(), v.end()); sort(v1.begin(), v1.end(), greater<long long>()); long long sum = 0; for (long long i = 0; i < k; i++) { if (v1[i] > v[i]) sum += v1[i]; else sum += v[i]; } for (long long i = k; i < num; i++) { sum += v[i]; } cout << sum << endl; } }
|
#include <bits/stdc++.h> using namespace std; const long long INF = 1e9 + 7; const int N = 3e5 + 10; vector<pair<int, int>> vp[N]; vector<int> v[N]; int pos[N]; int deg[N]; int vis[N]; vector<int> ans; void dfs(int x, int p = 0, int o = 0) { if (vis[x]) return; v[p].push_back(x); vis[x] = 1; pos[x] = o; for (auto &pp : vp[x]) { int y, oo; tie(y, oo) = pp; dfs(y, x, oo); } } int solve(int x) { int cur = deg[x]; for (auto &y : v[x]) { cur ^= solve(y); } if (cur) ans.push_back(pos[x]); return cur; } int main() { int n, m; cin >> n >> m; int cnt1 = 0, cnt_1 = 0; for (int i = 1; i <= n; i++) { cin >> deg[i]; if (deg[i] == 1) cnt1 ^= 1; if (deg[i] == -1) cnt_1++; } if (cnt1 == 1 && cnt_1 == 0) { puts( -1 ); return 0; } for (int i = 1; i <= n; i++) { if (deg[i] == -1) { deg[i] = cnt1; cnt1 = 0; } } for (int i = 1; i <= m; i++) { int x, y; cin >> x >> y; vp[x].push_back({y, i}); vp[y].push_back({x, i}); } dfs(1); solve(1); printf( %d n , ans.size()); for (auto &x : ans) printf( %d n , x); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { string pal, pal2; int x = 0; bool b1 = false; cin >> pal; for (int i = 0; i < pal.size(); i++) { if (pal[i] == W and pal[i + 1] == U and pal[i + 2] == B ) { i += 2; if (b1 == true) { pal2 += ; b1 = false; } } else { b1 = true; pal2 += pal[i]; } } cout << pal2; return 0; }
|
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) x = (x << 3) + (x << 1) + (c ^ 0 ), c = getchar(); return x * f; } const int N = 2e5 + 5; int d, n, m; struct node { int x, p; } a[N]; inline int operator<(const node x, const node y) { if (x.p == y.p) return x.x > y.x; return x.p > y.p; } inline int cmp(node x, node y) { return x.x < y.x; } priority_queue<node> q; long long ans; int main() { d = read(), n = read(), m = read(); for (int i = 1; i <= m; i++) a[i] = {read(), read()}; sort(a + 1, a + m + 1, cmp); int t = n, j = 1; while (t < d) { while (j <= m && a[j].x <= t) q.push(a[j++]); while (!q.empty() && q.top().x + n <= t) q.pop(); if (q.empty()) return puts( -1 ), 0; int x = q.top().x, p = q.top().p; int nxt = min(d, x + n); if (j <= m && nxt >= a[j].x) nxt = a[j].x; ans += 1ll * p * (nxt - t); t = nxt; } printf( %lld n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long nMod = 1e9 + 7; inline long long GCD(long long a, long long b) { while (b != 0) { long long c = a % b; a = b; b = c; } return a; }; inline long long LCM(long long a, long long b) { return (a / GCD(a, b)) * b; }; void vietnakid() { int TC; cin >> TC; while (TC--) { int n; string s; cin >> n; cin >> s; int fm = n, lr = 0; for (int i = 0; i < n; i++) { if (s[i] == > ) { fm = min(fm, i); } else { lr = max(lr, i); } } cout << min(fm, n - lr - 1) << n ; } } int main() { ios_base::sync_with_stdio(false); cin.tie(); vietnakid(); cerr << nTime elapsed: << 1000 * clock() / CLOCKS_PER_SEC << ms n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; struct node { long long int word, prefix; node *child[2]; node() { word = prefix = 0; child[0] = child[1] = NULL; } }; void insert(node *root, long long int x, long long int bit) { root->prefix += 1; if (bit < 0) { root->word += 1; return; } bool b = (x & (1 << bit)); if (root->child[b] == NULL) { root->child[b] = new node(); } insert(root->child[b], x, bit - 1); } node *deleteit(node *root, long long int x, long long int bit) { if (root == NULL) { return NULL; } root->prefix -= 1; if (bit < 0) { root->word -= 1; if (root->word == 0 && root->prefix == 0) { delete root; return NULL; } return root; } bool b = (x & (1 << bit)); root->child[b] = deleteit(root->child[b], x, bit - 1); if (root->word == 0 && root->prefix == 0) { delete root; return NULL; } return root; } long long int query(node *root, long long int x, long long int k, long long int bit, long long int ans) { if (bit < 0 || root == NULL) { return ans; } bool a = (x & (1 << bit)), a_complement = (!a); bool b = (k & (1 << bit)), b_complement = (!b); if (b == true) { if (root->child[a] != NULL) { ans += root->child[a]->prefix; } return query(root->child[a_complement], x, k, bit - 1, ans); } else { return query(root->child[a], x, k, bit - 1, ans); } return ans; } int main() { ios::sync_with_stdio(0); cin.tie(0); node *root = new node; long long int q, x, y, t; cin >> q; for (long long int i = 0; i < q; i++) { cin >> t >> x; if (t == 1) { insert(root, x, 31); } else if (t == 2) { root = deleteit(root, x, 31); if (root == NULL) { root = new node; } } else { cin >> y; cout << query(root, x, y, 31, 0) << n ; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int a, b, n; cin >> a >> b >> n; bool exist(false); for (int i = 0; i < 10; i++) { if ((a * 10 + i) % b == 0) { cout << a * 10 + i; string s(n - 1, 0 ); cout << s << endl; exist = true; break; } } if (!exist) cout << -1 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; bool vis[100010]; int pr[100010], e; void Shai() { vis[1] = true; for (long long i = 2; i <= 1000ll; i++) { if (!vis[i]) { pr[++e] = i; for (long long j = i * i; j <= 1000ll; j += i) { vis[j] = true; } } } } int n, cnta[100010]; int main() { Shai(); int x, y; scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d%d , &x, &y); int X = x; for (int j = 1; j <= e; ++j) { if (X % pr[j] == 0) { while (X % pr[j] == 0) { X /= pr[j]; ++cnta[j]; } } } bool lose = 0; for (int j = 1; j <= e; ++j) { int cntb = 0; if (y % pr[j] == 0) { while (y % pr[j] == 0) { y /= pr[j]; ++cntb; } } if ((cnta[j] + cntb) % 3 != 0) { lose = 1; break; } else if (min(cnta[j], cntb) * 2 < max(cnta[j], cntb)) { lose = 1; break; } } if (!(X == 1 && y == 1) && !((long long)min(X, y) * (long long)min(X, y) == (long long)max(X, y))) { lose = 1; } for (int j = 1; j <= e; ++j) { cnta[j] = 0; } if (!lose) puts( Yes ); else puts( No ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; ifstream in( test.in ); ofstream out( test.out ); const int DIM = 2e3 + 1; const int INF = 1e9 + 7; int dp[DIM]; set<int> mst; deque<int> que; vector<int> edg[DIM]; int main() { ios::sync_with_stdio(false); cin.tie(); cout.tie(); int k, n; cin >> k >> n; for (int i = 1; i <= n; i++) { int x; cin >> x; mst.insert(x - k); } for (int x : mst) { for (int i = 0; i < DIM; i++) { if (i + x > -1 && i + x < DIM) edg[i].push_back(i + x); } } fill(dp, dp + DIM, INF); dp[DIM / 2] = 0; que.push_back(DIM / 2); int ans = INF; for (; que.empty() == false; que.pop_front()) { int x = que.front(); for (int y : edg[x]) { if (dp[y] == INF) dp[y] = dp[x] + 1, que.push_back(y); else if (y == DIM / 2) ans = min(ans, dp[x] + 1); } } cout << (ans == INF ? -1 : ans) << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int N = 1e6 + 4; bool isPrime(int n) { if (n <= 1) return false; if (n <= 3) return true; if (n % 2 == 0 || n % 3 == 0) return false; for (int i = 5; i * i <= n; i = i + 6) if (n % i == 0 || n % (i + 2) == 0) return false; return true; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long test = 1; cin >> test; for (int qw = 1; qw <= test; qw++) { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; int sum = 0; for (int i = 0; i < n; i++) sum += a[i]; if (!isPrime(sum)) { cout << n << endl; for (int i = 1; i <= n; i++) cout << i << ; cout << endl; } else { int flag = 0; for (int i = 0; i < n; i++) { if (!isPrime(sum - a[i])) { cout << n - 1 << endl; flag = 1; for (int j = 0; j < n; j++) { if (i != j) cout << j + 1 << ; } cout << endl; } if (flag == 1) break; } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; t = 1; while (t--) { int n, m, i, j; cin >> n >> m; int a[n + 2][m + 2]; int ii = -1, jj = -1; for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { cin >> a[i][j]; if (a[i][j] > 0) ii = i; jj = j; } } if (ii == -1) cout << jj << endl; else { for (i = ii; i >= 0; i--) { for (j = jj; j >= 0; j--) { int mn = 9000; if (a[i][j] == 0) { if ((i + 1) < n) mn = min(mn, a[i + 1][j]); if ((j + 1) < m) mn = min(mn, a[i][j + 1]); a[i][j] = mn - 1; } } } int sum = 0, in = 1; for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { sum += a[i][j]; if (i < n - 1 && j < m) if (a[i + 1][j] <= a[i][j]) in = 0; if (j < m - 1 && i < n) if (a[i][j + 1] <= a[i][j]) in = 0; } } if (in == 1) cout << sum << endl; else cout << -1 << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } long long a, b, x, y; long long best, ansp, ansq; int main() { while (cin >> a >> b >> x >> y) { long long gg = gcd(x, y); x /= gg; y /= gg; best = -1; long long maxr = min(a / x, b / y); if (maxr <= 0) cout << 0 << << 0 << endl; else cout << x * maxr << << y * maxr << endl; } }
|
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int maxn = 2e5 + 10; int n, k; long long fac[maxn + 10], afac[maxn + 10]; long long qpow(long long a, long long b) { long long ret = 1LL; while (b) { if (b & 1) ret = ret * a % mod; a = a * a % mod; b >>= 1; } return ret; } long long inv(long long x) { return qpow(x, mod - 2); } void Pre() { fac[0] = 1LL; for (int i = 1; i <= maxn; i++) fac[i] = fac[i - 1] * (long long)i % mod; afac[maxn] = inv(fac[maxn]); for (int i = maxn; i >= 1; --i) afac[i - 1] = afac[i] * i % mod; } long long C(long long n, long long m) { if (m > n) return 0; return fac[n] * afac[n - m] % mod * afac[m] % mod; } void solve() { vector<pair<int, int> > h; int l, r; for (int i = 1; i <= n; i++) { scanf( %d %d , &l, &r); h.push_back(make_pair(l - 1, 1)); h.push_back(make_pair(r, -1)); } sort(h.begin(), h.end()); long long cnt = 0LL, ans = 0LL; int pos = h[0].first; for (int i = 0; i < h.size(); i++) { long long tmp = C(cnt, k) * (h[i].first - pos) % mod; ans = (ans + tmp) % mod; cnt += 1LL * h[i].second; pos = h[i].first; } printf( %I64d n , ans); } int main() { Pre(); while (scanf( %d %d , &n, &k) != EOF) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 100005; const int INF = 0x3f3f3f3f; char tmp[20][20]; char raw[MAXN]; long long n, m, T, k; bool check(int l, int r) { for (int i = 1; i <= n; i++) { if (r - l + 1 < strlen(tmp[i])) continue; else { int cur_len = strlen(tmp[i]); bool flg = true; for (int j = 0; j < cur_len; j++) { if (tmp[i][cur_len - j - 1] == raw[r - j]) continue; else { flg = false; continue; } } if (flg) return false; } } return true; } int main() { scanf( %s , raw); int l = 0, r = 0, res_len = 0, res_pos = 0; scanf( %I64d , &n); for (int i = 1; i <= n; i++) scanf( %s , tmp[i]); while (r < strlen(raw)) { while (l <= r) { if (check(l, r)) { if (r - l + 1 > res_len) { res_len = r - l + 1; res_pos = l; } break; } l++; } r++; } cout << res_len << << res_pos << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int read() { int tot = 0, fh = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) fh = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { tot = tot * 10 + c - 0 ; c = getchar(); } return tot * fh; } int n, cnt, a[20000], ha[20000], b[20000], c[20000], ans, f[200][20000]; int main() { n = read(); for (int i = 1; i <= n; i++) a[i] = read(); sort(a + 1, a + n + 1); for (int i = 1; i <= n; i++) ha[a[i]]++; for (int i = 1; i <= 100; i++) if (ha[i]) { b[++cnt] = ha[i]; c[cnt] = i; } if (cnt == 1 || cnt == 2) cout << n << n ; else { for (int i = 1; i <= cnt; i++) { if (b[i] <= ans) continue; for (int j = 1; j <= 10000; j++) for (int k = 1; k <= 100; k++) f[k][j] = 0; f[0][0] = 1; for (int j = 1; j <= n; j++) if (a[j] != c[i]) { for (int k = j - 1; k >= 0; k--) for (int p = 10000 - a[j]; p >= 0; p--) if (f[k][p]) f[k + 1][p + a[j]] = 1; } for (int j = b[i]; j > ans && j >= 1; j--) { bool flag = true; for (int k = 0; k < j; k++) if (f[j - k][j * c[i] - k * c[i]] == 1) flag = false; if (flag) ans = j; } } cout << ans << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m; bool flag[21][21]; int deg[21], id[21]; vector<int> G[21]; inline int cmp(int x, int y) { return deg[x] != deg[y] ? deg[x] < deg[y] : x < y; } bool vis[21]; inline void dfs(int np) { vis[np] = 1; for (int &x : G[np]) { if (!vis[x]) { dfs(x); return; } } } int main() { scanf( %d%d , &n, &m); for (int i = 1, ti, tj; i <= m; i++) { scanf( %d%d , &ti, &tj); if (ti != tj) flag[ti][tj] = flag[tj][ti] = 1; } for (int i = 1; i <= n; i++) { id[i] = i; for (int j = 1; j <= n; j++) { if (flag[i][j]) deg[i]++, G[i].push_back(j); } } for (int i = 1; i <= n; i++) sort(G[i].begin(), G[i].end(), cmp); for (int i = 1; i <= n; i++) { memset(vis, 0, sizeof(vis)); dfs(i); int cnt = 0; for (int j = 1; j <= n; j++) cnt += vis[j]; if (cnt == n) { puts( Yes ); return 0; } } puts( No ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 300300; int a[maxn]; set<int> st; int MIN(int x, int y) { return x < y ? x : y; } int MAX(int x, int y) { return x > y ? x : y; } int main(void) { st.clear(); int n, i, j, mi, mx, fg = 0, x; scanf( %d , &n); for (i = 1; i <= n - 1; i++) { scanf( %d , &a[i]); if (i == 1) { mx = mi = a[i]; } else { a[i] = a[i] + a[i - 1]; mx = MAX(mx, a[i]); mi = MIN(mi, a[i]); } if (!st.count(a[i])) { st.insert(a[i]); } else fg = 1; if (a[i] == 0) fg = 1; } if (fg) { printf( -1 n ); return 0; } for (i = 1; i <= n; i++) if (i + mx >= 1 && i + mx <= n && i + mi >= 1 && i + mi <= n) { fg = 1; x = i; break; } if (fg == 0) { printf( -1 n ); } else { printf( %d , x); for (i = 1; i <= n - 1; i++) { printf( %d , x + a[i]); } printf( n ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = (int)1e8; const int N = 500; int n; int ans; int a[N]; set<int> p; int m; int b[N][2]; struct Edge { int to, cap, flow; Edge() : to(), cap(), flow() {} Edge(int _to, int _cap) : to(_to), cap(_cap), flow(0) {} }; int sz; Edge ed[2 * N]; vector<int> g[N]; int S, T; void fact(int x) { for (int i = 2; i * i <= x; i++) { if (x % i != 0) continue; p.insert(i); while (x % i == 0) x /= i; } if (x != 1) p.insert(x); return; } void addEdge(int v, int to, int cap) { ed[sz] = Edge(to, cap); g[v].push_back(sz++); ed[sz] = Edge(v, 0); g[to].push_back(sz++); return; } int q[N]; int qSz; int d[N]; bool bfs(int S, int T, int n) { for (int i = 0; i < n; i++) d[i] = INF; d[S] = 0; qSz = 1; q[0] = S; for (int k = 0; k < qSz; k++) { int v = q[k]; for (int i = 0; i < (int)g[v].size(); i++) { Edge e = ed[g[v][i]]; if (e.flow == e.cap) continue; int to = e.to; if (d[to] <= d[v] + 1) continue; d[to] = d[v] + 1; q[qSz++] = to; } } return (d[T] < INF); } int idx[N]; int dfs(int v, int T, int pushFlow) { int res = 0; if (v == T || pushFlow == 0) return pushFlow; for (; idx[v] < (int)g[v].size(); idx[v]++) { int id = g[v][idx[v]]; Edge e = ed[id]; int to = e.to; if (d[to] != d[v] + 1) continue; int deltaFlow = dfs(to, T, min(pushFlow, e.cap - e.flow)); pushFlow -= deltaFlow; res += deltaFlow; ed[id].flow += deltaFlow; ed[id ^ 1].flow -= deltaFlow; if (pushFlow == 0) break; } return res; } int flow(int S, int T, int n) { int res = 0; while (bfs(S, T, n)) { for (int i = 0; i < n; i++) idx[i] = 0; res += dfs(S, T, INF); } return res; } int solve(int q) { for (int i = 0; i < n + 2; i++) g[i].clear(); sz = 0; for (int i = 0; i < n; i++) { int c = 0; int t = a[i]; while (t % q == 0) { t /= q; c++; } if (i % 2 == 0) addEdge(S, i, c); else addEdge(i, T, c); } for (int i = 0; i < m; i++) addEdge(b[i][0], b[i][1], INF); return flow(S, T, n + 2); } int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) scanf( %d , &a[i]); for (int i = 0; i < n; i++) fact(a[i]); for (int i = 0; i < m; i++) for (int j = 0; j < 2; j++) { scanf( %d , &b[i][j]); b[i][j]--; } for (int i = 0; i < m; i++) { if (b[i][0] % 2 == 1) swap(b[i][0], b[i][1]); } S = n; T = n + 1; for (auto it = p.begin(); it != p.end(); it++) ans += solve(*it); printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int p[200007]; int c1[200007]; int c2[200007]; bool used[200007]; int main() { int n; cin >> n; for (int i = 0; i < n; ++i) { scanf( %d , &p[i]); } for (int i = 0; i < n; ++i) { scanf( %d , &c1[i]); c1[i]--; } for (int i = 0; i < n; ++i) { scanf( %d , &c2[i]); c2[i]--; } priority_queue<pair<int, int>> q[3]; for (int i = 0; i < n; ++i) { if (c1[i] == c2[i]) { q[c1[i]].push(make_pair(-p[i], i)); } else { q[c1[i]].push(make_pair(-p[i], i)); q[c2[i]].push(make_pair(-p[i], i)); } } int m, x; cin >> m; for (int i = 0; i < m; ++i) { scanf( %d , &x); x--; while (!q[x].empty() && used[q[x].top().second]) q[x].pop(); if (q[x].empty()) printf( -1 ); else { printf( %d , -q[x].top().first); used[q[x].top().second] = 1; q[x].pop(); } } }
|
#include <bits/stdc++.h> using namespace std; long long dp[64][64][64][64]; double fact[64]; int main() { int n, a[64], p, s = 0; cin >> n; for (int i = 0; i < n; ++i) { cin >> a[i]; s += a[i]; } cin >> p; if (s <= p) { printf( %.9f n , (double)n); return 0; } fact[0] = 1; for (int i = 1; i < 64; ++i) { fact[i] = fact[i - 1] * i; } for (int ignore = 0; ignore < n; ++ignore) { dp[ignore][0][0][0] = 1; for (int i = 0; i < n; ++i) { for (int j = 0; j <= i; ++j) { for (int k = 0; k <= p; ++k) { if (i != ignore && k + a[i] <= p) { dp[ignore][i + 1][j + 1][k + a[i]] += dp[ignore][i][j][k]; } dp[ignore][i + 1][j][k] += dp[ignore][i][j][k]; } } } } double res = 0; for (int cnt = 1; cnt < n; ++cnt) { long long pats = 0; for (int last = 0; last < n; ++last) { for (int w = max(0, p - a[last] + 1); w <= p; ++w) { pats += dp[last][n][cnt][w]; } } res += cnt * (double)pats * fact[cnt] * fact[n - cnt - 1] / fact[n]; } printf( %.9f n , res); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { cin.sync_with_stdio(false); long long int n; cin >> n; vector<long long int> a(n), start(n), end(n); for (long long int i = 0; i < n; i++) { cin >> a[i]; start[i] = i; end[i] = i + 1; } for (long long int i = 0; i < n; i++) { while (start[i] > 0 && (a[i] | a[start[i] - 1]) == a[i]) { start[i] = start[start[i] - 1]; } } for (long long int i = n - 1; i >= 0; i--) { while (end[i] < n && (a[i] | a[end[i]]) == a[i]) { end[i] = end[end[i]]; } } map<long long int, long long int> last; long long int good = (n * (n - 1)) / 2; for (long long int i = 0; i < n; i++) { if (last.count(a[i]) && last[a[i]] >= start[i]) { good -= (i - last[a[i]]) * (end[i] - i) - 1; last[a[i]] = i; continue; } last[a[i]] = i; good -= (i - start[i] + 1) * (end[i] - i) - 1; } cout << good << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int T, a, b, c, d, k; int main() { cin >> T; for (; T--;) { cin >> a >> b >> c >> d >> k; int sol1 = 0; int sol2 = 0; if (a % c == 0) sol1 = a / c; else sol1 = a / c + 1; if (b % d == 0) sol2 = b / d; else sol2 = b / d + 1; if (sol1 + sol2 <= k) cout << sol1 << << sol2 << n ; else cout << -1 << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1005; const int mod1 = 998244353; const int mod2 = 1e9 + 7; const int b1 = 337; const int b2 = 421; const int inf = 2147483647; struct Pair { int x[2] = {}; bool operator<(const Pair a) const { return x[0] < a.x[0] || x[0] == a.x[0] && x[1] < a.x[1]; } }; struct BitSet { unsigned long long b[16] = {}; inline void reset() { memset(b, 0, sizeof(b)); } inline void set(int x) { b[x / 64] |= (1ull << (x % 64)); } inline void operator^=(const BitSet &a) { for (int i = 0; i < 16; ++i) b[i] ^= a.b[i]; } inline Pair getHashVal() { Pair ans; for (int i = 0; i < 16; ++i) { ans.x[0] = (1ll * ans.x[0] * b1 % mod1 + b[i] % mod1) % mod1; ans.x[1] = (1ll * ans.x[1] * b2 % mod2 + b[i] % mod2) % mod2; } return ans; } }; int n, s, d; BitSet bs[31], sta[1 << 20], cur; int cnt[1 << 20], m; map<Pair, int> mp; void init() { m = min(s, 20); for (int i = 0; i < m; ++i) { cnt[1 << i] = 1; sta[1 << i] = bs[i]; } for (int i = 0; i < (1 << m); ++i) { if (i != (i & -i)) { cnt[i] = cnt[i - (i & -i)] + 1; sta[i] = sta[i - (i & -i)]; sta[i] ^= sta[i & -i]; } Pair x = sta[i].getHashVal(); if (!mp.count(x) || mp[x] > cnt[i]) { mp[x] = cnt[i]; } } for (int i = 0; i < (s - m); ++i) { sta[1 << i] = bs[i + m]; } for (int i = 1; i < (1 << (s - m)); ++i) { if (i == (i & -i)) continue; sta[i] = sta[i - (i & -i)]; sta[i] ^= sta[i & -i]; } } int getans() { BitSet now; int ans = inf; for (int i = 0; i < (1 << (s - m)); ++i) { if (cnt[i] >= ans) continue; now = cur, now ^= sta[i]; Pair x = now.getHashVal(); if (mp.count(x) && mp[x] + cnt[i] < ans) { ans = mp[x] + cnt[i]; } } return ans == inf ? -1 : ans; } int main() { scanf( %d%d%d , &n, &s, &d); for (int i = 0; i < s; ++i) { int c; scanf( %d , &c); for (int j = 0; j < c; ++j) { int u; scanf( %d , &u); u--; bs[i].set(u); } } init(); vector<int> ans; for (int i = 0; i < d; ++i) { int t; scanf( %d , &t); cur.reset(); while (t--) { int u; scanf( %d , &u); u--; cur.set(u); } ans.push_back(getans()); } for (int i = 0; i < ans.size(); ++i) printf( %d n , ans[i]); puts( ); }
|
#include <bits/stdc++.h> using namespace std; const int N = 400010; const int P = 10000007; int m, n; char str[N]; char ans[N]; int l[N], r[N]; int p[N]; bool ok(int i, int m) { if (++i < m) return 0; return (r[i] - r[i - m]) == ((l[i] - l[i - m] * p[m]) * p[i - m]); } int dfs(int i, int ismax) { if (i == n) { puts(ans); return 1; } for (ans[i] = ismax ? str[i] : a ; ans[i] <= z ; ans[i]++) { l[i + 1] = l[i] * P + ans[i]; r[i + 1] = r[i] + ans[i] * p[i]; if (!ok(i, m) && !ok(i, m + 1) && dfs(i + 1, ans[i] == str[i] && ismax)) return 1; } return 0; } int main() { scanf( %d%s , &m, str); n = strlen(str); int i = n - 1; for (; i >= 0 && str[i] == z ; i--) str[i] = a ; if (i < 0) { puts( Impossible ); return 0; } str[i]++; p[0] = 1; for (int i = 1; i <= n; i++) p[i] = p[i - 1] * P; if (!dfs(0, 1)) puts( Impossible ); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long int n, i, out = 0; cin >> n; for (i = 1; i <= n; i++) { out += pow(2, i); } cout << out; return 0; }
|
#include <bits/stdc++.h> using namespace std; enum STATE { IN, OUT, BOUNDRY }; const double PI = acos(-1.0); void fast_in_out() { std::ios_base::sync_with_stdio(NULL); cin.tie(NULL); cout.tie(NULL); } int dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0}; int dy[] = {-1, 1, 0, 0, -1, -1, 1, 1, 0}; int lx[] = {2, 2, -1, 1, -2, -2, -1, 1}; int ly[] = {-1, 1, 2, 2, 1, -1, -2, -2}; const int N = 19, M = 200 + 10, mod = 998244353; const double eps = 1e-9; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } int n; double ar[N][N]; double dp[N][(1 << N)]; int main() { fast_in_out(); cout << fixed << setprecision(9); cin >> n; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) cin >> ar[i][j]; dp[i][1 << i] = 1; } for (int mask = 3; mask < (1 << n); mask++) { int cnt = __builtin_popcount(mask); if (cnt == 1) continue; cnt = cnt * (cnt - 1) / 2; double lose[N]{0}; for (int i = 0; i < n; i++) { for (int j = i + 1; j < n && (mask & (1 << i)); j++) { if (mask & (1 << j)) { lose[j] += ar[i][j] / cnt; lose[i] += ar[j][i] / cnt; } } } for (int i = 0; i < n; i++) { for (int j = i + 1; j < n && (mask & (1 << i)); j++) { if (mask & (1 << j)) { dp[j][mask] += dp[j][mask - (1 << i)] * lose[i]; dp[i][mask] += dp[i][mask - (1 << j)] * lose[j]; } } } } for (int i = 0; i < n; i++) cout << dp[i][(1 << n) - 1] << ; return 0; }
|
#include <bits/stdc++.h> const int MOD = 1000000007; int64_t dp[2001][2001]; int main() { int n, m, k; std::cin >> n >> m >> k; dp[0][0] = 1; for (int i = 1; i <= 2000; ++i) { dp[i][0] = 1; for (int j = 1; j < i; ++j) { dp[i][j] = (dp[i - 1][j - 1] + dp[i - 1][j]) % MOD; } dp[i][i] = 1; } std::cout << (dp[n - 1][2 * k] * dp[m - 1][2 * k]) % MOD << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; struct __timestamper {}; vector<vector<int>> g; vector<vector<int>> id; vector<int> used; vector<int> ts; void dfs(int v, int x) { if (used[v]) return; used[v] = 1; for (int i = 0; i < (int)g[v].size(); i++) { if (id[v][i] < x) { dfs(g[v][i], x); } } ts.push_back(v); } bool check(int x) { ts.clear(); used = vector<int>(g.size()); for (int i = 0; i < (int)g.size(); i++) { dfs(i, x); } reverse(ts.begin(), ts.end()); for (int i = 0; i + 1 < (int)ts.size(); i++) { int v = ts[i]; bool ok = false; for (int j = 0; j < (int)g[v].size(); j++) if (g[v][j] == ts[i + 1] && id[v][j] < x) { ok = true; } if (!ok) return false; } return true; } int main() { int n, m; scanf( %d%d , &n, &m); g = vector<vector<int>>(n); id = vector<vector<int>>(n); for (int i = 0; i < m; i++) { int a, b; scanf( %d%d , &a, &b); --a, --b; g[a].push_back(b); id[a].push_back(i); } if (!check(m)) { printf( -1 n ); return 0; } int l = 0; int r = m; while (r - l > 1) { int mid = (l + r) / 2; if (check(mid)) r = mid; else l = mid; } printf( %d n , r); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; char str1[maxn], str2[maxn]; int a[maxn], len1, len2; bool book[maxn]; bool judge(int x) { for (int i = 1; i <= x; i++) book[a[i] - 1] = 1; int j = 0, cnt = 0; for (int i = 0; i < len2; i++) { for (; j < len1; j++) { if (str2[i] == str1[j] && !book[j]) { j++; cnt++; break; } } } return cnt == len2; } int main(void) { while (~scanf( %s %s , str1, str2)) { len1 = strlen(str1); len2 = strlen(str2); for (int i = 1; i <= len1; i++) scanf( %d , &a[i]); int l = 0, r = len1, ans; while (l <= r) { memset(book, 0, sizeof(book)); int mid = (l + r) / 2; if (judge(mid)) l = mid + 1, ans = mid; else r = mid - 1; } printf( %d n , ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int q; scanf( %d , &q); while (q--) { int l, r, d; scanf( %d %d %d , &l, &r, &d); if (d < l) printf( %d n , d); else if (d > r) printf( %d n , d); else { int res = r - d; res = res % d; printf( %d n , r + d - res); } } }
|
#include <bits/stdc++.h> using namespace std; map<int, int> mp; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) { int a; scanf( %d , &a); mp[a]++; } int res = n; while (!mp.empty()) { for (auto itr = mp.begin(); itr != mp.end();) { if (--itr->second == 0) mp.erase(itr++); else itr++; } res--; } printf( %d n , res); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 200001; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, k; cin >> n >> k; string s; cin >> s; int ans = 2e9; vector<int> can; vector<string> cand; for (int i = 0; i < 10; i++) { priority_queue<int> pq; int t = 0; for (int j = 0; j < s.length(); j++) { int alpha = s[j] - 0 ; int cost = abs(alpha - i); pq.push(-cost); } for (int j = 0; j < k; j++) { int cst = -pq.top(); pq.pop(); t += cst; } if (ans > t) { can.clear(); can.push_back(i); ans = t; } else if (ans == t) { can.push_back(i); } } for (int d = 0; d < can.size(); d++) { string temp = s; int num = can[d]; int need = k; vector<pair<int, int> > big; vector<pair<int, int> > small; vector<pair<int, int> > ord; int cnt[10]; memset(cnt, 0, sizeof(cnt)); priority_queue<int> pq; for (int j = 0; j < s.size(); j++) { int cst = abs(num - (s[j] - 0 )); if (cst) pq.push(-cst); if (s[j] - 0 == num) need--; if (s[j] - 0 > num) big.push_back({s[j] - 0 , j}); if (s[j] - 0 < num) small.push_back({s[j] - 0 , j}); } reverse(small.begin(), small.end()); for (int i = 0; i < big.size(); i++) { int cost = abs(big[i].first - num); ord.push_back({cost, big[i].second}); } for (int i = 0; i < small.size(); i++) { int cost = abs(small[i].first - num); ord.push_back({cost, small[i].second}); } if (need <= 0) { cout << 0 << endl << s; exit(0); } for (int i = 0; i < need; i++) { int cst = -pq.top(); pq.pop(); cnt[cst]++; } for (int i = 0; i < ord.size(); i++) { int cst = ord[i].first; int idx = ord[i].second; if (cnt[cst]) { cnt[cst]--; temp[idx] = (char)(num + 0 ); } } cand.push_back(temp); } cout << ans << n ; sort(cand.begin(), cand.end()); cout << cand[0]; return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<int> aa; char s[100005]; int n; void doit() { scanf( %s , s + 1); n = strlen(s + 1); int last = 0, ans = 0; for (int i = 1; i <= n; i++) if (s[i] == 1 ) { if (last > 0) ans += i - last - 1; last = i; } printf( %d n , ans); } int main() { int cas; scanf( %d , &cas); while (cas--) doit(); }
|
#include <bits/stdc++.h> using namespace std; int lsone(int n) { return (n & -n); } void mult(long long int a[25][25], long long int b[25][25], long long int c[25][25], int m, int n, int p) { for (int i = 1; i <= m; i++) { for (int j = 1; j <= p; j++) { c[i][j] = 0; for (int k = 1; k <= n; k++) { c[i][j] += (a[i][k] * b[k][j]) % 1000000007; c[i][j] %= 1000000007; } } } } void mat_pow(long long int a[25][25], long long int c[25][25], int n, long long int p) { if (p == 0) { for (int i = 1; i <= n; i++) c[i][i] = 1; } else if (p == 1) { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) c[i][j] = a[i][j]; } } else { long long int d[25][25]; mat_pow(a, d, n, p / 2); if (p % 2) { long long int e[25][25]; mult(d, d, e, n, n, n); mult(e, a, c, n, n, n); } else { mult(d, d, c, n, n, n); } } } long long int pow1(long long int a, long long int b) { if (b == 0) return 1ll; else if (b == 1) return a; else { long long int x = pow1(a, b / 2); x *= x; x %= 1000000007; if (b % 2) { x *= a; x %= 1000000007; } return x; } } int n, m, k, s, temp, dist[10][10], a[2010][2010], mdist[10], q[101000]; vector<vector<int> > mat(21000); int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; cin >> n >> m >> k >> s; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> temp; a[i][j] = temp; mat[(temp - 1) * m + j].push_back(i); } } for (int i = 1; i <= k; i++) { for (int j = 1; j <= m; j++) sort(mat[(i - 1) * m + j].begin(), mat[(i - 1) * m + j].end()); } for (int i = 1; i <= n; i++) { memset(mdist, -1, sizeof(mdist)); for (int j = 1; j <= m; j++) { for (int x = 1; x <= k; x++) { if (mdist[x] != -1) mdist[x]++; int minim = n, maxim = 0; if (mat[(x - 1) * m + j].size() > 0) { minim = mat[(x - 1) * m + j][0]; maxim = mat[(x - 1) * m + j][mat[(x - 1) * m + j].size() - 1]; } int dist1 = i - minim, dist2 = maxim - i; mdist[x] = max(mdist[x], max(dist1, dist2)); dist[a[i][j]][x] = max(dist[a[i][j]][x], mdist[x]); dist[x][a[i][j]] = dist[a[i][j]][x]; } } } for (int i = 1; i <= n; i++) { memset(mdist, -1, sizeof(mdist)); for (int j = m; j >= 1; j--) { for (int x = 1; x <= k; x++) { if (mdist[x] != -1) mdist[x]++; int minim = n, maxim = 0; if (mat[(x - 1) * m + j].size() > 0) { minim = mat[(x - 1) * m + j][0]; maxim = mat[(x - 1) * m + j][mat[(x - 1) * m + j].size() - 1]; } int dist1 = i - minim, dist2 = maxim - i; mdist[x] = max(mdist[x], max(dist1, dist2)); dist[a[i][j]][x] = max(dist[a[i][j]][x], mdist[x]); dist[x][a[i][j]] = dist[a[i][j]][x]; } } } int ans = 0; for (int i = 1; i <= s; i++) { cin >> q[i]; } for (int i = 2; i <= s; i++) { ans = max(ans, dist[q[i - 1]][q[i]]); } cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; inline long long labs(long long a) { return a < 0 ? (-a) : a; } template <typename T> inline T sqr(T x) { return x * x; } struct Node { int deep; int p; vector<int> to; int tin, tout; }; const int MAXN = 100005; vector<pair<int, int> > mas[MAXN]; vector<Node> g; int n; int t = 0; void DFS(int i, int deep = 0) { g[i].deep = deep; g[i].tin = t++; mas[deep].push_back(make_pair(g[i].tin, i)); for (int(j) = 0; (j) < (g[i].to.size()); (j)++) { int to = g[i].to[j]; DFS(to, deep + 1); } g[i].tout = t++; } int main() { cin >> n; n++; g.resize(n); for (int(i) = 0; (i) < (n - 1); (i)++) { cin >> g[i + 1].p; g[g[i + 1].p].to.push_back(i + 1); } DFS(0); int m; cin >> m; for (int(qqq) = 0; (qqq) < (m); (qqq)++) { int i, ppp; cin >> i >> ppp; int pd = g[i].deep - ppp; if (pd <= 0) { cout << 0 << ; continue; } int pit = upper_bound((mas[pd]).begin(), (mas[pd]).end(), make_pair(g[i].tin, 0)) - mas[pd].begin() - 1; int p = mas[pd][pit].second; int ubl = upper_bound((mas[g[i].deep]).begin(), (mas[g[i].deep]).end(), make_pair(g[p].tin, 0)) - mas[g[i].deep].begin(); int ubr = upper_bound((mas[g[i].deep]).begin(), (mas[g[i].deep]).end(), make_pair(g[p].tout, 0)) - mas[g[i].deep].begin() - 1; cout << ubr - ubl << ; } cout << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int a[1005]; int b[2005]; int main() { int p, q, l, r; cin >> p >> q >> l >> r; while (p--) { int val1, val2; cin >> val1 >> val2; for (int i = val1; i <= val2; i++) a[i] = 1; } while (q--) { int val1, val2; cin >> val1 >> val2; for (int i = val1; i <= val2; i++) b[i + 1000] = 1; } int count = 0; for (int t = l; t <= r; t++) for (int i = 0; i <= 1000; i++) if (a[i] && b[i + 1000 - t]) { count++; break; } cout << count; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m = 100000, a, b, c, cnt; struct Point { int x, y; Point() {} Point(int a, int b) { x = a, y = b; } bool operator==(Point b) const { return x == b.x && y == b.y; } Point operator+(Point b) { return Point(x + b.x, y + b.y); } Point operator-(Point b) { return Point(x - b.x, y - b.y); } } A[5000005], Q[5000005], P[5000005]; long long Cross(Point a, Point b) { return (long long)a.x * b.y - (long long)a.y * b.x; } long double Length(Point p) { return sqrt(1.0 * p.x * p.x + 1.0 * p.y * p.y); } void Add(int x, int y) { A[++cnt] = Point(x, y); } bool cmp(Point a, Point b) { return a.x == b.x ? a.y < b.y : a.x < b.x; } long double Abs(long double x) { return x > 0 ? x : -x; } long double Getr(Point a, Point b, Point c) { long double p = Length(a - b), q = Length(b - c), r = Length(c - a); long double s = Abs(2.0 * (long double)Cross(b - a, c - a)); if (s <= 1e-10) return 0; return p * q * r / s; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d%d%d , &a, &b, &c); if (a - c >= 0) Add(a - c, b); else { Add(0, min(m, b + c - a)); Add(0, max(0, b - c + a)); } if (a + c <= m) Add(a + c, b); else { Add(m, min(m, b + c - (m - a))); Add(m, max(0, b - c + (m - a))); } if (b - c >= 0) Add(a, b - c); else { Add(min(m, a + c - b), 0); Add(max(0, a - c + b), 0); } if (b + c <= m) Add(a, b + c); else { Add(min(m, a + c - (m - b)), m); Add(max(0, a - c + (m - b)), m); } } sort(A + 1, A + cnt + 1, cmp); cnt = unique(A + 1, A + cnt + 1) - A - 1; int lst = 0; for (int i = 1; i <= cnt; i++) { while (lst > 1 && Cross(A[i] - Q[lst], Q[lst] - Q[lst - 1]) >= 0) lst--; Q[++lst] = A[i]; } int fir = 0; for (int i = cnt; i >= 1; i--) { while (fir > 1 && Cross(A[i] - P[fir], P[fir] - P[fir - 1]) >= 0) fir--; P[++fir] = A[i]; } for (int i = 2; i < fir; i++) Q[++lst] = P[i]; long double mx = Getr(Q[lst], Q[1], Q[2]), tmp; int a1 = lst, a2 = 1, a3 = 2; if ((tmp = Getr(Q[lst - 1], Q[lst], Q[1])) > mx) a1 = lst - 1, a2 = lst, a3 = 1, mx = tmp; for (int i = 3; i <= lst; i++) if ((tmp = Getr(Q[i - 2], Q[i - 1], Q[i])) > mx) a3 = i, mx = tmp; if (a3 >= 3) a1 = a3 - 2, a2 = a3 - 1; printf( %d %d n%d %d n%d %d n , Q[a1].x, Q[a1].y, Q[a2].x, Q[a2].y, Q[a3].x, Q[a3].y); }
|
#include <bits/stdc++.h> using namespace std; pair<int, int> a[300004]; int n, nr, r, Min, poz, f1, f2, ch1, ch2, sol, soli, sol2, i, j, l, v[300004], m[300004]; char s[300004], b[300004]; bool ok1, ok2; int main() { scanf( %d , &n); scanf( %s , &s); nr = 0; Min = 1000000000; for (i = 0; i < n; i++) { if (s[i] == ( ) nr++; else nr--; v[i] = nr; Min = min(Min, v[i]); m[i] = Min; } if (v[n - 1] != 0) { printf( %d n%d %d n , 0, 1, 1); return 0; } poz = 0; if (m[n - 1] < 0) { nr = 0; poz = -1; for (i = (n - 1); i > 0; i--) { if (s[i] == ( ) nr++; else nr--; if ((nr + m[i - 1]) >= 0) { poz = i; break; } } nr = -1; for (j = poz; j < n; j++) b[++nr] = s[j]; for (j = 0; j < poz; j++) b[++nr] = s[j]; } else { for (i = 0; i < n; i++) b[i] = s[i]; } l = 0; r = 0; sol = 0; ch1 = 1; ch2 = 1; nr = 0; for (i = 0; i < n; i++) { if (b[i] == ( ) nr++; else nr--; v[i] = nr; Min = min(Min, v[i]); m[i] = Min; if (nr == 0) { sol++; a[++r].first = l; a[r].second = i; l = i + 1; } } soli = sol; for (i = 1; i <= r; i++) { sol2 = 0; nr = 0; ok1 = false; ok2 = false; for (j = a[i].first + 1; j < a[i].second; j++) { if (b[j] == ( ) { nr++; if (!ok1) { f1 = j; ok1 = true; } } else { nr--; if (!ok2) { f2 = j; ok2 = true; } } if (nr == 0) sol2++; } if ((sol2 + 1) > sol) { sol = sol2 + 1; ch1 = a[i].first; ch2 = a[i].second; } sol2 = 0; nr = 0; f2 = a[i].first + 1; for (j = a[i].first + 1; j < a[i].second; j++) { if (b[j] == ( ) { nr++; if (!ok1) { f1 = j; ok1 = true; } } else { nr--; if (!ok2) { f2 = j; ok2 = true; } } if (nr == 0) { if ((sol2 + soli) > sol) { sol = sol2 + soli; ch1 = f2; ch2 = j; } sol2 = 0; f2 = j + 1; } if (nr == 1) sol2++; } } ch1 = (ch1 + poz) % n + 1; ch2 = (ch2 + poz) % n + 1; printf( %d n%d %d , sol, ch1, ch2); return 0; }
|
#include <bits/stdc++.h> using namespace std; struct male { const string adjective = lios ; const string noun = etr ; const string verb = initis ; }; struct female { const string adjective = liala ; const string noun = etra ; const string verb = inites ; }; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); string s, t; male m; female f; getline(cin, s); s.push_back( ); int n = s.size(); vector<string> v; for (int i = 0; i < n; i++) { if (s[i] == ) { v.emplace_back(t); t.clear(); } else { t += s[i]; } } if (v.size() == 1) { if (v[0].size() >= m.adjective.size() and v[0].substr(v[0].size() - m.adjective.size()) == m.adjective) { cout << YES n ; return 0; } if (v[0].size() >= f.adjective.size() and v[0].substr(v[0].size() - f.adjective.size()) == f.adjective) { cout << YES n ; return 0; } if (v[0].size() >= m.noun.size() and v[0].substr(v[0].size() - m.noun.size()) == m.noun) { cout << YES n ; return 0; } if (v[0].size() >= f.noun.size() and v[0].substr(v[0].size() - f.noun.size()) == f.noun) { cout << YES n ; return 0; } if (v[0].size() >= m.verb.size() and v[0].substr(v[0].size() - m.verb.size()) == m.verb) { cout << YES n ; return 0; } if (v[0].size() >= f.verb.size() and v[0].substr(v[0].size() - f.verb.size()) == f.verb) { cout << YES n ; return 0; } cout << NO n ; return 0; } else { int nmi = -1, nfi = -1; for (int i = 0; i < v.size(); i++) { if (v[i].size() < m.noun.size() and v[i].size() < f.noun.size()) continue; if (v[i].substr(v[i].size() - m.noun.size()) == m.noun) { nmi = i; break; } if (v[i].substr(v[i].size() - f.noun.size()) == f.noun) { nfi = i; break; } } if (nmi < 0 and nfi < 0) { cout << NO n ; return 0; } if (nmi >= 0) { bool fg = true; for (int i = 0; i < nmi; i++) { fg &= (v[i].size() >= m.adjective.size()); if (!fg) { break; } fg &= (v[i].substr(v[i].size() - m.adjective.size(), m.adjective.size()) == m.adjective); if (!fg) { break; } } for (int i = (nmi + 1); i < v.size(); i++) { fg &= (v[i].size() >= m.verb.size()); if (!fg) { break; } fg &= (v[i].substr(v[i].size() - m.verb.size(), m.verb.size()) == m.verb); if (!fg) { break; } } cout << (fg ? YES n : NO n ); return 0; } if (nfi >= 0) { bool fg = true; for (int i = 0; i < nfi; i++) { fg &= (v[i].size() >= f.adjective.size()); if (!fg) { break; } fg &= (v[i].substr(v[i].size() - f.adjective.size(), f.adjective.size()) == f.adjective); if (!fg) { break; } } for (int i = (nfi + 1); i < v.size(); i++) { fg &= (v[i].size() >= f.verb.size()); if (!fg) { break; } fg &= (v[i].substr(v[i].size() - f.verb.size(), f.verb.size()) == f.verb); if (!fg) { break; } } cout << (fg ? YES n : NO n ); return 0; } } }
|
#include <bits/stdc++.h> using namespace std; long long A[200005], dp[300005]; int main() { long long a, b, h, w; scanf( %lld%lld%lld%lld , &a, &b, &h, &w); long long n; scanf( %lld , &n); long long i, j; for (i = 1; i <= n; i++) { scanf( %lld , A + i); } if (h >= a && w >= b) { printf( 0 ); return 0; } if (h >= b && w >= a) { printf( 0 ); return 0; } sort(A + 1, A + n + 1); reverse(A + 1, A + n + 1); dp[1] = 1; long long prod = 1; for (i = 1; i <= min(n, 40LL); i++) { prod *= A[i]; for (j = 1; j <= 300000; j++) { if ((long long)j * A[i] <= 300000) { dp[j * A[i]] |= dp[j]; } } for (j = 1; j <= 300000; j++) { if (!dp[j]) continue; if (prod % j != 0) continue; long long rem = prod / j; if (h * j >= a && w * rem >= b) { printf( %lld , i); return 0; } if (h * j >= b && w * rem >= a) { printf( %lld , i); return 0; } } if (prod >= 2e10) break; } printf( -1 ); }
|
#include <bits/stdc++.h> int main() { char string[101]; int i = 0; while (scanf( %c , &string[i]) && string[i++] != n ) if (string[i - 1] == H || string[i - 1] == Q || string[i - 1] == 9 ) { printf( YES ); exit(0); } printf( NO ); }
|
#include <bits/stdc++.h> using namespace std; const int N = 111; const int INFI = 2147483627; int a[N], b[N]; int main() { int n, ans = -1, flag, t; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &a[i]); for (int i = 1; i < n; i++) { b[i - 1] = a[i] - a[i - 1]; if (ans < b[i - 1]) ans = b[i - 1]; } flag = 0; t = INFI; for (int i = 0; i < n - 2; i++) { if (b[i] + b[i + 1] <= ans) { flag = 1; printf( %d n , ans); break; } if (t > b[i] + b[i + 1]) t = b[i] + b[i + 1]; } if (!flag) printf( %d n , t); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; long long j; long long ix, iy; int mx[100100], my[100100]; inline void reflect(int in, long long ax, long long ay, long long& bx, long long& by) { bx = ax + ((mx[in] - ax) << 1); by = ay + ((my[in] - ay) << 1); return; } int main() { cin >> n >> j; int i, cnt = 0; long long a, b; memset((mx), (0), sizeof((mx))); memset((my), (0), sizeof((my))); j = j % ((long long)(2 * n)); cin >> ix >> iy; for (i = 0; i < n; i++) { cin >> mx[i] >> my[i]; } a = ix; b = iy; while (cnt < j) { for (i = 0; i < n && cnt < j; i++) { reflect(i, ix, iy, a, b); ix = a; iy = b; cnt++; } } cout << ix << << iy << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int ALPH = z - a + 1; const int W = 1000 * 1000; const int MOD = 1000 * 1000 * 1000 + 7; template <typename T> vector <int> computePrefPref(const T &s) { int n = s.size(); vector <int> res(n + 1, 0); int i = 1, t = 0; while (i < n) { while (i + t < n && s[i + t] == s[t]) { t++; } res[i] = t; int k = 1; while (k < t && res[k] != res[i] - k) { res[i + k] = min(res[k], res[i] - k); k++; } t = max(0, t - k); i += k; } res.pop_back(); return res; } template <typename T> vector <bool> findOccurences(const T &s, const T &w) { T result = w; copy(s.begin(), s.end(), back_inserter(result)); auto pref = computePrefPref(result); vector <bool> occ(s.size()); for (int i = 0; i < (int) s.size(); i++) { occ[i] = pref[i + w.size()] >= w.size(); } return occ; } int expo(int a, long long n, int mod) { int ans = 1; while (n) { if (n & 1LL) { ans = ((long long) ans * a) % mod; } n >>= 1; a = ((long long) a * a) % mod; } return ans; } int revMod(int a, int mod) { return expo(a, mod - 2, mod); } vector <long long> getPowers(int x, int n) { vector <long long> pw(n + 1); pw[0] = 1; for (int i = 1; i <= n; i++) { pw[i] = (x * pw[i - 1]) % MOD; } return pw; } int main() { ios_base::sync_with_stdio(false); int n, q; cin >> n >> q; string t; vector <string> s(1); cin >> s[0] >> t; while (s.size() <= n && s.back().size() <= W) { s.push_back(s.back() + t[(int) s.size() - 1] + s.back()); } vector <int> sLen(s.size()); for (int i = 0; i < (int) s.size(); i++) { sLen[i] = s[i].size(); } vector <vector<long long>> sumLetter(ALPH, vector <long long> (n + 1, 0)); auto pw = getPowers(2, n); auto pwRev = getPowers(revMod(2, MOD), n); for (int c = 0; c < ALPH; c++) for (int i = 1; i <= n; i++) { sumLetter[c][i] = sumLetter[c][i - 1]; if (t[i - 1] == a + c) { sumLetter[c][i] += pwRev[i - 1]; if (sumLetter[c][i] >= MOD) { sumLetter[c][i] -= MOD; } } } while (q--) { int i; string w; cin >> i >> w; int k = upper_bound(sLen.begin(), sLen.end(), w.size()) - sLen.begin(); long long ans = 0; if (i <= k) { auto occ = findOccurences(s[i], w); for (bool b : occ) { ans += b; } } else { auto occ = findOccurences(s[k], w); for (bool b : occ) { ans += b; } ans = (ans * pw[i - k]) % MOD; string result = w + s[k] + string(1, ) + s[k]; int idx = w.size() + s[k].size(); int tmpSize = result.size() - w.size(); int sn = s[k].size(); for (int c = 0; c < ALPH; c++) { result[idx] = a + c; auto pref = computePrefPref(result); long long here = 0; for (int j = sn - w.size() + 1; j <= sn; j++) { here += pref[j + w.size()] >= w.size(); } long long mul = sumLetter[c][i] - sumLetter[c][k]; if (mul < 0) { mul += MOD; } mul = (mul * pw[i - 1]) % MOD; ans = (ans + here * mul) % MOD; } } cout << ans << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; const int mod = 1e9 + 7; long long a[N], b, c, d, dis; pair<int, int> p; bool mark = true; int main() { ios::sync_with_stdio(false); cin.tie(0); int t, n, m, k, ans = 0, sum = 0, mn = 1e8, mx = 0, x, y; cin >> t; string s; while (t--) { cin >> n >> k >> s; sum = 0; bool h = true; for (int i = 0; i < n; i++) { if (s[i] == 1 ) h = false; } if (h) { if (n == k) cout << 1 << endl; else cout << (n + k) / (k + 1) << endl; } else { ans = 0; for (int i = 0; i < n; i++) { if (s[i] == 1 ) { x = i; break; } else ans++; } sum += ans / (k + 1); ans = 0; for (int i = n - 1; i >= 0; i--) { if (s[i] == 1 ) { y = i; break; } else ans++; } sum += ans / (k + 1); ans = 0; for (int i = x; i <= y; i++) { if (s[i] == 0 ) ans++; else { sum += (ans - k) / (k + 1); ans = 0; } } cout << sum << endl; } } }
|
#include <bits/stdc++.h> using namespace std; vector<int> q[100002]; int ans[100002]; int flag, v[100002]; int k; void dfs(int len, int x, int f) { int i; v[x] = len; ans[len] = x; for (i = 0; i < q[x].size(); i++) { int j = q[x][i]; if (j == f) continue; if (v[j] != -1) { if (flag) break; if (len + 1 - v[j] >= k + 1) { printf( %d n , len + 1 - v[j]); for (i = v[j]; i <= len; i++) { if (i != v[j]) printf( ); printf( %d , ans[i]); } printf( n ); flag = 1; return; } continue; } dfs(len + 1, j, x); } } int main() { int n, m; while (scanf( %d%d%d , &n, &m, &k) != EOF) { while (m--) { int a, b; scanf( %d%d , &a, &b); q[a].push_back(b); q[b].push_back(a); } memset(v, -1, sizeof(v)); dfs(0, 1, -1); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long long a, b, c, n, sum = 0, Max, Min; cin >> a >> b >> c >> n; Max = max(max(a, b), c); sum = a + b + c; if (3 * Max - sum > n) cout << NO << endl; else { sum += n; if (sum % 3 == 0) cout << YES << endl; else cout << NO << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; double dp[105][105 * 1005]; int a[105]; int main(void) { int n, m; scanf( %d%d , &n, &m); int sum = 0; for (int i = 0; i < n; ++i) { scanf( %d , &a[i]); sum += a[i]; } if (m == 1) { printf( %.10f n , 1.0); return 0; } dp[0][0] = m - 1; for (int i = 1; i <= n; ++i) { double sum = 0; for (int j = i; j <= i * m; ++j) { sum += dp[i - 1][j - 1] / (m - 1); if (j - 1 - m >= 0) sum -= dp[i - 1][j - m - 1] / (m - 1); dp[i][j] = sum; if (j - a[i - 1] >= 0) dp[i][j] -= dp[i - 1][j - a[i - 1]] / (m - 1); } } double ans = 1; for (int i = 0; i < sum; i++) ans += dp[n][i]; printf( %.10f n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int solve() { int n, m, tx = 0; cin >> n >> m; vector<int> t(m), a(m), b(m), g[n], c(n), tout(n); for (int i = 0; i < m; i++) { cin >> t[i] >> a[i] >> b[i]; --a[i], --b[i]; if (t[i]) g[a[i]].push_back(b[i]); } function<bool(int v)> dfs = [&](int v) { c[v] = 1; for (int u : g[v]) { if (c[u] == 1) return true; else if (!c[u]) if (dfs(u)) return true; } c[v] = 2; tout[v] = tx++; return false; }; for (int i = 0; i < n; i++) if (!c[i] && dfs(i)) return cout << NO << n , 0; cout << YES << n ; for (int i = 0; i < m; i++) { if (!t[i]) if (tout[a[i]] < tout[b[i]]) swap(a[i], b[i]); cout << a[i] + 1 << << b[i] + 1 << n ; } return 0; } signed main() { std::ios::sync_with_stdio(0); std::cout.tie(0); std::cin.tie(0); int t; cin >> t; while (t--) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int sz = 1e6 + 9; int n, m, k; long long tr[sz], tr_sum, tr_cnt; long long ret[sz], ret_sum, ret_cnt; int d, first, t, c; vector<pair<pair<int, int>, pair<int, int>>> v; vector<pair<long long, long long>> home; long long home_ans[sz]; long long ans = 1e18; int days[sz]; int main() { cin >> n >> m >> k; for (int i = 0; i < m; ++i) { cin >> d >> first >> t >> c; v.push_back(make_pair(make_pair(d, first), make_pair(t, c))); } sort(v.begin(), v.end()); for (int i = v.size() - 1; i >= 0; i--) { d = v[i].first.first; first = v[i].first.second; t = v[i].second.first; c = v[i].second.second; if (first) continue; if (!ret[t]) { ret[t] = c; ret_sum += c; ret_cnt++; } else if (ret[t] > c) { ret_sum -= ret[t]; ret[t] = c; ret_sum += c; } if (ret_cnt == n) home.push_back(make_pair(d, ret_sum)); } sort(home.begin(), home.end()); int tmp = 0; for (auto u : home) days[tmp++] = u.first; for (int i = home.size() - 1; i >= 0; i--) { if (i == home.size() - 1) home_ans[i] = home[i].second; else home_ans[i] = min(home_ans[i + 1], home[i].second); } for (int i = 0; i < v.size(); ++i) { d = v[i].first.first; first = v[i].first.second; t = v[i].second.first; c = v[i].second.second; if (t) continue; if (!tr[first]) { tr[first] = c; tr_sum += c; tr_cnt++; } else if (tr[first] > c) { tr_sum -= tr[first]; tr[first] = c; tr_sum += c; } if (tr_cnt == n) { int pos = lower_bound(days, days + home.size(), d + 1 + k) - days; if (pos >= home.size()) continue; ans = min(ans, tr_sum + home_ans[pos]); } } if (ans == 1e18) cout << -1; else cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; inline int read() { register int x = 0; register bool f = 0; register char ch = getchar(); while (!isdigit(ch)) { f ^= !(ch ^ - ); ch = getchar(); } while (isdigit(ch)) { x = ((x + (x << 2)) << 1) + (ch ^ 0 ); ch = getchar(); } return f ? -x : x; } inline void print(int x) { register int sc[30] = {0}, tot = 0; do { sc[++tot] = x % 10; x /= 10; } while (x); while (tot) putchar( 0 + sc[tot--]); } int n, maxn, k, ans; int peo[510 * 510], tot[510 * 510], h[510]; int dp[5010][5010]; int main() { n = read(); k = read(); for (register int i = 1; i <= n * k; i++) { int tmp = read(); tot[tmp]++; maxn = max(maxn, tmp); } for (register int i = 1; i <= n; i++) { int tmp = read(); peo[tmp]++; } for (register int i = 1; i <= k; i++) h[i] = read(); for (register int i = 1; i <= n; i++) for (register int j = 1; j <= n * k; j++) for (register int l = 1; l <= min(j, k); l++) dp[i][j] = max(dp[i][j], dp[i - 1][j - l] + h[l]); for (register int i = 1; i <= maxn; i++) if (peo[i]) ans += dp[peo[i]][tot[i]]; printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int p = 0, t = 1; if (s.substr(0, 4) == http ) { p = 1; cout << http:// ; } else cout << ftp:// ; int i = p + 3; while (!(s[i] == r && s[i + 1] == u ) || t) { cout << s[i]; i++; t = 0; } cout << .ru ; if (s.size() - i - 2 > 0) cout << / ; cout << s.substr(i + 2, s.size() - (i + 2)); }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e6; const long long inf = 1e17; long long overFlow(long long a, long long b) { if ((inf / a) < b) return 1; return 0; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long x0, y0, ax, ay, bx, by; cin >> x0 >> y0 >> ax >> ay >> bx >> by; long long xs, ys, t; cin >> xs >> ys >> t; vector<pair<long long, long long> > v; v.push_back({x0, y0}); while (true) { if (overFlow(x0, ax) || overFlow(y0, ay)) break; x0 = ax * x0 + bx, y0 = ay * y0 + by; v.push_back({x0, y0}); } if (v.size() > 100) assert(0); int ans = 0; for (int i = 0; i < v.size(); i++) { int cnt = 0; long long ds = abs(v[i].first - xs) + abs(v[i].second - ys); if (ds > t) continue; cnt++; for (int j = i - 1; j >= 0; j--) { ds += v[j + 1].first - v[j].first + v[j + 1].second - v[j].second; if (ds > t) break; cnt++; } if (ds > t) { ans = max(ans, cnt); continue; } int pr = 0; for (int j = i + 1; j < v.size(); j++) { ds += v[j].first - v[pr].first + v[j].second - v[pr].second; if (ds > t) break; cnt++; pr = j; } ans = max(ans, cnt); } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long int t; cin >> t; while (t--) { long long int n, i, zer = -1, one; cin >> n; string s; string ans = ; cin >> s; for (i = 0; i < n; i++) { if (s[i] == 1 ) break; zer = i; } one = n; for (i = n - 1; i >= 0; i--) { if (s[i] == 0 ) break; one = i; } for (i = 0; i <= zer; i++) ans = ans + 0 ; if (zer + 1 != one) ans = ans + 0 ; for (i = n - 1; i >= one; i--) ans = ans + 1 ; cout << ans << endl; } }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, m, i, j; long long int prod = 1; char mat[105][105]; cin >> n >> m; for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { cin >> mat[i][j]; } } for (i = 0; i < m; i++) { unordered_set<char> s; for (j = 0; j < n; j++) { if (s.find(mat[j][i]) == s.end()) s.insert(mat[j][i]); } prod = (prod * (s.size() % 1000000007)) % 1000000007; } cout << prod << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, k, m; int a[111]; int c[111][111]; long long dp[111][111][111]; long long f(int idx, int cnt, int last) { if (idx > n) return cnt == k ? 0 : 1e13; if (dp[idx][cnt][last] != -1) return dp[idx][cnt][last]; long long ans = 1e13; if (a[idx]) ans = min(ans, f(idx + 1, cnt + (a[idx] == last ? 0 : 1), a[idx])); else { for (int i = 1; i <= m; i++) ans = min(ans, f(idx + 1, cnt + (last == i ? 0 : 1), i) + c[idx][i]); } return dp[idx][cnt][last] = ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); memset(dp, -1, sizeof dp); cin >> n >> m >> k; for (int i = 1; i <= n; i++) cin >> a[i]; a[0] = 111; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) cin >> c[i][j]; long long ans = f(1, 0, 111); if (ans > 1e12) cout << -1; else cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 10; const int mod = 998244353; int up(int x, int y) { return x + y >= mod ? x + y - mod : x + y; } int a[1010], dp[1010][1010], pos[100010], n, k; int cal(int x) { for (int i = 0; i <= k; ++i) for (int j = 0; j <= n; ++j) dp[i][j] = 0; for (int i = 1; i <= n; ++i) dp[1][i] = 1; for (int i = 2; i <= k + 1; ++i) { for (int j = 1; j <= n; ++j) dp[i - 1][j] = up(dp[i - 1][j - 1], dp[i - 1][j]); for (int j = 1; j <= n; ++j) dp[i][j] = dp[i - 1][a[j] >= x ? pos[a[j] - x] : 0]; } return dp[k][n]; } int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); sort(a + 1, a + 1 + n); for (int i = n; i >= 1; --i) pos[a[i]] = (a[i] == a[i + 1] ? pos[a[i + 1]] : i); for (int i = 1; i <= 100000; ++i) pos[i] = max(pos[i], pos[i - 1]); int ans = 0; for (int i = 1; i * (k - 1) <= 100000; ++i) ans = up(ans, cal(i)); printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { vector<int> v; int n, x, temp, cntr = 0; cin >> n >> x; while (n--) { cin >> temp; v.push_back(temp); } sort(v.begin(), v.end()); while (v[(v.size() - 1) / 2] != x) { cntr++; v.push_back(x); sort(v.begin(), v.end()); } cout << cntr; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> double DIS(T va, T vb) { return sqrt((double)(va.x - vb.x) * (va.x - vb.x) + (va.y - vb.y) * (va.y - vb.y)); } template <class T> inline T INT_LEN(T v) { int len = 1; while (v /= 10) ++len; return len; } char ar[100005], br[100005]; bool cmp(char va, char vb) { return va > vb; } void solve(char *s, char *s2) { int n = (int)strlen(s); int m = (int)strlen(s2); sort(s2, s2 + m, cmp); int i, j; for (i = j = 0; i < n && j < m; i++) { if (s[i] < s2[j]) { s[i] = s2[j]; j++; } } puts(s); } int main(void) { while (2 == scanf( %s%s , ar, br)) { solve(ar, br); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, ans = 0; cin >> n; pair<int, int> arr[n]; for (int i = 0; i < n; i++) cin >> arr[i].first >> arr[i].second; sort(arr, arr + n); for (int i = 0; i < n; i++) { if (arr[i].second >= ans) { ans = arr[i].second; } else { ans = arr[i].first; } } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> a(n - 1); vector<int> b(n - 1); for (auto &d : a) cin >> d; for (auto &d : b) cin >> d; for (int u = 0; u <= 3; ++u) { vector<int> ans; ans.push_back(u); bool flagg = true; for (int i = 0; i < n - 1; ++i) { bool flag = false; int t = -1; for (int j = 0; j <= 3; ++j) { if (((j & *ans.rbegin()) == b[i]) && ((j | *ans.rbegin()) == a[i])) { flag = true; t = j; break; } } if (!flag) { flagg = false; break; } ans.push_back(t); } if (flagg) { cout << YES << endl; for (auto s : ans) cout << s << ; return 0; } } cout << NO ; }
|
#include <bits/stdc++.h> int modExp(long long a, long long n, int p) { int ret = 1; for (a = (a % p + p) % p; n; n >>= 1, a = 1LL * a * a % p) if (n & 1) ret = 1LL * ret * a % p; return ret; } int main() { long long n, m; scanf( %lld%lld , &n, &m); printf( %lld n , (modExp(3, n, m) + m - 1) % m); }
|
//naveen mall #include<bits/stdc++.h> using namespace std; #define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); #define pb push_back #define sz(c) (int)c.size() #define len(c) (int)c.length() #define vec vector #define int long long int #define all(c) c.begin(), c.end() #define rall(c) c.rbegin(), c.rend() #define trav(a,i) for(auto i: a) #define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end))) #define invect(v,n) for(int i=0;i<n;i++ ){int arb;cin>>arb;v.pb(arb);} #define inset(s,n) rep(i,0,n){int aset;cin>>aset;s.insert(aset);} #define display(c) trav(c,i) cout<<i<< ;cout<< n ; #define F first #define S second #define pii pair<int,int> #define PB pop_back #define endl n #define what(x) cerr << #x << is << x << endl; int sum() { return 0; }template<typename T,typename... Args>T sum(T a, Args... args) { return a + sum(args...); } #define kyra 1000000007 #define N 300003 const long long INF=1e18; vector<int> v[26]; int n,k; int a[N]; int temp[N]; bool good(int m) { rep(i,0,n) { if(a[i]>=m) { temp[i]=1; } else temp[i]=-1; if(i!=0) temp[i]+=temp[i-1]; } // for(int i=0;i<n;i++) // cout<<temp[i]<< ; int mi=INF; rep(i,k-1,n) { mi=min(mi, temp[i-k]); if(temp[i]-mi>0) { return true; } } return false; } void solve() { cin>>n>>k; rep(i,0,n) cin>>a[i]; int l=-1; int r=N; while(r>l+1) { int m=(l+r)/2; if(good(m)) { l=m; } else r=m; } cout<<l<<endl; } signed main() {fast #ifdef NCR init(); #endif int t=1; // cin>>t; while(t--) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n, k; cin >> n >> k; string A, B; cin >> A >> B; long long ret = 0; long long ways = 1; bool isinf = false; for (auto i = (0); i != (n); ++i) { if (!isinf) { ways *= 2; if (B[i] == a ) ways--; if (A[i] == b ) ways--; } isinf |= ways > 1e11; ret += isinf ? k : min(ways, k); } cout << ret << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; int a[10]; map<string, int> mp; map<int, string> p; string s; int main() { int i, j, k; int n, m; for (i = 1; i <= 5; i++) cin >> a[i]; mp[ S ] = 1; mp[ M ] = 2; mp[ L ] = 3; mp[ XL ] = 4; mp[ XXL ] = 5; p[1] = S ; p[2] = M ; p[3] = L ; p[4] = XL ; p[5] = XXL ; cin >> k; for (i = 0; i < k; i++) { cin >> s; if (!a[mp[s]]) { if (mp[s] == 3) { if (a[4]) cout << p[4] << endl, a[4]--; else if (a[2]) cout << p[2] << endl, a[2]--; else if (a[5]) cout << p[5] << endl, a[5]--; else if (a[1]) cout << p[1] << endl, a[1]--; continue; } if (mp[s] == 2) { if (a[3]) cout << p[3] << endl, a[3]--; else if (a[1]) cout << p[1] << endl, a[1]--; else if (a[4]) cout << p[4] << endl, a[4]--; else if (a[5]) cout << p[5] << endl, a[5]--; continue; } for (j = mp[s]; j <= 5; j++) if (a[j]) { cout << p[j] << endl, a[j]--; break; } if (j > 5) { for (j = mp[s]; j >= 1; j--) if (a[j]) { cout << p[j] << endl, a[j]--; break; } } } else cout << s << endl, a[mp[s]]--; } return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<long long> a; struct SegTree { struct Node { long long left, right, mid, size; }; Node combine(const Node& A, const Node& B, long long m) { Node C; if (A.left < A.size) { C.left = A.left; } else { if ((a[m - 1] > 0) <= (a[m] > 0)) { C.left = A.size + B.left; } else { C.left = A.size; } } if (B.right < B.size) { C.right = B.right; } else { if ((a[m - 1] > 0) <= (a[m] > 0)) { C.right = B.size + A.right; } else { C.right = B.size; } } C.mid = max(A.mid, B.mid); if ((a[m - 1] > 0) <= (a[m] > 0)) { C.mid = max(C.mid, A.right + B.left); } C.size = A.size + B.size; return C; } long long size; vector<Node> t; void init(long long n) { size = n; t.resize(4 * size); } void build(long long x, long long lx, long long rx) { if (lx + 1 == rx) { if (a[lx] == 0) { t[x] = {0, 0, 0, 1}; } else { t[x] = {1, 1, 1, 1}; } } else { long long m = (lx + rx) / 2; build(2 * x + 1, lx, m); build(2 * x + 2, m, rx); t[x] = combine(t[2 * x + 1], t[2 * x + 2], m); } } void build(long long n) { init(n); build(0, 0, size); } void set(long long v, long long x, long long lx, long long rx) { if (lx + 1 == rx) { if (a[lx] == 0) { t[x] = {0, 0, 0, 1}; } else { t[x] = {1, 1, 1, 1}; } } else { long long m = (lx + rx) / 2; if (v < m) { set(v, 2 * x + 1, lx, m); } else { set(v, 2 * x + 2, m, rx); } t[x] = combine(t[2 * x + 1], t[2 * x + 2], m); } } void set(long long v) { set(v, 0, 0, size); } }; void solve() { long long Q; Q = 1; while (Q--) { long long n; cin >> n; vector<long long> b(n); for (long long i = 0; i < n; ++i) cin >> b[i]; ; a.resize(n - 1); for (long long i = 0; i < n - 1; ++i) { a[i] = b[i] - b[i + 1]; } SegTree tree; if (a.size() != 0) { tree.build(a.size()); } long long m; cin >> m; while (m--) { long long l, r, d; cin >> l >> r >> d; --l, --r; if (a.size() == 0) { cout << 1 << ; continue; } if (l > 0) { a[l - 1] -= d; tree.set(l - 1); } if (r < a.size()) { a[r] += d; tree.set(r); } cout << tree.t[0].mid + 1 << ; } } } signed main(signed argc, char** argv) { ios_base::sync_with_stdio(false); cin.tie(nullptr); if (argc > 1 && (string)argv[1] == local ) { freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); solve(); while (cin.peek() != EOF) { if (isspace(cin.peek())) cin.get(); else { cout << n ; solve(); } } } else { solve(); } }
|
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int MAXN = 10; const int LCM = 840; const int n = 8; long long w; long long cnt[MAXN], f[MAXN][MAXN * LCM]; int main() { scanf( %lld , &w); for (int i = 1; i <= n; i++) scanf( %lld , &cnt[i]); memset(f, -1, sizeof(f)); f[0][0] = 0; for (int i = 0; i < n; i++) { for (int j = 0; j <= LCM * 8; j++) { if (f[i][j] != -1) { long long limit = min(cnt[i + 1], (long long)LCM / (i + 1)); for (int k = 0; k <= limit; k++) f[i + 1][j + (i + 1) * k] = max(f[i + 1][j + (i + 1) * k], f[i][j] + (cnt[i + 1] - k) / (LCM / (i + 1))); } } } long long ans = 0; for (int i = 0; i <= min((long long)LCM * 8, w); i++) { if (f[8][i] != -1) ans = max(ans, min(f[8][i], (w - i) / LCM) * LCM + i); } printf( %lld n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long M = 998244353; long long f[300005]; vector<long long> m1[300005], m2[300005]; int32_t main() { std::ios::sync_with_stdio(0); std::cin.tie(0); ; long long n; cin >> n; for (long long i = 0; i < n; i++) { long long x, y; cin >> x >> y; m1[x].push_back(y); m2[y].push_back(x); } f[0] = 1; for (long long i = 1; i < 300005; i++) f[i] = f[i - 1] * i % M; long long ans = f[n], d1 = 1, d2 = 1, d3 = 1; for (long long i = 1; i <= n; i++) d1 = d1 * f[m1[i].size()] % M; for (long long i = 1; i <= n; i++) d2 = d2 * f[m2[i].size()] % M; ans = ((ans - d1 - d2) % M + M) % M; vector<long long> a, b; for (long long i = 1; i <= n; i++) { if (m1[i].size() == 0) continue; sort((m1[i]).begin(), (m1[i]).end()); map<long long, long long> m; for (long long e : m1[i]) m[e]++; for (pair<long long, long long> p : m) d3 = d3 * f[p.second] % M; a.push_back(i); b.push_back(m1[i][0]); b.push_back(m1[i].back()); } for (long long i = 0; i < a.size() - 1; i++) if (a[i + 1] < a[i]) d3 = 0; for (long long i = 0; i < b.size() - 1; i++) if (b[i + 1] < b[i]) d3 = 0; ans = (ans + d3) % M; cout << ans << n ; }
|
#include <bits/stdc++.h> using namespace std; const long long M = 1e9 + 7; void print(vector<long long> &a) { int n = a.size(); for (int i = 0; i < n; i++) { cout << a[i] << ; } cout << endl; } void print(vector<int> &a) { int n = a.size(); for (int i = 0; i < n; i++) { cout << a[i] << ; } cout << endl; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int te; te = 1; while (te--) { int n; cin >> n; vector<int> a(n), sol; sol.push_back(1); int sum = 0, coal = 0; for (int i = 0; i < n; i++) { cin >> a[i]; sum += a[i]; if (i == 0) coal += a[i]; else { if (a[0] >= 2 * a[i]) { sol.push_back(i + 1); coal += a[i]; } } } if (2 * coal <= sum) { cout << 0 << endl; } else { cout << sol.size() << endl; print(sol); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long digit(long long n) { long long ans = 0; long long i = 0; while (n > 0) { long long tmp = n % 10; if (tmp != 0) { ans = ans + (tmp * pow(10, i)); i++; } n = n / 10; } return ans; } int main() { char arr[8][8]; for (int i = 0; i < 8; i++) cin >> arr[i]; int w = 0, b = 0; for (int i = 0; i < 8; i++) for (int j = 0; j < 8; j++) { if (arr[i][j] >= A && arr[i][j] < a && arr[i][j] != . ) { char c = arr[i][j]; if (c == Q ) w += 9; if (c == R ) w += 5; if (c == B || c == N ) w += 3; if (c == P ) w += 1; } else if (arr[i][j] >= a && arr[i][j] != . ) { char c = arr[i][j]; if (c == q ) b += 9; if (c == r ) b += 5; if (c == b || c == n ) b += 3; if (c == p ) b += 1; } } if (b > w) cout << Black ; else if (w > b) cout << White ; else cout << Draw ; }
|
#include <bits/stdc++.h> using namespace std; namespace thecold { inline int read() { int res = 0; bool flag = false; char c = getchar(); while (!isdigit(c)) flag = (c == - ), c = getchar(); while (isdigit(c)) res = res * 10 + (c ^ 48), c = getchar(); return !flag ? res : -res; } const int Max_n = 1e5 + 5; int bak[Max_n], n, m, q; struct node { int l, r, tagl, tagv, mx, mmx; node(int a, int b) { l = a, r = b, tagv = tagl = mx = mmx = 0; } node() {} } tree[Max_n << 3]; inline void push_up(const int tr) { int ls = tr << 1, rs = tr << 1 | 1; if (tree[tr].l == tree[tr].r) return; if (tree[ls].mx > tree[rs].mx) tree[tr].mx = tree[ls].mx, tree[tr].mmx = max(tree[ls].mmx, tree[rs].mx); else if (tree[ls].mx < tree[rs].mx) tree[tr].mx = tree[rs].mx, tree[tr].mmx = max(tree[ls].mx, tree[rs].mmx); else tree[tr].mx = tree[ls].mx, tree[tr].mmx = max(tree[ls].mmx, tree[rs].mmx); } inline void build(const int l, const int r, const int tr) { tree[tr] = node(l, r); if (l == r) return tree[tr].mx = l, tree[tr].mmx = -Max_n, void(); int mid = (l + r) >> 1; build(l, mid, tr << 1), build(mid + 1, r, tr << 1 | 1); push_up(tr); } inline void cop(node &a, node b, const int tr) { a.mx = a.tagv = b.tagv, !a.tagl && (a.tagl = b.tagl); } inline void push_down(const int tr) { if (!tree[tr].tagl) return; int ls = tr << 1, rs = tr << 1 | 1; if (tree[ls].mx == tree[tr].tagl) cop(tree[ls], tree[tr], tr); if (tree[rs].mx == tree[tr].tagl) cop(tree[rs], tree[tr], tr); tree[tr].tagl = tree[tr].tagv = 0; } inline void change(const int l, const int r, const int va, const int lim, const int tr) { int ll = tree[tr].l, rr = tree[tr].r; if (ll > r || rr < l) return; if (tree[tr].mx < lim) return; push_down(tr); if (l <= ll && rr <= r) { if (tree[tr].mmx < lim) return tree[tr].tagl = tree[tr].mx, tree[tr].tagv = tree[tr].mx = va, void(); } change(l, r, va, lim, tr << 1), change(l, r, va, lim, tr << 1 | 1); push_up(tr); } int ans[Max_n]; struct Node { int l, bel; Node(int a, int b) { l = a, bel = b; } Node() {} }; vector<Node> v[Max_n]; inline int query(const int pos, const int tr) { int ll = tree[tr].l, rr = tree[tr].r; if (ll == rr) return tree[tr].mx; push_down(tr); int mid = (ll + rr) >> 1; if (mid >= pos) return query(pos, tr << 1); return query(pos, tr << 1 | 1); } inline void main() { n = read(), m = read(); build(1, n, 1); for (int i = 1; i <= m; ++i) { int ui = read(), vi = read(); bak[vi] = ui; } q = read(); for (int i = 1; i <= q; ++i) { int li = read(), ri = read(); v[ri].push_back(Node(li, i)); } for (int now = 1; now <= n; ++now) { if (bak[now]) change(1, bak[now], now, bak[now], 1); int sz = v[now].size(); for (int i = 0; i < sz; ++i) ans[v[now][i].bel] = query(v[now][i].l, 1); } for (int i = 1; i <= q; ++i) printf( %d n , ans[i]); } } // namespace thecold int main() { thecold::main(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int n, x, y, b[N], cnt[N], a[N]; bool vis[N]; bool cmp(int i, int j) { return make_pair(cnt[b[i]], b[i]) > make_pair(cnt[b[j]], b[j]); } int main() { ios::sync_with_stdio(0); cin.tie(0); int T; cin >> T; while (T--) { cin >> n >> x >> y; for (int i = 1; i <= n + 1; i++) cnt[i] = 0; for (int i = 1; i <= n; i++) cin >> b[i], ++cnt[b[i]], vis[i] = 0; int oth = 0; for (int i = 1; i <= n + 1; i++) if (!cnt[i]) { oth = i; break; } int l = 0, r = n; while (l < r) { int mid = (l + r) >> 1, sum = 0; for (int i = 1; i <= n + 1; i++) sum += max(0, cnt[i] - mid); if (sum <= x) r = mid; else l = mid + 1; } if (2 * (n - x - l) < y - x) { cout << NO n ; continue; } cout << YES n ; int sum = x; for (int i = 1; i <= n; i++) if (cnt[b[i]] > l) --cnt[b[i]], a[i] = b[i], vis[i] = 1, --sum; for (int i = 1; i <= n && sum; i++) if (!vis[i]) --cnt[b[i]], a[i] = b[i], vis[i] = 1, --sum; vector<int> id; for (int i = 1; i <= n; i++) if (!vis[i]) id.push_back(i); sort(id.begin(), id.end(), cmp); vector<int> seq; for (int i = 0; i < int(id.size()); i++) if (i == 0 || b[id[i]] != b[id[i - 1]]) seq.push_back(b[id[i]]); if (!seq.empty()) { seq.push_back(seq[0]); seq.erase(seq.begin()); } for (int i = 0, p = 0; i < int(seq.size()); i++) for (int j = 1; j <= cnt[seq[i]]; j++) a[id[p++]] = seq[i]; sum = n - x; for (int i = 1; i <= n; i++) if (!vis[i] && a[i] == b[i]) a[i] = oth, --sum; for (int i = 1; i <= n && sum > y - x; i++) if (!vis[i] && a[i] != oth) a[i] = oth, --sum; for (int i = 1; i <= n; i++) cout << a[i] << ; cout << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAX = 2e5 + 20; int n, a[MAX]; int main(void) { int T; scanf( %d , &T); while (T--) { scanf( %d , &n); bool allBad = 1; int rl = 0, rr = 0; scanf( %d , &a[1]); for (register int i = (2); i <= (n); ++i) { scanf( %d , &a[i]); if (abs(a[i] - a[i - 1]) > 1) { allBad = 0; rl = i - 1, rr = i; } } if (allBad) printf( NO n ); else printf( YES n%d %d n , rl, rr); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<pair<long long, int>> xs(n); for (int i = 0; i < xs.size(); ++i) { cin >> xs[i].first; xs[i].second = i + 1; } sort(xs.begin(), xs.end()); int k; cin >> k; vector<long long> sums1(n), sums2(n); int qk = 2; long long sumsl = 0; int jl = 0; long long cur_sum = 0; long long min_sum = -1; int min_pos = -1; for (int i = 1; i < k; ++i) { sumsl += xs[i].first - xs[0].first; } for (int i = 1; i < xs.size(); ++i) { sums1[i] = sums1[i - 1] + (xs[i].first - xs[i - 1].first) * (qk - 1); if (qk <= k) { qk++; cur_sum += sums1[i]; } else { sums1[i] -= xs[i].first - xs[jl].first; ++jl; cur_sum = cur_sum + sums1[i] - sumsl; sumsl = sumsl - (xs[jl].first - xs[jl - 1].first) * (k - 1) + (xs[i].first - xs[jl].first); } if (qk > k) { if (min_sum == -1 || cur_sum < min_sum) { min_sum = cur_sum; min_pos = i; } } } for (int i = 0; i < k; ++i) { cout << xs[min_pos - i].second << ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 505; int a[maxn][maxn], b[maxn][maxn]; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) scanf( %d , &a[i][j]); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) scanf( %d , &b[i][j]); bool flag = 1; for (int i = 1; i <= n; i++) { int cnt = 0; for (int j = 1; j <= m; j++) if (a[i][j] != b[i][j]) cnt++; if (cnt % 2) flag = 0; } for (int j = 1; j <= m; j++) { int cnt = 0; for (int i = 1; i <= n; i++) if (a[i][j] != b[i][j]) cnt++; if (cnt % 2) flag = 0; } if (flag) printf( Yes n ); else printf( No n ); }
|
#include <bits/stdc++.h> #pragma GCC optimize( O2,unroll-loops ) using namespace std; const int mod = 1000000007, N = 17; int n, x, ans; int A[1 << N], B[N + 1][1 << N], C[N + 1][1 << N], D[1 << N], E[1 << N]; long long fib[1 << N]; inline void fix(int& x) { if (x >= mod) x -= mod; if (x < 0) x += mod; } void SOS1(int* A, int inv) { for (int j = 0; j < N; j++) for (int mask = 0; mask < (1 << N); mask++) if (mask & (1 << j)) fix(A[mask] += inv * A[mask ^ (1 << j)]); } void SOS2(int* A, int inv) { for (int j = 0; j < N; j++) for (int mask = 0; mask < (1 << N); mask++) if (mask & (1 << j)) fix(A[mask ^ (1 << j)] += inv * A[mask]); } void XOR(int* A, bool inv) { for (int j = 0; j < N; j++) for (int mask = 0; mask < (1 << N); mask++) if (mask & (1 << j)) { int a = A[mask ^ (1 << j)], b = A[mask]; fix(A[mask ^ (1 << j)] = a + b); fix(A[mask] = a - b); } if (inv) { long long tmp = 1, inv2 = (mod + 1) / 2; for (int i = 0; i < N; i++) tmp = tmp * inv2 % mod; for (int mask = 0; mask < (1 << N); mask++) A[mask] = A[mask] * tmp % mod; } } int main() { fib[1] = 1; for (int i = 2; i < (1 << N); i++) fib[i] = (fib[i - 1] + fib[i - 2]) % mod; scanf( %d , &n); while (n--) scanf( %d , &x), A[x]++; for (int i = 0; i <= N; i++) { for (int mask = 0; mask < (1 << N); mask++) if (__builtin_popcount(mask) == i) B[i][mask] = A[mask]; SOS1(B[i], +1); } for (int i = 0; i <= N; i++) for (int j = 0; i + j <= N; j++) { for (int mask = 0; mask < (1 << N); mask++) C[i + j][mask] = (C[i + j][mask] + 1ll * B[i][mask] * B[j][mask]) % mod; } for (int i = 0; i <= N; i++) SOS1(C[i], -1); for (int mask = 0; mask < (1 << N); mask++) D[mask] = C[__builtin_popcount(mask)][mask] * fib[mask] % mod; for (int mask = 0; mask < (1 << N); mask++) { E[mask] = A[mask]; A[mask] = A[mask] * fib[mask] % mod; } XOR(E, 0); for (int mask = 0; mask < (1 << N); mask++) E[mask] = 1ll * E[mask] * E[mask] % mod; XOR(E, 1); for (int mask = 0; mask < (1 << N); mask++) E[mask] = E[mask] * fib[mask] % mod; SOS2(A, +1); SOS2(D, +1); SOS2(E, +1); for (int mask = 0; mask < (1 << N); mask++) A[mask] = 1ll * A[mask] * D[mask] % mod * E[mask] % mod; SOS2(A, -1); for (int i = 0; i < N; i++) fix(ans += A[1 << i]); if (ans < 0) ans += mod; printf( %d n , ans); return 0; }
|
#include <iostream> #include <algorithm> #include <string> #include <vector> #include <queue> #include <stack> #include <set> #include <map> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <cctype> #include <functional> using namespace std; typedef long long ll; const int MAXN = 1005; const double EPS = 1e-8; const int INF = 1e9+7; int s[MAXN]; set<int> st; int main(){ int t; scanf( %d , &t); while(t--){ int n; scanf( %d , &n); st.clear(); for (int i = 0; i < n;i++){ scanf( %d , &s[i]); } for (int i = 0; i < n;i++){ for (int j = i + 1; j < n;j++){ st.insert(s[j] - s[i]); } } printf( %d n ,st.size()); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 3e5 + 10; int N; int A[MAXN]; int B[MAXN]; int ans[MAXN]; bool is_permutation() { sort(B + 1, B + 1 + N); for (int i = 1; i <= N; ++i) if (B[i] != i) return false; return true; } void solve(bool has_one) { for (int i = 1; i <= N; ++i) ans[i] = 0; if (!has_one) return; map<int, int> freq; for (int i = 1; i <= N; ++i) ++freq[A[i]]; int L = 1; int R = N; int cur; for (cur = 1; cur <= N; ++cur) { if (freq[cur] != 1) break; if (A[L] == cur) ++L; else if (A[R] == cur) --R; else break; } if (is_permutation()) ans[1] = 1; if (L > R) { for (int k = 2; k <= N; ++k) ans[k] = 1; return; } int len = R - L + 1; if (!freq[cur]) ++len; for (int k = len; k <= N; ++k) ans[k] = 1; } int main() { cin.sync_with_stdio(false); cin.tie(0); int t; cin >> t; while (t--) { cin >> N; bool has_one = false; for (int i = 1; i <= N; ++i) { cin >> A[i]; B[i] = A[i]; if (A[i] == 1) has_one = true; } solve(has_one); for (int i = 1; i <= N; ++i) cout << ans[i]; cout << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, x, sum, ans, a; int main() { scanf( %d %d , &n, &x); for (int i = 0; i < n; i++) { scanf( %d , &a); sum += a; } sum = abs(sum); ans = (sum / x) + (sum % x != 0); printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long N = 200411; vector<int> root; int now, n, s[N], p[N], toghe; void dfs(int v) { if (s[v]) { if (s[v] == now) root.push_back(v); return; } s[v] = now; dfs(p[v]); } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &p[i]); if (p[i] == i) toghe = i; } for (int i = 1; i <= n; i++) { now = i; if (!s[i]) dfs(i); } cout << root.size() - (toghe > 0) << endl; if (toghe == 0) toghe = root[0]; for (int i = 0; i < root.size(); i++) p[root[i]] = toghe; for (int i = 1; i <= n; i++) printf( %d , p[i]); }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, x, y; cin >> n; vector<vector<int> > g(n); for (int i = 0; i < n - 1; i++) { cin >> x >> y; x--; y--; g[x].push_back(y); g[y].push_back(x); } int res = 0; for (int i = 0; i < n; i++) { if (g[i].size() <= 1) res++; } cout << res; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<long long int> dis(n); vector<long long int> ans(n); vector<bool> vis(n, 0); long long int acc = 0; for (long int i = 0; i < n; i++) { cin >> dis[i]; acc += dis[i]; } vector<vector<int>> edg(n); for (long int i = 0; i < n - 1; i++) { int a, b; cin >> a >> b; a--; b--; edg[a].push_back(b); edg[b].push_back(a); } vector<vector<int>> p(3); p[0].push_back(0); p[1].push_back(0); p[2].push_back(0); vis[0] = 1; int i = 0; long long int x = 0; while (p[0].size() < n) { for (long int j = 0; j < edg[p[0][i]].size(); j++) { if (!vis[edg[p[0][i]][j]]) { p[0].push_back(edg[p[0][i]][j]); p[1].push_back(p[0][i]); p[2].push_back(p[2][i] + 1); x += ((long long int)(p[2][i] + 1)) * (dis[edg[p[0][i]][j]]); vis[edg[p[0][i]][j]] = 1; } } i++; } for (int j = n - 1; j > 0; j--) { dis[p[1][j]] += dis[p[0][j]]; } ans[0] = x; for (long int i = 0; i < n; i++) { if (i == 0) continue; ans[p[0][i]] = acc + ans[p[1][i]] - 2 * dis[p[0][i]]; } cout << *max_element(ans.begin(), ans.end()); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; const long long mod = 1e9 + 7; template <typename T> inline T gcd(T a, T b) { return !b ? a : gcd(b, a % b); } template <typename T> inline T q_pow(T a, T x) { T ans = 1, tmp = a; while (x) { if (x & 1) (ans *= tmp) %= mod; (tmp *= tmp) %= mod; x >>= 1; } return ans; } template <typename T> inline void re(T &N) { int f = 1; char c; while ((c = getchar()) < 0 || c > 9 ) if (c == - ) f = -1; N = c - 0 ; while ((c = getchar()) >= 0 && c <= 9 ) N = N * 10 + c - 0 ; N *= f; } int m, n, t = 1, st, en, k; inline int getmask(string &s) { int ans = 0; for (int i = 0; i < s.size(); i++) if (s[i] - 0 ) ans |= 1 << i; return ans; } string a, b; int p[110]; int d[2][1 << 20]; int main() { ios::sync_with_stdio(0); cin >> n >> m >> k; cin >> a >> b; for (int i = 0; i < k; i++) p[i] = i; for (int i = 0; i < 1 << k; i++) { d[0][i] = 1e9; d[1][i] = -1e9; } d[0][getmask(a)] = d[1][getmask(b)] = 0; for (int i = 1; i <= n; i++) { int x, y; cin >> x >> y; swap(p[x - 1], p[y - 1]); string _a(k, 0 ), _b(k, 0 ); for (int j = 0; j < k; j++) { _a[p[j]] = a[j]; _b[p[j]] = b[j]; } d[0][getmask(_a)] = min(d[0][getmask(_a)], i); d[1][getmask(_b)] = max(d[1][getmask(_b)], i); } pair<int, pair<int, int> > ans = {0, {1, m}}; int ca = count(a.begin(), a.end(), 1 ), cb = count(b.begin(), b.end(), 1 ); for (int i = (1 << k) - 1; ~i; i--) { if (d[1][i] - d[0][i] >= m) ans = max(ans, {k - ca - cb + 2 * __builtin_popcount(i), {d[0][i] + 1, d[1][i]}}); for (int j = 0; j < k; j++) if (i & (1 << j)) { d[0][i ^ (1 << j)] = min(d[0][i ^ (1 << j)], d[0][i]); d[1][i ^ (1 << j)] = max(d[1][i ^ (1 << j)], d[1][i]); } } cout << ans.first << n << ans.second.first << << ans.second.second << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<vector<long long> > mul(vector<vector<long long> > a, vector<vector<long long> > b) { vector<vector<long long> > c; c.resize(a.size()); for (int i = 0; i < c.size(); i++) c[i].resize(b[0].size(), 0); for (int i = 0; i < c.size(); i++) for (int j = 0; j < c[i].size(); j++) for (int k = 0; k < b.size(); k++) c[i][j] = (c[i][j] + a[i][k] * b[k][j]); return c; } vector<vector<long long> > Def; vector<vector<long long> > bpow(vector<vector<long long> > a, long long st) { if (st == 0) return Def; if (st == 1) return a; vector<vector<long long> > b = bpow(a, st >> 1); b = mul(b, b); if (st & 1) b = mul(a, b); return b; } long long AR = 19, BR = 13, CR = 23, XR = 228, YR = 322, MOD = 1e9 + 993; long long myrand() { long long ZR = (XR * AR + YR * BR + CR) % MOD; XR = YR; YR = ZR; return ZR; } long long sqr(long long x) { return x * x; } const long long llinf = 2e18; const long double EPS = 1e-9; const long double PI = atan2(0, -1); const int maxn = 2e5 + 100, inf = 1e9 + 100, mod = 1e9 + 7; int n, W, H; vector<int> g[maxn]; queue<int> w[maxn]; queue<int> def[maxn]; int answer[maxn]; pair<int, pair<int, int> > danc[maxn]; vector<pair<pair<int, int>, int> > q; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> W >> H; for (int i = 0; i < n; i++) { cin >> danc[i].first >> danc[i].second.first >> danc[i].second.second; if (danc[i].first == 1) q.push_back(make_pair(danc[i].second, i)); else g[danc[i].second.second - danc[i].second.first + H].push_back(i); answer[i] = i; } for (int i = 0; i < maxn; i++) if (!g[i].empty()) { vector<pair<int, int> > s(g[i].size()); for (int j = 0; j < g[i].size(); j++) s[j] = make_pair(danc[g[i][j]].second.first, g[i][j]); sort(s.begin(), s.end()); reverse(s.begin(), s.end()); for (int j = 0; j < s.size(); j++) w[i].push(s[j].second), def[i].push(s[j].second); } sort(q.begin(), q.end()); for (int i = 0; i < q.size(); i++) { int id = q[i].first.second - q[i].first.first + H; if (id < 0 || g[id].empty()) continue; answer[w[id].front()] = q[i].second; w[id].pop(); w[id].push(q[i].second); } for (int i = 0; i < maxn; i++) if (!g[i].empty()) for (int j = 0; j < g[i].size(); j++) answer[w[i].front()] = def[i].front(), def[i].pop(), w[i].pop(); for (int i = 0; i < n; i++) { int x = answer[i]; if (danc[x].first == 1) cout << danc[x].second.first << << H << n ; else cout << W << << danc[x].second.first << n ; } }
|
#include <bits/stdc++.h> using namespace std; int main() { long int n; cin >> n; long int a[n]; for (long int i = 0; i < n; i++) cin >> a[i]; long int b[101] = {0}; for (long int i = 0; i < n; i++) b[a[i]]++; long int c[101] = {0}; long int ans = 0; for (long int i = 1; i <= 100; i++) { if (c[i] == 0 && b[i] > 0) { ans++; for (long int j = i; j < 101; j += i) c[j] = 1; } bool pp = 0; for (long int j = 1; j < 101; j++) { if (b[j] >= 1 && c[j] == 0) pp = 1; } if (pp == 0) break; } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, x; cin >> n >> x; if (n == 3) { cout << >vv << endl << ^<. << endl << ^.< << endl; cout << 1 << << 3; } if (n == 5) { cout << >...v << endl << v.<.. << endl << ..^.. << endl << >.... << endl << ..^.< << endl; cout << 1 << << 1; } if (n == 100) { cout << >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>.>.>.>.>.>.>.>.> .>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.v << endl; for (int i = 0; i < 49; i++) { cout << ^v.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<<<<<<<<<<< <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< << endl; cout << ^>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>.>.>.>.>.>.>.> .>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.v << endl; } cout << ^<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<<<<<<<<<<<<< <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< << endl; cout << 1 << << 1; } }
|
#include <bits/stdc++.h> using namespace std; template <typename T> void out(T x) { cout << x << endl; exit(0); } using ll = long long; const ll mod = 1e9 + 7; const int maxn = 1e6 + 5; int n, k; string S; bool test(int start) { string s = S; int cur = 0; for (int i = 0; i < start; i++) { if (s[i] == ? || s[i] == Y ) { s[i] = Y ; cur = 0; } else if (s[i] == N ) { cur++; } if (cur > k) return false; } if (start > 0 && s[start - 1] == N ) { return false; } for (int i = start; i < start + k; i++) { if (s[i] == Y ) { return false; } } if (start + k < n && s[start + k] == N ) { return false; } cur = 0; for (int i = start + k; i < n; i++) { if (s[i] == ? || s[i] == Y ) { s[i] = Y ; cur = 0; } else if (s[i] == N ) { cur++; } if (cur > k) return false; } return true; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> k; cin >> S; for (int i = 0; i + k - 1 < n; i++) { if (test(i)) { out( YES ); } } cout << NO n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long vis[200005], cnt[200005], arr[200005]; void solve() { long long i, j, k, l, m, n, x, sz = 0, flag = 1, mx = 0; cin >> n; for (i = 0; i <= n; i++) vis[i] = cnt[i] = 0; for (i = 0; i < n; i++) { cin >> arr[i]; cnt[arr[i]]++; if (cnt[arr[i]] == 2) sz = max(sz, arr[i]); mx = max(mx, arr[i]); if (cnt[arr[i]] == 3) flag = 0; } vector<long long> ans; if (sz + mx != n) flag = 0; if (!flag) { cout << 0 << endl; return; } for (i = 0; i < sz; i++) { vis[arr[i]] = 1; } flag = 1; for (i = 1; i <= sz; i++) { if (vis[i]) continue; else flag = 0; } if (flag) ans.push_back(sz); flag = 1; if (sz != mx) { for (i = 0; i <= mx; i++) vis[i] = 0; for (i = 0; i < mx; i++) { vis[arr[i]] = 1; } for (i = 1; i <= mx; i++) if (!vis[i]) flag = 0; if (flag) ans.push_back(mx); } cout << ans.size() << endl; for (i = 0; i < ans.size(); i++) { cout << ans[i] << << n - ans[i] << endl; } } int32_t main() { ios::sync_with_stdio(false); cin.tie(0); long long t; t = 1; cin >> t; while (t--) solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int q1() { int a1, a2, a3, a4; int a[100009]; int n; cin >> n; for (int i = 0; i < n; i++) { cin >> a1 >> a2 >> a3 >> a4; a[i] = a4 + a3 + a2 + a1; } int t = a[0]; sort(a, a + n); int j = 1; for (int i = n - 1; i >= 0; i--) { if (a[i] == t) { cout << j << endl; return 1; } j++; } } int main() { q1(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int m, l, r, a[1200000]; string s; int main() { cin >> s; m = s.size(); l = 1; r = m; for (int i = 0; i < m; i++) if (s[i] == l ) { a[r] = i + 1; r--; } else { a[l] = i + 1; l++; } for (int i = 1; i <= m; i++) cout << a[i] << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 50 + 5; const int maxm = 2e5 + 5; int n, k; int a[maxm]; vector<int> res[maxm]; int main() { cin >> n >> k; for (int i = 0; i < n; ++i) cin >> a[i]; for (int i = 0; i < n; ++i) { int tmp = a[i], j = 0; while (true) { res[tmp].push_back(j); if (!tmp) break; tmp /= 2; j++; } } int ans = 0x3f3f3f3f; for (int i = 0; i < maxm; ++i) { if (res[i].size() < k) continue; sort(res[i].begin(), res[i].end()); int tmp = 0; for (int j = 0; j < k; ++j) tmp += res[i][j]; ans = min(ans, tmp); } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int A[n + 1]; A[0] = 0; for (int i = 1; i < n + 1; i++) { cin >> A[i]; } int dollar = A[1]; int cou = 0; for (int i = 1; i < n; i++) { cou = cou + A[i] - A[i + 1]; if (cou < 0) { dollar = dollar + abs(cou); cou = 0; } } cout << dollar; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.