malteklaes/cpp-code-code_search_net-style · Datasets at Hugging Face

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> using namespace std; const int N = 2e6 + 5; struct bing { int fa[N]; void init() { for (int i = (1); i < (N); i++) fa[i] = i; } int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); } void unite(int x, int y) { fa[find(x)] = find(y); } bool same(int ...
#include <bits/stdc++.h> using namespace std; int main() { int i, j, k, m, n, rez = 0; int a[300]; bool b[300] = {0}; bool c; cin >> n >> k; for (i = 1; i <= 2 * n + 1; i++) cin >> a[i]; for (j = 0; j < k; j++) { c = true; i = 2; while (c) { if (!b[i] && a[i] > ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 10; const int MAXM = 1e6 + 10; const int MAXLOG = 20; struct Edge { int x, y, w; int id; } edge[MAXM]; int T, n, m, i; int val; vector<pair<int, int> > e[MAXN]; int fa[MAXN], anc[MAXN][MAXLOG], dep[MAXN]; int ans[MAXM]; ...
#include <bits/stdc++.h> using namespace std; using namespace std; int M1(int x) { return x >= 1000000007 ? x - 1000000007 : x; } int M2(int x) { return x >= 1000000009 ? x - 1000000009 : x; } struct Hash { int a, b; Hash() { a = b = 0; } Hash(int a, int b) : a(a), b(b) {} Hash(int a) : a(a), ...
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int l = s.length(); vector<vector<int>> dp(5000, vector<int>(5000, 0)); vector<int> kk(s.size() + 1, 0); for (int length = 1; length <= l; length++) { for (int right = 0; right < s.size(); right++) { ...
#include <bits/stdc++.h> using namespace std; const int Z = (int)3e3 + 111; const int N = (int)1e6 + 111; const int INF = (int)1e9 + 111; const int MOD = (int)1e9 + 7; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); string t, ans; cin >> t; int k; if (t.size()...
#include <bits/stdc++.h> using namespace std; const double EPS = 1e-8; const long long mod = (int)1e9 + 7; int dx[] = {0, 0, -1, 1, 1, 1, -1, -1}; int dy[] = {1, -1, 0, 0, 1, -1, -1, 1}; const int N = 1000001; void stop() {} void file() {} struct point { long long x, y; }; unsigned long long g...
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, first, second, third, fourth; cin >> a >> b >> c; first = a + b + c; second = 2 * (a + b); third = 2 * (b + c); fourth = 2 * (a + c); cout << min(first, min(second, min(third, fourth))); }
#include <bits/stdc++.h> #pragma comment(linker, /STACK:200000000 ) using namespace std; template <typename T> inline T Abs(T x) { return (x >= 0) ? x : -x; } template <typename T> inline T sqr(T x) { return x * x; } template <typename T> string toStr(T x) { stringstream st; st << x...
#include <bits/stdc++.h> using namespace std; int main() { int n, count = 0; string s; cin >> n >> s; for (int i = 0; i < n; i++) { if (s[i] == 8 ) count++; } if (n < 11) cout << 0 << endl; else { cout << min(count, n / 11) << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 100005; int a[maxn], n, x, k, l; long long ans = 0; int main() { cin >> n >> x; for (int i = 1; i <= n; i++) { cin >> k >> l; ans += min(k, l); a[i] = min(max(l - k, 0), k); } sort(a + 1, a + 1 + n); for (int ...
#include <bits/stdc++.h> using namespace std; const int N = 500005, M = 60; int q, fa[N], n = 1; double dp[N][M + 5]; int main() { ios::sync_with_stdio(false); cin >> q; int opt, pos; for (int i = 0; i <= M; i++) dp[1][i] = 1; for (int _ = 1; _ <= q; _++) { cin >> opt >> pos; i...
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > all; int isable[100005], cnt[100005]; int main() { int i, n, k; scanf( %d , &n); scanf( %d , &k); long long b; scanf( %I64d , &b); for (i = 0; i < n; i++) { int x; scanf( %d , &x); cnt[i] = x; i...
#include <bits/stdc++.h> using namespace std; int main() { string a; string b; cin >> a >> b; long long int len1 = a.length(); long long int len2 = b.length(); if (a.compare(b) == 0) { cout << -1 n ; } else { if (len1 > len2) cout << len1 << n ; else ...
#include <bits/stdc++.h> using namespace std; const int MAX = 1e5 + 10; const double eps = 1e-6; int n, m; int sum, res; int f[21][1 << 21], col[MAX]; char s[MAX]; int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) { scanf( %s , s); for (int j = 0; j < m; j++) if...
#include <bits/stdc++.h> using namespace std; using ll = int; namespace SEG { static const ll STAR = 1, FINI = 2e5 + 110; struct NODE { ll l, r, min; NODE() : l(0), r(0), min(0) {} } node[1000000 * 10 + 110]; ll newnode(ll pre = 0) { static ll cnt = 0; node[++cnt] = node[pre]; return c...
#include <bits/stdc++.h> using namespace std; const int maxn = 250005; int qr[maxn], qp[maxn], wm[maxn], loc[maxn]; int pp[maxn], pr[maxn], pm[maxn]; long long pd[maxn]; stack<int> f[maxn]; bool used[maxn]; int n, nx, ny, totm; long long dist(int x, int y) { return (long long)x * x + (long long)y * y;...
#include <bits/stdc++.h> using namespace std; int n, k, d[2][100005], q1[100005], q2[100005], x, y, st, en; char s[2][100005]; int main() { cin >> n >> k; cin >> s[0]; cin >> s[1]; d[0][0] = 1; for (en = 1; st < en;) { x = q1[st]; y = q2[st++]; if (y >= n - k) { cou...
#include <bits/stdc++.h> using namespace std; int main() { int a[20]; a[0] = 2; a[1] = 3; a[2] = 5; a[3] = 7; a[4] = 11; a[5] = 13; a[6] = 17; a[7] = 19; a[8] = 23; a[9] = 29; a[10] = 31; a[11] = 37; a[12] = 41; a[13] = 43; a[14] = 47; a[15] = 4; ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 5 * 100000; vector<int> g[MAXN + 1], e[MAXN + 1]; int col[MAXN + 1], cur = 1, used[MAXN + 1]; void dfs(int v, int p) { int num = 1; vector<int> del; for (auto x : g[v]) { del.push_back(col[x]); used[col[x]] = 1; } f...
#include <bits/stdc++.h> using namespace std; struct Person { int a; int id; }; bool operator<(Person a, Person b) { return a.a < b.a; } class TSolver { public: int n; vector<Person> persons; explicit TSolver(std::istream& in) { in >> n; persons.resize(n); for (int i =...
#include <bits/stdc++.h> using namespace std; long long binpow(long long a, long long b) { long long exp = 10e9; long long res = 1; while (b > 0) { if (b & 1) res = ((res % exp) * (a % exp)) % exp; a = ((a % exp) * (a % exp)) % exp; b >>= 1; } return res; } bool isprime(int...
#include <bits/stdc++.h> using namespace std; #define vec vector #define PB push_back #define MP make_pair #define MT make_tuple #define F first #define S second using ll = long long int; // watch out for overflows in your code using pii = pair<int,int>; //mt19937 rng(chrono::steady...
#include <bits/stdc++.h> using namespace std; const int N = 100; const int M = 2e6 + 7; const int inf = 1e9; int n, m, mx, p[N], minn[N], D[M][2], sum = 0; int a[N][N]; bool check() { for (int t = 0, tE = (1 << mx) - 1; t <= tE; t++) { int ds = 0, bs = 0; for (int i = 1, iE = mx; i <= iE; ...
#include <bits/stdc++.h> using namespace std; int main() { int i, j, k, l, n, m, A[11] = {0}, count = 0, B[2000], sum1, sum2, last, flag = 0; char ch; for (i = 1; i <= 10; i++) { scanf( %c , &ch); if (ch == 1 ) A[i] = 1; else A[i] = 0; } ...
#include<bits/stdc++.h> using namespace std; typedef long long ll; void solve() { int x,y; cin>>x>>y; string s; cin>>s; int cR=0,cU=0,cL=0,cD=0; for(int i=0;i<s.size();i++) { if(s[i]== R ) cR++; else if(s[i]== U ) cU++;...
#include <bits/stdc++.h> using namespace std; inline int read() { int f = 1, ans = 0; char c = getchar(); while (c < 0 \|\| c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { ans = ans * 10 + c - 0 ; c = getchar(); } return f * ans; ...
#include <bits/stdc++.h> using namespace std; void solve() { long long n, k; cin >> n >> k; vector<long long> a(n); for (int i = 0; i < n; i++) cin >> a[i]; ; sort(a.begin(), a.end()); long long mm = a[n / 2]; for (int i = n / 2; i < n - 1; i++) { long long r = a[i + 1] - a[i];...
#include <bits/stdc++.h> using namespace std; const int M = 200005; int n, m, tot, ans; struct Node { int u, v, w; } node[M]; int vis[M], match[M]; int sum1[M], sum2[M]; int head[M], Nxt[M], ver[M]; bool v[M], flag = 0; vector<int> e[M]; inline bool dfs(long long x) { for (int i = 0; i < e...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; for (int z = 0; z < t; z++) { int n; cin >> n; string s; cin >> s; bool found = false; for (int i = 0; i <= n - 11; i++) { if (s[i] == 8 ) { cout << YES << endl; ...
#include <bits/stdc++.h> using namespace std; template <class T> void show(const vector<T> &a) { for (T x : a) cout << x << ; cout << n ; } mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count()); vector<lo...
#include<bits/stdc++.h> using namespace std ; # define all(v) (v).begin() , (v).end() # define allrev(v) (v).rbegin() , (v).rend() # define allcomp(v) (v).begin() , (v).end() , comp # define ll long long # define line cout << n ; # define fast ios_base :: sync_with_stdio ( false ) ; cin.tie ( ...
#include <bits/stdc++.h> using namespace std; map<long long, long long> mp; void Hash(string str, long long B, long long mod) { long long power = 1, h = 0; long long m = (int)str.length(); for (long long i = m - 1; i >= 0; i--) { h = h + (power * (str[i] - a + 1)) % mod; h = h % mod; ...
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } int l = n - k; int max_1 = 0; for (int i = 0; i < (n - k); i++) { max_1 = max(max_1, a[i] + a[2 * (n - k) - i - 1]); } max_1 ...
#include <bits/stdc++.h> using namespace std; long long max(long long a, long long b) { if (a < b) return b; return a; } long long min(long long a, long long b) { if (a < b) return a; return b; } long long X; vector<long long> x; long long dfs(long long node, long long par, vector<vector...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:102400000,102400000 ) using std::bitset; using namespace std; int g[302][302][302], f[302][302]; int s[10]; int n, ans; void updateg(int a, int b, int c) { int i, j, tem, t; for (i = c + 1; i < 300; i++) { g[a][b][i] = 1; g[a][c]...
#include <bits/stdc++.h> using namespace std; int main() { long long int t, n, a, b, p, q, z, k; cin >> t; while (t--) { z = 0; k = 0; cin >> a >> b >> n; p = max(a, b); q = min(a, b); while (k <= n) { z++; k = q + p; q = p; p = k; ...
#include <bits/stdc++.h> using namespace std; int t, a[30], n, b[2010], r; vector<int> aux[30]; int val(int x, int y) { int hr = 0, hxt = 0; for (int i = 1; i <= aux[x].size() / 2; i++) { hxt = lower_bound(aux[y].begin(), aux[y].end(), aux[x][aux[x].size() - i]) - upper_bound(aux[y].be...
#include <bits/stdc++.h> using namespace std; int main() { long long b, r, g, w, i, j = 0, p = 0, n, m, s1, s2; cin >> n >> m >> s1 >> s2; if (s2 == 2) { cout << s1 << << s2 << endl; cout << 1 << << s2 << endl; for (i = 1; i <= n; i++) { if (i % 2 == 1) { ...
#pragma GCC optimize(3, Ofast , inline ) #include <bits/stdc++.h> #define rep(i,a,b) for(int i=(a);i<=(b);i++) using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> P; typedef pair<double, double> Pd; typedef pair<ll, ll> pll; const int maxn = 1e6+10...
#include <bits/stdc++.h> using namespace std; const int MAXN = 200100; mt19937 rnd; struct Treap { int id, y, best; Treap l, r; Treap(int id) : id(id), y(rnd()), best(id), l(NULL), r(NULL) {} }; int n, m; int x[MAXN]; long long len[MAXN]; int p[MAXN], b[MAXN]; set<pair<int, int> > aliv...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { string s, s1, s2; cin >> s >> s1 >> s2; bool lock = false; for (int i = 0; i < s.length(); i++) { if (s[i] == s2[i]) { swap(s1[i], s2[i]); } else { if (s1...
#include <bits/stdc++.h> using namespace std; const long long int sz = 2e5; long long int col[sz], vis[sz]; vector<long long int> adj[sz]; long long int n; void reset() { long long int i; for (i = 0; i < n + 14; i++) { col[i] = -1; adj[i].clear(); vis[i] = 0; } } void color...
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int lbracket = s.length(), rbracket = -1, lcolon = s.length(), rcolon = -1; for (int i = 0; i < s.length(); i++) if (s[i] == [ ) { lbracket = i; break; } for (int i = lbracket; i < s.lengt...
#include <bits/stdc++.h> using namespace std; const int NMAX = 1001000; long long a[NMAX * 2]; long long n, l, t; long long cnt(int i, int j) { long long v = (a[i] - a[j] + t * 2 + l) / l; return v; } long double ans(int i) { int lo = i + 2, hi = i + n; long long tv = cnt(i, i + 1); wh...
#include <bits/stdc++.h> using namespace std; const long long Mod = 1e9 + 7; const long long maxn = 700 + 10; long long n; long long brac[maxn]; char s[maxn]; stack<long long> sta; inline long long read() { long long x = 0; bool fopt = 1; char ch = getchar(); for (; !isdigit(ch); ch = ge...
#include<bits/stdc++.h> #pragma GCC optimize ( -O3 ) #define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define ll long long #define double long double #define pb push_back #define mod 1000000007 #define int long long #define endl n #define ss second #define ff first #define INF 1000...
#include <bits/stdc++.h> using namespace std; const int N = 15e4 + 10; long long a[N]; bool vis[N]; int main() { int n; scanf( %d , &n); set<pair<long long, int> > se; for (int i = 0; i < n; i++) { scanf( %lld , a + i); se.insert(pair<long long, int>(a[i], i)); } int sz = n...
#include <bits/stdc++.h> using namespace std; const int Maxn = 2005; int n; int p[Maxn], b[Maxn]; int inb[Maxn]; int res; int best[Maxn]; vector<pair<int, int> > seq; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &p[i]); for (int i = 1; i <= n; i++) { scanf( ...
#include <bits/stdc++.h> using namespace std; int n; vector<pair<int, int> > p; set<pair<int, int> > h; set<pair<int, int> > v; int cut(); int cut(set<pair<int, int> >::iterator s, set<pair<int, int> >::iterator e) { int c = 0; vector<int> all; while (s != e) { all.push_back(s->second); ...
#include <bits/stdc++.h> using namespace std; int n, ans, x, mn = 100001; vector<int> A, B; map<int, int> Ps1, Ps2, Mn; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> x; Ps1[x] = i; } for (int i = 0; i < n; i++) { cin >> x; Ps2[i] = Ps1[x]; } for (i...
#include <bits/stdc++.h> using namespace std; int num[5005]; int rmq(int l, int r) { int ans = 1 << 30, tmp = l; for (int i = l; i <= r; i++) { if (ans > num[i]) { ans = num[i]; tmp = i; } } return tmp; } int get(int l, int r, int h) { if (l > r) return 0; i...
#include <bits/stdc++.h> using namespace std; int g2[1002][1002]; int main() { int n, m; cin >> n >> m; for (int i = n; i <= m; i++) { int ind = 0; string s = to_string(i); string m = s; sort(s.begin(), s.end()); for (int p = 1; p < s.size(); p++) if (s[p] == s[p ...
#include <bits/stdc++.h> using namespace std; long long int c1, c2, x, y; long long int comp(long long int t) { long long int r1 = t / x, r2 = t / y, l = x * y, both = t / l; long long int left = t - r1 - r2 + both; r1 = r1 - both; r2 = r2 - both; long long int left1 = c1 - r2, left2 = c2 - r1...
#include <bits/stdc++.h> using namespace std; long long n, cnt; long long arr[100000], h[100000]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (long long i = 0; i <= n - 1; i++) { cin >> arr[i]; h[i] = arr[i]; } sort(h, h + n); for (long long i = 0...
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:1608864 ) void ASS(bool b) { if (!b) ++(int)0; } int main() { int n, m, k; scanf( %d %d %d , &n, &m, &k); const int inf = 1 << 30; vector<int> v(m, inf); for (int i = 0; i < (int)(n); i++) { int x, y;...
#include <bits/stdc++.h> using namespace std; const int Inf = 1000000000; const int Maxn = 30005; const int Maxk = 205; const int Maxd = 6; int n, k; int a[Maxn]; int dp[Maxn][Maxk][2][Maxd]; int main() { scanf( %d %d , &n, &k); for (int i = 0; i < n; i++) scanf( %d , &a[i]); fill((int*)dp...
#include <bits/stdc++.h> using namespace std; struct point { int x, y; point(){}; point(int xx, int yy) { x = xx; y = yy; } point friend operator+(point a, point b) { return point(a.x + b.x, a.y + b.y); } point friend operator-(point a, point b) { return point(a.x...
#include <bits/stdc++.h> using namespace std; const int maxn = 23333; int aa[maxn]; int p[maxn]; int main() { int a, b, w, x, c; scanf( %d%d%d%d%d , &a, &b, &w, &x, &c); c -= a; if (c <= 0) { printf( 0 n ); return 0; } int m = 0, haj; for (int i = b; !p[i];) { p[i...
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 50; int t, m, n; long long su, s[maxn], cf[maxn]; int a[maxn], b[maxn], c[maxn], x, y; int main() { scanf( %d %d , &n, &m); scanf( %d , a + 1); for (int i = 2; i <= m; ++i) { scanf( %d , a + i); su += abs(a[i] - a[i...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 10; int n, m; vector<int> g[MAXN]; int max1[MAXN], max2[MAXN]; bool vis[MAXN]; void dfs(int v) { vis[v] = true; for (auto to : g[v]) { if (!vis[to]) { dfs(to); if (max1[v] <= max1[to] + 1) { max2[v...
#include<bits/stdc++.h> using namespace std; #define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0) #define f first #define s second #define for1(i,a,b) for (int i = a; i < b; i++) #define for2(i,a,b) for (int i = a; i > b; i--) #define arrin(a,n) for (int i = 0; i < n; i++) cin >> a[i]; ...
#include <bits/stdc++.h> int n; char a[11][11], b[11][11], c[11][11]; void turn() { int i, j, k, l; for (i = n - 1, k = 0; i >= 0; --i, ++k) for (j = 0, l = 0; j < n; ++j, ++l) c[k][l] = a[j][i]; for (i = 0; i < n; ++i) for (j = 0; j < n; ++j) a[i][j] = c[i][j]; } int same() { int ...
#include <bits/stdc++.h> using namespace std; int const N = 1e6 + 6; bool us[N], use[N]; long long a[N]; long long n, x, k, q, x1, x2, y, ibibibibbibibibiibigbabypanfewewf, y2, ans, m; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> x1; for (int I = 0; I < x1; ...
#include <bits/stdc++.h> using namespace std; long long int power(long long int x, long long int n, long long int p) { long long int result = 1; while (n > 0) { if (n % 2 == 1) result = (result % p * x % p) % p; x = (x % p * x % p) % p; n = n / 2; } return result % p; } void so...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int i, a[26], ans = 0, tot = 0; string s; map<pair<long long int, long long int>, long long int> mp; for (i = 0; i < 26; i++) cin >> a[i]; cin >> s; for (i = 0; ...
#include <bits/stdc++.h> template <class T> T max(T a, T b, T c) { return max(a, max(b, c)); } using namespace std; int main() { cin.tie(NULL), ios_base::sync_with_stdio(false); int t; cin >> t; while (t--) { int a, b; cin >> a >> b; if (a > b) { if ((b - a) % 2 =...
#include <bits/stdc++.h> using namespace std; double pi = 3.14159265359; using namespace std; int main() { ios::sync_with_stdio(false); string a, b; cin >> a >> b; string c(a.size(), 0 ); int count = 0; for (unsigned int i = 0; i < a.size(); i++) if (a[i] == b[i]) c[i] = a[i], cou...
#include <bits/stdc++.h> using namespace std; long long mul[100010], inv[100010]; const int mod = 998244353; const int maxn = 5050; void init() { mul[0] = 1; for (int i = 1; i < maxn; i++) mul[i] = (mul[i - 1] * i) % mod; inv[0] = inv[1] = 1; for (int i = 2; i < maxn; i++) inv[i] = (long...
#include <bits/stdc++.h> using namespace std; const double pi = 2.0 * acos(0.0); const double eps = 1.0e-9; const int dr[] = {-1, 0, 1, 0}, dc[] = {0, 1, 0, -1}; const int dr6[] = {1, 1, 0, -1, -1, 0}, dc6[] = {0, 1, 1, 0, -1, -1}; const int dr8[] = {-1, -1, 0, 1, 1, 1, 0, -1}, dc8[] = {0, 1, 1,...
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { if (b == 0) return a; else return gcd(b, a % b); } int rev(int n) { int ret = 0; while (n != 0) { ret = (10 * ret) + (n % 10); n /= 10; } return ret; } int main() { int mx, my, w; in...
#include <bits/stdc++.h> using namespace std; const long long N = 5e5 + 10; int n, a[N], b[N], c[N], p[N]; vector<int> v; int main() { cin >> n; for (int i = 1; i < N; i++) p[i] = i; for (int i = 1; i <= n; i++) { cin >> a[i] >> b[i]; if (a[i] == 2) cin >> c[i]; } for (int i = ...
#include <bits/stdc++.h> using namespace std; queue<int> qQuit; int ind[100000], n; bool entered[100000]; priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > qLeft, qRight; int data[100000]; int main(void) { scanf( %d , &n); for (int i = 0; i <...
#include <bits/stdc++.h> using namespace std; int dque[500005]; int s = 0, t = 0, num = 0, q, maxi; double mean = 0; int main() { memset(dque, 0, sizeof(dque)); scanf( %d , &q); while (q--) { int type, x; scanf( %d , &type); if (type == 1) { scanf( %d , &x); if (n...
#include <bits/stdc++.h> using namespace std; int dp[605][305][305]; int a[305][305]; int max(int a, int b) { return a > b ? a : b; } int main() { int n; while (scanf( %d , &n) != EOF) { int i, j, k; for (i = 0; i < n; i++) { for (j = 0; j < n; j++) { scanf( %d , &a[i][j]...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; deque<int> vec(300000); int l = 0, r = 0; for (int i = 0; i < n; i++) { string s; int id; cin >> s >> id; if (!i) { vec[id] = l; l--, r++; } else { if (s == L ) { ...
#include <bits/stdc++.h> using namespace std; vector<long long> adj[1002]; map<long long, long long> vis; map<pair<long long, long long>, long long> dia; long long st[1002], en[1002]; void dfs(long long tar, long long cur, bool &found, long long mini, long long &mini2) { vis[cur] = 1; if ...
#include <bits/stdc++.h> using namespace std; char mp[1001][1001]; int visit[1001][1001]; int dist[1001][1001]; int N, M; int dx[] = {1, -1, 0, 0}; int dy[] = {0, 0, 1, -1}; bool chk(int x, int y) { return 0 <= x && x < N && 0 <= y && y < M; } void dfs(int x, int y, bool isfirst) { visit[x][y] = 1...
#include <bits/stdc++.h> using namespace std; const double eps = 1e-15; const double pi = acos(-1.0); const long long Mod = 1000000007; const int N = 1e3 + 5; int ks = 0; int n, m, s, t; long long dis[N], cost[N * 10], L; int used[N], deleted[N * 10]; pair<int, int> parent[N]; vector<pair<int, int...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int pre = INT_MIN; int cur; int state = 0; for (int i = 0; i < n; i++) { cin >> cur; if (cur > pre) { if (state == 0) { pre = cur; continue; } else { cout << ...
#include <bits/stdc++.h> int main(int argc, const char* argv[]) { int n; std::cin >> n; std::string s; std::cin >> s; std::vector<int> v0(n); for (int i = 0; i < n; i++) v0[i] = s[i] - 0 ; bool add = true; std::vector<int> v1(n); for (int i = 0; i < n; i++) { if (add) ...
#include <bits/stdc++.h> using namespace std; int mod = 1e9 + 7; struct node { long long x, l, r; } a[10005]; long long b[20005]; int is[20005][4], ed[20005][4]; int l = 2; struct Matrix { long long v[3][3]; Matrix() { memset(v, 0, sizeof(v)); } Matrix operator*(const Matrix B) { M...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; int x = 1; while (x <= n) { if (x == n \|\| x + 1 == n) { cout << 1 << n ; return 0; } if (x & 1) { x = x * 2 + 2; } else { ...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 6; vector<pair<int, int> > G[maxn]; int out, m, d[maxn], ans[maxn][3], leaf[maxn][2]; void add_m(int u, int v, int d) { ans[++m][0] = u, ans[m][1] = v, ans[m][2] = d; } void add_link(int u, int l, int d) { if (u == out) { a...
#include <bits/stdc++.h> using namespace std; int main(int argc, char *argv[]) { int n, k, j, i, a[10001], s[1002], n1, n2, num[1002], h1, h2; double x, sum1, sum2, l, r, m; scanf( %d %d , &n, &k); h1 = 1000; h2 = 0; for (i = 0; i < n; i++) { cin >> a[i]; if (h1 > a[i]) h1 = a[i]...
#include <bits/stdc++.h> using namespace std; long long vectorMult(pair<int, int> a, pair<int, int> b, pair<int, int> c) { return (c.first - a.first) * 1ll * (b.second - a.second) - (c.second - a.second) * 1ll * (b.first - a.first); } bool cmp(pair<int, int> a, pair<int, int> b) { return a.fi...
#include <bits/stdc++.h> using namespace std; const long long N = 2e6 + 5, Mod = 1e9 + 7, Lg = 27, P = 727, Sq = 350; const long long Inf = 3e18 + 10; long long ans; long long gcd(long long x, long long y) { if (x > y) swap(y, x); if (!x) return y; return gcd(x, y % x); } void solve(long long ...
#include <bits/stdc++.h> using namespace std; template <typename _T> inline void read(_T &f) { f = 0; _T fu = 1; char c = getchar(); while (c < 0 \|\| c > 9 ) { if (c == - ) { fu = -1; } c = getchar(); } while (c >= 0 && c <= 9 ) { f = (f << 3) + (f << ...
#include <bits/stdc++.h> using namespace std; pair<pair<long long, long long>, pair<long long, long long> > st1[4000000]; pair<pair<long long, long long>, pair<long long, long long> > st2[4000000]; long long arrL[600010]; long long arrR[600010]; long long dist[600010]; long long height[600010]; pair<pai...
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const int N = 3e6 + 7; const int INF = 1e9 + 9; const int xi[] = {0, 0, +1, -1}; const int yi[] = {-1, +1, 0, 0}; const int xxi[] = {-1, +1, 0, 0, -1, +1, +1, -1}; const int yyi[] = {0, 0, -1, +1, -1, +1, -1, +1}; int n, ans;...
#include <bits/stdc++.h> using namespace std; template <class T> inline int read(T& x) { static char ch; static bool neg; for (ch = neg = 0; ch < 0 \|\| 9 < ch; neg \|= ch == - , ch = getchar()) ; for (x = 0; 0 <= ch && ch <= 9 ; (x *= 10) += ch - 0 , ch = getchar()) ; return...
#include <bits/stdc++.h> using namespace std; constexpr int MAXN = 200000; int x[MAXN + 2]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) cin >> x[i]; sort(x, x + n); int ans = INT_MAX; for (int i = 0; i < n / 2; i++) ans = min(ans, x[i + n / 2] - x[i]); cout << ans << en...
#include <bits/stdc++.h> using namespace std; int main() { int n, m, i, j, k, q; scanf( %d%d , &n, &k); n = 1 << n; printf( %d , (n >> (k < n)) - 1), q = i = 0; while (++i < n) if (i < (i ^ k)) printf( %d , i ^ q), q = i; }
#include <bits/stdc++.h> using namespace std; queue<pair<int, int> > L, R; int **M; int ori, n, m; bool play(pair<int, int> &p, int &ori) { for (int i = 0; i < 2; i++) { if (ori == 0) { if (M[p.first + 1][p.second] > 0) ori++; else { p = {p.first + 1, p.second}; ...
#include <bits/stdc++.h> using namespace std; string multiply(string num1, string num2) { int len1 = num1.size(); int len2 = num2.size(); if (len1 == 0 \|\| len2 == 0) return 0 ; vector<int> result(len1 + len2, 0); int i_n1 = 0; int i_n2 = 0; for (int i = len1 - 1; i >= 0; i--) { in...
#include <bits/stdc++.h> using namespace std; template <class T> inline T gcd(T a, T b) { if (a < 0) return gcd(-a, b); if (b < 0) return gcd(a, -b); return (b == 0) ? a : gcd(b, a % b); } template <class T> inline T lcm(T a, T b) { if (a < 0) return lcm(-a, b); if (b < 0) return lcm(a, ...
#include <bits/stdc++.h> using namespace std; const int N = int(1e5) + 500; int n, m, a[N], s, h, mm; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> s; for (int i = 1; i <= n; i++) { cin >> h >> mm; a[++m] = h * 60 + mm; } if (a[1] >= s + 1) { cout <...
#include <bits/stdc++.h> using namespace std; string second; int n, k; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); ; cin >> second >> k; if (second.size() < k) return cout << impossible n , 0; set<char> st; for (auto i : second) st.insert(i); if (st.size() > ...
#include <bits/stdc++.h> using namespace std; int arr[60]; signed main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; for (int i = 0; i < n; ++i) cin >> arr[i]; sort(arr, arr + n); bool aliceWins = (arr[0] < arr[n >> 1]); cout << (aliceWins ? Alice n : Bob n ); }
#include <bits/stdc++.h> using namespace std; const int maxn = 3e8; int l, r, cnt, ans1, pre1[20000005]; bitset<maxn> pre; int max1, max2; int main() { cin >> l >> r; pre[1] = pre[0] = 1; ans1 = 1; for (int yui = 2; yui <= r; yui++) { if (pre[yui] == 0) { cnt++; pre1[cn...

#include <bits/stdc++.h> using namespace std; const int N = 2e6 + 5; struct bing { int fa[N]; void init() { for (int i = (1); i < (N); i++) fa[i] = i; } int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); } void unite(int x, int y) { fa[find(x)] = find(y); } bool same(int ...

#include <bits/stdc++.h> using namespace std; int main() { int i, j, k, m, n, rez = 0; int a[300]; bool b[300] = {0}; bool c; cin >> n >> k; for (i = 1; i <= 2 * n + 1; i++) cin >> a[i]; for (j = 0; j < k; j++) { c = true; i = 2; while (c) { if (!b[i] && a[i] > ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 10; const int MAXM = 1e6 + 10; const int MAXLOG = 20; struct Edge { int x, y, w; int id; } edge[MAXM]; int T, n, m, i; int val; vector<pair<int, int> > e[MAXN]; int fa[MAXN], anc[MAXN][MAXLOG], dep[MAXN]; int ans[MAXM]; ...

#include <bits/stdc++.h> using namespace std; using namespace std; int M1(int x) { return x >= 1000000007 ? x - 1000000007 : x; } int M2(int x) { return x >= 1000000009 ? x - 1000000009 : x; } struct Hash { int a, b; Hash() { a = b = 0; } Hash(int a, int b) : a(a), b(b) {} Hash(int a) : a(a), ...

#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int l = s.length(); vector<vector<int>> dp(5000, vector<int>(5000, 0)); vector<int> kk(s.size() + 1, 0); for (int length = 1; length <= l; length++) { for (int right = 0; right < s.size(); right++) { ...

#include <bits/stdc++.h> using namespace std; const int Z = (int)3e3 + 111; const int N = (int)1e6 + 111; const int INF = (int)1e9 + 111; const int MOD = (int)1e9 + 7; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); string t, ans; cin >> t; int k; if (t.size()...

#include <bits/stdc++.h> using namespace std; const double EPS = 1e-8; const long long mod = (int)1e9 + 7; int dx[] = {0, 0, -1, 1, 1, 1, -1, -1}; int dy[] = {1, -1, 0, 0, 1, -1, -1, 1}; const int N = 1000001; void stop() {} void file() {} struct point { long long x, y; }; unsigned long long g...

#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, first, second, third, fourth; cin >> a >> b >> c; first = a + b + c; second = 2 * (a + b); third = 2 * (b + c); fourth = 2 * (a + c); cout << min(first, min(second, min(third, fourth))); }

#include <bits/stdc++.h> #pragma comment(linker, /STACK:200000000 ) using namespace std; template <typename T> inline T Abs(T x) { return (x >= 0) ? x : -x; } template <typename T> inline T sqr(T x) { return x * x; } template <typename T> string toStr(T x) { stringstream st; st << x...

#include <bits/stdc++.h> using namespace std; int main() { int n, count = 0; string s; cin >> n >> s; for (int i = 0; i < n; i++) { if (s[i] == 8 ) count++; } if (n < 11) cout << 0 << endl; else { cout << min(count, n / 11) << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; const int maxn = 100005; int a[maxn], n, x, k, l; long long ans = 0; int main() { cin >> n >> x; for (int i = 1; i <= n; i++) { cin >> k >> l; ans += min(k, l); a[i] = min(max(l - k, 0), k); } sort(a + 1, a + 1 + n); for (int ...

#include <bits/stdc++.h> using namespace std; const int N = 500005, M = 60; int q, fa[N], n = 1; double dp[N][M + 5]; int main() { ios::sync_with_stdio(false); cin >> q; int opt, pos; for (int i = 0; i <= M; i++) dp[1][i] = 1; for (int _ = 1; _ <= q; _++) { cin >> opt >> pos; i...

#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > all; int isable[100005], cnt[100005]; int main() { int i, n, k; scanf( %d , &n); scanf( %d , &k); long long b; scanf( %I64d , &b); for (i = 0; i < n; i++) { int x; scanf( %d , &x); cnt[i] = x; i...

#include <bits/stdc++.h> using namespace std; int main() { string a; string b; cin >> a >> b; long long int len1 = a.length(); long long int len2 = b.length(); if (a.compare(b) == 0) { cout << -1 n ; } else { if (len1 > len2) cout << len1 << n ; else ...

#include <bits/stdc++.h> using namespace std; const int MAX = 1e5 + 10; const double eps = 1e-6; int n, m; int sum, res; int f[21][1 << 21], col[MAX]; char s[MAX]; int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) { scanf( %s , s); for (int j = 0; j < m; j++) if...

#include <bits/stdc++.h> using namespace std; using ll = int; namespace SEG { static const ll STAR = 1, FINI = 2e5 + 110; struct NODE { ll l, r, min; NODE() : l(0), r(0), min(0) {} } node[1000000 * 10 + 110]; ll newnode(ll pre = 0) { static ll cnt = 0; node[++cnt] = node[pre]; return c...

#include <bits/stdc++.h> using namespace std; const int maxn = 250005; int qr[maxn], qp[maxn], wm[maxn], loc[maxn]; int pp[maxn], pr[maxn], pm[maxn]; long long pd[maxn]; stack<int> f[maxn]; bool used[maxn]; int n, nx, ny, totm; long long dist(int x, int y) { return (long long)x * x + (long long)y * y;...

#include <bits/stdc++.h> using namespace std; int n, k, d[2][100005], q1[100005], q2[100005], x, y, st, en; char s[2][100005]; int main() { cin >> n >> k; cin >> s[0]; cin >> s[1]; d[0][0] = 1; for (en = 1; st < en;) { x = q1[st]; y = q2[st++]; if (y >= n - k) { cou...

#include <bits/stdc++.h> using namespace std; int main() { int a[20]; a[0] = 2; a[1] = 3; a[2] = 5; a[3] = 7; a[4] = 11; a[5] = 13; a[6] = 17; a[7] = 19; a[8] = 23; a[9] = 29; a[10] = 31; a[11] = 37; a[12] = 41; a[13] = 43; a[14] = 47; a[15] = 4; ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 5 * 100000; vector<int> g[MAXN + 1], e[MAXN + 1]; int col[MAXN + 1], cur = 1, used[MAXN + 1]; void dfs(int v, int p) { int num = 1; vector<int> del; for (auto x : g[v]) { del.push_back(col[x]); used[col[x]] = 1; } f...

#include <bits/stdc++.h> using namespace std; struct Person { int a; int id; }; bool operator<(Person a, Person b) { return a.a < b.a; } class TSolver { public: int n; vector<Person> persons; explicit TSolver(std::istream& in) { in >> n; persons.resize(n); for (int i =...

#include <bits/stdc++.h> using namespace std; long long binpow(long long a, long long b) { long long exp = 10e9; long long res = 1; while (b > 0) { if (b & 1) res = ((res % exp) * (a % exp)) % exp; a = ((a % exp) * (a % exp)) % exp; b >>= 1; } return res; } bool isprime(int...

#include <bits/stdc++.h> using namespace std; #define vec vector #define PB push_back #define MP make_pair #define MT make_tuple #define F first #define S second using ll = long long int; // watch out for overflows in your code using pii = pair<int,int>; //mt19937 rng(chrono::steady...

#include <bits/stdc++.h> using namespace std; const int N = 100; const int M = 2e6 + 7; const int inf = 1e9; int n, m, mx, p[N], minn[N], D[M][2], sum = 0; int a[N][N]; bool check() { for (int t = 0, tE = (1 << mx) - 1; t <= tE; t++) { int ds = 0, bs = 0; for (int i = 1, iE = mx; i <= iE; ...

#include <bits/stdc++.h> using namespace std; int main() { int i, j, k, l, n, m, A[11] = {0}, count = 0, B[2000], sum1, sum2, last, flag = 0; char ch; for (i = 1; i <= 10; i++) { scanf( %c , &ch); if (ch == 1 ) A[i] = 1; else A[i] = 0; } ...

#include<bits/stdc++.h> using namespace std; typedef long long ll; void solve() { int x,y; cin>>x>>y; string s; cin>>s; int cR=0,cU=0,cL=0,cD=0; for(int i=0;i<s.size();i++) { if(s[i]== R ) cR++; else if(s[i]== U ) cU++;...

#include <bits/stdc++.h> using namespace std; inline int read() { int f = 1, ans = 0; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { ans = ans * 10 + c - 0 ; c = getchar(); } return f * ans; ...

#include <bits/stdc++.h> using namespace std; void solve() { long long n, k; cin >> n >> k; vector<long long> a(n); for (int i = 0; i < n; i++) cin >> a[i]; ; sort(a.begin(), a.end()); long long mm = a[n / 2]; for (int i = n / 2; i < n - 1; i++) { long long r = a[i + 1] - a[i];...

#include <bits/stdc++.h> using namespace std; const int M = 200005; int n, m, tot, ans; struct Node { int u, v, w; } node[M]; int vis[M], match[M]; int sum1[M], sum2[M]; int head[M], Nxt[M], ver[M]; bool v[M], flag = 0; vector<int> e[M]; inline bool dfs(long long x) { for (int i = 0; i < e...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; for (int z = 0; z < t; z++) { int n; cin >> n; string s; cin >> s; bool found = false; for (int i = 0; i <= n - 11; i++) { if (s[i] == 8 ) { cout << YES << endl; ...

#include <bits/stdc++.h> using namespace std; template <class T> void show(const vector<T> &a) { for (T x : a) cout << x << ; cout << n ; } mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count()); vector<lo...

#include<bits/stdc++.h> using namespace std ; # define all(v) (v).begin() , (v).end() # define allrev(v) (v).rbegin() , (v).rend() # define allcomp(v) (v).begin() , (v).end() , comp # define ll long long # define line cout << n ; # define fast ios_base :: sync_with_stdio ( false ) ; cin.tie ( ...

#include <bits/stdc++.h> using namespace std; map<long long, long long> mp; void Hash(string str, long long B, long long mod) { long long power = 1, h = 0; long long m = (int)str.length(); for (long long i = m - 1; i >= 0; i--) { h = h + (power * (str[i] - a + 1)) % mod; h = h % mod; ...

#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } int l = n - k; int max_1 = 0; for (int i = 0; i < (n - k); i++) { max_1 = max(max_1, a[i] + a[2 * (n - k) - i - 1]); } max_1 ...

#include <bits/stdc++.h> using namespace std; long long max(long long a, long long b) { if (a < b) return b; return a; } long long min(long long a, long long b) { if (a < b) return a; return b; } long long X; vector<long long> x; long long dfs(long long node, long long par, vector<vector...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:102400000,102400000 ) using std::bitset; using namespace std; int g[302][302][302], f[302][302]; int s[10]; int n, ans; void updateg(int a, int b, int c) { int i, j, tem, t; for (i = c + 1; i < 300; i++) { g[a][b][i] = 1; g[a][c]...

#include <bits/stdc++.h> using namespace std; int main() { long long int t, n, a, b, p, q, z, k; cin >> t; while (t--) { z = 0; k = 0; cin >> a >> b >> n; p = max(a, b); q = min(a, b); while (k <= n) { z++; k = q + p; q = p; p = k; ...

#include <bits/stdc++.h> using namespace std; int t, a[30], n, b[2010], r; vector<int> aux[30]; int val(int x, int y) { int hr = 0, hxt = 0; for (int i = 1; i <= aux[x].size() / 2; i++) { hxt = lower_bound(aux[y].begin(), aux[y].end(), aux[x][aux[x].size() - i]) - upper_bound(aux[y].be...

#include <bits/stdc++.h> using namespace std; int main() { long long b, r, g, w, i, j = 0, p = 0, n, m, s1, s2; cin >> n >> m >> s1 >> s2; if (s2 == 2) { cout << s1 << << s2 << endl; cout << 1 << << s2 << endl; for (i = 1; i <= n; i++) { if (i % 2 == 1) { ...

#pragma GCC optimize(3, Ofast , inline ) #include <bits/stdc++.h> #define rep(i,a,b) for(int i=(a);i<=(b);i++) using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> P; typedef pair<double, double> Pd; typedef pair<ll, ll> pll; const int maxn = 1e6+10...

#include <bits/stdc++.h> using namespace std; const int MAXN = 200100; mt19937 rnd; struct Treap { int id, y, best; Treap *l, *r; Treap(int id) : id(id), y(rnd()), best(id), l(NULL), r(NULL) {} }; int n, m; int x[MAXN]; long long len[MAXN]; int p[MAXN], b[MAXN]; set<pair<int, int> > aliv...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { string s, s1, s2; cin >> s >> s1 >> s2; bool lock = false; for (int i = 0; i < s.length(); i++) { if (s[i] == s2[i]) { swap(s1[i], s2[i]); } else { if (s1...

#include <bits/stdc++.h> using namespace std; const long long int sz = 2e5; long long int col[sz], vis[sz]; vector<long long int> adj[sz]; long long int n; void reset() { long long int i; for (i = 0; i < n + 14; i++) { col[i] = -1; adj[i].clear(); vis[i] = 0; } } void color...

#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int lbracket = s.length(), rbracket = -1, lcolon = s.length(), rcolon = -1; for (int i = 0; i < s.length(); i++) if (s[i] == [ ) { lbracket = i; break; } for (int i = lbracket; i < s.lengt...

#include <bits/stdc++.h> using namespace std; const int NMAX = 1001000; long long a[NMAX * 2]; long long n, l, t; long long cnt(int i, int j) { long long v = (a[i] - a[j] + t * 2 + l) / l; return v; } long double ans(int i) { int lo = i + 2, hi = i + n; long long tv = cnt(i, i + 1); wh...

#include <bits/stdc++.h> using namespace std; const long long Mod = 1e9 + 7; const long long maxn = 700 + 10; long long n; long long brac[maxn]; char s[maxn]; stack<long long> sta; inline long long read() { long long x = 0; bool fopt = 1; char ch = getchar(); for (; !isdigit(ch); ch = ge...

#include<bits/stdc++.h> #pragma GCC optimize ( -O3 ) #define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define ll long long #define double long double #define pb push_back #define mod 1000000007 #define int long long #define endl n #define ss second #define ff first #define INF 1000...

#include <bits/stdc++.h> using namespace std; const int N = 15e4 + 10; long long a[N]; bool vis[N]; int main() { int n; scanf( %d , &n); set<pair<long long, int> > se; for (int i = 0; i < n; i++) { scanf( %lld , a + i); se.insert(pair<long long, int>(a[i], i)); } int sz = n...

#include <bits/stdc++.h> using namespace std; const int Maxn = 2005; int n; int p[Maxn], b[Maxn]; int inb[Maxn]; int res; int best[Maxn]; vector<pair<int, int> > seq; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &p[i]); for (int i = 1; i <= n; i++) { scanf( ...

#include <bits/stdc++.h> using namespace std; int n; vector<pair<int, int> > p; set<pair<int, int> > h; set<pair<int, int> > v; int cut(); int cut(set<pair<int, int> >::iterator s, set<pair<int, int> >::iterator e) { int c = 0; vector<int> all; while (s != e) { all.push_back(s->second); ...

#include <bits/stdc++.h> using namespace std; int n, ans, x, mn = 100001; vector<int> A, B; map<int, int> Ps1, Ps2, Mn; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> x; Ps1[x] = i; } for (int i = 0; i < n; i++) { cin >> x; Ps2[i] = Ps1[x]; } for (i...

#include <bits/stdc++.h> using namespace std; int num[5005]; int rmq(int l, int r) { int ans = 1 << 30, tmp = l; for (int i = l; i <= r; i++) { if (ans > num[i]) { ans = num[i]; tmp = i; } } return tmp; } int get(int l, int r, int h) { if (l > r) return 0; i...

#include <bits/stdc++.h> using namespace std; int g2[1002][1002]; int main() { int n, m; cin >> n >> m; for (int i = n; i <= m; i++) { int ind = 0; string s = to_string(i); string m = s; sort(s.begin(), s.end()); for (int p = 1; p < s.size(); p++) if (s[p] == s[p ...

#include <bits/stdc++.h> using namespace std; long long int c1, c2, x, y; long long int comp(long long int t) { long long int r1 = t / x, r2 = t / y, l = x * y, both = t / l; long long int left = t - r1 - r2 + both; r1 = r1 - both; r2 = r2 - both; long long int left1 = c1 - r2, left2 = c2 - r1...

#include <bits/stdc++.h> using namespace std; long long n, cnt; long long arr[100000], h[100000]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (long long i = 0; i <= n - 1; i++) { cin >> arr[i]; h[i] = arr[i]; } sort(h, h + n); for (long long i = 0...

#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:1608864 ) void ASS(bool b) { if (!b) ++*(int*)0; } int main() { int n, m, k; scanf( %d %d %d , &n, &m, &k); const int inf = 1 << 30; vector<int> v(m, inf); for (int i = 0; i < (int)(n); i++) { int x, y;...

#include <bits/stdc++.h> using namespace std; const int Inf = 1000000000; const int Maxn = 30005; const int Maxk = 205; const int Maxd = 6; int n, k; int a[Maxn]; int dp[Maxn][Maxk][2][Maxd]; int main() { scanf( %d %d , &n, &k); for (int i = 0; i < n; i++) scanf( %d , &a[i]); fill((int*)dp...

#include <bits/stdc++.h> using namespace std; struct point { int x, y; point(){}; point(int xx, int yy) { x = xx; y = yy; } point friend operator+(point a, point b) { return point(a.x + b.x, a.y + b.y); } point friend operator-(point a, point b) { return point(a.x...

#include <bits/stdc++.h> using namespace std; const int maxn = 23333; int aa[maxn]; int p[maxn]; int main() { int a, b, w, x, c; scanf( %d%d%d%d%d , &a, &b, &w, &x, &c); c -= a; if (c <= 0) { printf( 0 n ); return 0; } int m = 0, haj; for (int i = b; !p[i];) { p[i...

#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 50; int t, m, n; long long su, s[maxn], cf[maxn]; int a[maxn], b[maxn], c[maxn], x, y; int main() { scanf( %d %d , &n, &m); scanf( %d , a + 1); for (int i = 2; i <= m; ++i) { scanf( %d , a + i); su += abs(a[i] - a[i...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 10; int n, m; vector<int> g[MAXN]; int max1[MAXN], max2[MAXN]; bool vis[MAXN]; void dfs(int v) { vis[v] = true; for (auto to : g[v]) { if (!vis[to]) { dfs(to); if (max1[v] <= max1[to] + 1) { max2[v...

#include<bits/stdc++.h> using namespace std; #define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0) #define f first #define s second #define for1(i,a,b) for (int i = a; i < b; i++) #define for2(i,a,b) for (int i = a; i > b; i--) #define arrin(a,n) for (int i = 0; i < n; i++) cin >> a[i]; ...

#include <bits/stdc++.h> int n; char a[11][11], b[11][11], c[11][11]; void turn() { int i, j, k, l; for (i = n - 1, k = 0; i >= 0; --i, ++k) for (j = 0, l = 0; j < n; ++j, ++l) c[k][l] = a[j][i]; for (i = 0; i < n; ++i) for (j = 0; j < n; ++j) a[i][j] = c[i][j]; } int same() { int ...

#include <bits/stdc++.h> using namespace std; int const N = 1e6 + 6; bool us[N], use[N]; long long a[N]; long long n, x, k, q, x1, x2, y, ibibibibbibibibiibigbabypanfewewf, y2, ans, m; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> x1; for (int I = 0; I < x1; ...

#include <bits/stdc++.h> using namespace std; long long int power(long long int x, long long int n, long long int p) { long long int result = 1; while (n > 0) { if (n % 2 == 1) result = (result % p * x % p) % p; x = (x % p * x % p) % p; n = n / 2; } return result % p; } void so...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int i, a[26], ans = 0, tot = 0; string s; map<pair<long long int, long long int>, long long int> mp; for (i = 0; i < 26; i++) cin >> a[i]; cin >> s; for (i = 0; ...

#include <bits/stdc++.h> template <class T> T max(T a, T b, T c) { return max(a, max(b, c)); } using namespace std; int main() { cin.tie(NULL), ios_base::sync_with_stdio(false); int t; cin >> t; while (t--) { int a, b; cin >> a >> b; if (a > b) { if ((b - a) % 2 =...

#include <bits/stdc++.h> using namespace std; double pi = 3.14159265359; using namespace std; int main() { ios::sync_with_stdio(false); string a, b; cin >> a >> b; string c(a.size(), 0 ); int count = 0; for (unsigned int i = 0; i < a.size(); i++) if (a[i] == b[i]) c[i] = a[i], cou...

#include <bits/stdc++.h> using namespace std; long long mul[100010], inv[100010]; const int mod = 998244353; const int maxn = 5050; void init() { mul[0] = 1; for (int i = 1; i < maxn; i++) mul[i] = (mul[i - 1] * i) % mod; inv[0] = inv[1] = 1; for (int i = 2; i < maxn; i++) inv[i] = (long...

#include <bits/stdc++.h> using namespace std; const double pi = 2.0 * acos(0.0); const double eps = 1.0e-9; const int dr[] = {-1, 0, 1, 0}, dc[] = {0, 1, 0, -1}; const int dr6[] = {1, 1, 0, -1, -1, 0}, dc6[] = {0, 1, 1, 0, -1, -1}; const int dr8[] = {-1, -1, 0, 1, 1, 1, 0, -1}, dc8[] = {0, 1, 1,...

#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { if (b == 0) return a; else return gcd(b, a % b); } int rev(int n) { int ret = 0; while (n != 0) { ret = (10 * ret) + (n % 10); n /= 10; } return ret; } int main() { int mx, my, w; in...

#include <bits/stdc++.h> using namespace std; const long long N = 5e5 + 10; int n, a[N], b[N], c[N], p[N]; vector<int> v; int main() { cin >> n; for (int i = 1; i < N; i++) p[i] = i; for (int i = 1; i <= n; i++) { cin >> a[i] >> b[i]; if (a[i] == 2) cin >> c[i]; } for (int i = ...

#include <bits/stdc++.h> using namespace std; queue<int> qQuit; int ind[100000], n; bool entered[100000]; priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > qLeft, qRight; int data[100000]; int main(void) { scanf( %d , &n); for (int i = 0; i <...

#include <bits/stdc++.h> using namespace std; int dque[500005]; int s = 0, t = 0, num = 0, q, maxi; double mean = 0; int main() { memset(dque, 0, sizeof(dque)); scanf( %d , &q); while (q--) { int type, x; scanf( %d , &type); if (type == 1) { scanf( %d , &x); if (n...

#include <bits/stdc++.h> using namespace std; int dp[605][305][305]; int a[305][305]; int max(int a, int b) { return a > b ? a : b; } int main() { int n; while (scanf( %d , &n) != EOF) { int i, j, k; for (i = 0; i < n; i++) { for (j = 0; j < n; j++) { scanf( %d , &a[i][j]...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; deque<int> vec(300000); int l = 0, r = 0; for (int i = 0; i < n; i++) { string s; int id; cin >> s >> id; if (!i) { vec[id] = l; l--, r++; } else { if (s == L ) { ...

#include <bits/stdc++.h> using namespace std; vector<long long> adj[1002]; map<long long, long long> vis; map<pair<long long, long long>, long long> dia; long long st[1002], en[1002]; void dfs(long long tar, long long cur, bool &found, long long mini, long long &mini2) { vis[cur] = 1; if ...

#include <bits/stdc++.h> using namespace std; char mp[1001][1001]; int visit[1001][1001]; int dist[1001][1001]; int N, M; int dx[] = {1, -1, 0, 0}; int dy[] = {0, 0, 1, -1}; bool chk(int x, int y) { return 0 <= x && x < N && 0 <= y && y < M; } void dfs(int x, int y, bool isfirst) { visit[x][y] = 1...

#include <bits/stdc++.h> using namespace std; const double eps = 1e-15; const double pi = acos(-1.0); const long long Mod = 1000000007; const int N = 1e3 + 5; int ks = 0; int n, m, s, t; long long dis[N], cost[N * 10], L; int used[N], deleted[N * 10]; pair<int, int> parent[N]; vector<pair<int, int...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int pre = INT_MIN; int cur; int state = 0; for (int i = 0; i < n; i++) { cin >> cur; if (cur > pre) { if (state == 0) { pre = cur; continue; } else { cout << ...

#include <bits/stdc++.h> int main(int argc, const char* argv[]) { int n; std::cin >> n; std::string s; std::cin >> s; std::vector<int> v0(n); for (int i = 0; i < n; i++) v0[i] = s[i] - 0 ; bool add = true; std::vector<int> v1(n); for (int i = 0; i < n; i++) { if (add) ...

#include <bits/stdc++.h> using namespace std; int mod = 1e9 + 7; struct node { long long x, l, r; } a[10005]; long long b[20005]; int is[20005][4], ed[20005][4]; int l = 2; struct Matrix { long long v[3][3]; Matrix() { memset(v, 0, sizeof(v)); } Matrix operator*(const Matrix B) { M...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; int x = 1; while (x <= n) { if (x == n || x + 1 == n) { cout << 1 << n ; return 0; } if (x & 1) { x = x * 2 + 2; } else { ...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 6; vector<pair<int, int> > G[maxn]; int out, m, d[maxn], ans[maxn][3], leaf[maxn][2]; void add_m(int u, int v, int d) { ans[++m][0] = u, ans[m][1] = v, ans[m][2] = d; } void add_link(int u, int l, int d) { if (u == out) { a...

#include <bits/stdc++.h> using namespace std; int main(int argc, char *argv[]) { int n, k, j, i, a[10001], s[1002], n1, n2, num[1002], h1, h2; double x, sum1, sum2, l, r, m; scanf( %d %d , &n, &k); h1 = 1000; h2 = 0; for (i = 0; i < n; i++) { cin >> a[i]; if (h1 > a[i]) h1 = a[i]...

#include <bits/stdc++.h> using namespace std; long long vectorMult(pair<int, int> a, pair<int, int> b, pair<int, int> c) { return (c.first - a.first) * 1ll * (b.second - a.second) - (c.second - a.second) * 1ll * (b.first - a.first); } bool cmp(pair<int, int> a, pair<int, int> b) { return a.fi...

#include <bits/stdc++.h> using namespace std; const long long N = 2e6 + 5, Mod = 1e9 + 7, Lg = 27, P = 727, Sq = 350; const long long Inf = 3e18 + 10; long long ans; long long gcd(long long x, long long y) { if (x > y) swap(y, x); if (!x) return y; return gcd(x, y % x); } void solve(long long ...

#include <bits/stdc++.h> using namespace std; template <typename _T> inline void read(_T &f) { f = 0; _T fu = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) { fu = -1; } c = getchar(); } while (c >= 0 && c <= 9 ) { f = (f << 3) + (f << ...

#include <bits/stdc++.h> using namespace std; pair<pair<long long, long long>, pair<long long, long long> > st1[4000000]; pair<pair<long long, long long>, pair<long long, long long> > st2[4000000]; long long arrL[600010]; long long arrR[600010]; long long dist[600010]; long long height[600010]; pair<pai...

#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const int N = 3e6 + 7; const int INF = 1e9 + 9; const int xi[] = {0, 0, +1, -1}; const int yi[] = {-1, +1, 0, 0}; const int xxi[] = {-1, +1, 0, 0, -1, +1, +1, -1}; const int yyi[] = {0, 0, -1, +1, -1, +1, -1, +1}; int n, ans;...

#include <bits/stdc++.h> using namespace std; template <class T> inline int read(T& x) { static char ch; static bool neg; for (ch = neg = 0; ch < 0 || 9 < ch; neg |= ch == - , ch = getchar()) ; for (x = 0; 0 <= ch && ch <= 9 ; (x *= 10) += ch - 0 , ch = getchar()) ; return...

#include <bits/stdc++.h> using namespace std; constexpr int MAXN = 200000; int x[MAXN + 2]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) cin >> x[i]; sort(x, x + n); int ans = INT_MAX; for (int i = 0; i < n / 2; i++) ans = min(ans, x[i + n / 2] - x[i]); cout << ans << en...

#include <bits/stdc++.h> using namespace std; int main() { int n, m, i, j, k, q; scanf( %d%d , &n, &k); n = 1 << n; printf( %d , (n >> (k < n)) - 1), q = i = 0; while (++i < n) if (i < (i ^ k)) printf( %d , i ^ q), q = i; }

#include <bits/stdc++.h> using namespace std; queue<pair<int, int> > L, R; int **M; int ori, n, m; bool play(pair<int, int> &p, int &ori) { for (int i = 0; i < 2; i++) { if (ori == 0) { if (M[p.first + 1][p.second] > 0) ori++; else { p = {p.first + 1, p.second}; ...

#include <bits/stdc++.h> using namespace std; string multiply(string num1, string num2) { int len1 = num1.size(); int len2 = num2.size(); if (len1 == 0 || len2 == 0) return 0 ; vector<int> result(len1 + len2, 0); int i_n1 = 0; int i_n2 = 0; for (int i = len1 - 1; i >= 0; i--) { in...

#include <bits/stdc++.h> using namespace std; template <class T> inline T gcd(T a, T b) { if (a < 0) return gcd(-a, b); if (b < 0) return gcd(a, -b); return (b == 0) ? a : gcd(b, a % b); } template <class T> inline T lcm(T a, T b) { if (a < 0) return lcm(-a, b); if (b < 0) return lcm(a, ...

#include <bits/stdc++.h> using namespace std; const int N = int(1e5) + 500; int n, m, a[N], s, h, mm; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> s; for (int i = 1; i <= n; i++) { cin >> h >> mm; a[++m] = h * 60 + mm; } if (a[1] >= s + 1) { cout <...

#include <bits/stdc++.h> using namespace std; string second; int n, k; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); ; cin >> second >> k; if (second.size() < k) return cout << impossible n , 0; set<char> st; for (auto i : second) st.insert(i); if (st.size() > ...

#include <bits/stdc++.h> using namespace std; int arr[60]; signed main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; for (int i = 0; i < n; ++i) cin >> arr[i]; sort(arr, arr + n); bool aliceWins = (arr[0] < arr[n >> 1]); cout << (aliceWins ? Alice n : Bob n ); }

#include <bits/stdc++.h> using namespace std; const int maxn = 3e8; int l, r, cnt, ans1, pre1[20000005]; bitset<maxn> pre; int max1, max2; int main() { cin >> l >> r; pre[1] = pre[0] = 1; ans1 = 1; for (int yui = 2; yui <= r; yui++) { if (pre[yui] == 0) { cnt++; pre1[cn...