func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; inline void boost() { ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0); } const long long maxn = 1e5 + 123; const long long inf = 1e9 + 123; const long long mod = 1e9 + 7; const double infm = 1e-9; const double pi = acos(-1); int a[maxn]; bool used[maxn]; int main() { boost(); int n, k; cin >> n >> k; int p = 0, m = 0; for (int i = 1; i <= n; i++) { cin >> a[i]; } int mx = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (abs(j - i) % k == 0) { used[j] = 1; } } int sum = 0, sum1 = 0; for (int j = 1; j <= n; j++) { if (used[j] == 0) { if (a[j] == 1) { sum++; } else { sum1++; } } used[j] = 0; } mx = max(mx, abs(sum - sum1)); } cout << mx; return 0; } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-9; double ans = 0; map<double, double> F; void insert(double dist, double s) { double need = dist / (s + 1); F[s] += need; if (s > 1) F[s] += dist / (s - 1); ans += need; while (need > 1e-9) { map<double, double>::iterator it = --F.end(); double y = it->first; double dlt = min(need, F[y]); F[y] -= dlt; need -= dlt; ans += dlt / y; if (F[y] < 1e-9) { F.erase(it); } } } int n, L, ls; int main() { scanf( %d%d , &n, &L); int l, r; double s; while (n--) { scanf( %d%d%lf , &l, &r, &s); insert(l - ls, 1); insert(r - l, s + 1); ls = r; } insert(L - ls, 1); printf( %.10lf n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> arr[100100]; int dist[100100]; map<int, int> m1; void dfs(int curr, int par) { dist[curr] = dist[par] + 1; if (curr == par) { dist[curr] = 0; } for (auto x : arr[curr]) { if (x != par) { dfs(x, curr); } } } int main() { int n; cin >> n; for (int i = 2; i <= n; i++) { int x; cin >> x; arr[i].push_back(x); arr[x].push_back(i); } dfs(1, 1); int ans = 0; for (int i = 1; i <= n; i++) { m1[dist[i]]++; } for (auto it = m1.begin(); it != m1.end(); it++) { ans += (it->second) % 2; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int i, k, b, n, m, r = 0, x = 0, y = 0, z = 0, h = 0, l; string s; cin >> s; n = s.size(); int a[n]; for (i = 0; i < n; i++) { if (s[i] == ( ) x++; else if (s[i] == ) && x > 0) x--; else if (s[i] == ) ) z = 1; else if (s[i] == # && x > 0) { a[y] = 1; y++; x--; k = i; l = x; } else if (s[i] == # ) z = 1; } x = l; if (y > 0) { r = 0; for (i = k + 1; i < n; i++) { if (s[i] == ( ) { x++; r++; } else if (s[i] == ) && x > 0) x--; else h = 1; if (s[i] == ) && r > 0) r--; } a[y - 1] = x + 1; } if (z == 1 || h == 1 || r != 0) cout << -1 ; else { for (i = 0; i < y; i++) { cout << a[i] << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } long long s = 0; for (int i = 0; i < n; i++) { s = s + a[i]; if (s < 0) s = 0; } cout << s << n ; } return (0); } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6; vector<int> gr[N]; long long int edges, z, o; int col[N], vis[N]; void color(int n) { for (int i = 0; i < gr[n].size(); i++) { if (col[gr[n][i]] == -1) { if (col[n] == 0) { o++; col[gr[n][i]] = 1; } else { z++; col[gr[n][i]] = 0; } edges++; color(gr[n][i]); } } } int main() { int n, a, b; cin >> n; for (int i = 0; i < n - 1; i++) { col[i] = -1; cin >> a >> b; gr[a].push_back(b); gr[b].push_back(a); } col[n - 1] = -1; col[n] = -1; col[1] = 0; z++; color(1); if (n == 1) { cout << 0 << endl; } else { cout << z * o - edges << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, x, y; cin >> n >> x >> y; int arr[n]; int countx = 0; for (int i = 0; i < n; i++) { cin >> arr[i]; if (arr[i] <= x) { countx++; } } if (y < x) { cout << n << endl; return 0; } if (y >= x) { if (countx % 2 == 0) { countx = countx / 2; } else { countx = countx / 2 + 1; } cout << countx << endl; return 0; } } |
#include <bits/stdc++.h> inline char getThirdColor(char a, char b) { char ret; if (a == B && b == G || a == G && b == B ) ret = R ; else if (a == B && b == R || a == R && b == B ) ret = G ; else if (a == R && b == G || a == G && b == R ) ret = B ; return ret; } std::unordered_map<std::string, bool> ump; inline bool solve(std::string s, char c) { if (s.size() == 1) { return s[0] == c; } if (ump.find(s) != ump.end()) return ump[s]; bool ret = false; for (int i = 0; i < s.size(); ++i) { for (int j = i + 1; j < s.size(); ++j) { if (s[i] == s[j]) { std::string next_pass{s[i]}; for (int k = 0; k < s.size(); ++k) { if (k != i && k != j) next_pass += s[k]; } ret = solve(next_pass, c); } else { char thirdColor = getThirdColor(s[i], s[j]); std::string next_pass{thirdColor}; for (int k = 0; k < s.size(); ++k) { if (k != i && k != j) next_pass += s[k]; } ret = solve(next_pass, c); } if (ret) break; } if (ret) break; } return ump[s] = ret; } int main() { int n; std::cin >> n; std::string s; std::cin >> s; std::string modified; modified.reserve(n); std::unordered_map<char, int> cnt; for (int i = 0; i < s.size(); ++i) { if (modified.empty()) { modified += s[i]; ++cnt[s[i]]; } else if (modified.back() == s[i] && cnt[s[i]] == 1) { modified += s[i]; ++cnt[s[i]]; } else if (modified.back() != s[i]) { modified += s[i]; ++cnt[s[i]]; } } std::vector<char> possible{ B , G , R }; for (int i = 0; i < possible.size(); ++i) { ump.clear(); if (solve(modified, possible[i])) { std::cout << possible[i]; } } std::cout << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t, n, k; cin >> t; while (t--) { long long ats = 0; cin >> n >> k; while (n) { ats += n % k; n -= n % k; while (n % k == 0 && n) n /= k, ats++; } cout << ats << n ; } } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2000001; int n, m, x; pair<int, int> a[maxn]; int st[maxn], q[maxn], cnt, ans[maxn], tail, top; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %d , &a[i].first); } int x; for (int i = 1; i <= n; i++) { scanf( %d , &x); a[n + i].first = m - 1 - x; a[n + i].second = 1; } sort(a + 1, a + 1 + 2 * n); top = 0; tail = 0; for (int i = 1; i <= 2 * n; i++) { if (a[i].second == 0) st[++top] = a[i].first; else { if (top == 0) q[++tail] = a[i].first; else ans[++cnt] = (m - 1 - a[i].first + st[top--]) % m; } } for (int i = 1; i <= tail; i++) ans[++cnt] = (st[i] + m - 1 - q[tail - i + 1]) % m; sort(ans + 1, ans + 1 + n); reverse(ans + 1, ans + 1 + n); for (int i = 1; i <= n; i++) printf( %d , ans[i]); cout << endl; fclose(stdin); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 15; int n, a[MAXN], b[MAXN], inf = 1e9 + 19, pos, st[MAXN], en[MAXN], LIS, cnt[MAXN]; void fil() { b[0] = -inf; for (int i = 1; i < MAXN; i++) b[i] = inf; } int bs(int x) { int s = 0, e = 1e5 + 10; while (s + 1 < e) { int mid = (s + e) / 2; if (b[mid] < x) s = mid; else e = mid; } if (b[s] >= x) { b[s] = x; return s; } else { b[e] = x; return e; } } int main() { cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; fil(); for (int i = 0; i < n; i++) { pos = bs(a[i]); st[i] = pos; } for (int i = 0; i <= n; i++) if (b[i] != inf) LIS = i; fil(); for (int i = n - 1; i >= 0; i--) { pos = bs(-a[i]); en[i] = pos; } for (int i = 0; i < n; i++) if (st[i] + en[i] - 1 == LIS) cnt[st[i]]++; for (int i = 0; i < n; i++) { if (st[i] + en[i] - 1 != LIS) cout << 1; else if (cnt[st[i]] == 1) cout << 3; else cout << 2; } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; vector<char> s(n); long long ans = 0; for (int i = 0; i < n; ++i) { cin >> s[i]; if (i > 0 and s[i] == . and s[i - 1] == . ) ++ans; } for (int i = 0; i < m; ++i) { int pos; cin >> pos; --pos; char c; cin >> c; if (c == . and s[pos] != . ) { if (pos > 0 and s[pos - 1] == . ) ++ans; if (pos < n and s[pos + 1] == . ) ++ans; } else if (c != . and s[pos] == . ) { if (pos > 0 and s[pos - 1] == . ) --ans; if (pos < n and s[pos + 1] == . ) --ans; } s[pos] = c; cout << ans << n ; } } |
#include <bits/stdc++.h> using namespace std; char ans[1005][1005]; int x[1005][1005], y[1005][1005]; int n; int dx[] = {1, 0, -1, 0}; int dy[] = {0, 1, 0, -1}; bool isvalid(int i, int j) { if (i < 0 || j < 0 || i >= n || j >= n) return 0; return 1; } void color(int i, int j) { if (i < 0 || j < 0 || i >= n || j >= n || ans[i][j] == Z || x[i][j] != -1 || y[i][j] != -1) return; ans[i][j] = Z ; for (int k = 0; k < 4; k++) color(i + dx[k], j + dy[k]); } void DFS(int i, int j, char ch, int ka, int kh) { if (i < 0 || j < 0 || i >= n || j >= n || x[i][j] == -1 || ans[i][j] != K ) return; ans[i][j] = ch; if (isvalid(i + 1, j) && x[i + 1][j] == ka && y[i + 1][j] == kh) { DFS(i + 1, j, U , ka, kh); } if (isvalid(i - 1, j) && x[i - 1][j] == ka && y[i - 1][j] == kh) { DFS(i - 1, j, D , ka, kh); } if (isvalid(i, j + 1) && x[i][j + 1] == ka && y[i][j + 1] == kh) { DFS(i, j + 1, L , ka, kh); } if (isvalid(i, j - 1) && x[i][j - 1] == ka && y[i][j - 1] == kh) { DFS(i, j - 1, R , ka, kh); } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cin >> x[i][j] >> y[i][j]; ans[i][j] = K ; } } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (x[i][j] == -1 && y[i][j] == -1) color(i, j); else if (x[i][j] == i + 1 && y[i][j] == j + 1) DFS(i, j, X , i + 1, j + 1); } } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (ans[i][j] == Z ) { if (isvalid(i + 1, j) && x[i + 1][j] == -1) { ans[i][j] = D ; ans[i + 1][j] = U ; } else if (isvalid(i - 1, j) && x[i - 1][j] == -1) { ans[i][j] = U ; ans[i - 1][j] = D ; } else if (isvalid(i, j + 1) && x[i][j + 1] == -1) { ans[i][j] = R ; ans[i][j + 1] = L ; } else if (isvalid(i, j - 1) && x[i][j - 1] == -1) { ans[i][j] = L ; ans[i][j - 1] = R ; } } } } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (ans[i][j] == K || ans[i][j] == Z ) { cout << INVALID ; return 0; } } } cout << VALID n ; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) cout << ans[i][j]; cout << n ; } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC target( sse4 ) using namespace std; template <class T> using pq = priority_queue<T>; template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>; template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); 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 first = 0; cerr << { ; for (auto& i : x) cerr << (first++ ? , : ), __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...); } const int MOD = 1000000007; const char nl = n ; const int MX = 100001; void solve() { int N; cin >> N; int A[N]; for (int i = 0; i < (N); i++) cin >> A[i]; int sum = 0; for (int i = 0; i < (N); i++) sum += A[i]; if (sum % 2) { cout << NO << nl; return; } int cnt = 0; vector<int> ops; for (int i = 0; i < (N); i++) { cnt += A[i]; if (A[i] == 0) { if (cnt % 2) { ops.push_back(i - 1); int X = 0; for (int j = 0; j < (3); j++) X ^= A[i - 1 + j]; for (int j = 0; j < (3); j++) A[i - 1 + j] = X; } if (A[i] == 0) { cnt = 0; } else cnt++; } } sum = 0; for (int i = 0; i < (N); i++) sum += A[i]; if (sum == N) { cout << NO << nl; return; } int fz = 0; for (int i = (N)-1; i >= 0; i--) if (A[i] == 0) fz = i; while (fz > 0) { ops.push_back(fz - 2); A[fz - 2] = 0; A[fz - 1] = 0; A[fz] = 0; fz -= 2; } for (int i = 0; i < (N - 1); i++) { if (A[i] == 0 && A[i + 1] == 1) { ops.push_back(i); A[i] = 0; A[i + 1] = 0; A[i + 2] = 0; } } cout << YES << nl; cout << (int)(ops).size() << nl; for (auto& a : ops) { cout << a + 1 << ; } cout << nl; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int T = 1; cin >> T; while (T--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n - 1; i += 2) { cout << a[i + 1] << << -1 * a[i] << ; } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX_L = 20; const long long MOD = 1e9 + 7; const long long INF = 1e9 + 7; int p = 100000007; template <typename T> void scan(T &x) { x = 0; bool neg = 0; register T c = getchar(); if (c == - ) neg = 1, c = getchar(); while ((c < 48) || (c > 57)) c = getchar(); for (; c < 48 || c > 57; c = getchar()) ; for (; c > 47 && c < 58; c = getchar()) x = (x << 3) + (x << 1) + (c & 15); if (neg) x *= -1; } template <typename T> void print(T n) { bool neg = 0; if (n < 0) n *= -1, neg = 1; char snum[65]; long long int i = 0; do { snum[i++] = n % 10 + 0 ; n /= 10; } while (n); --i; if (neg) putchar( - ); while (i >= 0) putchar(snum[i--]); putchar( n ); } bool semiprime(long long int num) { int cnt = 0; for (int i = 2; cnt < 2 && i * i <= num; ++i) while (num % i == 0) num /= i, ++cnt; if (num > 1) ++cnt; return cnt == 2; } bool prime(long long int n) { if (n <= 1) return false; if (n <= 3) return true; if (n % 2 == 0 || n % 3 == 0) return false; for (int i = 5; i * i <= n; i = i + 6) if (n % i == 0 || n % (i + 2) == 0) return false; return true; } vector<pair<long long int, long long int>> g[100001]; long long int dfs(long long int nod, long long int y) { long long int ret = 0; for (auto x : g[nod]) { if (x.first != y) { ret = max(ret, x.second + dfs(x.first, nod)); } } return ret; } void overpower() { long long int n, x, y, z; long long int tot = 0; cin >> n; for (int i = 0; i < n - 1; i++) { cin >> x >> y >> z; g[x].push_back(make_pair(y, z)); g[y].push_back(make_pair(x, z)); tot += 2 * z; } cout << tot - dfs(1, 0); } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long int t; t = 1; long long int i; for (long long int i = i = 0; i < t; i++) { overpower(); } } |
#include <bits/stdc++.h> using namespace std; int n, k, Ord[100000 + 5]; long long ans, Set[100000 + 5][5]; inline int gcd(int x, int y) { return !y ? x : gcd(y, x % y); } int main() { scanf( %d%d , &n, &k); printf( %d n , (n * 6 - 1) * k); for (int i = 0; i < n; i++) printf( %d %d %d %d n , (1 + i * 6) * k, (2 + i * 6) * k, (3 + i * 6) * k, (5 + i * 6) * k); return 0; } |
#include <bits/stdc++.h> using namespace std; long long int max(long long int a, long long int b) { if (a > b) return a; else return b; } long long int min(long long int a, long long int b) { if (a < b) return a; else return b; } const int dx[4] = {-1, 1, 0, 0}; const int dy[4] = {0, 0, -1, 1}; int XX[] = {-1, -1, -1, 0, 0, 1, 1, 1}; int YY[] = {-1, 0, 1, -1, 1, -1, 0, 1}; vector<pair<long long int, long long int> > edges; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); long long int n, m, i, j, k, l, r, ind, c, d, x; cin >> n >> k; j = k + 1; long long int z = n / k; long long int count = 0, ans = 2 * z; j = 2; vector<long long int> vec, vec2; for (i = 1; i <= k; i++) { count = 0; while (count < z && j <= n) { if (count == 0) edges.push_back(make_pair(1, j)); else edges.push_back(make_pair(j - 1, j)); j++; count++; } vec2.push_back(count); vec.push_back(j - 1); } if (j == n + 1) { sort(vec2.begin(), vec2.end()); long long int sum = vec2[vec2.size() - 1]; if (vec2.size() >= 2) sum += vec2[vec2.size() - 2]; cout << sum << n ; for (i = 0; i < edges.size(); i++) { cout << edges[i].first << << edges[i].second << n ; } return 0; } long long int flag = 0; for (i = 0; i < vec.size(); i++) { if (j == n + 1) break; edges.push_back(make_pair(vec[i], j)); j++; flag++; } if (flag == 1) ans++; else if (flag > 1) ans += 2; cout << ans << n ; for (i = 0; i < edges.size(); i++) { cout << edges[i].first << << edges[i].second << n ; } } |
#include <bits/stdc++.h> using namespace std; char arr[1000007]; void sieve() { arr[0] = 1; arr[1] = 1; for (int i = 4; i <= 1000007; i += 2) arr[i] = 1; for (int i = 3; i * i <= 1000007; i += 2) { if (arr[i] == 0) { for (int j = i; i * j <= 1000007; j++) { arr[i * j] = 1; } } } } int main() { sieve(); int n; cin >> n; int p = n + 1; if (n < 3) { if (n == 1) { cout << 1 << endl; cout << 1 << endl; return 0; } else { cout << 1 << endl; cout << 1 1 << endl; return 0; } } cout << 2 << endl; for (int i = 2; i <= p; i++) { if (arr[i] == 0) cout << 1 ; else cout << 2 ; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; map<int, vector<int> > m; int main() { int n, k, query; scanf( %d %d , &n, &k); for (int i = 0; i < (int)(k); i++) { scanf( %d , &query); m[query - 1].push_back(i); } int ans = 0; std::vector<int>::iterator low; for (int i = 0; i < (int)(n); i++) { if (m[i].size() == 0) { ans += 3; if (i == 0 || i == n - 1) ans--; } else { if (i - 1 >= 0) { low = lower_bound(m[i - 1].begin(), m[i - 1].end(), m[i][0]); if (low == m[i - 1].end() || m[i - 1].size() == 0) { ans++; } } if (i + 1 < n) { low = lower_bound(m[i + 1].begin(), m[i + 1].end(), m[i][0]); if (low == m[i + 1].end() || m[i + 1].size() == 0) ans++; } } } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int mx = 1e6 + 1; int n, m; string s[3]; int dp[mx][8]; bool isok(int i, int j) { int cnt = 0; for (int k = 0; k < 2; k++) cnt += ((i >> k) & 1) + ((j >> k) & 1); if (cnt % 2 == 0) return false; if (n == 2) return true; cnt = 0; for (int k = 1; k < 3; k++) cnt += ((i >> k) & 1) + ((j >> k) & 1); return cnt & 1; } int solve(int idx, int msk) { if (idx == m) return 0; int &ans = dp[idx][msk]; if (~ans) return ans; ans = 1e9; for (int i = 0; i < (1 << n); i++) if (idx == 0 || isok(msk, i)) { int cur = 0; for (int j = 0; j < n; j++) cur += ((i >> j) & 1) != (s[j][idx] - 0 ); ans = min(ans, cur + solve(idx + 1, i)); } return ans; } int main() { cin.tie(nullptr); ios_base::sync_with_stdio(0); cin >> n >> m; if (n == 1) return cout << 0 , 0; if (n >= 4) return cout << -1 , 0; for (int i = 0; i < n; i++) cin >> s[i]; int ans = 1e9; memset(dp, -1, sizeof dp); for (int i = 0; i < (1 << n); i++) ans = min(ans, solve(0, i)); cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; long long N, M; long long Arb[800002], Value[100002], Lazy[800002], Colour[800002]; void Build(long long K, long long L, long long R) { long long Mid = (L + R) / 2; if (L == R) { Colour[K] = L; return; } Build(2 * K, L, Mid); Build(2 * K + 1, Mid + 1, R); } void Read() { cin >> N >> M; } void Relax(long long K, long long L, long long R) { if (Lazy[K] == 0) return; Colour[2 * K] = Colour[2 * K + 1] = Colour[K]; Arb[2 * K] += Lazy[K] * ((L + R) / 2 - L + 1); Arb[2 * K + 1] += Lazy[K] * (R - (L + R) / 2); if (L != R) { Lazy[2 * K] += Lazy[K]; Lazy[2 * K + 1] += Lazy[K]; } Lazy[K] = 0; } void Update(long long K, long long L, long long R, long long Poz1, long long Poz2, long long Val) { long long Mid = (L + R) / 2; Relax(K, L, R); if (L > Poz2 || R < Poz1 || K > 4 * N) return; if (Poz1 <= L && R <= Poz2) { if (Colour[K] > 0) { Arb[K] += abs(Colour[K] - Val) * (R - L + 1); Lazy[K] += abs(Colour[K] - Val); Colour[K] = Val; } else { Update(K * 2, L, Mid, Poz1, Poz2, Val); Update(K * 2 + 1, Mid + 1, R, Poz1, Poz2, Val); Arb[K] = Arb[2 * K] + Arb[2 * K + 1]; Colour[K] = Val; } return; } Update(2 * K + 1, Mid + 1, R, Poz1, Poz2, Val); Update(2 * K, L, Mid, Poz1, Poz2, Val); Arb[K] = Arb[2 * K] + Arb[2 * K + 1]; Colour[K] = Colour[K * 2] == Colour[K * 2 + 1] ? Colour[K * 2] : 0; } long long Qwery(long long K, long long L, long long R, long long Poz1, long long Poz2) { Relax(K, L, R); long long Mid = (L + R) / 2; if (L > Poz2 || R < Poz1) return 0; if (Poz1 <= L && R <= Poz2) return Arb[K]; return Qwery(2 * K, L, Mid, Poz1, Poz2) + Qwery(2 * K + 1, Mid + 1, R, Poz1, Poz2); } void Browse() { long long i; for (i = 1; i <= M; i++) { long long type, a, b, c; cin >> type >> a >> b; if (type == 1) { cin >> c; Update(1, 1, N, a, b, c); } if (type == 2) cout << Qwery(1, 1, N, a, b) << n ; } } int main() { Read(); Build(1, 1, N); Browse(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 15; const int inf = 1e9; const int md = 1e9 + 7; const int shift = 1 << 17; int n, m; vector<vector<int> > g; set<pair<int, int> > br; int timer; int tin[maxn], fup[maxn]; int used[maxn]; void dfs(int v, int p = -1) { used[v] = 1; tin[v] = fup[v] = timer++; for (int i = 0; i < g[v].size(); ++i) { int to = g[v][i]; if (to == p) continue; if (used[to]) fup[v] = min(fup[v], tin[to]); else { dfs(to, v); fup[v] = min(fup[v], fup[to]); if (fup[to] > tin[v]) { br.insert(make_pair(to, v)); br.insert(make_pair(v, to)); } } } } int color[maxn]; int first[maxn]; int d[maxn]; vector<int> eu; int z[shift * 2]; int c; void dfs2(int v, int tekc, int len, int p = -1) { used[v] = 1; color[v] = tekc; d[tekc] = len; for (int i = 0; i < g[v].size(); ++i) { int to = g[v][i]; if (to == p) continue; if (used[to]) continue; if (br.find(make_pair(v, to)) != br.end()) { eu.push_back(c + 1); first[c + 1] = eu.size() - 1; ++c; dfs2(to, c, len + 1, v); eu.push_back(tekc); } else dfs2(to, tekc, len, v); } } void build() { for (int i = 0; i < eu.size(); ++i) z[i + shift] = eu[i]; for (int i = eu.size(); i < shift; ++i) z[i + shift] = n + 1; for (int i = shift - 1; i > 0; --i) if (d[z[i * 2]] < d[z[i * 2 + 1]]) z[i] = z[i * 2]; else z[i] = z[i * 2 + 1]; } int get(int v, int tl, int tr, int l, int r) { if (l > r) return n + 1; if (l == tl && r == tr) return z[v]; int tm = (tl + tr) / 2; int ans1 = get(v * 2, tl, tm, l, min(r, tm)); int ans2 = get(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r); return d[ans1] < d[ans2] ? ans1 : ans2; } int main() { cin >> n >> m; g.resize(n); for (int i = 0; i < m; ++i) { int v, u; cin >> v >> u; --v, --u; g[v].push_back(u); g[u].push_back(v); } dfs(0); memset(used, 0, sizeof(used)); memset(first, -1, sizeof(first)); eu.push_back(0); first[0] = 0; dfs2(0, 0, 0); d[n + 1] = inf; build(); int k; cin >> k; for (int i = 0; i < k; ++i) { int s, l; cin >> s >> l; --s, --l; int L = first[color[s]]; int R = first[color[l]]; if (L > R) swap(L, R); int lca = get(1, 0, shift - 1, L, R); cout << d[color[s]] + d[color[l]] - 2 * d[lca] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 5; int q, n, a[N], pos[N], dp[N], pre[N]; long long ans = 0; int main() { scanf( %d , &q); while (q--) { ans = 0; scanf( %d , &n); for (int i = 1; i <= n; i++) pre[i] = -1; for (int i = 0; i < n; i++) { scanf( %d , &a[i]); dp[i] = 0; pos[i] = N; if (pre[a[i]] == -1) { pre[a[i]] = i; } } dp[N - 1] = 0; for (int i = 0; i < n; i++) { if (a[i + 1] == a[i]) pos[i + 1] = i; else { if (a[i + 1] == a[pos[i] - 1]) { pos[i + 1] = pos[i] - 1; continue; } int tmp = i; while (a[i + 1] != a[pos[tmp] - 1]) { tmp = pos[tmp] - 1; if (a[i + 1] == a[pos[tmp] - 1]) { pos[i + 1] = pos[tmp] - 1; break; } if (tmp == N - 1 || tmp < pre[a[i + 1]]) { pos[i + 1] = N; break; } } } } for (int i = 0; i < n; i++) { if (pos[i] != N) dp[i] = 1; } for (int i = 0; i < n; i++) { dp[i] += dp[pos[i] - 1]; ans += dp[i]; } printf( %lld n , ans); } } |
#include <bits/stdc++.h> using namespace std; const long long inf = 1e17; const int MAXM = 1e5 + 5; const int MAXN = 1e6 + 4; long long fact[MAXM]; long long nChoosek(long long n, long long k) { if (k > n) return 0; if (k * 2 > n) k = n - k; if (k == 0) return 1; long long result = n; for (long long i = 2; i <= k; ++i) { result *= (n - i + 1); result /= i; } return result; } int main() { long long n; cin >> n; long long Ans = 0; for (long long i = 5; i <= 7; i++) { Ans += nChoosek(n, i); } cout << Ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> inline void smin(T &a, U b) { if (a > b) a = b; } template <typename T, typename U> inline void smax(T &a, U b) { if (a < b) a = b; } int val[501000], deg[501000]; vector<int> adj[501000]; int main() { int n, m, u, v; scanf( %d%d , &n, &m); for (int i = 0; i < m; i++) { scanf( %d%d , &u, &v); adj[u].push_back(v); adj[v].push_back(u); deg[u]++, deg[v]++; } set<pair<int, int> > st; for (int i = 1; i <= n; i++) { if (adj[i].size() > 1) st.insert(pair<int, int>(adj[i].size(), i)); } while (!st.empty()) { pair<int, int> a = *st.begin(); if (a.first < 2) break; st.erase(a); val[a.second] ^= 1; u = a.second; deg[u] = 0; for (int i = 0; i < adj[u].size(); i++) { int v = adj[u][i]; if (val[v] == val[u]) { if (deg[v] > 1) st.erase(pair<int, int>(deg[v], v)); deg[v]++; if (deg[v] > 1) st.insert(pair<int, int>(deg[v], v)); deg[u]++; } else { if (deg[v] > 1) st.erase(pair<int, int>(deg[v], v)); deg[v]--; if (deg[v] > 1) st.insert(pair<int, int>(deg[v], v)); } } } for (int i = 1; i <= n; i++) printf( %d , val[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; #define endl n #define ll long long #define INF (ll)1e18 ll i, i1, j, k, k1, t, n, m, res, check1, a[200010], a1, b, d, v, dist[200010], dp[200010], s, s1, s2; vector<ll> adj[200010]; vector<array<ll, 3>> dadj[200010]; bool visited[200010]; void dfs(ll s) { for (auto u : adj[s]) { if (!visited[u]) { visited[u] = true; dist[u] = dist[s] + 1; dadj[dist[u]].push_back({-1, s, u}); d = max(d, dist[u]); dfs(u); } } } int main() { ios::sync_with_stdio(0); cin.tie(0); //ifstream cin( input.txt ); //ofstream cout( output.txt ); cin >> t; while (t--) { cin >> n; for (i = 0; i <= n; i++) { adj[i].clear(); dadj[i].clear(); visited[i] = false; dist[i] = 0; dp[i] = 0; } for (i = 2; i <= n; i++) { cin >> v; adj[v - 1].push_back(i - 1); adj[i - 1].push_back(v - 1); } for (i = 1; i < n; i++) { cin >> a[i]; } d = 0; visited[0] = true; dfs(0); dadj[0].push_back({0, -1, 0}); for (i = 1; i <= d; i++) { for (auto& u : dadj[i]) { u[0] = a[u[2]]; // cout << u[0] << << u[1] << << u[2] << endl; } // cout << endl; sort(dadj[i].begin(), dadj[i].end()); s = dadj[i].size(); s1 = dadj[i][0][0]; s2 = dadj[i][dadj[i].size() - 1][0]; // cout << s1 << << s2 << endl; for (auto& u : dadj[i]) { a1 = a[u[2]]; dp[u[2]] = max({dp[u[2]], dp[u[1]] + a1 - s1, dp[u[1]] + s2 - a1}); } k = 0; for (j = 0; j < s; j++) { if (dp[dadj[i][j][1]] - dadj[i][j][0] > dp[dadj[i][k][1]] - dadj[i][k][0]) { k = j; } dp[dadj[i][j][2]] = max(dp[dadj[i][j][2]], dadj[i][j][0] - dadj[i][k][0] + dp[dadj[i][k][1]]); } k = s - 1; for (j = s - 1; j >= 0; j--) { if (dp[dadj[i][j][1]] + dadj[i][j][0] > dp[dadj[i][k][1]] + dadj[i][k][0]) { k = j; } dp[dadj[i][j][2]] = max(dp[dadj[i][j][2]], dadj[i][k][0] - dadj[i][j][0] + dp[dadj[i][k][1]]); } } res = 0; for (i = 1; i < n; i++) { // cout << dp[i] << ; res = max(res, dp[i]); } // cout << endl; cout << res << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; map<int, int> mpp; map<int, int> tmp; multiset<int> adj[200005]; multiset<pair<int, int> > pairs; int cnt[200005]; int arra[100005]; int arrb[100005]; list<int> ans; void addpair(int u, int v) { pairs.insert(make_pair(u, v)); pairs.insert(make_pair(v, u)); } void removepair(int u, int v) { pairs.erase(pairs.find(make_pair(u, v))); pairs.erase(pairs.find(make_pair(v, u))); } int ispair(int u, int v) { if (pairs.find(make_pair(u, v)) == pairs.end()) return 0; return 1; } void bit() { printf( -1 n ); exit(0); } int main() { clock_t start = clock(); scanf( %d , &n); for (int i = 0; i < 2 * n; i++) cnt[i] = 0; for (int i = 0; i < n - 1; i++) { scanf( %d , arra + i); } for (int i = 0; i < n - 1; i++) { scanf( %d , arrb + i); } for (int i = 0; i < n - 1; i++) { int a = arra[i], b = arrb[i]; int ai = i * 2, bi = i * 2 + 1; if (a > b) bit(); if (tmp.count(a)) ai = tmp[a]; else { tmp[a] = ai; mpp[ai] = a; } if (tmp.count(b)) bi = tmp[b]; else { tmp[b] = bi; mpp[bi] = b; } cnt[ai]++; cnt[bi]++; addpair(ai, bi); adj[ai].insert(bi); adj[bi].insert(ai); } int tek1 = -1; int tek2 = -1; for (int i = 0; i < 2 * n; i++) { if (cnt[i] % 2 == 1) { if (tek2 != -1) bit(); else if (tek1 != -1) tek2 = i; else tek1 = i; } } if (tek1 != -1 && tek2 == -1) assert(0); list<int> ans; if (tek1 == -1) { tek1 = 0; } stack<int> st; st.push(tek1); while (!st.empty()) { int node = st.top(); if (adj[node].size() == 0) { ans.push_back(mpp[node]); st.pop(); } else { st.push(*adj[node].begin()); adj[*adj[node].begin()].erase(adj[*adj[node].begin()].find(node)); adj[node].erase(adj[node].begin()); } } for (int i = 0; i < 2 * n; i++) { if (adj[i].size() != 0) bit(); } for (list<int>::iterator it = ans.begin(); it != ans.end(); ++it) { printf( %d , *it); } } |
#include <bits/stdc++.h> using namespace std; int n, ans = 1, p, m; string s; set<int> buy, sell, extra; int main() { cin >> n; while (n--) { cin >> s >> p; if (s == ACCEPT ) { if (extra.find(p) != extra.end()) { for (auto it : extra) { if (it < p) buy.insert(it); else if (it > p) sell.insert(it); } ans = (ans + ans) % 1000000007; extra.clear(); } else if (buy.find(p) != buy.end()) { auto it = buy.end(); it--; if (*it != p) ans = 0; it = buy.find(p); buy.erase(it); for (auto it : extra) { sell.insert(it); } extra.clear(); } else { auto it = sell.find(p); assert(it != sell.end()); if (it != sell.begin()) ans = 0; sell.erase(it); for (auto it : extra) { buy.insert(it); } extra.clear(); } } else { if (buy.empty()) { if (sell.empty()) { extra.insert(p); } else { auto it = sell.begin(); if (p > *it) sell.insert(p); else extra.insert(p); } } else { auto it = buy.end(); it--; if (sell.empty()) { if (p < *it) buy.insert(p); else extra.insert(p); } else { auto jt = sell.begin(); if (p > *it && p < *jt) extra.insert(p); else if (p < *it) buy.insert(p); else sell.insert(p); } } } } long long int res = ((ans * 1LL) * (extra.size() + 1)) % 1000000007; return cout << res << n , false; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:102400000,102400000 ) using namespace std; template <class T, class U> inline void Max(T &a, U b) { if (a < b) a = b; } template <class T, class U> inline void Min(T &a, U b) { if (a > b) a = b; } inline void add(int &a, int b) { a += b; while (a >= 1000000007) a -= 1000000007; } int pow(int a, int b) { int ans = 1; while (b) { if (b & 1) ans = ans * (long long)a % 1000000007; a = (long long)a * a % 1000000007; b >>= 1; } return ans; } pair<int, pair<int, int> > b[200010]; int v[200010], f[200010], ans[200010]; int query(int first) { int ans = 0; while (first < 200010) ans += f[first], first += first & -first; return ans; } void upd(int first) { while (first > 0) f[first]++, first -= first & -first; } int main() { int i, j, k, n, m = 0; scanf( %d , &n); for (i = 0; i < n; i++) { scanf( %d%d , &j, &k); v[m++] = j; b[i].first = k; b[i].second = make_pair(j, i); } sort(v, v + m); m = unique(v, v + m) - v; sort(b, b + n); for (i = 0; i < n; i++) { k = lower_bound(v, v + m, b[i].second.first) - v + 1; ans[b[i].second.second] = query(k); upd(k); } for (i = 0; i < n; i++) printf( %d n , ans[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; int num[105]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { scanf( %1d , &num[i]); } int sum = 0; int flag = 0; for (int i = 1; i <= n; i++) { sum += num[i]; int t = 0; flag = 0; for (int j = i + 1; j <= n; j++) { if (num[j] == 0 && t == 0 && flag == 1) { if (j == n) { puts( YES ); return 0; } continue; } t += num[j]; if (t > sum) { break; } else if (t == sum) { t = 0; flag = 1; if (j == n) { puts( YES ); return 0; } } } } puts( NO ); return 0; } |
#include <bits/stdc++.h> using namespace std; struct point { int x, y, l, r; }; bool f(point a, point b) { return a.r > b.r; } point a[5000]; int par[5000]; void init(int n) { for (int i = 1; i <= n; i++) par[i] = i; } int root(int n) { if (par[n] == n) return n; return par[n] = root(par[n]); } int main() { int n, m, maxx = 0; cin >> n >> m; for (int i = 1; i <= m; i++) cin >> a[i].x >> a[i].y >> a[i].l >> a[i].r; sort(a + 1, a + m + 1, f); for (int i = 1; i <= m; i++) { init(n); for (int j = 1; j <= m; j++) { if (a[j].l > a[i].l) continue; int q1 = root(a[j].x), q2 = root(a[j].y); if (q1 != q2) par[q1] = q2; if (root(1) == root(n)) maxx = max(maxx, a[j].r - a[i].l + 1); } } if (!maxx) cout << Nice work, Dima! << endl; else cout << maxx << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int na, ma, nb, mb; cin >> na >> ma; char ch1[na + 5][ma + 5]; for (int i = 1; i <= na; i++) { for (int j = 1; j <= ma; j++) { cin >> ch1[i][j]; } } cin >> nb >> mb; char ch2[nb + 5][mb + 5]; for (int i = 1; i <= nb; i++) { for (int j = 1; j <= mb; j++) { cin >> ch2[i][j]; } } int x = -1, y = -1, mx = -1; for (int xx = -50; xx <= 50; xx++) { for (int yy = -50; yy <= 50; yy++) { int sum = 0; for (int i = 1; i <= na; i++) { for (int j = 1; j <= ma; j++) { if (((i + xx) >= 1 && (i + xx) <= nb) && ((j + yy) >= 1 && (j + yy) <= mb)) { sum += (ch1[i][j] - 0 ) * (ch2[i + xx][j + yy] - 0 ); } } } if (sum > mx) { mx = sum; x = xx; y = yy; } } } cout << x << << y << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long a, b, sum, s; cin >> a >> b >> s; sum = abs(a) + abs(b); if (sum <= s && (s - sum) % 2 == 0) { cout << YES << endl; } else { cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 7; const int MOD = 1e9 + 7; const int MAXN = (1 << 9) + 3; int k; int a[MAXN][MAXN]; void dien(int x) { if (x == 1) return; dien(x / 2); for (int i = 1; i <= x / 2; i++) { for (int j = 1; j <= x / 2; j++) { a[i + x / 2][j] = a[i][j + x / 2] = a[i][j]; a[i + x / 2][j + x / 2] = 1 - a[i][j]; } } } int main() { cin >> k; dien(1 << k); for (int i = 1; i <= 1 << k; i++) { for (int j = 1; j <= 1 << k; j++) { if (a[i][j] == 0) cout << * ; else cout << + ; } cout << endl; } return 0; } |
//To debug : g++ -g file.cpp -o code //to flush output : fflush(stdout) or cout.flush() //cout<<setprecision(p)<<fixed<<var //use 1LL<<i to for 64 bit shifting , (ll)2 because by default 2 is ll //take care of precedence rule of operators //do not forget to change the sizes of arrays and value of contants and other things after debugging #include<bits/stdc++.h> using namespace std; #define ll long long #define rep(i,a,n) for(i=a;i<n;++i) #define irep(i,n,a) for(i=n;i>a;--i) #define mod 1000000007 #define pb push_back #define big 9223372036854775807 #define big1 LONG_MAX #define big2 ll_MAX #define big3 1000000000 #define sma1 LONG_MIN #define sma2 ll_MIN #define sma3 -1000000000 #define mp make_pair #define dub double #define ivec vector<ll> #define lvec vector<long long> #define cvec vector<char> #define svec vector<string> #define mt make_tuple #define MOD 998244353 #define ld long double #define pi acos(-1.0) #define SZ(x) (ll)(x.size()) //comment the below if not required /* #define ss second.second #define ff first.first #define f first #define s second #define sf second.first #define fs first.second */ #define IOS std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL) //cout<< Case # <<c<< : <<ans<< n ; const ll N = 150001; ll a[5][N],n[5],x,y,temp,val,i,j,ans=LLONG_MAX; set<pair<ll,ll>> m; vector<ll> v[5][N]; int main() { IOS; rep(i,1,5) cin>>n[i]; rep(i,1,5) rep(j,1,n[i]+1) cin>>a[i][j]; rep(i,1,4) { cin>>val; rep(j,1,val+1) { cin>>x>>y; v[i+1][y].pb(x); } } rep(i,2,5) { m.clear(); rep(j,1,n[i-1]+1) { if(a[i-1][j]!=-1) m.insert({a[i-1][j],j}); } rep(j,1,n[i]+1) { for(auto u : v[i][j]) { if(a[i-1][u]!=-1) { auto it = m.find({a[i-1][u],u}); m.erase(it); } } if(SZ(m)) { auto it = m.begin(); a[i][j]+=(*it).first; } else a[i][j]=-1; for(auto u : v[i][j]) { if(a[i-1][u]!=-1) m.insert({a[i-1][u],u}); } } } rep(i,1,n[4]+1){ if(a[4][i]==-1) continue; ans = min(ans,a[4][i]); } if(ans==LLONG_MAX) ans = -1; cout<<ans<< n ; return 0; } |
#include <bits/stdc++.h> using namespace std; bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) { return (a.first > b.first); } struct greaterr { template <class T> bool operator()(T const &a, T const &b) const { return a > b; } }; int main() { int n; scanf( %d , &n); char ans[n]; int x, y; long long int suma = 0, sumb = 0; for (int i = 0; i < n; i++) { scanf( %d %d , &y, &x); if (suma + y - sumb <= 500) { suma += y; printf( A ); } else { sumb += x; printf( G ); } } return 0; } |
#include <bits/stdc++.h> long double pi = acos(-1); long long z = 1000000007; long long power(long long a, long long b) { if (b == 0) return 1; long long c = power(a, b / 2); if (b % 2 == 0) return c * c; else return c * c * a; } using namespace std; const int N = 1e6 + 7; void solve() { long long n; cin >> n; long long k; cin >> k; map<long long, long long> m; for (long long i = 0; i < n; i++) { long long x; cin >> x; m[x]++; } if (m.size() <= k) cout << 1 << endl; else if (k == 1 && m.size() > 1) cout << -1 << endl; else { long long ans = (m.size() - k) / (k - 1) + 1; if ((m.size() - k) % (k - 1) != 0) ans++; cout << ans << endl; } } int main() { long long t; cin >> t; while (t--) solve(); } |
#include <bits/stdc++.h> using namespace std; int get(long long a) { if (a < 4) return 0; if (a < 16) return 1; if (a < 82) return 2; if (a < 6724) return 0; if (a < 50626) return 3; if (a < 2562991876) return 1; return 2; } int main() { int cur = 0; int n; cin >> n; for (int i = 0; i < n; i++) { long long t; cin >> t; cur ^= get(t); } if ((cur) != 0) cout << Furlo ; else cout << Rublo ; } |
#include <bits/stdc++.h> using namespace std; int n, m, l; int pre[200010], other[200010], last[100010]; int flag[100010]; void connect(int x, int y) { pre[++l] = last[x]; last[x] = l; other[l] = y; } int dfs(int x, int fa) { flag[x] = 1; int cur(0); for (int p = last[x]; p; p = pre[p]) { if (other[p] == fa) continue; if (flag[other[p]] == 2) continue; int edge; if (!flag[other[p]]) edge = dfs(other[p], x); else edge = 0; if (edge) printf( %d %d %d n , x, other[p], edge); else if (cur) printf( %d %d %d n , cur, x, other[p]), cur = 0; else cur = other[p]; } flag[x] = 2; return cur; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) { int x, y; scanf( %d%d , &x, &y); connect(x, y); connect(y, x); } if (m & 1) printf( No solution n n ); else dfs(1, -1); return 0; } |
#include <bits/stdc++.h> const int MAX_N = (int)1e5 + 123; const double eps = 1e-6; const int inf = (int)1e9 + 123; using namespace std; int n; vector<int> ans[MAX_N]; int k; int main() { cin >> n; ans[1].push_back(1), ans[2].push_back(1); for (int i = 3, now = 2;; i++) { if (n - now + 1 >= i - 1) { k = i; for (int j = 1; j < i; j++) { ans[j].push_back(now); ans[i].push_back(now); now++; } } else break; } cout << k << endl; for (int i = 1; i <= k; i++) { for (auto j : ans[i]) cout << j << ; cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[1001][1001], ans[1001]; int main() { ios_base::sync_with_stdio(NULL); cin.tie(NULL); cout.tie(NULL); int n; cin >> n; int x = (n + 1) / 2 + 1 * ((n + 1) & 1); vector<pair<int, int> > v; for (int j = 1; j <= x; j++) { if (v.size() == n) break; v.push_back(make_pair(1, j)); } for (int i = 2; i <= x; i++) { if (v.size() == n) break; v.push_back(make_pair(i, x)); } cout << x << n ; for (pair<int, int> x : v) { cout << x.first << << x.second << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<pair<long long int, long long int> > adj[100005]; long long int sp = 0, mst = 0, p = 100003; int n, m; int main() { cin >> n >> m; long long int c = p - (n - 2); adj[1].push_back({2, c}); m--; for (int i = 2; i <= n - 2 + 1; i++, m--) adj[i].push_back({i + 1, 1}); if (m != 0) { for (int i = 1; i < n && m != 0; i++) { for (int j = i + 2; j <= n; j++) { adj[i].push_back({j, 1e7}); m--; if (m == 0) break; } } } cout << p << << p << endl; for (int i = 1; i < n; i++) { for (int j = 0; j < adj[i].size(); j++) cout << i << << adj[i][j].first << << adj[i][j].second << endl; } return 0; } |
#include<bits/stdc++.h> using namespace std; int main() { int t,n; cin >> t; while(t--) { cin >> n; int ans=0,k=n,p=n,h=0; while(ceil(sqrt(k))>=2 && k>2) { ans++; k=ceil(sqrt(k)); } cout << ans+n-2 << endl; k=n; int i=k-1; while(k>2) { int p=ceil(sqrt(k)); while(i>p) { cout << i << << k << endl; i--; } cout<< k << << i << endl; cout << k << << i << endl; k=ceil(sqrt(k)); i=k-1; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n; long long int i; cin >> n; std::vector<long long int> v; long long int s = 0; for (long long int i = 0; i < n; i++) { long long int val; cin >> val; s += val; if (i != (n - 1)) v.push_back(s); } if (s % 2 == 1) { cout << 0 << endl; return 0; } long long int c = 0; for (i = 0; i < v.size(); i++) { if (v[i] == s - v[i]) c++; } cout << c << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 35, M = 100005; int n, m, f, ans, e; char a[N][M]; int len[N], z[M], b[N][M], p[N][M]; vector<int> v[M]; void dfs(int pos) { if (f) return; z[pos] = 2; for (auto &i : v[pos]) if (!z[i]) dfs(i); else if (z[i] == 2) { f = 1; return; } z[pos] = 1; } bool check(int s, int t) { f = e = 0; z[0] = 0; v[0].clear(); for (int i = b[s][1]; i <= b[t][len[t]]; i++) v[i].clear(), z[i] = 0; for (int i = s; i <= t; i++) { v[0].push_back(b[i][1]); for (int j = s; j <= t; j++) { int l = 0; for (int k = 1; k <= len[i]; k++) { while (k + l <= len[i] && l + 1 <= len[j] && a[i][k + l] == a[j][l + 1]) ++l; if (l) { if (len[i] - k + 1 < len[j] && l == len[i] - k + 1) v[b[i][k]].push_back(b[j][l + 1]); if (len[j] < len[i] - k + 1 && l == len[j]) v[b[i][k]].push_back(b[i][k + l]); if (k > 1 && len[i] - k + 1 == len[j] && l == len[j]) v[b[i][k]].push_back(0); l = p[j][l]; } } } } if (!z[0]) dfs(0); if (f) return 0; for (int i = b[s][1]; i <= b[t][len[t]]; i++) if (!z[i]) { dfs(i); if (f) return 0; } return 1; } int main() { ios::sync_with_stdio(false); cin >> n; for (int i = 1; i <= n; i++) { cin >> (a[i] + 1); len[i] = strlen(a[i] + 1); for (int j = 1; j <= len[i]; j++) b[i][j] = ++m; } for (int i = 1; i <= n; i++) { int k = 0; for (int j = 2; j <= len[i]; j++) { while (k && a[i][k + 1] != a[i][j]) k = p[i][k]; if (a[i][k + 1] == a[i][j]) ++k; p[i][j] = k; } } int j = 1; for (int i = 1; i <= n; i++) { if (i > j) j = i; while (j <= n && check(i, j)) ++j; ans += j - i; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T1, class T2> ostream& operator<<(ostream& out, pair<T1, T2> p) { out << p.first << << p.second; return out; } template <class T1, class T2> istream& operator>>(istream& in, pair<T1, T2>& p) { in >> p.first >> p.second; return in; } template <class T> istream& operator>>(istream& in, vector<T>& v) { for (auto& x : v) in >> x; return in; } template <class T> ostream& operator<<(ostream& out, vector<vector<T>>& v) { for (auto& x : v) out << x << n ; return out; } template <class T> ostream& operator<<(ostream& out, vector<T>& v) { for (auto x : v) out << x << ; return out; } void solve() { int n; cin >> n; vector<int> a(n), b(n); cin >> a; iota(b.begin(), b.end(), 0); sort(b.begin(), b.end(), [&](int i, int j) { if (a[i] != a[j]) { return a[i] < a[j]; } return i < j; }); vector<pair<int, int>> ans; for (int i = 0; i < n; i++) { for (int j = 0; j < n - 1; j++) { if (b[j] > b[j + 1]) { ans.push_back({b[j + 1], b[j]}); swap(b[j], b[j + 1]); } } } cout << ans.size() << n ; for (auto p : ans) { cout << p.first + 1 << << p.second + 1 << n ; } } int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0), cerr.tie(0); ; int t; t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> #pragma warning(disable : 4996) FILE *in = stdin, *out = stdout; using namespace std; int n, ans[100005], N; int alpha[30]; char a[2005], b[2005], c[2005]; void input() { fscanf(in, %d , &n); fscanf(in, %s , &a[1]); fscanf(in, %s , &b[1]); } int most_fit(int start) { for (int i = (start); i <= (n); i++) if (a[i] == b[start]) return i; return 0; } void method1(int l, int r) { ans[++N] = r; ans[++N] = l; ans[++N] = r; for (int i = (1); i <= (r); i++) c[i] = a[l + i]; int t = l; for (int i = (r + 1); i <= (n); i++) c[i] = a[t--]; for (int i = (1); i <= (n); i++) a[i] = c[i]; } void method2(int A, int B, int C) { ans[++N] = C; ans[++N] = A + B; ans[++N] = C; ans[++N] = A; for (int i = (A + 1); i <= (A + C); i++) c[i] = a[i + B]; int t = A + B; for (int i = (A + C + 1); i <= (n); i++) c[i] = a[t--]; for (int i = (A + 1); i <= (n); i++) a[i] = c[i]; } void pro() { for (int i = (1); i <= (n); i++) alpha[a[i] - a ]++, alpha[b[i] - a ]--; for (int i = (0); i <= (25); i++) if (alpha[i] != 0) { fprintf(out, -1 ); return; } for (int i = (1); i <= (n); i++) { for (int j = (i); j <= (n); j++) { if (a[j] == b[n - i + 1]) { ans[++N] = n; ans[++N] = j - 1; ans[++N] = 1; c[1] = a[j]; for (int k = (2); k <= (j); k++) c[k] = a[k - 1]; int t = n; for (int k = (j + 1); k <= (n); k++) c[k] = a[t--]; for (int k = (1); k <= (n); k++) a[k] = c[k]; break; } } } fprintf(out, %d n , N); for (int i = (1); i <= (N); i++) { fprintf(out, %d , ans[i]); } } int main() { input(); pro(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; const long long INF = 1e18; int n; int p[N]; long long dif[N]; long long ans = INF; int id; void add(int l, int r, int val) { dif[l] += val; dif[r + 1] -= val; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; long long res = 0; for (int i = 1; i <= n; i++) { cin >> p[i]; res += (1LL) * abs(p[i] - i); if (p[i] >= i) { add(2, i, 1); add(i + 1, i + 1, (n - p[i]) - (p[i] - 1)); add(i + 2, i + 2 + (n - p[i]) - 1, -1); add(i + 2 + (n - p[i]), n, 1); } else { add(2, i - p[i] + 1, -1); add(i - p[i] + 2, i, 1); add(i + 1, i + 1, (n - p[i]) - (p[i] - 1)); add(i + 2, n, -1); } } for (int i = 1; i <= n; i++) { dif[i] += dif[i - 1]; res += dif[i]; if (res < ans) { ans = res, id = n - i + 1; if (id == n) id = 0; } } cout << ans << << id << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; queue<int> q1, q2, q3, q4, q5, q6; int main() { int n, x, ans = 0; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &x); if (x == 4) q1.push(i); else if (x == 8) q2.push(i); else if (x == 15) q3.push(i); else if (x == 16) q4.push(i); else if (x == 23) q5.push(i); else q6.push(i); } if (q1.empty() || q2.empty() || q3.empty() || q4.empty() || q5.empty() || q6.empty()) { printf( %d n , n - ans); return 0; } while (1) { if (q2.front() > q1.front()) { if (q3.front() > q2.front()) { if (q4.front() > q3.front()) { if (q5.front() > q4.front()) { if (q6.front() > q5.front()) { ans += 6; q1.pop(); q2.pop(); q3.pop(); q4.pop(); q5.pop(); q6.pop(); } else q6.pop(); } else q5.pop(); } else q4.pop(); } else q3.pop(); } else q2.pop(); if (q1.empty() || q2.empty() || q3.empty() || q4.empty() || q5.empty() || q6.empty()) break; } printf( %d n , n - ans); return 0; } |
#include <bits/stdc++.h> using namespace std; struct point { int x, y; }; point moves[2020]; queue<int> Q; const int lin[] = {1, -1, 0, 0}; const int col[] = {0, 0, 1, -1}; int A[2020][2020]; int X[3 * 2020], Y[3 * 2020]; int n; void new_point(int x, int y) { X[++X[0]] = x; Y[++Y[0]] = y; } void normalizare(int X[]) { sort(X + 1, X + X[0] + 1); int c = 1; for (int i = 2; i <= X[0]; i++) { if (X[c] != X[i]) { X[++c] = X[i]; } } X[0] = c; } void precomp() { normalizare(X); normalizare(Y); } void find(int x, int X[], int &poz) { int step = 0; for (; (1 << step) <= X[0]; step++) ; step--; poz = 0; for (int i = step; i >= 0; i--) { if (poz + (1 << i) <= X[0] && X[poz + (1 << i)] < x) { poz += (1 << i); } } poz++; } void vecini(int x, int y) { for (int t = 0; t < 4; t++) { int xx = x + lin[t], yy = y + col[t]; if (xx >= 0 && xx <= X[0] && yy >= 0 && yy <= Y[0] && A[xx][yy] == 0) { A[xx][yy] = 2; Q.push(xx + (yy << 13)); } } } void bf() { Q.push(0); A[0][0] = 2; while (!Q.empty()) { int x = Q.front() & ((1 << 13) - 1), y = Q.front() >> 13; Q.pop(); vecini(x, y); } } void solve() { precomp(); int x1, y1; find(moves[0].x, X, x1); find(moves[0].y, Y, y1); for (int i = 1; i <= n; i++) { int x2, y2, chg; if (moves[i].x == moves[i - 1].x) { x2 = x1; chg = 2 * (moves[i].y > moves[i - 1].y) - 1; find(moves[i].y, Y, y2); for (int j = y1; j != y2; j += chg) { A[x1][j] = 1; } A[x1][y2] = 1; } else { y2 = y1; chg = 2 * (moves[i].x > moves[i - 1].x) - 1; find(moves[i].x, X, x2); for (int j = x1; j != x2; j += chg) { A[j][y1] = 1; } A[x2][y1] = 1; } x1 = x2; y1 = y2; } bf(); long long sol = 0; for (int i = 1; i < X[0]; i++) { for (int j = 1; j < Y[0]; j++) { if (A[i][j] <= 1) { sol += (long long)(X[i + 1] - X[i]) * (Y[j + 1] - Y[j]); } } } cout << sol; } int main() { scanf( %d n , &n); int x = 0, y = 0; X[++X[0]] = x; Y[++Y[0]] = y; new_point(1, 1); for (int i = 1; i <= n; i++) { char c; int val; scanf( %c %d n , &c, &val); if (c == R ) { x += val; } else if (c == L ) { x -= val; } else if (c == D ) { y += val; } else { y -= val; } moves[i].x = x; moves[i].y = y; new_point(x, y); new_point(x + 1, y + 1); } solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; n /= 1000; if (n & 1) cout << 2 << endl; else cout << 1 << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); long long n, m; cin >> n >> m; vector<long long> v, h; for (long long idx = 0; idx < n; ++idx) { long long x; cin >> x; v.push_back(x); } for (long long idx = 0; idx < m; ++idx) { long long x1, x2, y; cin >> x1 >> x2 >> y; if (x1 > 1) continue; h.push_back(x2); } sort(v.begin(), v.end()); sort(h.begin(), h.end()); long long res = n + m; for (long long idx = 0; idx <= v.size(); ++idx) { long long lim = idx == v.size() ? 1000000000 : v[idx]; auto it = lower_bound(h.begin(), h.end(), lim); res = min(res, distance(it, h.end()) + idx); } cout << res; return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { long long n; cin >> n; string s; cin >> s; long long mini = n - 1, maxi = -1; for (long long i = 0; i < n; i++) { if (s[i] == 1 ) { mini = i; break; } } for (long long i = n - 1; i >= 0; i--) { if (s[i] == 1 ) { maxi = i; break; } } if (maxi == -1) { cout << n << endl; return; } cout << 2 * max(maxi + 1, n - mini) << endl; } int main() { long long t; cin >> t; while (t--) solve(); } |
#include <bits/stdc++.h> using namespace std; int main() { long long x1, y1, x2, y2, x, y; cin >> x1 >> y1 >> x2 >> y2; cin >> x >> y; x2 = x2 - x1; y2 = y2 - y1; if (x2 % x != 0 || y2 % y != 0) cout << NO << endl; else { if (((x2 / x) & 1) == ((y2 / y) & 1)) cout << YES << endl; else cout << NO << endl; } } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:1024000000,1024000000 ) using namespace std; const int P = 1000000007; int n, m; const int V = 5010; int main() { while (~scanf( %d%d , &n, &m)) { int mx = 0; for (int i = 1; i <= n; ++i) mx += (i - 1) / 2; if (mx < m) { puts( -1 ); continue; } int pr = 0, pre = 0; for (int i = 0; i <= n; ++i) { if (pre + (i - 1) / 2 > m) break; pre += (i - 1) / 2; pr = i; } int need = m - pre; for (int i = 1; i <= pr; ++i) printf( %d , i); int remain = n - pr; if (need != 0) { int np = -1; for (int i = pr + 1;; ++i) { int tc = 0; for (int j = 1; j <= pr; ++j) { if (i - j > j && i - j <= pr) tc++; } if (tc == need) { np = i; break; } } --remain; printf( %d , np); } for (int i = remain; i > 0; --i) printf( %d , 1000000000 - 30000 * i); puts( ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 4e6 + 10; const int p = 1009; int raw[maxn], cnt[maxn]; complex<double> F1[maxn], F2[maxn]; const double PI = acos(-1.0); int rev[maxn]; void init(vector<complex<double> >& A, int n) { A.clear(); A.shrink_to_fit(); int size = 1; while (size <= n) size *= 2; A.assign(size * 2, 0); } void FFT_init(int n) { int S = log2(n); for (int i = 0; i < n; i++) rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (S - 1)); } void FFT(complex<double>* A, int siz, int type) { int n = siz; FFT_init(n); for (int i = 0; i < n; i++) if (i < rev[i]) swap(A[i], A[rev[i]]); for (int i = 1; i < n; i *= 2) { complex<double> Wn(cos(PI / i), type * sin(PI / i)); for (int j = 0; j < n; j += i * 2) { complex<double> W(1, 0); for (int k = 0; k < i; k++) { complex<double> facx = A[j + k], facy = W * A[j + k + i]; A[j + k] = facx + facy; A[j + k + i] = facx - facy; W *= Wn; } } } if (type == -1) for (int i = 0; i < n; i++) A[i].real((A[i].real() / n + 0.5)); } vector<complex<double> > mul(vector<complex<double> > A, vector<complex<double> > B) { int n = A.size(), m = B.size(); int siz = n + m - 1; vector<complex<double> > C(siz); int fsiz = 1; while (fsiz <= siz) fsiz *= 2; fsiz *= 2; for (int i = 0; i < fsiz; i++) F1[i] = F2[i] = 0; for (int i = 0; i < n; i++) F1[i] = A[i]; for (int i = 0; i < m; i++) F2[i] = B[i]; FFT(F1, fsiz, 1); FFT(F2, fsiz, 1); for (int i = 0; i < fsiz; i++) F1[i] *= F2[i]; FFT(F1, fsiz, -1); for (int i = 0; i < siz; i++) { C[i] = ((long long)F1[i].real()) % p; } return C; } vector<complex<double> > solve(int l, int r) { if (l == r) { return vector<complex<double> >(cnt[l] + 1, 1); } int m = (l + r) / 2; return mul(solve(l, m), solve(m + 1, r)); } struct Node { int w; vector<complex<double> > P; Node(int w = 0, vector<complex<double> > P = {}) : w(w), P(P) {} bool operator<(const Node& X) const { return w > X.w; } }; priority_queue<Node> pq; vector<complex<double> > ans; signed main() { ios::sync_with_stdio(0); cin.tie(0); int n, m, k; cin >> n >> m >> k; for (int i = 1; i <= n; i++) { int x; cin >> x; cnt[x]++; } vector<complex<double> > ans = solve(1, m); cout << ((int)ans[k].real() + p) % p << n ; return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:102400000,102400000 ) using namespace std; const double eps = 1e-8; const int INF = 1e9 + 7; const long long inf = (1LL << 62); const int MOD = 1e9 + 7; const int M = 100010; const int maxn = 1001; const int lowbit(int x) { return x & -x; } int read() { int v = 0, f = 1; char c = getchar(); while (c < 48 || 57 < c) { if (c == - ) f = -1; c = getchar(); } while (48 <= c && c <= 57) v = v * 10 + c - 48, c = getchar(); return v * f; } struct timer { double t; timer() { t = clock(); } ~timer() { printf( nruntime %.3f s n , get_time()); } double get_time() { return (clock() - t) / CLOCKS_PER_SEC; } }; int N; int A[1100010], B[1100010]; int inv2 = 500000004; void fwt(int *a) { int i, j, k, l, t, x, y; for (i = 1; i < N; i <<= 1) { for (j = 0, l = N / (i << 1); j < N; j += i << 1) { for (k = 0, l = 0; k < i; ++k, l += t) { x = a[j + k]; y = a[j + k + i]; a[j + k] = (x + y) % MOD; a[j + k + i] = (x - y + MOD) % MOD; } } } } void wfwt(int *a) { int i, j, k, l, t, x, y; for (i = 1; i < N; i <<= 1) { for (j = 0, l = N / (i << 1); j < N; j += i << 1) { for (k = 0, l = 0; k < i; ++k, l += t) { x = a[j + k]; y = a[j + k + i]; a[j + k] = 1ll * (x + y) * inv2 % MOD; a[j + k + i] = 1ll * (x - y + MOD) * inv2 % MOD; } } } } int solve(int x) { int res = 0; while (x) { res += (x & 1); x >>= 1; } return res; } int qpower(int x, int y) { int res = 1; while (y) { if (y & 1) res = 1LL * res * x % MOD; x = 1LL * x * x % MOD; y >>= 1; } return res; } int ans = 0; char s[1100010]; int main() { int n; n = read(); scanf( %s , s); for (int i = 0; i < (1 << n); i++) { A[i] = s[i] - 0 ; } for (int i = 0; i < (1 << n); i++) { B[i] = 1 - A[i]; } N = 1 << n; fwt(A); fwt(B); for (int i = 0; i < (1 << n); i++) { A[i] = 1LL * A[i] * B[i] % MOD; } wfwt(A); for (int i = 0; i < (1 << n); i++) { ans += 3LL * A[i] * qpower(2, solve(i)) % MOD; ans %= MOD; } printf( %d n , ans); return 0; } |
//zxggtxdy! #include<bits/stdc++.h> using namespace std; const int M=52,N=2e3+7,p=998244353; int n,k,D,l[M],f1[N],f2[N],s[N],G[M][N],Q[M][N],dp[2][N]; inline long long pows(long long u,int v){ long long ans=1; while(v>0) {if(v&1) ans=ans*u%p; u=u*u%p,v=v>>1;} return ans; } inline int binom(int a,int b){ if(a<b||b<0) return 0; return 1ll*f1[a]*f2[a-b]%p*f2[b]%p; } inline int getval(int u,int q){ int A=0,B=0; if(u<0) return 1; if(u==0) return pows(1-q+p,p-2); for(int i=1;i<=u+2;i++) s[i]=(s[i-1]+binom(i,u)*pows(q,i))%p; int v=pows(q,p-2); for(int i=1;i<=u+2;i++){ int k=pows(v,i),b=s[i]*pows(v,i)%p,W=1ll*f1[u+2]*pows(i,p-2)%p; W=1ll*W*f2[i-1]%p*f2[u+2-i]%p; if((i+u)&1) W=p-W; A=(A+1ll*k*W)%p,B=(B+1ll*b*W)%p; } return pows(A-1+p,p-2)*B%p*pows(v,u)%p; } inline int getans(int u,int q){ return pows(pows(D,p-2)*(u-q*k)%p,q)*f2[q]%p; } signed main(){ cin>>n>>k,f1[0]=f2[0]=1,G[0][0]=1; for(int i=1;i<=n;i++) cin>>l[i],D+=l[i]; for(int i=1;i<=2005;i++) f1[i]=1ll*f1[i-1]*i%p,f2[i]=pows(f1[i],p-2); for(int i=1;i<=n;i++){ memset(dp,0,sizeof(dp)),dp[0][0]=1,dp[1][0]=(l[i]>k); for(int j=1;j<=l[i]/k;j++) dp[0][j]=getans(l[i],j); for(int j=1;j<l[i]/k;j++) dp[1][j]=getans(l[i]-k,j); memset(Q,0,sizeof(Q)); for(int a=0;a<=i;a++) for(int b=0;b<=D-l[i];b++) for(int c=0;c<=1;c++) for(int d=0;d<=l[i];d++) Q[a+c][b+d]=(Q[a+c][b+d]+1ll*G[a][b]*dp[c][d])%p; for(int a=0;a<=i;a++) for(int b=0;b<=D;b++) G[a][b]=Q[a][b]; } int ans=0; for(int a=n;a>=0;a--) for(int b=0;b<=D;b++){ if(a+b>0&&G[a][b]){ int Q=(D-(a+b)*k+p)%p*pows(D,p-2)%p,T=pows(1-Q+p,p-2-b)*f1[b]%p; ans=(ans+pows(p-1,a+b+1)*G[a][b]%p*T%p)%p; } } cout<<ans<<endl; return 0; } |
#include <bits/stdc++.h> using namespace std; char A[100 + 3], B[100 + 3], C[100 + 3], Ans[100 + 3]; int f[100 + 3][100 + 3][100 + 3], prei[100 + 3][100 + 3][100 + 3], prej[100 + 3][100 + 3][100 + 3], prek[100 + 3][100 + 3][100 + 3]; int Go[100 + 3][26], fail[100 + 3], la, lb, lc, len, ansi, ansj, ansk; int main() { scanf( %s%s%s , A + 1, B + 1, C + 1); la = strlen(A + 1); lb = strlen(B + 1); lc = strlen(C + 1); Go[0][C[1] - A ] = 1; Go[1][C[1] - A ] = 1; Go[1][C[2] - A ] = 2; for (int i = 2; i <= lc; i++) { int w = fail[i - 1]; for (; w && C[w + 1] != C[i]; w = fail[w]) ; if (C[i] == C[w + 1]) w++; fail[i] = w; for (int j = 0; j < 26; j++) { int w = i; for (; w && C[w + 1] - A != j; w = fail[w]) ; if (C[w + 1] - A == j) w++; Go[i][j] = w; } } memset(f, 130, sizeof(f)); f[0][0][0] = 0; for (int i = 0; i < la; i++) for (int j = 0; j < lb; j++) for (int k = 0; k < lc; k++) { if (f[i][j][k] < 0) continue; if (f[i + 1][j][k] < f[i][j][k]) { f[i + 1][j][k] = f[i][j][k]; prei[i + 1][j][k] = i; prej[i + 1][j][k] = j; prek[i + 1][j][k] = k; } if (f[i][j + 1][k] < f[i][j][k]) { f[i][j + 1][k] = f[i][j][k]; prei[i][j + 1][k] = i; prej[i][j + 1][k] = j; prek[i][j + 1][k] = k; } if (A[i + 1] == B[j + 1]) { int tk = Go[k][A[i + 1] - A ]; if (f[i + 1][j + 1][tk] < f[i][j][k] + 1) { f[i + 1][j + 1][tk] = f[i][j][k] + 1; prei[i + 1][j + 1][tk] = i; prej[i + 1][j + 1][tk] = j; prek[i + 1][j + 1][tk] = k; } } } for (int i = 1; i <= la; i++) for (int j = 1; j <= lb; j++) for (int k = 0; k < lc; k++) if (f[i][j][k] > f[ansi][ansj][ansk]) { ansi = i, ansj = j, ansk = k; } len = f[ansi][ansj][ansk]; if (!len) { printf( 0 ); return 0; } for (int w = len; w;) { int ti = prei[ansi][ansj][ansk], tj = prej[ansi][ansj][ansk], tk = prek[ansi][ansj][ansk]; if (f[ti][tj][tk] < f[ansi][ansj][ansk]) Ans[w--] = A[ansi]; ansi = ti, ansj = tj, ansk = tk; } printf( %s , Ans + 1); } |
#include <bits/stdc++.h> using namespace std; map<long long, bool> isMark; int main() { long long n, x, y, l; cin >> n >> l >> x >> y; bool b = 0, g = 0, d = 0, bd = 0; long long diff = y - x, B = y + x; long long tmp; long long mark = -1, mark2 = -1; bool n1 = 1, n2 = 1; for (int i = 0; i < n; i++) { cin >> tmp; isMark[tmp] = 1; b |= isMark.count(tmp - x); g |= isMark.count(tmp - y); d |= isMark.count(tmp - diff); bd |= isMark.count(tmp - B); if (b && g) { cout << 0 ; return 0; } if (d && n1) { long long idx = tmp + x; if (idx > l) { idx = tmp - y; if (idx >= 0) { mark = idx; } } else { mark = idx; } if (mark == -1) { d = 0; } else { n1 = 0; } } if (bd && n2) { mark2 = tmp - y; n2 = 0; } } if (b & !g) { cout << 1 n << y; } else if (g & !b) { cout << 1 n << x; } else if (d) { cout << 1 n ; cout << mark; } else if (bd) { cout << 1 n << mark2 << n ; } else { cout << 2 n ; cout << x << << y; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; inline int read() { char ch = getchar(); int x = 0, f = 1; while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = (x << 1) + (x << 3) - 0 + ch; ch = getchar(); } return x * f; } struct node { int x, y, z; bool operator<(const node W) const { return y < W.y; } } a[N]; int n; long long b[N]; int cnt; pair<long long, int> tr[N << 2]; long long lazy[N << 2]; long long ans; void pushup(int rt) { if (tr[rt << 1].first > tr[rt << 1 | 1].first) tr[rt] = tr[rt << 1]; else tr[rt] = tr[rt << 1 | 1]; tr[rt].first += lazy[rt]; } void build(int rt, int l, int r) { if (l == r) { tr[rt] = {b[l], l}; return; } int mid = l + r >> 1; build(rt << 1, l, mid); build(rt << 1 | 1, mid + 1, r); pushup(rt); } void update(int rt, int L, int R, int C, int l, int r) { if (L <= l && R >= r) { tr[rt].first += C; lazy[rt] += C; return; } int mid = l + r >> 1; if (L <= mid) update(rt << 1, L, R, C, l, mid); if (R > mid) update(rt << 1 | 1, L, R, C, mid + 1, r); pushup(rt); } pair<long long, int> query(int rt, int L, int R, long long tg, int l, int r) { if (L <= l && R >= r) { return {tr[rt].first + tg, tr[rt].second}; } int mid = l + r >> 1; if (L > mid) { return query(rt << 1 | 1, L, R, tg + lazy[rt], mid + 1, r); } else if (R <= mid) { return query(rt << 1, L, R, tg + lazy[rt], l, mid); } else { return max(query(rt << 1 | 1, mid + 1, R, tg + lazy[rt], mid + 1, r), query(rt << 1, L, mid, tg + lazy[rt], l, mid)); } } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d%d%d , &a[i].x, &a[i].y, &a[i].z); if (a[i].x > a[i].y) swap(a[i].x, a[i].y); b[++cnt] = a[i].x; b[++cnt] = a[i].y; } sort(b + 1, b + cnt + 1); cnt = unique(b + 1, b + cnt + 1) - (b + 1); for (int i = 1; i <= n; i++) { a[i].x = lower_bound(b + 1, b + cnt + 1, a[i].x) - b; a[i].y = lower_bound(b + 1, b + cnt + 1, a[i].y) - b; } build(1, 1, cnt); sort(a + 1, a + n + 1); long long tx = 2e9, ty = 2e9; for (int i = 1; i <= n; i++) { update(1, 1, a[i].x, a[i].z, 1, cnt); if (i < n && a[i].y == a[i + 1].y) continue; pair<long long, int> tmp = query(1, 1, a[i].y, 0, 1, cnt); if (tmp.first - b[a[i].y] > ans) { ans = tmp.first - b[a[i].y]; tx = b[tmp.second]; ty = b[a[i].y]; } } printf( %lld n , ans); printf( %lld %lld %lld %lld n , tx, tx, ty, ty); } |
#include <bits/stdc++.h> using namespace std; long long n, l, r, k; bool checks(long long s) { long long x = (k - r + l - 1) / (n + s); long long sp = k - r + l - 1 - x * (n + s); if (sp < r - l + 1) sp++; if (sp > r - l + 1) { return false; } if (s - sp > n - r + l - 1) { return false; } return true; } int main() { ios_base::sync_with_stdio(0); cin >> n >> l >> r >> k; if (l > r) r += n; if (k < r - l + 1) { cout << -1 ; return 0; } if (n < 1e6) { long long res = -1; long long s = 0, sp = 0; for (s = 0; s <= n; s++) { if (checks(s)) res = s; } cout << res << n ; } else { long long res = -1; long long m = k - r + l - 1; for (long long x = 1; x < 1e6; x++) { long long a, b; a = (m - x * n - r + l - 1) / x; b = (m - x * n + n - r + l) / (x + 1); b = min(b, n); if (a <= b && checks(b)) res = max(res, b); } long long sp = k - r + l - 1; if (sp < r - l + 1) sp++; if (sp >= 0 && sp <= r - l + 1) { res = max(res, n - r + l - 1 + sp); } cout << res << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int num[26][5] = { {1,0,0,1,0}, // a {1,1,0,2,0}, // b {2,0,0,1,1}, // c {2,1,0,1,2}, // d {1,1,0,1,1}, // e {2,1,0,2,1}, // f {2,2,0,2,2}, // g {1,2,0,2,1}, // h {1,1,0,1,1}, // i {1,2,0,1,2}, // j {1,0,1,2,0}, // k {1,1,1,3,0}, // l {2,0,1,2,1}, // m {2,1,1,2,2}, // n {1,1,1,2,1}, // o {2,1,1,3,1}, // p {2,2,1,3,2}, // q {1,2,1,3,1}, // r {1,1,1,2,1}, // s {1,2,1,2,2}, // t {1,0,2,2,1}, // u {1,1,2,3,1}, // v {1,2,1,1,3}, // w {2,0,2,2,2}, // x {2,1,2,2,3}, // y {1,1,2,2,2} // z }; int main() { int n; cin >> n; while (n--) { int a, b, c, d, e; cin >> a >> b >> c >> d >> e; for (int i = 0; i < 26; ++i) { if (a == num[i][0] && b == num[i][1] && c == num[i][2] && d == num[i][3] && e == num[i][4]) { cout << char(i + a ); break; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; struct node { long long w, id; bool friend operator<(node a, node b) { if (a.w == b.w) return a.id < b.id; else return a.w < b.w; } } a[1000004]; long long b[1000004][4]; long long l[1000004]; long long r[1000004]; int main() { long long n, x; cin >> n >> x; for (int i = 1; i <= n; ++i) { scanf( %lld , &a[i].w); a[i].id = i; } sort(a + 1, a + 1 + n); long long cnt = 1; b[cnt][0] = b[cnt][1] = a[1].id; b[cnt][3] = a[1].w; for (int i = 2; i <= n; ++i) { if (a[i].w == a[i - 1].w) b[cnt][1] = a[i].id; else { cnt++; b[cnt][0] = b[cnt][1] = a[i].id; b[cnt][3] = a[i].w; } } long long ans = 0; long long base = 0; long long lmax = 1; long long rmin = cnt; for (int i = 1; i <= cnt; ++i) { if (b[i][0] > base) { base = b[i][1]; l[i] = base; lmax = i; } else break; } base = 1e9; for (int i = cnt; i >= 1; --i) { if (b[i][1] < base) { base = b[i][0]; r[i] = base; rmin = i; } else break; } if (lmax < rmin) { for (int i = 1; i <= lmax; ++i) { int pos = upper_bound(r + (int)rmin, r + (int)cnt + 1, l[i]) - r; if (pos < cnt + 1) ans += (b[cnt][3] - b[pos - 1][3]) * (b[i + 1][3] - b[i][3]); } cout << ans + (x - b[cnt][3] + 1) * b[lmax + 1][3] + (b[cnt][3] - b[rmin - 1][3]) * b[1][3]; } else { cout << x * (x + 1) / 2 << endl; } } |
#include <bits/stdc++.h> using namespace std; string s; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int n, p, l = -1, r = 0, i, j, ans = 0; cin >> n >> p; cin >> s; n--, p--; if (p > n / 2) p = n - p; for (i = 0; i <= n / 2; i++) { if (s[i] != s[n - i]) { long long int dif = abs(s[i] - s[n - i]); ans += min(dif, 26 - dif); if (l < 0) l = i; else r = i; } } ans += min(abs(p - l), abs(p - r)); ans += max((r - l), 0LL); cout << (l < 0 ? 0 : ans) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxN = 1e3 + 9, lg = 19, MOD = 1e9 + 7, maxV = 1e6 + 9; pair<int, int> arr[3]; int dp[maxN][maxN]; pair<int, int> auxi[maxN][maxN]; bool vi[maxN][maxN]; int dst(pair<int, int> one, pair<int, int> two) { return abs(one.first - two.first) + abs(two.second - one.second); } const int dr[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}}; bool ins(int x, int y) { return x < maxN && y < maxN && y >= 0 && x >= 0; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n = 3; for (int i = 0; i < n; i++) cin >> arr[i].first >> arr[i].second; pair<int, int> begi = pair<int, int>(min(arr[0].first, arr[1].first), min(arr[0].second, arr[1].second)); pair<int, int> ende = pair<int, int>(max(arr[0].first, arr[1].first), max(arr[0].second, arr[1].second)); pair<int, int> clos = begi; for (int i = begi.first; i <= ende.first; i++) { for (int j = begi.second; j <= ende.second; j++) { if (dst(arr[2], clos) > dst(arr[2], pair<int, int>(i, j))) { clos = pair<int, int>(i, j); } } } queue<pair<int, int> > q; q.push(clos); memset(dp, -1, sizeof dp); dp[clos.first][clos.second] = 0; auxi[clos.first][clos.second] = pair<int, int>(-1, -1); while (q.size()) { pair<int, int> cr = q.front(); q.pop(); for (int i = 0; i < 4; i++) { int x = cr.first + dr[i][0], y = cr.second + dr[i][1]; if (!ins(x, y) || dp[x][y] != -1) continue; dp[x][y] = dp[cr.first][cr.second] + 1; auxi[x][y] = cr; q.push(pair<int, int>(x, y)); } } for (int i = 0; i < 3; i++) { pair<int, int> strt = arr[i]; while (strt != pair<int, int>(-1, -1)) { vi[strt.first][strt.second] = 1; strt = auxi[strt.first][strt.second]; } } vector<pair<int, int> > ans; for (int i = 0; i < maxN; i++) for (int j = 0; j < maxN; j++) if (vi[i][j]) ans.push_back(pair<int, int>(i, j)); cout << ans.size() << n ; for (pair<int, int> el : ans) cout << el.first << << el.second << n ; } |
#include <bits/stdc++.h> using namespace std; const int N = 2020; struct Slope { long long x, y; bool up; Slope() {} Slope(long long x, long long y, bool up) : x(x), y(y), up(up) {} bool operator<(const Slope& m) const { pair<long long, long long> p1 = {y, x}; pair<long long, long long> p2 = {m.y, m.x}; return (1LL * p1.first * p2.second < 1LL * p2.first * p1.second); } }; long long gcd(long long a, long long b) { return (b ? gcd(b, a % b) : a); } pair<long long, long long> getSlope(long long x, long long y) { long long G = gcd(x, y); x /= G; y /= G; if (x < 0) { x = -x; y = -y; } return {y, x}; } long long C(long long n, long long k = 2) { if (k > n) return 0; return n * (n - 1) / 2; } vector<Slope> v; vector<pair<long long, long long>> Point; long long Sweep(int centerIdx) { long long side1 = 0, side2 = 0, Ans = 0; for (int i = 0; i < (int)Point.size(); i++) if (i != centerIdx) { long long x = Point[i].first - Point[centerIdx].first; long long y = Point[i].second - Point[centerIdx].second; bool up; if (x > 0 || (x == 0 && y > 0)) up = true, side1++; else up = false, side2++; pair<long long, long long> m = getSlope(x, y); v.push_back(Slope(m.first, m.second, up)); } sort(v.begin(), v.end()); for (int i = 0; i < v.size(); i++) { if (v[i].up) side1--; else side2--; Ans += C(side1) * C(side2); if (v[i].up) side2++; else side1++; } v.clear(); return Ans; } int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) { int x, y; scanf( %d%d , &x, &y); Point.push_back({x, y}); } long long Ans = 0; for (int i = 0; i < n; i++) Ans += Sweep(i); printf( %I64d n , Ans / 2); return 0; } |
#include <bits/stdc++.h> const int N = 55; const int M = 2e4 + 5; const long long inf = 9223372036854775807ll; int n, m, i, j, k; long long a[N][M], sum[N][M], dp[M]; long long mx[3][M << 2]; inline void push_up(int c, int u) { mx[c][u] = std::max(mx[c][u << 1], mx[c][u << 1 | 1]); } void build(int l, int r, int u) { if (l == r) { mx[0][u] = mx[1][u] = mx[2][u] = -inf; return; } int mid = (l + r) >> 1; build(l, mid, u << 1); build(mid + 1, r, u << 1 | 1); push_up(0, u); push_up(1, u); push_up(2, u); } void modify(int c, int p, int l, int r, int u, long long v) { if (l == r) { mx[c][u] = v; return; } int mid = (l + r) >> 1; if (p <= mid) { modify(c, p, l, mid, u << 1, v); } else { modify(c, p, mid + 1, r, u << 1 | 1, v); } push_up(c, u); } long long range_max(int c, int ql, int qr, int l, int r, int u) { if (ql <= l && r <= qr) { return mx[c][u]; } long long res = -inf; int mid = (l + r) >> 1; if (ql <= mid) { res = std::max(res, range_max(c, ql, qr, l, mid, u << 1)); } if (mid < qr) { res = std::max(res, range_max(c, ql, qr, mid + 1, r, u << 1 | 1)); } return res; } int main() { scanf( %d %d %d , &n, &m, &k); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { scanf( %lld , a[i] + j); sum[i][j] = sum[i][j - 1] + a[i][j]; } } build(1, m, 1); for (int i = 1; i <= n; i++) { auto conb = [&](int x, int y) { long long res = 0; res += sum[x][y + k - 1] - sum[x][y - 1]; if (x < n) { res += sum[x + 1][y + k - 1] - sum[x + 1][y - 1]; } return res; }; for (int j = 1; j <= m - k + 1; j++) { dp[j] = 0; if (i == 1) { dp[j] = conb(i, j); continue; } if (j - k >= 1) { dp[j] = std::max(dp[j], range_max(0, 1, j - k, 1, m, 1)); } if (j + k <= m) { dp[j] = std::max(dp[j], range_max(0, j + k, m, 1, m, 1)); } dp[j] = std::max(dp[j], range_max(1, std::max(j - k + 1, 1), j, 1, m, 1) + sum[i][j - 1]); dp[j] = std::max(dp[j], range_max(2, j, j + k - 1, 1, m, 1) - sum[i][j + k - 1]); dp[j] += conb(i, j); } for (int j = 1; j <= m - k + 1; j++) { modify(0, j, 1, m, 1, dp[j]); modify(1, j, 1, m, 1, dp[j] - sum[i + 1][j + k - 1]); modify(2, j, 1, m, 1, dp[j] + sum[i + 1][j - 1]); } } long long ans = 0; for (int i = 1; i <= m; i++) { ans = std::max(ans, dp[i]); } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k = 0; cin >> n; int r[n]; for (int i = 0; i < n; ++i) { cin >> r[i]; if (r[i] % 2 == 1) ++k; } if (k % 2 == 0) cout << n - k; else cout << k; } |
#include <bits/stdc++.h> using namespace std; unsigned long long int ans = 1; int main() { int i, j, k, l, c = 0, fuck = 0; string s; cin >> s; l = s.size(); s += 9 ; for (i = 0; i < l; i++) { if (fuck == 1) { if (int(s[i] - 48) + int(s[i + 1] - 48) == 9) c += 1; else { if (c % 2 != 0) ans *= (c / 2 + 1); fuck = 0; } } if (fuck == 0) { if (int(s[i] - 48) + int(s[i + 1] - 48) == 9) { fuck = 1; c = 2; } } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> struct lazysegtree { vector<T1> v1; vector<T2> v2; int n; const T1 init_value1 = 0; const T2 init_value2 = 0; lazysegtree(int sz) { n = 1; while (true) { if (n >= sz) break; n *= 2; } v1.resize(2 * n, init_value1); v2.resize(2 * n, init_value2); for (int i = n - 1; i >= 0; i--) { v1[i] = func1(v1[i * 2], v1[i * 2 + 1]); } } lazysegtree(vector<T1> &x) { n = 1; while (true) { if (n >= x.size()) break; n *= 2; } v1.resize(2 * n, init_value1); v2.resize(2 * n, init_value2); for (int i = 0; i < x.size(); i++) { v1[n + i] = x[i]; } for (int i = n - 1; i >= 0; i--) { v1[i] = func1(v1[i * 2], v1[i * 2 + 1]); } } void propagate(int ind) { update(ind * 2, v2[ind]); update(ind * 2 + 1, v2[ind]); v2[ind] = init_value2; } void reflect(int ind) { if (ind == 0) return; reflect(ind / 2); if (ind < n) propagate(ind); } void mergeChildren(int ind) { v1[ind] = func2(func1(v1[ind * 2], v1[ind * 2 + 1]), v2[ind], get_size(ind)); } void update(int ind, T2 x) { v1[ind] = func2(v1[ind], x, get_size(ind)); v2[ind] = func2(v2[ind], x, 1); } void update(int l, int r, T2 x) { if (l >= r) return; int L = l, R = r; l += n; r += n; reflect(l); reflect(r - 1); while (true) { if (l % 2 == 1) { update(l, x); l++; } if (r % 2 == 1) { update(r - 1, x); r--; } if (l >= r) break; l /= 2; r /= 2; } l = L + n; r = R + n; while (true) { l /= 2; r = (r + 1) / 2; if (l <= 0) break; mergeChildren(l); mergeChildren(r - 1); } } T1 query(int l, int r) { T1 res1 = init_value1; T1 res2 = init_value1; if (l >= r) return res1; l += n; r += n; reflect(l); reflect(r - 1); while (true) { if (l % 2 == 1) { res1 = func1(res1, v1[l]); l++; } if (r % 2 == 1) { res2 = func1(v1[r - 1], res2); r--; } if (l >= r) break; l /= 2; r /= 2; } return func1(res1, res2); } T1 func1(T1 a, T1 b) { return a + b; } T1 func2(T1 a, T2 b, long long sz) { return a + b * sz; } long long get_size(int ind) { long long ret = 1; while (true) { if (ret > ind) { ret /= 2; return n / ret; } ret *= 2; } } void show() { int n = 1; for (int i = 1; i < v1.size(); i++) { for (int j = 0; j < n; j++) { if (j != 0) cout << ; cout << v1[i + j]; } cout << endl; i += n - 1; n *= 2; } } }; int main() { int n; cin >> n; vector<long long> a(n); for (int i = 0; i < n; i++) { scanf( %lld , &a[i]); } vector<long long> k(n - 1); for (int i = 0; i < n - 1; i++) { scanf( %lld , &k[i]); } map<int, int> mp; mp[0] = 0; for (int i = 1; i < n; i++) { if (a[i] - k[i - 1] == a[i - 1]) { (*mp.rbegin()).second = i; } else { mp[i] = i; } } lazysegtree<long long, long long> seg(a); int q; cin >> q; for (int i = 0; i < q; i++) { char c; int x, y; getchar(); scanf( %c %d %d , &c, &x, &y); if (c == + ) { x--; auto it = mp.upper_bound(x); it--; if ((*it).first != x) { int k = (*it).second; (*it).second = x - 1; mp[x] = k; it = mp.lower_bound(x); } seg.update((*it).first, (*it).second + 1, y); while (true) { it = mp.lower_bound(x); int A = (*it).second; if (A == n - 1) break; long long V1 = seg.query(A, A + 1), V2 = seg.query(A + 1, A + 2); long long dif = V1 + k[A] - V2; if (dif <= 0) break; it++; seg.update((*it).first, (*it).second + 1, dif); int k = (*it).second; mp.erase(it); it = mp.lower_bound(x); (*it).second = k; } } else { printf( %lld n , seg.query(x - 1, y)); } } return 0; } |
#include <bits/stdc++.h> using namespace std; struct E { int to, nxt, d; } b[100005 << 1]; int fst[100005], tot; void insert(int f, int t, int d) { b[++tot] = (E){t, fst[f], d}; fst[f] = tot; b[++tot] = (E){f, fst[t], d}; fst[t] = tot; } int in[100005]; int dfn[100005]; int deep[100005]; long long dis[100005]; int fa[100005][20]; int dfs_c; void dfs(int x) { for (int i = 1; i <= 17; i++) fa[x][i] = fa[fa[x][i - 1]][i - 1]; dfn[++dfs_c] = x; in[x] = dfs_c; for (int i = fst[x]; i; i = b[i].nxt) { int v = b[i].to; if (!in[v]) { fa[v][0] = x; deep[v] = deep[x] + 1; dis[v] = dis[x] + b[i].d; dfs(v); } } } int lca(int u, int v) { if (deep[u] > deep[v]) swap(u, v); int t = deep[v] - deep[u]; for (int i = 0; i <= 17; i++) if ((t >> i) & 1) v = fa[v][i]; if (u == v) return u; for (int i = 17; i >= 0; i--) if (fa[u][i] != fa[v][i]) { u = fa[u][i]; v = fa[v][i]; } return fa[u][0]; } long long query(int u, int v) { int l = lca(u, v); return dis[u] + dis[v] - 2 * dis[l]; } char s[5]; set<int> S; set<int>::iterator it; int main() { int n; scanf( %d , &n); int x, y, c; for (int i = 1; i < n; i++) { scanf( %d%d%d , &x, &y, &c); insert(x, y, c); } deep[1] = 1; fa[1][0] = 1; dfs(1); long long ans = 0; int m; scanf( %d , &m); for (int i = 1; i <= m; i++) { scanf( %s , s); if (s[0] == + ) { int y = 0, z = 0; scanf( %d , &x); S.insert(in[x]); it = S.find(in[x]); it++; if (it != S.end()) { y = dfn[*it]; ans += query(x, y); } it--; if (it != S.begin()) { it--; z = dfn[*it]; if (y) ans -= query(y, z); ans += query(x, z); } } if (s[0] == - ) { int y = 0, z = 0; scanf( %d , &x); it = S.find(in[x]); it++; if (it != S.end()) { y = dfn[*it]; ans -= query(x, y); } it--; if (it != S.begin()) { it--; z = dfn[*it]; if (y) ans += query(y, z); ans -= query(x, z); } S.erase(in[x]); } if (s[0] == ? ) { long long p = ans; if (S.size() > 1) { set<int>::iterator it2; it = S.begin(); it2 = S.end(); it2--; p += query(dfn[*it], dfn[*it2]); } printf( %I64d n , p / 2); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, k; long long f[1005][2005][4]; int main() { f[1][1][0] = f[1][1][1] = f[1][2][2] = f[1][2][3] = 1; cin >> n >> k; for (int i = 1; i <= n; i++) f[i][1][0] = f[i][1][1] = 1; for (int i = 2; i <= n; i++) { for (int j = 2; j <= k; j++) { f[i][j][0] = (f[i - 1][j][0] + f[i - 1][j - 1][1] + f[i - 1][j][2] + f[i - 1][j][3]) % 998244353; f[i][j][1] = (f[i - 1][j - 1][0] + f[i - 1][j][1] + f[i - 1][j][2] + f[i - 1][j][3]) % 998244353; f[i][j][2] = (f[i - 1][j - 1][0] + f[i - 1][j - 1][1] + f[i - 1][j][2] + f[i - 1][j - 2][3]) % 998244353; f[i][j][3] = (f[i - 1][j - 1][0] + f[i - 1][j - 1][1] + f[i - 1][j - 2][2] + f[i - 1][j][3]) % 998244353; } } long long ans = 0; for (int i = 0; i <= 3; i++) ans = (ans + f[n][k][i]) % 998244353; cout << ans; } |
#include <bits/stdc++.h> using namespace std; const int N = 3000 * 100 + 5; vector<pair<int, int> > adj[N]; pair<int, int> edge[N]; short d[N]; bool mark[N], edg[N], c[N]; int bad[N], par[N], m, n; void findd(int a, int e, int b) { while (a != b) { edg[e] = 1; if (a == edge[e].first) a = edge[e].second; else a = edge[e].first; e = par[a]; } return; } void DFS2(int v, int parr) { mark[v] = 1; par[v] = parr; int s = adj[v].size(); int temp = -1, temp2 = 0; if (c[v]) temp = v; for (int i = 0; i < s; i++) { int u = adj[v][i].first; int w = adj[v][i].second; if (!mark[u]) { DFS2(u, w); if (bad[u] != -1) { if (temp == -1) { temp = bad[u]; temp2 = par[bad[u]]; } else { findd(temp, temp2, v); findd(bad[u], par[bad[u]], v); temp = -1; } } } } bad[v] = temp; return; } void DFS(int v) { mark[v] = 1; int s = adj[v].size(); for (int i = 0; i < s; i++) { int u = adj[v][i].first; int w = adj[v][i].second; if (!mark[u]) { DFS(u); if (c[u]) { c[v] = 1 - c[v]; edg[w] = 1; } } } return; } void pp() { int t = 0; for (int i = 0; i < m; i++) { if (!edg[i]) t++; } printf( %d n , t); for (int i = 0; i < m; i++) { if (!edg[i]) printf( %d n , i + 1); } return; } int main() { int t = -1, x, y, k = 0; scanf( %d %d , &n, &m); for (int i = 0; i < n; i++) { scanf( %d , &d[i]); if (d[i] == -1) t = i; } for (int i = 0; i < m; i++) { scanf( %d %d , &x, &y); adj[--x].push_back(make_pair(--y, i)); adj[y].push_back(make_pair(x, i)); edge[i] = make_pair(x, y); } for (int i = 0; i < n; i++) { int s = adj[i].size(); if (d[i] == 0 && s % 2) { k++; c[i] = 1; } if (d[i] == 1 && s % 2 == 0) { k++; c[i] = 1; } } if (t != -1) { DFS(t); pp(); } else { t = 0; if (k % 2 == 1) { cout << -1 ; return 0; } DFS2(0, m); pp(); } } |
#include <bits/stdc++.h> using namespace std; int main() { string s; multiset<string> p; cin >> s; for (int i = 0; i < s.size(); i++) { if ((s[i] == < ) || (s[i] == > )) s[i] = ; } istringstream sin(s); multiset<string>::iterator it; string f; while (sin >> f) { if (f[0] != / ) { p.insert(f); cout << string(2 * (p.size() - 1), ) << < << f << > << endl; } else { cout << string(2 * (p.size() - 1), ) << < << f << > << endl; f = f.substr(1); it = p.find(f); if (it != p.end()) p.erase(it); } } } |
// Cutiepie is a hoe! #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize ( Ofast ) #pragma GCC target ( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx ) #include <bits/stdc++.h> using namespace std; #define TRACE #ifdef TRACE #define trace(...) __f(#__VA_ARGS__, __VA_ARGS__) template <typename Arg1> void __f(const char* name, Arg1&& arg1){ cerr << name << : << arg1 << std::endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args){ const char* comma = strchr(names + 1, , );cerr.write(names, comma - names) << : << arg1<< | ;__f(comma+1, args...); } #else #define trace(...) #endif #define rep(i, a) for(int i = 0; i < (a); ++i) #define repp(i, a, b) for(int i = a; i < (b); ++i) #define trav(a, x) for(auto& a : x) #define all(x) x.begin(), x.end() #define sz(x) (int)(x).size() #define fst first #define snd second #define mp make_pair #define pb push_back typedef long long ll; typedef long double ld; typedef pair<int, int> pii; typedef vector<int> vi; int a[1005][1005]; int ee[3][1005]; ll s[1005]; ll s2[1005]; void solve() { int n, k; cin>>n>>k; rep(i, k){ s[i] = 0; rep(j, n) { cin>>a[i][j]; s[i] += 1LL*a[i][j]; s2[i] += 1LL*a[i][j]*a[i][j]; } } fflush(stdout); int kk = 1; ll change, vdif; if(2*s[1] == s[0]+s[2]){ vdif = s[1]-s[0]; }else{ vdif = s[k-1]-s[k-2]; } repp(i, 1, k) { if(vdif != s[i]-s[i-1]){ change = s[i]-s[i-1]-vdif; kk = i; break; } } ll v2; if(kk<=2){ v2 = s2[k-1]+s2[k-3]-2LL*s2[k-2]; }else{ v2 = s2[2]+s2[0]-2LL*s2[1]; } ll v2_ = s2[kk+1]+s2[kk-1]-2LL*s2[kk]; rep(i, n) { ll x = a[kk][i]; ll y = x - change; ll v2__ = v2_ + 2LL*x*x - 2LL*y*y; if(v2 == v2__){ cout<<kk<< <<y<<endl; fflush(stdout); return; } } } int main() { cin.sync_with_stdio(0); cin.tie(0); cin.exceptions(cin.failbit); solve(); return 0; } |
#include <bits/stdc++.h> int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); std::cout.tie(nullptr); std::string str; std::cin >> str; std::uint64_t l = 0, r = str.size() - 1; while (l < str.size() && std::isupper(str[l])) l++; while (r && std::islower(str[r])) r--; std::uint64_t lower_total = 0, upper_total = 0; for (int i = l; i <= r; ++i) if (std::isupper(str[i])) upper_total++; else lower_total++; std::uint64_t ans = std::min(lower_total, upper_total), lower_count = 0, upper_count = 0; for (int i = l; i <= r; ++i) { if (std::islower(str[i])) { ans = std::min(ans, lower_count + upper_total - upper_count); lower_count++; } else upper_count++; } std::cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; inline int read() { int ans = 0; char c = getchar(); while (!isdigit(c)) c = getchar(); while (isdigit(c)) ans = (ans << 3) + (ans << 1) + (c ^ 48), c = getchar(); return ans; } int fa[5005], cnt[5005], sum[5005], dep[5005], bad[5005]; int main() { sum[1] = 1; for (int i = 2; i < 5005; i++) sum[i] = i + sum[i / 2] + sum[i - i / 2 - 1]; for (int i = 1; i < 5005; i++) sum[i] -= i; for (int T = read(); T; T--) { int n, d; n = read(), d = read(); int cur = n * (n - 1) / 2; if (d < sum[n] || d > cur) { puts( NO ); continue; } fa[1] = 0; for (int i = 2; i <= n; i++) fa[i] = i - 1; for (int i = 1; i < n; i++) cnt[i] = 1; cnt[n] = 0; for (int i = 1; i <= n; i++) bad[i] = 0, dep[i] = i - 1; while (cur > d) { int u; for (u = 1; u <= n; u++) if (!cnt[u] && !bad[u]) break; bad[u] = 1; for (int p = 1; p <= n; p++) if (cnt[p] < 2 && dep[u] - dep[p] == 2) { --cnt[fa[u]], fa[u] = p; dep[u] = dep[p] + 1, ++cnt[p]; bad[u] = 0, --cur; break; } } puts( YES ); for (int i = 2; i <= n; i++) printf( %d%c , fa[i], n [i == n]); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T, typename L> bool smax(T &x, L y) { return x < y ? (x = y, true) : false; } template <typename T, typename L> bool smin(T &x, L y) { return y < x ? (x = y, true) : false; } void pre_dfs(int, int); void sack(int, int, bool); void update(int, int, int, int, int); const int MAXN = 1e5 + 15; int cnt[MAXN], col[MAXN]; int st[MAXN], ft[MAXN], add[MAXN]; vector<int> adj[MAXN]; int n; long long ans[MAXN]; pair<int, long long> tree[MAXN << 2]; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); cerr << HELLO WORLD :) n ; cin >> n; for (int i = 0; i < n; i++) cin >> col[i]; for (int i = 1; i < n; i++) { int u, v; cin >> u >> v; u--, v--; adj[u].push_back(v); adj[v].push_back(u); } pre_dfs(0, -1); sack(0, -1, 0); for (int i = 0; i < n; i++) cout << ans[i] << ; return cout << n , false; } void pre_dfs(int v, int p) { static int t = 0; st[v] = t++; add[st[v]] = v; for (auto u : adj[v]) if (u != p) pre_dfs(u, v); ft[v] = t; } void sack(int v, int p, bool keep) { int id = -1, mx = -1061109567; for (auto u : adj[v]) if (u != p && smax(mx, ft[u] - st[u])) id = u; for (auto u : adj[v]) if (u != p && u != id) sack(u, v, 0); if (id != -1) sack(id, v, 1); update(1, 1, n + 1, col[v], 1); for (auto u : adj[v]) if (u != p && u != id) for (int i = st[u]; i < ft[u]; i++) update(1, 1, n + 1, col[add[i]], 1); ans[v] = tree[1].second; if (!keep) for (int i = st[v]; i < ft[v]; i++) update(1, 1, n + 1, col[add[i]], -1); } void update(int id, int b, int e, int p, int val) { if (b == e - 1) { tree[id].first += val; smax(tree[id].second, b); return; } int mid = (b + e) >> 1; if (p < mid) update(id << 1, b, mid, p, val); else update(id << 1 | 1, mid, e, p, val); tree[id].first = max(tree[id << 1].first, tree[id << 1 | 1].first); tree[id].second = (tree[id << 1].first == tree[id << 1 | 1].first ? tree[id << 1].second + tree[id << 1 | 1].second : (tree[id << 1].first > tree[id << 1 | 1].first ? tree[id << 1].second : tree[id << 1 | 1].second)); } |
#include <bits/stdc++.h> using namespace std; void FastIO() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); } vector<long long int> fib; void calc(int n) { fib.assign(n + 1, 0); fib[0] = 1; fib[1] = 1; for (int i = (int)2; i <= (int)n; i++) { fib[i] = fib[i - 1] + fib[i - 2]; } } int main() { long long int n, k; cin >> n >> k; calc(n); vector<long long int> ans; for (int i = 0; i < (int)n; i++) { if (k <= fib[n - 1 - i]) ans.push_back(i + 1); else { ans.push_back(i + 2); ans.push_back(i + 1); k -= fib[n - 1 - i]; i++; } } for (int i = 0; i < (int)n; i++) { cout << ans[i] << ; } cout << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n, m, cl, ce, v; cin >> n >> m >> cl >> ce >> v; vector<long long> data_l(cl), data_e(ce); for (long long i = 0; i < cl; i++) { long long k; cin >> k; data_l[i] = k - 1; } for (long long i = 0; i < ce; i++) { long long k; cin >> k; data_e[i] = k - 1; } sort((data_l).begin(), (data_l).end()); sort((data_e).begin(), (data_e).end()); vector<long long> r_data_l = data_l; vector<long long> r_data_e = data_e; for (long long i = 0; i < r_data_l.size(); i++) r_data_l[i] *= -1; for (long long i = 0; i < r_data_e.size(); i++) r_data_e[i] *= -1; sort((r_data_l).begin(), (r_data_l).end()); sort((r_data_e).begin(), (r_data_e).end()); long long q; cin >> q; vector<long long> ans(q); for (long long i = 0; i < q; i++) { long long x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2; x1--; y1--; x2--; y2--; swap(x1, y1); swap(x2, y2); if (y1 == y2) { ans[i] = abs(x2 - x1); continue; } long long lift_time = (abs(y2 - y1) - 1) / v + 1; long long left_l = -1, right_l = -1, left_e = -1, right_e = -1; vector<long long>::iterator it = lower_bound((r_data_l).begin(), (r_data_l).end(), -x1); if (it != r_data_l.end()) left_l = -(*it); it = lower_bound((data_l).begin(), (data_l).end(), x1); if (it != data_l.end()) right_l = *it; it = lower_bound((r_data_e).begin(), (r_data_e).end(), -x1); if (it != r_data_e.end()) left_e = -(*it); it = lower_bound((data_e).begin(), (data_e).end(), x1); if (it != data_e.end()) right_e = *it; long long ans1 = (left_l == -1 ? INF : abs(left_l - x1) + abs(left_l - x2) + abs(y1 - y2)); long long ans2 = (right_l == -1 ? INF : abs(right_l - x1) + abs(right_l - x2) + abs(y1 - y2)); long long ans3 = (left_e == -1 ? INF : abs(left_e - x1) + abs(left_e - x2) + lift_time); long long ans4 = (right_e == -1 ? INF : abs(right_e - x1) + abs(right_e - x2) + lift_time); ans[i] = min(min(ans1, ans2), min(ans3, ans4)); } for (long long i = 0; i < q; i++) cout << ans[i] << endl; return 0; } |
#include <bits/stdc++.h> int m, n, W, i, j, k, a[555555], b[555555], c[555555]; long long w[555555], rs; double rq; void solve(int l, int r, long long x) { if (l == r) { rs += (x * c[b[l]]) / w[b[l]]; rq += double((x * c[b[l]]) % w[b[l]]) / w[b[l]]; return; } int i = l, j = r, k, h = b[(l + r) >> 1]; long long e, f; while (i <= j) { while (c[b[i]] * w[h] < c[h] * w[b[i]]) i++; while (c[b[j]] * w[h] > c[h] * w[b[j]]) j--; if (i <= j) { k = b[i]; b[i++] = b[j]; b[j--] = k; } } for (f = e = 0, k = l; k < i; k++) { f += w[b[k]]; e += c[b[k]]; if (f >= x) break; } if (k == i) { rs += e; solve(i, r, x - f); } else if (k > j) { f -= w[b[k]]; e -= c[b[k]]; rs += e + ((x - f) * c[b[k]]) / w[b[k]]; rq += double(((x - f) * c[b[k]]) % w[b[k]]) / w[b[k]]; } else solve(l, j, x); } int main() { srand(time(0)); scanf( %d%d%d , &m, &n, &W); for (i = 0; i < n; i++) { scanf( %I64d , &w[i]); b[i] = i; } for (i = 0; i < n; i++) scanf( %d , &c[i]); for (i = 0; i < n; i++) scanf( %d , &a[i]); for (j = 0; j < m; j++) { if (j) for (i = 0; i < n; i++) c[i] -= a[i]; solve(0, n - 1, W); } rs += int(rq); rq -= int(rq); rq += rs % 10; rs /= 10; if (rs != 0) printf( %I64d , rs); printf( %.11lf n , rq); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, c = 0; string s; cin >> n >> s; for (int i = 0; i < s.length(); i++) { if (s[i] == 1 ) c++; else { c++; break; } } cout << c; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, m, ai; cin >> n; map<pair<long long int, long long int>, int> mp; vector<long long int> c; for (long long int i = 0; i < n; i++) { cin >> ai; c.push_back(ai); mp[{ai, i}]++; } for (long long int i = 0; i < n; i++) { cin >> ai; c.push_back(ai); mp[{ai, i}]++; } cin >> m; long long int d2 = 0; for (auto c : mp) { if (c.second == 2) d2++; } sort(c.begin(), c.end()); long long int ans = 1; for (long long int i = 0; i < 2 * n;) { long long int j = i + 1; while (j < 2 * n && c[j] == c[i]) j++; for (long long int k = 1; k <= j - i; k++) { long long int p = k; while (p % 2 == 0 && d2) { d2--; p /= 2; } (ans *= p) %= m; } i = j; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 105; map<string, int> H1[maxn], H2[maxn]; vector<char> ans; char getA(string a, string b) { int c[30]; for (int i = 0; i < 26; i++) c[i] = 0; for (int i = 0; i < a.size(); i++) c[a[i] - a ]++; for (int i = 0; i < b.size(); i++) c[b[i] - a ]--; for (int i = 0; i < 26; i++) { if (c[i] > 0) return i + a ; } } int main() { int n; cin >> n; if (n == 1) { cout << ? 1 1 << endl; string sss; cin >> sss; cout << ! << sss << endl; } else { cout << ? 1 << n << endl; for (int i = 0; i < n * (n + 1) / 2; i++) { string s; cin >> s; sort(s.begin(), s.end()); H1[s.size()][s]++; } cout << ? 2 << n << endl; for (int i = 0; i < n * (n - 1) / 2; i++) { string s; cin >> s; sort(s.begin(), s.end()); H2[s.size()][s]++; } for (int i = 1; i <= n; i++) { for (auto p : H2[i]) { H1[i][p.first] -= H2[i][p.first]; } for (auto p : H1[i]) { if (p.second > 0) { string new1 = ; for (int j = 0; j < ans.size(); j++) new1 += ans[j]; ans.push_back(getA(p.first, new1)); } } } string new1 = ; for (int j = 0; j < ans.size(); j++) new1 += ans[j]; cout << ! << new1 << endl; } } |
#include <bits/stdc++.h> using namespace std; void __print(unsigned x) { cerr << x; } void __print(int x) { cerr << x; } void __print(long x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(float x) { cerr << x; } void __print(double x) { cerr << x; } void __print(long long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __print(long double 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 ); } void __print(char x) { cerr << << x << ; } 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...); } int n, x; vector<int> visited; vector<int> g[20000]; void dfs(int u, int deep) { visited[u] = deep; for (int v : g[u]) { if (!visited[v]) { dfs(v, deep + 1); } } } void solve() { cin >> n >> x; x--; for (int i = 0; i < n; i += 1) g[i].clear(); visited.clear(); visited.resize(n); int e = n - 1; while (e--) { int u, v; cin >> u >> v; u--; v--; g[u].emplace_back(v); g[v].emplace_back(u); }; if (g[x].size() <= 1) { cout << Ayush n ; return; } int ans = 0; dfs(x, 1); for (int &x : visited) x--; vector<int> dis = visited; sort(dis.begin(), dis.end()); ans = dis[n - 1] + dis[n - 2]; int t = n - ans - 1; if (ans & 1) { if (t & 1) { cout << Ashish n ; } else cout << Ayush n ; } else { if (t & 1) cout << Ayush n ; else cout << Ashish n ; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int tc; cin >> tc; while (tc--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T, typename S> inline T smax(T &a, const S &b) { return a < b ? a = b : a; } int n, s, m, k, a[int(1500 + 20)], l[int(1500 + 20)], r[int(1500 + 20)], id[int(1500 + 20)]; int psum[int(1500 + 20)], dp[int(1500 + 20)][int(1500 + 20)], pos[int(1500 + 20)]; inline bool check(int val) { for (int i = 1; i <= n; i++) { psum[i] = psum[i - 1] + ((a[i] <= val) ? 1 : 0); for (int j = 1; j <= m; j++) { dp[i][j] = dp[i - 1][j]; if (!~pos[i]) continue; int L = l[pos[i]]; smax(dp[i][j], dp[L - 1][j - 1] + psum[i] - psum[L - 1]); L = r[id[pos[i]]]; smax(dp[i][j], dp[L][j - 1] + psum[i] - psum[L]); } } return dp[n][m] >= k; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout.tie(0); cin >> n >> s >> m >> k; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 0; i < s; i++) cin >> l[i] >> r[i]; memset(id, -1, sizeof(id)); memset(pos, -1, sizeof(pos)); for (int i = 0; i < s; i++) { if (!~pos[r[i]] || l[pos[r[i]]] > l[i]) pos[r[i]] = i; for (int j = 0; j < s; j++) if (r[j] <= r[i] && r[j] >= l[i]) if (!~id[i] || l[id[i]] > l[j]) id[i] = j; } int lo = 0, hi = 1e9 + 2; while (lo != hi - 1) { int mid = (long long)lo + hi >> 1; if (check(mid)) hi = mid; else lo = mid; } if (!check(hi)) hi = -1; cout << hi << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; char ch[60][60]; int x[4] = {-1, 1, 0, 0}; int y[4] = {0, 0, -1, 1}; bool mark[60][60]; void del(int a, int b) { for (int i = 0; i < 4; i++) if (mark[a + x[i]][b + y[i]]) { mark[a + x[i]][b + y[i]] = 0; del(a + x[i], b + y[i]); } } bool dfs(int a, int b, int n, int m) { for (int i = 0; i <= n + 1; i++) for (int j = 0; j <= m + 1; j++) if (ch[i][j] == # ) mark[i][j] = 1; else mark[i][j] = 0; mark[a][b] = 0; int s = 0; for (int i = 0; i < 4; i++) if (mark[a + x[i]][b + y[i]]) { s++; if (s > 1) return 1; mark[a + x[i]][b + y[i]] = 0; del(a + x[i], b + y[i]); } return 0; } int main() { int n, m; while (scanf( %d %d , &n, &m) != EOF) { gets(ch[0]); for (int i = 0; i <= n + 1; i++) for (int j = 0; j <= m + 1; j++) ch[i][j] = . ; for (int i = 1; i <= n; i++) gets(ch[i] + 1); int s = 0; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) if (ch[i][j] == # ) s++; if (s < 3) printf( -1 n ); else { s = 2; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) if (ch[i][j] == # ) { if (dfs(i, j, n, m)) { s = 1; break; } } if (s < 2) break; } printf( %d n , s); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 400005; const long long MOD = 998244353; const long long g = 3; int n, N; int rev[MAXN]; long long m, Inv; long long f[MAXN]; long long A[MAXN]; long long B[MAXN]; long long fac[MAXN]; long long inv[MAXN]; long long wn[2][MAXN]; long long power(long long a, long long b) { long long res = 1; while (b) { if (b & 1) (res *= a) %= MOD; (a *= a) %= MOD; b >>= 1; } return res; } void init(int l) { N = 1; while (N < l) N <<= 1; int half = N >> 1; Inv = power(N, MOD - 2); for (int i = 1; i < N; i++) rev[i] = (rev[i >> 1] >> 1) + (i & 1) * half; for (int i = 0; i < half; i++) { wn[0][i + half] = power(g, (MOD - 1) * i / N); wn[1][i + half] = power((MOD + 1) / g, (MOD - 1) * i / N); } for (int i = half - 1; i >= 0; i--) { wn[0][i] = wn[0][i << 1]; wn[1][i] = wn[1][i << 1]; } fac[0] = 1; for (int i = 1; i <= l; i++) fac[i] = fac[i - 1] * i % MOD; inv[l] = power(fac[l], MOD - 2); for (int i = l; i >= 1; i--) inv[i - 1] = inv[i] * i % MOD; } void NTT(long long *v, bool inv) { for (int i = 0; i < N; i++) if (i < rev[i]) swap(v[i], v[rev[i]]); for (int i = 1; i < N; i <<= 1) for (int j = 0; j < N; j += i << 1) { long long *l = v + j, *r = v + j + i, *w = wn[inv] + i, A; for (int k = 0; k < i; k++, l++, r++, w++) { A = *r * *w; *r = (*l - A) % MOD; *l = (*l + A) % MOD; } } if (inv) { for (int i = 0; i < N; i++) (v[i] *= Inv) %= MOD; } } int main() { scanf( %d%lld , &n, &m); init(n << 1 | 1); for (int i = 0; i <= n; i++) scanf( %lld , &f[i]); for (int i = 0; i <= n; i++) A[i] = inv[i]; for (int i = 0; i <= n; i++) B[i] = fac[n - i] * f[n - i] % MOD; NTT(A, 0); NTT(B, 0); for (int i = 0; i < N; i++) f[i] = A[i] * B[i] % MOD; NTT(f, 1); reverse(f, f + n + 1); for (int i = 0; i <= n; i++) f[i] = f[i] * inv[i] % MOD * power(fac[i] * inv[i + 1] % MOD, m) % MOD; memset(A, 0, sizeof(A)); memset(B, 0, sizeof(B)); for (int i = 0; i <= n; i++) A[i] = (i % 2 ? -inv[i] : inv[i]); for (int i = 0; i <= n; i++) B[i] = fac[n - i] * f[n - i] % MOD; NTT(A, 0); NTT(B, 0); for (int i = 0; i < N; i++) f[i] = A[i] * B[i] % MOD; NTT(f, 1); reverse(f, f + n + 1); for (int i = 0; i <= n; i++) f[i] = f[i] * inv[i] % MOD; for (int i = 0; i <= n; i++) printf( %lld , (f[i] + MOD) % MOD); printf( n ); 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 N = 1e3 + 5; const int M = 1600; int n, m, gA[N], gB[N], tA[N], tB[N], id[N]; long double prob[N]; std ::pair<long double, long double> dp[N][M]; inline bool cmp(const int &a, const int &b) { return (1 - prob[b]) * prob[a] * tB[a] < (1 - prob[a]) * prob[b] * tB[b]; } int main() { n = Get(), m = Get(); for (int i = 1; i <= n; ++i) { gA[i] = Get(), gB[i] = Get(), tA[i] = Get(), tB[i] = Get(); double res; scanf( %lf , &res); prob[i] = res; } for (int i = 1; i <= n; ++i) id[i] = i; std ::sort(id + 1, id + n + 1, cmp); for (int i = 1, k; k = id[i], i <= n; ++i) for (int j = m; j >= 0; --j) { std ::pair<long double, long double> nxt; dp[i][j] = dp[i - 1][j]; if (j >= tA[k]) { nxt = std ::make_pair(dp[i - 1][j - tA[k]].first + gA[k], dp[i - 1][j - tA[k]].second - tA[k]); dp[i][j] = std ::max(dp[i][j], nxt); } if (j >= tA[k] + tB[k]) { nxt.first = dp[i - 1][j - tA[k] - tB[k]].first + gA[k] + (1 - prob[k]) * gB[k]; nxt.second = prob[k] * dp[i - 1][j - tA[k] - tB[k]].second - (1 - prob[k]) * (j - tA[k]) - tA[k]; dp[i][j] = std ::max(dp[i][j], nxt); } } std ::pair<long double, long double> ans = std ::make_pair(0, 0); for (int j = 0; j <= m; ++j) ans = std ::max(ans, dp[n][j]); printf( %.10lf %.10lf n , (double)ans.first, -(double)ans.second); } |
#include <bits/stdc++.h> using namespace std; string m[10]; bool win(int i, int j, int x, int y) { int X = 0; int O = 0; int D = 0; for (int c = 0; c < 5 && i >= 0 && i < 10 && j >= 0 && j < 10; i += x, j += y, c++) { if (m[i][j] == X ) { X++; } else if (m[i][j] == O ) { O++; } else { D++; } } return X == 4 && D == 1; } int main() { ios_base::sync_with_stdio(0); for (int i = 0; i < 10; i++) { cin >> m[i]; } for (int i = 0; i < 10; i++) { for (int j = 0; j < 10; j++) { if (m[i][j] == X ) { for (int kx = -1; kx < 2; kx++) { for (int ky = -1; ky < 2; ky++) { if (kx == 0 && ky == 0) continue; if (win(i, j, kx, ky)) { cout << YES ; return 0; } } } } } } cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> bool chkmax(T &x, T y) { return x < y ? x = y, true : false; } template <typename T> bool chkmin(T &x, T y) { return x > y ? x = y, true : false; } int readint() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } long long n, p; int main() { n = readint(); p = readint(); for (long long i = 1;; i++) { n -= p; if (n <= 0) return printf( -1 n ), 0; if (n < i) continue; if (__builtin_popcountll(n) <= i) return printf( %lld n , i), 0; } printf( -1 n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long x, y, cx[120], cy[120], n, i, l = 0; string s; cin >> x >> y; getline(cin, s); getline(cin, s); n = s.size(); cx[0] = cy[0] = 0; if (x == 0 && y == 0) l = 1; for (i = 0; i < n; i++) { cx[i + 1] = cx[i]; cy[i + 1] = cy[i]; if (s[i] == R ) cx[i + 1]++; if (s[i] == U ) cy[i + 1]++; if (s[i] == D ) cy[i + 1]--; if (s[i] == L ) cx[i + 1]--; if (x == cx[i] && cy[i] == y) l = 1; } for (i = 0; i <= n; i++) { if (cx[n] == 0 && cy[n] == 0) break; if (cx[n] == 0 && (y - cy[i]) % cy[n] == 0 && (y - cy[i]) / cy[n] > 0 && cx[i] == x) l = 1; if (cx[n] != 0) if ((x - cx[i]) % cx[n] == 0 && cy[n] * ((x - cx[i]) / cx[n]) + cy[i] == y && ((x - cx[i]) / cx[n]) > 0) l = 1; } if (l == 1) cout << Yes n ; else cout << No n ; } |
#include <bits/stdc++.h> using namespace std; const int dx[4] = {1, 0}; const int dy[4] = {0, 1}; pair<int, vector<vector<int> > > MoveBotsDirs( const vector<vector<int> >& bots_dirs) { map<int, int> xs; map<int, int> ys; for (int i = 0; i < bots_dirs.size(); ++i) { if (bots_dirs[i][2] == 0) { xs[bots_dirs[i][0]]++; } else { ys[bots_dirs[i][1]]++; } } if (xs.size() > 2 || ys.size() > 2) { return make_pair(-1, vector<vector<int> >()); } for (map<int, int>::const_iterator it = xs.begin(); it != xs.end(); ++it) { if (it->second > 2) { return make_pair(-1, vector<vector<int> >()); } } for (map<int, int>::const_iterator it = ys.begin(); it != ys.end(); ++it) { if (it->second > 2) { return make_pair(-1, vector<vector<int> >()); } } if (xs.size() < 2 && ys.size() < 2) { return make_pair(-1, vector<vector<int> >()); } if (ys.size() < 2) { vector<vector<int> > bots_dirs2; for (int i = 0; i < bots_dirs.size(); ++i) { vector<int> bot; bot.push_back(bots_dirs[i][1]); bot.push_back(bots_dirs[i][0]); bot.push_back(bots_dirs[i][3]); bot.push_back(bots_dirs[i][2]); bots_dirs2.push_back(bot); } pair<int, vector<vector<int> > > sol = MoveBotsDirs(bots_dirs2); for (int i = 0; i < sol.second.size(); ++i) { swap(sol.second[i][0], sol.second[i][1]); } return sol; } int ymin = ys.begin()->first; int ymax = ys.rbegin()->first; int side = ymax - ymin; set<int> xcand; vector<int> Xs; for (map<int, int>::const_iterator it = xs.begin(); it != xs.end(); ++it) { xcand.insert(it->first); } for (int i = 0; i < bots_dirs.size(); ++i) { xcand.insert(bots_dirs[i][0]); xcand.insert(bots_dirs[i][0] - side); for (int j = 0; j < bots_dirs.size(); ++j) { xcand.insert((bots_dirs[i][0] + bots_dirs[j][0] - side) / 2); xcand.insert((bots_dirs[i][0] + bots_dirs[j][0] - side) / 2 + 1); xcand.insert((bots_dirs[i][0] + bots_dirs[j][0] - side) / 2 - 1); xcand.insert((bots_dirs[i][0] + bots_dirs[j][0] - side) / 2 - side); xcand.insert((bots_dirs[i][0] + bots_dirs[j][0] - side) / 2 + 1 - side); xcand.insert((bots_dirs[i][0] + bots_dirs[j][0] - side) / 2 - 1 - side); xcand.insert((bots_dirs[i][0] + bots_dirs[j][0]) / 2); xcand.insert((bots_dirs[i][0] + bots_dirs[j][0]) / 2 + 1); xcand.insert((bots_dirs[i][0] + bots_dirs[j][0]) / 2 - 1); xcand.insert((bots_dirs[i][0] + bots_dirs[j][0]) / 2 - side); xcand.insert((bots_dirs[i][0] + bots_dirs[j][0]) / 2 + 1 - side); xcand.insert((bots_dirs[i][0] + bots_dirs[j][0]) / 2 - 1 - side); } } pair<int, vector<vector<int> > > res; res.first = -1; for (set<int>::const_iterator it = xcand.begin(); it != xcand.end(); ++it) { int xmin = *it; int xmax = xmin + side; vector<vector<int> > nodes(4); nodes[0].push_back(xmin); nodes[0].push_back(ymin); nodes[1].push_back(xmin); nodes[1].push_back(ymax); nodes[2].push_back(xmax); nodes[2].push_back(ymax); nodes[3].push_back(xmax); nodes[3].push_back(ymin); vector<int> perm; for (int i = 0; i < 4; ++i) { perm.push_back(i); } do { vector<vector<int> > new_pos; for (int i = 0; i < 4; ++i) { new_pos.push_back(nodes[perm[i]]); } bool can_go = true; int max_steps = 0; for (int i = 0; i < 4; ++i) { if (bots_dirs[i][2] == 0) { if (new_pos[i][0] != bots_dirs[i][0]) { can_go = false; break; } int steps = abs((new_pos[i][1] - bots_dirs[i][1]) / bots_dirs[i][3]); max_steps = max(max_steps, steps); } else { if (new_pos[i][1] != bots_dirs[i][1]) { can_go = false; break; } int steps = abs((new_pos[i][0] - bots_dirs[i][0]) / bots_dirs[i][2]); max_steps = max(max_steps, steps); } } if (can_go) { if (res.first == -1) { res.first = max_steps; res.second = new_pos; } else if (max_steps < res.first) { res.first = max_steps; res.second = new_pos; } } } while (next_permutation(perm.begin(), perm.end())); } return res; } pair<int, vector<vector<int> > > MoveBots(const vector<vector<int> >& bots) { pair<int, vector<vector<int> > > res; res.first = -1; int dir[4]; for (dir[0] = 0; dir[0] < 2; ++dir[0]) { for (dir[1] = 0; dir[1] < 2; ++dir[1]) { for (dir[2] = 0; dir[2] < 2; ++dir[2]) { for (dir[3] = 0; dir[3] < 2; ++dir[3]) { vector<vector<int> > bots_dirs; for (int i = 0; i < 4; ++i) { bots_dirs.push_back(bots[i]); bots_dirs[i].push_back(dx[dir[i]]); bots_dirs[i].push_back(dy[dir[i]]); } pair<int, vector<vector<int> > > curres = MoveBotsDirs(bots_dirs); if (res.first == -1 && curres.first != -1) { res = curres; } else if (curres.first != -1 && curres.first < res.first) { res = curres; } } } } } return res; } pair<int, vector<vector<int> > > MoveBotsSlow( const vector<vector<int> >& bots) { const int CHECK = 10; pair<int, vector<vector<int> > > res; res.first = -1; for (int x = -CHECK; x <= CHECK; ++x) { for (int y = -CHECK; y <= CHECK; ++y) { for (int side = 1; side <= CHECK; ++side) { int xmin = x; int ymin = y; int xmax = x + side; int ymax = y + side; vector<vector<int> > pos(4); pos[0].push_back(xmin); pos[0].push_back(ymin); pos[1].push_back(xmin); pos[1].push_back(ymax); pos[2].push_back(xmax); pos[2].push_back(ymax); pos[3].push_back(xmax); pos[3].push_back(ymin); vector<int> perm; for (int i = 0; i < 4; ++i) { perm.push_back(i); } do { vector<vector<int> > new_pos; for (int i = 0; i < 4; ++i) { new_pos.push_back(pos[perm[i]]); } int max_steps = 0; bool can_go = true; for (int i = 0; i < 4; ++i) { if (new_pos[i][0] == bots[i][0]) { max_steps = max(max_steps, abs(new_pos[i][1] - bots[i][1])); } else if (new_pos[i][1] == bots[i][1]) { max_steps = max(max_steps, abs(new_pos[i][0] - bots[i][0])); } else { can_go = false; } } if (can_go) { if (res.first == -1) { res.first = max_steps; res.second = new_pos; } else if (max_steps < res.first) { res.first = max_steps; res.second = new_pos; } } } while (next_permutation(perm.begin(), perm.end())); } } } return res; } int main() { int tests; cin >> tests; for (int test_index = 0; test_index < tests; ++test_index) { vector<vector<int> > bots(4, vector<int>(2)); for (int i = 0; i < 4; ++i) { for (int j = 0; j < 2; ++j) { scanf( %d , &bots[i][j]); } } pair<int, vector<vector<int> > > new_pos = MoveBots(bots); if (new_pos.first == -1) { printf( -1 n ); continue; } else { printf( %d n , new_pos.first); for (int i = 0; i < 4; ++i) { printf( %d %d n , new_pos.second[i][0], new_pos.second[i][1]); } } } return 0; } |
#include <bits/stdc++.h> using namespace std; using lint = long long; const int inf = 1000000007; const int MOD = 1000000007; void solve() { int n, k; cin >> n >> k; vector<set<int>> edge(n); for (int i = 0; i < n - 1; ++i) { int a, b; cin >> a >> b; --a; --b; edge[a].insert(b); edge[b].insert(a); } if (k == 1) { cout << n - 1 << n ; return; } int res = 0; vector<queue<int>> child(n); for (int i = 0; i < n; ++i) { if (edge[i].size() == 1) { child[*edge[i].begin()].push(i); } } queue<int> que; for (int i = 0; i < n; ++i) { if (child[i].size() >= k) que.push(i); } while (!que.empty()) { int x = que.front(); que.pop(); if (child[x].size() < k) continue; res += 1; for (int i = 0; i < k; ++i) { int buf = child[x].front(); child[x].pop(); edge[x].erase(buf); } if (child[x].size() >= k) que.push(x); if (edge[x].size() == 1) { int par = *edge[x].begin(); child[par].push(x); if (child[par].size() >= k) que.push(par); } } cout << res << n ; } signed main() { cin.tie(0); ios::sync_with_stdio(false); int t; cin >> t; for (int i = 0; i < t; ++i) solve(); return 0; } |
#include <bits/stdc++.h> int x, n, m, a[2010], f[2010], min, c, i, j, k; int main() { scanf( %d%d , &n, &m); for (i = 1; i <= n; i++) { scanf( %d , &a[i]); if (a[i] <= m) f[a[i]]++; } c = 0; x = n / m; for (i = 1; i <= n; i++) { if (a[i] > m) { k = 1; for (j = 2; j <= m; j++) if (f[j] < f[k]) k = j; if (f[k] == n / m) break; c++; f[k]++; a[i] = k; } else if (f[a[i]] > x) { k = 1; for (j = 2; j <= m; j++) if (f[j] < f[k]) k = j; if (f[k] == n / m) break; f[a[i]]--; c++; f[k]++; a[i] = k; } } k = 1; for (j = 2; j <= m; j++) if (f[j] < f[k]) k = j; printf( %d %d n , f[k], c); for (i = 1; i <= n; i++) printf( %d , a[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; int a[20], b[20]; char s[110000]; int main() { int n, i, j; scanf( %s , s); for (i = 0; s[i]; i++) { if (s[i] == 5 ) a[2]++; else if (s[i] == 9 ) a[6]++; else a[s[i] - 0 ]++; } scanf( %s , s); for (i = 0; s[i]; i++) { if (s[i] == 5 ) b[2]++; else if (s[i] == 9 ) b[6]++; else b[s[i] - 0 ]++; } int ans = 210000; for (i = 0; i <= 9; i++) if (i - 9 && i - 5) { if (a[i]) ans = min(ans, b[i] / a[i]); } printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; long long n, m, N, Left, Right; long long seg[2000001], vs[2000001]; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m; char grid[n + 1][m + 1]; vs[0] = 0; set<pair<long long, long long>> d; for (long long i = 1; i <= n; i++) { for (long long j = 1; j <= m; j++) { cin >> grid[i][j]; } } for (long long i = 1; i <= n; i++) { for (long long j = 1; j <= m; j++) { if (i > 1 && j > 1) { if (grid[i - 1][j] == X && grid[i][j - 1] == X ) { vs[j]++; } } } } for (long long i = 1; i <= m; i++) vs[i] += vs[i - 1]; long long q; cin >> q; while (q--) { cin >> Left >> Right; if (vs[Right] - vs[Left]) cout << NO ; else cout << YES ; cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { long long int n, m, k, kk, x, y; cin >> n >> m >> k; kk = k; long long int a[m]; for (long long int i = 0; i < m; i++) a[i] = 9999999999; for (long long int i = 0; i < n; i++) { cin >> x >> y; a[x - 1] = min(a[x - 1], y); } for (long long int i = 0; i < m; i++) { if (a[i] >= kk) kk = 0; else kk -= a[i]; if (kk == 0) break; } cout << k - kk; return; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int t = 1; while (t--) solve(); cerr << n << Time elapsed : << clock() * 1000.0 / CLOCKS_PER_SEC << ms n ; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.