func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; int n, m, k; int arr[51][51] = {0}, visit[51][51] = {0}; vector<pair<int, pair<int, int> > > v; int dfs(int a, int b, int count); void make_land(int i, int j); int main() { int i, j, sum = 0; char ch; cin >> n >> m >> k; for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { cin >> ch; if (ch == * ) arr[i][j]++; } } for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { if (!visit[i][j] && !arr[i][j]) { int value = dfs(i, j, 0); if (value != -1) v.push_back(make_pair(value, make_pair(i, j))); } } } sort(v.begin(), v.end()); int check = v.size(); vector<pair<int, pair<int, int> > >::iterator it = v.begin(); for (i = 0; i < v.size() - k; i++) { sum += it->first; int a = (it->second).first; int b = (it->second).second; make_land(a, b); it++; } cout << sum << endl; for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { if (arr[i][j] == 1) cout << * ; else cout << . ; } cout << endl; } } int dfs(int i, int j, int count) { visit[i][j] = 1; if (count != -1) count++; if (i == n - 1 || j == m - 1 || i == 0 || j == 0) count = -1; if (i <= n - 1 && j - 1 >= 0 && !visit[i][j - 1] && !arr[i][j - 1]) count = dfs(i, j - 1, count); if (i - 1 >= 0 && j <= m - 1 && !visit[i - 1][j] && !arr[i - 1][j]) count = dfs(i - 1, j, count); if (i <= n - 1 && j + 1 <= m - 1 && !visit[i][j + 1] && !arr[i][j + 1]) count = dfs(i, j + 1, count); if (i + 1 <= n - 1 && j <= m - 1 && !visit[i + 1][j] && !arr[i + 1][j]) count = dfs(i + 1, j, count); return count; } void make_land(int i, int j) { arr[i][j] = 1; if (i <= n - 1 && j - 1 >= 0 && !arr[i][j - 1]) { make_land(i, j - 1); } if (i - 1 >= 0 && j <= m - 1 && !arr[i - 1][j]) { make_land(i - 1, j); } if (i <= n - 1 && j + 1 <= m - 1 && !arr[i][j + 1]) { make_land(i, j + 1); } if (i + 1 <= n - 1 && j <= m - 1 && !arr[i + 1][j]) { make_land(i + 1, j); } } |
#include <bits/stdc++.h> const int maxed = 200000 + 10; struct Node { int x, y; }; std::vector<Node> ve[maxed]; std::vector<Node>::iterator it; std::map<long long, int> id; std::map<std::pair<int, int>, int> ma; int n, id_cnt; int gcd_(int a, int b); int main() { scanf( %d , &n); int a, b, c, sum = 0; while (n--) { scanf( %d%d%d , &a, &b, &c); if (a == 1) { sum += 1; long long w = 1LL * b * b + 1LL * c * c; if (!id.count(w)) id[w] = (++id_cnt); int wa = id[w]; ve[wa].push_back((Node){b, c}); int len = ve[wa].size(); for (int i = 0; i < len; ++i) { int x = ve[wa][i].x + b; int y = ve[wa][i].y + c; int z = gcd_(x, y); if (b == ve[wa][i].x && c == ve[wa][i].y) ma[std::pair<int, int>(x / z, y / z)] += 1; else ma[std::pair<int, int>(x / z, y / z)] += 2; } } else if (a == 2) { sum -= 1; long long w = 1LL * b * b + 1LL * c * c; int wa = id[w], len = ve[wa].size(); for (int i = 0; i < len; ++i) { int x = ve[wa][i].x + b; int y = ve[wa][i].y + c; int z = gcd_(x, y); if (ve[wa][i].x == b && ve[wa][i].y == c) ma[std::pair<int, int>(x / z, y / z)] -= 1; else ma[std::pair<int, int>(x / z, y / z)] -= 2; } for (it = ve[wa].begin(); it != ve[wa].end(); ++it) if (it->x == b && it->y == c) { ve[wa].erase(it); break; } } else { int z = gcd_(b, c), wa = 0; if (ma.count(std::pair<int, int>(b / z, c / z))) wa = ma[std::pair<int, int>(b / z, c / z)]; printf( %d n , sum - wa); } } return 0; } int gcd_(int a, int b) { if (!b) return a; return gcd_(b, a % b); } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, k; cin >> n >> k; if (k == 1) { if (n > 1) cout << n; else cout << -1 ; return 0; } int i; vector<int> res; for (i = 2; i * i <= n; i++) { while (n % i == 0 && k != 1) { n /= i; res.push_back(i); k--; } if (k == 1 && n != 1) { res.push_back(n); for (i = 0; i < res.size(); i++) { cout << res[i] << ; } return 0; } } cout << -1 ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, a, b, k; int dp[5010][5010]; int main() { scanf( %d %d %d %d , &n, &a, &b, &k); dp[0][a] = 1; for (int i = 1; i <= k; ++i) { for (int j = 1; j <= n; ++j) { dp[i - 1][j] += dp[i - 1][j - 1]; dp[i - 1][j] %= (1000000007); } for (int j = 1; j <= n; ++j) { if (j == b) dp[i][j] = 0; else { int l, r; if (j < b) l = 0, r = (b + j + 1) / 2 - 1; else l = (b + j) / 2, r = n; dp[i][j] = dp[i - 1][min(n, r)] - dp[i - 1][max(0, l)]; dp[i][j] %= (1000000007); if (dp[i][j] < 0) dp[i][j] += (1000000007); if (r >= j && l < j) dp[i][j] -= dp[i - 1][j] - dp[i - 1][j - 1]; dp[i][j] %= (1000000007); if (dp[i][j] < 0) dp[i][j] += (1000000007); } } } int ans = 0; for (int i = 1; i <= n; ++i) ans = (ans + dp[k][i]) % (1000000007); printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> inline void smin(T &a, const U &b) { if (a > b) a = b; } template <typename T, typename U> inline void smax(T &a, const U &b) { if (a < b) a = b; } template <class T> inline void gn(T &first) { char c, sg = 0; while (c = getchar(), (c > 9 || c < 0 ) && c != - ) ; for ((c == - ? sg = 1, c = getchar() : 0), first = 0; c >= 0 && c <= 9 ; c = getchar()) first = (first << 1) + (first << 3) + c - 0 ; if (sg) first = -first; } template <class T1, class T2> inline void gn(T1 &x1, T2 &x2) { gn(x1), gn(x2); } template <class T1, class T2, class T3> inline void gn(T1 &x1, T2 &x2, T3 &x3) { gn(x1, x2), gn(x3); } template <class T> inline void print(T first) { if (first < 0) { putchar( - ); return print(-first); } if (first < 10) { putchar( 0 + first); return; } print(first / 10); putchar(first % 10 + 0 ); } template <class T> inline void println(T first) { print(first); putchar( n ); } template <class T> inline void printsp(T first) { print(first); putchar( ); } template <class T1, class T2> inline void print(T1 x1, T2 x2) { printsp(x1), println(x2); } template <class T1, class T2, class T3> inline void print(T1 x1, T2 x2, T3 x3) { printsp(x1), printsp(x2), println(x3); } int power(int a, int b, int m, int ans = 1) { for (; b; b >>= 1, a = (long long)a * a % m) if (b & 1) ans = (long long)ans * a % m; return ans; } int a[3010], arr[3010], n, nn; long long dp[3010][3010]; int main() { gn(n); for (int i = 1; i <= n; i++) { gn(a[i]); a[i] -= i; arr[i] = a[i]; } sort(arr + 1, arr + n + 1); nn = unique(arr + 1, arr + n + 1) - arr - 1; for (int i = 1; i <= n; i++) { dp[i][0] = 0x3f3f3f3f3f3f3f3fLL; for (int j = 1; j <= nn; j++) { dp[i][j] = abs(a[i] - arr[j]); dp[i][j] += dp[i - 1][j]; smin(dp[i][j], dp[i][j - 1]); } } print(dp[n][nn]); } |
#include <bits/stdc++.h> #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; const int block_size = 320; const long long mod = 1e9 + 7; const long long inf = 1e9 + 7; const long double eps = 1e-9; const double PI = atan(1) * 4; template <typename T> inline int sign(const T &a) { if (a < 0) return -1; if (a > 0) return 1; return 0; } template <typename T, typename S> inline bool upmin(T &a, const S &b) { return a > b ? a = b, 1 : 0; } template <typename T, typename S> inline bool upmax(T &a, const S &b) { return a < b ? a = b, 1 : 0; } template <typename T> inline void in(T &x) { x = 0; T f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = -1; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + ch - 0 ; ch = getchar(); } x *= f; } long long twop(int x) { return 1LL << x; } template <typename A, typename B> inline void in(A &x, B &y) { in(x); in(y); } template <typename A, typename B, typename C> inline void in(A &x, B &y, C &z) { in(x); in(y); in(z); } template <typename A, typename B, typename C, typename D> inline void in(A &x, B &y, C &z, D &d) { in(x); in(y); in(z); in(d); } namespace SOLVE { long long n; long long a[100000]; long long dp[2]; long long pre[20000][2]; long long getSum(long long l, long long r, long long v) { return pre[r][v] - pre[l - 1][v]; } void main() { in(n); n++; for (long long i = 1; i < n; i++) { in(a[i]); a[i]--; pre[i][a[i]] = 1; } for (long long i = 1; i < n; i++) { for (long long j = 0; j < 2; j++) pre[i][j] += pre[i - 1][j]; } memset(dp, 0xcf, sizeof(dp)); for (long long i = 1; i < n; i++) { if (a[i] == 0) { dp[0]++; } else { dp[1]++; upmax(dp[1], dp[0] + 1); } } long long ans = max(dp[0], dp[1]); for (long long i = 1; i < n; i++) { memset(dp, 0, sizeof(dp)); for (long long j = i; j < n; j++) { if (a[j] == 1) { dp[1]++; } else { dp[0]++; upmax(dp[0], dp[1] + 1); } upmax(ans, getSum(1, i - 1, 0) + getSum(j + 1, n - 1, 1) + max(dp[0], dp[1])); } } cout << ans << endl; } } // namespace SOLVE int main() { SOLVE::main(); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, i, x, q, w[110000]; long long ans; int f(int x) { return x * (x / 2) + x % 2; } bool cmp(int x, int y) { return x > y; } int main() { scanf( %d%d , &n, &m); for (i = 0; i < m; i++) scanf( %d%d , &q, w + i); sort(w, w + m, cmp); while (f(x + 1) <= n) x++; x = min(x, m); for (i = 0; i < x; i++) ans += w[i]; printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; template <class L, class R> ostream& operator<<(ostream& os, pair<L, R> P) { return os << ( << P.first << , << P.second << ) ; } template <class T> ostream& operator<<(ostream& os, vector<T> V) { os << [ ; for (auto v : V) os << v << ; return os << ] ; } template <class T> ostream& operator<<(ostream& os, set<T> second) { os << { ; for (auto s : second) os << s << ; return os << } ; } template <class T> ostream& operator<<(ostream& os, multiset<T> second) { os << { ; for (auto s : second) os << s << ; return os << } ; } template <class L, class R> ostream& operator<<(ostream& os, map<L, R> M) { os << { ; for (auto m : M) os << ( << m.first << : << m.second << ) ; return os << } ; } template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << : << arg1 << n ; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cout.write(names, comma - names) << : << arg1 << | ; __f(comma + 1, args...); } void solve() { int n; cin >> n; vector<long long> a(n); for (int i = 0; i < n; ++i) { cin >> a[i]; if (i) a[i] += a[i - 1]; } long long sm = a[n - 1]; if (sm == 1) { cout << -1 n ; return; } vector<long long> divs; for (long long d = 2; d * d <= sm; ++d) { if (sm % d) continue; divs.push_back(d); while (sm % d == 0) { sm /= d; } } if (sm != 1) divs.push_back(sm); long long ans = LLONG_MAX; for (long long d : divs) { long long ta = 0; for (int i = 0; i < n - 1; ++i) { ta += min(a[i] % d, d - a[i] % d); } ans = min(ans, ta); } cout << ans << n ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int T = 1, tc = 1; while (T--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); double l, x, v1, v2, k; cin >> l >> x >> v1 >> v2 >> k; double n = ceil(l / k); double t2, t1; t2 = x / (v2 * (n * ((v1 + v2) / (v2 - v1)) - (n - 1))); t1 = t2 * (v1 + v2) / (v2 - v1); double odp = t1 * n + t2 * (n - 1); cout << setprecision(8) << odp; } |
#include <bits/stdc++.h> char c = G ; void incrementa(); int main() { int n; scanf( %d , &n); n = n - 7; printf( ROYGBIV ); for (int i = 0; i < n; i++) incrementa(); return 0; } void incrementa() { printf( %c , c); switch (c) { case G : c = B ; break; case B : c = I ; break; case I : c = V ; break; case V : c = G ; break; } } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s; cin >> s; for (int i = 2; i <= n; i++) { if (n % i == 0) reverse(s.begin(), s.begin() + i); } cout << s; return 0; } |
#include <bits/stdc++.h> using namespace std; char grid[55][55]; int T, N; int main() { cin >> T; for (int QQQ = 0; QQQ < T; QQQ++) { cin >> N; bool works = true; for (int i = 0; i < N; i++) cin >> grid[i]; for (int r = 0; r < N - 1; r++) for (int c = 0; c < N - 1; c++) if (grid[r][c] == 1 && (grid[r + 1][c] == 0 && grid[r][c + 1] == 0 )) works = false; if (works) cout << YES ; else cout << NO ; cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; using LL = long long; constexpr int N = 150005; double x[N], ex[N]; array<double, 4> seg[4 * N]; array<double, 4> merge(const array<double, 4> &l, const array<double, 4> &r) { array<double, 4> rv; rv[0] = l[0] + r[0]; rv[1] = max(l[1], l[0] + r[1]); rv[2] = max(r[2], r[0] + l[2]); rv[3] = max({l[3], r[3], l[2] + r[1]}); return rv; } void build(int at, int b, int e) { if (b == e) { seg[at][0] = ex[b]; seg[at][1] = seg[at][2] = seg[at][3] = max(0., ex[b]); return; } build(at * 2, b, ((b + e) / 2)); build(at * 2 + 1, ((b + e) / 2) + 1, e); seg[at] = merge(seg[at * 2], seg[at * 2 + 1]); } array<double, 4> query(int at, int b, int e, int l, int r) { if (e < l or r < b) return array<double, 4>(); if (l <= b and e <= r) { return seg[at]; } auto q1 = query(at * 2, b, ((b + e) / 2), l, r); auto q2 = query(at * 2 + 1, ((b + e) / 2) + 1, e, l, r); return merge(q1, q2); } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, m, c; cin >> n >> m >> c; for (int i = 1; i <= n; i++) cin >> x[i]; for (int i = 1; i < n; i++) { double p; cin >> p; ex[i] = (x[i + 1] - x[i]) * .5 - p * c / 100.0; } build(1, 1, n - 1); double result = 0; while (m--) { int l, r; cin >> l >> r; auto res = query(1, 1, n - 1, l, r - 1); result += res[3]; } cout << setprecision(10) << result << endl; } |
#include <bits/stdc++.h> using namespace std; const int N = 100005; vector<int> e[N]; int n, ans, f[N][2], g[N][2]; void dfs1(int x, int fa) { f[x][0] = 0; f[x][1] = 0; int d = e[x].size() - (fa != 0); for (auto i : e[x]) if (i != fa) { dfs1(i, x); f[x][0] = max(f[x][0], max(f[i][0], f[i][1]) - 1); f[x][1] = max(f[x][1], f[i][0]); } f[x][0] += d; f[x][1]++; } void upd(pair<int, int> &x, pair<int, int> &y, pair<int, int> z) { if (z > x) swap(x, z); y = max(y, z); } void dfs2(int x, int fa) { if (!fa) g[x][0] = 0, g[x][1] = 0; pair<int, int> mx1(0, x), mx2(-1, -1), mx3(0, x), mx4(-1, -1); upd(mx1, mx2, pair<int, int>(max(g[x][0], g[x][1]) - 1, -1)); upd(mx3, mx4, pair<int, int>(g[x][0], -1)); for (auto i : e[x]) if (i != fa) { upd(mx1, mx2, pair<int, int>(max(f[i][0], f[i][1]) - 1, i)); upd(mx3, mx4, pair<int, int>(f[i][0], i)); } int d = e[x].size() - 1; ans = max(ans, max(mx1.first + d + 1, mx3.first)); for (auto i : e[x]) if (i != fa) { g[i][0] = (mx1.second == i ? mx2.first : mx1.first) + d; g[i][1] = (mx3.second == i ? mx4.first : mx3.first) + 1; dfs2(i, x); } } int main() { srand(time(NULL)); scanf( %d , &n); for (int i = (int)(1); i <= (int)(n - 1); i++) { int x, y; scanf( %d%d , &x, &y); e[x].push_back(y); e[y].push_back(x); } dfs1(1, 0); dfs2(1, 0); printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; long long a[100009]; int main() { long long n, x, y; int i; while (cin >> n >> x >> y) { int flag = 0; for (i = 1; i <= n - 1; i++) a[i] = 1, y--; a[n] = y; if (a[n] <= 0) flag = 1; long long sum = 0; for (i = 1; i <= n; i++) { sum = sum + a[i] * a[i]; } if (sum < x || flag) cout << -1 << endl; else { for (i = 1; i <= n; i++) { cout << a[i] << endl; } } } } |
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); inline long long int rand(long long int x, long long int y) { ++y; return (rng() % (y - x)) + x; } long long int n, q, fw[300006], st[300006], en[300006], co, dist[300006], zero, line[300006], lines, sizee[300006]; vector<long long int> v[300006]; struct fen { long long int n; vector<long long int> fw; void init(long long int x) { fw.resize(x + 2 + 1); n = fw.size() - 1; } void update(long long int x, long long int y, long long int nv) { ++y; for (; x <= n; x += x & (-x)) fw[x] += nv; for (; y <= n; y += y & (-y)) fw[y] -= nv; } long long int sum(long long int x) { long long int res = 0; for (; x; x -= x & (-x)) res += fw[x]; return res; } } fen[300006]; struct fen2 { void update(long long int x, long long int y, long long int nv) { ++y; for (; x <= n; x += x & (-x)) fw[x] += nv; for (; y <= n; y += y & (-y)) fw[y] -= nv; } long long int sum(long long int x) { long long int res = 0; for (; x; x -= x & (-x)) res += fw[x]; return res; } } depth; void dfs(long long int x, long long int p) { st[x] = co++; if (p != 1) line[x] = line[p], sizee[line[p]]++; else if (x != 1) line[x] = lines++, sizee[line[x]]++; for (auto i : v[x]) { if (i == p) continue; dist[i] = dist[x] + 1; dfs(i, x); } en[x] = co; } int main() { cin >> n >> q; for (long long int i = 0; i < n - 1; i++) { long long int a, b; cin >> a >> b; v[a].push_back(b); v[b].push_back(a); } dfs(1, 1); for (long long int i = 0; i < lines; i++) fen[i].init(sizee[i]); for (long long int i = 1; i <= q; i++) { long long int op; cin >> op; if (op == 0) { long long int v, x, d; cin >> v >> x >> d; long long int overflow = d - dist[v]; if (overflow >= 0) depth.update(1, overflow + 1, x); if (v == 1) continue; if (overflow >= 0) fen[line[v]].update(overflow + 2, dist[v] + d + 1, x); else fen[line[v]].update(dist[v] - d + 1, dist[v] + d + 1, x); } else { long long int v; cin >> v; cout << depth.sum(dist[v] + 1) + fen[line[v]].sum(dist[v] + 1) << n ; } } } |
#include <bits/stdc++.h> using namespace std; int main() { int t, i; double sum, n; cin >> t; while (t--) { cin >> n; sum = 360 / (180 - n); if ((sum - (int)sum) == 0) cout << YES << endl; else cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int Maxn = 300005; int res, cnt, head[Maxn], choose[Maxn], target[Maxn], las[Maxn], ct, n[Maxn], k, val[Maxn], a[20][Maxn], b[Maxn], bel[Maxn], state_cnt; bool vis1[Maxn], vis2[Maxn], ans[Maxn], done[20], flag; map<long long, int> Ma; long long sum[Maxn], tot; int tmp_state, Solution[Maxn][20], Solution_cnt; struct edg { int nxt, to; } edge[2 * Maxn]; void add(int x, int y) { if (bel[x] == bel[y]) return; if (done[bel[x]] || done[bel[y]]) return; edge[++cnt] = (edg){head[x], y}; head[x] = cnt; } void dfs(int u) { vis1[u] = true; vis2[u] = true; for (int i = head[u]; i; i = edge[i].nxt) { int to = edge[i].to; if (vis2[to]) { res = to; tmp_state = 0; state_cnt++; tmp_state |= (1 << (bel[to] - 1)); tmp_state |= (1 << (bel[u] - 1)); vis2[u] = false; Solution[state_cnt][1] = to, Solution[state_cnt][2] = u; Solution_cnt = 2; return; } dfs(to); if (flag) return; if (tmp_state & (1 << (bel[u] - 1))) { if (res == u) val[state_cnt] = tmp_state, reverse(Solution[state_cnt] + 1, Solution[state_cnt] + Solution_cnt + 1), Solution[state_cnt][Solution_cnt + 1] = Solution[state_cnt][1], tmp_state = 0; else state_cnt--, tmp_state = 0; flag = true; return; } else if (tmp_state) { tmp_state |= (1 << (bel[u] - 1)); Solution[state_cnt][++Solution_cnt] = u; vis2[u] = false; return; } } vis2[u] = false; } void get_ans(int id) { choose[bel[Solution[id][1]]] = b[Solution[id][1]]; for (int i = 2; Solution[id][i]; i++) { choose[bel[Solution[id][i]]] = b[Solution[id][i]]; target[bel[Solution[id][i - 1]]] = bel[Solution[id][i]]; } } int main() { scanf( %d , &k); for (int i = 1; i <= k; i++) { scanf( %d , &n[i]); for (int j = 1; j <= n[i]; j++) scanf( %d , &a[i][j]), b[++ct] = a[i][j], sum[i] += a[i][j], tot += a[i][j]; } if (tot % k) { printf( NO ); return 0; } tot /= k; for (int i = 1; i <= k; i++) if (tot == sum[i]) done[i] = true; sort(b + 1, b + 1 + ct); for (int i = 1; i <= k; i++) for (int j = 1; j <= n[i]; j++) Ma[a[i][j]] = lower_bound(b + 1, b + 1 + ct, a[i][j]) - b, bel[Ma[a[i][j]]] = i; for (int i = 1; i <= k; i++) for (int j = 1; j <= n[i]; j++) if (Ma[tot - sum[i] + a[i][j]]) add(Ma[tot - sum[i] + a[i][j]], Ma[a[i][j]]); for (int i = 1; i <= ct; i++) if (!vis1[i]) flag = false, dfs(i); for (int i = 1; i <= k; i++) if (sum[i] == tot) val[++state_cnt] = 1 << (i - 1); int maxi = (1 << k) - 1; ans[0] = true; for (int i = 0; i <= maxi; i++) if (ans[i]) for (int j = 1; j <= state_cnt; j++) if (!(val[j] & i)) ans[val[j] | i] = true, las[val[j] | i] = j; if (ans[maxi]) { printf( YES n ); int state_now = maxi; while (state_now) { get_ans(las[state_now]); state_now ^= val[las[state_now]]; } for (int i = 1; i <= k; i++) if (target[i]) printf( %d %d n , choose[i], target[i]); else printf( %d %d n , a[i][1], i); return 0; } printf( NO ); return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx2 ) using namespace std; const int MX = 1005; int n, a, b; vector<int> adj[2 * MX][2]; int leaf[MX][2]; int pos[2 * MX][2]; int siz[2 * MX][2]; int best[MX][MX][2]; int ans[MX][2]; pair<int, int> rang[2 * MX][2]; void dfs(int v, int p, int d) { if (pos[v][d] != -1) rang[v][d] = {pos[v][d], pos[v][d]}; siz[v][d] = 1; for (int to : adj[v][d]) { if (to != p) { dfs(to, v, d); siz[v][d] += siz[to][d]; rang[v][d].first = min(rang[v][d].first, rang[to][d].first); rang[v][d].second = max(rang[v][d].second, rang[to][d].second); } } } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> a; for (int i = 0; i < a; i++) pos[i][0] = -1, rang[i][0] = {1e9, -1e9}; for (int i = 0; i < a - 1; i++) { int p; cin >> p; adj[p - 1][0].push_back(i + 1); } for (int i = 0; i < n; i++) { cin >> leaf[i][0], leaf[i][0]--; pos[leaf[i][0]][0] = i; } cin >> b; for (int i = 0; i < b; i++) pos[i][1] = -1, rang[i][1] = {1e9, -1e9}; for (int i = 0; i < b - 1; i++) { int p; cin >> p; adj[p - 1][1].push_back(i + 1); } for (int i = 0; i < n; i++) { cin >> leaf[i][1], leaf[i][1]--; pos[leaf[i][1]][1] = i; } dfs(0, -1, 0); dfs(0, -1, 1); for (int i = 0; i < a; i++) { auto cur = rang[i][0]; best[cur.first][cur.second][0] = max(best[cur.first][cur.second][0], siz[i][0] - (i == 0)); } for (int i = 0; i < b; i++) { auto cur = rang[i][1]; best[cur.first][cur.second][1] = max(best[cur.first][cur.second][1], siz[i][1] - (i == 0)); } for (int c = 0; c < 2; c++) { for (int len = 2; len < n + 1; len++) { for (int st = 0; st < n; st++) { if (st + len - 1 < n) { int l = st, r = st + len - 1; for (int k = l; k < r + 1; k++) { if (k < r) best[l][r][c] = max(best[l][r][c], best[l][k][c] + best[k + 1][r][c]); } } } } } for (int i = 0; i < n + 1; i++) ans[i][0] = -1e9, ans[i][1] = -1e9; ans[0][0] = 0, ans[0][1] = 0; for (int i = 1; i < n + 1; i++) { for (int j = 0; j < i; j++) { ans[i][0] = max(ans[i][0], ans[j][1] + best[j][i - 1][1]); ans[i][1] = max(ans[i][1], ans[j][0] + best[j][i - 1][0]); } } cout << max(ans[n][0], ans[n][1]) << n ; } |
#include <bits/stdc++.h> using namespace std; ifstream file( input.txt ); int main() { int ta = 0, tb = 0, tc = 0, v = 2; string str; cin >> str; for (int i = 0; i < str.size(); i++) { if (str[i] == a ) ta++; else if (str[i] == b ) tb++; else tc++; } for (int i = 0; i < str.size() - 1; i++) if (int(str[i]) > str[i + 1]) { v--; break; } if (tc != ta && tc != tb) v--; else if (ta == 0 || tb == 0 || tc == 0) v--; if (v == 2) { cout << YES ; } else cout << NO ; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; const int M = 2e3 + 5; const int INF = 0x7fffffff; const int mod = 998244353; const double eps = 1e-8; const double pi = acos(-1); int n, m; char str[N]; int f[N][26]; template <class T> inline void read(T &x) { char c; x = 1; while ((c = getchar()) < 0 || c > 9 ) if (c == - ) x = -1; T res = c - 0 ; while ((c = getchar()) >= 0 && c <= 9 ) res = res * 10 + c - 0 ; x *= res; } int main() { scanf( %s , str + 1); read(n); int len = strlen(str + 1); for (int i = 1; i <= len; i++) { for (int j = 0; j <= 25; j++) { if (str[i] - a == j) f[i][j] = f[i - 1][j] + 1; else f[i][j] = f[i - 1][j]; } } while (n--) { int l, r; read(l); read(r); int cnt = 0; for (int i = 0; i <= 25; i++) { if (f[r][i] - f[l - 1][i] > 0) cnt++; } if ((cnt >= 3) || (l == r) || (str[l] != str[r])) cout << Yes n ; else cout << No n ; } return 0; } |
#include <bits/stdc++.h> template <class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template <class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } const long long MAX = 5100000; const long long INF = 1LL << 60; const long long mod = 1000000007LL; using namespace std; long long t[200500]; long long tmp[200500]; int main() { long long n; scanf( %lld , &n); long long a[3]; scanf( %lld %lld %lld , &a[0], &a[1], &a[2]); sort(a, a + 3); multiset<long long> ms; for (long long i = 0; i < n; i++) { scanf( %lld , &t[i]); ms.emplace(t[i]); } if (*ms.rbegin() > a[0] + a[1] + a[2]) { puts( -1 ); return 0; } long long res = 0; while (!ms.empty() && *ms.rbegin() > a[1] + a[2]) { res++; ms.erase(--ms.end()); } while (!ms.empty() && *ms.rbegin() > a[0] + a[2]) { res++; ms.erase(--ms.end()); auto itr = ms.upper_bound(a[0]); if (itr == ms.begin()) continue; itr--; ms.erase(itr); } while (!ms.empty() && *ms.rbegin() > a[2] && *ms.rbegin() > a[0] + a[1]) { res++; ms.erase(--ms.end()); if (ms.empty()) break; auto itr = ms.upper_bound(a[1]); if (itr == ms.begin()) continue; itr--; ms.erase(itr); } while (!ms.empty()) { res++; if (a[0] + a[1] <= a[2]) { ms.erase(--ms.end()); if (ms.empty()) break; if (*ms.begin() <= a[0]) { ms.erase(ms.begin()); if (ms.empty()) break; auto itr = ms.upper_bound(a[1]); if (itr == ms.begin()) continue; itr--; ms.erase(itr); } else if (*ms.begin() <= a[0] + a[1]) { auto itr = ms.upper_bound(a[1] + a[0]); itr--; ms.erase(itr); } } else { if (*ms.rbegin() <= a[2]) { auto itr = ms.upper_bound(a[1]); if (!(*ms.begin() > a[0] || itr == ms.begin() || itr == ++ms.begin())) { ms.erase(--ms.end()); if (ms.empty()) break; ms.erase(ms.begin()); if (ms.empty()) break; auto itr = ms.upper_bound(a[1]); itr--; ms.erase(itr); continue; } } ms.erase(--ms.end()); auto itr = ms.upper_bound(a[2]); if (itr != ms.begin()) { itr--; ms.erase(itr); } } } printf( %lld n , res); return 0; } |
#include <bits/stdc++.h> using namespace std; double us1[210]; double us2[210]; int deal(double *us, int s, int e, int p) { int flag = 0; for (int i = 1; i <= 200; i++) { if (us[i] < 1e-4 / 200.) continue; double dd = us[i] * (100 - p) / 100.; dd /= (e - s + 1); us[i] = us[i] / 100. * p; flag = 1; for (int ss = s; ss <= e; ss++) { us[max(i - ss, 0)] += dd; } } return flag; } int main() { int hp1, t1, s1, e1, p1; int hp2, t2, s2, e2, p2; cin >> hp1 >> t1 >> s1 >> e1 >> p1; cin >> hp2 >> t2 >> s2 >> e2 >> p2; if (p1 == 100) { cout << 0.0; return 0; } if (p2 == 100) { cout << 1.0; return 0; } int nt1 = 0, nt2 = 0; for (int i = 0; i <= 200; i++) { us1[i] = 0.; us2[i] = 0.; } us1[hp1] = 1.; us2[hp2] = 1.; double ret = 0; while (1) { if (nt1 <= nt2) { nt1 += t1; deal(us2, s1, e1, p1); ret += (1. - us1[0]) * us2[0]; us2[0] = 0; } else if (nt1 > nt2) { nt2 += t2; if (!deal(us1, s2, e2, p2)) break; } } cout << ret << endl; return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) using namespace std; const int maxn = 200000; int t[4 * maxn]; int p[maxn]; int n; int mina(int x, int y) { if (x == -1) return y; if (y == -1) return x; return (p[x] < p[y] ? x : y); } void build(int x, int cl, int cr) { if (cr - cl > 1) { build(2 * x, cl, (cl + cr) / 2); build(2 * x + 1, (cl + cr) / 2, cr); t[x] = mina(t[2 * x], t[2 * x + 1]); } else t[x] = cl; } int get(int x, int cl, int cr, int l, int r) { if (cr <= l || r <= cl) return -1; if (l <= cl && cr <= r) return t[x]; return mina(get(2 * x, cl, (cl + cr) / 2, l, r), get(2 * x + 1, (cl + cr) / 2, cr, l, r)); } int a[maxn], dpl[maxn], dpr[maxn]; int mx = 0; void dfs(int i, int cl, int cr, int cd) { dpl[i] = dpr[i] = 1; if (i != cl) { int u = get(1, 0, maxn, cl, i); dfs(u, cl, i, cd + 1); dpl[i] += max(dpl[u], dpr[u]); } if (cr - i > 1) { int u = get(1, 0, maxn, i + 1, cr); dfs(u, i + 1, cr, cd + 1); dpr[i] += max(dpr[u], dpl[u]); } } pair<int, int> solve(int sd) { for (int i = sd; i < n; i++) p[i - sd] = a[i]; for (int i = n - sd; i < n; i++) p[i] = a[i - n + sd]; build(1, 0, maxn); mx = 0; int st = get(1, 0, maxn, 0, n); dfs(st, 0, n, 1); return {max(dpl[st], dpr[st]), dpl[st] - dpr[st]}; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; int ans = solve(0).first; int mi = 0; int st = get(1, 0, maxn, 0, n); int l = 0, r = st; while (r - l > 10) { int md = (l + r) / 2; if (solve(md).second >= 0) l = md; else r = md; } for (int i = l; i <= r; i++) { int fuck = solve(i).first; if (fuck < ans) { mi = i; } ans = min(ans, fuck); } l = st; r = n - 1; while (r - l > 10) { int md = (l + r) / 2; if (solve(md).second >= 0) l = md; else r = md; } for (int i = l; i <= r; i++) { int fuck = solve(i).first; if (fuck < ans) { mi = i; } ans = min(ans, fuck); } cout << ans << << mi; return 0; } |
#include <bits/stdc++.h> int a[500]; int temp1[500]; int temp2[500]; int sum[500]; void merge(int l, int mid, int r) { int i, j, k; for (i = l; i <= mid; i++) temp1[i - l] = a[i]; temp1[i - l] = 10000000; for (j = mid + 1; j <= r; j++) temp2[j - mid - 1] = a[j]; temp2[j - mid - 1] = 1000000; i = 0; j = 0; k = l; while (k <= r) { if (temp1[i] < temp2[j]) { a[k] = temp1[i]; i++; } else { a[k] = temp2[j]; j++; } k++; } } void sorti(int l, int r) { if (l >= r) return; int mid = (l + r) / 2; sorti(l, mid); sorti(mid + 1, r); merge(l, mid, r); } int main() { int n; scanf( %d , &n); int i, j, k; for (i = 1; i <= n; i++) scanf( %d , &a[i]); int left = 0, right = 0; for (i = 1; i <= n; i++) { sum[i] = sum[i - 1] + a[i]; } int val, val1; int ans = 360; for (i = 1; i <= n; i++) { for (j = i; j <= n; j++) { val1 = (sum[j] - sum[i - 1]); val = 360 - val1; val = val > val1 ? (val - val1) : (val1 - val); ans = ans > val ? val : ans; } } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; char s[100005]; int day[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; map<string, int> my; void check(char* s) { if (((s[0]) >= 0 && (s[0]) <= 9 ) && ((s[1]) >= 0 && (s[1]) <= 9 ) && ((s[3]) >= 0 && (s[3]) <= 9 ) && ((s[4]) >= 0 && (s[4]) <= 9 ) && ((s[6]) >= 0 && (s[6]) <= 9 ) && ((s[7]) >= 0 && (s[7]) <= 9 ) && ((s[8]) >= 0 && (s[8]) <= 9 ) && ((s[9]) >= 0 && (s[9]) <= 9 ) && s[2] == - && s[5] == - ) { int d = atoi(s); int m = atoi(s + 3); int y = atoi(string(s + 6, s + 10).c_str()); if (m <= 12 && d > 0 && d <= day[m - 1] && y >= 2013 && y <= 2015) { ++my[string(s, s + 10)]; } } } int main() { gets(s); int n = strlen(s); for (int i = 0; i + 10 <= n; ++i) check(s + i); string res( ); int max = -1; for (typeof((my).begin()) it = (my).begin(), _e = (my).end(); it != _e; ++it) if (it->second > max) { max = it->second; res = it->first; } cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int mxn = 2e5 + 5; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); ; int tc; cin >> tc; while (tc--) { string s; cin >> s; int a = 0, b = 0, c = 0; for (int i = 0; i < s.size(); i++) { if (s[i] == A ) a++; else if (s[i] == B ) b++; else c++; } if (a + c == b) cout << YES n ; else cout << NO n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 4 ; int a[N] , prefMin[N] , prefMax[N] , suffixMin[N] , suffixMax[N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t ; cin >> t ; while(t--){ int n , m , q , sum =0 , s1 = 0 , s2 =0; cin >> n >> m ; string s; cin >> s; s = # + s ; for(int i = 1 ; i<=n ;++i){ if(s[i] == + ) sum++ ; else sum--; a[i] = sum; prefMin[i] = min(prefMin[i-1] ,sum); prefMax[i] = max(prefMax[i-1] , sum); } suffixMin[n+1] = suffixMax[n+1] = 0 ; sum = 0; for(int i = n ; i>=1; --i){ if(s[i] == + ) s1++ , s2++; else s1-- , s2--; s1 = min(s1 , 0); s2 = max(s2 ,0); suffixMin[i] = s1; suffixMax[i] = s2; } while(m--){ int l , r ; cin >> l >> r; int maxi = max(prefMax[l-1] , suffixMax[r+1] + a[l-1]) ; int mini = min(prefMin[l-1] , suffixMin[r+1] + a[l-1]) ; cout<<maxi+abs(mini)+1<< n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 1; char ch = getchar(); for (; ch < 0 || ch > 9 ; ch = getchar()) if (ch == - ) f = -1; for (; ch >= 0 && ch <= 9 ; ch = getchar()) x = (x << 1) + (x << 3) + ch - 0 ; return x * f; } const int N = 2e5 + 5; struct BIT { int tree[N]; void add(int x) { for (; x < N; x += x & -x) ++tree[x]; } int query(int x) { int res = 0; for (; x; x -= x & -x) res += tree[x]; return res; } } bit; struct SegmentTree { int size[N << 2]; void build(int cur, int l, int r) { if (l == r) { size[cur] = 1; return; } build((cur << 1), l, (l + r >> 1)); build((cur << 1 | 1), (l + r >> 1) + 1, r); size[cur] = size[(cur << 1)] + size[(cur << 1 | 1)]; } int kth(int cur, int l, int r, int k) { if (l == r) { size[cur] = 0; return l; } int res = 0; if (k <= size[(cur << 1)]) res = kth((cur << 1), l, (l + r >> 1), k); else res = kth((cur << 1 | 1), (l + r >> 1) + 1, r, k - size[(cur << 1)]); size[cur] = size[(cur << 1)] + size[(cur << 1 | 1)]; return res; } } sgt; int p[N]; int main() { int n = read(); for (int i = 1; i <= n; ++i) { int x = read(); p[i] += x - bit.query(x); bit.add(x + 1); } memset(bit.tree, 0, sizeof(bit.tree)); for (int i = 1; i <= n; ++i) { int x = read(); p[i] += x - bit.query(x); bit.add(x + 1); } for (int i = n; i >= 1; --i) { p[i - 1] += p[i] / (n - i + 1); p[i] %= (n - i + 1); } sgt.build(1, 1, n); for (int i = 1; i <= n; ++i) printf( %d , sgt.kth(1, 1, n, p[i] + 1) - 1); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long a, b, c; long long x0, y0, x, y; cin >> a >> b >> c >> x0 >> y0 >> x >> y; c += a * x0; c += b * y0; c = -c; x -= x0; y -= y0; if (x < 0) a = -a, x = -x; if (y < 0) b = -b, y = -y; if (c < 0) a = -a, b = -b, c = -c; if (!x || !y || a * b >= 0) printf( %.12f n , 1.0 * (x + y)); else { double u = min(1.0 * x, max(0., 1.0 * c / a)), v = max(0., min(1.0 * x, 1.0 * (c - b * y) / a)), uu = 1.0 * (c - a * u) / b, vv = 1.0 * (c - a * v) / b; printf( %.12f n , u + uu + sqrt((v - u) * (v - u) + (vv - uu) * (vv - uu)) + x + y - v - vv); } } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; reverse(a, a + n); stack<pair<int, int>> st; for (int i = 0; i < n; i++) { pair<int, int> p = make_pair(a[i], 0); while (!st.empty()) { pair<int, int> q = st.top(); if (q.first < p.first) { st.pop(); p.second = max(p.second + 1, q.second); } else break; } st.push(p); } int pas = 0; while (!st.empty()) { pas = max(pas, st.top().second); st.pop(); } cout << pas; return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:16777216 ) using namespace std; struct edge { public: int flow, cap, cost; int u, v; edge(int _u, int _v, int _flow, int _cost, int _cap) { u = _u; v = _v; flow = _flow; cost = _cost; cap = _cap; } edge() {} } E[10000]; vector<int> V[10000]; int say[100], src, dest; int phi[10000]; int B[10000], par[10000], D[10000]; bool dijkstra() { memset(B, 0, sizeof(B)); for (int i = 1; i <= dest; i++) D[i] = 1000000000; D[0] = 0; par[0] = -1; D[dest + 1] = 1000000000; for (int it = 0; it <= dest; it++) { int v = dest + 1; for (int i = 0; i <= dest; i++) if (D[i] < D[v] && (!B[i])) v = i; B[v] = 1; if (v == dest + 1) break; for (int j = 0; j < V[v].size(); j++) { int idx = V[v][j]; if (E[idx].u == v) { if (E[idx].flow < E[idx].cap) { int nv = E[idx].v; assert(D[v] + (phi[v] - phi[nv] + E[idx].cost) >= 0); if ((!B[nv]) && D[nv] > D[v] + (phi[v] - phi[nv] + E[idx].cost)) { D[nv] = D[v] + (phi[v] - phi[nv] + E[idx].cost); par[nv] = idx; } } } else { if (E[idx].flow > 0) { int nv = E[idx].u; assert(D[v] + (phi[v] - phi[nv] - E[idx].cost) >= 0); if ((!B[nv]) && D[nv] > D[v] + (phi[v] - phi[nv] - E[idx].cost)) { D[nv] = D[v] + (phi[v] - phi[nv] - E[idx].cost); par[nv] = idx; } } } } } for (int i = 0; i <= dest; i++) if (B[i]) phi[i] += D[i]; return B[dest]; } void augment() { int cur = dest, aug = 1000000000; while (par[cur] >= 0) { int idx = par[cur]; if (E[idx].v == cur) { aug = min(aug, E[idx].cap - E[idx].flow); cur = E[idx].u; } else { aug = min(aug, E[idx].flow); cur = E[idx].v; } } cur = dest; while (par[cur] >= 0) { int idx = par[cur]; if (E[idx].v == cur) { E[idx].flow += aug; cur = E[idx].u; } else { E[idx].flow -= aug; cur = E[idx].v; } } } int main() { string t, s; int n, a; cin >> t >> n; src = 0; dest = n + n * 26 + 27; int cv = n + 1, ce = 0; for (int i = 1; i <= n; i++) { cin >> s >> a; memset(say, 0, sizeof(say)); int len = s.length(); for (int j = 0; j < len; j++) say[s[j] - a ]++; for (int j = 0; j < 26; j++) { E[ce] = edge(i, cv, 0, 0, say[j]); V[i].push_back(ce); V[cv].push_back(ce); ce++; E[ce] = edge(cv, n + n * 26 + j + 1, 0, 0, 1000000000); V[cv].push_back(ce); V[n + n * 26 + j + 1].push_back(ce); ce++; cv++; } E[ce] = edge(0, i, 0, i, a); V[0].push_back(ce); V[i].push_back(ce); ce++; } memset(say, 0, sizeof(say)); int len = t.length(); for (int i = 0; i < len; i++) say[t[i] - a ]++; for (int i = 1; i <= 26; i++) { E[ce] = edge(n + n * 26 + i, dest, 0, 0, say[i - 1]); V[n + n * 26 + i].push_back(ce); V[dest].push_back(ce); ce++; } while (dijkstra()) { augment(); } int can = 1; for (int i = 0; i < V[dest].size(); i++) { int idx = V[dest][i]; if (E[idx].flow != E[idx].cap) can = 0; } if (!can) { cout << -1 << endl; return 0; } int ans = 0; for (int i = 0; i < V[0].size(); i++) { int idx = V[0][i]; ans += E[idx].cost * E[idx].flow; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T1, class T2> istream &operator>>(istream &in, pair<T1, T2> &P) { in >> P.first >> P.second; return in; } template <class T1, class T2> ostream &operator<<(ostream &out, const pair<T1, T2> &P) { out << ( << P.first << , << P.second << ) ; return out; } template <class T> istream &operator>>(istream &in, vector<T> &arr) { for (auto &x : arr) in >> x; return in; } template <class T> ostream &operator<<(ostream &out, const vector<T> &arr) { for (auto &x : arr) out << x << ; cout << n ; return out; } template <class T> istream &operator>>(istream &in, deque<T> &arr) { for (auto &x : arr) in >> x; return in; } template <class T> ostream &operator<<(ostream &out, const deque<T> &arr) { for (auto &x : arr) out << x << ; cout << n ; return out; } long long n, m, q, k, v[1000050], l, pref[1000050]; pair<long long, long long> TT, w[1000050]; string second; long long dp[1000050]; long long prox[1000050]; long long resolve(long long cost) { memset(dp, 0, sizeof dp); for (long long i = n; i >= 1; i--) { long long A = dp[min(n + 1, i + l)] + (pref[min(n, i + l - 1)] - pref[i - 1]) - cost; long long B = dp[i + 1]; if (A > B) prox[i] = 0; else prox[i] = 1; dp[i] = max(A, B); } long long j = 1, usados = 0; while (j <= n) { if (!prox[j]) usados++, j = j + l; else j = j + 1; } return usados; } long long solve(long long a, long long b) { long long ini = 0, fim = 200000000000000000, mid, best = -1; while (fim >= ini) { mid = (ini + fim) / 2; long long us = resolve(mid); if (us <= k) best = mid, fim = mid - 1; else ini = mid + 1; } if (best == -1) return 0; long long us = resolve(best); return dp[1] + k * best; } int32_t main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> k >> l; cin >> second; for (long long i = 1; i <= n; i++) { if ( a <= second[i - 1] and second[i - 1] <= z ) v[i] = 0; else v[i] = 1; } for (long long i = 1; i <= n; i++) pref[i] = pref[i - 1] + v[i]; long long A = pref[n] - solve(1, k); for (long long i = 1; i <= n; i++) { v[i] ^= 1; pref[i] = pref[i - 1] + v[i]; } long long B = pref[n] - solve(1, k); cout << min(A, B) << n ; } |
#include <bits/stdc++.h> namespace my_std { using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); template <typename T> inline T rnd(T first, T second) { return uniform_int_distribution<T>(first, second)(rng); } template <typename T> inline bool chkmax(T &x, T y) { return x < y ? x = y, 1 : 0; } template <typename T> inline bool chkmin(T &x, T y) { return x > y ? x = y, 1 : 0; } template <typename T> inline void read(T &t) { t = 0; char f = 0, ch = getchar(); double d = 0.1; while (ch > 9 || ch < 0 ) f |= (ch == - ), ch = getchar(); while (ch <= 9 && ch >= 0 ) t = t * 10 + ch - 48, ch = getchar(); if (ch == . ) { ch = getchar(); while (ch <= 9 && ch >= 0 ) t += d * (ch ^ 48), d *= 0.1, ch = getchar(); } t = (f ? -t : t); } template <typename T, typename... Args> inline void read(T &t, Args &...args) { read(t); read(args...); } char __sr[1 << 21], __z[20]; int __C = -1, __zz = 0; inline void Ot() { fwrite(__sr, 1, __C + 1, stdout), __C = -1; } inline void print(int x) { if (__C > 1 << 20) Ot(); if (x < 0) __sr[++__C] = - , x = -x; while (__z[++__zz] = x % 10 + 48, x /= 10) ; while (__sr[++__C] = __z[__zz], --__zz) ; __sr[++__C] = n ; } void file() {} inline void chktime() {} long long ksm(long long x, int y) { long long ret = 1; for (; y; y >>= 1, x = x * x) if (y & 1) ret = ret * x; return ret; } } // namespace my_std using namespace my_std; int n, T, _cnt; pair<int, int> D[403030 >> 1]; int _w[403030 >> 1]; void init() { static int first[403030], second[403030], p[403030], _l[403030], _r[403030]; for (int i = (1); i <= (n); i++) read(first[i], second[i]), chkmax(first[i], 0); int m = 0, K = 0; for (int i = (1); i <= (n); i++) if (second[i] >= first[i] && second[i] - first[i] < 2 * T - 2) p[++m] = first[i], p[++m] = second[i], ++K, _l[K] = first[i], _r[K] = second[i]; else if (second[i] >= first[i]) ++_cnt; sort(p + 1, p + m + 1); m = unique(p + 1, p + m + 1) - p - 1; n = K; for (int i = (1); i <= (n); i++) first[i] = _l[i], second[i] = _r[i]; for (int i = (1); i <= (n); i++) first[i] = lower_bound(p + 1, p + m + 1, first[i]) - p, second[i] = lower_bound(p + 1, p + m + 1, second[i]) - p; long long dt = p[1]; p[1] = 0; for (int i = (2); i <= (m); i++) if ((p[i] -= dt) > p[i - 1] + 2ll * T) dt += p[i] - (p[i - 1] + 2 * T), p[i] = p[i - 1] + 2 * T; for (int i = (1); i <= (n); i++) D[i] = make_pair(p[first[i]], p[second[i]] + 1); sort(D + 1, D + n + 1); for (int i = (1); i <= (n); i++) { int second = D[i].second; int x = lower_bound(D + 1, D + n + 1, make_pair(second, -1)) - D; ++_w[i], --_w[x]; } for (int i = (1); i <= (n); i++) _w[i] += _w[i - 1]; } vector<pair<int, int> > Dec[403030 << 1]; struct hh { int tp, ti, first, second; hh(int a, int b, int c, int d) { tp = a, ti = b, first = c, second = d; } const bool operator<(const hh &a) const { return ti == a.ti ? tp < a.tp : ti < a.ti; } }; vector<hh> op[403030 << 1]; vector<pair<int, int> > inc[403030 << 1]; const int Tree = 403030 * 35; int ch[Tree][2], mx[Tree], cc; int root[403030 << 1]; void add(int &k, int first, int second, int x, int y, int w) { if (!k) return; int kk = k; k = ++cc; ch[k][0] = ch[kk][0], ch[k][1] = ch[kk][1], mx[k] = mx[kk]; if (x <= first && second <= y) return mx[k] += w, void(); int tg = mx[k] - max(mx[ch[k][0]], mx[ch[k][1]]), mid = (first + second) >> 1; if (x <= mid) add(ch[k][0], first, mid, x, y, w); if (y > mid) add(ch[k][1], mid + 1, second, x, y, w); mx[k] = tg + max(mx[ch[k][0]], mx[ch[k][1]]); } int query(int k, int first, int second, int x, int y) { if (!k) return -1e7; if (x <= first && second <= y) return mx[k]; int tg = mx[k] - max(mx[ch[k][0]], mx[ch[k][1]]), mid = (first + second) >> 1, res = -1e7; if (x <= mid) chkmax(res, query(ch[k][0], first, mid, x, y)); if (y > mid) chkmax(res, query(ch[k][1], mid + 1, second, x, y)); return res + tg; } void modify(int &k, int first, int second, int x, int w) { int kk = k; k = ++cc; mx[k] = mx[kk], ch[k][0] = ch[kk][0], ch[k][1] = ch[kk][1]; if (first == second) return chkmax(mx[k], w), void(); int mid = (first + second) >> 1; int tg = (ch[k][0] || ch[k][1]) ? mx[k] - max(mx[ch[k][0]], mx[ch[k][1]]) : 0; w -= tg; if (x <= mid) modify(ch[k][0], first, mid, x, w); else modify(ch[k][1], mid + 1, second, x, w); mx[k] = max(mx[ch[k][0]], mx[ch[k][1]]) + tg; } vector<pair<int, int> > V[3]; void rebuild(int k, int first, int second, int tg, int tp) { if (!k) return; if (first == second) return V[tp].push_back(make_pair(first, tg + mx[k])); int mid = (first + second) >> 1; tg += mx[k] - max(mx[ch[k][0]], mx[ch[k][1]]); rebuild(ch[k][0], first, mid, tg, tp), rebuild(ch[k][1], mid + 1, second, tg, tp); } void Rebuild(int second) { int first = max(0, second - 2); for (int i = (0); i <= (2); i++) V[i].clear(); for (int i = (first); i <= (second); i++) rebuild(root[i], 0, T - 1, 0, i - first); cc = 0; for (int i = (first); i <= (second); i++) { root[i] = 0; for (auto t : V[i - first]) modify(root[i], 0, T - 1, t.first, t.second); } } int main() { file(); read(n, T); init(); for (int i = (1); i <= (n); i++) { op[D[i].first / T].push_back(hh(i, D[i].first % T, 0, 0)); if (D[i].second - D[i].first > T) { auto add = [&](int first, int second, int re) { Dec[first / T].push_back( make_pair(first % T, (second % T == 0 ? T : second % T))), op[re / T].push_back(hh(-1, re % T, first, second)); }; int first = D[i].first, second = D[i].second - T; if (first % T < second % T || second % T == 0) add(first, second, D[i].second); else add(first, first - first % T + T, D[i].second), add(second - second % T, second, D[i].second); } int first = D[i].first, second = D[i].second; while (first - first % T + T <= second) inc[first / T].push_back(make_pair(first % T, T)), first = first - first % T + T; if (first < second) inc[first / T].push_back(make_pair(first % T, second % T)); } mx[0] = -1e7; const int RE = n / 10; int ti = 0; for (int i = (0); i <= (4 * n); i++) { if (i) root[i] = root[i - 1]; for (auto p : inc[i]) { add(root[i], 0, T - 1, p.first, p.second - 1, 1); if ((++ti) > RE) ti = 0, Rebuild(i); } sort(op[i].begin(), op[i].end()); for (auto p : op[i]) { ++ti; if (p.tp == -1) add(root[p.first / T], 0, T - 1, p.first % T, (p.second % T == 0 ? T - 1 : p.second % T - 1), 1); else { int x = p.ti, w = 0; if (i > 0) chkmax(w, query(root[i - 1], 0, T - 1, 0, x)); if (i > 1) chkmax(w, mx[root[i - 2]]); modify(root[i], 0, T - 1, x, w + _w[p.tp]); } if (ti > RE) ti = 0, Rebuild(i); } for (auto p : Dec[i]) { add(root[i], 0, T - 1, p.first, p.second - 1, -1); if ((++ti) > RE) ti = 0, Rebuild(i); } } cout << max(0, mx[root[n * 4]]) + _cnt; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX_N = 2000 + 10; int n, k, a[MAX_N], dp[MAX_N]; bool check(int x) { for (int i = 0; i < n; i++) { dp[i] = 1; for (int j = i - 1; ~j; j--) if (abs(a[i] - a[j]) <= 1LL * (i - j) * x) dp[i] = max(dp[i], dp[j] + 1); if (n - dp[i] <= k) return true; } return false; } int main() { ios_base ::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); cin >> n >> k; for (int i = 0; i < n; i++) cin >> a[i]; int L = -1, R = 2e9 + 10; while (L + 1 < R) { int mid = (1LL * L + R) >> 1; check(mid) ? R = mid : L = mid; } cout << R << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; enum actions { JUMP1, UP1, DOWN1, JUMP2, UP2, DOWN2, NONE }; int n, x; vector<vector<int> > v(6); bool wut(int state, int i, actions last, int water) { if (water - 1 >= i) return false; if (state == 1) { if (n < 50000) { if (v[JUMP1][i] == 1) { bool isTrue = wut(2, i + x, JUMP1, water + 1); if (isTrue == false) v[JUMP1][i] = 0; else return true; } else if (v[JUMP1][i] == 2) return true; } if (v[UP1][i] == 1 && last != DOWN1) { bool isTrue = wut(state, i + 1, UP1, water + 1); if (isTrue == false) v[UP1][i] = 0; else return true; } else if (v[UP1][i] == 2) return true; if (v[DOWN1][i] == 1 && last != UP1) { bool isTrue = wut(state, i - 1, DOWN1, water + 1); if (isTrue == false) v[DOWN1][i] = 0; else return true; } if (n >= 50000) { if (v[JUMP1][i] == 1) { bool isTrue = wut(2, i + x, JUMP1, water + 1); if (isTrue == false) v[JUMP1][i] = 0; else return true; } else if (v[JUMP1][i] == 2) return true; } } else { if (n < 50000) { if (v[JUMP2][i] == 1) { bool isTrue = wut(1, i + x, JUMP2, water + 1); if (isTrue == false) v[JUMP2][i] = 0; else return true; } else if (v[JUMP2][i] == 2) return true; } if (v[UP2][i] == 1 && last != DOWN2) { bool isTrue = wut(state, i + 1, UP2, water + 1); if (isTrue == false) v[UP2][i] = 0; else return true; } else if (v[UP2][i] == 2) return true; if (v[DOWN2][i] == 1 && last != UP2) { bool isTrue = wut(state, i - 1, DOWN2, water + 1); if (isTrue == false) v[DOWN2][i] = 0; else return true; } if (n >= 50000) { if (v[JUMP2][i] == 1) { bool isTrue = wut(1, i + x, JUMP2, water + 1); if (isTrue == false) v[JUMP2][i] = 0; else return true; } else if (v[JUMP2][i] == 2) return true; } } return false; } int main() { cin >> n >> x; string first; string second; cin >> first; cin >> second; for (int i = 0; i < 6; i++) v[i].assign(n, 0); for (int i = 0; i < first.size(); i++) { if (first[i] != X ) { if (i != first.size() - 1 && first[i + 1] != X ) v[UP1][i] = 1; if (i > 0 && first[i - 1] != X ) v[DOWN1][i] = 1; if (i + x < first.size() && second[i + x] != X ) v[JUMP1][i] = 1; if (i == first.size() - 1) v[UP1][i] = 2; if (i + x >= first.size()) v[JUMP1][i] = 2; } if (second[i] != X ) { if (i != second.size() - 1 && second[i + 1] != X ) v[UP2][i] = 1; if (i > 0 && second[i - 1] != X ) v[DOWN2][i] = 1; if (i + x < second.size() && first[i + x] != X ) v[JUMP2][i] = 1; if (i == second.size() - 1) v[UP2][i] = 2; if (i + x >= second.size()) v[JUMP2][i] = 2; } } if (wut(1, 0, NONE, 0)) cout << YES << endl; else cout << NO << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, ans; struct aa { int l, r; int v; }; bool operator<(aa a, aa b) { return a.r < b.r; } inline aa qwq(int l, int r, int v) { aa a; a.l = l; a.r = r; a.v = v; return a; } set<aa> s; int read() { register int x = 0, ch = getchar(); while (!isdigit(ch)) ch = getchar(); while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); return x; } void wt() { for (set<aa>::iterator i = s.begin(); i != s.end(); i++) { cout << i->l << << i->r << << i->v << n ; } cout << ------ n ; } void spliT(set<aa>::iterator i, int x) { int l = i->l; int r = i->r; int v = i->v; if (x >= r) return; if (x < l) return; s.erase(i); s.insert(qwq(l, x, v)); s.insert(qwq(x + 1, r, v)); if (v == 1) ans++; } void mergE(set<aa>::iterator i) { int l = i->l, r = i->r, v = i->v; set<aa>::iterator j = i, k = i; if (l != 1) { j--; if (j->v == v) { l = j->l; s.erase(j); if (v == 1) ans--; } } if (r != n) { k++; if (k->v == v) { r = k->r; s.erase(k); if (v == 1) ans--; } } s.erase(i); s.insert(qwq(l, r, v)); } void Ass(int l, int r) { set<aa>::iterator x = s.lower_bound((aa){0, l - 1, 0}); if (l != 1) spliT(x, l - 1); set<aa>::iterator y = s.lower_bound((aa){0, r, 0}); spliT(y, r); x = s.lower_bound((aa){0, l, 0}); y = s.lower_bound((aa){0, r + 1, 0}); for (set<aa>::iterator i = x; i != y; i++) { if (i->v == 1) ans--; } s.erase(x, y); s.insert(qwq(l, r, 1)); ans++; x = s.lower_bound((aa){0, l, 0}); mergE(x); } signed main() { n = 1000000005; cin >> m; s.insert(qwq(1, n, 0)); for (int i = 1; i <= m; i++) { int l, r; l = read(); r = read(); r--; Ass(l, r); printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 0x3f3f3f3f3f3f3f3f; const long long MAXN = 1e5 + 7; const long long MAXM = 1e5 + 7; const long long MOD = 1e9 + 7; const double eps = 1e-6; const double pi = acos(-1.0); long long a[200005]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) scanf( %lld , &a[i]); sort(a + 1, a + 1 + n); long long ans = 0x3f3f3f3f; for (int i = 1; i <= n / 2; i++) ans = min(ans, a[i + n / 2] - a[i]); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; map<pair<int, int>, int> mp; map<int, int> mp1; vector<pair<int, int>> v; for (int i = 0; i < m; i++) { int x, y; cin >> x >> y; mp1[x]++; mp1[y]++; mp[{x, y}]++; mp[{y, x}]++; } bool f = 0; for (int i = 1; i <= n; i++) { v.push_back({mp1[i], i}); } sort(v.begin(), v.end()); for (int i = 0; i < v.size(); i++) { if (f) break; for (int j = i - 1; j > -1 && v[i].first + v[j].first >= m; j--) { int x = v[i].second, y = v[j].second; int ans = 0; ans += mp1[x]; ans += mp1[y]; ans -= mp[{x, y}]; if (ans >= m) { f = 1; break; } } } if (f) cout << YES ; else cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; vector<long long> a; vector<int> pos; for (int i = n; i > 0; i--) { long long p; cin >> p; if (p == 0) continue; a.push_back(p); pos.push_back(i); } reverse(a.begin(), a.end()); reverse(pos.begin(), pos.end()); if (a.empty()) { cout << string(n, 0 ); return 0; } int sz = a.size(); vector<int> last_id(sz); for (int i = sz - 1; i >= 0; i--) { if (i < sz - 1 && a[i] == a[i + 1]) last_id[i] = last_id[i + 1]; else last_id[i] = i; } auto get_sum = [&](int l, int r) { return 1LL * r * (r + 1) / 2 - 1LL * (l - 1) * l / 2; }; auto solve = [&](long long sum, int l, int r) { vector<pair<int, int>> res; if (sum == 0) return res; if (l > r) { res = {{-1, -1}}; return res; } if (sum < 0 || sum > get_sum(l, r)) { res = {{-1, -1}}; return res; } if (sum == get_sum(l, r)) { res.emplace_back(l, r); return res; } int lo = 0, hi = r - l + 1; while (hi - lo > 1) { int mid = (hi + lo) >> 1; if (sum >= get_sum(l, l + mid - 1)) lo = mid; else hi = mid; } int st = lo; if (sum > get_sum(r - st + 1, r)) { res = {{-1, -1}}; return res; } int skip = r - (l + st - 1); long long add = sum - get_sum(l, l + st - 1); int cnt = add / skip; pair<int, int> a = {l, l + st - 1 - cnt}; pair<int, int> b = {r - cnt + 1, r}; if (add > skip * cnt) { int c = a.second; a.second--; c += add - 1LL * skip * cnt; res.push_back({c, c}); } if (a.first <= a.second) res.push_back(a); if (b.first <= b.second) res.push_back(b); return res; }; auto check = [&](vector<pair<int, int>> foo) { return !(foo.size() == 1 && foo[0] == make_pair(-1, -1)); }; vector<long long> supose(n + 1); for (int i = n; i > 0; i--) { int p = lower_bound(pos.begin(), pos.end(), i) - pos.begin(); if (pos[p] == i) supose[i] = a[p]; else supose[i] = a[p] - 1; } vector<bool> dp(n + 1); vector<int> par(n + 1); vector<vector<pair<int, int>>> aux_seg(n + 1); vector<int> last_true(sz); int go_from = pos.back(); auto add = [&](int from, int to, int l, int r) { long long sum = supose[from] - from; if (to <= n) sum -= supose[to]; auto foo = solve(sum, l, r); if (check(foo)) { dp[from] = true; par[from] = to; aux_seg[from] = foo; } }; for (int cur = go_from; cur > 0; cur--) { int p = lower_bound(pos.begin(), pos.end(), cur) - pos.begin(); if (pos[p] == cur && p < sz - 1) { if (a[p] == a[p + 1]) continue; if (a[p] == a[p + 1] - 1) { int np = last_id[p + 1]; if (np == sz - 1 || dp[pos[np + 1]]) { int l = pos[np] + 1; int r = np == sz - 1 ? n : pos[np + 1] - 1; add(cur, r + 1, l, r); } if (last_true[np]) { int l = pos[np] + 1; int r = last_true[np] - 1; add(cur, r + 1, l, r); } } } int np = last_id[p]; if (np == sz - 1 || dp[pos[np + 1]]) { int l = pos[np] + 1; int r = np == sz - 1 ? n : pos[np + 1] - 1; add(cur, r + 1, l, r); } if (last_true[np]) { int l = pos[np] + 1; int r = last_true[np] - 1; add(cur, r + 1, l, r); } if (pos[p] != cur && p && !last_true[p - 1] && dp[cur]) { last_true[p - 1] = cur; } } string res(n + 1, 0 ); long long bound = -1; for (int i = 1; i <= n; i++) { if (dp[i] && (bound == -1 || supose[i] == bound - 1)) { while (i <= n) { res[i] = 1 ; for (auto foo : aux_seg[i]) { for (int j = foo.first; j <= foo.second; j++) res[j] = 1 ; } i = par[i]; } break; } if (pos[0] == i) { bound = a[0]; } } res.erase(res.begin()); reverse(res.begin(), res.end()); cout << res; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, p; char a[20000]; int b[20000]; int main() { cin >> n >> p; scanf( %s , a); memset(b, -1, sizeof(b)); for (int i = 0; i < n; ++i) { if (a[i] == . ) { if (i - p >= 0 && b[i - p] != -1) { b[i] = b[i - p] ^ 1; } } else { b[i] = a[i] - 0 ; ; if (i - p >= 0 && b[i - p] == -1) { b[i - p] = b[i] ^ 1; } } } for (int i = 0; i < n; ++i) { if (b[i] == -1) { if (i - p >= 0) b[i] = b[i - p] ^ 1; else b[i] = 0; } } int fg = 0; for (int i = 0; i < n; ++i) { if (i + p >= n) continue; if (b[i] != b[i + p]) fg = 1; } if (fg == 0) puts( No ); else { for (int i = 0; i < n; ++i) { printf( %d , b[i]); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { char com[200]; char *p; int man = 0; int sum = 0; int i; int word; while (scanf( %c , com) == 1) { i = 1; while ((com[i] = getchar()) != n ) i++; com[i] = 0 ; word = 0; if (com[0] == + ) { man++; continue; } if (com[0] == - ) { man--; continue; } p = strchr(com, : ); p += 1; while (*(p++) != 0 ) { word++; } sum += word * man; } printf( %d , sum); } |
#include<bits/stdc++.h> #define ll long long #define F first #define S second #define endl n using namespace std; const ll mod=1e9+7; const int N=5+3e5; const int INF=1e9; ll a[3][N],s[3],n[3]; int x[3]= {0,1,2}; int main() { #ifdef LOCAL freopen( input.in , r , stdin); #endif ll m1,m2,ans=-1e18; cin>>n[0]>>n[1]>>n[2]; for(int i=0; i<n[0]; ++i) { cin>>a[0][i]; s[0]+=a[0][i]; } for(int i=0; i<n[1]; ++i) { cin>>a[1][i]; s[1]+=a[1][i]; } for(int i=0; i<n[2]; ++i) { cin>>a[2][i]; s[2]+=a[2][i]; } sort(a[0],a[0]+n[0]); sort(a[1],a[1]+n[1]); sort(a[2],a[2]+n[2]); do { m1=a[x[1]][0]-(s[x[0]]-a[x[0]][n[x[0]]-1]+s[x[2]]-a[x[2]][0]); m2=a[x[2]][0]-(s[x[1]]-a[x[1]][0]); if(m1>m2) swap(m1,m2); if(m2>=0) ans=max(ans,a[x[0]][n[x[0]]-1]-(m1-m2)); else ans=max(ans,a[x[0]][n[x[0]]-1]-m1-m2); } while(next_permutation(x,x+3)); cout<<ans<< n ; } |
#include <bits/stdc++.h> const long long INF = (long long)1e18 + 2; using namespace std; void solve(); void fastIO() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); } int main() { fastIO(); solve(); } void solve() { int n, m; cin >> n >> m; char a[n][m]; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) cin >> a[i][j]; int rs = 200, re = -1, cs = 200, ce = -1; bool flag = true; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (a[i][j] == B ) { if (i < rs) rs = i; if (i > re) re = i; if (j < cs) cs = j; if (j > ce) ce = j; flag = false; } } } if (flag) { cout << 1; return; } int x = re - rs + 1; int y = ce - cs + 1; int mx = max(x, y); if (n < mx || m < mx) { cout << -1; return; } int ans = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (a[i][j] == B ) ans++; } } cout << (mx * mx - ans); } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b; cin >> a >> b; if (b % a) { cout << -1 << n ; } else { int x = b / a; int ans = 0; while (x % 2 == 0) { ans++; x /= 2; } while (x % 3 == 0) { ans++; x /= 3; } if (x != 1) { cout << -1 << endl; } else { cout << ans << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, nn = 0, nm = 0, dr[5069], dh[10069], pd[5069], pr[5069], fq[10069], sbt[10069], sm = 0, z = 1e18; vector<pair<long long, long long>> fz[5069], al[10069]; pair<long long, long long> sk[5069]; vector<long long> pst[5069]; bitset<10069> vtd; void ae(long long x, long long y, long long w) { al[x].push_back({y, w}); al[y].push_back({x, w}); } void bd(long long x) { long long i, sz = al[x].size(), l; vtd[x] = 1; sbt[x] = fq[x]; for (i = 0; i < sz; i++) { l = al[x][i].first; if (!vtd[l]) { bd(l); sbt[x] += sbt[l]; } } } void dfs(long long x) { long long i, sz = al[x].size(), l, w; vtd[x] = 1; z = min(z, sm); for (i = 0; i < sz; i++) { l = al[x][i].first; w = al[x][i].second; if (!vtd[l]) { nn += sbt[x] - sbt[l]; sm += w * (nn - (n - nn)); dfs(l); sm -= w * (nn - (n - nn)); nn -= sbt[x] - sbt[l]; } } } int main() { long long i, j, k, l, w, ll, c, p = 0, sz, bg, lca; for (i = 2; i <= 5000; i++) { if (fz[i].empty()) { p++; for (j = i; j <= 5000; j += i) { for (c = 0, k = j; k % i == 0; k /= i, c++) ; fz[j].push_back({p, c}); dr[j] += c; } } } nm = 5000; for (i = 1; i <= 5000; i++) { sz = fz[i].size(); lca = dh[i - 1]; if (sz) { bg = fz[i][sz - 1].first; for (j = 1; j < bg; j++) { lca -= pd[j]; } } for (j = 0; j < sz; j++) { l = fz[i][j].first; w = fz[i][j].second; pd[l] += w; } dh[i] = dh[i - 1] + dr[i]; l = 0; for (; nn && sk[nn].second >= lca; nn--) { l = sk[nn].first; } if (l) { nn++; sk[nn] = {l, lca}; sz = pst[l].size(); if (lca < dh[pst[l][sz - 1]]) { nm++; dh[nm] = lca; pst[l].push_back(nm); sz++; } pr[i] = pst[l][sz - 1]; } nn++; sk[nn] = {i, dh[i]}; pst[i].push_back(i); } for (i = 1; i <= 5000; i++) { sz = pst[i].size(); for (j = 0; j < sz; j++) { l = pst[i][j]; if (j) { ae(ll, l, dh[ll] - dh[l]); } ll = l; } if (pr[i]) { ae(pst[i][sz - 1], pr[i], dh[pst[i][sz - 1]] - dh[pr[i]]); } } scanf( %lld , &n); for (i = 0; i < n; i++) { scanf( %lld , &k); k += !k; fq[k]++; sm += dh[k]; } bd(1); vtd.reset(); nn = 0; dfs(1); printf( %lld n , z); } |
#include <bits/stdc++.h> using namespace std; int main() { long long t, n, i, j, k; double p, q, m; cin >> n >> m; p = pow(1.000000011, m); q = n * p; printf( %.12lf , q); return 0; } |
#include <bits/stdc++.h> using namespace std; int a[100005], in[100005]; int main() { int n, m; scanf( %d , &n); int i, j; for (i = 0; i < n; i++) { scanf( %d , &in[i]); in[i] = ++a[in[i]]; } for (i = 2; i <= 100000; i++) if (a[i] > a[i - 1]) break; if (i <= 100000) printf( -1 n ); else { printf( %d n , a[1]); for (i = 0; i < n; i++) printf( %d%c , in[i], n [i == n - 1]); } } |
#include <bits/stdc++.h> using namespace std; const int N = 200005; struct ST { int l, r, mx, c; } t[N << 2]; int n, k, m, nn, tot, R, sum; int ls[N], rs[N], a[N], rk[N], sa[N], h[N], tp[N], tax[N], f[N][18], lg[N], tag[N], len[N], num[N]; long long ans[N]; char s[N]; void rsort() { int i; for (i = 0; i <= m; i++) tax[i] = 0; for (i = 1; i <= n; i++) tax[rk[tp[i]]]++; for (i = 1; i <= m; i++) tax[i] += tax[i - 1]; for (i = n; i >= 1; i--) sa[tax[rk[tp[i]]]--] = tp[i]; } void suffix() { int i; for (i = 1; i <= n; i++) rk[i] = a[i], tp[i] = i; m = tot; rsort(); for (int w = 1, p = 0; p < n; w += w, m = p) { p = 0; for (i = n - w + 1; i <= n; i++) tp[++p] = i; for (i = 1; i <= n; i++) if (sa[i] > w) tp[++p] = sa[i] - w; rsort(); swap(rk, tp); rk[sa[1]] = p = 1; for (i = 2; i <= n; i++) if (tp[sa[i]] == tp[sa[i - 1]] && tp[sa[i] + w] == tp[sa[i - 1] + w]) rk[sa[i]] = p; else rk[sa[i]] = ++p; } } void height() { int i, j = 0, k = 0; for (i = 1; i <= n; i++) rk[sa[i]] = i; for (i = 1; i <= n; i++) { if (k) k--; if (rk[i] == 1) continue; j = sa[rk[i] - 1]; while (a[j + k] == a[i + k]) k++; h[rk[i]] = k; } } void build(int k, int l, int r) { t[k].l = l; t[k].r = r; t[k].mx = 0; t[k].c = 0; if (l == r) return; int mid = (l + r) >> 1; build(k << 1, l, mid); build(k << 1 | 1, mid + 1, r); } void add(int k, int w) { t[k].mx = max(t[k].mx, w); t[k].c = max(t[k].c, w); } void pushdown(int k) { if (t[k].c) { add(k << 1, t[k].c); add(k << 1 | 1, t[k].c); t[k].c = 0; } } void modify(int k, int L, int R, int w) { if (L <= t[k].l && t[k].r <= R) { add(k, w); return; } pushdown(k); int mid = (t[k].l + t[k].r) >> 1; if (L <= mid) modify(k << 1, L, R, w); if (R > mid) modify(k << 1 | 1, L, R, w); } int query(int k, int p) { if (t[k].l == t[k].r) return t[k].mx; pushdown(k); int mid = (t[k].l + t[k].r) >> 1; if (p <= mid) return query(k << 1, p); else return query(k << 1 | 1, p); } void init() { int i, j; for (i = 1; i <= n; i++) f[i][0] = h[i]; for (i = 1; i <= n; i++) lg[i] = log2(i); for (i = 1; i <= 17; i++) for (j = 1; j + (1 << i) - 1 <= n; j++) f[j][i] = min(f[j][i - 1], f[j + (1 << i - 1)][i - 1]); } int rmq(int l, int r) { l = rk[l]; r = rk[r]; if (l > r) swap(l, r); l++; if (l > r) return len[sa[r]]; int d = lg[r - l + 1]; return min(f[l][d], f[r - (1 << d) + 1][d]); } void solve() { int i, l1, r1 = 0, l2 = 0, r2 = 0; build(1, 1, n); for (l1 = 1; l1 <= n; l1++) { if (!tag[sa[l1]]) continue; if (l1 > 1) { num[tag[sa[l1 - 1]]]--; if (!num[tag[sa[l1 - 1]]] && tag[sa[l1 - 1]]) sum--; } while (r1 < n && sum < k) { r1++; if (!num[tag[sa[r1]]] && tag[sa[r1]]) sum++; num[tag[sa[r1]]]++; } if (sum < k) break; modify(1, l1, r1, rmq(sa[l1], sa[r1])); if (l2 > 0) for (i = r2 + 1; i <= r1; i++) modify(1, i, i, rmq(sa[l2], sa[i])); l2 = l1; r2 = r1; } if (r2 < n && l2 > 0) for (i = r2 + 1; i <= n; i++) modify(1, i, i, rmq(sa[l2], sa[i])); } int main() { int i, j; scanf( %d%d , &nn, &k); tot = 26; for (i = 1; i <= nn; i++) { scanf( %s , s + 1); m = strlen(s + 1); ls[i] = n + 1; for (j = 1; j <= m; j++) { a[++n] = s[j] - a + 1; tag[n] = i; len[n] = m - j + 1; } rs[i] = n; if (i < nn) a[++n] = ++tot; if (k == 1) ans[i] = 1ll * m * (m + 1) / 2; } if (k == 1) { for (i = 1; i <= nn; i++) printf( %I64d , ans[i]); return 0; } a[0] = -1; a[n + 1] = 1000000000; suffix(); height(); init(); solve(); for (i = 1; i <= n; i++) if (tag[sa[i]]) ans[tag[sa[i]]] += 1ll * query(1, i); for (i = 1; i <= nn; i++) printf( %I64d n , ans[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<vector<int>> arr(5, vector<int>(200005)); int main() { int t, n, i, ans, a, b, c, d, e, m, j, s, curr; string s1; cin >> t; while (t--) { cin >> n; for (i = 0; i < n; i++) { cin >> s1; a = 0; b = 0; c = 0; d = 0; e = 0; m = s1.size(); for (j = 0; j < m; j++) { if (s1[j] == a ) a++; else if (s1[j] == b ) b++; else if (s1[j] == c ) c++; else if (s1[j] == d ) d++; else if (s1[j] == e ) e++; } arr[0][i] = a - (m - a); arr[1][i] = b - (m - b); arr[2][i] = c - (m - c); arr[3][i] = d - (m - d); arr[4][i] = e - (m - e); } for (i = 0; i < 5; i++) sort(arr[i].begin(), arr[i].begin() + n, greater<int>()); ans = 0; for (i = 0; i < 5; i++) { curr = 0; j = 0; s = 0; while (j < n && arr[i][j] > 0) { s += arr[i][j]; curr++; j++; } while (j < n && (s + arr[i][j]) > 0) { s += arr[i][j]; curr++; j++; } ans = max(ans, curr); } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int i, j, k, l, m, n, f, t; string s, s1, s3, s4; while (cin >> s) { s1 = s; k = 0; for (i = 0; i < s.size(); i++) { k += s[i] - 0 ; } k = k % 3; if (k == 0) { cout << s << endl; } else if (k == 1) { f = 0; for (i = s.size() - 1; i >= 0; i--) { if ((s[i] - 0 ) % 3 == 1) { s.erase(s.begin() + i); f = 1; break; } } if (f == 0) { t = 0; for (i = s.size() - 1; i >= 0; i--) { if ((s[i] - 0 ) % 3 == 2) { s.erase(s.begin() + i); t++; } if (t == 2) { f = 1; break; } } if (t != 2 || s == ) { cout << -1 << endl; } else { t = 0; s3 = s; for (i = 0; i < s.size(); i++) { if (s[i] == 0 ) { s.erase(s.begin() + i); i--; } else { break; } } if (s == && s3.size() > 0) cout << 0 << endl; else cout << s << endl; } } else { t = 0; for (i = s1.size() - 1; i >= 0; i--) { if ((s1[i] - 0 ) % 3 == 2) { s1.erase(s1.begin() + i); t++; } if (t == 2) { break; } } if (t == 2) { s3 = s; for (i = 0; i < s.size(); i++) { if (s[i] == 0 ) { s.erase(s.begin() + i); i--; } else { break; } } for (i = 0; i < s1.size(); i++) { if (s1[i] == 0 ) { s1.erase(s1.begin() + i); i--; } else { break; } } if (s == s1 && s == && s3.size() > 0) { cout << 0 << endl; } else if (s == s1 && s == ) { cout << -1 << endl; } else if (s.size() > s1.size()) { cout << s << endl; } else { cout << s1 << endl; } } else { if (s == ) { cout << -1 << endl; } else { t = 0; s3 = s; for (i = 0; i < s.size(); i++) { if (s[i] == 0 ) { s.erase(s.begin() + i); i--; } else { break; } } if (s == && s3.size() > 0) cout << 0 << endl; else cout << s << endl; } } } } else if (k == 2) { f = 0; for (i = s.size() - 1; i >= 0; i--) { if ((s[i] - 0 ) % 3 == 2) { s.erase(s.begin() + i); f = 1; break; } } if (f == 0) { t = 0; for (i = s.size() - 1; i >= 0; i--) { if ((s[i] - 0 ) % 3 == 1) { s.erase(s.begin() + i); t++; } if (t == 2) { f = 1; break; } } if (t != 2 || s == ) { cout << -1 << endl; } else { t = 0; s3 = s; for (i = 0; i < s.size(); i++) { if (s[i] == 0 ) { s.erase(s.begin() + i); i--; } else { break; } } if (s == && s3.size() > 0) cout << 0 << endl; else cout << s << endl; } } else { t = 0; for (i = s1.size() - 1; i >= 0; i--) { if ((s1[i] - 0 ) % 3 == 1) { s1.erase(s1.begin() + i); t++; } if (t == 2) { break; } } if (t == 2) { s3 = s; for (i = 0; i < s.size(); i++) { if (s[i] == 0 ) { s.erase(s.begin() + i); i--; } else { break; } } for (i = 0; i < s1.size(); i++) { if (s1[i] == 0 ) { s1.erase(s1.begin() + i); i--; } else { break; } } if (s == s1 && s == && s3.size() > 0) { cout << 0 << endl; } else if (s == s1 && s == ) { cout << -1 << endl; } else if (s.size() > s1.size()) { cout << s << endl; } else { cout << s1 << endl; } } else { if (s == ) { cout << -1 << endl; } else { t = 0; s3 = s; for (i = 0; i < s.size(); i++) { if (s[i] == 0 ) { s.erase(s.begin() + i); i--; } else { break; } } if (s == && s3.size() > 0) cout << 0 << endl; else cout << s << endl; } } } } } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1e9; int c2i(char c) { if (c <= 9 ) return c - 0 ; return c - A + 10; } long long conv(string num, int base) { long long res = 0; for (int i = 0; i < (int)num.length(); i++) { if (c2i(num[i]) >= base) return INF; res = res * base + c2i(num[i]); } return res; } int main() { string inp, h, m; cin >> inp; for (int i = 0; i < (int)inp.length(); i++) if (inp[i] == : ) inp[i] = ; istringstream sin(inp); sin >> h >> m; vector<int> res; for (int base = 2; base <= 100; base++) if (conv(h, base) < 24 && conv(m, base) < 60) res.push_back(base); if (res.empty()) cout << 0 << endl; else if (res.back() == 100) cout << -1 << endl; else { for (int i = 0; i < (int)res.size(); i++) cout << res[i] << ; cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; int n; int m; int a, b; long long fast_mod_pow(long long a, long long b) { long long res = 1; a %= mod; while (b) { if (b & 1) { res = (res * a) % mod; } a = (a * a) % mod; b >>= 1; } return res; } const int MAXN = 1000005; long long fac[MAXN]; long long invfact[MAXN]; int main() { cin >> n >> m >> a >> b; long long ans = 0; fac[0] = 1; fac[1] = 1; for (int i = 2; i < MAXN; i++) { fac[i] = fac[i - 1] * i; fac[i] %= mod; } invfact[MAXN - 1] = fast_mod_pow(fac[MAXN - 1], mod - 2); for (int i = MAXN - 2; i >= 0; i--) { invfact[i] = (invfact[i + 1] * (i + 1)) % mod; } for (int i = 1; i <= m; i++) { if (i > n - 1) break; long long temp = 1; temp *= fac[m - 1]; temp %= mod; temp *= invfact[m - i]; temp %= mod; temp *= invfact[i - 1]; temp %= mod; temp *= fac[n - 2]; temp %= mod; temp *= invfact[n - i - 1]; temp %= mod; if ((n - i - 1) == 0) { ans += temp; ans %= mod; continue; } temp *= fast_mod_pow((long long)m, (long long)(n - i - 1)); temp %= mod; temp *= (i + 1); temp %= mod; temp *= fast_mod_pow((long long)n, (long long)(n - i - 2)); temp %= mod; ans += temp; ans %= mod; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; bool comp(pair<float, int> a, pair<float, int> b) { if (a.first > b.first) return true; else if (a.first == b.first) return a.second < b.second; else return false; } inline istream& skip_endl(istream& is) { return is.ignore(numeric_limits<streamsize>::max(), n ); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; long double t1, t2, k, a, b, h1, h2; cin >> n >> t1 >> t2 >> k; vector<pair<long double, int>> heights; for (int i = 1; i <= n; i++) { cin >> a >> b; h1 = (a * t1) - (a * t1 * (k / 100.0)) + (b * t2); h2 = (b * t1) - (b * t1 * (k / 100.0)) + (a * t2); heights.push_back(make_pair(max(h1, h2), i)); } sort(heights.begin(), heights.end(), comp); for (auto h : heights) { cout << fixed << setprecision(2) << h.second; cout << << h.first << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; mt19937_64 rd(787); int a[500010]; int cnt[500010]; unsigned long long has[500010]; unsigned long long val[500010]; list<int> vec[500010]; int main() { ios::sync_with_stdio(0); cin.tie(0); auto t = clock(); auto now_time = [&] { return (clock() - t) / (double)CLOCKS_PER_SEC; }; int n; cin >> n; unsigned long long anss = 1e18; for (int i = 1; i <= n; i++) cin >> a[i]; while (now_time() < 4) { for (int i = 1; i <= n; i++) val[i] = rd(), vec[i].clear(); unsigned long long ans = 0; map<unsigned long long, int> mp; mp[0]++; int pre = 0; for (int i = 1; i <= n; i++) { int tmp = a[i]; has[i] = has[i - 1] + val[tmp], cnt[tmp]++, vec[tmp].push_back(i); if (cnt[tmp] % 3 == 0) { has[i] -= 3 * val[tmp]; } mp[has[i]]++; if (vec[tmp].size() > 3) { int now = vec[tmp].front(); vec[tmp].pop_front(); for (; pre < now; pre++) { mp[has[pre]]--; } } ans += mp[has[i]] - 1; } anss = min(ans, anss); break; } cout << anss << endl; } |
#include <bits/stdc++.h> using namespace std; int N; vector<int> V; bool solve(int n); int main() { ios_base::sync_with_stdio(false); int i, st, dr, mid; cin >> N; V.resize(N); for (i = 0; i < N; ++i) { cin >> V[i]; } sort(V.begin(), V.end()); st = 1; dr = N; while (st < dr) { mid = (st + dr) / 2; if (solve(mid)) { dr = mid; } else { st = mid + 1; } } cout << dr << n ; return 0; } bool solve(int n) { int i, j, nr; vector<int> piles; piles.resize(n, 101); j = 0; for (i = N - 1; i >= 0; --i) { nr = 0; while (piles[j] == 0) { ++j; ++nr; if (j == n) j = 0; if (nr == n + 1) break; } if (nr == n + 1) break; piles[j] = min(piles[j] - 1, V[i]); ++j; if (j == n) j = 0; } if (i == -1) { return true; } return false; } |
#include <bits/stdc++.h> using namespace std; string s, t; int l = 0, r = 0; int main() { cin >> s >> t; while (s[l] != | ) l++; r = s.size() - l - 1; int dif; if (l > r) dif = t.size() - (l - r); else dif = t.size() - (r - l); if (dif < 0 || dif & 1) { cout << Impossible << endl; return 0; } if (l < r) { reverse(s.begin(), s.end()); int i = 0; while (l < r) { s += t[i]; i++; l++; } while (i < t.size()) { s += t[i]; i++; s = t[i] + s; i++; } reverse(s.begin(), s.end()); cout << s << endl; return 0; } int i = 0; while (r < l) { s += t[i]; i++; r++; } while (i < t.size()) { s += t[i]; i++; s = t[i] + s; i++; } cout << s << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long fib[100]; void init() { fib[0] = 1, fib[1] = 2; for (int i = 2; i <= 85; i++) fib[i] = fib[i - 1] + fib[i - 2]; } int w[100]; int dp[100][2]; void solve(long long x) { memset(w, 0, sizeof(w)); memset(dp, 0, sizeof(dp)); int num = 0; for (int i = 85; i >= 0; i--) { if (x >= fib[i]) { x -= fib[i]; w[num++] = i; } } num--; dp[0][1] = 1; dp[0][0] = w[num] >> 1; int i = 0; while (num > 0) { num--; dp[i + 1][0] = dp[i][0] * ((w[num] - w[num + 1]) >> 1) + dp[i][1] * ((w[num] - w[num + 1] - 1) >> 1); dp[i + 1][1] = dp[i][0] + dp[i][1]; i++; } cout << dp[i][0] + dp[i][1] << endl; } int main() { ios::sync_with_stdio(false); init(); int t; cin >> t; while (t--) { long long x; cin >> x; solve(x); } return 0; } |
#include <bits/stdc++.h> using namespace std; int a, s, d, n; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> a >> s; if (s - a >= 2) d++; } cout << d; } |
#include <bits/stdc++.h> using namespace std; const int N = 1000005; int n, t1, t2, cnt; vector<int> mem[N]; int imp[N], hgt[N], res[N]; int p[N], noww[2 * N], goal[2 * N]; void link(int f, int t) { noww[++cnt] = p[f]; goal[cnt] = t, p[f] = cnt; } void DFS(int nde, int fth) { for (int i = p[nde]; i; i = noww[i]) if (goal[i] != fth) { DFS(goal[i], nde); if (hgt[nde] <= hgt[goal[i]]) hgt[nde] = hgt[goal[i]] + 1, imp[nde] = goal[i]; } if (!imp[nde]) mem[nde].push_back(1); else { swap(mem[nde], mem[imp[nde]]), res[nde] = res[imp[nde]]; for (int i = p[nde]; i; i = noww[i]) if (goal[i] != fth && goal[i] != imp[nde]) { int s1 = mem[nde].size(), s2 = mem[goal[i]].size(); for (int j = 0; j < s2; j++) { mem[nde][s1 - s2 + j] += mem[goal[i]][j]; if (mem[nde][res[nde]] <= mem[nde][s1 - s2 + j]) res[nde] = s1 - s2 + j; } } mem[nde].push_back(1); if (mem[nde][res[nde]] == 1) res[nde] = mem[nde].size() - 1; } } int main() { scanf( %d , &n); for (int i = 1; i < n; i++) { scanf( %d%d , &t1, &t2); link(t1, t2), link(t2, t1); } DFS(1, 0); for (int i = 1; i <= n; i++) printf( %d n , hgt[i] - res[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; int read() { int x = 0, f = 1; char ch = getchar(); while (!isdigit(ch)) f = ch == - ? -1 : f, ch = getchar(); while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); return x * f; } const int N = 200050; int sta[3][N], f[3][N], F[3]; int n, m, s, e; int pos[N]; void dp() { for (int t = 0; t < 3; t++) for (int i = sta[t][0] - 1; i >= 1; i--) f[t][i] = f[t][i + 1] + max(sta[t][i + 1] - sta[t][i] - s, 0); } int binary_search(int t, int x) { int ret, l = 1, r = sta[t][0], mid; while (l <= r) { mid = l + r >> 1; if (sta[t][mid] >= x) ret = mid, r = mid - 1; else l = mid + 1; } return ret; } int main() { pos[0] = e = read(), s = read(), n = read(), m = read(); for (int i = 0; i < 3; i++) sta[i][++sta[i][0]] = pos[0]; for (int i = 1, tp; i <= n; i++) { tp = read(), pos[i] = read(); if (pos[i] >= e) continue; switch (tp) { case 3: sta[2][++sta[2][0]] = pos[i]; case 2: sta[1][++sta[1][0]] = pos[i]; case 1: sta[0][++sta[0][0]] = pos[i]; } } sort(sta[0] + 1, sta[0] + sta[0][0] + 1), sort(sta[1] + 1, sta[1] + sta[1][0] + 1), sort(sta[2] + 1, sta[2] + sta[2][0] + 1); dp(); for (int i = 1, x; i <= m; i++) { x = read(); for (int t = 0; t < 3; t++) { int y = binary_search(t, x); F[t] = f[t][y] + max(sta[t][y] - x - s, 0); } if (F[0] > 0) printf( -1 -1 n ); else printf( %d %d n , F[1], F[2] - F[1]); } return 0; } |
#include <bits/stdc++.h> using namespace std; struct ans { int s, t; }; const int nmax = 100006; int n, v[nmax], s1[nmax], s2[nmax], rasp, acts, fp1[nmax], fp2[nmax]; ans vrasp[nmax]; bool ver; int compar(ans a, ans b) { if (a.t != b.t) return a.t < b.t; else return a.s < b.s; } int main() { int player_unu = 0; cin >> n; for (int i = 1; i <= n; i++) { cin >> v[i]; s1[i] = s1[i - 1]; s2[i] = s2[i - 1]; if (v[i] == 1) { s1[i]++; fp1[s1[i]] = i; } else { s2[i]++; fp2[s2[i]] = i; } } if (v[n] == 2) for (int i = 1; i <= n; i++) { v[i] = 3 - v[i]; swap(s1[i], s2[i]); swap(fp1[i], fp2[i]); } for (int i = n; i > 0; i--) { if (s1[n] - s1[i - 1] > s2[n] - s2[i - 1] && v[i] == 1) { acts = s1[n] - s1[i - 1]; int nrs1 = 0, nrs2 = 0, pozact = i; ver = 0; for (int j = 0; j < n;) { if (s1[j] + acts > s1[n] && s2[j] + acts > s2[n]) { ver = 1; break; } if (s2[j] + acts > s2[n]) { nrs1++; j = fp1[s1[j] + acts]; continue; } if (s1[j] + acts > s1[n]) { nrs2++; j = fp2[s2[j] + acts]; continue; } if (fp1[s1[j] + acts] < fp2[s2[j] + acts]) { nrs1++; j = fp1[s1[j] + acts]; } else { nrs2++; j = fp2[s2[j] + acts]; } } if (ver == 0 && nrs1 > nrs2) { vrasp[rasp].s = acts; vrasp[rasp].t = nrs1; rasp++; } } } sort(vrasp, vrasp + rasp, compar); cout << rasp << n ; for (int i = 0; i < rasp; i++) cout << vrasp[i].t << << vrasp[i].s << n ; return player_unu; } |
#include <bits/stdc++.h> using namespace std; int o, trues, Bruh, YO; bool levls[696969]; int main() { int n, X; cin >> n; for (int a = 0; a < 2; a++) { cin >> Bruh; for (int AL = 0; AL < Bruh; AL++) { cin >> YO; levls[YO] = true; } } for (int x = 1; x <= n; x++) { if (levls[x] == true) trues++; } if (trues == n) cout << I become the guy. << endl; else cout << Oh, my keyboard! << endl; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; const int N = 1000040; long long fact[N], invf[N]; vector<long long> primes; long long add(long long x, long long y) { return (x + y) % mod; } long long mul(long long x, long long y) { return (x % mod) * (y % mod) % mod; } long long powll(long long x, long long y) { long long res = 1LL; while (y) { if (y & 1LL) res *= x; res %= mod; x = (x * x) % mod; y >>= 1LL; } return res; } long long divll(long long x, long long y) { return (x * powll(y, mod - 2)) % mod; } long long nPr(long long n, long long r) { if (n < r || r < 0) return 0; return mul(fact[n], invf[n - r]); } long long nCr(long long n, long long r) { if (n < r || r < 0) return 0; return mul(mul(fact[n], invf[r]), invf[n - r]); } long long solve() { long long x, y; scanf( %lld %lld , &x, &y); vector<long long> c; for (long long p : primes) { int k = 0; while (x % p == 0) { k++; x /= p; } if (k) c.push_back(k); } if (x > 1) c.push_back(1); long long ret = powll(2, y - 1); for (long long a : c) { ret = (ret * nCr(y + a - 1, a)) % mod; } return ret; } int main() { int q; cin >> q; fact[0] = invf[0] = 1; for (int i = 1; i <= N - 1; ++i) { fact[i] = (fact[i - 1] * i) % mod; invf[i] = divll(invf[i - 1], i); } long long lim = 1000; vector<int> check(lim, 1); for (int i = 2; i <= lim - 1; ++i) { if (!check[i]) continue; primes.push_back(i); for (int j = 2 * i; j < lim; j += i) check[j] = 0; } while (q--) { printf( %lld n , solve()); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t, y; cin >> t; while (t--) { int n; cin >> n; long long a[n]; for (int i = 0; i < n; i++) cin >> a[i]; long long res, mx = 0; for (int i = 0; i < n - 1; i++) { res = a[i] * a[i + 1]; mx = max(res, mx); } cout << mx << endl; } } |
#include <bits/stdc++.h> using namespace std; int n; int main() { cin >> n; if (n == 0) { printf( a ); return 0; } for (char c = a ; c <= z && n; c++) { int sum = 0, i; for (i = 0; i <= n; i++) { n -= i; cout << c; } } printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long mult(long long a, long long b, long long mod) { if (b == 0) return 0; if (b % 2 == 1) return (mult(a, b - 1, mod) + a) % mod; return (mult(a, b / 2, mod) * 2) % mod; } inline long long BinPow(long long a, long long b, long long mod) { if (b == 0) return 1; if (b == 1) return a; if (b % 2 == 1) return (mult(BinPow(a, b - 1, mod), a, mod)) % mod; long long res = BinPow(a, b / 2, mod); return mult(res, res, mod); } int n, m, k, w, kol, kol1, w1, sum1; char a[150][140][130]; int sum; int main() { cin >> n >> m >> k; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) for (int t = 1; t <= k; t++) cin >> a[i][j][t]; for (int l = 1; l <= n; l++) for (int j = 1; j <= m; j++) for (int t = 1; t <= k; t++) { if (a[l][j][t] == 1 ) { if (a[l - 1][j][t] == 1 ) if (a[l + 1][j][t] == 1 ) w = 1; if (a[l][j - 1][t] == 1 ) if (a[l][j + 1][t] == 1 ) w = 1; if (a[l][j][t - 1] == 1 ) if (a[l][j][t + 1] == 1 ) w = 1; if (a[l - 1][j][t] == 1 ) { if (a[l - 1][j + 1][t] == 0 ) if (a[l][j + 1][t] == 1 ) w1 = 1; if (a[l - 1][j][t + 1] == 0 ) if (a[l][j][t + 1] == 1 ) w1 = 1; } if (a[l][j - 1][t] == 1 ) { if (a[l][j - 1][t + 1] == 0 ) if (a[l][j][t + 1] == 1 ) w1 = 1; if (a[l + 1][j - 1][t] == 0 ) if (a[l + 1][j][t] == 1 ) w1 = 1; } if (a[l][j][t - 1] == 1 ) { if (a[l][j + 1][t - 1] == 0 ) if (a[l][j + 1][t] == 1 ) w1 = 1; if (a[l + 1][j][t - 1] == 0 ) if (a[l + 1][j][t] == 1 ) w1 = 1; } if (w || w1) sum++; w1 = w = 0; } } cout << sum; return 0; } |
#include <bits/stdc++.h> using namespace std; int setbit(int n, int pos) { return n = n | (1 << pos); } int resetbit(int n, int pos) { return n = n & ~(1 << pos); } bool checkbit(int n, int pos) { return (bool)(n & (1 << pos)); } template <typename T> T modMul(T x, T y, T mod = 1e9 + 7) { x %= mod; y %= mod; return (x * y) % mod; } template <typename T> T modAdd(T x, T y, T mod = 1e9 + 7) { x %= mod; y %= mod; return (x + y) % mod; } template <typename T> T ext_gcd(T num1, T num2, T &X, T &Y) { T r2, r1, q2, q1, x2, x1, y2, y1, x, y, r; x2 = 1; y2 = 0; x1 = 0; y1 = 1; for (r2 = num1, r1 = num2; r1 != 0; y2 = y1, y1 = y, x2 = x1, x1 = x, r2 = r1, r1 = r) { q1 = r2 / r1; x = x2 - q1 * x1; y = y2 - q1 * y1; r = r2 % r1; } X = x2; Y = y2; return r2; } template <typename T> void print(const T &v) { cerr << v << ; } template <typename T1, typename... T2> void print(const T1 &first, const T2 &...rest) { print(first); print(rest...); } template <class T> string to_str(T t) { stringstream second; second << t; return second.str(); } template <typename T> T modPow(T x, T k, T mod = 1e9 + 7) { if (k == 0) return (T)1; if (k & 1) { return ((x % mod) * modPow(x, k - 1, mod) % mod) % mod; } else { T ret = modPow(x, k / 2, mod); ret %= mod; return (ret * ret) % mod; } } template <typename T> T modInv(T x, T m) { return modPow(x, m - 2, m); } template <typename T> void dbg_a(T a[], int n = 10) { cerr << [ ; for (int i = 0; i < n; i++) cerr << a[i] << ; cerr << ] << n ; } template <typename F, typename S> ostream &operator<<(ostream &os, const pair<F, S> &p) { return os << [ << p.first << , << p.second << ] ; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { os << [ ; for (int i = 0; i < v.size(); i++) os << v[i] << ; return os << ] n ; } template <typename T> ostream &operator<<(ostream &os, const map<T, T> &Map) { os << [ ; for (__typeof((Map).begin()) it = (Map).begin(); it != (Map).end(); ++it) os << [ << (*it).first << << (*it).second << ] ; return os << ] n ; } template <typename T> ostream &operator<<(ostream &os, const set<T> &Set) { os << [ ; for (__typeof((Set).begin()) it = (Set).begin(); it != (Set).end(); ++it) os << *it << ; return os << ] n ; } const int maxn = (int)2e6 + 123; const int inf = 0x3f; const long long mod = (long long)1e9 + 7LL; int a[maxn]; void solve() { int n, q, cnt = 0, ans = 0, magic = 0; vector<int> even, odd; string s; cin >> s; for (int i = 0; i < s.size(); i++) { int x = s[i] - 0 ; if (x & 1) odd.push_back(x); else even.push_back(x); } reverse(odd.begin(), odd.end()); reverse(even.begin(), even.end()); for (int i = 0; i < s.size(); i++) { if (odd.size() == 0) { cout << even.back(); even.pop_back(); } else if (even.size() == 0) { cout << odd.back(); odd.pop_back(); } else { if (even.back() < odd.back()) { cout << even.back(); even.pop_back(); } else { cout << odd.back(); odd.pop_back(); } } } cout << n ; } int main() { ios ::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t = 1, c = 0; cin >> t; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> T max(T a, T b, T c) { return max(a, max(b, c)); } int32_t main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); long long a, b, c; cin >> a >> b >> c; cout << 2 * min(a + c, min(b + c, (a + b + c) / 2)) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int x, y, z; cin >> x >> y >> z; if (x > y) { if (x > y + z) cout << + ; else cout << ? ; } else if (x < y) { if (y > x + z) cout << - ; else cout << ? ; } else if (z != 0) cout << ? ; else cout << 0; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = (int)2e9; const long long INFL = (long long)9e18; const int MAXINT = ((~0) ^ (1 << 31)); const long long MAXLL = ((~0) ^ ((long long)1 << 63)); template <class T> inline T pow2(T a) { return a * a; } template <class T> inline bool mineq(T& a, T b) { return (a > b) ? (a = b, true) : false; } template <class T> inline bool maxeq(T& a, T b) { return (a < b) ? (a = b, true) : false; } const int maxn = (int)2222; ; char grid[maxn][maxn]; int v[maxn][maxn], h[maxn][maxn], t[maxn][maxn], n, m; long long ans0() { long long ans = 0; for (int i = 2; i < (int)(n); i++) { ans += (v[i][m] == 0); } return ans; } long long ans1() { long long ans = 0; for (int i = 2; i < (int)(n); i++) { for (int j = 2; j < (int)(m); j++) { if (grid[i][j] == # ) continue; ans += (h[i][j] == 0 && v[i][j] == 0); ans += (h[i][j] == h[n][j] && v[i][j] == 0); ans += (h[i][j] == 0 && v[i][j] == v[i][m]); ans += (h[i][j] == h[n][j] && v[i][j] == v[i][m]); } } return ans; } long long ans2() { long long ans = 0; int up[maxn] = {}, down[maxn] = {}; for (int i = 2; i < (int)(n); i++) { int l = 2, r; while (l < m) { if (grid[i][l] == # ) { l++; continue; } r = l; while (r < m && v[i][l] == v[i][r]) r++; for (int j = l; j < (int)(r); j++) { up[j] = (h[i][j] == 0); down[j] = (h[i][j] == h[n][j]); if (j - 2 >= l) ans += up[j] * up[j - 2] + down[j] * down[j - 2]; if (j - 1 >= l) ans += up[j] * down[j - 1] + down[j] * up[j - 1]; if (j != l) up[j] += up[j - 1]; if (j != l) down[j] += down[j - 1]; } l = r; } } return ans; } void pre() { for (int i = 1; i < (int)(n + 1); i++) { for (int j = 1; j < (int)(m + 1); j++) { v[i][j] = v[i][j - 1] + (grid[i][j] == # ); h[i][j] = h[i - 1][j] + (grid[i][j] == # ); } } } void reversegrid() { for (int i = 1; i < (int)(n + 1); i++) for (int j = 1; j < (int)(m + 1); j++) t[j][i] = grid[i][j]; for (int i = 1; i < (int)(m + 1); i++) for (int j = 1; j < (int)(n + 1); j++) grid[i][j] = t[i][j]; swap(n, m); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m; for (int i = 1; i < (int)(n + 1); i++) for (int j = 1; j < (int)(m + 1); j++) cin >> grid[i][j]; pre(); long long ans = ans0() + ans1() + ans2(); reversegrid(); pre(); cout << ans + ans0() + ans2(); } |
#include <bits/stdc++.h> using namespace std; int main() { int n, h, m; int mo, md, ho, hd; string t; cin >> t; n = t.size(); m = (t[n - 2] - 0 ) * 10 + t[n - 1] - 0 ; h = (t[n - 5] - 0 ) * 10 + t[n - 4] - 0 ; for (;;) { m = (m + 1) % 60; if (m == 0) { h = (h + 1) % 24; } ho = h % 10; hd = h / 10; mo = m % 10; md = m / 10; if (hd == mo && ho == md) { cout << hd << ho << : << md << mo << endl; break; } } } |
#include <bits/stdc++.h> using namespace std; int main() { cin.tie(NULL); int n; cin >> n; priority_queue<int, vector<int>, greater<int>> servers; priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq; for (int i = 0; i < n; i++) { servers.push(i + 1); } int q, t, k, d; cin >> q; for (int i = 0; i < q; i++) { cin >> t >> k >> d; while (pq.empty() == false) { pair<int, int> top = pq.top(); if (top.first < t) { servers.push(top.second); pq.pop(); } else { break; } } if (servers.size() >= k) { int total = 0, serverId; int endTime = t + d - 1; for (int j = 0; j < k; j++) { serverId = servers.top(); servers.pop(); total += serverId; pq.push(make_pair(endTime, serverId)); } cout << total << n ; } else { cout << -1 n ; } } return 0; } |
#include <bits/stdc++.h> const int maxn = 1e5, maxm = 1e5, maxCell = 1e5; const int maxv = maxCell + 4, maxe = maxCell * 4 + 4 * maxCell; const int inf = std::numeric_limits<int>::max() / 2; namespace Network { struct GraphInfo { int vertex, source, sink; }; struct Edge { int from, to; mutable int flow; const Edge *pre, *rev; } ed[maxe * 2 + 10], *end = ed; const Edge *head[maxv + 10], *cur[maxv + 10]; int exceed[maxv + 10], dep[maxv + 10]; enum class EdgeType { Normal, Required }; inline void addGraphEdge(const int from, const int to, const int flow) { new (end) Edge{from, to, flow, head[from], end + 1}; head[from] = end++; new (end) Edge{to, from, 0, head[to], end - 1}; head[to] = end++; } template <EdgeType et> inline void addUnitEdge(const int from, const int to) { if constexpr (et == EdgeType::Required) { --exceed[from]; ++exceed[to]; } else addGraphEdge(from, to, 1); } bool bfs(const int n, const int source, const int sink) { std::queue<int> q; std::fill(dep, dep + n, inf); q.push(source); dep[source] = 0; while (!q.empty()) { const int cur = q.front(); q.pop(); for (const Edge *i = head[cur]; i; i = i->pre) if (i->flow && dep[i->to] == inf) { dep[i->to] = dep[cur] + 1; q.push(i->to); } } return dep[sink] != inf; } int dfs(const int x, const int cap, const int sink) { if (x == sink || !cap) return cap; int rst = cap; for (; cur[x]; cur[x] = cur[x]->pre) { const Edge *i = cur[x]; if (i->flow && dep[i->to] == dep[x] + 1) { const int d = dfs(i->to, std::min(rst, i->flow), sink); i->flow -= d; i->rev->flow += d; rst -= d; if (!rst) break; } } return cap - rst; } int dinic(const GraphInfo gi) { int ret = 0; while (bfs(gi.vertex, gi.source, gi.sink)) { std::memcpy(cur, head, sizeof(cur[0]) * gi.vertex); ret += dfs(gi.source, inf, gi.sink); } return ret; } bool hasSolution(const int virtSource) { for (const Edge *i = head[virtSource]; i; i = i->pre) if (i->flow) return false; return true; } void init(const int n) { end = ed; std::memset(head, 0, sizeof(head[0]) * (n + 2)); std::memset(exceed, 0, sizeof(exceed[0]) * (n + 2)); } int findMatch(const int v, const int limit) { for (const Edge *i = head[v]; i; i = i->pre) if (!i->flow && i->to < limit) return i->to; return limit; } bool boundMaxFlow(const GraphInfo gi) { const int virtSource = gi.vertex, virtSink = virtSource + 1; addGraphEdge(gi.sink, gi.source, inf); for (int i = 0; i < gi.vertex; ++i) if (exceed[i] > 0) addGraphEdge(virtSource, i, exceed[i]); else if (exceed[i] < 0) addGraphEdge(i, virtSink, -exceed[i]); dinic(GraphInfo{virtSink + 1, virtSource, virtSink}); return hasSolution(virtSource); } } // namespace Network int n, m; enum Direction { Left, Right, Down, Up, None }; const Direction reverse[]{Right, Left, Up, Down, None}; struct Step { int dx, dy; inline bool operator==(const Step s) const { return dx == s.dx && dy == s.dy; } }; const Step step[]{{0, -1}, {0, 1}, {1, 0}, {-1, 0}}; const char directionName[] = { L , R , D , U }; struct Position { int x, y; inline static Position fromId(const int id) { const div_t d = div(id, m); return Position{d.quot, d.rem}; } inline Position operator+(const struct Step s) const { return Position{x + s.dx, y + s.dy}; } inline Step operator-(const Position r) const { return Step{x - r.x, y - r.y}; } inline bool isValid() const { return x >= 0 && y >= 0 && x < n && y < m; } inline int id() const { return x * m + y; } }; struct Cell { Direction next; int sum, val; } cell[maxCell + 10]; namespace GraphBuilder { template <bool rev, Network::EdgeType type> inline void linkVertex(const int from, const int to) { if constexpr (rev) Network::addUnitEdge<type>(to, from); else Network::addUnitEdge<type>(from, to); } template <bool toSink> inline void linkCell(const Position pos, const int endpoint) { using Network::EdgeType; const int cid = pos.id(); Cell &cur = cell[cid]; cur.next = Direction::None; for (int k = 0; k < 4; ++k) if (const auto nxt = pos + step[k]; nxt.isValid()) { const int nextId = nxt.id(); if (cell[nextId].sum < cur.sum) cur.next = static_cast<Direction>(k); else if (!toSink && cell[nextId].sum == cur.sum) Network::addUnitEdge<EdgeType::Normal>(cid, nextId); } if (cur.next == Direction::None) linkVertex<toSink, EdgeType::Required>(endpoint, cid); else linkVertex<toSink, EdgeType::Normal>(endpoint, cid); } inline bool isLinkSink(const Position &p) { return (p.x & 0x01) ^ (p.y & 0x01); } static Network::GraphInfo build(const int n, const int m) { const int source = n * m, sink = source + 1; Network::init(sink + 1); for (int i = 0; i < n; ++i) for (Position pos{i, 0}; pos.y < m; ++pos.y) if (isLinkSink(pos)) linkCell<true>(pos, sink); else linkCell<false>(pos, source); return Network::GraphInfo{sink + 1, source, sink}; } } // namespace GraphBuilder void construct(const int n, const int m) { const int lim = n * m; for (int i = 0, cid = 0; i < n; ++i) for (Position pos{i, 0}; pos.y < m; ++pos.y, ++cid) if (Cell &cur = cell[cid]; cur.next != Direction::None) cur.val = cur.sum - cell[(pos + step[cur.next]).id()].sum; for (int i = 0, cid = 0; i < n; ++i) for (Position pos{i, 0}; pos.y < m; ++pos.y, ++cid) if (!GraphBuilder::isLinkSink(pos)) if (const int nxt = Network::findMatch(cid, lim); nxt < lim) { Cell &cur = cell[cid]; const int typ = std::find(step, step + 4, Position::fromId(nxt) - pos) - step; cur.val = cur.sum - 1; cur.next = static_cast<Direction>(typ); cell[nxt].val = 1; cell[nxt].next = reverse[typ]; } } template <class Func> void printMatrix(const int n, const int m, Func fun) { const Cell *ptr = cell; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j, ++ptr) std::cout << fun(*ptr) << ; std::cout.put( n ); } } void solve() { std::cin >> n >> m; for (Cell *i = cell; i < cell + n * m; ++i) std::cin >> i->sum; if (!Network::boundMaxFlow(GraphBuilder::build(n, m))) std::cout << NO n ; else { construct(n, m); std::cout << YES n ; printMatrix(n, m, [](const Cell &i) { return i.val; }); printMatrix(n, m, [](const Cell &i) { return directionName[i.next]; }); } } int main() { std::ios::sync_with_stdio(false); int t; std::cin >> t; for (int i = t; i; --i) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; int i = k - 1; while (n % i != 0) { i--; } cout << n / i * k + i << endl; } |
#include <bits/stdc++.h> using namespace std; vector<int> v[30]; string s[100010]; char aver[300010]; long long f(int p, int ch, int si) { int mi = 99999999; if (v[ch].size() == 0) return s[si].size(); for (int i = 0; i < v[ch].size(); i++) mi = min(mi, abs(p - v[ch][i])); return mi; } int main() { long long n, k; cin >> n >> k; cin >> aver; for (int i = 1; i <= n; i++) cin >> s[i]; for (long long i = 0; i < k; i++) v[aver[i] - a ].push_back(i); for (int i = 1; i <= n; i++) { long long F = 0; for (int j = 0; j < s[i].size(); j++) { if (s[i][j] != aver[j]) { F += f(j, s[i][j] - a , i); } } cout << F << endl; } } |
#include <bits/stdc++.h> char a[1111]; int main() { int i, j, k, l, s, flag; while (~scanf( %s , a + 2)) { a[0] = a[1] = 0 ; s = 0; l = strlen(a); flag = 0; for (i = 0; i < l - 2; i++) { if (flag) break; for (j = i + 1; j < l - 1; j++) { if (flag) break; for (k = j + 1; k < l; k++) { s = (a[i] - 0 ) * 100 + (a[j] - 0 ) * 10 + a[k] - 0 ; if (s % 8 == 0) { flag = 1; break; } } } } if (flag) printf( YES n%d n , s); else printf( NO n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 510; const int INF = 0x3f3f3f3f; const int MOD = (int)1e9 + 7; int n; long long ans; void dfs(int a, int b, int c) { if (a == n) { ++ans; return; } for (int i = 0; i < n; ++i) { if (b & (1 << i)) continue; if (c & (1 << ((a + i) % n))) continue; dfs(a + 1, b | (1 << i), c | (1 << ((a + i) % n))); } return; } int main() { cin >> n; if (n % 2 == 0) { cout << 0 << endl; return 0; } if (n == 15) { cout << 150347555 << endl; return 0; } dfs(0, 0, 0); for (int i = 1; i <= n; ++i) { ans = (ans * i) % MOD; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c; while (cin >> a >> b >> c) { if (b == a / 2 && c == a / 2) cout << NO << endl; else if (b == a / 2 && c == a / 2 + 1) cout << NO << endl; else if (b == a / 2 + 1 && c == a / 2 + 1) cout << NO << endl; else if (b == a / 2 + 1 && c == a / 2) cout << NO << endl; else cout << YES << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, a[100000], p[100000], i, ans = 0, price = INT_MAX; scanf( %d , &n); for (i = 0; i < n; i++) scanf( %d %d , &a[i], &p[i]); for (i = 0; i < n; i++) { price = min(price, p[i]); ans += (a[i] * price); } printf( %d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; long long h12, h13, h14, h23, h24, h34; long long k1, k2, k3; long long x1, x2, x3, x4, x5, x6, x7; long long min_x7, max_x7, best_x7; long long good = 0; long long len = -1; void fail() { printf( -1 n ); exit(0); } int main() { cin >> h12 >> h13 >> h14 >> h23 >> h24 >> h34; if ((h12 + h13 + h23) % 2 != 0) fail(); k1 = (h12 + h13 - h23) / 2; k2 = (h12 + h23 - h13) / 2; k3 = (h13 + h23 - h12) / 2; if (k1 < 0 || k2 < 0 || k3 < 0) fail(); if ((h14 + h34 - k1 - k3) % 2 != 0) fail(); max_x7 = (h14 + h34 - k1 - k3) / 2; if ((k2 + k3 - h24 - h34) % 2 != 0) fail(); min_x7 = -k1 - (k2 + k3 - h24 - h34) / 2; max_x7 = min(max_x7, -(k2 + k3 - h24 - h34) / 2); min_x7 = max(min_x7, (h14 + h34 - k1 - k3) / 2 - k2); if ((h14 + h24 - k1 - k2) % 2 != 0) fail(); max_x7 = min(max_x7, (h14 + h24 - k1 - k2) / 2); min_x7 = max(min_x7, (h14 + h24 - k1 - k2) / 2 - k3); if (min_x7 > max_x7) fail(); for (int i = (max(0ll, min_x7)); i < (int)(min(1000000ll, max_x7 + 1)); ++i) { x7 = i; x3 = (h14 + h34 - k1 - k3) / 2 - x7; x1 = k1 + x7 + (k2 + k3 - h24 - h34) / 2; x5 = k1 - x1 + x3 + k3 + x7 - h34; x6 = k3 - x5; x4 = k2 - x3; x2 = k1 - x1; if (x1 < 0 || x2 < 0 || x3 < 0 || x4 < 0 || x5 < 0 || x6 < 0 || x7 < 0) continue; good = 1; if (len == -1 || len > x1 + x2 + x3 + x4 + x5 + x6 + x7) { len = x1 + x2 + x3 + x4 + x5 + x6 + x7; best_x7 = x7; } } if (!good) fail(); x7 = best_x7; x3 = (h14 + h34 - k1 - k3) / 2 - x7; x1 = k1 + x7 + (k2 + k3 - h24 - h34) / 2; x5 = k1 - x1 + x3 + k3 + x7 - h34; x6 = k3 - x5; x4 = k2 - x3; x2 = k1 - x1; cout << x1 + x2 + x3 + x4 + x5 + x6 + x7 << n ; for (int(i) = 0; (i) < (int)(x1 + x2 + x3 + x4 + x5 + x6 + x7); ++(i)) printf( a ); printf( n ); for (int(i) = 0; (i) < (int)(x1 + x2 + x3 + x4); ++(i)) printf( b ); for (int(i) = 0; (i) < (int)(x5 + x6 + x7); ++(i)) printf( a ); printf( n ); for (int(i) = 0; (i) < (int)(x1 + x2); ++(i)) printf( b ); for (int(i) = 0; (i) < (int)(x3 + x4); ++(i)) printf( a ); for (int(i) = 0; (i) < (int)(x5 + x6); ++(i)) printf( b ); for (int(i) = 0; (i) < (int)(x7); ++(i)) printf( a ); printf( n ); for (int(i) = 0; (i) < (int)(x1); ++(i)) printf( b ); for (int(i) = 0; (i) < (int)(x2); ++(i)) printf( a ); for (int(i) = 0; (i) < (int)(x3); ++(i)) printf( b ); for (int(i) = 0; (i) < (int)(x4); ++(i)) printf( a ); for (int(i) = 0; (i) < (int)(x5); ++(i)) printf( b ); for (int(i) = 0; (i) < (int)(x6); ++(i)) printf( a ); for (int(i) = 0; (i) < (int)(x7); ++(i)) printf( b ); printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; bool used[1005]; vector<int> v; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, k, a, b, c, d; cin >> n >> k >> a >> b >> c >> d; if (n == 4 or k <= n) { cout << -1; return 0; } used[a] = used[b] = used[c] = used[d] = true; for (int i = 1; i <= n; i++) { if (!used[i]) { v.push_back(i); } } cout << a << << c << << v[0] << << d << ; for (int i = 1; i <= n - 5; i++) { cout << v[i] << ; } cout << b << n ; cout << c << << a << << v[0] << << b << ; for (int i = n - 5; i >= 1; i--) { cout << v[i] << ; } cout << d; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int i, j, n, k, m, t, x = 0, y, c = 0, sum = 0, maxx, t1, t2, x1, x2, y1, y2, m1, m2; double ans1, ans2, ans = 1000000000000000000; cin >> t2 >> t1 >> x2 >> x1 >> t; if (t1 == t2 && t == t1) cout << x2 << << x1; else if (t >= t1) cout << 0 << x1; else if (t <= t2) cout << x2 << 0 ; else { for (i = 1; i < x1 + 1; i++) { y1 = i; y2 = min(y1 * (t1 - t) / (t - t2), x2); ans1 = (t1 * y1 + t2 * y2) * 1.0 / (y1 + y2); if (ans1 >= t && ((ans1 - t) <= ans || abs(ans1 - t - ans) <= 0.0000001)) { m1 = y1; m2 = y2; ans = ans1 - t; } if (y2 < x2) { y2++; ans2 = (t1 * y1 + t2 * y2) * 1.0 / (y1 + y2); if (ans2 >= t && ((ans2 - t) <= ans || abs(ans2 - t - ans) <= 0.0000001)) { m1 = y1; m2 = y2; ans = ans2 - t; } } } cout << m2 << << m1; } } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, h, m, i, j, x, y, z, ans; cin >> n >> h >> m; long long int a[n + 10]; for (i = 1; i <= n; i++) { a[i] = h; } for (i = 1; i <= m; i++) { cin >> x >> y >> z; for (j = x; j <= y; j++) { a[j] = min(a[j], z); } } ans = 0; for (i = 1; i <= n; i++) { ans += a[i] * a[i]; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int n, m; char jz[1000006][5]; int cnt2 = 0, cnt3 = 0, dp[1000006][8]; int cal(int x) { int ans = 0; while (x > 0) { if (x & 1) ans++; x /= 2; } return ans; } bool check_3(int x, int y) { int sum = cal(x / 2) + cal(y / 2); if (sum % 2 == 0) return false; if (x >= 4) x -= 4; if (y >= 4) y -= 4; sum = cal(x) + cal(y); if (sum % 2 == 0) return false; return true; } bool check_2(int x, int y) { if ((cal(x) + cal(y)) % 2 == 0) return false; return true; } int change(int x, int y) { return cal(x ^ y); } struct s3 { int x; vector<int> v; } a3[10], a2[5]; int main() { memset(dp, 0x3f3f3f3f, sizeof(dp)); cin >> n >> m; if (n > 3 && m > 3) { cout << -1; return 0; } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (m >= 4) cin >> jz[j][i]; else if (m < 4) cin >> jz[i][j]; } getchar(); } if (m >= 4) swap(n, m); if (m == 1) { cout << 0; return 0; } else if (m == 2) { for (int i = 0; i < 4; i++) for (int j = 0; j < 4; j++) { if (check_2(i, j)) { a2[i].v.push_back(j); } } if (n == 1) { cout << 0; return 0; } int num1 = 0; for (int i = 1; i <= m; i++) { num1 *= 2; if (jz[1][i] == 1 ) num1++; } for (int i = 2; i <= n; i++) { int num = 0; for (int l = 1; l <= m; l++) { num *= 2; if (jz[i][l] == 1 ) num++; } if (i == 2) { for (int j = 0; j < 4; j++) { for (int k = 0; k < a2[j].v.size(); k++) dp[i][j] = min(dp[i][j], change(j, num) + change(a2[j].v[k], num1)); } } else { for (int j = 0; j < 4; j++) { for (int k = 0; k < a2[j].v.size(); k++) dp[i][j] = min(dp[i][j], dp[i - 1][a2[j].v[k]] + change(j, num)); } } } int ans = 2100000000; for (int i = 0; i < 4; i++) ans = min(ans, dp[n][i]); cout << ans; } else if (m == 3) { for (int i = 0; i <= 7; i++) { for (int j = 0; j <= 7; j++) { if (check_3(i, j)) { a3[i].x = i; a3[i].v.push_back(j); } } } int num1 = 0; for (int i = 1; i <= m; i++) { num1 *= 2; if (jz[1][i] == 1 ) num1++; } if (n == 1) { cout << 0; return 0; } for (int i = 2; i <= n; i++) { int num = 0; for (int l = 1; l <= m; l++) { num *= 2; if (jz[i][l] == 1 ) num++; } if (i == 2) { for (int j = 0; j < 8; j++) for (int k = 0; k < a3[j].v.size(); k++) { dp[i][j] = min(dp[i][j], change(j, num) + change(a3[j].v[k], num1)); } } else { for (int j = 0; j < 8; j++) for (int k = 0; k < a3[j].v.size(); k++) { dp[i][j] = min(dp[i][j], dp[i - 1][a3[j].v[k]] + change(j, num)); } } } int ans = 2100000000; for (int i = 0; i < 8; i++) ans = min(ans, dp[n][i]); cout << ans; } } |
#include <bits/stdc++.h> using namespace std; int n, q, p; long long* pt; long long a[200000], k, sum = 0LL; int main() { cin >> n >> q; for (int i = (0); i < (n); i++) { cin >> a[i]; if (i) a[i] += a[i - 1]; } for (int i = (0); i < (q); i++) { cin >> k; sum += k; pt = upper_bound(a, a + n, sum); p = pt - a; if (p == n) { p = 0; sum = 0LL; } cout << n - p << n ; } } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; inline bool chmax(int& a, int b) { if (a < b) { a = b; return true; } return false; } constexpr int B = 210; int q, n, e, i, j, ans, res, l, r, val, x, mid; void solve() { cin >> n; vector<vector<int>> sum(n + 1, vector<int>(B, 0)); for (i = 0; i < n; i++) { for (j = 0; j < B; j++) sum[i + 1][j] = sum[i][j]; cin >> e; sum[i + 1][e]++; } ans = 0; for (x = 0; x < B; x++) { res = 0; l = 0; r = n; val = 0; while (l < r) { mid = 0; while (l < n and sum[l][x] < val) l++; while (0 < r and sum[n][x] - sum[r][x] < val) r--; if (r <= l) break; for (i = 0; i < B; i++) chmax(mid, sum[r][i] - sum[l][i]); chmax(res, mid + sum[l][x] + sum[l][x]); val++; } chmax(ans, res); } cout << ans << n ; return; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cin >> q; while (q--) { cin >> n; vector<vector<int>> sum(n + 1, vector<int>(B, 0)); for (i = 0; i < n; i++) { for (j = 0; j < B; j++) sum[i + 1][j] = sum[i][j]; cin >> e; sum[i + 1][e]++; } ans = 0; for (x = 0; x < B; x++) { res = 0; l = 0; r = n; val = 0; while (l < r) { mid = 0; while (l < n and sum[l][x] < val) l++; while (0 < r and sum[n][x] - sum[r][x] < val) r--; if (r < l) break; for (i = 0; i < B; i++) chmax(mid, sum[r][i] - sum[l][i]); chmax(res, mid + sum[l][x] + sum[l][x]); val++; } chmax(ans, res); } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> const int maxn = 100000 + 5; using namespace std; int main() { int n, a[maxn]; cin >> n; bool flag = false; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); for (int i = 2; i < n; i++) { int x = a[i], y = a[i - 1]; int z = a[i - 2]; if ((y + z) > x && (x - y) < z) flag = true; } if (flag) cout << YES ; else cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; const ll MOD = 998244353; const ll MX = 3e5 + 5; ll fct[MX] = {1}, inv[MX] = {1}; ll power(ll a, ll b, ll p = 1) { if (b == 0) return 1; ll res = power(a, b / 2) % MOD; if (b & 1) { return (((res * res) % MOD) * a) % MOD; } else { return (((res * res) % MOD) * 1) % MOD; } } void func() { ll i; fct[1] = 1; for (i = 2; i < MX; i++) { fct[i] = fct[i - 1] * i; fct[i] %= MOD; } for (i = 1; i < MX; i++) { inv[i] = power(fct[i], MOD - 2); } } int main() { func(); ll n, i, k; cin >> n >> k; vector<pair<ll, ll>> vt; for (i = 0; i < n; i++) { ll l, r; cin >> l >> r; vt.push_back({l, -1}); vt.push_back({r, 1}); } sort(vt.begin(), vt.end()); ll cur = 0, ans = 0; for (i = 0; i < vt.size(); i++) { if (vt[i].second < 0) { cur++; } else { cur--; if (cur >= k - 1) ans += (((fct[cur] * inv[k - 1]) % MOD) * inv[cur - k + 1]) % MOD; ans %= MOD; } } cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; int a[100][100], n, row[55][100005], col[55][100005]; bool valid(int i, int j) { for (int k = 0; k < n; k++) { if (k == i) continue; int x = a[i][j] - a[k][j]; if (x > 0 && row[i][x] && (x != a[i][j] || row[i][x] > 1)) return 1; } return 0; } int main() { scanf( %d , &n); for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) { scanf( %d , &a[i][j]); row[i][a[i][j]]++; col[j][a[i][j]]++; } for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (a[i][j] != 1 && !valid(i, j)) { printf( No n ); return 0; } printf( Yes n ); } |
#include <bits/stdc++.h> using namespace std; using namespace std; const long long mo = 1000000007; int n, k; long long c[15][15]; long long f[210][210][10]; int flag[10][10] = {{1, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {1, 1, 0, 0, 0, 0, 0, 0, 0, 0}, {1, 0, 1, 0, 0, 0, 0, 0, 0, 0}, {1, 2, 0, 1, 0, 0, 0, 0, 0, 0}, {1, 2, 0, 0, 1, 0, 0, 0, 0, 0}, {1, 1, 1, 0, 0, 1, 0, 0, 0, 0}, {1, 0, 2, 0, 0, 0, 1, 0, 0, 0}, {1, 3, 0, 2, 1, 0, 0, 1, 0, 0}, {1, 2, 1, 1, 0, 2, 0, 0, 1, 0}, {1, 4, 0, 4, 2, 0, 0, 4, 0, 1}}, dt1[10] = {12, 9, 6, 6, 6, 3, 0, 3, 0, 0}, dt2[10] = {4, 2, 1, 1, 0, 0, 0, 0, 0, 0}; int main() { f[0][0][0] = 1; f[0][1][1] = 4; f[0][1][2] = 4; f[0][2][3] = 4; f[0][2][4] = 2; f[0][2][5] = 8; f[0][2][6] = 2; f[0][3][7] = 4; f[0][3][8] = 4; f[0][4][9] = 1; scanf( %d%d , &n, &k); c[0][0] = 1; for (int i = 1; i < 15; i++) { c[i][0] = 1; for (int j = 1; j <= i; j++) c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mo; } for (int i = 0; i < n; i++) for (int j = 0; j < 10; j++) for (int p = 0; p <= k; p++) { if (!f[i][p][j]) continue; for (int q = 0; q < 10; q++) { if (!flag[j][q]) continue; for (int r = 0; p + r <= k && r <= dt2[q]; r++) for (int t = 0; r + p + t <= k && t <= dt1[q] - 2 * r; t++) (f[i + 1][p + r + t][q] += (f[i][p][j] * c[dt2[q]][r] % mo * c[dt1[q] - 2 * r][t] % mo * flag[j][q] % mo)) %= mo; } } long long ans = 0; for (int i = 0; i < 10; i++) (ans += f[n][k][i]) %= mo; for (int i = 1; i <= k; i++) (ans *= i) %= mo; printf( %lld , ans); } |
#include <bits/stdc++.h> using namespace std; int mobius[500005], prime_cnt[500005], prime[500005], present[500005], nums[500005], cnt[500005]; vector<int> divisors[500005]; void calc_divisors(int val) { int i; if (divisors[val].size() > 0) return; int foo = sqrt(val); for (i = 1; i <= foo; i++) { if ((val % i) == 0) { divisors[val].push_back(i); divisors[val].push_back(val / i); } } if ((foo * foo) == val) { int temp = divisors[val].size(); divisors[val][temp - 1] = 0; } return; } void calc_mobius() { mobius[0] = 0; long long int i, j, temp; prime[1] = 1; mobius[1] = 1; for (i = 2; i < 500005; i++) { if (prime[i] == 0) { for (j = 2 * i; j < 500005; j += i) { prime[j] = 1; prime_cnt[j]++; } temp = i * i; j = 1; while (temp < 500005) { mobius[temp] = 0; j++; temp = j * i * i; } mobius[i] = -1; } else { if (mobius[i] == 500005) { if ((prime_cnt[i] % 2) == 0) mobius[i] = 1; else mobius[i] = -1; } } } return; } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); ; int i, j, t, n, m, k, l, r, temp, mini, maxi, flag; long long int result = 0LL; for (i = 0; i < 500005; i++) { mobius[i] = 500005; prime[i] = 0; prime_cnt[i] = 0; cnt[i] = 0; present[i] = 0; } calc_mobius(); divisors[1].push_back(1); divisors[2].push_back(1); divisors[2].push_back(2); divisors[3].push_back(1); divisors[3].push_back(3); cin >> n >> m; for (i = 1; i <= n; i++) { cin >> nums[i]; calc_divisors(nums[i]); } for (i = 0; i < m; i++) { cin >> k; temp = nums[k]; if (present[k] == 0) { present[k] = 1; for (j = 0; j < divisors[temp].size(); j++) { result = result + (long long int)mobius[divisors[temp][j]] * cnt[divisors[temp][j]]; cnt[divisors[temp][j]]++; } } else { present[k] = 0; for (j = 0; j < divisors[temp].size(); j++) { result = result - (long long int)mobius[divisors[temp][j]] * (cnt[divisors[temp][j]] - 1LL); cnt[divisors[temp][j]]--; } } cout << result << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, a, b, T, i, j, temp, le, ri, mid, ma = 0; cin >> n >> a >> b >> T; char str[n]; cin >> str; int r[n], l[n]; if (str[0] == h ) r[0] = 1; else r[0] = b + 1; for (i = 1; i < n; i++) { if (str[i] == h ) r[i] = r[i - 1] + a + 1; else r[i] = r[i - 1] + a + b + 1; } if (str[n - 1] == h ) l[0] = a + 1; else l[0] = a + b + 1; for (i = 1; i < n - 1; i++) { if (str[n - 1 - i] == h ) l[i] = l[i - 1] + a + 1; else l[i] = l[i - 1] + a + b + 1; } for (i = 0; i < n; i++) if (r[i] <= T) ma = max(ma, i + 1); for (i = 0; i < n - 1; i++) { temp = l[i]; if (temp >= T) continue; le = 0; ri = n - 1 - i - 1; while (ri - le > 1) { mid = (le + ri) / 2; temp = l[i] + min(i + 1, mid) * a; if (temp + r[mid] < T) le = mid; else ri = mid; } if (l[i] + r[le] + min(i + 1, le) * a <= T) ma = max(ma, i + le + 2); if (l[i] + r[ri] + min(i + 1, ri) * a <= T) ma = max(ma, i + ri + 2); } cout << ma; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int N = 1e3 + 10; char s[N], x[N], y[N]; int n, d; namespace Trie { const int M = N * 60; int ch[M][10], tot = 1, rt = 1, fail[M]; bool ed[M]; inline void insert(int l, int r) { int now = rt; for (int i = l; i <= r; ++i) { int v = s[i] - 0 ; if (!ch[now][v]) ch[now][v] = ++tot; now = ch[now][v]; } ed[now] = true; } inline void getfail() { for (int i = 0; i < 10; ++i) ch[0][i] = rt; fail[rt] = 0; queue<int> q; q.push(rt); while (!q.empty()) { int u = q.front(); q.pop(); for (int i = 0; i < 10; ++i) { if (!ch[u][i]) ch[u][i] = ch[fail[u]][i]; else fail[ch[u][i]] = ch[fail[u]][i], q.push(ch[u][i]); } } } } // namespace Trie using namespace Trie; int dp[2][N * 50][2][2][2]; inline void upd(int &x, int y) { x = (x + y >= mod) ? x + y - mod : x + y; } int main() { scanf( %s%s%s , s + 1, x + 1, y + 1); n = strlen(s + 1); d = strlen(x + 1); int nd = d / 2; for (int i = 1; i + nd - 1 <= n; ++i) insert(i, i + nd - 1); getfail(); dp[0][rt][1][1][0] = 1; for (int i = 1; i <= d; ++i) { int cur = i & 1, last = !cur; for (int pos = 0; pos <= tot; ++pos) for (int limx = 0; limx <= 1; ++limx) for (int limy = 0; limy <= 1; ++limy) for (int ok = 0; ok <= 1; ++ok) { int &d = dp[last][pos][limx][limy][ok]; if (!d) continue; int s = limx ? x[i] - 0 : 0, t = limy ? y[i] - 0 : 9; for (int c = s; c <= t; ++c) { int npos = ch[pos][c]; upd(dp[cur][npos][limx && c == x[i] - 0 ] [limy && c == y[i] - 0 ][ok | ed[npos]], d); } d = 0; } } int ans = 0; for (int pos = 0; pos <= tot; ++pos) for (int limx = 0; limx <= 1; ++limx) for (int limy = 0; limy <= 1; ++limy) upd(ans, dp[d & 1][pos][limx][limy][1]); printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int inp[105][105]; int a[105]; int b[105]; int temp[105]; int main() { int n, m; scanf( %d , &n); scanf( %d , &m); for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) scanf( %d , &inp[i][j]); for (int i = 0; i < m; i++) b[i] = inp[0][i]; int up = 0; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) up = max(up, inp[i][j]); int prevk = 0; for (int i = 1; i <= n - 1; i++) { map<int, int> mp; for (int j = 0; j < m; j++) { temp[j] = inp[i][j] - b[j]; mp[temp[j]] = 1; } int currk = 0; if (mp.size() == 2) { int f = mp.rbegin()->first; int s = mp.begin()->first; if (max(f, s) >= 0 && min(f, s) <= 0) currk = max(s, f) - min(s, f); else currk = -1; } if (mp.size() > 2 || (currk && prevk && currk != prevk) || (currk != 0 && currk <= up)) { printf( NO n ); return 0; } prevk = max(prevk, currk); a[i] = max(mp.rbegin()->first, mp.begin()->first); } printf( YES n ); if (prevk == 0) prevk = 2e9 + 7; printf( %d n , prevk); for (int i = 0; i < n; i++) printf( %d , (a[i] >= 0) ? a[i] : (a[i] + prevk)); cout << endl; for (int i = 0; i < m; i++) printf( %d , b[i]); cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 55, maxm = 9; int loc[maxn][2], col[maxn]; char s[maxn][maxn], res[maxn][maxn]; int num[maxn][maxn], used[maxm][maxm]; int n, m, ans, cnt; void dfs(int u, int v) { int i, j, x, y; if (u > 14) { memset(used, 0, sizeof used); for (i = 1; i <= 28; ++i) { x = col[loc[i][0]]; y = col[loc[i][1]]; if (used[x][y]) return; used[x][y] = used[y][x] = true; } ++ans; if (ans == 1) { for (i = 1; i <= n; ++i) for (j = 1, res[i][m + 1] = 0 ; j <= m; ++j) res[i][j] = num[i][j] ? col[num[i][j]] - 1 + 0 : . ; } return; } if (col[u]) dfs(u + 1, v); else { for (i = u + 1, col[u] = v; i <= 14; ++i) if (!col[i]) { col[i] = v; dfs(u + 1, v + 1); col[i] = 0; } col[u] = 0; } } int main() { int i, j, t; scanf( %d%d , &n, &m); for (i = 1; i <= n; ++i) scanf( %s , s[i] + 1); for (i = 1; i <= n; ++i) for (j = 1; j <= m; ++j) if (s[i][j] != . ) { if (!num[i][j]) num[i][j] = num[i + 1][j] = num[i][j + 1] = num[i + 1][j + 1] = ++cnt; t = s[i][j] < a ? s[i][j] - A + 27 : s[i][j] - a + 1; if (!loc[t][0]) loc[t][0] = num[i][j]; else loc[t][1] = num[i][j]; } dfs(1, 1); printf( %I64d n , (long long)ans * 5040); for (i = 1; i <= n; ++i) puts(res[i] + 1); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 6; vector<int> num, low, S, vis; int cntr, numCC; int par[N]; vector<int> adj[N]; void tarjanSCC(int v) { low[v] = num[v] = ++cntr; vis[v] = 1; S.push_back(v); for (auto u : adj[v]) { if (num[u] == -1) tarjanSCC(u); if (vis[u]) low[v] = min(low[v], low[u]); } if (low[v] == num[v]) { while (1) { int u = S.back(); S.pop_back(); vis[u] = 0; par[u] = numCC; if (u == v) break; } numCC++; } } int u[N], v[N], w[N]; vector<pair<int, long long>> edge[N]; long long gain[N], del[N]; long long sum(long long n) { return n * (n + 1) / 2; } long long get(int c) { long long l = 0, r = c; while (l < r) { long long mid = (l + r + 1) >> 1; if (sum(mid) <= c) { l = mid; } else { r = mid - 1; } } return 1LL * c * (l + 1) - del[l]; } long long dp[N]; long long dfs(int now) { if (dp[now] != -1) return dp[now]; long long best = 0; for (auto it : edge[now]) { best = max(best, dfs(it.first) + it.second); } return dp[now] = best + gain[now]; } int main() { for (int i = 1; i < N; i++) del[i] = del[i - 1] + sum(i); int n, m; scanf( %d %d , &n, &m); for (int i = 0; i < m; i++) { scanf( %d %d %d , u + i, v + i, w + i); adj[u[i]].push_back(v[i]); } int s; scanf( %d , &s); num.assign(n + 1, -1); low.assign(n + 1, 0); vis.assign(n + 1, 0); cntr = numCC = 0; for (int i = 1; i <= n; i++) if (num[i] == -1) tarjanSCC(i); for (int i = 0; i < m; i++) { int a = par[u[i]]; int b = par[v[i]]; if (a == b) { gain[a] += get(w[i]); } else { edge[a].emplace_back(b, w[i]); } } memset(dp, -1, sizeof(dp)); cout << dfs(par[s]) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; using namespace std; template <typename T, typename U> std::istream& operator>>(std::istream& i, pair<T, U>& p) { i >> p.first >> p.second; return i; } template <typename T> std::istream& operator>>(std::istream& i, vector<T>& t) { for (auto& v : t) { i >> v; } return i; } template <typename T, typename U> std::ostream& operator<<(std::ostream& o, const pair<T, U>& p) { o << p.first << << p.second; return o; } template <typename T> std::ostream& operator<<(std::ostream& o, const vector<T>& t) { if (t.empty()) o << n ; for (size_t i = 0; i < t.size(); ++i) { o << t[i] << n [i == t.size() - 1]; } return o; } template <typename T> using minheap = priority_queue<T, vector<T>, greater<T>>; template <typename T> using maxheap = priority_queue<T, vector<T>, less<T>>; template <typename T> bool in(T a, T b, T c) { return a <= b && b < c; } unsigned int logceil(int x) { return (unsigned int)(8 * sizeof(int) - __builtin_clz(x)); } namespace std { template <typename T, typename U> struct hash<pair<T, U>> { hash<T> t; hash<U> u; size_t operator()(const pair<T, U>& p) const { return t(p.x) ^ (u(p.y) << 7); } }; } // namespace std template <typename T> T gcd(T a, T b) { if (a < b) swap(a, b); return b ? gcd(b, a % b) : a; } template <typename T> class vector2 : public vector<vector<T>> { public: vector2() {} vector2(size_t a, size_t b, T t = T()) : vector<vector<T>>(a, vector<T>(b, t)) {} }; template <typename T> class vector3 : public vector<vector2<T>> { public: vector3() {} vector3(size_t a, size_t b, size_t c, T t = T()) : vector<vector2<T>>(a, vector2<T>(b, c, t)) {} }; template <typename T> class vector4 : public vector<vector3<T>> { public: vector4() {} vector4(size_t a, size_t b, size_t c, size_t d, T t = T()) : vector<vector3<T>>(a, vector3<T>(b, c, d, t)) {} }; template <typename T> class vector5 : public vector<vector4<T>> { public: vector5() {} vector5(size_t a, size_t b, size_t c, size_t d, size_t e, T t = T()) : vector<vector4<T>>(a, vector4<T>(b, c, d, e, t)) {} }; void fastIO() { ios::sync_with_stdio(false); } template <typename T, typename... Args> T max(T t, Args... args) { return max(max<T>(args...), t); } template <typename T, typename... Args> T min(T t, Args... args) { return min(min<T>(args...), t); } using PLL = pair<long long, unsigned long long>; class FFooFighters { public: void solve(std::istream& in, std::ostream& out) { fastIO(); int n; in >> n; vector<PLL> a(n); in >> a; unsigned long long mb = 1; unsigned long long res = 0; long long ds = 0; for (auto p : a) { ds += p.first; } for (int i = 0; i < 64; ++i) { long long cs = 0; for (auto p : a) { if (p.second >= mb && p.second < 2 * mb) { ds += p.first; long long nmask = p.second & res; if (__builtin_popcountll(nmask) % 2 == 1) cs -= p.first; else cs += p.first; } } if (cs != 0 && signbit(ds) == signbit(cs)) { res |= mb; } mb <<= 1; } out << res << endl; } }; int main() { FFooFighters solver; std::istream& in(std::cin); std::ostream& out(std::cout); solver.solve(in, out); return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T, size_t... Is> struct arr_helper; template <class T, size_t... Is> using arr = typename arr_helper<T, Is...>::type; template <class T> struct arr_helper<T> { using type = T; }; template <class T, size_t I, size_t... Is> struct arr_helper<T, I, Is...> { using type = array<arr<T, Is...>, I>; }; using ll = long long; using u64 = uint64_t; using u32 = uint32_t; using vi = vector<int>; using vl = vector<ll>; using vvi = vector<vi>; using pi = pair<int, int>; using pl = pair<ll, ll>; using vpi = vector<pi>; [[maybe_unused]] const int INF = (int)1e9; [[maybe_unused]] const ll INFL = (ll)1e18; ll M = 998244353; int mod_pow(ll b, ll e) { ll res = 1; for (; e; b = b * b % M, e /= 2) if (e % 2) res = res * b % M; return (int)res; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, m, k; cin >> n >> m >> k; vi f(k + 1), fi(k + 1), fn(k + 1); f[0] = 1; for (int i = (1); i < (k + 1); ++i) f[i] = (ll)f[i - 1] * i % M; for (int i = 0; i < (k + 1); ++i) fi[i] = mod_pow(f[i], M - 2); fn[0] = 1; for (int i = (1); i < (k + 1); ++i) fn[i] = fn[i - 1] * (ll)(n - i + 1) % M; auto choose = [&](int n, int k) { if (k > n) return 0ll; return (ll)f[n] * fi[n - k] % M * (ll)fi[k] % M; }; auto choose_n = [&](int k) { return fn[k] * (ll)fi[k] % M; }; ll sum = 0; auto p = mod_pow(m, M - 2); auto q = (ll)(m - 1) * p % M; vi nmkitok(k + 1); for (int i = 0; i < (k + 1); ++i) nmkitok[i] = mod_pow(n - i, k); for (int j = 0; j < (k + 1); ++j) { ll si = 0; for (int ki = 0; ki < (j + 1); ++ki) { si += (ll)(ki % 2 ? M - 1 : 1) * choose(j, ki) % M * nmkitok[ki] % M; si %= M; } sum += mod_pow(M - q, j) * (ll)choose_n(j) % M * si % M; sum %= M; } cout << sum << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; int t; cin >> n >> t; if (t == 10 && n == 1) return cout << -1, 0; string s; if (t == 10) s += 10 , n -= 2; else s += (char)(t + 48), n--; while (n--) s += 0 ; cout << s; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.