func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; const signed long long INF = 1000000100; const long double EPS = 1e-9; const long double Pi = 2 * atanl(1.0); template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << ( << p.first << , << p.second << ) ; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &V) { os << [ ; for (int(i) = (0); (i) < (int(V.size())); (i)++) os << V[i] << ((i == int(V.size()) - 1) ? : , ); return os << ] ; } template <typename T> ostream &operator<<(ostream &os, const set<T> &S) { os << ( ; for (T i : S) os << i << (i == *S.rbegin() ? : , ); return os << ) ; } template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &M) { os << { ; for (pair<T, U> i : M) os << i << (i.X == M.rbegin()->X ? : , ); return os << } ; } inline bool is_zero(const long double &first) { return first >= -EPS and first <= EPS; } inline int sign(const long double &first) { if (first < -EPS) return -1; else if (first > EPS) return 1; else return 0; } inline pair<long double, long double> operator+( const pair<long double, long double> &a, const pair<long double, long double> &b) { return pair<long double, long double>(a.first + b.first, a.second + b.second); } inline pair<long double, long double> operator-( const pair<long double, long double> &a, const pair<long double, long double> &b) { return pair<long double, long double>(a.first - b.first, a.second - b.second); } inline pair<long double, long double> operator*( const pair<long double, long double> &a, long double t) { return pair<long double, long double>(a.first * t, a.second * t); } inline pair<long double, long double> operator/( const pair<long double, long double> &a, long double t) { return pair<long double, long double>(a.first / t, a.second / t); } inline bool operator==(const pair<long double, long double> &a, const pair<long double, long double> &b) { return is_zero(a.first - b.first) and is_zero(a.second - b.second); } inline bool operator!=(const pair<long double, long double> &a, const pair<long double, long double> &b) { return !is_zero(a.first - b.first) or !is_zero(a.second - b.second); } pair<long double, long double> FAIL = make_pair(1e30, 1e30); inline long double cp(const pair<long double, long double> &a, const pair<long double, long double> &b) { return a.first * b.second - a.second * b.first; } inline long double dp(const pair<long double, long double> &a, const pair<long double, long double> &b) { return a.first * b.first + a.second * b.second; } inline long double pieprzu(const pair<long double, long double> &a, const pair<long double, long double> &b) { return sqrtl((b.first - a.first) * (b.first - a.first) + (b.second - a.second) * (b.second - a.second)); } inline long double distance_point_line( const pair<long double, long double> &p, const pair<pair<long double, long double>, pair<long double, long double> > &u) { return cp(p - u.first, p - u.second) / pieprzu(u.first, u.second); } inline bool on_right(const pair<long double, long double> &a, const pair<long double, long double> &b, const pair<long double, long double> &c) { return sign(cp(c - a, b - a)) == 1; } inline bool on_left(const pair<long double, long double> &a, const pair<long double, long double> &b, const pair<long double, long double> &c) { return sign(cp(c - a, b - a)) == -1; } inline double polygon_area(const vector<pair<long double, long double> > &A) { long double result = 0.0; if (int(A.size()) <= 2) return 0; for (int(i) = (2); (i) < (int(A.size())); (i)++) result += cp(A[i] - A[0], A[i - 1] - A[0]); return abs(result / 2); } inline pair<long double, long double> projection( const pair<long double, long double> &p, const pair<pair<long double, long double>, pair<long double, long double> > &u) { return u.first + ((u.second - u.first) * (dp(p - u.first, u.second - u.first) / dp(u.second - u.first, u.second - u.first))); } inline bool between(const pair<long double, long double> &a, const pair<long double, long double> &b, const pair<long double, long double> &c) { return sign(min(b.first, c.first) - a.first) <= 0 and sign(a.first - max(b.first, c.first)) <= 0 and sign(min(b.second, c.second) - a.second) <= 0 and sign(a.second - max(b.second, c.second)) <= 0; } inline bool on_segment(const pair<long double, long double> &p, const pair<pair<long double, long double>, pair<long double, long double> > &u) { return between(p, u.first, u.second) and pieprzu(p, projection(p, u)) < EPS; } inline long double distance_segment_point( const pair<pair<long double, long double>, pair<long double, long double> > &u, const pair<long double, long double> &p) { if (on_segment(projection(p, u), u)) return fabs(distance_point_line(p, u)); else return min(pieprzu(u.first, p), pieprzu(u.second, p)); } inline long double angle(const pair<long double, long double> &a, const pair<long double, long double> &o, const pair<long double, long double> &b) { long double result = atan2l(a.first - o.first, a.second - o.second) - atan2l(b.first - o.first, b.second - o.second); if (sign(result) == -1) result += 2 * Pi; return result; } inline pair<long double, long double> point_reflection( const pair<long double, long double> &s, const pair<long double, long double> &p) { return p + (s - p) * 2; } inline pair<long double, long double> axial_reflection( const pair<long double, long double> &p, const pair<pair<long double, long double>, pair<long double, long double> > &u) { return point_reflection(p, projection(p, u)); } inline int triangle_inequality(long double &p, long double q, long double r) { int a = sign(p + q - r); int b = sign(p + r - q); int c = sign(q + r - p); if (a == -1 or b == -1 or c == -1) return -1; if (a == 0 or b == 0 or c == 0) return 0; return 1; } vector<pair<long double, long double> > convex_hull( vector<pair<long double, long double> > A) { if (int(A.size()) <= 1) return A; sort(A.begin(), A.end()); vector<pair<long double, long double> > R{A[0], A[1]}; for (int(i) = (2); (i) < (int(A.size())); (i)++) { while (int(R.size()) >= 2 and !on_right(R[R.size() - 2], R[R.size() - 1], A[i])) R.pop_back(); R.push_back(A[i]); } int u = int(A.size()); for (int(i) = (int(A.size()) - 2); (i) >= (0); (i)--) { while (int(R.size()) > u and !on_right(R[R.size() - 2], R[R.size() - 1], A[i])) R.pop_back(); R.push_back(A[i]); } R.pop_back(); return move(R); } inline pair<long double, long double> rotate90_origin( const pair<long double, long double> &p) { return pair<long double, long double>(p.second, -p.first); } inline pair<long double, long double> rotate90( const pair<long double, long double> &p, const pair<long double, long double> &o) { return o + rotate90_origin(p - o); } inline pair<long double, long double> rotate_origin( const pair<long double, long double> &p, long double theta) { theta = -theta; long double s = sinl(theta); long double c = cosl(theta); return pair<long double, long double>(p.first * c - p.second * s, p.first * s + p.second * c); } inline pair<long double, long double> rotate( const pair<long double, long double> &p, const pair<long double, long double> &o, long double theta) { return o + rotate_origin(p - o, theta); } inline bool parallel(const pair<pair<long double, long double>, pair<long double, long double> > &u, const pair<pair<long double, long double>, pair<long double, long double> > &v) { return is_zero(cp(u.second - u.first, v.second - v.first)); } bool perpendicular(const pair<pair<long double, long double>, pair<long double, long double> > &u, const pair<pair<long double, long double>, pair<long double, long double> > &v) { return is_zero(dp(u.second - u.first, v.second - v.first)); } inline pair<pair<long double, long double>, pair<long double, long double> > segment_bisector(const pair<pair<long double, long double>, pair<long double, long double> > &u) { pair<long double, long double> p = (u.first + u.second) / 2; return pair<pair<long double, long double>, pair<long double, long double> >( p, rotate90(u.second, p)); } inline pair<pair<long double, long double>, pair<long double, long double> > angle_bisector(const pair<long double, long double> &a, const pair<long double, long double> &o, const pair<long double, long double> &b) { return pair<pair<long double, long double>, pair<long double, long double> >( o, rotate(b, o, angle(a, o, b) / 2)); } inline pair<long double, long double> intersection_line_line( const pair<pair<long double, long double>, pair<long double, long double> > &u, const pair<pair<long double, long double>, pair<long double, long double> > &v) { long double p = cp(u.second - v.first, u.second - u.first); long double q = cp(v.second - v.first, u.second - u.first); if (is_zero(q)) return FAIL; return v.first + (v.second - v.first) * (p / q); } const pair<pair<long double, long double>, long double> CFAIL = pair<pair<long double, long double>, long double>(FAIL, 0); pair<pair<long double, long double>, long double> incircle( const pair<long double, long double> &a, const pair<long double, long double> &b, const pair<long double, long double> &c) { if (is_zero(cp(b - a, c - a))) return CFAIL; pair<pair<long double, long double>, pair<long double, long double> > p = segment_bisector( pair<pair<long double, long double>, pair<long double, long double> >( a, b)); pair<pair<long double, long double>, pair<long double, long double> > q = segment_bisector( pair<pair<long double, long double>, pair<long double, long double> >( a, c)); pair<long double, long double> t = intersection_line_line(p, q); return pair<pair<long double, long double>, long double>(t, pieprzu(t, a)); } pair<long double, long double> intersection_segment_segment( const pair<pair<long double, long double>, pair<long double, long double> > &u, const pair<pair<long double, long double>, pair<long double, long double> > &v) { pair<long double, long double> r = intersection_line_line(u, v); if (on_segment(r, u) and on_segment(r, v)) return r; else return FAIL; } int main() { int N, X, Y; scanf( %d %d %d , &N, &X, &Y); vector<pair<long double, long double> > P; int max_a = 0; int max_b = 0; for (int(i) = (1); (i) <= (N); (i)++) { int a, b; scanf( %d %d , &a, &b); max_a = max(max_a, a); max_b = max(max_b, b); P.emplace_back(a, b); } P.emplace_back(max_a, 0); P.emplace_back(0, max_b); P = convex_hull(P); pair<long double, long double> n(X, Y); pair<long double, long double> z; for (int(i) = (1); (i) <= (1500000); (i)++) { if (X * i > 1490490 or Y * i > 1490010) { z = pair<long double, long double>(X * i, Y * i); break; } } pair<pair<long double, long double>, pair<long double, long double> > s( pair<long double, long double>(0, 0), z); long double result = INF; for (int(i) = (0); (i) < (int(P.size())); (i)++) { pair<long double, long double> a = P[i]; pair<long double, long double> b = P[(i + 1) % int(P.size())]; pair<pair<long double, long double>, pair<long double, long double> > t(a, b); pair<long double, long double> d = intersection_segment_segment(s, t); if (d == FAIL) continue; result = min(result, pieprzu(pair<long double, long double>(X, Y), pair<long double, long double>(0, 0)) / pieprzu(d, pair<long double, long double>(0, 0))); } cout << fixed << result << endl; return 0; } |
#include <bits/stdc++.h> inline int Get() { char ch; while ((ch = getchar()) < 0 || ch > 9 ) ; int Num = ch - 0 ; while ((ch = getchar()) >= 0 && ch <= 9 ) Num = (Num << 3) + (Num << 1) + ch - 0 ; return Num; } const int M = 3e3 + 5; const int m = 3000; int n, a[M][M], s[M][M], r[M][M], d[M][M]; int main() { n = Get(); for (int i = 1; i <= n; ++i) { int x0 = Get(), y0 = Get(), x1 = Get(), y1 = Get(); for (int x = x0 + 1; x <= x1; ++x) for (int y = y0 + 1; y <= y1; ++y) a[x][y] = i; } for (int i = 1; i <= m; ++i) for (int j = 1; j <= m; ++j) s[i][j] = (!a[i][j]) + s[i][j - 1] + s[i - 1][j] - s[i - 1][j - 1]; for (int i = m; ~i; --i) for (int j = m; ~j; --j) { r[i][j] = a[i][j + 1] == a[i + 1][j + 1] ? 0 : r[i][j + 1] + 1; d[i][j] = a[i + 1][j] == a[i + 1][j + 1] ? 0 : d[i + 1][j] + 1; } for (int i = 0; i < m; ++i) for (int j = 0; j < m; ++j) for (int k = 1; k <= r[i][j] && k <= d[i][j] && !(s[i + k][j + k] - s[i][j + k] - s[i + k][j] + s[i][j]); ++k) if (k <= r[i + k][j] && k <= d[i][j + k]) { std ::vector<int> ans; for (int x = i + 1; x <= i + k; ++x) for (int y = j + 1; y <= j + k; ++y) ans.push_back(a[x][y]); std ::sort(ans.begin(), ans.end()), ans.erase(std ::unique(ans.begin(), ans.end()), ans.end()); printf( YES %d n , ans.size()); for (int k = 0, sze = ans.size(); k < sze; ++k) printf( %d , ans[k]); putchar( n ); return 0; } puts( NO ); return 0; } |
#include <bits/stdc++.h> using namespace std; const double EPS = 1e-8; int t1, t2, x1, x2, t0; int main() { scanf( %d %d %d %d %d , &t1, &t2, &x1, &x2, &t0); long long k1 = t0 - t1, k2 = t2 - t0; if (k1 == 0) { printf( %d %d n , x1, t1 == t2 ? x2 : 0); } else if (k2 == 0) { printf( %d %d n , t1 == t2 ? x1 : 0, x2); } else { int y1 = 0, y2 = 0; long long t; double tt = 1e100; for (int i = 0; i <= x1; i++) { t = ((k1 * 1.0 / k2) * i); if ((k1 * 1.0 / k2) * i - t > EPS) t++; if (i == 0) t = x2; if (t > x2) continue; double tmp = (((long long)(t1)*i + (long long)(t2)*t) * 1.0) / (i + t + 0.0); if (tmp - tt < 0) { y1 = i; y2 = t; tt = tmp; } else if (abs(tmp - tt) <= EPS) { if (i + t > y1 + y2) { y1 = i; y2 = t; } } } printf( %d %d n , y1, y2); } return 0; } |
#include <bits/stdc++.h> using namespace std; void __print(int x) { cerr << x; } void __print(long x) { cerr << x; } void __print(long long x) { cerr << x; } void __print(unsigned x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __print(float x) { cerr << x; } void __print(double x) { cerr << x; } void __print(long double x) { cerr << x; } void __print(char x) { cerr << << x << ; } void __print(const char *x) { cerr << << x << ; } void __print(const string &x) { cerr << << x << ; } void __print(bool x) { cerr << (x ? true : false ); } template <typename T, typename V> void __print(const pair<T, V> &x) { cerr << { ; __print(x.first); cerr << , ; __print(x.second); cerr << } ; } template <typename T> void __print(const T &x) { int f = 0; cerr << { ; for (auto &i : x) cerr << (f++ ? , : ), __print(i); cerr << } ; } void _print() { cerr << ] n ; } template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << , ; _print(v...); } long long int power(long long int x, long long int y) { long long int res = 1; x = x; while (y > 0) { if (y & 1) res = (res * x); y = y >> 1; x = (x * x); } return res; } long long int power(long long int x, long long int y, long long int p) { long long int res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } long long int gcd(long long int a, long long int b) { if (a == 0) return b; return gcd(b % a, a); } void solve() { long long int n; cin >> n; vector<string> v; while (n--) { string s; cin >> s; if (s == pwd ) { cout << / ; for (int i = 0; i < v.size(); i++) { cout << v[i] << / ; } cout << endl; } else { string s; cin >> s; vector<string> temp; string te; if (s[0] == / ) v.clear(); for (int i = 0; i < s.length(); i++) { if (s[i] != / ) te.push_back(s[i]); else { if (i != 0) { temp.push_back(te); te.clear(); } } } temp.push_back(te); ; for (int i = 0; i < temp.size(); i++) { if (temp[i] == .. ) { v.pop_back(); } else v.push_back(temp[i]); } } } } int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); long long int t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n1, n2, i, j, n, ma = 0, temp, c; cin >> n1 >> n2; if (n1 < n2) { cout << 2 ; } else { cout << n1; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); unsigned long long int n, ans, i, j, k; cin >> n; if (n == 0) { cout << 1 << endl; return 0; } ans = 2 * n * n; ans = ans + ((n + 2) * (n + 1)) - 1; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> adj[200001]; int dis[200001]; int par[200001]; void addEdge(int u, int v) { adj[u].push_back(v); adj[v].push_back(u); } void dfs(int src, int parent, int dist) { dis[src] = dist; par[src] = parent; for (int child : adj[src]) { if (child != parent) { dfs(child, src, dist + 1); } } } int solve() { int n; cin >> n; int u, v; for (int i = 0; i < n - 1; i++) { cin >> u >> v; addEdge(u, v); } dfs(1, 0, 0); set<pair<int, int> > st; for (int i = 1; i <= n; i++) { if (dis[i] > 2) { st.insert({-dis[i], i}); } } int ans = 0; while (!st.empty()) { int rmv = (*st.begin()).second; st.erase(st.begin()); rmv = par[rmv]; auto itr = st.find({-dis[rmv], rmv}); if (itr != st.end()) st.erase(itr); for (int c : adj[rmv]) { if (dis[c] > 2) { itr = st.find({-dis[c], c}); if (itr != st.end()) st.erase(itr); } } ans++; } return ans; } int main() { cout << solve() << n ; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 3e3 + 10; vector<int> occ[maxn]; int dp[maxn][maxn], a[maxn]; void solve() { int n; cin >> n; int ptr = 0; for (int i = 1; i <= n; i++) { cin >> a[++ptr]; if (ptr > 1 and a[ptr] == a[ptr - 1]) ptr--; } n = ptr; for (int i = 1; i <= n; i++) occ[a[i]].push_back(i); for (int len = 1; len <= n; len++) { for (int l = 1; l + len - 1 <= n; l++) { int r = l + len - 1; if (len == 1) { dp[l][r] = 0; continue; } dp[l][r] = max(dp[l][r - 1], dp[l + 1][r]); if (a[l] == a[r]) dp[l][r] = max(dp[l][r - 1], dp[l + 1][r]) + 1; for (auto m : occ[a[l]]) if (l < m and m < r) dp[l][r] = max(dp[l][r], dp[l][m] + dp[m][r]); for (auto m : occ[a[r]]) if (l < m and m < r) dp[l][r] = max(dp[l][r], dp[l][m] + dp[m][r]); } } cout << n - 1 - dp[1][n] << n ; for (int i = 1; i <= n; i++) occ[a[i]].clear(); for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) dp[i][j] = 0; } int main() { ios_base::sync_with_stdio(false); int tc = 1; cin >> tc; while (tc--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; int solve(int A, int B) { int count = 0; for (int i = 0; i < 32; i++) { if (((A >> i) & 1) != ((B >> i) & 1)) { count++; } } return count; } int main() { int n, m, k; cin >> n >> m >> k; std::vector<int> arr(m + 1); for (size_t i = 0; i < m + 1; i++) { cin >> arr[i]; } int count = 0; for (size_t i = 0; i < m; i++) { int ans; ans = solve(arr[i], arr[m]); if (ans <= k) { count++; } } std::cout << count << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int a[2001]; int main() { int n, b, s = 0, m, s1, i; scanf( %d%d , &n, &b); for (i = 0; i < n; i++) scanf( %d , &a[i]); for (i = 0; i < n; i++) { if (i == n - 1) s1 = b; else { m = *max_element(a + i, a + n); s1 = (b / a[i]) * m + b % a[i]; } if (s1 > s) s = s1; } printf( %d , s); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, i, j, sum, min = 1000000000; cin >> n; int k[n]; for (i = 0; i < n; i++) cin >> k[i]; for (i = 0; i < n; i++) { sum = 0; int m[k[i]]; for (j = 0; j < k[i]; j++) { cin >> m[j]; sum = sum + 5 * m[j] + 15; } if (sum < min) min = sum; } cout << min; } |
#include <bits/stdc++.h> using namespace std; int n; void work(int n) { map<int, int> v; int ans = 0; for (int i = 0; i <= n; i++) { for (int j = 0; j <= n; j++) { for (int k = 0; k <= n; k++) { for (int x = 0; x <= n; x++) { if (i + j + k + x == n) { int tot = i + j * 5 + k * 10 + x * 50; if (v[tot]) continue; v[tot] = 1; ans++; } } } } } cout << ans << n ; } int main() { scanf( %d , &n); if (n <= 20) work(n); else cout << 1LL * 733 + 1LL * 49 * (n - 20); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, k; cin >> n >> k; if (k >= 2 * n) { cout << 0; return 0; } long long q = k / 2, z; if (k <= n) z = k - 1; else z = n; if (k & 1) { long long ans = min(q - 1, z - q - 1); ans++; cout << ans; } else { cout << min(q - 1, z - q); } } |
#include <bits/stdc++.h> using namespace std; int u, v; const int maxn = 5e3 + 10; vector<long long> G[maxn]; bool visited[maxn]; long long dp[maxn]; vector<long long> vc[maxn]; bool mark[maxn]; long long n; vector<long long> ans; void dfs(int x) { visited[x] = 1; for (int i = 0; i != G[x].size(); i++) { if (visited[G[x][i]] == 0) { dfs(G[x][i]); dp[x] += 1 + dp[G[x][i]]; } } } void main_dfs(int x) { visited[x] = 1; memset(mark, 0, sizeof(mark)); for (int i = 0; i < G[x].size(); i++) { if (visited[G[x][i]] == 0) { int g = vc[x].size(); for (int j = 0; j < g; j++) { if (vc[x][j] + dp[G[x][i]] + 1 != n - 1 && mark[vc[x][j] + dp[G[x][i]] + 1] == 0) { vc[x].push_back(vc[x][j] + dp[G[x][i]] + 1); mark[vc[x][j] + dp[G[x][i]] + 1] = 1; } } if (dp[G[x][i]] + 1 != n - 1 && mark[dp[G[x][i]] + 1] == 0) { vc[x].push_back(dp[G[x][i]] + 1); mark[dp[G[x][i]] + 1] = 1; } } else { int g = vc[x].size(); for (int j = 0; j < g; j++) { if (mark[vc[x][j] + n - 1 - dp[x]] == 0) if (vc[x][j] + n - 1 - dp[x] != 0 && vc[x][j] + n - 1 - dp[x] != n - 1) { vc[x].push_back(vc[x][j] + n - dp[x] - 1); mark[vc[x][j] + n - dp[x] - 1] = 1; } } if (mark[n - dp[x] - 1] == 0) if (n - dp[x] - 1 != 0 && n - dp[x] - 1 != n - 1) { vc[x].push_back(n - dp[x] - 1); mark[n - dp[x] - 1] = 1; } } } for (int i = 0; i != G[x].size(); i++) { if (visited[G[x][i]] == 0) main_dfs(G[x][i]); } } bool mk[maxn]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n; for (int i = 0; i != n - 1; i++) { cin >> u >> v; G[u].push_back(v); G[v].push_back(u); } dfs(1); fill(visited, visited + maxn, 0); main_dfs(1); for (int i = 1; i != n + 1; i++) { for (int j = 0; j != vc[i].size(); j++) { if (find(ans.begin(), ans.end(), vc[i][j]) == ans.end()) { ans.push_back(vc[i][j]); if (n - 1 - vc[i][j] != vc[i][j]) ans.push_back(n - 1 - vc[i][j]); } } } sort(ans.begin(), ans.end()); cout << ans.size() << endl; for (int i = 0; i != ans.size(); i++) { cout << ans[i] << << n - 1 - ans[i] << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { int t, n, m, x, y, cost, i, j; string s; cin >> t; while (t--) { cost = 0; cin >> n >> m >> x >> y; y = min(y, 2 * x); for (i = 0; i < n; i++) { cin >> s; for (j = 0; j < m; j++) { if (s[j] == . ) { if (j + 1 < m && s[j + 1] == . ) cost += y, j++; else cost += x; } } } cout << cost << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { long long test; cin >> test; while (test--) { long long b, p, f, h, c; cin >> b >> p >> f >> h >> c; long long profit = 0; if (h > c) { if (b - 2 * p >= 0) { profit += p * h; b = b - 2 * p; if (b - 2 * f >= 0) { profit += f * c; } else { profit += c * (b / 2); } } else { profit += h * (b / 2); } } else { if (b - 2 * f >= 0) { profit += f * c; b = b - 2 * f; if (b - 2 * p >= 0) { profit += p * h; } else { profit += h * (b / 2); } } else { profit += c * (b / 2); } } cout << profit << n ; } } |
#include <bits/stdc++.h> int n, m; long long k; long long pow(int n) { if (n == 0) return 1; long long tmp = pow(n >> 1); tmp = tmp * tmp % 1000000009ll; if (n & 1) tmp = tmp * 2ll % 1000000009ll; return tmp; } int main() { scanf( %d%d%I64d , &n, &m, &k); int t = n - m; long long ans = 0; if (m == 0) { puts( 0 ); return 0; } if (n - t * k < k) { ans = m; } else { int num = (n - t * k) / k; ans = (pow(num + 1) - 2 + 1000000009ll) * k % 1000000009ll; ans = (ans + (n - t * k) % k) % 1000000009ll; ans = (ans + t * (k - 1)) % 1000000009ll; } printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x7f7f7f7f; char s[1005]; int dp[1005][2]; int main() { int n; scanf( %d , &n); scanf( %s , s); if (1 == n) { puts( 0 ); return 0; } memset(dp, 0x7f, sizeof(dp)); dp[0][s[0] - 0 ] = 0; dp[0][(s[0] - 0 ) ^ 1] = 1; for (int i = 1; i < n; ++i) { if (s[i] == 1 ) { dp[i][1] = dp[i - 1][0]; dp[i][0] = dp[i - 1][1] + 1; } else { dp[i][0] = dp[i - 1][1]; dp[i][1] = dp[i - 1][0] + 1; } } int ans = min(dp[n - 1][0], dp[n - 1][1]); if (ans >= INF) ans = -1; printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<vector<pair<int, int> > > AdjList; priority_queue<pair<int, pair<int, int> > > Edgelist; int n, j, k, m, l, t, i; string s, ss; int a[1050][1050]; int main() { cin >> n; for (i = 0; i < n; i++) { for (j = 0; j < n; j++) { scanf( %d , &a[i][j]); } } for (i = 0; i < n; i++) { t += a[i][i] * a[i][i]; } scanf( %d , &k); while (k--) { scanf( %d , &n); if (n == 3) { printf( %d , t % 2); } else { scanf( %d , &m); t++; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int a[100000 + 5], nxt[100000 + 5], lst[100000 + 5], fi[100000 + 5]; int cnt, root[100000 + 5]; struct node { int sum, ls, rs; } t[100000 * 43 + 5]; int build(int l, int r) { int id = ++cnt; if (l == r) { t[id].sum = fi[l]; return id; } int mid = (l + r) >> 1; t[id].ls = build(l, mid); t[id].rs = build(mid + 1, r); t[id].sum = t[t[id].ls].sum + t[t[id].rs].sum; return id; } void upd(int l, int r, int &x, int y, int p, int v) { t[x = ++cnt] = t[y]; if (l == r) { t[x].sum = v; return; } int mid = (l + r) >> 1; if (p <= mid) upd(l, mid, t[x].ls, t[y].ls, p, v); else upd(mid + 1, r, t[x].rs, t[y].rs, p, v); t[x].sum = t[t[x].ls].sum + t[t[x].rs].sum; } int bs(int l, int r, int x, int v) { if (v >= t[x].sum) return r + 1; if (l == r) return l; int mid = (l + r) >> 1; if (t[t[x].ls].sum <= v) return bs(mid + 1, r, t[x].rs, v - t[t[x].ls].sum); else return bs(l, mid, t[x].ls, v); } int ans[100000 + 5]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= n; i++) fi[i] = 1; for (int i = n; i >= 1; i--) nxt[i] = lst[a[i]], lst[a[i]] = i, fi[nxt[i]] = 0; root[1] = build(1, n); for (int i = 1; i <= n - 1; i++) { int tmp = 0; upd(1, n, tmp, root[i], i, 0); if (nxt[i]) upd(1, n, root[i + 1], tmp, nxt[i], 1); else root[i + 1] = tmp; } for (int k = 1; k <= n; k++) { int now = 1; while (now <= n) { ans[k]++; now = bs(1, n, root[now], k); } } for (int i = 1; i <= n; i++) printf( %d%c , ans[i], n [i == n]); return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3fll; mt19937 rng((int)chrono::steady_clock::now().time_since_epoch().count()); struct kuhn { int n, m; vector<vector<int>> g; vector<int> vis, ma, mb; kuhn(int n_, int m_) : n(n_), m(m_), g(n), vis(n + m), ma(n, -1), mb(m, -1) {} void add(int a, int b) { g[a].push_back(b); } bool dfs(int i) { vis[i] = 1; for (int j : g[i]) if (!vis[n + j]) { vis[n + j] = 1; if (mb[j] == -1 or dfs(mb[j])) { ma[i] = j, mb[j] = i; return true; } } return false; } int matching() { int ret = 0, aum = 1; for (auto& i : g) shuffle(i.begin(), i.end(), rng); while (aum) { for (int j = 0; j < m; j++) vis[n + j] = 0; aum = 0; for (int i = 0; i < n; i++) if (ma[i] == -1 and dfs(i)) ret++, aum = 1; } return ret; } }; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; vector<string> v(n); for (auto& i : v) cin >> i; vector<string> v2; kuhn k((n - 1) * m, (m - 1) * n); int vert = 0, qt = 0; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) if (v[i][j] == # ) { qt++; if (i + 1 < n and v[i + 1][j] == # ) { vert++; if (j + 1 < m and v[i][j + 1] == # ) k.add(m * i + j, n * j + i); if (j + 1 < m and v[i + 1][j + 1] == # ) k.add(m * i + j, n * j + i + 1); if (j and v[i][j - 1] == # ) k.add(m * i + j, n * (j - 1) + i); if (j and v[i + 1][j - 1] == # ) k.add(m * i + j, n * (j - 1) + i + 1); } if (j + 1 < m and v[i][j + 1] == # ) vert++; } cout << qt - (vert - k.matching()) << n ; exit(0); } |
#include <bits/stdc++.h> const int mo = 998244353, N = 2005; int n, a[N][N], ia[N][N], i, j, f[N][N], bi[N], mi[N], fac[N], ans; inline void add(int x, int v = 1) { for (; x <= n; x += x & -x) bi[x] += v; } inline int ask(int x) { int ans = 0; for (; x; x -= x & -x) ans += bi[x]; return ans; } int main() { for (i = *fac = 1; i < N; ++i) fac[i] = 1ll * fac[i - 1] * i % mo; scanf( %d , &n); for (i = 1; i <= n; ++i) for (j = 1; j <= n; ++j) scanf( %d , a[i] + j); f[0][0] = 1; for (i = 1; i <= n; ++i) for (f[i][0] = fac[i], j = 1; j <= i; ++j) f[i][j] = (1ll * f[i - 1][j - 1] * (i - j) + (j > 1 ? 1ll * f[i - 1][j - 2] * (j - 1) : 0)) % mo; for (i = *mi = 1; i <= n; ++i) mi[i] = 1ll * mi[i - 1] * f[n][n] % mo; for (i = n; i; --i) ans = (ans + 1ll * fac[n - i] * ask(a[1][i])) % mo, add(a[1][i]); ans = 1ll * ans * mi[n - 1] % mo; for (i = 1; i <= n; ++i) for (j = 1; j <= n; ++j) ia[i][a[i][j]] = j; for (i = 2; i <= n; ++i) { int tot = 0; int cnt = 0; memset(bi + 1, 0, n << 2); for (j = n; j; --j) { if (ia[i - 1][a[i][j]] > j) add(a[i][j]), ++cnt; if (cnt) { int w = ask(a[i][j] - 1); tot = (tot + 1ll * w * f[n - j][cnt - 1]) % mo; } if (ia[i][a[i - 1][j]] > j) add(a[i - 1][j]), ++cnt; } cnt = 0; memset(bi + 1, 0, n << 2); for (j = n; j; --j) { if (ia[i][a[i - 1][j]] > j) add(a[i - 1][j], -1); int w = ask(a[i][j] - 1); if (ia[i - 1][a[i][j]] > j) ++cnt; tot = (tot + 1ll * w * f[n - j][cnt]) % mo; if (ia[i - 1][a[i][j]] < j) add(a[i][j]); if (ia[i][a[i - 1][j]] > j) ++cnt; } ans = (ans + 1ll * tot * mi[n - i]) % mo; } printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; 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...); } const int N = 2e5 + 10; const int INF = 1e8; int n; vector<int> g[N]; vector<int> BFS(vector<int> v, int src) { vector<int> dist = vector<int>(n, INF); queue<int> q; q.push(src); dist[src] = 0; while (!q.empty()) { int u = q.front(); q.pop(); for (auto v : g[u]) if (dist[v] == INF) { dist[v] = dist[u] + 1; q.push(v); } } return dist; } int main() { ios::sync_with_stdio(0); int i, j, k, m; cin >> n >> m >> k; vector<int> a(k); for (i = 0; i < k; ++i) { cin >> a[i]; a[i]--; } for (i = 0; i < m; ++i) { int u, v; cin >> u >> v; u--, v--; g[u].push_back(v); g[v].push_back(u); } vector<int> d1 = BFS(a, 0); vector<int> d2 = BFS(a, n - 1); vector<int> b = {0}; vector<int> D3 = BFS(b, n - 1); int d3 = D3[0]; sort(a.begin(), a.end(), [&](int x, int y) { return d1[x] - d2[x] < d1[y] - d2[y]; }); vector<int> suf(k); suf[k - 1] = d2[a[k - 1]]; for (i = k - 2; i >= 0; --i) suf[i] = max(suf[i + 1], d2[a[i]]); int mx = 0; for (i = 0; i < k - 1; ++i) mx = max(d1[a[i]] + suf[i + 1] + 1, mx); cout << min(d3, mx) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int get(char *s) { if (s[0] == 8 && s[1] == < ) return 1; if (s[0] == [ && s[1] == ] ) return 2; if (s[0] == ( && s[1] == ) ) return 3; } int check(int a, int b) { if (a == 1 && b == 2 || a == 2 && b == 3 || a == 3 && b == 1) return 1; if (a == 2 && b == 1 || a == 3 && b == 2 || a == 1 && b == 3) return 2; return 0; } int main() { char a[100] = {0}, b[100] = {0}; scanf( %s , a); scanf( %s , b); int x = 0, y = 0; for (int i = 0; i < strlen(a); i += 2) { int t = check(get(a + i), get(b + i)); if (t == 1) x++; if (t == 2) y++; } if (x == y) printf( TIE ); else if (x < y) printf( TEAM 2 WINS ); else printf( TEAM 1 WINS ); } |
#include <bits/stdc++.h> using namespace std; int main() { long long int nn, i, j, k; cin >> nn; long long int a[nn]; for (i = 0; i < nn; i++) cin >> a[i]; sort(a, a + nn); for (i = 0; i < nn; i++) { for (j = i + 1; j < nn; j++) { if (a[i] != -1 && a[j] != -1 && a[j] % a[i] == 0) a[j] = -1; } } long long int sum = 0; for (i = 0; i < nn; i++) { if (a[i] != -1) sum++; } cout << sum; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100005; long long ara[N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long n; cin >> n; long long mx = 0; for (long long i = 0; i < n; ++i) { cin >> ara[i]; while (ara[i] % 2 == 0) ara[i] /= 2; while (ara[i] % 3 == 0) ara[i] /= 3; } for (long long i = 1; i < n; ++i) { if (ara[i] != ara[0]) return cout << No , 0; } cout << Yes ; } |
#include <bits/stdc++.h> using namespace std; const long long int N = 100005; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); { long long int i, j, k, n, m, ans = 0, cnt = 0, sum = 0; cin >> n; vector<long long int> v; cout << n << ; i = n - 1; while (i > 0) { if (n % i == 0) { cout << i << ; n = i; i = n - 1; } else { i--; } } } } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; int i; int a[n]; int even = 0, odd = 0; for (i = 0; i < n; i++) { cin >> a[i]; if (a[i] % 2 == 0) even++; else odd++; } if (even % 2 == 0 && odd % 2 == 0) { cout << YES << endl; continue; } sort(a, a + n, less<int>()); for (i = 1; i < n; i++) { int k = 1; while (a[i - k] == 0 && (i - k) > 0) { k++; } if (a[i] - a[i - k] == 1) { a[i] = 0; a[i - k] = 0; even--; odd--; if (even % 2 == 0 && odd % 2 == 0) { cout << YES << endl; break; } } } if (i == n) cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long arr[100005]; long long ans = 0; long long temp[100005]; bool is(int m, string s) { set<char> ss; map<char, int> mp; for (int i = 0; i < m; i++) { ss.insert(s[i]); mp[s[i]]++; } if (ss.size() == ans) return true; for (int i = 0; i <= s.length() - m - 1; i++) { mp[s[i]]--; if (mp[s[i]] == 0) ss.erase(s[i]); ss.insert(s[i + m]); mp[s[i + m]]++; if (ss.size() == ans) { return true; } } return false; } int main() { int n; string s; cin >> n >> s; set<char> se; for (char c : s) se.insert(c); ans = se.size(); int l = 0; int r = n + 1; while (r - l > 1) { int m = l + (r - l) / 2; if (!is(m, s)) l = m; else r = m; } cout << r << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2005; const int MOD = 1000000007; int d, n; int a[N]; int ord[N], rnk[N]; vector<int> v[N]; inline bool cmp(int x, int y) { return a[x] > a[y]; } int ans = 0; int sz[N]; inline void dfs(int x, int top) { sz[x] = 1; for (int i = 0; i < v[x].size(); i++) { int next = v[x][i]; if (sz[next] || rnk[next] < rnk[top] || a[top] - a[next] > d) continue; dfs(next, top); sz[x] = (long long)sz[x] * (sz[next] + 1) % MOD; } } int main() { scanf( %d%d , &d, &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]), ord[i] = i; sort(ord + 1, ord + n + 1, cmp); for (int i = 1; i <= n; i++) rnk[ord[i]] = i; for (int i = 1; i < n; i++) { int x, y; scanf( %d%d , &x, &y); v[x].push_back(y); v[y].push_back(x); } for (int i = 1; i <= n; i++) { memset(sz, 0, sizeof(sz)); dfs(ord[i], ord[i]); ans = (ans + sz[ord[i]]) % MOD; } 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 <typename 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 T, class T1> inline void gn(T &first, T1 &second) { gn(first); gn(second); } template <class T, class T1, class T2> inline void gn(T &first, T1 &second, T2 &z) { gn(first); gn(second); gn(z); } template <typename 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 <typename T> inline void println(T first) { print(first), putchar( n ); } template <typename T> inline void printsp(T first) { print(first), putchar( ); } template <class T, class T1> inline void print(T first, T1 second) { printsp(first), println(second); } template <class T, class T1, class T2> inline void print(T first, T1 second, T2 z) { printsp(first), printsp(second), println(z); } 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; } pair<int, int> p[50010]; int f[50010]; void go(int first) { printf( ? %d n , first); fflush(stdout); gn(p[first].first, p[first].second); } void end(int first) { printf( ! %d n , first); exit(0); } int main() { int n, id, first; gn(n, id, first); for (int i = 1; i <= n; i++) f[i] = i; srand(time(0)); random_shuffle(f + 1, f + n + 1); go(id); if (p[id].first >= first) end(p[id].first); int N = min(n, 1000); for (int i = 1; i <= N; i++) { go(f[i]); int u = p[f[i]].first; if (u < first && u > p[id].first) id = f[i]; } while (1) { if (!p[id].second) go(id); if (p[id].first >= first) end(p[id].first); if (p[id].second == -1) end(-1); id = p[id].second; } } |
#include <bits/stdc++.h> using namespace std; const int N = 1005; vector<pair<int, int>> g[N], ans[N]; long long dist[N]; priority_queue<pair<int, int>> pq; bool vis[N]; void dijkstra(int s) { fill(dist, dist + N, 1LL << 61); memset(vis, false, sizeof(vis)); dist[s] = 0; pq.push({0, s}); while (!pq.empty()) { int u = pq.top().second; pq.pop(); if (vis[u]) continue; vis[u] = true; for (int i = 0; i < g[u].size(); i++) { int v = g[u][i].first, w = g[u][i].second; if (dist[v] > dist[u] + w) { dist[v] = dist[u] + w; pq.push({-dist[v], v}); } } } } int main() { int n, m; cin >> n >> m; int x, y; cin >> x >> y; for (int i = 0; i < m; i++) { int u, v, w; cin >> u >> v >> w; g[u].push_back({v, w}); g[v].push_back({u, w}); } for (int i = 1; i <= n; i++) { long long ti, ci; cin >> ti >> ci; dijkstra(i); for (int j = 1; j <= n; j++) { if (dist[j] <= ti) { ans[i].push_back({j, ci}); } } } for (int i = 1; i <= n; i++) { g[i] = ans[i]; } dijkstra(x); if (dist[y] == 1LL << 61) cout << -1; else cout << dist[y]; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long inf = (long long)1e18; const long long mod = (long long)1e9 + 7; const double eps = (double)1e-9; const double pi = acos(-1.0); const int dx[] = {0, 0, 1, 0, -1}; const int dy[] = {0, 1, 0, -1, 0}; const int N = 300500; int n, l[N], r[N], a[N], ans, c; int main() { cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false); int T; cin >> T; while (T--) { cin >> n; for (int i = 1; i <= n; ++i) l[i] = 0, r[i] = n; for (int i = 1; i <= n; ++i) { cin >> a[i]; if (l[a[i]] == 0) l[a[i]] = i; r[a[i]] = i; } sort(a + 1, a + n + 1); ans = 1, c = 0; int m = 1; for (int i = 2; i <= n; ++i) { if (a[i] == a[i - 1]) continue; m++; if (r[a[i - 1]] < l[a[i]]) c++; else c = 0; ans = max(ans, c + 1); } cout << m - ans << endl; } return 0; } |
#include <bits/stdc++.h> template <typename T> class IntegerIterator { public: using value_type = T; using difference_type = std::ptrdiff_t; using pointer = T*; using reference = T; using iterator_category = std::input_iterator_tag; explicit IntegerIterator(T value) : value(value) {} IntegerIterator& operator++() { ++value; return *this; } IntegerIterator operator++(int) { IntegerIterator copy = *this; ++value; return copy; } IntegerIterator& operator--() { --value; return *this; } IntegerIterator operator--(int) { IntegerIterator copy = *this; --value; return copy; } T operator*() const { return value; } bool operator==(IntegerIterator rhs) const { return value == rhs.value; } bool operator!=(IntegerIterator rhs) const { return !(*this == rhs); } private: T value; }; template <typename T> class IntegerRange { public: IntegerRange(T begin, T end) : begin_(begin), end_(end) { ; } IntegerIterator<T> begin() const { return IntegerIterator<T>(begin_); } IntegerIterator<T> end() const { return IntegerIterator<T>(end_); } private: T begin_; T end_; }; template <typename T> class ReversedIntegerRange { using IteratorType = std::reverse_iterator<IntegerIterator<T>>; public: ReversedIntegerRange(T begin, T end) : begin_(begin), end_(end) { ; } IteratorType begin() const { return IteratorType(IntegerIterator<T>(begin_)); } IteratorType end() const { return IteratorType(IntegerIterator<T>(end_)); } private: T begin_; T end_; }; template <typename T> IntegerRange<T> range(T to) { return IntegerRange<T>(0, to); } template <typename T> IntegerRange<T> range(T from, T to) { return IntegerRange<T>(from, to); } template <typename T> IntegerRange<T> inclusiveRange(T to) { return IntegerRange<T>(0, to + 1); } template <typename T> IntegerRange<T> inclusiveRange(T from, T to) { return IntegerRange<T>(from, to + 1); } template <typename T> ReversedIntegerRange<T> downrange(T from) { return ReversedIntegerRange<T>(from, 0); } template <typename T> ReversedIntegerRange<T> downrange(T from, T to) { return ReversedIntegerRange<T>(from, to); } template <typename T> ReversedIntegerRange<T> inclusiveDownrange(T from) { return ReversedIntegerRange<T>(from + 1, 0); } template <typename T> ReversedIntegerRange<T> inclusiveDownrange(T from, T to) { return ReversedIntegerRange<T>(from + 1, to); } namespace impl { using Random = std::mt19937; } inline impl::Random& randomEngine() { static std::random_device device; static impl::Random engine(device()); return engine; } inline int randomInteger() { std::uniform_int_distribution<int> d; return d(randomEngine()); } inline int randomInteger(int to) { ; std::uniform_int_distribution<int> d(0, to - 1); return d(randomEngine()); } inline int randomInteger(int from, int to) { return from + randomInteger(to - from); } using int64 = int64_t; using std::endl; using std::make_pair; using std::map; using std::max; using std::min; using std::pair; using std::set; using std::sort; using std::string; using std::swap; using std::unique; using std::vector; class AShuffleHashing { public: static void solveSlow(std::stringstream& in, std::ostream& out) {} static constexpr int kStressIterations = 0; static void generateTest(std::ostringstream& in, std::ostringstream& ___) { auto _____ = std::stringstream(in.str()); solveSlow(_____, ___); } static void solve(std::istream& in, std::ostream& out) { auto solve = [](string p, string h) -> bool { if (h.size() < p.size()) return false; sort(p.begin(), p.end()); for (int start : range(h.size() - p.size() + 1)) { string h_s = ; for (int i : range<int>(start, start + p.size())) { assert(i >= 0 && i < h.size()); h_s.push_back(h[i]); } sort(h_s.begin(), h_s.end()); if (p == h_s) return true; } return false; }; int tests; in >> tests; for (int test : range(tests)) { string p, h; in >> p >> h; out << (solve(p, h) ? YES : NO ) << endl; } } }; int main() { std::ios_base::sync_with_stdio(false); AShuffleHashing solver; std::istream& in(std::cin); std::ostream& out(std::cout); in.tie(nullptr); solver.solve(in, out); return 0; } |
#include <bits/stdc++.h> using namespace std; const int G = 3; const int MOD = 998244353; const int N = (1 << 15) + 5; int rev[N], w[N], inv_n; int bigMod(int a, int e, int mod) { if (e == -1) e = mod - 2; int ret = 1; while (e) { if (e & 1) ret = (long long)ret * a % mod; a = (long long)a * a % mod; e >>= 1; } return ret; } void prepare(int &n) { int sz = abs(31 - __builtin_clz(n)); int r = bigMod(G, (MOD - 1) / n, MOD); inv_n = bigMod(n, MOD - 2, MOD), w[0] = w[n] = 1; for (int i = 1; i < n; ++i) w[i] = (long long)w[i - 1] * r % MOD; for (int i = 1; i < n; ++i) rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (sz - 1)); } void ntt(int *a, int n, int dir) { for (int i = 1; i < n - 1; ++i) { if (i < rev[i]) swap(a[i], a[rev[i]]); } for (int m = 2; m <= n; m <<= 1) { for (int i = 0; i < n; i += m) { for (int j = 0; j < (m >> 1); ++j) { int &u = a[i + j], &v = a[i + j + (m >> 1)]; int t = (long long)v * w[dir ? n - n / m * j : n / m * j] % MOD; v = u - t < 0 ? u - t + MOD : u - t; u = u + t >= MOD ? u + t - MOD : u + t; } } } if (dir) for (int i = 0; i < n; ++i) a[i] = (long long)a[i] * inv_n % MOD; } int f_a[N], f_b[N]; vector<long long> multiply(vector<long long> a, vector<long long> b) { int sz = 1, n = a.size(), m = b.size(); while (sz < n + m - 1) sz <<= 1; prepare(sz); for (int i = 0; i < sz; ++i) f_a[i] = i < n ? a[i] : 0; for (int i = 0; i < sz; ++i) f_b[i] = i < m ? b[i] : 0; ntt(f_a, sz, 0); ntt(f_b, sz, 0); for (int i = 0; i < sz; ++i) f_a[i] = (long long)f_a[i] * f_b[i] % MOD; ntt(f_a, sz, 1); return vector<long long>(f_a, f_a + n + m - 1); } int n, k, q; long long a[N], b[N]; vector<long long> get(int lo, int hi) { if (lo == hi) return {b[lo], 1}; int mid = lo + hi >> 1; vector<long long> one = get(lo, mid); vector<long long> two = get(mid + 1, hi); return multiply(one, two); } int main() { cin >> n >> k; for (int i = 1; i <= n; ++i) scanf( %lld , a + i); cin >> q; while (q--) { long long cmd, x, l, r, p; scanf( %lld %lld %lld %lld , &cmd, &x, &l, &r); if (cmd == 1) { for (int i = 1; i <= n; ++i) { b[i] = a[i]; if (i == l) b[i] = r; } } else { scanf( %lld , &p); for (int i = 1; i <= n; ++i) { b[i] = a[i]; if (l <= i and i <= r) b[i] += p; } } for (int i = 1; i <= n; ++i) { b[i] = x - b[i], b[i] %= MOD; if (b[i] < 0) b[i] += MOD; } vector<long long> yo = get(1, n); printf( %lld n , yo[n - k]); } return 0; } |
#include <bits/stdc++.h> using namespace std; int p[100003]; int n; int main() { int i; scanf( %d , &n); if (n == 1) { printf( 1 n ); return 0; } if (n == 2) { printf( -1 n ); return 0; } if (n % 2 != 0) p[n / 2 + 1] = n / 2 + 1; p[1] = 2; p[2] = n; p[n] = n - 1; p[n - 1] = 1; for (i = 3; i < n / 2 + 1; i++) { if (i % 2 != 0) p[i] = p[i - 2] + 2; else p[i] = p[i - 2] - 2; } int coun = 0; if (n % 2 == 0) { for (i = n - 2; i > n / 2; i--) { if (coun % 2 == 0) p[i] = p[i + 2] - 2; else p[i] = p[i + 2] + 2; coun++; } } else { for (i = n - 2; i > n / 2 + 1; i--) { if (coun % 2 == 0) p[i] = p[i + 2] - 2; else p[i] = p[i + 2] + 2; coun++; } } bool fl = true; for (i = 1; i <= n; i++) if (p[p[i]] != n - i + 1) fl = false; if (fl) { printf( %d , p[1]); for (i = 2; i <= n; i++) printf( %d , p[i]); printf( n ); } else printf( -1 n ); return 0; } |
#include <bits/stdc++.h> using namespace std; void use_cio() { ios_base::sync_with_stdio(0); cin.tie(0); } template <typename... Args> void dbg(Args... args) { ((cout << args << ), ...); cout << endl; } int n; int ask(int r1, int c1, int r2, int c2) { string ans; dbg( ? , r1, c1, r2, c2); cout.flush(); cin >> ans; return (ans == YES ); } int main() { cin >> n; string l, r; int sx = 1, sy = 1; while (sx + sy < n + 1) { if (sy + 1 <= n && ask(sx, sy + 1, n, n)) { sy++; l += R ; } else { sx++; l += D ; } } int ex = n, ey = n; while (ex + ey > n + 1) { if (ex && ask(1, 1, ex - 1, ey)) { ex--; r += D ; } else { ey--; r += R ; } } reverse(r.begin(), r.end()); dbg( ! , l + r); } |
#include <bits/stdc++.h> using namespace std; long long dp[15][1 << 15]; int n, m, q; struct NodeLCA { int a, b, c; }; vector<pair<int, int> > path; vector<NodeLCA> LCA; void readData() { cin >> n >> m >> q; for (int i = 0; i < m; i++) { int u, v; cin >> u >> v; u--; v--; path.push_back(make_pair(u, v)); } for (int i = 0; i < q; i++) { int u, v, w; cin >> u >> v >> w; u--; v--; w--; LCA.push_back({u, v, w}); } } int check(int root, int mask1, int child, int mask2) { for (int i = 0; i < path.size(); i++) { if (!(mask1 & (1 << path[i].first)) || !(mask1 & (1 << path[i].second))) continue; if (((mask2 & (1 << path[i].first)) > 0) == ((mask2 & (1 << path[i].second)) > 0)) continue; if (path[i].second == root) swap(path[i].first, path[i].second); if ((path[i].first != root) || (path[i].second != child)) return 0; } for (int i = 0; i < LCA.size(); i++) { if (!(mask1 & (1 << LCA[i].a)) || !(mask1 & (1 << LCA[i].b))) continue; if (((mask2 & (1 << LCA[i].a)) > 0) == ((mask2 & (1 << LCA[i].b)) > 0)) continue; if (LCA[i].c != root) return 0; } return 1; } void dynamicProgramming() { int mask, submask; for (int i = 0; i < n; i++) dp[i][1 << i] = 1; for (mask = 1; mask < (1 << n); mask++) for (int i = 0; i < n; i++) if (mask & (1 << i)) { int tmp = -1; for (int t = 0; t < n; t++) if (t != i && (mask & (1 << t))) tmp = t; if (tmp == -1) continue; for (submask = (mask - 1) & mask; submask > 0; submask = (submask - 1) & mask) if ((submask & (1 << tmp)) && !(submask & (1 << i))) for (int child = 0; child < n; child++) if (submask & (1 << child)) { if (check(i, mask, child, submask)) dp[i][mask] += dp[child][submask] * dp[i][mask - submask]; } } } void writeData() { cout << dp[0][(1 << n) - 1]; } int main() { readData(); for (int i = 0; i < LCA.size(); i++) if (LCA[i].a == LCA[i].b && LCA[i].a != LCA[i].c) { cout << 0; return 0; } dynamicProgramming(); writeData(); return 0; } |
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int n, m, k, count = 0; cin >> n >> m >> k; long long int s = n * m; long long int a[s], b[s]; for (long long int i = 0; i < s; i++) cin >> a[i]; sort(a, a + s); for (long long int i = 0; i < s; i++) { b[i] = abs(a[i] - a[s / 2]); if (b[i] % k != 0) { cout << -1; return 0; } else { count += b[i] / k; } } cout << count; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; int n, k; int arr[N]; int a, b; vector<int> v[N]; int tmp[N]; int subtree1[N]; int subtree2[N]; int sum[N]; int bst1[N]; int bst2[N]; bool ret; void dfs(int node, int parent) { subtree1[node] = 1; subtree2[node] = tmp[node]; for (int next : v[node]) { if (next != parent) { dfs(next, node); subtree1[node] += subtree1[next]; subtree2[node] += subtree2[next]; } } } void dfs1(int node, int parent) { sum[node] = 0; bst1[node] = 0; bst2[node] = 0; for (int next : v[node]) { if (next != parent) { dfs1(next, node); if (subtree2[next] == subtree1[next]) { sum[node] += subtree1[next]; } else { if (sum[next] > bst1[node]) { bst2[node] = bst1[node]; bst1[node] = sum[next]; } else if (sum[next] > bst2[node]) { bst2[node] = sum[next]; } } } } if (tmp[node]) { ++sum[node]; sum[node] += bst1[node]; } else { sum[node] = 0; bst1[node] = 0; bst2[node] = 0; } ret |= (sum[node] >= k); } void dfs2(int node, int parent, int val) { if (val == n - subtree1[node]) { sum[node] += val; } else { sum[node] -= bst1[node]; if (val > bst1[node]) { bst2[node] = bst1[node]; bst1[node] = val; } else if (val > bst2[node]) { bst2[node] = val; } sum[node] += bst1[node]; } if (!tmp[node]) { sum[node] = 0; bst1[node] = 0; bst2[node] = 0; } ret |= (sum[node] >= k); for (int next : v[node]) { if (next != parent) { if (subtree1[next] == subtree2[next]) { dfs2(next, node, sum[node] - subtree1[next]); } else if (bst1[node] == sum[next]) { dfs2(next, node, sum[node] - bst1[node] + bst2[node]); } else { dfs2(next, node, sum[node]); } } } } bool check(int val) { for (int i = 1; i <= n; ++i) { tmp[i] = (arr[i] >= val); } ret = 0; dfs(1, 0); dfs1(1, 0); if (ret) { return 1; } dfs2(1, 0, 0); return ret; } int main() { scanf( %d %d , &n, &k); for (int i = 1; i <= n; ++i) { scanf( %d , arr + i); } for (int i = 1; i < n; ++i) { scanf( %d %d , &a, &b); v[a].emplace_back(b); v[b].emplace_back(a); } int l = 1; int r = 1e6 + 1; while (l < r) { int mid = l + r >> 1; if (check(mid)) { l = mid + 1; } else { r = mid; } } printf( %d n , l - 1); } |
#include <bits/stdc++.h> using namespace std; struct Bus { long long s, t; }; bool cmp(Bus &a, Bus &b) { return a.t < b.t; } long long n, m, it[4 * 111111], tmp = 1, l, r; Bus bus[111111]; vector<long long> positions; void update(int idx, int l, int r, int pos, long long val) { if (pos < l || pos > r) return; if (l == r) { it[idx] = val; return; } int m = (l + r) / 2; update(2 * idx, l, m, pos, val); update(2 * idx + 1, m + 1, r, pos, val); it[idx] = (it[2 * idx] + it[2 * idx + 1]) % 1000000007; } long long get(int idx, int l, int r, int u, int v) { if (v < l || r < u) return 0; if (u <= l && r <= v) return it[idx]; int m = (l + r) / 2; long long ret = (get(2 * idx, l, m, u, v) + get(2 * idx + 1, m + 1, r, u, v)) % 1000000007; return ret; } int main() { cin >> n >> m; for (int i = 0; i < m; i++) cin >> bus[i].s >> bus[i].t; sort(bus, bus + m, cmp); positions.push_back(0); for (int i = 0; i < m; i++) if (bus[i].t != positions[positions.size() - 1]) positions.push_back(bus[i].t); if (n != positions[positions.size() - 1]) positions.push_back(n); update(1, 0, positions.size() - 1, 0, 1); for (int i = 0; i < m; i++) { l = lower_bound(positions.begin(), positions.end(), bus[i].s) - positions.begin(); r = upper_bound(positions.begin(), positions.end(), bus[i].t) - positions.begin() - 1; tmp = get(1, 0, positions.size() - 1, l, r); update(1, 0, positions.size() - 1, r, tmp); } cout << get(1, 0, positions.size() - 1, positions.size() - 1, positions.size() - 1); } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 7; int n, k; string s; bool can_del(char c) { int l = N, r = -1; for (int i = 0; i < n; ++i) { if (s[i] == c) { l = min(l, i); r = max(r, i); } } return r - l + 1 <= k; } string ans1 = tokitsukaze , ans2 = quailty , ans3 = once again ; bool win(string s) { return can_del( 0 ) || can_del( 1 ); } vector<int> pos[2]; int ml[2], mr[2]; void f(int l, int r, int t) { if (pos[t].size() && pos[t][0] < l) ml[t] = min(ml[t], pos[t][0]); auto p = upper_bound(pos[t].begin(), pos[t].end(), r); if (p != pos[t].end()) { ml[t] = min(ml[t], *p); } if (pos[t].size() && pos[t].back() > r) mr[t] = max(mr[t], pos[t].back()); p = lower_bound(pos[t].begin(), pos[t].end(), l); if (p != pos[t].begin()) { --p; mr[t] = max(mr[t], *p); } } bool col(int l, int r, int t) { for (int i = 0; i < 2; ++i) { ml[i] = N; mr[i] = -1; } ml[t] = l; mr[t] = r; f(l, r, 0); f(l, r, 1); for (int i = 0; i < 2; ++i) { if (mr[i] - ml[i] + 1 <= k) { return 0; } } return 1; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> k >> s; for (int i = 0; i < n; ++i) { pos[s[i] - 0 ].push_back(i); } if (win(s)) { cout << ans1 << n ; exit(0); } for (int i = 0; i + k - 1 < n; ++i) { if (col(i, i + k - 1, 0)) { cout << ans3 << n ; exit(0); } if (col(i, i + k - 1, 1)) { cout << ans3 << n ; exit(0); } } cout << ans2 << n ; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, size = 1e6 + 1; cin >> n; vector<int> prime(1e6 + 1, 1); prime[0] = 0; prime[1] = 0; for (int ri = 2; ri <= sqrt(size); ri++) { if (prime[ri]) { for (int pi = ri * ri; pi <= size; pi += ri) if (prime[pi]) prime[pi] = 0; } } vector<long long int> tprime; for (long long int ri = 0; ri < size; ri++) { if (prime[ri]) { tprime.push_back(ri * ri); } } long long int arr[n]; for (int ri = 0; ri < n; ri++) scanf( %lld , &arr[ri]); for (int ri = 0; ri < n; ri++) { bool val = binary_search(tprime.begin(), tprime.end(), arr[ri]); if (val) cout << YES n ; else cout << NO n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 200010; int a[maxn]; int main() { int t; cin >> t; while (t--) { string s; cin >> s; int m = s.length(); int fa = 0, fb = 0, fc = 0; for (int i = 0; i < m; i++) { if (s[i] == 1 && fa == 0) fa = i + 1; if (s[i] == 2 && fb == 0) fb = i + 1; if (s[i] == 3 && fc == 0) fc = i + 1; } if (fa == 0 || fb == 0 || fc == 0) { cout << 0 << endl; continue; } int x = max(fa, max(fb, fc)); int ans = x - min(fa, min(fb, fc)) + 1; int sum = ans; for (int i = 0; i < m; i++) { if (s[i] == 1 ) { int u = min(fb, fc); int v = max(fb, fc); if (i + 1 >= v) sum = i + 1 - u + 1; else if (i + 1 <= u) sum = v - i; else sum = v - u + 1; ans = min(ans, sum); fa = i + 1; } if (s[i] == 2 ) { int u = min(fa, fc); int v = max(fa, fc); if (i + 1 >= v) sum = i + 1 - u + 1; else if (i + 1 <= u) sum = v - i; else sum = v - u + 1; ans = min(ans, sum); fb = i + 1; } if (s[i] == 3 ) { int u = min(fb, fa); int v = max(fb, fa); if (i + 1 >= v) sum = i + 1 - u + 1; else if (i + 1 <= u) sum = v - i; else sum = v - u + 1; ans = min(ans, sum); fc = i + 1; } } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MaxLg = 25, inf = 1e9 + 100; int n; bool flag; vector<int> out, mins[2][MaxLg]; void output() { if (flag) cout << -1 << n ; else cout << out.size() << n ; for (auto i : out) cout << i << ; cout << endl; } void input(int a, int b) { int tmp; for (int i = 0; i < n; ++i) { cin >> tmp; mins[a][b].push_back(tmp); } } void solve() { for (int i = 0; i < n; ++i) out.push_back(inf); for (int i = 0; (1 << i) <= n; ++i) for (int j = 1; j <= n; ++j) out[j - 1] = min(out[j - 1], mins[!(j & (1 << i))][i][j - 1]); flag = true; } int main() { cin >> n; for (int k = 0; k < 2; ++k) for (int i = 0; (1 << i) <= n; ++i) { for (int j = 1; j <= n; ++j) if ((j & (1 << i)) == k * (1 << i)) out.push_back(j); output(); input(k, i); out.clear(); } solve(); output(); return 0; } |
#include <bits/stdc++.h> const bool debugging = 1; const long long mod = 1e9 + 7; using namespace std; template <class T> ostream &operator<<(ostream &os, vector<T> V) { for (auto v : V) { os << v << ; } return os << ; } template <class T> ostream &operator<<(ostream &os, vector<vector<T>> V) { for (long long i = 0; i < V.size(); i++) { for (long long j = 0; j < V[i].size(); j++) { os << V[i][j] << ; } os << n ; } return os << ; } template <class T> ostream &operator<<(ostream &os, set<T> S) { for (auto s : S) { os << s << ; } return os << ; } template <class L, class R> ostream &operator<<(ostream &os, pair<L, R> P) { return os << P.first << << P.second; } template <class L, class R> ostream &operator<<(ostream &os, map<L, R> M) { os << n ; for (auto m : M) { os << m << n ; } return os << ; } void solve() { long long N; cin >> N; vector<long long> elements(N); for (long long i = 0; i < N; i++) { cin >> elements[i]; } vector<long long> max_val(N); long long contri_front = elements[0]; long long contri_end = 0; long long index = N; bool single = 1; for (long long i = 0; i < N; i++) { if (contri_front >= elements[i] && single) { contri_front = elements[i]; elements[i] = 0; } else { single = 0; long long need_from_end = elements[i] - contri_front; if (need_from_end > elements[N - 1]) { cout << NO << n ; return; } if (need_from_end < contri_end) { contri_front = elements[i] - contri_end; if (contri_front < 0) { cout << NO << n ; return; } } else { contri_end = need_from_end; } } } cout << YES << n ; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long no_of_testcases; cin >> no_of_testcases; while (no_of_testcases-- > 0) { solve(); } return 0; } |
#include <bits/stdc++.h> const double PI = 3.141592653589793238462643383279502884197169399375105820974944; using namespace std; const int MOD = 1e9 + 7; double gcd(double a, double b) { return a < 0.01 ? b : gcd(fmod(b, a), a); } template <typename T> T mymax(T a, T b) { return (a > b) ? a : b; } template <typename T> T mymax(T a, T b, T c) { return mymax(a, mymax(b, c)); } template <typename T> T mymin(T a, T b) { return (a < b) ? a : b; } template <typename T> T mymin(T a, T b, T c) { return mymin(a, mymin(b, c)); } template <typename T> T power(T x, T y) { T res = 1; x = x % MOD; while (y > 0) { if (y & 1) res = (res * x) % MOD; y = y >> 1; x = (x * x) % MOD; } return res; } template <typename T> void swap(T *x, T *y) { T temp; temp = *y; *y = *x; *x = temp; } template <typename T> T mod(T a) { if (a > 0) return a; else return -a; } template <typename T> T logg(T a) { T x = 0; while (a > 1) { x++; a /= 2; } return x; } typedef struct trie { int a, b, c; trie(int p1, int p2, int p3) { a = p1, b = p2, c = p3; } } tri; bool operator<(tri p, tri q) { if (p.a < q.a) { return 1; } else if (p.a > q.a) return 0; else { return (p.b < q.b); } } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int n, k1; cin >> n >> k1; multiset<pair<int, int>> k; vector<int> l(n), r(n); vector<tri> p; for (int i = 1; i <= n; i++) { cin >> l[i - 1] >> r[i - 1]; p.push_back({l[i - 1], -1, i - 1}); p.push_back({r[i - 1], 1, i - 1}); } int c = 0; sort(p.begin(), p.end()); vector<int> ans; for (tri p1 : p) { int a1 = p1.a, b1 = p1.b, c1 = p1.c; if (b1 == -1) { k.insert({r[c1], c1}); c++; if (c > k1) { pair<int, int> pk = *k.rbegin(); k.erase(k.find(pk)); ans.push_back(pk.second); c--; } } else { if (k.count({r[c1], c1})) { c--; k.erase(k.find({r[c1], c1})); } } } cout << ans.size() << n ; for (int pk : ans) { cout << pk + 1 << ; } cout << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, x[5], y[5], i; cin >> n; for (i = 1; i <= n; i++) cin >> x[i] >> y[i]; if (n == 1) cout << -1; else if (n == 2) { if (x[1] != x[2] && y[1] != y[2]) cout << abs(x[1] - x[2]) * abs(y[1] - y[2]); else cout << -1; } else if (n == 3) { if (x[1] == x[2] && y[1] == y[3]) cout << abs(y[2] - y[1]) * abs(x[3] - x[1]); else if (x[1] == x[2] && y[2] == y[3]) cout << abs(y[2] - y[1]) * abs(x[3] - x[2]); else if (x[2] == x[3] && y[2] == y[1]) cout << abs(y[2] - y[3]) * abs(x[2] - x[1]); else if (x[2] == x[3] && y[3] == y[1]) cout << abs(y[2] - y[3]) * abs(x[3] - x[1]); else if (x[1] == x[3] && y[2] == y[1]) cout << abs(y[1] - y[3]) * abs(x[2] - x[1]); else if (x[1] == x[3] && y[3] == y[2]) cout << abs(y[1] - y[3]) * abs(x[3] - x[2]); } else if (n == 4) { int x1 = 10000, x2 = -10000, y1 = 10000, y2 = -10000; for (i = 1; i <= 4; i++) { if (x[i] < x1) x1 = x[i]; if (x[i] > x2) x2 = x[i]; if (y[i] < y1) y1 = y[i]; if (y[i] > y2) y2 = y[i]; } cout << (x2 - x1) * (y2 - y1); } } |
#include<iostream> using namespace std; int main() { int t; cin>>t; while(t--) { int Xa,Ya,Xb,Yb,Xf,Yf,sum; cin>>Xa>>Ya>>Xb>>Yb>>Xf>>Yf; sum=abs(Xa-Xb)+abs(Ya-Yb); if(Xa==Xb&&Xb==Xf) { if(Ya<Yf&&Yb>Yf||Ya>Yf&&Yb<Yf) sum+=2; } if(Ya==Yb&&Yb==Yf) { if(Xa<Xf&&Xb>Xf||Xa>Xf&&Xb<Xf) sum+=2; } cout<<sum<<endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k, i, teo = 0, s = 0, a[100001], t[100001]; cin >> n >> k; for (i = 1; i <= n; i++) cin >> a[i]; for (i = 1; i <= n; i++) { cin >> t[i]; if (t[i] == 1) { teo = teo + a[i]; a[i] = 0; } a[i] = a[i] + a[i - 1]; } for (i = k; i <= n; i++) s = max(s, a[i] - a[i - k]); cout << teo + s; } |
#include <bits/stdc++.h> #pragma comment(linker, /stack:640000000 ) using namespace std; const double EPS = 1e-9; const int INF = 0x7f7f7f7f; const double PI = acos(-1.0); template <class T> inline T gcd(T a, T b) { return (b) == 0 ? (a) : gcd((b), ((a) % (b))); } template <class T> inline T lcm(T a, T b) { return ((a) / gcd((a), (b)) * (b)); } template <typename T> string NumberToString(T Number) { ostringstream second; second << Number; return second.str(); } struct debugger { template <typename T> debugger& operator,(const T& v) { cerr << v << ; return *this; } } dbg; int t, n, m; string s; int main() { while (~scanf( %d%d , &n, &m)) { long long k; scanf( %lld , &k); if (k < n) { printf( %lld 1 n , k + 1); continue; } k -= (n - 1); int row = k / (m - 1); if (k % (m - 1) == 0) row--; int col = k % (m - 1); if (k % (m - 1) == 0) col = m - 1; int odd = row % 2; row = n - row; if (odd) col = m - col + 1; else col = col + 1; printf( %d %d n , row, col); } return 0; } |
#include <bits/stdc++.h> int main() { int n, k, i; scanf( %d , &n); int a[n][2]; for (i = 0; i < n; i++) { scanf( %d%d , &a[i][0], &a[i][1]); } scanf( %d , &k); for (i = 0; i < n; i++) { if (k >= a[i][0] && k <= a[i][1]) { printf( %d , n - i); break; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int read() { int X = 0, w = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) w = -1; c = getchar(); } while (c >= 0 && c <= 9 ) X = X * 10 + c - 0 , c = getchar(); return X * w; } const int N = 1500 + 10, K = 100000 + 10; const int mod = 1e9 + 7; int qpow(int a, int b) { int c = 1; for (; b; b >>= 1, a = 1ll * a * a % mod) if (b & 1) c = 1ll * c * a % mod; return c; } int n, m, a, b, k, p; int fac[K], ifac[K], d[K], sd[N], fr[N][N], sr[N][N], ss[N][N]; int C(int n, int m) { return 1ll * fac[n] * ifac[m] % mod * ifac[n - m] % mod; } int main() { n = read(), m = read(), a = read(), b = read(), k = read(); p = 1ll * a * qpow(b, mod - 2) % mod; fac[0] = 1; for (int i = 1; i <= k; ++i) fac[i] = 1ll * fac[i - 1] * i % mod; ifac[k] = qpow(fac[k], mod - 2); for (int i = k; i; --i) ifac[i - 1] = 1ll * ifac[i] * i % mod; for (int i = 0; i <= k; ++i) d[i] = 1ll * C(k, i) * qpow(p, i) % mod * qpow(1 - p + mod, k - i) % mod; for (int i = 1; i <= m; ++i) sd[i] = (sd[i - 1] + d[i - 1]) % mod; fr[0][m] = sr[0][m] = 1; for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) { fr[i][j] = (1ll * (sr[i - 1][m] - sr[i - 1][m - j] + mod) * sd[j] - ss[i - 1][j] + mod) % mod * d[m - j] % mod; sr[i][j] = (sr[i][j - 1] + fr[i][j]) % mod; ss[i][j] = (ss[i][j - 1] + 1ll * d[j - 1] * sr[i][j - 1]) % mod; } printf( %d n , sr[n][m]); return 0; } |
#include <bits/stdc++.h> using namespace std; enum { MAXN = 4010, MAXC = 26 }; int dp[MAXN][MAXN]; char sa[MAXN], sb[MAXN]; int pra[MAXN][MAXC], prb[MAXN][MAXC]; int main() { int ci, cd, cr, cs; scanf( %d%d%d%d , &ci, &cd, &cr, &cs); scanf( %s , sa + 1); scanf( %s , sb + 1); int la = strlen(sa + 1); fill(pra[0], pra[0] + MAXC, 0); for (int i = 1; i <= la; i++) { sa[i] -= a ; copy(pra[i - 1], pra[i - 1] + MAXC, pra[i]); pra[i][sa[i]] = i; } int lb = strlen(sb + 1); fill(prb[0], prb[0] + MAXC, 0); for (int i = 1; i <= lb; i++) { sb[i] -= a ; copy(prb[i - 1], prb[i - 1] + MAXC, prb[i]); prb[i][sb[i]] = i; } for (int i = 0; i <= la; i++) dp[i][0] = cd * i; for (int i = 0; i <= lb; i++) dp[0][i] = ci * i; for (int i = 1; i <= la; i++) for (int j = 1; j <= lb; j++) { dp[i][j] = min(min(dp[i - 1][j] + cd, dp[i][j - 1] + ci), dp[i - 1][j - 1] + (sa[i] == sb[j] ? 0 : cr)); if (sa[i] != sb[j] && pra[i][sb[j]] && prb[j][sa[i]]) { dp[i][j] = min(dp[i][j], dp[pra[i][sb[j]] - 1][prb[j][sa[i]] - 1] + (i - pra[i][sb[j]] - 1) * cd + cs + (j - prb[j][sa[i]] - 1) * ci); } } printf( %d n , dp[la][lb]); return 0; } |
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long int n; cin >> n; long long int a[n]; long long int sum = 0; for (long long int i = 0; i < n; i++) { cin >> a[i]; sum += a[i]; } sort(a, a + n); long long int req = ceil(sum / (long double)(n - 1)); cout << max(req, a[n - 1]); } |
#include <bits/stdc++.h> using namespace std; int w, m; long long x = 1; bool f = 1; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> w >> m; while (m && f) { if ((m - 1) % w == 0 || m % w == 0 || (m + 1) % w == 0) { if ((m - 1) % w == 0 || m % w == 0) m /= w; else m = (m + 1) / w; } else f = 0; } if (f) cout << YES ; else cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long nax = 1e5 + 10; vector<long long> g[nax]; signed main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); ; long long n; cin >> n; long long f = 0; vector<pair<pair<long long, long long>, long long> > a(n - 2); for (long long i = 0; i < n - 2; i++) { long long x, y, z; cin >> x >> y >> z; a[i].first.first = x; a[i].first.second = y; a[i].second = z; g[x].push_back(i); g[y].push_back(i); g[z].push_back(i); } for (long long i = 1; i <= n; i++) { if (g[i].size() == 1) { f = i; break; } } vector<long long> ans; long long id = g[f][0]; long long cur1 = -1, cur2 = -1; if (a[id].first.first != f) { cur1 = a[id].first.first; if (a[id].second != f) cur2 = a[id].second; else cur2 = a[id].first.second; } else { cur1 = a[id].first.second, cur2 = a[id].second; } ans.push_back(f); ans.push_back(cur1); ans.push_back(cur2); long long cd = cur1; long long dc = cur2; set<long long> yy; yy.insert(id); while (ans.size() < n) { for (auto &i : g[cur1]) if (yy.find(i) == yy.end()) id = i; yy.insert(id); if (a[id].first.first != cur1 && a[id].first.first != cur2) ans.push_back(a[id].first.first); else if (a[id].first.second != cur1 && a[id].first.second != cur2) ans.push_back(a[id].first.second); else ans.push_back(a[id].second); cur1 = ans[ans.size() - 2]; cur2 = ans.back(); } vector<long long> ans1; id = g[f][0]; cur1 = dc; cur2 = cd; ans1.push_back(f); ans1.push_back(cur1); ans1.push_back(cur2); set<long long> xx; xx.insert(id); while (ans1.size() < n) { for (auto &i : g[cur1]) if (xx.find(i) == xx.end()) id = i; xx.insert(id); if (a[id].first.first != cur1 && a[id].first.first != cur2) ans1.push_back(a[id].first.first); else if (a[id].first.second != cur1 && a[id].first.second != cur2) ans1.push_back(a[id].first.second); else ans1.push_back(a[id].second); cur1 = ans1[ans1.size() - 2]; cur2 = ans1.back(); } set<long long> s1, s2; for (auto &i : ans) s1.insert(i); for (auto &i : ans1) s2.insert(i); if (s1.size() == n) for (auto &i : ans) cout << i << ; else for (long long i = 0; i < n; i++) cout << ans1[i] << ; } |
#include <bits/stdc++.h> int main() { int n, i, j, k; scanf( %d , &n); int a[1000]; int b[1000]; int c[6] = {0}; int d[6] = {0}; int sum = 0; for (i = 0; i < n; i++) { scanf( %d , &a[i]); c[a[i]]++; } for (i = 0; i < n; i++) { scanf( %d , &b[i]); d[b[i]]++; } for (i = 1; i <= 5; i++) { if ((c[i] - d[i]) % 2 == 0) { if (c[i] > d[i]) sum = sum + (c[i] - d[i]) / 2; else sum = sum + (d[i] - c[i]) / 2; } else { sum = -1; break; } } if (sum == -1) printf( -1 n ); else printf( %d n , sum / 2); return 0; } |
#include <bits/stdc++.h> using namespace std; const int LN = 18, maxn = (1 << LN); const long long mod = (long long)(998244353); int fact[maxn], inv_fact[maxn], poww_r[maxn], poww_inv_r[maxn]; int mul(long long a, long long b) { long long ret = (a * b) % mod; return (int)(ret); } int add(int a, int b) { int ret = a + b; if (ret >= mod) { ret -= mod; } return ret; } int poww(int a, int b) { int x = 1, y = a; while (b > 0) { if (b % 2 == 1) { x = mul(x, y); } y = mul(y, y); b /= 2; } return x; } void build() { fact[0] = 1; for (int i = 1; i < maxn; i++) { fact[i] = mul(fact[i - 1], i); } inv_fact[maxn - 1] = poww(fact[maxn - 1], mod - 2); for (int i = maxn - 2; i >= 0; i--) { inv_fact[i] = mul(inv_fact[i + 1], i + 1); } } int C(int n, int r) { int num = fact[n], den = mul(inv_fact[r], inv_fact[n - r]); return mul(num, den); } vector<int> upper; const int r = 3, inv_r = poww(r, mod - 2); void pre() { int zz = poww(r, (mod - 1) >> LN), curr = 1; for (int i = 0; i < maxn; i++) { poww_r[i] = curr; curr = mul(curr, zz); } for (int i = 0; i < maxn; i++) { poww_inv_r[i] = (i == 0) ? 1 : poww_r[maxn - i]; } fact[0] = 1; for (int i = 1; i < maxn; i++) { fact[i] = mul(fact[i - 1], i); } inv_fact[maxn - 1] = poww(fact[maxn - 1], mod - 2); for (int i = maxn - 2; i >= 0; i--) { inv_fact[i] = mul(inv_fact[i + 1], i + 1); } } void fft(vector<int> &a, bool invert) { int n = a.size(); for (int i = 1, j = 0; i < n; i++) { int bit = n >> 1; for (; j >= bit; bit >>= 1) { j -= bit; } j += bit; if (i < j) { swap(a[i], a[j]); } } for (int len = 2; len <= n; len <<= 1) { int additive = maxn / len; for (int i = 0; i < n; i += len) { int now = 0; for (int j = 0; j < len / 2; j++) { int u = a[i + j], v = mul(a[i + j + len / 2], invert ? poww_inv_r[now] : poww_r[now]); a[i + j] = add(u, v); a[i + j + len / 2] = add(u, mod - v); now += additive; } } } } vector<int> mult(vector<int> &a, vector<int> &b) { int sz = 1; while (sz < max(a.size(), b.size())) { sz *= 2; } sz *= 2; vector<int> fa(sz), fb(sz); for (int i = 0; i < a.size(); i++) { fa[i] = a[i]; } for (int i = 0; i < b.size(); i++) { fb[i] = b[i]; } fft(fa, false); fft(fb, false); for (int i = 0; i < sz; i++) { fa[i] = mul(fa[i], fb[i]); } fft(fa, true); int inv_sz = poww(sz, mod - 2); for (int i = 0; i < sz; i++) { fa[i] = mul(fa[i], inv_sz); } while (fa.back() == 0) { fa.pop_back(); } return fa; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); build(); pre(); int n, m, k; cin >> n >> m >> k; upper.resize(k + 1); upper[0] = 1; int last_used = n; for (int i = 1; i <= k; i++) { upper[i] = mul(upper[i - 1], last_used); last_used--; } vector<int> p1(k + 1), p2(k + 1); int curr = 1; for (int i = 0; i <= k; i++) { p1[i] = mul(poww(i, k), inv_fact[i]); p2[i] = mul(curr, inv_fact[i]); curr = mul(curr, mod - 1); } vector<int> res = mult(p1, p2); int ans = 0, inv = poww(m, mod - 2), curr_inv = inv; for (int i = 1; i <= min(n, k); i++) { int curr = mul(upper[i], curr_inv); curr = mul(curr, res[i]); ans = add(ans, curr); curr_inv = mul(curr_inv, inv); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; char s[20005]; struct SuffixArray { int wa[20005], wb[20005], cnt[20005], wv[20005]; int rk[20005], height[20005]; int sa[20005]; bool cmp(int r[], int a, int b, int l) { return r[a] == r[b] && r[a + l] == r[b + l]; } void calcSA(char r[], int n, int m) { int i, j, p, *x = wa, *y = wb; for (i = 0; i < m; ++i) cnt[i] = 0; for (i = 0; i < n; ++i) cnt[x[i] = r[i]]++; for (i = 1; i < m; ++i) cnt[i] += cnt[i - 1]; for (i = n - 1; i >= 0; --i) sa[--cnt[x[i]]] = i; for (j = 1, p = 1; p < n; j *= 2, m = p) { for (p = 0, i = n - j; i < n; ++i) y[p++] = i; for (i = 0; i < n; ++i) if (sa[i] >= j) y[p++] = sa[i] - j; for (i = 0; i < n; ++i) wv[i] = x[y[i]]; for (i = 0; i < m; ++i) cnt[i] = 0; for (i = 0; i < n; ++i) cnt[wv[i]]++; for (i = 1; i < m; ++i) cnt[i] += cnt[i - 1]; for (i = n - 1; i >= 0; --i) sa[--cnt[wv[i]]] = y[i]; for (swap(x, y), p = 1, x[sa[0]] = 0, i = 1; i < n; ++i) x[sa[i]] = cmp(y, sa[i - 1], sa[i], j) ? p - 1 : p++; } } void calcHeight(char r[], int n) { int i, j, k = 0; for (i = 0; i <= n; ++i) rk[sa[i]] = i; for (i = 0; i < n; height[rk[i++]] = k) for (k ? k-- : 0, j = sa[rk[i] - 1]; r[i + k] == r[j + k]; k++) ; } bool solve(int k, int n, int div) { int ca = 0, cb = 0; for (int i = 1; i <= n; i++) { if (height[i] < k) { if (ca == 1 && cb == 1) return true; ca = 0; cb = 0; if (sa[i] < div) ca++; else if (sa[i] > div) cb++; continue; } if (sa[i] < div) ca++; else if (sa[i] > div) cb++; } return ca == 1 && cb == 1; } } suf; char a[20005], b[20005]; int main() { scanf( %s %s , a, b); int n = strlen(a), m = strlen(b); strcpy(s, a); s[n] = # ; strcpy(s + n + 1, b); int tot = n + m + 1; suf.calcSA(s, tot + 1, 128); suf.calcHeight(s, tot); int ret = -1; for (int i = 1; i <= n; i++) { if (suf.solve(i, tot, n)) { ret = i; break; } } printf( %d n , ret); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 100005; const int inf = 1 << 30; const long long INF = 1ll << 61; const double oo = 1 << 30; const long long zqc = 1e9 + 7; int n, k; int t, x; vector<int> a; int gcd(int a, int b) { return !b ? a : gcd(b, a % b); } int main() { scanf( %d%d , &n, &k); t = n / 2; --t; x = k - t; if (k == 0 && n == 1) return 0 * printf( 1 ); if (x <= 0) return 0 * printf( -1 ); if (n == 1) return 0 * printf( -1 ); a.push_back(x); a.push_back(2 * x); for (int i = 1; i <= 1e9; ++i) { if (a.size() == n) break; if (x == i || 2 * x == i) continue; if (a.size() % 2 == 1 && gcd(a[a.size() - 1], i) != 1) continue; a.push_back(i); } for (auto p : a) printf( %d , p); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, d, cot = 0; cin >> n >> m >> d; int arr[10004] = {0}; int rn = n * m; for (int j = 1; j <= rn; j++) cin >> arr[j]; sort(arr, arr + rn); int ind = arr[rn / 2]; if (n * m == 1) { cout << 0; return 0; } for (int i = 1; i <= rn; i++) { if (abs(ind - arr[i]) % d != 0) { cout << -1; return 0; } else { cot += abs(ind - arr[i]) / d; } } cout << cot << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX_N = 2e3; vector<int> e[MAX_N], d; vector<char> flag; void dfs(int v) { if (d[v] != -1) return; d[v] = 1; for (int to : e[v]) { dfs(to); d[v] = max(d[v], d[to] + 1); } } int main() { int n; scanf( %d , &n); d.assign(n, -1); for (int i = 0; i < n; i++) { int x; scanf( %d , &x); if (x != -1) e[x - 1].push_back(i); } for (int i = 0; i < n; i++) if (d[i] == -1) dfs(i); int ans = 1; for (int i : d) ans = max(ans, i); printf( %d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a[100], n, temp, m, ans; scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) scanf( %d , &a[i]); for (int i = 0; i < (n - 1); i++) { for (int j = 0; j < n - i - 1; j++) { if (a[j] < a[j + 1]) { temp = a[j]; a[j] = a[j + 1]; a[j + 1] = temp; } } } for (int i = 0; i < n; i++) { if (m % a[i] == 0) { ans = max(0, m / a[i]); cout << ans << endl; return 0; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; long long arr[5005], parent[5005], ans[5005]; long long dist[5005][5005]; vector<int> v[5005], order; priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > pq[5005]; void dfs(int cur, int prev) { parent[cur] = prev; order.push_back(cur); for (int i = 0; i < (int)v[cur].size(); i++) { int node = v[cur][i]; if (node == prev) continue; dfs(node, cur); } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; for (int i = 1; i <= n; i++) cin >> arr[i]; for (int i = 0; i < n - 1; i++) { int u, v1, cap; cin >> u >> v1 >> cap; v[u].push_back(v1); v[v1].push_back(u); dist[u][v1] = cap; dist[v1][u] = cap; } dfs(1, 0); ans[1] = 0; for (int i = 1; i <= n; i++) pq[i].push(make_pair(arr[i], i)); int cnt = 1; while (true) { if (pq[1].size() == n) break; for (int i = 1; i < order.size(); i++) { int node = order[i]; int cap = dist[node][parent[node]]; while (cap > 0 && pq[node].size()) { pair<int, int> temp = pq[node].top(); int connode = temp.second; pq[node].pop(); pq[parent[node]].push(temp); ans[connode] = cnt; cap--; } } cnt++; } for (int i = 1; i <= n; i++) cout << ans[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; for (int i = 0; i < n; ++i) { int x, y; cin >> x >> y; if ((x == 1 || x == 2 && 3 < y || x == 3 && x < y) && x != y) { cout << NO << endl; } else cout << YES << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int arr[n]; int x = 0; string str[n]; for (int i = 0; i < n; i++) { cin >> str[i]; if (str[i][1] == + ) { x++; } else { x--; } } cout << x; return 0; } |
#include <bits/stdc++.h> using namespace std; long long b, d; string a, c; map<long long, long long> need[150]; int main() { cin >> b >> d; cin >> a >> c; string h = ; long long ans = 0; long long sizea = a.size(); long long sizec = c.size(); for (int i = 0; i < sizec; i++) { int s = 0; for (int j = 0; j < sizea; j++) if (c[i] == a[j]) s = 1; if (s == 0) { cout << 0 << endl; return 0; } } for (long long i = 0; i < sizea; i++) { int now = 0; for (long long j = i; now < sizec; j++) if (a[j % sizea] == c[now]) { now++; need[i][1] = j - i + 1; } } for (long long i = 2; i <= 2ll * b * sizea; i *= 2ll) for (long long j = 0; j < sizea; j++) need[j][i] = need[j][i / 2ll] + need[(j + need[j][i / 2ll]) % sizea][i / 2ll]; long long now = 0; long long tot = b * sizea; long long time = 0; while (tot >= need[now][1]) for (long long i = 1;; i *= 2ll) if (need[now][i] > tot) { i /= 2ll; tot -= need[now][i]; now += need[now][i]; now %= sizea; time += i; break; } cout << time / d << endl; } |
#include <bits/stdc++.h> using namespace std; vector<int> adj[100100], ans; int arr[100100], cnt[100100]; bool visited[100100]; int n, m; void dfs(int v) { for (vector<int>::iterator it = adj[v].begin(); it != adj[v].end(); it++) { cnt[*it]++; if (cnt[*it] == arr[*it]) { cnt[*it]++; ans.push_back(*it); dfs(*it); } } } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin >> n >> m; int x, y; for (int i = 1; i <= m; i++) { cin >> x >> y; adj[x].push_back(y); adj[y].push_back(x); } for (int i = 1; i <= n; i++) cin >> arr[i]; for (int i = 1; i <= n; i++) { if (cnt[i] == arr[i]) { visited[i] = true; cnt[i]++; ans.push_back(i); dfs(i); } } cout << ans.size() << n ; vector<int>::iterator it; for (it = ans.begin(); it != ans.end(); it++) cout << *it << ; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> struct vect { private: T *memory = new T[0]; unsigned int length; unsigned int sz; public: vect() { length = 0; sz = 0; } inline void incsize(const int len) { T *temp = new T[len]; length = len; for (int i = 0; i < sz; ++i) temp[i] = memory[i]; swap(temp, memory); } inline void resize(const unsigned int v) { sz = v; if (v > length) incsize((1 << v) + 1); } inline void push_back(const T a) { const unsigned int len = length; if (length == sz) incsize((length << 1) + 1); memory[sz++] = a; } T &operator[](const unsigned int i) { return memory[i]; } unsigned int size() { return sz; } }; map<string, set<string> > v; map<set<string>, vect<string> > s1; int main() { ::ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n; for (int i = 0; i < n; ++i) { string s; cin >> s; s = s.substr(7); string t; for (int i = 0; i < s.length(); ++i) if (s[i] == / ) t = s.substr(i), s = s.substr(0, i); v[s].insert(t); } for (auto x : v) s1[x.second].push_back(x.first); int cnt = 0; for (auto x : s1) if (x.second.size() > 1) ++cnt; cout << cnt << endl; for (auto x : s1) if (x.second.size() > 1) { for (int i = 0; i < x.second.size(); ++i) cout << http:// << x.second[i] << ; cout << endl; } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; const int RLEN = 1 << 20 | 1; inline char gc() { static char ibuf[RLEN], *ib, *ob; (ob == ib) && (ob = (ib = ibuf) + fread(ibuf, 1, RLEN, stdin)); return (ob == ib) ? EOF : *ib++; } inline int read() { char ch = getchar(); int res = 0, f = 1; while (!isdigit(ch)) f ^= ch == - , ch = getchar(); while (isdigit(ch)) res = (res + (res << 2) << 1) + (ch ^ 48), ch = getchar(); return f ? res : -res; } inline void chemx(int &a, int b) { a < b ? a = b : 0; } inline void chemn(int &a, int b) { a > b ? a = b : 0; } struct node { int s, m, r, t; node(int _s = 0, int _m = 0, int _r = 0, int _t = 0) : s(_s), m(_m), r(_r), t(_t) {} friend inline bool operator<(const node &a, const node &b) { return a.t < b.t; } friend inline bool operator==(const node &a, const node &b) { return a.t == b.t; } friend inline bool operator>(const node &a, const node &b) { return a.t > b.t; } friend inline bool operator<=(const node &a, const node &b) { return a.t <= b.t; } friend inline bool operator>=(const node &a, const node &b) { return a.t >= b.t; } friend inline bool operator!=(const node &a, const node &b) { return a.t != b.t; } }; const int N = 100005, inf = 2e9; node a[N]; int n, q; struct Tr { vector<node> v; vector<long long> sl, sr; int last; inline void init(int l, int r) { int len = r - l + 1; for (int i = l; i <= r; i++) v.push_back(a[i]); sort(v.begin(), v.end()); sl.resize(len), sr.resize(len); sl[0] = v[0].m, sr[len - 1] = v[len - 1].r; for (int i = 1; i < len; i++) sl[i] = sl[i - 1] + v[i].m; for (int i = len - 2; ~i; i--) sr[i] = sr[i + 1] + v[i].r; } inline long long query(int t) { int tim = t - last; int pos = lower_bound(v.begin(), v.end(), node(0, 0, 0, tim)) - v.begin() - 1; long long res = 0; if (~pos) res += sl[pos]; if (pos + 1 < (int)v.size()) res += sr[pos + 1] * tim; last = t; return res; } }; namespace Seg { Tr tr[N << 2]; void build(int u, int l, int r) { tr[u].last = -2, tr[u].init(l, r); if (l == r) return; build((u << 1), l, ((l + r) >> 1)), build(((u << 1) | 1), ((l + r) >> 1) + 1, r); } inline void pushup(int u) { if (tr[(u << 1)].last == tr[((u << 1) | 1)].last) if (tr[(u << 1)].last >= 0) { tr[u].last = tr[(u << 1)].last; return; } else if (tr[(u << 1)].last == -2) { tr[u].last = -2; return; } tr[u].last = -1; } inline void pushdown(int u) { if (tr[u].last >= 0) tr[(u << 1)].last = tr[((u << 1) | 1)].last = tr[u].last; } long long query(int u, int l, int r, int st, int des, int k) { if (l == r && tr[u].last == -2) { tr[u].last = k; return min(1ll * a[l].m, 1ll * a[l].s + 1ll * a[l].r * k); } if (st <= l && r <= des && tr[u].last >= 0) return tr[u].query(k); long long res = 0; pushdown(u); if (st <= ((l + r) >> 1)) res += query((u << 1), l, ((l + r) >> 1), st, des, k); if (((l + r) >> 1) < des) res += query(((u << 1) | 1), ((l + r) >> 1) + 1, r, st, des, k); pushup(u); return res; } } // namespace Seg int main() { n = read(); for (int i = 1; i <= n; i++) { a[i].s = read(), a[i].m = read(), a[i].r = read(), a[i].t = a[i].r == 0 ? inf : a[i].m / a[i].r; } Seg::build(1, 1, n); q = read(); while (q--) { int t = read(), l = read(), r = read(); cout << Seg::query(1, 1, n, l, r, t) << n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { int d1, d2, d3; cin >> d1 >> d2 >> d3; cout << min(min(d1 + d2 + d3, 2 * (d1 + d2)), min(2 * (d1 + d3), 2 * (d2 + d3))); return 0; } |
#include <bits/stdc++.h> using namespace std; void solve(); int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); return 0; } const int inf = 2e9; const long long linf = 2e18; const long long mod = 998244353; const int N = 2e5 + 100; vector<int> g[N]; struct Elem { int value, node, pos; }; Elem merge(Elem a, Elem b) { if (a.value < b.value) return b; else return a; } struct T { vector<Elem> t; vector<int> u; T(const vector<Elem> &a) { t.assign(4 * a.size(), {0, 0}); u.assign(4 * a.size(), 0); build(a, 0, 0, a.size()); } void build(const vector<Elem> &a, int v, int l, int r) { if (r - l == 1) { t[v] = a[l]; return; } build(a, v * 2 + 1, l, (l + r) >> 1); build(a, v * 2 + 2, (l + r) >> 1, r); t[v] = merge(t[v * 2 + 1], t[v * 2 + 2]); } void push(int v, int l, int r) { if (r - l == 1) { t[v].value += u[v]; u[v] = 0; return; } t[v].value += u[v]; u[v * 2 + 1] += u[v]; u[v * 2 + 2] += u[v]; u[v] = 0; } Elem get(int v, int l, int r, int vl, int vr) { push(v, l, r); if (vl >= r || vr <= l) return {-inf, -1}; if (vl <= l && r <= vr) return t[v]; if (r - l == 1) { return t[v]; } return merge(get(v * 2 + 1, l, (l + r) >> 1, vl, vr), get((v * 2 + 2), (l + r) >> 1, r, vl, vr)); } void upd(int v, int l, int r, int vl, int vr, int d) { push(v, l, r); if (vl >= r || vr <= l) return; if (vl <= l && r <= vr) { u[v] += d; push(v, l, r); return; } int m = (l + r) >> 1; upd(v * 2 + 1, l, m, vl, vr, d); upd(v * 2 + 2, m, r, vl, vr, d); t[v] = merge(t[v * 2 + 1], t[v * 2 + 2]); } }; vector<Elem> leaves; pair<int, int> segments[N]; int par[N]; pair<int, int> dfs(int v, int depth = 1) { if (g[v].size() == 1 && par[v] != -1) { int pos = leaves.size(); leaves.push_back({depth, v, pos}); return {leaves.size() - 1, leaves.size() - 1}; } for (auto u : g[v]) { if (par[v] == u) continue; par[u] = v; auto [l, r] = dfs(u, depth + 1); segments[v].first = min(segments[v].first, l); segments[v].second = max(segments[v].second, r); } return segments[v]; } int marked[N]; void solve() { int n, k; cin >> n >> k; fill(par, par + n, -1); for (int i = 0; i < n; i++) segments[i] = {inf, -inf}; for (int i = 0; i < n - 1; i++) { int t1, t2; cin >> t1 >> t2; t1--; t2--; g[t1].push_back(t2); g[t2].push_back(t1); } dfs(0); T t(leaves); int unmarked = n; long long best = -1ll * (n / 2) * (n - n / 2); for (int i = 1; i <= k; i++) { if (i > leaves.size()) { long long rmax = max((long long)leaves.size(), (long long)min(i, n / 2)); best = max(best, rmax * (n - rmax)); continue; } Elem e = t.get(0, 0, leaves.size(), 0, leaves.size()); t.upd(0, 0, leaves.size(), e.pos, e.pos + 1, -inf); int v = e.node; marked[v] = true; unmarked--; v = par[v]; while (!marked[v]) { marked[v] = true; unmarked--; t.upd(0, 0, leaves.size(), segments[v].first, segments[v].second + 1, -1); if (par[v] == -1) break; v = par[v]; } long long bmax = min(n / 2, unmarked); best = max(best, 1ll * i * (n - i) - bmax * (n - bmax)); } cout << best << n ; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; int ma = INT_MIN; string ans = nah ; while (n--) { string s; int s1, s2, a, b, c, d, e; cin >> s; cin >> s1 >> s2 >> a >> b >> c >> d >> e; int val = 0; val += 100 * s1 + (-50) * s2 + a + b + c + d + e; if (val > ma) { ma = val; ans = s; } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int k, n; cin >> n >> k; long long int half, d, c; half = (n / 2); d = (half / (k + 1)); c = (k * d); cout << d << << c << << (n - c - d); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, f, i, j; cin >> n >> f; long long ans(0), k, l, mini; vector<pair<long long, long long> > v, v1; for (i = 0; i < n; i++) { cin >> k >> l; v.push_back(make_pair(k, l)); } for (i = 0; i < n; i++) { v1.push_back(make_pair( min(2 * v[i].first, v[i].second) - min(v[i].first, v[i].second), i)); } sort(v1.begin(), v1.end(), greater<pair<long long, long long> >()); for (i = 0; i < f; i++) { mini = min(2 * v[v1[i].second].first, v[v1[i].second].second); ans += mini; v[v1[i].second].first = -1; } for (i = 0; i < n; i++) { if (v[i].first != -1) ans += min(v[i].first, v[i].second); } cout << ans; return 0; } |
#include <bits/stdc++.h> int main() { long long a, m, c, i; scanf( %I64d %I64d , &a, &m); for (i = 0; i <= 700; i++) { c = a % m; if (c == 0) break; a = a + c; } if (c == 0) { printf( Yes ); } else printf( No ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5; const int INF = 0x3f3f3f3f; const long long LIM = 4e14; const int mod = 1e9 + 7; int n, m, ans[N + 10]; long long l[N + 10], r[N + 10]; struct Node { int idx; long long l, r; bool friend operator<(Node c, Node d) { return !(c.r < d.r); } } p[N + 10]; bool cmp1(Node c, Node d) { if (c.l != d.l) return c.l < d.l; return c.r < d.r; } struct Point { int idx; long long len; } v[N + 10]; bool cmp2(Point c, Point d) { if (c.len != d.len) return c.len < d.len; return c.idx < d.idx; } priority_queue<Node> que; int main() { ios::sync_with_stdio(0); cin.tie(0), cout.tie(0); cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> l[i] >> r[i]; if (i == 1) continue; p[i - 1] = {i - 1, l[i] - r[i - 1], r[i] - l[i - 1]}; } sort(p + 1, p + n, cmp1); for (int i = 1; i <= m; i++) { cin >> v[i].len; v[i].idx = i; } sort(v + 1, v + 1 + m, cmp2); int pos = 1; for (int i = 1; i <= m; i++) { while (pos < n && p[pos].l <= v[i].len) que.push(p[pos++]); if (!que.empty()) { Node c = que.top(); que.pop(); if (c.r < v[i].len) { cout << No ; return 0; } ans[c.idx] = v[i].idx; } } int flag = 1; for (int i = 1; i < n; i++) if (!ans[i]) flag = 0; if (!flag) { cout << No ; return 0; } cout << Yes n ; for (int i = 1; i < n; i++) cout << ans[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, m, q, k, v[300050], ans, d; pair<long long, long long> w[300050]; string second; int32_t main() { ios::sync_with_stdio(false); cin.tie(0); cin >> q; while (q--) { cin >> d >> m; if (d <= 3) { if (d == 1) cout << (1 % m) << n ; else if (d == 2) cout << 3 % m << n ; else cout << 5 % m << n ; } else { long long curr = 2, j = 1; long long sum = 3, sum2 = 5; while (1) { long long ant = sum; long long T = ((1LL << j) + 1) % m; curr = (curr * T) % m; if (sum <= d and d <= sum + (1LL << (j + 1))) { long long falta = (d - ant) % m; if (falta < 0) falta += m; cout << (sum2 + falta * curr) % m << n ; break; } sum += (1LL << (j + 1)); long long tam = (1LL << (j + 1)) % m; sum2 = (sum2 + tam * curr) % m; j++; } } } } |
#include <bits/stdc++.h> using namespace std; int k, n; bool contain_same; string s[5005], t[5005]; bool check(int x, int y) { swap(s[0][x], s[0][y]); for (int i = 1; i < k; ++i) { int dif = 0; for (int j = 0; j < n; ++j) { if (s[0][j] != s[i][j]) ++dif; } if (dif == 2 || (dif == 0 && contain_same)) continue; swap(s[0][x], s[0][y]); return 0; } return 1; } signed main() { scanf( %d%d , &k, &n); for (int i = 0; i < k; ++i) { cin >> s[i]; t[i] = s[i]; sort(t[i].begin(), t[i].end()); } for (int i = 1; i < k; ++i) if (t[i] != t[i - 1]) return puts( -1 ), 0; int alp[26] = {}; for (auto ch : s[0]) alp[ch - a ]++; for (int i = 0; i < 26; ++i) if (alp[i] > 1) contain_same = 1; int ma_val = 0, ma_id = 0; for (int i = 1; i < k; ++i) { int cnt = 0; for (int j = 0; j < n; ++j) { if (s[0][j] != s[i][j]) ++cnt; } if (cnt > 4) return puts( -1 ), 0; else if (ma_val < cnt) { ma_val = cnt; ma_id = i; } } if (ma_val == 0) { swap(s[0][0], s[0][1]); cout << s[0]; return 0; } if (ma_val == 2) { if (contain_same) { cout << s[0]; return 0; } return puts( -1 ), 0; } vector<int> pos; for (int i = 0; i < n; ++i) if (s[0][i] != s[ma_id][i]) pos.push_back(i); for (auto x : pos) { for (int y = 0; y < n; ++y) { if (x == y) continue; if (check(x, y)) { cout << s[0]; return 0; } } } puts( -1 ); return 0; } |
#include <bits/stdc++.h> using namespace std; map<long long, bool> mp; long long b, q, l, n, x, ans; signed main() { scanf( %lld%lld%lld%lld , &b, &q, &l, &n); if (abs(b) > l) { printf( 0 ); return 0; } if (l < 0) l = -l; for (long long i = 1; i <= n; i++) { scanf( %lld , &x); mp[x] = 1; } if (b == 0) { if (mp[0]) printf( 0 ); else printf( inf ); return 0; } if (q == 1) { if (mp[b]) puts( 0 ); else printf( inf ); return 0; } if (q == -1) { if (mp[-b] && mp[b]) printf( 0 ); else printf( inf ); return 0; } if (q == 0) { if (mp[0]) printf( %d , mp[b] ? 0 : 1); else printf( inf ); return 0; } while (abs(b) <= l) { if (!mp[b]) ans++; b *= q; } printf( %lld , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; long long int t, n, m, k; string s; long long int dp[30][30004]; long long int frq[30]; int main() { ios::sync_with_stdio(0); cin.tie(0); long long int i, j, x; cin >> t; while (t--) { cin >> n >> m >> k; cin >> s; long long int ans = 1e10; long long int tot = s.size(); memset(frq, 0, sizeof frq); for (i = 0; i < s.size(); i++) { frq[s[i] - A + 1]++; } for (i = 1; i <= 26; i++) { for (j = 0; j <= 27; j++) { for (k = 0; k <= n; k++) { dp[j][k] = 0; if (k == 0) dp[j][k] = 1; } } for (j = 1; j <= 26; j++) { for (k = 1; k <= n; k++) { dp[j][k] = dp[j - 1][k]; if (i != j && k - frq[j] >= 0 && dp[j - 1][k - frq[j]] == 1) { dp[j][k] = 1; } } } long long int rem = tot - frq[i]; for (k = 0; k <= n; k++) { if (dp[26][k]) { long long int cn = n - k; long long int cm = m - rem + k; if (cm <= 0) { if (frq[i] >= cn) ans = min(ans, 0LL); } else { if (cn == 0) { if (frq[i] >= cm) ans = min(ans, 0LL); } else { if (frq[i] >= cn + cm) { ans = min(ans, cn * cm); } } } } } } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int k, m, n1, n2; cin >> n1 >> n2 >> k >> m; vector<int> a(n1); for (int i = 0; i < a.size(); ++i) cin >> a[i]; vector<int> b(n2); for (int i = 0; i < b.size(); ++i) cin >> b[i]; if (a[k - 1] < b[n2 - m]) cout << YES n ; else cout << NO n ; return 0; } |
#include <bits/stdc++.h> using namespace std; string input() { int n; string sequence; cin >> n >> sequence; return sequence; } int getMaxBalance(const string &sequence) { int balance = 0; int maxBalance = 0; for (char bracket : sequence) { balance += (bracket == [ ) - (bracket == ] ); if (balance > maxBalance) { maxBalance = balance; } } return maxBalance; } int getOpenClosePairs(const string &sequence) { int result = 0; for (int i = 1; i < (int)sequence.size(); ++i) { result += sequence[i - 1] == [ && sequence[i] == ] ; } return result; } vector<string> solve(const string &sequence) { const int maxBalace = getMaxBalance(sequence); const int length = (int)sequence.size() + 3 * getOpenClosePairs(sequence); vector<string> result(2 * maxBalace + 1, string(length, )); int previousHeight = 2 * maxBalace + 1; char previousBracket = ] ; int col = 0; for (char bracket : sequence) { int height; if ( [ == previousBracket && [ == bracket) { height = previousHeight - 2; } else if ( [ == previousBracket && ] == bracket || ] == previousBracket && [ == bracket) { col += 3 * ( [ == previousBracket && ] == bracket); height = previousHeight; } else if ( ] == previousBracket && ] == bracket) { height = previousHeight + 2; } else { assert(false); } int middle = (int)result.size() / 2; int topRow = middle - height / 2; int bottomRow = middle + height / 2; int minusCol = col + ( [ == bracket) - ( ] == bracket); result[topRow][col] = result[bottomRow][col] = + ; result[topRow][minusCol] = result[bottomRow][minusCol] = - ; for (int row = topRow + 1; row < bottomRow; ++row) { result[row][col] = | ; } ++col; previousHeight = height; previousBracket = bracket; } return result; } void output(const vector<string> &picture) { for (const string &row : picture) { cout << row << endl; } } int main() { const string sequece = input(); auto picture = solve(sequece); output(picture); return 0; } |
#include <bits/stdc++.h> using namespace std; struct SegmentTree { int l, r, val, lazy; } t[800005]; int n, q, a[200005]; void build(int l, int r, int p) { t[p].l = l; t[p].r = r; if (l == r) { t[p].val = a[l]; return; } int mid = (l + r) >> 1; build(l, mid, p << 1); build(mid + 1, r, p << 1 | 1); } void spread(int p) { if (t[p].lazy != 0) { int la = t[p].lazy; t[p << 1].lazy = max(t[p << 1].lazy, la); t[p << 1 | 1].lazy = max(t[p << 1 | 1].lazy, la); t[p].lazy = 0; } } void change(int pos, int x, int p) { int L = t[p].l, R = t[p].r; if (L == R) { t[p].lazy = 0; t[p].val = x; return; } int mid = (L + R) >> 1; spread(p); if (pos <= mid) change(pos, x, p << 1); else change(pos, x, p << 1 | 1); } void write(int p) { int L = t[p].l, R = t[p].r; if (L == R) { cout << max(t[p].val, t[p].lazy) << ; return; } int mid = (L + R) >> 1; spread(p); write(p << 1); write(p << 1 | 1); } int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } build(1, n, 1); cin >> q; int C, pos, x; for (int i = 1; i <= q; i++) { cin >> C; if (C == 1) { cin >> pos >> x; change(pos, x, 1); } else { cin >> x; t[1].lazy = max(t[1].lazy, x); } } write(1); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; string s; cin >> s; string ans = s; int k_prime = 1; for (int k = 0; k < n; k++) { string t = s; rotate(t.begin(), t.begin() + k, t.end()); if (k % 2 != n % 2) { reverse(t.begin() + n - k, t.end()); } if (t < ans) { ans = t; k_prime = k + 1; } } cout << ans << n ; cout << k_prime << n ; } } |
#include <bits/stdc++.h> using namespace std; template <typename T> T gcd(T a, T b) { while (b) { T c = a % b; a = b; b = c; } return a; } template <typename T> T lcm(T a, T b) { assert(a / gcd(a, b) <= numeric_limits<T>::max() / b); return a * (b / gcd(a, b)); } class out { public: template <typename T> out &operator()(const T &t) { cout << t << ; return *this; } template <typename T1, typename T2> out &operator()(const pair<T1, T2> &t) { cout << ( << t.first << , << t.second << ) << ; return *this; } }; template <typename iter> void print(iter beg, iter end) { for_each(beg, end, out()); cout << endl; } long n; long h[100000]; long g[100000]; long r = 0; void algo() { for (long i = 1; i < n; ++i) { g[i] = max(g[i - 1], h[i - 1]); } long t = h[n - 1]; for (long i = n - 1; i >= 0; --i) { t = min(t, h[i]); if (t >= g[i]) { ++r; } } } int main() { cin >> n; for (long i = 0; i < n; ++i) { cin >> h[i]; } algo(); cout << r; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, p; double l[100100], r[100100], s[100100]; long long ans; double c; int main() { cin >> n >> p; for (int i = 0; i < n; i++) { cin >> l[i] >> r[i]; s[i] = 1 - (floor(r[i] / p) - ceil(l[i] / p) + 1) / (r[i] - l[i] + 1); } for (int i = 0; i < n; i++) { c += (2000 * (1 - s[(i + 1) % n] * s[i])); ans += floor(c); c = c - floor(c); } if (c != 0) { if (ans >= 1000000) { cout << ans << endl; return 0; } else { cout << ans / 10; c += (ans % 10); cout << c << endl; } } else { cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; string a, b; int main() { int n; while (cin >> n) { cin >> a >> b; long long ans = 0; long long x = 0, y = 0, p = 0, q = 0; for (int i = 0; i < n; i++) if (b[i] == 1 ) a[i] == 0 ? x++ : y++; for (int i = 0; i < n; i++) if (b[i] == 0 ) a[i] == 0 ? p++ : q++; for (int i = 0; i < n; i++) if (b[i] == 0 ) a[i] == 0 ? ans += y : ans += x; ans += (long long)p * q; cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long a, b, c, n, m, k, x, y, z, cnt, ans, tt; string s; vector<long long> v, q, t; int main() { long long c0, c1, h; cin >> tt; while (tt--) { cin >> n >> c0 >> c1 >> h >> s; cnt = 0; ans = 0; for (long long i = 0; i < s.size(); i++) { if (s[i] == 1 ) cnt++; else ans++; } if (c0 == c1) cout << c0 * n << n ; else if (c0 + h < c1) cout << c0 * n + (cnt * h) << n ; else if (c1 + h < c0) cout << (c1 * n) + (ans * h) << n ; else cout << (c1 * cnt) + (c0 * ans) << n ; } } |
#include <bits/stdc++.h> using namespace std; const int FFF = 200005; int a[FFF], b[FFF]; int qsearch(int x, int r) { int l = 1, mid; while (l <= r) { mid = (l + r) >> 1; if (b[mid] < x) l = mid + 1; else r = mid - 1; } return r; } int main() { int n, m; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &a[i]); sort(a, a + n); scanf( %d , &m); for (int i = 1; i <= m; i++) scanf( %d , &b[i]); sort(b + 1, b + m + 1); long long suma, sumb, cha; suma = n * 2; sumb = m * 2; cha = suma - sumb; for (int now = 0; now < n; now++) { int t = qsearch(a[now], m); long long tt1 = now * 2 + 3 * (n - now); long long tt2 = t * 2 + (m - t) * 3; long long tmp = tt1 - tt2; if (tmp > cha) { cha = tmp; suma = tt1; sumb = tt2; } else if (tmp == cha && suma < tt1) { suma = tt1; sumb = tt2; } } cout << suma << : << sumb << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long ans; int main() { vector<int> a(3); for (size_t i = 0; i < 3; i++) { cin >> a[i]; } sort(a.begin(), a.end()); cout << ((a[1] + a[0] > a[2]) ? 0 : (-a[1] - a[0] + a[2] + 1)); } |
#include <bits/stdc++.h> using namespace std; int n, m, s, t, d[200005], v[200005], dd[200005], ma[1005][1005], ok = 1, y, ans; int main() { scanf( %d%d%d%d , &n, &m, &s, &t); for (int i = 1; i <= m; i++) { int x, y; scanf( %d%d , &x, &y); ma[x][y] = ma[y][x] = 1; } for (int i = 1; i <= n; i++) d[i] = 1000000000, v[i] = 0; d[s] = 0; for (int i = 1; i <= n; i++) { int minv = 1000000000, u; for (int j = 1; j <= n; j++) if (!v[j] && d[j] < minv) { minv = d[j]; u = j; } v[u] = 1; for (int k = 1; k <= n; k++) if (!v[k] && ma[u][k] && d[u] + ma[u][k] < d[k]) d[k] = d[u] + ma[u][k]; } for (int i = 1; i <= n; i++) dd[i] = 1000000000, v[i] = 0; dd[t] = 0; for (int i = 1; i <= n; i++) { int minv = 1000000000, u; for (int j = 1; j <= n; j++) if (!v[j] && dd[j] < minv) { minv = dd[j]; u = j; } v[u] = 1; for (int k = 1; k <= n; k++) if (!v[k] && ma[u][k] && dd[u] + ma[u][k] < dd[k]) dd[k] = dd[u] + ma[u][k]; } for (int i = 1; i < n; i++) for (int j = i + 1; j <= n; j++) if (!ma[i][j]) { if (d[i] + dd[j] + 1 >= d[t] && d[j] + dd[i] + 1 >= d[t]) { ans++; } } printf( %d , ans); } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 7; struct note { int x, id; } q[maxn]; int st[maxn][20], st1[maxn][20], a[maxn], n, dp[maxn]; int head, tail; void init(int n) { for (int i = 1; i <= n; i++) st1[i][0] = st[i][0] = a[i]; for (int j = 1; j < 20; j++) for (int i = 1; i <= n; i++) if (i + (1 << (j - 1)) <= n) st[i][j] = min(st[i][j - 1], st[i + (1 << (j - 1))][j - 1]), st1[i][j] = max(st1[i][j - 1], st1[i + (1 << (j - 1))][j - 1]); } int query(int l, int r) { int len = log2(r - l + 1); return max(st1[l][len], st1[r - (1 << len) + 1][len]) - min(st[l][len], st[r - (1 << len) + 1][len]); } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int s, len; cin >> n >> s >> len; for (int i = 1; i <= n; i++) cin >> a[i]; init(n); int l, r, ans; if (len > n || query(1, len) > s) return cout << -1 << endl, 0; memset(dp, 0x3f3f3f3f, sizeof(dp)); dp[0] = 0; q[tail].id = 0, q[tail].x = 0, tail++; dp[len] = 1; for (int i = len + 1; i <= n; i++) { l = 1, r = i - len + 1, ans = -1; while (l <= r) { int mid = (l + r) >> 1; if (query(mid, i) <= s) r = mid - 1, ans = mid; else l = mid + 1; } while (head < tail && q[tail - 1].x >= dp[i - len]) tail--; q[tail].x = dp[i - len], q[tail].id = i - len, tail++; if (ans != -1) { while (head < tail && q[head].id < ans - 1) head++; if (head < tail) dp[i] = min(dp[i], q[head].x + 1); } } if (dp[n] == 0x3f3f3f3f) dp[n] = -1; cout << dp[n] << endl; } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; const int MAXN = 1e2 + 5; const long long MOD = 1e9 + 7; int a[1005][3000]; int main() { int n, s, d; int maxx = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> s >> d; for (int j = s; j <= 100000000; j += d) { if (j > maxx) { maxx = j; break; } } } cout << maxx << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 210003; double a[N], b[N]; int n; double checkMa(double x) { for (int i = 1; i <= n; i++) b[i] = a[i] - x; double ans = 0, tpans = 0; for (int i = 1; i <= n; i++) { tpans += b[i]; if (tpans < 0) tpans = 0; ans = max(ans, tpans); } for (int i = 1; i <= n; i++) b[i] = -b[i]; tpans = 0; for (int i = 1; i <= n; i++) { tpans += b[i]; if (tpans < 0) tpans = 0; ans = max(ans, tpans); } return ans; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %lf , &a[i]); } double r = 10005, l = -10005; int times = 100; while (fabs(r - l) > 1e-13 && times) { times--; if (times <= 0) break; double lm = (2.0 * l + r) / 3.0; double rm = (2.0 * r + l) / 3.0; if (checkMa(lm) < checkMa(rm)) { r = rm; } else l = lm; } printf( %.10f n , checkMa(l)); return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> bool remin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; } template <class T> bool remax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; } int nxt() { int first; scanf( % PRId32, &first); return first; } long long nxtll() { long long first; scanf( % PRId64, &first); return first; } long long gcd(long long a, long long b) { a = abs(a); b = abs(b); while (b) { a %= b; swap(a, b); } return a; } struct Q { long long n, d; Q(long long a = 0) : n(a), d(1) {} Q(long long nn, long long dd) : n(nn), d(dd) { norm(); } void norm() { long long g = gcd(abs(n), abs(d)); n /= g; d /= g; if (d < 0) { n *= -1; d *= -1; } } Q operator+(const Q &r) const { return Q(n * r.d + d * r.n, d * r.d); } Q operator-(const Q &r) const { return Q(n * r.d - d * r.n, d * r.d); } Q operator*(const Q &r) const { return Q(n * r.n, d * r.d); } Q operator/(const Q &r) const { return Q(n * r.d, d * r.n); } long long value(const Q &r) const { return n * r.d - d * r.n; } double vald(const Q &r) const { return n * 1.0 * r.d - d * 1.0 * r.n; } bool operator<(const Q &r) const { double vv = vald(r); if (vv < -1e10) { return true; } if (vv > 1e10) { return false; } return value(r) < 0; } bool operator>(const Q &r) const { double vv = vald(r); if (vv < -1e10) { return false; } if (vv > 1e10) { return true; } return value(r) > 0; } bool operator!=(const Q &r) const { return !(*this == r); } bool operator>=(const Q &r) const { return *this > r || *this == r; } bool operator<=(const Q &r) const { return *this < r || *this == r; } bool operator==(const Q &r) const { double vv = vald(r); if (vv < -1e10) { return false; } if (vv > 1e10) { return false; } return value(r) == 0; } double getValue() const { return n / (double)d; } }; ostream &operator<<(ostream &os, const Q &p) { return os << p.n << / << p.d; } struct pt { double first, second; pt() = default; pt(long double first, long double second) : first(first), second(second) {} inline pt operator-(const pt &r) const { return pt(first - r.first, second - r.second); } inline pt operator+(const pt &r) const { return pt(first + r.first, second + r.second); } inline pt operator*(const long double &r) const { return pt(first * r, second * r); } inline pt operator-() const { return pt(-first, -second); } inline long double sqlen() const { return fabsl(first * first + second * second); } }; ostream &operator<<(ostream &os, const pt &p) { return os << ( << p.first << , << p.second << ) ; } ostream &operator<<(ostream &os, const pair<long long, long long> &p) { return os << ( << p.first << , << p.second << ) ; } pair<long long, long long> operator-(const pair<long long, long long> &l, const pair<long long, long long> &r) { return pair<long long, long long>(l.first - r.first, l.second - r.second); } pair<long long, long long> operator+(const pair<long long, long long> &l, const pair<long long, long long> &r) { return pair<long long, long long>(l.first + r.first, l.second + r.second); } inline double cross(const pt &l, const pt &r) { return l.first * r.second - l.second * r.first; } inline double dot(const pt &l, const pt &r) { return l.first * r.first + l.second * r.second; } inline long long cross(const pair<long long, long long> &l, const pair<long long, long long> &r) { return l.first * r.second - l.second * r.first; } inline long long dot(const pair<long long, long long> &l, const pair<long long, long long> &r) { return l.first * r.first + l.second * r.second; } long long pwmod(long long a, long long n, long long mod) { long long ret = 1; while (n) { if (n & 1) ret = ret * a % mod; a = a * a % mod; n >>= 1; } return ret; } template <typename T> inline T sqr(T first) { return first * first; } inline bool is_prime(unsigned long long first) { for (unsigned long long i = 2; i * i <= first; ++i) { if (first % i == 0) { return false; } } return true; } bool is_sq(long long first) { for (long long i = 1; i * i <= first; ++i) { if (i * i == first) return true; } return false; } int n; string solve(const multiset<char> &a, const multiset<char> &b, int d = 0, const string &cur = string(n, ? )) { if (d == n) { return cur; } if (d & 1) { string res = ; set<char> bl(b.begin(), b.end()); for (char c : bl) { multiset<char> bb = b; bb.erase(bb.find(c)); for (int i = 0; i < n; ++i) { if (cur[i] != ? ) continue; string cc = cur; cc[i] = c; res = max(res, solve(a, bb, d + 1, cc)); } } return res; } else { string res = string(n, z + 1); set<char> al(a.begin(), a.end()); for (char c : al) { multiset<char> aa = a; aa.erase(aa.find(c)); for (int i = 0; i < n; ++i) { if (cur[i] != ? ) continue; string cc = cur; cc[i] = c; res = min(res, solve(aa, b, d + 1, cc)); } } return res; } } string solve(const string &a, const string &b) { n = a.length(); return solve(multiset<char>(a.begin(), a.end()), multiset<char>(b.begin(), b.end())); } const int N = 300 * 1000 + 10; char a[N]; char b[N]; string solve2(string a, string b) { sort(a.begin(), a.end()); sort(b.begin(), b.end()); int n = a.length(); int l = 0, r = n - 1; int L = 0, R = n; string s(n, . ); int move = 0; while (L < R) { if (move & 1) { if (a[l] < b[r] || L + 1 == R) { s[L] = b[r]; --r; ++L; } else { if (!((R - L) & 1)) { for (int i = L; i < R; i += 2) { s[i] = a[l++]; } for (int i = L + 1; i < R; i += 2) { s[i] = b[r--]; } } else { for (int i = L + 1; i < R; i += 2) { s[i] = a[l++]; } for (int i = L; i < R; i += 2) { s[i] = b[r--]; } } L = R; } } else { if (a[l] < b[r] || L + 1 == R) { s[L] = a[l]; ++l; ++L; } else { if (!((R - L) & 1)) { for (int i = L + 1; i < R; i += 2) { s[i] = a[l++]; } for (int i = L; i < R; i += 2) { s[i] = b[r--]; } } else { for (int i = L; i < R; i += 2) { s[i] = a[l++]; } for (int i = L + 1; i < R; i += 2) { s[i] = b[r--]; } } L = R; } } ++move; } return s; } void solve() { scanf( %s , a); scanf( %s , b); cout << solve2(a, b) << n ; } void prepare() { return; while (true) { n = rand() % 5 + 1; string a(n, . ); string b(n, . ); for (int i = 0; i < (int)(n); i++) { a[i] = rand() % 5 + a ; b[i] = rand() % 5 + a ; } if (solve(a, b) != solve2(a, b)) { cout << a << n ; cout << b << n ; return; } } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); prepare(); int t = 1; for (int i = 0; i < (int)(t); i++) { solve(); } cerr << Time << clock() / (double)CLOCKS_PER_SEC << endl; return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( O2 ) using namespace std; const int MAX = 2e6 + 5; const long long MAX2 = 11; const int MOD = 1000000000 + 7; const long long INF = 2e18; const int dr[] = {1, 0, -1, 0, 1, 1, -1, -1, 0}; const int dc[] = {0, 1, 0, -1, 1, -1, 1, -1, 0}; const double pi = acos(-1); const double EPS = 1e-9; int n, k, x, nw, sz, p[MAX], mx; string s; char y[MAX]; int par(int z) { if (p[z] == z) return z; return p[z] = par(p[z]); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); for (int i = 1; i <= 2000001; i++) p[i] = i; cin >> n; while (n--) { cin >> s >> k; sz = s.size() - 1; while (k--) { cin >> x; nw = x; while (nw <= x + sz) { y[nw] = s[nw - x]; nw = p[nw] = par(nw + 1); } mx = max(mx, x + sz); } } for (int i = 1; i <= mx; i++) if (y[i]) cout << (char)y[i]; else cout << a ; return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long read() { long long x = 0; char ch = getchar(); bool f = 0; for (; !isdigit(ch); ch = getchar()) if (ch == - ) f = 1; for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - 0 ; return f ? -x : x; } void write(long long x) { if (x < 0) putchar( - ), x = -x; if (x >= 10) write(x / 10); putchar(x % 10 + 0 ); } void writeln(long long x) { write(x); putchar( n ); } void writep(long long x) { write(x); putchar( ); } long long const N = 1e6 + 3; long long n, a[N]; signed main() { n = read(); long long ans = 0; for (long long i = 1; i <= n; i++) a[i] = read(), ans += a[i]; if (n == 1) { writeln(a[1]); return 0; } sort(a + 1, a + n + 1); if (a[1] <= 0) { for (long long i = 1; i < n && a[i] <= 0; i++) ans -= 2 * a[i]; } else { ans -= 2 * a[1]; } writeln(ans); } |
#include <bits/stdc++.h> using namespace std; long long a[2005], b[2005], pos; int n, m; inline long long mabs(long long x) { return x > 0 ? x : -x; } inline bool judge(long long x) { int p = 1; for (int i = 1; i <= n; i++) { while (p <= m && mabs(b[p] - a[i]) + mabs(b[p] - pos) > x) p++; if (p > m) return false; p++; } return true; } int main() { scanf( %d%d%I64d , &n, &m, &pos); for (int i = 1; i <= n; i++) scanf( %I64d , &a[i]); for (int i = 1; i <= m; i++) scanf( %I64d , &b[i]); sort(a + 1, a + n + 1); sort(b + 1, b + m + 1); long long l = 0, r = 3e9, ans = 3e9; while (l <= r) { long long mid = (l + r) >> 1; if (judge(mid)) { ans = min(ans, mid); r = mid - 1; } else l = mid + 1; } cout << ans << endl; return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.