func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; ++i) cin >> a[i]; multiset<int> s; for (int v : a) s.insert(v); int ans = 0; for (int i = 0; i < n; ++i) { auto it = s.upper_bound(a[i]); if (it != s.end()) { ++ans; s.erase(it); } } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[100010]; int main() { long long n, k; cin >> n >> k; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); long long x = a[0], ans = 0; for (int i = 1; i < n; i++) { if ((a[i] - x) % k != 0) { cout << -1 << endl; return 0; } ans += (a[i] - x) / k; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; void solve(); int main() { ios::sync_with_stdio(0); solve(); return 0; } int a[1000001]; void solve() { int n, m; cin >> n >> m; for (int i = 0; i < n; ++i) { int v; cin >> v; a[v]++; } for (int i = 0; i < m; ++i) { int v; cin >> v; a[v]--; } int ans = 0; int j = 0; for (int i = 1; i <= 1000000; ++i) { if (a[i] > 0) { j = max(j, i); bool f = 0; while (j <= 1000000 && !f) { if (a[j] < 0) { a[j]++; f = 1; } else j++; } ans += !f; } } cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; char s[100000]; int col[100000], dp[21][1 << 20]; int main() { int n, m; scanf( %d %d , &n, &m); for (int i = 0; i < n; i++) { scanf( %s , s); for (int j = 0; j < m; j++) col[j] |= (s[j] - 0 ) << i; } for (int i = 0; i < m; i++) dp[0][col[i]]++; for (int k = 1; k <= n; k++) for (int mask = 0; mask < (1 << n); mask++) { int sum = k > 1 ? (k - 2 - n) * dp[k - 2][mask] : 0; for (int p = 0; p < n; p++) sum += dp[k - 1][mask ^ (1 << p)]; dp[k][mask] = sum / k; } int ans = n * m; for (int mask = 0; mask < (1 << n); mask++) { int cnt = 0; for (int k = 0; k <= n; k++) cnt += min(k, n - k) * dp[k][mask]; ans = min(ans, cnt); } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1e11; const int M = 1e5 + 5; vector<pair<long long, int> > adj[M]; vector<int> ans; long long d[M], vis[M], pre[M]; int n, m; void Dijkstra() { for (int i = 1; i <= n; ++i) d[i] = INF; d[1] = 0; priority_queue<pair<long long, int> > q; q.push(make_pair(d[1], 1)); while (!q.empty()) { int u = q.top().second; q.pop(); if (vis[u]) continue; vis[u] = 1; for (int i = 0; i < adj[u].size(); ++i) { int v = adj[u][i].second; long long dist = adj[u][i].first + d[u]; if (d[v] > dist) { d[v] = dist; pre[v] = u; q.push(make_pair(-d[v], v)); } } } } int main() { int u, v, w; cin >> n >> m; while (m--) { cin >> u >> v >> w; adj[u].push_back(make_pair(w, v)); adj[v].push_back(make_pair(w, u)); } Dijkstra(); if (d[n] == INF) cout << -1 << endl; else { for (int i = n; pre[i]; i = pre[i]) ans.push_back(pre[i]); for (int i = ans.size() - 1; i >= 0; --i) cout << ans[i] << ; cout << n << ; cout << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, x; cin >> n; vector<long long> a; for (int i = 0; i < n; i++) { cin >> x; a.push_back(x); } for (int i = 0; i < n - 1; i++) { cout << a[i] + a[i + 1] << ; } cout << a[n - 1] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void read(T &x) { x = 0; char c = getchar(); int f = 0; for (; !isdigit(c); c = getchar()) f |= c == - ; for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ 0 ); if (f) x = -x; } template <typename T> void write(T x, char ed = n ) { static short st[30]; short tp = 0; if (x < 0) putchar( - ), x = -x; do st[++tp] = x % 10, x /= 10; while (x); while (tp) putchar(st[tp--] | 0 ); putchar(ed); } const int N = 505000; struct node { long long d; int id; bool operator<(const node &i) const { return id < i.id; } node(long long D = 0, int I = 0) : d(D), id(I) {} }; vector<vector<node> > vec; vector<node> ety; int ne[N << 1], to[N << 1], h[N], f[N], rt, tot, n; inline void add(int x, int y) { ne[++tot] = h[x], to[h[x] = tot] = y; } int dep[N], L[N], R[N], cnt; int son[N], mxd[N], rev[N]; long long ans[N]; void dfs1(int x, int fa) { mxd[x] = dep[x] = dep[fa] + 1, L[x] = ++cnt, rev[cnt] = x; if (dep[x] >= vec.size()) vec.push_back(ety); vec[dep[x]].push_back(node(0, L[x])); for (int i = h[x]; i; i = ne[i]) { int y = to[i]; dfs1(to[i], x); if (mxd[y] >= mxd[x]) son[x] = y, mxd[x] = mxd[y]; } R[x] = cnt; } inline bool inc(int x, int l, int r) { return R[x] >= r && L[x] <= l; } long long tab[N], t[N]; void dfs2(int x) { int ct = 0, nw = dep[x]; long long res = 0; t[dep[x]]++; auto pl = lower_bound(vec[dep[x]].begin(), vec[dep[x]].end(), node(0, L[x])), pr = pl; ++pr; while ( jzpakioi , true) { res += 1ll * (ct += t[nw]) * (pr - pl) + tab[nw]; tab[nw] = t[nw] = 0, pl->d += res; if (pr != vec[nw].end()) pr->d -= res; if (++nw > mxd[x]) break; pl = lower_bound(vec[nw].begin(), vec[nw].end(), node(0, L[x])); pr = upper_bound(vec[nw].begin(), vec[nw].end(), node(0, R[x])); if (inc(son[x], pl->id, (pr - 1)->id)) { t[nw] += ct, tab[nw] += res; break; } } if (son[x]) dfs2(son[x]); for (int i = h[x]; i; i = ne[i]) if (to[i] != son[x]) dfs2(to[i]); } int main() { read(n), vec.push_back(ety); for (int i = 1; i <= n; i++) read(f[i]), f[i] ? add(f[i], i), 0 : rt = i; dfs1(rt, 0), dfs2(rt); for (int i = 1; i <= mxd[rt]; i++) { long long res = 0; for (auto t : vec[i]) res += t.d, ans[rev[t.id]] += res; } for (int i = 1; i <= n; i++) write(ans[i] - dep[i], ); return 0; } |
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int dx[8] = {1, -1, 0, 0, -1, -1, 1, 1}; int dy[8] = {0, 0, -1, 1, -1, 1, -1, 1}; vector<int> adj[300010], val(300010, 1), vis(300010, 0), dis1(300010, 0), dis2(300010, 0); int myrandom(int i) { return std::rand() % i; } int dp[5010]; int n; set<pair<int, int>> st; int maxi = 0; int poss[5010][5010]; void dfs(int a) { vis[a] = 1; int cnt = 0; vector<int> v; for (auto i : adj[a]) { if (vis[i] == 0) { dfs(i); if (dp[i] > 0) { v.push_back(dp[i]); } cnt = cnt + dp[i]; } } int cnt1 = n - cnt - 1; if (cnt1 > 0) { v.push_back(cnt1); } int n = (int)v.size(); int sum = accumulate((v).begin(), (v).end(), 0); int res[sum + 1]; memset(res, 0, sizeof(res)); res[0] = 1; for (int i = 0; i < n; i++) { for (int j = sum; j >= 0; j--) { if (j - v[i] >= 0) { res[j] = res[j] | res[j - v[i]]; } } } maxi = max(maxi, sum); for (int i = 1; i < sum; i++) { poss[i][sum - i] = poss[i][sum - i] | res[i]; } dp[a] = 1 + cnt; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; for (int i = 0; i < n - 1; i++) { int a, b; cin >> a >> b; adj[a].push_back(b); adj[b].push_back(a); } memset(poss, 0, sizeof(poss)); dfs(1); vector<pair<int, int>> ans; for (int i = 1; i <= 5000; i++) { for (int j = 1; j <= 5000; j++) { if (i + j == maxi && poss[i][j] == 1) { ans.push_back({i, j}); } } } cout << (int)ans.size() << n ; for (auto i : ans) { cout << i.first << << i.second << n ; } } |
#include <bits/stdc++.h> using namespace std; struct st { int t, p, g; char s[30]; } a[100]; int x[3]; int y[6]; int main() { int n, m, i, j, k; scanf( %d , &n); for (i = 0; i < n; i++) { scanf( %d%s , &m, a[i].s); for (j = 0; j < m; j++) { scanf( %d-%d-%d , &x[0], &x[1], &x[2]); for (k = 0; k < 3; k++) { y[k * 2] = x[k] / 10; y[k * 2 + 1] = x[k] % 10; } for (k = 0; k < 5; k++) if (y[k] != y[k + 1]) break; if (k == 5) { a[i].t++; continue; } for (k = 0; k < 5; k++) if (y[k] <= y[k + 1]) break; if (k == 5) a[i].p++; else a[i].g++; } } vector<int> ans; int ma = a[0].t; ans.push_back(0); for (i = 1; i < n; i++) { if (a[i].t > ma) { ans.clear(); ans.push_back(i); ma = a[i].t; } else if (a[i].t == ma) { ans.push_back(i); } } printf( If you want to call a taxi, you should call: ); printf( %s , a[ans[0]].s); for (i = 1; i < ans.size(); i++) printf( , %s , a[ans[i]].s); printf( . n ); ans.clear(); ma = a[0].p; ans.push_back(0); for (i = 1; i < n; i++) { if (a[i].p > ma) { ans.clear(); ans.push_back(i); ma = a[i].p; } else if (a[i].p == ma) { ans.push_back(i); } } printf( If you want to order a pizza, you should call: ); printf( %s , a[ans[0]].s); for (i = 1; i < ans.size(); i++) printf( , %s , a[ans[i]].s); printf( . n ); ans.clear(); ma = a[0].g; ans.push_back(0); for (i = 1; i < n; i++) { if (a[i].g > ma) { ans.clear(); ans.push_back(i); ma = a[i].g; } else if (a[i].g == ma) { ans.push_back(i); } } printf( If you want to go to a cafe with a wonderful girl, you should call: ); printf( %s , a[ans[0]].s); for (i = 1; i < ans.size(); i++) printf( , %s , a[ans[i]].s); printf( . n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); long long n, x, sum(0), cnt(0), prev(INT_MAX); cin >> n; for (int i = 0; i < n; i++) { cin >> x; if (i && x == prev) cnt++; else cnt = 1; prev = x; sum += cnt; } cout << sum; return 0; } |
#include <bits/stdc++.h> using namespace std; map<pair<int, int>, bool> mp; bool check(int x, int y, int z) { if (y < x) swap(x, y); if (z < y) swap(z, y); if (y < x) swap(x, y); if (x + y > z && z > y && mp.count({x, y}) == 0) { mp[{x, y}] = 1; return 1; } else return 0; } int main() { int n; cin >> n; long long ans = 0; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= n; ++j) { if ((i ^ j) <= n && check(i, j, (i ^ j))) ans++; } } cout << ans; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; int n; while (t--) { int n; string s; cin >> n; cin >> s; int flag = 1, start = 0, end = n - 1; while (start <= end) { char ssp = s[start] + 1; char sep = s[end] + 1; char sem = s[end] - 1; char ssm = s[start] - 1; if ((ssp == sep) || (ssp == sem) || (ssm == sep) || (ssm == sem)) flag = 1; else { flag = 0; break; } start++; end--; } if (flag == 0) cout << NO << endl; else cout << YES << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int arr[111]; int main() { int n; scanf( %d , &n); for (int i = (0); i < (n); ++i) scanf( %d , &arr[i]); sort(arr, arr + n); int t = 10; int ans = 0; int qts = 0; for (int i = (0); i < (n); ++i) { t += arr[i]; if (t > 720) break; qts++; if (t > 360) ans += (t - 360); } printf( %d %d n , qts, ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int h, m, ti; scanf( %d:%d , &h, &m); scanf( %d , &ti); int realh = ti / 60, realmin = ti % 60; while (realh--) { if (h == 23) h = 0; else h++; } while (realmin--) { if (m == 59) { m = 0; if (h == 23) h = 0; else h++; } else m++; } if (h < 10) printf( 0 ); printf( %d: , h); if (m < 10) printf( 0 ); printf( %d , m); return 0; } |
#include <bits/stdc++.h> using i64 = long long; template <typename _Tp> inline void chkMax(_Tp &x, const _Tp &y) { (x < y) and (x = y); } namespace IOManager { constexpr int FILESZ = 131072; char buf[FILESZ]; const char *ibuf = buf, *tbuf = buf; struct IOManager { inline char gc() { return (ibuf == tbuf) and (tbuf = (ibuf = buf) + fread(buf, 1, FILESZ, stdin), ibuf == tbuf) ? EOF : *ibuf++; } template <typename _Tp> inline operator _Tp() { _Tp s = 0u; char c = gc(); for (; c < 48; c = gc()) ; for (; c > 47; c = gc()) s = (_Tp)(s * 10u + c - 48u); return s; } }; } // namespace IOManager IOManager::IOManager io; int main() { static std::map<i64, i64> f; const int n = io; for (int i = 1; i <= n; ++i) { const i64 a = io; if (i == 1) f[a - 1] = 0; for (auto it = f.rbegin(); it not_eq f.rend() and it->first >= a; ++it) { const i64 v = it->first; chkMax(f[v % a], it->second + (v - v % a) * (i - 1ll)); chkMax(f[a - 1], it->second + ((v - a + 1ll) / a * a) * (i - 1ll)); } f.erase(f.lower_bound(a), f.end()); } i64 ans = 0; for (const auto it : f) chkMax(ans, it.second + it.first * n); printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[200005]; long long k1[200005]; long long k2[200005]; string ss = first ; string sp = second ; int main() { int n; cin >> n; int r1 = 0; int r2 = 0; long long s1 = 0; long long s2 = 0; int l1 = 0; int l2 = 0; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] > 0) { { k1[l1++] = a[i]; } s1 += a[i]; r1 = 1; } else { { k2[l2++] = -a[i]; } s2 += -a[i]; r1 = 0; } } if (s1 > s2) { cout << ss << endl; return 0; } if (s1 < s2) { cout << sp << endl; return 0; } if (s1 == s2) { for (int i = 0; i < min(l1, l2); i++) { if (k1[i] > k2[i]) { cout << ss << endl; return 0; } if (k2[i] > k1[i]) { cout << sp << endl; return 0; } } if (!r1) { cout << sp << endl; return 0; } else { cout << ss << endl; return 0; } } } |
#include <bits/stdc++.h> using namespace std; int input() { int res = 0, m = 1; char c = ; while (c < 0 && c != - ) c = getchar(); if (c == - ) m = -1, c = getchar(); while (c >= 0 ) res = res * 10 + (c - 0 ), c = getchar(); return res * m; } const int N = 501; int n, k, lft[N], l_siz, fl[N], rht[N], r_siz, fr[N]; void shift() { while (r_siz) lft[l_siz] = rht[--r_siz], ++l_siz; if (l_siz) fl[0] = lft[0]; for (int i = 1; i < l_siz; ++i) fl[i] = max(fl[i - 1], lft[i]); } void push(int x) { int prev = (r_siz ? fr[r_siz - 1] : 0); rht[r_siz] = x, fr[r_siz] = max(prev, x), ++r_siz; } void pop() { if (!l_siz) shift(); --l_siz; } int get() { int res = 0; if (l_siz) res = fl[l_siz - 1]; if (r_siz) res = max(res, fr[r_siz - 1]); return res; } int a[N][N], mx[N][N], ans = 2e9; int main() { int n = input(), m = input(), k = input(); for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) a[i][j] = 2e9; for (int q = input(); q; --q) { int i = input() - 1, j = input() - 1, t = input(); a[i][j] = t; } for (int j = 0; j < m; ++j) { for (int i = 0; i < k; ++i) push(a[i][j]); mx[0][j] = get(); for (int i = 0; i < n - k; ++i) { pop(), push(a[i + k][j]); mx[i + 1][j] = get(); } while (l_siz + r_siz) pop(); } for (int i = 0; i <= n - k; ++i) { for (int j = 0; j < k; ++j) push(mx[i][j]); ans = min(ans, get()); for (int j = 0; j < m - k; ++j) { pop(), push(mx[i][j + k]); ans = min(ans, get()); } while (l_siz + r_siz) pop(); } cout << (ans == 2e9 ? -1 : ans); } |
#include <bits/stdc++.h> int main() { int t, a, b, c, d, k, i, pen, pencil; scanf( %d , &t); for (i = 0; i < t; i++) { scanf( %d %d %d %d %d , &a, &b, &c, &d, &k); if (a % c != 0) { pen = (a / c) + 1; } if (a % c == 0) { pen = (a / c); } if (b % d != 0) { pencil = (b / d) + 1; } if (b % d == 0) { pencil = (b / d); } if (pen + pencil <= k) { printf( %d %d n , pen, pencil); } else { printf( -1 n ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long int countInversions(long long int a[], long long int temp[], long long int l, long long int r) { if (l >= r) { return 0; } long long int count1 = countInversions(a, temp, l, (l + r) / 2); long long int count2 = countInversions(a, temp, (l + r) / 2 + 1, r); long long int mergeCount = 0; long long int indexLeft = l; long long int endLeft = (l + r) / 2 + 1; long long int indexRight = (l + r) / 2 + 1; while (indexRight <= r && indexLeft < endLeft) { while (indexLeft < endLeft && a[indexLeft] <= a[indexRight]) { indexLeft++; } mergeCount += endLeft - indexLeft; indexRight++; } indexLeft = l, indexRight = (l + r) / 2 + 1; long long int idx = l; while (indexRight <= r && indexLeft < endLeft) { if (a[indexLeft] <= a[indexRight]) { temp[idx++] = a[indexLeft]; indexLeft++; } else { temp[idx++] = a[indexRight]; indexRight++; } } while (indexRight <= r) { temp[idx++] = a[indexRight]; indexRight++; } while (indexLeft < endLeft) { temp[idx++] = a[indexLeft]; indexLeft++; } for (long long int i = l; i <= r; i++) { a[i] = temp[i]; } return mergeCount + count1 + count2; } int main() { ios ::sync_with_stdio(false); cin.tie(0); map<char, deque<long long int>> positionsOfLetters; long long int i, n, count = 0; cin >> n; char s[n]; for (i = 0; i < n; i++) { cin >> s[i]; positionsOfLetters[s[i]].push_back(i); } reverse(s, s + n); long long int permuation[n]; for (i = 0; i < n; i++) { permuation[i] = positionsOfLetters[s[i]].front(); positionsOfLetters[s[i]].pop_front(); } long long int temp[n + 1]; cout << countInversions(permuation, temp, 0, n - 1); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s, t; cin >> s; bool ok = false; for (int i = 0; i < s.size(); i++) { if (s.size() - i < 26) break; int j = i; vector<int> f(26); int qq = 0; while (j < s.size() && j - i + 1 <= 26) { if (s[j] != ? ) f[s[j] - A ]++; else qq++; if (j - i + 1 == 26) break; j++; } int have = 0; queue<char> need; for (int k = 0; k < 26; k++) { if (f[k] > 0) have++; else need.push(char(k + A )); } int want = 26 - have; if (want == qq) { ok = true; for (int k = i; k <= j; k++) if (s[k] == ? ) { s[k] = need.front(); need.pop(); } } } if (!ok) { puts( -1 ); } else { for (auto c : s) { if (c == ? ) cout << A << ; else cout << c << ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int a[400005]; int q, x; int main() { int aux, cnt = 0, maxim = 0; cin >> q >> x; for (int i = 1; i <= q; i++) { cin >> aux; a[aux % x]++; while (a[cnt] > maxim) { cnt++; if (cnt == x) { cnt = 0; maxim++; } } cout << maxim * x + cnt << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int dx[4] = {-1, 0, 0, 1}; int dy[4] = {0, -1, 1, 0}; bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) { if (a.first == b.first) return a.second < b.second; return (a.first < b.first); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long x, y, t, c; cin >> x >> y; if (y == 0) { cout << No << endl; return 0; } if (y == 1) { if (x > 0) { cout << No << endl; return 0; } } t = y - 1; t = x - t; if (t % 2 == 0 && t >= 0) { cout << Yes << endl; return 0; } cout << No << endl; } |
#include <bits/stdc++.h> using namespace std; int a[6], b[6]; int getMinWin(int idx) { if (idx == 3) return a[0] + a[1] + a[2]; int ret = INT_MAX; int bIdx = idx; int bIdxPrev = (idx - 1 + 3) % 3; int minIdxbIdx = min(a[idx], b[bIdx]); a[idx] -= minIdxbIdx; b[bIdx] -= minIdxbIdx; int minIdxbIdxPrev = min(a[idx], b[bIdxPrev]); a[idx] -= minIdxbIdxPrev; b[bIdxPrev] -= minIdxbIdxPrev; ret = min(ret, getMinWin(idx + 1)); a[idx] += minIdxbIdx; b[bIdx] += minIdxbIdx; a[idx] += minIdxbIdxPrev; b[bIdxPrev] += minIdxbIdxPrev; return ret; } int getMaxWin() { return min(a[0], b[1]) + min(a[1], b[2]) + min(a[2], b[0]); } int main() { int n; scanf( %d , &n); for (int i = 0; i < 3; i++) scanf( %d , &a[i]); for (int i = 0; i < 3; i++) scanf( %d , &b[i]); int minWin = INT_MAX; for (int i = 0; i < 3; i++) { minWin = min(minWin, getMinWin(0)); for (int j = 0; j < 2; j++) { swap(a[j], a[j + 1]); swap(b[j], b[j + 1]); } } printf( %d %d n , minWin, getMaxWin()); } |
#include <bits/stdc++.h> int n, d, m, t[200005][2], l, p, r, b; long long ans; std::pair<int, int> s[200005]; bool a = true; int main() { scanf( %d %d %d , &d, &n, &m); for (int i = 0; i < m; i++) scanf( %d %d , &s[i].first, &s[i].second); std::sort(s, s + m); t[l][0] = 0; t[l++][1] = n; s[m].first = d; s[m].second = 0; for (int i = 0; i <= m && a; i++) { if (s[i].first - p > n) a = false; else { r = s[i].first - p; while (s[i].first > p) { if (p + t[b][1] <= s[i].first) { ans += (long long)t[b][0] * t[b][1]; p += t[b][1]; b++; } else { ans += (long long)t[b][0] * (s[i].first - p); t[b][1] -= s[i].first - p; p = s[i].first; } } while (l > b && s[i].second <= t[l - 1][0]) r += t[--l][1]; t[l][0] = s[i].second; t[l++][1] = r; } } printf( %I64d n , a ? ans : -1); scanf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if ((a == 0) || (b == 0)) return a + b; return gcd(b, a % b); } long long pow_mod(long long a, long long b) { long long res = 1; while (b) { if (b & 1) res = (res * a) % 1000000007; a = (a * a) % 1000000007; b >>= 1; } return res; } long long pow_2(long long a, long long b) { long long res = 1; while (b) { if (b & 1) res = (res * a); a = (a * a); b >>= 1; } return res; } bool isPrime(long long a) { for (int i = 3; (i * i) <= a; i += 2) { if ((a % i) == 0) return false; } if ((a != 2) && ((a % 2) == 0)) return false; return true; } string con_ll_to_str(int a) { stringstream mystr; mystr << a; return mystr.str(); } long long con_str_to_ll(string st) { long long numb = 0; int len = st.size(), i, j = 0; for (i = len - 1; i >= 0; i--) { numb += (pow_mod(10, j) * (st[i] - 0 )); j++; } return numb; } long long baseno_to_decimal(string st, long long basee) { long long i = 0, j, anss = 0; for (j = (int)st.length() - 1; j >= 0; j--) { anss += (st[j] - 0 ) * pow_2(basee, i); i++; } return anss; } string decimal_to_string(long long num, long long basee) { long long i = 0, j, opop; string anss = ; vector<string> stri; stri.push_back( 0 ); stri.push_back( 1 ); stri.push_back( 2 ); stri.push_back( 3 ); stri.push_back( 4 ); stri.push_back( 5 ); stri.push_back( 6 ); stri.push_back( 7 ); stri.push_back( 8 ); stri.push_back( 9 ); stri.push_back( A ); stri.push_back( B ); stri.push_back( C ); stri.push_back( D ); stri.push_back( E ); stri.push_back( F ); while (num) { opop = num % basee; anss += stri[opop]; num /= basee; } reverse(anss.begin(), anss.end()); return anss; } long long par[10010], dist[10010], N, M; bool flag1, flag2; pair<long long, long long> mapp[6]; map<string, string> ma; vector<long long> vc[10010]; string st[110]; vector<long long> path_d; struct comp { bool operator()(pair<long long, long long> n1, pair<long long, long long> n2) { return n1.second > n2.second; } }; void dijk(long long src) { priority_queue<pair<long long, long long>, vector<pair<long long, long long> >, comp> prqu; prqu.push(make_pair(src, 0)); long long i, j, kk; for (i = 0; i <= 10000; i++) { dist[i] = INT_MAX; } memset(par, -1, sizeof(par)); dist[src] = 0; while (!prqu.empty()) { pair<long long, long long> xx = prqu.top(); prqu.pop(); for (kk = 0; kk <= (int)vc[xx.first].size() - 1; kk++) { if (dist[vc[xx.first][kk]] > (xx.second + 1)) { par[vc[xx.first][kk]] = xx.first; dist[vc[xx.first][kk]] = xx.second + 1; prqu.push(make_pair(vc[xx.first][kk], xx.second + 1)); } } } } void gr_cons(long long i, long long j, long long fi) { if (i <= 0 || i > N || j <= 0 || j > M) { return; } long long sec; if (st[i][j] == . || st[i][j] == F ) { sec = ((i - 1) * M) + j; vc[fi].push_back(sec); } } string rev(string ch) { if (ch == U || ch == D ) { if (ch == U ) return D ; return U ; } if (ch == L || ch == R ) { if (ch == L ) return R ; return L ; } } void find_pos(long long i, long long j, pair<long long, long long> poss) { if ((poss.first + 1) == i && j == poss.second) { cout << ma[ D ] << n ; } else if ((poss.first - 1) == i && j == poss.second) { cout << ma[ U ] << n ; } else if (poss.first == i && j == (poss.second - 1)) { cout << ma[ L ] << n ; } else { cout << ma[ R ] << n ; } } int main() { long long i, j, fi, X, Y, o1; cin >> N >> M; for (i = 1; i <= N; i++) { cin >> st[i]; st[i] = # + st[i]; st[0] = st[i]; st[N + 1] = st[i]; } for (i = 0; i <= M; i++) { st[0][i] = . ; st[i][0] = . ; st[i][M + 1] = . ; st[N + 1][i] = . ; } for (i = 1; i <= N; i++) { for (j = 1; j <= M; j++) { if (st[i][j] == . || st[i][j] == F ) { fi = (i - 1) * M + j; gr_cons(i - 1, j, fi); gr_cons(i + 1, j, fi); gr_cons(i, j - 1, fi); gr_cons(i, j + 1, fi); } if (st[i][j] == F ) { o1 = (i - 1) * M + j; } } } dijk(1); while (o1 != -1) { path_d.push_back(o1); o1 = par[o1]; } reverse(path_d.begin(), path_d.end()); pair<long long, long long> pos = make_pair(1, 1); stack<string> stac; if (st[pos.first + 1][pos.second] != * && st[pos.first - 1][pos.second] != * ) { flag1 = 1; fflush(stdout); cout << U << n ; fflush(stdout); cin >> X >> Y; if (st[X][Y] == F ) { return 0; } if (X == (pos.first - 1) || X == pos.first) { ma[ U ] = U ; ma[ D ] = D ; } else { ma[ U ] = D ; ma[ D ] = U ; } pos = make_pair(X, Y); } else if (st[pos.first][pos.second + 1] != * && st[pos.first][pos.second - 1] != * ) { flag2 = 1; fflush(stdout); cout << R << n ; fflush(stdout); cin >> X >> Y; if (st[X][Y] == F ) { return 0; } if (Y == (pos.second + 1)) { ma[ L ] = L ; ma[ R ] = R ; } else { ma[ L ] = R ; ma[ R ] = L ; } pos = make_pair(X, Y); } if (flag1) { if (pos != make_pair(1LL, 1LL)) { fflush(stdout); cout << rev( U ) << n ; fflush(stdout); cin >> X >> Y; } pos = make_pair(1, 1); while (1) { if (st[pos.first][pos.second + 1] != * && st[pos.first][pos.second - 1] != * ) { fflush(stdout); cout << R << n ; fflush(stdout); cin >> X >> Y; if (pos != make_pair(X, Y)) stac.push(rev( R )); if (st[X][Y] == F ) { return 0; } if (Y == (pos.second + 1)) { ma[ L ] = L ; ma[ R ] = R ; } else { ma[ L ] = R ; ma[ R ] = L ; } pos = make_pair(X, Y); break; } fflush(stdout); cout << ma[ D ] << n ; fflush(stdout); cin >> X >> Y; pos = make_pair(X, Y); stac.push(rev(ma[ D ])); if (st[X][Y] == F ) { return 0; } } } else { if (pos != make_pair(1LL, 1LL)) { fflush(stdout); cout << rev( R ) << n ; fflush(stdout); cin >> X >> Y; } while (1) { if (st[pos.first + 1][pos.second] != * && st[pos.first - 1][pos.second] != * ) { fflush(stdout); cout << U << n ; fflush(stdout); cin >> X >> Y; if (pos != make_pair(X, Y)) stac.push(rev( U )); if (st[X][Y] == F ) { return 0; } if (X == (pos.first - 1) || X == pos.first) { ma[ U ] = U ; ma[ D ] = D ; } else { ma[ U ] = D ; ma[ D ] = U ; } pos = make_pair(X, Y); break; } fflush(stdout); cout << ma[ R ] << n ; fflush(stdout); cin >> X >> Y; pos = make_pair(X, Y); stac.push(rev(ma[ R ])); if (st[X][Y] == F ) { return 0; } } } if (pos != make_pair(1LL, 1LL)) { while (stac.size()) { fflush(stdout); cout << stac.top() << n ; fflush(stdout); stac.pop(); cin >> X >> Y; } } pos = make_pair(1, 1); for (i = 1; i <= (int)path_d.size() - 1; i++) { fflush(stdout); if (!(path_d[i] % M)) { find_pos(path_d[i] / M, M, pos); } else { find_pos((path_d[i] / M) + 1, (path_d[i] % M), pos); } fflush(stdout); cin >> X >> Y; pos = make_pair(X, Y); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, i; int p[200011]; int aib[200011]; int ord[2][200011]; int ans[200011]; int zrs(int x) { return (x & (x - 1)) ^ x; } void add(int x, int v) { while (x <= n) { aib[x] += v; x += zrs(x); } } int sum(int x) { int ans = 0; while (x > 0) { ans += aib[x]; x -= zrs(x); } return ans; } int cb(int x) { int ans = 0; for (int step = (1 << 19); step > 0; step >>= 1) if (ans + step <= n) if (aib[ans + step] <= x) x -= aib[ans += step]; return ans; } void get_order(int n, int *p, int *ans) { int i; for (i = 1; i <= n; i++) aib[i] = zrs(i); memset(ans, 0, sizeof(ans)); for (i = 1; i <= n; i++) { ans[n - i] = sum(p[i] - 1); add(p[i], -1); } } void get_perm(int n, int *ord, int *ans) { int i, cnt, pos; for (i = 1; i <= n; i++) aib[i] = zrs(i); memset(ans, 0, sizeof(ans)); for (i = 1; i <= n; i++) { cnt = ord[n - i] + 1; pos = cb(cnt - 1) + 1; ans[i] = pos; add(pos, -1); } } int main() { scanf( %d , &n); for (i = 1; i <= n; i++) scanf( %d , &p[i]), p[i]++; get_order(n, p, ord[0]); for (i = 1; i <= n; i++) scanf( %d , &p[i]), p[i]++; get_order(n, p, ord[1]); for (i = 1; i <= n; i++) ord[0][i] += ord[1][i]; for (i = 1; i <= n; i++) { ord[0][i + 1] += ord[0][i] / (i + 1); ord[0][i] %= i + 1; } get_perm(n, ord[0], ans); for (i = 1; i <= n; i++) printf( %d , ans[i] - 1); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int N = 0, p = 0, q = 0; int k = 0; cin >> N; for (int i = 0; i < N; i++) { cin >> p >> q; if (q - p >= 2) k++; } cout << k; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int nax = 1e6 + 10; vector<int> tree(4 * nax); long long i, j, x, y, k; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long n, t; cin >> t; while (t--) { cin >> n; vector<long long> a; set<long long> b; for (i = 0; i < n; i++) { cin >> x; a.push_back(x); b.insert(x); } if (b.size() == 1) { cout << 1 << endl; for (i = 0; i < n; i++) cout << 1 << ; } else if (a.size() % 2 == 0) { cout << 2 << endl; for (i = 0; i < n / 2; i++) cout << 1 << << 2 << ; } else if (a.size() % 2 != 0) { vector<long long> ans; int p = 0, q = 0; ans.push_back(1); for (i = 1; i < a.size() - 1; i++) { if (a[i] == a[i - 1] && p == 0) { ans.push_back(ans[i - 1]); p = 1; } else if (q == 0) { ans.push_back(2); q = 1; } else if (q == 1) { ans.push_back(1); q = 0; } } if (p == 1) { if (q == 1) ans.push_back(1); else ans.push_back(2); } else { if (a[n - 1] == a[n - 2]) ans.push_back(ans[n - 2]); else if (a[n - 1] == a[0]) ans.push_back(ans[0]); else ans.push_back(3); } if (ans[n - 1] == 3) cout << 3 << endl; else cout << 2 << endl; for (i = 0; i < ans.size(); i++) cout << ans[i] << ; } cout << endl; } } |
#include <bits/stdc++.h> using namespace std; vector<long long> lucky; void backtrack(long long x) { if (x > 1e10) return; lucky.push_back(x); backtrack(x * 10 + 4); backtrack(x * 10 + 7); } int main() { long long ans = 0; backtrack(0); sort(lucky.begin(), lucky.end()); int a, b; cin >> a >> b; for (int i = 1; i < (int)lucky.size(); i++) { int l, r, m; l = a, r = b; while (l <= r) { m = (l + r) >> 1; if (m <= lucky[i]) { ans += lucky[i] * (m - l + 1); a = m + 1; i--; break; } else { r = m - 1; } } } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int n; cin >> n; vector<pair<int, int>> vp(n); for (int i = 0; i < n; i++) cin >> vp[i].first >> vp[i].second; sort(vp.begin(), vp.end()); long long res = 1; pair<int, int> pa = {vp[0].first, vp[0].second}; for (int i = 0; i < n; i++) { if (vp[i].first > pa.second) pa = {vp[i].first, vp[i].second}, res++; else if (vp[i].second < pa.second) pa = {vp[i].first, vp[i].second}; } cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; int m, c; int mc = 0, cc = 0; cin >> t; while (t--) { cin >> m >> c; if (m > c) mc++; else if (m < c) cc++; } if (mc == cc) cout << Friendship is magic!^^ ; else if (mc < cc) cout << Chris ; else cout << Mishka ; } |
#include <bits/stdc++.h> using namespace std; int N; struct node { int val, pos; } A[2005]; int res[2005]; int cmp1(node a, node b) { return a.val > b.val; } int main() { A[0].val = 0x7fffffff; cin >> N; for (int i = 1; i <= N; i++) { scanf( %d , &A[i].val); A[i].pos = i; } sort(A + 1, A + 1 + N, cmp1); for (int i = 1; i <= N; i++) { if (A[i - 1].val == A[i].val) res[A[i].pos] = res[A[i - 1].pos]; else res[A[i].pos] = i; } for (int i = 1; i <= N; i++) printf( %d%c , res[i], i == N ? n : ); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 5e5 + 10; const long long M = 1e6 + 11; const long long big = 1e17; const long long hsh2 = 1964325029; const long long mod = 1e9 + 7; const double EPS = 1e-9; const long long block = 1e14; const long long shift = 2e3; const double pi = acos(-1.0); mt19937 bruh(chrono::steady_clock::now().time_since_epoch().count()); long long n; struct dsu { long long p[N], sz[N]; set<long long> comp; void init() { for (int i = 1; i <= n; i++) p[i] = i, sz[i] = 1, comp.insert(i); } long long fnd(long long a) { return (p[a] = (p[a] == a ? a : fnd(p[a]))); } void unt(long long a, long long b) { a = fnd(a), b = fnd(b); if (a == b) return; if (sz[a] < sz[b]) swap(a, b); comp.erase(b); sz[a] += sz[b]; p[b] = a; } } rt[2]; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n; rt[0].init(); rt[1].init(); long long m[2] = {0}; cin >> m[0] >> m[1]; long long sm[2] = {m[0], m[1]}; while (m[0]--) { long long a, b; cin >> a >> b; rt[0].unt(a, b); } while (m[1]--) { long long a, b; cin >> a >> b; rt[1].unt(a, b); } vector<pair<long long, long long> > ans; while (sm[0] < n - 1 && sm[1] < n - 1) { long long i = bruh() % n + 1, j = bruh() % n + 1; auto it = rt[0].comp.lower_bound(i), it2 = rt[1].comp.lower_bound(j); if (it == rt[0].comp.end()) it--; if (it2 == rt[1].comp.end()) it2--; i = *it, j = *it2; if (rt[0].fnd(i) != rt[0].fnd(j) && rt[1].fnd(i) != rt[1].fnd(j)) { sm[0]++, sm[1]++; rt[0].unt(i, j); rt[1].unt(i, j); ans.push_back(make_pair(i, j)); } } cout << ans.size() << n ; for (auto u : ans) cout << u.first << << u.second << n ; } |
#include <bits/stdc++.h> using namespace std; int n, arr[100005]; int main() { cin >> n; for (int i = 0; i < n; i++) cin >> arr[i]; int cur = min(2, n); int best = min(2, n); for (int i = 2; i < n; i++) { if (arr[i - 2] + arr[i - 1] == arr[i]) cur++; else cur = 2; best = max(best, cur); } cout << best << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, l; cin >> n; string s; for (int i = 0; i < n; i++) { cin >> l; cin >> s; int ans = 0; bool lol = false; int tmp = 0; for (int j = 0; j < l; j++) { if (s[j] == A ) { lol = true; if (tmp > ans) ans = tmp; tmp = 0; } else { if (lol) { tmp++; } } } if (tmp > ans) ans = tmp; cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int x, y, z; int sol; int s[100009]; cin >> x >> y; s[0] = 0; for (int i = 1; i < x; i++) { cin >> z; s[i] = z + s[i - 1]; } sol = s[y]; for (int i = y + 1; i < x; i++) { sol = min(sol, s[i] - s[i - y]); } cout << sol << endl; } |
#include <bits/stdc++.h> const int N = 1010; double f[N][N]; bool vis[N][N]; inline double F(int m, int n) { if (!m) return 1. / (n + 1); if (!n) return 1; if (vis[m][n]) return f[m][n]; vis[m][n] = true; double p = 1 / (1 + (1. / ((n + 1) * F(n, m - 1)))); return f[m][n] = p * n / (n + 1) * (1 - F(n - 1, m)) + 1 - p; } int main() { int m, n; scanf( %d%d , &m, &n); printf( %.11f %.11f n , F(m, n), 1 - F(m, n)); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 100005; int n, len, ct; int a[maxn], tot[maxn], cur[maxn]; long long ans; void solve() { for (int i = 1; i <= n; i++) tot[i] = cur[i] = 0; for (int i = 1; i <= n; i++) tot[a[i]]++; int r = 1; for (int i = 1; i <= (n - 1) / 2; i++) { while (r <= (n - 1) / 2 && (cur[a[r]] + 1) * 2 <= tot[a[r]]) { cur[a[r]]++; r++; } ans += r - i + 1; if (a[i] != a[n - i + 1]) break; tot[a[i]] -= 2; cur[a[i]]--; } } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]), tot[a[i]]++; int val = 0; for (int i = 1; i <= n; i++) if (tot[i] & 1) { if (val) { puts( 0 ); return 0; } val = i; } while (1 + len <= n && n - len >= 1 && a[1 + len] == a[n - len]) len++; if (len == n) { printf( %lld n , 1LL * n * (n + 1) / 2); return 0; } int l = n / 2, r = n / 2 + 1 + (n & 1); while (l - ct >= 1 && r + ct <= n && a[l - ct] == a[r + ct]) ct++; for (int i = 1; i <= n; i++) cur[i] = 0; for (int i = len + 1; i <= l - ct; i++) cur[a[i]]++; bool bad = false; for (int i = r + ct; i <= n - len; i++) { if (!cur[a[i]]) { bad = true; break; } cur[a[i]]--; } if (!bad) ans = 2LL * (len + 1) * (ct + 1); solve(); reverse(a + 1, a + 1 + n); solve(); ans -= len + 1; printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int a, b, c; cin >> a >> b >> c; int ans = 0; if (a >= 1) { a--; ans++; } if (b >= 1) { b--; ans++; } if (c >= 1) { c--; ans++; } if (a < b) swap(a, b); if (b < c) swap(b, c); if (a < b) swap(a, b); if (a >= 1 && b >= 1) { a--; b--; ans++; } if (a >= 1 && c >= 1) { a--; c--; ans++; } if (b >= 1 && c >= 1) { b--; c--; ans++; } if (a >= 1 && b >= 1 && c >= 1) ans++; cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; int a[N]; long long ans[N]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } if (n == 1) { cout << 1 << << 1 << n ; cout << 0 << n ; cout << 1 << << 1 << n ; cout << 0 << n ; cout << 1 << << 1 << n ; cout << -a[1] << n ; return 0; } for (int i = 1; i <= n; i++) { long long x = a[i]; long long yu = x % (n - 1); long long byu = (n - 1 - yu) * n; ans[i] = byu + a[i]; } cout << 1 << << n << n ; for (int i = 1; i <= n; i++) { cout << ans[i] - a[i] << ; } cout << n ; cout << 1 << << 1 << n ; cout << -ans[1] << n ; cout << 2 << << n << n ; for (int i = 2; i <= n; i++) { cout << -ans[i] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1100000; const long long M = 1000000007; long long i, j, k, l, m, n, o, p, K, w, F[N], ni[N]; inline long long fastmi(long long x, long long m) { long long ans = 1; while (m) { if (m & 1) ans = (ans * x) % M; x = (x * x) % M; m >>= 1; } return ans; } inline long long get(long long l, long long r) { long long ans; if ((r < 0) || (l < 0)) return 0; if (l > r) return 1; if (l == 0) return 0; ans = (F[r] * ni[l - 1]) % M; return ans; } inline long long Solve() { long long ans1, ans2, ans, cul, cant; F[0] = 1; ni[0] = 1; for (i = 1; i <= K; i++) { F[i] = (F[i - 1] * i) % M; ni[i] = fastmi(F[i], M - 2); } ans = 0; for (i = 0; i <= K - 1; i++) { cant = i + 1 - w + 1; if (cant < 0) cant = 0; k = K - cant; o = (get(K - i, K - 1) * min(w, i + 1)) % M; l = w - i - 2; if (l < 0) l = 0; j = w - 1 - l; p = (fastmi(k, l) * get(k - j + 1, k)) % M; cul = (o * p) % M; ans += cul; if (ans >= M) ans -= M; } ans1 = ans; ans = 0; for (i = 0; i <= K - 1; i++) { cant = i + 1 - (w - 1) + 1; if (cant < 0) cant = 0; k = K - cant; o = (get(K - i, K - 1) * min(w - 1, i + 1)) % M; l = w - 1 - i - 2; if (l < 0) l = 0; j = w - 1 - l; p = (fastmi(k, l) * get(k - j + 1, k)) % M; cul = (o * p) % M; ans += cul; if (ans >= M) ans -= M; } ans2 = ans1 - ans; if (ans2 < 0) ans2 += M; ans1 = ans1 + ans1; if (ans1 >= M) ans1 -= M; ans1 -= ans2; if (ans1 < 0) ans1 += M; ans = (ans1 * K) % M; return ans; } int main() { cin >> K >> w; cout << Solve() << endl; fclose(stdin); fclose(stdout); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 300000 + 5; const int MOD = 1000000009; int s[N * 4], f[N], a[N], taga[N * 4], tagb[N * 4]; int read() { int x = 0, f = 1; char ch = getchar(); for (; ch < 0 || ch > 9 ; ch = getchar()) if (ch == - ) f = -1; for (; ch >= 0 && ch <= 9 ; ch = getchar()) x = x * 10 + ch - 0 ; return x * f; } void update(int x) { s[x] = (s[x << 1] + s[x << 1 | 1]) % MOD; } void push(int x, int a, int b, int n) { taga[x] = (taga[x] + a) % MOD; tagb[x] = (tagb[x] + b) % MOD; s[x] = ((long long)f[n] * a + (long long)(f[n + 1] - 1) * b + s[x]) % MOD; } void pushdown(int x, int l, int r) { if (taga[x] > 0 || tagb[x] > 0) { int mid = (l + r) >> 1, a = taga[x], b = tagb[x], C = mid - l, A = ((long long)f[C] * a + (long long)f[C + 1] * b) % MOD, B = ((long long)f[C + 1] * a + (long long)f[C + 2] * b) % MOD; push(x << 1, a, b, mid - l + 1), push(x << 1 | 1, A, B, r - mid); taga[x] = tagb[x] = 0; } } void build(int x, int l, int r) { if (l == r) { s[x] = a[l]; return; } int mid = (l + r) >> 1; build(x << 1, l, mid); build(x << 1 | 1, mid + 1, r); update(x); } void change(int x, int l, int r, int p, int q) { if (l > q || r < p) return; if (l >= p && r <= q) { push(x, f[l - p + 1], f[l - p + 2], r - l + 1); return; } int mid = (l + r) >> 1; pushdown(x, l, r); change(x << 1, l, mid, p, q); change(x << 1 | 1, mid + 1, r, p, q); update(x); } int query(int x, int l, int r, int p, int q) { if (l > q || r < p) return 0; if (l >= p && r <= q) return s[x]; int mid = (l + r) >> 1; pushdown(x, l, r); return (query(x << 1, l, mid, p, q) + query(x << 1 | 1, mid + 1, r, p, q)) % MOD; } void prints(int x, int l, int r) { if (l == r) return; int mid = (l + r) >> 1; pushdown(x, l, r); prints(x << 1, l, mid); prints(x << 1 | 1, mid + 1, r); } int main() { int n = read(), m = read(); f[0] = 0, f[1] = 1; for (int i = 2; i <= n + 2; i++) f[i] = (f[i - 1] + f[i - 2]) % MOD; for (int i = 1; i <= n; i++) scanf( %d , &a[i]); build(1, 1, n); for (int i = 1; i <= m; i++) { int t = read(), l = read(), r = read(); if (t == 1) change(1, 1, n, l, r); else printf( %d n , query(1, 1, n, l, r)); } } |
#include <bits/stdc++.h> using namespace std; int n, q, fa[50005], ff[50005], h[50005], tot, e[50005 << 1], nxt[50005 << 1], mx[50005][256], cnt[50005][256], Ans[50005][256], ans, val[50005], dep[50005]; template <class T> inline void read(T &x) { x = 0; bool emm = 1; char c; for (c = getchar(); c < 0 || c > 9 ; c = getchar()) if (c == - ) emm = -1; for (; c >= 0 && c <= 9 ; c = getchar()) x = (x << 1) + (x << 3) + c - 0 ; x *= emm; } inline void add(int x, int y) { e[++tot] = y, nxt[tot] = h[x], h[x] = tot; } inline void dfs(int x) { dep[x] = dep[fa[x]] + 1; int i; if (dep[x] >= 256) { int l, r, mid, s; for (i = x; dep[x] - dep[i] < 256; i = fa[i]) { mx[x][val[i] >> 8] = max(mx[x][val[i] >> 8], (dep[x] - dep[i] ^ val[i]) & 255); cnt[x][val[i] >> 8]++; } ff[x] = i; for (i = 1; i < 256; i++) cnt[x][i] += cnt[x][i - 1]; for (i = 0; i <= (n - 1) / 256; i++) { for (l = s = 0, r = 256, mid = r >> 1; l < r - 1; mid = l + r >> 1) { if ((s ^ i) < mid) { if (cnt[x][r - 1] > cnt[x][mid - 1]) s |= r - mid, l = mid; else r = mid; } else { if (cnt[x][mid - 1] > ((l) ? cnt[x][l - 1] : 0)) s |= r - mid, r = mid; else l = mid; } } Ans[x][i] = (s << 8) | mx[x][l]; } } for (i = h[x]; i; i = nxt[i]) if (e[i] != fa[x]) fa[e[i]] = x, dfs(e[i]); } int main() { read(n), read(q); for (int i = 1; i <= n; i++) read(val[i]); for (int x, y, i = 1; i < n; i++) read(x), read(y), add(x, y), add(y, x); for (dfs(1); q--;) { int u, v, dis; read(u), read(v); for (dis = ans = 0; dep[v] - dep[u] >= 256; v = ff[v], dis++) ans = max(ans, Ans[v][dis]); for (dis <<= 8; v != fa[u]; v = fa[v], dis++) ans = max(ans, dis ^ val[v]); printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:67108864 ) const int MOD = 1000000007; const long long INF = 3000000000000000001; const double EPS = 1e-6; const int HASH_POW = 29; const double PI = acos(-1.0); using namespace std; double workTime() { return double(clock()) / CLOCKS_PER_SEC; } void my_return(int code) { exit(code); } int n, q; char p[2][200010]; const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; int cur = 0, cmp[2][200010]; void dfs(int x, int y) { if (p[x][y] == X ) return; cmp[x][y] = cur; for (int i = 0; i < 4; ++i) { int nx = x + dx[i], ny = y + dy[i]; if (0 <= nx && nx < 2 && 0 <= ny && ny < n && cmp[nx][ny] == 0) dfs(nx, ny); } } int sum[200010], ll[200010], rr[200010]; int main() { cin.sync_with_stdio(0); cin.tie(0); mt19937 mt_rand(time(0)); scanf( %d %d n , &n, &q); for (int i = 0; i < 2; ++i) { for (int j = 0; j < n; ++j) p[i][j] = getchar(); getchar(); } for (int i = 0; i < 2; ++i) { for (int j = 0; j < n; ++j) { if (!cmp[i][j]) { ++cur; dfs(i, j); } } } int lastx = -1; for (int j = 0; j < n; ++j) { if (p[0][j] == X && p[1][j] == . ) { if (lastx == 1) ++sum[j]; lastx = 0; } else if (p[0][j] == . && p[1][j] == X ) { if (lastx == 0) ++sum[j]; lastx = 1; } else if (p[0][j] == X && p[1][j] == X ) lastx = -1; } for (int j = 1; j < n; ++j) sum[j] += sum[j - 1]; ll[0] = -1; for (int j = 0; j < n; ++j) if ((p[0][j] == X && p[1][j] == . ) || (p[0][j] == . && p[1][j] == X )) ll[j] = j; for (int j = 1; j < n; ++j) if (!ll[j]) ll[j] = ll[j - 1]; rr[n - 1] = -1; for (int j = n - 1; j >= 0; --j) if ((p[0][j] == X && p[1][j] == . ) || (p[0][j] == . && p[1][j] == X )) rr[j] = j; for (int j = n - 2; j >= 0; --j) if (!rr[j]) rr[j] = rr[j + 1]; while (q--) { int foo, bar; scanf( %d %d , &foo, &bar); int x1, y1, x2, y2; x1 = (foo - 1) / n; y1 = (foo - 1) % n; x2 = (bar - 1) / n; y2 = (bar - 1) % n; if (y1 > y2) { swap(x1, x2); swap(y1, y2); } if (cmp[x1][y1] != cmp[x2][y2]) printf( -1 n ); else { if (rr[y1] == rr[y2]) printf( %d n , abs(y1 - y2) + abs(x1 - x2)); else { int ans = 0; int nxtL = rr[y1], nxtR = ll[y2]; ans += abs(nxtL - y1) + abs(nxtR - y2); if (p[x1][nxtL] == X ) ++ans; if (p[x2][nxtR] == X ) ++ans; ans += abs(nxtR - nxtL) + sum[nxtR]; if (nxtL) ans -= sum[nxtL]; printf( %d n , ans); } } } my_return(0); } |
#include <bits/stdc++.h> using namespace std; using point_t = pair<int, int>; int main() { size_t n; cin >> n; vector<point_t> obelisks(n), clues(n); for (point_t &p : obelisks) cin >> p.first >> p.second; for (point_t &p : clues) cin >> p.first >> p.second; point_t treasure; map<point_t, size_t> finds; for (point_t &ob : obelisks) for (point_t &cl : clues) { point_t p{ob.first + cl.first, ob.second + cl.second}; size_t &c{++finds[p]}; if (c == n) { cout << p.first << << p.second << endl; return 0; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, mini, c = 0; scanf( %d %d %d , &n, &m, &mini); for (int i = m; i < mini + 1; i += m) { if (i % n == 0) c++; } printf( %d n , c); return 0; } |
#include <bits/stdc++.h> using namespace std; long long num[20]; int cnt; int main() { int n; long long k, x; long long ans = 0LL; scanf( %d , &n); for (int i = 1; i <= n; i++) { cnt = 0; scanf( %I64d%I64d , &x, &k); long long r = x + k - 1LL; long long l = x; while (l % 4 != 0 && l <= r) num[++cnt] = l++; l--; while (r % 4 != 3 && l < r) num[++cnt] = r--; for (int j = 1; j <= cnt; j++) ans ^= num[j]; } if (ans == 0LL) printf( bolik n ); else printf( tolik n ); return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[100005]; int main() { long long n; scanf( %lld , &n); for (long long i = 0; i < n; i++) scanf( %lld , &a[i]); sort(a, a + n); long long sm = 0; for (long long i = 0; i < n / 2; i++) { sm = ((sm % 10007) + ((a[i] % 10007) * (a[n - i - 1] % 10007)) % 10007) % 10007; } sm = (sm * 2) % 10007; if (n % 2 == 1) sm = ((sm % 10007) + ((a[n / 2] % 10007) * (a[n / 2] % 10007)) % 10007) % 10007; cout << sm << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1000110; string str[7] = { monday , tuesday , wednesday , thursday , friday , saturday , sunday }; int main() { string s, s1; while (cin >> s >> s1) { int i; int a, b; for (i = 0; i < 7; i++) { if (s == str[i]) a = i; if (s1 == str[i]) b = i; } if (b - a == 3 || b - a == 0 || b - a == -4 || b - a == 2 || b - a == -4 || b - a == 2 || b - a == 3 || b - a == -4 || b - a == 2 || b - a == 3 || b - a == -5) cout << YES << endl; else cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; #define ll long long #define mp make_pair #define rep(i,a,b) for( i=a;i<b;++i) #define repr(i,a,b) for( i=a;i>=b;i--) #define up upper_bound #define lb lower_bound #define t() int test;cin>>test;while(test--) #define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define TRACE #ifdef TRACE #define trace(...) __f(#__VA_ARGS__, __VA_ARGS__) template <typename Arg1> void __f(const char* name, Arg1&& arg1){ cout << name << : << arg1 << endl; //use cerr if u want to display at the bottom } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args){ const char* comma = strchr(names + 1, , ); cout.write(names, comma - names) << : << arg1<< | ;__f(comma+1, args...); } #else #define trace(...) #endif bool cmp(pair<ll,ll> a,pair<ll,ll> b){ if(a.first != b.first){ return a.first < b.first; }else{ return a.second < b.second; } } int main() { #ifndef ONLINE_JUDGE freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); #endif IOS; ll t; cin >> t; while(t--){ ll n; cin >> n; vector<string> s(n); for(ll i = 0;i < n;i++){ cin >> s[i]; } ll k= 0; for(ll i = 0;i < n;i++){ for(ll j = 0;j < n;j++){ if (s[i][j] != . ){ k++; } } } bool flag = true; for(ll x = 0;x < 3;x++){ for(ll y = 0;y < 3;y++){ if(x == y){ continue; }else{ ll count = 0; for(ll i = 0;i < n;i++){ for(ll j= 0;j < n;j++){ if(s[i][j] == X && (i + j)%3 == x){ count++; }else if(s[i][j] == O && (i + j)%3 == y){ count++; } } } if(count <= k/3){ for(ll i = 0;i < n;i++){ for(ll j= 0;j < n;j++){ if(s[i][j] == X && (i + j)%3 == x){ s[i][j] = O ; }else if(s[i][j] == O && (i + j)%3 == y){ s[i][j] = X ; } } } for(auto it : s){ cout << it << n ; } flag = false; break; } } } if(!flag){ break; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; int MM[500], FF[500]; int main() { ios::sync_with_stdio(0); int N; cin >> N; for (int i = 0; i < N; i++) { char g; int from, to; cin >> g >> from >> to; int *v; if (g == M ) for (int i = from; i <= to; i++) MM[i]++; else for (int i = from; i <= to; i++) FF[i]++; } int MAX = 0; for (int i = 1; i < 400; i++) MAX = max(MAX, min(MM[i], FF[i]) * 2); cout << MAX; return 0; } |
#include <bits/stdc++.h> using namespace std; int input() { int x = 0, f = 0; char ch = getchar(); while (ch < 0 || ch > 9 ) f |= ch == 0 , ch = getchar(); while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); return f ? -x : x; } int n, m, du[2100]; bool Check() { for (int i = 1; i <= n; i++) { if (du[i] % 2 == 1) return 0; } printf( 1 n ); for (int i = 1; i < n; i++) printf( 1 ); printf( 1 n ); return 1; } bitset<2100> s[2100]; void Gauss() { int x = 1; for (int j = 1; j <= n; j++) { for (int i = x; i <= n; i++) { if (s[i][j] == 1) { swap(s[i], s[x]); break; } } if (s[x][j] == 0) continue; for (int i = 1; i <= n; i++) { if (i == x) continue; if (s[i][j] == 1) s[i] ^= s[x]; } x++; } } int as[2100]; void Solve() { int x, y; n = input(), m = input(); for (int i = 1; i <= n; i++) s[i].reset(); memset(du, 0, sizeof du); for (int i = 1; i <= m; i++) { x = input(), y = input(); du[x]++, du[y]++; s[x][y] = 1, s[y][x] = 1; } if (Check()) return; for (int i = 1; i <= n; i++) { if (du[i] % 2 == 1) s[i][i] = 1, s[i][n + 1] = 1; } Gauss(); x = 1; for (int j = 1; j <= n; j++) { if (s[x][j] == 0) { as[j] = 1; continue; } as[j] = s[x][n + 1] + 1; x++; } printf( 2 n ); for (int i = 1; i < n; i++) printf( %d , as[i]); printf( %d n , as[n]); } int main() { int T; T = input(); while (T--) { Solve(); } } |
#include <bits/stdc++.h> using namespace std; int n; int ans[100000 + 1]; void reverseAns(int l, int r) { if (l > r) return; int mid = (l + r) >> 1; for (int i = 1; i <= mid - l + 1; ++i) { swap(ans[i + l - 1], ans[r - i + 1]); } } int main() { ios::sync_with_stdio(false); cin >> n; for (int i = 1; i <= n; ++i) { ans[i] = i; } int block = round(sqrt(n)); int tot = n / block; for (int i = 1; i <= tot; ++i) { reverseAns((i - 1) * block + 1, i * block); } reverseAns(tot * block + 1, n); for (int i = 1; i <= n; ++i) { cout << ans[i] << ; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, q, j, x[300000 + 10], a, b, sum, t, o[300000 + 10], p[300000 + 10], h = 1; int main() { cin >> n >> q; for (int i = 0; i < q; i++) { cin >> a >> b; if (a == 1) { j++; x[j] = b; o[b]++; p[b]++; sum++; cout << sum << endl; continue; } if (a == 2) { sum -= o[b]; o[b] = 0; cout << sum << endl; continue; } if (a == 3) { for (h; h <= b; h++) { int n1 = x[h]; if (p[n1] > 0) p[n1]--; if (p[n1] < o[n1]) { sum--; o[n1]--; } } cout << sum << endl; continue; } } } |
#include <bits/stdc++.h> long long mod(long long x) { if (x < 0) return -x; return x; } long long expo(long long x, long long y) { long long res = 1; while (y > 0) { if (y % 2 == 1) res = (res * x); y = y >> 1; x = x * x; } return res; } using namespace std; const int MAXN = 500005; vector<long long> v; long long a[1000000], b[1000000]; int main() { ios_base::sync_with_stdio(false); long long n, t, m, k, x, y; cin >> n; string s; cin >> s; x = 0; y = 0; t = 0; if (n % 2 != 0) { cout << :( ; return 0; } for (long long i = 0; i < n; i++) { if (s[i] == ) ) { y++; } if (s[i] == ( ) { x++; } } k = n / 2 - x; for (long long i = 0; i < n; i++) { if (s[i] == ? ) { s[i] = ( ; k--; } if (k <= 0) break; } k = n / 2 - y; for (long long i = 0; i < n; i++) { if (s[i] == ? ) { s[i] = ) ; k--; } if (k <= 0) break; } t = 0; for (long long i = 0; i < n; i++) { if (s[i] == ) ) { t--; } if (s[i] == ( ) { t++; } if (t <= 0 && i != n - 1) { cout << :( ; return 0; } if (t < 0) { cout << :( ; return 0; } } if (t != 0) { cout << :( ; return 0; } cout << s; return 0; } |
#include <bits/stdc++.h> using namespace std; const int dx[4] = {0, 0, -1, 1}; const int dy[4] = {-1, 1, 0, 0}; int main() { int i, j, k, n; long int mx, mn, sm = 0; int t; cin >> t; while (t--) { int f = 0; cin >> n; vector<pair<int, int>> v(n); for (i = 0; i < n; i++) { int a, b; cin >> a >> b; v[i] = (make_pair(a, b)); } if (v[0].first < v[0].second) f = 1; for (i = 1; i < n; i++) { int x = v[i].first - v[i - 1].first; int y = v[i].second - v[i - 1].second; if (x < 0 || y < 0 || (v[i].first < v[i].second) || (v[i - 1].first < v[i - 1].second) || y > x) { f = 1; break; } } if (f) cout << NO << n ; else { cout << YES << n ; } } } |
#include <bits/stdc++.h> using namespace std; const int maxn = 100005; const int maxm = 100005; typedef int arr[maxn]; arr head, dfn, low, col, st; int top, depth, color, tot, cnt; pair<int, int> e[maxm * 2], bridge[maxn]; int euler[maxn * 2], d[maxn * 2][30], pos; void add(int x, int y) { e[tot] = make_pair(head[x], y); head[x] = tot++; } void tarjan(int u, int f) { dfn[u] = low[u] = ++depth; st[++top] = u; for (int i = head[u]; i != -1; i = e[i].first) { int v = e[i].second; if (v == f) continue; if (!dfn[v]) { tarjan(v, u); low[u] = min(low[v], low[u]); } else low[u] = min(low[u], dfn[v]); if (low[v] > dfn[u]) bridge[cnt++] = make_pair(u, v); } if (dfn[u] == low[u]) { int x; color++; do { col[x = st[top--]] = color; } while (x != u); } } void dfs(int u, int f) { euler[++pos] = u; low[u] = pos; for (int i = head[u]; i != -1; i = e[i].first) { int v = e[i].second; if (v == f) continue; dfn[v] = dfn[u] + 1; dfs(v, u); euler[++pos] = u; } } void RMQ_init() { for (int i = 1; i <= pos; i++) d[i][0] = i; for (int j = 1; (1 << j) <= pos; j++) { for (int i = 1; i + j - 1 <= pos; i++) { if (dfn[euler[d[i][j - 1]]] < dfn[euler[d[i + (1 << (j - 1))][j - 1]]]) { d[i][j] = d[i][j - 1]; } else d[i][j] = d[i + (1 << (j - 1))][j - 1]; } } } int RMQ(int L, int R) { int k = 0; if (L > R) swap(L, R); while ((1 << (k + 1)) <= R - L + 1) k++; return dfn[euler[d[L][k]]] < dfn[euler[d[R - (1 << k) + 1][k]]] ? d[L][k] : d[R - (1 << k) + 1][k]; } int main() { for (int n, m; scanf( %d%d , &n, &m) != EOF;) { depth = color = tot = top = cnt = 0; for (int i = 1; i <= n; i++) { head[i] = -1, dfn[i] = 0; } for (int i = 1, x, y; i <= m; i++) { scanf( %d%d , &x, &y); add(x, y); add(y, x); } tarjan(1, -1); tot = 0; for (int i = 0; i <= color; i++) { head[i] = -1; dfn[i] = 0; } for (int i = 0; i < cnt; i++) { add(col[bridge[i].first], col[bridge[i].second]); add(col[bridge[i].second], col[bridge[i].first]); } pos = 0; dfn[1] = 0; dfs(1, 0); RMQ_init(); int Q; scanf( %d , &Q); for (int i = 1, x, y; i <= Q; i++) { scanf( %d%d , &x, &y); int ance = RMQ(low[col[x]], low[col[y]]); ance = euler[ance]; printf( %d n , dfn[col[x]] + dfn[col[y]] - 2 * dfn[ance]); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); int zuo = 0, you = 0; for (int i = 0; i < n; i++) { int x, y; scanf( %d %d , &x, &y); zuo += x; you += y; } printf( %d n , min(n - zuo, zuo) + min(n - you, you)); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxk = 20; const int maxn = 3e5 + 17; int N, Q; int sub[maxn], ans[maxn]; vector<int> graph[maxn]; set<pair<int, int> > DFS(int u) { sub[u] = 1; set<pair<int, int> > cur; for (int v : graph[u]) { set<pair<int, int> > next = DFS(v); if (next.size() >= cur.size()) swap(cur, next); for (auto x : next) cur.insert(x); sub[u] += sub[v]; } cur.insert({sub[u], u}); ans[u] = cur.lower_bound({sub[u] + 1 >> 1, 0})->second; return cur; } int main() { ios_base::sync_with_stdio(false); cin >> N >> Q; for (int i = 2; i <= N; i++) { int x; cin >> x; graph[x].push_back(i); } DFS(1); while (Q--) { int x; cin >> x; cout << ans[x] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long rd() { long long x = 0; int ch = getchar(), f = 1; while (!isdigit(ch) && (ch != - ) && (ch != EOF)) ch = getchar(); if (ch == - ) { f = -1; ch = getchar(); } while (isdigit(ch)) { x = (x << 1) + (x << 3) + ch - 0 ; ch = getchar(); } return x * f; } inline void rt(long long x) { if (x < 0) putchar( - ), x = -x; if (x >= 10) rt(x / 10), putchar(x % 10 + 0 ); else putchar(x + 0 ); } const int maxn = 130; int N; double a[maxn][maxn], b[maxn][maxn], c[maxn][maxn], p[maxn]; void pow(int x) { if (x == 1) { for (int i = 0; i <= (int)N; i++) for (int j = 0; j <= (int)N; j++) c[i][j] = a[i][j]; return; } pow(x >> 1); memset(b, 0, sizeof b); for (int k = 0; k <= (int)N; k++) for (int i = 0; i <= (int)N; i++) for (int j = 0; j <= (int)N; j++) b[i][j] += c[i][k] * c[k][j]; if (x & 1) { memset(c, 0, sizeof c); for (int k = 0; k <= (int)N; k++) for (int i = 0; i <= (int)N; i++) for (int j = 0; j <= (int)N; j++) c[i][j] += b[i][k] * a[k][j]; } else memcpy(c, b, sizeof c); } int n, x; int main() { n = rd(), x = rd(); for (int i = 0; i <= (int)x; i++) scanf( %lf , &p[i]); for (N = 1; N <= x; N <<= 1) ; N--; for (int i = 0; i <= (int)N; i++) for (int j = 0; j <= (int)x; j++) a[i][i ^ j] = p[j]; pow(n); double ans = 0; printf( %.8lf n , 1 - c[0][0]); } |
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( unroll-loops ) #pragma GCC optimize( Ofast ) #pragma GCC optimize( O3 ) const long long inf = 1e18; long long i, j, k, m, n, qq, t, it, ma = -inf, mi = inf, x, y, col, md = 998244353; string cmp(string second) { vector<long long> p(second.size(), 0); for (i = 1; i < second.size(); i++) { j = p[i - 1]; while (j > 0 && second[i] != second[j]) j = p[j - 1]; if (second[i] == second[j]) j++; p[i] = j; } return second.substr(0, j); } int32_t main() { cin >> qq; while (qq--) { string second; cin >> second; n = second.size(); k = 0; while (n - 1 - k >= 0 && k < n / 2 && second[k] == second[n - 1 - k]) k++; if (k == (n + 1) / 2) { cout << second << n ; continue; } for (i = 0; i < k; i++) cout << second[i]; string t = second.substr(k, max(0ll, n - k - k)); string rt = t; reverse(rt.begin(), rt.end()); string ans1 = cmp(t + % + rt); string ans2 = cmp(rt + % + t); if (ans1.size() > ans2.size()) cout << ans1; else cout << ans2; for (i = k - 1; i > -1; i--) cout << second[i]; cout << n ; } return 0; } |
#include <bits/stdc++.h> char B[1 << 26], *S = B, C; int X; inline int read() { while ((C = *S++) < 0 || C > 9 ) ; for (X = C - 0 ; (C = *S++) >= 0 && C <= 9 ;) X = (X << 3) + (X << 1) + C - 0 ; return X; } int f[1000000 + 5], r[1000000 + 5], u[1000000 + 5]; int gf(int k) { return f[k] ? f[k] = gf(f[k]) : k; } int main() { fread(B, 1, 1 << 26, stdin); int n, m, x, y, i, cnt = 1, s = 0; long long ans = 0; n = read(); m = read(); for (i = 1; i <= m; ++i) { x = read(); y = read(); if (x == y) ++s, u[x] = 1; else ++r[x], ++r[y]; if (gf(x) != gf(y)) ++cnt, f[gf(x)] = gf(y); } for (i = 1; i <= n; ++i) if (!u[i] && !r[i]) ++cnt; if (cnt < n) return 0 * puts( 0 ); for (i = 1; i <= n; ++i) ans += 1LL * r[i] * (r[i] - 1) >> 1; ans += 1LL * s * (m - s) + (1LL * s * (s - 1) >> 1); printf( %I64d , ans); } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s; cin >> s; int rc = 0, uc = 0, c = 0; for (int i = 0; i < n; i++) { if (s[i] == R ) rc++; else uc++; if (rc == uc && s[i] == s[i + 1]) c++; } cout << c << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int M = 1e9 + 7; int main() { ios::sync_with_stdio(false); cin.tie(0); cerr.tie(0); int n, a[100005], sum = 0; cin >> n; for (int i = 0; i < n; i++) cin >> a[i], sum += a[i]; sort(a, a + n); int p[] = {0, -1, -1}, ct = 0, f = 0; for (int i = 0; i < n; i++) { if ((a[i] % 3 == sum % 3) && p[sum % 3] == -1 && sum % 3 != 0) p[sum % 3] = i; if (a[i] == 0) ct++; } if ((n == 1 && a[0] == 0) || (a[n - 1] == 0) || (ct >= n - 1 && sum % 3 != 0)) { cout << 0 ; return 0; } if (p[sum % 3] == -1 && a[0] == 0) { if (sum % 3 == 2) { int p1 = -1, p2 = -1; for (int i = 0; i < n; i++) { if (a[i] % 3 == 1) { if (p1 == -1) p1 = i; else if (p2 == -1) p2 = i; } } if (p2 == -1) { cout << 0 ; } else { for (int i = n - 1; i >= 0; i--) { if (i != p1 && i != p2) { if (a[i] == 0 && f == 0) { cout << 0 ; return 0; } else f = 1, cout << a[i]; } } } } else if (sum % 3 == 1) { int p1 = -1, p2 = -1; for (int i = 0; i < n; i++) { if (a[i] % 3 == 2) { if (p1 == -1) p1 = i; else if (p2 == -1) p2 = i; } } if (p2 == -1) { cout << 0 ; } else { for (int i = n - 1; i >= 0; i--) { if (i != p1 && i != p2) { if (a[i] == 0 && f == 0) { cout << 0 ; return 0; } else f = 1, cout << a[i]; } } } } return 0; } if (a[0] != 0 || p[sum % 3] == -1) { cout << -1; return 0; } else { for (int i = n - 1; i >= 0; i--) { if (i != p[sum % 3] || a[i] == 0) { if (f == 0 && a[i] == 0) { cout << 0 ; return 0; } else f = 1, cout << a[i]; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int h1, h2, m1, m2, h3, m3; char s1, s2; cin >> h1 >> s1 >> m1 >> h2 >> s2 >> m2; if (h1 == 0) h1 = 24; if (h2 == 0) h2 = 24; if (m1 < m2) { h1--; m3 = m1 + 60 - m2; } else m3 = m1 - m2; if (h1 < h2) { h3 = h1 + 24 - h2; } else h3 = h1 - h2; if (m3 >= 10 && h3 >= 10) cout << h3 << s1 << m3 << endl; else if (m3 < 10 && h3 >= 10) cout << h3 << s1 << 0 << m3 << endl; else if (h3 < 10 && m3 >= 10) cout << 0 << h3 << s1 << m3 << endl; else cout << 0 << h3 << s1 << 0 << m3 << endl; } |
#include <bits/stdc++.h> using namespace std; const double PI = 3.141592653589793238462643383279502884197169399375105820974944; long long dist(long long a, long long b, long long c, long long d) { return abs(a - c) + abs(b - d); } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long a, b, c, d; cin >> a >> b >> c >> d; long long ans = 1000000000; for (long long i = c - 1; i <= c + 1; i++) { for (long long j = d - 1; j <= d + 1; j++) { if (i != c or j != d) { ans = min(ans, dist(a, b, i, j)); } } } cout << 2 * ans + 8 << endl; } |
#include <bits/stdc++.h> using namespace std; int n, tb[100], w1, w2, l = 1; int main() { scanf( %d , &n); for (int i = 0; i < n / 2; i++) scanf( %d , &tb[i]); sort(tb, tb + n / 2); for (int i = 0; i < n / 2; i++) { w1 += abs(tb[i] - l); l += 2; } l = 2; for (int i = 0; i < n / 2; i++) { w2 += abs(tb[i] - l); l += 2; } printf( %d , min(w1, w2)); return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const long long infl = 1LL << 60; mt19937 rnd(time(0)); inline int myrand(int l, int r) { return rnd() % (r - l + 1) + l; } inline int read() { int x = 0, f = 1; char c = getchar(); while (!isdigit(c)) { if (c == - ) f = -1; c = getchar(); } while (isdigit(c)) { x = x * 10 + c - 0 , c = getchar(); } return x * f; } const int maxn = 3e5 + 10; vector<int> linker[maxn]; int n, m, q[maxn], dis[maxn], pre[maxn]; bool mark[maxn], vis[maxn]; vector<int> v; void dfs(int x) { vis[x] = 1, v.push_back(x); for (int cur : linker[x]) if (!vis[cur]) dfs(cur); } void print() { vector<int> ans(0); int x = n; while (x) ans.push_back(x), x = pre[x]; reverse(ans.begin(), ans.end()); for (int cur : ans) printf( %d , cur); puts( ); } int main() { n = read(), m = read(); for (int i = 1; i <= m; i++) { int u = read(), v = read(); linker[u].push_back(v); linker[v].push_back(u); } int head = 1, tail = 0; memset(dis, 0x3f, sizeof dis); q[++tail] = 1, dis[1] = 0; while (head <= tail) { int x = q[head++]; for (int cur : linker[x]) if (dis[cur] == inf) dis[cur] = dis[x] + 1, q[++tail] = cur, pre[cur] = x; } if (dis[n] <= 4) return printf( %d n , dis[n]), print(), 0; for (int cur : linker[1]) mark[cur] = 1; mark[1] = 1; for (int cur : linker[1]) { for (int to : linker[cur]) if (!mark[to]) { printf( %d n%d %d %d %d %d n , 4, 1, cur, to, 1, n); return 0; } } vis[1] = 1; for (int x : linker[1]) if (!vis[x]) { dfs(x); for (int y : v) { if (mark[y] && linker[y].size() - 1 < v.size() - 1) { printf( %d n , min(dis[n], 5)); if (dis[n] < 5) print(); else { memset(mark, 0, sizeof mark); for (int cur : linker[y]) mark[cur] = 1; mark[y] = 1; for (int cur : linker[y]) if (cur != 1) for (int foo : linker[cur]) if (!mark[foo]) { printf( %d %d %d %d %d %d n , 1, y, cur, foo, y, n); return 0; } } return 0; } } v.clear(); } if (dis[n] == inf) return puts( -1 ), 0; else { printf( %d n , dis[n]); print(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const double v = 1.41421356237; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); int t = 1; cin >> t; while (t--) { long long int x1, y1, z1, x2, y2, z2; cin >> x1 >> y1 >> z1 >> x2 >> y2 >> z2; long long int m, sum = 0; m = min(z1, y2); sum += (2 * m); m = min(x1, z2); x1 -= m; z2 -= m; m = min(y1, x2); y1 -= m; x2 -= m; sum -= (2 * min(y1, z2)); cout << sum << endl; } } |
#include <bits/stdc++.h> using namespace std; const int N = 50005; const unsigned long long MOD = 1e8 + 7; const unsigned long long MAX = 1e15; int X[N], Y[N], T[N], K[N]; int n; double P[N], dp[N], ans = 0; bool cmp(int a, int b) { return T[a] < T[b]; } double dist(int i, int j) { double ans = sqrt((X[K[i]] - X[K[j]]) * (X[K[i]] - X[K[j]]) + (Y[K[i]] - Y[K[j]]) * (Y[K[i]] - Y[K[j]])); return ans; } void work() { for (int i = 1; i <= n; i++) { dp[i] = P[K[i]]; for (int j = 1; j < i; j++) if (dist(i, j) + T[K[j]] <= T[K[i]]) dp[i] = max(dp[j] + P[K[i]], dp[i]); ans = max(ans, dp[i]); } } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d%d%d%lf , &X[i], &Y[i], &T[i], &P[i]); K[i] = i; } sort(K + 1, K + n + 1, cmp); work(); printf( %.7f n , ans); } |
#include <bits/stdc++.h> using namespace std; int n, k, a[10010]; bool vs[3000][3000]; int main() { cin >> n >> k; for (int i = n + 1; i <= n + k; i++) { a[i] = i - n; } for (int i = 1; i <= n; i++) a[i] = i; for (int i = 1; i <= n; i++) { for (int j = i + 1; j <= i + k; j++) { if (!vs[a[i]][a[j]] && !vs[a[j]][a[i]]) { vs[a[i]][a[j]] = true; vs[a[j]][a[i]] = true; } else { cout << -1; exit(0); } } } if (n == 1) { cout << -1; exit(0); } cout << n * k << n ; for (int i = 1; i <= n; i++) for (int j = i + 1; j <= i + k; j++) cout << a[i] << << a[j] << n ; } |
#include <bits/stdc++.h> using namespace std; long long int n, t; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> t; while (t--) { cin >> n; long long int a[n], x = 0; vector<long long int> ans; for (int i = 0; i < n; i++) { cin >> a[i]; if (i == 0) { ans.push_back(a[i]); continue; } long long int last = ans[ans.size() - 1]; if ((a[i] > 0 && last < 0) || (last > 0 && a[i] < 0)) ans.push_back(a[i]); else { ans[ans.size() - 1] = max(last, a[i]); } } long long int sum = 0; for (int i = 0; i < ans.size(); i++) { sum += ans[i]; } cout << sum << endl; } } |
#include <bits/stdc++.h> using namespace std; bool bin(unsigned long long a, unsigned long long b) { return a > b; } int main() { int n, k; scanf( %d %d , &n, &k); long inp; queue<long> seg; map<long, long> cnt; set<long> once; for (int y = 0; y < k; y++) { scanf( %ld , &inp); seg.push(inp); cnt[inp]++; if (cnt[inp] == 1) once.insert(inp); else if (cnt[inp] > 1) once.erase(inp); } if (!once.empty()) printf( %ld n , (*once.rbegin())); else puts( Nothing ); for (int y = 0; y < n - k; y++) { if (cnt[seg.front()] == 1) { once.erase(seg.front()); cnt.erase(seg.front()); } else cnt[seg.front()]--; if (cnt[seg.front()] == 1) once.insert(seg.front()); seg.pop(); scanf( %ld , &inp); seg.push(inp); cnt[inp]++; if (cnt[inp] == 1) once.insert(inp); else once.erase(inp); if (!once.empty()) printf( %ld n , (*once.rbegin())); else puts( Nothing ); } } |
#include <bits/stdc++.h> using namespace std; int n, in[200005], a[200005], sta[200005], top, now, root, ans, flag; bool vis[200005], mark[200005]; int read() { int x, f = 1; char ch; while (!(isdigit(ch = getchar()))) ch == - ? f = -1 : f; x = ch - 48; while ((isdigit(ch = getchar()))) x = x * 10 + ch - 48; return f * x; } void Topology() { while (now < top) { now++; int tmp = sta[now]; vis[tmp] = 1; in[a[tmp]]--; if (!in[a[tmp]]) sta[++top] = a[tmp]; } } void dfs(int u) { vis[u] = 1; if (!vis[a[u]]) dfs(a[u]); } int main() { n = read(); for (int i = 1; i <= n; i++) { a[i] = read(); in[a[i]]++; if (a[i] == i) { flag = 1; root = i; } } for (int i = 1; i <= n; i++) if (!in[i]) sta[++top] = i; Topology(); for (int i = 1; i <= n; i++) { if (!vis[i]) { if (!root) root = i; ans++; dfs(a[i]); a[i] = root; mark[i] = 1; } } printf( %d n , ans - flag); for (int i = 1; i <= n; i++) { if (mark[i]) a[i] = root; printf( %d , a[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; int u[5005][10005]; int n, m, a[5005], b[5005] = {1}, c[5005] = {1}, d[5005] = {1}, e[5005]; int expmod(int a, int b, int mod) { int res = 1; for (; b; b >>= 1) { if (b & 1) res = 1ll * res * a % mod; a = 1ll * a * a % mod; } return res; } int dunc(int k, int e) { if (k + e > n) return 0; return 1ll * c[k + e - 1] * d[k - 1] % mod; } int main() { scanf( %d , &n); for (int i = 1; i < n; i++) scanf( %d , &a[i]), b[i] = expmod(a[i], mod - 2, mod); for (int i = 1; i < n; i++) c[i] = 1ll * c[i - 1] * a[i] % mod; for (int i = 1; i < n; i++) d[i] = 1ll * d[i - 1] * b[i] % mod; int m = 2 * n - 2; for (int i = 2; i <= n; i++) { u[i][1] = 1; for (int j = 2; j <= m; j++) { u[i][j] = (u[i - 1][j - 1] + 1ll * dunc(i - 1, j - 1) * (a[i - 1] - 1) % mod * b[i - 1]) % mod; } } int ans; for (int i = 1; i <= m; i++) { ans = 0; for (int j = 1; j <= n; j++) { ans = (ans + 1ll * c[j - 1] * (u[j][i] + dunc(j, i))) % mod; } if (ans & 1) printf( %d n , ans + mod >> 1); else printf( %d n , ans >> 1); } } |
#include <bits/stdc++.h> #include <sys/types.h> #include <stdio.h> #include <unistd.h> #define _USE_MATH_DEFINES #define ll long long int #ifndef ONLINE_JUDGE #define debug(x...) cerr << [ << #x << ] = [ ; _print(x) #else #define debug(x...) #endif using namespace std; //mp.reserve(1024); //mp.max_load_factor(0.25); void __print(int x) {cerr << x;} void __print(long x) {cerr << x;} void __print(long long x) {cerr << x;} void __print(unsigned x) {cerr << x;} void __print(unsigned long x) {cerr << x;} void __print(unsigned long long x) {cerr << x;} void __print(float x) {cerr << x;} void __print(double x) {cerr << x;} void __print(long double x) {cerr << x;} void __print(char x) {cerr << << x << ;} void __print(const char *x) {cerr << << x << ;} void __print(const string &x) {cerr << << x << ;} void __print(bool x) {cerr << (x ? true : false );} template<typename T, typename V> void __print(const pair<T, V> &x) {cerr << { ; __print(x.first); cerr << , ; __print(x.second); cerr << } ;} template<typename T> void __print(const T &x) {int f = 0; cerr << { ; for (auto &i: x) cerr << (f++ ? , : ), __print(i); cerr << } ;} void _print() {cerr << ] n ;} template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << , ; _print(v...);} vector<ll> v(200001); ll dp[200001]; ll cal(ll x, ll n){ if(x>=n) return 0; ll now = v[x]; if(dp[x]!=-1) return dp[x]; ll val = now; if(x+v[x]<n){ val += cal(x+v[x], n); } dp[x] = val; return dp[x]; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen( input.txt , r , stdin); //freopen( output1.txt , w , stdout); ll t; cin>>t; while(t--){ ll n, ans = INT_MIN; cin>>n; memset(dp, -1, sizeof dp); for(ll i=0;i<n;i++){ cin>>v[i]; } for(ll i=0;i<n;i++){ ans = max(ans ,cal(i, n)); } cout<<ans<<endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; void err() { cout << n ; } template <class T, class... Ts> void err(const T& arg, const Ts&... args) { cout << arg << ; err(args...); } inline int read() { int s = 0, w = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) w = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) s = s * 10 + ch - 0 , ch = getchar(); return s * w; } void run() { int n = read(); long long sum = 0; long long ans = 0; while (n--) { int a = read(); sum += a; ans = ((ans) < (sum) ? (ans) : (sum)); } cout << -ans << n ; } int main() { int _T = read(); while (_T--) run(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = (3e5) + 10, mod = 1e9 + 7; int n, a[maxn]; map<int, int> mark; int32_t main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; int ans = 0; int num = 0; for (int i = 0; i < n; i++) { if (a[i] > num) return cout << i + 1 << endl, 0; if (a[i] == num) num++; } cout << -1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int f[200005]; int main() { string str; cin >> str; f[0] = 1; for (int i = 1; i < str.length(); i++) { if (str[i] == str[i - 1]) f[i] = f[i - 1] + 1; else f[i] = 1; } int last = 0, plast = 0; cout << str[0]; for (int i = 1; i < str.length(); i++) { if (f[i] == 1) { cout << str[i]; plast = last; last = i; } if (f[i] == 2 && f[plast] == 1) { cout << str[i]; plast = last; last = i; } } puts( ); } |
#include <bits/stdc++.h> using namespace std; void FastIO() { ios_base::sync_with_stdio(false); cin.tie(0); cout.precision(20); } int main() { FastIO(); int N; int A[200][200]; cin >> N; int Count = 0; int Cars[1000] = {0}; for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cin >> A[i][j]; if (A[i][j] == 0) { if (Cars[i + 1] == 0) Cars[i + 1] = 100; if (Cars[j + 1] == 0) Cars[j + 1] = 100; } else if (A[i][j] == 1) { Cars[i + 1] = -100; } else if (A[i][j] == 2) Cars[j + 1] = -100; else if (A[i][j] == 3) { Cars[i + 1] = -100; Cars[j + 1] = -100; } } } for (int i = 1; i <= N; i++) { if (Cars[i] != -100) { Count++; } } cout << Count << endl; for (int i = 1; i <= N; i++) { if (Cars[i] != -100) cout << i << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; void fastio() { ios_base::sync_with_stdio(0); cin.tie(0); } int main() { fastio(); long long int n; cin >> n; long long int ans = 0; long long int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; for (long long int i = 0; i < n; i += 2) { long long int sum = 0; for (long long int j = i + 1; j < n; j += 2) { long long int x = a[j] - sum; if (x < 0) { } else { ans += min(a[i], x); if (sum) ans++; } sum -= a[j]; if (sum < 0) { if (abs(sum) > a[i]) break; else { a[i] += sum; sum = 0; } } if (j + 1 < n) sum += a[j + 1]; } } cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; long long power(long long a, long long b) { long long ans = 1; while (b > 0) { if (b & 1) { ans = (ans * a) % 1000000007; } a = (a * a) % 1000000007; b >>= 1; } return ans; } bool prime(long long n) { for (long long i = 2; i * i <= n; i++) { if (n % i == 0) return false; } return true; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n; cin >> n; long long a[n]; for (long long i = 0; i < n; i++) { cin >> a[i]; } long long i = 0; long long x = 1; bool b = true; vector<long long> v; while (i < n) { if (a[i] == x) { v.push_back(2001 + i); b = false; x++; i++; } else i++; } cout << v.size() << endl; for (long long i = 0; i < v.size(); i++) cout << v[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long int mod = 998244353; long long int hmaxii = 0; vector<long long int> values[2 * 100000 + 1]; long long int MAXN = 2 * 100000 + 1; long long int spf[2 * 100000 + 1]; long long int diff, x, y, z; long long int flag = 1; long long int price[1001][1001]; long long int dp[2000][2000]; long long int ans = 0; long long int gcd(long long int a, long long int b) { return b ? gcd(b, a % b) : a; } long long int power(long long int a, long long int b) { if (b == 0) { return 1; } long long int temp = power(a, b / 2); temp = temp * temp; } void solution() { int n; cin >> n; int arr[n + 1]; int brr[n + 1]; for (int i = 1; i <= n; i++) { int x; cin >> x; arr[x] = i; } for (int i = 1; i <= n; i++) { int x; cin >> x; brr[x] = i; } int answer = 0; map<int, int> values; for (int i = 1; i <= n; i++) { values[(brr[i] - arr[i] + n) % n]++; answer = max(answer, values[(brr[i] - arr[i] + n) % n]); } cout << answer << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int t; t = 1; while (t--) { solution(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, s; while (cin >> n >> s) { int ans = s; for (int i = 0; i < n; ++i) { int f, t; cin >> f >> t; if (ans < f + t) { ans = f + t; } } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> int m[6]; int w[6]; int x[6] = {0, 500, 1000, 1500, 2000, 2500}; double max(int i) { double a = 0.3 * x[i]; double b = (1 - m[i] * 1.0 / 250) * x[i] - 1.0 * 50 * w[i]; if (a > b) return a; return b; } int main() { int i, u, v; while (~scanf( %d%d%d%d%d , &m[1], &m[2], &m[3], &m[4], &m[5])) { double sum = 0; for (i = 1; i <= 5; i++) { scanf( %d , &w[i]); sum += max(i); } scanf( %d%d , &u, &v); sum += 100 * u; sum -= 50 * v; printf( %.0lf n , sum); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const long long inf = 4e18; const long double pai = acos(-1); int n, q, ans; set<pair<pair<int, int>, int> > s; int main() { scanf( %d%d , &n, &q); ans = n; s.insert({{1, n}, 1}); while (q--) { int l, r, x; scanf( %d%d%d , &l, &r, &x), x--; auto it = s.lower_bound({{l, -1}, -1}); if (it == s.end() || it->first.first > l) it--; vector<pair<pair<int, int>, int> > add; while (it != s.end()) { int L = it->first.first, R = it->first.second, old = it->second; if (L < l) add.push_back({{L, l - 1}, old}); if (R > r) add.push_back({{r + 1, R}, old}); it = s.erase(it); ans -= (R - L + 1) * old; if (it == s.end() || it->first.first > r) break; } for (auto u : add) { int L = u.first.first, R = u.first.second, old = u.second; ans += (R - L + 1) * old; s.insert(u); } s.insert({{l, r}, x}); ans += (r - l + 1) * x; printf( %d n , ans); } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, d, l; int ans[101]; int s = 0; cin >> n >> d >> l; for (int i = 0; i < n; ++i) { ans[i] = (i & 1) ? -1 : 1; s += ans[i]; } bool sw = false; while (true) { if (s == d) break; sw = false; if (s < d) { for (int i = 0; i < n; ++i) { if (ans[i] < l and ans[i] > 0) { ans[i]++; s++; sw = true; break; } } } else if (s > d) { for (int i = 0; i < n; ++i) { if (ans[i] < 0 and ans[i] > -l) { ans[i]--; s--; sw = true; break; } } } if (!sw) return cout << -1, 0; } for (int i = 0; i < n; ++i) cout << abs(ans[i]) << ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long fp(long long b, long long p) { long long res = 1; while (p) { if (p % 2) res = (res * b) % 1000000007; b = (b * b) % 1000000007; p /= 2; } return res; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long n, m, k; cin >> n >> m >> k; if (k == -1 && n % 2 != m % 2) return cout << 0, 0; else cout << fp(fp(2, (n - 1)), (m - 1)); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; char b_[N], n_[N]; long long mod, b, n; int prime[N]; inline void get_phi() { int x = mod; int sx = sqrt(mod); for (int i = 2; i <= sx; ++i) { if (x == 1) break; if (x % i) continue; while (x % i == 0) x /= i; prime[++prime[0]] = i; } if (!prime[0] || x != 1) prime[++prime[0]] = x; } inline long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); } inline long long power(long long a, long long p) { long long ans = 1, base = a; while (p) { if (p & 1ll) (ans = ans * base) %= mod; (base = base * base) %= mod; p >>= 1ll; } return ans; } int main() { scanf( %s%s , b_ + 1, n_ + 1); scanf( %lld , &mod); int len = strlen(b_ + 1); b = 0ll; for (register int i = 1; i <= len; ++i) { (b = b * 10ll + b_[i] - 0 ) %= mod; } long long ans = (b - 1ll + mod) % mod; get_phi(); long long phi = mod; for (register int i = 1; i <= prime[0]; ++i) phi = phi / prime[i] * (prime[i] - 1); long long gcd_ = gcd(mod, b); len = strlen(n_ + 1); n = 0ll; bool bigger = 0; for (register int i = 1; i <= len; ++i) { n = n * 10ll + n_[i] - 0 ; if (n > phi) { bigger = 1; n %= phi; } } if (gcd_ != 1) (ans *= power(b, (n - 1 + phi) % phi + (bigger ? phi : 0ll)) % mod) %= mod; else (ans *= power(b, (n - 1 + phi) % phi) % mod) %= mod; printf( %lld n , ((ans % mod) == 0 ? mod : ans % mod)); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int arr[n]; for (int i = 0; i < n; i++) cin >> arr[i]; sort(arr, arr + n, greater<int>()); deque<int> d; d.push_front(arr[0]); int i; for (i = 1; i < n; i++) { if (arr[i] != arr[0]) break; } while (i < n) { int a = arr[i]; d.push_back(a); if (arr[i] == arr[i + 1]) d.push_front(a); for (; i < n; i++) { if (arr[i] != a) break; } } cout << d.size() << endl; while (d.size() > 0) { cout << d.front() << ; d.pop_front(); } } |
#include <bits/stdc++.h> using namespace std; const int maxc = 22; const int maxn = (int)5e5; int tin[maxn], tout[maxn], _t = 0, ver[maxn], n; vector<int> g[maxn]; int deep[maxn], maxh[1 << maxc]; unsigned mask[maxn]; int sz[maxn], ans[maxn]; unsigned char s[maxn]; int dfs_size(int v, unsigned m) { mask[v] = m; sz[v] = 1; ver[tin[v] = _t++] = v; for (auto u : g[v]) { deep[u] = 1 + deep[v]; sz[v] += dfs_size(u, m ^ (1U << s[u])); } tout[v] = _t; return sz[v]; } const int INF = (int)1e9; int calc(int u, int v) { int res = maxh[mask[u]] + deep[u] - 2 * deep[v]; for (int i = 0; i < maxc; ++i) { int m = mask[u] ^ (1U << i); res = max(res, maxh[m] + deep[u] - 2 * deep[v]); } return res; } void dfs(int v, bool flag) { int heavy = -1; for (auto u : g[v]) if (heavy == -1 || sz[heavy] < sz[u]) heavy = u; for (auto u : g[v]) if (heavy != u) { dfs(u, 0); ans[v] = max(ans[v], ans[u]); } if (heavy != -1) { dfs(heavy, 1); ans[v] = max(ans[v], ans[heavy]); } for (auto u : g[v]) if (u != heavy) { for (int t = tin[u]; t < tout[u]; ++t) ans[v] = max(ans[v], calc(ver[t], v)); for (int t = tin[u]; t < tout[u]; ++t) maxh[mask[ver[t]]] = max(maxh[mask[ver[t]]], deep[ver[t]]); } ans[v] = max(ans[v], calc(v, v)); maxh[mask[v]] = max(maxh[mask[v]], deep[v]); if (!flag) for (int t = tin[v]; t < tout[v]; ++t) maxh[mask[ver[t]]] = -INF; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; for (int i = 1; i < n; ++i) { int v; cin >> v >> s[i]; g[v - 1].push_back(i); s[i] -= a ; } dfs_size(0, 0); fill(maxh, maxh + (1 << maxc), -INF); dfs(0, 1); for (int i = 0; i < n; ++i) cout << ans[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); } bool isSubSequence(string str1, string str2, int m, int n) { if (m == 0) return true; if (n == 0) return false; if (str1[m - 1] == str2[n - 1]) return isSubSequence(str1, str2, m - 1, n - 1); return isSubSequence(str1, str2, m, n - 1); } int main() { fast(); long long int t = 1; cin >> t; while (t--) { long long int n, p, k; cin >> n >> p >> k; vector<long long int> v; long long int i, x; for (i = 0; i < n; i++) { cin >> x; v.push_back(x); } sort(v.begin(), v.end()); long long int ans = 0; long long int left = p; vector<long long int> possible; if (v[0] > left) { cout << 0 << endl; } else if (v[0] == left) { if (n >= 2 && v[0] == v[1]) { cout << 2 << endl; } else { cout << 1 << endl; } } else { ans = 1; left -= v[0]; vector<long long int> temp; for (i = 2; i < n; i += 2) { temp.push_back(v[i]); } if (temp.size() == 0) { if (p >= v[1]) { cout << 2 << endl; continue; } else { cout << 1 << endl; continue; } } else { if (v[n - 1] == temp[temp.size() - 1]) { for (i = 0; i < temp.size(); i++) { if (left >= temp[i]) { left -= temp[i]; ans += 2; } } possible.push_back(ans); } else { for (i = 0; i < temp.size(); i++) { if (left >= temp[i]) { left -= temp[i]; ans += 2; } } if (left >= v[n - 1]) { ans += 1; } possible.push_back(ans); } } ans = 0; left = p; for (i = 1; i < n; i += 2) { if (left >= v[i]) { ans += 2; left -= v[i]; } } possible.push_back(ans); sort(possible.begin(), possible.end()); cout << possible[possible.size() - 1] << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int input() { int res = 0; char c = ; while (c < 0 && c != - ) c = getchar(); while (c >= 0 ) res = res * 10 + (c - 0 ), c = getchar(); return res; } const int N = 1e5 + 1; string to_str(int x) { string res; while (x) res += 0 + x % 10, x /= 10; reverse(res.begin(), res.end()); return res; } string rc(string s) { int i = 0, x = 0, y = 0; for (; i < s.size(); ++i) if (s[i] >= 0 && s[i] <= 9 ) break; else y = y * 26 + s[i] - A + 1; for (; i < s.size(); ++i) x = x * 10 + (s[i] - 0 ); return { R + to_str(x) + C + to_str(y)}; } string aa(string s) { int i = 1, x = 0, y = 0; for (; s[i] != C ; ++i) x = x * 10 + (s[i] - 0 ); for (++i; i < s.size(); ++i) y = y * 10 + (s[i] - 0 ); string r; while (y) r += A + (y - 1) % 26, y = (y - 1) / 26; reverse(r.begin(), r.end()); return r + to_str(x); } int main() { for (int i = input(); i; --i) { string s; cin >> s; bool f = false, RC = false; for (auto i : s) { if (i >= A && i <= Z && f) RC = true; else if (i >= 0 && i <= 9 ) f = true; } if (RC) cout << aa(s) << endl; else cout << rc(s) << endl; } } |
#include <bits/stdc++.h> using namespace std; int T, n; char Ls[400000 + 5], ps[400000 + 5]; long long ans; long long read() { long long 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 * 10 + c - 0 ; c = getchar(); } return x * F; } struct AC_automaton { int tr[400000 + 5][26], cnt; int C_end[400000 + 5], fail[400000 + 5], Ans[400000 + 5], lst[400000 + 5]; void Clear() { cnt = 0; fail[0] = 0; memset(tr[0], 0, sizeof(tr[0])); memset(Ans, 0, sizeof(Ans)); } void Insert(char *s, int id) { int p = 0, len = strlen(s); for (int i = 0; i < len; i++) { int num = s[i] - a ; if (!tr[p][num]) { tr[p][num] = ++cnt; C_end[cnt] = 0; memset(tr[cnt], 0, sizeof(tr[cnt])); fail[cnt] = 0; } p = tr[p][num]; } C_end[p]++; } void Build() { queue<int> Q; for (int i = 0; i < 26; i++) if (tr[0][i]) Q.push(tr[0][i]); while (!Q.empty()) { int k = Q.front(); Q.pop(); for (int i = 0; i < 26; i++) if (tr[k][i]) { int nxt = tr[k][i]; fail[nxt] = tr[fail[k]][i]; Q.push(nxt); lst[nxt] = C_end[fail[nxt]] ? fail[nxt] : lst[fail[nxt]]; } else tr[k][i] = tr[fail[k]][i]; } } void Query(char *s) { int p = 0; int len = strlen(s); for (int i = 0; i < len; i++) { if (s[i] < a || s[i] > z ) { p = 0; continue; } p = tr[p][s[i] - a ]; for (int j = p; j; j = lst[j]) Ans[i] += C_end[j]; } } } ac, ac2; int main() { ac.Clear(); ac2.Clear(); scanf( %s , Ls); n = read(); int L; for (int i = 1; i <= n; i++) { scanf( %s , ps); ac.Insert(ps, i); L = strlen(ps); reverse(ps, ps + L); ac2.Insert(ps, i); } int len = strlen(Ls); ac.Build(), ac2.Build(); ac.Query(Ls); reverse(Ls, Ls + len); ac2.Query(Ls); for (int i = 0; i < len - 1; i++) ans += 1LL * ac.Ans[i] * ac2.Ans[len - i - 2]; printf( %lld , ans); } |
#include <bits/stdc++.h> const int maxn = 5205; using namespace std; int n, a[maxn][maxn], m; int cnt, sum[maxn][maxn], x[maxn]; bool check(int x) { int now; for (int i = x; i <= n; i += x) { for (int j = x; j <= n; j += x) { now = sum[i][j] - sum[i - x][j] - sum[i][j - x] + sum[i - x][j - x]; if (now == 0 || now == x * x) continue; else return 0; } } return 1; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { for (int j = 1; j <= n / 4; j++) { scanf( %1x , &m); cnt = 0; while (m) { a[i][j * 4 - cnt++] = (m % 2); m >>= 1; } } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + a[i][j]; } } cnt = 0; for (int i = 1; i <= n; i++) { if (n % i == 0) { x[++cnt] = i; } } for (int k = cnt; k >= 1; k--) { if (check(x[k])) { printf( %d n , x[k]); break; } } } |
#include <bits/stdc++.h> using namespace std; const int maxN = 1000 * 1000 + 100; int nex[maxN]; int st[maxN]; int en[maxN]; vector<int> c[maxN]; int ind; void dfs(int s) { st[s] = ind++; for (auto x : c[s]) dfs(x); en[s] = ind; } int main() { int n, m; string s; cin >> n >> m; cin >> s; int curr = 0; c[curr].push_back(1); for (int i = 1; i < ((int)(s).size()); i++) { while (curr && s[i] != s[curr]) curr = nex[curr]; if (s[curr] == s[i]) curr++; nex[i + 1] = curr; c[curr].push_back(i + 1); } dfs(0); int len = 0; if (m != 0) { int last; cin >> last; last--; len = ((int)(s).size()); int p = ((int)(s).size()); for (int i = 1; i < m; i++) { int num; cin >> num; num--; len += ((int)(s).size()); len -= max(0, last + p - num); if (last + p - num > 0) { int lfix = last + p - num; if (!(st[lfix] <= st[p] && st[p] < en[lfix])) { cout << 0 << endl; return 0; } } last = num; } } else len = 0; long long ans = 1; int mod = 1e9 + 7; len = n - len; for (int i = 0; i < len; i++) ans = ans * 26LL % mod; cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; const vector<int> mods = {998244353, 1000000007, 1000000009}; const long long inf = 3e18; const double pi = acos(-1.0); const double eps = 0.0000001; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); template <class... K> using umap = unordered_map<K...>; template <class... K> using uset = unordered_set<K...>; int n, m, k; int u, v, w; const int N = 200100; const int P = 400000; umap<int, vector<pair<int, int> > > g; long long pw[N][3]; long long fc[10][10][3]; vector<long long> goal; long long comb[15]; long long res; void build() { for (int j = (0); j < (3); ++j) pw[0][j] = 1; for (int i = (1); i < (n + 10); ++i) for (int j = (0); j < (3); ++j) { pw[i][j] = (pw[i - 1][j] * 13) % mods[j]; } goal.resize(3); for (int i = (0); i < (n); ++i) for (int j = (0); j < (3); ++j) { goal[j] = (goal[j] + pw[i][j]) % mods[j]; } } void inc() { long long car = 1; for (int i = (1); i < (10); ++i) { long long nxc = (comb[i] + car) / i; comb[i] = (comb[i] + car) % i; car = nxc; } } bool alz() { for (int i = (1); i < (k + 1); ++i) { if (comb[i]) return 0; } return 1; } int main() { cin.sync_with_stdio(0); cin.tie(0); cout.precision(13); cin >> n >> m >> k; build(); for (int i = (0); i < (m); ++i) { cin >> u >> v >> w; u--; v--; g[u].push_back({w, v}); } for (int i = (0); i < (n); ++i) sort(begin(g[i]), end(g[i])); for (int i = (0); i < (n); ++i) { long long sg = ((int)(g[i]).size()); for (int j = (0); j < (sg); ++j) for (int k = (0); k < (3); ++k) { fc[sg][j][k] = (fc[sg][j][k] + pw[g[i][j].second][k]) % mods[k]; } } res = 0; for (int i = (0); i < (P); ++i) { vector<long long> cur(3); for (int i = (0); i < (k); ++i) for (int j = (0); j < (3); ++j) { cur[j] = (cur[j] + fc[i + 1][comb[i + 1]][j]) % mods[j]; } if (cur == goal) res++; inc(); if (alz()) break; } cout << res << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int N, K; string s; bool dp[1010][1010]; bool dfs(int i, int j) { if (i == N && abs(j) == K) return true; if (i != N && abs(j) == K) return false; if (i == N && abs(j) != K) return false; if (dp[i][j] == 1) return false; dp[i][j] = 1; if (s[i] == W ) return dfs(i + 1, j + 1); if (s[i] == L ) return dfs(i + 1, j - 1); if (s[i] == D ) return dfs(i + 1, j); if (dfs(i + 1, j + 1) == true) { s[i] = W ; return 1; } if (dfs(i + 1, j) == true) { s[i] = D ; return 1; } if (dfs(i + 1, j - 1) == true) { s[i] = L ; return 1; } return 0; } int main() { ios::sync_with_stdio(false); cin >> N >> K; cin >> s; if (dfs(0, 0) == true) cout << s << endl; else cout << NO << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<vector<int>> adj; vector<int> a, b, t; vector<int> dep, sz; void dfs(int v, int p) { dep[v] = dep[p] + 1; for (auto c : adj[v]) { if (c != p) { dfs(c, v); sz[v] += sz[c]; } } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int T; cin >> T; while (T--) { int k; cin >> k; a.resize(2 * k - 1); b.resize(2 * k - 1); t.resize(2 * k - 1); adj.assign(2 * k + 1, vector<int>()); for (int i = 0; i < 2 * k - 1; ++i) { cin >> a[i] >> b[i] >> t[i]; adj[a[i]].push_back(b[i]); adj[b[i]].push_back(a[i]); } dep.assign(2 * k + 1, 0); sz.assign(2 * k + 1, 1); dfs(1, 0); long long solMx = 0, solMn = 0; for (int i = 0; i < 2 * k - 1; ++i) { if (dep[a[i]] > dep[b[i]]) { swap(a[i], b[i]); } solMx += (long long)min(sz[b[i]], 2 * k - sz[b[i]]) * t[i]; solMn += sz[b[i]] % 2 * t[i]; } cout << solMn << << solMx << n ; } } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int MAXN = 5e5 + 10; bool bio[MAXN]; int n; int a[MAXN], b[MAXN], aa[MAXN], bb[MAXN]; int deg[1 << 20]; map<pair<int, int>, vector<int>> id; vector<pair<int, int>> e[1 << 20]; stack<int> path; bool euler(int x, bool print) { for (int i = 0; i < n; ++i) { bio[i] = false; a[i] = aa[i] & ((1 << x) - 1); b[i] = bb[i] & ((1 << x) - 1); deg[a[i]] = deg[b[i]] = 0; e[a[i]].clear(); e[b[i]].clear(); } for (int i = 0; i < n; ++i) { deg[a[i]]++; deg[b[i]]++; e[a[i]].emplace_back(b[i], i); if (a[i] != b[i]) e[b[i]].emplace_back(a[i], i); } for (int i = 0; i < n; ++i) if (deg[a[i]] % 2 || deg[b[i]] % 2) return false; vector<int> ret; int node = a[0]; path.push(node); while (!path.empty()) { int nxt = -1; while (!e[node].empty() && bio[e[node].rbegin()->second]) e[node].pop_back(); if (!e[node].empty()) { path.push(node); nxt = e[node].rbegin()->first; bio[e[node].rbegin()->second] = true; e[node].pop_back(); node = nxt; } else { ret.push_back(node); node = path.top(); path.pop(); } } if (!print) return ret.size() == n + 1; if (ret.size() == n + 1) { printf( %d n , x); for (int i = 0; i < n; ++i) { int aa = a[i] & ((1 << x) - 1); int bb = b[i] & ((1 << x) - 1); id[{aa, bb}].push_back(i); } for (int i = ret.size() - 2; i >= 0; --i) { int a = ret[i + 1], b = ret[i]; if (id.find({a, b}) != id.end() && id[{a, b}].size() != 0) { int x = *id[{a, b}].rbegin(); id[{a, b}].pop_back(); printf( %d %d , 2 * x + 1, 2 * x + 2); } else { int x = *id[{b, a}].rbegin(); id[{b, a}].pop_back(); printf( %d %d , 2 * x + 2, 2 * x + 1); } } printf( n ); exit(0); } } int main(void) { scanf( %d , &n); for (int i = 0; i < n; ++i) { scanf( %d%d , &aa[i], &bb[i]); } int lo = 0, hi = 20; while (lo < hi) { int mid = (lo + hi) / 2 + 1; if (euler(mid, false)) lo = mid; else hi = mid - 1; } euler(lo, true); return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.