func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; int main() { pair<long long, int> p[400005]; int n, m; cin >> n; for (int i = 0; i < n; i++) { cin >> p[i].first; p[i].second = 1; } cin >> m; for (int i = 0; i < m; i++) { cin >> p[i + n].first; p[i + n].second = 2; } int x = n * 3; int y = m * 3; sort(p, p + n + m); int u = x, v = y; for (int i = 0; i < n + m; i++) { if (p[i].second == 1) x--; else y--; if (x - y > u - v) { u = x; v = y; } } cout << u << : << v << endl; }
|
#include <bits/stdc++.h> using namespace std; const int MaxN = 100100; const int Mod = 1e9 + 7; long long N, S; long long p[MaxN]; long long deg[MaxN]; long long pref[MaxN]; long long depth[MaxN]; vector<long long> child[MaxN]; void solve(long long branch) { for (int j = (2); j < (N + 1); j++) { p[j] = j - 1; deg[j - 1] = 1; child[j - 1].push_back(j); depth[j] = j; } deg[N] = 0; if (branch == 1) { cout << Yes << endl; for (int j = (2); j < (N + 1); j++) { cout << p[j] << ; } exit(0); } long long lo = 2 * N - 1; long long hi = N * (N + 1) / 2; if (S < lo || S > hi) { cout << No << endl; exit(0); } long long x = N - 2; long long i = N; long long z = 0; vector<long long> anchor; anchor.push_back(1); depth[1] = 1; while (S < hi) { while (deg[anchor[z]] >= branch) { for (auto w : child[anchor[z]]) { anchor.push_back(w); ; depth[w] = depth[anchor[z]] + 1; } z++; if (z > (long long)anchor.size()) { assert(false); cin.ignore(); } x = (i - 1) - depth[anchor[z]]; }; ; if (S + x <= hi) { deg[p[i]]--; child[p[i]].pop_back(); p[i] = anchor[z]; deg[anchor[z]]++; assert(anchor[z] != i); child[anchor[z]].push_back(i); S += x; x--; i--; } else { x = (hi - S); p[i] = (i - 1) - x; S += x; } } cout << Yes << endl; for (int j = (2); j < (N + 1); j++) { cout << p[j] << ; } } long long check() { for (int i = (1); i < (N + 1); i++) pref[i] = 1; for (long long i = N; i >= 2; i--) { pref[p[i]] += pref[i]; } long long sum = 0; for (int i = (1); i < (N + 1); i++) { sum += pref[i]; } return sum; } long long f(long long branch) { if (branch == 1) { return (N * (N + 1)) / 2; } for (long long i = 1; i <= N; i++) { deg[i] = 0; } long long cur = 1; for (long long i = 2; i <= N; i++) { while (deg[cur] >= branch) { cur++; } p[i] = cur; deg[cur]++; } long long ret = check(); return ret; } void load() { cin >> N >> S; long long lo = 2 * N - 1; long long hi = N * (N + 1) / 2; if (S < lo || S > hi) { cout << No << endl; exit(0); } } int main() { ios_base::sync_with_stdio(false); load(); long long lo = 1, hi = N - 1; while (lo < hi) { long long mid = (lo + hi) / 2; if (f(mid) <= S) { hi = mid; } else { lo = mid + 1; } }; solve(lo); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, a, b, sum[200005], sm[200005]; struct node { long long x, y, z; } val[200005]; bool comp(node a, node b) { return a.z > b.z; } int main(void) { long long ans = 0; scanf( %lld%lld%lld , &n, &a, &b); b = min(b, n); for (int i = 1; i <= n; i++) scanf( %lld%lld , &val[i].x, &val[i].y), val[i].z = val[i].x - val[i].y; sort(val + 1, val + n + 1, comp); for (int i = 1; i <= n; i++) { sum[i] = sum[i - 1] + max(val[i].x, val[i].y); sm[i] = sm[i - 1] + val[i].y; } ans += sum[b] + sm[n] - sm[b]; if (b == 0) { printf( %lld n , sm[n]); return 0; } if (a == 0) { printf( %lld n , ans); return 0; } for (int i = 1; i <= n; i++) { int num = 0; long long t = val[i].x; for (int j = 1; j <= a; j++) t *= 2ll; if (i <= b - 1) t = t - max(val[i].x, val[i].y), t += sum[b], t += sm[n] - sm[b]; else t += sum[b - 1], t += sm[n] - sm[b - 1] - val[i].y; ans = max(ans, t); } printf( %lld n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 205; const int mod = 10007; void add(int &x, int y) { x += y; if (x >= mod) x -= mod; } int mul(int x, int y) { return x * y % mod; } int pw(int x, int y) { int ret = 1; while (y) { if (y & 1) ret = mul(ret, x); x = mul(x, x); y >>= 1; } return ret; } namespace berlekamp_massey { vector<int> bm(vector<int> x) { vector<int> rel, cur; int lf, ld; for (int i = 0; i < x.size(); ++i) { int sum = 0; for (int j = 0; j < cur.size(); ++j) add(sum, mul(x[i - j - 1], cur[j])); if (sum == x[i]) continue; if (!cur.size()) { cur.resize(i + 1); lf = i; ld = sum - x[i]; add(ld, mod); continue; } int coef = mul(sum - x[i] + mod, pw(ld, mod - 2)); vector<int> new_cur(i - lf - 1); new_cur.push_back(coef); for (int j = 0; j < rel.size(); ++j) { new_cur.push_back(mul(mod - rel[j], coef)); } if (new_cur.size() < cur.size()) new_cur.resize(cur.size()); for (int j = 0; j < cur.size(); ++j) add(new_cur[j], cur[j]); if (i - lf + rel.size() >= cur.size()) { rel = cur, lf = i, ld = sum - x[i]; add(ld, mod); } cur = new_cur; } return cur; } int sz; int a[5005], rel[5005], tmp[5005]; int ff[5005], gg[5005]; void mulmod(int *p, int *q) { for (int i = 0; i < sz + sz; ++i) tmp[i] = 0; for (int i = 0; i < sz; ++i) if (p[i]) { for (int j = 0; j < sz; ++j) { add(tmp[i + j], mul(p[i], q[j])); } } for (int i = sz + sz - 1; i >= sz; --i) if (tmp[i]) { for (int j = sz - 1; j >= 0; --j) { add(tmp[i - j - 1], mul(tmp[i], rel[j])); } } for (int i = 0; i < sz; ++i) p[i] = tmp[i]; } int solve(vector<int> x, int n) { if (n < x.size()) return x[n]; vector<int> cur = bm(x); sz = cur.size(); for (int i = 0; i < sz; ++i) rel[i] = cur[i], a[i] = x[i]; for (int i = 0; i < sz; ++i) ff[i] = gg[i] = 0; ff[0] = 1; if (sz > 1) gg[1] = 1; else gg[0] = rel[0]; while (n) { if (n & 1) mulmod(ff, gg); mulmod(gg, gg); n >>= 1; } int ret = 0; for (int i = 0; i < sz; ++i) add(ret, mul(ff[i], a[i])); return ret; } } // namespace berlekamp_massey using namespace berlekamp_massey; int n, m; string s; int f[805][N][N], ans[1405]; vector<int> g; int main() { ios_base::sync_with_stdio(false); cin >> s >> n; m = s.size(); s = ~ + s; f[0][0][0] = 1; int len = m + 1400 >> 1; for (int i = 1; i <= len; ++i) { for (int j = 0; j <= m; ++j) { for (int k = 0; k <= m; ++k) { if (f[i - 1][j][k] == 0) continue; if (j == m && k == m) add(f[i][j][k], mul(26, f[i - 1][j][k])); else if (j == m) { add(f[i][j][k], mul(25, f[i - 1][j][k])); add(f[i][j][k + 1], f[i - 1][j][k]); } else if (k == m) { add(f[i][j][k], mul(25, f[i - 1][j][k])); add(f[i][j + 1][k], f[i - 1][j][k]); } else { if (s[j + 1] == s[m + 1 - k - 1]) { add(f[i][j + 1][k + 1], f[i - 1][j][k]); add(f[i][j][k], mul(25, f[i - 1][j][k])); } else { add(f[i][j + 1][k], f[i - 1][j][k]); add(f[i][j][k + 1], f[i - 1][j][k]); add(f[i][j][k], mul(24, f[i - 1][j][k])); } } } } } for (int i = 0; i < 1400; ++i) { int l = m + i >> 1; for (int j = 0; j <= m; ++j) { for (int k = 0; k <= m; ++k) { if (j + k >= m) { if (m + i & 1) add(ans[i], mul(26, f[l][j][k])); else add(ans[i], f[l][j][k]); } if (j + k == m - 1) { if (m + i & 1) add(ans[i], f[l][j][k]); } } } } for (int i = 0; i < 1400; ++i) g.push_back(ans[i]); cout << solve(g, n) << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, A, B; while (cin >> n) { vector<int> a, b; while (n--) { int p; cin >> p; a.push_back(p); } int ans = 0; cin >> A >> B; sort(a.begin(), a.end()); a.resize(unique(a.begin(), a.end()) - a.begin()); while (A != B) { int t1 = A - 1; int len = a.size(); b.clear(); for (int i = 0; i < len; i++) { int t = A / a[i] * a[i]; if (t >= B) { t1 = min(t, t1); b.push_back(a[i]); } } a = b; A = t1; ans++; } cout << ans << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const int N = 5e5 + 2; const int M = 1e5 + 2; const int inf = 2e9 + 2; const long long linf = 4e18 + 2; long long add(long long a, long long b) { a += b; return a >= mod ? a - mod : a; } long long sub(long long a, long long b) { a += mod - b; return a >= mod ? a - mod : a; } long long mul(long long a, long long b) { return (long long)a * b % mod; } long long a[N], bit[2][N]; long long id[N]; bool cmp(long long c, long long d) { return a[c] < a[d]; } void upd(int x, int val, int s) { for (; x < N; x += x & (-x)) bit[s][x] += val; } long long get(int x, int s) { long long ans = 0; for (; x > 0; x -= x & (-x)) ans += bit[s][x]; return ans; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n; for (int i = 1; i <= n; i++) cin >> a[i], id[i] = i; sort(id + 1, id + 1 + n, cmp); long long ans = 0; for (int j = 1; j <= n; j++) { int i = id[j]; ans = add(ans, mul(a[i], mul(i, n - i + 1))); long long l = get(i, 0); long long r = get(n, 1) - get(i, 1); ans = add(ans, mul(a[i], mul(l, n - i + 1))); ans = add(ans, mul(a[i], mul(r, i))); upd(i, i, 0); upd(i, n - i + 1, 1); } cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; int n; int a[5005], pos[5005]; long long dp[5005], f[5055], inv[5005]; void prework() { f[0] = 1; f[1] = 1; inv[1] = 1; inv[0] = 1; for (int i = 2; i <= n; i++) { f[i] = f[i - 1] * i % mod; inv[i] = (mod - mod / i) * inv[mod % i] % mod; } for (int i = 2; i <= n; i++) { inv[i] = inv[i] * inv[i - 1] % mod; } } long long A(long long a, long long b) { return f[a] * inv[a - b] % mod; } int main() { cin >> n; prework(); for (int i = 1; i <= n; i++) { cin >> a[i]; } sort(a + 1, a + n + 1); int head = 0; for (int i = 1; i <= n; i++) { while (a[head + 1] * 2 <= a[i]) head++; pos[i] = head; } dp[0] = 1; pos[0] = -1; for (int i = 1; i <= n; i++) { for (int j = 0; j <= pos[i]; j++) { dp[i] = (dp[i] + dp[j] * A(n - 2 - pos[j], pos[i] - pos[j] - 1) % mod) % mod; } } if (pos[n] == n - 1) cout << dp[n] << endl; else cout << 0 << endl; return 0; }
|
#include <bits/stdc++.h> int a[1010], b[1010]; int n, k, inf = 0x0f0f0f0f; int test(int cur) { int i, ans = 0; if (cur <= 0) return inf; for (i = 0; i < n; i++) { if (a[i] != cur) ans++; cur += k; } return ans; } int main() { int i, j, cur; while (~scanf( %d%d , &n, &k)) { for (i = 0; i < n; i++) scanf( %d , &a[i]); for (i = 0; i < n; i++) b[i] = test(a[i] - i * k); for (i = 1, j = 0; i < n; i++) if (b[i] < b[j]) j = i; printf( %d n , b[j]); cur = a[j] - k * j; for (i = 0; i < n; i++) { if (a[i] != cur) { if (a[i] < cur) printf( + %d %d n , i + 1, cur - a[i]); else printf( - %d %d n , i + 1, a[i] - cur); } cur += k; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 100010; struct Event { int t, L, R, on; Event(int t = 0, int L = 0, int R = 0, int on = 0) : t(t), L(L), R(R), on(on) {} bool operator<(const Event &rh) const { return t < rh.t; } } E[maxn * 2]; int V[maxn * 2], cnt; int Pre[maxn * 2], P[maxn * 2]; long long Ans[maxn]; int ID(int v) { int L = 1, R = cnt; while (L < R) { int mid = (L + R) >> 1; if (V[mid] < v) L = mid + 1; else R = mid; } return L; } int main() { int n, k; cin >> n >> k; for (int i = 1; i <= n; i++) { static int x, y; scanf( %d%d , &x, &y); E[2 * i - 1] = Event(x - k + 1, y, y + k - 1, 1); E[2 * i] = Event(x + 1, y, y + k - 1, -1); V[++cnt] = y; V[++cnt] = y + k; } sort(V + 1, V + 1 + cnt); cnt = unique(V + 1, V + 1 + cnt) - V - 1; sort(E + 1, E + 1 + 2 * n); for (int i = 1; i <= 2 * n; i++) { int id = ID(E[i].L); for (; id < cnt && V[id] <= E[i].R; id++) { Ans[P[id]] += ((long long)(E[i].t - Pre[id])) * (V[id + 1] - V[id]); P[id] += E[i].on; Pre[id] = E[i].t; } } for (int i = 1; i <= n; i++) cout << Ans[i] << (i == n ? n : ); return 0; }
|
#include <bits/stdc++.h> using namespace std; int a[105]; int f[105]; int v[105]; bool cmp(int i, int j) { return a[i] > a[j]; } int main() { int n, w; while (cin >> n >> w) { int sum = 0; int sum2 = 0; for (int i = 0; i < n; i++) { cin >> a[i]; sum += a[i]; if (a[i] % 2 == 0) f[i] = a[i] / 2; else f[i] = (a[i] + 1) / 2; sum2 += f[i]; } for (int i = 0; i < n; i++) v[i] = i; sort(v, v + n, cmp); if (sum2 > w || sum < w) { cout << -1 << endl; continue; } w -= sum2; for (int i = 0; i < n; i++) { if (w > a[v[i]] - f[v[i]]) { w -= (a[v[i]] - f[v[i]]); f[v[i]] = a[v[i]]; } else if (w <= a[v[i]] - f[v[i]]) { f[v[i]] += w; break; } } for (int i = 0; i < n; i++) { cout << f[i]; if (i != n - 1) cout << ; } cout << endl; } }
|
#include <bits/stdc++.h> using namespace std; class BIT { std::vector<int> bit; public: BIT(int size) : bit(size + 1, 0) {} void add(int i, int x) { i++; while (i < (int)bit.size()) { bit[i] += x; i += i & -i; } } int sum(int a) { a++; int res = 0; while (0 < a) { res += bit[a]; a -= a & -a; } return res; } int sum(int a, int b) { return sum(b) - sum(a - 1); } }; int main() { ios::sync_with_stdio(0); cin.tie(0); string s; cin >> s; int n; cin >> n; BIT xs(s.size()), ys(s.size()), zs(s.size()); for (int i = 0; i < (s.size()); i++) { if (s[i] == x ) xs.add(i, 1); else if (s[i] == y ) ys.add(i, 1); else zs.add(i, 1); } for (int i = 0; i < (n); i++) { int l, r; cin >> l >> r; l--; r--; int x, y, z; x = xs.sum(l, r); y = ys.sum(l, r); z = zs.sum(l, r); string ans = NO ; if (abs(x - y) < 2 && abs(x - z) < 2 && abs(y - z) < 2 || r - l < 2) ans = YES ; cout << ans << endl; } return 0; }
|
#include <bits/stdc++.h> const int N = 1000001; using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, m, k; string s; cin >> n >> k >> s; m = s.size(); int last[200]; memset(last, -1, sizeof last); for (int i = 0; i < m; i++) { last[s[i]] = i; } pair<int, char> a[k]; for (int i = 0; i < k; i++) { a[i] = make_pair(last[ a + i], a + i); } sort(a, a + k); int ind = 0; for (int i = 0; i < n; i++) { s += a[ind].second; ind = (ind + 1) % k; } long long int dp[200]; memset(dp, 0, sizeof dp); long long int t = 0; for (char c : s) { long long int h = dp[c]; dp[c] = (t + 1 + 1000000007) % 1000000007; t = (t - h + dp[c] + 1000000007) % 1000000007; } cout << (t + 1) % 1000000007; }
|
#include <bits/stdc++.h> #pragma comment(linker, /stack:640000000 ) using namespace std; const double EPS = 1e-9; const int INF = 0x7f7f7f7f; const double PI = acos(-1.0); template <class T> inline T _abs(T n) { return ((n) < 0 ? -(n) : (n)); } template <class T> inline T _max(T a, T b) { return (!((a) < (b)) ? (a) : (b)); } template <class T> inline T _min(T a, T b) { return (((a) < (b)) ? (a) : (b)); } template <class T> inline T _swap(T& a, T& b) { a = a ^ b; b = a ^ b; a = a ^ b; } template <class T> inline T gcd(T a, T b) { return (b) == 0 ? (a) : gcd((b), ((a) % (b))); } template <class T> inline T lcm(T a, T b) { return ((a) / gcd((a), (b)) * (b)); } template <typename T> string NumberToString(T Number) { ostringstream second; second << Number; return second.str(); } struct debugger { template <typename T> debugger& operator,(const T& v) { cerr << v << ; return *this; } } dbg; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; while (cin >> n) { priority_queue<pair<int, string> > pq; for (int i = (int)(1); i <= (int)(n); i++) { string st; int no; cin >> st >> no; pq.push(make_pair(-no, st)); } vector<pair<int, string> > v; int hh = 1; int flg = 1; while (!pq.empty()) { pair<int, string> p = pq.top(); pq.pop(); p.first *= -1; if (p.first == 0) { v.push_back(make_pair(hh, p.second)); hh++; continue; } vector<int> tmp; for (int i = (int)(0); i <= (int)((int)v.size() - 1); i++) { tmp.push_back(v[i].first); } sort(tmp.rbegin(), tmp.rend()); if (tmp.size() < p.first) { flg = 0; break; } int tmpNo = tmp[p.first - 1]; for (int i = (int)(0); i <= (int)((int)v.size() - 1); i++) { if (v[i].first >= tmpNo) v[i].first += 1; } v.push_back(make_pair(tmpNo, p.second)); } if (flg) { for (int i = (int)(0); i <= (int)(n - 1); i++) { cout << v[i].second << << v[i].first << n ; } } else printf( -1 n ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int iinf = 0x3f3f3f3f; const long long linf = 0x3f3f3f3f3f3f3f3f; const int N = 1e4, M = 1e5; int n, m, p, a[N], b[M]; int gcd(int a, int b) { return a ? gcd(b % a, a) : b; } int mypow(int a, int first = p - 2, int res = 1) { for (; first; first >>= 1, a = 1ll * a * a % p) (first & 1) && (res = 1ll * res * a % p); return res; } int main() { ios::sync_with_stdio(false); cin.tie(0), cout.tie(0); cin >> n >> m >> p; int phi = p - 1, g = phi; for (int i(0); i < (n); ++i) cin >> a[i]; for (int i(0); i < (m); ++i) cin >> b[i], g = gcd(g, b[i]); vector<int> c; for (int d = 1; d * d <= phi; ++d) if (phi % d == 0) c.push_back(d), d *d < phi ? c.push_back(phi / d) : void(); sort(c.begin(), c.end()); vector<int> mb; for (int i(0); i < (n); ++i) { int mn_c = -1; for (int &u : c) if (mypow(a[i], 1ll * g * u % phi) == 1) { mb.push_back(phi / u); break; } } sort(mb.begin(), mb.end()); mb.erase(unique(mb.begin(), mb.end()), mb.end()); vector<int> f(int((mb).size()), 0); int ns = 0; for (int i((int((mb).size())) - 1); i >= 0; --i) { f[i] = phi / mb[i]; for (int j = i + 1; j < int((mb).size()); ++j) if (mb[j] % mb[i] == 0) f[i] -= f[j]; ns += f[i]; } cout << ns << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; double p[101], f[101], ans = 0, last = 1; double Calc(int x) { return 1 - (1 - f[x]) * (1 - p[x]); } int main() { cin >> n; for (int i = 1; i <= n; i++) { int x; cin >> x; p[i] = f[i] = x / 100.0; last *= p[i]; } ans += last * n; for (int i = n + 1; i <= 300000; i++) { int x = 1; for (int j = 1; j <= n; j++) { if (Calc(j) / f[j] > Calc(x) / f[x]) x = j; } double now = last * Calc(x) / f[x]; f[x] = Calc(x); ans += (now - last) * i; last = now; } printf( %.8f n , ans); }
|
#include <bits/stdc++.h> using namespace std; pair<double, double> p[100100]; double dt[100100]; double db[100100]; double da[100100]; int main() { double ax, ay, bx, by, tx, ty; int n; cin >> ax >> ay >> bx >> by >> tx >> ty; cin >> n; double ans = 0; scanf( %lf %lf , &p[0].first, &p[0].second); ans += sqrt((p[0].first - tx) * (p[0].first - tx) + (p[0].second - ty) * (p[0].second - ty)); dt[0] = ans; for (int i = 1; i < n; i++) { scanf( %lf %lf , &p[i].first, &p[i].second); dt[i] = sqrt((p[i].first - tx) * (p[i].first - tx) + (p[i].second - ty) * (p[i].second - ty)); ans += dt[i]; } ans *= 2; for (int i = 0; i < n; i++) { da[i] = sqrt((p[i].first - ax) * (p[i].first - ax) + (p[i].second - ay) * (p[i].second - ay)); db[i] = sqrt((p[i].first - bx) * (p[i].first - bx) + (p[i].second - by) * (p[i].second - by)); } double p1, p2, p3, p4; double Da = 1.7976931348623158e+308, Db = 1.7976931348623158e+308; int indexofa = -1; int indexofb = -1; for (int i = 0; i < n; i++) { if (da[i] - dt[i] < Da) { Da = da[i] - dt[i]; indexofa = i; } } for (int i = 0; i < n; i++) { if (db[i] - dt[i] < Db && i != indexofa) { Db = db[i] - dt[i]; indexofb = i; } } p1 = Da + Db; Da = 1.7976931348623158e+308, Db = 1.7976931348623158e+308; indexofa = -1; indexofb = -1; for (int i = 0; i < n; i++) { if (db[i] - dt[i] < Db) { Db = db[i] - dt[i]; indexofb = i; } } for (int i = 0; i < n; i++) { if (da[i] - dt[i] < Da && i != indexofb) { Da = da[i] - dt[i]; indexofa = i; } } p2 = Da + Db; Db = 1.7976931348623158e+308; indexofb = -1; for (int i = 0; i < n; i++) { if (db[i] - dt[i] < Db) { Db = db[i] - dt[i]; indexofb = i; } } p3 = Db; Da = 1.7976931348623158e+308; indexofa = -1; for (int i = 0; i < n; i++) { if (da[i] - dt[i] < Da) { Da = da[i] - dt[i]; indexofa = i; } } p4 = Da; printf( %.12lf , min(min(p1, p2), min(p3, p4)) + ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, n; while (~scanf( %d%d%d%d , &a, &b, &c, &n)) { if (c > a || c > b || n - (a + b - c) < 1) printf( -1 n ); else printf( %d n , n - (a + b - c)); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; int count = 0, wc = 0; bool flag = 0; int m = n; while (n--) { string s; cin >> s; int l = s.size(); if (l % 2 == 1) flag = 1; int zeroc = 0, onec = 0; for (int i = 0; i < l; i++) { if (s[i] == 0 ) { zeroc++; } else { onec++; } } if (onec % 2 == 1 && zeroc % 2 == 1) { wc++; } else { count++; } } if (flag == 1) cout << m << endl; else { count = count + 2 * (wc / 2); cout << count << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { std::ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int n, k; cin >> n >> k; long long int cost = 0, ans = 0, a[n]; vector<pair<long long int, long long int>> pr(n); for (long long int(i) = 0; (i) < (n); (i)++) { long long int a; cin >> a; pr[i] = make_pair(a, i + 1); } sort(pr.begin(), pr.end()); vector<long long int> v; for (long long int(i) = 0; (i) < (n); (i)++) { if ((cost > k) || (cost + pr[i].first > k)) break; else { cost += pr[i].first; ans++; v.push_back(pr[i].second); } } cout << ans << n ; sort(v.begin(), v.end()); for (long long int(i) = 0; (i) < (ans); (i)++) { cout << v[i] << ; } cout << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n, m, k; cin >> n >> m >> k; string ans; for (int i = 0; i < n; i++) ans += U ; for (int i = 0; i < m; i++) ans += L ; for (int i = 0; i < n; i++) { for (int j = 0; j < m - 1; j++) { ans += (i % 2 ? L : R ); } if (i < n - 1) ans += D ; } cout << ans.size() << n << ans << n ; }
|
#include <bits/stdc++.h> using namespace std; const int N = 2010, mod = 998244353; int sm[2][N], n, f[N][N], a[N][N], ans; void add(int x, int y, int z) { for (; x <= n; x += x & -x) sm[z][x] += y; } int query(int x, int z) { int ret = 0; for (; x; x -= x & -x) ret += sm[z][x]; return ret; } void Init() { f[0][0] = 1; for (int i = 1; i <= n; ++i) { f[i][0] = (long long)f[i - 1][0] * i % mod; for (int j = 1; j <= i; ++j) f[i][j] = (f[i][j - 1] - f[i - 1][j - 1] + mod) % mod; } } int p[N], q[N]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; Init(); for (int i = 1; i <= n; ++i) for (int j = 1; j <= n; ++j) cin >> a[i][j]; for (int i = 1; i <= n; ++i) { int les = n; ans = (long long)ans * f[n][n] % mod; memset(sm, 0, sizeof sm); memset(p, 0, sizeof p); memset(q, 0, sizeof q); for (int j = 1; j <= n; ++j) { int u = query(a[i][j] - 1, 0); p[a[i - 1][j]] = 1; if (q[a[i - 1][j]]) ++les; else if (a[i - 1][j]) add(a[i - 1][j], 1, 0), add(a[i - 1][j], 1, 1); int v = a[i][j] - 1 - query(a[i][j] - 1, 1); les -= 2; if (i == 1) ans = (ans + (long long)v * f[n - j][0]) % mod; else ans = (ans + (long long)u * f[n - j][les + 1] + (long long)v * f[n - j][les]) % mod; q[a[i][j]] = 1; if (p[a[i][j]]) add(a[i][j], -1, 0), ++les; else add(a[i][j], 1, 1); } } cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; string s; cin >> s; vector<int> p0; vector<int> p1; vector<int> ans(n); for (int i = 0; i < n; i++) { int newpos = p0.size() + p1.size(); if (s[i] == 0 ) { if (p1.empty()) { p0.push_back(newpos); } else { newpos = p1.back(); p0.push_back(newpos); p1.pop_back(); } } else { if (p0.empty()) { p1.push_back(newpos); } else { newpos = p0.back(); p1.push_back(newpos); p0.pop_back(); } } ans[i] = newpos + 1; } cout << p0.size() + p1.size() << endl; for (int i = 0; i < n; i++) { cout << ans[i] << ; } cout << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int tt; cin >> tt; while (tt--) { string s; cin >> s; reverse(s.begin(), s.end()); if (s.substr(0, 2) == op ) { cout << FILIPINO n ; } else if (s.substr(0, 4) == used || s.substr(0, 4) == usam ) { cout << JAPANESE n ; } else if (s.substr(0, 5) == adinm ) { cout << KOREAN n ; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; char field[1000][1000]; int deltas[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}}; int n, m; int si, sj, ti, tj; bool possible; void go(int i, int j, char num) { for (auto d : deltas) { int ii = i; int jj = j; while (true) { ii += d[0]; jj += d[1]; if (ii < 0 || jj < 0 || ii >= n || jj >= m) break; if (field[ii][jj] == T ) possible = true; if (field[ii][jj] != . ) break; field[ii][jj] = num; } } } int main() { ios::sync_with_stdio(false); cin >> n >> m; for (int i = 0; i < n; i++) { string line; cin >> line; for (int j = 0; j < m; j++) { field[i][j] = line[j]; if (line[j] == T ) { ti = i; tj = j; } if (line[j] == S ) { si = i; sj = j; } } } go(si, sj, 0 ); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (field[i][j] == 0 ) { go(i, j, 1 ); } } } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (field[i][j] == 1 ) { go(i, j, 2 ); } } } if (possible) cout << YES << endl; else cout << NO << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int Df[300005], GG, RR, fw[300005 * 2], U, lt[300005], val[300005], rt[300005], color[300005], Dep[300005], st[300005], rev[300005], cnt, fa[300005][20], Fa[300005], cl, dfn[300005], in, col[300005], low[300005], tot = 1, node[300005], vst[300005 << 1], dep[300005]; vector<int> son[300005], sonn[300005]; struct edge { int to, nxt; } e[300005 << 1]; inline void add(int x, int y) { e[++tot].to = y; e[tot].nxt = node[x]; node[x] = tot; } void dfs(int now) { dfn[now] = low[now] = ++in; for (int i = node[now]; i; i = e[i].nxt) { if (vst[i] | vst[i ^ 1]) continue; vst[i] = 1; if (!dfn[e[i].to]) dep[e[i].to] = dep[now] + 1, Fa[e[i].to] = now, dfs(e[i].to), low[now] = min(low[now], low[e[i].to]); else low[now] = min(low[now], dfn[e[i].to]); } } void MEM(int now) { dfn[now] = 0; Fa[now] = dep[now] = 0; for (int i = node[now]; i; i = e[i].nxt) { if (dfn[e[i].to]) MEM(e[i].to); } node[now] = 0; } void Dfs(int now) { col[now] = cl; for (int T, i = 0; i < son[now].size(); ++i) if (!col[T = son[now][i]]) col[T] = cl, Dfs(T); } void Dfs_(int now) { color[now] = 0; for (int T, i = 0; i < sonn[now].size(); ++i) if (!~color[T = sonn[now][i]]) Dfs_(T); } void dfs_v(int now, int fat) { lt[now] = cnt; Df[now] = ++in; vst[now] = 1; for (int i = 1; i <= 18; ++i) fa[now][i] = fa[fa[now][i - 1]][i - 1]; for (int T, i = 0; i < son[now].size(); ++i) if ((T = son[now][i]) != fat) fa[T][0] = now, Dep[T] = Dep[now] + 1, dfs_v(T, now); } inline int lca(int x, int y) { int i = 18; if (Dep[x] < Dep[y]) swap(x, y); for (; ~i; --i) if (Dep[fa[x][i]] >= Dep[y]) x = fa[x][i]; if (x == y) return x; for (i = 18; ~i; --i) if (fa[x][i] != fa[y][i]) x = fa[x][i], y = fa[y][i]; return fa[x][0]; } inline bool cmp(int x, int y) { return Df[x] < Df[y]; } int n, m, las, fl, lc, hd, q, v, i, X[300005 * 3], V, AL, E, Y[300005 * 3], x, y, j, Ex[300005], Ey[300005]; int main() { cin >> n >> m >> q; for (i = 1; i <= m; ++i) cin >> x >> y, add(y, x), add(X[i] = x, Y[i] = y); for (i = 1; i <= n; ++i) if (!dfn[i]) dfs(i); for (i = 1; i <= m; ++i) if (dep[X[i]] > dep[Y[i]]) swap(X[i], Y[i]); for (i = 1; i <= m; ++i) { if (Fa[Y[i]] == X[i] && low[Y[i]] > dfn[X[i]]) continue; vst[i] = -1; son[X[i]].push_back(Y[i]); son[Y[i]].push_back(X[i]); } for (i = 1; i <= n; ++i) if (!col[i]) ++cl, Dfs(i); for (i = 1; i <= n; ++i) son[i].clear(); for (i = 1; i <= m; ++i) if (col[X[i]] != col[Y[i]]) sonn[col[X[i]]].push_back(col[Y[i]]), sonn[col[Y[i]]].push_back(col[X[i]]); for (i = 1; i <= cl; ++i) if (sonn[i].size()) for (sort(sonn[i].begin(), sonn[i].end()), son[i].push_back(sonn[i][0]), j = 1; j < sonn[i].size(); ++j) if (sonn[i][j] != sonn[i][j - 1]) son[i].push_back(sonn[i][j]); memset(Fa, 0, sizeof(Fa)); memset(vst, 0, sizeof(vst)); memset(dep, 0, sizeof(dep)); memset(node, 0, sizeof(node)); memset(dfn, 0, sizeof(dfn)); in = 0; for (i = 1; i <= cl; ++i) if (!vst[i]) ++cnt, Dep[i] = 1, rt[cnt] = i, dfs_v(i, 0); while (q--) { cin >> V >> E; ++GG; for (i = 1; i <= V; ++i) cin >> X[i], X[i] = (X[i] + RR - 1) % n + 1, Y[i] = col[X[i]]; for (i = 1; i <= E; ++i) cin >> X[V + i * 2 - 1] >> X[V + i * 2], X[V + i * 2 - 1] = (X[V + i * 2 - 1] + RR - 1) % n + 1, X[V + i * 2] = (X[V + i * 2] + RR - 1) % n + 1, Ex[i] = col[X[V + i * 2 - 1]], Ey[i] = col[X[V + i * 2]]; AL = V + E + E + 1; for (i = 1; i < AL; ++i) X[i] = col[X[i]]; tot = 1; for (i = V + 1; i < AL; i += 2) add(X[i], X[i + 1]), add(X[i + 1], X[i]); sort(X + 1, X + AL, cmp); X[AL] = X[0] = 300005 - 1; U = 0; for (las = 1, i = 2; i <= AL; ++i) { if (lt[X[i]] != lt[X[i - 1]]) { st[hd = 1] = rt[lt[X[las]]]; fw[++U] = st[1]; for (j = las; j < i; ++j) { if (X[j] == X[j - 1]) continue; lc = lca(st[hd], X[j]); if (st[hd] != lc) { while (Dep[lc] < Dep[st[hd - 1]]) { add(st[hd - 1], st[hd]); add(st[hd], st[hd - 1]); Ex[++E] = st[hd - 1], Ey[E] = st[hd]; --hd; } add(lc, st[hd]); add(st[hd], lc); Ex[++E] = lc, Ey[E] = st[hd]; --hd; if (lc != st[hd]) st[++hd] = lc, fw[++U] = lc; } if (X[j] != st[hd]) st[++hd] = X[j], fw[++U] = X[j]; } while (hd > 1) add(st[hd - 1], st[hd]), add(st[hd], st[hd - 1]), Ex[++E] = st[hd - 1], Ey[E] = st[hd], --hd; las = i; } } for (i = 1; i <= U; ++i) dfn[fw[i]] = 0; for (i = 2; i <= tot; ++i) vst[i] = 0; dfs(Y[1]); for (fl = 0, i = 2; i <= V; ++i) if (!dfn[Y[i]]) fl = 1; if (fl) { cout << NO n ; MEM(Y[1]); for (i = 1; i <= U; ++i) node[fw[i]] = 0; continue; } for (i = 1; i <= U; ++i) sonn[fw[i]].clear(); for (i = 1; i <= E; ++i) if (dep[Ex[i]] > dep[Ey[i]]) swap(Ex[i], Ey[i]); for (i = 1; i <= E; ++i) { if (Fa[Ey[i]] == Ex[i] && low[Ey[i]] > dfn[Ex[i]]) continue; sonn[Ex[i]].push_back(Ey[i]); sonn[Ey[i]].push_back(Ex[i]); } MEM(Y[1]); for (i = 1; i <= U; ++i) node[fw[i]] = 0, color[fw[i]] = -1; Dfs_(Y[1]); for (fl = 0, i = 2; i <= V; ++i) if (!~color[Y[i]]) fl = 1; if (fl) cout << NO n ; else cout << YES n , (RR += GG) %= n; } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int powe(long long int n, long long int m) { if (m == 0) return 1; long long int t = powe(n, m / 2); if (m % 2 == 0) return (t * t); return (((t * t)) * n); } long long int mpowe(long long int n, long long int m) { if (m == 0) return 1; long long int t = powe(n, m / 2); t %= 1000000007; if (m % 2 == 0) return (t * t) % 1000000007; return (((t * t) % 1000000007) * n) % 1000000007; } long long int logtwo(long long int n) { if (n == 1) return 0; return logtwo(n / 2) + 1; } long long int A[200000 + 1]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { long long int n, d, i, sum = 0, dt; cin >> n >> d; long long int a[n]; for (long long int i = 0; i < n; i++) cin >> a[i]; ; long long int c; for (i = 1; i < n; i++) { c = i; dt = d / c; if (a[i] < dt) { sum += a[i]; d -= (a[i] * c); } else { sum += dt; break; } } sum += a[0]; cout << sum << n ; } }
|
#include <bits/stdc++.h> using namespace std; const double eps = 1e-10; const double PI = 3.1415926535897932; const int dir[8][2] = {-1, -1, -1, 0, -1, 1, 0, -1, 0, 1, 1, -1, 1, 0, 1, 1}; const int maxn = 2e5 + 5; const int MOD = 998244353; int n, m; long long A[maxn], invA[maxn]; int w[maxn]; bool vis[maxn]; bool del[maxn]; int B[maxn]; int pos[maxn]; int pre[maxn], nex[maxn]; bool judge(int x) { if (x == 0 || x == n + 1) return 0; if (vis[w[x]]) return 0; return 1; } int main() { int T; scanf( %d , &T); while (T--) { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { del[i] = vis[i] = false; pre[i] = i - 1; nex[i] = i + 1; } for (int i = 1; i <= n; i++) scanf( %d , &w[i]), pos[w[i]] = i; for (int i = 1; i <= m; i++) { scanf( %d , &B[i]); vis[B[i]] = true; } long long ans = 1; for (int i = 1; i <= m; i++) { int x = pos[B[i]]; int cnt = 0; cnt += judge(pre[x]); cnt += judge(nex[x]); ans = ans * cnt % MOD; vis[w[x]] = false; nex[pre[x]] = nex[x]; pre[nex[x]] = pre[x]; } printf( %lld n , ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long int t, n, m, i, j, k, sum; long long int a[100001]; cin >> n >> k; bool yo = false; for (i = 1; i <= k; i++) cin >> a[i]; sum = LONG_LONG_MAX; for (i = 1; i <= k; i++) { if (n % a[i] < sum) { sum = n % a[i]; j = i; m = n / a[i]; } } cout << j << << m; return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T> T sqr(T x) { return x * x; } template <class T> T gcd(T a, T b) { return (b != 0 ? gcd<T>(b, a % b) : a); } template <class T> T lcm(T a, T b) { return (a / gcd<T>(a, b) * b); } template <class T> inline T bigmod(T p, T e, T M) { if (e == 0) return 1; if (e % 2 == 0) { long long int t = bigmod(p, e / 2, M); return (T)((t * t) % M); } return (T)((long long int)bigmod(p, e - 1, M) * (long long int)p) % M; } template <class T> inline T bigexp(T p, T e) { if (e == 0) return 1; if (e % 2 == 0) { long long int t = bigexp(p, e / 2); return (T)((t * t)); } return (T)((long long int)bigexp(p, e - 1) * (long long int)p); } template <class T> inline T modinverse(T a, T M) { return bigmod(a, M - 2, M); } int dx4[] = {1, 0, -1, 0}; int dy4[] = {0, 1, 0, -1}; int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}; int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1}; int nx8[] = {1, 1, -1, -1, 2, 2, -2, -2}; int ny8[] = {2, -2, 2, -2, 1, -1, 1, -1}; int month[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; int n, q, m, a[200005], b[105], c[105], d[200005], sz, q1[200005][3], t, r[105]; int main() { scanf( %d , &n); scanf( %d %d , &q, &m); for (__typeof(n) i = (1); i <= (n); i++) scanf( %d , &a[i]); for (__typeof(q) i = (1); i <= (q); i++) scanf( %d %d %d , &q1[i][0], &q1[i][1], &q1[i][2]); for (__typeof(m) i = (1); i <= (m); i++) { scanf( %d , &t); d[t] = 1; b[i] = t; } for (__typeof(n) i = (1); i <= (n); i++) if (d[i] > 0) { c[++sz] = i; r[sz] = c[sz]; } for (__typeof(1) i = (q); i >= (1); i--) { if (q1[i][0] == 1) { for (int j = 1; j <= sz; j++) { if (r[j] >= q1[i][1] && r[j] <= q1[i][2]) { r[j]--; if (r[j] < q1[i][1]) r[j] = q1[i][2]; } } } else { int l1, r1; for (int j = 1; j <= sz; j++) { if (r[j] >= q1[i][1] && r[j] <= q1[i][2]) { int mid = (q1[i][1] + q1[i][2]) / 2; if (r[j] <= mid) { l1 = r[j] - q1[i][1]; r[j] = q1[i][2] - l1; } else { l1 = q1[i][2] - r[j]; r[j] = q1[i][1] + l1; } } } } } for (__typeof(m) i = (1); i <= (m); i++) for (__typeof(sz) j = (1); j <= (sz); j++) if (b[i] == c[j]) { cout << a[r[j]] << ; break; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int big = 1e7 + 5; long long int arr[big]; void minDivsieve() { for (long long int i = 0; i <= big; ++i) arr[i] = i; for (long long int i = 2; i <= big; ++i) { if (arr[i] != i) continue; for (long long int j = i; j <= big; j += i) arr[j] = min(arr[j], i); } } long long int fac[1000001]; long long int power(long long int x, long long int y, long long int p) { long long int res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } long long int modInverse(long long int n, int p) { return power(n, p - 2, p); } long long int nCrModPFermat(unsigned long long n, long long int r, long long int p) { if (r == 0) return 1; return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) % p; } int dp[2][1048577]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int test = 1; while (test--) { int n; cin >> n; long long int arr[n]; for (int i = 0; i < n; ++i) cin >> arr[i]; long long int res = 0; long long int currxor = 0; dp[1][0] = 1; for (int i = 0; i < n; ++i) { currxor = currxor ^ arr[i]; res += dp[i % 2][currxor]; dp[i % 2][currxor] += 1; } cout << res; } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long x, y, val = 0, q[1000010]; char d[1000010]; void build(int now, int x, int y) { if (x == y) return; int mid = (x + y) / 2; build(2 * now, x, mid); build(2 * now, mid + 1, y); } int main() { build(1, 1, 1000); cin >> x >> y; while (1) { if (x == y && x > 1) { cout << Impossible ; return 0; } if (x == y && x == 1) { for (int i = 1; i <= val; i++) { cout << q[i] << d[i]; } return 0; } if (x > y) { long long k = (x - 1) / y; x -= k * y; q[++val] = k; d[val] = A ; continue; } if (x < y) { long long k = (y - 1) / x; y -= k * x; q[++val] = k; d[val] = B ; continue; } } }
|
#include <bits/stdc++.h> using namespace std; const long long N = 1e7 + 1; int32_t main() { long long n; cin >> n; if (n % 2) cout << 1; else cout << 2; }
|
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); const double EPS = 1e-6; const int INF = 0x3f3f3f3f; inline int readint() { int sum = 0; char c = getchar(); bool f = 0; while (c < 0 || c > 9 ) { if (c == - ) f = 1; c = getchar(); } while (c >= 0 && c <= 9 ) { sum = sum * 10 + c - 0 ; c = getchar(); } if (f) return -sum; return sum; } inline long long readLL() { long long sum = 0; char c = getchar(); bool f = 0; while (c < 0 || c > 9 ) { if (c == - ) f = 1; c = getchar(); } while (c >= 0 && c <= 9 ) { sum = sum * 10 + c - 0 ; c = getchar(); } if (f) return -sum; return sum; } const int maxn = 250015; long long inv[maxn], p[maxn]; void CNumberInit(int MAXNUM, long long mod) { inv[0] = inv[1] = 1; p[0] = p[1] = 1; for (int i = 2; i <= MAXNUM; i++) { inv[i] = (mod - mod / i) * inv[mod % i] % mod; p[i] = p[i - 1] * i % mod; } for (int i = 2; i <= MAXNUM; i++) inv[i] = inv[i - 1] * inv[i] % mod; } long long qmod(long long a, long long b, long long c) { long long ret = 1; for (; b; b >>= 1) { if (b & 1) ret = ret * a % c; a = a * a % c; } return ret; } vector<int> megumi; long long mod; int k; long long dp[20][250005]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long n; cin >> n >> k >> mod; CNumberInit(n + 5, mod); if (n % 2) { cout << qmod(k, n, mod) << endl; } else { for (int i = 2; i <= n; i += 2) { if ((i & n) == i) megumi.push_back(i); } long long ans = 0; dp[0][n] = 1; for (int i = 1; i <= min(17, k); i++) { int tmpans = 0; for (int j = 0; j < megumi.size(); j++) { if (!dp[i - 1][megumi[j]]) continue; int Megumi = megumi[j] & (megumi[j] - 1); int step = Megumi ^ megumi[j]; for (int k = step; k <= Megumi; k += step) { if ((k & Megumi) == k) { dp[i][k] += dp[i - 1][megumi[j]] * p[megumi[j]] % mod * inv[k] % mod * inv[megumi[j] - k] % mod; dp[i][k] %= mod; } } tmpans = (tmpans + dp[i - 1][megumi[j]]) % mod; } ans += tmpans * inv[k - i] % mod; } ans = ans * p[k] % mod; ans = qmod(k, n, mod) - ans; ans = (ans % mod + mod) % mod; cout << ans << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; long long n, d; cin >> n >> d; pair<long long, long long> s[n]; deque<long long> p; long long ind, cnt = 1; for (long long i = 0; i < n; i++) { cin >> s[i].first; s[i].second = i; } for (long long i = 0; i < n; i++) { long long tmp; cin >> tmp; p.push_back(tmp); } s[d - 1].first += p[0]; long long num = s[d - 1].first; p.pop_front(); for (long long i = 0; i < n; i++) { if (s[i].second != d - 1 && s[i].first + p[p.size() - 1] <= num) { s[i].first += p[p.size() - 1]; p.pop_back(); } else if (s[i].second != d - 1) { s[i].first += p[0]; p.pop_front(); } } sort(s, s + n); for (long long i = n - 1; s[i].second != d - 1; i--) { if (s[i].first != num) { cnt++; } } cout << cnt; }
|
#include <bits/stdc++.h> using namespace std; signed main() { long long n; cin >> n; long long p[n + 1]; p[1] = -1; for (long long i = 2; i <= n; i++) cin >> p[i]; vector<long long> ans; long long x = n; while (p[x] != -1) { ans.push_back(p[x]); x = p[x]; } reverse(ans.begin(), ans.end()); for (long long i : ans) cout << i << ; cout << n << endl; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; while (scanf( %d , &n) != EOF) { if (n & 1) { int d = (n - 1) / 2; printf( %d n , d * 2 + d * d - d); for (int i = 2; i < n; i += 2) { for (int j = 2; j < i; j += 2) { printf( 4 %d %d %d %d n , j, i, j + 1, i + 1); printf( 4 %d %d %d %d n , j, i, j + 1, i + 1); } printf( 3 1 %d %d n , i, i + 1); printf( 3 1 %d %d n , i, i + 1); } } else { int d = (n - 2) / 2; printf( %d n , 4 + (d - 1) * 3 + d * d - d); printf( 3 1 2 3 n ); printf( 3 1 2 4 n ); printf( 3 3 4 1 n ); printf( 3 3 4 2 n ); for (int i = 5; i < n; i += 2) { for (int j = 1; j < i - 2; j += 2) { printf( 4 %d %d %d %d n , j, i, j + 1, i + 1); printf( 4 %d %d %d %d n , j, i, j + 1, i + 1); } printf( 4 %d %d %d %d n , i - 2, i, i - 1, i + 1); printf( 3 %d %d %d n , i - 2, i, i + 1); printf( 3 %d %d %d n , i - 1, i, i + 1); } } } return 0; }
|
#include <bits/stdc++.h> #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; const long long int maxN = 5005; long long int n; vector<long long int> a, coords, keys; long long int cnt[maxN]; long long int getKey(long long int x) { if (x == 0) return 0; vector<long long int> ans; if (x < 0) ans.push_back(-1); x = abs(x); for (long long int i = 2; i * i <= x; i++) { if (x % i == 0) { long long int cnt = 0; while (x % i == 0) { cnt++; x /= i; } if (cnt % 2 == 1) ans.push_back(i); } } if (x > 1) ans.push_back(x); long long int res = 1; for (auto i : ans) res *= i; return res; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; a.resize(n); keys.resize(n); for (long long int i = 0; i < n; i++) cin >> a[i]; for (long long int i = 0; i < n; i++) { long long int key = getKey(a[i]); keys[i] = key; coords.push_back(key); } sort(coords.begin(), coords.end()); coords.erase(unique(coords.begin(), coords.end()), coords.end()); for (long long int i = 0; i < n; i++) keys[i] = (lower_bound(coords.begin(), coords.end(), keys[i]) - coords.begin()); vector<long long int> ans(n + 1, 0); for (long long int i = 0; i < n; i++) { for (long long int j = 0; j < maxN; j++) cnt[j] = 0; long long int cntZ = 0, cntD = 0; for (long long int j = i; j < n; j++) { long long int key = keys[j]; if (coords[key] == 0) cntZ++; else { cnt[key]++; if (cnt[key] == 1) cntD++; } if (cntD > 0) ans[cntD]++; else ans[cntZ > 0]++; } } for (long long int i = 1; i <= n; i++) cout << ans[i] << ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int h[5005], pref[5005], dp[5005]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &h[i]); pref[i] = pref[i - 1] + h[i]; for (int j = i - 1; j >= 0; j--) { if (pref[i] - pref[j] >= h[j]) { dp[i] = dp[j] + i - j - 1; h[i] = pref[i] - pref[j]; break; } } } printf( %d n , dp[n]); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 12; const int M = 305; const int INF = 1e9; int n; int a[N][N]; pair<int, int> pos[N * N]; pair<int, int> dist[M][M]; pair<int, int> operator+(const pair<int, int> &a, const pair<int, int> &b) { return make_pair(a.first + b.first, a.second + b.second); } int dx[] = {-2, -1, 1, 2, 2, 1, -1, -2}; int dy[] = {1, 2, 2, 1, -1, -2, -2, -1}; bool in(int first, int second) { return (0 <= first && first < n && 0 <= second && second < n); } int get(int first, int second, int p) { return first * n * 3 + second * 3 + p; } pair<int, int> dp[N * N][3]; int main() { scanf( %d , &n); for (int i = 0; i < int(n); i++) for (int j = 0; j < int(n); j++) { scanf( %d , &a[i][j]); --a[i][j]; pos[a[i][j]] = make_pair(i, j); } for (int i = 0; i < int(M); i++) for (int j = 0; j < int(M); j++) dist[i][j] = make_pair(INF, INF); for (int i = 0; i < int(M); i++) dist[i][i] = make_pair(0, 0); for (int first = 0; first < int(n); first++) for (int second = 0; second < int(n); second++) { for (int i = 0; i < int(8); i++) { int nx = first + dx[i]; int ny = second + dy[i]; if (in(nx, ny)) dist[get(first, second, 0)][get(nx, ny, 0)] = make_pair(1, 0); } for (int i = -n + 1; i <= n - 1; ++i) { int nx = first + i; int ny = second + i; if (in(nx, ny)) dist[get(first, second, 1)][get(nx, ny, 1)] = make_pair(1, 0); ny = second - i; if (in(nx, ny)) dist[get(first, second, 1)][get(nx, ny, 1)] = make_pair(1, 0); } for (int i = 0; i < int(n); i++) { int nx = first; int ny = i; dist[get(first, second, 2)][get(nx, ny, 2)] = make_pair(1, 0); nx = i; ny = second; dist[get(first, second, 2)][get(nx, ny, 2)] = make_pair(1, 0); } for (int i = 0; i < int(3); i++) for (int j = 0; j < int(3); j++) { if (i != j) { dist[get(first, second, i)][get(first, second, j)] = make_pair(1, 1); } } } for (int k = 0; k < int(M); k++) for (int i = 0; i < int(M); i++) for (int j = 0; j < int(M); j++) dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]); for (int i = 0; i < int(N * N); i++) for (int j = 0; j < int(3); j++) dp[i][j] = make_pair(INF, INF); dp[0][0] = dp[0][1] = dp[0][2] = make_pair(0, 0); for (int i = 0; i < int(n * n - 1); i++) for (int j = 0; j < int(3); j++) for (int k = 0; k < int(3); k++) dp[i + 1][k] = min(dp[i + 1][k], dp[i][j] + dist[get(pos[i].first, pos[i].second, j)] [get(pos[i + 1].first, pos[i + 1].second, k)]); pair<int, int> ans = make_pair(INF, INF); ans = min(ans, dp[n * n - 1][0]); ans = min(ans, dp[n * n - 1][1]); ans = min(ans, dp[n * n - 1][2]); printf( %d %d n , ans.first, ans.second); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 100005; long long a[N], sum[N]; long long int gcd(long long int a, long long int b) { if (a == 0) return b; return gcd(b % a, a); } int main() { int n; scanf( %d , &n); int i; long long ans = 0; for (i = 1; i <= n; i++) { scanf( %I64d , &a[i]); ans = ans + a[i]; } sort(a + 1, a + n + 1); for (i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i]; for (i = 1; i <= n; i++) { int l = 1, r = n; int idx = -1; while (l <= r) { int mid = (l + r) / 2; if (a[mid] <= a[i]) { l = mid + 1; idx = mid; } else r = mid - 1; } ans = ans + (idx)*1LL * a[i] - sum[idx] + sum[n] - sum[idx] - (n - idx) * 1LL * a[i]; } long long g = gcd(ans, 1LL * n); ans = ans / g; n = n / g; printf( %I64d %d n , ans, n); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long MAXN = 3e5 + 5; long long a[MAXN], kkorz[MAXN], bit[MAXN]; long long n; long long sum(long long idx) { long long res = 0; for (; idx > 0; idx -= (idx & (-idx))) res += bit[idx]; return res; } void upd(long long idx, long long x) { for (; idx <= n; idx += (idx & (-idx))) bit[idx] += x; } long long countInv() { vector<pair<long long, long long>> v; for (long long i = 0; i < n; i++) v.push_back(make_pair(kkorz[i], i)); sort(v.begin(), v.end()); for (long long i = 0; i < n; i++) kkorz[v[i].second] = i + 1; long long res = 0; for (long long i = 1; i <= n; i++) bit[i] = 0; for (long long i = n - 1; i >= 0; i--) { res += sum(kkorz[i] - 1); upd(kkorz[i], 1); } return res; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; for (long long i = 0; i < n; i++) cin >> a[i]; long long maxbit = 32 - __builtin_clz(*max_element(a, a + n)); for (long long i = 0; i < n; i++) kkorz[i] = a[i]; long long ans = countInv(), minx = 0, x = 0; for (long long b = 0; b <= maxbit; b++) { long long tmp = x | (1 << b); for (long long i = 0; i < n; i++) kkorz[i] = a[i] ^ tmp; long long i1 = countInv(); if (i1 < ans) { x |= (1 << b); ans = i1; minx = x; } } cout << ans << << minx << n ; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 7; const int inf = INT_MAX; const long long inff = 1e18; const long long mod = 1e9 + 7; vector<int> dx = {0, 1, 1, 1, 0, -1, -1, -1}; vector<int> dy = {1, 1, 0, -1, -1, -1, 0, 1}; int can[507][507]; set<pair<int, int> > second[32][9]; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); int n; int a[35]; cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int j = 250; j <= 250 + a[1] - 1; j++) can[250][j] = 1; second[1][0].insert(make_pair(250, 250 + a[1] - 1)); for (int i = 1; i < n; i++) { for (int j = 0; j < 8; j++) { for (pair<int, int> k : second[i][j]) { for (int l = 1; l <= a[i + 1]; l++) { can[k.first + dx[(j + 1) % 8] * l][k.second + dy[(j + 1) % 8] * l] = 1; can[k.first + dx[(j + 7) % 8] * l][k.second + dy[(j + 7) % 8] * l] = 1; } second[i + 1][(j + 1) % 8].insert( make_pair(k.first + dx[(j + 1) % 8] * a[i + 1], k.second + dy[(j + 1) % 8] * a[i + 1])); second[i + 1][(j + 7) % 8].insert( make_pair(k.first + dx[(j + 7) % 8] * a[i + 1], k.second + dy[(j + 7) % 8] * a[i + 1])); } } } int ans = 0; for (int i = 0; i <= 500; i++) for (int j = 0; j <= 500; j++) ans += can[i][j]; cout << ans << n ; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, m, a[55], b[55], ans[5000] = {}, k = 0; cin >> n; for (int i = 0; i < n; ++i) cin >> a[i]; cin >> m; for (int i = 0; i < m; ++i) cin >> b[i]; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { if (b[j] % a[i] == 0) { ans[k] = b[j] / a[i]; k++; } } } sort(ans, ans + k); int c = 0; for (int i = k - 1; i >= 0; --i) if (ans[i] == ans[k - 1]) c++; cout << c; return 0; }
|
#include <bits/stdc++.h> using namespace std; int a[100005], n; int main() { while (cin >> n) { for (int i = 1; i <= n; i++) { cin >> a[i]; while (a[i] % 2 == 0) a[i] /= 2; while (a[i] % 3 == 0) a[i] /= 3; } int i; for (i = 2; i <= n; i++) if (a[i] != a[1]) break; if (i > n) cout << YES n ; else cout << NO n ; } return 0; }
|
#include <bits/stdc++.h> #pragma GCC target( avx2 ) #pragma GCC optimization( O3 ) #pragma GCC optimization( unroll-loops ) using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t, n, m, i, j, k, sum, cnt, temp, ans; cin >> t; while (t--) { long long n; cin >> n; if (n % 3 == 0) { cout << n / 3 << << n / 3 << n ; } else if (n % 3 == 1) { cout << n / 3 + 1 << << n / 3 << n ; } else { cout << n / 3 << << n / 3 + 1 << n ; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m; int a[15], b[15]; int cnt[15]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> a[i]; } for (int i = 1; i <= m; i++) { int k; cin >> k; cnt[k] = 1; } vector<int> ans; for (int i = 1; i <= n; i++) { if (cnt[a[i]] == 1) { ans.push_back(a[i]); } } for (auto e : ans) cout << e << ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int read() { char ch; int sig = 1; for (ch = getchar(); ch < 0 || ch > 9 ; ch = getchar()) if (ch == - ) sig = -1; int x = ch - 0 ; for (ch = getchar(); ch >= 0 && ch <= 9 ; ch = getchar()) x = x * 10 + ch - 0 ; return x * sig; } const int N = 1e6 + 5; const long long Mo = 1e9 + 7; struct P { long long x, y; P(long long _x = 0, long long _y = 0) { x = _x; y = _y; } friend P operator+(P a, P b) { return P(a.x + b.x, a.y + b.y); } friend P operator-(P a, P b) { return P(a.x - b.x, a.y - b.y); } friend long long operator^(P a, P b) { return a.x * b.y - a.y * b.x; } } p[N]; int n; long long S, sq[N], sx[N], sy[N]; int main() { n = read(); for (int i = 1; i <= n; i++) p[i].x = read(), p[i].y = read(); for (int i = 1; i <= n; i++) p[i + n] = p[i]; for (int i = 1; i <= n; i++) S += p[i + 1] ^ p[i]; long long ans = 0, sum = 0; for (int i = 1; i <= n * 2; i++) { (sum += p[i] ^ (p[i - 1])) %= Mo; sq[i] = (sq[i - 1] + sum) % Mo; sx[i] = (sx[i - 1] + p[i].x) % Mo; sy[i] = (sy[i - 1] + p[i].y) % Mo; } long long ns = S % Mo; int pos = 3; sum = 0; for (int i = 2; i <= pos; i++) sum += p[i] ^ p[i - 1]; long long now = 0; for (int i = 1; i <= n; i++) { (now += p[i + 1] ^ p[i]) %= Mo; sum -= p[i + 1] ^ p[i]; if (pos < i + 2) pos++, sum += p[pos] ^ p[pos - 1]; while (pos <= i + n - 2) { long long ar = sum; ar -= p[i] ^ p[i + 1]; ar += p[i] ^ p[pos]; if (ar < S - ar) pos++, sum += p[pos] ^ p[pos - 1]; else break; } int ls = i + 2, rs = pos - 1; long long dx = (sx[rs] - sx[ls - 1]) % Mo, dy = (sy[rs] - sy[ls - 1]) % Mo; if (ls <= rs) { (ans += ns * (rs - ls + 1) % Mo) %= Mo; (ans -= (sq[rs] - sq[ls - 1]) % Mo * 2 % Mo) %= Mo; (ans += now * 2 % Mo * (rs - ls + 1) % Mo) %= Mo; (ans += (p[i] ^ p[i + 1]) % Mo * (rs - ls + 1) % Mo * 2 % Mo) %= Mo; (ans -= (p[i] ^ P(dx, dy)) % Mo * 2 % Mo) %= Mo; } ls = pos, rs = i + n - 2, dx = (sx[rs] - sx[ls - 1]) % Mo, dy = (sy[rs] - sy[ls - 1]) % Mo; if (ls <= rs) { (ans -= ns * (rs - ls + 1) % Mo) %= Mo; (ans += (sq[rs] - sq[ls - 1]) % Mo * 2 % Mo) %= Mo; (ans -= now * 2 % Mo * (rs - ls + 1) % Mo) %= Mo; (ans -= (p[i] ^ p[i + 1]) % Mo * (rs - ls + 1) % Mo * 2 % Mo) %= Mo; (ans += (p[i] ^ P(dx, dy)) % Mo * 2 % Mo) %= Mo; } } ans = ans * (Mo + 1) / 2 % Mo; printf( %lld n , (ans + Mo) % Mo); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { char str[8][10]; int n, k, i, j, l, mx, mn, mind; int p[] = {1, 2, 3, 4, 5, 6, 7, 8}; cin >> n >> k; for (i = 0; i < n; i++) cin >> str[i]; mx = 0; mn = 1000000000; mind = mn - mx; do { int arr[8] = {0}; mx = 0; mn = 1000000000; for (i = 0; i < n; i++) { for (j = 0; j < k; j++) { arr[i] *= 10; arr[i] += (int)(str[i][p[j] - 1] - 0 ); } if (arr[i] > mx) mx = arr[i]; if (arr[i] < mn) mn = arr[i]; } mind = min(mind, (mx - mn)); } while (std::next_permutation(p, p + k)); cout << mind << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int a; cin >> a; string s; cin >> s; map<int, int> Freq; for (int i = 0; i < s.size(); i++) { int sum = 0; bool zero = false; for (int j = i; j < s.size(); j++) { sum += (s[j] - 0 ); Freq[sum]++; } } long long ans = 0; if (a == 0) { for (int i = 0; i < s.size(); i++) { int sum = 0; for (int j = i; j < s.size(); j++) { sum += s[j] - 0 ; if (sum == 0) ans += (s.size() * (s.size() + 1)) / 2; else ans += Freq[0]; } } cout << ans; return 0; } for (auto &x : Freq) { if (x.first && a % x.first == 0) ans += (long long)Freq[a / x.first] * x.second; } cout << ans; return 0; }
|
#include <bits/stdc++.h> typedef struct { double x; double y; double r; } circle; typedef struct { double x; double y; } pt; int x[3]; int y[3]; int r[3]; pt np(double x, double y) { pt q; q.x = x; q.y = y; return q; } double abs_d(double d1) { if (d1 > 0) return d1; return -d1; } bool flag2 = true; pt p; double dist(pt p1, pt p2) { return sqrt((p1.x - p2.x) * (p1.x - p2.x) + (p1.y - p2.y) * (p1.y - p2.y)); } void circumcenter(pt p1, pt p2, pt p3) { double K = abs_d(.5 * (p1.x * p2.y + p2.x * p3.y + p3.x * p1.y - p1.y * p2.x - p2.y * p3.x - p3.y * p1.x)); if (K < .01) { flag2 = false; return; } double a = dist(p1, p2); double b = dist(p1, p3); double c = dist(p2, p3); double R = a * b * c / 4 / K; double d = sqrt(R * R - (a / 2) * (a / 2)); double nx = (p1.x + p2.x) / 2; double ny = (p1.y + p2.y) / 2; double mx = p1.y - p2.y; double my = p2.x - p1.x; double len = sqrt(mx * mx + my * my); mx /= len; my /= len; p.x = nx + d * mx; p.y = ny + d * my; if (abs_d(dist(p, p3) - R) > .001) { p.x = nx - d * mx; p.y = ny - d * my; } } bool flag = true; pt pos1; pt pos2; void intersection(circle c1, circle c2) { pt p; p.x = -1e9; p.y = -1e9; double d = sqrt((c1.x - c2.x) * (c1.x - c2.x) + (c1.y - c2.y) * (c1.y - c2.y)); if (d > c1.r + c2.r) flag = false; if (abs_d(c1.r - c2.r) > d) flag = false; if (flag == false) return; double a = d; double b = c1.r; double c = c2.r; double s = (a + b + c) / 2; double K = sqrt(s * (s - a) * (s - b) * (s - c)); double h = 2 * K / a; double d_par = sqrt(b * b - h * h); if (b * b + d * d < c * c) d_par = -d_par; double nx = c1.x + (c2.x - c1.x) * d_par / d; double ny = c1.y + (c2.y - c1.y) * d_par / d; double oppx = c2.y - c1.y; double oppy = c1.x - c2.x; double len = sqrt(oppx * oppx + oppy * oppy); oppx /= len; oppy /= len; pos1.x = nx + h * oppx; pos1.y = ny + h * oppy; pos2.x = nx - h * oppx; pos2.y = ny - h * oppy; } int main() { for (int i = 0; i < 3; i++) { scanf( %d %d %d , &x[i], &y[i], &r[i]); } pt p1 = np(x[0], y[0]); pt p2 = np(x[1], y[1]); pt p3 = np(x[2], y[2]); if (r[0] == r[1] && r[1] == r[2]) { circumcenter(p1, p2, p3); if (flag2) { printf( %.5f %.5f , p.x, p.y); } } else { circle c1, c2, c3; if (r[0] != r[1]) { double x1 = (r[1] * p1.x + r[0] * p2.x) / (r[1] + r[0]); double y1 = (r[1] * p1.y + r[0] * p2.y) / (r[1] + r[0]); double x2 = (r[1] * p1.x - r[0] * p2.x) / (r[1] - r[0]); double y2 = (r[1] * p1.y - r[0] * p2.y) / (r[1] - r[0]); c1.x = (x1 + x2) / 2; c1.y = (y1 + y2) / 2; c1.r = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)) / 2; } if (r[0] != r[2]) { double x1 = (r[2] * p1.x + r[0] * p3.x) / (r[2] + r[0]); double y1 = (r[2] * p1.y + r[0] * p3.y) / (r[2] + r[0]); double x2 = (r[2] * p1.x - r[0] * p3.x) / (r[2] - r[0]); double y2 = (r[2] * p1.y - r[0] * p3.y) / (r[2] - r[0]); c2.x = (x1 + x2) / 2; c2.y = (y1 + y2) / 2; c2.r = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)) / 2; } if (r[1] != r[2]) { double x1 = (r[2] * p2.x + r[1] * p3.x) / (r[2] + r[1]); double y1 = (r[2] * p2.y + r[1] * p3.y) / (r[2] + r[1]); double x2 = (r[2] * p2.x - r[1] * p3.x) / (r[2] - r[1]); double y2 = (r[2] * p2.y - r[1] * p3.y) / (r[2] - r[1]); c3.x = (x1 + x2) / 2; c3.y = (y1 + y2) / 2; c3.r = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)) / 2; } if (r[0] == r[1]) { intersection(c2, c3); } else if (r[0] == r[2]) { intersection(c1, c3); } else { intersection(c1, c2); } if (flag) { if (dist(pos1, p1) > dist(pos2, p1)) { printf( %.5f %.5f , pos2.x, pos2.y); } else { printf( %.5f %.5f , pos1.x, pos1.y); } } } fflush(stdin); getchar(); }
|
#include <bits/stdc++.h> using namespace std; long long pf(int v) { return (long long)1 * v * v; } struct sd { int a, b; bool operator<(const sd& w) const { return a < w.a; } } x[100005]; long long maxx(long long a, long long b) { return a > b ? a : b; } long long minx(long long a, long long b) { return a < b ? a : b; } int n, fr[2][100005], ba[2][100005]; long long ans = 1e18; bool jud(long long v) { int mid = sqrt(v); for (int i = 1; i <= n; i++) { if (x[i].a > 0) break; int l = 1, r = n, R = minx(mid + x[i].a, -x[i].a); while (l < r) { int mid = ((l + r) >> 1) + 1; if (x[mid].a <= R) l = mid; else r = mid - 1; } if (i == 1 && l == n) return 1; int ymin = minx(fr[0][i], ba[0][l]), ymax = maxx(fr[1][i], ba[1][l]); if (maxx(maxx(pf(ymax), pf(ymin)) + pf(x[i].a), pf(ymax - ymin)) <= v) return 1; } return 0; } void work() { sort(x + 1, x + 1 + n); fr[0][1] = 1e9; fr[1][1] = -1e9; ba[0][n] = 1e9; ba[1][n] = -1e9; for (int i = 2; i <= n; i++) fr[0][i] = minx(fr[0][i - 1], x[i - 1].b), fr[1][i] = maxx(fr[1][i - 1], x[i - 1].b); for (int i = n - 1; i >= 1; i--) ba[0][i] = minx(ba[0][i + 1], x[i + 1].b), ba[1][i] = maxx(ba[1][i + 1], x[i + 1].b); long long l = 0, r = 1e18; while (l < r) { long long mid = (l + r) / 2; if (jud(mid)) r = mid; else l = mid + 1; } ans = minx(ans, l); } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d%d , &x[i].a, &x[i].b); work(); for (int i = 1; i <= n; i++) x[i].a *= -1; work(); int ymax = -1e9, ymin = 1e9; for (int i = 1; i <= n; i++) ymax = maxx(ymax, x[i].b), ymin = minx(ymin, x[i].b); ans = minx(ans, pf(ymax - ymin)); cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long long int x1, x2, y1, y2; long long int k; cin >> x1 >> y1 >> x2 >> y2; if (x1 == x2 || y1 == y2) k = abs(x1 - x2) + abs(y1 - y2); else k = 2 + abs(x1 - x2) + abs(y1 - y2); cout << k << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int N; string S[100001]; int cnt[26]; int from[26]; int find(int ind, char C) { for (int i = 0; i < S[ind].length(); i++) if (S[ind][i] == C) return i; return -1; } void merge(int I, int J, char C) { int indI = find(I, C); int indJ = find(J, C); int lenI = S[I].length() - indI; int lenJ = S[J].length() - indJ; int L = min(lenI, lenJ); if (min(indI, indJ) > 0 || S[I].substr(indI, L) != S[J].substr(indJ, L)) { cout << NO << n ; exit(0); } string s; if (indI > indJ) { s = S[I]; if (indJ + L < (int)S[J].length()) s += S[J].substr(indJ + L, (int)S[J].length() - (indJ + L)); } else { s = S[J]; if (indI + L < (int)S[I].length()) s += S[I].substr(indI + L, (int)S[I].length() - (indI + L)); } S[J] = s; S[I] = ! ; } int main() { cin >> N; for (int i = 0; i < N; i++) { cin >> S[i]; for (int j = 0; j < 26; j++) cnt[j] = 0; for (int j = 0; j < S[i].length(); j++) cnt[S[i][j] - a ]++; for (int j = 0; j < 26; j++) if (cnt[j] > 1) { cout << NO << n ; return 0; } } for (int i = 0; i < 26; i++) from[i] = -1; for (int i = 0; i < N; i++) { for (int j = 0; j < S[i].length(); j++) { if (from[S[i][j] - a ] == -1) from[S[i][j] - a ] = i; else if (from[S[i][j] - a ] != i) { merge(from[S[i][j] - a ], i, S[i][j]); int temp = from[S[i][j] - a ]; for (int k = 0; k < 26; k++) if (from[k] == temp) from[k] = i; } } } vector<string> v; for (int i = 0; i < N; i++) if (S[i] != ! ) v.push_back(S[i]); sort(v.begin(), v.end()); string ans = ; for (auto s : v) ans += s; for (int i = 0; i < 26; i++) cnt[i] = 0; for (int i = 0; i < ans.length(); i++) cnt[ans[i] - a ]++; for (int i = 0; i < 26; i++) if (cnt[i] > 1) { cout << NO << n ; return 0; } cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int vis[400000], cur, path[500000], block[500000], x, y, n, m, q, k, s, t, seen[400010], ans[400010]; vector<int> g[4000]; map<pair<int, int>, vector<pair<int, int> > > M; void color(int x) { if (block[x]) return; block[x] = 1; for (int i = 0; i < g[x].size(); i++) color(g[x][i]); } void dfs(int x, int dep) { if (vis[x]) { int now = dep - 1; while (path[now] != x && now > 0) color(path[now--]); color(path[now]); } if (seen[x]) return; path[dep] = x; vis[x] = seen[x] = 1; if (M.find(make_pair(cur, x)) != M.end()) { if (!block[x]) { vector<pair<int, int> > tmp = M[make_pair(cur, x)]; for (int i = 0; i < tmp.size(); i++) if (tmp[i].first <= dep) ans[tmp[i].second] = path[tmp[i].first]; } } for (int i = 0; i < g[x].size(); i++) dfs(g[x][i], dep + 1); vis[x] = 0; } int main() { scanf( %d%d%d , &n, &m, &q); for (int i = 1; i <= m; i++) { scanf( %d%d , &x, &y); g[x].push_back(y); } for (int i = 1; i <= n; i++) sort(g[i].begin(), g[i].end()); for (int i = 1; i <= q; i++) { scanf( %d%d%d , &s, &t, &k); M[make_pair(s, t)].push_back(make_pair(k, i)); } memset(ans, 0xff, sizeof(ans)); for (int i = 1; i <= n; i++) { cur = i; memset(seen, 0, sizeof(seen)); memset(block, 0, sizeof(block)); dfs(i, 1); } for (int i = 1; i <= q; i++) printf( %d n , ans[i]); return 0; }
|
#include <bits/stdc++.h> using namespace std; set<int> in[100005]; pair<int, int> id[100005]; int bit[100005]; int lastNum[100005]; int color[100005]; void solve() { int n, m; scanf( %d %d , &n, &m); long long sum = 0; for (int i = 1; i <= n; ++i) { int num; scanf( %d , &num); sum += num; while (num--) { int x; scanf( %d , &x); in[i].insert(x); } id[i] = {in[i].size(), i}; } int x = sum / n; int lim = (n - sum % n); int t = 0; for (int i = 1; i <= n; ++i) { if (i <= lim) { lastNum[i] = x; } else { lastNum[i] = x + 1; } t += lastNum[i]; } assert(t == sum); sort(id + 1, id + n + 1); int l = 1, r = n; vector<pair<pair<int, int>, int> > out; bool lin = false, rin = false; set<int> swapNums; while (l < r) { int lid = id[l].second; int rid = id[r].second; if (in[lid].size() == lastNum[l]) { if (lin) { for (int x : in[lid]) { assert(color[x] & 1); color[x] ^= 1; if (color[x] == 2) { assert(!swapNums.count(x)); swapNums.insert(x); } } } ++l; lin = false; continue; } if (in[rid].size() == lastNum[r]) { if (rin) { for (int x : in[rid]) { assert(color[x] & 2); if (color[x] == 2) { assert(swapNums.count(x)); swapNums.erase(x); } color[x] ^= 2; } } --r; rin = false; continue; } if (!lin) { for (int x : in[lid]) { color[x] |= 1; if (color[x] == 3) { assert(swapNums.count(x)); swapNums.erase(x); } } lin = true; } if (!rin) { for (int x : in[rid]) { color[x] |= 2; if (color[x] == 2) { assert(!swapNums.count(x)); swapNums.insert(x); } } rin = true; } assert(in[lid].size() < lastNum[l]); assert(in[rid].size() > lastNum[r]); while (in[lid].size() != lastNum[l] && in[rid].size() != lastNum[r]) { assert(swapNums.size() > 0); int g = *swapNums.begin(); swapNums.erase(g); in[lid].insert(g); in[rid].erase(g); out.push_back({{rid, lid}, g}); color[g] = 1; } } printf( %d n , out.size()); for (pair<pair<int, int>, int> tmp : out) { printf( %d %d %d n , tmp.first.first, tmp.first.second, tmp.second); } } int main() { solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { queue<int> left; queue<int> right; int n; cin >> n; char x; for (int i = 0; i < n; ++i) { cin >> x; if (x == D ) left.push(i); else right.push(i); } while (!left.empty() && !right.empty()) { if (left.front() < right.front()) left.push(left.front() + n); else right.push(right.front() + n); right.pop(); left.pop(); } if (left.empty()) cout << R ; else cout << D ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int a, b, cnt = 0, sum = 0, i, j, hand, flag = 0, c, n, m, k, t, res, maxy = 0, miny = 12345678910; cin >> n; string str; getline(cin, str); int len = str.size(); if (str[len - 1] == k ) { if (n == 5 || n == 6) printf( 53 n ); else printf( 52 ); } else if (str[len - 1] == h ) { if (n == 30) printf( 11 ); else if (n < 30) printf( 12 ); else printf( 7 ); } }
|
#include <bits/stdc++.h> const long long INF = LLONG_MAX; const long long NINF = LLONG_MIN; const long long MAX = 1e6 + 5; const long long MOD = 1e9 + 7; using namespace std; inline long long gcd(long long a, long long b) { long long t; if (a < b) { t = a; a = b; b = t; } while (b != 0) { t = a; a = b; b = t % b; } return a; } inline long long mpow(long long a, long long b) { long long ans = 1; while (b != 0) { if (b & 1) { ans = ans * a; } a = a * a; b >>= 1; } return ans; } inline long long mlog2(long long n) { long long c = 0; c += 64 - __builtin_clzll(n); if (__builtin_popcountll(n) == 1) { c--; } return c; } void troll() { long long qwe[100000]; for (long long i = 0; i < 1; i++) ; } long long ass[MAX]; long long ssa[MAX]; int main() { troll(); string str1, str2; cin >> str1 >> str2; long long count = 0; for (long long i = 0; i < str1.size();) { long long flag = 1; if (str1[i] == str2[0]) { long long j = 1; for (j = 1; j < str2.size(); j++) { if (str2[j] != str1[i + j]) { flag = 0; break; } } if (!flag) { flag = 1; i++; } else { i += j; count++; } } else { i++; } } troll(); cout << count << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } int main() { long long t, w, b; cin >> t >> w >> b; long long cas = t / (w / gcd(w, b)) / b; long long exa = t - w / gcd(w, b) * b * cas; long long minimum = min(w, b); long long res = minimum * cas + min(minimum, exa + 1) - 1; long long divition = gcd(res, t); res /= divition; t /= divition; cout << res << / << t << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn(5e5 + 5); const long long inf(1e18); struct Qry { int l, r, id; }; int n, q, dfn[maxn], idx, ed[maxn]; long long mn[maxn << 2], tag[maxn << 2], ans[maxn]; vector<pair<int, int> > edge[maxn]; vector<Qry> qry[maxn]; void Update(int x, int l, int r, int p, long long v) { if (l == r) mn[x] = v + tag[x]; else { int mid = (l + r) >> 1; p <= mid ? Update(x << 1, l, mid, p, v) : Update(x << 1 | 1, mid + 1, r, p, v); mn[x] = min(mn[x << 1], mn[x << 1 | 1]) + tag[x]; } } void Modify(int x, int l, int r, int ql, int qr, long long v) { if (ql <= l && qr >= r) tag[x] += v, mn[x] += v; else { int mid = (l + r) >> 1; if (ql <= mid) Modify(x << 1, l, mid, ql, qr, v); if (qr > mid) Modify(x << 1 | 1, mid + 1, r, ql, qr, v); mn[x] = min(mn[x << 1], mn[x << 1 | 1]) + tag[x]; } } long long Query(int x, int l, int r, int ql, int qr) { if (ql <= l && qr >= r) return mn[x]; int mid = (l + r) >> 1; long long ret = inf; if (ql <= mid) ret = Query(x << 1, l, mid, ql, qr); if (qr > mid) ret = min(ret, Query(x << 1 | 1, mid + 1, r, ql, qr)); return ret + tag[x]; } void Dfs1(int u, long long d) { dfn[u] = ++idx; if (!edge[u].size()) Update(1, 1, n, idx, d); for (auto v : edge[u]) Dfs1(v.first, d + v.second); ed[u] = idx; } void Dfs2(int u) { for (auto ques : qry[u]) ans[ques.id] = Query(1, 1, n, ques.l, ques.r); for (auto v : edge[u]) { Modify(1, 1, n, 1, n, v.second); Modify(1, 1, n, dfn[v.first], ed[v.first], -(v.second << 1)); Dfs2(v.first); Modify(1, 1, n, dfn[v.first], ed[v.first], v.second << 1); Modify(1, 1, n, 1, n, -v.second); } } int main() { memset(mn, 63, sizeof(mn)); int p, w, i, l, r; scanf( %d%d , &n, &q); for (i = 2; i <= n; ++i) { scanf( %d%d , &p, &w); edge[p].push_back(make_pair(i, w)); } for (i = 1; i <= q; ++i) { scanf( %d%d%d , &p, &l, &r); qry[p].push_back((Qry){l, r, i}); } Dfs1(1, 0), Dfs2(1); for (i = 1; i <= q; ++i) printf( %lld n , ans[i]); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 100005; const int M = 10000005; const int mo = 1000000007; int pri[M / 10], mn[M], id[M]; vector<int> e[N]; int n, T, Q, dfn[N], ed[N]; int fa[N][20], dep[N]; int qx[N], qy[N], qL[N], qv[N]; int t[N * 2], vis[N], A[N], ans[N]; vector<int> vec[M / 10]; pair<int, int> q1[N], q2[N]; int power(int x, int y) { int s = 1; for (; y; y /= 2, x = 1ll * x * x % mo) if (y & 1) s = 1ll * s * x % mo; return s; } void change(int x, int v) { for (; x <= 2 * n; x += x & (-x)) t[x] += v; } int ask(int x) { int ans = 0; for (; x; x -= x & (-x)) ans += t[x]; return ans; } void init() { for (int i = (int)(2); i <= (int)(M - 1); i++) { if (!mn[i]) mn[i] = i, pri[++*pri] = i; for (int j = 1; j <= *pri && i * pri[j] < M; ++j) { mn[i * pri[j]] = pri[j]; if (i % pri[j] == 0) break; } } for (int i = (int)(1); i <= (int)(*pri); i++) id[pri[i]] = i; } void insert(int x, int id) { for (; x != 1;) { int v = mn[x]; for (; x % v == 0; x /= v) ; vec[::id[v]].push_back(id); } } void dfs(int x) { dfn[x] = ++*dfn; for (auto i : e[x]) if (i != fa[x][0]) { fa[i][0] = x; dep[i] = dep[x] + 1; dfs(i); } ed[x] = ++*dfn; } int LCA(int x, int y) { if (dep[x] < dep[y]) swap(x, y); int tmp = dep[x] - dep[y]; for (int i = (int)(0); i <= (int)(18); i++) if (tmp & (1 << i)) x = fa[x][i]; for (int i = (int)(18); i >= (int)(0); i--) if (fa[x][i] != fa[y][i]) x = fa[x][i], y = fa[y][i]; return x == y ? x : fa[x][0]; } void solve(int id) { int top1 = 0, top2 = 0; for (auto i : vec[id]) if (i < 0) q2[++top2] = pair<int, int>(-i, qv[-i]); else q1[++top1] = pair<int, int>(i, A[i]); for (; top1 && top2;) { int tmp1 = 0, tmp2 = 0; for (int i = (int)(1); i <= (int)(top1); i++) { change(dfn[q1[i].first], -1); change(ed[q1[i].first], 1); } for (int i = (int)(1); i <= (int)(top2); i++) { int at = q2[i].first; int val1 = ask(ed[qL[at]] - 1) - ask(ed[qx[at]] - 1); int val2 = ask(ed[qL[at]]) - ask(ed[qy[at]] - 1); ans[at] = 1ll * ans[at] * power(pri[id], val1 + val2) % mo; } for (int i = (int)(1); i <= (int)(top1); i++) { change(dfn[q1[i].first], 1); change(ed[q1[i].first], -1); } for (int i = (int)(1); i <= (int)(top1); i++) q1[i].second /= pri[id]; for (int i = (int)(1); i <= (int)(top2); i++) q2[i].second /= pri[id]; for (int i = (int)(1); i <= (int)(top1); i++) if (q1[i].second % pri[id] == 0) q1[++tmp1] = q1[i]; for (int i = (int)(1); i <= (int)(top2); i++) if (q2[i].second % pri[id] == 0) q2[++tmp2] = q2[i]; top1 = tmp1; top2 = tmp2; } } int main() { init(); scanf( %d , &n); for (int i = (int)(1); i <= (int)(n - 1); i++) { int x, y; scanf( %d%d , &x, &y); e[x].push_back(y); e[y].push_back(x); } dfs(1); for (int i = (int)(1); i <= (int)(18); i++) for (int j = (int)(1); j <= (int)(n); j++) fa[j][i] = fa[fa[j][i - 1]][i - 1]; for (int i = (int)(1); i <= (int)(n); i++) { scanf( %d , &A[i]); insert(A[i], i); } scanf( %d , &Q); for (int i = (int)(1); i <= (int)(Q); i++) { scanf( %d%d%d , &qx[i], &qy[i], &qv[i]); qL[i] = LCA(qx[i], qy[i]); insert(qv[i], -i); ans[i] = 1; } for (int i = (int)(1); i <= (int)(*pri); i++) solve(i); for (int i = (int)(1); i <= (int)(Q); i++) printf( %d n , ans[i]); }
|
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; long long int dp[100000 + 5] = {0}; void fun(long long int *A, long long int N) { dp[0] = 0; long long int a = 0; for (long long int i = 1; i <= 100000; ++i) { while (a < N and A[a] <= i) ++a; dp[i] = a; } } void solve() { long long int N; cin >> N; long long int A[N]; for (long long int i = 0; i < N; ++i) cin >> A[i]; sort(A, A + N); fun(A, N); long long int Q; cin >> Q; while (Q--) { long long int M; cin >> M; if (M > 100000) cout << N << n ; else cout << dp[M] << n ; } } int main(void) { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int T = 1; while (T--) { solve(); } exit(0); }
|
#include <bits/stdc++.h> const int maxn = 105; int a[maxn]; inline int max(int a, int b) { return a > b ? a : b; } int main() { int n, ans = 0, temp; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); if (n < 3 || n % 2 == 0) puts( -1 ); else { for (int i = (n - 1); i >= 1; i -= 2) { temp = max(a[i], a[i + 1]); ans += temp; a[i / 2] -= temp; if (a[i / 2] < 0) a[i / 2] = 0; } ans += a[1]; printf( %d n , ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; bool a[200087]; int main(void) { int n; cin >> n; for (int i = 0; i < n; i++) { int temp; cin >> temp; a[temp + 100000] = true; } int ans = 0; for (int i = 0; i <= 200000; i++) { if (i != 100000 && a[i] == true) { ans++; } } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; inline void Fail() { printf( 0 ); exit(0); } const int maxn = 100005; int n, l, r, mn, id, ans, from, to, cnt, clen, mxdep, mid; vector<pair<int, int> > edge[maxn]; pair<int, pair<int, int> > cur[maxn]; vector<int> beauty; int sz[maxn], u[maxn], v[maxn], c[maxn], cen[maxn][25], total[maxn][25]; bool centroid[maxn], debug; class segtree { public: pair<int, int> tree[maxn * 4]; int sz; void _init(int tot) { for (sz = 1; sz < tot; sz <<= 1) ; for (int(i) = 0; (i) < sz << 1; i++) tree[i] = make_pair(-1e9, -1); } void upd(int pos, int val, int id) { pos += sz - 1; tree[pos] = max(tree[pos], make_pair(val, id)); while (pos) { pos >>= 1; if (!pos) break; tree[pos] = max(tree[pos << 1], tree[pos << 1 | 1]); } } void clr(int pos) { pos += sz - 1; tree[pos] = make_pair(-1e9, -1); while (pos) { pos >>= 1; if (!pos) break; tree[pos] = max(tree[pos << 1], tree[pos << 1 | 1]); } } pair<int, int> qry(int l, int r) { if (r < 1) return make_pair(-1e9, -1); l = max(l, 1); r = min(r, sz); l += sz - 1; r += sz - 1; pair<int, int> res = make_pair(-1e9, -1); for (; l <= r; l >>= 1, r >>= 1) { if (l & 1) res = max(res, tree[l++]); if ((r - 1) & 1) res = max(res, tree[r--]); } return res; } } T; void get_sz(int x, int p) { sz[x] = 1; for (int(i) = 0; (i) < edge[x].size(); i++) { pair<int, int> y = edge[x][i]; if (centroid[y.first] || y.first == p) continue; get_sz(y.first, x); sz[x] += sz[y.first]; } } void get_centroid(int x, int p, int tot) { int mx = tot - sz[x]; for (int(i) = 0; (i) < edge[x].size(); i++) { pair<int, int> y = edge[x][i]; if (centroid[y.first] || y.first == p) continue; get_centroid(y.first, x, tot); mx = max(mx, sz[y.first]); } if (mx < mn) { mn = mx; id = x; } } void get_dis(int x, int p, int dep, int dis, int s) { mxdep = max(mxdep, dep); cur[clen++] = make_pair(dep, make_pair(dis, x)); pair<int, int> mx = T.qry(l - dep + 1, r - dep + 1); if (dis + mx.first > ans) { ans = dis + mx.first; from = x; to = mx.second; } for (int(i) = 0; (i) < edge[x].size(); i++) { pair<int, int> y = edge[x][i]; if (centroid[y.first] || y.first == p) continue; get_dis(y.first, x, dep + 1, dis + (y.second >= mid ? 1 : -1), s); } } void solve(int t, int dep) { int s = cen[t][dep]; if (s < 0) { mn = 1e9; get_sz(t, -1); get_centroid(t, -1, sz[t]); s = id; cen[t][dep] = s; total[t][dep] = sz[t]; } centroid[s] = true; T._init(total[t][dep] + 1); T.upd(1, 0, s); for (int(i) = 0; (i) < edge[s].size(); i++) { if (centroid[edge[s][i].first]) continue; clen = 0; get_dis(edge[s][i].first, s, 1, edge[s][i].second >= mid ? 1 : -1, s); for (int(j) = 0; (j) < clen; j++) { T.upd(cur[j].first + 1, cur[j].second.first, cur[j].second.second); } } for (int(i) = 0; (i) < edge[s].size(); i++) if (!centroid[edge[s][i].first]) solve(edge[s][i].first, dep + 1); centroid[s] = false; } void add_edge(int x, int y, int z) { edge[x].push_back(make_pair(y, z)); edge[y].push_back(make_pair(x, z)); } bool check() { ans = -1e9; solve(0, 0); return ans >= 0; } int main() { memset(cen, -1, sizeof(cen)); scanf( %d%d%d , &n, &l, &r); for (int(i) = 0; (i) < n - 1; i++) { scanf( %d%d%d , &u[i], &v[i], &c[i]); u[i]--, v[i]--; add_edge(u[i], v[i], c[i]); beauty.push_back(c[i]); } sort(beauty.begin(), beauty.end()); beauty.resize(unique(beauty.begin(), beauty.end()) - beauty.begin()); int L = 0, R = beauty.size(); while (R - L > 1) { int Mid = (L + R) >> 1; mid = beauty[Mid]; if (check()) L = Mid; else R = Mid; } debug = true; mid = beauty[L]; check(); printf( %d %d , from + 1, to + 1); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, l, r; int ans[1000000 + 5]; long long mmod = 2333, mod = 1e9 + 7; long long shash[1000000 + 5], base[1000000 + 5]; char s[1000000 + 5]; int main() { scanf( %d%s , &n, s + 1); base[0] = 1; for (int i = 1; i <= n; i++) { shash[i] = (shash[i - 1] * mmod + s[i] - a + 1) % mod; base[i] = base[i - 1] * mmod % mod; } if (n % 2 == 1) { ans[(n + 1) / 2] = -1; l = r = (n + 1) / 2; } else { l = n / 2; r = n / 2 + 1; if (s[l] == s[r]) ans[n / 2] = 1; else ans[n / 2] = -1; } for (int i = (n + 1) / 2 - 1; i >= 1; i--) { l--; r++; for (int j = ans[i + 1] + 2; j >= 1; j -= 2) { long long a = (shash[l + j - 1] - shash[l - 1] * base[j] % mod + mod) % mod; long long b = (shash[r] - shash[r - j] * base[j] % mod + mod) % mod; if (a == b) { ans[i] = j; break; } } if (ans[i] == 0) ans[i] = -1; } for (int i = 1; i < (n + 1) / 2; i++) printf( %d , ans[i]); printf( %d , ans[(n + 1) / 2]); return 0; }
|
#include <bits/stdc++.h> using namespace std; int mat[6][7] = { {0, 0, 0, 1, 1, 1, 1}, {0, 1, 1, 0, 0, 1, 1}, {1, 0, 1, 0, 1, 0, 1}, {0, 1, 1, 1, 1, 0, 0}, {1, 0, 1, 1, 0, 1, 0}, {1, 1, 0, 0, 1, 1, 0}, }; int aux[6][7]; int res[7]; bool solve() { int p, div; for (int i = 0; i < 6; ++i) { p = i; for (int j = i + 1; j < 6; ++j) if (abs(aux[j][i]) > abs(aux[p][i])) p = j; for (int j = 0; j <= 6; ++j) swap(aux[i][j], aux[p][j]); div = aux[i][i]; for (int k = i; k <= 6; ++k) { if (aux[i][k] % div != 0) return 0; aux[i][k] /= div; } for (int j = i + 1; j < 6; ++j) { div = aux[j][i]; for (int k = i; k <= 6; ++k) aux[j][k] -= div * aux[i][k]; } } for (int i = 6 - 1; i >= 0; --i) { res[i] = aux[i][6]; for (int k = 6 - 1; k > i; --k) res[i] -= res[k] * aux[i][k]; } return 1; } int main() { int big = 0; for (int i = 0; i < 6; ++i) scanf( %d , &mat[i][6]), big = max(big, mat[i][6]); bool g = 0; for (int i = 0; i <= big && !g; ++i) { memcpy(aux, mat, sizeof aux); for (int j = 0; j < 3; ++j) aux[j][6] -= i; g = solve(); for (int j = 0; j < 6 && g; ++j) if (res[j] < 0) g = 0; res[6] = i; int a = 0; for (int i = 0; i < 7; ++i) a += res[i]; if (!g) continue; printf( %d n , a); for (int j = 3; j >= 0; --j) { for (int i = 0; i < 7; ++i) { char b = a ; if ((i + 1) & 1 << j) b = b ; for (int k = 0; k < res[i]; ++k) printf( %c , b); } printf( n ); } } if (!g) printf( -1 n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long MAX = 150004; const long long mod = 998244353; struct edge { long long next, to; } h[MAX << 1]; long long head[MAX], cnt, cnt_dfsn; long long n, q, ans, inv; inline void add(long long x, long long y) { h[++cnt] = edge{head[x], y}; head[x] = cnt; h[++cnt] = edge{head[y], x}; head[y] = cnt; } long long dfsn[MAX], size[MAX], son[MAX], fa[MAX], top[MAX], w[MAX]; long long tree[MAX]; inline long long lowbit(long long x) { return x & (-x); } inline void ad(long long x, long long y) { y %= mod; for (long long i = x; i <= n; i += lowbit(i)) tree[i] = (tree[i] + y) % mod; } inline long long sum(long long x) { long long ret = 0; for (long long i = x; i; i -= lowbit(i)) ret = (ret + tree[i]) % mod; return ret; } inline long long quick(long long x, long long y) { long long ret = 1ll; while (y) { if (y & 1) ret = (ret * x) % mod; y >>= 1; x = (x * x) % mod; } return ret; } void dfs1(long long now, long long father) { fa[now] = father; size[now] = 1; for (long long i = head[now]; i; i = h[i].next) { long long aim = h[i].to; if (aim != father) { dfs1(aim, now); size[now] += size[aim]; if (size[aim] > size[son[now]]) son[now] = aim; } } } void dfs2(long long now, long long start) { top[now] = start; dfsn[now] = ++cnt_dfsn; if (son[now]) dfs2(son[now], start); for (long long i = head[now]; i; i = h[i].next) { long long aim = h[i].to; if (aim != fa[now] && aim != son[now]) { dfs2(aim, aim); } } } signed main() { scanf( %lld %lld , &n, &q); inv = quick(n, mod - 2); for (long long x, y, i = 1; i < n; i++) scanf( %lld %lld , &x, &y), add(x, y); dfs1(1, 1), dfs2(1, 1); fa[1] = 0; for (long long op, x, y, i = 1; i <= q; i++) { scanf( %lld , &op); if (op == 1) { scanf( %lld %lld , &x, &y); w[x] = (w[x] + y) % mod; ad(1, size[x] * y % mod); ad(dfsn[x], (mod - size[x] * y % mod) % mod), ad(dfsn[x] + size[x], size[x] * y % mod); if (son[x]) ad(dfsn[son[x]], (n - size[son[x]]) * y % mod), ad(dfsn[son[x]] + size[son[x]], mod - (n - size[son[x]]) * y % mod); } else { scanf( %lld , &x); ans = (sum(dfsn[x]) + n * w[x] % mod) % mod; for (long long j = top[x]; fa[j]; j = top[fa[j]]) ans = (ans + (n - size[j]) * w[fa[j]] % mod) % mod; printf( %lld n , (ans * inv) % mod); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int limit = 1000005; void die() { cout << NO << endl; exit(0); } void computereachable(int u, int code, vector<int> g[limit], int reachable[limit]) { if (reachable[u] & code) return; reachable[u] |= code; vector<int> &ar = g[u]; for (int i = 0; i < int(ar.size()); i++) computereachable(ar[i], code, g, reachable); } int n, m; vector<int> g[limit], ginv[limit]; int reachdir[limit]; int reachinv[limit]; int nsink; int nsour; int listsour[limit]; int norder; int order[limit]; int seen[limit]; void generatepostorder(int u) { if (seen[u]) return; seen[u] = 1; vector<int> &ar = ginv[u]; for (int i = 0; i < int(ar.size()); i++) generatepostorder(ar[i]); order[norder++] = u; } void traverse(int u) { if (seen[u]) return; seen[u] = 1; vector<int> &ar = g[u]; for (int i = 0; i < int(ar.size()); i++) traverse(ar[i]); } void checkalreadystrong() { for (int u = 1; u <= n; u++) generatepostorder(u); reverse(order, order + norder); for (int u = 1; u <= n; u++) seen[u] = 0; traverse(order[0]); for (int u = 1; u <= n; u++) if (not seen[u]) die(); cout << YES << endl; exit(0); } int main() { ios::sync_with_stdio(false); cin >> n >> m; for (int i = 0; i < m; i++) { int u, v; cin >> u >> v; g[u].push_back(v); ginv[v].push_back(u); } for (int u = 1; u <= n; u++) { if (int(g[u].size()) == 0) { computereachable(u, 1 << (nsink++), ginv, reachinv); } if (int(ginv[u].size()) == 0) { computereachable(u, 1, g, reachdir); listsour[nsour++] = u; } } if (nsour == 0) checkalreadystrong(); for (int u = 1; u <= n; u++) if (not reachdir[u] or not reachinv[u]) die(); for (int c = 1; c < (1 << nsour) - 1; c++) { int creach = 0; for (int b = 0; b < nsour; b++) if (c & (1 << b)) creach |= reachinv[listsour[b]]; if (__builtin_popcount(creach) <= __builtin_popcount(c)) die(); } cout << YES << endl; }
|
#include <bits/stdc++.h> using namespace std; long long n, len, wmax, ans; vector<long long> vec[2]; inline void _read(long long &x) { long long f = 1; x = 0; char c = getchar(); while (!isdigit(c)) { if (c == - ) f = -1; else f = 1; c = getchar(); } while (isdigit(c)) { x = x * 10 + c - 0 ; c = getchar(); } x *= f; return; } inline void _print(long long x) { if (x < 0) { putchar( - ); x = -x; } if (x >= 10) _print(x / 10); putchar(x % 10 + 0 ); return; } inline long long chk(long long x1, long long x2) { long long x = x1 + x2, y = x2 - x1; return y * wmax > x && y * wmax > -x; } int main() { _read(n); _read(len); _read(wmax); long long x, v; for (long long i = 1; i <= n; i++) { _read(x); _read(v); if (v == -1) vec[0].push_back(x); else vec[1].push_back(x); } sort(vec[0].begin(), vec[0].end()); if (!vec[0].size()) { _print(0); return 0; } long long l, r, mid; for (long long i = 0; i < vec[1].size(); i++) { l = 0; r = vec[0].size(); while (l < r) { mid = (l + r) >> 1; if (chk(vec[1][i], vec[0][mid] + len)) r = mid; else l = mid + 1; } ans += (vec[0].size() - r); } _print(ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 3010; bool visit[maxn]; int n, m, ans, f[maxn]; vector<int> ve; vector<pair<int, int> > maps[maxn]; void first_dfs(const int u) { visit[u] = 1; for (int i = 0; i < ((int)(maps[u]).size()); ++i) { int v = maps[u][i].first; int w = maps[u][i].second; if (!visit[v]) { first_dfs(v); f[u] += f[v] + w; } } } void second_dfs(const int u) { visit[u] = 1; for (int i = 0; i < ((int)(maps[u]).size()); ++i) { int v = maps[u][i].first; int w = maps[u][i].second; if (!visit[v]) { f[v] = f[u] + (w ? -1 : 1); m = min(m, f[v]); second_dfs(v); } } } void solve(const int u) { first_dfs(u); ans = min(ans, f[u]); if (((int)(maps[u]).size()) >= 2) { ve.clear(); memset(visit, 0, sizeof(visit)); visit[u] = 1; for (int i = 0; i < ((int)(maps[u]).size()); ++i) { int v = maps[u][i].first; int w = maps[u][i].second; m = f[v]; second_dfs(v); ve.push_back(m + (w ? -1 : 1) - f[v]); } sort(ve.begin(), ve.end()); ans = min(ans, f[u] + ve[0] + ve[1]); } } int main() { scanf( %d , &n); int u, v; for (int i = 1; i < n; ++i) { scanf( %d%d , &u, &v); maps[u].push_back(make_pair(v, 0)); maps[v].push_back(make_pair(u, 1)); } ans = maxn; for (int i = 1; i <= n; ++i) { memset(f, 0, sizeof(f)); memset(visit, 0, sizeof(visit)); solve(i); } printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int check(int m, int k, string s) { int i; for (i = m + 1; i <= m + k && i < s.size(); i++) { if (s[i] == 1 ) return i; } return -1; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t > 0) { int i = 0, n, k, m, s = 0; string a; cin >> n >> k >> a; for (i = 0; i < n;) { int temp = check(i, k, a); if (temp == -1) { if (a[i] == 0 ) { s++; } i += (k + 1); } else i = temp; } cout << s << endl; t--; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int t; bool ans[50000][4]; int main() { cin >> t; for (int i = 0; i < t; i++) { int toys[4]; for (int j = 0; j < 4; j++) { cin >> toys[j]; } bool neg = (toys[0] + toys[1]) % 2 == 1; bool small = toys[1] >= 1 || toys[2] >= 1; bool big = toys[0] >= 1 || toys[3] >= 1; if (neg) { if (small) { ans[i][1] = true; } if (big) { ans[i][0] = true; } } else { if (small) { ans[i][2] = true; } if (big) { ans[i][3] = true; } } } for (int i = 0; i < t; i++) { for (int j = 0; j < 4; j++) { if (j != 0) { cout << ; } if (ans[i][j]) { cout << Ya ; } else { cout << Tidak ; } } cout << n ; } }
|
#include <bits/stdc++.h> using namespace std; const int N = 12005, inf = 2e9; int n, q, a, b, k, m; double x[N], y[N], ans[N], p[N], t, s; int main() { scanf( %d%d%d%d , &n, &q, &a, &b); for (int i = 1; i <= n; i++) scanf( %lf , &p[i]); x[m] = 1, y[m] = 2.0 * (1 - p[1]), m++; x[m] = inf, y[m] = 2.0 * (inf - p[1]), m++; t = x[0] - y[0] / (y[1] - y[0]) * (x[1] - x[0]); ans[1] = t; for (int i = 2; i <= n; i++) { for (int j = m - 1; j > k; j--) x[j + 2] = x[j], y[j + 2] = y[j]; m += 2; x[k + 1] = t, y[k + 1] = 0; x[k + 2] = t, y[k + 2] = 0; k++; for (int j = 0; j <= k; j++) x[j] += a; for (int j = k + 1; j < m; j++) x[j] += b; for (int j = 0; j < m; j++) y[j] += 2 * (x[j] - p[i]); if (y[0] >= 0) { k = -1; t = x[0]; } else { for (k = 0; k < m; k++) if (y[k] <= 0 && y[k + 1] > 0) break; t = x[k] - y[k] / (y[k + 1] - y[k]) * (x[k + 1] - x[k]); } ans[i] = t; } ans[n] = min(ans[n], 1.0 * q); for (int i = n; i >= 2; i--) ans[i - 1] = min(ans[i] - a, max(ans[i - 1], ans[i] - b)); for (int i = 1; i <= n; i++) { printf( %.6lf , ans[i]); s += (ans[i] - p[i]) * (ans[i] - p[i]); } printf( n%.6lf n , s); return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; using u32 = unsigned int; using db = double; using ld = long double; using pii = std::array<int, 2>; using pll = std::array<ll, 2>; const int INF = 0x3f3f3f3f; const long long INFll = 0x3f3f3f3f3f3f3f3f; namespace Fast_in { template <typename T> void in(T &x) { x = 0; bool f = false; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = true; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + ch - 0 ; ch = getchar(); } if (f) x = -x; } template <typename T> T in() { T x = 0; bool f = false; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = true; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + ch - 0 ; ch = getchar(); } return f ? -x : x; } template <typename T, typename... Tp> void in(T &x, Tp &...a) { in(x); in(a...); } template <typename T> void in(T *l, T *r) { for (; l != r; ++l) in(*l); } } // namespace Fast_in using namespace Fast_in; namespace Fast_out { template <typename T> void out_sub(T x, char ch = n ) { static int tp, sk[30]; if (x < 0) { putchar( - ); x = -x; } do { sk[++tp] = x % 10; x /= 10; } while (x); while (tp) { putchar(sk[tp--] + 0 ); } putchar(ch); } void out(int x, char ch = n ) { out_sub(x, ch); } void out(ll x, char ch = n ) { out_sub(x, ch); } void out(u32 x, char ch = n ) { out_sub(x, ch); } void out(ull x, char ch = n ) { out_sub(x, ch); } void out(db x, char ch = n ) { printf( %.12f%c , x, ch); } void out(ld x, char ch = n ) { printf( %.12Lf%c , x, ch); } void out(char x, char ch = n ) { printf( %d%c , x, ch); } void out(char *x, char ch = n ) { printf( %s%c , x, ch); } void out(string x, char ch = n ) { printf( %s%c , x.c_str(), ch); } void out(pii x) { out_sub(x[0], ), out_sub(x[1]); } void out(pll x) { out_sub(x[0], ), out_sub(x[1]); } template <typename T> void out(vector<T> x, char ch = ) { if (x.empty()) { puts( ); return; } T val = x.back(); x.pop_back(); for (auto i : x) out(i, ch); out(val); } template <typename T> void out(set<T> x, char ch = ) { if (x.empty()) { puts( ); return; } T val = *x.rbegin(); x.erase(--x.end()); for (auto i : x) out(i, ch); out(val); } template <typename T> void out(T *l, T *r, char ch = ) { if (l == r) { puts( ); return; } --r; for (; l != r; ++l) out(*l, ch); if (l == r) out(*l); } template <typename T, typename... Tp> void out(T x, Tp... a) { out(x, ); out(a...); } } // namespace Fast_out using namespace Fast_out; namespace Bin { template <int len = 0, typename T> void out_bin(T x, char ch = n ) { if (len) { cout << bitset<len>(x).to_string() << ch; return; } long long val = 1ll << 32; bool flg = false; if (x > val) { for (int i = 63; ~i; --i) if (flg) printf( %d , (x >> i) & 1); else if ((x >> i) & 1) { flg = true; printf( 1 ); } } else { for (int i = 31; ~i; --i) if (flg) printf( %d , (x >> i) & 1); else if ((x >> i) & 1) { flg = true; printf( 1 ); } } putchar(ch); } template <typename T> void in_bin(T &x) { x = 0; char ch = getchar(); while (!isdigit(ch)) ch = getchar(); while (isdigit(ch)) { x <<= 1; x |= ch & 1; ch = getchar(); } } } // namespace Bin using namespace Bin; struct Timer { int val, pre; Timer() { pre = clock(); val = clock(); } void operator()(int flg = 2) { if (flg == 2) val = pre; int now = clock(); if (flg != 0) std::cerr << now - val << ms n ; if (flg != 1) val = now; pre = now; } }; Timer Time; struct Random { mt19937 my_rand; Random() { srand((long long)new char); my_rand.seed(rand()); } }; Random __Rd; template <typename T> T rnd(T _l, T _r) { T len = _r - _l + 1; return __Rd.my_rand() % len + _l; } template <typename T> void Max(T &x, T y) { x < y && (x = y); } template <typename T> void Min(T &x, T y) { x > y && (x = y); } template <typename T, class Func> void Max(T &x, T y, Func F) { if (x < y) { x = y; F(); } } template <typename T, class Func> void Min(T &x, T y, Func F) { if (x > y) { x = y; F(); } } template <typename T> T abss(T x) { return x < 0 ? -x : x; } void File(string In, string Out) { if (!In.empty()) freopen(In.c_str(), r , stdin); if (!Out.empty()) freopen(Out.c_str(), w , stdout); } namespace Mod { const int md = 998244353; inline int add(const int &a, const int &b) { int p = a + b; if (p >= md) p -= md; return p; } inline int sub(const int &a, const int &b) { int p = a - b; if (p < 0) p += md; return p; } inline void add_(int &a, int b) { a += b; if (a >= md) a -= md; } inline void sub_(int &a, int b) { a -= b; if (a < 0) a += md; } inline int __mul(const int &a, const int &b) { return 1ll * a * b % md; } inline int mul(const int &a, const int &b) { int p = __mul(a, b); if (p < 0) p += md; return p; } template <typename T> int qpow(int a, T b) { int ret = 1; for (; b; b >>= 1, a = mul(a, a)) if (b & 1) ret = mul(ret, a); return ret; } inline int inv(int x) { return qpow(x, md - 2); } inline void inv(int *F, int len, int *G = NULL, bool flg = false) { if (G == NULL) G = F; if (flg) { F[0] = G[0] = 1; for (int i = 1; i <= len; ++i) F[i] = __mul(F[i - 1], i); } std::vector<int> S(len + 1), iS(len + 1); S[0] = 1; for (int i = 1; i <= len; ++i) S[i] = mul(S[i - 1], F[i]); iS[len] = inv(S[len]); for (int i = len; i >= 1; --i) { iS[i - 1] = mul(iS[i], F[i]); G[i] = mul(S[i - 1], iS[i]); } } } // namespace Mod using namespace Mod; namespace gvihvo { const int N = 5010; int n, k; char s[N]; int C[N][N]; int sum[N]; int top; pii stk[N]; void main() { in(n, k); if (k == 0) { out(1); return; } scanf( %s , s + 1); int ans = 0; for (int i = (0); i <= (n); ++i) { C[i][0] = 1; for (int j = (1); j <= (i); ++j) C[i][j] = add(C[i - 1][j - 1], C[i - 1][j]); } for (int i = (1); i <= (n); ++i) sum[i] = sum[i - 1] + (s[i] == 1 ); for (int i = 1, j = 1; i <= n; ++i) { if (s[i - 1] == 0 ) continue; while (j + 1 <= n && sum[j + 1] - sum[i - 1] <= k) ++j; if (sum[j] - sum[i - 1] != k) break; stk[++top] = {i, j}; } if (!top) { out(1); return; } for (int i = (1); i <= (top - 1); ++i) { ans = add(ans, C[stk[i][1] - stk[i][0] + 1][k]); if (stk[i][1] >= stk[i + 1][0]) { ans = sub(ans, C[stk[i][1] - stk[i + 1][0] + 1] [sum[stk[i][1]] - sum[stk[i + 1][0] - 1]]); } else ans = sub(ans, 1); } ans = add(ans, C[stk[top][1] - stk[top][0] + 1][k]); out(ans); } void init() { ; } } // namespace gvihvo int main() { gvihvo::init(); gvihvo::main(); return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > v[100005]; bool visit[100005]; int n; vector<int> ans; bool dfs(int i, int last) { visit[i] = true; bool flag = false; for (int j = 0; j < v[i].size(); j++) { if (!visit[v[i][j].first]) { if (v[i][j].second == 2) flag = flag | dfs(v[i][j].first, v[i][j].first); else flag = flag | dfs(v[i][j].first, 0); } } if (flag == false && last != 0) { flag = true; ans.push_back(i); } return flag; } void Readinput() { int i, x, y, t; scanf( %d , &n); for (i = 0; i < n - 1; i++) { scanf( %d , &x); scanf( %d , &y); scanf( %d , &t); v[x].push_back(pair<int, int>(y, t)); v[y].push_back(pair<int, int>(x, t)); } } void solve() { int i, j; dfs(1, 0); cout << ans.size() << endl; for (i = 0; i < ans.size(); i++) cout << ans[i] << ; cout << endl; } int main() { memset(visit, false, sizeof(visit)); Readinput(); solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int shuruHoJaa(long long int test) { while (test--) { long long int a, b, c, d; cin >> a >> b >> c >> d; long long int time = 0; if (b >= a) { cout << b; } else if (c <= d) { cout << -1; } else { time += b; long long int tmp = ((a - b) % (c - d) == 0 ? (a - b) / (c - d) : (a - b) / (c - d) + 1); time += (tmp * (c)); cout << time; } cout << n ; } return 0; } int main(int argc, char const *argv[]) { int t; cin >> t; shuruHoJaa(t); return 0; }
|
#include <bits/stdc++.h> using namespace std; char s[1010]; int main() { int n; scanf( %d , &n); scanf( %s , s); int a0 = 0; int a1 = 0; int b0 = 0; int b1 = 0; for (int i = 0; i < n; i++) { if (s[i] == 0 ) { if (i % 2) b0++; else a0++; } else { if (i % 2) b1++; else a1++; } } int ans = min(a0 + b1, a1 + b0); printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long n, pl = 4, otv = 1; cin >> n; if (n > 1) { for (long long i = 1; i < n; i++) { otv = otv + pl; pl += 4; } } else if (n == 1) { otv = 1; } cout << otv; }
|
#include <bits/stdc++.h> using namespace std; struct _ { ios_base::Init i; _() { cin.sync_with_stdio(0); cin.tie(0); } } _; struct House { int height; int initial_position; }; int main() { int n; cin >> n; vector<House> houses; for (int i = 0; i < n; i++) { int x; cin >> x; House h{x, i}; houses.push_back(h); } stable_sort(houses.begin(), houses.end(), [&](House h1, House h2) { return h1.height < h2.height; }); int up_to = 0; int number_of_blocks = 0; for (int i = 0; i < n; i++) { int initial_position = houses[i].initial_position; up_to = max(up_to, initial_position); if (up_to == i) { up_to++; number_of_blocks++; } } cout << number_of_blocks << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, x, freq[100123], pairs = 0; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cin >> n >> x; long long v[n]; for (long long i = 0; i < n; i++) { cin >> v[i]; freq[v[i]]++; } for (long long i = 0; i < 100123; i++) if (freq[i] > 0) if ((x ^ i) < 100123) pairs += freq[i] * (freq[(x ^ i)] - ((x ^ i) == i)); pairs /= 2; cout << pairs << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int Buffer_Size = 1 << 10; char buffer[Buffer_Size], *ihead = buffer + Buffer_Size, *itail = ihead; char Next_Char() { if (ihead == itail) fread(buffer, 1, Buffer_Size, stdin), ihead = buffer; return *ihead++; } template <typename T> void read(T &n) { n = 0; char ch = Next_Char(); while (!isdigit(ch)) ch = Next_Char(); while (isdigit(ch)) { n = (n << 3) + (n << 1) + (ch & 15); ch = Next_Char(); } } long long r, c, n, k, tp, sum; long long a[3002], cnt[3002], L[3002], R[3002]; vector<long long> v[3002]; struct Position { long long x, y; } p[3002]; bool Cmp(long long x, long long y) { return p[x].y < p[y].y; } bool DFS(long long x, long long step) { if (!step || !x) return 1; if (!DFS(L[x], step - 1)) cnt[L[x]] = cnt[x]; else cnt[L[x]] += cnt[x]; return 0; } int main() { read(r), read(c), read(n), read(k); for (long long i = 1; i <= n; ++i) { read(p[i].x), read(p[i].y); v[p[i].x].push_back(i); } long long ans = 0; for (long long i = 1; i <= r; ++i) { tp = sum = 0; for (long long j = 1; j <= n; ++j) if (p[j].x >= i) a[++tp] = j; sort(a + 1, a + tp + 1, Cmp); a[tp + 1] = n + 1; memset(cnt, 0, sizeof(cnt)); memset(L, 0, sizeof(L)); memset(R, 0, sizeof(R)); long long now = 0; for (long long j = 1; j <= c; ++j) { while (p[a[now + 1]].y == j && now < tp) { ++now; L[a[now]] = a[now - 1], R[a[now]] = a[now + 1]; } long long tmp = a[now]; for (long long l = 1; l < k; ++l) tmp = L[tmp]; ++cnt[tmp]; } for (long long j = 1; j <= tp; ++j) sum += p[a[j]].y * cnt[a[j]]; ans += sum; for (long long j = r; j >= i + 1; --j) { long long sz = (long long)v[j].size(); for (long long l = 0; l < sz; ++l) { long long x = v[j][l], q = x; for (long long o = 1; o <= k; ++o) { sum -= (p[x].y - p[L[x]].y) * cnt[x]; x = L[x]; if (!x) break; } x = q; DFS(x, k); x = q; L[R[x]] = L[x], R[L[x]] = R[x]; } ans += sum; } } printf( %lld n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; pair<int, int> a[200020], b[200020]; int x, y, c, d; int n; int mx[200020]; int calc(pair<int, int> a[], int len, int val) { for (int i = 1; i <= len; ++i) { mx[i] = max(mx[i - 1], a[i].second); } int ret = 0; for (int i = len, j = 1; i >= 1; --i) { while (j <= len && a[j].first + a[i].first <= val) { ++j; } if (j > 1 && i > 1) ret = max(ret, a[i].second + mx[min(j - 1, i - 1)]); } return ret; } int main() { scanf( %d%d%d , &n, &c, &d); for (int i = 1; i <= n; ++i) { int u, v; char op[5]; scanf( %d%d%s , &u, &v, op); if (op[0] == C ) a[++x] = make_pair(v, u); else b[++y] = make_pair(v, u); } sort(a + 1, a + x + 1); sort(b + 1, b + y + 1); int ans = calc(a, x, c); ans = max(ans, calc(b, y, d)); int mx1 = -1, mx2 = -1; for (int i = 1; i <= x; ++i) if (a[i].first <= c) mx1 = max(mx1, a[i].second); for (int i = 1; i <= y; ++i) if (b[i].first <= d) mx2 = max(mx2, b[i].second); if (mx1 != -1 && mx2 != -1) ans = max(ans, mx1 + mx2); printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 2; long long int i, j, n, m, s, ans = 0, cnt = 0; vector<pair<long long int, long long int> > nf; vector<long long int> graph[maxn]; bool foundd[maxn]; void dfs(long long int u, bool found[]) { if (!foundd[u]) ++ans; found[u] = true; vector<long long int>::iterator it; for (it = graph[u].begin(); it != graph[u].end(); ++it) { if (!found[*it]) dfs(*it, found); } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n >> m >> s; bool found[5200], isreachable[5200]; for (i = 0; i < m; ++i) { long long int u, v; cin >> u >> v; graph[u].push_back(v); } memset(found, false, sizeof(found)); dfs(s, found); for (i = 1; i <= n; ++i) foundd[i] = found[i]; for (i = 1; i <= n; ++i) { if (!foundd[i]) { bool found1[5001]; memset(found1, false, sizeof(found1)); ans = 0; dfs(i, found1); nf.push_back(make_pair(ans, i)); } } sort(nf.begin(), nf.end(), greater<pair<long long int, long long int> >()); for (i = 0; i < nf.size(); ++i) { if (!foundd[nf[i].second]) { bool found1[5001]; memset(found1, false, sizeof(found1)); dfs(nf[i].second, found1); ++cnt; for (j = 1; j <= n; ++j) if (found1[j]) foundd[j] = true; } } cout << cnt; }
|
#include <bits/stdc++.h> using namespace std; void read(int &a) { a = 0; char c = getchar(); while (c < 0 || c > 9 ) { c = getchar(); } while (c >= 0 && c <= 9 ) { a = (a << 1) + (a << 3) + c - 0 ; c = getchar(); } } int Set(int n, int pos) { return n = n | (1LL << pos); } int reset(int n, int pos) { return n = n & ~(1LL << pos); } bool check(int n, int pos) { return (bool)(n & (1LL << pos)); } int mul(int a, int b) { int c; c = (a % 1000000007 * b % 1000000007) % 1000000007; return c; } int add(int a, int b) { int c; c = (a % 1000000007 + b % 1000000007) % 1000000007; return c; } int sub(int a, int b) { int c; c = ((a % 1000000007 - b % 1000000007) % 1000000007 + 1000000007) % 1000000007; return c; } int power(int x, int y) { int res = 1; x = x; while (y > 0) { if (y & 1) res = (res * x); y = y >> 1; x = (x * x); } return res; } long long exgcd(long long x, long long y, long long &a, long long &b) { int flag = 0; long long t, la = 1, lb = 0, ra = 0, rb = 1; while (x % y) { if (flag == 0) la -= x / y * ra, lb -= x / y * rb; else ra -= x / y * la, rb -= x / y * lb; t = x, x = y, y = t % y; flag = 1 - flag; } if (flag == 0) a = ra, b = rb; else a = la, b = lb; return y; } int n, m, k, r; vector<int> rooms[200005]; vector<pair<int, int> > graph[200005]; int st[200005]; int col[200005]; deque<int> q; bool bfs(int ma_src) { q.clear(); col[ma_src] = 0; q.push_back(ma_src); while (!q.empty()) { int u = q.front(); q.pop_front(); for (int i = 0; i < graph[u].size(); i++) { int v = graph[u][i].first; int _v = graph[u][i].second; if (col[v] == -1) { if (_v == 1) col[v] = col[u]; else col[v] = col[u] ^ 1; q.push_back(v); } else { if (_v == 1) { if (col[v] != col[u]) return 0; } else { if (col[v] == col[u]) return 0; } } } } return 1; } int main() { scanf( %d %d , &n, &m); for (int i = 1; i <= n; i++) scanf( %d , &st[i]); for (int i = 1; i <= m; i++) { scanf( %d , &k); for (int j = 1; j <= k; j++) { scanf( %d , &r); rooms[r].push_back(i); } } for (int i = 1; i <= n; i++) { int u = rooms[i][0]; int v = rooms[i][1]; graph[u].push_back(pair<int, int>(v, st[i])); graph[v].push_back(pair<int, int>(u, st[i])); } memset((col), (-1), sizeof(col)); int ans = 1; for (int i = 1; i <= m; i++) { if (col[i] == -1) ans = ans & bfs(i); } if (!ans) cout << NO << endl; else cout << YES << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long k, sum = 0, i, j, n, cnt = 0; int a[20] = {0}, value; string s; cin >> k; cin >> s; for (i = 0; i < ((int)s.size()); ++i) { n = s[i] - 0 ; sum += n; a[n]++; } if (sum >= k) { cout << cnt << endl; return 0; } for (i = 0; i < 10; ++i) { value = 9 - i; for (j = 1; j <= a[i]; ++j) { sum += value; cnt++; if (sum >= k) { cout << cnt << endl; return 0; } } } }
|
#include <bits/stdc++.h> using namespace std; long long x, y; int main() { ios_base::sync_with_stdio(0); ; cin >> x >> y; if ((long long)sqrt(x * x + y * y + 0.5) == sqrt(x * x + y * y)) { cout << black << n ; return 0; } long long d = sqrt(x * x + y * y); if ((x > 0 && y > 0) || (x < 0 && y < 0)) { if (d % 2 == 0) cout << black << n ; else cout << white << n ; } else { if (d % 2 == 0) cout << white << n ; else cout << black << n ; } return 0; }
|
#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int,int> pii; typedef vector<int> vi; typedef vector<vi> vvi; typedef vector<ll> vl; typedef vector<vl> vvl; typedef vector<string> vs; typedef vector<vs> vvs; typedef vector<pii> vpii; typedef set<int> si; typedef unordered_set<int> usi; typedef multiset<int> msi; typedef map<int,int> mi; typedef unordered_map<int,int> umi; typedef multimap<int,int> mmi; #define f1(a,b,c) for(int(a)=(b);(a)<(c);(a)++) #define f2(a,b,c) for(int(a)=(b);(a)<=(c);(a)++) #define f3(a,b,c) for(int(a)=(b);(a)>(c);(a)--) #define f4(a,b,c) for(int(a)=(b);(a)>=(c);(a)--) #define fi(a,b) for(auto(a)=b.begin();(a)!=b.end();(a)++) #define pb push_back #define all(v) v.begin(),v.end() #define nper next_permutation #define pper prev_permutation #define mp make_pair #define F first #define S second int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin>>t; f1(i,0,t) { int n,k,x=1; cin>>n>>k; f1(j,0,(2*k)-n-1) { cout<<x<< ;x++; } x=k; f1(j,0,n-k+1) { cout<<x<< ;x--; } cout<< n ; } /*f1(i,0,t) { cout<<v[i]<< n ; }*/ return 0; }
|
#include <bits/stdc++.h> using namespace std; inline long long read() { long long x = 0, f = 1; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) f = -1; for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48); return x * f; } inline void write(long long x) { if (x < 0) x = -x, putchar( - ); if (x >= 10) write(x / 10); putchar(x % 10 + 0 ); } inline void writeln(long long x) { write(x); putchar( n ); } inline void wri(long long x) { write(x); putchar( ); } const int maxn = 1e5 + 233; const int mod = 1e9 + 7; int f[maxn]; int main() { int n = read(), m = read(); f[0] = 1; f[1] = 1; for (register int i = (2); i <= int(maxn - 1); ++i) f[i] = (f[i - 1] + f[i - 2]) % mod; writeln(2ll * (f[n] + f[m] - 1) % mod); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 7; int vis1[MAXN], vis2[MAXN], dis[MAXN]; int st, ed, n, ans; queue<int> q; vector<int> G[MAXN]; void Bfs1() { for (; !q.empty();) q.pop(); q.push(1); vis1[1] = 1; for (; !q.empty();) { int u = q.front(); q.pop(); for (auto v : G[u]) { if (vis1[v]) continue; q.push(v); vis1[v] = u; } st = u; } } void Bfs2() { for (; !q.empty();) q.pop(); q.push(st); vis2[st] = st; for (; !q.empty();) { int u = q.front(); q.pop(); for (auto v : G[u]) { if (vis2[v]) continue; q.push(v); vis2[v] = u; } ed = u; } } int degree(int x) { return (int)G[x].size(); } bool check(int root) { int Tim = 0; for (int i = 1; i <= n; i++) vis1[i] = dis[i] = 0; for (; !q.empty();) q.pop(); q.push(root); vis1[root] = 1; for (; !q.empty();) { int u = q.front(); q.pop(); for (auto v : G[u]) { if (vis1[v]) continue; if (++Tim == n) { } q.push(v); vis1[v] = vis1[u] + 1; if (!dis[vis1[v]]) dis[vis1[v]] = v; if (degree(v) != degree(dis[vis1[v]])) return false; } } ans = root; return true; } bool checkCenter() { int Tim = 0; int D = 0; for (int u = ed; u != st; u = vis2[u]) D++; if (D & 1) return false; int center = ed; for (int i = 0; i != D / 2; i++, center = vis2[center]) ; if (check(center)) return true; for (int i = 1; i <= n; i++) vis1[i] = dis[i] = 0; for (; !q.empty();) q.pop(); q.push(center); vis1[center] = 1; for (; !q.empty();) { int u = q.front(); q.pop(); for (auto v : G[u]) { if (vis1[v]) continue; if (++Tim == n) { } q.push(v); vis1[v] = vis1[u] + 1; if (!dis[vis1[v]]) dis[vis1[v]] = v; if (degree(v) != degree(dis[vis1[v]])) { for (int x = v, tim = 0;;) { if (++tim == n) break; if (G[x].size() == 1) { if (check(x)) return true; else break; } else x = (vis1[G[x][0]] == 0) ? G[x][0] : G[x][1]; } for (int x = dis[vis1[v]], tim = 0;;) { if (++tim == n) break; if (G[x].size() == 1) { if (check(x)) return true; else break; } else x = (vis1[G[x][0]] == 0) ? G[x][0] : G[x][1]; } return false; } } } ans = center; return true; } int main() { cin >> n; for (int i = 1; i < n; i++) { int u, v; cin >> u >> v; G[u].push_back(v); G[v].push_back(u); } Bfs1(); Bfs2(); if (check(st) || check(ed)) cout << ans; else if (checkCenter()) cout << ans; else cout << -1; }
|
#include <bits/stdc++.h> using namespace std; long long K[5], T[5]; int main() { queue<pair<long long, long long> > Q[5][2]; string ln; int n; getline(cin, ln); istringstream(ln) >> K[1] >> K[2] >> K[3]; getline(cin, ln); istringstream(ln) >> T[1] >> T[2] >> T[3]; getline(cin, ln); istringstream(ln) >> n; getline(cin, ln); istringstream in(ln); long long t0; for (int i = 0; i < n; i++) { in >> t0; Q[1][0].push(pair<long long, long long>(t0, t0)); } long long t = 0; for (int i = 1; i <= 3; i++) { while (Q[i][0].size()) { t = Q[i][0].front().first; t = max(t, Q[i][0].front().first); t0 = Q[i][0].front().second; Q[i][0].pop(); if (Q[i][1].size() < K[i]) { Q[i][1].push(pair<long long, long long>(t + T[i], t0)); } else { t = max(Q[i][1].front().first, t); Q[i + 1][0].push(Q[i][1].front()); Q[i][1].pop(); Q[i][1].push(pair<long long, long long>(t + T[i], t0)); } } while (Q[i][1].size()) { Q[i + 1][0].push(Q[i][1].front()); Q[i][1].pop(); } } long long res = 0; while (Q[4][0].size()) { res = max(res, Q[4][0].front().first - Q[4][0].front().second); Q[4][0].pop(); } cout << res << endl; return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; inline int read() { char c = getchar(); int x = 0, f = 1; while ((c < 0 || c > 9 ) && c - - ) c = getchar(); if (c == - ) f = -1, c = getchar(); while (c >= 0 && c <= 9 ) { x = (x << 3) + (x << 1) + c - 48; c = getchar(); } return x * f; } const int N = 3e5 + 10; int n, rev[N]; long long f[N], g[N], jc[N], inv[N], z[N]; const long long mo = 998244353, Gi = 3; inline long long qp(long long a, long long b) { long long ans = 1; while (b) { if (b & 1) ans = (ans * a) % mo; a = (a * a) % mo; b >>= 1; } return ans; } int lim = 1, l = 0; inline void ntt(long long a[], int pan) { for (int i = 0; i < lim; i++) if (i > rev[i]) swap(a[i], a[rev[i]]); for (int bj = 1; bj < lim; bj <<= 1) { long long wn = qp(Gi, (mo - 1) / (bj << 1)); if (pan) wn = qp(wn, mo - 2); for (int ks = 0; ks < lim; ks += (bj << 1)) { long long w = 1; for (int i = 0; i < bj; i++, w = (w * wn) % mo) { long long x = a[ks + i], y = w * a[ks + i + bj] % mo; a[ks + i] = (x + y) % mo; a[ks + i + bj] = ((x - y) % mo + mo) % mo; } } } if (pan) { long long ni = qp(lim, mo - 2); for (int i = 0; i < lim; i++) a[i] = (a[i] * ni) % mo; } } void gao(int t) { if (t == 1) { f[1] = 1; return; } int mi = t / 2; gao(mi); for (int i = 0; i <= mi; i++) z[i] = f[i], f[i] = f[i] * jc[i] % mo; long long c = mi, gu = 1; g[mi] = inv[0]; for (int i = mi - 1; i >= 0; i--) { gu = (gu * c) % mo; g[i] = gu * inv[mi - i] % mo; } lim = 1, l = 0; while (lim <= (mi << 1)) lim <<= 1, l++; for (int i = 0; i < lim; i++) rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << l - 1); ntt(f, 0); ntt(g, 0); for (int i = 0; i < lim; i++) f[i] = (f[i] * g[i]) % mo, g[i] = 0; ntt(f, 1); long long ji = f[mi]; for (int i = mi; i >= 1; i--) { f[i] = f[i + mi]; f[i + mi] = 0; } f[0] = ji; for (int i = 0; i <= mi; i++) f[i] = (f[i] * inv[i]) % mo; lim = 1, l = 0; while (lim <= (mi << 1)) lim <<= 1, l++; for (int i = 0; i < lim; i++) rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << l - 1); ntt(z, 0); ntt(f, 0); for (int i = 0; i < lim; i++) z[i] = (z[i] * f[i]) % mo; ntt(z, 1); for (int i = 0; i < lim; i++) f[i] = z[i], z[i] = 0; if (t % 2) { z[0] = (f[0] * (t - 1)) % mo; for (int i = 1; i <= (mi << 1) + 1; i++) z[i] = (f[i - 1] + (f[i] * (t - 1))) % mo; for (int i = 1; i <= (mi << 1) + 1; i++) f[i] = z[i], z[i] = 0; } } int A, B; int main() { jc[0] = inv[0] = 1; for (int i = 1; i <= N - 10; i++) jc[i] = (jc[i - 1] * i) % mo; inv[N - 10] = qp(jc[N - 10], mo - 2); for (int i = N - 11; i >= 1; i--) inv[i] = (inv[i + 1] * (i + 1)) % mo; n = read(); A = read(); B = read(); if (n == 1) { if (A + B == 2) cout << 1 n ; else cout << 0 n ; return 0; } if (!A || !B || A + B > n + 1) { cout << 0 n ; return 0; } gao(n - 1); cout << f[A + B - 2] * jc[A + B - 2] % mo * inv[A - 1] % mo * inv[B - 1] % mo << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; const double PI = acos(-1.); const int MXN = 200005; const int MOD = 1000000000; int a[MXN], n, m; long long fib[MXN]; long long prefib[MXN]; struct SEG { int l, r; long long lazy; long long g[2]; SEG() {} SEG(int _l, int _r) { l = _l, r = _r; } } SGT[MXN << 2]; void create(SEG &T, int t) { T.lazy = 0; T.g[0] = T.g[1] = a[t]; } void fresh(SEG &T, SEG &L, SEG &R) { int left = L.r - L.l + 1; T.lazy = 0; if (left == 1) { T.g[0] = (L.g[0] + R.g[1]) % MOD; T.g[1] = (L.g[0] + R.g[0] + R.g[1]) % MOD; return; } T.g[0] = (L.g[0] + fib[left - 2] * R.g[0] % MOD + fib[left - 1] * R.g[1] % MOD) % MOD; T.g[1] = (L.g[1] + fib[left - 1] * R.g[0] % MOD + fib[left] * R.g[1] % MOD) % MOD; } void build(int id, int l, int r) { SGT[id] = SEG(l, r); int mid = (l + r) / 2; if (l != r) { build(id * 2, l, mid); build(id * 2 + 1, mid + 1, r); fresh(SGT[id], SGT[id << 1], SGT[id << 1 | 1]); } else create(SGT[id], l); } void update(int id, int l, int r, long long w) { SEG &T = SGT[id]; int mid = (T.l + T.r) / 2; if (T.l == l && T.r == r) { T.lazy = (T.lazy + w) % MOD; T.g[0] = (T.g[0] + w * prefib[T.r - T.l] % MOD) % MOD; T.g[1] = (T.g[1] + w * (prefib[T.r - T.l + 1] - 1) % MOD) % MOD; return; } if (T.lazy) { update(id << 1, T.l, mid, T.lazy); update(id << 1 | 1, mid + 1, T.r, T.lazy); T.lazy = 0; } if (r <= mid) update(id << 1, l, r, w); else if (l > mid) update(id << 1 | 1, l, r, w); else { update(id << 1, l, mid, w); update(id << 1 | 1, mid + 1, r, w); } fresh(T, SGT[id << 1], SGT[id << 1 | 1]); } long long single(int id, int t) { SEG &T = SGT[id]; int mid = (T.l + T.r) / 2; if (T.l == T.r) return T.g[0]; if (t <= mid) return T.lazy + single(id << 1, t); else return T.lazy + single(id << 1 | 1, t); } void query(int id, SEG &A) { SEG &T = SGT[id]; int mid = (T.l + T.r) / 2; if (A.l == T.l && A.r == T.r) { A = T; return; } if (T.lazy && T.l != T.r) { update(id << 1, T.l, mid, T.lazy); update(id << 1 | 1, mid + 1, T.r, T.lazy); T.lazy = 0; } if (A.r <= mid) query(id << 1, A); else if (A.l > mid) query(id << 1 | 1, A); else { SEG L(A.l, mid), R(mid + 1, A.r); query(id << 1, L); query(id << 1 | 1, R); fresh(A, L, R); } } int main() { int i, j; fib[0] = 1; fib[1] = 1; for (i = 2; i < MXN; i++) fib[i] = (fib[i - 1] + fib[i - 2]) % MOD; prefib[0] = 1; for (i = 1; i < MXN; i++) prefib[i] = (prefib[i - 1] + fib[i]) % MOD; while (~scanf( %d%d , &n, &m)) { for (i = 1; i <= n; i++) scanf( %d , &a[i]); build(1, 1, n); while (m--) { int q; scanf( %d , &q); if (q == 1) { int x, v; scanf( %d%d , &x, &v); long long tp = single(1, x); update(1, x, x, v - tp); } if (q == 2) { int l, r; scanf( %d%d , &l, &r); SEG A(l, r); query(1, A); printf( %I64d n , ((A.g[0] % MOD) + MOD) % MOD); } if (q == 3) { int l, r, d; scanf( %d%d%d , &l, &r, &d); update(1, l, r, d); } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 2005; const char vow[] = { a , e , i , o , u , y }; char str[maxn]; bool check(char ch) { for (int i = 0; i < 6; ++i) { if (ch == vow[i]) return true; } return false; } int main() { int n; while (~scanf( %d , &n)) { scanf( %s , str); for (int i = 0; i < n; ++i) { if (check(str[i])) { for (int j = i + 1; j < n; ++j) { if (str[i] == 0) continue; if (check(str[j])) str[j] = 0; else break; } } } for (int i = 0; i < n; ++i) { if (str[i]) putchar(str[i]); } puts( ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); const double EPS = 1e-11; void fast() { std::ios_base::sync_with_stdio(0); } vector<vector<int>> seq(1e5 + 9); int main() { int n, x; cin >> n; for (int i = 0; i < n; i++) { scanf( %d , &x); seq[x].push_back(i); } bool flag = true; vector<pair<int, int>> ans; for (int i = 0; i <= 1e5; i++) { flag = true; if (seq[i].size() == 0) continue; else if (seq[i].size() == 1) ans.push_back({i, 0}); else if (seq[i].size() == 2) ans.push_back({i, seq[i][1] - seq[i][0]}); else { for (int j = 2; j < seq[i].size() && flag; j++) { if (seq[i][j] - seq[i][j - 1] != seq[i][j - 1] - seq[i][j - 2]) flag = false; } if (flag) { ans.push_back({i, seq[i][1] - seq[i][0]}); } } } cout << ans.size() << endl; for (int i = 0; i < ans.size(); i++) { printf( %d %d n , ans[i].first, ans[i].second); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long int t; cin >> t; while (t--) { int n, m; cin >> n >> m; long int a[n + 1][m + 1]; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> a[i][j]; } } long int b[n + 1][m + 1]; for (int i = 1; i <= n; i++) { b[i][1] = 3; b[i][m] = 3; } for (int i = 1; i <= m; i++) { b[1][i] = 3; b[n][i] = 3; } b[1][1] = 2; b[1][m] = 2; b[n][1] = 2; b[n][m] = 2; for (int i = 2; i <= n - 1; i++) { for (int j = 2; j <= m - 1; j++) { b[i][j] = 4; b[i][j] = 4; } } int f = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (a[i][j] > b[i][j]) { f = 1; break; } } } if (f == 1) { cout << NO << endl; } else { cout << YES << endl; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cout << b[i][j] << ; } cout << endl; } } } }
|
#include <bits/stdc++.h> typedef long long LL; const double INF = 1e100; const int oo = ~0u >> 2; const double pi = acos(-1.0); const double EPS = 1e-8; const int MAXN = 100033; double a, b, c; double x11, x2; int main() { scanf( %lf%lf%lf , &a, &b, &c); x11 = sqrt(b * b - 4.0 * a * c); if (a > 0) { x2 = (-b - x11) / 2.0 / a; x11 = (-b + x11) / 2.0 / a; } else { x2 = (-b + x11) / 2.0 / a; x11 = (-b - x11) / 2.0 / a; } printf( %.012lf n%.012lf n , x11, x2); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { cin.tie(0); ios::sync_with_stdio(false); long long t; cin >> t; while (t--) { vector<long long> A(3); for (auto &a : A) cin >> a; sort((A).begin(), (A).end(), greater<long long>()); long long a, b, c; a = A[0]; b = A[1]; c = A[2]; long long ans = 0; if (a > 0) { a--; ans++; } if (b > 0) { b--; ans++; } if (c > 0) { c--; ans++; } if (a > 0 && b > 0) { a--; b--; ans++; } if (c > 0 && b > 0) { c--; b--; ans++; } if (a > 0 && c > 0) { a--; c--; ans++; } if (a > 0 && b > 0 && c > 0) { a--; b--; c--; ans++; } cout << ans << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { { long long int r, n, c, m, i, j, count = 0, x, a, b, y, sum = 0; long long int mn = 1e18, mx = 0, ans = 0, k, ind; long long int br = 0, T, rz = 0; string s = ; cin >> n; long long int a1, a2, a3, b1, b2, b3; cin >> a1 >> a2 >> a3; cin >> b1 >> b2 >> b3; mx = max(mx, a1 - b1 - b3); mx = max(mx, a2 - b1 - b2); mx = max(mx, a3 - b2 - b3); mn = 0; mn += min(a1, b2); mn += min(a2, b3); mn += min(a3, b1); cout << mx << << mn << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; inline void open(const char *s) {} inline int rd() { static int x, f; x = 0; f = 1; char ch = getchar(); for (; ch < 0 || ch > 9 ; ch = getchar()) if (ch == - ) f = -1; for (; ch >= 0 && ch <= 9 ; ch = getchar()) x = x * 10 + ch - 0 ; return f > 0 ? x : -x; } const int N = 1000010; int R, C, n, rt = 0, Lr; vector<int> a[N]; pair<int, int> b[N]; namespace LCT { struct tree { int ch[2], fa, rev; tree() { ch[0] = ch[1] = fa = rev = 0; } } tr[N]; int cnt = 0; inline bool isrt(int x) { return tr[tr[x].fa].ch[0] != x && tr[tr[x].fa].ch[1] != x; } inline void pushdown(int x) { if (!tr[x].rev) return; swap(tr[x].ch[0], tr[x].ch[1]); if (tr[x].ch[0]) tr[tr[x].ch[0]].rev ^= 1; if (tr[x].ch[1]) tr[tr[x].ch[1]].rev ^= 1; tr[x].rev = 0; } inline void clr(int x) { static int st[N], tt; for (st[tt = 1] = x; !isrt(x); x = tr[x].fa) st[++tt] = tr[x].fa; while (tt) pushdown(st[tt--]); } inline void rotate(int x) { static int y, z, t1, t2; y = tr[x].fa; z = tr[y].fa; t1 = tr[y].ch[1] == x; t2 = t1 ^ 1; if (!isrt(y)) tr[z].ch[tr[z].ch[1] == y] = x; tr[x].fa = z; tr[y].fa = x; if (tr[x].ch[t2]) tr[tr[x].ch[t2]].fa = y; tr[y].ch[t1] = tr[x].ch[t2]; tr[x].ch[t2] = y; } inline void splay(int x) { for (clr(x); !isrt(x); rotate(x)) { int y = tr[x].fa, z = tr[y].fa; if (isrt(y)) continue; if ((tr[y].ch[0] == x) ^ (tr[z].ch[0] == y)) rotate(x); else rotate(y); } } inline void access(int x) { for (int s = 0; x; s = x, x = tr[x].fa) { splay(x); tr[x].ch[1] = s; } } inline void makert(int x) { access(x); splay(x); tr[x].rev ^= 1; } inline int findrt(int x) { access(x); splay(x); pushdown(x); while (tr[x].ch[0]) x = tr[x].ch[0], pushdown(x); return x; } inline void link(int x, int y) { makert(x); access(y); splay(y); tr[x].fa = y; } inline void cut(int x, int y) { makert(y); access(x); splay(x); tr[tr[x].ch[0]].fa = 0; tr[x].ch[0] = 0; } } // namespace LCT namespace Seg { struct tree { int ls, rs, mx, cmx, tag; tree() { ls = rs = mx = cmx = tag = 0; } } tr[N << 1]; int cnt = 0; inline void pushup(int o) { tr[o].mx = max(tr[tr[o].ls].mx, tr[tr[o].rs].mx); tr[o].cmx = 0; if (tr[o].mx == tr[tr[o].ls].mx) tr[o].cmx += tr[tr[o].ls].cmx; if (tr[o].mx == tr[tr[o].rs].mx) tr[o].cmx += tr[tr[o].rs].cmx; } inline void pushdown(int o) { if (!tr[o].tag) return; static int ls, rs; ls = tr[o].ls, rs = tr[o].rs; tr[ls].mx += tr[o].tag; tr[ls].tag += tr[o].tag; tr[rs].mx += tr[o].tag; tr[rs].tag += tr[o].tag; tr[o].tag = 0; } void build(int &o, int l, int r) { o = ++cnt; if (l == r) return tr[o].mx = l, tr[o].cmx = 1, void(); int mid = (l + r) >> 1; build(tr[o].ls, l, mid); build(tr[o].rs, mid + 1, r); pushup(o); } void modify(int o, int l, int r, int L, int R, int d) { if (l == L && r == R) return tr[o].mx += d, tr[o].tag += d, void(); pushdown(o); int mid = (l + r) >> 1; if (L <= mid) modify(tr[o].ls, l, mid, L, min(mid, R), d); if (R > mid) modify(tr[o].rs, mid + 1, r, max(mid + 1, L), R, d); pushup(o); } pair<int, int> query(int o, int l, int r, int L, int R) { if (l == L && r == R) return pair<int, int>(tr[o].mx, tr[o].cmx); pushdown(o); int mid = (l + r) >> 1; pair<int, int> res = pair<int, int>(0, 0), tmp; if (L <= mid) res = query(tr[o].ls, l, mid, L, min(mid, R)); if (R > mid) { tmp = query(tr[o].rs, mid + 1, r, max(mid + 1, L), R); if (res.first == tmp.first) res.second += tmp.second; else res = max(res, tmp); } return res; } } // namespace Seg inline bool check(int p) { static int d[5], tt, x, y; tt = 0; x = b[p].first, y = b[p].second; if (x > 1 && a[x - 1][y] >= Lr && a[x - 1][y] < p) d[++tt] = LCT::findrt(a[x - 1][y]); if (y > 1 && a[x][y - 1] >= Lr && a[x][y - 1] < p) d[++tt] = LCT::findrt(a[x][y - 1]); if (x < R && a[x + 1][y] >= Lr && a[x + 1][y] < p) d[++tt] = LCT::findrt(a[x + 1][y]); if (y < C && a[x][y + 1] >= Lr && a[x][y + 1] < p) d[++tt] = LCT::findrt(a[x][y + 1]); sort(d + 1, d + tt + 1); for (int i = 1; i <= tt - 1; i++) if (d[i] == d[i + 1]) return 0; return 1; } inline void del(int p) { static int x, y; x = b[p].first, y = b[p].second; if (x > 1 && a[x - 1][y] >= p) LCT::cut(a[x - 1][y], p); if (y > 1 && a[x][y - 1] >= p) LCT::cut(a[x][y - 1], p); if (x < R && a[x + 1][y] >= p) LCT::cut(a[x + 1][y], p); if (y < C && a[x][y + 1] >= p) LCT::cut(a[x][y + 1], p); } inline void gao(int p) { static int x, y; for (; !check(p); ++Lr) del(Lr); x = b[p].first, y = b[p].second; if (x > 1 && a[x - 1][y] >= Lr && a[x - 1][y] < p) { LCT::link(a[x - 1][y], p); Seg::modify(rt, 1, n, 1, a[x - 1][y], 1); } if (y > 1 && a[x][y - 1] >= Lr && a[x][y - 1] < p) { LCT::link(a[x][y - 1], p); Seg::modify(rt, 1, n, 1, a[x][y - 1], 1); } if (x < R && a[x + 1][y] >= Lr && a[x + 1][y] < p) { LCT::link(a[x + 1][y], p); Seg::modify(rt, 1, n, 1, a[x + 1][y], 1); } if (y < C && a[x][y + 1] >= Lr && a[x][y + 1] < p) { LCT::link(a[x][y + 1], p); Seg::modify(rt, 1, n, 1, a[x][y + 1], 1); } } int main() { open( hh ); R = rd(); C = rd(); for (int i = 1; i <= R; i++) { a[i].resize(C + 1); for (int j = 1; j <= C; j++) b[a[i][j] = rd()] = pair<int, int>(i, j); } n = R * C; Seg::build(rt, 1, n); Lr = 1; long long ans = 1; for (int i = 2; i <= n; i++) { gao(i); pair<int, int> res = Seg::query(rt, 1, n, Lr, i); ans += res.first == i ? res.second : 0; } printf( %lld n , ans); return 0; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.