Datasets:
malteklaes
/
cpp-code-code_search_net-style

Dataset card Data Studio Files Community
1
func_code_string
stringlengths
59
71.4k
#include <bits/stdc++.h> using namespace std; unordered_map<long long, int> mpSt; unordered_map<long long, int> mpEnd; set<long long> AllPoints; long long K[200005]; int main() { int N; scanf( %d , &N); for (int i = 0; i < N; i++) { long long st, end; scanf( %lld %lld , &st, &end); AllPoints.insert(st); AllPoints.insert(end); if (mpSt.count(st) > 0) mpSt[st]++; else mpSt[st] = 1; if (mpEnd.count(end) > 0) mpEnd[end]++; else mpEnd[end] = 1; } if (N == 1) { if (AllPoints.size() == 1) { printf( 1 ); } else { long long seg = *next(AllPoints.begin()) - *AllPoints.begin() + 1; printf( %lld , seg); } return 0; } auto nextIt = next(AllPoints.begin()); long long cumulative = 0; for (auto it = AllPoints.begin(); nextIt != AllPoints.end(); it++) { long long cur = *it; long long nxt = *nextIt; cumulative += mpSt[cur]; K[cumulative] += 1; cumulative -= mpEnd[cur]; long long middle = nxt - cur - 1; K[cumulative] += middle; nextIt = next(nextIt); } cumulative += mpSt[*prev(AllPoints.end())]; K[cumulative]++; for (int i = 1; i <= N; i++) { printf( %lld , K[i]); } return 0; }
#include <bits/stdc++.h> int main() { int n, temp, count, i, len, len1, j; char c, a[200], b[40]; strcpy(b, qwertyuiopasdfghjkl;zxcvbnm,./ ); while (~scanf( %c , &c)) { getchar(); gets(a); len = strlen(a); len1 = strlen(b); if (c == R ) temp = -1; else temp = 1; for (i = 0; i < len; i++) { for (j = 0; j < len1; j++) { if (a[i] == b[j]) printf( %c , b[j + temp]); } } puts( ); } return 0; }
#include <bits/stdc++.h> int n, i, j, l, h, k[5500], f[5500], t[5500]; int main() { scanf( %d n , &n); for (i = 1; i <= n; i++) { scanf( %d , &h); k[i] = k[i - 1] + h; j = i - 1; while (t[j] > k[i] - k[j]) j--; f[i] = f[j] + i - 1 - j; t[i] = k[i] - k[j]; } printf( %d , f[n]); return (0); }
#include <bits/stdc++.h> using namespace std; int main() { int n, i, j, x = 0; char c[30][30] = {0}; scanf( %d n , &n); for (i = 1; i <= n; i++) { char temp[605] = ; cin.getline(temp, 605); int length = strlen(temp); for (j = 0; j < length; j++) { c[0][temp[j] - 96] = 1; if (j != length - 1) c[temp[j] - 96][temp[j + 1] - 96] = 1; } } for (i = 0; i <= 26; i++) { for (j = 1; j <= 26; j++) { if (c[i][j] == 0 && i == 0) { printf( %c n , j + 96); x = 1; } else if (c[i][j] == 0) { printf( %c%c n , i + 96, j + 96); x = 1; } if (x == 1) return 0; } } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; t = 1; while (t--) { double n; cin >> n; double a[200001], sum = 0; set<double> s; for (int i = 0; i < n; i++) { cin >> a[i]; sum += a[i]; } for (int i = 0; i < n; i++) { double z = sum - a[i]; double y = (z / (n - 1)); if (y == a[i]) s.insert(i + 1); } cout << s.size() << endl; for (auto i : s) cout << i << ; cout << endl; } return 0; }
#include <bits/stdc++.h> namespace myland { using namespace std; namespace _abbr {} using namespace _abbr; namespace _constant { const double EPS(1e-8); const double PI(acos(-1.0)); const int INF(0x3f3f3f3f); const long long INFL(0x3f3f3f3f3f3f3f3fll); const int MOD(1e9 + 7); const int dx[] = {-1, 0, 1, 0, -1, 1, 1, -1}, dy[] = {0, 1, 0, -1, 1, 1, -1, -1}; } // namespace _constant using namespace _constant; namespace _solve {} using namespace _solve; namespace _calculate { bool odd(long long x) { return x & 1; } bool even(long long x) { return (x & 1) ^ 1; } bool posi(long long x) { return x > 0; } bool nega(long long x) { return x < 0; } bool zero(long long x) { return x == 0; } bool prime(long long x) { if (x < 2) return 0; for (int i = 2; i * i <= x; i++) if (x % i == 0) return 0; return 1; } long long droot(long long x) { return 1 + (x - 1) % 9; } long long upd(long long a, long long b) { return a % b ? a / b + 1 : a / b; }; long long random(long long a, long long b) { return a + rand() * rand() % (b - a + 1); }; long long bitn(long long x) { long long c = 0; while (x) c++, x >>= 1; return c; } template <class T> T sqr(T x) { return x * x; } long long qpow(long long a, long long n, long long mod = MOD) { long long res(1); while (n) { if (n & 1) (res *= a) %= mod; (a *= a) %= mod; n >>= 1; } return res % mod; } long long inv(long long a, long long mod = MOD) { return qpow(a, mod - 2); } template <class T> void tomin(T& a, T b) { if (b < a) a = b; } template <class T> void tomax(T& a, T b) { if (b > a) a = b; } } // namespace _calculate using namespace _calculate; namespace _simple_algo { long long sol(const string& s) { long long x = 0; for (char c : s) x = x * 10 + c - 48; return x; } string los(long long x) { string s = ; if (x == 0) return 0 ; while (x) s = char(x % 10 + 48) + s, x /= 10; return s; } bool pal(const string& s) { int l = s.size(); for (int i = 0, j = l - 1; i < j; i++, j--) if (s[i] != s[j]) return 0; return 1; } } // namespace _simple_algo using namespace _simple_algo; namespace _io { template <class T> void rd(T& x) { cin >> x; } string srd() { string s; cin >> s; return s; } long long rd() { long long x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } void rd(int& x) { x = rd(); } void rd(long long& x) { x = rd(); } template <class A, class B> void rd(pair<A, B>& p) { cin >> p.first >> p.second; } template <class A, class B> void rd(A& a, B& b) { rd(a), rd(b); } template <class A, class B, class C> void rd(A& a, B& b, C& c) { rd(a, b); rd(c); } template <class T> void wt(const T& x) { cout << x << endl; } template <class T> void wt(const T& x, char c) { cout << x << c; } template <class T> void wt(const T& x, const string& s) { cout << x << s; } template <class T> void wt(const T& x, int rnd) { cout << fixed << setprecision(rnd) << x << endl; } template <class T> void wt(const vector<T>& v) { for (T x : v) wt(x, ); wt( ); } template <class A, class B> void wt(const pair<A, B>& make_pair) { cout << make_pair.first << << make_pair.second << endl; } } // namespace _io using namespace _io; } // namespace myland using namespace myland; int n(rd()), m(rd()), r(rd()); int s[50], b[50]; int main() { for (int i = 1; i <= n; i++) rd(s[i]); for (int i = 1; i <= m; i++) rd(b[i]); sort((s + 1), (s + n + 1)); sort((b + 1), (b + m + 1)); int t = r / s[1]; if (s[1] < b[m]) { r -= t * s[1]; r += t * b[m]; } wt(r); }
#include <bits/stdc++.h> using namespace std; const double eps = 1e-6; const int N = 101; const int INF = 0x3f3f3f3f; const int mod = 1000000007; long long powmod(long long a, long long b) { long long res = 1; a %= mod; assert(b >= 0); for (; b; b >>= 1) { if (b & 1) res = res * a % mod; a = a * a % mod; } return res; } int a[N], maxf, ans; int d[N]; bool mul; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; for (int i = 0; i < m; i++) { int k, f; cin >> k >> f; a[k] = f; maxf = max(maxf, f); } int now = 1; for (; now <= 100; now++) { int line = 1; bool ok = 1; for (int i = 1; i <= 100; i++) { if (a[i] && a[i] != line) { ok = 0; break; } if (i == n && ans && d[n] != line) { mul = 1; } if (i % now == 0) { line++; } } if (mul && ok) { ans = -1; break; } if (ok) { line = 1; for (int i = 1; i <= 100; i++) { d[i] = line; if (i % now == 0) { line++; } } ans = d[n]; } } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int maxl = 60, w = 10000; struct Big { int s[maxl], l; Big() { memset(s, 0, sizeof(s)); l = 1; } inline void fix() { for (int i = 1; i < l; i++) { if (s[i] >= w) { s[i + 1] += s[i] / w; s[i] %= w; } } while (s[l] >= w) { s[l + 1] += s[l] / w; s[l] %= w; l++; } } void fuzhi(int x) { s[1] = x; l = 1; fix(); } inline void out() { if (s[l] >= 1000) cout << s[l] / 1000 % 10; if (s[l] >= 100) cout << s[l] / 100 % 10; if (s[l] >= 10) cout << s[l] / 10 % 10; cout << s[l] % 10; for (int i = l - 1; i >= 1; i--) { if (s[i] < 1000) cout << 0; if (s[i] < 100) cout << 0; if (s[i] < 10) cout << 0; cout << s[i]; } cout << endl; } }; inline Big operator*(const Big &x, const Big &y) { Big ans; ans.l = x.l + y.l - 1; for (int i = 1; i <= x.l; i++) { for (int j = 1; j <= y.l; j++) ans.s[i + j - 1] += x.s[i] * y.s[j]; } ans.fix(); return ans; } inline bool operator<(const Big &x, const Big &y) { if (x.l != y.l) return x.l < y.l; for (int i = x.l; i >= 1; i--) if (x.s[i] != y.s[i]) return x.s[i] < y.s[i]; return false; } inline Big tran(long long x) { Big ans; ans.fuzhi(x); return ans; } const int maxn = 770; struct E { int from, to, next; } e[maxn * 2]; int te = 1, n, point[maxn]; void add(int x, int y) { te++; e[te].from = x; e[te].to = y; e[te].next = point[x]; point[x] = te; } int size[maxn]; Big f[maxn][maxn]; void dfs(int p, int fa) { size[p] = 1; for (int i = 0; i <= n; i++) f[p][i].fuzhi(1); for (int i = point[p]; i; i = e[i].next) { int to = e[i].to; if (to == fa) continue; dfs(to, p); for (int j = size[p]; j >= 0; j--) for (int k = size[to]; k >= 0; k--) f[p][j + k] = max(f[p][j + k], f[p][j] * f[to][k]); size[p] += size[to]; } for (int i = 1; i <= size[p]; i++) f[p][0] = max(f[p][0], f[p][i] * tran(i)); } void ceshi() { Big a, b; int x, y; cin >> x >> y; a.fuzhi(x); b.fuzhi(y); a.out(); b.out(); a = a * b; a.out(); exit(0); } int main() { std::ios::sync_with_stdio(false); cin >> n; for (int i = 1; i < n; i++) { int x, y; cin >> x >> y; add(x, y); add(y, x); } dfs(1, 0); f[1][0].out(); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 105; template <typename T> inline void read(T &AKNOI) { T x = 0, flag = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) flag = -1; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + ch - 0 ; ch = getchar(); } AKNOI = flag * x; } template <typename T> inline void cmax(T &x, T y) { if (x < y) x = y; } int n, m, lb[N][N], rb[N][N], dp[N][N]; void init() { read(n); read(m); for (int i = 1; i <= n; ++i) { int k; read(k); while (k--) { int l, r; read(l); read(r); for (int j = l; j <= r; ++j) { lb[i][j] = l; rb[i][j] = r; } } } } void solve() { for (int l = 1; l <= m; ++l) { for (int i = 1, j = i + l - 1; j <= m; ++i, ++j) { for (int k = i; k <= j; ++k) { int cnt = 0; for (int p = 1; p <= n; ++p) { cnt += (i <= lb[p][k] && rb[p][k] <= j); } cmax(dp[i][j], dp[i][k - 1] + cnt * cnt + dp[k + 1][j]); } } } printf( %d n , dp[1][m]); } int main() { init(); solve(); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = (int)1e5 + 123; const long long INF = (long long)1e18 + 123; const int inf = (int)1e9 + 123; const int MOD = (int)1e9 + 7; int n; int main() { cin >> n; if (n % 2 == 0) { cout << white n ; cout << 1 2 ; } else cout << black ; return 0; }
#include <bits/stdc++.h> using namespace std; int n, a[300000 + 10], ans = 2e9; vector<int> lj[300000 + 10]; multiset<int> s; int main() { int i; scanf( %d , &n); for (i = 1; i <= n; ++i) scanf( %d , &a[i]), s.insert(a[i]); for (i = 1; i < n; ++i) { int u, v; scanf( %d%d , &u, &v); lj[u].push_back(v); lj[v].push_back(u); } for (i = 1; i <= n; ++i) { int da = a[i]; s.erase(s.find(a[i])); for (int j : lj[i]) da = max(da, a[j] + 1), s.erase(s.find(a[j])); if (!s.empty()) da = max(da, *s.rbegin() + 2); s.insert(a[i]); for (int j : lj[i]) s.insert(a[j]); ans = min(da, ans); } printf( %d , ans); }
#include <bits/stdc++.h> using namespace std; int main() { long long int n; cin >> n; cout << (n - 2) * (n - 2); return 0; }
#include <bits/stdc++.h> using namespace std; int n; int main() { cin >> n; for (int i = 1; n; i++) { if (i & 1) printf( %d 2 n , i), n--; else if (n == 1) printf( %d 1 n , i), n = 0; else printf( %d 1 n%d 3 n , i, i), n -= 2; } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 2e4 + 42; int n, m, k; int d[55][maxn], dp[55][maxn], s[55][maxn]; int val[maxn << 2], tag[maxn << 2]; int g; void build(int day, int l, int r, int rt) { if (l == r) { val[rt] = dp[day][l] + s[day + 1][l + k - 1] - s[day + 1][l - 1]; return; } int mid = l + r >> 1; build(day, l, mid, rt << 1); build(day, mid + 1, r, rt << 1 | 1); val[rt] = max(val[rt << 1], val[rt << 1 | 1]); } void pushd(int rt) { if (!tag[rt]) return; val[rt << 1] += tag[rt]; val[rt << 1 | 1] += tag[rt]; tag[rt << 1] += tag[rt]; tag[rt << 1 | 1] += tag[rt]; tag[rt] = 0; } void upd(int a, int b, int l, int r, int rt, int v) { if (a <= l && r <= b) { val[rt] += v, tag[rt] += v; return; } pushd(rt); int mid = l + r >> 1; if (a <= mid) upd(a, b, l, mid, rt << 1, v); if (b > mid) upd(a, b, mid + 1, r, rt << 1 | 1, v); val[rt] = max(val[rt << 1], val[rt << 1 | 1]); } void upd(int day, int pos) { if (pos) upd(max(1, pos - k + 1), min(g, pos), 1, g, 1, -d[day][pos]); } void del(int day, int pos) { if (pos) upd(max(1, pos - k + 1), min(g, pos), 1, g, 1, d[day][pos]); } signed main() { ios ::sync_with_stdio(false); cin.tie(nullptr), cout.tie(nullptr); cin >> n >> m >> k; g = m - k + 1; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { cin >> d[i][j]; s[i][j] = s[i][j - 1] + d[i][j]; } for (int i = 1; i <= n; i++) { if (i > 1) { for (int j = 1; j < k; j++) upd(i, j); } for (int j = 1; j + k - 1 <= m; j++) { int l = j, r = j + k - 1; if (i == 1) dp[1][j] = s[1][r] - s[1][l - 1]; else { del(i, l - 1); upd(i, r); dp[i][j] = s[i][r] - s[i][l - 1] + val[1]; } } memset(val, 0, sizeof(val)); memset(tag, 0, sizeof(tag)); if (i < n) build(i, 1, g, 1); } int ans = 0; for (int i = 1; i <= g; i++) ans = max(ans, dp[n][i]); cout << ans << n ; return 0; }
#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> inline void mine(T1 &x, T2 y) { if (x > y) x = y; } template <typename T1, typename T2> inline void maxe(T1 &x, T2 y) { if (x < y) x = y; } ostream &operator<<(ostream &a, const vector<long long> &b) { for (auto k : b) cout << k << ; return a; } const long long MOD = 1000000007; const long long INF = 1000000050; const long long BIG = (long long)2e18 + 50; const long long MX = 2001; const long double EPS = 1e-6; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); bool lt(long double x, long double y) { return x + EPS < y; } bool eq(long double x, long double y) { return abs(x - y) < EPS; } struct pt { long double x; long double y; long double z; pt(long double a, long double b, long double c) { x = a; y = b; z = c; } bool operator<(const pt &p) const { return lt(x, p.x) || (eq(x, p.x) && (lt(y, p.y) || (eq(y, p.y) && lt(z, p.z)))); } bool operator==(const pt &p) const { return eq(x, p.x) && eq(y, p.y) && eq(z, p.z); } }; long double vx[MX], vy[MX], x[MX], y[MX]; bool can[MX][MX]; long double tt[MX][MX]; bool cmp(pair<long double, long double> a, pair<long double, long double> b) { return a.second < b.second; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n; cin >> n; for (long long i = 0; i < n; i++) { long double t1, x1, y1, t2, x2, y2; cin >> t1 >> x1 >> y1 >> t2 >> x2 >> y2; vy[i] = (y2 - y1) / (t2 - t1); vx[i] = (x2 - x1) / (t2 - t1); x[i] = x1 - vx[i] * t1; y[i] = y1 - vy[i] * t1; } for (long long i = 0; i < n; i++) { for (long long j = i + 1; j < n; j++) { long double tim = 0; if (!eq(vx[i], vx[j])) tim = (x[i] - x[j]) / (vx[j] - vx[i]); if (!eq(vy[i], vy[j])) tim = (y[i] - y[j]) / (vy[j] - vy[i]); long double xx = x[i] + vx[i] * tim; long double yy = y[i] + vy[i] * tim; if (eq(xx, x[j] + vx[j] * tim) && eq(yy, y[j] + vy[j] * tim)) { can[i][j] = can[j][i] = true; tt[i][j] = tt[j][i] = tim; } } } long long ans = 1; for (long long i = 0; i < n; i++) { vector<pair<long double, long double>> kek; vector<long double> colis; for (long long j = 0; j < n; j++) { if (!can[i][j]) continue; colis.push_back(tt[i][j]); long double xx = vx[j] - vx[i]; long double yy = vy[j] - vy[i]; long double ang = atan2(yy, xx); if (ang < -EPS) ang += 4 * atan(1); kek.push_back({ang, sin(ang) * yy + cos(ang) * xx}); } sort(colis.begin(), colis.end()); long long it = 0; while (it < (long long)colis.size()) { long long it2 = it + 1; while (it2 < (long long)colis.size() && eq(colis[it2], colis[it])) ++it2; maxe(ans, it2 - it + 1); it = it2; } sort(kek.begin(), kek.end()); long long her = 0; it = 0; while (it < (long long)kek.size()) { long long it2 = it + 1; while (it2 < (long long)kek.size() && kek[it2].first - kek[it].first < EPS) ++it2; sort(kek.begin() + it, kek.begin() + it2, cmp); long long dif = 1; for (long long k = it + 1; k < it2; k++) dif += !eq(kek[k].second, kek[k - 1].second); maxe(her, dif + 1); it = it2; } maxe(ans, her); } cout << ans << n ; }
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; long long cnt = 0; for (long long i = 0; i < s.length(); i++) { if ((s[i] - 0 ) % 2 == 0) cnt++; } if (cnt == 0) cout << -1 << endl; else { vector<char> v; for (long long i = 0; i < s.length(); i++) v.push_back(s[i]); char c = s[s.length() - 1]; for (long long i = 0; i < s.length(); i++) { if ((s[i] - 0 ) % 2 == 0) { cnt--; if (s[i] < c || cnt == 0) { v[i] = c; v[s.length() - 1] = s[i]; break; } } } cout << string(v.begin(), v.end()) << endl; } }
#include <bits/stdc++.h> using namespace std::chrono; using namespace std; const long long int mod = 998244353; const int inf = 1e9 + 7; long long int f(long long int x, long long int n) { long long int r = 1; while (n > 0) { if (n % 2 == 1) r = (r * x) % mod; x = (x * x) % mod; n /= 2; } return r; } long long int fac[400010], invf[400010]; void buildfactorial() { fac[0] = 1; fac[1] = 1; for (int i = 2; i < 400010; i++) fac[i] = ((long long int)i * fac[i - 1]) % mod; for (int i = 0; i < 400010; ++i) { invf[i] = f(fac[i], mod - 2); } } long long int C(int n, int r) { if (n < r) return 0; return (((fac[n] * invf[r]) % mod) * invf[n - r]) % mod; } long double dist(long double x1, long double y1, long double x2, long double y2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); } struct node { int v, d, p; }; void solve() { int n; cin >> n; string s[n]; for (int i = 0; i < n; ++i) cin >> s[i]; for (int i = n - 2; i >= 0; --i) { string t = ; for (int j = 0; j < min(s[i].length(), s[i + 1].length()); ++j) { if (s[i][j] > s[i + 1][j]) break; else if (s[i][j] < s[i + 1][j]) { t = s[i]; break; } t += s[i][j]; } s[i] = t; } for (int i = 0; i < n; ++i) cout << s[i] << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t; t = 1; while (t--) solve(); }
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); int main() { int s1, s2, s3, s4; int a[4]; cin >> a[0] >> a[1] >> a[2] >> a[3]; int i, j, k = 0; sort(a, a + 4); j = a[0]; for (i = 1; i < 4; ++i) { if (j == a[i]) { k++; } else j = a[i]; } cout << k; return 0; }
#include <bits/stdc++.h> using namespace std; const int INF = 1e8; const int MN = 2e+7; int n, m, nn, mm; int i, j, k, x, y, z, p, u, v; int d[2000], tt; char ss[2000][2000]; void change() { int n = nn, m = mm; if (x == 1) { int tmp = u; u = v; v = n - tmp + 1; swap(n, m); } if (x == 2) { u = n - u + 1; v = m - v + 1; } if (x == 3) { int tmp = v; v = u; u = m - tmp + 1; swap(n, m); } if (y == 1) { v = m - v + 1; } if (z == 3) { int tmp = u; u = v; v = n - tmp + 1; } if (z == 2) { u = n - u + 1; v = m - v + 1; } if (z == 1) { int tmp = v; v = u; u = m - tmp + 1; } } int main() { scanf( %d%d%d%d%d%d , &n, &m, &x, &y, &z, &p); nn = n; mm = m; x = x % 4; y = y % 2; z = z % 4; for (i = 1; i <= p; i++) { scanf( %d%d , &u, &v); change(); printf( %d %d n , u, v); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long int a, b, c, i, j, k = 10000000000000000, l, n, m; cin >> n; b = c = a = 1000000; vector<long long int> v1; vector<string> v2; vector<long long int> v3; vector<string> v4; for (i = 0; i < n; i++) { string s; cin >> m >> s; if (s == A ) { a = min(a, m); } if (s == B ) { b = min(b, m); } if (s == C ) { c = min(c, m); } if (s.size() == 2) { v1.push_back(m); v2.push_back(s); } if (s.size() == 3) { set<char> s50; s50.insert(s[0]); s50.insert(s[1]); s50.insert(s[2]); if (s50.size() == 3) k = min(k, m); v3.push_back(m); v4.push_back(s); } } if (a != 1000000 && b != 1000000 && c != 1000000) { k = min(k, a + b + c); } for (i = 0; i < v1.size(); i++) { string ss; ss = v2[i]; if ((ss[0] == A && ss[1] == B && c != 1000000) || (ss[0] == B && ss[1] == A && c != 1000000)) { k = min(k, v1[i] + c); } if ((ss[0] == C && ss[1] == B && a != 1000000) || (ss[0] == B && ss[1] == C && a != 1000000)) { k = min(k, v1[i] + a); } if ((ss[0] == A && ss[1] == C && b != 1000000) || (ss[0] == C && ss[1] == A && b != 1000000)) { k = min(k, v1[i] + b); } } if (v1.size() > 1) { for (i = 0; i < v1.size(); i++) { for (j = 0; j < v1.size(); j++) { string ss, s1; ss = v2[i]; s1 = v2[j]; if ((ss[0] == A && ss[1] == B ) || (ss[0] == B && ss[1] == A )) { if (s1[0] == C || s1[1] == C ) k = min(k, v1[i] + v1[j]); } if ((ss[0] == C && ss[1] == B ) || (ss[0] == B && ss[1] == C )) { if (s1[0] == A || s1[1] == A ) k = min(k, v1[i] + v1[j]); } if ((ss[0] == A && ss[1] == C ) || (ss[0] == C && ss[1] == A )) { if (s1[0] == B || s1[1] == B ) k = min(k, v1[i] + v1[j]); } } } } for (i = 0; i < v3.size(); i++) { string ss, s1; ss = v4[i]; if ((ss[0] != A && ss[1] != A && ss[2] != A ) && a != 1000000) { k = min(k, v3[i] + a); } if ((ss[0] != B && ss[1] != B && ss[2] != B ) && b != 1000000) { k = min(k, v3[i] + b); } if ((ss[0] != C && ss[1] != C && ss[2] != C ) && c != 1000000) { k = min(k, v3[i] + c); } } if (v3.size() > 1) { for (i = 0; i < v3.size(); i++) { for (j = 0; j < v3.size(); j++) { string ss, s1; ss = v4[i]; s1 = v4[j]; set<char> e; set<char> w; e.insert(ss[0]); e.insert(ss[1]); e.insert(ss[2]); w.insert(s1[0]); w.insert(s1[1]); w.insert(s1[2]); if (e.size() != 3 && w.size() != 3) { if ((ss[0] != A && ss[1] != A && ss[2] != A )) { if (s1[0] == A || s1[1] == A || ss[2] == A ) k = min(k, v3[i] + v3[j]); } if ((ss[0] != B && ss[1] != B && ss[2] != B )) { if (s1[0] == B || s1[1] == B || ss[2] == B ) k = min(k, v3[i] + v3[j]); } if ((ss[0] != C && ss[1] != C && ss[2] != C )) { if (s1[0] == C || s1[1] == C || ss[2] == C ) k = min(k, v3[i] + v3[j]); } } } } } for (i = 0, j = 0; i < v3.size() && j < v2.size(); j++, i++) { string ss, s1; ss = v4[i]; s1 = v2[j]; set<char> e; set<char> w; e.insert(ss[0]); e.insert(ss[1]); e.insert(ss[2]); if (e.size() != 3) { if ((ss[0] != A && ss[1] != A && ss[2] != A )) { if (s1[0] == A || s1[1] == A ) k = min(k, v3[i] + v1[j]); } if ((ss[0] != B && ss[1] != B && ss[2] != B )) { if (s1[0] == B || s1[1] == B ) k = min(k, v3[i] + v1[j]); } if ((ss[0] != C && ss[1] != C && ss[2] != C )) { if (s1[0] == C || s1[1] == C ) k = min(k, v3[i] + v1[j]); } } } if (k != 10000000000000000) cout << k << endl; else cout << -1 << endl; }
#include <bits/stdc++.h> using namespace std; vector<long long> z; const long long N = 5e3 + 7, M1 = 1e9 + 7, M2 = 1e9 + 9, b1 = 127, b2 = 239; long long maxi1[N], maxi2[N], maxx[N]; pair<long long, long long> h1[N], h2[N]; pair<long long, long long> poww[N]; string best; long long mod(long long x, long long m) { x %= m; if (x < 0) x += m; return x; } pair<long long, long long> get_h(long long l, long long r) { long long res1 = mod(h1[r].first - h1[l - 1].first * poww[r - l + 1].first, M1); long long res2 = mod(h1[r].second - h1[l - 1].second * poww[r - l + 1].second, M2); return {res1, res2}; } pair<long long, long long> get_h2(long long l, long long r) { long long res1 = mod(h2[r].first - h2[l - 1].first * poww[r - l + 1].first, M1); long long res2 = mod(h2[r].second - h2[l - 1].second * poww[r - l + 1].second, M2); return {res1, res2}; } void solve(string s) { long long n = s.length(); string t = s; long long ser = (n + 1) / 2; long long len = 0; while (len != n && s[len] == s[n - len - 1]) { len++; } if (len == n) { best = s; return; } if (2 * len > (long long)best.size()) { best = ; for (long long i = 0; i < len; i++) best += s[i]; for (long long i = len - 1; i >= 0; i--) best += s[i]; } for (long long i = 0; i < ser; i++) { maxi1[i] = -1; long long l = i, r = i; while (l >= 0 && r < n && s[l] == s[r]) { l--; r++; maxi1[i] += 2; if (l < len) { long long curlen = maxi1[i] + 2 * (l + 1); if (curlen > (long long)best.size()) { best = ; for (long long j = 0; j < r; j++) { best += s[j]; } for (long long j = l; j >= 0; j--) { best += s[j]; } } } } } if (n % 2 == 1) ser--; for (long long i = 0; i < ser; i++) { maxi2[i] = 0; long long l = i, r = i + 1; while (l >= 0 && r < n && s[l] == s[r]) { l--; r++; maxi2[i] += 2; if (l < len) { long long curlen = maxi2[i] + 2 * (l + 1); if (curlen > (long long)best.size()) { best = ; for (long long j = 0; j < r; j++) { best += s[j]; } for (long long j = l; j >= 0; j--) { best += s[j]; } } } } } } signed main() { ios_base ::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t; cin >> t; for (long long i = 0; i < t; i++) { string s; cin >> s; best = s[0]; solve(s); reverse(s.begin(), s.end()); solve(s); cout << best << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; template <class T> void chkmax(T& x, T y) { x = x > y ? x : y; } template <class T> void chkmin(T& x, T y) { x = x < y ? x : y; } int n, m; vector<string> s; int calc(int mask, int j) { int res = 0; for (int i = 0; i < n; ++i) if ((mask >> i & 1) != (s[i][j] - 0 )) ++res; return res; } bool check(int a, int b) { for (int i = 0; i < n - 1; ++i) if (((a >> i & 1) + (a >> i + 1 & 1) + (b >> i & 1) + (b >> i + 1 & 1)) % 2 == 0) return 0; return 1; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cin >> n >> m; if (n >= 4) { cout << -1 << n ; return 0; } s.resize(n); for (int i = 0; i < n; ++i) cin >> s[i]; vector<vector<int>> dp(m, vector<int>(1 << n, 1e9)); for (int mask = 0; mask < 1 << n; ++mask) dp[0][mask] = calc(mask, 0); for (int i = 0; i < m - 1; ++i) for (int c_mask = 0; c_mask < 1 << n; ++c_mask) for (int n_mask = 0; n_mask < 1 << n; ++n_mask) if (check(c_mask, n_mask)) chkmin(dp[i + 1][n_mask], dp[i][c_mask] + calc(n_mask, i + 1)); int ans = 1e9; for (int mask = 0; mask < 1 << n; ++mask) chkmin(ans, dp[m - 1][mask]); cout << ans << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const int inf = 987654321; const long long int INF = 123456789987654321; int N; vector<int> arr, chk, chk2; bool f(int l, int r) { for (int i = 0; i < min(l, N - r - 1); i++) { if (arr[i] != arr[N - i - 1]) return false; } chk = vector<int>(N, 0); for (int i = min(l, N - r - 1); i <= max(r, N - l - 1); i++) { chk[arr[i]]++; } chk2 = vector<int>(N, 0); int len = max(r, N - l - 1) - min(l, N - r - 1) + 1; if (len < 2 * (r - l + 1)) { for (int i = min(l, N - r - 1); i <= max(r, N - l - 1); i++) { if (i < l || r < i) { chk2[arr[i]]++; if (chk2[arr[i]] > chk[arr[i]] / 2) return false; } } } else { for (int i = min(l, N - r - 1); i < min(l, N - r - 1) + (r - l + 1); i++) { chk2[arr[i]]++; } for (int i = min(l, N - r - 1); i < min(l, N - r - 1) + (r - l + 1); i++) { chk2[arr[N - 1 - i]]--; } for (int i = 0; i < N; i++) { if (chk2[i]) return false; } for (int i = min(l, N - r - 1) + (r - l + 1); i <= max(r, N - l - 1) - (r - l + 1); i++) { if (arr[i] != arr[N - 1 - i]) return false; } } return true; } long long int ans = 0; int main() { scanf( %d , &N); arr.resize(N); chk = vector<int>(N, 0); for (int i = 0; i < N; i++) { scanf( %d , &arr[i]); chk[--arr[i]]++; } if (N == 1) { printf( 1 ); return 0; } int oddcnt = 0; for (int i = 0; i < N; i++) { if (chk[i] % 2) oddcnt++; } if (oddcnt > 1) { printf( 0 ); return 0; } int s = 0, e = N - 1; int idx; while (s <= e) { int m = (s + e) >> 1; if (f(0, m)) { idx = m; e = m - 1; } else s = m + 1; } s = 0, e = N - 1; int idx2; while (s <= e) { int m = (s + e) >> 1; if (f(m, N - 1)) { idx2 = m; s = m + 1; } else e = m - 1; } int len = 0; for (int i = 0; i < N / 2; i++) { if (arr[i] != arr[N - 1 - i]) break; len++; } if (len == N / 2) { printf( %I64d , (long long int)N * (N + 1) / 2); return 0; } long long int ans = len * len; if (idx < N - len) ans += (len + 1) * (N - len - idx); if (len <= idx2) ans += (len + 1) * (idx2 - len + 1); if (idx < N - len && len <= idx2) ans--; printf( %I64d , ans); }
#include <bits/stdc++.h> using namespace std; char s[200010]; int g[200010][30]; int main() { int i, j, k; int n, t, m; cin >> t; while (t--) { cin >> n >> m; cin >> s + 1; int ans[30] = {0}; for (i = 1; i <= n; i++) { for (j = 0; j < 26; j++) { g[i][j] = g[i - 1][j]; } g[i][s[i] - a ]++; } for (i = 1; i <= m; i++) { int x; cin >> x; for (j = 0; j < 26; j++) { ans[j] += g[x][j]; } } for (i = 0; i < 26; i++) ans[i] += g[n][i]; for (i = 0; i < 26; i++) { if (i) printf( ); printf( %d , ans[i]); } puts( ); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int arr; int a = 0, b = 0, i, j, k; for (i = 0; i < n; i++) { cin >> arr; if (arr >= 0) { a += arr; } else { b += arr; } } cout << a - b << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int n, d; long long x; int a[100005], b[100005]; int a_index[100005], q[100005]; long long getNextX() { x = (x * 37 + 10007) % 1000000007; return x; } void initAB() { for (int i = 0; i < n; i = i + 1) { a[i] = i + 1; } for (int i = 0; i < n; i = i + 1) { swap(a[i], a[getNextX() % (i + 1)]); } for (int i = 0; i < n; i = i + 1) { if (i < d) b[i] = 1; else b[i] = 0; } for (int i = 0; i < n; i = i + 1) { swap(b[i], b[getNextX() % (i + 1)]); } } int main() { cin >> n >> d >> x; initAB(); for (int i = 0; i < n; i++) { a_index[a[i]] = i; } int s = 30; for (int i = 0; i < n; i++) if (b[i]) q[++q[0]] = i; for (int i = 0; i < n; i++) { int j; for (j = n; j >= n - s; j--) if (j > 0 && i >= a_index[j] && b[i - a_index[j]]) { printf( %d n , j); break; } if (j < n - s) { int ma = 0; for (j = 1; j <= q[0] && q[j] <= i; j++) ma = max(ma, a[i - q[j]]); printf( %d n , ma); } } return 0; }
#include <bits/stdc++.h> using namespace std; long long n, t, p[105], ans, x = 1, c; pair<long long, long long> a[105]; int cmp(pair<long long, long long> a, pair<long long, long long> b) { return a.first * a.second < b.first * b.second; } int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i].second >> a[i].first; cin >> t; for (int i = 1; i <= t; i++) cin >> p[i]; for (int i = t; i >= 1; i--) p[i] -= p[i - 1]; sort(a + 1, a + 1 + n); p[t + 1] = 1000000000000000009; for (int i = 1; i <= n; i++) while (a[i].second) { ans += min(a[i].second, p[x]) * x * a[i].first; long long r = min(a[i].second, p[x]); a[i].second -= r; p[x] -= r; if (!p[x]) x++; } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; bool solve() { char s[500]; if (scanf( %s , s) == EOF) return false; int in = 0, out = 0; for (int i = 0; s[i]; ++i) { if (s[i] == + ) { if (out) { out--; in++; } else { in++; } } else { if (in) { in--; out++; } else { out++; } } } printf( %d n , in + out); return true; } int main() { solve(); return 0; }
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; #define mems(p) memset(p,-1,sizeof(p)) #define pb push_back #define eb emplace_back #define nl n #define sz(x) (int)(x).size() #define all(x) x.begin(), x.end() #define allr(x) x.rbegin(), x.rend() using pi = pair<int,int>; using pl = pair<ll,ll>; using vi = vector<int>; using vl = vector<ll>; using vb = vector<bool>; using vd = vector<double>; using vc = vector<char>; using vpi = vector<pi>; using vpl = vector<pl>; using vvi = vector<vector<int>>; using vvl = vector<vector<ll>>; using vvb = vector<vector<bool>>; using vvd = vector<vector<double>>; using vvc = vector<vector<char>>; using vvpi = vector<vector<pi>>; using vvpl = vector<vector<pl>>; using vvvi = vector<vector<vector<int>>>; using vvvl = vector<vector<vector<ll>>>; using vvvb = vector<vector<vector<bool>>>; using vvvd = vector<vector<vector<double>>>; using vvvc = vector<vector<vector<char>>>; using vvvpi = vector<vector<vector<pi>>>; using vvvpl = vector<vector<vector<pl>>>; const int mxN = 8e5 + 100; const ll MOD = 1e9 + 7; void fast() {ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);} ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; } vl factorial; ll expo(ll x, ll exp, ll mod = MOD) { if (exp <= 0) return 1; ll tmp = (x*x) % mod; if (exp%2) { return (expo(tmp, exp/2, mod) * x) % mod; } return (expo(tmp, exp/2, mod)) % mod; } ll choice(ll n, ll r, ll mod = MOD) { if (n < r) return 0; ll numer = factorial[n]; ll denom = (factorial[r] * factorial[n-r]) % mod; return numer * expo(denom, mod - 2, mod) % mod; } ll phi(ll n) { ll result = n; for (ll i = 2; i * i <= n; i++) { if (n % i == 0) { while (n % i == 0) n /= i; result -= result / i; } } if (n > 1) result -= result / n; return result; } ll store[5001][5001]; ll a[5001]; int n; ll dp(int x, int k) { if (k == 0) return 1; if (store[x][k] != -1) return store[x][k]; ll res = 0; if (x > 0) res += dp(x-1,k-1); if (x < n - 1) res += dp(x+1,k-1); if (res >= MOD) res -= MOD; return store[x][k] = res; } int main() { fast(); int k, q; cin >> n >> k >> q; for (int i = 0; i < n; ++i) { cin >> a[i]; } mems(store); ll ans = 0; vl sum(n, 0); for (int i = 0; i < n; ++i) { for (int j = 0; j <= k; ++j) { sum[i] += dp(i,j)*dp(i,k-j); sum[i] %= MOD; } ans += sum[i]*a[i]; ans %= MOD; } //cout << init << ans << nl; int idx; ll x; for (int i = 0; i < q; ++i) { cin >> idx >> x; --idx; ll chng = x - a[idx]; if (chng < 0) chng += MOD; ans += chng*sum[idx]; ans %= MOD; cout << ans << nl; a[idx] = x; } }
#include <bits/stdc++.h> using namespace std; int dp[1010][1010][11][2]; int main() { ios_base::sync_with_stdio(0); int n, m, k; cin >> n >> m >> k; int kk = k; string a, b; cin >> a >> b; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { if (a[i - 1] == b[j - 1]) { for (int k = 1; k <= kk; ++k) { dp[i][j][k][0] = max(dp[i - 1][j - 1][k][0], dp[i - 1][j - 1][k - 1][1]) + 1; } } for (int k = 1; k <= kk; ++k) { dp[i][j][k][1] = max(max(dp[i - 1][j - 1][k][1], dp[i - 1][j][k][1]), max(dp[i][j - 1][k][1], dp[i][j][k][0])); } } } int ans = 0; for (int i = 1; i <= k; ++i) { ans = max(ans, dp[n][m][i][1]); } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int n, m; int a[300], ans[500][2], tot, v[300]; void sl(int p, int x) { if (p == x || x == 0) return; if (a[x] == 0 || a[x] == x) { ans[tot][0] = p, ans[tot][1] = x; a[x] = x; a[p] = 0; tot++; return; } if (v[x]) { ans[tot][0] = p, ans[tot][1] = n; a[p] = 0; a[n] = x; tot++; return; } v[p] = 1; sl(x, a[x]); ans[tot][0] = p, ans[tot][1] = x; a[x] = x; a[p] = 0; tot++; v[p] = 0; } int main() { scanf( %d%d , &n, &m); int p = 0, t, sum = 0; for (int i = 0; i < m; i++) { scanf( %d , &t); sum += t; while (t--) { int x; scanf( %d , &x); a[x] = ++p; } } for (int i = n; i > 0; i--) { sl(i, a[i]); sl(n, a[n]); } printf( %d n , tot); for (int i = 0; i < tot; i++) { printf( %d %d n , ans[i][0], ans[i][1]); } }
#include <bits/stdc++.h> #pragma comment(linker, /STACK:102400000,102400000 ) using namespace std; const double eps = 1e-6; const double pi = acos(-1.0); template <class Z> inline Z SQ(Z &a) { return a * a; } template <class Z> inline bool checkmax(Z &a, Z b) { if (a == -1 || a < b) { a = b; return true; } return false; } template <class Z> inline bool checkmin(Z &a, Z b) { if (a == -1 || a > b) { a = b; return true; } return false; } template <class Z> inline bool mymax(Z &a, Z b) { if (a < b) { a = b; return true; } return false; } template <class Z> inline bool mymin(Z &a, Z b) { if (a > b) { a = b; return true; } return false; } int a[100005]; int n, m; struct SegTree { long long tree[100005 << 2]; inline void PushUp(int rt) { tree[rt] = tree[(rt << 1)] + tree[(rt << 1 | 1)]; } void build(int s, int z, int l, int r, int rt) { if (l == r) { long long v = a[l]; int tt = (l + s) % (2 * z - 2); if (tt == 0) tree[rt] = v * 2; else if (tt <= z) tree[rt] = v * tt; else tree[rt] = v * (2 * z - tt); return; } int m = (l + r) >> 1; build(s, z, l, m, rt << 1); build(s, z, m + 1, r, rt << 1 | 1); PushUp(rt); } void update(int s, int z, long long val, int x, int l, int r, int rt) { if (l == r) { int tt = (x + s) % (2 * z - 2); if (tt == 0) tree[rt] = val * 2; else if (tt <= z) tree[rt] = val * tt; else tree[rt] = val * (2 * z - tt); return; } int m = (l + r) >> 1; if (x <= m) update(s, z, val, x, l, m, rt << 1); else update(s, z, val, x, m + 1, r, rt << 1 | 1); PushUp(rt); } long long query(int ll, int rr, int l, int r, int rt) { if (ll <= l && r <= rr) { return tree[rt]; } long long sum = 0; int m = (l + r) >> 1; if (ll <= m) sum += query(ll, rr, l, m, rt << 1); if (rr > m) sum += query(ll, rr, m + 1, r, rt << 1 | 1); return sum; } } tree[4][8], t6[10]; void input() { for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); } } void build() { for (int z = 2; z <= 5; z++) { for (int i = 0; i < 2 * z - 2; i++) { tree[z - 2][i].build(i, z, 1, n, 1); } } for (int i = 0; i < 10; i++) { t6[i].build(i, 6, 1, n, 1); } } void gao() { scanf( %d , &m); while (m--) { int op; scanf( %d , &op); if (op == 1) { int p, v; scanf( %d%d , &p, &v); for (int z = 2; z <= 5; z++) { for (int i = 0; i < 2 * z - 2; i++) { tree[z - 2][i].update(i, z, v, p, 1, n, 1); } } for (int i = 0; i < 10; i++) { t6[i].update(i, 6, v, p, 1, n, 1); } } else { int l, r, z; scanf( %d%d%d , &l, &r, &z); int tp = l % (2 * z - 2); if (tp == 0) tp = 2 * z - 2; int s = (2 * z - 2) - tp + 1; s %= (2 * z - 2); if (z == 6) printf( %I64d n , t6[s].query(l, r, 1, n, 1)); else printf( %I64d n , tree[z - 2][s].query(l, r, 1, n, 1)); } } } int main() { while (~scanf( %d , &n)) { input(); build(); gao(); } }
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 5; const int MOD = 1e9 + 7; void solve() { int n, m; cin >> n >> m; cout << (n % m ? NO n : YES n ); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; int t = 1; cin >> t; while (t--) solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { string s; int n, m, f = 0; cin >> n >> m; cin >> s; for (int i = 0; i < n; i++) { if (s[i] == # ) f++; else f = 0; if (f >= m) { cout << NO ; return 0; } } cout << YES ; return 0; }
#include <bits/stdc++.h> using namespace std; void solve(); void YN(bool b) { if (b) { cout << YES << n ; ; } else { cout << NO << n ; ; } }; void yn(bool b) { if (b) { cout << Yes << n ; ; } else { cout << No << n ; ; } }; void queries() { int n; cin >> n; while (n--) solve(); } const int maxn = 200200; void solve() { int n; cin >> n; vector<int> a(n); vector<int> b; map<int, int> m; for (int i = 0; i < n; i++) { cin >> a[i]; m[a[i]]++; } for (auto i : m) { b.push_back(i.second); } map<int, bool> taken; long long sum = 0; sort(b.begin(), b.end()); for (int i = b.size() - 1; i >= 0; i--) { if (!taken[b[i]]) { sum += b[i]; taken[b[i]] = 1; } else { for (int j = b[i]; j > 0; j--) { if (!taken[j]) { sum += j; taken[j] = 1; break; } } } } cout << sum << n ; ; return; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); queries(); ; return 0; }
#include <bits/stdc++.h> using namespace std; int i, j, k, n, m, a[110001], ans; bool cmp(int a, int b) { return a > b; } int main() { scanf( %d%d , &n, &m); for (i = 1; i <= m; i++) scanf( %d%d , &j, &a[i]); sort(a + 1, a + 1 + m, cmp); for (i = 1;; i++) { if (i == 1) k = 1; else if (i == 2) k = 2; else { k = min((i - 2) * (i / 2) + 2 * (1 + (i - 1) / 2), (i - 1) * (i / 2) + (2 + (i - 2) / 2)); } if (k > n) break; } k = i - 1; for (ans = 0, i = 1; i <= k; i++) ans += a[i]; printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, q; string a; cin >> n; map<string, int> m; map<string, string> ma; for (int i = 1; i <= n; i++) { cin >> a; int len = a.length(); for (int i = 0; i <= len; i++) { for (int j = 0; j + i <= len; j++) { string s1 = a.substr(i, j); if (ma[s1] != a) { m[s1]++; ma[s1] = a; } } } } cin >> q; for (int i = 1; i <= q; i++) { cin >> a; if (m[a] != 0) { cout << m[a] << << ma[a] << endl; } else printf( 0 - n ); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); n = (int)((double)n / 3 + 0.5); cout << n / 12 << << n % 12 << n ; }
#include <bits/stdc++.h> using namespace std; struct LinearBase { const int n = 30; vector<int> pivot = vector<int>(n); void Insert(int curr) { for (int bit = n - 1; bit >= 0 && curr != 0; --bit) { if ((curr & (1 << bit)) != 0) { curr ^= pivot[bit]; } } if (curr == 0) return; int msb = 31 - __builtin_clz(curr); assert(pivot[msb] == 0); pivot[msb] = curr; for (int bit = n - 1; bit > msb; --bit) { if ((pivot[bit] & (1 << bit)) != 0) { pivot[bit] ^= curr; } } } int Query(int ans) { for (int bit = n - 1; bit >= 0; --bit) { if ((ans & (1 << bit)) != 0) { ans ^= pivot[bit]; } } return ans; } }; struct Graph { int n; LinearBase base; vector<int> dist; vector<vector<pair<int, int>>> adj; Graph(int n_) : n(n_), dist(n, -1), adj(n) {} void AddEdge(int a, int b, int w) { adj[a].emplace_back(b, w); adj[b].emplace_back(a, w); } void DFS(int node) { for (auto &e : adj[node]) { int x, w; tie(x, w) = e; if (dist[x] == -1) { dist[x] = dist[node] ^ w; DFS(x); } else { base.Insert(dist[node] ^ dist[x] ^ w); } } } int Solve() { dist[0] = 0; DFS(0); return base.Query(dist[n - 1]); } }; int main() { ios::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; Graph g(n); for (int i = 0; i < m; ++i) { int a, b, w; cin >> a >> b >> w; g.AddEdge(a - 1, b - 1, w); } cout << g.Solve() << endl; }
#include <bits/stdc++.h> using namespace std; long long n, dp[30][30]; string s; long long ten[30]; string ans[30][30]; int main() { cin >> n >> s; reverse(s.begin(), s.end()); ten[0] = 1; for (int i = 1; i <= 20; i++) ten[i] = ten[i - 1] * 10; dp[0][0] = 0; dp[1][0] = s[0] - 0 ; ans[1][0] = M ; dp[0][1] = s[0] - 0 ; ans[0][1] = H ; for (int i = 2; i <= n; i++) { long long q = (int)s[i - 1] - 0 ; dp[i][0] = dp[i - 1][0] + q * ten[i - 1]; ans[i][0] = ans[i - 1][0]; ans[i][0] += M ; dp[0][i] = dp[0][i - 1] + q * ten[i - 1]; ans[0][i] = ans[0][i - 1]; ans[0][i] += H ; } for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) { long long q = (int)s[i + j - 1] - 0 ; long long m = dp[i - 1][j] + q * ten[i - 1]; long long h = dp[i][j - 1] + q * ten[j - 1]; if (m <= h) { dp[i][j] = h; ans[i][j] = ans[i][j - 1]; ans[i][j] += H ; } else { dp[i][j] = m; ans[i][j] = ans[i - 1][j]; ans[i][j] += M ; } } s = ans[n][n]; reverse(s.begin(), s.end()); cout << s << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 7; const int maxm = 1e9 + 7; int n; int a[maxn], b[maxn], c[maxn], ans[maxn]; map<int, int> mp; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); b[i] = a[i]; } queue<int> q; q.push(n); mp[a[n]] = n; for (int i = n; i >= 1; i--) { if (a[i] < a[q.back()]) { q.push(i); mp[a[q.back()]] = i; } } sort(b + 1, b + 1 + n); int num = unique(b + 1, b + n + 1) - b; int p = 0; for (int i = 1; i <= num - 1; i++) { int j = b[i]; if (!mp[j]) mp[j] = p; else { swap(mp[j], p); } } for (int i = 1; i <= n; i++) { if (i >= mp[a[i]]) printf( -1 ); else printf( %d , mp[a[i]] - i - 1); } }
#include <bits/stdc++.h> using namespace std; int main() { cin.sync_with_stdio(false); cin.tie(0); long int n; cin >> n; const long int N = n; char s[N]; int cnt0 = 0, cnt1 = 0; for (int i = 0; i < n; i++) { cin >> s[i]; if (s[i] == z ) { cnt0++; } if (s[i] == n ) { cnt1++; } } for (int i = 0; i < cnt1; i++) cout << 1 ; for (int i = 0; i < cnt0; i++) cout << 0 ; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 10005, M = 105; int n; char s[N]; int p, m; int lim; int dp[2][N][M]; int ch[N][2], tot = 1; int fa[N]; void dfs(int u) { if (!ch[u][0]) return; dfs(ch[u][0]); dfs(ch[u][1]); for (int i = 0; i <= lim; i++) for (int j = 0; i + j <= lim; j++) { dp[0][u][i + j + (p < m)] = max(dp[0][u][i + j + (p < m)], dp[0][ch[u][0]][i] + dp[0][ch[u][1]][j]); dp[0][u][i + j + (p >= m)] = max(dp[0][u][i + j + (p >= m)], dp[0][ch[u][0]][i] - dp[1][ch[u][1]][j]); dp[1][u][i + j + (p < m)] = min(dp[1][u][i + j + (p < m)], dp[1][ch[u][0]][i] + dp[1][ch[u][1]][j]); dp[1][u][i + j + (p >= m)] = min(dp[1][u][i + j + (p >= m)], dp[1][ch[u][0]][i] - dp[0][ch[u][1]][j]); } return; } int main() { scanf( %s , s + 1); scanf( %d%d , &p, &m); n = strlen(s + 1); lim = min(p, m); memset(dp[0], -63, sizeof(dp[0])); memset(dp[1], 63, sizeof(dp[1])); tot = 1; int pre = tot; for (int i = 1; i <= n; i++) { if (s[i] == ( || s[i] == ? ) { ch[pre][ch[pre][0] ? 1 : 0] = ++tot; fa[tot] = pre; pre = tot; } else if (s[i] == ) ) pre = fa[pre]; else dp[0][tot][0] = dp[1][tot][0] = s[i] - 0 , pre = fa[pre]; } dfs(1); printf( %d , dp[0][1][lim]); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 2e3 + 3; const int mod = 1e9 + 7; const int inf = 1e9 + 7; bool dp[N][N]; bool ok[N][10]; int cnt[N][10]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); string t[10]; t[0] = 1110111 ; t[1] = 0010010 ; t[2] = 1011101 ; t[3] = 1011011 ; t[4] = 0111010 ; t[5] = 1101011 ; t[6] = 1101111 ; t[7] = 1010010 ; t[8] = 1111111 ; t[9] = 1111011 ; int n, k; cin >> n >> k; string s[n + 4]; for (int i = 1; i <= n; ++i) cin >> s[i]; for (int i = 1; i <= n; ++i) { for (int l = 0; l <= 9; ++l) { ok[i][l] = 1; for (int p = 0; p <= 6; ++p) { if (t[l][p] == 0 && s[i][p] == 1 ) ok[i][l] = 0; if (t[l][p] == 1 && s[i][p] == 0 ) ++cnt[i][l]; } } } dp[n + 1][0] = 1; for (int i = n; i >= 1; --i) { for (int l = 0; l <= 9; ++l) { if (!ok[i][l]) continue; for (int j = cnt[i][l]; j <= k; ++j) dp[i][j] = max(dp[i][j], dp[i + 1][j - cnt[i][l]]); } } if (!dp[1][k]) return cout << -1, 0; string ans = ; for (int i = 1; i <= n; ++i) { for (int l = 9; l >= 0; --l) { if (ok[i][l] && k >= cnt[i][l] && dp[i + 1][k - cnt[i][l]]) { ans += char(l + 0 ); k -= cnt[i][l]; break; } } } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; const int NMAX = 100007; int v[NMAX]; int n; int main() { cin >> n; for (int i = 1; i <= n; ++i) { cin >> v[i]; } sort(v + 1, v + n + 1); for (int i = 3; i <= n; ++i) { if (v[i - 2] + v[i - 1] > v[i]) { cout << YES ; return 0; } } cout << NO ; return 0; }
#include <bits/stdc++.h> using namespace std; int n, m; char s[100005]; vector<int> p, star; void input() { scanf( %s , s); p.clear(), star.clear(); int l = strlen(s); for (int i = 0; i < l; i++) { if (s[i] == P ) p.push_back(i); if (s[i] == * ) star.push_back(i); } n = p.size(), m = star.size(); } bool can(int step) { int now = 0; for (int i = 0; i < n; i++) { if (now == m) return 1; if (p[i] - star[now] > step) return 0; int j = now; while (j < m) { int MIN = min(abs(p[i] - star[now]), abs(p[i] - star[j])); MIN += star[j] - star[now]; if (MIN <= step) j++; else break; } now = j; if (now == m) return 1; } return 0; } int binary(int l, int r) { if (l == r) return l; int m = (l + r) >> 1; if (can(m)) return binary(l, m); return binary(m + 1, r); } int main() { int l; while (cin >> l) { input(); cout << binary(0, 2 * l) << endl; } return 0; }
#include <bits/stdc++.h> #define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0); #define F first #define S second #define V vector #define PB push_back #define MP make_pair #define EB emplace_back #define ALL(v) (v).begin(), (v).end() #define debug(x) cerr << Line( << __LINE__ << ) -> << #x << is << x << endl using namespace std; typedef long long ll; typedef pair<int, int> pi; typedef V<int> vi; const int INF = 1e9 + 7, N = 4e5 + 7; int p[N], cnt[N], vis[N]; vi G[N]; int find(int u) { return p[u] == u ? u : p[u] = find(p[u]); } void unite(int x, int y) { int rx = find(x), ry = find(y); if(rx == ry) return; cnt[ry] += cnt[rx]; p[rx] = ry; } signed main() { IO_OP; int n; cin >> n; V<array<int, 3>> a; for(int i = 1; i <= n; i++) { int x, y; cin >> x >> y; a.PB({x, y, i}); a.PB({y, x, -i}); } sort(ALL(a)); for(int i = 2; i <= 2 * n + 1; i++) p[i] = i; for(int i = 1; i <= n; i++) cnt[i * 2] = 1; set<array<int, 3>> stk; for(int i = 0; i < n * 2; i++) { int u = abs(a[i][2]) * 2, v = u + 1; if(a[i][2] < 0) swap(u, v); int y = a[i][1]; for(auto tt:stk) { if(tt[0] > y) break; unite(tt[1], v); unite(tt[2], u); if(find(u) == find(v)) { cout << -1 << n ; return 0; } } stk.insert({y, u, v}); } for(int i = 1; i <= n; i++) { if(find(i * 2) == find(i * 2 + 1)) { cout << -1 << n ; return 0; } } for(int i = 2; i <= n * 2 + 1; i++) { G[find(i)].PB(i); } int ans = 0; for(int i = 1; i <= n; i++) { if(!vis[i]) { int x = find(i * 2), y = find(i * 2 + 1); ans += min(cnt[x], cnt[y]); for(int u:G[x]) vis[u / 2] = 1; } } cout << ans << n ; }
#include <bits/stdc++.h> using namespace std; vector<int> a; int main() { string s; cin >> s; int cur = 0, mul = 1; for (int i = s.length() - 1; i >= 0; --i) { if (s[i] == , ) { a.push_back(cur); mul = 1; cur = 0; } else { cur += mul * (s[i] - 48); mul *= 10; } } a.push_back(cur); sort(a.begin(), a.end()); int L; int last = a[0]; bool ok = 0; printf( %d , a[0]); L = a[0]; for (int i = 1; i < a.size(); ++i) { if (a[i] == last) continue; if (a[i] == last + 1) { ok = 1; last = a[i]; } else { if (ok && L != last) { printf( -%d , last); L = last; } last = a[i]; printf( ,%d , a[i]); L = a[i]; } } if (ok && L != last) printf( -%d , last); printf( n ); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; string str; cin >> str; set<string> visited; queue<string> s; s.push(str); visited.insert(str); int count = 0, x = 0; while (!s.empty() && count != k) { string temp = s.front(); x = x + temp.length(); count++; s.pop(); for (int i = 0; i < temp.length(); i++) { string temp2 = ; for (int j = 0; j < temp.length(); j++) { if (j != i) temp2 += temp[j]; } if (visited.find(temp2) == visited.end()) { s.push(temp2); visited.insert(temp2); } } } if (s.empty() && count < k) cout << -1 ; else cout << n * k - x; return 0; }
#include <bits/stdc++.h> using namespace std; long long n, m; int main() { cin >> n >> m; if (n > m) { swap(n, m); } if (n % 2 == 0 && m % 2 == 0) { if (n == 2 && m == 2) cout << 0 << endl; else cout << n * m << endl; return 0; } if (n + m <= 4) { cout << 0 << endl; return 0; } if (n == 1) { if (m % 6 == 1 || m % 6 == 5) { cout << m - 1 << endl; } else if (m % 6 == 2 || m % 6 == 4) { cout << m - 2 << endl; } else if (m % 6 == 3) { cout << m - 3 << endl; } else { cout << m << endl; } return 0; } if (n % 2 == 1 && m % 2 == 0) { swap(n, m); } if (n % 2 == 0) { if (m == 3) { if (n >= 4) cout << m * n << endl; else cout << 4 << endl; return 0; } if (n == 2) { if (m == 7) cout << 12 << endl; else if (m == 3) cout << 4 << endl; else cout << m * n << endl; return 0; } if (n >= 4) { cout << m * n << endl; return 0; } } if (n > m) swap(n, m); cout << m * n - 1 << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; const int mod = 1e9 + 7; char str[maxn]; long long qp(long long a, long long b) { long long ret = 1; while (b) { if (b & 1) ret = ret * a % mod; a = a * a % mod; b >>= 1; } return ret; } long long inv(long long a) { return qp(a, mod - 2); } void solve(long long); int main() { scanf( %s , str); long long k; cin >> k; solve(k); return 0; } void solve(long long k) { long long n = (long long)strlen(str); long long ans = 0; for (int i = 0; i < n; i++) { if (str[i] == 0 || str[i] == 5 ) { long long tmp = (qp(2, n * k + i) - qp(2, i) + mod) % mod; tmp = tmp * inv(qp(2, n) - 1) % mod; ans = (ans + tmp) % mod; while (ans < 0) ans += mod; } } cout << ans << endl; return; }
#include <bits/stdc++.h> using namespace std; long long int power_mod(long long int a, long long int x) { if (x == 0) return 1; long long int y = power_mod(a, x / 2); long long int ans = (y * y) % 1000000007; if (x % 2) ans = (ans * a) % 1000000007; return ans; } long long int inv(long long int a) { return power_mod(a, 1000000007 - 2); } long long int power(long long int a, long long int x) { if (x == 0) return 1; long long int y = power(a, x / 2); long long int ans = (y * y); if (x % 2) ans *= a; return ans; } const long long int N = 1 + 1ll << 18; int level[20] = {}; long long int a[N] = {}; long long int tree[4 * N] = {}; void build(long long int st, long long int ed, long long int node) { if (st == ed) { tree[node] = a[st]; return; } long long int mid = (st + ed) / 2; long long int left = 2 * node; long long int right = 2 * node + 1; build(st, mid, left); build(mid + 1, ed, right); tree[node] = tree[left] + tree[right]; } inline void update(long long int st, long long int ed, long long int node, long long int dep, long long int i) { if (i < st or i > ed) return; if (st == ed) { if (st == i) { tree[node] = a[st]; } return; } long long int mid = (st + ed) / 2; long long int left = 2 * node; long long int right = 2 * node + 1; if (level[dep]) { swap(left, right); } update(st, mid, left, dep - 1, i); update(mid + 1, ed, right, dep - 1, i); tree[node] = tree[left] + tree[right]; } inline long long int query(long long int st, long long int ed, long long int l, long long int r, long long int node, long long int dep) { if (ed < l or st > r) return 0; if (st >= l and ed <= r) return tree[node]; long long int mid = (st + ed) / 2; long long int left = 2 * node; long long int right = 2 * node + 1; long long int x = st, y = mid; long long int go = left; if (l > mid) { x = mid + 1; y = ed; go = right; } if (level[dep]) { if (go == left) { go = right; } else go = left; } return query(x, y, l, r, go, dep - 1); } inline long long int get(long long int x, long long int n) { if (x == 0) return 0; long long int sum = 0; long long int left = 1; long long int m = 1 << n; for (long long int i = 18; i >= 0; i--) { if (x & (1 << i)) { sum += query(1, m, left, left - 1 + (1 << i), 1, n); left += (1 << i); } } return sum; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int n, q; cin >> n >> q; long long int m = 1ll << n; for (long long int i = 1; i <= m; i++) { cin >> a[i]; } build(1, m, 1); while (q--) { long long int c; cin >> c; if (c == 1) { long long int x, k; cin >> x >> k; a[x] = k; update(1, m, 1, n, x); } if (c == 2) { long long int x; cin >> x; for (long long int i = 0; i <= x; i++) { level[i] = 1 - level[i]; } } if (c == 3) { long long int x; cin >> x; level[x + 1] = 1 - level[x + 1]; } if (c == 4) { long long int l, r; cin >> l >> r; long long int ans = get(r, n) - get(l - 1, n); cout << ans << endl; } } }
#include <bits/stdc++.h> #pragma GCC optimize( Ofast , unroll-loops ) using namespace std; const int MOD = 1e9 + 7; const int MAXN = 1010; const double EPS = 0.000001; double A[MAXN], B[MAXN]; int n, m; bool can(double X) { for (int i = 0; i < n; i++) { double W_li = m + X; double TO = W_li / A[i]; if (TO > X) return false; X -= TO; double W_la = W_li - TO; double LN = W_la / B[(i + 1) % n]; if (LN > X) return false; X -= LN; } return true; } int main() { cin >> n >> m; for (int i = 0; i < n; i++) cin >> A[i] >> B[i]; double l = 0.0, r = 1e9 + 1; double ans = 0.0; bool flag = false; while (l <= r) { double mid = (l + r) / 2.0; if (abs(r - l) < EPS) { if (can(l)) { ans = l; } else if (can(r)) { ans = r; } break; } if (can(mid)) { flag = true; ans = mid; r = mid; } else { ans = mid; l = mid; } } if (flag) cout << setprecision(20) << ans << n ; else cout << -1 << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1000008; int n, m, k, d, i, j, e; int tmp[N], pos[N], p[N], c[N]; char s[N]; int main() { scanf( %s %d , s, &m); n = strlen(s); while (m--) { scanf( %d%d , &k, &d); for (i = 0; i < n; i++) { c[i] = (i + 1) % n; pos[i] = p[i] = i; } int t = 0; for (i = 0; i < d; i++) for (j = i; j < k; t++, j += d) p[t] = j; for (i = 0; i < n; ++i) { c[i] = p[c[i]]; } for (e = n - k + 1; e; e >>= 1) { for (i = 0; i < n; ++i) tmp[i] = c[i]; if (e & 1) for (i = 0; i < n; ++i) pos[i] = c[pos[i]]; for (i = 0; i < n; ++i) c[i] = tmp[c[i]]; } for (i = 0; i < n; ++i) tmp[(i + n - k + 1) % n] = s[pos[i]]; for (i = 0; i < n; ++i) putchar(s[i] = (char)tmp[i]); putchar( n ); } }
#include <bits/stdc++.h> using namespace std; const int MAXN = 5e5; vector<int> G[MAXN]; int happiness[MAXN], f[MAXN], tmpAns = 0, ans = 0; void dfs(int u, int par) { int oldTmpAns = -1, oldF = -1, oldFPos = -1; if (~par && f[tmpAns] < happiness[u]) oldTmpAns = tmpAns, f[++tmpAns] = happiness[u]; else { int pos = lower_bound(f, f + tmpAns, happiness[u]) - f; oldF = f[pos], oldFPos = pos; f[pos] = happiness[u]; } ans = max(ans, tmpAns); for (int i = 0; i < G[u].size(); i++) { int v = G[u][i]; if (v == par) continue; dfs(v, u); } if (oldTmpAns != -1) tmpAns = oldTmpAns; if (oldF != -1) f[oldFPos] = oldF; } int main() { int n; cin >> n; for (int i = 0; i < n; i++) cin >> happiness[i]; for (int i = 0; i < n - 1; i++) { int x, y; cin >> x >> y; --x, --y; G[x].push_back(y); G[y].push_back(x); } for (int i = 0; i < n; i++) { f[0] = happiness[i]; tmpAns = 0; dfs(i, -1); } cout << ans + 1 << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int n, k, maxx, cmax; int t[100010]; long long int sum[100010]; int binary_search1(int st, int dr, int pos, int x) { int sol = 0; while (st <= dr) { int m = (st + dr) / 2; long long int lsum = sum[pos] - sum[m - 1]; lsum = 1LL * (pos - m + 1) * x - lsum; if (lsum <= k) { sol = m; dr = m - 1; } else st = m + 1; } return sol; } int main() { scanf( %d %d , &n, &k); for (int i = 1; i <= n; i++) scanf( %d , &t[i]); sort(t + 1, t + n + 1); for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + t[i]; maxx = 1; cmax = t[1]; for (int i = 1; i <= n; i++) { int pos = binary_search1(1, i - 1, i, t[i]); if (pos > 0 && i - pos + 1 > maxx) { maxx = i - pos + 1; cmax = t[i]; } } printf( %d %d , maxx, cmax); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long int n; cin >> n; long long int arr[n][2]; for (int i = 0; i < n; i++) { cin >> arr[i][0] >> arr[i][1]; } long long int x = max(arr[0][0], arr[0][1]); vector<int> v1; int fail = 0; for (int i = 1; i < n; i++) { long long int y = max(arr[i][0], arr[i][1]); long long int k = min(arr[i][0], arr[i][1]); if (y <= x) { v1.push_back(y); x = y; } else if (k <= x) { v1.push_back(k); x = k; } else { fail = 1; break; } } if (fail == 1) cout << NO ; else cout << YES ; return 0; }
#include <bits/stdc++.h> using namespace std; int cnt, dfn[800005], ed[800005], tot, head[800005], tr[800005 * 4], sum[800005 * 4], fuckljx, n, m, vis[800005], de[800005]; char c[800005]; vector<char> mp[800005]; struct edge { int to, next; } data[800005 * 2]; struct hh { long long x, a, b, val; } edge[800005 * 2]; bool operator<(hh A, hh B) { return A.x < B.x; } void add_edge(int x, int y) { if (!x || !y) return; de[y]++; data[++tot].next = head[x]; data[tot].to = y; head[x] = tot; } int id(int x, int y) { if (x < 1 || x > n || y < 1 || y > m) return 0; return (x - 1) * m + y; } void dfs(int x, int f) { vis[x] = 1; dfn[x] = ++cnt; for (int i = head[x]; i; i = data[i].next) { int t = data[i].to; if (t == f) continue; dfs(t, x); } ed[x] = cnt; } void add(int x, int l, int r, int s, int t, int val) { if (l > t || r < s) return; if (s <= l && r <= t) { if (val == 1) { sum[x]++; tr[x] = (r - l + 1); } else { sum[x]--; if (!sum[x]) tr[x] = tr[x * 2] + tr[x * 2 + 1]; } return; } int mid = (l + r) / 2; add(x * 2, l, mid, s, t, val); add(x * 2 + 1, mid + 1, r, s, t, val); if (!sum[x]) tr[x] = tr[x * 2] + tr[x * 2 + 1]; else tr[x] = (r - l + 1); } int main() { cin >> n >> m; for (int i = 1; i <= n; i++) { scanf( %s , c + 1); for (int j = 1; j <= m; j++) { if (c[j] == U ) add_edge(id(i - 1, j), id(i + 1, j)); if (c[j] == D ) add_edge(id(i + 1, j), id(i - 1, j)); if (c[j] == L ) add_edge(id(i, j - 1), id(i, j + 1)); if (c[j] == R ) add_edge(id(i, j + 1), id(i, j - 1)); mp[i].push_back(c[j]); } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (((i + j) & 1) && !de[id(i, j)]) dfs(id(i, j), 0); } } cnt = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (!((i + j) & 1) && !de[id(i, j)]) dfs(id(i, j), 0); } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (mp[i][j - 1] == U ) { if ((i + j) & 1) { edge[++fuckljx] = (hh){dfn[id(i, j)], dfn[(id(i + 1, j))], ed[(id(i + 1, j))], 1}; edge[++fuckljx] = (hh){ed[id(i, j)] + 1, dfn[(id(i + 1, j))], ed[(id(i + 1, j))], -1}; } else { edge[++fuckljx] = (hh){dfn[id(i + 1, j)], dfn[(id(i, j))], ed[(id(i, j))], 1}; edge[++fuckljx] = (hh){ed[id(i + 1, j)] + 1, dfn[(id(i, j))], ed[(id(i, j))], -1}; } } if (mp[i][j - 1] == L ) { if ((i + j) & 1) { edge[++fuckljx] = (hh){dfn[id(i, j)], dfn[(id(i, j + 1))], ed[(id(i, j + 1))], 1}; edge[++fuckljx] = (hh){ed[id(i, j)] + 1, dfn[(id(i, j + 1))], ed[(id(i, j + 1))], -1}; } else { edge[++fuckljx] = (hh){dfn[id(i, j + 1)], dfn[(id(i, j))], ed[(id(i, j))], 1}; edge[++fuckljx] = (hh){ed[id(i, j + 1)] + 1, dfn[(id(i, j))], ed[(id(i, j))], -1}; } } } } sort(edge + 1, edge + 1 + fuckljx); long long last = 0, ans = 0; for (int i = 1; i <= fuckljx; i++) { ans += (long long)tr[1] * (edge[i].x - last); last = edge[i].x; add(1, 1, cnt + 3, edge[i].a, edge[i].b, edge[i].val); } cout << ans; }
#include <bits/stdc++.h> using namespace std; int main() { int a, b, r; scanf( %d%d%d , &a, &b, &r); printf( %s n , a >= 2 * r && b >= 2 * r ? First : Second ); }
#include <bits/stdc++.h> using namespace std; int T; long long r, b, k, g; long long gcd(long long a, long long b) { if (b == 0) return a; else return gcd(b, a % b); } int main() { scanf( %d , &T); while (T--) { scanf( %lld%lld%lld , &r, &b, &k); if (r > b) swap(r, b); g = gcd(r, b); r /= g, b /= g; if ((k - 1) * r + 1 >= b) printf( OBEY n ); else printf( REBEL n ); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int month, day; int cheat[13] = {-1, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; cin >> month >> day; int n = cheat[month] - 8 + day; int ans = 1 + (n / 7) + ((n % 7) > 0); cout << ans; return 0; }
#include <bits/stdc++.h> const int MaxN = 100000, inf = 0x3f3f3f3f; inline void read(int &ans) { ans = 0; char c = getchar(); while (c < 0 || c > 9 ) c = getchar(); while (c >= 0 && c <= 9 ) ans = ans * 10 + c - 48, c = getchar(); return; } int n, P; struct Node { int pos, t; friend inline bool operator==(const Node &a, const Node &b) { return a.pos == b.pos && a.t == b.t; } }; struct cmp_time { inline bool operator()(const Node &a, const Node &b) const { return a.t == b.t ? a.pos > b.pos : a.t > b.t; } }; struct cmp_pos { inline bool operator()(const Node &a, const Node &b) const { return a.pos > b.pos; } }; template <typename Element, typename cmp> struct Exque { private: std::priority_queue<Element, std::vector<Element>, cmp> que, del; public: inline int size() { return que.size() - del.size(); } inline void pop() { if (del.size() && que.top() == del.top()) del.pop(); return que.pop(); } inline void push(const Element &x) { return que.push(x); } inline void delete_(const Element &x) { return que.top() == x ? que.pop() : del.push(x); } inline Element top() { while (del.size() && que.top() == del.top()) que.pop(), del.pop(); return que.top(); } }; std::priority_queue<Node, std::vector<Node>, cmp_time> sitting; std::priority_queue<Node, std::vector<Node>, cmp_pos> preparing; Exque<Node, cmp_pos> inque; std::queue<Node> queorder; long long ans[MaxN + 1]; int cnt = 0; int main() { int i, t; long long curtime = inf; read(n), read(P); for (i = 1; i <= n; ++i) { read(t), sitting.push((Node){i, t}); if (t < curtime) curtime = t; } while (sitting.size() && sitting.top().t <= curtime) preparing.push(sitting.top()), sitting.pop(); if (preparing.size() && (!inque.size() || preparing.top().pos < inque.top().pos)) inque.push(preparing.top()), queorder.push(preparing.top()), preparing.pop(); while (cnt < n) { ++cnt, ans[queorder.front().pos] = (curtime += P); while (sitting.size() && sitting.top().t <= curtime) if (sitting.top().pos < inque.top().pos) inque.push(sitting.top()), queorder.push(sitting.top()), sitting.pop(); else preparing.push(sitting.top()), sitting.pop(); inque.delete_(queorder.front()), queorder.pop(); while (sitting.size() && sitting.top().t <= curtime) preparing.push(sitting.top()), sitting.pop(); if (preparing.size() && (!inque.size() || preparing.top().pos < inque.top().pos)) inque.push(preparing.top()), queorder.push(preparing.top()), preparing.pop(); if (!inque.size() && sitting.size()) { curtime = sitting.top().t; while (sitting.size() && sitting.top().t <= curtime) preparing.push(sitting.top()), sitting.pop(); inque.push(preparing.top()), queorder.push(preparing.top()), preparing.pop(); } } for (i = 1; i <= n; ++i) printf( %I64d , ans[i]); putchar( n ); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, k, z; cin >> n >> k; vector<pair<int, int>> h, res; h.reserve(n); h.resize(k); for (int i = 0; i < k; ++i) { cin >> h[i].first; h[i].second = i; } make_heap(begin(h), end(h)); res.reserve(n); int64_t total = 0; for (int i = k; i < n; ++i) { cin >> z; h.emplace_back(z, i); push_heap(begin(h), end(h)); auto& p = h.front(); total += p.first * (int64_t)(i - p.second); res.emplace_back(p.second, i); pop_heap(begin(h), end(h)); h.pop_back(); } for (int i = n; !h.empty(); ++i) { auto& p = h.front(); total += p.first * (int64_t)(i - p.second); res.emplace_back(p.second, i); pop_heap(begin(h), end(h)); h.pop_back(); } sort(begin(res), end(res)); cout << total << endl << res[0].second + 1; for (int i = 1; i < n; ++i) cout << << res[i].second + 1; cout << endl; }
#include <bits/stdc++.h> using namespace std; const int MOD = 998244353; const int N_MAX = 50; int pwr(int a, int b) { if (b == 0) return 1; if (b & 1) return 1LL * pwr(a, (b ^ 1)) * a % MOD; int aux = pwr(a, (b >> 1)); return 1LL * aux * aux % MOD; } int n; int invf[N_MAX + 2]; struct Task { int l, r; }; Task tasks[N_MAX + 2]; int points[N_MAX * 2 + 2]; struct Segment { int l, r; }; Segment segments[N_MAX * 4 + 2]; int cntSeg; int combrep[N_MAX * 4 + 2][N_MAX + 2]; int lmax[N_MAX + 2][N_MAX + 2]; int rmin[N_MAX + 2][N_MAX + 2]; int invplg[N_MAX + 2][N_MAX + 2]; int dp[N_MAX + 2][N_MAX * 4 + 2][N_MAX + 2]; int sdp[N_MAX + 2][N_MAX * 4 + 2]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; for (int i = n; i >= 1; i--) { cin >> tasks[i].l >> tasks[i].r; points[i * 2 - 1] = tasks[i].l; points[i * 2] = tasks[i].r; } sort(points + 1, points + n * 2 + 1); segments[++cntSeg] = Segment{points[1], points[1]}; for (int i = 2; i <= n * 2; i++) if (points[i] > points[i - 1]) { if (points[i - 1] + 1 <= points[i] - 1) segments[++cntSeg] = Segment{points[i - 1] + 1, points[i] - 1}; segments[++cntSeg] = Segment{points[i], points[i]}; } invf[0] = 1; for (int i = 1; i <= n; i++) invf[i] = 1LL * invf[i - 1] * pwr(i, MOD - 2) % MOD; for (int i = 1; i <= cntSeg; i++) for (int j = 1; j <= n; j++) { combrep[i][j] = 1; int lg = segments[i].r - segments[i].l + 1; for (int k = lg; k <= lg + j - 1; k++) combrep[i][j] = 1LL * combrep[i][j] * k % MOD; combrep[i][j] = 1LL * combrep[i][j] * invf[j] % MOD; } for (int i = 1; i <= n; i++) { lmax[i][i - 1] = INT_MIN; rmin[i][i - 1] = INT_MAX; invplg[i][i - 1] = 1; for (int j = i; j <= n; j++) { lmax[i][j] = max(lmax[i][j - 1], tasks[j].l); rmin[i][j] = min(rmin[i][j - 1], tasks[j].r); invplg[i][j] = 1LL * invplg[i][j - 1] * pwr(tasks[j].r - tasks[j].l + 1, MOD - 2) % MOD; } } dp[0][0][0] = 1; sdp[0][0] = 1; for (int i = 1; i <= n; i++) for (int j = 1; j <= cntSeg; j++) for (int k = 1; k <= i; k++) { if (lmax[i - k + 1][i] > segments[j].l || segments[j].r > rmin[i - k + 1][i]) break; for (int j1 = 0; j1 < j; j1++) { dp[i][j][k] += sdp[i - k][j1]; if (dp[i][j][k] >= MOD) dp[i][j][k] -= MOD; } dp[i][j][k] = 1LL * dp[i][j][k] * combrep[j][k] % MOD; dp[i][j][k] = 1LL * dp[i][j][k] * invplg[i - k + 1][i] % MOD; sdp[i][j] += dp[i][j][k]; if (sdp[i][j] >= MOD) sdp[i][j] -= MOD; } int ans = 0; for (int j = 1; j <= cntSeg; j++) { ans += sdp[n][j]; if (ans >= MOD) ans -= MOD; } cout << ans << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 5; const long long mod = 1e9 + 7; const long long inf = 1e9; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, m; cin >> n >> m; vector<int> v(n); for (int i = 0; i < n; i++) cin >> v[i]; sort(v.begin(), v.end()); int sum = 0; for (int i = 0; i < min(n, m); i++) { if (v[i] < 0) sum += v[i] * -1; } cout << sum; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n; cin >> n; long long sum = 0; vector<long long> a(n); for (long long i = 0; i < n; ++i) { cin >> a[i]; sum += a[i]; } vector<long long> prime; for (long long i = 2; i * i <= sum; ++i) { if (sum % i == 0) { prime.push_back(i); while (sum % i == 0) sum /= i; } } if (sum > 1) prime.push_back(sum); long long ans = LLONG_MAX; for (long long i : prime) { long long now = 0; long long cnt = 0; for (long long j = 0; j < n; ++j) { cnt += a[j]; now += min(cnt % i, i - cnt % i); } ans = min(ans, now); } cout << (ans == LLONG_MAX ? -1 : ans) << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int n; vector<long long> b; int main() { ios_base::sync_with_stdio(false); cin >> n; b.resize(n); for (int i = 0; i < n; ++i) cin >> b[i]; long long mi = *min_element(b.begin(), b.end()); long long ma = *max_element(b.begin(), b.end()); if (mi == ma) { if (mi == 0) { cout << YES n ; for (int i = 0; i < n; ++i) cout << 1 ; } else cout << NO ; return 0; } cout << YES n ; b.push_back(b[0]); int i = 1; while (!(b[i] == ma && b[i - 1] < ma)) ++i; i %= n; for (int j = 0; j < n - 1; ++j) { int ii = (i + n - 1) % n; b[ii] += (j ? b[i] : 2 * b[i]); i = ii; } for (int i = 0; i < n; ++i) cout << b[i] << ; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1555; const int INF = 0x3f3f3f3f; int sx, sy; int n, m; char maze[N][N]; int dir[4][2] = {0, 1, 1, 0, -1, 0, 0, -1}; struct node { int x, y; } vis[N][N]; bool bfs(int x, int y) { queue<node> q; node now, next; now.x = x; now.y = y; q.push(now); while (!q.empty()) { now = q.front(); q.pop(); for (int i = 0; i < 4; i++) { next.x = now.x + dir[i][0]; next.y = now.y + dir[i][1]; if (maze[(next.x % n + n) % n][(next.y % m + m) % m] != # ) { if (vis[(next.x % n + n) % n][(next.y % m + m) % m].x == INF) { vis[(next.x % n + n) % n][(next.y % m + m) % m].x = next.x; vis[(next.x % n + n) % n][(next.y % m + m) % m].y = next.y; q.push(next); } else if (next.x != vis[(next.x % n + n) % n][(next.y % m + m) % m].x || next.y != vis[(next.x % n + n) % n][(next.y % m + m) % m].y) return true; } } } return false; } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> m; memset(vis, INF, sizeof(vis)); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> maze[i][j]; if (maze[i][j] == S ) sx = i, sy = j; } } if (bfs(sx, sy)) cout << Yes << endl; else cout << No << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int n, ar[1010]; bool b[1010]; int main() { cin >> n; for (int i = 1; i <= n; ++i) { cin >> ar[i]; } for (int i = 1; i <= n; ++i) { int yk = i; while (1) { if (b[yk]) break; b[yk] = 1; yk = ar[yk]; } cout << yk << ; fill(b, b + 1010, 0); } return 0; }
#include <bits/stdc++.h> using namespace std; int bs; int* cnt; int ans; class query { public: int l; int r; int index; }; bool cmp(const query a, const query b) { int s = a.l / bs; int e = b.l / bs; if (s == e) return a.r < b.r; return s < e; } void add(int x) { if (cnt[x] == x) ans--; else if (cnt[x] == x - 1) ans++; cnt[x]++; } void del(int x) { if (cnt[x] == x) ans--; else if (cnt[x] == x + 1) ans++; cnt[x]--; } int main() { int n, m, *a; query* q; scanf( %d %d , &n, &m); bs = sqrt(n); a = (int*)calloc(n + 1, sizeof(int)); cnt = (int*)calloc(n + 1, sizeof(int)); int* an = (int*)calloc(m + 1, sizeof(int)); q = (query*)calloc(m + 1, sizeof(query)); for (int i = 0; i < n; i++) scanf( %d , &a[i]); for (int i = 0; i < m; i++) { scanf( %d %d , &q[i].l, &q[i].r); q[i].index = i; q[i].l--; q[i].r--; } sort(q, q + m, cmp); ans = 0; int l = 0, r = -1; for (int i = 0; i < m; i++) { int left = q[i].l; int right = q[i].r; while (r < right) { r++; if (a[r] < n + 1) add(a[r]); } while (r > right) { if (a[r] < n + 1) del(a[r]); r--; } while (l < left) { if (a[l] < n + 1) del(a[l]); l++; } while (l > left) { l--; if (a[l] < n + 1) add(a[l]); } an[q[i].index] = ans; } for (int i = 0; i < m; i++) printf( %d n , an[i]); free(a); free(an); free(cnt); free(q); return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXn = 1e5 + 10, MAXlg = 20; long long dp[MAXn][MAXlg], h[MAXn], dp2[MAXn], n, m, dp3[MAXn], dp4[MAXn]; vector<int> v[MAXn]; bool flag[MAXn], flag2[MAXn]; int make_tree(int a) { flag[a] = true; int ans = 1; h[a] = h[dp[a][0]] + 1; if (v[a].size() == 1 && a != 1) { dp2[a] = 1; return ans; } for (int i = 0; i < v[a].size(); i++) if (!flag[v[a][i]]) { dp[v[a][i]][0] = a; ans += make_tree(v[a][i]); dp3[a] += dp3[v[a][i]]; } dp3[a] += ans - 1; dp2[a] = ans; return ans; } void make_dp(int a) { flag2[a] = true; for (int i = 0; i < v[a].size(); i++) if (!flag2[v[a][i]]) { dp4[v[a][i]] = dp4[a] + (n - dp2[a]) + dp3[a] + (dp2[a] - dp2[v[a][i]]) - (dp3[v[a][i]] + dp2[v[a][i]]); make_dp(v[a][i]); } } void make_lca() { for (int i = 1; i < MAXlg; i++) for (int j = 1; j <= n; j++) dp[j][i] = dp[dp[j][i - 1]][i - 1]; } long double get_lca(int a, int b) { if (h[a] > h[b]) swap(a, b); int aa = a, bb = b, cc = b; long long dis = h[b] - h[a]; for (int i = 0; i < MAXlg; i++) if ((dis >> i) & 1) b = dp[b][i]; if (a == b) { long double ans = 0; dis--; for (int i = 0; i < MAXlg; i++) if ((dis >> i) & 1) bb = dp[bb][i]; ans += (long double)(dp4[a] + dp3[a] - dp3[bb] - dp2[bb]) * dp2[cc]; ans += (long double)(dp3[cc]) * (n - dp2[bb]); ans += (long double)(dis + 2) * (dp2[1] - dp2[bb]) * dp2[cc]; ans /= (long double)(dp2[1] - dp2[bb]) * dp2[cc]; return ans; } for (int i = MAXlg - 1; i >= 0; i--) if (dp[a][i] != dp[b][i]) { a = dp[a][i]; b = dp[b][i]; } int lca = dp[a][0]; long double ans = 0; ans += (long double)dp3[aa] * dp2[bb] + dp3[bb] * dp2[aa] + (long double)((long double)-2 * h[lca] + h[aa] + h[bb] + 1) * dp2[aa] * dp2[bb]; ans /= (long double)dp2[aa] * dp2[bb]; return ans; } int main() { cin >> n >> m; for (int i = 0; i < n - 1; i++) { int a, b; cin >> a >> b; v[a].push_back(b); v[b].push_back(a); } make_tree(1); make_lca(); make_dp(1); for (int i = 0; i < m; i++) { int a, b; cin >> a >> b; cout << fixed << setprecision(10) << get_lca(a, b) << endl; } }
#include <bits/stdc++.h> using namespace std; using ll = long long; using cd = complex<double>; ll base = 100; void fft(vector<cd>& a, bool inv) { int n = a.size(); int bits = __builtin_ctz(n); for (int i = 0; i < n; ++i) { int x = 0; for (int j = 0; j < bits; ++j) x = (x << 1) | (i >> j & 1); if (i > x) swap(a[i], a[x]); } for (int m = 2; m <= n; m *= 2) { auto alpha = (inv ? -2 : 2) * 3.14159265358979323846 / m; auto w = exp(cd(0, alpha)); for (int k = 0; k < n; k += m) { cd x = 1; for (int i = 0; i < m / 2; ++i) { auto u = a[k + i]; auto v = a[k + i + m / 2] * x; a[k + i] = u + v; a[k + i + m / 2] = u - v; x *= w; } } } if (inv) for (auto& x : a) x /= n; } void int_mul(vector<ll>& a, ll v) { ll carry = 0; for (int i = 0; i < a.size() || carry; ++i) { if (i >= a.size()) a.emplace_back(0ll); a[i] = a[i] * v + carry; carry = a[i] / base; a[i] %= base; } } void shrink(vector<ll>& a) { while (a.size() > 1 && a.back() == 0) a.pop_back(); } void normalize(vector<ll>& a) { ll carry = 0; for (int i = 0; i < a.size() || carry; ++i) { if (i >= a.size()) a.emplace_back(0); carry += a[i]; a[i] = carry % base; carry -= a[i]; carry /= base; } shrink(a); } void sqr(vector<ll>& a) { int n = a.size(); int m = 1; while (m < n + n) m *= 2; vector<cd> b(m); for (int i = 0; i < n; ++i) b[i] = a[i]; fft(b, false); for (auto& x : b) x *= x; fft(b, true); a.resize(b.size()); for (int i = 0; i < b.size(); ++i) a[i] = b[i].real() + 0.5; normalize(a); } vector<ll> bp(int e) { if (e == 0) return vector<ll>{1}; auto v = bp(e / 2); sqr(v); if (e & 1) int_mul(v, 3); return v; } int compare(vector<ll> const& a, vector<ll> const& b) { if (a.size() != b.size()) return a.size() < b.size() ? -1 : 1; for (int i = int(a.size()) - 1; i >= 0; --i) if (a[i] != b[i]) return a[i] < b[i] ? -1 : 1; return 0; } int main() { cin.tie(0); cin.sync_with_stdio(0); string number; cin >> number; vector<ll> num; int n = number.size(); int x = 2; num.reserve((n + x - 1) / x); reverse(number.begin(), number.end()); for (int i = 0; i < n; i += x) { auto s = number.substr(i, x); reverse(s.begin(), s.end()); num.emplace_back(stoll(s)); } int log3 = n / log10(3); int start = max(0, log3 - 3); int last = 5; auto A = bp(start); shrink(A); auto B = A; int_mul(B, 2); auto C = B; int_mul(C, 2); int ans = 3 * 10 * 1000 * 1000; for (int p = 0; p < last; ++p) { int v = 3 * (start + p); if (v < ans && compare(A, num) >= 0) { ans = min(ans, v); break; } else if (v + 3 < ans) { int_mul(A, 3); } else { break; } } for (int p = 0; p < last; ++p) { int v = 2 + 3 * (start + p); if (v < ans && compare(B, num) >= 0) { ans = min(ans, v); break; } else if (v + 3 < ans) { int_mul(B, 3); } else { break; } } for (int p = 0; p < last; ++p) { int v = 4 + 3 * (start + p); if (v < ans && compare(C, num) >= 0) { ans = min(ans, v); break; } else if (v + 3 < ans) { int_mul(C, 3); } else { break; } } cout << max(1, ans); }
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast ) void print(vector<long long> vvv) { for (auto it : vvv) cout << it << ; cout << n ; } long long mod = 1e9 + 7; long long qpow(long long base, long long p) { if (p == 0) return 1; if (p == 1) return base % mod; long long r = qpow(base, p / 2); if (p % 2 == 0) return (r * r) % mod; return (((r * r) % mod) * base) % mod; } long long inv(long long a, long long b) { return (((a) % mod) * qpow(b, mod - 2)) % mod; } long long mand(pair<long long, long long> a, pair<long long, long long> b) { return abs(a.first - b.first) + abs(a.second - b.second); } char invc(char a, char b, char c) { if (a == b) return c; return b; } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.setf(ios::fixed); cout.precision(0); long long n; cin >> n; vector<long long> v, ans; vector<pair<long long, long long> > v2; for (long long i = 0; i < n; i++) { long long x; cin >> x; ans.push_back(0); v2.push_back({x, i}); } sort(v2.begin(), v2.end()); for (long long i = 0; i < n; i++) { if (i != n - 1) { ans[v2[i].second] = v2[i + 1].first; } else { ans[v2[i].second] = v2[0].first; } } print(ans); return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; const long long inf = 1e18; int ntest; int n, m, k; string s; int cnt[55]; bool ok[maxn]; void read_input() { cin >> n >> m >> k; cin >> s; } void solve() { fill(cnt, cnt + 26, 0); for (int i = 0; i < k; ++i) ++cnt[s[i] - A ]; long long ans = inf; for (int i = 0; i < 26; ++i) { fill(ok + 1, ok + k + 1, false); ok[0] = true; for (int j = 0; j < 26; ++j) if (j != i) { for (int sum = k - cnt[i]; sum >= 0; --sum) if (ok[sum]) ok[sum + cnt[j]] = true; } for (int sum = 0; sum <= n; ++sum) { if (!ok[sum]) continue; int xn = n - sum; int xm = max(0, m - (k - cnt[i] - sum)); if (xn + xm > cnt[i]) continue; ans = min(ans, xn * 1LL * xm); } } cout << ans << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin >> ntest; while (ntest--) { read_input(); solve(); } }
#include <bits/stdc++.h> using namespace std; mt19937 mt(time(0)); long long n, k; long long a[123456]; const long long inf = (int)(1e9); int cnt = 0; long long mas[123456]; long long solve() { long long md; for (int i = mt() % 123456 + (int)(1e9);; i++) { bool ok = false; for (int j = 2; j * j <= i; j++) { if (i % j == 0) { ok = true; break; } } if (!ok) { md = i; break; } } long long tmp = 1; for (int i = 0; i <= n; i++) { mas[i] = tmp; tmp *= k; tmp %= md; } long long sum = 0; for (int i = 0; i <= n; i++) { long long t = (a[i] * mas[i]) % md; sum += t; sum %= md; } return sum; } int main() { ios_base::sync_with_stdio(0); cin >> n >> k; for (int i = 0; i <= n; i++) { string s; cin >> s; if (s == ? ) a[i] = inf; else { istringstream iss(s); iss >> a[i]; cnt++; } } if (cnt < n + 1) { if (k == 0 && a[0] != 0 && a[0] != inf) { cout << No << endl; exit(0); } if (n % 2 == 1) { if (k == 0 && a[0] == inf && cnt % 2 == 0) cout << No << endl; else cout << Yes << endl; } else { if ((k == 0 && a[0] == 0) || (k == 0 && a[0] == inf && cnt % 2 == 1)) cout << Yes << endl; else cout << No << endl; } exit(0); } long long attempt1 = solve(); long long attempt2 = solve(); long long attempt3 = solve(); if (attempt1 == 0 && attempt2 == 0 && attempt3 == 0) cout << Yes << endl; else cout << No << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long int t; cin >> t; while (t--) { long long int n, k; cin >> n >> k; string s, s1; cin >> s; long long int a[27] = {0}, c = 0, d = 0; for (long long int i = 0; i < n; i++) { if (a[s[i] - a ] == 0) d++; a[s[i] - a ]++; } s1 = s; sort(s1.begin(), s1.end()); if (k == 1) cout << s1 << endl; else { long long int c1 = 0, c2 = 0; for (long long int i = 0; i < n; i++) { if (s1[i] == s1[0]) c1++; else break; } if (c1 < k) { cout << s1[k - 1] << endl; } else if (c1 == k) { if (d == 1) cout << s1[0] << endl; else if (d == 2) { long long int c2 = n - c1; if (c2 % k == 0) c2 = c2 / k; else c2 = (c2 / k) + 1; cout << s1[0] << ; for (long long int i = 0; i < c2; i++) cout << s1[c1] << ; cout << endl; } else { cout << s1[0] << ; for (long long int i = c1; i < n; i++) { cout << s1[i] << ; } cout << endl; } } else { if (d == 1) { cout << s1[0] << ; long long int c2 = c1 - k; if (c2 % k == 0) c2 = c2 / k; else c2 = (c2 / k) + 1; for (long long int i = 0; i < c2; i++) cout << s1[0] << ; cout << endl; } else { for (long long int i = k - 1; i < n; i++) cout << s1[i] << ; cout << endl; } } } } }
#include <bits/stdc++.h> using namespace std; struct target { long double x; long double y; long long t; long double p; bool operator<(const target &b) const; }; bool target::operator<(const target &b) const { return t < b.t; } int main() { cout.precision(30); vector<target> v; int n; cin >> n; for (int i = 0; i < n; i++) { target t; cin >> t.x >> t.y >> t.t >> t.p; v.push_back(t); } sort(v.begin(), v.end()); long double score[1010]; for (long long i = n - 1; i >= 0; i--) { long double baseScore = v[i].p; score[i] = v[i].p; for (long long i2 = i + 1; i2 < n; i2++) { long double dist = sqrt((v[i].x - v[i2].x) * (v[i].x - v[i2].x) + (v[i].y - v[i2].y) * (v[i].y - v[i2].y)); if (dist <= v[i2].t - v[i].t) { if (baseScore + score[i2] > score[i]) { score[i] = baseScore + score[i2]; } } } } long double maxScore = score[0]; for (int i = 1; i < n; i++) { if (score[i] > maxScore) { maxScore = score[i]; } } cout << maxScore << endl; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int x, n, m, temp = 0; cin >> x >> n >> m; for (int i = 0; i <= n; i++) { if (x <= 10 * m) { temp = 1; break; } else x = x / 2 + 10; } if (temp == 1) cout << YES << endl; else cout << NO << endl; } }
#include <bits/stdc++.h> using namespace std; static const double EPS = 1e-6; int ROUND(double x) { return (int)(x + 0.5); } bool ISINT(double x) { return fabs(ROUND(x) - x) <= EPS; } bool ISEQUAL(double x, double y) { return fabs(x - y) <= EPS * max(1.0, max(fabs(x), fabs(y))); } double SQSUM(double x, double y) { return x * x + y * y; } template <class T> bool INRANGE(T x, T a, T b) { return a <= x && x <= b; } void split1(const string& str, vector<string>& out) { string::size_type st = 0; string::size_type next = 0; int word_num = 0; string tmp = str; do { next = tmp.find( , st); string word = tmp.substr(st, next - st); if (word.length() >= 1) { out.push_back(word); } st = next + 1; } while (next != string::npos); } int main() { int n; scanf( %d , &n); vector<string> team_names; for (int i = 0; i < n; i++) { char str[256]; scanf( %s , str); team_names.push_back(string(str)); } map<string, pair<int, pair<int, int> > > mp; for (int i = 0; i < n * (n - 1) / 2; i++) { char str[256]; char str2[256]; scanf( %s %s , str, str2); for (int k = 0; k < 256; k++) { if (str[k] == - || str[k] == : ) { str[k] = ; } if (str2[k] == - || str2[k] == : ) { str2[k] = ; } } vector<string> vs; split1(string(str), vs); vector<string> vs2; split1(string(str2), vs2); string team1, team2; int goal1, goal2; team1 = vs[0]; team2 = vs[1]; goal1 = atoi(vs2[0].c_str()); goal2 = atoi(vs2[1].c_str()); mp[team1].first += goal1 > goal2 ? 3 : goal1 == goal2 ? 1 : 0; mp[team1].second.first += goal1 - goal2; mp[team1].second.second += goal1; mp[team2].first += goal2 > goal1 ? 3 : goal2 == goal1 ? 1 : 0; mp[team2].second.first += goal2 - goal1; mp[team2].second.second += goal2; } map<pair<int, pair<int, int> >, string> inv_mp; { map<string, pair<int, pair<int, int> > >::iterator it; for (it = mp.begin(); it != mp.end(); it++) { inv_mp[it->second] = it->first; } } vector<string> winners; { map<pair<int, pair<int, int> >, string>::reverse_iterator inv_it = inv_mp.rbegin(); for (int i = 0; i < n / 2; inv_it++, i++) { winners.push_back(inv_it->second); } } sort(winners.begin(), winners.end()); for (int i = 0; i < ((int)winners.size()); i++) { printf( %s n , winners[i].c_str()); } return 0; }
#include <bits/stdc++.h> using namespace std; long long int power(long long int a, long long int b) { long long int res = 1; while (b) { if (b % 2 == 1) res = (res * a) % 1000000007; a = (a * a) % 1000000007; b /= 2; } return res; } bool comp(long long int a, long long int b) { return a < b; } long long int binary(long long int *a, long long int l, long long int r, long long int key) { long long int mid; while (l <= r) { mid = (l + r) / 2; if (a[mid] == key) { return mid; } else if (a[mid] < key) { l = mid + 1; } else { r = mid - 1; } } return -1; } bool isprime(long long int n) { if (n <= 1) { return false; } int i; for (i = 2; i <= ceil(sqrt((double)n)); i++) { if (n % i == 0) { return false; } } return true; } bool isPalindrome(long long int n) { long long int rev = 0, temp = n, rem; while (temp) { rem = temp % 10; rev = rev * 10 + rem; temp /= 10; } if (n == rev) return true; return false; } long long int mulmod(long long int a, long long int b, long long int m) { long long int res = 0; a = a % m; while (b > 0) { if (b % 2 == 1) { res = (res + a) % m; } a = (a * 2) % m; b /= 2; } return (res % m); } bool isLeapYear(int year) { if (year % 400 == 0) return true; if (year % 100 == 0) return false; if (year % 4 == 0) return true; return false; } int ones(long long int n) { int ans = 0; while (n) { ans++; n &= (n - 1); } return ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int t, pro = 1, n, m, temp, k, i, l, r, mid, j, x, y, z, ind, mx = LONG_LONG_MIN, mn = LONG_LONG_MAX, ans = 0, cnt = 0, curr = 0, prev, sum = 0, flag = 0, i1 = -1, i2 = -1; cin >> n; long long int a[n]; for (i = 0; i <= n - 1; i++) { cin >> a[i]; mn = min(mn, a[i]); } vector<long long int> v; for (i = 0; i <= n - 1; i++) { if (a[i] == mn) { v.push_back(i); } } ans = LONG_LONG_MAX; for (i = 0; i <= v.size() - 2; i++) { ans = min(ans, v[i + 1] - v[i]); } cout << ans; return 0; }
#include <bits/stdc++.h> const long long INF = 2e18; const double EPS = 1e-9; using namespace std; void WEZaa() { std::ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); } int main() { WEZaa(); unsigned long long n, k; cin >> n >> k; vector<unsigned long long> a(n), b(n); for (auto& i : a) cin >> i; for (auto& i : b) cin >> i; unsigned long long l = 0, r = 1e10, ans = 0, md; while (l <= r) { md = (l + r) / 2; unsigned long long sum = 0; for (int i = 0; i < n; i++) { unsigned long long st = a[i] * md; if (b[i] < st) sum += st - b[i]; } if (sum <= k) l = md + 1, ans = md; else r = md - 1; } cout << ans << n ; }
#include <bits/stdc++.h> using namespace std; int n, ans1, ans2, nr, x; vector<int> v; int main() { cin >> n; for (int i = 1; i <= n; ++i) { cin >> nr; for (int j = 1; j <= nr; ++j) { cin >> x; if (nr % 2 == 1 && j == (nr + 1) / 2) { v.push_back(-x); continue; } if (j <= nr / 2) ans1 += x; else ans2 += x; } } sort(v.begin(), v.end()); for (int i = 0; i < v.size(); ++i) { if (i % 2 == 0) ans1 -= v[i]; else ans2 -= v[i]; } cout << ans1 << << ans2; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long int n, k, ans = INT_MAX; cin >> n >> k; for (long long int i = 0; i < n; i++) { long long int x; cin >> x; if (k % x == 0) { ans = min(ans, k / x); } } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace ::std; template <class T> T SQR(T N) { return (T)N * N; } template <class T> double DIST(T a, T b) { return 1.0 * sqrt(SQR(double(a)) + SQR(double(b))); } template <class T> bool CROSS(pair<T, T> a, pair<T, T> b, pair<T, T> c) { return (b.first - a.first) * (c.second - b.second) >= (b.second - a.second) * (c.first - b.first); } template <class ll> ll POW(ll a, ll b, ll mod) { ll res = 1 % mod, x = a % mod; while (b) { if (b & 1) res = (res * x) % mod; b /= 2, x = (x * a) % mod; } return res; } int px[] = {0, 1, -1, 0, -1, -1, 1, 1}; int py[] = {1, 0, 0, -1, -1, 1, -1, 1}; double EPS = 1e-9; double PI = acos(-1); double GR = 1.6180339887498948; int F[7]; inline void Fail(string str) { string s = str; reverse(s.begin(), s.end()); s = s + # + str; int len = s.length(); for (int i = 1; i < len; ++i) { int j = F[i - 1]; while (j > 0 and s[i] != s[j]) j = F[j - 1]; if (s[i] == s[j]) ++j; F[i] = j; } } int main() { int n, m, c, d, a, b, k; int test; scanf( %d%d%d , &n, &m, &d); bool flag = 0; b = c = 0; for (int i = 0; i < n; ++i) scanf( %d , &a), (a % d and !flag) ? flag = 1, b = i : flag; flag = 0; for (int i = 0; i < m; ++i) scanf( %d , &a), (a % d and !flag) ? flag = 1, c = i : flag; printf( %d n , b + c); }
#include <bits/stdc++.h> using namespace std; long long derangements(long long n) { if (n == 0) return 1; if (n == 1) return 0; if (n == 2) return 1; return (n - 1) * (derangements(n - 1) + derangements(n - 2)); } long long nCr(long long n, long long r) { long long res = 1; if (r == 0) return res; for (long long i = 0; i < r; i++) res *= (n - i); for (long long i = 2; i <= r; i++) res /= i; return res; } int32_t main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); long long n, k, ans = 0; cin >> n >> k; for (long long i = 0; i <= k; i++) ans += (nCr(n, i) * derangements(i)); cout << ans; return 0; }
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC target( sse4 ) using namespace std; template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> auto dud(c* x) -> decltype(cerr << *x, 0); template <class c> char dud(...); struct debug { template <class c> debug& operator<<(const c&) { return *this; } }; const long long N = 1e5 + 5; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n; cin >> n; vector<long long> a(n), b; for (long long i = 0; i < n; i++) { cin >> a[i]; if (a[i] & 1) { b.push_back(i); } else { a[i] = a[i] / 2; } } long long k = 0; for (long long i = 0; i < (long long)b.size(); i++) { if (a[b[i]] >= 0) { if (!k) { a[b[i]] = (a[b[i]] + 1) / 2; } else { a[b[i]] = a[b[i]] / 2; } } else { if (k) { a[b[i]] = (a[b[i]] - 1) / 2; } else { a[b[i]] = a[b[i]] / 2; } } k ^= 1; } for (long long i = 0; i < n; i++) { cout << a[i] << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int N, K, X; cin >> N >> K >> X; vector<int> Balls[100]; for (int i = 0; i < N; i++) { int color; cin >> color; Balls[0].push_back(color); } for (int i = 1; i < 100; i++) { Balls[i] = Balls[0]; } int result = 0; for (int i = 0; i < N; i++) { Balls[i].insert(Balls[i].begin() + i, X); for (int j = 0; j < (int)Balls[i].size() - 2; j++) { if (Balls[i][j] == Balls[i][j + 1] && Balls[i][j] == Balls[i][j + 2]) { int color = Balls[i][j]; while (j != (int)Balls[i].size() && Balls[i][j] == color) { Balls[i].erase(Balls[i].begin() + j); } j = -1; } } result = max(result, N - (int)Balls[i].size()); } cout << result; }
#include <bits/stdc++.h> using namespace std; int main() { int a; cin >> a; if (a <= 4) cout << a % 3 + 1 << endl; else if (a == 5) cout << a - 4 << endl; return 0; }
#include <bits/stdc++.h> using namespace std; inline long long read() { long long num = 0, neg = 1; char c = getchar(); while (!isdigit(c)) { if (c == - ) neg = -1; c = getchar(); } while (isdigit(c)) { num = (num << 3) + (num << 1) + c - 0 ; c = getchar(); } return num * neg; } int p, lmt; int n, cnt[200010], a[200010], sum[200010]; int exs[200010], exs1[200010], ans, first[400010]; vector<int> loc; map<int, int> used; inline bool check() { int mx = 0, tot = 0; for (int i = 1; i <= n; i++) { if (cnt[i] > mx) mx = cnt[i], tot = 0, p = i; if (cnt[i] == mx) tot++; } return tot > 1; } int main() { n = read(); lmt = 400; for (int i = 1; i <= n; i++) { a[i] = read(); cnt[a[i]]++; } if (check()) { printf( %d n , n); return 0; } for (int i = 1; i <= n; i++) if (a[i] == p) loc.push_back(i); for (int u = 1; u <= n; u++) if (cnt[u] > lmt && u != p) { for (int i = 0; i <= 2 * n; i++) first[i] = n + 1; first[n] = 0, sum[0] = n; for (int i = 1; i <= n; i++) { sum[i] = sum[i - 1] + (a[i] == u) - (a[i] == p); if (first[sum[i]] <= n) ans = max(ans, i - first[sum[i]]); else first[sum[i]] = i; } } vector<pair<int, int> > seg; for (int len = 1; len <= lmt + 1; len++) { seg.clear(); for (int i = 0; i < loc.size(); i++) { int j = i + len - 1; if (j >= loc.size()) break; int l = (i == 0 ? 1 : loc[i - 1] + 1), r = (j == loc.size() - 1 ? n : loc[j + 1] - 1); seg.push_back(make_pair(l, r)); } int l = 1, r = 0, mx = 0; memset(exs, 0, sizeof(exs)); memset(exs1, 0, sizeof(exs1)); for (int i = 0; i < seg.size(); i++) { while (r < seg[i].second) { mx += 2; r++; if (a[r] != p) { exs1[exs[a[r]]]--; exs[a[r]]++; exs1[exs[a[r]]]++; } while (!exs1[mx] && mx) mx--; } while (l < seg[i].first) { mx += 2; if (a[l] != p) { exs1[exs[a[l]]]--; exs[a[l]]--; exs1[exs[a[l]]]++; } l++; while (!exs1[mx] && mx) mx--; } if (mx >= len) ans = max(ans, r - l + 1); } } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; void solve() { long long int i, j, n, s = 0, c = 0, x, k, y, m, z, ans = 0; cin >> n >> m; cin >> x >> z >> y; vector<long long int> a(n), b(m); for (i = 0; i < n; i++) { cin >> a[i]; } for (i = 0; i < m; i++) { cin >> b[i]; } if (n == m) { for (i = 0; i < n; i++) { if (a[i] != b[i]) { cout << -1; return; } } cout << 0; return; } if (m > n) { cout << -1; return; } i = 0; j = 0; k = 0; long long int ma = INT_MIN, l; while (i < n && j < m) { if (a[i] != b[j]) { ma = max(ma, a[i]); i++; } else { l = i - k; if (l == 0) { i++; j++; k = i; continue; } long long int maxel; if (k > 0) { maxel = max(a[k - 1], a[i]); } else { maxel = a[i]; } if (l < z) { if (maxel < ma) { cout << -1; return; } ans += l * y; } else { if (y * z < x && maxel > ma) { ans += l * y; } else if (y * z < x) { l = l - z; ans += x + l * y; } else { long long int rem = l % z; long long int gro = l / z; ans += gro * x + rem * y; } } j++; i++; k = i; ma = INT_MIN; } } l = n - k; for (long long int q = i; q < n; q++) { ma = max(ma, a[q]); } if (l > 0) { long long int maxel = a[k - 1]; if (l < z) { if (maxel < ma) { cout << -1; return; } ans += l * y; } else { if (y * z < x && maxel > ma) { ans += l * y; } else if (y * z < x) { l = l - z; ans += x + l * y; } else { long long int rem = l % z; long long int gro = l / z; ans += gro * x + rem * y; } } j++; i++; k = i; ma = INT_MIN; } cout << ans; } int main() { long long int t; t = 1; while (t--) { solve(); cout << n ; } }
#include <bits/stdc++.h> using namespace std; int main() { int i, j, k, l, m, n, p, x, y; string s1, s2, s3, s4; cin >> s1 >> s2; cin >> n; cout << s1 << << s2; cout << endl; for (i = 0; i < n; i++) { cin >> s3 >> s4; if (s3 == s1) { s1 = s4; cout << s1 << << s2; } if (s3 == s2) { s2 = s4; cout << s1 << << s2; } cout << endl; } }
#include <bits/stdc++.h> using namespace std; typedef long double ld; typedef long long int int64; typedef unsigned long long int uint64; typedef pair<int, int> PII; typedef vector<int> VI; typedef vector<long long> VLL; typedef vector<PII> VII; typedef vector<VI> VVI; #define MEM(a, b) memset(a, (b), sizeof(a)) #define clr(a) fill(a, 0) #define FOR(i, j, k, in) for (int i = (j); i < (k); i += (in)) #define FORW(i, j, k, in) for (int i = (j); i <= (k); i += (in)) #define RFOR(i, j, k, in) for (int i = (j); i >= (k); i -= (in)) #define all(cont) cont.begin(), cont.end() #define rall(cont) cont.rbegin(), cont.rend() #define sz(cont) int((cont).size()) #define pb push_back #define mp make_pair #define fi first #define se second #define IINF 0x3f3f3f3f #define LLINF 1000111000111000111LL #define PI 3.1415926535897932384626433832795 #define FastIO ios_base::sync_with_stdio(false); std::cin.tie(NULL); std::cout.tie(NULL); #define hardio(name) freopen(name .inp , r ,stdin), freopen(name .out , w ,stdout); #define endl n int main(int argc, char* argv[]) { FastIO; #ifndef ONLINE_JUDGE hardio( input ); #endif vector<int> a(26); a[0] = 10010; a[1] = 11020; a[2] = 20011; a[3] = 21012; a[4] = 11011; a[5] = 21021; a[6] = 22022; a[7] = 12021; a[8] = 11011; a[9] = 12012; a[10] = 10120; a[11] = 11130; a[12] = 20121; a[13] = 21122; a[14] = 11121; a[15] = 21131; a[16] = 22132; a[17] = 12131; a[18] = 11121; a[19] = 12122; a[20] = 10221; a[21] = 11231; a[22] = 12113; a[23] = 20222; a[24] = 21223; a[25] = 11222; int n; cin >> n; string s = ; FOR(i, 0, n, 1) { int cur = 0; FOR(j, 0, 5, 1) { int x; cin >> x; cur = cur * 10 + x; } FOR(j, 0, 26, 1) if (cur == a[j]) { s += char(j + a ); break; } } cout << s << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const long long P = 1e9 + 7; const int N = 2e5 + 5; const int inf = 0x3f3f3f3f; const double pi = acos(-1); mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int n, x, y, a[2]; vector<int> g[N]; void dfs(int x, int fa, int grp) { a[grp]++; for (auto u : g[x]) if (u != fa) dfs(u, x, 1 - grp); } int main() { scanf( %d , &n); for (int i = (1); i <= (n - 1); ++i) { scanf( %d%d , &x, &y); g[x].push_back(y), g[y].push_back(x); } dfs(1, 0, 0); cout << min(a[0], a[1]) - 1 << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int m, n, sum = 0, i = 1, k; cin >> n >> m; k = m; while (m >= i) { m -= i; i = (i % n) + 1; } cout << m << endl; return 0; }
#include <bits/stdc++.h> using namespace std; string s; int main() { cin >> s; for (int i = 1; i < s.size(); i++) { if (s[i] == s[i - 1]) for (char j = a ; j <= z ; j++) if (s[i - 1] != j && s[i + 1] != j) { s[i] = j; break; } } cout << s << endl; }
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int t[n]; for (int i = 0; i < n; i++) { cin >> t[i]; } if (n == 1) { cout << m - t[0]; return 0; } int ans = 0; for (int k = 0; k < n * n * n; k++) { set<int> st; for (int i = 0; i < n; i++) { if (st.count(t[i]) == 0 && t[i] < m) { st.insert(t[i]); t[i]++; } } if (st.size()) { ans++; } } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; struct node { int cnt; bool leaf; int nx[26]; node() { leaf = false; cnt = 0; memset(nx, -1, sizeof nx); } }; string s, d; node t[300100]; int ans, sz; vector<string> v; void add(string s) { int cur = 0; for (int i = 0; i < s.size(); i++) { if (t[cur].nx[s[i] - a ] != -1) cur = t[cur].nx[s[i] - a ]; else { t[cur].nx[s[i] - a ] = ++sz; cur = sz; } t[cur].cnt++; } t[cur].leaf = true; } bool check(string s) { int cur = 0; for (int i = 0; i < s.size(); i++) { if (t[cur].nx[s[i] - a ] != -1) cur = t[cur].nx[s[i] - a ]; else return false; } if (t[cur].leaf) return true; return false; } int calc(string s) { int d = -1, cur = 0, mn = -1; for (int i = 0; i < s.size(); i++) { if (t[cur].nx[s[i] - a ] != -1) cur = t[cur].nx[s[i] - a ]; else break; d = i + 1; } if (d == -1) return s.size(); for (int i = 0; i < 26; i++) if (t[cur].nx[i] != -1) return s.size(); cur = 0; for (int i = 0; i < s.size(); i++) { if (t[cur].nx[s[i] - a ] != -1) cur = t[cur].nx[s[i] - a ]; else break; if (t[cur].cnt == 1) { mn = i + 1; break; } } if (mn == -1) return s.size(); return min(s.size(), mn + 1 + s.size() - d); } int main() { while (getline(cin, d)) { s += d; s += # ; ans++; for (int i = 0; i < d.size(); i++) if (!isalpha(d[i])) ans++; } for (int i = 0; i < s.size();) { if (!isalpha(s[i])) i++; else { int j = i + 1; while (true) { if (!isalpha(s[j])) break; j++; } j--; v.push_back(s.substr(i, j - i + 1)); i = j + 1; } } for (auto a : v) { ans += calc(a); if (!check(a)) add(a); } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; using vi = vector<int>; int n, m, p, nm; vector<char> g; vector<bool> vis; vector<int> s, cnt; vector<queue<int>> ex; queue<int> q; bool isEmpty(int v) { if (v < 0) return false; int i = v / m, j = v % m; if (i < 0 || i >= n) return false; if (j < 0 || j >= m) return false; return (g[v] == . ); } int dist(int u, int v) { int x1 = u / m, y1 = u % m; int x2 = v / m, y2 = v % m; return abs(x1 - x2) + abs(y1 - y2); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n >> m >> p; nm = n * m; g.resize(nm); s.resize(p); cnt.resize(p); ex.resize(p); for (int& e : s) cin >> e; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { int v = i * m + j; char c; cin >> c; g[v] = c; if (c != . && c != # ) { int pl = c - 1 ; cnt[pl]++; ex[pl].push(v); } } } bool found = true; while (found) { found = false; for (int cur = 0; cur < p; cur++) { int dis = 0; while (dis != s[cur] && !ex[cur].empty()) { queue<int> tmp; while (!ex[cur].empty()) { int u = ex[cur].front(); ex[cur].pop(); for (int mul : {-m, -1, m, 1}) { int to = u + mul; if (to / m != u / m && to % m != u % m) continue; if (!isEmpty(to)) continue; g[to] = cur + 1 ; cnt[cur]++; found = true; tmp.push(to); } } ex[cur] = tmp; dis++; } } } for (int i : cnt) cout << i << ; cout << endl; }
#include <bits/stdc++.h> using namespace std; using ll = long long; const int N = 3005; const double PI = acos(-1); struct Point { ll x, y; }; inline Point operator+(const Point &a, const Point &b) { return {a.x + b.x, a.y + b.y}; } inline Point operator-(const Point &a, const Point &b) { return {a.x - b.x, a.y - b.y}; } inline ll cross(const Point &a, const Point &b) { return a.x * b.y - a.y * b.x; } inline double polar(const Point &a) { return atan2(a.y, a.x); } int n, m, r[N]; Point a[N], b[N]; void solve(vector<int> va, vector<pair<int, int>> vb) { while (1) { if (va.size() == 1) { for (auto &i : vb) cout << i.first << << va[0] << endl; return; } if (vb.size() == 1) { for (auto &i : va) cout << vb[0].first << << i << endl; return; } for (int i = 0; i < int(vb.size()); i++) if (vb[i].second > vb[0].second) swap(vb[i], vb[0]); vector<pair<double, pair<int, int>>> tmp((va.size() + vb.size()) * 2); int idx = 0; for (int i = 0; i < int(va.size()); i++) tmp[++idx] = {polar(a[va[i]] - b[vb[0].first]), {va[i], 0}}; for (int i = 1; i < int(vb.size()); i++) tmp[++idx] = {polar(b[vb[i].first] - b[vb[0].first]), vb[i]}; sort(tmp.begin() + 1, tmp.begin() + idx + 1); for (int i = 1; i <= idx; i++) tmp[idx + i] = tmp[i], tmp[idx + i].first += 2 * PI; for (int i = 1, j = 0, sum = 0; i <= idx; sum -= 1 - tmp[i++].second.second) { if (sum >= 1 && sum <= vb[0].second - 1) { vector<int> xa; vector<pair<int, int>> xb; xb.push_back({vb[0].first, sum}); vb[0].second -= sum; vb.resize(1); va.clear(); for (int k = i; k <= j; k++) if (!tmp[k].second.second) xa.push_back(tmp[k].second.first); else xb.push_back(tmp[k].second); for (int k = j + 1; k <= i + idx - 1; k++) if (!tmp[k].second.second) va.push_back(tmp[k].second.first); else vb.push_back(tmp[k].second); if (xa.size() + xb.size() > va.size() + vb.size()) swap(xa, va), swap(xb, vb); solve(xa, xb); break; } while (tmp[j + 1].first - tmp[i].first <= PI) sum += 1 - tmp[++j].second.second; if (sum >= 1 && sum <= vb[0].second - 1) { vector<int> xa; vector<pair<int, int>> xb; xb.push_back({vb[0].first, sum}); vb[0].second -= sum; vb.resize(1); va.clear(); for (int k = i; k <= j; k++) if (!tmp[k].second.second) xa.push_back(tmp[k].second.first); else xb.push_back(tmp[k].second); for (int k = j + 1; k <= i + idx - 1; k++) if (!tmp[k].second.second) va.push_back(tmp[k].second.first); else vb.push_back(tmp[k].second); if (xa.size() + xb.size() > va.size() + vb.size()) swap(xa, va), swap(xb, vb); solve(xa, xb); break; } } } } int main() { ios::sync_with_stdio(false); int T; cin >> T; while (T--) { int n, m; cin >> n >> m; vector<int> va; vector<pair<int, int>> vb; for (int i = 1; i <= m; i++) cin >> r[i]; for (int i = 1; i <= n; i++) cin >> a[i].x >> a[i].y, va.push_back(i); for (int i = 1; i <= m; i++) cin >> b[i].x >> b[i].y, vb.push_back({i, r[i]}); cout << YES << endl; solve(va, vb); } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxm = 1e5 + 5; const int maxn = 1e5 + 5; const int inf = 0x3f3f3f3f; int n, m; int a[maxn]; struct edge { int u, v, w, next; } e[maxm * 2]; int head[maxn]; bool vis[maxn]; int cnt; priority_queue<int, vector<int>, greater<int> > q; void addedge(int u, int v, int w) { e[cnt].u = u; e[cnt].v = v; e[cnt].w = w; e[cnt].next = head[u]; head[u] = cnt++; } void add_edge(int u, int v, int w) { addedge(u, v, w); addedge(v, u, w); } void bfs() { vis[1] = 1; q.push(1); int temp = 1; while (!q.empty()) { int u = q.top(); a[temp++] = u; q.pop(); for (int i = head[u]; ~i; i = e[i].next) { int v = e[i].v; if (!vis[v]) { q.push(v); vis[v] = 1; } } } } int main() { cnt = 0; memset(vis, 0, sizeof(vis)); memset(head, -1, sizeof(head)); cin >> n >> m; int u, v; for (int i = 1; i <= m; i++) { cin >> u >> v; add_edge(u, v, 1); } bfs(); for (int i = 1; i <= n; i++) { printf( %d%c , a[i], i == n ? n : ); } }