func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using std::max; using std::min; const int inf = 0x3f3f3f3f, Inf = 0x7fffffff; const long long INF = 0x3f3f3f3f3f3f3f3f; __inline__ __attribute__((always_inline)) unsigned int rnd() { static unsigned int seed = 416; return seed ^= seed >> 5, seed ^= seed << 17, seed ^= seed >> 13; } template <typename _Tp> _Tp gcd(const _Tp &a, const _Tp &b) { return (!b) ? a : gcd(b, a % b); } template <typename _Tp> __inline__ __attribute__((always_inline)) _Tp abs(const _Tp &a) { return a >= 0 ? a : -a; } template <typename _Tp> __inline__ __attribute__((always_inline)) void chmax(_Tp &a, const _Tp &b) { (a < b) && (a = b); } template <typename _Tp> __inline__ __attribute__((always_inline)) void chmin(_Tp &a, const _Tp &b) { (b < a) && (a = b); } template <typename _Tp> __inline__ __attribute__((always_inline)) void read(_Tp &x) { char ch(getchar()); bool f(false); while (!isdigit(ch)) f |= ch == 45, ch = getchar(); x = ch & 15, ch = getchar(); while (isdigit(ch)) x = (((x << 2) + x) << 1) + (ch & 15), ch = getchar(); f && (x = -x); } template <typename _Tp, typename... Args> __inline__ __attribute__((always_inline)) void read(_Tp &t, Args &...args) { read(t); read(args...); } template <typename _Tp, typename... Args> __inline__ __attribute__((always_inline)) _Tp min(const _Tp &a, const _Tp &b, const Args &...args) { return a < b ? min(a, args...) : min(b, args...); } template <typename _Tp, typename... Args> __inline__ __attribute__((always_inline)) _Tp max(const _Tp &a, const _Tp &b, const Args &...args) { return a < b ? max(b, args...) : max(a, args...); } __inline__ __attribute__((always_inline)) int read_str(char *s) { char ch(getchar()); while (ch == || ch == r || ch == n ) ch = getchar(); char *tar = s; *tar = ch, ch = getchar(); while (ch != && ch != r && ch != n && ch != EOF) *(++tar) = ch, ch = getchar(); return tar - s + 1; } const int N = 100005; const int MAXN = 10000005; bool pr[MAXN]; int _p[MAXN >> 3], _pos; int md[MAXN]; void sieve() { for (int i = 2; i < MAXN; ++i) { if (!pr[i]) { _p[++_pos] = i; md[i] = i; } for (int j = 1; j <= _pos && i * _p[j] < MAXN; ++j) { pr[i * _p[j]] = true; md[i * _p[j]] = _p[j]; if (!(i % _p[j])) break; } } } std::vector<int> p[N], d[N]; int c[MAXN], cnt[1 << 8], mul[1 << 8]; int calc(int id) { int siz = ((int)p[id].size()), ans = 0; for (int i = 0; i < siz; ++i) mul[1 << i] = p[id][i]; for (int i = 1; i < 1 << siz; ++i) { cnt[i] = cnt[i >> 1] + (i & 1); mul[i] = mul[i ^ ((i) & (-(i)))] * mul[((i) & (-(i)))]; if (cnt[i] & 1) ans += c[mul[i]]; else ans -= c[mul[i]]; } return ans; } int a[N]; int _val[11], _cnt[11], pos, cur_id; void dfs(int dep, int val) { if (dep == pos + 1) { d[cur_id].push_back(val); return; } for (int i = 0; i <= _cnt[dep]; ++i) { dfs(dep + 1, val); if (i < _cnt[dep]) val *= _val[dep]; } } bool ban[N], vis[N]; int deg[N]; int f(int mid) { while (ban[mid]) --mid; if (!mid) return false; int qwq = 0; for (int i = 1; i <= mid; ++i) if (!ban[i]) { ++qwq; for (auto it : d[i]) ++c[it]; } int ans = 0; for (int i = 1; i <= mid; ++i) if (!ban[i] && calc(i) != qwq) ++ans; for (int i = 1; i <= mid; ++i) if (!ban[i]) for (auto it : d[i]) --c[it]; return ans; } std::vector<int> getnodes(int mid) { while (ban[mid]) --mid; std::vector<int> nd; int qwq = 0; for (int i = 1; i <= mid; ++i) if (!ban[i]) { ++qwq; for (auto it : d[i]) ++c[it]; } for (int i = 1; i <= mid; ++i) if (!ban[i] && calc(i) != qwq) nd.push_back(i); for (int i = 1; i <= mid; ++i) if (!ban[i]) for (auto it : d[i]) --c[it]; return nd; } int main() { mul[0] = 1; sieve(); int n, k; read(n, k); for (int i = 1; i <= n; ++i) { read(a[i]); ++c[a[i]]; int cur = a[i], last = 0; pos = 0; while (cur > 1) { if (md[cur] != last) p[i].push_back(md[cur]), _val[++pos] = md[cur], _cnt[pos] = 1; else ++_cnt[pos]; last = md[cur]; cur /= last; } cur_id = i; dfs(1, 1); } for (int j = 1; j <= _pos; ++j) for (int i = (MAXN - 1) / _p[j]; i >= 1; --i) c[i] += c[i * _p[j]]; std::vector<int> nd; for (int i = 1; i <= n; ++i) { if ((deg[i] = calc(i)) <= n - 2) { nd.push_back(i); for (int j = 1; j <= n && ((int)nd.size()) < 3; ++j) if (i != j && gcd(a[i], a[j]) == 1) nd.push_back(j); break; } } if (nd.empty()) { std::vector<int> clique, rest; for (int i = 1; i <= n; ++i) if (deg[i] == n) clique.push_back(i); else rest.push_back(i); if (((int)clique.size()) > k) clique.resize(k); for (int i = 1; i <= n && ((int)clique.size()) < k; ++i) { if (!vis[i] && deg[i] == n - 1) { clique.push_back(i); for (auto it : rest) if (gcd(a[it], a[i]) == 1) vis[it] = true; } } for (auto it : clique) printf( %d , it); printf( n ); return 0; } assert(((int)nd.size()) == 3); if (k == 3) { for (auto it : nd) printf( %d , it); printf( n ); return 0; } for (auto it : nd) ban[it] = true; for (auto id : nd) for (auto it : d[id]) --c[it]; std::vector<int> clique; for (int i = 1; i <= n; ++i) if (!ban[i] && ((deg[i] = calc(i)) == n - 3)) clique.push_back(i); if (((int)clique.size()) >= k) { clique.resize(k); for (auto it : clique) printf( %d , it); printf( n ); return 0; } memset(c, 0, sizeof(c)); int l = 1, r = n; while (l < r) { int mid = (l + r) >> 1; if (f(mid) + 3 >= k) r = mid; else l = mid + 1; } std::vector<int> v1 = getnodes(l - 1); std::vector<int> v2 = getnodes(l); assert(f(l - 1) == ((int)v1.size())); assert(f(l) == ((int)v2.size())); assert(((int)v1.size()) + 3 < k); assert(((int)v2.size()) + 3 >= k); std::sort(v1.begin(), v1.end()); std::vector<int> qwq; for (auto it : v2) { auto _ = std::lower_bound(v1.begin(), v1.end(), it); if (_ == v1.end() || *_ != it) qwq.push_back(it); } std::sort(qwq.begin(), qwq.end()); assert(((int)v1.size()) + ((int)qwq.size()) == ((int)v2.size())); if (((int)v1.size()) + 3 + 1 == k && ((int)qwq.size()) != 1) v1.push_back(nd[0]), v1.push_back(nd[1]); else v1.push_back(nd[0]), v1.push_back(nd[1]), v1.push_back(nd[2]); while (((int)v1.size()) < k) { v1.push_back(qwq.back()); qwq.pop_back(); } assert(((int)v1.size()) == k); for (auto it : v1) printf( %d , it); printf( n ); return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; const int N = 500005; const int MOD = 1e9 + 7; int i, n, m, k, rs, x, y; long long val[N]; map<int, int> p; map<long long, vector<pair<int, int>>> M; int Pow(int a, int b) { int ans = 1; while (b) { if (b & 1) ans = ((long long)ans * a) % MOD, --b; a = ((long long)a * a) % MOD; b /= 2; } return ans; } int pfind(int x) { if (!p.count(x)) return p[x] = x; if (p[x] == x) return p[x] = x; return p[x] = pfind(p[x]); } void punite(int x, int y) { if (rand() & 1) p[pfind(x)] = pfind(y); else p[pfind(y)] = pfind(x); } int main() { scanf( %d %d %d , &n, &m, &k); rs = Pow(2, n + k); for (i = 1; i <= n; ++i) scanf( %lld , val + i); while (m--) { scanf( %d %d , &x, &y); M[val[x] ^ val[y]].push_back(make_pair(x, y)); } for (auto it : M) { vector<pair<int, int>> v = it.second; x = n; p.clear(); for (auto it : v) if (pfind(it.first) != pfind(it.second)) { punite(it.first, it.second); --x; } rs -= Pow(2, n); rs += Pow(2, x); if (rs < 0) rs += MOD; else rs %= MOD; } printf( %d n , rs); return 0; } |
#include <bits/stdc++.h> using namespace std; const int arr = 9e5 + 10; signed main() { long long a, b; cin >> a >> b; a = min(a, b); long long ans = 1; for (long long i = 1; i <= a; i++) ans *= i; cout << ans; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 100005; int n, a[maxn], b[maxn], v[maxn]; unordered_map<int, int> mp; void dfs(int x, int l, int r) { if (v[x] <= r && v[x] >= l) mp[v[x]] = 1; if (a[x] != -1) { if (l < v[x]) dfs(a[x], l, min(v[x] - 1, r)); } if (b[x] != -1) { if (r > v[x]) dfs(b[x], max(l, v[x] + 1), r); } } bool f[maxn]; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> v[i] >> a[i] >> b[i]; if (a[i] != -1) f[a[i]] = 1; if (b[i] != -1) f[b[i]] = 1; } int root = 1; for (int i = 1; i <= n; i++) if (!f[i]) root = i; dfs(root, 0, 1000000000); int ret = 0; for (int i = 1; i <= n; i++) if (mp.find(v[i]) != mp.end()) ret++; cout << n - ret << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 205; const int mod = 1e9 + 7; int n, m, t, q; vector<int> G[N]; map<int, int> M; set<int> S; int a[N], in[N], iinn[N], vis[N]; long long sum; void topsort(int id) { int cnt = 0; while (1) { for (int i = (1); i <= (n); i++) { if (iinn[i] == 0 && vis[i] == 0 && a[i] == id) { cnt++; vis[i] = 1; sum++; int len = G[i].size(); for (int j = (0); j <= (len - 1); j++) { iinn[G[i][j]]--; } i = 0; } } if (cnt == n) break; id = (id % 3) + 1; sum++; } } int main() { scanf( %d , &n); for (int i = (1); i <= (n); i++) scanf( %d , &a[i]); for (int i = (1); i <= (n); i++) { int len, num; scanf( %d , &len); for (int j = (1); j <= (len); j++) { scanf( %d , &num); G[num].push_back(i); in[i]++; iinn[i]++; } } long long ans = 1ll << 62; sum = 0; topsort(1); ans = min(ans, sum); sum = 0; memset(vis, 0, sizeof(vis)); for (int i = (1); i <= (n); i++) iinn[i] = in[i]; topsort(2); ans = min(ans, sum); sum = 0; memset(vis, 0, sizeof(vis)); for (int i = (1); i <= (n); i++) iinn[i] = in[i]; topsort(3); ans = min(ans, sum); printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int len; string s; cin >> len; cin >> s; vector<char> vect; while (len != 0) { if (len % 2 == 1) { vect.push_back(s[0]); } else { vect.insert(vect.begin(), s[0]); } s.erase(0, 1); len = s.length(); } for (int i = 0; i < vect.size(); i++) { cout << vect[i]; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, d; vector<pair<int, int>> v; vector<int> ans; set<pair<int, int>> st; scanf( %d %d %d , &n, &m, &d); ans.resize(n); for (int i = 0; i < n; ++i) { int t; scanf( %d , &t); v.push_back(make_pair(t, i)); } sort(v.begin(), v.end()); st.insert(make_pair(v[0].first + d + 1, 1)); ans[v[0].second] = 1; for (int i = 1; i < v.size(); ++i) { int minute = v[i].first; int id = v[i].second; auto it = st.begin(); int cur_min_available_minute = it->first; int day = it->second; if (cur_min_available_minute <= m && minute >= cur_min_available_minute) { st.erase(it); st.insert(make_pair(minute + d + 1, day)); ans[id] = day; } else { st.insert(make_pair(minute + d + 1, st.size() + 1)); ans[id] = st.size(); } } printf( %d n , (int)st.size()); for (int i = 0; i < n; ++i) { printf( %d , ans[i]); } printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { double d, h, v, e; cin >> d >> h >> v >> e; double V = e * 3.14159265358979 * (d / 2) * (d / 2); if (v <= V) { cout << NO ; } else { double S = 3.14159265358979 * (d / 2) * (d / 2) * h; cout << YES << endl << fixed << setprecision(12) << S / (v - V); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { iostream::sync_with_stdio(false); int n; cin >> n; vector<int> nums(n); map<int, int> counts; for (int i = 0; i < n; i++) { cin >> nums[i]; counts[nums[i]]++; } map<int, int> last; int k = 0, previous; for (auto it = counts.begin(); it != counts.end(); it++) { if (k++ > 0) { if (previous < it->second) { cout << -1 << endl; return 0; } } if (k != it->first) { cout << -1 << endl; return 0; } previous = it->second; last[it->first] = 1; } int total = 0; vector<int> ans(n); for (int i = 0; i < n; i++) { ans[i] = last[nums[i]]++; total = max(ans[i], total); } cout << total << endl; for (int i = 0; i < n; i++) { if (i) cout << ; cout << ans[i]; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); long long n, ans = 0, cnt = 0; cin >> n; vector<long long> a(n), pref(n + 1); for (auto& i : a) cin >> i; pref[0] = a[0]; for (int i = 1; i < n; ++i) pref[i] += pref[i - 1] + a[i]; if (pref[n - 1] % 3 || n < 3) return cout << 0, 0; long long s = pref[n - 1] / 3; for (int i = 0; i < n - 1; ++i) { if (pref[i] == 2 * s) ans += cnt; if (pref[i] == s) ++cnt; } cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; long long int a[100001]; long long int d[100001]; long long int n; long long int max(long long int x, long long int y) { if (x > y) return x; return y; } int main() { cin >> n; long long int i; long long int x; for (i = 0; i < n; ++i) { cin >> x; a[x]++; } d[0] = 0; d[1] = a[1]; for (i = 2; i <= 100001; ++i) { d[i] = max(d[i - 1], d[i - 2] + a[i] * i); } cout << d[100001] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, i, j, m, x, c, count, nr, OK, suma, k, level, val, y[100], z; void inmultire_y(long long nr) { int i = 0; int j = 0; int Max = 0; for (; i < 100; i++) y[i] = 0; long long x2 = nr; int n = 0; while (x2) { n++; x2 /= 10; } x2 = nr; for (i = 1; i <= n; i++) { long long x1 = nr; for (j = 1; j <= n; j++) { y[i + j - 1] += (x2 % 10) * (x1 % 10); Max = max(Max, i + j - 1); if (y[i + j - 1] >= 10) { Max = max(Max, i + j); y[i + j] += y[i + j - 1] / 10; y[i + j - 1] = y[i + j - 1] % 10; } x1 /= 10; } x2 /= 10; } y[0] = Max; } long long impartire_y(long long X) { long long i; unsigned long R = 0; for (i = y[0]; i; i--) { y[i] = (R = 10 * R + y[i]) / X; R %= X; } while (!y[y[0]] && y[0] > 1) y[0]--; long long r = 0; for (i = 100; i > 0; i--) { if (y[i]) { for (long long j = i; j > 0; j--) { r = r * 10 + y[j]; } break; } } return r; } int main() { cin >> n; val = 2; for (level = 2; level <= n + 1; level++) { x = level * (level - 1); while (1) { inmultire_y(x); z = impartire_y(level - 1); z = z - val / (level - 1); break; } val = x; cout << z << n ; } return 0; } |
#include <algorithm> #include <array> #include <cassert> #include <chrono> #include <cmath> #include <cstring> #include <functional> #include <iomanip> #include <iostream> #include <map> #include <numeric> #include <queue> #include <random> #include <set> #include <vector> using namespace std; template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << ( << p.first << , << p.second << ) ; } template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << { ; string sep; for (const T &x : v) os << sep << x, sep = , ; return os << } ; } void dbg_out() { cerr << endl; } template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << << H; dbg_out(T...); } #ifdef NEAL_DEBUG #define dbg(...) cerr << ( << #__VA_ARGS__ << ): , dbg_out(__VA_ARGS__) #else #define dbg(...) #endif const int INF = int(1e9) + 5; int main() { ios::sync_with_stdio(false); #ifndef NEAL_DEBUG cin.tie(nullptr); #endif int N, A, B; string str; cin >> N >> A >> B >> str; vector<int> S(N); vector<int> char_to_index(128, -1); string chars; int C = 0; for (int i = 0; i < N; i++) { char ch = str[i]; if (char_to_index[ch] < 0) { char_to_index[ch] = C++; chars += ch; } S[i] = char_to_index[ch]; } dbg(chars); vector<int> char_start(C, INF); vector<int> char_end(C, -INF); vector<int> occur(C, 0); for (int i = 0; i < N; i++) { char_start[S[i]] = min(char_start[S[i]], i); char_end[S[i]] = max(char_end[S[i]], i + 1); occur[S[i]]++; } vector<bool> succeeds(1 << C, false); for (int mask = 1; mask < 1 << C; mask++) { int start = INF, end = -INF, count = 0; for (int c = 0; c < C; c++) if (mask >> c & 1) { start = min(start, char_start[c]); end = max(end, char_end[c]); count += occur[c]; } succeeds[mask] = count * B >= (end - start) * A; if (succeeds[mask]) dbg(mask, succeeds ); } vector<int> dp(1 << C, 0); for (int c = 0; c < C; c++) dp[1 << c] = 1 << c; for (int mask = 0; mask < 1 << C; mask++) { for (int split = 0; split < C; split++) { int lower = mask & ((1 << split) - 1); int upper = mask & -(1 << split); assert((lower | upper) == mask && (lower & upper) == 0); if (succeeds[lower] && dp[lower] != 0) dp[mask] |= dp[upper]; if (succeeds[upper] && dp[upper] != 0) dp[mask] |= dp[lower]; } for (int single = 0; single < C; single++) if (mask >> single & 1) { int without = mask & ~(1 << single); if (succeeds[without] && dp[without] != 0) dp[mask] |= 1 << single; } dbg(mask, dp[mask]); } int answer = dp[(1 << C) - 1]; cout << __builtin_popcount(answer); string sorted; for (int c = 0; c < C; c++) if (answer >> c & 1) sorted += chars[c]; sort(sorted.begin(), sorted.end()); for (auto &ch : sorted) cout << << ch; cout << n ; } |
#include <bits/stdc++.h> using namespace std; int main() { double a, d, x, y, r; int i, n; scanf( %lf%lf%d , &a, &d, &n); for (i = 1; i <= n; i++) { r = fmod(i * d, 4 * a); if (r <= a) x = r, y = 0; else if (r <= 2 * a) x = a, y = r - a; else if (r <= 3 * a) x = a - (r - 2 * a), y = a; else x = 0, y = a - (r - 3 * a); printf( %.10f %.10f n , x, y); } } |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; bool cap = false, low = false, num = false; for (int i = 0; i < s.size(); ++i) { if (s[i] >= a && s[i] <= z ) low = true; else if (s[i] >= A && s[i] <= Z ) cap = true; else if (s[i] >= 0 && s[i] <= 9 ) num = true; } if (s.size() >= 5 && cap && low && num) cout << Correct << endl; else cout << Too weak << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = (int)1e5 + 10; long long int vis[N]; vector<vector<int> > v; int dfs(int t) { vis[t] = 1; for (int i = 0; i < v[t].size(); i++) { if (vis[v[t][t]] == 0) { dfs(v[t][i]); } } return 0; } int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } int lcm(int a, int b) { return a * (b / gcd(a, b)); } int main() { long long int n, m; cin >> n >> m; while (1) { if (n == 0 or m == 0) break; if (n >= 2 * m) n = n % (2 * m); else if (m >= 2 * n) m = m % (2 * n); else break; } cout << n << << m << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ((void)0); ((void)0); ((void)0); int T, N, M1, M2, s, e; long long X; for (cin >> T; T--;) { M1 = M2 = 0x7fffffff; s = 0; e = 1e9; for (cin >> N >> X; N--;) { int d, h; cin >> d >> h; M1 = min(M1, -d); M2 = min(M2, h - d); } if (X + M1 <= 0) { cout << 1 n ; continue; } while (s <= e) { int m = (s + e) >> 1; if (X + 1LL * m * M2 + M1 <= 0) e = m - 1; else s = m + 1; } if (s > 1e9) cout << -1 n ; else cout << s + 1 << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int sum(int n) { int c = 0; while (n > 0) { c += n % 10; n /= 10; } return c; } void showarr(int arr[], int n) { for (int i = 0; i < n; i++) { cout << arr[i] << ; } cout << n ; } int arr[8001], f[8001]; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); int i, j, t; cin >> t; while (t--) { int s, k, n, q, m = 0; cin >> n; for (int i = 0; i < n; ++i) { cin >> arr[i]; f[i + 1] = 0; } int ans = 0, cnt = 0; for (i = 0; i < n; i++) { cnt = arr[i]; for (j = i + 1; j < n; j++) { cnt += arr[j]; if (cnt > n) break; f[cnt] = 1; } } for (i = 0; i < n; i++) { if (f[arr[i]]) ans++; } cout << ans << n ; } } |
#include <bits/stdc++.h> using namespace std; inline int QuickPow(int x, int y) { int Res = 1, Temp = x; while (y) { if (y & 1) Res = Res * Temp % 1000000007; Temp = Temp * Temp % 1000000007; y /= 2; } return Res; } inline void Swap(int &x, int &y) { int Temp = x; x = y; y = Temp; } inline int Max(int x, int y) { return x > y ? x : y; } inline int Min(int x, int y) { return x < y ? x : y; } inline void read(int &x) { x = 0; int f = 1; char s = getchar(); while (s < 0 || s > 9 ) { if (s == - ) f = -1; s = getchar(); } while (s >= 0 && s <= 9 ) { x = (x << 3) + (x << 1) + (s ^ 48); s = getchar(); } x *= f; } struct node { int v, Index; node() {} node(int V, int INDEX) { v = V; Index = INDEX; } }; stack<int> S; vector<node> G[400005]; int Dfn[400005], Low[400005], Bel[400005], Cnt, Col, Size[400005], Maxx, Root; bool InStack[400005]; void Tarjan(int x, int Pre) { Dfn[x] = Low[x] = ++Cnt; S.push(x); InStack[x] = 1; int l = G[x].size(); for (register int i = 0; i < l; ++i) { int to = G[x][i].v; if (to == Pre) continue; if (!Dfn[to]) { Tarjan(to, x); Low[x] = Min(Low[x], Low[to]); } else if (InStack[to]) Low[x] = Min(Low[x], Dfn[to]); } if (Dfn[x] == Low[x]) { Col++; int u; do { Size[Col]++; u = S.top(); S.pop(); InStack[u] = 0; Bel[u] = Col; } while (u != x); if (Size[Col] > Maxx) Maxx = Size[Col], Root = x; } } bool Pan[400005]; int From[400005 * 2], To[400005 * 2]; void Dfs(int x) { Pan[x] = 1; int l = G[x].size(); for (register int i = 0; i < l; ++i) { int to = G[x][i].v, Id = G[x][i].Index; if (Pan[to]) { From[Id] = x, To[Id] = to; continue; } if (Low[to] != Low[x]) From[Id] = to, To[Id] = x; else From[Id] = x, To[Id] = to; Dfs(to); } } int main() { int n, m; read(n); read(m); for (register int i = 1; i <= m; ++i) { int u, v; read(u); read(v); G[u].push_back(node(v, i)); G[v].push_back(node(u, i)); } for (register int i = 1; i <= n; ++i) if (!Dfn[i]) Tarjan(i, i); printf( %d n , Maxx); Dfs(Root); for (register int i = 1; i <= m; ++i) printf( %d %d n , From[i], To[i]); return 0; } |
#include <bits/stdc++.h> struct compare { bool operator()(const int& l, const int& r) { return l > r; } }; using namespace std; priority_queue<int, vector<int>, compare> pq; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; if (k % 3 && n % 3 == 0) { cout << Bob n ; } else if (k % 3 == 0) { n %= (k + 1); if (n % 3 == 0 && n != k) { cout << Bob n ; } else { cout << Alice n ; } } else { cout << Alice n ; } } } |
#include <bits/stdc++.h> using namespace std; long double pi = 2.0 * acos(0.0); mt19937 rng32(chrono::steady_clock::now().time_since_epoch().count()); long long int N; int main(int argc, char const *argv[]) { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int a, b, c, i, j, k, first, r, x, y, z; long long int n, m, p, q, t; long long int A[1000005]; long long int B[1000005]; first = 0; r = 0; cin >> n; k = (n) / 2; cout << k << n ; for (i = 0; i < k - 1; i++) cout << 2 ; cout << (2 + (n % 2)); return 0; } |
#include<bits/stdc++.h> #define ll long long #define rep(A,B,C) for(A=B;A<C;++A) #define pii pair<int,int> #define pll pair<ll,ll> #define fi first #define se second #define all(A) A.begin(),A.end() using namespace std; ///////////////////////////////////////////////////// #define vv vector #define Nmx 303030 #define lNmx 20 ll N,M; vv<pll> uvv[Nmx + 3]; pll xyv[Nmx + 3]; ll dblp[Nmx + 3][lNmx + 3]; ll dps[Nmx + 3]; ll mked[Nmx + 3], mkcm[Nmx + 3]; vv<pll> cmv[Nmx + 3]; ll an[Nmx + 3]; ll i, j, k; ll dfs1(ll a,ll p,ll d){ dblp[a][0] = p; dps[a] = d; ll i = 0, pi = 0; ll c = 0; c += mked[a] - mkcm[a]; rep(i,0,uvv[a].size()){ ll b = uvv[a][i].fi; if(b==p){ pi = i; continue; } ll rb= dfs1(b, a, d + 1); //printf( %lld,%lld,%lld n , a, b, rb); uvv[a][i].se = rb; c += rb; //assert(false); } an[a] = c; uvv[a][pi].se = c - mkcm[a]; //printf( %lld,%lld,%lld,%lld n , a, p, d,uvv[1][0].se); return uvv[a][pi].se; } void dblinit(){ ll i, j; rep(j,0,lNmx) rep(i,0,N+1) dblp[i][j + 1] = dblp[dblp[i][j]][j]; } pll lcap(ll a,ll b){ if(a==b) return {-1, -1}; if(dps[a]<dps[b]) swap(a, b); ll i = lNmx; while(dps[a]-dps[b]>1){ if((1<<i)<=dps[a]-dps[b]-1) a = dblp[a][i]; --i; } if(dps[a]>dps[b]){ if(dblp[a][0]==b) return {a, -1}; a = dblp[a][0]; } i = lNmx; while(i>=0){ if(dblp[a][i]!=dblp[b][i]){ a = dblp[a][i]; b = dblp[b][i]; } --i; } if(a>b) swap(a, b); return {a, b}; } ll calc(ll a){ ll i; map<ll, ll> mp; rep(i,0,uvv[a].size()){ mp[uvv[a][i].fi] = i; } ll ans = 0; map<pll, ll> mp2; rep(i,0,cmv[a].size()){ ll aa = --an[a]; ll p1 = cmv[a][i].fi, p2 = cmv[a][i].se; //printf( %lld:%lld,%lld,%lld,%lld ,a, i,p1,p2, an[a]); if(p1!=-1){ ll I = mp[p1]; aa -= --uvv[a][I].se; //printf( a%lld, , uvv[a][I].se); } if(p2!=-1){ ll I = mp[p2]; aa -= --uvv[a][I].se; //printf( b%lld, , uvv[a][I].se); } if(p1!=-1&&p2!=-1){ //printf( c%lld, , mp2[cmv[a][i]]); aa += mp2[cmv[a][i]]++; } //printf( n ); ans += aa; } return ans; } void solve(){ dfs1(1, 0, 1); dblinit(); //assert(false); rep(i,0,M){ pll xy = xyv[i]; if(xy.fi>xy.se) swap(xy.fi, xy.se); ++mked[xy.fi]; ++mked[xy.se]; //printf( ccc%lld,%lld, n , xy.fi, xy.se); if(xy.fi==xy.se){ cmv[xy.fi].push_back({-1, -1}); ++mkcm[xy.fi]; continue; } pll cmp = lcap(xy.fi, xy.se); //printf( ddd%lld,%lld,%lld n , cmp.fi, cmp.se,dblp[cmp.fi][0]); ll cm = dblp[cmp.fi][0]; cmv[cm].push_back(cmp); ++mkcm[cm]; } dfs1(1, 0, 1); /*rep(i,0,N+1){ printf( n%lld-%lld: n , i, an[i]); rep(j,0,uvv[i].size()){ printf( %lld,%lld n , uvv[i][j].fi, uvv[i][j].se); } }*/ ll ans=0; rep(i,0,N+1){ ll a = calc(i); //printf( %lld,%lld n , i, a); ans += a; } printf( %lld n , ans); } int main(){ scanf( %lld , &N); rep(i,1,N){ ll u, v; scanf( %lld%lld , &u, &v); uvv[u].push_back({v, 0}); uvv[v].push_back({u, 0}); } uvv[1].push_back({0, 0}); scanf( %lld , &M); rep(i,0,M){ ll u, v; scanf( %lld%lld , &u, &v); xyv[i] = {u, v}; } solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> g[100005]; int sz[100005], answer[100005]; long long ans = 0; vector<int> spis; void clears(int v, int pr) { sz[v] = 1; int pos = -1; for (int i = 0; i < (int)g[v].size(); i++) { int u = g[v][i]; if (u == pr) pos = i; else { clears(u, v); sz[v] += sz[u]; } } if (pos != -1) { swap(g[v][pos], g[v].back()); g[v].pop_back(); } return; } void dfs(int v, int len) { ans += (long long)2 * len; spis.push_back(v); for (int i = 0; i < (int)g[v].size(); i++) { int u = g[v][i]; dfs(u, len + 1); } return; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; for (int i = 1; i < n; i++) { int u, v; cin >> u >> v; g[u].push_back(v), g[v].push_back(u); } clears(1, -1); int cen = 1; while (true) { int mx = -1; for (int i = 0; i < (int)g[cen].size(); i++) { int u = g[cen][i]; if (2 * sz[u] > sz[cen]) mx = i; } if (mx == -1) break; int newcen = g[cen][mx]; swap(g[cen][mx], g[cen].back()); g[cen].pop_back(); g[newcen].push_back(cen); sz[cen] -= sz[newcen]; sz[newcen] += sz[cen]; cen = newcen; } dfs(cen, 0); cout << ans << n ; if (n % 2 == 0) { for (int i = 0; i < n / 2; i++) answer[spis[i]] = spis[i + n / 2], answer[spis[i + n / 2]] = spis[i]; } else { for (int i = 1; i < n / 2; i++) answer[spis[i]] = spis[i + n / 2], answer[spis[i + n / 2]] = spis[i]; answer[spis[0]] = spis[n / 2], answer[spis[n / 2]] = spis[n - 1], answer[spis[n - 1]] = spis[0]; } for (int i = 1; i <= n; i++) cout << answer[i] << ; cout << n ; return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:16777216 ) using namespace std; template <class T> T abs(T x) { return x > 0 ? x : -x; } int n; int m; int main() { int mas[100000]; cin >> n; for (int i = 0; i < (n); i++) { scanf( %d , &mas[i]); if (i < n / 2) mas[i] -= i; else mas[i] -= n - i - 1; } sort(mas, mas + n); int l = 0; int ans = 0; for (int i = 1; i <= n; i++) if (mas[i] != mas[l] || i == n) { if (mas[l] >= 1) ans = max(ans, i - l); l = i; } cout << n - ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int arr[n]; int sum = 0; for (int i = 0; i < n; i++) { cin >> arr[i]; sum += arr[i]; } int res = 0; for (int i = 0; i < n; i++) { if ((sum - arr[i]) % 2 == 0) res++; } cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); long long n, s; cin >> n >> s; long long a[n]; for (int i = 0; i < n; i++) cin >> a[i]; long long l = 0, r = n, total = 0; while (l < r) { long long mid = (l + r) / 2; long long cost[n]; for (int i = 0; i < n; i++) { cost[i] = a[i] + mid * (i + 1); } sort(cost, cost + n); total = 0; for (int i = 0; i < mid; i++) { total += cost[i]; } if (s < total) { r = mid; } else { l = mid; } if (r - l == 1) { int cost[n]; mid = r; for (int i = 0; i < n; i++) { cost[i] = a[i] + mid * (i + 1); } sort(cost, cost + n); total = 0; for (int i = 0; i < mid; i++) { total += cost[i]; } if (s >= total) { l = r; } else { mid = l; for (int i = 0; i < n; i++) { cost[i] = a[i] + mid * (i + 1); } sort(cost, cost + n); total = 0; for (int i = 0; i < mid; i++) { total += cost[i]; } } break; } } cout << l << << total << n ; return 0; } |
#include <bits/stdc++.h> #define endl n using namespace std; typedef long long lld; void solve(){ int n; cin>>n; vector<lld> a(n+1), b(n+1), p(n+2,0); for(int i=1;i<=n;i++){ cin>>a[i]; } for(int i=1;i<=n;i++){ cin>>b[i]; p[i]=a[i]*b[i]+p[i-1]; } lld ans=p[n]; for(int i=1;i<=n;i++){ lld curr=a[i]*b[i]; for(int l=i-1, r=i+1; l>=1 && r<=n; l--, r++){ curr+=a[r]*b[l]+a[l]*b[r]; ans=max(ans,curr+p[l-1]+p[n]-p[r]); } curr=0; for(int l=i, r=i+1; l>=1 && r<=n; l--, r++){ curr+=a[r]*b[l]+a[l]*b[r]; ans=max(ans,curr+p[l-1]+p[n]-p[r]); } } cout<<ans<<endl; } int32_t main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t; cin >> t; while (t--) { long long a, b, c, d; cin >> a >> b >> c >> d; if (a > (b * c)) { cout << (-1) << endl; continue; } long long k = (a / (d * b)); cout << (a * (k + 1)) - (d * b * k * (k + 1) / 2) << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> V[500500]; vector<int> SV[500500]; vector<int> MAX1[500500], MAX2[500500], MIN1[500500], MIN2[500500]; vector<pair<int, int>> T; int R[505000]; int main() { cin.sync_with_stdio(0); cin.tie(0); cout.tie(0); int tc; cin >> tc; for (int t = 1; t <= tc; t++) { int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { V[i].clear(); SV[i].clear(); } T.clear(); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { int x; cin >> x; V[i].push_back(x); } T.push_back(make_pair(V[i][0], i)); } sort(T.begin(), T.end()); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { SV[i].push_back(V[T[i].second][j]); } R[T[i].second] = i; } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { MAX1[i].push_back(0); MAX2[i].push_back(0); MIN1[i].push_back(0); MIN2[i].push_back(0); } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { int m1 = i == 0 ? -1 : MAX1[i - 1][j]; int m2 = j == 0 ? -1 : MAX1[i][j - 1]; MAX1[i][j] = max(max(m1, m2), SV[i][j]); } } for (int i = n - 1; i >= 0; i--) { for (int j = m - 1; j >= 0; j--) { int m1 = (i == n - 1) ? -1 : MAX2[i + 1][j]; int m2 = (j == m - 1) ? -1 : MAX2[i][j + 1]; MAX2[i][j] = max(max(m1, m2), SV[i][j]); } } for (int i = 0; i < n; i++) { for (int j = m - 1; j >= 0; j--) { int m1 = i == 0 ? 9999999 : MIN1[i - 1][j]; int m2 = (j == m - 1) ? 9999999 : MIN1[i][j + 1]; MIN1[i][j] = min(min(m1, m2), SV[i][j]); } } for (int i = n - 1; i >= 0; i--) { for (int j = 0; j < m; j++) { int m1 = (i == n - 1) ? 9999999 : MIN2[i + 1][j]; int m2 = (j == 0) ? 9999999 : MIN2[i][j - 1]; MIN2[i][j] = min(min(m1, m2), SV[i][j]); } } int ansx = -1, ansy = -1; for (int i = 0; i < n - 1; i++) { for (int j = 0; j < m - 1; j++) { if (MAX1[i][j] < MIN2[i + 1][j] && MAX2[i + 1][j + 1] < MIN1[i][j + 1]) { ansx = i; ansy = j; break; } } } if (ansx == -1 && ansy == -1) cout << NO n ; else { cout << YES n ; for (int i = 0; i < n; i++) { if (R[i] <= ansx) cout << B ; else cout << R ; } cout << ; cout << ansy + 1; cout << n ; } } } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:100000000000000 ) using namespace std; const double INF = 2e50; double sqr(double a) { return a * a; } int get_ch(double x, double y) { if (x <= 0 && y <= 0) return 1; if (x <= 0 && y >= 0) return 4; if (x >= 0 && y <= 0) return 2; return 3; } struct pt { double x, y; pt(double x, double y) : x(x), y(y) {} pt() {} void read() { cin >> x >> y; } double d() { return sqrt(sqr(x) + sqr(y)); } pt operator-(pt ot) { return pt(x - ot.x, y - ot.y); } bool operator==(pt ot) { return x == ot.x && y == ot.y; } double operator*(const pt ot) const { return (x * ot.y - y * ot.x); } bool operator<(const pt f) const { int a = get_ch(x, y); int b = get_ch(f.x, f.y); return (a < b || (a == b && (*this) * f >= 0)); } }; inline double get_an(pt f, pt s) { return acos((f.x * s.x + f.y * s.y) / f.d() / s.d()); } inline double vec_m(pt f, pt s) { return (f.x * s.y - f.y * s.x); } double with_a[501][501], with_b[501][501]; int main() { int n, m; cin >> n >> m; if (!m) { cout << n * (n - 1) * (n - 2) / 6; return 0; } vector<pt> f(n), s(m); for (int i = 0; i < n; i++) { f[i].read(); } for (int i = 0; i < m; i++) { s[i].read(); } double ans = 0; for (int i = 0; i < n; i++) { vector<pair<pt, pair<int, int> > > ev(n + m - 1 - i); int sz = 0; for (int j = i + 1; j < n; j++) { if (j == i) continue; ev[sz++] = make_pair(f[j] - f[i], make_pair(0, j)); } for (int j = 0; j < m; j++) { ev[sz++] = make_pair(s[j] - f[i], make_pair(1, j)); } sort(ev.begin(), ev.end()); for (int j = 0; j < (int)ev.size(); j++) { pt maxi = pt(INF, INF); int id = ev[j].second.second; if (ev[j].second.first) continue; for (int k = (j + 1) % (int)ev.size();; k = (k + 1) % (int)ev.size()) { if (k == j) break; int type = ev[k].second.first; int to_id = ev[k].second.second; pt temp = (type ? s[to_id] : f[to_id]); double to_an = vec_m(f[id] - f[i], temp - f[i]); if (to_an < 0) break; if (type) { if (maxi == pt(INF, INF) || vec_m(maxi - f[id], temp - f[id]) > 0) { maxi = temp; } } else { if (maxi == pt(INF, INF) || vec_m(maxi - f[id], temp - maxi) > 0) { ans++; } } } } } cout << fixed << setprecision(0) << ans; } |
#include <bits/stdc++.h> using namespace std; template <typename T> string tos(T a) { stringstream ss; string ret; ss << a; ss >> ret; return ret; } string st; int l, memo[1000009][2]; int get(int pos, int carry) { if (pos < 0) return carry; int &ret = memo[pos][carry]; if (ret != -1) return ret; ret = 9999999; if (carry == 0) { if (st[pos] == 0 ) return ret = get(pos - 1, 0); else { int ra = get(pos - 1, carry) + 1; int rb = get(pos - 1, 1 - carry) + 1; ret = min(ra, rb); return ret; } } else { if (st[pos] == 1 ) return ret = get(pos - 1, carry); else { int ra = get(pos - 1, 0) + 1; int rb = get(pos - 1, 1) + 1; ret = min(ra, rb); return ret; } } } int print_path(int pos, int carry) { if (pos < 0) { if (carry) printf( +2^%d n , l - pos - 1); return 0; } if (carry == 0) { if (st[pos] == 0 ) return print_path(pos - 1, 0); else { int ra = get(pos - 1, carry) + 1; if (ra == memo[pos][carry]) { printf( +2^%d n , l - pos - 1); return print_path(pos - 1, carry); } else { printf( -2^%d n , l - pos - 1); return print_path(pos - 1, 1 - carry); } } } else { if (st[pos] == 1 ) return print_path(pos - 1, carry); else { int ra = get(pos - 1, 0) + 1; if (ra == memo[pos][carry]) { printf( +2^%d n , l - pos - 1); return print_path(pos - 1, 0); } else { printf( -2^%d n , l - pos - 1); return print_path(pos - 1, 1); } } } } int main() { while (cin >> st) { memset(memo, -1, sizeof memo); ; l = st.size(); cout << get(l - 1, 0) << endl; print_path(l - 1, 0); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (b == 0) { return a; } return gcd(b, a % b); } signed main() { long long n; cin >> n; for (long long i = 0; i < n; i++) { long long a, b, c, d; cin >> a >> b >> c >> d; long long x = gcd(c, d); c /= x; d /= x; if (c == 0 && a != 0) { cout << -1 << n ; continue; } if (c == 0 && a == 0) { cout << 0 n ; continue; } if (c == d && a != b) { cout << -1 << n ; continue; } if (c == d && a == b) { cout << 0 n ; continue; } long long l = (a + c - 1) / c - 1; long long r = (long long)2e18 / d; while (r - l > 1) { long long m = (r + l) / 2; if (m * d >= b + m * c - a) { r = m; } else { l = m; } } cout << r * d - b << n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n = 0, a = 0; cin >> n >> a; long long int ar[n]; long long int i = 0; for (i = 0; i < n; i++) cin >> ar[i]; long long int pos = a - 1; if (n == 1) { if (ar[0] == 1) cout << 1 << endl; else cout << 0 << endl; } else if (n == 2) { if ((ar[0] == 1) && (ar[1] == 1)) cout << 2 << endl; else if ((ar[0] == 1) || (ar[1] == 1)) cout << 1 << endl; else cout << 0 << endl; } else { long long int low = pos - 1; long long int high = pos + 1; long long int ans = 0; if (ar[pos] == 1) ans++; while ((low >= 0) || (high < n)) { long long int l1 = ar[low]; long long int l2 = ar[high]; if ((low >= 0) && (high < n) && (l1 == 1) && (l2 == 1)) ans += 2; else if ((low >= 0) && (high >= n) && (l1 == 1)) ans++; else if ((low < 0) && (high < n) && (l2 == 1)) ans++; else ans = ans; low--; high++; } cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; int arr[100][100]; int main() { int n, a, b; scanf( %d , &n); for (int i = 0; i < n * n; i++) { scanf( %d%d , &a, &b); if (!arr[a][b]) { printf( %d , i + 1); for (int y = 0; y <= n; y++) { arr[a][y] = 1; arr[y][b] = 1; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; template <typename A, typename B = A> using pr = pair<A, B>; int main() { ios::sync_with_stdio(false), cin.tie(nullptr); cout << fixed << setprecision(10); int sy, a, b; cin >> sy >> a >> b; sy = -sy; int n; cin >> n; vector<pr<int>> segs(n); for (auto &[x, y] : segs) cin >> y >> x; sort((segs).begin(), (segs).end()); vector<ll> pref(n + 1); for (int i = 0; i < n; i++) pref[i + 1] = pref[i] + segs[i].first - segs[i].second; int q; cin >> q; while (q--) { int x, y; cin >> x >> y; auto get = [&](int k) { return (k - x) * double(y) / (sy + y); }; double x1 = x + get(a); double x2 = x + get(b); auto find = [&](double x) { return int(upper_bound((segs).begin(), (segs).end(), pr<int>{ceil(x + 1e-6), -1}) - segs.begin()); }; int i1 = find(x1); int i2 = find(x2); double sum = 0; if (i2 != i1) { sum += pref[i2] - pref[i1 + 1]; if (i1 != -1) sum += min<double>(segs[i1].first - segs[i1].second, segs[i1].first - x1); if (i2 != n) sum += max<double>(0, x2 - segs[i2].second); } else { int i = i2; if (i != -1 && i != n) sum += max<double>(0, min<double>(segs[i].first, x2) - max<double>(segs[i].second, x1)); } cout << sum * (sy + y) / y << n ; } } |
#include <bits/stdc++.h> using namespace std; const int limit = 3000000; const int tope = 100000; int absolut(int x) { if (x < 0) return -x; return x; } void die() { cout << -1 << endl; exit(0); } int n; int a[limit]; int b[limit]; int add[limit]; long long int nsol; vector<pair<int, int> > vsol; void fix(int pos) { while (int(vsol.size()) < tope and add[pos] > 0 and a[pos] < 9 and a[pos + 1] < 9) { a[pos]++; a[pos + 1]++; add[pos]--; vsol.push_back(pair<int, int>(pos, 1)); } while (int(vsol.size()) < tope and add[pos] < 0 and a[pos] > 0 and a[pos + 1] > 0) { a[pos]--; a[pos + 1]--; add[pos]++; vsol.push_back(pair<int, int>(pos, -1)); } } int main() { ios::sync_with_stdio(false); cin >> n; for (int i = 1; i <= n; i++) { char c; cin >> c; a[i] = c - 0 ; } for (int i = 1; i <= n; i++) { char c; cin >> c; b[i] = c - 0 ; } for (int i = 1; i < n; i++) { add[i] = b[i] - (a[i] + add[i - 1]); nsol += absolut(add[i]); } if (a[n] + add[n - 1] != b[n]) die(); while (int(vsol.size()) < nsol and int(vsol.size()) < tope) { for (int pos = 1; pos < n and int(vsol.size()) < tope; pos++) fix(pos); for (int pos = n - 1; pos >= 1 and int(vsol.size()) < tope; pos--) fix(pos); } cout << nsol << endl; for (int i = 0; i < int(vsol.size()) and i < tope; i++) cout << vsol[i].first << << vsol[i].second << endl; } |
#include <bits/stdc++.h> using namespace std; priority_queue<int, vector<int>, greater<int> > q; int tar[100005]; int n, k, add; int main() { cin >> n >> k; for (int i = 1; i <= n; i++) cin >> tar[i]; long long ans = 0; cin >> add; int tmp; for (int i = 1; i <= n; i++) { cin >> tmp; q.push(tmp); while (k < tar[i]) { if (q.empty()) { cout << -1 << endl; return 0; } k += add; ans += q.top(); q.pop(); } } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int tu(int val) { return (1 << val); } bool iset(int mask, int id) { if ((mask & tu(id)) != 0) return true; return false; } void doset(int &mask, int id) { mask |= tu(id); } void dounset(int &mask, int id) { mask = mask & (~tu(id)); } template <typename T> string tos(T a) { stringstream ss; string ret; ss << a; ss >> ret; return ret; } const long long LM = 1e18; long long N, K; vector<long long> pms, PA, push_back, temp; void proc(vector<long long> &ans, const vector<long long> &now) { ans.clear(); ans.push_back(1); int l = now.size(); for (int(x) = (0); (x) < (l); (x)++) { long double p = now[x]; int la = ans.size(); temp.clear(); for (int(i) = (0); (i) < (la); (i)++) { long double v = p * ans[i]; while (v <= LM) { temp.push_back(v); v *= p; } } la = temp.size(); for (int(i) = (0); (i) < (la); (i)++) ans.push_back(temp[i]); } sort(ans.begin(), ans.end()); int la = ans.size(); for (int(i) = (1); (i) < (la); (i)++) assert(ans[i] != ans[i - 1]); } long long count(long long val) { int la = PA.size(); int lb = push_back.size(); int ia = 0; int ib = lb - 1; long long ret = 0; while (ia < la && ib >= 0) { unsigned long long va = PA[ia] * push_back[ib]; if (va > val) ib--; else { ret += ib + 1; ia++; } } return ret; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; while (cin >> N) { vector<long long> pa, pb; pms.clear(); pms.resize(N); for (int(i) = (0); (i) < (N); (i)++) cin >> pms[i]; sort(pms.begin(), pms.end()); cin >> K; for (int(i) = (0); (i) < (N); (i)++) { if ((i % 2) == 0) pa.push_back(pms[i]); else pb.push_back(pms[i]); } proc(PA, pa); proc(push_back, pb); long long ans = -1; long long lo = 1; long long hi = LM; while (true) { if (hi - lo < 5) { for (long long x = lo; x <= hi; x++) { long long k = count(x); if (k == K) { ans = x; break; } } break; } long long m = (lo + hi) / 2; long long k = count(m); if (k >= K) hi = m; else lo = m; } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; string ans_t = YES ; string ans_f = NO ; void judge(int n) { if (n < 6 + 10 + 14 + 1) { cout << ans_f << endl; } else { cout << ans_t << endl; int tmp = n - 6 - 10 - 14; if (tmp == 6 || tmp == 10 || tmp == 14) { cout << 6 10 << 14 + 1 << << tmp - 1 << endl; } else { cout << 6 10 14 << tmp << endl; } } } int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; judge(n); } return 0; } |
#include <bits/stdc++.h> using namespace std; int read() { int x = 0, f = 0; char ch = getchar(); while (!isdigit(ch)) f |= ch == - , ch = getchar(); while (isdigit(ch)) x = 10 * x + ch - 0 , ch = getchar(); return f ? -x : x; } template <typename T> void print(T x) { if (x < 0) putchar( - ), x = -x; if (x >= 10) print(x / 10); putchar(x % 10 + 0 ); } template <typename T> void print(T x, char let) { print(x), putchar(let); } const int N = 1e3 + 5; int n, m, q, a[N][N], l[N][N][3]; long long sum; void change(int x, int y, int c) { a[x][y] = c; if (c == 1) { sum--; for (int i = 0; i <= min(x - 1, y - 1); i++) { sum -= l[x - i][y - i][1] + l[x - i][y - i][2]; l[x - i][y - i][1] = min(l[x - i][y - i][1], max(2 * i - 1, 0)); l[x - i][y - i][2] = min(l[x - i][y - i][2], max(2 * i - 1, 0)); sum += l[x - i][y - i][1] + l[x - i][y - i][2]; } y--; for (int i = 0; i <= min(x - 1, y - 1); i++) { sum -= l[x - i][y - i][1]; l[x - i][y - i][1] = min(l[x - i][y - i][1], 2 * i); sum += l[x - i][y - i][1]; } y++; x--; for (int i = 0; i <= min(x - 1, y - 1); i++) { sum -= l[x - i][y - i][2]; l[x - i][y - i][2] = min(l[x - i][y - i][2], 2 * i); sum += l[x - i][y - i][2]; } cout << sum << endl; } else { sum++; for (int i = 0; i <= min(x - 1, y - 1); i++) { sum -= l[x - i][y - i][1] + l[x - i][y - i][2]; if (a[x - i][y - i] == 0 && l[x - i][y - i][1] == max(2 * i - 1, 0)) { l[x - i][y - i][1] += l[x][y + 1][2] + 1 + (a[x][y + 1] == 1 ? 0 : 1); } if (a[x - i][y - i] == 0 && l[x - i][y - i][2] == max(2 * i - 1, 0)) { l[x - i][y - i][2] += l[x + 1][y][1] + 1 + (a[x + 1][y] == 1 ? 0 : 1); } sum += l[x - i][y - i][1] + l[x - i][y - i][2]; } sum--; sum--; l[x][y][2]--; l[x][y][1]--; y--; for (int i = 0; i <= min(x - 1, y - 1); i++) { sum -= l[x - i][y - i][1]; if (a[x - i][y - i] == 0 && l[x - i][y - i][1] == 2 * i) { l[x - i][y - i][1] += l[x + 1][y + 1][1] + 1 + (a[x + 1][y + 1] == 1 ? 0 : 1); } sum += l[x - i][y - i][1]; } y++; x--; for (int i = 0; i <= min(x - 1, y - 1); i++) { sum -= l[x - i][y - i][2]; if (a[x - i][y - i] == 0 && l[x - i][y - i][2] == 2 * i) { l[x - i][y - i][2] += l[x + 1][y + 1][2] + 1 + (a[x + 1][y + 1] == 1 ? 0 : 1); } sum += l[x - i][y - i][2]; } cout << sum << endl; } } void solve() { n = read(); m = read(); q = read(); for (int i = 0; i <= n + 1; i++) for (int j = 0; j <= m + 1; j++) a[i][j] = 1; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { a[i][j] = 0; l[i][j][1] = 2 * min(n - i, m - j); if (m - j > n - i) l[i][j][1]++; l[i][j][2] = 2 * min(n - i, m - j); if (n - i > m - j) l[i][j][2]++; sum += l[i][j][1] + l[i][j][2] + 1; } } int x, y; while (q--) { x = read(); y = read(); if (a[x][y] == 0) change(x, y, 1); else change(x, y, 0); } } int main() { solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int HX = 0x3F3F3F3F; int n, m, p, q; long long k; int f[1111]; int main() { cin >> n >> m >> k; memset(f, 0x3F, sizeof f); for (int i = 0; i < (n); ++i) { cin >> p >> q; f[p] = min(f[p], q); } long long ans = 0; for (int i = (1); i <= (m); ++i) ans += f[i]; cout << min(ans, k) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2 * 1000 * 100 + 100; int n, m, w[N], deg[N], ans[N]; vector<pair<int, int>> adj[N]; bool vis[N]; int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> n >> m; for (int i = 1; i <= n; i++) cin >> w[i]; for (int i = 1, v, u; i <= m; i++) { cin >> v >> u; deg[v]++, deg[u]++; adj[v].push_back({u, i}); adj[u].push_back({v, i}); } queue<int> q; for (int i = 1; i <= n; i++) if (deg[i] <= w[i]) q.push(i), vis[i] = true; int ind = m; while (q.size()) { int x = q.front(); q.pop(); for (auto u : adj[x]) { deg[u.first]--, deg[x]--; if (deg[u.first] <= w[u.first] && !vis[u.first]) vis[u.first] = true, q.push(u.first); if (!ans[u.second]) ans[u.second] = ind--; } } vector<int> res(m + 10); for (int i = 1; i <= m; i++) { if (!ans[i]) return cout << DEAD n , 0; res[ans[i]] = i; } cout << ALIVE n ; for (int i = 1; i <= m; i++) cout << res[i] << ; cout << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<vector<int> > adj(601); vector<int> unvisited, even, odd; int d[601], parent[601]; bool visited[601]; map<vector<int>, int> M; void RemoveFromUnvisited(int v) { int i = 0; for (; i < unvisited.size() && unvisited[i] != v; ++i) ; unvisited.erase(unvisited.begin() + i); } void PrintQueryOrAnswer(char c, vector<int> &A) { printf( %c %lu n , c, A.size()); for (auto x : A) { printf( %d , x); } printf( n ); fflush(stdout); } int PrintQuery(vector<int> A) { sort(A.begin(), A.end()); if (M.find(A) != M.end()) { return M[A]; } PrintQueryOrAnswer( ? , A); int m; scanf( %d , &m); M[A] = m; return m; } int Query(vector<int> &A, int s = 0) { if (s) { A.push_back(s); } int m = PrintQuery(A); if (s) { A.pop_back(); } return m; } int NextChild(int i, vector<int> A) { if (A.size() == 0) { return 0; } int m1 = Query(A, i); if (m1 == 0) { return 0; } if (A.size() == 1) { return A.back(); } int m2 = Query(A); if (m2 == m1) { return 0; } int j = NextChild(i, vector<int>(A.begin(), A.begin() + (A.size() / 2))); if (j == 0) { j = NextChild(i, vector<int>(A.begin() + (A.size() / 2), A.end())); } return j; } void AddEdge(int i, int j) { adj[i].push_back(j); adj[j].push_back(i); } void AddEdgeDFS(int i, bool markEvenOdd) { RemoveFromUnvisited(i); if (markEvenOdd) { if (d[i]) { odd.push_back(i); } else { even.push_back(i); } } for (int j = NextChild(i, unvisited); j > 0; j = NextChild(i, unvisited)) { AddEdge(i, j); if (markEvenOdd) { d[j] = 1 - d[i]; } AddEdgeDFS(j, markEvenOdd); } } pair<int, int> BipartiteDFS(int i, int p) { parent[i] = p; d[i] = 1 + d[p]; visited[i] = 1; pair<int, int> ans = make_pair(0, 0); for (auto j : adj[i]) { if (j == p) { continue; } if (visited[j]) { if ((d[i] - d[j]) % 2 == 0 && d[i] > d[j]) { return make_pair(i, j); } continue; } ans = max(ans, BipartiteDFS(j, i)); } return ans; } void AddEdges(vector<int> v, bool markEvenOdd) { unvisited = vector<int>(v); while (unvisited.size()) { AddEdgeDFS(unvisited.back(), markEvenOdd); } } int main() { int n; vector<int> V; scanf( %d , &n); for (int i = 1; i <= n; ++i) { V.push_back(i); } AddEdges(V, true); AddEdges(even, false); AddEdges(odd, false); pair<int, int> p = make_pair(0, 0); for (int i = 1; i <= n; ++i) { if (visited[i]) { continue; } p = max(p, BipartiteDFS(i, 0)); } int u, v; tie(u, v) = p; vector<int> ans; if (u == 0) { for (int i = 1; i <= n; ++i) { if (d[i] % 2) { ans.push_back(i); } } } else { for (; u != parent[v]; u = parent[u]) { ans.push_back(u); } } PrintQueryOrAnswer(v ? N : Y , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int pow2[30]; int ar[1000900], mark[1000090]; int main() { int n; int a, b; pow2[0] = 1; for (int i = 1, _n = 30; i < _n; i++) pow2[i] = pow2[i - 1] * 2; while (cin >> n) { memset(mark, -1, sizeof(mark)); int m = n - 1, r = 0; while (m > 1) { if (m % 2) r = 1; m /= 2; } if (n != 2 && !r) { mark[1] = 0; mark[0] = 1; } for (int i = n; i >= 0; i--) { if (mark[i] == -1) { int hi = 29, low = 0, x = 0; while (hi >= low) { int mid = (hi + low) / 2; if (pow2[mid] > i) { hi = mid - 1; } else if (pow2[mid] <= i) low = mid + 1, x = pow2[mid]; } int d = i - x; mark[i] = x - d - 1; mark[x - d - 1] = i; } } long long ret = 0; for (int i = 0, _n = n + 1; i < _n; i++) ret += (i ^ max(mark[i], 0)); cout << ret << endl; for (int i = 0, _n = n + 1; i < _n; i++) { if (i) cout << ; if (mark[i] == -1) mark[i] = 0; cout << mark[i]; } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long T, n, a[300010], c[300010], l[300010], r[300010]; long long lowbit(long long x) { return x & (-x); } void add(long long x, long long k) { for (long long i = x; i <= n; i += lowbit(i)) c[i] += k; } long long query(long long x) { long long sum = 0; for (long long i = x; i >= 1; i -= lowbit(i)) sum += c[i]; return sum; } signed main() { memset(l, 0, sizeof(l)); memset(r, 0, sizeof(r)); scanf( %lld , &n); for (long long i = 1; i <= n; i++) scanf( %lld , &a[i]); memset(c, 0, sizeof(c)); for (long long i = 1; i <= n; i++) { if (2 * a[i] - 1 <= n) l[i] = query(2 * a[i] - 1); else l[i] = query(n) - query(2 * a[i] - n - 1); add(a[i], a[i]); } memset(c, 0, sizeof(c)); for (long long i = n; i >= 1; i--) { if (2 * a[i] - 1 <= n) r[i] = query(2 * a[i] - 1); else r[i] = query(n) - query(2 * a[i] - n - 1); add(a[i], a[i]); } long long f = 0; for (long long i = 1; i <= n; i++) if (l[i] % (2 * a[i]) && r[i] % (2 * a[i])) { printf( YES n ); f = 1; break; } if (!f) printf( NO n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); vector<pair<int, int> > v_p; int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2; if (x2 < x1) swap(x1, x2); if (y2 < y1) swap(y1, y2); for (int i = y1; i <= y2; i++) { v_p.push_back(make_pair(x1, i)); v_p.push_back(make_pair(x2, i)); } for (int i = x1 + 1; i < x2; i++) { v_p.push_back(make_pair(i, y1)); v_p.push_back(make_pair(i, y2)); } int n, x, y, r; cin >> n; vector<tuple<int, int, int> > v; for (int i = 0; i < n; i++) { cin >> x >> y >> r; v.push_back(make_tuple(x, y, r)); } int cnt = 0; for (int i = 0; i < v_p.size(); i++) { bool flag = 1; for (int j = 0; j < n; j++) { int x2 = get<0>(v[j]); int y2 = get<1>(v[j]); int r = get<2>(v[j]); if (r * r >= ((v_p[i].first - x2) * (v_p[i].first - x2)) + ((v_p[i].second - y2) * (v_p[i].second - y2))) { flag = 0; break; } } if (flag) cnt++; } cout << cnt; return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { int n; cin >> n; while (n--) { string s; cin >> s; int szs = s.size(); bool z = 0, e = 0; int sum = 0; for (int i = 0; i < szs; i++) { sum += s[i] - 0 ; e |= (!((s[i] - 0 ) & 1) && ((s[i] - 0 ) || z)); z |= (s[i] == 0 ); } if (sum == 0 || (z && e && !(sum % 3))) cout << red n ; else cout << cyan n ; } } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 1; namespace fastinput { inline int readChar(); template <class T = int> inline T readInt(); template <class T> inline void writeInt(T x, char end = 0); inline void writeChar(int x); inline void writeWord(const char *s); static const int buf_size = 16384; inline int getChar() { static char buf[buf_size]; static int len = 0, pos = 0; if (pos == len) pos = 0, len = fread(buf, 1, buf_size, stdin); if (pos == len) return -1; return buf[pos++]; } inline int readChar() { int c = getChar(); while (c <= 32) c = getChar(); return c; } template <class T> inline T readInt() { int s = 1, c = readChar(); T x = 0; if (c == - ) s = -1, c = getChar(); while ( 0 <= c && c <= 9 ) x = x * 10 + c - 0 , c = getChar(); return s == 1 ? x : -x; } static int write_pos = 0; static char write_buf[buf_size]; inline void writeChar(char x) { if (write_pos == buf_size) fwrite(write_buf, 1, buf_size, stdout), write_pos = 0; write_buf[write_pos++] = x; } template <class T> inline void writeInt(T x, char end) { if (x < 0) writeChar( - ), x = -x; char s[24]; int n = 0; while (x || !n) s[n++] = 0 + x % 10, x /= 10; while (n--) writeChar(s[n]); if (end) writeChar(end); } inline void writeWord(const char *s) { while (*s) writeChar(*s++); } struct Flusher { ~Flusher() { if (write_pos) fwrite(write_buf, 1, write_pos, stdout), write_pos = 0; } } flusher; } // namespace fastinput using namespace fastinput; const string arr[6] = { S , M , L , XL , XXL , XXXL }; int decode(string s) { for (int i = 0; i < 6; ++i) if (s == arr[i]) return i; } int cnt[6]; int answer[N]; pair<int, int> want[N]; int give[N]; map<pair<int, int>, vector<int> > whowant; void NO() { puts( NO ); exit(0); } int main() { ::ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); for (int i = 0; i < 6; ++i) cin >> cnt[i]; int n; cin >> n; for (int i = 0; i < n; ++i) { string t; cin >> t; size_t x = t.find( , ); if (x != std::string::npos) { want[i].first = decode(t.substr(0, x)); want[i].second = decode(t.substr(x + 1)); } else want[i].first = decode(t), want[i].second = -1; whowant[want[i]].push_back(i); } for (int i = 0; i < 6; ++i) { vector<int> tmp = whowant[{i, -1}]; while (cnt[i] > 0 && tmp.size() > 0) { give[tmp.back()] = i; tmp.pop_back(); --cnt[i]; } if (tmp.size() > 0) NO(); tmp = whowant[{i - 1, i}]; while (cnt[i] > 0 && tmp.size() > 0) { give[tmp.back()] = i; tmp.pop_back(); --cnt[i]; } if (tmp.size() > 0) NO(); tmp = whowant[{i, i + 1}]; while (cnt[i] > 0 && tmp.size() > 0) { give[tmp.back()] = i; tmp.pop_back(); --cnt[i]; } whowant[{i, i + 1}] = tmp; } cout << YES n ; for (int i = 0; i < n; ++i) cout << arr[give[i]] << n ; return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; long long S[500005]; void add(int first, int a) { for (int i = first; i < 500005; i += i & -i) { S[i] += a; } } long long query(int first) { long long res = 0; for (int i = first; i > 0; i -= i & -i) { res += S[i]; } return res; } struct node { node *l, *r; int a, b; long long Min; long long tag; node(int _a, int _b) : l(NULL), r(NULL) { a = _a; b = _b; Min = 1e18; tag = 0; } } * root; void build(node *n) { if (n->a == n->b) return; int mid = (n->a + n->b) / 2; n->l = new node(n->a, mid); n->r = new node(mid + 1, n->b); build(n->l); build(n->r); } long long Min(node *n) { return n->Min + n->tag; } void pull(node *n) { n->Min = min(Min(n->l), Min(n->r)); } void push(node *n) { n->l->tag += n->tag; n->r->tag += n->tag; n->tag = 0; } void Set(node *n, int first, long long k) { if (n->a == n->b) { n->Min = k; n->tag = 0; return; } push(n); int mid = (n->a + n->b) / 2; if (first <= mid) Set(n->l, first, k); else Set(n->r, first, k); pull(n); } void add(node *n, int l, int r, int k) { if (n->a >= l && n->b <= r) { n->tag += k; return; } if (n->b < l || n->a > r) return; push(n); add(n->l, l, r, k); add(n->r, l, r, k); pull(n); } int loc[500005]; map<int, vector<int> > qu; int dfs(node *n) { if (Min(n) >= 0) { return 0; } if (n->a == n->b) return 1; push(n); int ret = dfs(n->l) + dfs(n->r); pull(n); return ret; } int main() { int q; scanf( %d , &q); vector<pair<char, int> > v; v.push_back(make_pair(( + ), (0))); vector<pair<int, int> > num; num.push_back(make_pair((0), (0))); for (int i = 1; i <= q; i++) { char c; int first; scanf( %c %d , &c, &first); v.push_back(make_pair((c), (first))); if (c == + ) num.push_back(make_pair((first), (i))); } sort(num.begin(), num.end()); for (int i = 1; i < num.size(); i++) { loc[num[i].second] = i; qu[num[i].first].push_back(i); } for (auto &it : qu) { reverse(it.second.begin(), it.second.end()); } root = new node(1, num.size() - 1); int R = num.size() - 1; build(root); int sum = 0; for (int i = 1; i <= q; i++) { char c; c = v[i].first; if (c == + ) { sum++; int first; first = v[i].second; int Index = loc[i]; long long val = query(Index - 1) * 2 - first; add(root, Index + 1, R, first * 2); Set(root, Index, val); add(Index, first); } else { sum--; int first; first = v[i].second; int Index = qu[first].back(); qu[first].pop_back(); add(root, Index + 1, R, -first * 2); Set(root, Index, 1e18); add(Index, -first); } printf( %d n , sum - dfs(root)); } } |
#include <bits/stdc++.h> using namespace std; struct Node { int r, idx; } p, q, t; struct Fin { int x, y, z; Fin(){}; Fin(int _x, int _y, int _z) { x = _x, y = _y, z = _z; } }; bool operator<(Node a, Node b) { return a.r < b.r; } priority_queue<Node> que; vector<Fin> vec; vector<Node> tmp; int main() { int n, mini = 110; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &p.r), p.idx = i, que.push(p), mini = min(mini, p.r); while (1) { tmp.clear(); tmp.push_back(que.top()); que.pop(); while (!que.empty()) { if (tmp[0].r == que.top().r) tmp.push_back(que.top()), que.pop(); else break; } if (que.empty()) { mini = tmp[0].r; break; } if (tmp.size() == 1) tmp.push_back(que.top()), que.pop(); for (int i = 0; i < tmp.size(); i++) tmp[i].r = max(0, tmp[i].r - 1); if (tmp.size() & 1) { for (int i = 0; i < tmp.size() - 3; i += 2) vec.push_back(Fin(tmp[i].idx, tmp[i + 1].idx, 0)), que.push(tmp[i]), que.push(tmp[i + 1]); vec.push_back(Fin(tmp[tmp.size() - 3].idx, tmp[tmp.size() - 2].idx, tmp[tmp.size() - 1].idx)); que.push(tmp[tmp.size() - 3]), que.push(tmp[tmp.size() - 2]), que.push(tmp[tmp.size() - 1]); } else for (int i = 0; i < tmp.size(); i += 2) vec.push_back(Fin(tmp[i].idx, tmp[i + 1].idx, 0)), que.push(tmp[i]), que.push(tmp[i + 1]); } printf( %d n%d n , mini, vec.size()); for (int i = 0; i < vec.size(); i++) { for (int j = 1; j <= n; j++) { if (j == vec[i].x || j == vec[i].y || j == vec[i].z) printf( 1 ); else printf( 0 ); } printf( n ); } } |
#include <bits/stdc++.h> using namespace std; int ok[1 << 20]; int F[1 << 9][1 << 9]; int d[1 << 9]; int bfs(int n) { d[0] = 0; for (int i = 1; i <= n; ++i) d[i] = -1; queue<int> Q; Q.push(0); while (!Q.empty() && d[n] == -1) { int node = Q.front(); Q.pop(); for (int i = 0; i <= n; ++i) if (d[i] == -1 && F[node][i]) Q.push(i), d[i] = node; } if (d[n] == -1) return 0; int flow = 1e9; for (int vertex = n; vertex; vertex = d[vertex]) flow = min(flow, F[d[vertex]][vertex]); for (int vertex = n; vertex; vertex = d[vertex]) F[d[vertex]][vertex] -= flow, F[vertex][d[vertex]] += flow; return flow; } vector<int> order; int mark[1 << 9]; void dfs(int node, int n, int how) { mark[node] = 1; order.push_back(node); for (int i = 1; i <= n; ++i) if (!mark[i] && (F[node][i] == how && F[i][node] != how)) dfs(i, n, 1 - how); } int Val[1 << 9]; int main(void) { int n; for (int i = 2; i <= 1e6; ++i) ok[i] = 1; for (int i = 2; i <= 1e3; ++i) if (ok[i]) for (int j = i * i; j <= 1e6; j += i) ok[j] = 0; cin >> n; vector<int> a, b, pa, pb; for (int i = 1; i <= n; ++i) { int val; cin >> val; Val[i] = val; if (val & 1) a.push_back(val), pa.push_back(i); else b.push_back(val), pb.push_back(i); } if (a.size() != b.size()) return puts( Impossible ) * 0; int sz = a.size(); for (int i = 1; i <= sz; ++i) F[0][i] = 2; for (int i = 1; i <= sz; ++i) F[i + sz][sz + sz + 1] = 2; for (int i = 0; i < sz; ++i) for (int j = 0; j < sz; ++j) if (ok[a[i] + b[j]]) F[i + 1][j + 1 + sz] = 1; int flow = 0; int cnt = 0; while ((cnt = bfs(sz + sz + 1)) != 0) flow += cnt; if (flow != sz + sz) return puts( Impossible ) * 0; vector<vector<int> > cycles; for (int i = 1; i <= sz + sz; ++i) if (!mark[i]) { order.clear(); dfs(i, sz + sz, 0); for (auto &it : order) if (it <= sz) it = pa[it - 1]; else it = pb[it - sz - 1]; cycles.push_back(order); } cout << (cycles.size()) << n ; for (auto cycle : cycles) { cout << cycle.size() << ; for (auto it : cycle) cout << it << ; cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; int pearls = 0, links = 0; cin >> s; for (int i = 0; i < s.size(); i++) { if (s[i] == - ) links++; else pearls++; } if (pearls == 0) cout << yes << endl; else if (links % pearls == 0) cout << yes << endl; else cout << no << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; using namespace std; int n, m, q; int a[210000]; int nxt[210000][20]; int loc[210000]; int p[210000]; int rp[210000]; int ans[210000]; pair<pair<int, int>, int> queries[210000]; int main() { scanf( %d %d %d , &n, &m, &q); for (int i = 0; i < n; i++) { scanf( %d , &p[i]); p[i]--; rp[p[i]] = i; } for (int i = 0; i < m; i++) { scanf( %d , &a[i]); a[i]--; a[i] = rp[a[i]]; } for (int i = 0; i < q; i++) { int l, r; scanf( %d %d , &l, &r); r--; l--; queries[i] = {{r, l}, i}; } memset(loc, -1, sizeof(loc)); for (int i = 0; i < m; i++) { int prev = (a[i] + n - 1) % n; nxt[i][0] = loc[prev]; loc[a[i]] = i; } for (int lvl = 1; lvl < 20; lvl++) { for (int i = 0; i < m; i++) { if (nxt[i][lvl - 1] == -1) nxt[i][lvl] = -1; else nxt[i][lvl] = nxt[nxt[i][lvl - 1]][lvl - 1]; } } sort(queries, queries + q); int cur_query = 0; int best = -1; for (int i = 0; i < m; i++) { int cur = i; for (int lvl = 0; lvl < 20; lvl++) if ((1 << lvl) & (n - 1)) cur = nxt[cur][lvl]; best = max(best, cur); for (; cur_query < q && queries[cur_query].first.first == i; cur_query++) { ans[queries[cur_query].second] = (best >= queries[cur_query].first.second); } } for (int i = 0; i < q; i++) { printf( %d , ans[i]); } } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; struct Matrix { long long a, b, c, d; Matrix(long long _a = 0, long long _b = 0, long long _c = 0, long long _d = 0) { a = _a; b = _b; c = _c; d = _d; } void normalize(Matrix& mat) { mat.a %= mod; mat.b %= mod; mat.c %= mod; mat.d %= mod; } const Matrix operator+(const Matrix& mat) { Matrix tmp(this->a + mat.a, this->b + mat.b, this->c + mat.c, this->d + mat.d); normalize(tmp); return tmp; } const Matrix operator*(const Matrix& mat) { Matrix tmp( this->a * mat.a + this->b * mat.c, this->a * mat.b + this->b * mat.d, this->c * mat.a + this->d * mat.c, this->c * mat.b + this->d * mat.d); normalize(tmp); return tmp; } bool operator==(const Matrix& mat) const { if (this->a == mat.a && this->b == mat.b && this->c == mat.c && this->d == mat.d) return true; return false; } bool operator!=(const Matrix& mat) const { return !(*this == mat); } void pprint() { return; cerr << --------------------------- << endl; cerr << this->a << | << this->b << endl; cerr << this->c << | << this->d << endl; cerr << --------------------------- << endl; } }; class SegmentTree { private: vector<Matrix> A, st, lazy; int n; Matrix lazyId; int left(int p) { return p << 1; } int right(int p) { return (p << 1) + 1; } void build(int p, int l, int r) { if (r - l == 1) { st[p] = A[l]; return; } int mid = (l + r) / 2; build(left(p), l, mid); build(right(p), mid, r); st[p] = st[left(p)] + st[right(p)]; } void apply(int p, int l, int r) { st[p] = lazy[p] * st[p]; if (r - l > 1) { lazy[left(p)] = lazy[p] * lazy[left(p)]; lazy[right(p)] = lazy[p] * lazy[right(p)]; } lazy[p] = lazyId; } void lazyUpdate(int p, int l, int r, int i, int j, Matrix& val) { if (lazy[p] != lazyId) apply(p, l, r); if (j <= l || r <= i) return; if (i <= l && r <= j) { lazy[p] = lazy[p] * val; apply(p, l, r); return; } int mid = (l + r) / 2; lazyUpdate(left(p), l, mid, i, j, val); lazyUpdate(right(p), mid, r, i, j, val); st[p] = st[left(p)] + st[right(p)]; } Matrix query(int p, int l, int r, int i, int j) { if (j <= l || r <= i) return Matrix(); if (lazy[p] != lazyId) apply(p, l, r); if (i <= l && r <= j) return st[p]; int mid = (l + r) / 2; Matrix uno = query(left(p), l, mid, i, j); Matrix dos = query(right(p), mid, r, i, j); return uno + dos; } public: SegmentTree(vector<Matrix> v) { A = v; n = v.size(); st.assign(4 * n, Matrix()); lazyId = Matrix(1, 0, 0, 1); lazy.assign(4 * n, lazyId); build(1, 0, n); } void update(int i, int j, Matrix& val) { lazyUpdate(1, 0, n, i, j, val); } Matrix query(int i, int j) { return query(1, 0, n, i, j); } }; Matrix pot(Matrix b, int k) { if (k == 0) return Matrix(1, 0, 0, 1); if (k % 2 == 0) { Matrix tmp = pot(b, k / 2); return tmp * tmp; } else { return b * pot(b, k - 1); } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); ; int n, m; cin >> n >> m; Matrix base = Matrix(1, 1, 1, 0); vector<Matrix> vec; for (int i = 0; i < n; i++) { int a; cin >> a; Matrix tmp = pot(base, a); vec.push_back(tmp); ; ; tmp.pprint(); } SegmentTree st(vec); for (int i = 0; i < m; i++) { int t; cin >> t; if (t == 1) { int l, r, x; cin >> l >> r >> x; l--; r--; Matrix tmp = pot(base, x); ; ; tmp.pprint(); st.update(l, r + 1, tmp); } else { int l, r; cin >> l >> r; l--; r--; Matrix tmp = st.query(l, r + 1); tmp.pprint(); long long res = tmp.c % mod; cout << res << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10, p = 1e9 + 7; map<int, int> mp; char s[N]; inline void A(int &x, int y) { x = (x + y >= p ? x + y - p : x + y); } inline void Append(int w) { int v1 = 0, v2 = 0; map<int, int>::iterator it; for (it = mp.begin(); it != mp.end() && it->first <= w; ++it) { A(v1, it->second); v2 = (v2 + 1ll * it->second * (w - it->first + 1)) % p; } mp.erase(mp.begin(), it); A(mp[w + 1], v1); mp[0] = v2; } int main() { scanf( %s , s + 1); int ln = 1, rn = strlen(s + 1); int time_l = 1, time_r = 1; while (s[ln] == 0 ) ++time_l, ++ln; if (ln > rn) { printf( %d n , rn); return 0; } while (s[rn] == 0 ) ++time_r, --rn; mp[0] = 1; while (ln != rn) { ++ln; int w = 0; while (s[ln] == 0 ) ++ln, ++w; Append(w); } int ans = 0; for (auto x : mp) A(ans, x.second); printf( %lld n , 1ll * ans * time_l % p * time_r % p); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> odd, even; int main() { int cnt1 = 0, cnt2 = 0, tem = -1; int n, k, p, x; scanf( %d%d%d , &n, &k, &p); for (int i = 0; i < n; i++) { scanf( %d , &x); if (x % 2 == 0) { cnt2++; even.push_back(x); } else { if (cnt1 >= k - p) { if (tem == -1) tem = x; else { even.push_back(tem); even.push_back(x); cnt2++; tem = -1; } } else { cnt1++; odd.push_back(x); } } } if (cnt1 < k - p || cnt2 < p || tem != -1) printf( NO n ); else { printf( YES n ); if (p == 0) { for (int i = 0; i < k - p - 1; i++) printf( %d %d n , 1, odd[i]); printf( %d , n - (k - p - 1)); for (int i = 0; i < even.size(); i++) printf( %d , even[i]); printf( %d n , odd[k - p - 1]); return 0; } for (int i = 0; i < k - p; i++) printf( %d %d n , 1, odd[i]); int tem2 = 0, cur = 0; while (tem2 < p - 1) { if (even[cur] % 2 == 0) { printf( %d %d n , 1, even[cur]); cur++; } else { printf( %d %d %d n , 2, even[cur], even[cur + 1]); cur++; cur++; } tem2++; } if (even.size() > cur) printf( %d , even.size() - cur); for (int i = cur; i < even.size(); i++) printf( %d , even[i]); } return 0; } |
#include<iostream> #include<stdio.h> using namespace std; int main() {long int max,x,y,t; cin>>t; while(t--) { cin>>x>>y; if(x==y) {cout<<2*x<<endl; continue; } max=x; if(x<y) { max=y; } cout<<2*max-1<<endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int n; int L; int R; struct data { int u; int f; int dis; int dep; }; queue<data> q1, q2; struct ed { int v; int val; int siz; int ori; friend bool operator<(ed a, ed b) { return a.siz < b.siz; } }; vector<ed> v[N]; int ng[N]; int tim; int nsiz[N]; int w[N]; int nu[N]; int siz[N]; bool cut[N]; int ans1; int ans2; struct dq { int q[3 * N]; int hd; int tl; inline void clr() { hd = 1; tl = 0; } inline bool emp() { return hd <= tl; } inline void ins(int j) { while (hd <= tl && w[j] >= w[q[tl]]) tl--; q[++tl] = j; } inline void del(int k) { while (hd <= tl && q[hd] > k) hd++; } inline int qmx() { return q[hd]; } } q; inline void clear(queue<data>& q) { queue<data> emp; swap(q, emp); } inline int dfs1(int u, int f) { siz[u] = 1; for (vector<ed>::iterator it = v[u].begin(); it != v[u].end(); ++it) if (it->v != f && !cut[it->v]) siz[u] += dfs1(it->v, u); return siz[u]; } inline int find(int u, int f, const int& tot) { for (vector<ed>::iterator it = v[u].begin(); it != v[u].end(); ++it) if (it->v != f && !cut[it->v] && 2 * siz[it->v] >= tot) return find(it->v, u, tot); return u; } inline int dfs3(int u, int f) { int mx = 0; for (vector<ed>::iterator it = v[u].begin(); it != v[u].end(); ++it) if (it->v != f && !cut[it->v]) mx = max(mx, dfs3(it->v, u)); return mx + 1; } inline bool bfs(data st, int mxsiz) { q.clr(); clear(q1); clear(q2); int j = min(R, mxsiz); for (; j >= L; j--) q.ins(j); for (q1.push(st); !q1.empty();) { data nw = q1.front(); q2.push(nw); q1.pop(); if (nw.dep > R) continue; int dl = max(L - nw.dep, 0); int dr = min(R - nw.dep, mxsiz); for (; j >= dl; j--) q.ins(j); q.del(dr); if (q.emp()) { int p = q.qmx(); if (nw.dis + w[p] >= 0) { ans1 = nu[p]; ans2 = nw.u; return true; } } for (vector<ed>::iterator it = v[nw.u].begin(); it != v[nw.u].end(); ++it) if (it->v != nw.f && !cut[it->v]) q1.push((data){it->v, nw.u, nw.dis + it->val, nw.dep + 1}); } for (; !q2.empty(); q2.pop()) { data a = q2.front(); if (w[a.dep] < a.dis) w[a.dep] = a.dis, nu[a.dep] = a.u; } return false; } inline bool solve(int u) { ++tim; int g; if (ng[tim] == -1) { dfs1(u, 0); g = find(u, 0, siz[u]); cut[g] = true; ng[tim] = g; nsiz[tim] = siz[u]; if (siz[u] == 1) return false; for (int i = 1; i <= siz[u]; i++) w[i] = -0x3f3f3f3f, nu[i] = 0; for (vector<ed>::iterator it = v[g].begin(); it != v[g].end(); ++it) if (!cut[it->v]) it->siz = dfs3(it->v, g); sort(v[g].begin(), v[g].end()); w[0] = 0; nu[0] = g; } else { g = ng[tim]; cut[g] = true; if (nsiz[tim] == 1) return false; for (int i = 1; i <= nsiz[tim]; i++) w[i] = -0x3f3f3f3f, nu[i] = 0; w[0] = 0; nu[0] = g; } for (vector<ed>::iterator it = v[g].begin(); it != v[g].end(); ++it) if (!cut[it->v]) if (bfs((data){it->v, g, it->val, 1}, it->siz)) return true; for (vector<ed>::iterator it = v[g].begin(); it != v[g].end(); ++it) if (!cut[it->v]) if (solve(it->v)) return true; return false; } inline bool jud(int mid) { tim = 0; for (int i = 1; i <= n; i++) for (vector<ed>::iterator it = v[i].begin(); it != v[i].end(); ++it) it->val = (it->ori >= mid) ? 1 : -1; for (int i = 1; i <= n; i++) cut[i] = false; return solve(1); } int main() { scanf( %d%d%d , &n, &L, &R); int l = 0; int r = 0; for (int i = 1; i <= n; i++) ng[i] = -1; for (int i = 1, u, V, va; i < n; i++) { scanf( %d%d%d , &u, &V, &va); r = max(r, va); v[u].push_back((ed){V, 0, 0, va}); v[V].push_back((ed){u, 0, 0, va}); } while (l != r) { int mid = (l + r + 1) / 2; if (jud(mid)) l = mid; else r = mid - 1; } jud(l); printf( %d %d , ans1, ans2); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; long long fact[200001], invfact[200001]; int n50 = 0, n100 = 0, k = 0; struct node { int l[2], r[2], b; }; long long nways[51][51][51][51][2], shortest[51][51][51][51][2]; queue<node> q; long long pmod(long long base, long long p) { if (p == 0) return 1LL; long long ret = pmod(base, p / 2); ret = (ret * ret) % MOD; if (p % 2 == 1) ret = (ret * base) % MOD; return ret; } long long invEuler(long long x) { return pmod(x, MOD - 2); } long long nCr(long long n, long long r) { long long ret = 1; ret *= fact[n]; ret = (ret * invfact[r]) % MOD; ret = (ret * invfact[n - r]) % MOD; return ret; } void bfs() { memset(nways, 0, sizeof(nways)); memset(shortest, -1, sizeof(shortest)); nways[n50][n100][0][0][0] = 1; shortest[n50][n100][0][0][0] = 0; node temp; temp.l[0] = n50; temp.l[1] = n100; temp.r[0] = 0; temp.r[1] = 0; temp.b = 0; q.push(temp); while (!q.empty()) { temp = q.front(); q.pop(); int l0, l1, r0, r1, b; l0 = temp.l[0]; l1 = temp.l[1]; r0 = temp.r[0]; r1 = temp.r[1]; b = temp.b; if (b == 0) { for (int i = 0; i <= l0; ++i) { for (int j = 0; j <= l1; ++j) { if (50 * i + 100 * j > k || (!i && !j)) continue; int _l0 = l0 - i, _l1 = l1 - j, _r0 = r0 + i, _r1 = r1 + j, _b = !b; if (shortest[_l0][_l1][_r0][_r1][_b] == -1 || shortest[_l0][_l1][_r0][_r1][_b] > shortest[l0][l1][r0][r1][b] + 1) { shortest[_l0][_l1][_r0][_r1][_b] = 1 + shortest[l0][l1][r0][r1][b]; nways[_l0][_l1][_r0][_r1][_b] = (((nCr(l0, i) * nCr(l1, j)) % MOD) * nways[l0][l1][r0][r1][b]) % MOD; temp.l[0] = _l0; temp.l[1] = _l1; temp.r[0] = _r0; temp.r[1] = _r1; temp.b = _b; q.push(temp); } else if (shortest[_l0][_l1][_r0][_r1][_b] == shortest[l0][l1][r0][r1][b] + 1) nways[_l0][_l1][_r0][_r1][_b] = (nways[_l0][_l1][_r0][_r1][_b] + (((nCr(l0, i) * nCr(l1, j)) % MOD) * nways[l0][l1][r0][r1][b]) % MOD) % MOD; } } } else { for (int i = 0; i <= r0; ++i) { for (int j = 0; j <= r1; ++j) { if (50 * i + 100 * j > k || (!i && !j)) continue; int _l0 = l0 + i, _l1 = l1 + j, _r0 = r0 - i, _r1 = r1 - j, _b = !b; if (shortest[_l0][_l1][_r0][_r1][_b] == -1 || shortest[_l0][_l1][_r0][_r1][_b] > shortest[l0][l1][r0][r1][b] + 1) { shortest[_l0][_l1][_r0][_r1][_b] = 1 + shortest[l0][l1][r0][r1][b]; nways[_l0][_l1][_r0][_r1][_b] = (((nCr(r0, i) * nCr(r1, j)) % MOD) * nways[l0][l1][r0][r1][b]) % MOD; temp.l[0] = _l0; temp.l[1] = _l1; temp.r[0] = _r0; temp.r[1] = _r1; temp.b = _b; q.push(temp); } else if (shortest[_l0][_l1][_r0][_r1][_b] == shortest[l0][l1][r0][r1][b] + 1) nways[_l0][_l1][_r0][_r1][_b] = (nways[_l0][_l1][_r0][_r1][_b] + (((nCr(r0, i) * nCr(r1, j)) % MOD) * nways[l0][l1][r0][r1][b]) % MOD) % MOD; } } } } } int main() { int n, in; fact[0] = 1; fact[1] = 1; invfact[0] = invEuler(1); invfact[1] = invfact[0]; for (int i = 2; i < 200001; ++i) { fact[i] = (fact[i - 1] * i) % MOD; invfact[i] = invEuler(fact[i]); } scanf( %d %d , &n, &k); for (int i = 0; i < n; ++i) { scanf( %d , &in); if (in == 50) n50++; else n100++; } bfs(); cout << shortest[0][0][n50][n100][1] << endl << nways[0][0][n50][n100][1]; } |
#include <bits/stdc++.h> using namespace std; unsigned long xor128() { static unsigned long x = time(NULL), y = 362436069, z = 521288629, w = 88675123; unsigned long t = (x ^ (x << 11)); x = y; y = z; z = w; return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8))); } double dot(complex<double> a, complex<double> b) { return a.real() * b.real() + a.imag() * b.imag(); } double gyaku_dot(complex<double> a, complex<double> b) { return a.real() * b.imag() - a.imag() * b.real(); } double leng(complex<double> a) { return sqrt(a.real() * a.real() + a.imag() * a.imag()); } double angles(complex<double> a, complex<double> b) { double cosine = dot(a, b) / (leng(a) * leng(b)); double sine = gyaku_dot(a, b) / (leng(a) * leng(b)); double kaku = acos(min((double)1.0, max((double)-1.0, cosine))); if (sine <= 0) { kaku = 2 * 3.141592653589793 - kaku; } return kaku; } vector<int> convex_hull(vector<complex<double>> a) { vector<int> ans; double now_minnest = a[0].real(); int now_itr = 0; for (long long i = 0; i < a.size(); ++i) { if (now_minnest > a[i].real()) { now_minnest = a[i].real(); now_itr = i; } } ans.push_back(now_itr); complex<double> ba(0, 1); while (true) { int now_go = 0; double now_min = 0; double now_length = 0; int starter = ans[ans.size() - 1]; for (int i = 0; i < a.size(); ++i) { if (i != starter) { double goa = angles(ba, a[i] - a[starter]); if (goa - now_min >= 1e-5 || (abs(goa - now_min) <= 1e-5 && (abs(a[i] - a[starter]) - now_length) >= 1e-5)) { now_min = goa; now_go = i; now_length = abs(a[i] - a[starter]); } } } if (now_go == ans[0]) break; ans.push_back(now_go); ba = complex<double>(a[now_go] - a[starter]); } return ans; } int ruiseki[1000000]; int main() { int test_case; cin >> test_case; for (long long i = 0; i < test_case; ++i) { string s; cin >> s; int ans = 0; ruiseki[0] = 0; for (int i = 0; i < s.length(); ++i) { if (i != 0) ruiseki[i] = ruiseki[i - 1]; if (s[i] == 1 ) { ruiseki[i]++; } } for (int i = 0; i < s.length(); ++i) { int now = 0; for (int q = i; q >= 0; --q) { if (i - q > 25) { int now_back = i - now + 1; int now_front = q; if (now_back > now_front) break; if (now_back < 0) break; int hoge = ruiseki[now_front]; if (now_back != 0) { hoge -= ruiseki[now_back - 1]; } if (hoge == 0) ans++; break; } if (s[q] == 1 ) { now += (1 << (i - q)); } if (now == i - q + 1) ans++; } } cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; int a[212345]; int cnts[212345]; int lft[212345]; int rght[212345]; int cumsum[212345]; int get_right_ans(int i) { return cumsum[rght[i]] - cumsum[i]; } int get_left_ans(int i) { if (lft[i]) return cumsum[i - 1] - cumsum[lft[i] - 1]; return cumsum[i - 1]; } void print_ans(int fin_ans, int slope) { if (cnts[fin_ans] < 1) { return; } if (cnts[fin_ans] < 2) { cnts[fin_ans] -= 1; printf( %d , fin_ans); return; } printf( %d , fin_ans); cnts[fin_ans] -= 1; print_ans(fin_ans + slope, slope); while (cnts[fin_ans]) { printf( %d , fin_ans); cnts[fin_ans]--; } } int main() { int n, tmp, fnd; scanf( %d , &n); ; for (int i = 0; i < n; i++) { scanf( %d , &a[i]); ; cnts[a[i]] += 1; } int lst_val = -1; for (int i = 0; i < 212345; i++) { lft[i] = lst_val; if (cnts[i] < 2) lst_val = i; } lst_val = 212345; for (int i = 212345 - 1; i >= 0; i--) { rght[i] = lst_val; if (cnts[i] < 2) lst_val = i; } for (int i = 1; i < 212345; i++) cumsum[i] = cumsum[i - 1] + cnts[i]; int maxi = 0; int fin_ans = -1; for (int i = 1; i < 212345; i++) { if (cnts[i] == 1) { if (1 + max(get_right_ans(i), get_left_ans(i)) > maxi) { maxi = max(maxi, 1 + max(get_right_ans(i), get_left_ans(i))); fin_ans = i; } } else if (cnts[i] > 1) { if (cnts[i] + get_right_ans(i) + get_left_ans(i) > maxi) { maxi = max(maxi, cnts[i] + get_right_ans(i) + get_left_ans(i)); fin_ans = i; } } } printf( %d n , maxi); if (cnts[fin_ans] == 1) { printf( %d , fin_ans); if (get_left_ans(fin_ans) > get_right_ans(fin_ans)) print_ans(fin_ans - 1, -1); else print_ans(fin_ans + 1, +1); } else { if (get_left_ans(fin_ans)) { printf( %d , fin_ans); print_ans(fin_ans - 1, -1); cnts[fin_ans] -= 1; } if (get_right_ans(fin_ans)) { printf( %d , fin_ans); print_ans(fin_ans + 1, 1); cnts[fin_ans] -= 1; } while (cnts[fin_ans]) { printf( %d , fin_ans); cnts[fin_ans]--; } } } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const long long INF = 1e10; template <typename T> void cmax(T &a, T b) { a = max(a, b); } template <typename T> void cmin(T &a, T b) { a = min(a, b); } signed main() { string s; cin >> s; long long a[5555] = {}; long long b[5555] = {}; for (long long i = 0; i < (s.size()); i++) { a[i + 1] += a[i]; b[i + 1] += b[i]; if (s[i] == a ) a[i + 1]++; else b[i + 1]++; } long long ans = 0; for (long long i = 0; i < (s.size() + 1); i++) for (long long j = (i); j < (s.size() + 1); j++) cmax(ans, a[s.size()] - a[j] + b[j] - b[i] + a[i]); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; void solve(double S, double a, double b, double c, double* result) { if ((a == 0) && (b == 0) && (c == 0)) { result[0] = S; } else if ((a == 0) && (b == 0) && (c > 0)) { result[2] = S; } else if ((a == 0) && (b > 0) && (c == 0)) { result[1] = S; } else if ((a > 0) && (b == 0) && (c == 0)) { result[0] = S; } else if ((a == 0) && (b > 0) && (c > 0)) { result[1] = S * b / (b + c); result[2] = S * c / (b + c); } else if ((a > 0) && (b == 0) && (c > 0)) { result[0] = S * a / (a + c); result[2] = S * c / (a + c); } else if ((a > 0) && (b > 0) && (c == 0)) { result[0] = S * a / (a + b); result[1] = S * b / (a + b); } else if ((a > 0) && (b > 0) && (c > 0)) { result[0] = S * (a * (a + b)) / ((a + b) * (a + b + c)); result[1] = S * (b * (a + b)) / ((a + b) * (a + b + c)); result[2] = S * c / (a + b + c); } } int main() { unsigned int S(0), a(0), b(0), c(0); double result[3] = {0.0, 0.0, 0.0}; cin >> S; cin >> a; cin >> b; cin >> c; solve((double)S, (double)a, (double)b, (double)c, result); cout << std::fixed << std::setprecision(10) << result[0] << << result[1] << << result[2]; } |
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { if (a == 0) return 0; return gcd(b % a, a) + b / a; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n; while (n--) { int a, b; cin >> a >> b; cout << gcd(a, b) << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long p, ans, num; int n; string s[500000]; int main() { cin >> n >> p; p /= 2; for (int i = 1; i <= n; ++i) { cin >> s[i]; } for (int i = n; i >= 1; --i) { num *= 2; if (s[i] == halfplus ) num++; ans += num; } cout << ans * p << endl; } |
#include <bits/stdc++.h> using namespace std; template <typename G1, typename G2 = G1, typename G3 = G1> struct triple { G1 first; G2 second; G3 T; }; const long double eps = 1e-12; int sign(long double x) { return x < -eps ? -1 : x > eps; } int dblcmp(long double x, long double y) { return sign(x - y); } long double dot(complex<long double> a, complex<long double> b) { return real(conj(a) * b); } long double cross(complex<long double> a, complex<long double> b) { return imag(conj(a) * b); } struct Point { complex<long double> p; int id; long double operator*(const Point o) const { return cross(this->p, o.p); } Point operator-(const Point o) const { return {p - o.p}; } bool operator<(const Point o) const { if (dblcmp(p.real(), o.p.real()) == 0) return dblcmp(p.imag(), o.p.imag()) < 0; return dblcmp(p.real(), o.p.real()) < 0; } }; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; vector<vector<int>> mp1(n); map<pair<long long, long long>, int> mp2; vector<Point> v; int c = 0; for (int i = 0; i < n; i++) { int x, y; cin >> x >> y; if (mp2.count({x, y}) == 0) { v.push_back({{10000.0 / x, 10000.0 / y}, c}); mp2[{x, y}] = c++; } mp1[mp2[{x, y}]].push_back(i + 1); } sort(v.begin(), v.end()); vector<Point> hull; for (int i = 0; i < c; i++) { while (hull.size() > 1 && dblcmp((hull.end()[-1] - hull.end()[-2]) * (v[i] - hull.end()[-1]), 0) < 0) hull.pop_back(); hull.push_back(v[i]); } while (hull.size() > 1 && dblcmp(hull.end()[-2].p.imag(), hull.end()[-1].p.imag()) <= 0) hull.pop_back(); vector<int> ans; for (auto &i : hull) for (auto j : mp1[i.id]) ans.push_back(j); sort(ans.begin(), ans.end()); for (int i = 0; i < ans.size(); i++) cout << ans[i] << n [i == ans.size() - 1]; return 0; } |
#include <bits/stdc++.h> using namespace std; long long M = 1e9 + 7; long long powmodM(long long a, long long b, long long c = M) { long long res = 1; while (b) { if (b & 1) res = (res * a) % M; a = (a * a) % M; b /= 2; } return res; } long long power(long long a, long long b) { long long res = 1; while (b) { if (b & 1) res = (res * a); a = (a * a); b /= 2; } return res; } long long gcd(long long a, long long b) { while (a && b) a > b ? a %= b : b %= a; return a + b; } long long lcm(long long a, long long b) { return (max(a, b) / gcd(a, b)) * min(a, b); } vector<long long int> sieve(long long int n) { vector<long long int> ans, prime(2 * 1e6); prime[0] = false; prime[1] = false; for (long long int p = 2; p * p <= n; p++) if (prime[p]) for (long long int i = p * p; i <= n; i += p) prime[i] = 0; for (long long p = (2); p <= (n); ++p) if (prime[p]) ans.push_back(p); return ans; } long long modInverse(long long n, long long p = M) { return powmodM(n, p - 2, p); } long long nCrModP(long long n, long long r, long long p = M) { if (r == 0) return 1; long long fac[n + 1]; fac[0] = 1; for (long long i = (1); i <= (n); ++i) fac[i] = fac[i - 1] * i % p; return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) % p; } double pie = 3.14159265358979323846264338; const long long int INF = 0x3f3f3f3f; class l { public: char data; l *next; l *prev; l(char a) { data = a; prev = NULL; next = NULL; } }; map<long long int, long long int> fre; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int n, m; cin >> n >> m; vector<long long int> arr(n); for (long long i = (0); i <= (n - 1); ++i) cin >> arr[i]; if (m == arr[0]) { cout << -1; return 0; } long long int ma = 0; fre[arr[ma]] = 1; bool ok = 1; long long int uski = 0; for (long long i = (1); i <= (n - 1); ++i) { if (arr[i] == m) { uski++; vector<long long int> re; for (auto u : fre) { if (u.second < uski) re.push_back(u.first); } for (auto u : re) { fre.erase(u); } if (!fre.size()) { cout << -1; return 0; } } if (!uski) fre[arr[i]]++; else if (fre[arr[i]]) { fre[arr[i]]++; } } vector<long long int> re; for (auto u : fre) { if (u.second < uski) re.push_back(u.first); } for (auto u : re) { fre.erase(u); } if (!fre.size()) { cout << -1; return 0; } if (fre.size()) { cout << fre.begin()->first; } else { cout << -1; } } |
#include <bits/stdc++.h> using namespace std; vector<int> temp(100005); vector<int> v(100005); int fn(int l, int h, int x) { while (h - l > 1) { int mid = (h + l) / 2; if (temp[mid] >= x) { h = mid; } else { l = mid; } } if (temp[h] > x) return h; else return l; } int main() { ios_base::sync_with_stdio(false); int n; cin >> n; for (int i = 0; i < n; i++) { cin >> v[i]; } int len = 1; temp[0] = v[0]; for (int i = 1; i < n; i++) { if (temp[0] > v[i]) { temp[0] = v[i]; } else if (v[i] > temp[len - 1]) { temp[len] = v[i]; len++; } else { int index = fn(0, len - 1, v[i]); temp[index] = v[i]; } } cout << len; } |
#include <bits/stdc++.h> using namespace std; const int M = 1e9 + 7; long long fastpower(long long x, long long n, long long M) { if (n == 0) return 1; else if (n % 2 == 0) return fastpower((x * x) % M, n / 2, M); else return (x * fastpower((x * x) % M, (n - 1) / 2, M)) % M; } long long GCD(long long A, long long B) { if (B == 0) return A; else return GCD(B, A % B); } bool vowl(char c) { return c == a || c == e || c == i || c == o || c == u ; } long long modInverse(long long A, long long M) { return fastpower(A, M - 2, M); } void sieve(long long N) { bool isPrime[N + 1]; for (long long i = 0; i <= N; ++i) { isPrime[i] = true; } isPrime[0] = false; isPrime[1] = false; for (long long i = 2; i * i <= N; ++i) { if (isPrime[i] == true) { for (long long j = i * i; j <= N; j += i) isPrime[j] = false; } } } vector<long long> factorize(long long n) { vector<long long> res; for (long long i = 2; i * i <= n; ++i) { while (n % i == 0) { res.push_back(i); n /= i; } } if (n != 1) { res.push_back(n); } return res; } long long dp[300000][20]; long long n, m, k; long long arr[20]; long long cost[20][20]; long long cal(string s) { reverse(s.begin(), s.end()); long long ans = 0; for (long long i = 0; i < s.length(); i++) { if (s[i] == 1 ) ans += (1 << i); } return ans; } long long solve(string &s, int prev) { int p = 0; int a = 0; for (int i = n - 1; i >= 0; i--) { if (s[i] == 1 ) { a++; p += (1 << (n - i - 1)); } } if (a == m) return 0; if (dp[p][prev] != -1) return dp[p][prev]; long long ans = 0; for (long long i = 0; i < n; i++) { if (s[i] == 0 ) { s[i] = 1 ; ans = max(ans, arr[i + 1] + cost[prev][i + 1] + solve(s, i + 1)); s[i] = 0 ; } } return dp[p][prev] = ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m >> k; string s = ; for (long long i = 1; i <= n; i++) { cin >> arr[i]; s += 0 ; } for (long long i = 0; i < k; i++) { long long x, y, c; cin >> x >> y >> c; cost[x][y] = c; } memset(dp, -1, sizeof(dp)); cout << solve(s, 0) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; int main() { int a, b, c, d; scanf( %d%d%d%d , &a, &b, &c, &d); if (a == 0 && b == 0 && c == 0 && d == 0) { printf( 1 n ); } else if (a == 0 && d == 0 && c != 0) { printf( 0 n ); } else if (a != d) { printf( 0 n ); } else { printf( 1 n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { cin.tie(0); cin.sync_with_stdio(0); long long n, a[5001], cnt = 1, maxn = 0; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); for (int i = 0; i < n - 1; i++) { if (a[i] == a[i + 1]) cnt++; if (a[i] != a[i + 1]) cnt = 1; maxn = max(maxn, cnt); } maxn = max(maxn, cnt); cout << maxn; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s, ans, s1; cin >> s; s1 = s; int l = s.length(), i; int j = l - 1, flag = 0; while (i < j) { if (s[i] != s[j]) { flag = 1; break; } i++; j--; } if (flag) { reverse(s1.begin(), s1.end()); ans = s + s1; cout << ans; } else cout << s; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; s[0] = toupper(s[0]); cout << s << endl; return 0; } |
#include <bits/stdc++.h> const long long md = 1e9 + 7; const int Inf = 1e9; const long long Inf64 = 1e18; const long long MaxN = 1e6 + 100; const long double eps = 1e-15; using namespace std; long long Tree[4 * MaxN]; long long getSum(long long l, long long r, long long x, long long y, long long id) { if (l == x && r == y) { return Tree[id]; } else { long long mid = (l + r) / 2; if (mid >= y) { return getSum(l, mid, x, y, 2 * id + 1); } else if (mid + 1 <= x) { return getSum(mid + 1, r, x, y, 2 * id + 2); } else { return getSum(l, mid, x, mid, 2 * id + 1) + getSum(mid + 1, r, mid + 1, y, 2 * id + 2); } } } void edit(long long l, long long r, long long x, long long id) { if (l == r) { Tree[id]++; } else { long long mid = (l + r) / 2; if (mid >= x) { edit(l, mid, x, 2 * id + 1); Tree[id] = Tree[2 * id + 1] + Tree[2 * id + 2]; } else { edit(mid + 1, r, x, 2 * id + 2); Tree[id] = Tree[2 * id + 1] + Tree[2 * id + 2]; } } } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long N; cin >> N; vector<pair<long long, long long> > Zip(N); for (int i = 0; i < N; i++) { long long a; cin >> a; Zip[i] = {a, i}; } sort(Zip.begin(), Zip.end()); vector<long long> Ans(N); for (int i = 0; i < N; i++) { long long t = getSum(0, N - 1, Zip[i].second, N - 1, 0); Ans[Zip[i].second] = t; edit(0, N - 1, Zip[i].second, 0); } fill(Tree, Tree + 4 * MaxN, 0); reverse(Zip.begin(), Zip.end()); long long Res = 0; for (int i = 0; i < N; i++) { long long t = getSum(0, N - 1, 0, Zip[i].second, 0); Res += Ans[Zip[i].second] * t; edit(0, N - 1, Zip[i].second, 0); } cout << Res; cerr << n << Time execute: << clock() / (double)CLOCKS_PER_SEC << sec << n ; return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; const long long MOD = 1e9 + 7; long long a[200012]; long long in[200021], out[200012]; void solve() { long long n, m, i, j, c, sum; i = j = c = sum = 0; cin >> n; for (i = 0; i < n; ++i) { cin >> a[i]; --a[i]; if (a[i] != -1) { ++in[a[i]]; ++out[i]; } } vector<long long> loops; for (i = 0; i < n; ++i) { if (in[i] == 0 and out[i] == 0) { loops.push_back(i); } } if (loops.size() == 1) { long long init = loops[0]; for (i = 0; i < n; ++i) { if (in[i] == 0 and i != init) { a[init] = i; ++out[init]; ++in[i]; break; } } } else if (loops.size() > 1) { for (i = 0; i < loops.size(); ++i) { long long curr = loops[i]; long long nxt = loops[(i + 1) % loops.size()]; a[curr] = nxt; ++in[nxt]; ++out[curr]; } } vector<long long> ins, outs; for (i = 0; i < n; ++i) { if (in[i] == 0) ins.push_back(i); if (out[i] == 0) outs.push_back(i); } for (i = 0; i < outs.size(); ++i) { a[outs[i]] = ins[i]; } for (i = 0; i < n; ++i) { cout << a[i] + 1 << ; } cout << n ; } signed main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> prefix_function(const vector<int>& s) { int n = s.size(); vector<int> pi(n); for (int i = 1; i < n; ++i) { int j = pi[i - 1]; while (j > 0 && s[i] != s[j]) j = pi[j - 1]; if (s[i] == s[j]) ++j; pi[i] = j; } return pi; } int n; set<int> f[100005]; int getLen(int a, int b) { int len = b - a; if (len <= 0) len += n; return len; } int go(int len) { if (f[len].size() == 0) return 1; else if (f[len].size() < 2) return -1; vector<int> diffs; int last = -1, fir = -1; for (int x : f[len]) { if (last == -1) fir = x; else diffs.push_back(getLen(last, x)); last = x; } diffs.push_back(getLen(last, fir)); vector<int> pref = prefix_function(diffs); int cand = diffs.size() - pref.back(); if (diffs.size() % cand == 0 && cand < diffs.size()) { int sum = 0; for (int i = 0; i < cand; ++i) sum += diffs[i]; return sum; } return -1; } long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } int main() { ios::sync_with_stdio(false); int m; cin >> n >> m; for (int i = 0; i < m; ++i) { int a, b; cin >> a >> b; int len = getLen(a, b); if (2 * len > n || 2 * len == n && a > b) len = n - len, swap(a, b); f[len].insert(a - 1); } long long ans = 1; for (int i = 1; i < n; ++i) { if (2 * i == n) continue; int cur = go(i); if (cur == -1) { cout << No << endl; return 0; } ans = lcm(ans, cur); if (ans >= n) { cout << No << endl; return 0; } } if (n % 2 == 0) { int cur = go(n / 2); if (cur != -1 && lcm(ans, cur) < n || lcm(ans, n / 2) < n) { } else { cout << No << endl; return 0; } } cout << Yes << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<long long> arr; long long binarySearchCount(long long n, long long key) { long long left = 0, right = n; long long mid; while (left < right) { mid = (right + left) >> 1; if (arr[mid] == key) { while (mid + 1 < n && arr[mid + 1] == key) mid++; break; } else if (arr[mid] > key) right = mid; else left = mid + 1; } while (mid > -1 && arr[mid] > key) mid--; return mid; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n; cin >> n; long long x; for (long long i = 0; i < n; i++) { cin >> x; arr.push_back(abs(x)); } sort(arr.begin(), arr.end()); long long ans = 0; for (long long i = 0; i < n - 1; i++) { long long temp = binarySearchCount(n, 2 * arr[i]); ans += temp - i; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const int N = 2e5 + 5; inline int read() { int res = 0, ch, flag = 0; if ((ch = getchar()) == - ) flag = 1; else if (ch >= 0 && ch <= 9 ) res = ch - 0 ; while ((ch = getchar()) >= 0 && ch <= 9 ) res = res * 10 + ch - 0 ; return flag ? -res : res; } int n, m, cnt; struct node { int x, y; }; node p[N]; vector<int> data; int bit[N], t[N]; long long ans; void add(int i) { while (i <= m) { bit[i]++; i += i & -i; } } int sum(int i) { int res = 0; while (i > 0) { res += bit[i]; i -= i & -i; } return res; } bool cmp(node a, node b) { if (a.y != b.y) return a.y > b.y; return a.x < b.x; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d%d , &p[i].x, &p[i].y); data.push_back(p[i].x); } sort(data.begin(), data.end()); data.erase(unique(data.begin(), data.end()), data.end()); m = data.size(); for (int i = 1; i <= n; i++) p[i].x = lower_bound(data.begin(), data.end(), p[i].x) - data.begin() + 1; sort(p + 1, p + n + 1, cmp); for (int i = 1; i <= n;) { int j = i; while (j < n && p[j].y == p[j + 1].y) j++; t[i - 1] = 0; for (int k = i; k <= j; k++) { if (sum(p[k].x) - sum(p[k].x - 1) == 0) { add(p[k].x); cnt++; } t[k] = sum(p[k].x); } for (int k = i; k <= j; k++) ans += 1LL * (t[k] - t[k - 1]) * (cnt - t[k] + 1); i = j + 1; } printf( %I64d n , ans); return 0; } |
#include<bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while(t--) { string s; cin >> s; cout << s.size() << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string b; cin >> b; if (b == 1 ) { cout << 0 << endl; return 0; } int n = (int)((b).size()); string a((int)((b).size()), - ); bool flag = true; if (n > 2) { if (b[0] != 1 ) flag = false; for (__typeof(n) i = (1); i != (n); i++) if (b[i] != 0 ) flag = false; if (flag) { cout << 0 << endl; return 0; } flag = true; } int i = 0, j = n - 1; int pc = 0, cc = 0; while (i <= j) { int sum = b[j] + (10 * cc) - pc - 0 ; if (sum == -1) { if (cc == 0 && b[i] != 9 ) { flag = false; break; } else if (cc == 1 && b[i] != 0 ) { flag = false; break; } sum = 9; cc = 1; } if (i == 0) { if (b[j] == 0 ) { flag = false; break; } if (j == 0) { if (sum % 2 != 0) { flag = false; break; } a[i] = (char)(sum / 2 + 0 ); } else { a[i] = 1 ; a[j] = (char)(sum - 1 + 0 ); } } else { if (i == j) { if (sum % 2 != 0) { flag = false; break; } a[i] = (char)(sum / 2) + 0 ; } else { if (sum == 19) { if (b[i] == 0 && i != j - 1) { a[i] = 0 ; a[j] = 9 ; pc = 0; cc = 1; i++; j--; continue; } else { flag = false; break; } } if (sum < 10) { a[i] = 0 ; a[j] = (char)(sum + 0 ); } else { a[i] = 9 ; a[j] = (char)(sum - 9 + 0 ); } } } if (i == j - 1) { if (b[i] - 0 != (sum + cc) % 10) { flag = false; } break; } else { pc = cc; if (b[i] - 0 == sum % 10) cc = 0; else if (b[i] - 0 == (sum + 1) % 10) cc = 1; else { flag = false; break; } i++; j--; } } if (flag) { cout << a << endl; return 0; } if (b[0] != 1 ) { cout << 0 << endl; return 0; } i = 1; j = n - 1; pc = 0; cc = 1; flag = true; while (i <= j) { int sum = b[j] + (10 * cc) - pc - 0 ; if (sum == -1) { if (cc == 0 && b[i] != 9 ) { flag = false; break; } else if (cc == 1 && b[i] != 0 ) { flag = false; break; } sum = 9; cc = 1; } if (i == 1) { if (j == 0) { if (sum % 2 != 0) { flag = false; break; } a[i] = (char)(sum / 2 + 0 ); } else { a[i] = 9 ; a[j] = (char)(sum - 9 + 0 ); } } else { if (i == j) { if (sum % 2 != 0) { flag = false; break; } a[i] = (char)(sum / 2) + 0 ; } else { if (sum == 19 && i != j - 1) { if (b[i] == 0 ) { a[i] = 0 ; a[j] = 9 ; pc = 0; cc = 1; i++; j--; continue; } else { flag = false; break; } } if (sum < 10) { a[i] = 0 ; a[j] = (char)(sum + 0 ); } else { a[i] = 9 ; a[j] = (char)(sum - 9 + 0 ); } } } if (i == j - 1) { if (b[i] - 0 != (sum + cc) % 10) { flag = false; } break; } else { pc = cc; if (b[i] - 0 == sum % 10) cc = 0; else if (b[i] - 0 == (sum + 1) % 10) cc = 1; else { flag = false; break; } i++; j--; } } if (flag) { cout << a.substr(1) << endl; } else { cout << 0 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int seed = 131; const int maxn = 2e5 + 5; const int mod = 1e9 + 7; int n, k; char a[maxn]; int main() { scanf( %d%d , &n, &k); scanf( %s , a + 1); int cnt1 = 0; int cnt2 = 0; k /= 2; for (int i = 1; i <= n; i++) { if (cnt1 == k) break; if (a[i] == ( ) { cnt1++; } else cnt2++; printf( %c , a[i]); } for (int i = cnt2; i < k; i++) printf( ) ); return 0; } |
#include <bits/stdc++.h> using namespace std; int byk[3][3]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n; cin >> n; string s; cin >> s; for (int i = 0; i < n; i++) { if (s[i] == B ) byk[i % 3][0]++; if (s[i] == G ) byk[i % 3][1]++; if (s[i] == R ) byk[i % 3][2]++; } int mini = 10000000; vector<int> jwb; vector<int> V; V.push_back(0); V.push_back(1); V.push_back(2); do { int x = byk[0][0] + byk[0][1] + byk[0][2]; x -= byk[0][V[0]]; int y = byk[1][0] + byk[1][1] + byk[1][2]; y -= byk[1][V[1]]; int z = byk[2][0] + byk[2][1] + byk[2][2]; z -= byk[2][V[2]]; if (x + y + z < mini) { mini = x + y + z; jwb.clear(); jwb.push_back(V[0]); jwb.push_back(V[1]); jwb.push_back(V[2]); } } while (next_permutation(V.begin(), V.end())); cout << mini << endl; for (int i = 0; i < n; i++) { if (i % 3 == 0) { if (jwb[0] == 0) cout << B ; if (jwb[0] == 1) cout << G ; if (jwb[0] == 2) cout << R ; } if (i % 3 == 1) { if (jwb[1] == 0) cout << B ; if (jwb[1] == 1) cout << G ; if (jwb[1] == 2) cout << R ; } if (i % 3 == 2) { if (jwb[2] == 0) cout << B ; if (jwb[2] == 1) cout << G ; if (jwb[2] == 2) cout << R ; } } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 501; const long long DIM = 3e5 + 1; int in, n, t, a[DIM]; int main() { ios_base::sync_with_stdio; cin.tie(0); cout.tie(0); in = scanf( %d , &t); while (t--) { in = scanf( %d , &n); set<int> s; for (int i = 1; i <= n; i++) { in = scanf( %d , &a[i]); s.insert(a[i]); } if (s.size() == 1) printf( -1 n ); else { auto it = s.end(); it--; for (int i = 1; i <= n; i++) { if (a[i] == *it && ((i > 1 && a[i - 1] != *it) || (i < n && a[i + 1] != *it))) { printf( %d n , i); break; } } } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5, mod = 1e9 + 7; int a[N], st[N][20], pos[N][20]; int seg_query(int l, int r) { int k = log2(r - l + 1); if (st[l][k] > st[r - (1 << k) + 1][k]) return pos[l][k]; else return pos[r - (1 << k) + 1][k]; } long long f[N]; signed main() { int n; scanf( %d , &n); for (int i = 1; i <= n - 1; ++i) scanf( %d , a + i), st[i][0] = a[i], pos[i][0] = i; a[n] = n, st[n][0] = pos[n][0] = n; for (int j = 1; j <= 17; ++j) for (int i = 1; i + (1 << j) - 1 <= n; ++i) if (st[i][j - 1] > st[i + (1 << (j - 1))][j - 1]) st[i][j] = st[i][j - 1], pos[i][j] = pos[i][j - 1]; else st[i][j] = st[i + (1 << (j - 1))][j - 1], pos[i][j] = pos[i + (1 << (j - 1))][j - 1]; long long ans = 0; for (int i = n - 1; i >= 1; --i) { int k = seg_query(i + 1, a[i]); f[i] = f[k] + n - i - (a[i] - k); ans += f[i]; } cout << ans; } |
#include <bits/stdc++.h> using namespace std; typedef struct graph { list<int> edges[1001]; } graph; void dfs(graph *g, int i, int group[], int gn) { for (list<int>::iterator it = g->edges[i].begin(); it != g->edges[i].end(); it++) { if (group[*it] == -1) { group[*it] = gn; dfs(g, *it, group, gn); } } } void printArray(int arr[], int n) { for (int i = 1; i <= n; i++) cout << arr[i] << ; cout << endl; } int main() { int n; graph *g = new graph; cin >> n; bool flag = false; int fin[1001], pref[1001], group[1001]; for (int i = 1; i <= n; i++) cin >> fin[i]; for (int i = 1; i <= n; i++) { cin >> pref[i]; if (i + pref[i] <= n) { g->edges[i].push_back(i + pref[i]); g->edges[i + pref[i]].push_back(i); } if (i - pref[i] >= 1) { g->edges[i].push_back(i - pref[i]); g->edges[i - pref[i]].push_back(i); } } fill_n(group, n + 1, -1); int gn = 0; for (int i = 1; i <= n; i++) { if (group[i] == -1) { group[i] = gn; dfs(g, i, group, gn); gn++; } } for (int i = 1; i <= n; i++) { if (group[i] == group[fin[i]]) { } else { flag = true; cout << NO << endl; break; } } if (!flag) { cout << YES << endl; } } |
#include <bits/stdc++.h> using namespace std; map<vector<int>, int> m; int main() { int i, n, k; cin >> n; int array[n][2]; int ans = n; for (i = 0; i < n; i++) { cin >> array[i][0] >> array[i][1]; } cin >> k; for (i = 0; i < n; i++) { if (array[i][1] >= k) { break; } ans--; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 20; const int inf = 1e9; int dp[N][2]; vector<int> a; void upd(int& at, int val) { at = max(at, val); } int main() { long long n; scanf( %lld , &n); while (n) { a.push_back(n % 10); n /= 10; } for (int i = 0; i < N; i++) { dp[i][0] = dp[i][1] = -inf; } dp[0][0] = 0; for (int i = 0; i < a.size(); i++) { for (int add = 0; add <= 10; add += 10) { for (int st = 0; st <= 1; st++) { int sum = add + a[i] - st; for (int j = 0; j <= min(9, sum); j++) { int k = sum - j; if (0 <= k && k <= 9) { upd(dp[i + 1][add / 10], dp[i][st] + j + k); } } } } } cout << dp[a.size()][0] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 400004; const long long Mod = 1000000007; int Stop, Bcnt, Dindex, Ecnt; int Low[N], Dfn[N], Step[N], Belong[N]; bool instack[N]; struct Edge { int t; int next; } edge[N]; int head[N]; void addEdge(int s, int t) { edge[Ecnt].t = t; edge[Ecnt].next = head[s]; head[s] = Ecnt++; } void tarjan(int i) { int j; Dfn[i] = Low[i] = ++Dindex; instack[i] = true; Step[++Stop] = i; for (int e = head[i]; e != -1; e = edge[e].next) { j = edge[e].t; if (!Dfn[j]) { tarjan(j); if (Low[j] < Low[i]) Low[i] = Low[j]; } else if (instack[j] && Dfn[j] < Low[i]) Low[i] = Dfn[j]; } if (Dfn[i] == Low[i]) { Bcnt++; do { j = Step[Stop--]; instack[j] = false; Belong[j] = Bcnt; } while (j != i); } } void init() { Ecnt = 0; memset(head, -1, sizeof(head)); } void solve(int n) { int i; Stop = Bcnt = Dindex = 0; memset(Dfn, 0, sizeof(Dfn)); memset(Low, -1, sizeof(Low)); memset(instack, 0, sizeof(instack)); for (i = 1; i <= n; i++) { if (!Dfn[i]) { tarjan(i); } } } long long num[N]; long long Pow(int x, int y) { long long a = (long long)x; long long b = y; long long ans = 1; if (b == 0) return 1ll; while (b > 0) { if (b & 1) { ans = (ans * (long long)a) % Mod; } a *= a; a %= Mod; b >>= 1; } return ans; } int main() { int n, x; while (~scanf( %d , &n)) { init(); for (int i = 1; i <= n; i++) { scanf( %d , &x); addEdge(i, x); } solve(n); memset(num, 0, sizeof(num)); for (int i = 1; i <= n; i++) { num[Belong[i]]++; } long long ans = 1; for (int i = 1; i <= n; i++) { if (num[i]) { if (num[i] == 1) { ans = (ans * 2) % Mod; } else { long long tm = ((Pow(2, num[i]) - 2) % Mod + Mod) % Mod; ans = ans * tm % Mod; } } } printf( %I64d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const long long maxn = 3 * 1e5 + 1; void swap(long long *xp, long long *yp) { long long temp = *xp; *xp = *yp; *yp = temp; } void print(vector<long long> v) { long long i, j, n = v.size(); for (i = 0; i < n; i++) { cout << v[i] << ; } cout << n ; } void scan(vector<long long> &v, long long n) { for (long long i = 0; i < n; i++) cin >> v[i]; } long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); } long long power(long long x, long long y) { long long res = 1; while (y > 0) { if (y & 1) res = (res * x) % mod; y = y / 2; x = (x * x) % mod; } return res % mod; } long long modinv(long long x) { return power(x, mod - 2) % mod; } vector<bool> prime(maxn, true); void sieve() { long long n = maxn; prime[0] = false; prime[1] = false; for (long long p = 2; p * p <= n; p++) { if (prime[p] == true) { for (long long i = p * p; i <= n; i += p) prime[i] = false; } } } int main() { long long int i, j, inc, dec, t, r; long long int c, d, e, temp, m, p, w, k, x, y, sum, pre, temp2, mid, n, low, high, ans; t = 1; n = 1; while (t--) { cin >> n; sum = 0; vector<long long> a; vector<long long> tem(maxn, 0); a.push_back(0); while (n--) { long long type; cin >> type; if (type == 1) { cin >> x >> y; sum += (x * y); tem[x] += y; } else if (type == 2) { cin >> k; a.push_back(k); sum += k; } else { y = a.size(); sum -= (a.back() + tem[y]); tem[y - 1] += tem[y]; tem[y] = 0; a.pop_back(); } x = a.size(); double an = (sum * 1.0) / (x * 1.0); cout << fixed << setprecision(10) << an << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, k, arr[1005][1005]; void ch_col(int x, int y) { for (int i = 1; i <= n; i++) swap(arr[i][x], arr[i][y]); } void ch_row(int x, int y) { for (int i = 1; i <= m; i++) swap(arr[x][i], arr[y][i]); } int row[1005], col[1005]; int main() { for (int i = 1; i <= 1005; i++) { row[i] = i; col[i] = i; } scanf( %d %d %d , &n, &m, &k); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) scanf( %d , &arr[i][j]); while (k--) { char order; int x, y; scanf( %c %d %d , &order, &x, &y); if (order == g ) printf( %d n , arr[row[x]][col[y]]); if (order == c ) swap(col[x], col[y]); if (order == r ) swap(row[x], row[y]); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, l, t, a[3000010], gx; double Ans; signed main() { scanf( %lld%lld%lld , &n, &l, &t); t *= 2; gx = t / l, t %= l; for (long long i = 1; i <= n; i++) scanf( %lld , &a[i + n]); for (long long i = 1; i <= n; i++) a[i] = a[i + n] - l; for (long long i = 1; i <= n; i++) a[i + n + n] = a[i + n] + l; for (long long i = 1, j1 = 1, j2 = i + 1; i <= n; i++) { while (a[i + n] - a[j1] > t) j1++; while (a[j2 + 1] - a[i + n] <= t && j2 + 1 <= 3 * n) j2++; Ans += 0.25 * ((n - 1) * gx + i + n - j1 + (n - 1) * gx + j2 - i - n); } printf( %.6lf n , Ans / 2); } |
#include <bits/stdc++.h> using namespace std; const int N = 1000001; const long long mod = 1000000009; long long f[N]; long long getall(int m) { long long res = 2; for (int i = 1; i < m; ++i) res = (res * 2) % mod; return res - 1; } long long solve(int n, int m) { long long all = getall(m); f[1] = getall(m); for (int i = 2; i <= n; ++i) f[i] = ((f[i - 1] * (all - (i - 1))) % mod); return f[n]; } int main() { int n, m; cin >> n >> m; cout << solve(n, m) << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, res = 0, m = 0, mx = 0; cin >> n; vector<int> v(n); for (int i = 0; i < n; i++) cin >> v[i]; for (int i = 0; i < n; i++) { int x = v[i], c = 1; for (int j = i + 1; j < n; j++) { if (x >= v[j]) { c++; x = min(v[j], x); } else break; } x = v[i]; for (int j = i - 1; j >= 0; j--) { if (x >= v[j]) { c++; x = min(v[j], x); } else break; } res = max(res, c); } cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:102400000,102400000 ) const long long INF = 1e18 + 1LL; const double Pi = acos(-1.0); const int N = 3e3 + 10, M = 1e3 + 20, mod = 2017, inf = 2e9; int b[N][N], m, n, a[N][N]; vector<int> ans1, ans2, ans3, ans4; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) scanf( %d , &a[i][j]), b[i][j] = a[i][j]; } int fi = 0; for (int i = 1; i <= n; ++i) { int sum = inf; for (int j = 1; j <= m; ++j) { sum = min(sum, a[i][j]); } if (sum) { for (int j = 1; j <= sum; ++j) ans1.push_back(i); for (int j = 1; j <= m; ++j) a[i][j] -= sum; } } for (int i = 1; i <= m; ++i) { int sum = inf; for (int j = 1; j <= n; ++j) { sum = min(sum, a[j][i]); } if (sum) { for (int j = 1; j <= sum; ++j) ans2.push_back(i); for (int j = 1; j <= n; ++j) a[j][i] -= sum; } } fi = ans1.size() + ans2.size(); for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { if (a[i][j]) { puts( -1 ); return 0; } } } for (int i = 1; i <= m; ++i) { int sum = inf; for (int j = 1; j <= n; ++j) { sum = min(sum, b[j][i]); } if (sum) { for (int j = 1; j <= sum; ++j) ans4.push_back(i); for (int j = 1; j <= n; ++j) b[j][i] -= sum; } } for (int i = 1; i <= n; ++i) { int sum = inf; for (int j = 1; j <= m; ++j) { sum = min(sum, b[i][j]); } if (sum) { for (int j = 1; j <= sum; ++j) ans3.push_back(i); for (int j = 1; j <= m; ++j) b[i][j] -= sum; } } int se = ans3.size() + ans4.size(); if (fi <= se) { cout << ans1.size() + ans2.size() << endl; for (int i = 0; i < ans1.size(); ++i) { cout << row << << ans1[i] << endl; } for (int i = 0; i < ans2.size(); ++i) { cout << col << << ans2[i] << endl; } } else { cout << ans3.size() + ans4.size() << endl; for (int i = 0; i < ans3.size(); ++i) { cout << row << << ans3[i] << endl; } for (int i = 0; i < ans4.size(); ++i) { cout << col << << ans4[i] << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int SIZE = 1e5 + 10; int a[SIZE]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int T, n; cin >> T; while (T--) { cin >> n; vector<int> ans; for (int i = 1; i <= n; i++) { cin >> a[i]; if (a[i] % 2 == 0) ans.push_back(i); } if (ans.size()) { cout << 1 << endl << ans[0] << endl; continue; } if (n == 1) { cout << -1 << endl; continue; } cout << 2 << endl; cout << 1 << << 2 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct Point { long long x, y; Point(long long x_, long long y_) { x = x_; y = y_; } Point() {} Point operator-(const Point &other) const { return Point(x - other.x, y - other.y); } long long dist(const Point &other) const { long long dx = x - other.x; long long dy = y - other.y; return dx * dx + dy * dy; } friend long long operator*(const Point &a, const Point &b) { return a.x * b.y - a.y * b.x; } }; long long up(const Point &a) { return a.y > 0 || (a.y == 0 && a.x >= 0); } long long solve(long long n, vector<Point> poly, Point to) { auto cmp = [&](const Point &a, const Point &b) { Point f = a - to; Point s = b - to; if (up(f) == up(s)) { return f * s > 0; } else { return up(f) < up(s); } }; sort(poly.begin(), poly.end(), cmp); long long ans = (n * (n - 1) * (n - 2)) / 6; for (long long i = 0; i < n; i++) { long long rs = 0; { long long l = 1; long long r = n; while (r - l > 1) { long long m = (r + l) >> 1; if ((poly[(i + m) % n] - poly[i]) * (to - poly[i]) >= 0) { l = m; } else { r = m; } } rs = l; } long long len = rs; ans -= (len) * (len - 1) / 2; } assert(ans >= 0); return ans; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); long long n; cin >> n; vector<Point> poly(n); for (auto &t : poly) { cin >> t.x >> t.y; } long long ans = 0; for (long long i = 0; i < n; i++) { auto np = poly; np.erase(np.begin() + i); ans += solve(n - 1, np, poly[i]); } cout << ans * (n - 4) / 2 << endl; } |
#include <bits/stdc++.h> using namespace std; int n, a[201], dp[201][201][1001]; const long long int MOD = 1e9 + 7; int solve(int i, int g, int k) { if (g < 0 || k < 0) return 0; if (i == n) return (g == 0); if (dp[i][g][k] != -1) return dp[i][g][k]; long long int ret = 0; int nk = k - g * (a[i] - a[i - 1]); if (nk >= 0) { ret = (ret + 1LL * g * solve(i + 1, g - 1, nk)) % MOD; ret = (ret + 1LL * (g + 1) * solve(i + 1, g, nk)) % MOD; ret = (ret + 1LL * solve(i + 1, g + 1, nk)) % MOD; } return dp[i][g][k] = ret; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int k; cin >> n >> k; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); memset(dp, -1, sizeof dp); cout << solve(0, 0, k); } |
#include<stdio.h> #include<iostream> #include<string.h> #include<vector> #include<queue> #include<map> #include<math.h> #include<algorithm> #include<stdlib.h> #include<string> #include<stack> #include<set> using namespace std; #define pb push_back #define POP pop_back() #define DEBUG cout << DEBUG n ; #define ll long long #define db double #define endl n #define fo(i,a,b) for(int i = a;i <= b;i++) #define lowbit(x) (x&-x); const int maxn = 5e5+5; const int inf = 0x3f3f3f3f; const ll inF = 0x3f3f3f3f3f3f3f3f; const ll mod = 1e8; const db eps = 1e-8; struct node{ int v , id; bool operator < (const node &b)const{ return v < b.v; } }; node cnt[maxn]; int a[maxn]; int main(){ int t , n;cin >> t; while(t--){ cin >> n; for(int i = 1;i <= n;i++)cnt[i].v = cnt[i].id = 0; for(int i = 1;i <= n;i++)scanf( %d ,&a[i]) , cnt[a[i]].v++ , cnt[a[i]].id = i; int ans = -1; for(int i = 1;i <= n;i++){ if(cnt[i].v == 1){ans = cnt[i].id;break;} } if(ans == -1){ cout << -1 n ; } else cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; char s[120][120]; int n, m; int main() { int i, j, k, res = 30, now = 0; string ss = ; scanf( %d%d , &n, &m); for (i = 0; i < n; i++) scanf( %s , s[i]); for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { char c = s[i][j]; int f = 0; for (k = 0; k < n; k++) { if (i == k) continue; if (s[k][j] == c) f = 1; } for (k = 0; k < m; k++) { if (j == k) continue; if (s[i][k] == c) f = 1; } if (!f) ss += c; } } cout << ss << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; bool within(int x1, int x2, int y1, int y2, int px, int py) { if (x1 <= px and px <= x2 and y1 <= py and py <= y2) { return true; } return false; } int main() { ios::sync_with_stdio(false); int y, x, v, n; cin >> y >> x >> v >> n; int py[v], px[v]; for (int i = 0; i < v; i++) { cin >> px[i] >> py[i]; py[i]--, px[i]--; } int res = 0; for (int x1 = 0; x1 < x; x1++) { for (int x2 = x1; x2 < x; x2++) { for (int y1 = 0; y1 < y; y1++) { for (int y2 = y1; y2 < y; y2++) { int found = 0; for (int i = 0; i < v; i++) { if (within(x1, x2, y1, y2, py[i], px[i])) { found++; } } if (found >= n) { res++; } } } } } cout << res; return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.