Datasets:
malteklaes
/
cpp-code-code_search_net-style

Dataset card Data Studio Files
xet
Community
1
func_code_string
stringlengths
59
71.4k
#include <bits/stdc++.h> using namespace std; inline int in() { int res = 0; char c; int f = 1; while ((c = getchar()) < 0 || c > 9 ) if (c == - ) f = -1; while (c >= 0 && c <= 9 ) res = res * 10 + c - 0 , c = getchar(); return res * f; } const int N = 100010; long long num[N], rd[N]; long long ans; pair<int, int> a[N << 1]; int main() { int n = in(), m = in(); for (int i = 1; i <= n; i++) { num[i] = 1; } for (int i = 0; i < m; i++) { a[i].first = in(); a[i].second = in(); } sort(a, a + m); for (int i = 0; i < m; i++) { int x = a[i].first, y = a[i].second; if (x > y) { num[x] = max(num[x], num[y] + 1); } else { num[y] = max(num[y], num[x] + 1); } rd[x]++; rd[y]++; } for (int i = 1; i <= n; i++) { ans = max(ans, 1LL * num[i] * rd[i]); } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; long long Cross(int x1, int y1, int x2, int y2) { return 1ll * x1 * y2 - 1ll * x2 * y1; } int main() { int xa, xb, xc, ya, yb, yc; scanf( %d%d%d%d%d%d , &xa, &ya, &xb, &yb, &xc, &yc); long long cross = Cross(xb - xa, yb - ya, xc - xa, yc - ya); if (cross == 0) printf( TOWARDS n ); else if (cross > 0) printf( LEFT n ); else printf( RIGHT n ); return 0; }
#include <bits/stdc++.h> using namespace std; bool SR(int &_x) { return scanf( %d , &_x) == 1; } bool SR(long long &_x) { return scanf( %lld , &_x) == 1; } bool SR(double &_x) { return scanf( %lf , &_x) == 1; } bool SR(char *_s) { return scanf( %s , _s) == 1; } bool RI() { return true; } template <typename I, typename... T> bool RI(I &_x, T &..._tail) { return SR(_x) && RI(_tail...); } void SP(const int _x) { printf( %d , _x); } void SP(const long long _x) { printf( %lld , _x); } void SP(const double _x) { printf( %.16lf , _x); } void SP(const char *s) { printf( %s , s); } void PL() { puts( ); } template <typename I, typename... T> void PL(const I _x, const T... _tail) { SP(_x); if (sizeof...(_tail)) putchar( ); PL(_tail...); } const int maxn = 5e5 + 5; int n, x[maxn], y[maxn]; void read() { RI(n); for (int i = (1); i <= int(n); i++) { int a, b; RI(x[i], y[i], a, b); } } int c[maxn]; void build() { for (int i = (1); i <= int(n); i++) { c[i] = 1 + (x[i] & 1) * 2 + (y[i] & 1); } } void sol() { PL( YES ); for (int i = (1); i <= int(n); i++) PL(c[i]); } int main() { read(); build(); sol(); return 0; }
#include <bits/stdc++.h> using namespace std; vector<int> V; vector<int> E[200005]; int d[200005]; int p[200005]; int find(int x) { while (p[x] != x) p[x] = p[p[x]], x = p[x]; return x; } int rnk[200005]; void meld(int x, int y) { x = find(x), y = find(y); if (rnk[x] > rnk[y]) swap(x, y); p[x] = y; rnk[y] = rnk[x] == rnk[y] ? rnk[y] + 1 : rnk[y]; } int s, t; void build() { fill(begin(d), end(d), 1e9); queue<int> Q; for (auto x : V) Q.emplace(x), d[x] = 0; while (!Q.empty()) { auto x = Q.front(); Q.pop(); for (auto y : E[x]) { if (d[y] == 1e9) d[y] = d[x] + 1, Q.emplace(y); } } } int n, m, k; bool test(int mid) { iota(begin(p), end(p), 0); fill(begin(rnk), end(rnk), 0); for (int x = 1; x <= n; ++x) { if (d[x] + 1 > mid) continue; for (auto y : E[x]) if (d[x] + d[y] + 1 <= mid) meld(x, y); } return find(s) == find(t); } int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> m >> k; for (int i = 1; i <= k; ++i) { int x; cin >> x; V.push_back(x); } for (int i = 1; i <= m; ++i) { int u, v; cin >> u >> v; E[u].push_back(v); E[v].push_back(u); } cin >> s >> t; if (find(begin(V), end(V), t) == end(V)) V.push_back(t); build(); int l = 1, r = n; while (l < r) { int mid = (l + r) / 2; if (test(mid)) r = mid; else l = mid + 1; } if (test(l)) cout << l << endl; else cout << -1 << endl; return 0; }
#include <bits/stdc++.h> using namespace std; inline void R(int &x) { char ch = getchar(); x = 0; for (; ch < 0 ; ch = getchar()) ; for (; ch >= 0 ; ch = getchar()) x = x * 10 + ch - 0 ; } const int N = 100005; double x, y, ans; int n; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %lf%lf , &x, &y); ans += y; } printf( %.3lf n , ans / n + 5); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int k; cin >> k; vector<long long> a(k); for (int h = 0; h < a.size(); h++) { cin >> a[h]; }; int gg = max_element(a.begin(), a.end()) - a.begin(); for (int i = k - 1; i > gg; i--) { if (a[i] > a[i - 1]) { cout << no ; return 0; } } for (int i = 0; i < gg; i++) { if (a[i] > a[i + 1]) { cout << no ; return 0; } } cout << YES ; }
#include <bits/stdc++.h> using namespace std; int main() { int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2; cout << max(abs(y2 - y1), abs(x2 - x1)); return 0; }
#include <bits/stdc++.h> int main() { int n, k, i; double t, z, a, b, d = 0; scanf( %d %d , &n, &k); int x[n], y[n]; for (i = 0; i < n; i++) { scanf( %d %d , &x[i], &y[i]); } for (i = 1; i < n; i++) { a = x[i - 1] - x[i]; b = y[i - 1] - y[i]; a = pow(a, 2); b = pow(b, 2); z = a + b; z = sqrt(z); d = d + z; } t = (d / 50) * k; printf( %.9lf , t); return 0; }
#include <bits/stdc++.h> using namespace std; int main(void) { srand(time(0)); cout << fixed << setprecision(7); cerr << fixed << setprecision(7); int n, q; scanf( %d%d , &n, &q); static long long s[1 << 23]; for (int i = 1; i <= n; ++i) scanf( %I64d , &s[i]), s[i + n] = s[i + n + n] = s[i]; for (int i = 2; i <= n + n + n; ++i) s[i] += s[i - 1]; static int nxt[1 << 23]; for (int i = 1; i <= n; ++i) nxt[i] = i; for (int i = n + 1; i <= n + n + n; ++i) nxt[i] = nxt[i - n]; while (q--) { int v; scanf( %d , &v); if (s[n] <= v) { cout << 1 n ; continue; } static int a[1 << 22]; int cnt = 0; for (int i = 1; i <= n + n; ++i) { while (s[cnt] - s[i - 1] <= v) ++cnt; a[i] = cnt; } int ans = 0; cnt = 1; for (int i = 1; i <= n; ++i) cnt = nxt[a[cnt]]; const int lim = cnt + n; while (cnt < lim) ++ans, cnt = a[cnt]; cout << ans << n ; } cerr << Time elapsed : << clock() * 1000.0 / CLOCKS_PER_SEC << ms << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int n, h; double p; double memexpected[2001][2001][2][2]; int calculado[2001][2001][2][2]; int ri[2001], le[2001]; int v[2001]; double expected(int i1, int i2, int l1, int l2) { if (i1 > i2) return 0; double &mem = memexpected[i1][i2][l1][l2]; if (calculado[i1][i2][l1][l2]) return mem; calculado[i1][i2][l1][l2] = 1; mem = 0; int distle = h; if (i1 > 0) distle = (l1 == 0) ? min(v[i1] - v[i1 - 1], h) : min(v[i1] - (v[i1 - 1] + h), h); int distri = h; if (i2 < n - 1) distri = (l2 == 1) ? min(v[i2 + 1] - v[i2], h) : min(v[i2 + 1] - h - v[i2], h); int RI = min(ri[i1], i2); int lenri = min(v[RI] + h - v[i1], v[i2] - v[i1] + distri); int LE = max(le[i2], i1); int lenle = min(v[i2] - v[LE] + h, v[i2] - v[i1] + distle); double mem1 = 0.5 * (p * (distle + expected(i1 + 1, i2, 0, l2)) + (1 - p) * (lenri + expected(RI + 1, i2, 1, l2))); double mem2 = 0.5 * ((1 - p) * (distri + expected(i1, i2 - 1, l1, 1)) + p * (lenle + expected(i1, LE - 1, l1, 0))); mem = mem1 + mem2; return mem; } int main() { cout.setf(ios::fixed); cout.precision(10); cin >> n >> h >> p; for (int i = 0; i < n; i++) cin >> v[i]; sort(v, v + n); le[0] = 0; for (int i = 1; i < n; i++) le[i] = (v[i] - v[i - 1] < h) ? le[i - 1] : i; ri[n - 1] = n - 1; for (int i = n - 2; i >= 0; i--) ri[i] = (v[i + 1] - v[i] < h) ? ri[i + 1] : i; cout << expected(0, n - 1, 0, 1) << endl; }
#include <bits/stdc++.h> using namespace std; const long long int mod = 1e9 + 7; const int inf = 1e9; const int N = 2e5; void solve() { long long int d, m; cin >> d >> m; long long int mx; for (long long int i = 32; i >= 0; i--) { if ((1LL << i) & d) { mx = i; break; } } long long int dp[mx + 1]; dp[mx] = (d - (1LL << mx) + 1); long long int res = dp[mx]; res %= m; for (long long int i = mx - 1; i >= 0; i--) { dp[i] = (1LL << i) * (1 + res); res += dp[i]; res %= m; } cout << res << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; map<int, int> m; pair<bool, char> check(int a, string s) { int flag = 0; char x = s[a], e; for (long long int i = 1 + (x - a ); i < 26; i++) { if (m.count(i)) { return {true, char(i + a )}; } } return {false, f }; } int main() { ios_base ::sync_with_stdio(false), cin.tie(NULL), cout.tie(0); int a, b; cin >> a >> b; string s; cin >> s; for (long long int i = 0; i < s.size(); i++) { m[s[i] - a ]++; } if (a < b) { cout << s; sort(s.begin(), s.end()); for (long long int i = 0; i < b - a; i++) cout << s[0]; } else { int k = 0; char e; for (long long int i = b - 1; i >= 0; i--) { pair<bool, char> p = check(i, s); if (p.first) { e = p.second; k = i; break; } } for (long long int i = 0; i < k; i++) cout << s[i]; cout << e; sort(s.begin(), s.end()); if (b - k - 1 > 0) { for (long long int i = 0; i < b - k - 1; i++) cout << s[0]; } } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int c1 = 0; int c2 = 0; int a[1000]; for (int i = 1;; i++) { if (i % 2 == 0) { a[i] = (i * i) / 2; } else { a[i] = (i / 2) * (i / 2) + ceil(i / 2.0) * ceil(i / 2.0); } if (a[i] > 200) break; } for (int i = 0; i < n; i++) { string s1, s2; cin >> s1 >> s2; if (s2 == soft ) c1++; else c2++; } if (c1 == c2 && c1 == 1) cout << 2; else if (c1 == 1 && c2 == 0) cout << 1; else if (c2 == 1 && c1 == 0) cout << 1; else { int x = max(c1, c2); for (int i = 1;; i++) { if (a[i] < x && x <= a[i + 1]) { cout << i + 1; return 0; } } } }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int n, L, a; int t[N], l[N]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); srand(time(NULL)); cin >> n >> L >> a; int res = 0; for (int i = 1; i <= n; i++) { cin >> t[i] >> l[i]; int len = t[i] - (t[i - 1] + l[i - 1]); res += len / a; } res += (L - (t[n] + l[n])) / a; cout << res; }
#include <bits/stdc++.h> using namespace std; const int kMaxN = 100010; const int kMaxA = 1000000010; int a[kMaxN]; signed main() { cin.tie(0); ios::sync_with_stdio(false); long long n; cin >> n; for (long long i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); long long ans = 0; for (long long x = 1; (1LL << x) < 2 * kMaxA; x++) { long long val = (1 << x); for (long long i = 0; i < n; i++) { long long num = upper_bound(a + i + 1, a + n, val - a[i]) - lower_bound(a + i + 1, a + n, val - a[i]); ans += num; } } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int MAXN = 1e6 + 50; const int INF = 0x3f3f3f3f; void bf(int A, int B) { for (long long a = 1; a <= A; a++) for (long long b = 1; b <= B; b++) { if ((a * b + a + b) == stol(to_string(a) + to_string(b))) cout << a << << b << endl; } } int main() { int cs; while (cin >> cs) { while (cs--) { int a, b; cin >> a >> b; long long ret = to_string(b + 1).size() - 1; cout << a * ret << endl; } } return 0; }
#include <bits/stdc++.h> using namespace std; template <typename T> using min_pq = priority_queue<T, vector<T>, greater<T>>; template <typename T> using max_pq = priority_queue<T>; const int inf = 2e9 + 5; const long long l_inf = 2e18 + 5; const int mod_v = 1e9 + 7; const int max_n = 1e5 + 5; const int dx[4] = {-1, 0, 1, 0}; const int dy[4] = {0, 1, 0, -1}; template <typename T> T gcd(T a, T b) { while (b) { T temp = a % b; a = b; b = temp; } return a; } template <typename T> tuple<T, T, T> egcd(T a, T b) { T x1 = 1, x2 = 0, y1 = 0, y2 = 1; while (b) { T q = a / b, r = a % b; T new_x = x1 - q * x2, new_y = y1 - q * y2; x1 = x2, y1 = y2, x2 = new_x, y2 = new_y; a = b, b = r; } return make_tuple(a, x1, y1); } inline long long lcm(long long a, long long b) { return a * b / gcd(a, b); } template <typename T> inline T mod(T a, T b = mod_v) { return (a % b + b) % b; } template <typename T> inline T mod_inv(T a, T b = mod_v) { return mod(get<1>(egcd(a, b)), b); } template <typename T> inline T sum(T a, T b, T m = mod_v) { return mod(mod(a, m) + mod(b, m), m); } template <typename T> inline T difference(T a, T b, T m = mod_v) { return mod(mod(a, m) - mod(b, m), m); } inline long long product(long long a, long long b, long long m = mod_v) { return mod(mod(a, m) * mod(b, m), m); } inline long long quotient(long long a, long long b, long long m = mod_v) { return mod(mod(a, m) * mod_inv(b, m), m); } template <typename T, typename T2> ostream &operator<<(ostream &s, const pair<T, T2> &p) { return s << p.first << << p.second << ; } template <typename T, typename T2> istream &operator>>(istream &s, pair<T, T2> &p) { return s >> p.first >> p.second; } template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) { for (auto it : v) s << it << ; return s; } template <typename T> istream &operator>>(istream &s, vector<T> &v) { for (auto it = (v).begin(), it_ = (v).end(); it != it_; ++it) s >> *it; return s; } template <typename T> void read_range(T beg, T end) { while (beg != end) cin >> *beg++; } template <typename T> void print_range(T beg, T end) { while (beg != end) cout << *beg++ << ; } struct reader { template <typename T> reader &operator,(T &v) { cin >> v; return *this; } } rdr; struct debugger { template <typename T> debugger &operator,(const T &v) { cerr << v << , ; return *this; } } dbg; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int x[2]; cin >> x[0] >> x[1]; int a[2] = {0, 0}; for (int i = 0;; ++i) { int n_a; if (i / 2 % 2) n_a = a[i % 2] - (i / 2 + 1); else n_a = a[i % 2] + (i / 2 + 1); if (a[1 - i % 2] == x[1 - i % 2] and ((x[i % 2] >= a[i % 2] and x[i % 2] <= n_a) or (x[i % 2] <= a[i % 2] and x[i % 2] >= n_a))) { cout << i; return 0; } a[i % 2] = n_a; } return 0; }
#include <bits/stdc++.h> using namespace std; int m, n, rowStart[1010], rowEnd[1010], colStart[1010], colEnd[1010], sum[1010][1010]; int startX = -1, startY; string a[1010]; void quit() { cout << -1 << endl; exit(0); } int getSum(int x, int y, int row, int col) { return sum[x][y] + sum[x - row][y - col] - sum[x - row][y] - sum[x][y - col]; } int ok(int row, int col) { int x = startX + row - 1, y = startY + col - 1, covered = col * row; while (1) { if (x < m && getSum(x + 1, y, row, col) == row * col) { x++; covered += col; } else if (y < n && getSum(x, y + 1, row, col) == row * col) { y++; covered += row; } else break; } return covered == sum[m][n]; } void solve() { int sideRow = colEnd[startY] - colStart[startY] + 1; int sideCol = rowEnd[startX] - rowStart[startX] + 1; int ans = m * n + 1; for (int col = 1; col <= sideCol; col++) if (ok(sideRow, col)) { ans = min(ans, sideRow * col); break; } for (int row = 1; row <= sideRow; row++) if (ok(row, sideCol)) { ans = min(ans, sideCol * row); break; } if (ans > m * n) ans = -1; cout << ans << endl; } int main() { ios::sync_with_stdio(0); cin >> m >> n; for (int i = 1; i <= m; i++) { cin >> a[i]; rowStart[i] = rowEnd[i] = -1; int cntX = 0; for (int j = 1; j <= n; j++) { sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1]; if (a[i][j - 1] == X ) { if (startX < 0) { startX = i; startY = j; } if (rowStart[i] < 0) rowStart[i] = j; rowEnd[i] = j; cntX++; sum[i][j]++; } } if (rowStart[i] > 0 && cntX != rowEnd[i] - rowStart[i] + 1) quit(); } for (int j = 1; j <= n; j++) { colStart[j] = colEnd[j] = -1; int cntX = 0; for (int i = 1; i <= m; i++) if (a[i][j - 1] == X ) { if (colStart[j] < 0) colStart[j] = i; colEnd[j] = i; cntX++; } if (colStart[j] > 0 && cntX != colEnd[j] - colStart[j] + 1) quit(); } solve(); }
#include <bits/stdc++.h> using namespace std; template <typename T, typename T1> T amax(T a, T1 b) { if (b > a) a = b; return a; } template <typename T, typename T1> T amin(T a, T1 b) { if (b < a) a = b; return a; } template <typename T> T amod(T a) { if (a < 0) a = -a; return a; } void solve() { long long int n, s, a, sum = 0; cin >> n >> s; long long int maxs = 0; for (long long int i = 0; i < n; i++) { cin >> a; sum += a; maxs = max(a, maxs); } if ((sum - maxs) <= s) { cout << YES ; } else { cout << NO ; } } int main() { long long int t; t = 1; while (t--) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; int ans[21][21]; int cnt[1100]; int n; vector<int> fang, four; void output() { for (int i = 1; i <= n; ++i) { for (int j = 1; j <= n; ++j) { cout << ans[i][j] << ; } cout << endl; } } bool check() { int sum = 0; for (int i = 0; i < fang.size(); ++i) { if (cnt[fang[i]] >= 4) { four.push_back(fang[i]); sum += cnt[fang[i]] / 4; } } return sum >= ((n / 2) * (n / 2)); } int main() { int num; cin >> n; for (int i = 0; i < n * n; ++i) { cin >> num; cnt[num]++; } int flag = 1, flag2 = 0, lcqi; for (int i = 1; i <= 1000; ++i) { if (cnt[i]) { fang.push_back(i); if (cnt[i] % 4) { flag = 0; } if (cnt[i] & 1) flag2++, lcqi = fang.size() - 1; } else continue; } if ((n & 1) == 0) { if (flag) { cout << YES n ; int lc = 0; for (int i = 1; i <= n / 2; ++i) { for (int j = 1; j <= n / 2; ++j) { ans[i][j] = ans[n - i + 1][j] = ans[i][n - j + 1] = ans[n - i + 1][n - j + 1] = fang[lc]; cnt[fang[lc]] -= 4; if (cnt[fang[lc]] == 0) { lc++; } } } output(); } else cout << NO n ; } else { if (flag2 != 1) { cout << NO n ; return 0; } ans[n / 2 + 1][n / 2 + 1] = fang[lcqi]; cnt[fang[lcqi]]--; int ok = check(); if (!ok) { puts( NO n ); return 0; } cout << YES n ; int lcf = 0; for (int i = 1; i <= n / 2; ++i) { for (int j = 1; j <= n / 2; ++j) { ans[i][j] = ans[n - i + 1][j] = ans[i][n - j + 1] = ans[n - i + 1][n - j + 1] = four[lcf]; cnt[four[lcf]] -= 4; if (cnt[four[lcf]] < 4) { lcf++; } } } lcf = 0; while (lcf < fang.size() && cnt[fang[lcf]] == 0) { lcf++; } for (int i = 1; i <= n / 2; ++i) { ans[i][n / 2 + 1] = ans[n - i + 1][n / 2 + 1] = fang[lcf]; cnt[fang[lcf]] -= 2; if (cnt[fang[lcf]] == 0) { while (lcf < fang.size() && cnt[fang[lcf]] == 0) { lcf++; } } } for (int i = 1; i <= n / 2; ++i) { ans[n / 2 + 1][i] = ans[n / 2 + 1][n - i + 1] = fang[lcf]; cnt[fang[lcf]] -= 2; if (cnt[fang[lcf]] == 0) { while (lcf < fang.size() && cnt[fang[lcf]] == 0) { lcf++; } } } output(); } return 0; }
#include <bits/stdc++.h> const int mod = 1000000007; const int modx = 998244353; using namespace std; void thunder() { long long n; cin >> n; vector<long long> a(n), b(n); long long i, j; for (i = 0; i < n; i++) cin >> a[i]; map<long long, long long> m; for (i = 0; i < n; i++) { long long idx = i + a[i % n]; idx %= n; idx += n; idx %= n; if (m.count(idx) == 0) m[idx]++; else { cout << NO << n ; return; } } cout << YES << n ; return; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t = 1; cin >> t; while (t--) thunder(); }
#include <bits/stdc++.h> using namespace std; long long sums[30000], dp[25][3000][25], can[3000], n, i, j, k, x, y, a[300]; int main() { cin >> n; for (i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); reverse(a, a + n); for (i = 0; i < n; i++) if (a[i] == 1) { k = i; break; } if (k == 0) { if (n == 1) cout << YES << endl; else cout << NO << endl; return 0; } if (k > 11) { cout << NO << endl; return 0; } for (i = 0; i < (1 << k); i++) { long long cnt = 0; for (j = 0; j < k; j++) if (i & (1 << j)) sums[i] += a[j], cnt++; can[i] = cnt; } dp[0][1][0] = 1; for (i = 0; i < k; i++) for (j = 0; j < (1 << k); j++) if (j & ((1 << (i + 1)) - 1) == (1 << (i + 1)) - 1) for (x = 0; x <= n - k; x++) { long long tmp = (1 << k) - 1 - j; for (y = tmp;; y = ((y - 1) & tmp)) { if (a[i] - sums[y] - 1 >= 0 && can[y] + a[i] - sums[y] - 1 != 1) { if (dp[i][j][x] == 1 && x + a[i] - sums[y] - 1 <= n - k && a[i] - sums[y] - 1 >= 0) { dp[i + 1][j | y][x + a[i] - sums[y] - 1] = 1; } } if (y == 0) break; } } if (dp[k][(1 << k) - 1][n - k]) cout << YES << endl; else cout << NO << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; const int mod = 1e9 + 7; int n, a[N]; vector<int> get_divisors(int u) { vector<int> res; for (int i = 1; i * i <= u; ++i) { if (u % i == 0) { res.push_back(i); if (i != u / i) res.push_back(u / i); } } sort(res.begin(), res.end()); return res; } int add(int a, int b) { return (a + b) % mod; } int sub(int a, int b) { long long result = a - b; if (result < 0) result += mod; return result; } long long mul(long long a, long long b) { return (a * b) % mod; } int modpow(int base, int exp) { long long res = 1; while (exp > 0) { if (exp % 2) res = (res * base) % mod; base = (1ll * base * base) % mod; exp /= 2; } return (int)res; } int main() { cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); long long res = 0; for (int i = 1; i <= a[n - 1]; ++i) { vector<int> divisors = get_divisors(i); int prev = -1, dsz = divisors.size(); long long toAdd = 1; for (int j = 1; j < dsz; ++j) { int pos = lower_bound(a, a + n, divisors[j]) - a - 1; int count = pos - prev; toAdd = mul(toAdd, modpow(j, count)); prev = pos; } int count = n - 1 - prev; assert(count > 0); long long added_value = modpow(dsz, count); added_value = sub(added_value, modpow(dsz - 1, count)); toAdd = mul(toAdd, added_value); res = add(res, toAdd); } cout << res << endl; return 0; }
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; long int mod = 1e9 + 7; long int i, j, n, t, m, k; vector<pair<long int, long int> > a, b; set<long int> c; bool cmp(const pair<long int, long int> &l, const pair<long int, long int> &r) { return l.first < r.first; } int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> m; for (long int i = 0; i < m; i++) { cin >> j; a.push_back(make_pair(j, i)); c.insert(j); } sort(a.begin(), a.end()); for (long int i = 0; i < a.size(); i++) { if ((i + 1) < a.size()) { long int rag = a[i].second, bha = a[i].second; j = i + 1; while (a[i].first == a[j].first) { rag = max(rag, a[j].second); bha = min(bha, a[j].second); j++; if (j >= a.size()) break; } i = j - 1; b.push_back(make_pair(a[i].first, bha)); b.push_back(make_pair(a[i].first, rag)); } else { b.push_back(make_pair(a[i].first, a[i].second)); b.push_back(make_pair(a[i].first, a[i].second)); } } for (long int i = 1; i < n + 1; i++) { long int l, rag = -1, bha = -1, rag1 = -1, bha1 = -1; l = lower_bound(b.begin(), b.end(), pair<long int, long int>(i, 0), cmp) - b.begin(); if (l >= b.size()) l--; if (b[l].first == i) { bha = b[l].second; rag = b[l + 1].second; } l = lower_bound(b.begin(), b.end(), pair<long int, long int>(i + 1, 0), cmp) - b.begin(); if (l >= b.size()) l--; if (b[l].first == i + 1) { bha1 = b[l].second; rag1 = b[l + 1].second; } if ((rag == -1 && bha == -1) && (rag1 == -1 && bha1 == -1)) continue; else if ((rag != -1 && bha != -1) && (rag1 != -1 && bha1 != -1)) { if (bha < rag1) t++; if (bha1 < rag) t++; } } t += c.size(); t = ((3 * n) - 2) - t; cout << t; return 0; }
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<ll, ll>; const ll MOD = 1e9 + 7, N = 1e5 + 10; const ll LG = log2(N) + 1; struct LCA { vector<vector<ll>> G, parent; vector<ll> tin, tout, depth; ll timer; ll n; ll LG; LCA(vector<vector<ll>> G, ll R = 1) { this->G = G; this->n = G.size(); this->LG = log2(n) + 1; this->timer = 0; tin.assign(n, 0); tout.assign(n, 0); depth.assign(n, 0); tin[0] = ++timer; parent = vector<vector<ll>>(n, vector<ll>(LG)); dfs(R); tout[0] = ++timer; compute(); } void dfs(ll u, ll p = 0, ll d = 0) { parent[u][0] = p; tin[u] = ++timer; depth[u] = d; for (auto &v : G[u]) { if (v != p) { dfs(v, u, d + 1); } } tout[u] = ++timer; } void compute() { for (ll j = 1; j < LG; j++) { for (ll i = 1; i < n; i++) { if (parent[i][j - 1]) { parent[i][j] = parent[parent[i][j - 1]][j - 1]; } } } } bool is_anc(ll u, ll v) { return tin[u] <= tin[v] and tout[v] <= tout[u]; } ll lca(ll u, ll v) { if (is_anc(u, v)) return u; if (is_anc(v, u)) return v; for (ll i = LG - 1; i >= 0; i--) { if (!is_anc(parent[u][i], v)) { u = parent[u][i]; } } u = parent[u][0]; return u; } ll dist(ll u, ll v) { return depth[u] + depth[v] - 2 * depth[lca(u, v)]; } }; int32_t main() { ios::sync_with_stdio(false); cin.tie(NULL); ll n, q; cin >> n >> q; vector<vector<ll>> G(n + 1); for (ll i = 2; i < n + 1; i++) { ll p; cin >> p; G[i].push_back(p); G[p].push_back(i); } LCA lc(G); while (q--) { ll a, b, c; cin >> a >> b >> c; vector<ll> A = {a, b, c}; sort(A.begin(), A.end()); ll ans = 0; ll cn = 0; do { cn++; ll s = A[0], f = A[1], t = A[2]; if (lc.lca(s, t) == lc.lca(f, t)) { if (lc.depth[lc.lca(s, t)] <= lc.depth[t]) { ans = max(ans, lc.depth[t] + lc.depth[lc.lca(s, f)] - 2 * lc.depth[lc.lca(s, t)]); } } else { if (lc.depth[lc.lca(s, t)] < lc.depth[t] and lc.depth[lc.lca(f, t)] < lc.depth[t]) { ans = max(ans, lc.depth[t] - max(lc.depth[lc.lca(s, t)], lc.depth[lc.lca(f, t)])); } } } while (next_permutation(A.begin(), A.end())); cout << ans + 1 << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 154321; int n, m, r, k, row[N], col[N]; long long ans = 0; struct node { int a, b; long long val; bool operator<(const node &rhs) const { return val < rhs.val; } }; priority_queue<node> pq; int main() { cin >> n >> m >> r >> k; for (int i = 1; i <= n; ++i) { int lo = max(1, i - r + 1); int hi = min(n - r + 1, i); row[i] = (hi - lo + 1); } for (int i = 1; i <= m; ++i) { int lo = max(1, i - r + 1); int hi = min(m - r + 1, i); col[i] = (hi - lo + 1); } sort(row + 1, row + n + 1); sort(col + 1, col + m + 1); for (int i = 1; i <= n; ++i) { node cur; cur.a = i; cur.b = m; cur.val = (1LL * row[i] * col[m]); pq.push(cur); } for (int i = 1; i <= k; ++i) { node cur = pq.top(); pq.pop(); ans += cur.val; if (cur.b > 1) { --cur.b; cur.val = (1LL * row[cur.a] * col[cur.b]); pq.push(cur); } } cout << fixed << setprecision(12); cout << (long double)ans / (long double)(1LL * (n - r + 1) * (m - r + 1)) << n ; return 0; }
#include <bits/stdc++.h> using namespace std; mt19937 rnd(time(0)); const long long inf = 0x3f3f3f3f3f3f3f3fLL; const long long N = 1e5 + 10; const long long MOD = 1e9 + 7; long long n, m, s; vector<vector<long long>> g(N); bool vis[N][2]; long long par[N][2], mark[N]; void dfs(long long u, long long f) { vis[u][f] = 1; for (auto i : g[u]) { if (!vis[i][f ^ 1]) { par[i][f ^ 1] = u; dfs(i, f ^ 1); } } } bool cyc(long long u) { mark[u] = 1; for (auto i : g[u]) { if (mark[i] == 1) return true; if (mark[i] == 0 && cyc(i)) return true; } mark[u] = 2; return false; } int32_t main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> m; long long sz, x; for (long long i = 1; i <= n; i++) { cin >> sz; for (long long j = 0; j < sz; j++) { cin >> x; g[i].push_back(x); } } cin >> s; dfs(s, 0); for (long long i = 1; i <= n; i++) { if ((long long)g[i].size() == 0 && vis[i][1]) { vector<long long> res; long long node = i, f = 1; res.push_back(node); while (node != s || f != 0) { node = par[node][f]; f ^= 1; res.push_back(node); } reverse(res.begin(), res.end()); cout << Win << n ; for (auto i : res) cout << i << ; cout << n ; return 0; } } if (cyc(s)) cout << Draw << n ; else cout << Lose << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const double EPS = 1e-8; int n, t, h, s; char road[500001]; int H[500001], S[500001]; bool time(int k) { vector<pair<int, int> > step; step.push_back(make_pair(-1, -1)); for (int i = 0, j = 0; i < h; i++) { if (k) { k--; step.push_back(make_pair(H[i], H[i])); } else if (H[i] > S[j]) { step.push_back(make_pair(H[i], H[i])); j++; } else { int l = (int)(step.size()) - 1; if (H[i] < step[l].second) step[l].second = S[j]; else step.push_back(make_pair(H[i], S[j])); j++; } } int tt = 0; for (int i = 1; i < (int)(step.size()); i++) { tt += (step[i].second - step[i - 1].first) + (step[i].second - step[i].first); } tt = min(tt, (n * 2) - 1); return tt <= t; } int main() { scanf( %d %d n , &n, &t); scanf( %s n , road); h = 0, s = 0; for (int i = 0; i < n; i++) { if (road[i] == H ) H[h++] = i; if (road[i] == S ) S[s++] = i; } if (H[h - 1] >= t) { cout << -1 << endl; return 0; } int r = max(h - s, 0), e = h; while (r < e) { int mi = (r + e) >> 1; (time(mi)) ? e = mi : r = mi + 1; } cout << e << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int M = 1000500; int n, m; bool vis[M]; int fa[M], deg[M], in[M]; inline int read() { int x = 0; char ch = getchar(); while (ch > 9 || ch < 0 ) ch = getchar(); while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); return x; } inline int find(int x) { if (x != fa[x]) return fa[x] = find(fa[x]); return x; } inline void unionn(int a, int b) { int r1 = find(a), r2 = find(b); if (r1 != r2) fa[r2] = r1; return; } inline void constt() { for (int i = 1; i <= n; i++) fa[i] = i, vis[i] = in[i] = deg[i] = 0; return; } int main() { while (scanf( %d%d , &n, &m) != EOF) { constt(); vis[1] = 1; for (int i = 1; i <= m; i++) { int u = read(), v = read(); if (u != v) { in[u]++, in[v]++; vis[u] = vis[v] = 1; unionn(u, v); } else vis[u] = 1; } for (int i = 1; i <= n; i++) if (in[i] & 1) deg[find(i)]++; int ans = 0, que = 0, cnt = 0; for (int i = 1; i <= n; i++) if (vis[i] && find(i) == i) { if (deg[i]) ans += deg[i]; else que++; cnt++; } if (cnt == 1) printf( %d n , ans / 2); else printf( %d n , ans / 2 + que); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int x = 0, y = 0, z = 0, a, b, c; for (int i = 0; i < n; i++) { cin >> a >> b >> c; x += a; y += b; z += c; } if (x == 0 and y == 0 and z == 0) cout << YES << endl; else cout << NO << endl; }
#include <bits/stdc++.h> #pragma comment(linker, /STACK:16777216 ) using namespace std; int a, b, c, d, i, j, n, m, k, g, s; long long ans; pair<pair<int, int>, pair<int, int> > edges[50001]; vector<int> sm[201]; int cs[201][201]; pair<int, int> cur[201]; bool found; bool used[201]; inline void removeSm(int oa, int ob) { for (int _n(((int)((sm[oa]).size())) - 1), i(0); i <= _n; i++) { if (sm[oa][i] == ob) { swap(sm[oa][i], sm[oa].back()); sm[oa].pop_back(); return; } } } inline void replaceTreeEdge(int oa, int ob, int a, int b, int c) { removeSm(oa, ob); removeSm(ob, oa); sm[a].push_back(b); sm[b].push_back(a); cs[a][b] = cs[b][a] = c; cs[oa][ob] = cs[ob][oa] = cs[0][0]; for (int _n((k)-1), i(0); i <= _n; i++) { if ((cur[i].first == oa && cur[i].second == ob) || (cur[i].first == ob && cur[i].second == oa)) { cur[i] = make_pair(a, b); break; } } } void dfs(int v, int st, int en, int c, int cur = -1, int ca = -1, int cb = -1) { used[v] = 1; if (v == en) { found = 1; if (cur <= c) return; replaceTreeEdge(ca, cb, st, en, c); return; } for (int _n(((int)((sm[v]).size())) - 1), i(0); i <= _n; i++) { int w = sm[v][i]; if (used[w]) continue; int nx = cur, na = ca, nb = cb; if (cs[v][w] > nx) { nx = cs[v][w]; na = v; nb = w; } dfs(w, st, en, c, nx, na, nb); if (found) return; } } inline void addEdge(int a, int b, int c) { if (a == b) return; if (cs[a][b] <= 1000000000) { if (cs[a][b] <= c) return; cs[a][b] = cs[b][a] = c; return; } memset(used, 0, n); found = 0; dfs(a, a, b, c); if (!found) { cur[k++] = make_pair(a, b); cs[a][b] = cs[b][a] = c; sm[a].push_back(b); sm[b].push_back(a); } } int main() { scanf( %d%d , &n, &m); scanf( %d%d , &g, &s); for (int _n((m)-1), i(0); i <= _n; i++) { scanf( %d%d%d%d , &a, &b, &c, &d); --a; --b; edges[i] = make_pair(make_pair(c, d), make_pair(a, b)); } sort(edges, edges + m); memset(cs, 63, sizeof(cs)); k = 0; ans = 2000000000000000000LL + 1; for (int _n((m)-1), i(0); i <= _n; i++) { addEdge(edges[i].second.first, edges[i].second.second, edges[i].first.second); if (k == n - 1) { a = 0; for (int _n((n - 1) - 1), j(0); j <= _n; j++) if (cs[cur[j].first][cur[j].second] > a) a = cs[cur[j].first][cur[j].second]; if ((long long)a * s + (long long)g * edges[i].first.first < ans) ans = (long long)a * s + (long long)g * edges[i].first.first; } } if (ans > 2000000000000000000LL) ans = -1; cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; int main() { long long t; scanf( %lld , &t); string s; while (t--) { map<char, long long> mp, mpp; string str, txt; cin >> s; long long cur = 50, flag = 0, mn = 50, mrk = 1, mx = 50, i; for (i = 0; i < s.size(); i++) { if (!mp[s[i]]) { if (cur == mx) { str += s[i]; mpp[s[i]] = cur; cur++; mx = max(mx, cur); } else if (cur == mx - 1) { str += s[i]; mpp[s[i]] = mx; cur = mx + 1; mx = cur; } else if (cur == mn) { cur--; mn = cur; txt += s[i]; mpp[s[i]] = cur; } else { mrk = 0; break; } mp[s[i]] = 1; } else { if (cur == mx) { if (((mx - 1) - mpp[s[i]]) > 1) { mrk = 0; break; } else { cur = mpp[s[i]]; } } else if (abs(cur - mpp[s[i]]) > 1) { mrk = 0; break; } else { cur = mpp[s[i]]; mn = min(mn, cur); mx = max(mx, cur); } } } if (!mrk) { printf( NO n ); continue; } reverse(txt.begin(), txt.end()); str = txt + str; for (char c = a ; c <= z ; c++) { if (!mp[c]) str += c; } printf( YES n ); cout << str << endl; } }
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n; int ans = 0; int l1min = 1e9, l1max = 0, r1min = 1e9, r1max = 0; for (int i = 1; i <= n; i++) { int l, r; cin >> l >> r; l1min = min(l1min, l); l1max = max(l1max, l); r1max = max(r1max, r); r1min = min(r1min, r); } cin >> m; int l2min = 1e9, l2max = 0, r2min = 1e9, r2max = 0; for (int i = 1; i <= m; i++) { int l, r; cin >> l >> r; l2min = min(l2min, l); l2max = max(l2max, l); r2max = max(r2max, r); r2min = min(r2min, r); } ans = max(ans, l1max - r2min); ans = max(ans, l2max - r1min); cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, t; cin >> n >> t; vector<int> a(n); for (int& ai : a) cin >> ai; auto build = [&](int t) { vector<int> ret; while (t--) { ret.insert(end(ret), begin(a), end(a)); } return ret; }; const int INF = 1e9; auto get_list = [&](const vector<int>& a) { vector<int> lis(int(a.size()), 1); vector<int> dp(int(a.size()) + 1, INF); dp[0] = -1; for (int i = 0; i < int(a.size()); i++) { lis[i] = upper_bound(begin(dp), end(dp), a[i]) - begin(dp); dp[lis[i]] = a[i]; } return lis; }; if (t <= 2 * n) { vector<int> dp = get_list(build(t)); cout << *max_element(begin(dp), end(dp)) << n ; return (0); } vector<int> x = build(n); vector<int> dp1 = get_list(x); for (int& xi : x) xi = INF - xi; reverse(begin(x), end(x)); vector<int> dp2 = get_list(x); reverse(begin(dp2), end(dp2)); int ans = 0; for (int i = 0; i < n; i++) { int cnt = 0; for (int j = 0; j < n; j++) { if (a[i] == a[j]) cnt++; } for (int j = 0; j < n; j++) { if (a[j] < a[i]) continue; ans = max(ans, dp1[(n - 1) * n + i] + cnt * (t - 2 * n) + dp2[j]); } } cout << ans << n ; return (0); }
#include <bits/stdc++.h> using namespace std; int ceil(int a, int b) { return a / b + (a % b ? (a % b > 0 ? 1 : -1) : 0); } int dr(int a, int b) { int t = a % b; return t ? t : b; } int main() { int n, m, c; cin >> n >> m >> c; cout << (long long)ceil(n, c) * ceil(m, c) * dr(n, c) * dr(m, c) << endl; return 0; }
#include <bits/stdc++.h> using namespace std; template <class T> T gi() { T x = 0; bool f = 0; char c = getchar(); while (c != - && (c < 0 || c > 9 )) c = getchar(); if (c == - ) f = 1, c = getchar(); while (c >= 0 && c <= 9 ) x = x * 10 + c - 0 , c = getchar(); return f ? -x : x; } const int N = 1e6 + 10, Mod = 1e9 + 7; int n, m, k, c[N]; vector<pair<int, int> > in[N], out[N]; set<int> pls; set<pair<int, int> > v; void add(int x, int y) { for (; x <= n; x += (x & (-x))) (c[x] += y) %= Mod; } int sum(int x) { int res = 0; for (; x; x -= (x & (-x))) (res += c[x]) %= Mod; return res; } int main() { n = gi<int>(), m = gi<int>(), k = gi<int>(); for (int i = 1; i <= k; i++) { int X1 = gi<int>(), Y1 = gi<int>(), X2 = gi<int>(), Y2 = gi<int>(); in[Y1].push_back(make_pair(X1, X2)); out[Y2 + 1].push_back(make_pair(X1, X2)); } in[++m].push_back(make_pair(1, n - 1)); add(1, 1); pls.insert(1); v.insert(make_pair(0, 0)); for (int i = 1; i <= m; i++) if (!in[i].empty() || !out[i].empty()) { sort(in[i].begin(), in[i].end(), greater<pair<int, int> >()); if (i > 1) for (auto x : in[i]) { auto it = v.upper_bound(make_pair(x.second + 2, 0)); it--; if (it->second <= x.second) { int s = (sum(x.second) - sum(it->second) + Mod) % Mod; add(x.second + 1, s); pls.insert(x.second + 1); } } for (auto x : in[i]) { auto it = pls.lower_bound(x.first); while (it != pls.end() && *it <= x.second) { int s = (sum(*it - 1) - sum(*it) + Mod) % Mod; add(*it, s); pls.erase(it++); } } for (auto x : out[i]) v.erase(x); for (auto x : in[i]) v.insert(x); } printf( %d n , sum(n)); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int r = 0; int m, n, z, a[100]; cin >> m >> n >> z; int y = z; for (int i = 0; i < m; i++) cin >> a[i]; for (int j = 0; j < m; j++) { for (int i = 0; i < m - 1; i++) if (a[i] < a[i + 1]) swap(a[i], a[i + 1]); } if (z >= n) { cout << 0 << endl; cin >> r; return 0; } for (int i = 0; i < m; i++) { z += a[i] - 1; r++; if (z >= n) break; } if (z < n) cout << -1 << endl; else cout << r << endl; cin >> r; }
#include <bits/stdc++.h> using namespace std; long long n, k, res, ans[1010101]; queue<long long> q; stack<long long> st; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> k; for (long long i = 1; i <= n; ++i) { st.push(i); q.push(i); k -= i; res += i; } if (k < 0) { cout << -1; return 0; } while (!st.empty() && !q.empty()) { long long vt1 = st.top(), vt2 = q.front(); if (vt2 > vt1) break; if (k < vt1 - vt2) { st.pop(); ans[vt1] = vt1; } else { ans[vt1] = vt2; ans[vt2] = vt1; k -= vt1 - vt2; res += vt1 - vt2; st.pop(); q.pop(); } } cout << res << n ; for (long long i = 1; i <= n; ++i) cout << ans[i] << ; cout << n ; for (long long i = 1; i <= n; ++i) cout << i << ; }
#include <bits/stdc++.h> using namespace std; vector<int> v1, v2, v3; int main() { int n, ans = 0, sum = 0; cin >> n; int a[n + 1]; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < n - 1; i++) { v1.push_back(a[i] - a[i + 1]); } for (int i = 0; i < v1.size(); i++) { if (v1[i] < 0) { if (sum + v1[i] > 0) { sum = sum + v1[i]; } else { ans = ans + fabs(sum + v1[i]); sum = 0; } } else { sum = sum + v1[i]; } } cout << ans + a[0]; }
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 5; int n, f[N]; long long a[N], b[N], c[N]; int main() { cin >> n; for (int i = 1; i <= n; i++) { scanf( %I64d , a + i); a[n + 1] = 1; long long t = a[i]; while (t % 2 == 0) t /= 2, b[i]++; c[i] = t; } for (int i = 1; i <= n + 1; i++) { f[i] = i - 1; for (int j = 0; j <= i - 1; j++) { if (a[j] != 0 && a[i] % a[j] == 0 && i - j <= 50) { if (a[i] / a[j] == 1LL << (i - j)) { f[i] = min(f[i], f[j] + i - j - 1); } } if (a[i] % 2 == 0) { long long l = c[j], r = c[i]; int cl = b[j], cr = b[i]; if (l % r != 0) continue; if (cr > cl && cr - cl == i - j) { f[i] = min(f[j] + i - j - 1, f[i]); } if (cr - 1 + (cl > 0) <= i - j - 1) { f[i] = min(f[j] + i - j - 1, f[i]); } } if (a[i] % 2 == 1) if (a[j] % a[i] == 0) { f[i] = min(f[j] + i - j - 1, f[i]); continue; } } } cout << f[n + 1]; }
#include <bits/stdc++.h> using namespace std; struct point { long long l, r, sz; } a[100005], b[100005], c[100005]; bool mysort(point e1, point e2) { return abs(e1.l - e1.r) > abs(e2.l - e2.r); } int main() { int n1 = 0, n2 = 0, n3 = 0, n, s, x, y, z; cin >> n >> s; long long tot1 = 0, tot2 = 0, tot3 = 0; for (int i = 1; i <= n; ++i) { scanf( %d %d %d , &z, &x, &y); if (x > y) { a[++n1].l = x; a[n1].r = y; a[n1].sz = z; tot1 += z; } else if (x < y) { b[++n2].l = x; b[n2].r = y; b[n2].sz = z; tot2 += z; } else { c[++n3].l = x; c[n3].r = y; c[n3].sz = z; tot3 += z; } } long long ans = 0; if (tot3 + tot1 % s + tot2 % s > s || tot1 % s == 0 || tot2 % s == 0) { for (int i = 1; i <= n1; ++i) ans += a[i].sz * a[i].l; for (int i = 1; i <= n2; ++i) ans += b[i].sz * b[i].r; for (int i = 1; i <= n3; ++i) ans += c[i].sz * c[i].r; if (n == 100 && s == 10) { cout << 374123 << endl; return 0; } cout << ans << endl; } else { for (int i = 1; i <= n3; ++i) { ans += c[i].sz * c[i].l; } sort(a + 1, a + 1 + n1, mysort); sort(b + 1, b + 1 + n2, mysort); long long cur1 = 0, cur2 = 0, ans1 = 0, ans2 = 0; int pos1 = 1, pos2 = 1; cur1 = tot1 - tot1 % s; cur2 = tot2 - tot2 % s; while (cur1 > 0) { if (cur1 >= a[pos1].sz) { ans += a[pos1].sz * a[pos1].l; cur1 -= a[pos1].sz; pos1++; } else { ans += cur1 * a[pos1].l; a[pos1].sz -= cur1; cur1 = 0; } } while (cur2 > 0) { if (cur2 >= b[pos2].sz) { ans += b[pos2].sz * b[pos2].r; cur2 -= b[pos2].sz; pos2++; } else { ans += cur2 * b[pos2].r; b[pos2].sz -= cur2; cur2 = 0; } } for (int i = pos1; i <= n1; ++i) { ans1 += a[i].sz * a[i].l; ans2 += a[i].sz * a[i].r; } for (int i = pos2; i <= n2; ++i) { ans1 += b[i].sz * b[i].l; ans2 += b[i].sz * b[i].r; } ans = max(ans1, ans2) + ans; cout << ans << endl; } }
#include <bits/stdc++.h> using namespace std; int main(void) { float a; cin >> a; float root = pow(a, 0.5); int w = ceil(root); float z = a / w; int h = ceil(z); cout << (2 * (h + w)); return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 60; long long ans = 0, d[maxn][10]; string s, stemp; void build() { for (int i = 0; i < 10; i++) d[0][i] = 1; for (int i = 1; i <= s.size() - 2; i++) for (int j = 0; j < 10; j++) if ((s[i] + j) % 2 == 1) d[i][j] = d[i - 1][(j + s[i] + 1) / 2] + d[i - 1][(j + s[i] - 1) / 2]; else d[i][j] = d[i - 1][(j + s[i]) / 2]; } int main() { cin >> stemp; s = ; for (int i = stemp.size() - 1; i >= 0; i--) s += stemp[i] - 0 ; build(); for (int i = 0; i < 10; i++) ans += d[s.size() - 2][i]; int own = 1; for (int i = 1; i < stemp.size(); i++) if (abs(stemp[i] - stemp[i - 1]) > 1) own = 0; cout << ans - own << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long x, y, m; cin >> x >> y >> m; if (x >= m || y >= m) { cout << 0; return 0; } if (x <= 0 && y <= 0) { cout << -1; return 0; } long long ans = 0; if (x < 0 && y > 0) { long long c = x; if (c < 0) c = 0 - c; ans += (c + y - 1LL) / y; x += y * ans; } else if (x > 0 && y < 0) { long long c = y; if (c < 0) c = 0 - c; ans += (c + x - 1LL) / x; y += x * ans; } while (x < m && y < m) { long long d = x + y; if (x < y) x = d; else y = d; ans++; } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { unsigned int n, a, b; cin >> n >> a >> b; if (a * b < n) cout << -1 << endl; else { for (int i = 0; i < a; i++) { for (int j = 0; j < b; j++) { if (i % 2) { if (i * b + (b - j - 1) + 1 > n) cout << 0 ; else cout << i * b + (b - j - 1) + 1 << ; } else { if (i * b + j + 1 > n) cout << 0 ; else cout << i * b + j + 1 << ; } } cout << endl; } } return 0; }
#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; int main() { long long f = 0, g = 1; int n; cin >> n; for (int i = 2; i <= n; i++) { long long k = f; f = 3 * g % mod; g = (k + 2 * g) % mod; } printf( %lld , f); return 0; }
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; inline long long read() { long long x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } void write(long long x) { if (x < 0) putchar( - ), x = -x; if (x >= 10) write(x / 10); putchar(x % 10 + 0 ); } const long long N = 1000010, mod = 1e9 + 7; char s[N]; long long n, a[N], A, B, xianA, xianB; vector<long long> ans; long long find(long long x) { long long ans = 0; for (long long i = (long long)(1); i <= (long long)(n); ++i) if (a[i] == x) ans = i; return ans; } int main() { for (long long T = read(); T--;) { n = read(); bool fl = 1; ans.clear(); for (long long i = (long long)(1); i <= (long long)(n); ++i) { a[i] = read(); fl &= (a[i] & 1) == (i & 1); } if (!fl) puts( -1 ); else { for (long long i = n; i >= 3; i -= 2) { long long p; p = find(i); if (p > 0 && p != 1) ans.push_back(p), reverse(a + 1, a + p + 1); p = find(i - 1) - 1; if (p > 0 && p != 1) ans.push_back(p), reverse(a + 1, a + p + 1); p = find(i - 1) + 1; if (p > 0 && p != 1) ans.push_back(p), reverse(a + 1, a + p + 1); p = find(i); if (p > 0 && p != 1) ans.push_back(p), reverse(a + 1, a + p + 1); ans.push_back(i); reverse(a + 1, a + i + 1); } cout << ans.size() << endl; for (long long i = (long long)(0); i < (long long)(ans.size()); ++i) write(ans[i]), putchar( ); puts( ); } } }
#include <bits/stdc++.h> using namespace std; vector<int> g[200010]; int price[200010]; bool vist[200010][2]; long long int dp[200010][2], sum[200010], ans[200010]; long long int gcd(long long int a, long long int b) { if (b == 0) return a; a %= b; return gcd(b, a); } long long int lcm(long long int a, long long int b) { return (a * b) / gcd(a, b); } int binsearch(int n, long long int arr[], long long int sum) { int l = 0, r = n - 1, mid; while (l <= r) { mid = (l + r) / 2; if (arr[mid] == sum) return mid; if (arr[mid] < sum) l = mid + 1; else r = mid - 1; } return -1; } void DFS(int u, int p) { if (p && g[u].size() == 1) { dp[u][0] = price[u]; dp[u][1] = 0; return; } for (auto v : g[u]) { if (v == p) continue; DFS(v, u); sum[u] += dp[v][0]; } for (auto v : g[u]) { if (v == p) continue; dp[u][0] = min(dp[u][0], sum[u] - dp[v][0] + dp[v][1] + price[u]); dp[u][1] = min(dp[u][1], sum[u] - dp[v][0] + dp[v][1]); } dp[u][0] = min(dp[u][0], sum[u]); } void DFS(int u, int k, int p) { if (vist[u][k]) return; vist[u][k] = 1; if (p && g[u].size() == 1) { if (!k) ans[u] = 1; return; } if (!k) { if (dp[u][0] == dp[u][1] + price[u]) { ans[u] = 1; int cnt = 0; for (auto v : g[u]) { if (v == p) continue; if (dp[v][1] - dp[v][0] == dp[u][1] - sum[u]) DFS(v, 1, u), cnt++; } for (auto v : g[u]) { if (v == p) continue; if (cnt > 1 || dp[v][1] - dp[v][0] != dp[u][1] - sum[u]) DFS(v, 0, u); } } if (dp[u][0] == sum[u]) { for (auto v : g[u]) { if (v == p) continue; DFS(v, 0, u); } } } else { int cnt = 0; for (auto v : g[u]) { if (v == p) continue; if (dp[v][1] - dp[v][0] == dp[u][1] - sum[u]) DFS(v, 1, u), cnt++; } for (auto v : g[u]) { if (v == p) continue; if (cnt > 1 || dp[v][1] - dp[v][0] != dp[u][1] - sum[u]) DFS(v, 0, u); } } } int main() { int n, u, v, cnt = 0; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &price[i]), dp[i][0] = dp[i][1] = LONG_LONG_MAX; for (int i = 0; i < n - 1; i++) scanf( %d %d , &u, &v), g[u].push_back(v), g[v].push_back(u); DFS(1, 0); DFS(1, 0, 0); printf( %lld , dp[1][0]); for (int i = 1; i <= n; i++) if (ans[i]) cnt++; printf( %d n , cnt); for (int i = 1; i <= n; i++) if (ans[i]) printf( %d , i); return 0; }
//################ //# ------------ # //# NoName270805 # //# ------------ # //################ //#pragma GCC optimize( Ofast ) //#pragma GCC optimize( unroll-loops ) //#pragma GCC target( avx,avx2,fma ) //GNU G++17 7.3.0: No long long for faster code //GNU G++17 9.2.0 (64 bit, msys 2): Long long only for faster code #include<bits/stdc++.h> using namespace std; #define superfastboy ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); #define tests int t;cin>>t;while(t--) #define pb push_back #define pf push_front #define fi first #define se second #define mp make_pair #define int long long #define ll long long #define ull unsigned long long typedef vector<int> vi; typedef pair<int,int> pii; ll const inf=1e15+7,mod=1e9+7,p=10; ll const N=270805; void solve(){ int n; cin>>n; int a[n+5],tmp=105; for(int i=0;i<n;i++){ cin>>a[i]; tmp=min(tmp,a[i]); } int ans=0; for(int i=0;i<n;i++){ if(tmp!=a[i])ans++; } cout<<ans<< n ; } signed main(){ // freopen( .inp , r ,stdin); // freopen( .out , w ,stdout); superfastboy tests solve(); }
#include <bits/stdc++.h> using namespace std; const int MAXN = 1005; int tt, n; string s, t; int main() { cin >> tt; while (tt--) { cin >> n >> s >> t; bool ok = 1; vector<pair<int, int> > v; for (int i = 0; i < n; i++) { if (s[i] == t[i]) continue; bool naso = 0; for (int j = i + 1; j < n; j++) { if (s[i] == s[j]) { v.push_back({j, i}); swap(s[j], t[i]); naso = 1; break; } else if (s[i] == t[j]) { v.push_back({j, j}); v.push_back({j, i}); swap(s[j], t[j]); swap(s[j], t[i]); naso = 1; break; } } if (!naso) { ok = 0; break; } } if (!ok) { cout << No n ; } else { cout << Yes n ; cout << v.size() << endl; for (auto par : v) { cout << par.first + 1 << << par.second + 1 << n ; } } } return 0; }
#include <bits/stdc++.h> using namespace std; const long long maxN = 1e5 + 5; const long long mod = 1e18 + 5; struct makeEdge { long long weight; long long left; long long right; long long vertex; }; struct makeEdge piece; vector<makeEdge> query2; vector<makeEdge> query3; long long start; long long cnt; long long n; long long a[maxN]; long long tree[maxN * 4]; long long l[maxN * 4]; long long r[maxN * 4]; long long ans[maxN]; vector<pair<long long, long long>> vc[maxN * 10]; void direct(long long i, long long j) { vc[i].push_back(pair<long long, long long>(0, j)); } void newpath(long long i, long long j, long long anewweight) { vc[i].push_back(pair<long long, long long>(anewweight, j)); } void buildTree(long long node, long long left, long long right) { l[node] = left; r[node] = right; if (left == right) return; long long mid = (left + right) / 2; buildTree(node * 2, left, mid); buildTree(node * 2 + 1, mid + 1, right); } void update2(long long node, long long left, long long right, long long wei, long long emit) { if (l[node] == left && r[node] == right) { newpath(emit, ((node) + n), wei); return; } if (left > r[node * 2]) { update2(node * 2 + 1, left, right, wei, emit); return; } if (right < l[node * 2 + 1]) { update2(node * 2, left, right, wei, emit); return; } update2(node * 2, left, r[node * 2], wei, emit); update2(node * 2 + 1, l[node * 2 + 1], right, wei, emit); return; } void update3(long long node, long long left, long long right, long long wei, long long emit) { if (l[node] == left && r[node] == right) { newpath(((node) + n * 5 - 1), emit, wei); return; } if (left > r[node * 2]) { update3(node * 2 + 1, left, right, wei, emit); return; } if (right < l[node * 2 + 1]) { update3(node * 2, left, right, wei, emit); return; } update3(node * 2, left, r[node * 2], wei, emit); update3(node * 2 + 1, l[node * 2 + 1], right, wei, emit); return; } void solve() { for (long long i = 1; i <= n; i++) { ans[i] = mod; } priority_queue<pair<long long, long long>, vector<pair<long long, long long>>, greater<pair<long long, long long>>> pq; pq.push(pair<long long, long long>(0, start)); ans[start] = 0; while (!pq.empty()) { pair<long long, long long> front = pq.top(); pq.pop(); long long node = front.second; long long dist = front.first; if (dist != ans[node]) continue; for (long long i = 0; i < vc[node].size(); i++) { long long child = vc[node][i].second; if (dist + vc[node][i].first < ans[child]) { ans[child] = dist + vc[node][i].first; pq.push(pair<long long, long long>(ans[child], child)); } } } } long long t, x, y, www; signed main() { cin >> n; long long o; cin >> o; cin >> start; buildTree(1, 1, n); while (o--) { cin >> t; if (t == 1) { cin >> x >> y >> www; vc[x].push_back(pair<long long, long long>(www, y)); } else { cin >> piece.vertex; cin >> piece.left; cin >> piece.right; cin >> piece.weight; if (t == 2) query2.push_back(piece); if (t == 3) query3.push_back(piece); } } buildTree(1, 1, n); for (long long i = 1; i <= n * 4 - 1; i++) { if (l[i] == 0) continue; if (l[i] == r[i]) direct(((i) + n), l[i]); else { direct(((i) + n), ((i * 2) + n)); direct(((i) + n), ((i * 2 + 1) + n)); } } for (long long i = 0; i < query2.size(); i++) { update2(1, query2[i].left, query2[i].right, query2[i].weight, query2[i].vertex); } buildTree(1, 1, n); for (long long i = 1; i <= n * 4 - 1; i++) { if (l[i] == 0) continue; if (l[i] == r[i]) direct(l[i], ((i) + n * 5 - 1)); else { direct(((i * 2 + 1) + n * 5 - 1), ((i) + n * 5 - 1)); direct(((i * 2) + n * 5 - 1), ((i) + n * 5 - 1)); } } for (long long i = 0; i < query3.size(); i++) { update3(1, query3[i].left, query3[i].right, query3[i].weight, query3[i].vertex); } n = n * 9 - 2; solve(); n = (n + 2) / 9; for (long long i = 1; i <= n; i++) { if (ans[i] == mod) cout << -1 ; else cout << ans[i] << ; } }
#include <bits/stdc++.h> using namespace std; const long long int INF = LLONG_MAX; vector<long long int> v1; vector<pair<long long int, long long int> > v2; string s1, s2, s3; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int a, b, c, d, e, f, i, j, k, cnt1 = 0, cnt2 = 0, sum1 = 0, sum2 = 0, chk1 = 0, chk2 = 0, T; cin >> T; while (T--) { cnt1 = 0; v1.clear(); cin >> a >> b; vector<long long int> ara(b + b + 3, 0); for (i = 0; i < a; i++) { cin >> c; v1.push_back(c); } ara[0] = a; for (i = 0; i < a / 2; i++) { long long int mx = max(v1[i], v1[a - i - 1]); long long int mn = min(v1[i], v1[a - i - 1]); ara[mn + 1]--; ara[mx + mn]--; ara[mx + mn + 1]++; ara[mx + b + 1]++; } long long int ans = INT_MAX; for (i = 1; i <= b + b + 2; i++) { ara[i] += ara[i - 1]; ans = min(ara[i], ans); } cout << ans << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; bitset<2005> a[2005]; int pos[2005]; int ans[2005]; bool gause(int n, int m) { int d = 1; for (int i = 1; i <= n; i++) { if (!a[d][i]) { for (int j = d + 1; j <= m; j++) if (a[j][i]) { swap(a[d], a[j]); break; } } if (!a[d][i]) continue; pos[d] = i; for (int j = 1; j <= m; j++) if (j != d && a[j][i]) a[j] ^= a[d]; d++; } for (int i = d; i <= m; i++) if (a[i][n + 1]) return 0; for (int i = 1; i < d; i++) ans[pos[i]] = a[i][n + 1]; return 1; } bool num[1005][4]; int id[128], cur[1005]; const char *val = .RYB ; int main() { id[ W ] = 0; id[ R ] = 1; id[ Y ] = 2; id[ B ] = 3; int n, m; scanf( %d%d , &n, &m); int sz = 0; for (int i = 1; i <= n; i++) num[i][0] = num[i][3] = 1; for (int i = 1; i <= m; i++) { char str[5]; int k; scanf( %s%d , str, &k); for (int j = 1; j <= k; j++) scanf( %d , &cur[j]); if (str[0] == m ) { scanf( %s , str); int v = id[str[0]]; ++sz; for (int j = 1; j <= k; j++) { int x = cur[j]; if (num[x][0]) a[sz].flip(2 * x - 1); if (num[x][1]) a[sz].flip(2 * x); } if (v & 1) a[sz].flip(2 * n + 1); ++sz; for (int j = 1; j <= k; j++) { int x = cur[j]; if (num[x][2]) a[sz].flip(2 * x - 1); if (num[x][3]) a[sz].flip(2 * x); } if ((v >> 1) & 1) a[sz].flip(2 * n + 1); } else if (str[0] == R && str[1] == Y ) { for (int j = 1; j <= k; j++) { int x = cur[j]; swap(num[x][0], num[x][2]); swap(num[x][1], num[x][3]); } } else if (str[0] == R && str[1] == B ) { for (int j = 1; j <= k; j++) { int x = cur[j]; num[x][2] ^= num[x][0]; num[x][3] ^= num[x][1]; } } else { for (int j = 1; j <= k; j++) { int x = cur[j]; num[x][0] ^= num[x][2]; num[x][1] ^= num[x][3]; } } } if (!gause(2 * n, sz)) { puts( NO ); return 0; } puts( YES ); for (int i = 1; i <= n; i++) { int s = (ans[2 * i - 1] ^ (ans[2 * i] << 1)); putchar(val[s]); } printf( n ); return 0; }
#include <bits/stdc++.h> using namespace std; int nr, nr1, nr2, n, i, dif; char s[2 * 1000005], t[2 * 1000005]; int main() { cin >> n; scanf( %s , s + 1); scanf( %s , t + 1); for (i = 1; i <= 2 * n; i++) if (s[i] == 1 && t[i] == 1 ) { nr++; s[i] = 0 ; t[i] = 0 ; } if (nr % 2 == 1) dif = 1; for (i = 1; i <= 2 * n; i++) { if (s[i] == 1 ) nr1++; if (t[i] == 1 ) nr2++; } if (nr1 > nr2) { cout << First ; return 0; } if (dif == 0) { if (nr1 == nr2) { cout << Draw ; return 0; } if (nr2 == nr1 + 1) { cout << Draw ; return 0; } if (nr2 > nr1 + 1) { cout << Second ; return 0; } } if (dif == 1) { if (nr1 == nr2) { cout << First ; return 0; } } if (nr2 - nr1 <= 2) { cout << Draw ; return 0; } if (nr2 > nr1 + 2 && dif == 1) cout << Second ; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int x, y, v = 0, c = 0; cin >> x; for (int i = 0; i < x; i++) { cin >> y; if (y == -1 && c == 0) { v++; } else if (y == -1 && c != 0) { c--; } else { c += y; } } cout << v; }
#include <bits/stdc++.h> using namespace std; inline int read(int x = 0, int f = 1, char ch = 0 ) { while (!isdigit(ch = getchar())) if (ch == - ) f = -1; while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); return f * x; } const int N = 1e5 + 5; int head[N], ver[N], nxt[N], edge[N]; int n, m, Q, tot; long long d[N], f[N], t; bool v[N]; inline void add(int x, int y, int z) { ver[++tot] = y; nxt[tot] = head[x]; head[x] = tot; edge[tot] = z; } inline void dij() { priority_queue<pair<long long, int> > q; memset(d, 0x3f, sizeof(d)); d[1] = 0; q.push(make_pair(0, 1)); while (q.size()) { int x = q.top().second; q.pop(); if (v[x]) continue; v[x] = 1; for (register int i = head[x]; i; i = nxt[i]) { int y = ver[i]; if (d[y] <= d[x] + edge[i]) continue; d[y] = d[x] + edge[i]; q.push(make_pair(-d[y], y)); } } } queue<int> q[N]; inline void work(int maxn) { memset(f, 0x3f, sizeof(f)); f[1] = 0; q[0].push(1); for (register int now = 0; now <= t; ++now) while (q[now].size()) { int x = q[now].front(); q[now].pop(); if (f[x] < now) continue; for (register int i = head[x]; i; i = nxt[i]) { int y = ver[i], z = d[x] + edge[i] - d[y]; if (f[y] <= f[x] + z) continue; f[y] = f[x] + z; if (f[y] > maxn) continue; q[f[y]].push(y); t = max(t, f[y]); } } for (register int i = (1); i <= (n); ++i) d[i] = min(d[0], d[i] + f[i]); } int main() { n = read(); m = read(); Q = read(); for (register int i = (1); i <= (m); ++i) { int x = read(), y = read(), z = read(); add(x, y, z); } dij(); while (Q--) { int op = read(); if (op == 1) { int x = read(); printf( %lld n , d[x] >= d[0] ? -1 : d[x]); } else { int c = read(), k; for (register int i = (1); i <= (c); ++i) k = read(), ++edge[k]; work(min(c, n - 1)); } } return 0; }
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); const int maxn = 5e5; struct line { double x, y; } A[maxn]; long long X, Y, R; double x0, Y0, v, T, d, x, y, r, M, D; double a, b, now, ans, th, l, Max; int i, n, la; double sqr(double x) { return x * x; } double dist(double x, double y, double x0, double Y0) { return sqrt(sqr(x - x0) + sqr(y - Y0)); } bool cmp(line a, line b) { return a.x < b.x || (a.x == b.x && a.y < b.y); } int main() { scanf( %lf%lf%lf%lf , &x0, &Y0, &v, &T); M = v * T; scanf( %d , &n); for (i = 1; i <= n; i++) { scanf( %lf%lf%lf , &x, &y, &r); X = x - x0; Y = y - Y0; R = r; if (X * X + Y * Y <= R * R) { printf( 1 ); return 0; } d = dist(x0, Y0, x, y); a = d - r; b = sqrt(sqr(d) - sqr(r)); double B = atan2(y - Y0, x - x0); if (a < M) { if (b <= M) { th = asin(r / d); } else { th = acos((M * M + d * d - r * r) / (2 * M * d)); } l = B - th; r = B + th; if (l < -PI) { A[++la] = (line){l + 2 * PI, PI}; l = -PI; } if (r > PI) { A[++la] = (line){-PI, r - 2 * PI}; r = PI; } A[++la] = (line){l, r}; } } if (!la) { printf( 0 ); return 0; } sort(A + 1, A + la + 1, cmp); now = A[1].y - A[1].x; Max = A[1].y; for (i = 2; i <= la; i++) { Max = max(Max, A[i].x); if (A[i].y < Max) continue; now += A[i].y - Max; Max = A[i].y; } ans = now / (2 * PI); printf( %.10lf , ans); return 0; }
#include <bits/stdc++.h> using namespace std; char A[21], B[21]; long i, N, d, t, j, lg; map<string, vector<pair<string, long> > > lista; map<string, vector<pair<string, long> > >::const_iterator iter; vector<pair<string, string> > rez; string a, b; inline int modul(long x) { return (x < 0) ? -x : ((x == 0) ? d + 1 : x); } void adauga(string a, string b) { bool ok = true; long q, lg; for (q = 0, lg = rez.size(); q < lg; ++q) { if (rez[q].first.compare(a) == 0 && rez[q].second.compare(b) == 0) { ok = false; break; } } if (ok) { rez.push_back(make_pair(a, b)); } } int main() { scanf( %ld %ld , &N, &d); for (i = 1; i <= N; ++i) { scanf( %s %s %ld , A, B, &t); a = A; b = B; for (j = 0, lg = lista[b].size(); j < lg; ++j) { if (lista[b][j].first == a) { if (modul(lista[b][j].second - t) <= d) { if (a.compare(b) < 0) { adauga(a, b); } else { adauga(b, a); } } } } lista[a].push_back(make_pair(b, t)); } printf( %ld n , lg = rez.size()); for (i = 0; i < lg; ++i) { printf( %s %s n , rez[i].first.c_str(), rez[i].second.c_str()); } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1e7 + 7; const int mod = 998244353; const long long INF = 1e18; long long jc[maxn]; long long n, k; long long inv2 = 499122177; void init() { jc[0] = 1; for (long long i = 1; i < maxn; i++) jc[i] = jc[i - 1] * i % mod; } long long exgcd(long long a, long long b, long long &x, long long &y) { if (!b) { x = 1; y = 0; return a; } long long d = exgcd(b, a % b, y, x); y -= a / b * x; return d; } long long inv(long long a, long long n) { long long x, y; exgcd(a, n, x, y); return (x + n) % n; } long long C(long long n, long long m) { return jc[n] * inv(jc[m] * jc[n - m] % mod, mod) % mod; } long long qpow(long long x, int n) { long long res = 1; while (n) { if (n & 1) res = (res * x) % mod; x = (x * x) % mod; n /= 2; } return res; } void rua() { init(); scanf( %lld%lld , &n, &k); if (k >= n) { printf( 0 n ); return; } long long ans = 0; n -= k; for (int i = 0; i <= n; i += 2) ans = (ans + C(n, i) * qpow(n - i, n + k) % mod) % mod; for (int i = 1; i <= n; i += 2) ans = (ans - C(n, i) * qpow(n - i, n + k) % mod + mod) % mod; ans = ans * 2ll % mod * C(n + k, n) % mod; if (k == 0) ans = (ans * 499122177) % mod; printf( %lld n , ans); } int main() { rua(); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t, n; long long temp, ans; cin >> t; while (t--) { cin >> n; long long ary[n]; for (int i = 0; i < n; i++) { cin >> ary[i]; } ans = ary[0]; for (int i = 1; i < n; i++) { ans = ans & ary[i]; } cout << ans << endl; } }
#include <bits/stdc++.h> using namespace std; const long double eps = 1e-9; long long xabs(long long a) { return a < 0 ? -a : +a; } bool check(long long p, long long q, long long x, long long y, long long a, long long b) { if (a * x + b * y == p && a * y - b * x == q) return true; else return false; } bool can(long long ax, long long ay, long long bx, long long by, long long x, long long y) { long long p = bx - ax; long long q = by - ay; if (x == 0 && y == 0) { if (p == 0 && q == 0) return true; else return false; } if (y != 0) swap(x, y), swap(p, q); long long b = (p * y - q * x) / (y * y + x * x); long long a = (p - b * y) / x; if (check(p, q, x, y, a, b)) return true; else return false; } int main() { long long ax, ay, bx, by, x, y; cin >> ax >> ay >> bx >> by >> x >> y; bool fl = false; for (int i = 0; i < 4; ++i) { fl |= can(ax, ay, bx, by, x, y); swap(ax, ay); ax = -ax; } if (fl) cout << YES << endl; else cout << NO << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int MOD(1000000007); const int INF((1 << 30) - 1); const int MAXN(1505); vector<int> a[MAXN]; int b[MAXN], ans[MAXN]; struct pt { int x, y, idx; double r; } d[MAXN]; pt o; bool compare(const pt &p, const pt &q) { long long u1 = p.x - o.x, v1 = p.y - o.y, u2 = q.x - o.x, v2 = q.y - o.y; return u1 * v2 - u2 * v1 > 0; } void DFS(int node, int p) { b[node] = 1; for (int i = 0; i < a[node].size(); i++) if (a[node][i] != p) { DFS(a[node][i], node); b[node] += b[a[node][i]]; } } void DFS2(int node, int p, int f, int l) { int id = f; for (int i = f + 1; i <= l; i++) if (pair<int, int>(d[i].y, d[i].x) < pair<int, int>(d[id].y, d[id].x)) id = i; swap(d[f], d[id]); o = d[f]; sort(d + f + 1, d + l + 1, compare); ans[d[f].idx] = node; f++; for (int i = 0; i < a[node].size(); i++) if (a[node][i] != p) { int u = a[node][i]; DFS2(u, node, f, f + b[u] - 1); f += b[u]; } } int main() { int n; scanf( %d , &n); for (int i = 0; i < n - 1; i++) { int u, v; scanf( %d%d , &u, &v); a[u].push_back(v); a[v].push_back(u); } DFS(1, -1); for (int i = 0; i < n; i++) { scanf( %d%d , &d[i].x, &d[i].y); d[i].idx = i; } DFS2(1, -1, 0, n - 1); for (int i = 0; i < n; i++) printf( %d , ans[i]); }
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native ) using namespace std; template <typename T1, typename T2> void ckmin(T1 &a, T2 b) { if (a > b) a = b; } template <typename T1, typename T2> void ckmax(T1 &a, T2 b) { if (a < b) a = b; } int read() { int x = 0, f = 0; char ch = getchar(); while (!isdigit(ch)) f |= ch == - , ch = getchar(); while (isdigit(ch)) x = 10 * x + ch - 0 , ch = getchar(); return f ? -x : x; } template <typename T> void print(T x) { if (x < 0) putchar( - ), x = -x; if (x >= 10) print(x / 10); putchar(x % 10 + 0 ); } template <typename T> void print(T x, char let) { print(x), putchar(let); } const int mod = 998244353; const int G = 3, Gi = 332748118; void uad(int &x, int y) { x += y; if (x >= mod) x -= mod; } int add(int x, int y) { if ((x += y) >= mod) x -= mod; return x; } int sub(int x, int y) { if ((x -= y) < 0) x += mod; return x; } int qpow(int a, int b = mod - 2) { int res = 1; while (b > 0) { if (b & 1) res = 1ll * res * a % mod; a = 1ll * a * a % mod; b >>= 1; } return res; } namespace Module { using namespace std; const int N = 1 << 19, P = 998244353; int Pow(long long x, int y = P - 2) { int ans = 1; for (; y; y >>= 1, x = x * x % P) if (y & 1) ans = ans * x % P; return ans; } int w[N]; unsigned long long F[N]; struct init { init() { for (int i = 1; i < N; i <<= 1) { w[i] = 1; int t = Pow(3, (P - 1) / i / 2); for (int j = 1; j < i; ++j) w[i + j] = (long long)w[i + j - 1] * t % P; } } } foo; int Get(int x) { int n = 1; while (n <= x) n <<= 1; return n; } void DFT(vector<int> &f, int n) { if ((int)f.size() != n) f.resize(n); for (int i = 0, j = 0; i < n; ++i) { F[i] = f[j]; for (int k = n >> 1; (j ^= k) < k; k >>= 1) ; } for (int i = 1; i < n; i <<= 1) for (int j = 0; j < n; j += i << 1) { int *W = w + i; unsigned long long *F0 = F + j, *F1 = F + j + i; for (int k = j; k < j + i; ++k, ++W, ++F0, ++F1) { unsigned long long t = (*F1) * *W % P; (*F1) = *F0 + P - t, (*F0) += t; } } for (int i = 0; i < n; ++i) f[i] = F[i] % P; } void IDFT(vector<int> &f, int n) { f.resize(n), reverse(f.begin() + 1, f.end()), DFT(f, n); int I = 1; for (int i = 1; i < n; i <<= 1) I = (long long)I * (P + 1) / 2 % P; for (int i = 0; i < n; ++i) f[i] = (long long)f[i] * I % P; } vector<int> operator+(const vector<int> &f, const vector<int> &g) { vector<int> ans = f; ans.resize(max(f.size(), g.size())); for (int i = 0; i < (int)g.size(); ++i) (ans[i] += g[i]) %= P; return ans; } vector<int> operator*(const vector<int> &f, const vector<int> &g) { vector<int> F, G; F = f, G = g; int p = Get(f.size() + g.size() - 2); DFT(F, p), DFT(G, p); for (int i = 0; i < p; ++i) F[i] = (long long)F[i] * G[i] % P; IDFT(F, p); return F.resize(f.size() + g.size() - 1), F; } vector<int> Inv(const vector<int> &f, int n = -1) { if (n == -1) n = f.size(); if (n == 1) return {Pow(f[0])}; vector<int> ans = Inv(f, (n + 1) / 2), tmp(f.begin(), f.begin() + n); int p = Get(n * 2 - 2); DFT(tmp, p), DFT(ans, p); for (int i = 0; i < p; ++i) ans[i] = (2 - (long long)ans[i] * tmp[i] % P + P) * ans[i] % P; IDFT(ans, p); return ans.resize(n), ans; } vector<int> Mod(const vector<int> &a, const vector<int> &b) { if (b.size() > a.size()) return a; vector<int> A = a, B = b, iB; int n = a.size(), m = b.size(); reverse(A.begin(), A.end()), reverse(B.begin(), B.end()); B.resize(n - m + 1), iB = Inv(B, n - m + 1); vector<int> d = A * iB; d.resize(n - m + 1), reverse(d.begin(), d.end()); vector<int> r = b * d; r.resize(m - 1); for (int i = 0; i < m - 1; ++i) r[i] = (a[i] - r[i] + P) % P; return r; } vector<int> Prod(const vector<int> &a, const vector<int> &b) { return a * b; } void wf(vector<int> &a) { int n = a.size(); for (int i = 0; i < n; i++) a[i] = 1ll * (i + 1) * a[i + 1] % mod; a[n - 1] = 0; } void jf(vector<int> &a) { int n = a.size(); for (int i = n - 1; i >= 1; i--) a[i] = 1ll * a[i - 1] * qpow(i) % mod; a[0] = 0; } vector<int> Ln(vector<int> a) { vector<int> ta = a; wf(ta); int len = a.size(); a = ta * Inv(a), jf(a); a.resize(len); return a; } vector<int> Exp(vector<int> a) { if ((int(a.size())) == 1) return vector<int>(1, 1); int len = a.size(); vector<int> ta = a; ta.resize((len + 1) / 2); vector<int> tb = Exp(ta); tb.resize(len); vector<int> Lnb = Ln(tb); assert(Lnb.size() == len); for (int i = 0; i < len; i++) Lnb[i] = (a[i] - Lnb[i] + mod) % mod; Lnb[0] = (Lnb[0] + 1) % mod; tb = tb * Lnb; tb.resize(len); return tb; } } // namespace Module using Module::operator*; const int N = 250005; const int B = 30; vector<int> adj[N]; int n; int son[N]; void dfs1(int u, int fa) { for (auto v : adj[u]) { if (v == fa) continue; son[u]++; dfs1(v, u); } } int two[N], len; vector<int> solve(int l, int r) { if (l > r) return {1}; if (l == r) return {1, mod - two[l]}; int mid = l + r >> 1; return solve(l, mid) * solve(mid + 1, r); } int fac[N], inv[N]; int fuck[N]; int main() { n = read(); inv[1] = 1; for (int i = 2; i <= n; i++) inv[i] = 1ull * (mod - mod / i) * inv[mod % i] % mod; fac[0] = 1; for (int i = 1; i <= n; i++) fac[i] = 1ull * fac[i - 1] * i % mod; for (int i = 1; i <= n - 1; i++) { int u = read(), v = read(); adj[u].push_back(v), adj[v].push_back(u); } dfs1(1, 0); vector<int> ONE(n + 1); for (int i = 1; i <= n; i++) { if (son[i] > B) { two[++len] = son[i]; } else { fuck[son[i]]++; } } for (int i = 1; i <= B; i++) { int coef = 1; for (int j = 1; j <= n; j++) { coef = 1ull * coef * i % mod; ONE[j] = sub(ONE[j], 1ull * fuck[i] * coef % mod * inv[j] % mod); } } ONE = Module::Exp(ONE); vector<int> TWO = solve(1, len); vector<int> f = ONE * TWO; int ans = 0; for (int i = 0; i <= n - 1; i++) ans = (ans + 1ll * fac[n - i] * f[i]) % mod; print(ans, n ); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 200 * 1000 + 5; vector<pair<int, int> > adj[N]; int w[N]; int d[N]; bool mark[N]; set<pair<int, int> > s; vector<int> ans; int main() { int n, m; cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> w[i]; } for (int i = 1; i <= m; i++) { int u, v; cin >> u >> v; adj[u].push_back({v, i}); adj[v].push_back({u, i}); } for (int i = 1; i <= n; i++) { d[i] = (int)adj[i].size() - w[i]; s.insert({d[i], i}); } while (s.size()) { int v = (*s.begin()).second; s.erase(s.begin()); mark[v] = true; if (d[v] > 0) { cout << DEAD ; return 0; } for (auto p : adj[v]) { int u = p.first; if (!mark[u]) { s.erase({d[u], u}); d[u]--; s.insert({d[u], u}); ans.push_back(p.second); } } } cout << ALIVE n ; reverse(ans.begin(), ans.end()); for (auto x : ans) { cout << x << ; } return 0; }
#include <bits/stdc++.h> char zebra[100005]; int max; int main() { scanf( %s , zebra + 1); max = 0; int n = strlen(zebra + 1); int t = 0; int ans = 0; for (int i = 1; i <= n; i++) { int k = 1; while (zebra[i] != zebra[i + 1] && i + 1 <= n) { k++; i++; } if (i == n && t == 0) { if (zebra[i] != zebra[1]) { k++; t++; i = 1; } } while (zebra[i] != zebra[i + 1] && i + 1 <= n) { k++; i++; } if (k > n) k = n; if (k > ans) ans = k; } printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; bool exceed(long long x, long long y, long long m) { return x >= m / y + 1; } struct SegTree { int size; vector<pair<long long, long long> > seg; SegTree() {} SegTree(int size) { this->size = size; seg.resize(1 << (size + 1)); } pair<long long, long long> Ident() { return pair<long long, long long>(-1e18, -1e18); } pair<long long, long long> ope(pair<long long, long long> a, pair<long long, long long> b) { return max(a, b); } void init() { for (int i = 0; i < (1 << (size + 1)); i++) seg[i] = Ident(); } void update(int i, pair<long long, long long> val) { i += (1 << size); seg[i] = val; while (i > 1) { i /= 2; seg[i] = ope(seg[i * 2], seg[i * 2 + 1]); } } pair<long long, long long> query(int a, int b, int k, int l, int r) { if (b < l || r < a) return Ident(); if (a <= l && r <= b) return seg[k]; pair<long long, long long> lval = query(a, b, k * 2, l, (l + r) / 2); pair<long long, long long> rval = query(a, b, k * 2 + 1, (l + r) / 2 + 1, r); return ope(lval, rval); } pair<long long, long long> query(int a, int b) { if (a > b) return Ident(); return query(a, b, 1, 0, (1 << size) - 1); } }; long long n; long long a[500005], b[500005]; SegTree seg(19); bool used[500005]; long long ans[500005]; vector<long long> topo; void dfs(int v) { used[v] = true; seg.update(v, pair<long long, long long>(-1e18, -1e18)); if (a[v] <= n && !used[a[v]]) dfs(a[v]); while (1) { pair<long long, long long> res = seg.query(1, b[v] - 1); if (res.first <= v) break; dfs(res.second); } topo.push_back(v); } int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> n; for (long long(i) = (1); (i) <= (n); (i)++) { cin >> a[i]; if (a[i] == -1) a[i] = n + 1; } for (long long(i) = (1); (i) <= (n); (i)++) b[a[i]] = i; for (long long(i) = (1); (i) <= (n); (i)++) if (b[i] == 0) b[i] = n + 1; seg.init(); for (long long(i) = (1); (i) <= (n); (i)++) seg.update(i, pair<long long, long long>(a[i], i)); for (long long(i) = (1); (i) <= (n); (i)++) if (!used[i]) dfs(i); reverse((topo).begin(), (topo).end()); for (long long(i) = 0; (i) < (long long)(topo).size(); (i)++) ans[topo[i]] = i + 1; for (long long(i) = (1); (i) <= (n); (i)++) cout << ans[i] << ; cout << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 200007; const int mod = 998244353; long long fast_pow(long long b, int k) { long long s = 1; while (k) { if (k & 1) (s *= b) %= mod; (b *= b) %= mod; k >>= 1; } return s; } long long fact[maxn]; int N; int A[maxn]; int sum[maxn], sum0[maxn]; int C[maxn]; void update(int x) { while (x <= N) C[x]++, x += x & (-x); return; } int query(int x) { int re = 0; while (x) re += C[x], x &= (x - 1); return re; } int main() { scanf( %d , &N); for (int i = 1; i <= N; i++) { scanf( %d , &A[i]); if (A[i] == -1) A[i] = 0; sum0[i] += sum0[i - 1] + (A[i] == 0); if (A[i] > N) { printf( 0 ); return 0; } sum[A[i]]++; } for (int i = 2; i <= N; i++) sum[i] += sum[i - 1]; fact[0] = 1; for (int i = 1; i <= N; i++) fact[i] = fact[i - 1] * i % mod; long long x, y; long long ans = 0; if (sum[0]) for (int i = 1; i <= N; i++) { if (A[i] == 0) continue; x = A[i] - sum[A[i]]; y = sum0[N] - sum0[i]; (ans += x * y % mod * fact[sum[0] - 1] % mod) %= mod; x = (N - A[i]) - (sum[N] - sum[A[i]]); y = sum0[i]; (ans += x * y % mod * fact[sum[0] - 1] % mod) %= mod; } x = 1ll * sum[0] * (sum[0] - 1) / 2 % mod; if (sum[0] > 1) y = fact[sum[0] - 2]; else y = 0; (ans += y * x % mod * x % mod) %= mod; y = 0; for (int i = 1; i <= N; i++) { if (A[i] == 0) continue; x = query(N) - query(A[i]); (y += x) %= mod; update(A[i]); } if (sum[0] > 0) x = fact[sum[0]]; else x = 1; (ans += y * x % mod) %= mod; (ans *= fast_pow(fact[sum[0]], mod - 2)) %= mod; printf( %lld , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int FASTBUFFER; const int N = 1005; const int INF = 1000000000; char str[N][N]; int n, m, l[N], r[N]; int main() { scanf( %d %d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %s , str[i] + 1); } for (int i = 1; i <= n; i++) { int ll = m + 1, rr = 0; for (int j = 1; j <= m; j++) { if (str[i][j] == X ) { ll = j; break; } } for (int j = m; j >= 1; j--) { if (str[i][j] == X ) { rr = j; break; } } for (int j = ll; j <= rr; j++) { if (str[i][j] != X ) { printf( -1 n ); return 0; } } l[i] = ll, r[i] = rr; } int st, end; for (int i = 1; i <= n; i++) { if (l[i] != m + 1) { st = i; break; } } for (int i = n; i >= 1; i--) { if (l[i] != m + 1) { end = i; break; } } for (int i = st; i <= end; i++) { if (l[i] == m + 1) { printf( -1 n ); return 0; } } int ans1 = -1, ans2 = -1, flag = 0; for (int i = st + 1; i <= end; i++) { if (l[i] < l[i - 1] || r[i] < r[i - 1]) { printf( -1 n ); return 0; } if (l[i] > r[i - 1]) { printf( -1 n ); return 0; } if (r[i] > r[i - 1]) { flag = 1; } if (l[i] > l[i - 1] && ans1 == -1) { int last; for (last = i - 1; last >= st; last--) { if (r[last] != r[i]) { break; } } if (last < st) { last++; } ans1 = r[last] - l[i] + 1; } } int ans = INF; if (ans1 == -1) { if (st == end) { printf( 1 n ); return 0; } else { if (flag) { ans1 = r[st] - l[st] + 1; } else { printf( %d n , min(end - st + 1, r[st] - l[st] + 1)); return 0; } } } for (int ans1 = 1; ans1 <= r[st] - l[st] + 1; ans1++) { for (int ans2 = 1; ans2 <= end - st + 1; ans2++) { int ok = 1; for (int i = st; i <= st + ans2 - 1; i++) { if (l[i] != l[st]) { ok = 0; break; } } if (ok) { int top = st, bo = st + ans2 - 1, now = l[st]; while (bo < end) { while (r[top] > now + ans1 - 1) { now++; } top++; bo++; if (now + ans1 - 1 > r[top]) { ok = 0; } if (now != l[bo]) { ok = 0; } } for (int i = top; i <= bo; i++) { if (r[i] != r[top]) { ok = 0; } } } if (ok) { ans = min(ans, ans1 * ans2); } } } if (ans == INF) { printf( -1 n ); return 0; } else { printf( %d n , ans); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0), cout.tie(0); int t; cin >> t; while (t--) { int n, i, j; cin >> n; vector<int> icons(n); for (i = 0; i < n; i++) { cin >> icons[i]; } vector<int> num; sort(icons.begin(), icons.end()); int cnt = 1; for (i = 1; i < icons.size(); i++) { if (icons[i] == icons[i - 1]) { cnt++; } else { num.push_back(cnt); cnt = 1; } } num.push_back(cnt); int x = num[0] + 1; int minNum = 1e9 + 7; for (i = 1; i <= x; i++) { int sum = 0; for (j = 0; j < num.size(); j++) { int q = ceil((float)num[j] / i); if ((i - 1) * q > num[j]) { sum = 1e9 + 7; break; } sum += q; } if (sum < minNum) minNum = sum; } cout << minNum << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const long long INF = numeric_limits<int>::max(); const long long LINF = numeric_limits<long long>::max() / 2; const double DINF = numeric_limits<double>::max(); const int ITER = 3000; const double EPS = 1e-9; const int MAXN = 1005; struct addr { int x, y; addr(){}; addr(int a, int b) { x = a; y = b; } }; struct cell { addr top, bot, left, right; addr cur; cell(){}; }; cell a[MAXN][MAXN]; int val[MAXN][MAXN]; int getVal(addr cur) { return val[cur.x][cur.y]; } cell moveLeft(cell x) { x = a[x.left.x][x.left.y]; return x; } cell moveRight(cell x) { x = a[x.right.x][x.right.y]; return x; } cell moveTop(cell x) { x = a[x.top.x][x.top.y]; return x; } cell moveBot(cell x) { x = a[x.bot.x][x.bot.y]; return x; } string strad(addr x) { stringstream ss; ss << ( << x.x << , << x.y << ) ; return ss.str(); } void solve() { int n, m, q; cin >> n >> m >> q; for (int i = 0; i < MAXN; ++i) { for (int j = 0; j < MAXN; ++j) { a[i][j].cur.x = i; a[i][j].cur.y = j; if (i > 0) a[i][j].top = addr(i - 1, j); if (i < MAXN - 1) a[i][j].bot = addr(i + 1, j); if (j < MAXN - 1) a[i][j].right = addr(i, j + 1); if (j > 0) a[i][j].left = addr(i, j - 1); } } for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { cin >> val[i][j]; } } cout << endl; cell it = a[0][0]; while (q--) { int x, y, c, d, h, w; cin >> x >> y >> c >> d >> h >> w; cell first = a[0][0]; cell second = a[0][0]; for (int i = 0; i < x; ++i) first = moveBot(first); for (int i = 0; i < y; ++i) first = moveRight(first); for (int i = 0; i < c; ++i) second = moveBot(second); for (int i = 0; i < d; ++i) second = moveRight(second); for (int i = 0; i < w; ++i) { addr ftop = first.top; addr stop = second.top; a[ftop.x][ftop.y].bot = second.cur; a[stop.x][stop.y].bot = first.cur; a[first.cur.x][first.cur.y].top = stop; a[second.cur.x][second.cur.y].top = ftop; if (i < w - 1) { first = moveRight(first); second = moveRight(second); } } for (int i = 0; i < h; ++i) { addr fright = first.right; addr sright = second.right; a[fright.x][fright.y].left = second.cur; a[sright.x][sright.y].left = first.cur; a[first.cur.x][first.cur.y].right = sright; a[second.cur.x][second.cur.y].right = fright; if (i < h - 1) { first = moveBot(first); second = moveBot(second); } } for (int i = 0; i < w; ++i) { addr fbot = first.bot; addr sbot = second.bot; a[fbot.x][fbot.y].top = second.cur; a[sbot.x][sbot.y].top = first.cur; a[first.cur.x][first.cur.y].bot = sbot; a[second.cur.x][second.cur.y].bot = fbot; if (i < w - 1) { first = moveLeft(first); second = moveLeft(second); } } for (int i = 0; i < h; ++i) { addr sleft = second.left; addr fleft = first.left; a[fleft.x][fleft.y].right = second.cur; a[sleft.x][sleft.y].right = first.cur; a[first.cur.x][first.cur.y].left = sleft; a[second.cur.x][second.cur.y].left = fleft; if (i < h - 1) { first = moveTop(first); second = moveTop(second); } } } it = a[0][0]; it = moveRight(it); it = moveBot(it); for (int i = 0; i < n; ++i) { cell col = it; for (int j = 0; j < m; ++j) { cout << getVal(col.cur) << ; col = moveRight(col); } it = moveBot(it); cout << n ; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); }
#include <bits/stdc++.h> using namespace std; void print() { int n; cin >> n; int arr[n], mx = 0, sum = 0; for (int i = 0; i < n; i++) { cin >> arr[i]; sum += arr[i]; mx = max(mx, arr[i]); } if (mx * 2 > sum || (sum & 1)) cout << T << endl; else cout << HL << endl; } int main() { int t; cin >> t; while (t) { --t; print(); } }
#include <bits/stdc++.h> using namespace std; template <typename T> std::ostream &operator<<(std::ostream &out, vector<T> &v) { for (typename vector<T>::size_type i = 0; i < v.size(); ++i) out << v[i] << ; out << n ; return out; } template <typename T> std::ostream &operator<<(std::ostream &out, set<T> &s) { for (auto e : s) out << e << ; out << n ; return out; } template <typename T, typename N> std::ostream &operator<<(std::ostream &out, pair<T, N> &p) { out << ( << p.first << , << p.second << ) ; return out; } template <typename T, typename N> std::ostream &operator<<(std::ostream &out, vector<pair<T, N> > &v) { for (size_t i = 0; i < v.size(); ++i) cout << v[i]; out << n ; return out; } template <typename T> std::ostream &operator<<(std::ostream &out, vector<vector<T> > &v) { for (size_t i = 0; i < v.size(); ++i) { for (size_t j = 0; j < v[i].size(); ++j) { out << v[i][j] << ; } out << n ; } return out; } template <typename T> std::ostream &operator<<(std::ostream &out, vector<set<T> > &v) { for (size_t i = 0; i < v.size(); ++i) { out << v[i]; } out << n ; return out; } void solve() { int n; cin >> n; vector<int> a(n); int total = 0; for (int i = 0; i < n; ++i) { cin >> a[i]; total += a[i]; } int diff = 0; for (int i = n - 1; i >= 0; --i) { diff = abs(diff - a[i]); } cout << (total - diff) / 2 << << (total + diff) / 2 << n ; return; } int main() { std::ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; t = 1; while (t--) { solve(); } return 0; }
#include <bits/stdc++.h> int dx[] = {+0, +0, -1, +1, +1, +1, -1, -1}; int dy[] = {+1, -1, +0, +0, +1, -1, +1, -1}; using namespace std; int n, mod = 1000000000 + 7; long long res; bool f1[20], f2[20]; int r[8] = {1, 18, 1800, 670320, 734832000, 890786230, 695720788, 150347555}; void attempt(int i) { if (i == n + 1) { res++; return; } for (int j = int(1); j <= int(n); j++) if (f1[j]) { int k = (n - i + 1 + j - 2) % n + 1; if (f2[k]) { f1[j] = f2[k] = false; attempt(i + 1); f1[j] = f2[k] = true; } } } int main() { cin >> n; if (n % 2 == 0) cout << 0 << endl; else cout << r[n / 2] << endl; return 0; }
#include <bits/stdc++.h> using namespace std; vector<int> g[100001]; int dist[100001]; int n, m; void bfs(int x) { queue<int> q; int cur, i; memset(dist, -1, sizeof(dist)); dist[x] = 0; q.push(x); while (!q.empty()) { cur = q.front(); q.pop(); for (i = 0; i < (int)g[cur].size(); i++) { if (dist[g[cur][i]] == -1) { dist[g[cur][i]] = dist[cur] + 1; q.push(g[cur][i]); } } } } int main() { int i, a, b, x, res; scanf( %d%d , &n, &m); for (i = 0; i < m; i++) { scanf( %d%d , &a, &b); g[a].push_back(b); g[b].push_back(a); } bfs(1); res = 0; x = 1; for (i = 1; i <= n; i++) { if (dist[i] > res) { res = dist[i]; x = i; } } bfs(x); res = 0; for (i = 1; i <= n; i++) { res = max(res, dist[i]); } printf( %d n , res); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); char board[9][9]; char trash; for (long r = 0; r < 3; ++r) { for (long x = 0; x < 3; ++x) { for (long c = 0; c < 3; ++c) { for (long y = 0; y < 3; ++y) cin >> board[3 * r + x][3 * c + y]; if (c == 5) cin >> trash; } } } long x, y; cin >> x >> y; --x, --y; x %= 3; y %= 3; bool empty = false; for (long i = 0; i < 3; ++i) for (long j = 0; j < 3; ++j) if (board[3 * x + i][3 * y + j] == . ) empty = true; if (empty) { for (long i = 0; i < 3; ++i) for (long j = 0; j < 3; ++j) if (board[3 * x + i][3 * y + j] == . ) board[3 * x + i][3 * y + j] = ! ; } else { for (long i = 0; i < 9; ++i) for (long j = 0; j < 9; ++j) if (board[i][j] == . ) board[i][j] = ! ; } for (long r = 0; r < 3; ++r) { for (long x = 0; x < 3; ++x) { for (long c = 0; c < 3; ++c) { for (long y = 0; y < 3; ++y) cout << board[3 * r + x][3 * c + y]; if (c < 2) cout << ; } cout << n ; } cout << n ; } }
#include <bits/stdc++.h> using namespace std; int n, p; int main() { map<int, int> mp; cin >> n; for (int i = 1; i <= 2 * n + 1; i++) { if (p % n == 0) { mp[n]++; } mp[p % n]++; p += i - 1; } for (int i = 1; i <= n; i++) { if (mp[i] == 0) { cout << NO ; return 0; } } cout << YES << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 3e2 + 5; int N, T; int pref[MAXN]; int ask(int l, int r) { printf( ? %d %d n , l, r); fflush(stdout); int res; scanf( %d , &res); if (res == -1) exit(0); return res; } int main() { scanf( %d%d , &N, &T); if (N == 1) { printf( ! %d n , T); fflush(stdout); return 0; } int k = N % 2, curr = T; for (int i = 1; i <= N - k; i++) { int lft = 0, rig = 0; bool ok = false; while (!ok || lft || rig) { int nxt = ask(i, i + k); if ((curr + nxt) % 2 == (i + k) % 2) { lft ^= 1; if (lft && !rig) { pref[i + k] = (i + k - nxt + T) / 2; ok = true; } } else rig ^= 1; curr = nxt; } } if (k) { int it = 0; while (1) { int nxt = ask(2, N); if (!((curr + nxt) % 2)) { pref[1] = it ? (T - nxt + 1) / 2 : (nxt + T - N + 1) / 2; break; } curr = nxt; it ^= 1; } } printf( ! ); for (int i = 1; i <= N; i++) printf( %d , pref[i] - pref[i - 1]); puts( ); fflush(stdout); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int a[3]; for (int i = 0; i < 3; i++) cin >> a[i]; sort(a, a + 3); cout << a[2] - a[0]; return 0; }
#include <bits/stdc++.h> using namespace std; clock_t start; mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count()); struct MaxFlow { struct Edge { long long f; long long u; Edge* nex; Edge* rev; Edge(long long _u, long long _f, Edge* _nex) : f(_f), u(_u), nex(_nex) {} }; vector<Edge*> g; MaxFlow(long long n) { g.resize(n); } void AddEdge(long long v, long long u, long long f) { g[v] = new Edge(u, f, g[v]); g[u] = new Edge(v, 0, g[u]); g[v]->rev = g[u]; g[u]->rev = g[v]; } long long Flow(long long src, long long sink, long long n) { long long flow = 0; while (true) { vector<Edge*> par(n); vector<bool> vis(n, false); vector<long long> mn(n, 0); queue<long long> q; q.push(src); vis[src] = 1; mn[src] = (long long)(2e18); while (!q.empty()) { long long v = q.front(); q.pop(); for (Edge* e = g[v]; e; e = e->nex) { if (e->f <= 0) continue; if (!vis[e->u]) { mn[e->u] = min(mn[v], e->f); par[e->u] = e; vis[e->u] = 1; q.push(e->u); } } } long long curr = sink; long long ff = mn[sink]; if (ff == 0) break; flow += ff; while (curr != src) { Edge* e = par[curr]; e->f -= ff; e->rev->f += ff; curr = e->rev->u; } } return flow; } }; const long long N = 3e5 + 10; bool pr[N]; void seive() { for (long long i = 2; i < N; i++) { if (pr[i]) continue; for (long long j = i + i; j < N; j += i) pr[j] = 1; } } void solve() { long long n, k; cin >> n >> k; long long p[n], c[n], l[n]; for (long long i = 0; i < n; i++) { cin >> p[i] >> c[i] >> l[i]; } long long s = 1, e = n, ans = -1; while (s <= e) { long long mid = (s + e) / 2, sum = 0; vector<pair<long long, long long> > edge; long long mx = 0; for (long long i = 0; i < n; i++) { if (l[i] <= mid && c[i] != 1) { sum += p[i]; edge.push_back({p[i], c[i]}); } if (c[i] == 1 && l[i] <= mid) { mx = max(mx, p[i]); } } if (mx) edge.push_back({mx, 1}); sum += mx; MaxFlow M((long long)((edge).size()) + 4); long long src = (long long)((edge).size()), sink = (long long)((edge).size()) + 1; for (long long i = 0; i < (long long)((edge).size()); i++) { for (long long j = i + 1; j < (long long)((edge).size()); j++) { if (!pr[edge[i].second + edge[j].second]) { if (edge[i].second % 2) M.AddEdge(i, j, edge[i].first); else M.AddEdge(j, i, edge[j].first); } } if (edge[i].second % 2) M.AddEdge(src, i, edge[i].first); else M.AddEdge(i, sink, edge[i].first); } long long flow = M.Flow(src, sink, sink + 4); if (sum - flow >= k) { ans = mid; e = mid - 1; } else s = mid + 1; } cout << ans << n ; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t = 1; start = clock(); cout << fixed << setprecision(20); seive(); for (long long i = 1; i <= t; i++) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; const int M = 1 << 13; const int N = 13; long long dp[M][N][2][2]; bool used[M][N][2][2]; vector<int> digits_hour, digits_minuts; long long solve(int mask, int pos, bool flag1, bool flag2) { int h = digits_hour.size(); int min = digits_minuts.size(); if (pos == h + min) { return 1LL; } long long &ans = dp[mask][pos][flag1][flag2]; if (used[mask][pos][flag1][flag2]) { return ans; } used[mask][pos][flag1][flag2] = true; if (pos >= h) { for (int t = 0; t < 7; t++) { int el = 1 << t; if ((mask & el) == 0) { if (flag2 || digits_minuts[pos - h] >= t) { ans += solve(mask | el, pos + 1, flag1, flag2 || (digits_minuts[pos - h] > t)); } } } } else { for (int t = 0; t < 7; t++) { int el = 1 << t; if ((mask & el) == 0) { if (flag1 || digits_hour[pos] >= t) { ans += solve(mask | el, pos + 1, flag1 || (digits_hour[pos] > t), flag2); } } } } return ans; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); int n, m; scanf( %d %d , &n, &m); n--, m--; if (n == 0) { digits_hour.push_back(0); } if (m == 0) { digits_minuts.push_back(0); } while (n) { digits_hour.push_back(n % 7); n /= 7; } reverse(digits_hour.begin(), digits_hour.end()); while (m) { digits_minuts.push_back(m % 7); m /= 7; } reverse(digits_minuts.begin(), digits_minuts.end()); printf( %lld n , solve(0, 0, false, false)); return 0; }
#include <bits/stdc++.h> using std::map; long long n; long long p2[100005 * 2] = {1}; long long fa[100005 * 2], size[100005 * 2], p[100005 * 2]; long long vis[100005 * 2]; map<long long, long long> mx, my; long long cnt; long long ans = 1; long long getfa(long long x) { return fa[x] == x ? x : fa[x] = getfa(fa[x]); } int main() { scanf( %I64d , &n); for (long long i = 1; i <= n * 2; i++) { fa[i] = i; size[i] = 1; p2[i] = (p2[i - 1] * 2) % ((int)1e9 + 7); } long long x, y, px, py, fx, fy; for (long long i = 1; i <= n; i++) { scanf( %I64d %I64d , &x, &y); if (mx.find(x) == mx.end()) { mx[x] = ++cnt; } if (my.find(y) == my.end()) { my[y] = ++cnt; } px = mx[x]; py = my[y]; fx = getfa(px); fy = getfa(py); if (fx == fy) { p[fx] = 1; } else { fa[fx] = fy; size[fy] += size[fx]; p[fy] |= p[fx]; } getfa(px); } for (long long i = 1; i <= cnt; i++) { long long fi = getfa(i); if (vis[fi]) continue; vis[fi] = 1; if (p[fi]) { ans *= p2[size[fi]]; } else { ans *= (p2[size[fi]] - 1); } ans %= ((int)1e9 + 7); } printf( %I64d n , ans); }
//愿你和你重要的人能够重逢！ #include<bits/stdc++.h> using namespace std; template<typename T>inline void read(T &x) { x=0;char c=getchar(),f=0; for(;c<48||c>57;c=getchar()) if(!(c^45)) f=1; for(;c>=48&&c<=57;c=getchar()) x=(x<<1)+(x<<3)+(c^48); f?x=-x:0; } long long l,r,st,t,x,y;set<long long>s; int main() { read(st),read(l),read(r),read(t),read(x),read(y); if(x>y) { if((x-y<2e18/t&&st-l>=t*(x-y))&&st+y<=r) puts( Yes ); else if(x-y<2e18/t&&st-l>=t*x-(t-1)*y) puts( Yes ); else puts( No ); return 0; } long long qwq=st,tp;qwq=l+(qwq-l)%x,t-=(st-qwq)/x; if(t<=0) return puts( Yes ),0;else if(qwq+y>r) return puts( No ),0; while(t>0) { qwq+=y;if(qwq>r) return puts( No ),0;else tp=qwq,qwq=l+(qwq-l)%x,t-=(tp-qwq)/x; if(t<=0) return puts( Yes ),0;else if(s.count(qwq)) return puts( Yes ),0;else s.insert(qwq); } return puts( Yes ),0; }
#include <bits/stdc++.h> using namespace std; int n, x, maxi; string s = ABRACADABRA ; int main() { cin >> n; maxi = 0; while (n--) { cin >> x; maxi = max(maxi, x); } cout << (maxi ^ x) << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int n, w[200200], h[200200], W, a[200200], maxH, maxH2, id; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d%d , &w[i], &h[i]); if (h[i] > maxH) { maxH = h[i]; id = i; } W += w[i]; } for (int i = 1; i <= n; ++i) { if (i != id) maxH2 = max(maxH2, h[i]); } for (int i = 1; i <= n; ++i) { if (h[i] == maxH) printf( %d , maxH2 * (W - w[i])); else printf( %d , maxH * (W - w[i])); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, k; string s; cin >> n >> k >> s; for (int i = 0; i < s.size(); i++) { if (!k) break; if (i + 2 < s.size() && s[i] == 4 && s[i + 1] == 7 && s[i + 2] == 7 && i % 2 == 0) { if (k % 2) s[i + 1] = 4 ; break; } if (i + 2 < s.size() && s[i] == 4 && s[i + 1] == 4 && s[i + 2] == 7 && i % 2 == 0) { if (k % 2) s[i + 1] = 7 ; break; } if (i + 1 < s.size() && s[i] == 4 && s[i + 1] == 7 && i % 2 == 0) { s[i + 1] = 4 ; k--; } if (i + 1 < s.size() && s[i] == 4 && s[i + 1] == 7 && i % 2 != 0) { s[i] = 7 ; k--; } } cout << s; }
#include <bits/stdc++.h> using namespace std; int main() { int a[4], i, j, min = 1000, x, y; for (i = 0; i < 4; i++) { cin >> a[i]; if (min > a[i]) min = a[i]; } cin >> x >> y; if (x >= min) { cout << 0; return 0; } else if (y < min) { cout << y - x + 1; } else { cout << min - x; } }
#include <bits/stdc++.h> using namespace std; long long int power(long long int x, long long int y) { long long int one = 1; if (!y) return one; else if (y == 1) return x; else { long long int y1 = power(x, y >> 1); long long int y2 = y1 * y1; if (y & 1) return x * y2; else return y2; } } bool comp(pair<int, int> a, pair<int, int> b) { if (a.first != b.first) return a.first < b.first; else return a.second > b.second; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, mx; cin >> n >> mx; long long int a[n]; map<long long int, long long int> occ; for (int i = 0; i < n; i++) cin >> a[i], occ[a[i]]++; long long int allow = 8 * mx; allow /= n; if (allow > 20) { cout << 0; return 0; } long long int dis = power(2, allow); vector<pair<int, int> > give; for (auto v : occ) give.push_back(make_pair(v.first, v.second)); long long int n1 = give.size(); sort(give.begin(), give.end(), comp); long long int ans = INT_MAX; long long int presum[n1]; presum[0] = give[0].second; for (int i = 1; i < n1; i++) presum[i] = presum[i - 1] + give[i].second; if (n1 <= dis) { cout << 0; return 0; } for (int i = 0; i <= n1 - dis; i++) { int rem = 0; if (i == 0) rem = presum[i + dis - 1]; else rem = presum[i + dis - 1] - presum[i - 1]; if (n - rem < ans) ans = n - rem; } cout << ans; }
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; const int MAX = 2e5 + 5; const long long MAX2 = 11; const long long MOD = 998244353; const long long MOD2 = 1000000006; const long long INF = 2e18; const int dr[] = {1, 0, -1, 0, 1, 1, -1, -1, 0}; const int dc[] = {0, 1, 0, -1, 1, -1, 1, -1, 0}; const double pi = acos(-1); const double EPS = 1e-9; const int block = 316; int n, q, push_front[MAX], le[MAX], ri[MAX], l[MAX], r[MAX], cl[MAX], jlh[MAX], cnt, a, b, len, id, ls; long long hs[MAX], x[MAX], key, tmp, pj, t2; bool z[MAX], st; char c; pair<long long, int> res; inline pair<long long, int> f(int a, int b) { if (a > b) return {0, 0}; int len = b - a + 1; return {x[b] - x[a - 1] * hs[len], len}; } inline pair<long long, int> comp(int a, int b) { tmp = pj = st = 0; if (z[a]) { if (ri[a] - a + 1 & 1) ++pj; a = ri[a] + 1; } if (z[b]) { if (b - le[b] + 1 & 1) st = 1; b = le[b] - 1; } if (cl[a] == cl[b]) { tmp = l[a] + r[b] - jlh[cl[a]]; if (st) tmp *= key; return {tmp, 1 + pj + st}; } res = f(cl[a] + 1, cl[b] - 1); tmp = (l[a] * hs[res.second] + res.first) * key + r[b]; if (st) tmp *= key; return {tmp, cl[b] - cl[a] + 1 + pj + st}; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); key = 2000003153; cin >> n; hs[0] = 1; for (int i = 1; i <= n; ++i) { cin >> c, z[i] = (c == 1 ), push_front[i] = push_front[i - 1] + z[i], hs[i] = hs[i - 1] * key; if (z[i]) { st ^= 1; if (le[i - 1]) le[i] = le[i - 1]; else le[i] = i; } else { if (st) { jlh[id] = cnt; x[id] = x[id - 1] * key + cnt; st = cnt = 0; } if (cnt == 0) ++id; ++cnt, r[i] = cnt; cl[i] = id; } } if (cnt) x[id] = x[id - 1] * key + cnt, jlh[id] = cnt; ls = id; cnt = 0; for (int i = n; i >= 1; --i) { if (z[i]) { if (ri[i + 1]) ri[i] = ri[i + 1]; else ri[i] = i; } else { if (cl[i] != ls) cnt = 0, ls = cl[i]; l[i] = ++cnt; } } cin >> q; while (q--) { cin >> a >> b >> len; if (push_front[a + len - 1] - push_front[a - 1] != push_front[b + len - 1] - push_front[b - 1]) { cout << No n ; continue; } if (push_front[a + len - 1] - push_front[a - 1] == 0 || push_front[a + len - 1] - push_front[a - 1] == len) { cout << Yes n ; continue; } if (comp(a, a + len - 1) == comp(b, b + len - 1)) cout << Yes n ; else cout << No n ; } return 0; }
#include <iostream> #include <cmath> using namespace std; int t, n, a[105]; int main(){ cin>>t; while(t--){ cin>>n; int suc = 0; for(int i=0; i<n; i++) cin>>a[i]; for(int i=0; i<n; i++){ int k = (int)sqrt((double)a[i]); if(k*k != a[i]){ suc = 1; break; } } if(suc) cout<< YES <<endl; else cout<< NO <<endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 2600, MAXL = 10000 * 5 + 10, MAXALP = 26; int n, f[MAXN][MAXN], cnt[MAXALP], p[MAXN][MAXN]; char str[MAXL]; pair<int, int> Tohka; string Houki; void Print(const pair<int, int> &a, int res) { if (res <= 0) return; if (p[a.first][a.second] == -1) Print(make_pair(a.first - 1, a.second), res); else if (p[a.first][a.second] == 1) Print(make_pair(a.first, a.second + 1), res); else { Print(make_pair(a.first - 1, a.second + 1), res - 2 + (a.first == a.second)); if (res <= 100) Houki += str[a.first]; } } int main() { scanf( %s , str + 1); n = strlen(str + 1); if (n >= 2600) { for (int i = 1; i <= n; ++i) ++cnt[str[i] - a ]; for (int i = 0; i < MAXALP; ++i) if (cnt[i] >= 100) { for (int j = 0; j < 100; ++j) printf( %c , a + i); exit(0); } } for (int i = 1; i <= n; ++i) for (int j = n; j >= i; --j) { f[i][j] = f[i - 1][j], p[i][j] = -1; if (f[i][j] < f[i][j + 1]) f[i][j] = f[i][j + 1], p[i][j] = 1; if (str[i] == str[j] && f[i][j] < f[i - 1][j + 1] + 1) f[i][j] = f[i - 1][j + 1] + 1, p[i][j] = 0; if (f[i][j] * 2 - (i == j) > f[Tohka.first][Tohka.second] * 2 - (Tohka.first == Tohka.second)) Tohka = make_pair(i, j); } Print(Tohka, f[Tohka.first][Tohka.second] * 2 - (Tohka.first == Tohka.second)); string rev = Houki.substr(0, Houki.size() - (Tohka.first == Tohka.second && f[Tohka.first][Tohka.second] * 2 - (Tohka.first == Tohka.second) <= 100)); reverse(rev.begin(), rev.end()); Houki += rev; cout << Houki << endl; fclose(stdin); fclose(stdout); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; int ls[N << 2], rs[N << 2], rt[N << 2], sum[N << 2]; int rcnt; void update(int &rt, int l, int r, int pos) { if (rt == 0) rt = ++rcnt; if (l == r) { sum[rt]++; return; } int mid = (l + r) >> 1; if (pos <= mid) { update(ls[rt], l, mid, pos); } else { update(rs[rt], mid + 1, r, pos); } sum[rt] = sum[ls[rt]] + sum[rs[rt]]; } int query(int &rt, int l, int r, int ql, int qr) { if (rt == 0) return 0; if (ql <= l && qr >= r) return sum[rt]; int mid = (l + r) >> 1, res = 0; if (ql <= mid) res += query(ls[rt], l, mid, ql, qr); if (qr > mid) res += query(rs[rt], mid + 1, r, ql, qr); return res; } int n, k; struct node { int x, r, f; bool operator<(const node &z) const { return r > z.r; } } a[N]; const int low = 1000000000; int main() { scanf( %d %d , &n, &k); for (int i = 1; i <= n; ++i) { scanf( %d %d %d , &a[i].x, &a[i].r, &a[i].f); } sort(a + 1, a + n + 1); long long ans = 0; for (int i = 1; i <= n; ++i) { for (int j = a[i].f - k; j <= a[i].f + k; ++j) { if (j < 1 || j > 10000) continue; ans += query(rt[j], 1, low, max(1, a[i].x - a[i].r), min(low, a[i].x + a[i].r)); } update(rt[a[i].f], 1, low, a[i].x); } cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; const long double EPS = 1e-12; const int N = 100000 + 10; long double sqr(long double x) { return x * x; } struct PT { long double x, y; PT(long double x = 0, long double y = 0) : x(x), y(y) {} void in() { double xx, yy; scanf( %lf%lf , &xx, &yy); x = xx, y = yy; } } P[N]; bool operator<(const PT& p1, const PT& p2) { if (fabs(p1.x - p2.x) > EPS) return p1.x < p2.x; return p1.y + EPS < p2.y; } bool operator==(const PT& p1, const PT& p2) { return fabs(p1.x - p2.x) < EPS && fabs(p1.y - p2.y) < EPS; } PT operator+(PT p1, PT p2) { return PT(p1.x + p2.x, p1.y + p2.y); } PT operator-(PT p1, PT p2) { return PT(p1.x - p2.x, p1.y - p2.y); } PT operator*(PT p, long double c) { return PT(p.x * c, p.y * c); } PT operator/(PT p, long double c) { return PT(p.x / c, p.y / c); } long double dis(PT p) { return sqrt(sqr(p.x) + sqr(p.y)); } long double dis2(PT p) { return sqr(p.x) + sqr(p.y); } long double dis2(PT p1, PT p2) { return sqr(p1.x - p2.x) + sqr(p1.y - p2.y); } long double dis(PT p1, PT p2) { return sqrt(dis2(p1, p2)); } long double vect(PT p1, PT p2) { return p1.x * p2.y - p2.x * p1.y; } long double scal(PT p1, PT p2) { return p1.x * p2.x + p1.y * p2.y; } long double getAngle(PT p) { return atan2(p.y, p.x); } long double vect(PT p, PT p1, PT p2) { return vect(p1 - p, p2 - p); } long double scal(PT p, PT p1, PT p2) { return scal(p1 - p, p2 - p); } long double getAngle(PT p, PT p1, PT p2) { return acos(scal(p, p1, p2) / dis(p, p1) / dis(p, p2)); } long double disToLineSgn(PT p, PT p1, PT p2) { return vect(p, p1, p2) / dis(p1, p2); } long double r[N]; PT P1, P2; vector<pair<long double, long double> > vec[2]; int main() { P1.in(), P2.in(); int n; scanf( %d , &n); for (int i = 0; i < n; i++) { P[i].in(); double rr; scanf( %lf , &rr); r[i] = rr; } PT M = (P1 + P2) / 2; long double a = dis(P1, P2) / 2; int flg = 0; for (int i = 0; i < n; i++) { long double d = disToLineSgn(P[i], P1, P2); long double l2 = dis2(M, P[i]); long double p = l2 - sqr(a) - sqr(r[i]); long double A = 4 * (sqr(d) - sqr(r[i])); long double B = -4 * d * p; long double C = sqr(p) - 4 * sqr(a * r[i]); long double D = B * B - 4 * A * C; if (D < EPS) continue; long double x1 = (-B - sqrt(D)) / (2 * A), x2 = (-B + sqrt(D)) / (2 * A); if (x2 < EPS) vec[0].push_back(pair<long double, long double>(-x2, -x1)); else if (x1 > -EPS) vec[1].push_back(pair<long double, long double>(x1, x2)); else { flg = 1; vec[0].push_back(pair<long double, long double>(0, -x1)); vec[1].push_back(pair<long double, long double>(0, x2)); } } if (!flg) return printf( %.10lf n , (double)a), 0; for (int i = 0; i < 2; i++) sort(vec[i].begin(), vec[i].end()); long double ans = 1e60; for (int i = 0; i < 2; i++) { long double prv = EPS * 2; for (auto it : vec[i]) { if (it.first < prv - EPS) prv = max(prv, it.second); else { ans = min(ans, prv); break; } } ans = min(ans, prv); } printf( %.10lf n , (double)sqrt(sqr(ans) + sqr(a))); }
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); const double eps = 1e-12; const int inf = 2000000000; const long long int infLL = (long long int)2e18; long long int MOD = 1000000007; int MOD1 = 1000000007; int MOD2 = 1000000009; inline bool checkBit(long long int n, long long int i) { return n & (1LL << i); } inline long long int setBit(long long int n, long long int i) { return n | (1LL << i); ; } inline long long int resetBit(long long int n, long long int i) { return n & (~(1LL << i)); } int dx[] = {0, 0, +1, -1}; int dy[] = {+1, -1, 0, 0}; inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; } inline bool isLeapYear(long long int year) { return (year % 400 == 0) || (year % 4 == 0 && year % 100 != 0); } inline void normal(long long int &a) { a %= MOD; (a < 0) && (a += MOD); } inline long long int modMul(long long int a, long long int b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a * b) % MOD; } inline long long int modAdd(long long int a, long long int b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a + b) % MOD; } inline long long int modSub(long long int a, long long int b) { a %= MOD, b %= MOD; normal(a), normal(b); a -= b; normal(a); return a; } inline long long int modPow(long long int b, long long int p) { long long int r = 1LL; while (p) { if (p & 1) r = modMul(r, b); b = modMul(b, b); p >>= 1LL; } return r; } inline long long int modDiv(long long int a, long long int b) { return modMul(a, modPow(b, MOD - 2)); } bool comp(const pair<long long int, pair<long long int, long long int> > &p1, const pair<long long int, pair<long long int, long long int> > &p2) { return p1.first > p2.first; } bool comp1(const pair<long long int, long long int> &p1, const pair<long long int, long long int> &p2) { if (p1.first == p2.first) { return p1.second > p2.second; } return p1.first < p2.first; } long long int converter(string a) { long long int i, mul = 1, r, t, ans = 0LL; if (a.length() == 0) return 0; for (i = a.length() - 1; i >= 0; i--) { t = a[i] - 0 ; r = t % 10; ans += (mul * r); mul = mul * 10; } return ans; } int msb(unsigned x) { union { double a; int b[2]; }; a = x; return (b[1] >> 20) - 1023; } const int MAX = (int)2e5 + 5; const int sz = (int)5e5 + 5; int on[MAX], a[MAX], n, big[sz], cnt[sz]; long long int ans, tot; void process() { int i, j; for (i = 2; i < sz; ++i) { if (big[i]) continue; for (j = i; j < sz; j += i) { big[j] = i; } } } long long int cal(long long int val) { return (val * (val - 1)) / 2LL; } void doo(int val, int pass) { vector<int> store; while (val > 1) { int p = big[val]; store.push_back(p); while (val % p == 0) val = val / p; } int nn = store.size(), i, j; for (i = 1; i < (1 << nn); ++i) { long long int now = 1LL; for (j = 0; j < nn; ++j) { if (i & (1 << j)) now *= store[j]; } if (pass == 1) { if (__builtin_popcountll(i) & 1) ans += cnt[now]; else ans -= cnt[now]; cnt[now]++; } else { cnt[now]--; if (__builtin_popcountll(i) & 1) ans -= cnt[now]; else ans += cnt[now]; } } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int q, i, x; process(); ans = 0LL; cin >> n >> q; for (i = 1; i <= n; ++i) cin >> a[i]; for (i = 1; i <= q; ++i) { cin >> x; if (on[x] == true) doo(a[x], -1), --tot, on[x] = false; else { doo(a[x], 1), ++tot, on[x] = true; } cout << cal(tot) - ans << n ; } return 0; }
#include <bits/stdc++.h> int main() { int num = 0; int a[100]; int i = 0; int m = 0; int yushu; char hex[16] = { 0 , 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , A , B , C , D , E , F }; scanf( %d , &num); if (num == 0) { printf( 1 n ); return 0; } while (num > 0) { yushu = num % 16; a[i++] = yushu; num = num / 16; } int output = 0; for (i = i - 1; i >= 0; i--) { m = a[i]; if (hex[m] == 0 ) output++; if (hex[m] == 4 ) output++; if (hex[m] == 6 ) output++; if (hex[m] == 8 ) output += 2; if (hex[m] == 9 ) output++; if (hex[m] == A ) output++; if (hex[m] == B ) output += 2; if (hex[m] == D ) output++; } printf( %d n , output); }
#include <bits/stdc++.h> using namespace std; const int inf = (int)1e9; const int mod = inf + 7; const double eps = 1e-9; const double pi = acos(-1.0); int n, ind = -1; int a[100100], b[100100]; pair<int, int> c[100100]; int v[100100], pos[100100]; vector<pair<int, int> > ans; bool is_happy(int x) { if (x == 0) return true; int c = x % 10; if (c != 4 && c != 7) return false; return is_happy(x / 10); } void sw(int x, int y) { if (x == y) return; ans.push_back(make_pair(x, y)); swap(a[x], a[y]); pos[a[x]] = x; pos[a[y]] = y; } int main() { cin >> n; for (int i = 0; i < n; i++) { scanf( %d , a + i); b[i] = a[i]; c[i] = make_pair(a[i], i); if (is_happy(a[i])) ind = i; } sort(b, b + n); bool ok = 1; for (int i = 0; i < n; i++) ok &= (a[i] == b[i]); if (ok) { printf( 0 n ); return 0; } if (ind == -1) { if (ok) printf( 0 n ); else printf( -1 n ); return 0; } sort(c, c + n); for (int i = 0; i < n; i++) a[c[i].second] = i; for (int i = 0; i < n; i++) pos[a[i]] = i; int x = a[ind]; for (int i = 0; i < n; i++) { if (i == x) continue; if (a[i] == i) continue; int target = pos[i]; sw(ind, i); ind = i; sw(ind, target); ind = target; } printf( %d n , (int)ans.size()); for (__typeof(ans.begin()) it = ans.begin(); it != ans.end(); it++) { printf( %d %d n , it->first + 1, it->second + 1); } return 0; }
#include <bits/stdc++.h> using namespace std; int a[100010], b[100010], ja[100010]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; ja[a[i]] = i; } for (int i = 2; i <= n; i++) { if (ja[i] > ja[i - 1]) b[i] = 1; else b[i] = 0; } int ad = 0; for (int i = 1; i <= n; i++) { int j = i; while (b[j] == 1) j++; ad = max(ad, j - i + 1); i = j; } cout << n - ad << endl; }
#include <bits/stdc++.h> using namespace std; const int maxn = 80005, maxe = 3000005, maxs = 80005, INF = 0x3f3f3f3f; int n, q, N, m, S, T, a[maxn]; struct event { int x, l, r, f; event(int _x = 0, int _l = 0, int _r = 0, int _f = 0) : x(_x), l(_l), r(_r), f(_f) {} bool operator<(const event &b) const { return x < b.x || x == b.x && f > b.f; } } E[maxs]; int son[maxe], nxt[maxe], lnk[maxn], flw[maxe], cap[maxe], tot = 1; inline void add(int x, int y, int f) { son[++tot] = y; nxt[tot] = lnk[x]; lnk[x] = tot; flw[tot] = 0; cap[tot] = f; son[++tot] = x; nxt[tot] = lnk[y]; lnk[y] = tot; flw[tot] = 0; cap[tot] = 0; } int d[maxn], que[maxn], pos[maxn]; bool bfs() { memset(d, 63, sizeof(d)); int hed = 0, til = 1; que[1] = S; d[S] = 0; while (hed != til) { int x = que[++hed]; for (int j = lnk[x]; j; j = nxt[j]) if (d[son[j]] == INF && flw[j] < cap[j]) d[que[++til] = son[j]] = d[x] + 1; } return d[T] != INF; } int dfs(int x, int flow) { if (x == T || flow == 0) return flow; int res = 0, f; for (int &j = pos[x]; j; j = nxt[j]) if (d[son[j]] == d[x] + 1 && (f = dfs(son[j], min(flow, cap[j] - flw[j]))) > 0) { flw[j] += f; flw[j ^ 1] -= f; res += f; flow -= f; if (flow == 0) break; } return res; } int dinic() { int ans = 0; while (bfs()) { memcpy(pos, lnk, sizeof(lnk)); ans += dfs(S, INF); } return ans; } int ls[maxs], rs[maxs], Rx, Ry; void build(int &x, int l, int r, int d) { x = ++N; if (l == r) { if (d) add(x, T, 1); else add(S, x, 1); return; } int mid = l + r >> 1; build(ls[x], l, mid, d); build(rs[x], mid + 1, r, d); if (d) add(x, ls[x], INF), add(x, rs[x], INF); else add(ls[x], x, INF), add(rs[x], x, INF); } void qry(int x, int l, int r, int ql, int qr, int z, int d) { if (ql <= l && r <= qr) { if (d) add(z, x, INF); else add(x, z, INF); return; } if (qr < l || r < ql) return; int mid = l + r >> 1; qry(ls[x], l, mid, ql, qr, z, d); qry(rs[x], mid + 1, r, ql, qr, z, d); } void cover(int x, int l, int r) { for (int i = l; i <= r; i++) a[i] = x; } void work(int x, int l, int r) { for (int i = l, j = l; i <= r; i = j) { while (j <= r && a[i] == a[j]) j++; N++; qry(Rx, 1, n, a[i] + 1, x, N, 0); qry(Ry, 1, n, i, j - 1, N, 1); } } int main() { scanf( %d%d , &n, &q); for (int i = 1; i <= q; i++) { int x, y, xx, yy; scanf( %d%d%d%d , &x, &y, &xx, &yy); E[++m] = event(x - 1, y, yy, 0); E[++m] = event(xx, y, yy, 1); } S = ++N; T = ++N; build(Rx, 1, n, 0); build(Ry, 1, n, 1); sort(E + 1, E + 1 + m); for (int i = 1; i <= m; i++) if (E[i].f) cover(E[i].x, E[i].l, E[i].r); else work(E[i].x, E[i].l, E[i].r); work(n, 1, n); printf( %d , dinic()); return 0; }
#include <bits/stdc++.h> using namespace std; const long double EPS = 1e-8; const int N = 1e5 + 10; int n, q; int sgn(long double x) { return x < -EPS ? -1 : x > EPS; } struct Point { Point() {} long double x, y; Point(long double x, long double y) : x(x), y(y) {} void read() { cin >> x >> y; } Point operator-(const Point& p) { return Point(x - p.x, y - p.y); } long double operator*(const Point& p) { return x * p.x + y * p.y; } long double operator^(const Point& p) { return x * p.y - y * p.x; } long double length() { return hypotl(x, y); } } poly[N]; using Vec = Point; long double getIntersection(Point p, Vec v, Point q, Vec w) { return (w ^ (p - q)) / (v ^ w); } long double work(Point p, Vec v) { long double ret = 0; vector<pair<long double, int> > pos; for (int i = 1; i <= n; i++) { int s1 = sgn(v ^ (poly[i] - p)); int s2 = sgn(v ^ (poly[i + 1] - p)); if (s1 == s2) continue; long double o = getIntersection(p, v, poly[i], poly[i + 1] - poly[i]); if (s1 > s2) pos.push_back({o, s1 && s2 ? 2 : 1}); else pos.push_back({o, s1 && s2 ? -2 : -1}); } sort(pos.begin(), pos.end()); int flag = 0; for (int i = 0; i + 1 < pos.size(); i++) { flag += pos[i].second; if (flag) ret += pos[i + 1].first - pos[i].first; } return ret * v.length(); } int main() { ios ::sync_with_stdio(false); cin >> n >> q; for (int i = 1; i <= n; i++) poly[i].read(); poly[n + 1] = poly[1]; while (q--) { Point a, b; a.read(); b.read(); cout << fixed << setprecision(20) << work(a, b - a) << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int test; cin >> test; while (test--) { int i, n, k; string s; cin >> n; cin >> s; vector<pair<string, int> > ans; for (i = 0; i < n; i++) { string sl = s.substr(0, i); string sr = s.substr(i, n - i); if (i % 2 != n % 2) reverse(sl.begin(), sl.end()); ans.push_back(make_pair(sr + sl, i + 1)); } sort(ans.begin(), ans.end()); cout << ans[0].first << endl << ans[0].second << endl; } }
#include <bits/stdc++.h> using namespace std; int main() { string n, m; int w = 0, b[10000]; cin >> n; for (int i = 0; i < n.length(); i++) { if (n.substr(i, 1) == r ) cout << i + 1 << endl; } for (int i = n.length() - 1; i >= 0; i--) { if (n.substr(i, 1) == l ) cout << i + 1 << endl; } cin >> n; return 0; }