malteklaes/cpp-code-code_search_net-style · Datasets at Hugging Face

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> using namespace std; const int N = 1010; const int MAXK = 1000010; int n, m, k, p, a[N][N], row[N], col[N]; long long ans1[MAXK], ans2[MAXK]; multiset<long long> Unis; void solve(long long ans, int n, int a, int dta) { Unis.clear(); for (int i = 1; i <= n; ++i) { Unis.insert(-a[i]); } long long now = 0; for (int kk = 1; kk <= k; ++kk) { long long val = Unis.begin(); now += val; Unis.erase(Unis.begin()); Unis.insert(val + dta); ans[kk] = -now; } } int main() { scanf( %d %d %d %d , &n, &m, &k, &p); for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) { scanf( %d , &a[i][j]); row[i] += a[i][j]; col[j] += a[i][j]; } solve(ans1, n, row, p m); solve(ans2, m, col, p * n); long long zans = -1e18; for (int i = 0; i <= k; ++i) { zans = max(zans, ans1[i] + ans2[k - i] - (long long)i * (k - i) * p); } cout << zans << endl; }
#include <bits/stdc++.h> using namespace std; int c, hi, hb, wi, wb; inline long long f(int x) { long long k1 = x; long long k2 = 1ll * (0ll + c - 1ll * x * wi) / wb; return k1 * hi + k2 * hb; } int main() { cin >> c >> hi >> hb >> wi >> wb; int kek1 = c / wi; int l = 0; int r = kek1; long long ans = 0; ans = max(ans, f(0)); ans = max(ans, f(kek1)); for (int i = 0; i <= 10000000; ++i) if (i <= kek1) ans = max(ans, f(i)); while (r - l > 1) { int m = (r - l + 1) / 3; int k1 = l + m; int k2 = r - m; if (f(k1) > f(k2)) r = k2; else l = k1; } for (int i = l - 9000000; i <= r + 9000000; ++i) if (i >= 0 && i <= kek1) ans = max(ans, f(i)); swap(wi, wb); swap(hi, hb); kek1 = c / wi; l = 0; r = kek1; for (int i = 0; i <= 10000000; ++i) if (i <= kek1) ans = max(ans, f(i)); while (r - l > 1) { int m = (r - l + 1) / 3; int k1 = l + m; int k2 = r - m; if (f(k1) > f(k2)) r = k2; else l = k1; } for (int i = l - 9000000; i <= r + 9000000; ++i) if (i >= 0 && i <= kek1) ans = max(ans, f(i)); ans = max(ans, f(0)); ans = max(ans, f(kek1)); cout << ans; }
#include <bits/stdc++.h> using namespace std; int n, m, a[101000], tmp; struct C { int b, p; } c[101000]; long long ans = 0, tot; bool cmp(C c1, C c2) { return c1.b < c2.b; } priority_queue<int, vector<int>, greater<int> > q; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= m; i++) scanf( %d , &c[i].b); for (int i = 1; i <= m; i++) scanf( %d , &c[i].p); sort(c + 1, c + m + 1, cmp); int p, pos = 0; for (int now = n; now > 0; now = p - 1) { p = now; tot = a[p]; for (; a[p - 1] <= a[now] && p > 1;) tot += a[--p]; for (; pos < m && c[pos + 1].b <= a[now];) q.push(c[++pos].p); for (; !q.empty();) { if (tot >= q.top()) { ans++; tot -= q.top(); q.pop(); } else { tmp = q.top() - tot; q.pop(); q.push(tmp); tot = 0; break; } } } cout << ans; }
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; int t, n, a[N]; int main() { ios::sync_with_stdio(false); for (cin >> t; t; t--) { cin >> n; long long l = 0, r = 0; for (int i = 1; i <= n; i++) { cin >> a[i]; l += a[i]; r ^= a[i]; } cout << 2 << n << r << << (l + r) << n ; } return 0; }
#include bits/stdc++.h using namespace std; #define ll long long int #define pb push_back #define ppb pop_back #define pf push_front #define ppf pop_front #define all(x) (x).begin(),(x).end() #define uniq(v) (v).erase(unique(all(v)),(v).end()) #define sz(x) (int)((x).size()) #define fr first #define sc second #define pii pair<int,int> #define rep(i,a,b) for(int i=a;i<b;i++) #define mem1(a) memset(a,-1,sizeof(a)) #define mem0(a) memset(a,0,sizeof(a)) #define ppc __builtin_popcount #define ppcll __builtin_popcountll template<typename T,typename T1>T max_self(T &a,T1 b){if(b>a)a=b;return a;} template<typename T,typename T1>T min_self(T &a,T1 b){if(b<a)a=b;return a;} const long long int INF=1e9; const int N=0; const int modn=1e9+7; void solve(){ int n,m;cin>>n>>m; string s,t; cin>>s>>t; int left[m],right[m]; int i=0,j=0; while(j<m) {while(s[i]!=t[j]) i++; left[j]=i; j++,i++; } i=n-1; j=m-1; while(~j) { while(s[i]!=t[j]) i--; right[j]=i; i--,j--; } int ans=0; //rep(i,0,m) //cout<<left[i]<< ; rep(i,1,m) max_self(ans,right[i]-left[i-1]); cout<<ans<< n ; } int main(){ ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0); int t=1; //cin>>t; while(t--) solve(); return 0; }
#include <bits/stdc++.h> using namespace std; long long gcd(long long x, long long y) { if (y == 0) return x; return gcd(y, x % y); } long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } void XsliferX() { ios::sync_with_stdio(0); ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0); } long long f_p(long long x, int y) { if (y == 0) return 1; else if (y % 2 == 0) return f_p(x * x, y / 2); else return x * f_p(x * x, y / 2); } long long l_p(long long n) { n = n \| (n >> 1); n = n \| (n >> 2); n = n \| (n >> 4); n = n \| (n >> 8); return (n + 1) >> 1; } int dp[5005]; int a[5005]; int n; int L[5005], R[5005]; bool vis[5005]; int solve(int idx) { int x = 0; int lft = L[a[idx]], rit = R[a[idx]]; if (idx == n) return 0; if (dp[idx] != -1) return dp[idx]; for (int i = L[a[idx]]; i <= R[a[idx]]; i++) { if (lft > L[a[i]]) lft = L[a[i]]; if (rit < R[a[i]]) rit = R[a[i]]; } bool v[5005] = {0}; if (idx == lft) { int xo = 0; for (int i = lft; i <= rit; i++) { if (!v[a[i]]) { xo ^= a[i]; v[a[i]] = 1; } vis[a[i]] = 1; } x = max(x, solve(rit + 1) + xo); for (int i = lft; i < rit; i++) { vis[a[i]] = 0; } } vis[a[idx]] = 1; x = max(x, solve(idx + 1)); vis[a[idx]] = 0; return dp[idx] = x; } int main() { memset(dp, -1, sizeof dp); cin >> n; for (int i = 0; i < n; i++) cin >> a[i], R[a[i]] = i; memset(L, -1, sizeof L); for (int i = 0; i < n; i++) if (L[a[i]] == -1) L[a[i]] = i; cout << solve(0) << n ; return 0; }
#include <bits/stdc++.h> template <class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template <class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } constexpr long long MAX = 5100000; constexpr long long INF = 1LL << 60; constexpr int inf = 1000000007; constexpr long long mod = 998244353LL; const long double PI = acos((long double)(-1)); using namespace std; struct mint { long long x; mint(long long x = 0) : x((x % mod + mod) % mod) {} mint& operator+=(const mint a) { if ((x += a.x) >= mod) x -= mod; return this; } mint& operator-=(const mint a) { if ((x += mod - a.x) >= mod) x -= mod; return this; } mint& operator=(const mint a) { (x = a.x) %= mod; return this; } mint operator+(const mint a) const { mint res(this); return res += a; } mint operator-(const mint a) const { mint res(this); return res -= a; } mint operator(const mint a) const { mint res(this); return res = a; } mint pow(long long t) const { if (!t) return 1; mint a = pow(t >> 1); a = a; if (t & 1) a = this; return a; } mint inv() const { return pow(mod - 2); } mint& operator/=(const mint a) { return (this) = a.inv(); } mint operator/(const mint a) const { mint res(this); return res /= a; } }; mint dp[2][4001]; void init(int x) { for (int i = 0; i <= 4000; i++) dp[x][i] = 0; } long long fac[MAX], finv[MAX], inv[MAX]; void COMinit() { fac[0] = fac[1] = 1; finv[0] = finv[1] = 1; inv[1] = 1; for (int i = 2; i < MAX; i++) { fac[i] = fac[i - 1] * i % mod; inv[i] = mod - inv[mod % i] * (mod / i) % mod; finv[i] = finv[i - 1] * inv[i] % mod; } } mint COM(int n, int k) { if (n < k) return 0; if (n < 0 \|\| k < 0) return 0; return mint(fac[n] * (finv[k] * finv[n - k] % mod) % mod); } int main() { COMinit(); long long n, k; scanf( %lld %lld , &n, &k); vector<long long> h(n); for (int i = 0; i < n; i++) scanf( %lld , &h[i]); int cnt = 0; for (int i = 0; i < n; i++) { if (h[i] != h[(i + 1) % n]) { cnt++; } } mint res = 0; vector<mint> k2(n + 1); k2[0] = 1; for (int i = 1; i <= n; i++) k2[i] = k2[i - 1] * (k - 2); vector<mint> tw(n + 1); tw[0] = 1; for (int i = 1; i <= n; i++) tw[i] = tw[i - 1] * 2; mint tinv = mint(2).inv(); for (int i = 0; i < cnt; i++) { int r = cnt - i; if (r & 1) res += COM(cnt, i) * k2[i] * tw[r - 1]; else res += COM(cnt, i) * k2[i] * (tw[r] - COM(r, r / 2)) * tinv; } res *= mint(k).pow(n - cnt); cout << res.x << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const long long inf = 1000ll * 1000ll * 1000ll; const long long inf64 = inf * inf; const double pi = acos(-1.0); long long Abs(long long a) { return (a >= 0 ? a : -a); } template <typename T> inline T Sqr(T a) { return a * a; } vector<int> par, sz; bool solve() { ios_base::sync_with_stdio(0); ifstream fin( run.in ); ofstream fout( run.out ); int n, a, b; cin >> n; vector<int> d(n - 1); for (int i(0); i < n - 1; i++) cin >> d[i]; cin >> a >> b; a--, b--; long long ans = 0; for (int i(a); i < b; i++) ans += d[i]; cout << ans << n ; return true; } int main() { solve(); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 10; const int inf = 1e9; int arr[N], pos[N], rMax[N]; int main() { int n, m; scanf( %d %d , &n, &m); for (int i = 0; i < n; i++) { scanf( %d , arr + i); pos[arr[i]] = i; } fill(rMax, rMax + N, n - 1); while (m--) { int a, b; scanf( %d %d , &a, &b); if (pos[a] < pos[b]) { rMax[a] = min(pos[b] - 1, rMax[a]); } else { rMax[b] = min(pos[a] - 1, rMax[b]); } } long long ans = 1; for (int i = n - 2; i >= 0; i--) { int k = arr[i]; int j = arr[i + 1]; rMax[k] = min(rMax[k], rMax[j]); ans += rMax[k] - i + 1; } cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; void change_stream(char* in, char* out) { ifstream fin; fin.open(in); ofstream fout; fout.open(out); if (fin && fout) { freopen(in, r , stdin); freopen(out, w , stdout); } } long long a[500], renum[500]; void shift(long long i) { long long p = a[i]; a[i] = a[i + 2]; a[i + 2] = a[i + 1]; a[i + 1] = p; renum[a[i]] = i; renum[a[i + 1]] = i + 1; renum[a[i + 2]] = i + 2; } void solve() { long long n; cin >> n; pair<long long, long long> s[n]; for (long long i = 0; i < n; i++) { cin >> a[i]; s[i] = {a[i], i}; } sort(s, s + n); for (long long i = 0; i < n; i++) { renum[i] = s[i].second; a[renum[i]] = i; } long long sdv = 0; for (long long i = 0; i < n; i++) for (long long j = i + 1; j < n; j++) if (a[i] > a[j]) sdv++; if (sdv % 2) { bool flag = false; for (long long i = 0; i < n - 1; i++) if (s[i].first == s[i + 1].first) { swap(a[s[i].second], a[s[i + 1].second]); renum[a[s[i].second]] = s[i].second; renum[a[s[i + 1].second]] = s[i + 1].second; flag = true; break; } if (!flag) { cout << -1 n ; return; } } vector<long long> ans; for (long long i = n - 1; i > 1; i--) { while (renum[i] < i) { long long l = max(0ll, renum[i] - 1); ans.push_back(l); shift(l); } } cout << ans.size() << n ; for (long long i : ans) cout << i + 1 << ; cout << n ; } signed main() { change_stream( in , out ); ios::sync_with_stdio(0); cin.tie(0); long long test_count = 1; cin >> test_count; while (test_count--) solve(); }
#include <bits/stdc++.h> using namespace std; long long dist(const pair<long long, long long> &a, const pair<long long, long long> &b) { return (a.first - b.first) * (a.first - b.first) + (a.second - b.second) * (a.second - b.second); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; pair<long long, long long> p1, p2; cin >> p1.first >> p1.second >> p2.first >> p2.second; vector<pair<long long, long long>> v(n); for (int i = 0; i < n; ++i) { pair<long long, long long> tmp; cin >> tmp.first >> tmp.second; v[i] = {dist(p1, tmp), dist(p2, tmp)}; } long long ans = (1LL << 62); v.push_back({0, 0}); for (int i = 0; i < v.size(); ++i) { long long r2 = 0; for (int j = 0; j < v.size(); ++j) { if (i == j \|\| v[j].first <= v[i].first) continue; else r2 = max(r2, v[j].second); } ans = min(ans, v[i].first + r2); } if (n == 1) ans = min(ans, v[0].second); cout << ans << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int a[200010]; int base; int n, tmp; int main() { cin >> n; cin >> base; a[100000]++; for (int i = 1; i <= n - 1; i++) { cin >> tmp; int offset = tmp - base; if (abs(offset) > 100000) { cout << NO << endl; return 0; } a[offset + 100000]++; } int ub = 100000, lb = 100000; int cnt = n + a[100000]; while (a[ub]) { cnt -= a[ub]; ub++; } while (a[lb]) { cnt -= a[lb]; lb--; } lb++; ub--; if (cnt != 0) { cout << NO ; return 0; } for (int i = lb + 1; i <= ub - 1; i++) { if (a[i] < 2) { cout << NO ; return 0; } a[i] -= 2; } a[lb]--; a[ub]--; for (int i = lb; i <= ub; i++) { if (a[i + 1] < a[i]) { cout << NO ; return 0; } a[i + 1] -= a[i]; } cout << YES ; }
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; inline int read() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } int n; int a[maxn]; int flag = 0; int flag1 = 0; int main() { n = read(); for (int i = 1; i <= n; i++) { a[i] = read(); if (i <= n - 1 && a[i] == 0) flag1 = 1; } if (a[n] == 0) flag = 1; if (flag) { if (flag1 == 0) { printf( YES n ); for (int i = 1; i <= n - 1; i++) { printf( %d-> , a[i]); } printf( %d n , a[n]); return 0; } int place = 0; for (int i = n - 2; i >= 1; i--) { if (a[i] == 0) { place = i; break; } } if (place == 0) { printf( NO n ); return 0; } printf( YES n ); for (int i = 1; i <= place - 1; i++) { printf( %d-> , a[i]); } printf( (%d-> , a[place]); printf( ( ); for (int i = place + 1; i <= n - 2; i++) { printf( %d-> , a[i]); } printf( %d , a[n - 1]); printf( ))-> ); printf( %d n , a[n]); } else { printf( NO n ); } return 0; }
#include <bits/stdc++.h> using namespace std; template <class T, class T2> inline int chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; } template <class T, class T2> inline int chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; } const int MAXN = (1 << 20); int n, sum = 0; vector<int> li1; vector<pair<int, int> > li; void read() { cin >> n; for (int i = 1; i <= n; i++) { int x; cin >> x; if (x == 1) li1.push_back(i); else sum += x - 2, li.push_back({x - 2, i}); } } vector<pair<int, int> > answer; void solve() { if (sum < ((int)li1.size()) - 2) { cout << NO << n ; return; } int d = ((int)li.size()) - 1; for (int i = 0; i < ((int)li.size()) - 1; i++) answer.push_back({li[i].second, li[i + 1].second}); if (((int)li1.size()) >= 1) { int x = li1.back(); li1.pop_back(); answer.push_back({x, li[0].second}); d++; } if (((int)li1.size()) >= 1) { int x = li1.back(); li1.pop_back(); answer.push_back({x, li.back().second}); d++; } for (auto &it : li) { while (it.first >= 1 && ((int)li1.size())) { int x = li1.back(); li1.pop_back(); answer.push_back({x, it.second}); it.first--; } } cout << YES << << d << n ; cout << ((int)answer.size()) << n ; for (auto e : answer) cout << e.first << << e.second << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); read(); solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long i, n, ans, ghor, j, k, flag = 0; cin >> n; for (i = 0;; i++) { ans = (n - 1) / (5 * pow(2, i)); if (ans == 0) break; n = n - (5 * pow(2, i)); } ghor = i + 1; long long p = pow(2, i); long long cnt = 1; for (j = 1; j <= 5; j++) { for (k = 1; k <= p; k++) { if (cnt == n) { flag = 1; break; } cnt++; } if (flag == 1) break; } switch (j) { case 1: cout << Sheldon << endl; break; case 2: cout << Leonard << endl; break; case 3: cout << Penny << endl; break; case 4: cout << Rajesh << endl; break; case 5: cout << Howard << endl; break; } return 0; }
#include <bits/stdc++.h> using namespace std; void solve() { int i, j, n, m; cin >> n; vector<int> vec(n); vector<int> ans; int count = 1; for (int i = 0; i < n; i++) { cin >> vec[i]; } for (int i = 0; i < n; i++) { count = 1; for (int j = 0; j < n; j++) { if (vec[i] < vec[j]) { count++; } } ans.push_back(count); } for (auto x : ans) { if (x > 1) cout << x << ; else cout << 1 << ; } cout << n ; } int32_t main() { int T = 1; while (T--) { solve(); } }
#include <bits/stdc++.h> using namespace std; const int block_size = 320; const long long mod = 1e9 + 7; const long long inf = 1e9 + 7; const long double eps = 1e-9; const double PI = atan(1) * 4; template <typename T> inline int sign(const T &a) { if (a < 0) return -1; if (a > 0) return 1; return 0; } string to_string(string s) { return + s + ; } string to_string(const char s) { return to_string((string)s); } string to_string(bool b) { return (b ? true : false ); } template <typename A, typename B> string to_string(pair<A, B> p) { return ( + to_string(p.first) + , + to_string(p.second) + ) ; } template <typename A> string to_string(A v) { bool first = true; string res = { ; for (const auto &x : v) { if (!first) { res += , ; } first = false; res += to_string(x); } res += } ; return res; } void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << << to_string(H); debug_out(T...); } template <typename T, typename S> inline bool upmin(T &a, const S &b) { return a > b ? a = b, 1 : 0; } template <typename T, typename S> inline bool upmax(T &a, const S &b) { return a < b ? a = b, 1 : 0; } template <typename T> inline void in(T &x) { x = 0; T f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = -1; ch = getchar(); } while (isdigit(ch)) { x = x 10 + ch - 0 ; ch = getchar(); } x = f; } long long twop(int x) { return 1LL << x; } template <typename T> T MOD(T a, T m) { a %= m; if (a < 0) a += m; return a; } template <typename T> T inverse(T a, T m) { a = MOD(a, m); if (a <= 1) return a; return MOD((1 - inverse(m, a) m) / a, m); } template <typename A, typename B> inline void in(A &x, B &y) { in(x); in(y); } template <typename A, typename B, typename C> inline void in(A &x, B &y, C &z) { in(x); in(y); in(z); } template <typename A, typename B, typename C, typename D> inline void in(A &x, B &y, C &z, D &d) { in(x); in(y); in(z); in(d); } template <typename T> T sqr(T x) { return x * x; } long long gcd(long long a, long long b) { while (b != 0) { a %= b; swap(a, b); } return a; } long long fast(long long a, long long b, long long mod) { long long ans = 1; while (b) { if (b & 1) { b--; ans = ans * a % mod; } else { a = a * a % mod; b /= 2; } } return ans % mod; } pair<long long, long long> operator-(const pair<long long, long long> &a, const pair<long long, long long> &b) { return make_pair(a.first - b.first, a.second - b.second); } long long cp(pair<long long, long long> o, pair<long long, long long> a, pair<long long, long long> b) { a = a - o; b = b - o; return a.first * b.second - a.second * b.first; } pair<long long, long long> process(pair<long long, long long> diff) { long long g = abs(gcd(diff.first, diff.second)); diff.first /= g; diff.second /= g; return diff; } template <int maxn, typename NUM> struct BIT { NUM s[maxn]; void init() { memset(s, 0, sizeof(s)); } BIT() { init(); } void update(int a, NUM value) { a++; while (a < maxn) { s[a] += value; a += ((a) & (-(a))); } } NUM query(int a) { NUM ans = 0; a++; while (a) { ans += s[a]; a -= ((a) & (-(a))); } return ans; } NUM query(int a, int b) { if (b < a) return 0; return query(b) - query(a - 1); } }; BIT<300010, long long> bit; namespace SOLVE { vector<vector<pair<long long, long long>>> vec; bool cmp(const pair<pair<long long, long long>, long long> &a, const pair<pair<long long, long long>, long long> &b) { return a.first.second < b.first.second; } long long ans[300010]; void main() { int n; in(n); vec.resize(n + 1); for (long long i = 1; i < n + 1; i++) { int c; in(c); vector<pair<long long, long long>> v; for (long long j = 0; j < c; j++) { pair<long long, long long> x; in(x.first, x.second); v.push_back(x); } v.push_back(v[0]); for (long long j = 1; j < c + 1; j++) { vec[i].push_back(process(v[j] - v[j - 1])); } } int q; in(q); vector<pair<pair<long long, long long>, long long>> query(q); for (long long i = 0; i < q; i++) { in(query[i].first.first, query[i].first.second); query[i].second = i; } sort(begin(query), end(query), cmp); int cur = 0; map<pair<long long, long long>, int> occ; for (auto q : query) { while (cur < q.first.second) { ++cur; for (auto v : vec[cur]) { bit.update(occ[v], -1); bit.update(cur, 1); occ[v] = cur; } } ans[q.second] = bit.query(q.first.first, q.first.second); } {}; for (long long i = 0; i < q; i++) cout << ans[i] << endl; } } // namespace SOLVE signed main() { int t = 1; while (t--) { SOLVE::main(); } return 0; }
#include <bits/stdc++.h> using namespace std; char matrix[2020][2020]; int dp[2020][2020]; pair<int, int> p[2020 * 2020]; int n, m; int fill(int i, int j) { if (i < 0 \|\| j < 0 \|\| i >= n \|\| j >= m) { return 0; } if (dp[i][j] == -1) { int start_x = i; int start_y = j; int count = 0; p[count++] = {i, j}; if (matrix[i][j] == U ) { i = i - 1; } else if (matrix[i][j] == L ) { j = j - 1; } else if (matrix[i][j] == D ) { i = i + 1; } else { j = j + 1; } while (i != start_x \|\| j != start_y) { p[count++] = {i, j}; if (matrix[i][j] == U ) { i = i - 1; } else if (matrix[i][j] == L ) { j = j - 1; } else if (matrix[i][j] == D ) { i = i + 1; } else { j = j + 1; } } for (int i = 0; i < count; i++) { dp[p[i].first][p[i].second] = (-1 * count); } return 0; } if (dp[i][j] != 0) { return dp[i][j]; } dp[i][j] = -1; int ans = 1; if (matrix[i][j] == U ) { ans += abs(fill(i - 1, j)); } else if (matrix[i][j] == L ) { ans += abs(fill(i, j - 1)); } else if (matrix[i][j] == D ) { ans += abs(fill(i + 1, j)); } else { ans += abs(fill(i, j + 1)); } if (dp[i][j] < -1) { ans = dp[i][j]; } return dp[i][j] = ans; } int main() { int t; cin >> t; while (t--) { cin >> n >> m; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> matrix[i][j]; } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { dp[i][j] = 0; } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { fill(i, j); } } int ans = dp[0][0]; int x = 0; int y = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (abs(dp[i][j]) > ans) { x = i; y = j; ans = abs(dp[i][j]); } } } cout << (x + 1) << << (y + 1) << << ans << endl; } }
#include <bits/stdc++.h> int n, m; int f[2000010], mx, mn = (int)1e7; short check(int x) { int i; for (i = x; i <= mx; i += x) if (f[i + x - 1] >= i && f[i + x - 1] - i > m) return 0; return 1; } int main() { int i, x; scanf( %d%d , &n, &m); for (i = 1; i <= n; i++) { scanf( %d , &x); f[x] = x; mx = mx > x ? mx : x; mn = mn < x ? mn : x; } mx <<= 1; for (i = 1; i <= mx; i++) f[i] = f[i] > f[i - 1] ? f[i] : f[i - 1]; mx >>= 1; for (i = mn; i > 1; i--) if (check(i)) break; printf( %d , i); return 0; }
#include <bits/stdc++.h> using namespace std; string raspuns; long long n, x, y; int read() { char c; int nr = 0; c = getchar(); while (c < 0 \|\| c > 9 ) c = getchar(); while (c >= 0 && c <= 9 ) { nr = nr * 10 + (c - 0 ); c = getchar(); } return nr; } int main() { n = read(); long long sa, sg; sa = sg = 0; for (long long i = 0; i < n; i++) { x = read(); y = read(); if (sa + x - sg <= 500) { sa += x; raspuns += A ; } else if (sg + y - sa <= 500) { sg += y; raspuns += G ; } } if (raspuns != 0 ) cout << raspuns; else cout << -1 ; return 0; }
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { for (; b; a %= b, swap(a, b)) ; return a; } int main() { ios::sync_with_stdio(0); cin.tie(0), cout.tie(0); int t; cin >> t; while (t--) { int n, x; cin >> n >> x; int cnt = 0; for (int i = 0; i < n - 1; i++) { int u, v; cin >> u >> v; if (u == x \|\| v == x) cnt++; } if (cnt <= 1) { cout << Ayush n ; continue; } if (n % 2) cout << Ashish n ; else cout << Ayush n ; } }
#include <bits/stdc++.h> using namespace std; const int maxn = 1005; int in[maxn]; int t1, t2; struct edge { int v, w; }; vector<edge> g[maxn]; void dfs(int u, int fa) { if (in[u] == 1) { if (!t1) t1 = u; t2 = u; } for (edge e : g[u]) { if (e.v == fa) continue; dfs(e.v, u); } } struct Ans { int a, b, c; }; vector<Ans> ans; void add(int a, int b, int c) { if (a == b \|\| !c) return; ans.push_back({a, b, c}); } int main() { int n; cin >> n; for (int i = 1; i < n; ++i) { int u, v, w; cin >> u >> v >> w; in[u]++, in[v]++; g[u].push_back({v, w}); g[v].push_back({u, w}); } for (int i = 1; i <= n; ++i) if (in[i] == 2) { cout << NO << endl; return 0; } cout << YES << endl; for (int u = 1; u <= n; ++u) { for (edge e : g[u]) { int v = e.v, w = e.w; if (v < u) continue; int a1, a2, b1, b2; t1 = t2 = 0; dfs(u, v); a1 = t1, a2 = t2; t1 = t2 = 0; dfs(v, u); b1 = t1, b2 = t2; add(a1, b1, w / 2); add(a2, b2, w / 2); add(a1, a2, -w / 2); add(b1, b2, -w / 2); } } cout << ans.size() << endl; for (auto p : ans) cout << p.a << << p.b << << p.c << endl; }
#include<bits/stdc++.h> #define lowbit(x) ((x)&(-(x))) #define DEBUG fprintf(stderr, Running on Line %d in Function %s n ,__LINE__,__FUNCTION__) #define SZ(x) ((int)x.size()) #define mkpr std::make_pair #define pb push_back typedef long long ll; typedef unsigned int uint; typedef unsigned long long ull; typedef std::pair<int,int> pi; typedef std::pair<ll,ll> pl; using std::min; using std::max; const int inf=0x3f3f3f3f,Inf=0x7fffffff; const ll INF=0x3f3f3f3f3f3f3f3f; std::mt19937 rnd(std::chrono::steady_clock::now().time_since_epoch().count()); template <typename _Tp>_Tp gcd(const _Tp &a,const _Tp &b){return !b?a:gcd(b,a%b);} template <typename _Tp>inline _Tp abs(const _Tp &a){return a>=0?a:-a;} template <typename _Tp>inline void chmax(_Tp &a,const _Tp &b){a=a<b?b:a;} template <typename _Tp>inline void chmin(_Tp &a,const _Tp &b){a=a<b?a:b;} template <typename _Tp>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>void read(_Tp &t,Args &...args){read(t);read(args...);} 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=0,tar-s; } const int max_len=1<<16,N=max_len+5,mod=998244353; template<typename _Tp1,typename _Tp2>inline void add(_Tp1 &a,_Tp2 b){(a+=b)>=mod&&(a-=mod);} template<typename _Tp1,typename _Tp2>inline void sub(_Tp1 &a,_Tp2 b){(a-=b)<0&&(a+=mod);} template<typename _Tp>inline _Tp _sub(_Tp a,const _Tp &b){(a+=mod-b)>=mod&&(a-=mod);return a;} ll ksm(ll a,ll b=mod-2){ll res=1;while(b){if(b&1)res=resa%mod;a=aa%mod,b>>=1;}return res;} typedef std::vector<int> poly; void print(const poly &a) { for(auto it:a) printf( %d ,it); printf( n ); } poly operator << (const poly &a,uint b) { poly o(a.size()+b); for(uint i=0;i<b;++i) o[i]=0; for(uint i=0;i<a.size();++i) o[i+b]=a[i]; return o; } inline poly operator <<= (poly &a,uint b){return a=a<<b;} inline poly operator >> (const poly &a,uint b){return b>=a.size()?poly():poly{a.begin()+b,a.end()};} inline poly operator >>= (poly &a,uint b){return a=b>=a.size()?poly():poly{a.begin()+b,a.end()};} poly operator += (poly &a,const poly &b) { if(SZ(b)>SZ(a)) a.resize(SZ(b)); for(uint i=0;i<b.size();++i) add(a[i],b[i]); return a; } inline poly operator + (const poly &a,const poly &b){poly tmp(a);tmp+=b;return tmp;} poly operator -= (poly &a,const poly &b) { if(SZ(b)>SZ(a)) a.resize(SZ(b)); for(uint i=0;i<b.size();++i) sub(a[i],b[i]); return a; } inline poly operator - (const poly &a,const poly &b){poly tmp(a);tmp-=b;return tmp;} ull Omgs[N]; int r[N]; const ull Omg=ksm(3,(mod-1)/max_len); int getlen(int len) { int limit=1;while(limit<len)limit<<=1; for(int i=0;i<limit;++i)r[i]=(r[i>>1]>>1)\|(i&1?limit>>1:0); return limit; } void setup() { Omgs[max_len>>1]=1; for(int i=(max_len>>1)+1;i<max_len;++i) Omgs[i]=Omgs[i-1]Omg%mod; for(int i=(max_len>>1)-1;i>0;--i) Omgs[i]=Omgs[i<<1]; } void dft(ull A,int limit) { for(int i=0;i<limit;++i)if(i<r[i])std::swap(A[i],A[r[i]]); for(int len=1;len<limit;len<<=1) { if(len==262144)for(int i=0;i<limit;++i)A[i]%=mod; for(int i=0;i<limit;i+=len<<1) { ull p=A+i,q=A+i+len,w=Omgs+len; for(int _=0;_<len;++_,++p,++q,++w){ull tmp=qw%mod;q=p+mod-tmp,p+=tmp;} } } for(int i=0;i<limit;++i)A[i]%=mod; } void idft(ull A,int limit) { std::reverse(A+1,A+limit),dft(A,limit); ull inv=mod-(mod-1)/limit;for(int i=0;i<limit;++i) A[i]=invA[i]%mod; } ull _f[N],_g[N]; poly operator * (const poly &a,const poly &b) { uint len=a.size()+b.size()-1; if(a.size()<=64u\|\|b.size()<=64u) { poly c(len); for(uint i=0;i<a.size();++i) for(uint j=0;j<b.size();++j) add(c[i+j],1ulla[i]b[j]%mod); return c; } int limit=getlen(len); memset(_f,0,limit<<3);for(uint i=0;i<a.size();++i)_f[i]=a[i]; memset(_g,0,limit<<3);for(uint i=0;i<b.size();++i)_g[i]=b[i]; dft(_f,limit),dft(_g,limit); for(int i=0;i<limit;++i)_f[i]=1ULL_f[i]_g[i]%mod; idft(_f,limit); poly ans(len);for(uint i=0;i<len;++i)ans[i]=_f[i]; return ans; } poly mul(const poly &a,const poly &b,uint len,bool need=true) { if(a.size()<=64u\|\|b.size()<=64u) { poly c(SZ(a)+SZ(b)-1); for(uint i=0;i<a.size();++i) for(uint j=0;j<b.size();++j) add(c[i+j],1ulla[i]b[j]%mod); return c.resize(len),c; } int limit=getlen(len); memset(_f,0,limit<<3);for(uint i=0;i<a.size();++i)_f[i]=a[i]; dft(_f,limit); if(need) { memset(_g,0,limit<<3);for(uint i=0;i<b.size();++i)_g[i]=b[i]; dft(_g,limit); } for(int i=0;i<limit;++i)_f[i]=1ULL_f[i]_g[i]%mod; idft(_f,limit); poly ans(len);for(uint i=0;i<len;++i)ans[i]=_f[i]; return ans; } inline poly operator = (poly &a,const poly &b){return a=ab;} template<typename _Tp>inline poly operator = (poly &a,const _Tp &b) { for(auto &&it:a) it=1llitb%mod; return a; } template<typename _Tp>inline poly operator (poly a,const _Tp &b){return a=b;} template<typename _Tp>inline poly operator (const _Tp &b,poly a){return a=b;} template<typename _Tp>inline poly operator /= (poly &a,const _Tp &b) { ull inv=ksm(b);for(auto &&it:a) it=1llitinv%mod; return a; } template<typename _Tp>inline poly operator / (poly a,const _Tp &b){return a/=b;} template<typename _Tp>inline poly operator / (const _Tp &b,poly a){return a/=b;} ll fac[N],ifac[N],inv[N]; poly getcoef(poly h,ll m,int c) { static int I[N],P[N]; int d=SZ(h)-1; for(int i=0;i<=d;++i)h[i]=1LLh[i]ifac[d-i]%mod((d-i)&1?mod-ifac[i]:ifac[i])%mod; for(int i=0;i<c+d;++i)I[i]=m-d+i; P[0]=I[0];for(int i=1;i<c+d;++i)P[i]=1LLI[i]P[i-1]%mod; ll tp=ksm(P[c+d-1]); for(int i=c+d-1;i>=0;--i)P[i]=1LLtp(i?P[i-1]:1)%mod,tp=tpI[i]%mod; poly a=mul(poly{P,P+c+d},h,c+d); ll cur=1;for(int i=1;i<=d;++i)cur=cur(m-i)%mod; poly ans(c); for(int k=0;k<c;++k) cur=cur(m+k)%mod,ans[k]=cura[d+k]%mod,cur=curP[k]%mod; return ans; } int f[N],S; void init(int n) { S=(int)sqrt(n); int cur=0; while(1LLSS<n)++S; while(1LLSS>n)--S; memset(f,0,(S+1)<<2),f[0]=1; for(int i=16;i>=0;--i) { if(cur) { poly h={f,f+cur+1},a=getcoef(h,cur+1,cur); h.resize(SZ(a)+SZ(h));for(int i=0;i<cur;++i)h[i+cur+1]=a[i]; poly b=getcoef(h,1LLcurksm(S)%mod,cur+cur+1); cur<<=1;for(int i=0;i<=cur;++i)f[i]=1LLh[i]b[i]%mod; } if((S>>i)&1) { f[++cur]=1; for(int j=0;j<cur;++j)f[j]=1LLf[j](jS+cur)%mod; for(int i=1;i<=cur;++i)f[cur]=1LLf[cur](curS+i)%mod; } } } ll getfac(int n) { int i,ans=1; for(i=0;(i+1)S<=n;++i)ans=1LLansf[i]%mod; for(int j=iS+1;j<=n;++j)ans=1LLansj%mod; return ans; } int a[1005],s; inline ll getF(int a){return (getfac(s+s-1)ksm(getfac(s+s-a-1))%modksm(getfac(s))%modgetfac(s-a)+mod-1)%mod;} int main() { setup(); fac[0]=fac[1]=inv[0]=inv[1]=ifac[0]=ifac[1]=1;for(int i=2;i<N;++i)fac[i]=fac[i-1]i%mod,inv[i]=inv[mod%i](mod-mod/i)%mod,ifac[i]=ifac[i-1]inv[i]%mod; int n;read(n); for(int i=1;i<=n;++i)read(a[i]),s+=a[i]; init(s+s); int ans=mod-getF(s); for(int i=1;i<=n;++i)add(ans,getF(a[i])); ans=1LL(mod-2)s%modksm(s-1)%mod*ans%mod; printf( %d n ,ans); return 0; }
#include <bits/stdc++.h> using namespace std; namespace whatever { int readu() { char ch = getchar(); while (!isdigit(ch)) ch = getchar(); int value = ch - 0 ; ch = getchar(); while (isdigit(ch)) { value = value * 10 + ch - 0 ; ch = getchar(); } return value; } void writeu(int n) { if (n < 10) putchar(n + 0 ); else { writeu(n / 10); putchar(n % 10 + 0 ); } } namespace tree { vector<int> tree_adj[100001 + 100000]; int size[100001 + 100000]; int heavy[100001 + 100000]; int depth[100001 + 100000]; int father[100001 + 100000]; void dfs1(int cur) { size[cur] = 1; for (auto to : tree_adj[cur]) if (to != father[cur]) { depth[to] = depth[cur] + 1; father[to] = cur; dfs1(to); size[cur] += size[to]; if (size[heavy[cur]] < size[to]) heavy[cur] = to; } } int top[100001 + 100000]; void dfs2(int cur) { for (auto to : tree_adj[cur]) if (to != father[cur]) { top[to] = (to == heavy[cur] ? top[cur] : to); dfs2(to); } } int lca(int a, int b) { while (top[a] != top[b]) { if (depth[top[a]] > depth[top[b]]) a = father[top[a]]; else b = father[top[b]]; } return (depth[a] < depth[b] ? a : b); } } // namespace tree namespace graph { vector<int> adj[100001]; int dfn[100001]; int low[100001]; int dfs_time; int stack[100001]; int top; int bcc_cnt; void dfs(int cur) { dfn[cur] = low[cur] = ++dfs_time; stack[top++] = cur; for (auto to : adj[cur]) { if (!dfn[to]) { dfs(to); low[cur] = min(low[cur], low[to]); if (low[to] == dfn[cur]) { ++bcc_cnt; do { --top; tree::tree_adj[stack[top]].push_back(100000 + bcc_cnt); tree::tree_adj[100000 + bcc_cnt].push_back(stack[top]); } while (stack[top] != to); tree::tree_adj[cur].push_back(100000 + bcc_cnt); tree::tree_adj[100000 + bcc_cnt].push_back(cur); } } else low[cur] = min(low[cur], dfn[to]); } } } // namespace graph void run() { int n = readu(); int m = readu(); int q = readu(); while (--m != -1) { int u = readu(); int v = readu(); graph::adj[u].push_back(v); graph::adj[v].push_back(u); } graph::dfs(1); assert(graph::top == 1); assert(graph::stack[0] == 1); tree::dfs1(1); assert(tree::size[1] == graph::bcc_cnt + n); tree::dfs2(1); while (--q != -1) { int a = readu(); int b = readu(); int l = tree::lca(a, b); int dis = tree::depth[a] - tree::depth[l] + tree::depth[b] - tree::depth[l]; assert(dis % 2 == 0); writeu(dis / 2); putchar( n ); } } } // namespace whatever int main() { whatever::run(); }
#include <bits/stdc++.h> using namespace std; const int mxN = 20; int n, m, a[mxN][mxN], c[4][2] = {{0, 0}, {0, 1}, {1, 1}, {1, 0}}; vector<vector<int>> ops, cs{{0, 2, 3, 1}, {2, 4, 5, 3}, {0, 2, 4, 5, 3, 1}}; array<int, 2> p[mxN * mxN + 1]; set<vector<int>> vis; void oc(int i1, int j1, bool b) { ops.push_back({}); for (int i = 0; i < 4; ++i) ops.back().push_back(a[i1 + c[i ^ b][0]][j1 + c[i ^ b][1]]); for (int i = 2; i >= 0; --i) swap(a[i1 + c[i ^ b][0]][j1 + c[i ^ b][1]], a[i1 + c[(i + 1) ^ b][0]][j1 + c[(i + 1) ^ b][1]]); for (int i = 0; i < 4; ++i) p[a[i1 + c[i][0]][j1 + c[i][1]]] = {i1 + c[i][0], j1 + c[i][1]}; } void cr(bool b) { for (int i = n - 1; i > 2 - b; --i) { for (int j = m - 1; j >= 0; --j) { int d = b ? (j < 2 ? j ^ 1 : j) * n + i + 1 : i * m + (j < 2 ? j ^ 1 : j) + 1, ti = j ? i : i - 1, tj = j ? j : 1; if (!j && p[d][0] == i) { oc(i - 1, 0, 0); oc(i - 2, 0, 0); oc(i - 2, 0, 0); oc(i - 1, 0, 1); oc(i - 2, 0, 0); break; } if (!p[d][0]) oc(0, p[d][1] - (p[d][1] > 0), !p[d][1]); if (!p[d][1]) oc(p[d][0] - 1, 0, 1); while (p[d][1] < tj) oc(p[d][0] - 1, p[d][1], 1); while (p[d][1] > tj) oc(p[d][0] - 1, p[d][1] - 1, 0); while (p[d][0] < ti) oc(p[d][0], p[d][1] - 1, 0); } oc(i - 1, 0, 0); } } bool dfs(vector<int> &u) { bool ok = 1; for (int i = 0; i < 5 && ok; ++i) ok = u[i] < u[i + 1]; if (ok) return 1; vis.insert(u); for (vector<int> &c : cs) { vector<int> v = u; ops.push_back({}); for (int ci : c) ops.back().push_back(u[ci]); for (int i = c.size() - 2; i >= 0; --i) swap(v[c[i]], v[c[i + 1]]); if (vis.find(v) == vis.end() && dfs(v)) return 1; ops.pop_back(); } return 0; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m; for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) cin >> a[i][j], p[a[i][j]] = {i, j}; cr(0); for (int i = 0; i < n; ++i) for (int j = i + 1; j < m; ++j) swap(a[i][j], a[j][i]); for (int i = 1; i <= n * m; ++i) swap(p[i][0], p[i][1]); swap(n, m); cr(1); vector<int> v; for (int j = 0; j < 3; ++j) for (int i = 0; i < 2; ++i) v.push_back(a[i][j]); dfs(v); cout << ops.size(); for (vector<int> op : ops) { cout << n << op.size(); for (int oi : op) cout << << oi; } }
#include <bits/stdc++.h> using namespace std; void solve(vector<int> &v, int n, int k) { set<int> s; for (int i = 0; i < n; i++) s.insert(v[i]); if (s.size() >= k) { vector<int> res; cout << YES << endl; for (auto x : s) { for (int i = 0; i < n; i++) { if (x == v[i]) { res.push_back(i + 1); break; } } } for (int i = 0; i < k; i++) { cout << res[i] << ; } cout << endl; } else cout << NO << endl; } int main() { int n, k; cin >> n >> k; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; solve(a, n, k); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 200010; int n, a[7], cnt[7], t[N]; void GetData() { int i; scanf( %d , &n); for (i = 0; i < 3; ++i) scanf( %d , &a[i]); for (i = 0; i < n; ++i) scanf( %d , &t[i]); } void Solve() { int i, j, ans, mn; bool flag = false; sort(a, a + 3); sort(t, t + n); a[3] = a[0] + a[1]; a[4] = a[0] + a[2]; a[5] = a[1] + a[2]; a[6] = a[3] + a[2]; if (t[n - 1] > a[6]) ans = -1, mn = 0; else { if (a[2] > a[3]) { swap(a[2], a[3]); flag = true; } memset(cnt, 0, sizeof(cnt)); for (i = 0; i < n; ++i) { for (j = 0; j < 7; ++j) { if (a[j] >= t[i]) { cnt[j]++; break; } } } ans = cnt[6]; for (; cnt[5] > 0; ++ans) { cnt[5]--; if (cnt[0] > 0) cnt[0]--; } for (; cnt[4] > 0; ++ans) { cnt[4]--; if (cnt[1] > 0) cnt[1]--; else if (cnt[0] > 0) cnt[0]--; } if (flag) { for (; cnt[3] > 0; ++ans) { cnt[3]--; if (cnt[0] > 0 && cnt[1] > 0) { cnt[0]--; cnt[1]--; } else if (cnt[0] > 0) { if (cnt[0] > 1) cnt[0] -= 2; else if (cnt[2] > 0) cnt[2]--; else cnt[0]--; } else if (cnt[1] > 0) { if (cnt[2] > 0) cnt[2]--; else cnt[1]--; } else if (cnt[2] > 0) cnt[2]--; } } else { for (; cnt[3] > 0; ++ans) { cnt[3]--; if (cnt[2] > 0) cnt[2]--; else if (cnt[1] > 0) cnt[1]--; else if (cnt[0] > 0) cnt[0]--; } } mn = n; for (i = 0; i <= cnt[2]; ++i) { int a, b, c, tmp = i; a = cnt[0]; b = cnt[1]; c = cnt[2]; c -= i; if (c >= i) c -= i; else if (b >= i - c) b -= i - c, c = 0; else { if (a >= i - c - b) a -= i - c - b; else a = 0; b = c = 0; } if (c > 0) { if (b < c) a = max(0, a - c - c + b); else a = max(0, a - c); b = max(0, b - c); tmp += c; } if (b >= a * 2) tmp += (b + 1) / 2; else tmp += (a + b + 2) / 3; mn = min(mn, tmp); } } printf( %d n , ans + mn); } int main() { GetData(); Solve(); return 0; }
#include <bits/stdc++.h> using namespace std; signed main() { cin.tie(0); cout.tie(0); cin.sync_with_stdio(0); cout.sync_with_stdio(0); long long n; cin >> n; vector<long long> v(n); vector<long long> msuf(n + 1); for (long long i = 0; i < n; ++i) cin >> v[i]; for (long long i = n - 1; i >= 0; --i) msuf[i] = max(v[i] + 1, msuf[i + 1] - 1); for (long long i = 1; i < n; ++i) msuf[i] = max(msuf[i], msuf[i - 1]); long long second = 0; for (long long i = 0; i < n; ++i) second += msuf[i] - v[i] - 1; cout << second << endl; return 0; }
#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; const long long MOD = 1e9 + 7; const long long MODD = 1e9 + 1; const long long MODL = 998244353; const long long N = 200005; const long long INF = 1e18; const long long mx = 1e5 + 1; long long Power(long long x, long long y) { long long r = 1; while (y) { if (y & 1) r = 1ll * r * x % MOD; x = 1ll * x * x % MOD, y >>= 1; } return r; } bool sortbysec(const pair<int, int>& a, const pair<int, int>& b) { return (a.second < b.second); } bool sortstring(const string& a, const string& b) { return a + b < b + a; } long long GCD(long long a, long long b) { if (b == 0) return a; a %= b; return GCD(b, a); } bool isZero(int i) { return i == 0; } int ce(int n, int m) { int ans = 0; if (n % m == 0) ans = n / m; else ans = n / m + 1; return ans; } int solve(int n) { int m, k; cin >> m >> k; int p = 0; int q = 0, qq = 0; int r = 0; int x = ce(n, m); int s = 0; if (n % m != 0) { for (int i = n - 1; i >= 0; i--) { if (i % x == 0 && (n - i) % (n / m) == 0 && (i / x + (n - i) / (n / m) == m)) { s = i; break; } } } s = (n - s) / (n / m); for (int i = 0; i < k; i++) { for (int j = 0; j < m - s; j++) { cout << x << ; r = j * x + p; for (int k = 0; k < x; k++) { cout << r % n + 1 << ; q = r % n; r++; } cout << n ; } qq = q; for (int j = 0; j < s; j++) { cout << n / m << ; r = q + 1; for (int k = 0; k < n / m; k++) { cout << r % n + 1 << ; q = r % n; r++; } cout << n ; } p = qq + 1; } cout << n ; return 0; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t = 1; int n = 0; cin >> t; while (t--) { cin >> n; solve(n); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int e = 0; int d; int a[15], b[15], l[10]; for (int f = 0; f < n; f++) cin >> a[f]; for (int j = 0; j < m; j++) cin >> b[j]; int rr = 0, tt = 0; for (int g = 0; g < n; g++) { if (a[g] < 0 \|\| a[g] > 9) { for (int r = g; r < n; r++) a[r] = a[r + 1]; rr++; } } for (int h = 0; h < m; h++) { if (b[h] < 0 \|\| b[h] > 9) { for (int t = h; t < m; t++) b[t] = b[t + 1]; tt++; } } if (n >= 0 && n <= 10 && m >= 0 && m <= 10) { for (int c = 0; c < n - rr; c++) { for (int d = 0; d < m - tt; d++) { if (a[c] == b[d]) { l[e] = a[c]; e++; } } } for (int k = 0; k < e; k++) cout << l[k] << ; } }
#include <bits/stdc++.h> using namespace std; int main() { int n, k, a; cin >> n >> k; list<int> lst; map<int, bool> vis; for (int i = 0; i < n; i++) { cin >> a; if (lst.size() < k) { if (vis.find(a) == vis.end()) { lst.push_front(a); vis[a] = true; } continue; } if (vis.find(a) == vis.end() \|\| vis[a] == false) { vis[a] = true; vis[lst.back()] = false; lst.pop_back(); lst.push_front(a); } } cout << lst.size() << endl; for (auto it = lst.begin(); it != lst.end(); it++) cout << (*it) << ; cout << endl; return 0; }
#include <bits/stdc++.h> using namespace std; struct node { int x, y; } A[10005], B[10005], CA[10005], CB[10005]; int tim, qim; node operator+(node a, node b) { return node{a.x + b.x, a.y + b.y}; } node operator-(node a, node b) { return node{a.x - b.x, a.y - b.y}; } int operator(node a, node b) { return a.x b.x + a.y * b.y; } int operator/(node a, node b) { return a.x * b.y - a.y * b.x; } bool operator<(node a, node b) { if (a.x == b.x) return a.y > b.y; return a.x < b.x; } void convex_hull(node p[], node c[], int n, int &tp) { sort(p + 1, p + n + 1); tp = 0; for (int i = 1; i <= n; i++) { while (tp > 1 && (c[tp] - p[i]) / (c[tp - 1] - p[i]) >= 0) tp--; c[++tp] = p[i]; } int k = tp--; for (int i = n; i >= 1; i--) { while (tp > k && (c[tp] - p[i]) / (c[tp - 1] - p[i]) >= 0) tp--; c[++tp] = p[i]; } tp--; } bool solve(node a[], node b[], int na, int nb) { random_shuffle(a + 1, a + na + 1); random_shuffle(b + 1, b + nb + 1); for (int i = 1; i <= na; i++) for (int j = i + 1, k; j <= na; j++) { node pa = a[i], pb = a[j]; double lp = -1e100, rp = 1e100, inf = 1e100; for (k = 1; k <= na; k++) { if (k == i) continue; if (k == j) continue; int ta = (a[k] - pa) * (a[k] - pb); int tb = (pa - a[k]) / (pa - pb); assert(tb != 0); if (tb == 0) { if (ta > 0) break; else continue; } double r = (double)ta / tb; if (tb < 0) rp = min(rp, r); else if (tb > 0) lp = max(lp, r); if (lp > rp) break; } if (k <= na \|\| lp > rp) continue; for (k = 1; k <= nb; k++) { int ta = (b[k] - pa) * (b[k] - pb); int tb = (pa - b[k]) / (pa - pb); if (tb == 0) { if (ta <= 0) break; else continue; } double r = (double)ta / tb; if (tb > 0) rp = min(rp, r); else if (tb < 0) lp = max(lp, r); if (lp >= rp) break; } if (k > nb && lp < rp) return 1; } return 0; } int main() { srand(time(NULL)); clock_t st, ed; double totaltime; st = clock(); int n, m, cn, cm, i; scanf( %d%d , &n, &m); for (i = 1; i <= n; i++) scanf( %d%d , &A[i].x, &A[i].y); for (i = 1; i <= m; i++) scanf( %d%d , &B[i].x, &B[i].y); if (n == 1 \|\| m == 1) return puts( YES ), 0; convex_hull(A, CA, n, cn); convex_hull(B, CB, m, cm); if (solve(CA, B, cn, m) \|\| solve(CB, A, cm, n)) puts( YES ); else puts( NO ); ed = clock(); totaltime = (double)(ed - st) / CLOCKS_PER_SEC; }
#include <bits/stdc++.h> using namespace std; int ky[8] = {-1, 1, -2, 2, -2, 2, -1, 1}; int kx[8] = {-2, -2, -1, -1, 1, 1, 2, 2}; int dy[4] = {-1, 0, 1, 0}; int dx[4] = {0, 1, 0, -1}; int ddy[8] = {-1, 0, 1, -1, 1, -1, 0, 1}; int ddx[8] = {-1, -1, -1, 0, 0, 1, 1, 1}; const double PI = acos(-1.0); int n; int c, p; int k; int num; struct Group { int c, p, idx; }; Group a[1000]; Group b[1000]; pair<int, int> t[1000]; int ret1, ret2; int cnt1, cnt2; set<int> s; vector<pair<int, int>> pos1, pos2; int ns; bool comp1(const Group &x, const Group &y) { return x.p > y.p \|\| (x.p == y.p && x.c < y.c); } bool comp2(const Group &x, const Group &y) { return x.c < y.c \|\| (x.c == y.c && x.p > y.p); } int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 0; i < n; i++) { cin >> c >> p; a[i].c = c; a[i].p = p; a[i].idx = i + 1; b[i].c = c; b[i].p = p; b[i].idx = i + 1; } sort(a, a + n, comp1); sort(b, b + n, comp2); cin >> k; for (int i = 0; i < k; i++) { cin >> num; t[i].first = num; t[i].second = i + 1; } sort(t, t + k); for (int i = 0; i < n; i++) { for (int j = 0; j < k; j++) { if (s.count(j)) continue; if (a[i].c <= t[j].first) { ret1 += a[i].p; cnt1++; pos1.push_back({a[i].idx, t[j].second}); s.insert(j); break; } } } s.clear(); for (int i = 0; i < n; i++) { for (int j = 0; j < k; j++) { if (s.count(j)) continue; if (b[i].c <= t[j].first) { ret2 += b[i].p; cnt2++; pos2.push_back({b[i].idx, t[j].second}); s.insert(j); break; } } } if (ret1 <= ret2) { cout << cnt2 << << ret2 << n ; ns = pos2.size(); for (int i = 0; i < ns; i++) cout << pos2[i].first << << pos2[i].second << n ; } else { cout << cnt1 << << ret1 << n ; ns = pos1.size(); for (int i = 0; i < ns; i++) cout << pos1[i].first << << pos1[i].second << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int di[] = {0, 0, 1, -1, 1, 1, -1, -1}; int dj[] = {1, -1, 0, 0, 1, -1, 1, -1}; inline int calcMedian(vector<int> &vec) { if (((int)vec.size()) % 2 == 1) { return vec[((int)vec.size()) / 2]; } return (vec[((int)vec.size()) / 2 - 1] + vec[((int)vec.size()) / 2]) / 2; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long init = 0, ans = 0; int n, m; cin >> n >> m; vector<int> vec(m); vector<vector<int> > adj(n); for (int i = 0; i < m; ++i) { cin >> vec[i]; --vec[i]; if (i && vec[i] != vec[i - 1]) { ans = init += abs(vec[i] - vec[i - 1]); adj[vec[i]].push_back(vec[i - 1]); adj[vec[i - 1]].push_back(vec[i]); } } for (int i = 0; i < n; ++i) if (((int)adj[i].size())) { sort(adj[i].begin(), adj[i].end()); int median = calcMedian(adj[i]); long long tmp = 0; for (int j = 0; j < ((int)adj[i].size()); ++j) { tmp -= 0LL + abs(adj[i][j] - i); tmp += 0LL + abs(adj[i][j] - median); } if (init + tmp < ans) ans = init + tmp; } cout << ans << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); ; string s; int flag = 0; cin >> s; string at = at , dot = dot ; for (int i = 1; i < s.size() - 3; i++) { if (s.substr(i, 2) == at && flag == 0) { s.replace(i, 2, @ ); flag = 1; } if (s.substr(i, 3) == dot) { s.replace(i, 3, . ); } } int j = s.size() - 3; if (s.substr(j, 2) == at && flag == 0) s.replace(j, 2, @ ); cout << s; return 0; }
#include <bits/stdc++.h> using namespace std; signed main() { long long int n, max = 0; cin >> n; map<string, long long int> m; string s; while (n--) { cin >> s; m[s]++; } for (auto it = m.begin(); it != m.end(); it++) { if (it->second > max) { max = it->second; s = it->first; } } cout << s << endl; }
#include <bits/stdc++.h> using namespace std; const int INF = 1e9; const int maxn = 2 * 1e5; char s[maxn]; int n; int l, r; int is_pal(int l, int r) { for (int i = l; i <= (r + l) / 2; i++) { if (s[i] != s[r - (i - l)]) return 0; } return 1; } int main() { cin >> (s + 1); r = strlen(s + 1); while (is_pal(1, r) && r % 2 == 0 && r) { r /= 2; } if (!is_pal(1, r)) { cout << 1 << endl; } else { r = strlen(s + 1); for (int i = 1; i <= r / 2; i++) { if (!is_pal(1, i)) { cout << 2 << endl; return 0; } } cout << Impossible << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 300010; int n; long long w[maxn], ma[maxn][2], ans; vector<int> a[maxn]; vector<long long> c[maxn]; bool visited[maxn]; void dfs(int u) { visited[u] = true; for (int i = 0; i < (int)a[u].size(); ++i) { int v = a[u][i]; if (visited[v]) continue; dfs(v); long long vC = ma[v][0] - c[u][i]; if (vC > ma[u][0]) { ma[u][1] = ma[u][0]; ma[u][0] = vC; } else { if (vC > ma[u][1]) { ma[u][1] = vC; } } } ans = max(ans, ma[u][0] + ma[u][1] + w[u]); ma[u][0] += w[u]; ma[u][1] += w[u]; } int main(int argc, const char* argv[]) { cin >> n; for (int i = 1; i <= n; ++i) { cin >> w[i]; } for (int i = 1; i < n; ++i) { int u, v, C; cin >> u >> v >> C; a[u].push_back(v); c[u].push_back(C); a[v].push_back(u); c[v].push_back(C); } dfs(1); cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long int l, r; cin >> l >> r; (l == r) ? cout << l : cout << 2; }
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 9; int a[N], b[N]; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) cin >> b[i]; int ok = 1; if (a[1] != b[1]) ok = 0; map<int, int> cnt; cnt[a[1]]++; for (int i = 2; i <= n; i++) { if (a[i] < b[i] && cnt[1] == 0) ok = 0; if (a[i] > b[i] && cnt[-1] == 0) ok = 0; cnt[a[i]] = 1; } if (ok) cout << YES n ; else cout << NO n ; } return 0; }
#include <bits/stdc++.h> using namespace std; void read_file(bool outToFile = true) {} int A[500 + 9]; int n, m, b, mod; int dp[2][500 + 9 + 2][500 + 9 + 1]; int build() { int p = 0; for (int c = 0; c <= b; c++) dp[p][0][c] = dp[!p][0][c] = 1; for (int c = 0; c <= b; c++) for (int r = 1; r <= m; r++) dp[p][r][c] = 0; for (int i = n - 1; i >= 0; i--) { p = !p; for (int r = 1; r <= m; r++) for (int c = b; c >= 0; c--) if (A[i] + c <= b) dp[p][r][c] = (dp[!p][r][c] + dp[p][r - 1][c + A[i]]) % mod; else dp[p][r][c] = dp[!p][r][c]; } return dp[p][m][0]; } int main() { read_file(false); while (cin >> n >> m >> b >> mod) { for (int i = 0; i < n; i++) cin >> A[i]; cout << build() << endl; } }
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { return a % b == 0 ? b : gcd(b, a % b); } const int MAXN = 100010; int fst[MAXN], sec[MAXN]; int ans[MAXN]; int N, K; int cmp(const int &a, const int &b) { return a > b; } int main() { while (scanf( %d%d , &N, &K) != EOF) { for (int i = 1; i <= N; i++) scanf( %d , &fst[i]); for (int i = 1; i <= N; i++) scanf( %d , &sec[i]); sort(fst + 1, fst + 1 + N, cmp); sort(sec + 1, sec + 1 + N, cmp); int pos = N; int cnt = 0, stepl = 1, stepr = N; while (cnt < N && stepl <= N && stepr >= 1) { if (fst[stepl] + sec[stepr] >= K) { ans[cnt++] = fst[stepl] + sec[stepr]; stepl++; stepr--; } else { stepr--; } } int tot = 0; for (int i = 0; i < N; i++) if (ans[i] >= K) tot++; printf( 1 %d n , min(tot, pos)); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; double a, b, jav = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> a >> b; jav += b; } jav /= n; cout << jav + 5; }
#include <bits/stdc++.h> #pragma comment(linker, /STACK:10000000 ) using namespace std; template <class T> T inline sqr(T x) { return x * x; } const double pi = 3.1415926535897932384626433832795; const double eps = 1e-8; long long ans = 0; bool f(long long x, long long y, long long n) { long long s = x + y; long long ch = -n / (x * y) + x + y; long long zn = 2; long long w = ch / zn; if (ch == w * zn) if (1 <= w && w < x && w < y) { long long k1 = x - w, k2 = y - w, k3 = w; if (k3 < k2) return true; if (k1 == k2) { if (k2 == k3) ans++; else ans += 3; } else { if (k2 == k3) ans += 3; else ans += 6; } } return false; } int main() { long long n; cin >> n; if (n % 3 != 0) { cout << 0 ; return 0; } vector<long long> a, b; for (long long i = 1; i * i <= n; i++) if (n % i == 0) { if (i > 0) a.push_back(i); if (i * i != n) b.push_back(n / i); } for (int i = b.size() - 1; i >= 0; i--) a.push_back(b[i]); cerr << a.size() << endl; n /= 3; int Q = 0; for (int i = 0; i < a.size(); i++) if (n % a[i] == 0) { long long d = n / a[i]; int x = lower_bound(a.begin(), a.end(), d) - a.begin(); for (int j = x; j >= i; j--) if (d % a[j] == 0) { if (f(a[i], a[j], n)) break; } } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; class p1328D { public: void solve() { int q; cin >> q; while (q--) { int n; cin >> n; vector<int> t(n); for (int i = 0; i < n; i++) cin >> t[i]; int sum = 1; for (int i = 1; i < n; i++) { if (t[i] == t[i - 1]) sum++; } if (sum == n) { cout << 1 << endl; for (int i = 0; i < n; i++) cout << 1 << ; cout << endl; } else if (n % 2 == 0 \|\| t.back() == t.front()) { cout << 2 << endl; for (int i = 0; i < n; i++) cout << i % 2 + 1 << ; cout << endl; } else if (sum > 1) { cout << 2 << endl; bool can = true; for (int i = 0; i < n; i++) { if (can && i > 0 && t[i] == t[i - 1]) { cout << (i - 1) % 2 + 1 << ; can = false; } else if (!can) cout << (i - 1) % 2 + 1 << ; else cout << i % 2 + 1 << ; } cout << endl; } else { cout << 3 << endl; for (int i = 0; i < n - 1; i++) cout << i % 2 + 1 << ; cout << 3 << endl; } } } }; class p1327E { public: long long MOD = 998244353; long long fastpow(long long x, long long n) { if (n == 0) return 1ll; if (n == 1) return x; long long temp = fastpow(x, n / 2); if (n % 2 == 0) return (temp * temp) % MOD; else return (((x * temp) % MOD) * temp) % MOD; } void solve() { int n; cin >> n; if (n < 2) { cout << 10 << endl; return; } int maxn = 2e5 + 10; vector<long long> dp(maxn, 1); for (int i = 1; i <= maxn; i++) { dp[i] = (dp[i - 1] * 10) % MOD; } for (int i = 1; i < n; i++) { long long res = 2 * 10 * 9 * dp[n - i - 1] % MOD; res += (n - i - 1) * 10 * 9 * 9 * dp[n - i - 2] % MOD; cout << res % MOD << ; } cout << 10 << endl; } }; class p161D { public: long long res, k, n; vector<vector<int>> e; vector<vector<long long>> dp; void dfs(int cur, int fa) { dp[cur][0] = 1; for (int c : e[cur]) { if (c == fa) continue; dfs(c, cur); for (int i = 1; i <= k; i++) { dp[cur][i] += dp[c][i - 1]; } } res += dp[cur][k]; long long temp = 0; for (int c : e[cur]) { if (c == fa) continue; for (int i = 0; k - 2 - i >= 0; i++) { temp += dp[c][i] * (dp[cur][k - i - 1] - dp[c][k - i - 2]); } } res += temp / 2; } void solve() { cin >> n >> k; e = vector<vector<int>>(n + 1); dp = vector<vector<long long>>(n + 1, vector<long long>(k + 1, 0)); for (int i = 0; i < n - 1; i++) { int a, b; cin >> a >> b; e[a].push_back(b); e[b].push_back(a); } res = 0; dfs(1, 0); cout << res << endl; } }; class p1437C { public: void solve() { int q; cin >> q; while (q--) { int n; cin >> n; vector<int> t(n); for (int i = 0; i < n; i++) cin >> t[i]; sort(t.begin(), t.end()); vector<vector<int>> dp(2 * n + 1, vector<int>(n + 1, 0x3f3f3f3f)); dp[0][0] = 0; int res = 0x3f3f3f3f; for (int k = 1; k <= 2 * n; k++) { for (int i = 1; i <= n; i++) { for (int pre = 0; pre <= k - 1; pre++) { dp[k][i] = min(dp[k][i], dp[pre][i - 1] + abs(t[i - 1] - k)); } } res = min(res, dp[k][n]); } cout << res << endl; } } }; class p1038D { public: void solve() { int n; cin >> n; vector<long long> a(n); for (int i = 0; i < n; i++) cin >> a[i]; if (n == 1) { cout << a[0] << endl; return; } long long ans = 0, minval = 0x3f3f3f3f; bool pos = 0, neg = 0; for (int i = 0; i < n; i++) { ans += abs(a[i]); pos \|= (a[i] >= 0); neg \|= (a[i] <= 0); minval = min(minval, abs(a[i])); } if (pos && neg) cout << ans << endl; else cout << ans - 2 * minval << endl; } }; class p1286A { public: void solve() { int n; cin >> n; vector<int> p(n); unordered_set<int> cnt; for (int i = 1; i <= n; i++) cnt.insert(i); for (int i = 0; i < n; i++) { cin >> p[i]; if (p[i] != 0) cnt.erase(p[i]); } int odd = 0, even = 0; for (int i : cnt) if (i % 2) odd++; else even++; vector<vector<vector<int>>> dp( n + 1, vector<vector<int>>(n + 1, vector<int>(2, 0x3f3f3f3f))); dp[0][0][0] = dp[0][0][1] = 0; for (int i = 1; i <= n; i++) { int cur = p[i - 1] % 2; for (int j = 0; j <= min(odd, i); j++) { if (p[i - 1] != 0) { dp[i][j][cur] = min(dp[i - 1][j][0] + (0 ^ cur), dp[i - 1][j][1] + (1 ^ cur)); } else { if (j >= 1) { dp[i][j][1] = min( dp[i][j][1], min(dp[i - 1][j - 1][0] + 1, dp[i - 1][j - 1][1])); } dp[i][j][0] = min(dp[i][j][0], min(dp[i - 1][j][0], dp[i - 1][j][1] + 1)); } } } cout << min(dp[n][odd][0], dp[n][odd][1]) << endl; } }; class p580D { public: void solve() { int n, m, k; cin >> n >> m >> k; vector<long long> a(n + 1); for (int i = 1; i <= n; i++) cin >> a[i]; vector<vector<long long>> cost(n + 1, vector<long long>(n + 1, 0)); vector<vector<long long>> dp(1 << n, vector<long long>(n + 1, 0)); for (int i = 0; i < k; i++) { long long x, y, c; cin >> x >> y >> c; cost[x][y] = c; } long long ans = 0; for (int i = 1; i <= n; i++) { dp[1 << (i - 1)][i] = a[i]; } for (int i = 1; i < (1 << n); i++) { int cnt = bitset<32>(i).count(); for (int j = 1; j <= n; j++) { if ((i & (1 << (j - 1))) != 0) { int pre = i ^ (1 << (j - 1)); for (int k = 1; k <= n; k++) { if ((pre & (1 << (k - 1))) == 0) continue; dp[i][j] = max(dp[i][j], dp[pre][k] + cost[k][j] + a[j]); } if (cnt == m) ans = max(ans, dp[i][j]); } } } cout << ans << endl; } }; class p1335E2 { public: void solve() { int t; cin >> t; while (t--) { int n; cin >> n; vector<int> a(n + 1); for (int i = 1; i <= n; i++) cin >> a[i]; vector<vector<int>> sum(n + 1, vector<int>(205, 0)); vector<vector<int>> pos(205); int res = 0; for (int i = 1; i <= n; i++) { sum[i][a[i]]++; for (int j = 1; j <= 200; j++) { sum[i][j] += sum[i - 1][j]; res = max(res, sum[i][j]); } pos[a[i]].push_back(i); } for (int i = 1; i <= 200; i++) { int len = pos[i].size(); for (int k = 0; k < len - 1 - k; k++) { int l = pos[i][k], r = pos[i][len - 1 - k] - 1; int mid = 0; for (int j = 1; j <= 200; j++) { mid = max(mid, sum[r][j] - sum[l][j]); } res = max(res, 2 * (k + 1) + mid); } } cout << res << endl; } } }; class p1221D { public: void solve() { int t; cin >> t; while (t--) { int n; cin >> n; vector<long long> a(n + 1), b(n + 1); a[0] = 0; for (int i = 1; i <= n; i++) cin >> a[i] >> b[i]; vector<vector<long long>> dp(n + 1, vector<long long>(4, -1)); dp[0][0] = dp[0][1] = dp[0][2] = dp[0][3] = 0; long long res = LONG_LONG_MAX; for (long long i = 1; i <= n; i++) { for (long long j = 0; j <= 2; j++) { for (int k = 0; k <= 2; k++) { if (a[i] + j != a[i - 1] + k) { auto cur = j * b[i] + dp[i - 1][k]; dp[i][j] = dp[i][j] == -1 ? cur : min(dp[i][j], cur); } } if (i == n) res = min(res, dp[i][j]); } } cout << res << endl; } } }; class p543A { public: void solve() { int n, m, b, md; cin >> n >> m >> b >> md; vector<int> a(n + 1); for (int i = 1; i <= n; i++) cin >> a[i]; vector<vector<int>> dp(m + 1, vector<int>(b + 1, 0)); dp[0][0] = 1; for (int i = 1; i <= n; i++) { for (int k = 0; k <= m; k++) { for (int j = 0; j <= b; j++) { if (j >= a[i] && k > 0) dp[k][j] = (dp[k][j] + dp[k - 1][j - a[i]]) % md; } } } long long res = 0; for (int i = 0; i <= b; i++) res = (res + dp[m][i]) % md; cout << res << endl; } }; class p1142A { public: void solve() { int t; cin >> t; while (t--) { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; int left = a[0]; bool ok = 1; int mx = 0; for (int i = 1; i < n; i++) { if (mx > a[i]) { ok = false; break; } a[i] -= mx; if (left >= a[i]) left = a[i]; else { mx += a[i] - left; } } if (ok) cout << YES << endl; else cout << NO << endl; } } }; class p1244D { public: vector<int> node; vector<vector<int>> e; void dfs(int cur, int fa) { node.push_back(cur); for (int c : e[cur]) { if (c == fa) continue; dfs(c, cur); } } void solve() { int n; cin >> n; vector<vector<long long>> cost(n + 1, vector<long long>(3, 0)); for (int j = 0; j < 3; j++) { for (int i = 1; i <= n; i++) { cin >> cost[i][j]; } } e = vector<vector<int>>(n + 1); for (int i = 0; i < n - 1; i++) { int u, v; cin >> u >> v; e[u].push_back(v); e[v].push_back(u); if (e[u].size() > 2 \|\| e[v].size() > 2) { cout << -1 << endl; return; } } int start = -1; for (int i = 1; i <= n; i++) { if (e[i].size() == 1) { start = i; break; } } dfs(start, -1); long long res = 4e18; int x = -1, y = -1; for (int i = 0; i < 3; i++) { for (int k = 0; k < 3; k++) { if (k == i) continue; long long temp = 0; temp += cost[node[0]][i] + cost[node[1]][k]; int a = i, b = k; for (int j = 2; j < node.size(); j++) { for (int l = 0; l < 3; l++) { if (l == a \|\| l == b) continue; temp += cost[node[j]][l]; a = b; b = l; break; } } if (temp < res) { res = temp; x = i; y = k; } } } cout << res << endl; vector<int> ans(n + 1, 0); ans[node[0]] = x; ans[node[1]] = y; for (int i = 2; i < node.size(); i++) { for (int l = 0; l < 3; l++) { if (l == x \|\| l == y) continue; ans[node[i]] = l; x = y; y = l; break; } } for (int i = 1; i <= n; i++) cout << ans[i] + 1 << ; cout << endl; } }; class p519D { public: void solve() { vector<long long> cnt(26, 0); for (int i = 0; i < 26; i++) cin >> cnt[i]; string s; cin >> s; int n = s.size(); vector<long long> sum(n + 1, 0); for (int i = 1; i <= n; i++) { sum[i] = sum[i - 1] + cnt[s[i - 1] - a ]; } long long res = 0; unordered_map<long long, long long> mp[26]; for (int i = 1; i <= n; i++) { int cur = s[i - 1] - a ; res += mp[cur][sum[i] - cnt[cur]]; mp[cur][sum[i]]++; } cout << res << endl; } }; class p1096D { public: void solve() { int n; cin >> n; string s; cin >> s; vector<long long> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } unordered_map<char, int> cnt; cnt[ h ] = 0; cnt[ a ] = 1; cnt[ r ] = 2; cnt[ d ] = 3; vector<long long> dp(4, 0); for (int i = 0; i < n; i++) { if (!cnt.count(s[i])) continue; if (s[i] == h ) dp[0] += a[i]; else dp[cnt[s[i]]] = min(dp[cnt[s[i]] - 1], dp[cnt[s[i]]] + a[i]); } cout << dp[3] << endl; } }; class p1296E1 { public: void solve() { int n; cin >> n; string s; cin >> s; vector<int> res(n); res[0] = 0; char first = s[0]; char second = a - 1; for (int i = 1; i < n; i++) { if (s[i] >= first) { res[i] = 0; first = s[i]; } else { if (s[i] >= second) { res[i] = 1; second = s[i]; } else { cout << NO << endl; return; } } } cout << YES << endl; for (int i : res) cout << i; cout << endl; } }; class p1296E2 { public: void solve() { int n; cin >> n; string s; cin >> s; vector<int> dp(26, 0); int res = 0; vector<int> ans; for (int i = 0; i < n; i++) { int d = 1; for (int j = s[i] - a + 1; j < 26; j++) { d = max(d, dp[j] + 1); } dp[s[i] - a ] = d; ans.emplace_back(d); } for (int i = 0; i < 26; i++) res = max(res, dp[i]); cout << res << endl; for (auto c : ans) cout << c << ; cout << endl; } }; class D { public: void solve() { int t; cin >> t; for (int i = 1; i <= t; i++) { int n, q; cin >> n >> q; vector<long long> a(n); for (int i = 0; i < n; i++) cin >> a[i]; sort(a.begin(), a.end()); vector<long long> sum(n + 1, 0); for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i - 1]; unordered_set<long long> cnt; cnt.insert(sum[n]); queue<pair<long long, long long>> que; que.emplace(0, n - 1); while (!que.empty()) { auto u = que.front(); que.pop(); if (u.first > u.second) continue; auto l = a[u.first], r = a[u.second]; cnt.insert(sum[u.second + 1] - sum[u.first]); if (u.first == u.second) continue; long long mid = (l + r) / 2; auto it = upper_bound(a.begin() + u.first, a.begin() + u.second + 1, mid) - a.begin(); if (it - 1 >= u.first && it - 1 != u.second) que.emplace(u.first, it - 1); if (it <= u.second && it != u.first) que.emplace(it, u.second); } while (q--) { long long s; cin >> s; if (cnt.count(s)) cout << YES << endl; else cout << NO << endl; } } } }; class p1462F { public: void solve() { int t; cin >> t; while (t--) { int n; cin >> n; vector<pair<long long, long long>> c; vector<int> a, b; c.clear(); for (int i = 0; i < n; i++) { long long l, r; cin >> l >> r; a.push_back(l); b.push_back(r); c.emplace_back(l, r); } sort(a.begin(), a.end()); sort(b.begin(), b.end()); int res = n; for (int i = 0; i < n; i++) { auto leftcnt = lower_bound(b.begin(), b.end(), c[i].first) - b.begin(); auto rightcnt = upper_bound(a.begin(), a.end(), c[i].second) - a.begin(); res = min(res, (int)(leftcnt + n - rightcnt)); } cout << res << endl; } } }; class p1324F { public: vector<int> a; vector<int> dp; int n; vector<vector<int>> e; vector<int> fa; int dfs(int cur, int f) { dp[cur] = a[cur]; for (int child : e[cur]) { if (child == f) continue; int next = dfs(child, cur); dp[cur] += max(0, next); } return dp[cur]; } void dfs2(int cur, int fa) { dp[cur] = max(dp[cur], dp[cur] + max(0, dp[fa] - max(0, dp[cur]))); for (int c : e[cur]) { if (c == fa) continue; dfs2(c, cur); } } void solve() { cin >> n; a = vector<int>(n + 1); e = vector<vector<int>>(n + 1); dp = vector<int>(n + 1, 0); fa = vector<int>(n + 1, 0); for (int i = 1; i <= n; i++) { cin >> a[i]; if (a[i] == 0) a[i] = -1; } for (int i = 0; i < n - 1; i++) { int u, v; cin >> u >> v; e[u].emplace_back(v); e[v].emplace_back(u); } dfs(1, 0); dfs2(1, 0); for (int i = 1; i <= n; i++) { cout << dp[i] << ; } cout << endl; } }; class p1446B { public: void solve() { int n, m; cin >> n >> m; string s, t; cin >> s >> t; vector<vector<int>> dp(n + 1, vector<int>(m + 1, 0)); int res = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (s[i - 1] == t[j - 1]) { dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] + 2); } dp[i][j] = max(dp[i][j], max(dp[i - 1][j] - 1, dp[i][j - 1] - 1)); res = max(res, dp[i][j]); } } cout << res << endl; } }; class p1283E { public: void solve() { int n; cin >> n; vector<int> x(n); for (int i = 0; i < n; i++) cin >> x[i]; int maxn = 200005; int ans1 = 0, ans2 = 0; unordered_map<int, int> cnt; for (int i : x) cnt[i]++; for (int i = 1; i <= n; i++) { if (cnt[i] > 0) { ans1++; i += 2; } } for (int i = 1; i <= n + 1; i++) { if (cnt[i - 1] == 0 && cnt[i] > 0) { cnt[i - 1]++; cnt[i]--; } if (cnt[i] > 1) { cnt[i]--; cnt[i + 1]++; } } for (int i = 0; i <= n + 1; i++) { if (cnt[i] > 0) ans2++; } printf( %d %d n , ans1, ans2); } }; class p148D { public: vector<vector<vector<double>>> dp; double dfs(int w, int b, int cur) { if (dp[w][b][cur] >= 0.0) return dp[w][b][cur]; if (w == 0) { if (cur == 0) dp[w][b][cur] = 0.0; else dp[w][b][cur] = 1.0; return dp[w][b][cur]; } if (b == 0) { dp[w][b][cur] = 1.0; return 1.0; } dp[w][b][cur] = 1.0 * w / (w + b); if (cur == 0) { dp[w][b][cur] += (1.0 - dfs(w, b - 1, 1 - cur)) * (1.0 * b / (w + b)); } else { dp[w][b][cur] += (1.0 - dfs(w - 1, b - 1, 1 - cur)) * (1.0 * b / (w + b)) * (1.0 * w / (w + b - 1)); if (b >= 2) { dp[w][b][cur] += (1.0 - dfs(w, b - 2, 1 - cur)) * (1.0 * b / (w + b)) * (1.0 * (b - 1) / (w + b - 1)); } } return dp[w][b][cur]; } void solve() { int w, b; cin >> w >> b; dp = vector<vector<vector<double>>>( w + 1, vector<vector<double>>(b + 1, vector<double>(2, -1))); double res = dfs(w, b, 0); printf( %.9lf n , res); } }; class p95B { public: string ans, s; bool dfs(int id, int sum4, int sum7, bool ok) { if (id >= s.size()) return 1; if (ok) { ans.append(sum4, 4 ); ans.append(sum7, 7 ); return 1; } if (s[id] <= 4 && sum4) { ans.push_back( 4 ); if (dfs(id + 1, sum4 - 1, sum7, s[id] < 4 )) return true; ans.pop_back(); } if (s[id] <= 7 && sum7) { ans.push_back( 7 ); if (dfs(id + 1, sum4, sum7 - 1, s[id] < 7 )) return 1; ans.pop_back(); } return 0; } void solve() { cin >> s; ans.clear(); s.clear(); s.append(100000, 4 ); cout << s << endl; int n = s.size(); if (n % 2 \|\| !dfs(0, n / 2, n / 2, 0)) { ans.append((n + 2) / 2, 4 ); ans.append((n + 2) / 2, 7 ); cout << ans << endl; } else cout << ans << endl; } }; class p182E { public: void solve() { int n, h; cin >> n >> h; vector<vector<vector<int>>> dp( h + 1, vector<vector<int>>(n + 1, vector<int>(2, 0))); for (int i = 0; i < n; i++) dp[0][i][0] = dp[0][i][1] = 1; vector<pair<long long, long long>> a(n); for (int i = 0; i < n; i++) { cin >> a[i].first >> a[i].second; } long long res = 0; for (int i = 1; i <= h; i++) { for (int j = 0; j < n; j++) { int l = a[j].first, w = a[j].second; if (i == l) dp[i][j][0] = (dp[i][j][0] + 1) % 1000000007; if (i == w && l != w) dp[i][j][1] = (dp[i][j][1] + 1) % 1000000007; for (int k = 0; k < n; k++) { if (k == j) continue; int pl = a[k].first, pw = a[k].second; if (i > l) { dp[i][j][0] = (dp[i][j][0] + dp[i - l][k][0] * (l == pw)) % 1000000007; dp[i][j][0] = (dp[i][j][0] + dp[i - l][k][1] * (l == pl)) % 1000000007; } if (i > w && l != w) { dp[i][j][1] = (dp[i][j][1] + dp[i - w][k][0] * (w == pw)) % 1000000007; dp[i][j][1] = (dp[i][j][1] + dp[i - w][k][1] * (w == pl)) % 1000000007; } } if (i == h) res = (res + dp[i][j][0] + dp[i][j][1]) % 1000000007; } } cout << res << endl; } }; class p180E { public: void solve() { int n, m, k; cin >> n >> m >> k; unordered_map<int, vector<int>> cnt; for (int i = 0; i < n; i++) { int x; cin >> x; cnt[x].push_back(i); } int res = 0; for (auto it : cnt) { auto v = it.second; int sz = v.size(); deque<int> q; for (int r = 0; r < sz; r++) { q.push_back(v[r]); while (!q.empty() && q.back() - q.front() + 1 - q.size() > k) q.pop_front(); res = max(res, (int)q.size()); } } cout << res << endl; } }; class p30C { public: struct node { long long x, y, t; double p; node(long long xx, long long yy, long long tt, double pp) : x(xx), y(yy), t(tt), p(pp){}; node(){}; bool operator<(const node &rhs) const { return t < rhs.t; } }; void solve() { int n; cin >> n; vector<node> a; for (int i = 0; i < n; i++) { long long x, y, t; double p; cin >> x >> y >> t >> p; a.emplace_back(x, y, t, p); } sort(a.begin(), a.end()); vector<double> dp(a.size() + 1, 0.0); double res = 0.0; for (int i = 0; i < n; i++) { dp[i] = a[i].p; for (int j = 0; j < i; j++) { long long dis = abs(a[i].x - a[j].x) * abs(a[i].x - a[j].x) + abs(a[i].y - a[j].y) * abs(a[i].y - a[j].y); long long dt = (a[i].t - a[j].t) * (a[i].t - a[j].t); if (dis <= dt) dp[i] = max(dp[i], dp[j] + a[i].p); } res = max(res, dp[i]); } printf( %.7lf , res); } }; class p49D { public: void solve() { int n; cin >> n; string s; cin >> s; vector<vector<int>> dp(n, vector<int>(2, 0x3f3f3f3f)); dp[0][0] = s[0] != 0 ; dp[0][1] = s[0] != 1 ; for (int i = 1; i < n; i++) { dp[i][0] = s[i] != 0 ; dp[i][1] = s[i] != 1 ; dp[i][0] += dp[i - 1][1]; dp[i][1] += dp[i - 1][0]; } cout << min(dp[n - 1][0], dp[n - 1][1]) << endl; } }; class p721C { public: void solve() { int n, m, T; cin >> n >> m >> T; vector<vector<pair<long long, long long>>> e(n + 1); vector<int> in(n + 1, 0); for (int i = 0; i < m; i++) { int u, v, t; cin >> u >> v >> t; e[u].emplace_back(v, t); in[v]++; } queue<int> q; for (int i = 1; i <= n; i++) { if (!in[i]) q.push(i); } vector<vector<int>> dp(n + 1, vector<int>(n + 1, 0x3f3f3f3f)); vector<vector<int>> f(n + 1, vector<int>(n + 1, 0)); dp[1][1] = 0; while (!q.empty()) { int u = q.front(); q.pop(); for (auto &[v, w] : e[u]) { for (int j = 2; j <= n; j++) { if (dp[v][j] > dp[u][j - 1] + w) { dp[v][j] = dp[u][j - 1] + w; f[v][j] = u; } } in[v]--; if (!in[v]) q.push(v); } } int ans = -1; for (int j = n; j >= 1; j--) { if (dp[n][j] <= T) { ans = j; break; } } cout << ans << endl; vector<int> out; for (int i = n, j = ans; f[i][j] != 0; i = f[i][j], j--) out.push_back(i); out.push_back(1); reverse(out.begin(), out.end()); for (int i : out) cout << i << ; cout << endl; } }; class p830A { public: void solve() { long long n, k, p; cin >> n >> k >> p; vector<long long> a(n + 1, 0); vector<long long> b(k + 1, 0); for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= k; i++) cin >> b[i]; sort(a.begin(), a.end()); sort(b.begin(), b.end()); vector<vector<long long>> dp(n + 1, vector<long long>(k + 1, 1e18)); for (int i = 0; i <= k; i++) dp[0][i] = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= k; j++) { dp[i][j] = min(dp[i][j - 1], max(dp[i - 1][j - 1], abs(a[i] - b[j]) + abs(p - b[j]))); } } cout << dp[n][k] << endl; } }; class p983B { public: void solve() { int n; cin >> n; vector<int> a(n + 1); vector<vector<int>> f(n + 1, vector<int>(n + 1, 0)); vector<vector<int>> dp(n + 1, vector<int>(n + 1, 0)); for (int i = 1; i <= n; i++) { cin >> a[i]; dp[i][i] = f[i][i] = a[i]; } for (int i = n; i >= 1; i--) { for (int j = i + 1; j <= n; j++) { f[i][j] = f[i][j - 1] ^ f[i + 1][j]; dp[i][j] = max(dp[i][j], f[i][j]); dp[i][j] = max(dp[i][j], max(dp[i + 1][j], dp[i][j - 1])); } } int q; cin >> q; while (q--) { int l, r; cin >> l >> r; cout << dp[l][r] << endl; } } }; class p671A { public: struct node { long long id; double at, bt; node(int _id, double t, double a, double b) : id(_id), at(a - t), bt(b - t){}; }; void solve() { long long ax, ay, bx, by, tx, ty; cin >> ax >> ay >> bx >> by >> tx >> ty; int n; cin >> n; vector<node> bt1, bt2; auto distance = [](long long x1, long long y1, long long x2, long long y2) { long long dx = abs(x1 - x2); long long dy = abs(y1 - y2); return 1.0 * sqrt(dx * dx + dy * dy); }; double res = 0.0; for (int i = 0; i < n; i++) { long long x, y; cin >> x >> y; auto dt = distance(x, y, tx, ty); auto da = distance(x, y, ax, ay); auto db = distance(x, y, bx, by); res += 2.0 * dt; bt1.emplace_back(i, dt, da, db); bt2.emplace_back(i, dt, da, db); } sort(bt1.begin(), bt1.end(), [](const node &a, const node &b) { return a.at < b.at; }); sort(bt2.begin(), bt2.end(), [](const node &a, const node &b) { return a.bt < b.bt; }); int i = 0, j = 0; double temp = min(res + bt1[i].at, res + bt2[j].bt); if (bt1[i].id != bt2[j].id) { res += bt1[i].at; res += bt2[j].bt; } else { res += min(bt1[0].at + (bt2.size() > 1 ? bt2[1].bt : 0), bt2[0].bt + (bt1.size() > 1 ? bt1[1].at : 0)); } res = min(temp, res); printf( %.15f n , res); } }; class p274B { public: int n; vector<vector<int>> edge; vector<long long> v; pair<long long, long long> dfs(int cur, int fa) { long long now = v[cur]; long long curp = 0, curg = 1e18; for (int i : edge[cur]) { if (i == fa) continue; auto next = dfs(i, cur); curp = max(next.first, curp); if (next.second != 0) curg = min(next.second, curg); } if (curg == 1e18) { curg = 0; } now += -curg - curp; if (now >= 0) curp += now; else curg += now; return {curp, curg}; } void solve() { cin >> n; edge = vector<vector<int>>(n + 1); v = vector<long long>(n + 1); for (int i = 0; i < n - 1; i++) { int a, b; cin >> a >> b; edge[a].push_back(b); edge[b].push_back(a); } for (int i = 1; i <= n; i++) cin >> v[i]; pair<long long, long long> it = dfs(1, 0); cout << abs(it.first) + abs(it.second) << endl; } }; class p933A { public: void solve() { int n; cin >> n; vector<int> a(n + 1); for (int i = 1; i <= n; i++) cin >> a[i]; vector<int> two(n + 2, 0), one(n + 1, 0); if (a.back() == 2) two[n]++; for (int i = n - 1; i >= 1; i--) { two[i] += two[i + 1]; if (a[i] == 2) two[i]++; } for (int i = 1; i <= n; i++) { one[i] += one[i - 1]; if (a[i] == 1) one[i]++; } int res = 0; for (int l = 1; l <= n; l++) { int s = 0, t = 0; for (int r = l; r <= n; r++) { if (a[r] == 1) { s = max(s, t) + 1; } else { t++; } res = max(res, one[l - 1] + two[r + 1] + max(s, t)); } } cout << res << endl; } }; class p527D { public: void solve() { int n; cin >> n; vector<pair<long long, long long>> v(n); for (int i = 0; i < n; i++) { cin >> v[i].first >> v[i].second; } sort(v.begin(), v.end(), [](const pair<long long, long long> &a, const pair<long long, long long> &b) { return a.first + a.second < b.first + b.second; }); long long res = 1; int last = 0; for (int i = 1; i < n; i++) { if (v[i].first - v[i].second >= v[last].first + v[last].second) { res++; last = i; } } cout << res << endl; } }; class p1083A { public: vector<vector<pair<long long, long long>>> edge; vector<long long> dp; long long ans = 0; vector<long long> w; void dfs(int u, int fa) { dp[u] = w[u]; for (auto &[v, c] : edge[u]) { if (v == fa) continue; dfs(v, u); ans = max(ans, dp[u] + dp[v] - c); dp[u] = max(dp[u], w[u] + dp[v] - c); } } void solve() { int n; cin >> n; w = vector<long long>(n + 1); ans = 0; for (int i = 1; i <= n; i++) { cin >> w[i]; ans = max(ans, w[i]); } edge = vector<vector<pair<long long, long long>>>(n + 1); dp = vector<long long>(n + 1, 0); for (int i = 0; i < n - 1; i++) { long long u, v, c; cin >> u >> v >> c; edge[u].emplace_back(v, c); edge[v].emplace_back(u, c); } dfs(1, 0); cout << ans << endl; } }; class p909C { public: void solve() { int n; cin >> n; string s(n, ); for (int i = 0; i < n; i++) cin >> s[i]; vector<vector<long long>> dp(n, vector<long long>(n + 1, 0)); dp[0][0] = 1; for (int i = 1; i < n; i++) { if (s[i - 1] == f ) { for (int j = 0; j < n; j++) { dp[i][j + 1] = dp[i - 1][j]; } } else { long long cur = 0; for (int k = n; k >= 0; k--) { cur = (cur + dp[i - 1][k]) % 1000000007; dp[i][k] = (dp[i][k] + cur) % 1000000007; } } } long long res = 0; for (int i = 0; i <= n; i++) res = (res + dp[n - 1][i]) % 1000000007; cout << res << endl; } }; class p743D { public: int n; vector<long long> a; vector<vector<long long>> edge; vector<vector<long long>> dp; long long ans = 0; void dfs(int u, int fa) { dp[u][0] = a[u]; dp[u][1] = -4e18; long long mx1 = -4e18, mx2 = -4e18; for (int v : edge[u]) { if (v == fa) continue; dfs(v, u); dp[u][0] += dp[v][0]; if (dp[v][1] >= mx1) { mx2 = mx1; mx1 = dp[v][1]; } else if (dp[v][1] >= mx2) mx2 = dp[v][1]; dp[u][1] = max(dp[u][1], dp[v][1]); } if (mx1 != -4e18 && mx2 != -4e18) ans = max(ans, mx1 + mx2); dp[u][1] = max(dp[u][0], dp[u][1]); } void solve() { cin >> n; a = vector<long long>(n + 1); for (int i = 1; i <= n; i++) cin >> a[i]; edge = vector<vector<long long>>(n + 1); for (int i = 0; i < n - 1; i++) { int u, v; cin >> u >> v; edge[u].push_back(v); edge[v].push_back(u); } if (n <= 2) { cout << Impossible << endl; return; } dp = vector<vector<long long>>(n + 1, vector<long long>(2, 0)); ans = -4e18; dfs(1, 0); if (ans == -4e18) cout << Impossible << endl; else cout << ans << endl; } }; class p869C { public: void solve() { int a, b, c; cin >> a >> b >> c; vector<vector<long long>> f(5005, vector<long long>(5005, 0)); long long md = 998244353; f[0][0] = 1; for (int i = 1; i <= 5000; i++) { f[i][0] = 1; for (int j = 1; j <= i; j++) { f[i][j] = (f[i - 1][j - 1] + f[i - 1][j]) % md; } } long long ans1 = 0, ans2 = 0, ans3 = 0; auto compute = [&f, &md](long long &ans, int a, int b) { long long cur = 1; for (long long k = 0; k <= min(a, b); k++, cur = k, cur %= md) { ans += (((f[a][k] f[b][k] + md) % md) * cur) % md; ans %= md; } return ans; }; long long res = ((compute(ans1, a, b) * compute(ans2, b, c) % md) * compute(ans3, a, c)) % md; cout << (res + md) % md << endl; } }; class p768C { public: void solve() { int n, k, x; cin >> n >> k >> x; vector<int> a(n); int freq[1024]; memset(freq, 0, sizeof(freq)); for (int i = 0; i < n; i++) { cin >> a[i]; freq[a[i]]++; } while (k--) { vector<int> tmp(1024, 0); for (int i = 0; i < 1024; i++) tmp[i] = freq[i]; int pre = 0; for (int i = 0; i < 1024; i++) { if (tmp[i] <= 0) continue; int cnt = 0; if (pre == 0) cnt = (tmp[i] + 1) / 2; else cnt = (tmp[i]) / 2; freq[i] -= cnt; freq[i ^ x] += cnt; pre ^= tmp[i] & 1; } } int mi = 2048, mx = 0; for (int i = 0; i < 1024; i++) { if (freq[i] > 0) { mi = min(mi, i); mx = max(mx, i); } } cout << mx << << mi << endl; } }; class p1107D { public: void solve() { int n; cin >> n; vector<vector<int>> g(n + 1, vector<int>(n + 1, 0)); auto f = [](char c) { if (c <= 9 ) return c - 0 ; else return 10 + (c - A ); }; for (int i = 1; i <= n; i++) { string s; cin >> s; for (int j = 0; j < s.size(); j++) { int cur = f(s[j]); for (int k = 3; k >= 0; k--) { g[i][j * 4 + 4 - k] = (cur & (1 << k)) != 0 ? 1 : 0; } } } vector<vector<int>> sum(n + 1, vector<int>(n + 1, 0)); for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { sum[i][j] = sum[i][j - 1] + sum[i - 1][j] + g[i][j] - sum[i - 1][j - 1]; } } auto getSub = [&sum](int l, int r, int x) { return sum[l + x - 1][r + x - 1] - sum[l - 1][r + x - 1] - sum[l + x - 1][r - 1] + sum[l - 1][r - 1]; }; for (int x = n; x > 0; x--) { if ((n % x) == 0) { bool ok = true; for (int i = 1; i <= n; i += x) { for (int j = 1; j <= n; j += x) { int cur = getSub(i, j, x); if (cur != x * x && cur != 0) { ok = false; break; } } if (!ok) break; } if (ok) { cout << x << endl; break; } } } } }; class p917A { public: long long ans = 0; vector<int> dp; void solve() { ans = 0; string s; cin >> s; int n = s.size(); vector<vector<int>> f(n + 1, vector<int>(n + 1, 0)); vector<vector<int>> g(n + 1, vector<int>(n + 1, 0)); for (int i = 0; i < n; i++) { bool ok = true; int cnt = 0; for (int j = i; j < n; j++) { if (s[j] == ) ) cnt--; else cnt++; if (cnt < 0) ok = false; f[i][j] = ok; } } for (int i = 0; i < n; i++) { int cnt = 0; bool ok = true; for (int j = i; j >= 0; j--) { if (s[j] == ( ) cnt--; else cnt++; if (cnt < 0) ok = false; g[j][i] = ok; } } for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j += 2) { if (f[i][j] && g[i][j]) ans++; } } cout << ans << endl; } }; class p946D { public: void solve() { int n, m, k; cin >> n >> m >> k; vector<string> a(n + 1); for (int i = 1; i <= n; i++) cin >> a[i]; vector<vector<int>> dp(n + 1, vector<int>(k + 1, 0x3f3f3f3f)); for (int i = 0; i <= k; i++) dp[0][i] = 0; vector<vector<int>> cnt(n + 1, vector<int>(k + 1, 0x3f3f3f3f)); for (int i = 1; i <= n; i++) { unordered_map<int, int> last; int sum = 0, total = 0; for (int j = 1; j <= m; j++) total += (a[i][j - 1] == 1 ? 1 : 0); last[0] = 0; for (int j = 1; j <= m; j++) { if (a[i][j - 1] == 1 ) sum++; last[sum] = j; for (int l = 0; l <= min(total, k); l++) { if (last.count(sum - total + l)) { cnt[i][l] = min(cnt[i][l], j - last[sum - total + l]); } } } for (int l = 0; l <= k; l++) { for (int r = 0; r <= min(total, l); r++) { dp[i][l] = min(dp[i][l], dp[i - 1][l - r] + cnt[i][r]); } } } cout << dp[n][k] << endl; } }; class p666A { public: void solve() { string s; cin >> s; int n = s.size(); vector<vector<int>> dp(n + 1, vector<int>(2, -1)); set<string> res; dp[n][0] = dp[n][1] = 1; dp[n - 2][0] = 1; if (n >= 7) res.insert(s.substr(n - 2, 2)); dp[n - 3][1] = 1; if (n >= 8) res.insert(s.substr(n - 3, 3)); for (int i = n - 4; i >= 5; i--) { if (dp[i + 2][1] == 1 \|\| (dp[i + 2][0] == 1 && (s[i] != s[i + 2] \|\| s[i + 1] != s[i + 3]))) { dp[i][0] = 1; res.insert(s.substr(i, 2)); } if (dp[i + 3][0] == 1 \|\| (dp[i + 3][1] == 1 && (s[i] != s[i + 3] \|\| s[i + 1] != s[i + 4] \|\| s[i + 2] != s[i + 5]))) { dp[i][1] = 1; res.insert(s.substr(i, 3)); } } cout << res.size() << endl; for (string s : res) cout << s << endl; } }; class p1016C { public: void solve() { long long n; cin >> n; vector<vector<long long>> a(2, vector<long long>(n + 1, 0)); for (int i = 0; i < 2; i++) { for (int j = 1; j <= n; j++) cin >> a[i][j]; } vector<vector<long long>> sum1(2, vector<long long>(n + 1, 0)), sum2(2, vector<long long>(n + 1, 0)), sum3(2, vector<long long>(n + 1, 0)); for (int i = 0; i < 2; i++) { for (int j = 1; j <= n; j++) { sum3[i][j] += sum3[i][j - 1] + a[i][j]; sum1[i][j] += sum1[i][j - 1] + (j - 1) * a[i][j]; sum2[i][j] += sum2[i][j - 1] + (n - j) * a[i][j]; } } long long res = 0; long long cur = 0; for (int c = 0; c < 2 * n; c++) { int j = c / 2 + 1; int i = ((j % 2) + (c % 2) + 1) % 2; cur += c * a[i][j]; if ((j % 2) == i) continue; long long aa = (sum1[i][n] - sum1[i][j] + (c + 1 - j) * (sum3[i][n] - sum3[i][j])); long long bb = (sum2[1 ^ i][n] - sum2[1 ^ i][j - 1] + (n + j - 1) * (sum3[1 ^ i][n] - sum3[1 ^ i][j - 1])); res = max(res, cur + aa + bb); } cout << res << endl; } }; class p1133E { public: void solve() { int n, k; cin >> n >> k; vector<vector<long long>> dp(n + 1, vector<long long>(k + 1, -1)); vector<long long> a(n, 0); for (int i = 0; i <= n - 1; i++) cin >> a[i]; sort(a.begin(), a.end()); for (int i = 0; i <= n; i++) dp[i][0] = 0; long long res = 0; for (int j = 1; j <= k; j++) { for (int i = 1; i <= n; i++) { dp[i][j] = dp[i - 1][j]; auto it = lower_bound(a.begin(), a.end(), a[i - 1] - 5); if (it == a.end()) { if (dp[0][j - 1] != -1) dp[i][j] = max(dp[i][j], dp[0][j - 1] + 1); } else { int pre = it - a.begin(); if (dp[pre][j - 1] != -1) { dp[i][j] = max(dp[i][j], dp[pre][j - 1] + i - pre); } } res = max(res, dp[i][j]); } } cout << res << endl; } }; class p2345H { public: void solve() { string s; cin >> s; int n = s.size(); vector<vector<int>> dp(n + 1, vector<int>(n + 1, 0)); vector<vector<bool>> ok(n + 2, vector<bool>(n + 1, 0)); for (int i = 1; i <= n; i++) { ok[i][i] = dp[i][i] = 1; ok[i + 1][i] = 1; } for (int len = 2; len <= n; len++) { for (int i = 1; i + len - 1 <= n; i++) { int j = i + len - 1; dp[i][j] = dp[i][j - 1] + dp[i + 1][j] - dp[i + 1][j - 1]; if (s[i - 1] == s[j - 1]) { ok[i][j] = ok[i + 1][j - 1]; if (ok[i][j] != 0) dp[i][j] += 1; } } } int q; cin >> q; while (q--) { int l, r; cin >> l >> r; printf( %lld n , dp[l][r]); } } }; class p733C { public: void solve() { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; int k; cin >> k; vector<int> b(k); for (int i = 0; i < k; i++) cin >> b[i]; vector<tuple<int, char>> res; int start = 0; bool flag = true; for (int i = 0; i < k && start < n; i++) { int sum = 0; int mx = start, end = start; while (sum < b[i] && end < n) { sum += a[end]; if (a[end] > a[mx]) mx = end; end++; } if (sum != b[i]) { flag = false; break; } if (end - start == 1) { start++; continue; } int k = start; bool ok = false; for (; k < end; k++) { if (a[k] == a[mx]) { if (k > start && a[k - 1] < a[k]) ok = true; if (k + 1 < end && a[k + 1] < a[k]) ok = true; } if (ok) break; } if (!ok) { flag = false; break; } if (k > start && a[k - 1] < a[k]) { for (int l = k; l > start; l--) res.emplace_back(i + l - start + 1, L ); for (int r = k; r < end - 1; r++) res.emplace_back(i + 1, R ); } else { for (int r = k; r < end - 1; r++) res.emplace_back(i + k - start + 1, R ); for (int l = k; l > start; l--) res.emplace_back(i + l - start + 1, L ); } start = end; } if (!flag \|\| res.size() != n - k) cout << NO << endl; else { cout << YES << endl; for (auto &[x, y] : res) { cout << x << << y << endl; } } } }; class p914C { public: static const int maxn = 1005; long long f[maxn]; long long c[maxn][maxn]; void init() { const int maxn = 1001; f[1] = 0; for (int i = 2; i < maxn; i++) { int cnt = bitset<32>(i).count(); f[i] = 1 + f[cnt]; } memset(c, 0, sizeof(c)); c[0][0] = 1; for (int i = 1; i < maxn; i++) { c[i][0] = 1; for (int j = 1; j <= i; j++) { c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % 1000000007; } } } void solve() { int k; string s; cin >> s >> k; int n = s.size(); if (k == 0) { if (s[0] >= 1) cout << 1 << endl; else cout << 0 << endl; return; } if (k == 1) { cout << n - 1 << endl; return; } init(); long long res = 0; vector<long long> dp(n, 0); int cnt = 0; for (int i = 0; i < n; i++) { if (s[i] == 1 ) { for (int j = 0; j <= n - i - 1; j++) { if (f[cnt + j] == k - 1) { res = (res + c[n - i - 1][j]) % 1000000007; } } cnt++; } } if (f[cnt] == k - 1) res = (res + 1) % 1000000007; cout << res << endl; } }; class p358D { public: static const int maxn = 3001; int n; int a[maxn], b[maxn], c[maxn]; int dp[maxn][2][2]; void solve() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &a[i]); for (int i = 0; i < n; i++) scanf( %d , &b[i]); for (int i = 0; i < n; i++) scanf( %d , &c[i]); memset(dp, -1, sizeof(dp)); dp[0][0][1] = b[0]; dp[0][0][0] = a[0]; for (int i = 1; i < n; i++) { dp[i][0][0] = max(dp[i - 1][1][1] + a[i], dp[i - 1][0][1] + a[i]); dp[i][0][1] = max(dp[i - 1][1][1] + b[i], dp[i - 1][0][1] + b[i]); dp[i][1][0] = max(dp[i - 1][1][0] + b[i], dp[i - 1][0][0] + b[i]); dp[i][1][1] = max(dp[i - 1][1][0] + c[i], dp[i - 1][0][0] + c[i]); } cout << max(dp[n - 1][1][0], dp[n - 1][0][0]) << endl; } }; class p700B { public: unordered_set<int> us; vector<vector<int>> edge; vector<int> seq; vector<int> dis; vector<int> lg; vector<vector<int>> dp; void dfs(int u, int fa, int depth) { dis[u] = depth; if (us.count(u)) seq.push_back(u); dp[u][0] = fa; for (int i = 1; (1 << i) <= depth; i++) { dp[u][i] = dp[dp[u][i - 1]][i - 1]; } for (auto c : edge[u]) { if (c == fa) continue; dfs(c, u, depth + 1); } } int lca(int x, int y) { if (dis[x] < dis[y]) swap(x, y); while (dis[x] > dis[y]) x = dp[x][lg[dis[x] - dis[y]] - 1]; if (x == y) return x; for (int k = lg[dis[x]] - 1; k >= 0; k--) { if (dp[x][k] != dp[y][k]) { x = dp[x][k]; y = dp[y][k]; } } return dp[x][0]; } void solve() { int n, k; cin >> n >> k; lg = vector<int>(n + 1, 0); dp = vector<vector<int>>(n + 1, vector<int>(21, 0)); for (int i = 1; i <= n; i++) { lg[i] = lg[i - 1]; if (i == (1 << lg[i - 1])) lg[i]++; } us.clear(); seq.clear(); for (int i = 0; i < 2 * k; i++) { int a; cin >> a; us.insert(a); } edge = vector<vector<int>>(n + 1); dis = vector<int>(n + 1); for (int i = 0; i < n - 1; i++) { int x, y; cin >> x >> y; edge[x].push_back(y); edge[y].push_back(x); } dfs(1, 0, 0); long long res = 0; for (int i = 0; i < k; i++) { int u = lca(seq[i], seq[i + k]); res += dis[seq[i]] + dis[seq[i + k]] - 2 * dis[u]; } cout << res << endl; } }; class p700b { public: vector<vector<int>> edge; set<int> us; long long sum = 0; long long dfs(int u, int fa) { long long cnt = 0; if (us.count(u)) cnt++; for (int c : edge[u]) { if (c == fa) continue; long long t = dfs(c, u); sum += min(t, (long long)(us.size() - t)); cnt += t; } return cnt; } void solve() { int n, k; cin >> n >> k; for (int i = 0; i < 2 * k; i++) { int a; cin >> a; us.insert(a); } edge = vector<vector<int>>(n + 1); for (int i = 0; i < n - 1; i++) { int x, y; cin >> x >> y; edge[x].push_back(y); edge[y].push_back(x); } sum = 0; dfs(1, 0); cout << sum << endl; } }; class p822D { public: void solve() { long long t, l, r; cin >> t >> l >> r; vector<long long> f(r + 1, 0); for (int i = 2; i <= r; i++) f[i] = i; for (long long i = 2; i * i <= r; i++) { if (f[i] == i) { for (long long j = i * i; j <= r; j += i) { f[j] = min(f[j], i); } } } vector<long long> dp(r + 1, 0); for (long long i = 2; i <= r; i++) { dp[i] = 1ll * 0x3f3f3f3f * 0x3f3f3f3f; for (long long j = i; j != 1; j /= f[j]) { dp[i] = min(dp[i], dp[i / f[j]] + i * (f[j] - 1) / 2); } } long long res = 0; long long k = 1; for (int i = l; i <= r; i++) { res = (res + k * (dp[i] % 1000000007)) % 1000000007; k = (k * t) % 1000000007; } cout << res << endl; } }; class p747D { public: void solve() { int n, k; cin >> n >> k; vector<int> t(n); vector<int> cnt; for (int i = 0; i < n; i++) cin >> t[i]; for (int i = 0; i < n; i++) { if (t[i] < 0) { cnt.push_back(i); } } if (cnt.size() > k) { cout << -1 << endl; return; } if (cnt.size() == 0) { cout << 0 << endl; return; } int res = 1, last = cnt.back(); k -= cnt.size(); for (int i = 0; i < cnt.size() - 1; i++) { cnt[i] = cnt[i + 1] - cnt[i] - 1; } cnt.pop_back(); sort(cnt.begin(), cnt.end()); for (int i : cnt) { if (i == 0) continue; if (i <= k) k -= i; else res += 2; } if (k < n - last - 1) res++; cout << res << endl; } }; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); p747D ans; ans.solve(); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 100005; int n, m, s, vis[100005], cy; long long t; int nex(int x, int y) { if (x < m) return (x + y) % n; else return (x - y + n) % n; } int main() { scanf( %d %d , &n, &m); scanf( %d %lld , &s, &t); --s; while (t % n != 0) { s = nex(s, t % n); --t; } t /= n; while (t && (!vis[s])) { vis[s] = ++cy; for (int y = n - 1; y > 0; --y) s = nex(s, y); --t; } if (!t) { cout << s + 1; return 0; } t %= (cy + 1 - vis[s]); while (t) { for (int y = n - 1; y > 0; --y) s = nex(s, y); --t; } cout << s + 1; }
#include <bits/stdc++.h> using namespace std; template <typename T> static ostream& operator<<(ostream& stream, const vector<T>& t); template <typename T> static istream& read(T, T, istream& = cin); template <typename T> static istream& operator>>(istream& stream, vector<T>& t) { return read((t).begin(), (t).end(), stream); } template <typename T> static istream& read(T b, T e, istream& stream) { for (T it = b; it != e; ++it) stream >> it; return stream; } template <typename T> static void print(T x, string end = n ) { cout << x << end; } template <typename T> static ostream& print(T b, T e, string sep = , ostream& stream = cout) { for (T it = b; it != e; ++it) { stream << it; if (it + 1 != e) stream << sep; } return stream; } template <typename T> static void print(vector<T> arr, string sep = ) { if (arr.empty()) { return; } print(arr.begin(), arr.end(), sep); cout << n ; } void _() { int n; cin >> n; vector<int> arr(n); cin >> arr; vector<int> tmp(1, n + 1); vector<string> ans(n + 1, string(n, 0 )); for (int j = 0; j <= n - 1; ++j) { int l = 0; vector<int> n_tmp; int ones = arr[j], zeros = n + 1 - arr[j]; for (int x : tmp) { int take_zeros = min(zeros, x - (ones > 0)); int take_ones = x - take_zeros; if (x == 1) { if (ones > zeros) take_ones = 1, take_zeros = 0; else take_ones = 0, take_zeros = 1; } zeros -= take_zeros; ones -= take_ones; for (int i = l; i <= l + take_zeros - 1; ++i) ans[i][j] = 0 ; l += take_zeros; for (int i = l; i <= l + take_ones - 1; ++i) ans[i][j] = 1 ; l += take_ones; if (take_zeros) n_tmp.push_back(take_zeros); if (take_ones) n_tmp.push_back(take_ones); } tmp = n_tmp; } print(n + 1); print(ans, n ); } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(15); _(); }
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; int main() { ios_base::sync_with_stdio(0); cin.tie(0); ; int n; cin >> n; vector<int> dem(1000); int maxx = INT_MIN; for (int i = 0; i < n; ++i) { int u; cin >> u; dem[--u]++; maxx = max(maxx, dem[u]); } if (n - maxx < maxx - 1) cout << NO ; else cout << YES ; return 0; }
#include <bits/stdc++.h> using namespace std; int a[10]; int main() { int n; while (~scanf( %d , &n)) { memset(a, 0, sizeof(a)); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); sort(a + 1, a + n + 1); printf( %d n , a[(1 + n) / 2]); } }
#include <bits/stdc++.h> using namespace std; const int MAX = 5005; int n; string strs[MAX]; string strp[MAX]; int anspos = 0; int strlens[MAX]; int vis[MAX]; int change[MAX][2]; string ansa, ansb; bool cal(int pos) { int len = strs[pos].size(); strlens[pos] = len; int l = -1, r = len; while (l < len && strs[pos][++l] == strp[pos][l]) ; while (r > 0 && strs[pos][--r] == strp[pos][r]) ; if (l > r) return 1; string cnt = strs[pos].substr(l, r - l + 1); string cnt2 = strp[pos].substr(l, r - l + 1); if (ansa.size() == 0 && ansb.size() == 0) { anspos = pos; ansa = cnt; ansb = cnt2; } if (cnt != ansa \|\| cnt2 != ansb) { return 0; } vis[pos] = 1; change[pos][0] = l, change[pos][1] = r; return 1; } bool myfinds(string &ps) { int nowcntlen = ps.size(); for (int i = 0; i < n; i++) { auto pos = strs[i].find(ps); if (pos != string::npos) { string rester = strs[i].substr(0, pos) + ansb + strs[i].substr(pos + ansb.size()); if (rester != strp[i]) { return 1; } } } return 0; } int addl, addr; string pre; bool check(int len) { addl = 0, addr = 0; while (change[anspos][0] > 0) { int flag = 1; for (int i = 0; i < n; i++) { if (i == anspos) continue; if (!vis[i]) continue; if (change[i][0] > 0 && strs[anspos][change[anspos][0] - 1] == strs[i][change[i][0] - 1]) { change[i][0]--; } else { flag = 0; break; } } if (flag) { change[anspos][0]--; addl++; } else { break; } } while (change[anspos][1] < len - 1) { int flag = 1; for (int i = 0; i < n; i++) { if (i == anspos) continue; if (!vis[i]) continue; if (change[i][1] < strlens[i] - 1 && strs[anspos][change[anspos][1] + 1] == strs[i][change[i][1] + 1]) { change[i][1]++; } else { flag = 0; break; } } if (flag) { change[anspos][1]++; addr++; } else { break; } } } int main() { std::ios::sync_with_stdio(false); cin >> n; ansa.clear(), ansb.clear(); for (int i = 0; i < n; i++) { cin >> strs[i]; } for (int i = 0; i < n; i++) { cin >> strp[i]; } for (int i = 0; i < n; i++) { if (!cal(i)) { cout << NO n ; return 0; } } int nowl = change[anspos][0], nowr = change[anspos][1]; check(strs[anspos].size()); if (addl) { ansa = strs[anspos].substr(nowl - addl, addl) + ansa; ansb = strs[anspos].substr(nowl - addl, addl) + ansb; } if (addr) { ansa += strs[anspos].substr(nowr + 1, addr); ansb += strs[anspos].substr(nowr + 1, addr); } if (myfinds(ansa)) { cout << NO n ; } else { cout << YES n ; cout << ansa << n << ansb << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > E[1010]; int deg[1010], vis[1010]; vector<pair<int, pair<int, int> > > ans; int N, P; int main() { int u, v, d; while (~scanf( %d%d , &N, &P)) { for (int i = 0; i < N; i++) deg[i] = 0, E[i].clear(); for (int i = 0; i < P; i++) scanf( %d%d%d , &u, &v, &d), u--, v--, deg[v]++, E[u].push_back(make_pair(v, d)); ans.clear(); for (int i = 0; i < N; i++) if (deg[i] == 0) { int dd = 1 << 30, u = i; for (u = i; E[u].size() > 0; u = E[u][0].first) dd = min(dd, E[u][0].second); if (dd < (1 << 30)) ans.push_back(make_pair(i, make_pair(u, dd))); } sort(ans.begin(), ans.end()); printf( %d n , ans.size()); for (int i = 0; i < ans.size(); i++) printf( %d %d %d n , ans[i].first + 1, ans[i].second.first + 1, ans[i].second.second); } return 0; }
#include <bits/stdc++.h> using namespace std; int a[55], b[55]; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %d , a + i); for (int i = 1; i <= m; i++) scanf( %d , b + i); long long ans = 1ll << 62; for (int x = 1; x <= n; x++) { long long maxv = -(1ll << 62); for (int y = 1; y <= n; y++) { if (x == y) continue; for (int z = 1; z <= m; z++) { maxv = max(maxv, (long long)a[y] * b[z]); } } ans = min(ans, maxv); } printf( %lld n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; const long long base = 1E9 + 7; const int N = 200100; const double ep = 0.0000001; int n; long long x[N], y[N]; long long cx = 0, cy = 0; void fail() { cout << NO ; exit(0); } bool symmetric(int i, int j) { long long x1 = cx - x[i] * n; long long y1 = cy - y[i] * n; long long x2 = cx - x[j] * n; long long y2 = cy - y[j] * n; return (x1 == -x2) && (y1 == -y2); } int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> x[i] >> y[i]; cx += x[i]; cy += y[i]; } if (n % 2 == 1) fail(); int j = 0; for (j = 1; j < n; j++) if (symmetric(0, j)) break; for (int i = 0; i < n; i++, j++) { if (j == n) j = 0; if (!symmetric(i, j)) fail(); } cout << YES ; return 0; }
#include <bits/stdc++.h> int compare(char s, char t, int l) { int i; for (i = 0; i < l; i++) { char a = toupper(s[i]), b = toupper(t[i]); if (a != b) return a - b; } return 0; } int main() { static char ss[100][100 + 1], cc[100 + 1], lucky[100]; static int ll[100]; int n, m, i, j; char c, c_, a, a_; scanf( %d , &n); for (i = 0; i < n; i++) { scanf( %s , ss[i]); ll[i] = strlen(ss[i]); } scanf( %s n%c , cc, &c), m = strlen(cc); c_ = toupper(c); a = c == a ? b : a ; a_ = toupper(a); for (j = 0; j < m; j++) for (i = 0; i < n; i++) if (m - j >= ll[i] && compare(cc + j, ss[i], ll[i]) == 0) memset(lucky + j, 1, ll[i]); for (j = 0; j < m; j++) if (lucky[j]) { if (tolower(cc[j]) == c) cc[j] = isupper(cc[j]) ? a_ : a; else cc[j] = isupper(cc[j]) ? c_ : c; } printf( %s n , cc); return 0; }
#include <bits/stdc++.h> using namespace std; char s[1100]; int main() { scanf( %s , s); for (int i = 0; s[i]; i++) printf( %c , s[i]); for (int i = strlen(s) - 1; i >= 0; i--) printf( %c , s[i]); return 0; }
#include <bits/stdc++.h> using namespace std; string p[105] = { }; int cts[105] = {0}; string pass; int main(int argc, char const argv[]) { int n, k; cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> p[i]; int xx = p[i].length(); cts[xx]++; } for (int i = 1; i <= 100; i++) { cts[i] += cts[i - 1]; } cin >> pass; int plen = pass.length(); int mans = cts[plen - 1]; mans += 5 (mans / k); mans++; cout << mans << ; int maxans = cts[plen] - 1; maxans += 5 * (maxans / k); maxans++; cout << maxans << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const double PI = 3.141592653589793238462643383279502884197169399375105820974944592307816406286; double d, h, v, e; int main() { scanf( %lf%lf%lf%lf , &d, &h, &v, &e); if (4 * v - d * d * PI * e <= 0) printf( NO n ); else printf( YES n%.12f n , (PI * h * d * d) / (4 * v - d * d * PI * e)); }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { int n, m; cin >> n >> m; int sum = 0; for (int i = 0; i < n; i++) { int a; cin >> a; sum += a; } if (sum == m) { cout << YES << endl; } else { cout << NO << endl; } } return 0; }
#include <bits/stdc++.h> using namespace std; const int N_ = 100500; int N, M; vector<int> gph[N_], rev[N_], bth[N_]; int outdg[N_], indg[N_]; bool visited[N_]; vector<int> ord; void dfs(int u) { visited[u] = true; for (int i = 0; i < gph[u].size(); i++) { int v = gph[u][i]; if (!visited[v]) dfs(v); } ord.push_back(u); } queue<int> que; int grp[N_], gn; int c1[N_], c2[N_]; void dfs2(int u) { visited[u] = true; ++c1[gn]; grp[u] = gn; for (int i = 0; i < bth[u].size(); i++) { int v = bth[u][i]; if (!visited[v]) dfs2(v); } } int cnt3; void dfs3(int u) { visited[u] = true; ++cnt3; for (int i = 0; i < rev[u].size(); i++) { int v = rev[u][i]; if (!visited[v]) dfs3(v); } } int main() { scanf( %d%d , &N, &M); for (int e = 1; e <= M; e++) { int u, v; scanf( %d%d , &u, &v); gph[u].push_back(v); rev[v].push_back(u); bth[u].push_back(v); bth[v].push_back(u); ++outdg[u]; ++indg[v]; } memset(visited, 0, sizeof visited); for (int i = 1; i <= N; i++) if (!visited[i]) dfs(i); memset(visited, 0, sizeof visited); for (int i = 1; i <= N; i++) if (!visited[i]) { ++gn; dfs2(i); } memset(visited, 0, sizeof visited); for (int i = ord.size(); i--;) { int u = ord[i]; if (!visited[u]) { cnt3 = 0; dfs3(u); if (cnt3 >= 2) c2[grp[u]] += 1; } } int ans = 0; for (int g = 1; g <= gn; g++) { c2[g] += c1[g] - 1; ans += min(c1[g], c2[g]); } printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long n, t; cin >> n >> t; string s1, s2; getline(cin, s1); getline(cin, s1, . ); getline(cin, s2); long a = -1, count = 0; for (int i = 0; i < s2.length(); i++) if (s2[i] >= 5 ) { a = i; break; } if (a == -1) { cout << s1 << . << s2; return 0; } if (a == 0) { int c = s1.length() - 1; while (s1[c] == 9 && c >= 0) c--; if (c == -1) { cout << 1 ; for (int i = 0; i < s1.length(); i++) cout << 0 ; return 0; } s1[c]++; for (c++; c < s1.length(); c++) s1[c] = 0 ; cout << s1; return 0; } long b = a - 1; while (s2[b] == 4 && b >= 0 && b >= a - t + 1) { b--; } if (b == -1) { int c = s1.length() - 1; while (s1[c] == 9 && c >= 0) c--; if (c == -1) { cout << 1 ; for (int i = 0; i < s1.length(); i++) cout << 0 ; return 0; } s1[c]++; for (c++; c < s1.length(); c++) s1[c] = 0 ; cout << s1; return 0; } else { s2[b]++; cout << s1 << . ; for (int i = 0; i <= b; i++) cout << s2[i]; return 0; } return 0; }
#include <bits/stdc++.h> using namespace std; const int INF = 400000; const double EPS = 1e-9; int mods(int a, int b) { return (b + (a % b)) % b; } int n, m, k, x, ans, p[105], s[105], strongest[105]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m >> k; for (int i = 0; i < n; i++) cin >> p[i]; for (int i = 0; i < n; i++) { cin >> s[i]; strongest[s[i]] = max(strongest[s[i]], p[i]); } for (int i = 0; i < k; i++) { cin >> x; if (strongest[s[x - 1]] != p[x - 1]) ans++; } cout << ans << n ; return 0; }
#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> istream& operator>>(istream& in, pair<T1, T2>& a) { in >> a.first >> a.second; return in; } template <typename T1, typename T2> ostream& operator<<(ostream& out, pair<T1, T2> a) { out << a.first << << a.second; return out; } template <typename T, typename T1> T amax(T& a, T1 b) { if (b > a) a = b; return a; } template <typename T, typename T1> T amin(T& a, T1 b) { if (b < a) a = b; return a; } const long long INF = 1e18; const int32_t M = 1e9 + 7; const int32_t MM = 998244353; const int N = 3e5 + 5; struct node { node* next[2] = {0}; } ns[19 * N]; int cnt = 1; node* create() { if (cnt < 19 * N) return ns + cnt++; else return new node(); } void insert(int x) { node* tmp = ns; for (int i = 19; i >= 0; i--) { int k = x >> i & 1; if (!tmp->next[k]) tmp->next[k] = create(); tmp = tmp->next[k]; } } int query(int x) { node* tmp = ns; int ans = 0; for (int i = 19; i >= 0; i--) { int k = x >> i & 1; if (tmp->next[k]) { tmp = tmp->next[k]; } else { ans += (1 << i); tmp = tmp->next[!k]; } } return ans; } void solve() { set<int> s; for (int i = 0; i < 1 << 19; i++) { s.insert(i); } int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { int x; cin >> x; s.erase(x); } for (int x : s) { insert(x); } int prev = 0; for (int i = 0; i < m; i++) { int q; cin >> q; prev ^= q; cout << query(prev) << n ; } } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t = 1; while (t--) solve(); return 0; }
#include <bits/stdc++.h> using namespace std; using bigint = long long int; using vi = vector<int>; using vll = vector<long long int>; int cnt[200001]; int main() { int N, A; cin >> N >> A; for (int i = 0; i < N; i++) { int x; cin >> x; cnt[x]++; } int ans = 0; if (cnt[A] == 0) { ans++; cnt[A] = 1; } int left = 0, right = 0; for (int i = 1; i < A; i++) left += cnt[i]; for (int i = A + 1; i < 100001; i++) right += cnt[i]; if (left == right) { cout << ans << n ; return 0; } if (left > right) { if (right + cnt[A] - 1 >= left) cout << ans << n ; else cout << ans + left - (right + cnt[A] - 1) << n ; } else if (right > left) { if (left + cnt[A] - 1 >= right - 1) cout << ans << n ; else cout << ans + (right - 1) - (left + cnt[A] - 1) << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int H, W, K; cin >> H >> W >> K; vector<string> photo(H); for (int h = 0; h < int(H); ++h) cin >> photo[h]; vector<vector<char> > star(H, vector<char>(W, 0)); for (int r = 1; r < int(H - 1); ++r) for (int c = 1; c < int(W - 1); ++c) { if (photo[r][c] == 1 && photo[r - 1][c] == 1 && photo[r][c - 1] == 1 && photo[r + 1][c] == 1 && photo[r][c + 1] == 1 ) { star[r][c] = 1; } } long long res = 0; for (int c1 = 0; c1 < int(W); ++c1) { vector<int> row_stars(H, 0); for (int c2 = c1 + 3; c2 <= int(W); ++c2) { for (int r = 0; r < int(H); ++r) row_stars[r] += star[r][c2 - 2]; int r1 = 0, stars = 0; for (int r2 = r1 + 3; r2 <= int(H); ++r2) { stars += row_stars[r2 - 2]; while (stars - row_stars[r1 + 1] >= K) { stars -= row_stars[r1 + 1]; ++r1; } if (stars >= K) res += r1 + 1; } } } cout << res << endl; }
#include <bits/stdc++.h> using namespace std; int n, m, a, b, ans[400]; string s[400]; long long calc(int pos, int res) { for (int i = res + 1; i <= 10; i++) { for (int j = 0; j < 1 << i; j++) { string t = ; for (int k = 0; k < i; k++) t = t + (char)(((j >> k) & 1) + 0 ); if (s[pos].find(t) == -1) { ans[pos] = i - 1; return i - 1; } } } } int main() { ios_base::sync_with_stdio(false); cin >> n; for (int i = 1; i <= n; i++) cin >> s[i]; cin >> m; for (int i = 1; i <= m; i++) { cin >> a >> b; s[n + i] = s[a] + s[b]; if (s[n + i].length() > 1000) s[n + i] = s[n + i].substr(0, 500) + s[n + i].substr(s[n + i].length() - 500, 500); cout << calc(n + i, max(ans[a], ans[b])) << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; long long dp[5010][5010]; char s[5010], z[5010]; long long solve() { int M = strlen(s), N = strlen(z); for (int i = 0; i <= M; i++) dp[i][0] = 0; for (int i = 0; i <= N; i++) dp[0][i] = 0; for (int i = 1; i <= M; i++) for (int j = 1; j <= N; j++) { dp[i][j] = dp[i][j - 1]; if (s[i - 1] == z[j - 1]) dp[i][j] = (dp[i][j] + dp[i - 1][j - 1] + 1) % mod; } long long ans = 0; for (int i = 0; i <= M; i++) ans = (ans + dp[i][N]) % mod; return ans; } int main() { scanf( %s %s , s, z); int ans = solve(); printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int a[] = {0, 1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51, 1, 2, 1, 14, 1, 2, 2, 14, 1, 6, 1, 4, 2, 2, 1, 52, 2, 5, 1, 5, 1, 15, 2, 13, 2, 2, 1, 13, 1, 2, 4, 267, 1, 4, 1, 5, 1, 4, 1, 50, 1, 2, 3, 4, 1, 6, 1, 52, 15, 2, 1, 15, 1, 2, 1, 12, 1, 10, 1, 4, 2}; int main() { int n; cin >> n; cout << a[n] << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int Max_n = 2e5 + 10; const int Max_m = 4e5 + 10; int f[Max_n]; struct A { long long val; int pos; bool operator<(const A &a) const { return val < a.val; } } a[Max_n]; struct Edge { int u, v; long long cost; bool operator<(const Edge &edge) const { return cost < edge.cost; } } edge[Max_m * 2]; int Find(int v) { if (f[v] == v) return v; return f[v] = Find(f[v]); } bool Merge(int m, int n) { int t1 = Find(m); int t2 = Find(n); if (t1 != t2) { f[t1] = t2; return true; } return false; } int main() { int n, m; scanf( %d%d , &n, &m); int cnt = 0; for (int i = 1; i <= n; i++) f[i] = i; for (int i = 1; i <= n; i++) { scanf( %lld , &a[i].val); a[i].pos = i; } sort(a + 1, a + n + 1); for (int i = 2; i <= n; i++) { edge[cnt].u = a[1].pos; edge[cnt].v = a[i].pos; edge[cnt++].cost = a[1].val + a[i].val; edge[cnt].u = a[i].pos; edge[cnt].v = a[1].pos; edge[cnt++].cost = a[1].val + a[i].val; } for (int i = 1; i <= m; i++) { int u, v; long long cost; scanf( %d%d%lld , &u, &v, &cost); edge[cnt].u = u; edge[cnt].v = v; edge[cnt++].cost = cost; edge[cnt].u = v; edge[cnt].v = u; edge[cnt++].cost = cost; } sort(edge, edge + cnt); long long ans = 0; int edgeCnt = 0; for (int i = 0; i < cnt; i++) { if (Merge(edge[i].u, edge[i].v)) { ans += edge[i].cost; edgeCnt++; } if (edgeCnt == n - 1) break; } printf( %lld n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int defence[4]; int atack[4]; int main() { for (int i = 0; i < 4; i++) cin >> defence[i] >> atack[i]; int maximum = max(defence[0], defence[1]); maximum = max(maximum, atack[0]); maximum = max(maximum, atack[1]); if (defence[0] > atack[2] && defence[0] > atack[3] && atack[1] > defence[2] && atack[1] > defence[3]) { cout << Team 1 ; return 0; } if (defence[1] > atack[2] && defence[1] > atack[3] && atack[0] > defence[2] && atack[0] > defence[3]) { cout << Team 1 ; return 0; } if ((defence[0] + atack[1]) < (defence[1] + atack[0])) { if (defence[1] < atack[3] && atack[0] < defence[2]) { cout << Team 2 ; return 0; } else if (defence[1] < atack[2] && atack[0] < defence[3]) { cout << Team 2 ; return 0; } } else { if (defence[0] < atack[3] && atack[1] < defence[2]) { cout << Team 2 ; return 0; } else if (defence[0] < atack[2] && atack[1] < defence[3]) { cout << Team 2 ; return 0; } } cout << Draw ; return 0; }
#include <bits/stdc++.h> using namespace std; int n, m, k, q; int x[411111], y[411111], a[411111], b[411111], aa[411111], bb[411111]; int ans[411111]; int mi[2000222]; void init(int pos, int l, int r) { mi[pos] = -1; if (l == r) return; init(pos + pos, l, (l + r) / 2); init(pos + pos + 1, (l + r) / 2 + 1, r); } void mod(int pos, int l, int r, int x, int v) { if (x < l \|\| x > r) return; if (l == r) { mi[pos] = v; return; } mod(pos + pos, l, (l + r) / 2, x, v); mod(pos + pos + 1, (l + r) / 2 + 1, r, x, v); mi[pos] = min(mi[pos + pos], mi[pos + pos + 1]); } int fin(int pos, int l, int r, int ll, int rr) { ll = max(ll, l); rr = min(rr, r); if (ll > rr) return 1e9; if (l == ll && r == rr) return mi[pos]; return min(fin(pos + pos, l, (l + r) / 2, ll, rr), fin(pos + pos + 1, (l + r) / 2 + 1, r, ll, rr)); } void solve() { vector<pair<int, int> > ev; for (int i = 0; i < k; i++) { ev.push_back(make_pair(y[i], -(i + 1))); } for (int i = 0; i < q; i++) { ev.push_back(make_pair(bb[i], i + 1)); } sort(ev.begin(), ev.end()); init(1, 0, n - 1); for (int i = 0; i < ev.size(); i++) { int id = ev[i].second; if (id < 0) { id = (-id) - 1; mod(1, 0, n - 1, x[id], y[id]); } else { id = id - 1; if (fin(1, 0, n - 1, a[id], aa[id]) >= b[id]) ans[id] = 1; } } } int main() { cin >> n >> m >> k >> q; for (int i = 0; i < k; i++) { scanf( %d%d , &x[i], &y[i]); x[i]--; y[i]--; } for (int i = 0; i < q; i++) { scanf( %d%d%d%d , &a[i], &b[i], &aa[i], &bb[i]); a[i]--; b[i]--; aa[i]--; bb[i]--; ans[i] = 0; } solve(); for (int i = 0; i < k; i++) swap(x[i], y[i]); for (int i = 0; i < q; i++) { swap(a[i], b[i]); swap(aa[i], bb[i]); } swap(n, m); solve(); for (int i = 0; i < q; i++) if (ans[i]) puts( YES ); else puts( NO ); return 0; }
#include <bits/stdc++.h> using namespace std; int n; int ans[400] = { 1, 9, 245, 126565, 54326037, 321837880, 323252721, 754868154, 328083248, 838314395, 220816781, 893672292, 166441208, 251255697, 114256285, 118775501, 482714697, 11784725, 460862131, 550384565, 106742050, 425241115, 626692854, 674266678, 320014275, 345949512, 527320049, 897822749, 137190263, 491039182, 810384961, 482023334, 658099864, 886790989, 845381174, 371433224, 278969124, 420088324, 696766322, 388302635, 141033366, 46387851, 932125021, 278342766, 371131134, 922501918, 110778457, 506223573, 806353719, 391845991, 923507761, 780307355, 109951115, 830090230, 605558495, 344686604, 988110893, 944684429, 715019947, 799898820, 384672708, 907325090, 758952329, 550672104, 368337206, 394915145, 401744167, 923781939, 831857516, 407845661, 329267374, 927004007, 891609656, 897919613, 481297880, 737337940, 651873737, 287246681, 973133651, 679864988, 784719328, 820504764, 875613823, 806512665, 164851642, 500228957, 951814419, 447763649, 273141670, 979349615, 964027956, 809510400, 276634497, 116631976, 426739449, 175282420, 885948162, 62270880, 974395255, 675165056, 759589968, 837957573, 931897605, 152352780, 585420109, 1772087, 333401718, 898833639, 745874265, 786209423, 691982338, 498790927, 473374639, 274302623, 971280670, 241671319, 13070005, 302088807, 550276351, 436592588, 631667314, 548656698, 730626984, 146295220, 674398632, 400383348, 454138904, 786220712, 118620797, 233440672, 217349271, 274853536, 310607544, 105221205, 769566615, 853585061, 800665807, 695377419, 924327065, 388199705, 551624811, 721435546, 501720515, 308465454, 825369234, 396065729, 451899519, 295058424, 142088952, 473485086, 378771634, 734511215, 462404399, 959198328, 337668263, 794122911, 38911400, 951992982, 472696081, 373904752, 105884826, 630251717, 28980684, 845136347, 353665773, 691661192, 19922354, 231463797, 757917231, 242739918, 979036950, 713722080, 234689388, 2243164, 209872853, 240808787, 539523346, 425797848, 913772061, 224613100, 421742777, 222232478, 92712941, 215137570, 949901408, 274827432, 15162482, 593145989, 274574232, 239282092, 762720192, 804146934, 500629424, 565985054, 81127381, 671811155, 655565571, 890331075, 237994348, 743647404, 667160634, 713914299, 668506729, 741341289, 277636808, 762781382, 14272789, 902864131, 567443405, 149113383, 648844381, 825489976, 933016723, 192288078, 734493315, 240985733, 861817693, 762711459, 525904609, 532463481, 377133989, 620711079, 772561562, 980733194, 227599811, 162774370, 209512798, 787116594, 3509258, 748795368, 378035466, 612938915, 802091952, 857679599, 481748937, 493370392, 358420805, 48301629, 412001241, 463126722, 509578422, 967799131, 994766554, 687287243, 863623583, 771554899, 690911527, 855314994, 923686429, 246862514, 192479791, 133487041, 703444043, 295281758, 801816257, 920762934, 749306433, 973004841, 848644684, 560026478, 952127278, 616654635, 839390326, 975154012, 409583672, 635350249, 343228425, 335331602, 223826406, 952341037, 589677800, 249747234, 555694261, 137143500, 628190328, 461598392, 431912756, 29349807, 759199489, 783281228, 781971312, 915823407, 388508707, 718062705, 27424111, 309999451, 963383322, 831185229, 132910888, 347028136, 850484840, 223055285, 142335980, 144754000, 772005560, 81796039, 167696020, 79454283, 172772542, 201056991, 484957644, 716630285, 763194701, 211505841, 903448791, 926964672, 257752668, 482951716, 411539070, 620249847, 592476107, 170473128, 814662613, 898000271, 57354872, 361106091, 488697643, 889007954, 138725767, 684860983, 36248116, 304610143, 137633385, 413715776, 99010024, 779653665, 100387568, 286328069, 564731826, 621740468, 943513219, 506666491, 249987886, 553719884, 769853086, 337485319, 702455584, 809637762, 755400257, 892290368, 502180086, 364275817, 118162370, 873374339, 261271695, 970132574, 744105500, 434447173, 117975095, 383088393, 625447969, 180281249, 545367713, 133236931, 360175662, 148087453, 806871297, 498529036, 886076476, 65645000, 465138299, 967109895, 331362616, 472283705, 796894900, 199697765, 503759892, 472807906, 187586706, 941198065, 782234442, 57693411, 18678611, 82626204, 395317191, 570588915, 152519440, 449852456, 63696518, 763741345, 878748386, 494317541, 444782633, 93316211, 929164666, 529288371, 165769871, 730546850, 955877127, 994202767, 492009567, 275683011, 415902127, 95725776, 718047399, 786963365, 73091278, 986172399, 174591541, 913259286}; int main() { scanf( %d , &n); printf( %d , ans[n - 1]); return 0; }
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0; bool t = false; char ch = getchar(); while ((ch < 0 \|\| ch > 9 ) && ch != - ) ch = getchar(); if (ch == - ) t = true, ch = getchar(); while (ch <= 9 && ch >= 0 ) x = x * 10 + ch - 48, ch = getchar(); return t ? -x : x; } int n, Q, lans; struct Line { int v, next, w; } e[100100 << 1]; int h[100100], cnt = 1; inline void Add(int u, int v, int w) { e[cnt] = (Line){v, h[u], w}; h[u] = cnt++; } struct Tree { int rt, p[19][100100], dfn[100100], low[100100], ln[100100], md[100100], dep[100100], tim; void dfs(int u, int ff) { p[0][u] = ff; ln[dfn[u] = ++tim] = u; md[u] = dep[u]; for (int i = 1; i < 19; ++i) p[i][u] = p[i - 1][p[i - 1][u]]; for (int i = h[u]; i; i = e[i].next) { int v = e[i].v; if (v == ff) continue; dep[v] = dep[u] + e[i].w; dfs(v, u); md[u] = max(md[u], md[v]); } low[u] = tim; } pair<int, int> mx[100100 << 2]; int tag[100100 << 2]; void pushup(int now) { mx[now] = max(mx[(now << 1)], mx[(now << 1 \| 1)]); } void Build(int now, int l, int r) { if (l == r) { mx[now] = make_pair(dep[ln[l]], ln[l]); return; } int mid = (l + r) >> 1; Build((now << 1), l, mid); Build((now << 1 \| 1), mid + 1, r); pushup(now); } void Modify(int now, int l, int r, int L, int R, int w) { if (L <= l && r <= R) { mx[now].first += w; tag[now] += w; return; } int mid = (l + r) >> 1; if (L <= mid) Modify((now << 1), l, mid, L, R, w); if (R > mid) Modify((now << 1 \| 1), mid + 1, r, L, R, w); pushup(now); mx[now].first += tag[now]; } int ans[100100], vis[100100]; void pre(int _rt) { rt = _rt; dfs(rt, 0); Build(1, 1, n); for (int i = 2; i <= n; ++i) { ans[i] = ans[i - 1] + mx[1].first; for (int j = mx[1].second; j && !vis[j]; j = p[0][j]) vis[j] = i, Modify(1, 1, n, dfn[j], low[j], dep[p[0][j]] - dep[j]); } } int Solve(int x, int y) { y = min(y, n); if (vis[x] <= y) return ans[y]; int u = x; for (int i = 18; ~i; --i) if (vis[p[i][x]] > y) x = p[i][x]; x = p[0][x]; return ans[y] + md[u] - dep[x] - min(dep[x], min(ans[y] - ans[y - 1], md[x] - dep[x])); } } T1, T2; int mx, rt; void dfs(int u, int ff, int dep) { if (dep > mx) mx = dep, rt = u; for (int i = h[u]; i; i = e[i].next) if (e[i].v != ff) dfs(e[i].v, u, dep + e[i].w); } int main() { n = read(); Q = read(); for (int i = 1, u, v, w; i < n; ++i) u = read(), v = read(), w = read(), Add(u, v, w), Add(v, u, w); mx = 0; dfs(1, 0, 0); T1.pre(rt); while (Q--) { int u = (read() + lans - 1) % n + 1, v = (read() + lans - 1) % n + 1; printf( %d n , lans = T1.Solve(u, v << 1)); } return 0; }
#include <bits/stdc++.h> using namespace std; const long long int inf = 1e9 + 7; const long long int inf2 = inf * inf; priority_queue<long long int, vector<long long int>, greater<long long int>> mnheap; priority_queue<long long int> mxheap; long long int gcd(long long int x, long long int y) { if (x == 0) return y; return gcd(y % x, x); } int is_prime(long long int x) { if (x < 2) return 0; for (long long int i = 2; i * i <= x; i++) { if (x % i == 0) return 0; } return 1; } inline long long int modpw(long long int x, long long int y, long long int z) { long long int res = 1; x = x % z; while (y) { if (y & 1) res = (res * x) % z; x = (x * x) % z; y /= 2; } return res; } inline long long int modinv(long long int x, long long int z) { return modpw(x, z - 2, z); } long long int lcm(long long int x, long long int y) { return (x * y) / gcd(x, y); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, m; cin >> n >> m; int dp[n][m]; string st[n]; for (int i = 0; i < n; i++) cin >> st[i]; int cnt = 0; for (int i = 0; i < n - 1; i++) { if (st[i][m - 1] == R ) cnt++; } for (int i = 0; i < m - 1; i++) { if (st[n - 1][i] == D ) cnt++; } cout << cnt << endl; } }
#include <bits/stdc++.h> int main() { char s[150]; int o = 1, z = 0, a[150]; scanf( %s , &s); for (int i = 0; i < strlen(s); i++) { a[i] = s[i] - 0 ; } for (int i = 0; i < strlen(s) - 1; i++) { if (a[i] == a[i + 1]) { o++; if (o == 7) { printf( YES n ); return 0; } } else o = 1; } printf( NO n ); return 0; }
#include <bits/stdc++.h> using namespace std; const int mxn = 1e5 + 5; int n, a[mxn], c[mxn]; bool vis[mxn]; int main() { scanf( %d , &n); for (int(i) = (int)(1); (i) <= (int)(n); ++(i)) scanf( %d , a + i); int cnt = 0; for (int(i) = (int)(n); (i) >= (int)(1); --(i)) { c[i] = c[i + 1] + (vis[a[i]] == 0); vis[a[i]] = 1; } long long ans = 0; memset(vis, 0, sizeof(vis)); for (int(i) = (int)(1); (i) <= (int)(n); ++(i)) if (!vis[a[i]]) { vis[a[i]] = 1; ans += c[i + 1]; } return 0 * printf( %lld n , ans); }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 7; int a[N], n, q; long long sum[N << 2][11], mul[11] = {1}; long long SUM[11], LA[11]; int lazy[N << 2][11]; void pushup(int rt) { for (int i = 0; i < 10; ++i) { sum[rt][i] = sum[rt << 1][i] + sum[rt << 1 \| 1][i]; } } void pushdown(int rt) { for (int i = 0; i < 10; ++i) SUM[i] = sum[rt << 1][i], LA[i] = lazy[rt << 1][i]; for (int i = 0; i < 10; ++i) { int u = i, v = lazy[rt][i]; if (u == v) continue; for (int j = 0; j < 10; ++j) { if (lazy[rt << 1][j] == u) { LA[j] = lazy[rt][i]; } } SUM[lazy[rt][i]] += sum[rt << 1][i]; SUM[i] -= sum[rt << 1][i]; } for (int i = 0; i < 10; ++i) sum[rt << 1][i] = SUM[i], lazy[rt << 1][i] = LA[i]; for (int i = 0; i < 10; ++i) SUM[i] = sum[rt << 1 \| 1][i], LA[i] = lazy[rt << 1 \| 1][i]; for (int i = 0; i < 10; ++i) { int u = i, v = lazy[rt][i]; if (u == v) continue; for (int j = 0; j < 10; ++j) { if (lazy[rt << 1 \| 1][j] == u) { LA[j] = lazy[rt][i]; } } SUM[lazy[rt][i]] += sum[rt << 1 \| 1][i]; SUM[i] -= sum[rt << 1 \| 1][i]; } for (int i = 0; i < 10; ++i) sum[rt << 1 \| 1][i] = SUM[i], lazy[rt << 1 \| 1][i] = LA[i]; for (int i = 0; i < 10; ++i) lazy[rt][i] = i; } void build(int l, int r, int rt) { for (int i = 0; i < 10; ++i) lazy[rt][i] = i; if (l == r) { int x = a[l], index = 0; while (x) { int y = x % 10; x /= 10; sum[rt][y] += mul[index]; index++; } return; } int mid = (l + r) >> 1; build(l, mid, rt << 1); build(mid + 1, r, rt << 1 \| 1); pushup(rt); } void update(int l, int r, int rt, int L, int R, int x, int y) { if (L <= l && r <= R) { for (int j = 0; j < 10; ++j) { if (lazy[rt][j] == x) { lazy[rt][j] = y; sum[rt][y] += sum[rt][x]; sum[rt][x] = 0; } } return; } pushdown(rt); int mid = (l + r) >> 1; if (L <= mid) update(l, mid, rt << 1, L, R, x, y); if (R > mid) update(mid + 1, r, rt << 1 \| 1, L, R, x, y); pushup(rt); } long long query(int l, int r, int rt, int L, int R) { if (L <= l && r <= R) { long long ret = 0; for (int i = 0; i < 10; ++i) ret += sum[rt][i] * i; return ret; } pushdown(rt); int mid = (l + r) >> 1; long long ret = 0; if (L <= mid) ret += query(l, mid, rt << 1, L, R); if (R > mid) ret += query(mid + 1, r, rt << 1 \| 1, L, R); return ret; } int main() { for (int i = 1; i < 11; ++i) mul[i] = mul[i - 1] * 10; scanf( %d%d , &n, &q); for (int i = 1; i <= n; ++i) { scanf( %d , &a[i]); } build(1, n, 1); while (q--) { int op, L, R, x, y; scanf( %d , &op); if (op == 1) { scanf( %d%d%d%d , &L, &R, &x, &y); if (x == y) continue; update(1, n, 1, L, R, x, y); } else { scanf( %d%d , &L, &R); printf( %lld n , query(1, n, 1, L, R)); } } return 0; }
#include <bits/stdc++.h> using namespace std; const long long INF = 1ll << 32; const int mod = 1e9 + 7; inline int add(int x, int y) { x += y; if (x >= mod) return x - mod; return x; } inline int sub(int x, int y) { x -= y; if (x < 0) return x + mod; return x; } inline int mul(int x, int y) { return (x * 1ll * y) % mod; } inline int power(int x, int y) { int ans = 1; while (y) { if (y & 1) ans = mul(ans, x); x = mul(x, x); y >>= 1; } return ans; } inline int inv(int x) { return power(x, mod - 2); } const long long FACTORIAL_SIZE = 1.1e6; long long fact[FACTORIAL_SIZE], ifact[FACTORIAL_SIZE]; void gen_factorial(long long n) { fact[0] = fact[1] = ifact[0] = ifact[1] = 1; for (long long i = 2; i <= n; i++) { fact[i] = (i * fact[i - 1]) % mod; } ifact[n] = inv(fact[n]); for (long long i = n - 1; i >= 2; i--) { ifact[i] = ((i + 1) * ifact[i + 1]) % mod; } } long long nck(long long n, long long k) { long long den = (ifact[k] * ifact[n - k]) % mod; return (den * fact[n]) % mod; } const int N = 300000; long long f(string s) { if (s == Tetrahedron ) return 4; if (s == Cube ) return 6; if (s == Octahedron ) return 8; if (s == Dodecahedron ) return 12; if (s == Icosahedron ) return 20; } void solve() { long long n; cin >> n; long long ans = 0; for (long long i = 0; i < n; i++) { string s; cin >> s; ans += f(s); } cout << ans << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long tc = 1; int i = 1; while (tc--) { solve(); i++; } return 0; }
#include <bits/stdc++.h> using namespace std; long long n; bool isvalid(long long x) { if (x >= 0 && x <= n - 1) return true; else return false; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; vector<long long> a(n); for (long long i = 0; i < n; i++) { cin >> a[i]; } sort(a.begin(), a.end()); vector<long long> b(n); b[0] = a[n - 1]; long long i = n - 2; long long j = n - 3; long long right = 1; long long left = n - 1; while (true) { if (isvalid(i)) { b[right] = a[i]; right++; i -= 2; } if (isvalid(j)) { b[left] = a[j]; left--; j -= 2; } if (isvalid(i) == false && isvalid(j) == false) break; } bool done = true; if (b[0] >= b[1] + b[n - 1]) { done = false; } if (b[n - 1] >= b[n - 2] + b[0]) { done = false; } for (long long i = 1; i <= n - 2; i++) { if (b[i] >= b[i - 1] + b[i + 1]) { done = false; break; } } if (!done) { cout << NO << n ; } else { cout << YES << n ; for (long long i = 0; i < n; i++) { cout << b[i] << ; } } return 0; }
#include <bits/stdc++.h> using namespace std; int ans; int main() { int d, n, u, i, prev; cin >> d >> n; for (i = 0; i < n; i++) { cin >> u; if (i and prev != 1) ans += d - prev + 1; prev = u + 1; if (prev > d) prev -= d; } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { int n; cin >> n; int ans = 1e9; for (int i = 1; i * i <= n; i++) { ans = min(ans, i - 1 + (n - i + i - 1) / i); } cout << ans << n ; } return 0; }
#include <bits/stdc++.h> const int n = 7; const int msiz = 1 << n; const int mod = 1000000007; int a[n]; int ans[msiz]; long long int tans[msiz]; struct matrix { long long int cont[msiz][msiz]; matrix operator(const matrix& r) const { matrix p; int i, j, k; for (i = 0; i < msiz; i++) { for (j = 0; j <= i; j++) { p.cont[i][j] = 0; for (k = 0; k < msiz; k++) { p.cont[i][j] += cont[i][k] r.cont[k][j]; p.cont[i][j] %= mod; } } } for (i = 0; i < msiz; i++) { for (j = i + 1; j < msiz; j++) { p.cont[i][j] = p.cont[j][i]; } } return p; } }; matrix q[4]; matrix pwr(int x) { matrix res; if (x == 0) { int i, j; for (i = 0; i < msiz; i++) { for (j = 0; j < msiz; j++) { if (i == j) res.cont[i][j] = 1; else res.cont[i][j] = 0; } } return res; } res = pwr(x / 4); res = res * res; res = res * res; if (x % 4 != 0) res = res * q[x % 4]; return res; } int main() { int i, j, k, l; matrix p; for (i = 0; i < n; i++) { scanf( %d , &a[i]); } for (i = 0; i < msiz; i++) { ans[i] = 0; } ans[0] = 1; for (i = n; i > 0; i--) { for (j = 0; j < msiz; j++) { for (k = 0; k < msiz; k++) { p.cont[j][k] = 0; } } for (j = 0; j < (1 << i); j++) { for (k = 0; k < (1 << i); k++) { for (l = 0; l < (1 << (i - 1)); l++) { if ((j \| k \| l \| (l << 1)) == (1 << i) - 1) p.cont[j][k]++; } } } q[1] = p; q[2] = p * p; q[3] = q[2] * p; p = pwr(a[i - 1]); for (j = 0; j < msiz; j++) { tans[j] = 0; for (k = 0; k < msiz; k++) { tans[j] += ans[k] * p.cont[j][k]; tans[j] %= mod; } } for (j = 0; j < msiz; j++) ans[j] = tans[j]; } printf( %d , ans[0]); }
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int max_n = 1e5 + 5; string q[max_n]; int dig[10][2]; int main() { string s; cin >> s; int n; scanf( %d , &n); for (int i = 1; i <= n; i++) cin >> q[i]; for (int i = 0; i <= 9; i++) { dig[i][0] = i; dig[i][1] = 10; } for (int i = n; i >= 1; i--) { int d = q[i][0] - 0 ; int len = q[i].length(); int sum = 0, pw = 1; for (int j = 3; j < len; j++) { int k = q[i][j] - 0 ; sum = (1LL * sum * dig[k][1] % mod + dig[k][0]) % mod; pw = 1LL * pw * dig[k][1] % mod; } dig[d][0] = sum; dig[d][1] = pw; } int len = s.length(); int ans = 0; for (int i = 0; i < len; i++) { int d = s[i] - 0 ; ans = (1LL * ans * dig[d][1] % mod + dig[d][0]) % mod; } printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; const int inf = 2000000000; int H, T, R, m, hi[205], ti[205], n, hj[205], tj[205], h[205][205], t[3000000][3], w, d[205][205]; void adde(int x, int y, int X, int Y) { t[w][0] = X; t[w][1] = Y; t[w][2] = h[x][y]; h[x][y] = w++; } struct node { int x, y, d; bool operator<(const node &t) const { return d > t.d; } } temp; priority_queue<node> q; bool dij() { for (int i = 0; i <= 200; i++) for (int j = 0; j <= 200; j++) d[i][j] = inf; d[H][T] = 0; temp.x = H; temp.y = T; temp.d = d[H][T]; q.push(temp); while (!q.empty()) { temp = q.top(); q.pop(); int x = temp.x, y = temp.y; if (temp.d == d[x][y]) { for (int i = h[x][y]; i != -1; i = t[i][2]) { int X = t[i][0], Y = t[i][1]; if (d[x][y] + 1 < d[X][Y]) { d[X][Y] = d[x][y] + 1; temp.x = X; temp.y = Y; temp.d = d[X][Y]; q.push(temp); } } } } return d[0][0] != inf; } bool spfa() { int q[21010][2], rq, wq, g[205][205]; bool b[205][205]; for (int i = 0; i <= 200; i++) for (int j = 0; j <= 200; j++) d[i][j] = 0; rq = wq = 0; q[wq][0] = H; q[wq][1] = T; wq++; memset(g, 0, sizeof(g)); g[H][T]++; memset(b, true, sizeof(b)); b[H][T] = false; while (wq--) { int x = q[wq][0], y = q[wq][1]; b[x][y] = true; for (int i = h[x][y]; i != -1; i = t[i][2]) { int X = t[i][0], Y = t[i][1]; if (d[x][y] + 1 > d[X][Y]) { d[X][Y] = d[x][y] + 1; if (b[X][Y]) { g[X][Y]++; if (g[X][Y] > 21000) return true; b[X][Y] = false; q[wq][0] = X; q[wq][1] = Y; wq++; } } } } return false; } int main() { scanf( %d%d%d , &H, &T, &R); scanf( %d , &m); for (int i = 1; i <= m; i++) { scanf( %d%d , &hi[i], &ti[i]); hi[i] -= i; } scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d%d , &hj[i], &tj[i]); tj[i] -= i; } memset(h, -1, sizeof(h)); w = 0; for (int i = 0; i <= R; i++) { for (int j = 0; i + j <= R; j++) { for (int k = 1; (k <= m) && (k <= i); k++) if (i + hi[k] + j + ti[k] > R) adde(i, j, 200, 200); else adde(i, j, i + hi[k], j + ti[k]); for (int k = 1; (k <= n) && (k <= j); k++) if (i + hj[k] + j + tj[k] > R) adde(i, j, 200, 200); else adde(i, j, i + hj[k], j + tj[k]); } } if (dij()) printf( Ivan n%d n , d[0][0]); else if (spfa()) printf( Draw n ); else printf( Zmey n%d n , d[200][200]); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 101000; int n, z[N], a[N], b[N]; set<pair<int, int> > Set; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); } for (int i = 0; i < n; i++) { scanf( %d , &b[i]); } vector<int> ans; for (int i = 0; i < n; i++) { z[i] = a[i] - b[i]; if (i) z[i] += z[i - 1]; Set.insert(make_pair(z[i], i)); } int line = 0; for (int i = 0; i < n; i++) { if (Set.begin()->first >= line) { ans.push_back(i + 1); } line = z[i]; } line = 0; Set.clear(); for (int i = n - 1; i >= 0; i--) { z[i] = a[i] - b[(i + n - 1) % n]; if (i != n - 1) z[i] += z[i + 1]; Set.insert(make_pair(z[i], i)); } for (int i = n - 1; i >= 0; i--) { if (Set.begin()->first >= line) { ans.push_back(i + 1); } line = z[i]; } sort(ans.begin(), ans.end()); ans.erase(unique(ans.begin(), ans.end()), ans.end()); printf( %d n , (int)ans.size()); for (__typeof((ans).begin()) it = (ans).begin(); it != (ans).end(); it++) { printf( %d , *it); } puts( ); return 0; }
#include <bits/stdc++.h> using namespace std; int n, a, r, m; vector<int> h; vector<long long> pref; long long cost(long long goal) { long long indexl = distance(h.begin(), lower_bound(h.begin(), h.end(), goal)); long long cost_a = 0; if (indexl > 0) { cost_a = goal * (indexl)-pref[indexl - 1]; } long long indexh = distance(h.begin(), upper_bound(h.begin(), h.end(), goal)); long long cost_r = pref[n - 1] - pref[indexh - 1] - (n - 1 - indexh + 1) * goal; long long res = 0; if (cost_a > cost_r) { res = m * cost_r + (cost_a - cost_r) * a; } else { res = m * cost_a + (cost_r - cost_a) * r; }; ; ; return res; } void solve() { cin >> n >> a >> r >> m; m = min(m, a + r); h = vector<int>(n); pref = vector<long long>(n); for (int i = 0; i < n; ++i) { cin >> h[i]; } sort(h.begin(), h.end()); ; for (int i = 0; i < n; ++i) { if (i > 0) { pref[i] = pref[i - 1] + h[i]; } else { pref[i] = h[i]; } } long long answer = LLONG_MAX; for (int i = 0; i < n; ++i) { if (i > 0 && h[i] == h[i - 1]) { continue; } answer = min(answer, cost((long long)h[i])); } answer = min(answer, cost((long long)(pref[n - 1] / n))); answer = min(answer, cost((long long)(1 + pref[n - 1] / n))); cout << answer << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t = 1; for (int i = 1; i <= t; ++i) { solve(); } return 0; }
#include <bits/stdc++.h> typedef struct { double x, y; } point_t; typedef struct { double x, y, r; } circle_t; typedef struct { double A, B, C; } Line; Line zhong_chui_xian(circle_t circle1, circle_t circle2) { Line L1; point_t p; double k; p.x = (circle1.x + circle2.x) / 2; p.y = (circle1.y + circle2.y) / 2; if (fabs(circle1.y - circle2.y) < 1E-8) { L1.A = 1; L1.B = 0; L1.C = -p.x; } else if (fabs(circle1.x - circle2.x) < 1E-8) { L1.A = 0; L1.B = 1; L1.C = -p.y; } else { k = -1 / ((circle1.y - circle2.y) / (circle1.x - circle2.x)); L1.A = k; L1.B = -1; L1.C = p.y - k * p.x; } return L1; } int line_intersect(Line L1, Line L2, point_t& p) { double d, d1, d2, d3; d = L1.A * L2.B - L2.A * L1.B; if (fabs(d) < 1E-8) { d1 = L1.A / L2.A; d2 = L1.B / L2.B; d3 = L1.C / L2.C; if (fabs(d1 - d2) < 1E-8 && fabs(d2 - d3) < 1E-8) return 2; else return 0; } p.x = (L2.C * L1.B - L1.C * L2.B) / d; p.y = (L2.A * L1.C - L1.A * L2.C) / d; return 1; } circle_t yuan_guiji(circle_t circle1, circle_t circle2) { circle_t circle3; double keep1, keep2, keep3; keep1 = (circle2.r * circle2.r * circle1.x - circle1.r * circle1.r * circle2.x) / (circle1.r * circle1.r - circle2.r * circle2.r); keep2 = (circle2.r * circle2.r * circle1.y - circle1.r * circle1.r * circle2.y) / (circle1.r * circle1.r - circle2.r * circle2.r); keep3 = (circle2.r * circle2.r * circle1.x * circle1.x - circle1.r * circle1.r * circle2.x * circle2.x - circle1.r * circle1.r * circle2.y * circle2.y + circle2.r * circle2.r * circle1.y * circle1.y) / (circle1.r * circle1.r - circle2.r * circle2.r); circle3.x = -keep1; circle3.y = -keep2; circle3.r = sqrt(keep3 + keep1 * keep1 + keep2 * keep2); return circle3; } int equa(double A, double B, double C, double& x1, double& x2) { double f = B * B - 4 * A * C; if (f < 0) return -1; x1 = (-B + sqrt(f)) / (2 * A); x2 = (-B - sqrt(f)) / (2 * A); return 1; } double point_line_dis(point_t a, Line ln) { return (fabs(ln.A * a.x + ln.B * a.y + ln.C) / sqrt(ln.A * ln.A + ln.B * ln.B)); } int line_circle_intersect(Line ln, circle_t Y, point_t& p1, point_t& p2) { double t1, t2, len; point_t p3; p3.x = Y.x; p3.y = Y.y; len = point_line_dis(p3, ln); if (len > Y.r) return 0; int zz = -1; if (fabs(ln.B) < 1e-8) { p1.x = p2.x = -1.0 * ln.C / ln.A; zz = equa(1.0, -2.0 * Y.y, Y.y * Y.y + (p1.x - Y.x) * (p1.x - Y.x) - Y.r * Y.r, t1, t2); p1.y = t1; p2.y = t2; } else if (fabs(ln.A) < 1e-8) { p1.y = p2.y = -1.0 * ln.C / ln.B; zz = equa(1.0, -2.0 * Y.x, Y.x * Y.x + (p1.y - Y.y) * (p1.y - Y.y) - Y.r * Y.r, t1, t2); p1.x = t1; p2.x = t2; } else { zz = equa( ln.A * ln.A + ln.B * ln.B, 2.0 * ln.A * ln.C + 2.0 * ln.A * ln.B * Y.y - 2.0 * ln.B * ln.B * Y.x, ln.B * ln.B * Y.x * Y.x + ln.C * ln.C + 2 * ln.B * ln.C * Y.y + ln.B * ln.B * Y.y * Y.y - ln.B * ln.B * Y.r * Y.r, t1, t2); p1.x = t1, p1.y = -1 * (ln.A / ln.B * t1 + ln.C / ln.B); p2.x = t2, p2.y = -1 * (ln.A / ln.B * t2 + ln.C / ln.B); } if (p1.x - p2.x < 1E-8 && p1.y - p2.y < 1E-8) return 1; else return 2; } double dist(double xa, double ya, double xb, double yb) { return sqrt((xa - xb) * (xa - xb) + (ya - yb) * (ya - yb)); } double max(double a, double b) { return a > b ? a : b; } double min(double a, double b) { return a < b ? a : b; } int circle_intersect(circle_t A, circle_t B, point_t& ia, point_t& ib) { if (A.x == B.x && A.y == B.y) return 5; double dd = dist(A.x, A.y, B.x, B.y); if (A.r + B.r + 1E-8 < dd) return 1; double k, a, b, d, aa, bb, cc, c, drt; k = A.r; a = B.x - A.x; b = B.y - A.y; c = B.r; d = (c * c) - (k * k) - (a * a) - (b * b); aa = 4 * (a * a) + 4 * (b * b); bb = 4 * b * d; cc = (d * d) - 4 * (a * a) * (k * k); drt = (bb * bb) - 4 * aa * cc; if (drt < 0) return 5; drt = sqrt(drt); ia.y = (-bb + drt) / 2 / aa; ib.y = (-bb - drt) / 2 / aa; if (fabs(a) < 1E-8) { ia.x = sqrt((k * k) - (ia.y * ia.y)); ib.x = -ia.x; } else { ia.x = (2 * b * ia.y + d) / -2 / a; ib.x = (2 * b * ib.y + d) / -2 / a; } ia.x += A.x; ia.y += A.y; ib.x += A.x; ib.y += A.y; if (fabs(ia.y - ib.y) < 1E-8) { if (fabs(A.r + B.r - dd) < 1E-8) return 2; if (fabs(dd - (max(A.r, B.r) - min(A.r, B.r))) < 1E-8) return 3; } return 4; } int main() { circle_t circle[3]; int i, count; Line L1, L2; point_t p, p1, p2; circle_t circle1, circle2; for (i = 0; i < 3; i++) scanf( %lf%lf%lf , &circle[i].x, &circle[i].y, &circle[i].r); if (fabs(circle[0].r - circle[1].r) < 1E-8) { L1 = zhong_chui_xian(circle[0], circle[1]); if (fabs(circle[1].r - circle[2].r) < 1E-8) { L2 = zhong_chui_xian(circle[1], circle[2]); line_intersect(L1, L2, p); printf( %0.5lf %0.5lf n , p.x, p.y); } else { circle2 = yuan_guiji(circle[1], circle[2]); count = line_circle_intersect(L1, circle2, p1, p2); if (count == 1) { printf( %0.5lf %0.5lf n , p1.x, p1.y); } else if (count == 2) { if ((circle[0].r / dist(circle[0].x, circle[0].y, p1.x, p1.y)) > (circle[0].r / dist(circle[0].x, circle[0].y, p2.x, p2.y))) printf( %0.5lf %0.5lf n , p1.x, p1.y); else printf( %0.5lf %0.5lf n , p2.x, p2.y); } } } else { circle1 = yuan_guiji(circle[0], circle[1]); if (fabs(circle[1].r - circle[2].r) < 1E-8) { L2 = zhong_chui_xian(circle[1], circle[2]); count = line_circle_intersect(L2, circle1, p1, p2); if (count == 1) { printf( %0.5lf %0.5lf n , p1.x, p1.y); } else if (count == 2) { if ((circle[0].r / dist(circle[0].x, circle[0].y, p1.x, p1.y)) > (circle[0].r / dist(circle[0].x, circle[0].y, p2.x, p2.y))) printf( %0.5lf %0.5lf n , p1.x, p1.y); else printf( %0.5lf %0.5lf n , p2.x, p2.y); } } else { circle2 = yuan_guiji(circle[1], circle[2]); count = circle_intersect(circle1, circle2, p1, p2); if (count == 2 \|\| count == 3) { printf( %0.5lf %0.5lf n , p1.x, p1.y); } else if (count == 4) { if ((circle[0].r / dist(circle[0].x, circle[0].y, p1.x, p1.y)) > (circle[0].r / dist(circle[0].x, circle[0].y, p2.x, p2.y))) printf( %0.5lf %0.5lf n , p1.x, p1.y); else printf( %0.5lf %0.5lf n , p2.x, p2.y); } } } return 0; }
#include <bits/stdc++.h> using namespace std; template <typename A, typename B> string to_string(pair<A, B> p); template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p); template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p); string to_string(const string& s) { return + s + ; } string to_string(const char* s) { return to_string((string)s); } string to_string(bool b) { return (b ? true : false ); } string to_string(vector<bool> v) { bool first = true; string res = { ; for (int i = 0; i < static_cast<int>(v.size()); i++) { if (!first) { res += , ; } first = false; res += to_string(v[i]); } res += } ; return res; } template <size_t N> string to_string(bitset<N> v) { string res = ; for (size_t i = 0; i < N; i++) { res += static_cast<char>( 0 + v[i]); } return res; } template <typename A> string to_string(A v) { bool first = true; string res = { ; for (const auto& x : v) { if (!first) { res += , ; } first = false; res += to_string(x); } res += } ; return res; } template <typename A, typename B> string to_string(pair<A, B> p) { return ( + to_string(p.first) + , + to_string(p.second) + ) ; } template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p) { return ( + to_string(get<0>(p)) + , + to_string(get<1>(p)) + , + to_string(get<2>(p)) + ) ; } template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p) { return ( + to_string(get<0>(p)) + , + to_string(get<1>(p)) + , + to_string(get<2>(p)) + , + to_string(get<3>(p)) + ) ; } void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << << to_string(H); debug_out(T...); } const int mod = 1e9 + 7; const int maxn = 200005; const int inf = 1e9; int tiempo[maxn], x[maxn], y[maxn], pref[maxn], dp[maxn]; void solve() { int r, n; cin >> r >> n; for (int i = 1; i <= n; i++) { cin >> tiempo[i] >> x[i] >> y[i]; dp[i] = -inf; } x[0] = y[0] = 1; int ans = -inf; for (int i = 1; i <= n; i++) { for (int j = i - 1; j >= 0; j--) { if (tiempo[i] - tiempo[j] > 2 * r) { dp[i] = max(dp[i], pref[j] + 1); break; } int dist = abs(x[i] - x[j]) + abs(y[i] - y[j]); if (dist <= (tiempo[i] - tiempo[j])) { dp[i] = max(dp[i], dp[j] + 1); } } pref[i] = pref[i - 1]; pref[i] = max(pref[i], dp[i]); ans = max(ans, pref[i]); } cout << ans << n ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t = 1; while (t--) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; const long double eps = 1e-9; const int inf = (1 << 30) - 1; const long long inf64 = ((long long)1 << 62) - 1; const long double pi = 3.1415926535897932384626433832795; const string task = ; template <class T> T sqr(T x) { return x * x; } const int nmax = 2100; int a[nmax][nmax]; char s[nmax][nmax]; int n, res; int x[nmax], y[nmax]; int main() { int n; cin >> n; gets(s[0]); for (int i = 0; i < (int)(n); i++) gets(s[i]); for (int i = 0; i < (int)(n); i++) for (int j = 0; j < (int)(n); j++) a[i][j] = s[i][j] - 0 ; int res = 0; memset(x, 0, sizeof x); memset(y, 0, sizeof y); for (int i = n - 1; i > 0; i--) { for (int j = 0; i + j < n; j++) { int now = a[i + j][j] + x[i + j] + y[j]; now = now & 1; if (now) { res++; x[i + j]++; y[j]++; } } } for (int i = 0; i < (int)(n); i++) a[i][i] = (a[i][i] + x[i] + y[i]) & 1; memset(x, 0, sizeof x); memset(y, 0, sizeof y); for (int i = n - 1; i > 0; i--) { for (int j = 0; i + j < n; j++) { int now = a[j][i + j] + x[j] + y[i + j]; now = now & 1; if (now) { res++; y[i + j]++; x[j]++; } } } for (int i = 0; i < (int)(n); i++) a[i][i] = (a[i][i] + x[i] + y[i]) & 1; for (int i = 0; i < (int)(n); i++) if (a[i][i] == 1) res++; cout << res << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const long long inf = (1ll << 60); const int maxn = 10010; long long dp[2][maxn], c; int p[maxn], s[maxn]; int n, id; int main() { scanf( %d%I64d , &n, &c); for (int i = 0; i < n; i++) scanf( %d , p + i); for (int i = 0; i < n; i++) scanf( %d , s + i); for (int i = 1; i <= n; i++) dp[0][i] = inf; for (int i = 0; i < n; i++) { for (int j = 0; j <= i + 1; j++) dp[id ^ 1][j] = inf; for (int j = 0; j <= i; j++) { dp[id ^ 1][j] = min(dp[id ^ 1][j], dp[id][j] + p[i] + c * j); dp[id ^ 1][j + 1] = min(dp[id ^ 1][j + 1], dp[id][j] + s[i]); } id ^= 1; } long long res = inf; for (int i = 0; i <= n; i++) res = min(res, dp[id][i]); cout << res << endl; return 0; }
#include <bits/stdc++.h> using namespace std; void in(long long int &number) { bool negative = false; register int c; number = 0; c = getchar(); if (c == - ) { negative = true; c = getchar(); } for (; (c > 47 && c < 58); c = getchar()) number = number * 10 + c - 48; if (negative) number = -1; } void in(int &number) { bool negative = false; register int c; number = 0; c = getchar(); if (c == - ) { negative = true; c = getchar(); } for (; (c > 47 && c < 58); c = getchar()) number = number 10 + c - 48; if (negative) number *= -1; } int k[100005]; int main() { int n, m; in(n); in(m); memset(k, 0, sizeof(k)); vector<long long int> a(n); for (int i = 0; i <= n - 1; i++) in(a[i]); vector<int> dp(n); dp[n - 1] = 1; k[a[n - 1]] = 1; for (int i = n - 2; i >= 0; i--) { if (k[a[i]] == 0) { dp[i] = dp[i + 1] + 1; k[a[i]] = 1; } else dp[i] = dp[i + 1]; } while (m--) { int l; in(l); l--; cout << dp[l] << n ; } return 0; }
#include<bits/stdc++.h> #define mx 100005 #define lli long long int #define ulli unsigned long long int #define mset(a,b) memset(a, b, sizeof(a)) #define infile freopen( in.txt , r , stdin); #define outfile freopen ( out.txt , w ,stdout); #define fileclose fclose (stdin); fclose (stdout); #define test_case lli T; cin>>T;for(lli t=1;t<=T;t++) #define scani(x) scanf( %d ,&x); #define printi(x) printf( %d n ,x); #define scanli(x) scanf( %lld ,&x); #define printli(x) printf( %lld n ,x); #define frep(i,from,to) for(lli i=from;i<=to;i++) #define frev(i,from,to) for(lli i=from;i>=to;i--) using namespace std; int main() { //infile //outfile test_case { lli n; lli x,mini=2000000000,mi; scanli(n); frep(i,1,n) { cin>>x; if(x<mini) { mi=i; mini=x; } } cout<<n-1<< n ; frep(j,1,n) { if(mi!=j) cout<<mi<< <<j<< <<mini<< <<abs(mi-j)+mini<< n ; } } fileclose }
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma ) #pragma GCC optimize( unroll-loops ) using namespace std; long long int MOD = 998244353; double eps = 1e-12; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int k, n, w, product = 0; cin >> k >> n >> w; for (int i = 1; i <= w; i++) { product += (i * k); } long long int res = product - n; if (res <= 0) cout << 0 << endl; else cout << res << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 32005; int n, m, i, j, f; int a[N]; long long ans; int main() { scanf( %d%d , &n, &m); for (i = m + 1; i <= (n + 1) / 2; i++) { for (j = m + 1; j < 2 * i; j++) { f = (i * (2 * i - j) + (n + 1) * (2 * j - i)) / (i + j); f = max(f, m); if (f > n - m) continue; a[i] += n - m - f; } } for (i = m + 1; i <= (n + 1) / 2; i++) ans += 2 * a[i]; if (n % 2) ans -= a[i - 1]; printf( %I64d n , 3 * ans); return 0; }
#include <bits/stdc++.h> using namespace std; const int Mod = 1e9 + 7; const double pi = 2 * acos(0.0); const int N = 3e5 + 5; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, t; cin >> t; while (t--) { cin >> n; int x, z = 0, tot = 0; for (int i = 0; i < n; i++) { cin >> x; if (!x) z++; tot += x; } cout << z + ((tot + z) == 0) << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int n, x; int a[105]; long double dp[2][105][10005]; const long double threshold = 1e-12; int main() { scanf( %d%d , &n, &x); long double s = 0.0; for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); s += a[i]; } dp[0][0][0] = 1.0; for (int i = 0; i < n; i++) { int now = i & 1, nxt = now ^ 1; memset(dp[nxt], 0, sizeof(dp[nxt])); for (int j = 0; j <= i; j++) { for (int k = 0; k <= 10000; k++) { dp[nxt][j][k] += dp[now][j][k]; dp[nxt][j + 1][k + a[i + 1]] += dp[now][j][k] * (j + 1) / (n - j); } } } long double ans = 0.0; for (int i = 0; i <= n - 1; i++) for (int j = 0; j <= s; j++) ans += dp[n & 1][i][j] * (min((s - j) / (n - i), ((long double)n / (n - i) + 1) * x / 2.0)); printf( %.10Lf n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; const long long int MOD = 1000000007; const long double PI = 3.14159265; long long int powerWithMod(long long int base, long long int exponent, long long int MODulus = LLONG_MAX) { long long int ansult = 1; base %= MODulus; while (exponent > 0) { if (exponent % 2 == 1) ansult = (ansult * base) % MODulus; exponent >>= 1; base = (base * base) % MODulus; } return ansult; } long long int gcdExtended(long long int a, long long int b, long long int x, long long int y) { cout << a << << b << << x << << y << n ; if (a == 0) { x = 0, y = 1; return b; } long long int x1, y1; long long int gcd = gcdExtended(b % a, a, &x1, &y1); x = y1 - (b / a) x1; y = x1; cout << AFTER << a << << b << << x << << *y << n ; return gcd; } long long int MODInverse(long long int a, long long int m) { long long int x, y; long long int g = gcdExtended(a, m, &x, &y); cout << g << << x << << y << n ; long long int ans = (x % m + m) % m; return ans; } using namespace std; int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); long long int n, a = 0, x, m = 0; cin >> n; for (int i = 1; i <= n; i++) cin >> x, a += x, m = max(x, m); cout << max(m, (a + n - 2) / (n - 1)) << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const long long int N = 100005; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); { long long int i, j, k, n, m, ans = 0, cnt = 0, sum = 0; cin >> n; vector<long long int> v; long long int a[n]; j = 0; ans = 0; for (i = 0; i < n; i++) { cin >> a[i]; if (a[i] < 0) { j++; if (j == 3) { v.push_back(i - ans); cnt++; ans = i; j = 1; } } if (i == n - 1) { v.push_back(i - ans + 1); cnt++; } } cout << max((long long int)1, cnt) << endl; for (auto x : v) { cout << x << ; } } }
#include <bits/stdc++.h> using namespace std; const int INF = 1e7; const long long MOD = 998244353; vector<vector<int> > occur; vector<vector<long long> > minC, dp; long long gV(int l, int r) { if (l == r + 1) { return 1; } return dp[l][r]; } void calc(int l, int r) { int cMinC = minC[l][r]; vector<int> &cOccur = occur[cMinC]; int fI = cOccur[0]; int lI = cOccur[cOccur.size() - 1]; if (fI < l \|\| r < lI) { dp[l][r] = 0; return; } long long sumR = 0; for (int nR = lI; nR <= r; nR++) { sumR = (sumR + gV(lI + 1, nR) * gV(nR + 1, r)) % MOD; } long long sumL = 0; for (int nL = fI; nL >= l; nL--) { sumL = (sumL + gV(l, nL - 1) * gV(nL, fI - 1)) % MOD; } long long inProd = 1; for (int i = 0; i + 1 < cOccur.size(); i++) { inProd = inProd * gV(cOccur[i] + 1, cOccur[i + 1] - 1) % MOD; } dp[l][r] = (sumL * sumR % MOD) * inProd % MOD; } int main() { int N, M; cin >> M >> N; vector<int> a; for (int i = 0; i < N; i++) { int x; cin >> x; x--; if (a.empty() \|\| a[a.size() - 1] != x) { a.push_back(x); } } N = a.size(); if (N > 2 * M) { cout << 0 << endl; return 0; } minC.resize(N); for (int i = 0; i < N; i++) { minC[i].resize(N); int cMin = a[i]; for (int j = i; j < N; j++) { cMin = min(cMin, a[j]); minC[i][j] = cMin; } } occur.resize(M); for (int i = 0; i < N; i++) { occur[a[i]].push_back(i); } dp.resize(N); for (int i = 0; i < N; i++) { dp[i].resize(N); fill(dp[i].begin(), dp[i].end(), 0); } for (int len = 1; len <= N; len++) { for (int l = 0; l < N; l++) { int r = l + len - 1; if (r >= N) { continue; } calc(l, r); } } cout << dp[0][N - 1] << endl; }
#include <bits/stdc++.h> #pragma comment(linker, /STACK: 2000000 ) using namespace std; int main(void) { srand(time(0)); cout << fixed << setprecision(7); cerr << fixed << setprecision(7); int n; ios_base ::sync_with_stdio(0); cin.tie(0); cin >> n; function<int(int)> ok = [&](int k) { return !k ? 0 : ok(k / 10) \| ((k % 10 != 4) && (k % 10 != 7)); }; static int f[1 << 20]; for (int i = 1; i <= n; ++i) f[i] = i; function<int(int)> get = [&](int k) { return k == f[k] ? k : f[k] = get(f[k]); }; for (int i = 1; i < n; ++i) { int a, b, c; cin >> a >> b >> c; if (ok(c)) f[get(a)] = get(b); } static int S[1 << 20]; for (int i = 1; i <= n; ++i) ++S[get(i)]; long long ans = 0; for (int i = 1; i <= n; ++i) ans += 1ll * (n - S[get(i)]) * (n - S[get(i)] - 1); cout << ans << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; vector<long long> v[100009], vv[100009]; long long vis[100009], dis[101][100001], ar[100001]; void bfs(long long k) { queue<long long> q; memset(vis, 0, sizeof(vis)); for (long long x : vv[k]) { q.push(x); vis[x] = 1; dis[k][x] = 0; } while (!q.empty()) { long long x = q.front(); q.pop(); for (long long y : v[x]) { if (!vis[y]) { vis[y] = 1; q.push(y); dis[k][y] = dis[k][x] + 1; } } } } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, m, k, s, ans = 1e15; cin >> n >> m >> k >> s; for (long long i = 1; i <= n; i++) { cin >> ar[i]; vv[ar[i]].push_back(i); } for (long long i = 0; i < m; i++) { long long x, y; cin >> x >> y; v[x].push_back(y); v[y].push_back(x); } for (long long i = 1; i <= k; i++) bfs(i); for (long long i = 1; i <= n; i++) { vector<long long> hh; long long as = 0; for (long long j = 1; j <= k; j++) hh.push_back(dis[j][i]); sort(hh.begin(), hh.end()); for (long long j = 0; j < s; j++) as += hh[j]; cout << as << ; } cout << endl; }

#include <bits/stdc++.h> using namespace std; const int N = 1010; const int MAXK = 1000010; int n, m, k, p, a[N][N], row[N], col[N]; long long ans1[MAXK], ans2[MAXK]; multiset<long long> Unis; void solve(long long *ans, int n, int *a, int dta) { Unis.clear(); for (int i = 1; i <= n; ++i) { Unis.insert(-a[i]); } long long now = 0; for (int kk = 1; kk <= k; ++kk) { long long val = *Unis.begin(); now += val; Unis.erase(Unis.begin()); Unis.insert(val + dta); ans[kk] = -now; } } int main() { scanf( %d %d %d %d , &n, &m, &k, &p); for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) { scanf( %d , &a[i][j]); row[i] += a[i][j]; col[j] += a[i][j]; } solve(ans1, n, row, p * m); solve(ans2, m, col, p * n); long long zans = -1e18; for (int i = 0; i <= k; ++i) { zans = max(zans, ans1[i] + ans2[k - i] - (long long)i * (k - i) * p); } cout << zans << endl; }

#include <bits/stdc++.h> using namespace std; int c, hi, hb, wi, wb; inline long long f(int x) { long long k1 = x; long long k2 = 1ll * (0ll + c - 1ll * x * wi) / wb; return k1 * hi + k2 * hb; } int main() { cin >> c >> hi >> hb >> wi >> wb; int kek1 = c / wi; int l = 0; int r = kek1; long long ans = 0; ans = max(ans, f(0)); ans = max(ans, f(kek1)); for (int i = 0; i <= 10000000; ++i) if (i <= kek1) ans = max(ans, f(i)); while (r - l > 1) { int m = (r - l + 1) / 3; int k1 = l + m; int k2 = r - m; if (f(k1) > f(k2)) r = k2; else l = k1; } for (int i = l - 9000000; i <= r + 9000000; ++i) if (i >= 0 && i <= kek1) ans = max(ans, f(i)); swap(wi, wb); swap(hi, hb); kek1 = c / wi; l = 0; r = kek1; for (int i = 0; i <= 10000000; ++i) if (i <= kek1) ans = max(ans, f(i)); while (r - l > 1) { int m = (r - l + 1) / 3; int k1 = l + m; int k2 = r - m; if (f(k1) > f(k2)) r = k2; else l = k1; } for (int i = l - 9000000; i <= r + 9000000; ++i) if (i >= 0 && i <= kek1) ans = max(ans, f(i)); ans = max(ans, f(0)); ans = max(ans, f(kek1)); cout << ans; }

#include <bits/stdc++.h> using namespace std; int n, m, a[101000], tmp; struct C { int b, p; } c[101000]; long long ans = 0, tot; bool cmp(C c1, C c2) { return c1.b < c2.b; } priority_queue<int, vector<int>, greater<int> > q; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= m; i++) scanf( %d , &c[i].b); for (int i = 1; i <= m; i++) scanf( %d , &c[i].p); sort(c + 1, c + m + 1, cmp); int p, pos = 0; for (int now = n; now > 0; now = p - 1) { p = now; tot = a[p]; for (; a[p - 1] <= a[now] && p > 1;) tot += a[--p]; for (; pos < m && c[pos + 1].b <= a[now];) q.push(c[++pos].p); for (; !q.empty();) { if (tot >= q.top()) { ans++; tot -= q.top(); q.pop(); } else { tmp = q.top() - tot; q.pop(); q.push(tmp); tot = 0; break; } } } cout << ans; }

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; int t, n, a[N]; int main() { ios::sync_with_stdio(false); for (cin >> t; t; t--) { cin >> n; long long l = 0, r = 0; for (int i = 1; i <= n; i++) { cin >> a[i]; l += a[i]; r ^= a[i]; } cout << 2 << n << r << << (l + r) << n ; } return 0; }

#include bits/stdc++.h using namespace std; #define ll long long int #define pb push_back #define ppb pop_back #define pf push_front #define ppf pop_front #define all(x) (x).begin(),(x).end() #define uniq(v) (v).erase(unique(all(v)),(v).end()) #define sz(x) (int)((x).size()) #define fr first #define sc second #define pii pair<int,int> #define rep(i,a,b) for(int i=a;i<b;i++) #define mem1(a) memset(a,-1,sizeof(a)) #define mem0(a) memset(a,0,sizeof(a)) #define ppc __builtin_popcount #define ppcll __builtin_popcountll template<typename T,typename T1>T max_self(T &a,T1 b){if(b>a)a=b;return a;} template<typename T,typename T1>T min_self(T &a,T1 b){if(b<a)a=b;return a;} const long long int INF=1e9; const int N=0; const int modn=1e9+7; void solve(){ int n,m;cin>>n>>m; string s,t; cin>>s>>t; int left[m],right[m]; int i=0,j=0; while(j<m) {while(s[i]!=t[j]) i++; left[j]=i; j++,i++; } i=n-1; j=m-1; while(~j) { while(s[i]!=t[j]) i--; right[j]=i; i--,j--; } int ans=0; //rep(i,0,m) //cout<<left[i]<< ; rep(i,1,m) max_self(ans,right[i]-left[i-1]); cout<<ans<< n ; } int main(){ ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0); int t=1; //cin>>t; while(t--) solve(); return 0; }

#include <bits/stdc++.h> using namespace std; long long gcd(long long x, long long y) { if (y == 0) return x; return gcd(y, x % y); } long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } void XsliferX() { ios::sync_with_stdio(0); ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0); } long long f_p(long long x, int y) { if (y == 0) return 1; else if (y % 2 == 0) return f_p(x * x, y / 2); else return x * f_p(x * x, y / 2); } long long l_p(long long n) { n = n | (n >> 1); n = n | (n >> 2); n = n | (n >> 4); n = n | (n >> 8); return (n + 1) >> 1; } int dp[5005]; int a[5005]; int n; int L[5005], R[5005]; bool vis[5005]; int solve(int idx) { int x = 0; int lft = L[a[idx]], rit = R[a[idx]]; if (idx == n) return 0; if (dp[idx] != -1) return dp[idx]; for (int i = L[a[idx]]; i <= R[a[idx]]; i++) { if (lft > L[a[i]]) lft = L[a[i]]; if (rit < R[a[i]]) rit = R[a[i]]; } bool v[5005] = {0}; if (idx == lft) { int xo = 0; for (int i = lft; i <= rit; i++) { if (!v[a[i]]) { xo ^= a[i]; v[a[i]] = 1; } vis[a[i]] = 1; } x = max(x, solve(rit + 1) + xo); for (int i = lft; i < rit; i++) { vis[a[i]] = 0; } } vis[a[idx]] = 1; x = max(x, solve(idx + 1)); vis[a[idx]] = 0; return dp[idx] = x; } int main() { memset(dp, -1, sizeof dp); cin >> n; for (int i = 0; i < n; i++) cin >> a[i], R[a[i]] = i; memset(L, -1, sizeof L); for (int i = 0; i < n; i++) if (L[a[i]] == -1) L[a[i]] = i; cout << solve(0) << n ; return 0; }

#include <bits/stdc++.h> template <class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template <class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } constexpr long long MAX = 5100000; constexpr long long INF = 1LL << 60; constexpr int inf = 1000000007; constexpr long long mod = 998244353LL; const long double PI = acos((long double)(-1)); using namespace std; struct mint { long long x; mint(long long x = 0) : x((x % mod + mod) % mod) {} mint& operator+=(const mint a) { if ((x += a.x) >= mod) x -= mod; return *this; } mint& operator-=(const mint a) { if ((x += mod - a.x) >= mod) x -= mod; return *this; } mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this; } mint operator+(const mint a) const { mint res(*this); return res += a; } mint operator-(const mint a) const { mint res(*this); return res -= a; } mint operator*(const mint a) const { mint res(*this); return res *= a; } mint pow(long long t) const { if (!t) return 1; mint a = pow(t >> 1); a *= a; if (t & 1) a *= *this; return a; } mint inv() const { return pow(mod - 2); } mint& operator/=(const mint a) { return (*this) *= a.inv(); } mint operator/(const mint a) const { mint res(*this); return res /= a; } }; mint dp[2][4001]; void init(int x) { for (int i = 0; i <= 4000; i++) dp[x][i] = 0; } long long fac[MAX], finv[MAX], inv[MAX]; void COMinit() { fac[0] = fac[1] = 1; finv[0] = finv[1] = 1; inv[1] = 1; for (int i = 2; i < MAX; i++) { fac[i] = fac[i - 1] * i % mod; inv[i] = mod - inv[mod % i] * (mod / i) % mod; finv[i] = finv[i - 1] * inv[i] % mod; } } mint COM(int n, int k) { if (n < k) return 0; if (n < 0 || k < 0) return 0; return mint(fac[n] * (finv[k] * finv[n - k] % mod) % mod); } int main() { COMinit(); long long n, k; scanf( %lld %lld , &n, &k); vector<long long> h(n); for (int i = 0; i < n; i++) scanf( %lld , &h[i]); int cnt = 0; for (int i = 0; i < n; i++) { if (h[i] != h[(i + 1) % n]) { cnt++; } } mint res = 0; vector<mint> k2(n + 1); k2[0] = 1; for (int i = 1; i <= n; i++) k2[i] = k2[i - 1] * (k - 2); vector<mint> tw(n + 1); tw[0] = 1; for (int i = 1; i <= n; i++) tw[i] = tw[i - 1] * 2; mint tinv = mint(2).inv(); for (int i = 0; i < cnt; i++) { int r = cnt - i; if (r & 1) res += COM(cnt, i) * k2[i] * tw[r - 1]; else res += COM(cnt, i) * k2[i] * (tw[r] - COM(r, r / 2)) * tinv; } res *= mint(k).pow(n - cnt); cout << res.x << n ; return 0; }

#include <bits/stdc++.h> using namespace std; const long long inf = 1000ll * 1000ll * 1000ll; const long long inf64 = inf * inf; const double pi = acos(-1.0); long long Abs(long long a) { return (a >= 0 ? a : -a); } template <typename T> inline T Sqr(T a) { return a * a; } vector<int> par, sz; bool solve() { ios_base::sync_with_stdio(0); ifstream fin( run.in ); ofstream fout( run.out ); int n, a, b; cin >> n; vector<int> d(n - 1); for (int i(0); i < n - 1; i++) cin >> d[i]; cin >> a >> b; a--, b--; long long ans = 0; for (int i(a); i < b; i++) ans += d[i]; cout << ans << n ; return true; } int main() { solve(); return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 10; const int inf = 1e9; int arr[N], pos[N], rMax[N]; int main() { int n, m; scanf( %d %d , &n, &m); for (int i = 0; i < n; i++) { scanf( %d , arr + i); pos[arr[i]] = i; } fill(rMax, rMax + N, n - 1); while (m--) { int a, b; scanf( %d %d , &a, &b); if (pos[a] < pos[b]) { rMax[a] = min(pos[b] - 1, rMax[a]); } else { rMax[b] = min(pos[a] - 1, rMax[b]); } } long long ans = 1; for (int i = n - 2; i >= 0; i--) { int k = arr[i]; int j = arr[i + 1]; rMax[k] = min(rMax[k], rMax[j]); ans += rMax[k] - i + 1; } cout << ans << endl; }

#include <bits/stdc++.h> using namespace std; void change_stream(char* in, char* out) { ifstream fin; fin.open(in); ofstream fout; fout.open(out); if (fin && fout) { freopen(in, r , stdin); freopen(out, w , stdout); } } long long a[500], renum[500]; void shift(long long i) { long long p = a[i]; a[i] = a[i + 2]; a[i + 2] = a[i + 1]; a[i + 1] = p; renum[a[i]] = i; renum[a[i + 1]] = i + 1; renum[a[i + 2]] = i + 2; } void solve() { long long n; cin >> n; pair<long long, long long> s[n]; for (long long i = 0; i < n; i++) { cin >> a[i]; s[i] = {a[i], i}; } sort(s, s + n); for (long long i = 0; i < n; i++) { renum[i] = s[i].second; a[renum[i]] = i; } long long sdv = 0; for (long long i = 0; i < n; i++) for (long long j = i + 1; j < n; j++) if (a[i] > a[j]) sdv++; if (sdv % 2) { bool flag = false; for (long long i = 0; i < n - 1; i++) if (s[i].first == s[i + 1].first) { swap(a[s[i].second], a[s[i + 1].second]); renum[a[s[i].second]] = s[i].second; renum[a[s[i + 1].second]] = s[i + 1].second; flag = true; break; } if (!flag) { cout << -1 n ; return; } } vector<long long> ans; for (long long i = n - 1; i > 1; i--) { while (renum[i] < i) { long long l = max(0ll, renum[i] - 1); ans.push_back(l); shift(l); } } cout << ans.size() << n ; for (long long i : ans) cout << i + 1 << ; cout << n ; } signed main() { change_stream( in , out ); ios::sync_with_stdio(0); cin.tie(0); long long test_count = 1; cin >> test_count; while (test_count--) solve(); }

#include <bits/stdc++.h> using namespace std; long long dist(const pair<long long, long long> &a, const pair<long long, long long> &b) { return (a.first - b.first) * (a.first - b.first) + (a.second - b.second) * (a.second - b.second); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; pair<long long, long long> p1, p2; cin >> p1.first >> p1.second >> p2.first >> p2.second; vector<pair<long long, long long>> v(n); for (int i = 0; i < n; ++i) { pair<long long, long long> tmp; cin >> tmp.first >> tmp.second; v[i] = {dist(p1, tmp), dist(p2, tmp)}; } long long ans = (1LL << 62); v.push_back({0, 0}); for (int i = 0; i < v.size(); ++i) { long long r2 = 0; for (int j = 0; j < v.size(); ++j) { if (i == j || v[j].first <= v[i].first) continue; else r2 = max(r2, v[j].second); } ans = min(ans, v[i].first + r2); } if (n == 1) ans = min(ans, v[0].second); cout << ans << n ; return 0; }

#include <bits/stdc++.h> using namespace std; int a[200010]; int base; int n, tmp; int main() { cin >> n; cin >> base; a[100000]++; for (int i = 1; i <= n - 1; i++) { cin >> tmp; int offset = tmp - base; if (abs(offset) > 100000) { cout << NO << endl; return 0; } a[offset + 100000]++; } int ub = 100000, lb = 100000; int cnt = n + a[100000]; while (a[ub]) { cnt -= a[ub]; ub++; } while (a[lb]) { cnt -= a[lb]; lb--; } lb++; ub--; if (cnt != 0) { cout << NO ; return 0; } for (int i = lb + 1; i <= ub - 1; i++) { if (a[i] < 2) { cout << NO ; return 0; } a[i] -= 2; } a[lb]--; a[ub]--; for (int i = lb; i <= ub; i++) { if (a[i + 1] < a[i]) { cout << NO ; return 0; } a[i + 1] -= a[i]; } cout << YES ; }

#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; inline int read() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } int n; int a[maxn]; int flag = 0; int flag1 = 0; int main() { n = read(); for (int i = 1; i <= n; i++) { a[i] = read(); if (i <= n - 1 && a[i] == 0) flag1 = 1; } if (a[n] == 0) flag = 1; if (flag) { if (flag1 == 0) { printf( YES n ); for (int i = 1; i <= n - 1; i++) { printf( %d-> , a[i]); } printf( %d n , a[n]); return 0; } int place = 0; for (int i = n - 2; i >= 1; i--) { if (a[i] == 0) { place = i; break; } } if (place == 0) { printf( NO n ); return 0; } printf( YES n ); for (int i = 1; i <= place - 1; i++) { printf( %d-> , a[i]); } printf( (%d-> , a[place]); printf( ( ); for (int i = place + 1; i <= n - 2; i++) { printf( %d-> , a[i]); } printf( %d , a[n - 1]); printf( ))-> ); printf( %d n , a[n]); } else { printf( NO n ); } return 0; }

#include <bits/stdc++.h> using namespace std; template <class T, class T2> inline int chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; } template <class T, class T2> inline int chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; } const int MAXN = (1 << 20); int n, sum = 0; vector<int> li1; vector<pair<int, int> > li; void read() { cin >> n; for (int i = 1; i <= n; i++) { int x; cin >> x; if (x == 1) li1.push_back(i); else sum += x - 2, li.push_back({x - 2, i}); } } vector<pair<int, int> > answer; void solve() { if (sum < ((int)li1.size()) - 2) { cout << NO << n ; return; } int d = ((int)li.size()) - 1; for (int i = 0; i < ((int)li.size()) - 1; i++) answer.push_back({li[i].second, li[i + 1].second}); if (((int)li1.size()) >= 1) { int x = li1.back(); li1.pop_back(); answer.push_back({x, li[0].second}); d++; } if (((int)li1.size()) >= 1) { int x = li1.back(); li1.pop_back(); answer.push_back({x, li.back().second}); d++; } for (auto &it : li) { while (it.first >= 1 && ((int)li1.size())) { int x = li1.back(); li1.pop_back(); answer.push_back({x, it.second}); it.first--; } } cout << YES << << d << n ; cout << ((int)answer.size()) << n ; for (auto e : answer) cout << e.first << << e.second << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); read(); solve(); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { long long i, n, ans, ghor, j, k, flag = 0; cin >> n; for (i = 0;; i++) { ans = (n - 1) / (5 * pow(2, i)); if (ans == 0) break; n = n - (5 * pow(2, i)); } ghor = i + 1; long long p = pow(2, i); long long cnt = 1; for (j = 1; j <= 5; j++) { for (k = 1; k <= p; k++) { if (cnt == n) { flag = 1; break; } cnt++; } if (flag == 1) break; } switch (j) { case 1: cout << Sheldon << endl; break; case 2: cout << Leonard << endl; break; case 3: cout << Penny << endl; break; case 4: cout << Rajesh << endl; break; case 5: cout << Howard << endl; break; } return 0; }

#include <bits/stdc++.h> using namespace std; void solve() { int i, j, n, m; cin >> n; vector<int> vec(n); vector<int> ans; int count = 1; for (int i = 0; i < n; i++) { cin >> vec[i]; } for (int i = 0; i < n; i++) { count = 1; for (int j = 0; j < n; j++) { if (vec[i] < vec[j]) { count++; } } ans.push_back(count); } for (auto x : ans) { if (x > 1) cout << x << ; else cout << 1 << ; } cout << n ; } int32_t main() { int T = 1; while (T--) { solve(); } }

#include <bits/stdc++.h> using namespace std; const int block_size = 320; const long long mod = 1e9 + 7; const long long inf = 1e9 + 7; const long double eps = 1e-9; const double PI = atan(1) * 4; template <typename T> inline int sign(const T &a) { if (a < 0) return -1; if (a > 0) return 1; return 0; } string to_string(string s) { return + s + ; } string to_string(const char *s) { return to_string((string)s); } string to_string(bool b) { return (b ? true : false ); } template <typename A, typename B> string to_string(pair<A, B> p) { return ( + to_string(p.first) + , + to_string(p.second) + ) ; } template <typename A> string to_string(A v) { bool first = true; string res = { ; for (const auto &x : v) { if (!first) { res += , ; } first = false; res += to_string(x); } res += } ; return res; } void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << << to_string(H); debug_out(T...); } template <typename T, typename S> inline bool upmin(T &a, const S &b) { return a > b ? a = b, 1 : 0; } template <typename T, typename S> inline bool upmax(T &a, const S &b) { return a < b ? a = b, 1 : 0; } template <typename T> inline void in(T &x) { x = 0; T f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = -1; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + ch - 0 ; ch = getchar(); } x *= f; } long long twop(int x) { return 1LL << x; } template <typename T> T MOD(T a, T m) { a %= m; if (a < 0) a += m; return a; } template <typename T> T inverse(T a, T m) { a = MOD(a, m); if (a <= 1) return a; return MOD((1 - inverse(m, a) * m) / a, m); } template <typename A, typename B> inline void in(A &x, B &y) { in(x); in(y); } template <typename A, typename B, typename C> inline void in(A &x, B &y, C &z) { in(x); in(y); in(z); } template <typename A, typename B, typename C, typename D> inline void in(A &x, B &y, C &z, D &d) { in(x); in(y); in(z); in(d); } template <typename T> T sqr(T x) { return x * x; } long long gcd(long long a, long long b) { while (b != 0) { a %= b; swap(a, b); } return a; } long long fast(long long a, long long b, long long mod) { long long ans = 1; while (b) { if (b & 1) { b--; ans = ans * a % mod; } else { a = a * a % mod; b /= 2; } } return ans % mod; } pair<long long, long long> operator-(const pair<long long, long long> &a, const pair<long long, long long> &b) { return make_pair(a.first - b.first, a.second - b.second); } long long cp(pair<long long, long long> o, pair<long long, long long> a, pair<long long, long long> b) { a = a - o; b = b - o; return a.first * b.second - a.second * b.first; } pair<long long, long long> process(pair<long long, long long> diff) { long long g = abs(gcd(diff.first, diff.second)); diff.first /= g; diff.second /= g; return diff; } template <int maxn, typename NUM> struct BIT { NUM s[maxn]; void init() { memset(s, 0, sizeof(s)); } BIT() { init(); } void update(int a, NUM value) { a++; while (a < maxn) { s[a] += value; a += ((a) & (-(a))); } } NUM query(int a) { NUM ans = 0; a++; while (a) { ans += s[a]; a -= ((a) & (-(a))); } return ans; } NUM query(int a, int b) { if (b < a) return 0; return query(b) - query(a - 1); } }; BIT<300010, long long> bit; namespace SOLVE { vector<vector<pair<long long, long long>>> vec; bool cmp(const pair<pair<long long, long long>, long long> &a, const pair<pair<long long, long long>, long long> &b) { return a.first.second < b.first.second; } long long ans[300010]; void main() { int n; in(n); vec.resize(n + 1); for (long long i = 1; i < n + 1; i++) { int c; in(c); vector<pair<long long, long long>> v; for (long long j = 0; j < c; j++) { pair<long long, long long> x; in(x.first, x.second); v.push_back(x); } v.push_back(v[0]); for (long long j = 1; j < c + 1; j++) { vec[i].push_back(process(v[j] - v[j - 1])); } } int q; in(q); vector<pair<pair<long long, long long>, long long>> query(q); for (long long i = 0; i < q; i++) { in(query[i].first.first, query[i].first.second); query[i].second = i; } sort(begin(query), end(query), cmp); int cur = 0; map<pair<long long, long long>, int> occ; for (auto q : query) { while (cur < q.first.second) { ++cur; for (auto v : vec[cur]) { bit.update(occ[v], -1); bit.update(cur, 1); occ[v] = cur; } } ans[q.second] = bit.query(q.first.first, q.first.second); } {}; for (long long i = 0; i < q; i++) cout << ans[i] << endl; } } // namespace SOLVE signed main() { int t = 1; while (t--) { SOLVE::main(); } return 0; }

#include <bits/stdc++.h> using namespace std; char matrix[2020][2020]; int dp[2020][2020]; pair<int, int> p[2020 * 2020]; int n, m; int fill(int i, int j) { if (i < 0 || j < 0 || i >= n || j >= m) { return 0; } if (dp[i][j] == -1) { int start_x = i; int start_y = j; int count = 0; p[count++] = {i, j}; if (matrix[i][j] == U ) { i = i - 1; } else if (matrix[i][j] == L ) { j = j - 1; } else if (matrix[i][j] == D ) { i = i + 1; } else { j = j + 1; } while (i != start_x || j != start_y) { p[count++] = {i, j}; if (matrix[i][j] == U ) { i = i - 1; } else if (matrix[i][j] == L ) { j = j - 1; } else if (matrix[i][j] == D ) { i = i + 1; } else { j = j + 1; } } for (int i = 0; i < count; i++) { dp[p[i].first][p[i].second] = (-1 * count); } return 0; } if (dp[i][j] != 0) { return dp[i][j]; } dp[i][j] = -1; int ans = 1; if (matrix[i][j] == U ) { ans += abs(fill(i - 1, j)); } else if (matrix[i][j] == L ) { ans += abs(fill(i, j - 1)); } else if (matrix[i][j] == D ) { ans += abs(fill(i + 1, j)); } else { ans += abs(fill(i, j + 1)); } if (dp[i][j] < -1) { ans = dp[i][j]; } return dp[i][j] = ans; } int main() { int t; cin >> t; while (t--) { cin >> n >> m; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> matrix[i][j]; } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { dp[i][j] = 0; } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { fill(i, j); } } int ans = dp[0][0]; int x = 0; int y = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (abs(dp[i][j]) > ans) { x = i; y = j; ans = abs(dp[i][j]); } } } cout << (x + 1) << << (y + 1) << << ans << endl; } }

#include <bits/stdc++.h> int n, m; int f[2000010], mx, mn = (int)1e7; short check(int x) { int i; for (i = x; i <= mx; i += x) if (f[i + x - 1] >= i && f[i + x - 1] - i > m) return 0; return 1; } int main() { int i, x; scanf( %d%d , &n, &m); for (i = 1; i <= n; i++) { scanf( %d , &x); f[x] = x; mx = mx > x ? mx : x; mn = mn < x ? mn : x; } mx <<= 1; for (i = 1; i <= mx; i++) f[i] = f[i] > f[i - 1] ? f[i] : f[i - 1]; mx >>= 1; for (i = mn; i > 1; i--) if (check(i)) break; printf( %d , i); return 0; }

#include <bits/stdc++.h> using namespace std; string raspuns; long long n, x, y; int read() { char c; int nr = 0; c = getchar(); while (c < 0 || c > 9 ) c = getchar(); while (c >= 0 && c <= 9 ) { nr = nr * 10 + (c - 0 ); c = getchar(); } return nr; } int main() { n = read(); long long sa, sg; sa = sg = 0; for (long long i = 0; i < n; i++) { x = read(); y = read(); if (sa + x - sg <= 500) { sa += x; raspuns += A ; } else if (sg + y - sa <= 500) { sg += y; raspuns += G ; } } if (raspuns != 0 ) cout << raspuns; else cout << -1 ; return 0; }

#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { for (; b; a %= b, swap(a, b)) ; return a; } int main() { ios::sync_with_stdio(0); cin.tie(0), cout.tie(0); int t; cin >> t; while (t--) { int n, x; cin >> n >> x; int cnt = 0; for (int i = 0; i < n - 1; i++) { int u, v; cin >> u >> v; if (u == x || v == x) cnt++; } if (cnt <= 1) { cout << Ayush n ; continue; } if (n % 2) cout << Ashish n ; else cout << Ayush n ; } }

#include <bits/stdc++.h> using namespace std; const int maxn = 1005; int in[maxn]; int t1, t2; struct edge { int v, w; }; vector<edge> g[maxn]; void dfs(int u, int fa) { if (in[u] == 1) { if (!t1) t1 = u; t2 = u; } for (edge e : g[u]) { if (e.v == fa) continue; dfs(e.v, u); } } struct Ans { int a, b, c; }; vector<Ans> ans; void add(int a, int b, int c) { if (a == b || !c) return; ans.push_back({a, b, c}); } int main() { int n; cin >> n; for (int i = 1; i < n; ++i) { int u, v, w; cin >> u >> v >> w; in[u]++, in[v]++; g[u].push_back({v, w}); g[v].push_back({u, w}); } for (int i = 1; i <= n; ++i) if (in[i] == 2) { cout << NO << endl; return 0; } cout << YES << endl; for (int u = 1; u <= n; ++u) { for (edge e : g[u]) { int v = e.v, w = e.w; if (v < u) continue; int a1, a2, b1, b2; t1 = t2 = 0; dfs(u, v); a1 = t1, a2 = t2; t1 = t2 = 0; dfs(v, u); b1 = t1, b2 = t2; add(a1, b1, w / 2); add(a2, b2, w / 2); add(a1, a2, -w / 2); add(b1, b2, -w / 2); } } cout << ans.size() << endl; for (auto p : ans) cout << p.a << << p.b << << p.c << endl; }

#include<bits/stdc++.h> #define lowbit(x) ((x)&(-(x))) #define DEBUG fprintf(stderr, Running on Line %d in Function %s n ,__LINE__,__FUNCTION__) #define SZ(x) ((int)x.size()) #define mkpr std::make_pair #define pb push_back typedef long long ll; typedef unsigned int uint; typedef unsigned long long ull; typedef std::pair<int,int> pi; typedef std::pair<ll,ll> pl; using std::min; using std::max; const int inf=0x3f3f3f3f,Inf=0x7fffffff; const ll INF=0x3f3f3f3f3f3f3f3f; std::mt19937 rnd(std::chrono::steady_clock::now().time_since_epoch().count()); template <typename _Tp>_Tp gcd(const _Tp &a,const _Tp &b){return !b?a:gcd(b,a%b);} template <typename _Tp>inline _Tp abs(const _Tp &a){return a>=0?a:-a;} template <typename _Tp>inline void chmax(_Tp &a,const _Tp &b){a=a<b?b:a;} template <typename _Tp>inline void chmin(_Tp &a,const _Tp &b){a=a<b?a:b;} template <typename _Tp>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>void read(_Tp &t,Args &...args){read(t);read(args...);} 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=0,tar-s; } const int max_len=1<<16,N=max_len+5,mod=998244353; template<typename _Tp1,typename _Tp2>inline void add(_Tp1 &a,_Tp2 b){(a+=b)>=mod&&(a-=mod);} template<typename _Tp1,typename _Tp2>inline void sub(_Tp1 &a,_Tp2 b){(a-=b)<0&&(a+=mod);} template<typename _Tp>inline _Tp _sub(_Tp a,const _Tp &b){(a+=mod-b)>=mod&&(a-=mod);return a;} ll ksm(ll a,ll b=mod-2){ll res=1;while(b){if(b&1)res=res*a%mod;a=a*a%mod,b>>=1;}return res;} typedef std::vector<int> poly; void print(const poly &a) { for(auto it:a) printf( %d ,it); printf( n ); } poly operator << (const poly &a,uint b) { poly o(a.size()+b); for(uint i=0;i<b;++i) o[i]=0; for(uint i=0;i<a.size();++i) o[i+b]=a[i]; return o; } inline poly operator <<= (poly &a,uint b){return a=a<<b;} inline poly operator >> (const poly &a,uint b){return b>=a.size()?poly():poly{a.begin()+b,a.end()};} inline poly operator >>= (poly &a,uint b){return a=b>=a.size()?poly():poly{a.begin()+b,a.end()};} poly operator += (poly &a,const poly &b) { if(SZ(b)>SZ(a)) a.resize(SZ(b)); for(uint i=0;i<b.size();++i) add(a[i],b[i]); return a; } inline poly operator + (const poly &a,const poly &b){poly tmp(a);tmp+=b;return tmp;} poly operator -= (poly &a,const poly &b) { if(SZ(b)>SZ(a)) a.resize(SZ(b)); for(uint i=0;i<b.size();++i) sub(a[i],b[i]); return a; } inline poly operator - (const poly &a,const poly &b){poly tmp(a);tmp-=b;return tmp;} ull Omgs[N]; int r[N]; const ull Omg=ksm(3,(mod-1)/max_len); int getlen(int len) { int limit=1;while(limit<len)limit<<=1; for(int i=0;i<limit;++i)r[i]=(r[i>>1]>>1)|(i&1?limit>>1:0); return limit; } void setup() { Omgs[max_len>>1]=1; for(int i=(max_len>>1)+1;i<max_len;++i) Omgs[i]=Omgs[i-1]*Omg%mod; for(int i=(max_len>>1)-1;i>0;--i) Omgs[i]=Omgs[i<<1]; } void dft(ull *A,int limit) { for(int i=0;i<limit;++i)if(i<r[i])std::swap(A[i],A[r[i]]); for(int len=1;len<limit;len<<=1) { if(len==262144)for(int i=0;i<limit;++i)A[i]%=mod; for(int i=0;i<limit;i+=len<<1) { ull *p=A+i,*q=A+i+len,*w=Omgs+len; for(int _=0;_<len;++_,++p,++q,++w){ull tmp=*q**w%mod;*q=*p+mod-tmp,*p+=tmp;} } } for(int i=0;i<limit;++i)A[i]%=mod; } void idft(ull *A,int limit) { std::reverse(A+1,A+limit),dft(A,limit); ull inv=mod-(mod-1)/limit;for(int i=0;i<limit;++i) A[i]=inv*A[i]%mod; } ull _f[N],_g[N]; poly operator * (const poly &a,const poly &b) { uint len=a.size()+b.size()-1; if(a.size()<=64u||b.size()<=64u) { poly c(len); for(uint i=0;i<a.size();++i) for(uint j=0;j<b.size();++j) add(c[i+j],1ull*a[i]*b[j]%mod); return c; } int limit=getlen(len); memset(_f,0,limit<<3);for(uint i=0;i<a.size();++i)_f[i]=a[i]; memset(_g,0,limit<<3);for(uint i=0;i<b.size();++i)_g[i]=b[i]; dft(_f,limit),dft(_g,limit); for(int i=0;i<limit;++i)_f[i]=1ULL*_f[i]*_g[i]%mod; idft(_f,limit); poly ans(len);for(uint i=0;i<len;++i)ans[i]=_f[i]; return ans; } poly mul(const poly &a,const poly &b,uint len,bool need=true) { if(a.size()<=64u||b.size()<=64u) { poly c(SZ(a)+SZ(b)-1); for(uint i=0;i<a.size();++i) for(uint j=0;j<b.size();++j) add(c[i+j],1ull*a[i]*b[j]%mod); return c.resize(len),c; } int limit=getlen(len); memset(_f,0,limit<<3);for(uint i=0;i<a.size();++i)_f[i]=a[i]; dft(_f,limit); if(need) { memset(_g,0,limit<<3);for(uint i=0;i<b.size();++i)_g[i]=b[i]; dft(_g,limit); } for(int i=0;i<limit;++i)_f[i]=1ULL*_f[i]*_g[i]%mod; idft(_f,limit); poly ans(len);for(uint i=0;i<len;++i)ans[i]=_f[i]; return ans; } inline poly operator *= (poly &a,const poly &b){return a=a*b;} template<typename _Tp>inline poly operator *= (poly &a,const _Tp &b) { for(auto &&it:a) it=1ll*it*b%mod; return a; } template<typename _Tp>inline poly operator * (poly a,const _Tp &b){return a*=b;} template<typename _Tp>inline poly operator * (const _Tp &b,poly a){return a*=b;} template<typename _Tp>inline poly operator /= (poly &a,const _Tp &b) { ull inv=ksm(b);for(auto &&it:a) it=1ll*it*inv%mod; return a; } template<typename _Tp>inline poly operator / (poly a,const _Tp &b){return a/=b;} template<typename _Tp>inline poly operator / (const _Tp &b,poly a){return a/=b;} ll fac[N],ifac[N],inv[N]; poly getcoef(poly h,ll m,int c) { static int I[N],P[N]; int d=SZ(h)-1; for(int i=0;i<=d;++i)h[i]=1LL*h[i]*ifac[d-i]%mod*((d-i)&1?mod-ifac[i]:ifac[i])%mod; for(int i=0;i<c+d;++i)I[i]=m-d+i; P[0]=I[0];for(int i=1;i<c+d;++i)P[i]=1LL*I[i]*P[i-1]%mod; ll tp=ksm(P[c+d-1]); for(int i=c+d-1;i>=0;--i)P[i]=1LL*tp*(i?P[i-1]:1)%mod,tp=tp*I[i]%mod; poly a=mul(poly{P,P+c+d},h,c+d); ll cur=1;for(int i=1;i<=d;++i)cur=cur*(m-i)%mod; poly ans(c); for(int k=0;k<c;++k) cur=cur*(m+k)%mod,ans[k]=cur*a[d+k]%mod,cur=cur*P[k]%mod; return ans; } int f[N],S; void init(int n) { S=(int)sqrt(n); int cur=0; while(1LL*S*S<n)++S; while(1LL*S*S>n)--S; memset(f,0,(S+1)<<2),f[0]=1; for(int i=16;i>=0;--i) { if(cur) { poly h={f,f+cur+1},a=getcoef(h,cur+1,cur); h.resize(SZ(a)+SZ(h));for(int i=0;i<cur;++i)h[i+cur+1]=a[i]; poly b=getcoef(h,1LL*cur*ksm(S)%mod,cur+cur+1); cur<<=1;for(int i=0;i<=cur;++i)f[i]=1LL*h[i]*b[i]%mod; } if((S>>i)&1) { f[++cur]=1; for(int j=0;j<cur;++j)f[j]=1LL*f[j]*(j*S+cur)%mod; for(int i=1;i<=cur;++i)f[cur]=1LL*f[cur]*(cur*S+i)%mod; } } } ll getfac(int n) { int i,ans=1; for(i=0;(i+1)*S<=n;++i)ans=1LL*ans*f[i]%mod; for(int j=i*S+1;j<=n;++j)ans=1LL*ans*j%mod; return ans; } int a[1005],s; inline ll getF(int a){return (getfac(s+s-1)*ksm(getfac(s+s-a-1))%mod*ksm(getfac(s))%mod*getfac(s-a)+mod-1)%mod;} int main() { setup(); fac[0]=fac[1]=inv[0]=inv[1]=ifac[0]=ifac[1]=1;for(int i=2;i<N;++i)fac[i]=fac[i-1]*i%mod,inv[i]=inv[mod%i]*(mod-mod/i)%mod,ifac[i]=ifac[i-1]*inv[i]%mod; int n;read(n); for(int i=1;i<=n;++i)read(a[i]),s+=a[i]; init(s+s); int ans=mod-getF(s); for(int i=1;i<=n;++i)add(ans,getF(a[i])); ans=1LL*(mod-2)*s%mod*ksm(s-1)%mod*ans%mod; printf( %d n ,ans); return 0; }

#include <bits/stdc++.h> using namespace std; namespace whatever { int readu() { char ch = getchar(); while (!isdigit(ch)) ch = getchar(); int value = ch - 0 ; ch = getchar(); while (isdigit(ch)) { value = value * 10 + ch - 0 ; ch = getchar(); } return value; } void writeu(int n) { if (n < 10) putchar(n + 0 ); else { writeu(n / 10); putchar(n % 10 + 0 ); } } namespace tree { vector<int> tree_adj[100001 + 100000]; int size[100001 + 100000]; int heavy[100001 + 100000]; int depth[100001 + 100000]; int father[100001 + 100000]; void dfs1(int cur) { size[cur] = 1; for (auto to : tree_adj[cur]) if (to != father[cur]) { depth[to] = depth[cur] + 1; father[to] = cur; dfs1(to); size[cur] += size[to]; if (size[heavy[cur]] < size[to]) heavy[cur] = to; } } int top[100001 + 100000]; void dfs2(int cur) { for (auto to : tree_adj[cur]) if (to != father[cur]) { top[to] = (to == heavy[cur] ? top[cur] : to); dfs2(to); } } int lca(int a, int b) { while (top[a] != top[b]) { if (depth[top[a]] > depth[top[b]]) a = father[top[a]]; else b = father[top[b]]; } return (depth[a] < depth[b] ? a : b); } } // namespace tree namespace graph { vector<int> adj[100001]; int dfn[100001]; int low[100001]; int dfs_time; int stack[100001]; int top; int bcc_cnt; void dfs(int cur) { dfn[cur] = low[cur] = ++dfs_time; stack[top++] = cur; for (auto to : adj[cur]) { if (!dfn[to]) { dfs(to); low[cur] = min(low[cur], low[to]); if (low[to] == dfn[cur]) { ++bcc_cnt; do { --top; tree::tree_adj[stack[top]].push_back(100000 + bcc_cnt); tree::tree_adj[100000 + bcc_cnt].push_back(stack[top]); } while (stack[top] != to); tree::tree_adj[cur].push_back(100000 + bcc_cnt); tree::tree_adj[100000 + bcc_cnt].push_back(cur); } } else low[cur] = min(low[cur], dfn[to]); } } } // namespace graph void run() { int n = readu(); int m = readu(); int q = readu(); while (--m != -1) { int u = readu(); int v = readu(); graph::adj[u].push_back(v); graph::adj[v].push_back(u); } graph::dfs(1); assert(graph::top == 1); assert(graph::stack[0] == 1); tree::dfs1(1); assert(tree::size[1] == graph::bcc_cnt + n); tree::dfs2(1); while (--q != -1) { int a = readu(); int b = readu(); int l = tree::lca(a, b); int dis = tree::depth[a] - tree::depth[l] + tree::depth[b] - tree::depth[l]; assert(dis % 2 == 0); writeu(dis / 2); putchar( n ); } } } // namespace whatever int main() { whatever::run(); }

#include <bits/stdc++.h> using namespace std; const int mxN = 20; int n, m, a[mxN][mxN], c[4][2] = {{0, 0}, {0, 1}, {1, 1}, {1, 0}}; vector<vector<int>> ops, cs{{0, 2, 3, 1}, {2, 4, 5, 3}, {0, 2, 4, 5, 3, 1}}; array<int, 2> p[mxN * mxN + 1]; set<vector<int>> vis; void oc(int i1, int j1, bool b) { ops.push_back({}); for (int i = 0; i < 4; ++i) ops.back().push_back(a[i1 + c[i ^ b][0]][j1 + c[i ^ b][1]]); for (int i = 2; i >= 0; --i) swap(a[i1 + c[i ^ b][0]][j1 + c[i ^ b][1]], a[i1 + c[(i + 1) ^ b][0]][j1 + c[(i + 1) ^ b][1]]); for (int i = 0; i < 4; ++i) p[a[i1 + c[i][0]][j1 + c[i][1]]] = {i1 + c[i][0], j1 + c[i][1]}; } void cr(bool b) { for (int i = n - 1; i > 2 - b; --i) { for (int j = m - 1; j >= 0; --j) { int d = b ? (j < 2 ? j ^ 1 : j) * n + i + 1 : i * m + (j < 2 ? j ^ 1 : j) + 1, ti = j ? i : i - 1, tj = j ? j : 1; if (!j && p[d][0] == i) { oc(i - 1, 0, 0); oc(i - 2, 0, 0); oc(i - 2, 0, 0); oc(i - 1, 0, 1); oc(i - 2, 0, 0); break; } if (!p[d][0]) oc(0, p[d][1] - (p[d][1] > 0), !p[d][1]); if (!p[d][1]) oc(p[d][0] - 1, 0, 1); while (p[d][1] < tj) oc(p[d][0] - 1, p[d][1], 1); while (p[d][1] > tj) oc(p[d][0] - 1, p[d][1] - 1, 0); while (p[d][0] < ti) oc(p[d][0], p[d][1] - 1, 0); } oc(i - 1, 0, 0); } } bool dfs(vector<int> &u) { bool ok = 1; for (int i = 0; i < 5 && ok; ++i) ok = u[i] < u[i + 1]; if (ok) return 1; vis.insert(u); for (vector<int> &c : cs) { vector<int> v = u; ops.push_back({}); for (int ci : c) ops.back().push_back(u[ci]); for (int i = c.size() - 2; i >= 0; --i) swap(v[c[i]], v[c[i + 1]]); if (vis.find(v) == vis.end() && dfs(v)) return 1; ops.pop_back(); } return 0; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m; for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) cin >> a[i][j], p[a[i][j]] = {i, j}; cr(0); for (int i = 0; i < n; ++i) for (int j = i + 1; j < m; ++j) swap(a[i][j], a[j][i]); for (int i = 1; i <= n * m; ++i) swap(p[i][0], p[i][1]); swap(n, m); cr(1); vector<int> v; for (int j = 0; j < 3; ++j) for (int i = 0; i < 2; ++i) v.push_back(a[i][j]); dfs(v); cout << ops.size(); for (vector<int> op : ops) { cout << n << op.size(); for (int oi : op) cout << << oi; } }

#include <bits/stdc++.h> using namespace std; void solve(vector<int> &v, int n, int k) { set<int> s; for (int i = 0; i < n; i++) s.insert(v[i]); if (s.size() >= k) { vector<int> res; cout << YES << endl; for (auto x : s) { for (int i = 0; i < n; i++) { if (x == v[i]) { res.push_back(i + 1); break; } } } for (int i = 0; i < k; i++) { cout << res[i] << ; } cout << endl; } else cout << NO << endl; } int main() { int n, k; cin >> n >> k; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; solve(a, n, k); return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 200010; int n, a[7], cnt[7], t[N]; void GetData() { int i; scanf( %d , &n); for (i = 0; i < 3; ++i) scanf( %d , &a[i]); for (i = 0; i < n; ++i) scanf( %d , &t[i]); } void Solve() { int i, j, ans, mn; bool flag = false; sort(a, a + 3); sort(t, t + n); a[3] = a[0] + a[1]; a[4] = a[0] + a[2]; a[5] = a[1] + a[2]; a[6] = a[3] + a[2]; if (t[n - 1] > a[6]) ans = -1, mn = 0; else { if (a[2] > a[3]) { swap(a[2], a[3]); flag = true; } memset(cnt, 0, sizeof(cnt)); for (i = 0; i < n; ++i) { for (j = 0; j < 7; ++j) { if (a[j] >= t[i]) { cnt[j]++; break; } } } ans = cnt[6]; for (; cnt[5] > 0; ++ans) { cnt[5]--; if (cnt[0] > 0) cnt[0]--; } for (; cnt[4] > 0; ++ans) { cnt[4]--; if (cnt[1] > 0) cnt[1]--; else if (cnt[0] > 0) cnt[0]--; } if (flag) { for (; cnt[3] > 0; ++ans) { cnt[3]--; if (cnt[0] > 0 && cnt[1] > 0) { cnt[0]--; cnt[1]--; } else if (cnt[0] > 0) { if (cnt[0] > 1) cnt[0] -= 2; else if (cnt[2] > 0) cnt[2]--; else cnt[0]--; } else if (cnt[1] > 0) { if (cnt[2] > 0) cnt[2]--; else cnt[1]--; } else if (cnt[2] > 0) cnt[2]--; } } else { for (; cnt[3] > 0; ++ans) { cnt[3]--; if (cnt[2] > 0) cnt[2]--; else if (cnt[1] > 0) cnt[1]--; else if (cnt[0] > 0) cnt[0]--; } } mn = n; for (i = 0; i <= cnt[2]; ++i) { int a, b, c, tmp = i; a = cnt[0]; b = cnt[1]; c = cnt[2]; c -= i; if (c >= i) c -= i; else if (b >= i - c) b -= i - c, c = 0; else { if (a >= i - c - b) a -= i - c - b; else a = 0; b = c = 0; } if (c > 0) { if (b < c) a = max(0, a - c - c + b); else a = max(0, a - c); b = max(0, b - c); tmp += c; } if (b >= a * 2) tmp += (b + 1) / 2; else tmp += (a + b + 2) / 3; mn = min(mn, tmp); } } printf( %d n , ans + mn); } int main() { GetData(); Solve(); return 0; }

#include <bits/stdc++.h> using namespace std; signed main() { cin.tie(0); cout.tie(0); cin.sync_with_stdio(0); cout.sync_with_stdio(0); long long n; cin >> n; vector<long long> v(n); vector<long long> msuf(n + 1); for (long long i = 0; i < n; ++i) cin >> v[i]; for (long long i = n - 1; i >= 0; --i) msuf[i] = max(v[i] + 1, msuf[i + 1] - 1); for (long long i = 1; i < n; ++i) msuf[i] = max(msuf[i], msuf[i - 1]); long long second = 0; for (long long i = 0; i < n; ++i) second += msuf[i] - v[i] - 1; cout << second << endl; return 0; }

#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; const long long MOD = 1e9 + 7; const long long MODD = 1e9 + 1; const long long MODL = 998244353; const long long N = 200005; const long long INF = 1e18; const long long mx = 1e5 + 1; long long Power(long long x, long long y) { long long r = 1; while (y) { if (y & 1) r = 1ll * r * x % MOD; x = 1ll * x * x % MOD, y >>= 1; } return r; } bool sortbysec(const pair<int, int>& a, const pair<int, int>& b) { return (a.second < b.second); } bool sortstring(const string& a, const string& b) { return a + b < b + a; } long long GCD(long long a, long long b) { if (b == 0) return a; a %= b; return GCD(b, a); } bool isZero(int i) { return i == 0; } int ce(int n, int m) { int ans = 0; if (n % m == 0) ans = n / m; else ans = n / m + 1; return ans; } int solve(int n) { int m, k; cin >> m >> k; int p = 0; int q = 0, qq = 0; int r = 0; int x = ce(n, m); int s = 0; if (n % m != 0) { for (int i = n - 1; i >= 0; i--) { if (i % x == 0 && (n - i) % (n / m) == 0 && (i / x + (n - i) / (n / m) == m)) { s = i; break; } } } s = (n - s) / (n / m); for (int i = 0; i < k; i++) { for (int j = 0; j < m - s; j++) { cout << x << ; r = j * x + p; for (int k = 0; k < x; k++) { cout << r % n + 1 << ; q = r % n; r++; } cout << n ; } qq = q; for (int j = 0; j < s; j++) { cout << n / m << ; r = q + 1; for (int k = 0; k < n / m; k++) { cout << r % n + 1 << ; q = r % n; r++; } cout << n ; } p = qq + 1; } cout << n ; return 0; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t = 1; int n = 0; cin >> t; while (t--) { cin >> n; solve(n); } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int e = 0; int d; int a[15], b[15], l[10]; for (int f = 0; f < n; f++) cin >> a[f]; for (int j = 0; j < m; j++) cin >> b[j]; int rr = 0, tt = 0; for (int g = 0; g < n; g++) { if (a[g] < 0 || a[g] > 9) { for (int r = g; r < n; r++) a[r] = a[r + 1]; rr++; } } for (int h = 0; h < m; h++) { if (b[h] < 0 || b[h] > 9) { for (int t = h; t < m; t++) b[t] = b[t + 1]; tt++; } } if (n >= 0 && n <= 10 && m >= 0 && m <= 10) { for (int c = 0; c < n - rr; c++) { for (int d = 0; d < m - tt; d++) { if (a[c] == b[d]) { l[e] = a[c]; e++; } } } for (int k = 0; k < e; k++) cout << l[k] << ; } }

#include <bits/stdc++.h> using namespace std; int main() { int n, k, a; cin >> n >> k; list<int> lst; map<int, bool> vis; for (int i = 0; i < n; i++) { cin >> a; if (lst.size() < k) { if (vis.find(a) == vis.end()) { lst.push_front(a); vis[a] = true; } continue; } if (vis.find(a) == vis.end() || vis[a] == false) { vis[a] = true; vis[lst.back()] = false; lst.pop_back(); lst.push_front(a); } } cout << lst.size() << endl; for (auto it = lst.begin(); it != lst.end(); it++) cout << (*it) << ; cout << endl; return 0; }

#include <bits/stdc++.h> using namespace std; struct node { int x, y; } A[10005], B[10005], CA[10005], CB[10005]; int tim, qim; node operator+(node a, node b) { return node{a.x + b.x, a.y + b.y}; } node operator-(node a, node b) { return node{a.x - b.x, a.y - b.y}; } int operator*(node a, node b) { return a.x * b.x + a.y * b.y; } int operator/(node a, node b) { return a.x * b.y - a.y * b.x; } bool operator<(node a, node b) { if (a.x == b.x) return a.y > b.y; return a.x < b.x; } void convex_hull(node p[], node c[], int n, int &tp) { sort(p + 1, p + n + 1); tp = 0; for (int i = 1; i <= n; i++) { while (tp > 1 && (c[tp] - p[i]) / (c[tp - 1] - p[i]) >= 0) tp--; c[++tp] = p[i]; } int k = tp--; for (int i = n; i >= 1; i--) { while (tp > k && (c[tp] - p[i]) / (c[tp - 1] - p[i]) >= 0) tp--; c[++tp] = p[i]; } tp--; } bool solve(node a[], node b[], int na, int nb) { random_shuffle(a + 1, a + na + 1); random_shuffle(b + 1, b + nb + 1); for (int i = 1; i <= na; i++) for (int j = i + 1, k; j <= na; j++) { node pa = a[i], pb = a[j]; double lp = -1e100, rp = 1e100, inf = 1e100; for (k = 1; k <= na; k++) { if (k == i) continue; if (k == j) continue; int ta = (a[k] - pa) * (a[k] - pb); int tb = (pa - a[k]) / (pa - pb); assert(tb != 0); if (tb == 0) { if (ta > 0) break; else continue; } double r = (double)ta / tb; if (tb < 0) rp = min(rp, r); else if (tb > 0) lp = max(lp, r); if (lp > rp) break; } if (k <= na || lp > rp) continue; for (k = 1; k <= nb; k++) { int ta = (b[k] - pa) * (b[k] - pb); int tb = (pa - b[k]) / (pa - pb); if (tb == 0) { if (ta <= 0) break; else continue; } double r = (double)ta / tb; if (tb > 0) rp = min(rp, r); else if (tb < 0) lp = max(lp, r); if (lp >= rp) break; } if (k > nb && lp < rp) return 1; } return 0; } int main() { srand(time(NULL)); clock_t st, ed; double totaltime; st = clock(); int n, m, cn, cm, i; scanf( %d%d , &n, &m); for (i = 1; i <= n; i++) scanf( %d%d , &A[i].x, &A[i].y); for (i = 1; i <= m; i++) scanf( %d%d , &B[i].x, &B[i].y); if (n == 1 || m == 1) return puts( YES ), 0; convex_hull(A, CA, n, cn); convex_hull(B, CB, m, cm); if (solve(CA, B, cn, m) || solve(CB, A, cm, n)) puts( YES ); else puts( NO ); ed = clock(); totaltime = (double)(ed - st) / CLOCKS_PER_SEC; }

#include <bits/stdc++.h> using namespace std; int ky[8] = {-1, 1, -2, 2, -2, 2, -1, 1}; int kx[8] = {-2, -2, -1, -1, 1, 1, 2, 2}; int dy[4] = {-1, 0, 1, 0}; int dx[4] = {0, 1, 0, -1}; int ddy[8] = {-1, 0, 1, -1, 1, -1, 0, 1}; int ddx[8] = {-1, -1, -1, 0, 0, 1, 1, 1}; const double PI = acos(-1.0); int n; int c, p; int k; int num; struct Group { int c, p, idx; }; Group a[1000]; Group b[1000]; pair<int, int> t[1000]; int ret1, ret2; int cnt1, cnt2; set<int> s; vector<pair<int, int>> pos1, pos2; int ns; bool comp1(const Group &x, const Group &y) { return x.p > y.p || (x.p == y.p && x.c < y.c); } bool comp2(const Group &x, const Group &y) { return x.c < y.c || (x.c == y.c && x.p > y.p); } int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 0; i < n; i++) { cin >> c >> p; a[i].c = c; a[i].p = p; a[i].idx = i + 1; b[i].c = c; b[i].p = p; b[i].idx = i + 1; } sort(a, a + n, comp1); sort(b, b + n, comp2); cin >> k; for (int i = 0; i < k; i++) { cin >> num; t[i].first = num; t[i].second = i + 1; } sort(t, t + k); for (int i = 0; i < n; i++) { for (int j = 0; j < k; j++) { if (s.count(j)) continue; if (a[i].c <= t[j].first) { ret1 += a[i].p; cnt1++; pos1.push_back({a[i].idx, t[j].second}); s.insert(j); break; } } } s.clear(); for (int i = 0; i < n; i++) { for (int j = 0; j < k; j++) { if (s.count(j)) continue; if (b[i].c <= t[j].first) { ret2 += b[i].p; cnt2++; pos2.push_back({b[i].idx, t[j].second}); s.insert(j); break; } } } if (ret1 <= ret2) { cout << cnt2 << << ret2 << n ; ns = pos2.size(); for (int i = 0; i < ns; i++) cout << pos2[i].first << << pos2[i].second << n ; } else { cout << cnt1 << << ret1 << n ; ns = pos1.size(); for (int i = 0; i < ns; i++) cout << pos1[i].first << << pos1[i].second << n ; } return 0; }

#include <bits/stdc++.h> using namespace std; int di[] = {0, 0, 1, -1, 1, 1, -1, -1}; int dj[] = {1, -1, 0, 0, 1, -1, 1, -1}; inline int calcMedian(vector<int> &vec) { if (((int)vec.size()) % 2 == 1) { return vec[((int)vec.size()) / 2]; } return (vec[((int)vec.size()) / 2 - 1] + vec[((int)vec.size()) / 2]) / 2; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long init = 0, ans = 0; int n, m; cin >> n >> m; vector<int> vec(m); vector<vector<int> > adj(n); for (int i = 0; i < m; ++i) { cin >> vec[i]; --vec[i]; if (i && vec[i] != vec[i - 1]) { ans = init += abs(vec[i] - vec[i - 1]); adj[vec[i]].push_back(vec[i - 1]); adj[vec[i - 1]].push_back(vec[i]); } } for (int i = 0; i < n; ++i) if (((int)adj[i].size())) { sort(adj[i].begin(), adj[i].end()); int median = calcMedian(adj[i]); long long tmp = 0; for (int j = 0; j < ((int)adj[i].size()); ++j) { tmp -= 0LL + abs(adj[i][j] - i); tmp += 0LL + abs(adj[i][j] - median); } if (init + tmp < ans) ans = init + tmp; } cout << ans << n ; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); ; string s; int flag = 0; cin >> s; string at = at , dot = dot ; for (int i = 1; i < s.size() - 3; i++) { if (s.substr(i, 2) == at && flag == 0) { s.replace(i, 2, @ ); flag = 1; } if (s.substr(i, 3) == dot) { s.replace(i, 3, . ); } } int j = s.size() - 3; if (s.substr(j, 2) == at && flag == 0) s.replace(j, 2, @ ); cout << s; return 0; }

#include <bits/stdc++.h> using namespace std; signed main() { long long int n, max = 0; cin >> n; map<string, long long int> m; string s; while (n--) { cin >> s; m[s]++; } for (auto it = m.begin(); it != m.end(); it++) { if (it->second > max) { max = it->second; s = it->first; } } cout << s << endl; }

#include <bits/stdc++.h> using namespace std; const int INF = 1e9; const int maxn = 2 * 1e5; char s[maxn]; int n; int l, r; int is_pal(int l, int r) { for (int i = l; i <= (r + l) / 2; i++) { if (s[i] != s[r - (i - l)]) return 0; } return 1; } int main() { cin >> (s + 1); r = strlen(s + 1); while (is_pal(1, r) && r % 2 == 0 && r) { r /= 2; } if (!is_pal(1, r)) { cout << 1 << endl; } else { r = strlen(s + 1); for (int i = 1; i <= r / 2; i++) { if (!is_pal(1, i)) { cout << 2 << endl; return 0; } } cout << Impossible << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; const int maxn = 300010; int n; long long w[maxn], ma[maxn][2], ans; vector<int> a[maxn]; vector<long long> c[maxn]; bool visited[maxn]; void dfs(int u) { visited[u] = true; for (int i = 0; i < (int)a[u].size(); ++i) { int v = a[u][i]; if (visited[v]) continue; dfs(v); long long vC = ma[v][0] - c[u][i]; if (vC > ma[u][0]) { ma[u][1] = ma[u][0]; ma[u][0] = vC; } else { if (vC > ma[u][1]) { ma[u][1] = vC; } } } ans = max(ans, ma[u][0] + ma[u][1] + w[u]); ma[u][0] += w[u]; ma[u][1] += w[u]; } int main(int argc, const char* argv[]) { cin >> n; for (int i = 1; i <= n; ++i) { cin >> w[i]; } for (int i = 1; i < n; ++i) { int u, v, C; cin >> u >> v >> C; a[u].push_back(v); c[u].push_back(C); a[v].push_back(u); c[v].push_back(C); } dfs(1); cout << ans; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { long long int l, r; cin >> l >> r; (l == r) ? cout << l : cout << 2; }

#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 9; int a[N], b[N]; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) cin >> b[i]; int ok = 1; if (a[1] != b[1]) ok = 0; map<int, int> cnt; cnt[a[1]]++; for (int i = 2; i <= n; i++) { if (a[i] < b[i] && cnt[1] == 0) ok = 0; if (a[i] > b[i] && cnt[-1] == 0) ok = 0; cnt[a[i]] = 1; } if (ok) cout << YES n ; else cout << NO n ; } return 0; }

#include <bits/stdc++.h> using namespace std; void read_file(bool outToFile = true) {} int A[500 + 9]; int n, m, b, mod; int dp[2][500 + 9 + 2][500 + 9 + 1]; int build() { int p = 0; for (int c = 0; c <= b; c++) dp[p][0][c] = dp[!p][0][c] = 1; for (int c = 0; c <= b; c++) for (int r = 1; r <= m; r++) dp[p][r][c] = 0; for (int i = n - 1; i >= 0; i--) { p = !p; for (int r = 1; r <= m; r++) for (int c = b; c >= 0; c--) if (A[i] + c <= b) dp[p][r][c] = (dp[!p][r][c] + dp[p][r - 1][c + A[i]]) % mod; else dp[p][r][c] = dp[!p][r][c]; } return dp[p][m][0]; } int main() { read_file(false); while (cin >> n >> m >> b >> mod) { for (int i = 0; i < n; i++) cin >> A[i]; cout << build() << endl; } }

#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { return a % b == 0 ? b : gcd(b, a % b); } const int MAXN = 100010; int fst[MAXN], sec[MAXN]; int ans[MAXN]; int N, K; int cmp(const int &a, const int &b) { return a > b; } int main() { while (scanf( %d%d , &N, &K) != EOF) { for (int i = 1; i <= N; i++) scanf( %d , &fst[i]); for (int i = 1; i <= N; i++) scanf( %d , &sec[i]); sort(fst + 1, fst + 1 + N, cmp); sort(sec + 1, sec + 1 + N, cmp); int pos = N; int cnt = 0, stepl = 1, stepr = N; while (cnt < N && stepl <= N && stepr >= 1) { if (fst[stepl] + sec[stepr] >= K) { ans[cnt++] = fst[stepl] + sec[stepr]; stepl++; stepr--; } else { stepr--; } } int tot = 0; for (int i = 0; i < N; i++) if (ans[i] >= K) tot++; printf( 1 %d n , min(tot, pos)); } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n; double a, b, jav = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> a >> b; jav += b; } jav /= n; cout << jav + 5; }

#include <bits/stdc++.h> #pragma comment(linker, /STACK:10000000 ) using namespace std; template <class T> T inline sqr(T x) { return x * x; } const double pi = 3.1415926535897932384626433832795; const double eps = 1e-8; long long ans = 0; bool f(long long x, long long y, long long n) { long long s = x + y; long long ch = -n / (x * y) + x + y; long long zn = 2; long long w = ch / zn; if (ch == w * zn) if (1 <= w && w < x && w < y) { long long k1 = x - w, k2 = y - w, k3 = w; if (k3 < k2) return true; if (k1 == k2) { if (k2 == k3) ans++; else ans += 3; } else { if (k2 == k3) ans += 3; else ans += 6; } } return false; } int main() { long long n; cin >> n; if (n % 3 != 0) { cout << 0 ; return 0; } vector<long long> a, b; for (long long i = 1; i * i <= n; i++) if (n % i == 0) { if (i > 0) a.push_back(i); if (i * i != n) b.push_back(n / i); } for (int i = b.size() - 1; i >= 0; i--) a.push_back(b[i]); cerr << a.size() << endl; n /= 3; int Q = 0; for (int i = 0; i < a.size(); i++) if (n % a[i] == 0) { long long d = n / a[i]; int x = lower_bound(a.begin(), a.end(), d) - a.begin(); for (int j = x; j >= i; j--) if (d % a[j] == 0) { if (f(a[i], a[j], n)) break; } } cout << ans; return 0; }

#include <bits/stdc++.h> using namespace std; class p1328D { public: void solve() { int q; cin >> q; while (q--) { int n; cin >> n; vector<int> t(n); for (int i = 0; i < n; i++) cin >> t[i]; int sum = 1; for (int i = 1; i < n; i++) { if (t[i] == t[i - 1]) sum++; } if (sum == n) { cout << 1 << endl; for (int i = 0; i < n; i++) cout << 1 << ; cout << endl; } else if (n % 2 == 0 || t.back() == t.front()) { cout << 2 << endl; for (int i = 0; i < n; i++) cout << i % 2 + 1 << ; cout << endl; } else if (sum > 1) { cout << 2 << endl; bool can = true; for (int i = 0; i < n; i++) { if (can && i > 0 && t[i] == t[i - 1]) { cout << (i - 1) % 2 + 1 << ; can = false; } else if (!can) cout << (i - 1) % 2 + 1 << ; else cout << i % 2 + 1 << ; } cout << endl; } else { cout << 3 << endl; for (int i = 0; i < n - 1; i++) cout << i % 2 + 1 << ; cout << 3 << endl; } } } }; class p1327E { public: long long MOD = 998244353; long long fastpow(long long x, long long n) { if (n == 0) return 1ll; if (n == 1) return x; long long temp = fastpow(x, n / 2); if (n % 2 == 0) return (temp * temp) % MOD; else return (((x * temp) % MOD) * temp) % MOD; } void solve() { int n; cin >> n; if (n < 2) { cout << 10 << endl; return; } int maxn = 2e5 + 10; vector<long long> dp(maxn, 1); for (int i = 1; i <= maxn; i++) { dp[i] = (dp[i - 1] * 10) % MOD; } for (int i = 1; i < n; i++) { long long res = 2 * 10 * 9 * dp[n - i - 1] % MOD; res += (n - i - 1) * 10 * 9 * 9 * dp[n - i - 2] % MOD; cout << res % MOD << ; } cout << 10 << endl; } }; class p161D { public: long long res, k, n; vector<vector<int>> e; vector<vector<long long>> dp; void dfs(int cur, int fa) { dp[cur][0] = 1; for (int c : e[cur]) { if (c == fa) continue; dfs(c, cur); for (int i = 1; i <= k; i++) { dp[cur][i] += dp[c][i - 1]; } } res += dp[cur][k]; long long temp = 0; for (int c : e[cur]) { if (c == fa) continue; for (int i = 0; k - 2 - i >= 0; i++) { temp += dp[c][i] * (dp[cur][k - i - 1] - dp[c][k - i - 2]); } } res += temp / 2; } void solve() { cin >> n >> k; e = vector<vector<int>>(n + 1); dp = vector<vector<long long>>(n + 1, vector<long long>(k + 1, 0)); for (int i = 0; i < n - 1; i++) { int a, b; cin >> a >> b; e[a].push_back(b); e[b].push_back(a); } res = 0; dfs(1, 0); cout << res << endl; } }; class p1437C { public: void solve() { int q; cin >> q; while (q--) { int n; cin >> n; vector<int> t(n); for (int i = 0; i < n; i++) cin >> t[i]; sort(t.begin(), t.end()); vector<vector<int>> dp(2 * n + 1, vector<int>(n + 1, 0x3f3f3f3f)); dp[0][0] = 0; int res = 0x3f3f3f3f; for (int k = 1; k <= 2 * n; k++) { for (int i = 1; i <= n; i++) { for (int pre = 0; pre <= k - 1; pre++) { dp[k][i] = min(dp[k][i], dp[pre][i - 1] + abs(t[i - 1] - k)); } } res = min(res, dp[k][n]); } cout << res << endl; } } }; class p1038D { public: void solve() { int n; cin >> n; vector<long long> a(n); for (int i = 0; i < n; i++) cin >> a[i]; if (n == 1) { cout << a[0] << endl; return; } long long ans = 0, minval = 0x3f3f3f3f; bool pos = 0, neg = 0; for (int i = 0; i < n; i++) { ans += abs(a[i]); pos |= (a[i] >= 0); neg |= (a[i] <= 0); minval = min(minval, abs(a[i])); } if (pos && neg) cout << ans << endl; else cout << ans - 2 * minval << endl; } }; class p1286A { public: void solve() { int n; cin >> n; vector<int> p(n); unordered_set<int> cnt; for (int i = 1; i <= n; i++) cnt.insert(i); for (int i = 0; i < n; i++) { cin >> p[i]; if (p[i] != 0) cnt.erase(p[i]); } int odd = 0, even = 0; for (int i : cnt) if (i % 2) odd++; else even++; vector<vector<vector<int>>> dp( n + 1, vector<vector<int>>(n + 1, vector<int>(2, 0x3f3f3f3f))); dp[0][0][0] = dp[0][0][1] = 0; for (int i = 1; i <= n; i++) { int cur = p[i - 1] % 2; for (int j = 0; j <= min(odd, i); j++) { if (p[i - 1] != 0) { dp[i][j][cur] = min(dp[i - 1][j][0] + (0 ^ cur), dp[i - 1][j][1] + (1 ^ cur)); } else { if (j >= 1) { dp[i][j][1] = min( dp[i][j][1], min(dp[i - 1][j - 1][0] + 1, dp[i - 1][j - 1][1])); } dp[i][j][0] = min(dp[i][j][0], min(dp[i - 1][j][0], dp[i - 1][j][1] + 1)); } } } cout << min(dp[n][odd][0], dp[n][odd][1]) << endl; } }; class p580D { public: void solve() { int n, m, k; cin >> n >> m >> k; vector<long long> a(n + 1); for (int i = 1; i <= n; i++) cin >> a[i]; vector<vector<long long>> cost(n + 1, vector<long long>(n + 1, 0)); vector<vector<long long>> dp(1 << n, vector<long long>(n + 1, 0)); for (int i = 0; i < k; i++) { long long x, y, c; cin >> x >> y >> c; cost[x][y] = c; } long long ans = 0; for (int i = 1; i <= n; i++) { dp[1 << (i - 1)][i] = a[i]; } for (int i = 1; i < (1 << n); i++) { int cnt = bitset<32>(i).count(); for (int j = 1; j <= n; j++) { if ((i & (1 << (j - 1))) != 0) { int pre = i ^ (1 << (j - 1)); for (int k = 1; k <= n; k++) { if ((pre & (1 << (k - 1))) == 0) continue; dp[i][j] = max(dp[i][j], dp[pre][k] + cost[k][j] + a[j]); } if (cnt == m) ans = max(ans, dp[i][j]); } } } cout << ans << endl; } }; class p1335E2 { public: void solve() { int t; cin >> t; while (t--) { int n; cin >> n; vector<int> a(n + 1); for (int i = 1; i <= n; i++) cin >> a[i]; vector<vector<int>> sum(n + 1, vector<int>(205, 0)); vector<vector<int>> pos(205); int res = 0; for (int i = 1; i <= n; i++) { sum[i][a[i]]++; for (int j = 1; j <= 200; j++) { sum[i][j] += sum[i - 1][j]; res = max(res, sum[i][j]); } pos[a[i]].push_back(i); } for (int i = 1; i <= 200; i++) { int len = pos[i].size(); for (int k = 0; k < len - 1 - k; k++) { int l = pos[i][k], r = pos[i][len - 1 - k] - 1; int mid = 0; for (int j = 1; j <= 200; j++) { mid = max(mid, sum[r][j] - sum[l][j]); } res = max(res, 2 * (k + 1) + mid); } } cout << res << endl; } } }; class p1221D { public: void solve() { int t; cin >> t; while (t--) { int n; cin >> n; vector<long long> a(n + 1), b(n + 1); a[0] = 0; for (int i = 1; i <= n; i++) cin >> a[i] >> b[i]; vector<vector<long long>> dp(n + 1, vector<long long>(4, -1)); dp[0][0] = dp[0][1] = dp[0][2] = dp[0][3] = 0; long long res = LONG_LONG_MAX; for (long long i = 1; i <= n; i++) { for (long long j = 0; j <= 2; j++) { for (int k = 0; k <= 2; k++) { if (a[i] + j != a[i - 1] + k) { auto cur = j * b[i] + dp[i - 1][k]; dp[i][j] = dp[i][j] == -1 ? cur : min(dp[i][j], cur); } } if (i == n) res = min(res, dp[i][j]); } } cout << res << endl; } } }; class p543A { public: void solve() { int n, m, b, md; cin >> n >> m >> b >> md; vector<int> a(n + 1); for (int i = 1; i <= n; i++) cin >> a[i]; vector<vector<int>> dp(m + 1, vector<int>(b + 1, 0)); dp[0][0] = 1; for (int i = 1; i <= n; i++) { for (int k = 0; k <= m; k++) { for (int j = 0; j <= b; j++) { if (j >= a[i] && k > 0) dp[k][j] = (dp[k][j] + dp[k - 1][j - a[i]]) % md; } } } long long res = 0; for (int i = 0; i <= b; i++) res = (res + dp[m][i]) % md; cout << res << endl; } }; class p1142A { public: void solve() { int t; cin >> t; while (t--) { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; int left = a[0]; bool ok = 1; int mx = 0; for (int i = 1; i < n; i++) { if (mx > a[i]) { ok = false; break; } a[i] -= mx; if (left >= a[i]) left = a[i]; else { mx += a[i] - left; } } if (ok) cout << YES << endl; else cout << NO << endl; } } }; class p1244D { public: vector<int> node; vector<vector<int>> e; void dfs(int cur, int fa) { node.push_back(cur); for (int c : e[cur]) { if (c == fa) continue; dfs(c, cur); } } void solve() { int n; cin >> n; vector<vector<long long>> cost(n + 1, vector<long long>(3, 0)); for (int j = 0; j < 3; j++) { for (int i = 1; i <= n; i++) { cin >> cost[i][j]; } } e = vector<vector<int>>(n + 1); for (int i = 0; i < n - 1; i++) { int u, v; cin >> u >> v; e[u].push_back(v); e[v].push_back(u); if (e[u].size() > 2 || e[v].size() > 2) { cout << -1 << endl; return; } } int start = -1; for (int i = 1; i <= n; i++) { if (e[i].size() == 1) { start = i; break; } } dfs(start, -1); long long res = 4e18; int x = -1, y = -1; for (int i = 0; i < 3; i++) { for (int k = 0; k < 3; k++) { if (k == i) continue; long long temp = 0; temp += cost[node[0]][i] + cost[node[1]][k]; int a = i, b = k; for (int j = 2; j < node.size(); j++) { for (int l = 0; l < 3; l++) { if (l == a || l == b) continue; temp += cost[node[j]][l]; a = b; b = l; break; } } if (temp < res) { res = temp; x = i; y = k; } } } cout << res << endl; vector<int> ans(n + 1, 0); ans[node[0]] = x; ans[node[1]] = y; for (int i = 2; i < node.size(); i++) { for (int l = 0; l < 3; l++) { if (l == x || l == y) continue; ans[node[i]] = l; x = y; y = l; break; } } for (int i = 1; i <= n; i++) cout << ans[i] + 1 << ; cout << endl; } }; class p519D { public: void solve() { vector<long long> cnt(26, 0); for (int i = 0; i < 26; i++) cin >> cnt[i]; string s; cin >> s; int n = s.size(); vector<long long> sum(n + 1, 0); for (int i = 1; i <= n; i++) { sum[i] = sum[i - 1] + cnt[s[i - 1] - a ]; } long long res = 0; unordered_map<long long, long long> mp[26]; for (int i = 1; i <= n; i++) { int cur = s[i - 1] - a ; res += mp[cur][sum[i] - cnt[cur]]; mp[cur][sum[i]]++; } cout << res << endl; } }; class p1096D { public: void solve() { int n; cin >> n; string s; cin >> s; vector<long long> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } unordered_map<char, int> cnt; cnt[ h ] = 0; cnt[ a ] = 1; cnt[ r ] = 2; cnt[ d ] = 3; vector<long long> dp(4, 0); for (int i = 0; i < n; i++) { if (!cnt.count(s[i])) continue; if (s[i] == h ) dp[0] += a[i]; else dp[cnt[s[i]]] = min(dp[cnt[s[i]] - 1], dp[cnt[s[i]]] + a[i]); } cout << dp[3] << endl; } }; class p1296E1 { public: void solve() { int n; cin >> n; string s; cin >> s; vector<int> res(n); res[0] = 0; char first = s[0]; char second = a - 1; for (int i = 1; i < n; i++) { if (s[i] >= first) { res[i] = 0; first = s[i]; } else { if (s[i] >= second) { res[i] = 1; second = s[i]; } else { cout << NO << endl; return; } } } cout << YES << endl; for (int i : res) cout << i; cout << endl; } }; class p1296E2 { public: void solve() { int n; cin >> n; string s; cin >> s; vector<int> dp(26, 0); int res = 0; vector<int> ans; for (int i = 0; i < n; i++) { int d = 1; for (int j = s[i] - a + 1; j < 26; j++) { d = max(d, dp[j] + 1); } dp[s[i] - a ] = d; ans.emplace_back(d); } for (int i = 0; i < 26; i++) res = max(res, dp[i]); cout << res << endl; for (auto c : ans) cout << c << ; cout << endl; } }; class D { public: void solve() { int t; cin >> t; for (int i = 1; i <= t; i++) { int n, q; cin >> n >> q; vector<long long> a(n); for (int i = 0; i < n; i++) cin >> a[i]; sort(a.begin(), a.end()); vector<long long> sum(n + 1, 0); for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i - 1]; unordered_set<long long> cnt; cnt.insert(sum[n]); queue<pair<long long, long long>> que; que.emplace(0, n - 1); while (!que.empty()) { auto u = que.front(); que.pop(); if (u.first > u.second) continue; auto l = a[u.first], r = a[u.second]; cnt.insert(sum[u.second + 1] - sum[u.first]); if (u.first == u.second) continue; long long mid = (l + r) / 2; auto it = upper_bound(a.begin() + u.first, a.begin() + u.second + 1, mid) - a.begin(); if (it - 1 >= u.first && it - 1 != u.second) que.emplace(u.first, it - 1); if (it <= u.second && it != u.first) que.emplace(it, u.second); } while (q--) { long long s; cin >> s; if (cnt.count(s)) cout << YES << endl; else cout << NO << endl; } } } }; class p1462F { public: void solve() { int t; cin >> t; while (t--) { int n; cin >> n; vector<pair<long long, long long>> c; vector<int> a, b; c.clear(); for (int i = 0; i < n; i++) { long long l, r; cin >> l >> r; a.push_back(l); b.push_back(r); c.emplace_back(l, r); } sort(a.begin(), a.end()); sort(b.begin(), b.end()); int res = n; for (int i = 0; i < n; i++) { auto leftcnt = lower_bound(b.begin(), b.end(), c[i].first) - b.begin(); auto rightcnt = upper_bound(a.begin(), a.end(), c[i].second) - a.begin(); res = min(res, (int)(leftcnt + n - rightcnt)); } cout << res << endl; } } }; class p1324F { public: vector<int> a; vector<int> dp; int n; vector<vector<int>> e; vector<int> fa; int dfs(int cur, int f) { dp[cur] = a[cur]; for (int child : e[cur]) { if (child == f) continue; int next = dfs(child, cur); dp[cur] += max(0, next); } return dp[cur]; } void dfs2(int cur, int fa) { dp[cur] = max(dp[cur], dp[cur] + max(0, dp[fa] - max(0, dp[cur]))); for (int c : e[cur]) { if (c == fa) continue; dfs2(c, cur); } } void solve() { cin >> n; a = vector<int>(n + 1); e = vector<vector<int>>(n + 1); dp = vector<int>(n + 1, 0); fa = vector<int>(n + 1, 0); for (int i = 1; i <= n; i++) { cin >> a[i]; if (a[i] == 0) a[i] = -1; } for (int i = 0; i < n - 1; i++) { int u, v; cin >> u >> v; e[u].emplace_back(v); e[v].emplace_back(u); } dfs(1, 0); dfs2(1, 0); for (int i = 1; i <= n; i++) { cout << dp[i] << ; } cout << endl; } }; class p1446B { public: void solve() { int n, m; cin >> n >> m; string s, t; cin >> s >> t; vector<vector<int>> dp(n + 1, vector<int>(m + 1, 0)); int res = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (s[i - 1] == t[j - 1]) { dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] + 2); } dp[i][j] = max(dp[i][j], max(dp[i - 1][j] - 1, dp[i][j - 1] - 1)); res = max(res, dp[i][j]); } } cout << res << endl; } }; class p1283E { public: void solve() { int n; cin >> n; vector<int> x(n); for (int i = 0; i < n; i++) cin >> x[i]; int maxn = 200005; int ans1 = 0, ans2 = 0; unordered_map<int, int> cnt; for (int i : x) cnt[i]++; for (int i = 1; i <= n; i++) { if (cnt[i] > 0) { ans1++; i += 2; } } for (int i = 1; i <= n + 1; i++) { if (cnt[i - 1] == 0 && cnt[i] > 0) { cnt[i - 1]++; cnt[i]--; } if (cnt[i] > 1) { cnt[i]--; cnt[i + 1]++; } } for (int i = 0; i <= n + 1; i++) { if (cnt[i] > 0) ans2++; } printf( %d %d n , ans1, ans2); } }; class p148D { public: vector<vector<vector<double>>> dp; double dfs(int w, int b, int cur) { if (dp[w][b][cur] >= 0.0) return dp[w][b][cur]; if (w == 0) { if (cur == 0) dp[w][b][cur] = 0.0; else dp[w][b][cur] = 1.0; return dp[w][b][cur]; } if (b == 0) { dp[w][b][cur] = 1.0; return 1.0; } dp[w][b][cur] = 1.0 * w / (w + b); if (cur == 0) { dp[w][b][cur] += (1.0 - dfs(w, b - 1, 1 - cur)) * (1.0 * b / (w + b)); } else { dp[w][b][cur] += (1.0 - dfs(w - 1, b - 1, 1 - cur)) * (1.0 * b / (w + b)) * (1.0 * w / (w + b - 1)); if (b >= 2) { dp[w][b][cur] += (1.0 - dfs(w, b - 2, 1 - cur)) * (1.0 * b / (w + b)) * (1.0 * (b - 1) / (w + b - 1)); } } return dp[w][b][cur]; } void solve() { int w, b; cin >> w >> b; dp = vector<vector<vector<double>>>( w + 1, vector<vector<double>>(b + 1, vector<double>(2, -1))); double res = dfs(w, b, 0); printf( %.9lf n , res); } }; class p95B { public: string ans, s; bool dfs(int id, int sum4, int sum7, bool ok) { if (id >= s.size()) return 1; if (ok) { ans.append(sum4, 4 ); ans.append(sum7, 7 ); return 1; } if (s[id] <= 4 && sum4) { ans.push_back( 4 ); if (dfs(id + 1, sum4 - 1, sum7, s[id] < 4 )) return true; ans.pop_back(); } if (s[id] <= 7 && sum7) { ans.push_back( 7 ); if (dfs(id + 1, sum4, sum7 - 1, s[id] < 7 )) return 1; ans.pop_back(); } return 0; } void solve() { cin >> s; ans.clear(); s.clear(); s.append(100000, 4 ); cout << s << endl; int n = s.size(); if (n % 2 || !dfs(0, n / 2, n / 2, 0)) { ans.append((n + 2) / 2, 4 ); ans.append((n + 2) / 2, 7 ); cout << ans << endl; } else cout << ans << endl; } }; class p182E { public: void solve() { int n, h; cin >> n >> h; vector<vector<vector<int>>> dp( h + 1, vector<vector<int>>(n + 1, vector<int>(2, 0))); for (int i = 0; i < n; i++) dp[0][i][0] = dp[0][i][1] = 1; vector<pair<long long, long long>> a(n); for (int i = 0; i < n; i++) { cin >> a[i].first >> a[i].second; } long long res = 0; for (int i = 1; i <= h; i++) { for (int j = 0; j < n; j++) { int l = a[j].first, w = a[j].second; if (i == l) dp[i][j][0] = (dp[i][j][0] + 1) % 1000000007; if (i == w && l != w) dp[i][j][1] = (dp[i][j][1] + 1) % 1000000007; for (int k = 0; k < n; k++) { if (k == j) continue; int pl = a[k].first, pw = a[k].second; if (i > l) { dp[i][j][0] = (dp[i][j][0] + dp[i - l][k][0] * (l == pw)) % 1000000007; dp[i][j][0] = (dp[i][j][0] + dp[i - l][k][1] * (l == pl)) % 1000000007; } if (i > w && l != w) { dp[i][j][1] = (dp[i][j][1] + dp[i - w][k][0] * (w == pw)) % 1000000007; dp[i][j][1] = (dp[i][j][1] + dp[i - w][k][1] * (w == pl)) % 1000000007; } } if (i == h) res = (res + dp[i][j][0] + dp[i][j][1]) % 1000000007; } } cout << res << endl; } }; class p180E { public: void solve() { int n, m, k; cin >> n >> m >> k; unordered_map<int, vector<int>> cnt; for (int i = 0; i < n; i++) { int x; cin >> x; cnt[x].push_back(i); } int res = 0; for (auto it : cnt) { auto v = it.second; int sz = v.size(); deque<int> q; for (int r = 0; r < sz; r++) { q.push_back(v[r]); while (!q.empty() && q.back() - q.front() + 1 - q.size() > k) q.pop_front(); res = max(res, (int)q.size()); } } cout << res << endl; } }; class p30C { public: struct node { long long x, y, t; double p; node(long long xx, long long yy, long long tt, double pp) : x(xx), y(yy), t(tt), p(pp){}; node(){}; bool operator<(const node &rhs) const { return t < rhs.t; } }; void solve() { int n; cin >> n; vector<node> a; for (int i = 0; i < n; i++) { long long x, y, t; double p; cin >> x >> y >> t >> p; a.emplace_back(x, y, t, p); } sort(a.begin(), a.end()); vector<double> dp(a.size() + 1, 0.0); double res = 0.0; for (int i = 0; i < n; i++) { dp[i] = a[i].p; for (int j = 0; j < i; j++) { long long dis = abs(a[i].x - a[j].x) * abs(a[i].x - a[j].x) + abs(a[i].y - a[j].y) * abs(a[i].y - a[j].y); long long dt = (a[i].t - a[j].t) * (a[i].t - a[j].t); if (dis <= dt) dp[i] = max(dp[i], dp[j] + a[i].p); } res = max(res, dp[i]); } printf( %.7lf , res); } }; class p49D { public: void solve() { int n; cin >> n; string s; cin >> s; vector<vector<int>> dp(n, vector<int>(2, 0x3f3f3f3f)); dp[0][0] = s[0] != 0 ; dp[0][1] = s[0] != 1 ; for (int i = 1; i < n; i++) { dp[i][0] = s[i] != 0 ; dp[i][1] = s[i] != 1 ; dp[i][0] += dp[i - 1][1]; dp[i][1] += dp[i - 1][0]; } cout << min(dp[n - 1][0], dp[n - 1][1]) << endl; } }; class p721C { public: void solve() { int n, m, T; cin >> n >> m >> T; vector<vector<pair<long long, long long>>> e(n + 1); vector<int> in(n + 1, 0); for (int i = 0; i < m; i++) { int u, v, t; cin >> u >> v >> t; e[u].emplace_back(v, t); in[v]++; } queue<int> q; for (int i = 1; i <= n; i++) { if (!in[i]) q.push(i); } vector<vector<int>> dp(n + 1, vector<int>(n + 1, 0x3f3f3f3f)); vector<vector<int>> f(n + 1, vector<int>(n + 1, 0)); dp[1][1] = 0; while (!q.empty()) { int u = q.front(); q.pop(); for (auto &[v, w] : e[u]) { for (int j = 2; j <= n; j++) { if (dp[v][j] > dp[u][j - 1] + w) { dp[v][j] = dp[u][j - 1] + w; f[v][j] = u; } } in[v]--; if (!in[v]) q.push(v); } } int ans = -1; for (int j = n; j >= 1; j--) { if (dp[n][j] <= T) { ans = j; break; } } cout << ans << endl; vector<int> out; for (int i = n, j = ans; f[i][j] != 0; i = f[i][j], j--) out.push_back(i); out.push_back(1); reverse(out.begin(), out.end()); for (int i : out) cout << i << ; cout << endl; } }; class p830A { public: void solve() { long long n, k, p; cin >> n >> k >> p; vector<long long> a(n + 1, 0); vector<long long> b(k + 1, 0); for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= k; i++) cin >> b[i]; sort(a.begin(), a.end()); sort(b.begin(), b.end()); vector<vector<long long>> dp(n + 1, vector<long long>(k + 1, 1e18)); for (int i = 0; i <= k; i++) dp[0][i] = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= k; j++) { dp[i][j] = min(dp[i][j - 1], max(dp[i - 1][j - 1], abs(a[i] - b[j]) + abs(p - b[j]))); } } cout << dp[n][k] << endl; } }; class p983B { public: void solve() { int n; cin >> n; vector<int> a(n + 1); vector<vector<int>> f(n + 1, vector<int>(n + 1, 0)); vector<vector<int>> dp(n + 1, vector<int>(n + 1, 0)); for (int i = 1; i <= n; i++) { cin >> a[i]; dp[i][i] = f[i][i] = a[i]; } for (int i = n; i >= 1; i--) { for (int j = i + 1; j <= n; j++) { f[i][j] = f[i][j - 1] ^ f[i + 1][j]; dp[i][j] = max(dp[i][j], f[i][j]); dp[i][j] = max(dp[i][j], max(dp[i + 1][j], dp[i][j - 1])); } } int q; cin >> q; while (q--) { int l, r; cin >> l >> r; cout << dp[l][r] << endl; } } }; class p671A { public: struct node { long long id; double at, bt; node(int _id, double t, double a, double b) : id(_id), at(a - t), bt(b - t){}; }; void solve() { long long ax, ay, bx, by, tx, ty; cin >> ax >> ay >> bx >> by >> tx >> ty; int n; cin >> n; vector<node> bt1, bt2; auto distance = [](long long x1, long long y1, long long x2, long long y2) { long long dx = abs(x1 - x2); long long dy = abs(y1 - y2); return 1.0 * sqrt(dx * dx + dy * dy); }; double res = 0.0; for (int i = 0; i < n; i++) { long long x, y; cin >> x >> y; auto dt = distance(x, y, tx, ty); auto da = distance(x, y, ax, ay); auto db = distance(x, y, bx, by); res += 2.0 * dt; bt1.emplace_back(i, dt, da, db); bt2.emplace_back(i, dt, da, db); } sort(bt1.begin(), bt1.end(), [](const node &a, const node &b) { return a.at < b.at; }); sort(bt2.begin(), bt2.end(), [](const node &a, const node &b) { return a.bt < b.bt; }); int i = 0, j = 0; double temp = min(res + bt1[i].at, res + bt2[j].bt); if (bt1[i].id != bt2[j].id) { res += bt1[i].at; res += bt2[j].bt; } else { res += min(bt1[0].at + (bt2.size() > 1 ? bt2[1].bt : 0), bt2[0].bt + (bt1.size() > 1 ? bt1[1].at : 0)); } res = min(temp, res); printf( %.15f n , res); } }; class p274B { public: int n; vector<vector<int>> edge; vector<long long> v; pair<long long, long long> dfs(int cur, int fa) { long long now = v[cur]; long long curp = 0, curg = 1e18; for (int i : edge[cur]) { if (i == fa) continue; auto next = dfs(i, cur); curp = max(next.first, curp); if (next.second != 0) curg = min(next.second, curg); } if (curg == 1e18) { curg = 0; } now += -curg - curp; if (now >= 0) curp += now; else curg += now; return {curp, curg}; } void solve() { cin >> n; edge = vector<vector<int>>(n + 1); v = vector<long long>(n + 1); for (int i = 0; i < n - 1; i++) { int a, b; cin >> a >> b; edge[a].push_back(b); edge[b].push_back(a); } for (int i = 1; i <= n; i++) cin >> v[i]; pair<long long, long long> it = dfs(1, 0); cout << abs(it.first) + abs(it.second) << endl; } }; class p933A { public: void solve() { int n; cin >> n; vector<int> a(n + 1); for (int i = 1; i <= n; i++) cin >> a[i]; vector<int> two(n + 2, 0), one(n + 1, 0); if (a.back() == 2) two[n]++; for (int i = n - 1; i >= 1; i--) { two[i] += two[i + 1]; if (a[i] == 2) two[i]++; } for (int i = 1; i <= n; i++) { one[i] += one[i - 1]; if (a[i] == 1) one[i]++; } int res = 0; for (int l = 1; l <= n; l++) { int s = 0, t = 0; for (int r = l; r <= n; r++) { if (a[r] == 1) { s = max(s, t) + 1; } else { t++; } res = max(res, one[l - 1] + two[r + 1] + max(s, t)); } } cout << res << endl; } }; class p527D { public: void solve() { int n; cin >> n; vector<pair<long long, long long>> v(n); for (int i = 0; i < n; i++) { cin >> v[i].first >> v[i].second; } sort(v.begin(), v.end(), [](const pair<long long, long long> &a, const pair<long long, long long> &b) { return a.first + a.second < b.first + b.second; }); long long res = 1; int last = 0; for (int i = 1; i < n; i++) { if (v[i].first - v[i].second >= v[last].first + v[last].second) { res++; last = i; } } cout << res << endl; } }; class p1083A { public: vector<vector<pair<long long, long long>>> edge; vector<long long> dp; long long ans = 0; vector<long long> w; void dfs(int u, int fa) { dp[u] = w[u]; for (auto &[v, c] : edge[u]) { if (v == fa) continue; dfs(v, u); ans = max(ans, dp[u] + dp[v] - c); dp[u] = max(dp[u], w[u] + dp[v] - c); } } void solve() { int n; cin >> n; w = vector<long long>(n + 1); ans = 0; for (int i = 1; i <= n; i++) { cin >> w[i]; ans = max(ans, w[i]); } edge = vector<vector<pair<long long, long long>>>(n + 1); dp = vector<long long>(n + 1, 0); for (int i = 0; i < n - 1; i++) { long long u, v, c; cin >> u >> v >> c; edge[u].emplace_back(v, c); edge[v].emplace_back(u, c); } dfs(1, 0); cout << ans << endl; } }; class p909C { public: void solve() { int n; cin >> n; string s(n, ); for (int i = 0; i < n; i++) cin >> s[i]; vector<vector<long long>> dp(n, vector<long long>(n + 1, 0)); dp[0][0] = 1; for (int i = 1; i < n; i++) { if (s[i - 1] == f ) { for (int j = 0; j < n; j++) { dp[i][j + 1] = dp[i - 1][j]; } } else { long long cur = 0; for (int k = n; k >= 0; k--) { cur = (cur + dp[i - 1][k]) % 1000000007; dp[i][k] = (dp[i][k] + cur) % 1000000007; } } } long long res = 0; for (int i = 0; i <= n; i++) res = (res + dp[n - 1][i]) % 1000000007; cout << res << endl; } }; class p743D { public: int n; vector<long long> a; vector<vector<long long>> edge; vector<vector<long long>> dp; long long ans = 0; void dfs(int u, int fa) { dp[u][0] = a[u]; dp[u][1] = -4e18; long long mx1 = -4e18, mx2 = -4e18; for (int v : edge[u]) { if (v == fa) continue; dfs(v, u); dp[u][0] += dp[v][0]; if (dp[v][1] >= mx1) { mx2 = mx1; mx1 = dp[v][1]; } else if (dp[v][1] >= mx2) mx2 = dp[v][1]; dp[u][1] = max(dp[u][1], dp[v][1]); } if (mx1 != -4e18 && mx2 != -4e18) ans = max(ans, mx1 + mx2); dp[u][1] = max(dp[u][0], dp[u][1]); } void solve() { cin >> n; a = vector<long long>(n + 1); for (int i = 1; i <= n; i++) cin >> a[i]; edge = vector<vector<long long>>(n + 1); for (int i = 0; i < n - 1; i++) { int u, v; cin >> u >> v; edge[u].push_back(v); edge[v].push_back(u); } if (n <= 2) { cout << Impossible << endl; return; } dp = vector<vector<long long>>(n + 1, vector<long long>(2, 0)); ans = -4e18; dfs(1, 0); if (ans == -4e18) cout << Impossible << endl; else cout << ans << endl; } }; class p869C { public: void solve() { int a, b, c; cin >> a >> b >> c; vector<vector<long long>> f(5005, vector<long long>(5005, 0)); long long md = 998244353; f[0][0] = 1; for (int i = 1; i <= 5000; i++) { f[i][0] = 1; for (int j = 1; j <= i; j++) { f[i][j] = (f[i - 1][j - 1] + f[i - 1][j]) % md; } } long long ans1 = 0, ans2 = 0, ans3 = 0; auto compute = [&f, &md](long long &ans, int a, int b) { long long cur = 1; for (long long k = 0; k <= min(a, b); k++, cur *= k, cur %= md) { ans += (((f[a][k] * f[b][k] + md) % md) * cur) % md; ans %= md; } return ans; }; long long res = ((compute(ans1, a, b) * compute(ans2, b, c) % md) * compute(ans3, a, c)) % md; cout << (res + md) % md << endl; } }; class p768C { public: void solve() { int n, k, x; cin >> n >> k >> x; vector<int> a(n); int freq[1024]; memset(freq, 0, sizeof(freq)); for (int i = 0; i < n; i++) { cin >> a[i]; freq[a[i]]++; } while (k--) { vector<int> tmp(1024, 0); for (int i = 0; i < 1024; i++) tmp[i] = freq[i]; int pre = 0; for (int i = 0; i < 1024; i++) { if (tmp[i] <= 0) continue; int cnt = 0; if (pre == 0) cnt = (tmp[i] + 1) / 2; else cnt = (tmp[i]) / 2; freq[i] -= cnt; freq[i ^ x] += cnt; pre ^= tmp[i] & 1; } } int mi = 2048, mx = 0; for (int i = 0; i < 1024; i++) { if (freq[i] > 0) { mi = min(mi, i); mx = max(mx, i); } } cout << mx << << mi << endl; } }; class p1107D { public: void solve() { int n; cin >> n; vector<vector<int>> g(n + 1, vector<int>(n + 1, 0)); auto f = [](char c) { if (c <= 9 ) return c - 0 ; else return 10 + (c - A ); }; for (int i = 1; i <= n; i++) { string s; cin >> s; for (int j = 0; j < s.size(); j++) { int cur = f(s[j]); for (int k = 3; k >= 0; k--) { g[i][j * 4 + 4 - k] = (cur & (1 << k)) != 0 ? 1 : 0; } } } vector<vector<int>> sum(n + 1, vector<int>(n + 1, 0)); for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { sum[i][j] = sum[i][j - 1] + sum[i - 1][j] + g[i][j] - sum[i - 1][j - 1]; } } auto getSub = [&sum](int l, int r, int x) { return sum[l + x - 1][r + x - 1] - sum[l - 1][r + x - 1] - sum[l + x - 1][r - 1] + sum[l - 1][r - 1]; }; for (int x = n; x > 0; x--) { if ((n % x) == 0) { bool ok = true; for (int i = 1; i <= n; i += x) { for (int j = 1; j <= n; j += x) { int cur = getSub(i, j, x); if (cur != x * x && cur != 0) { ok = false; break; } } if (!ok) break; } if (ok) { cout << x << endl; break; } } } } }; class p917A { public: long long ans = 0; vector<int> dp; void solve() { ans = 0; string s; cin >> s; int n = s.size(); vector<vector<int>> f(n + 1, vector<int>(n + 1, 0)); vector<vector<int>> g(n + 1, vector<int>(n + 1, 0)); for (int i = 0; i < n; i++) { bool ok = true; int cnt = 0; for (int j = i; j < n; j++) { if (s[j] == ) ) cnt--; else cnt++; if (cnt < 0) ok = false; f[i][j] = ok; } } for (int i = 0; i < n; i++) { int cnt = 0; bool ok = true; for (int j = i; j >= 0; j--) { if (s[j] == ( ) cnt--; else cnt++; if (cnt < 0) ok = false; g[j][i] = ok; } } for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j += 2) { if (f[i][j] && g[i][j]) ans++; } } cout << ans << endl; } }; class p946D { public: void solve() { int n, m, k; cin >> n >> m >> k; vector<string> a(n + 1); for (int i = 1; i <= n; i++) cin >> a[i]; vector<vector<int>> dp(n + 1, vector<int>(k + 1, 0x3f3f3f3f)); for (int i = 0; i <= k; i++) dp[0][i] = 0; vector<vector<int>> cnt(n + 1, vector<int>(k + 1, 0x3f3f3f3f)); for (int i = 1; i <= n; i++) { unordered_map<int, int> last; int sum = 0, total = 0; for (int j = 1; j <= m; j++) total += (a[i][j - 1] == 1 ? 1 : 0); last[0] = 0; for (int j = 1; j <= m; j++) { if (a[i][j - 1] == 1 ) sum++; last[sum] = j; for (int l = 0; l <= min(total, k); l++) { if (last.count(sum - total + l)) { cnt[i][l] = min(cnt[i][l], j - last[sum - total + l]); } } } for (int l = 0; l <= k; l++) { for (int r = 0; r <= min(total, l); r++) { dp[i][l] = min(dp[i][l], dp[i - 1][l - r] + cnt[i][r]); } } } cout << dp[n][k] << endl; } }; class p666A { public: void solve() { string s; cin >> s; int n = s.size(); vector<vector<int>> dp(n + 1, vector<int>(2, -1)); set<string> res; dp[n][0] = dp[n][1] = 1; dp[n - 2][0] = 1; if (n >= 7) res.insert(s.substr(n - 2, 2)); dp[n - 3][1] = 1; if (n >= 8) res.insert(s.substr(n - 3, 3)); for (int i = n - 4; i >= 5; i--) { if (dp[i + 2][1] == 1 || (dp[i + 2][0] == 1 && (s[i] != s[i + 2] || s[i + 1] != s[i + 3]))) { dp[i][0] = 1; res.insert(s.substr(i, 2)); } if (dp[i + 3][0] == 1 || (dp[i + 3][1] == 1 && (s[i] != s[i + 3] || s[i + 1] != s[i + 4] || s[i + 2] != s[i + 5]))) { dp[i][1] = 1; res.insert(s.substr(i, 3)); } } cout << res.size() << endl; for (string s : res) cout << s << endl; } }; class p1016C { public: void solve() { long long n; cin >> n; vector<vector<long long>> a(2, vector<long long>(n + 1, 0)); for (int i = 0; i < 2; i++) { for (int j = 1; j <= n; j++) cin >> a[i][j]; } vector<vector<long long>> sum1(2, vector<long long>(n + 1, 0)), sum2(2, vector<long long>(n + 1, 0)), sum3(2, vector<long long>(n + 1, 0)); for (int i = 0; i < 2; i++) { for (int j = 1; j <= n; j++) { sum3[i][j] += sum3[i][j - 1] + a[i][j]; sum1[i][j] += sum1[i][j - 1] + (j - 1) * a[i][j]; sum2[i][j] += sum2[i][j - 1] + (n - j) * a[i][j]; } } long long res = 0; long long cur = 0; for (int c = 0; c < 2 * n; c++) { int j = c / 2 + 1; int i = ((j % 2) + (c % 2) + 1) % 2; cur += c * a[i][j]; if ((j % 2) == i) continue; long long aa = (sum1[i][n] - sum1[i][j] + (c + 1 - j) * (sum3[i][n] - sum3[i][j])); long long bb = (sum2[1 ^ i][n] - sum2[1 ^ i][j - 1] + (n + j - 1) * (sum3[1 ^ i][n] - sum3[1 ^ i][j - 1])); res = max(res, cur + aa + bb); } cout << res << endl; } }; class p1133E { public: void solve() { int n, k; cin >> n >> k; vector<vector<long long>> dp(n + 1, vector<long long>(k + 1, -1)); vector<long long> a(n, 0); for (int i = 0; i <= n - 1; i++) cin >> a[i]; sort(a.begin(), a.end()); for (int i = 0; i <= n; i++) dp[i][0] = 0; long long res = 0; for (int j = 1; j <= k; j++) { for (int i = 1; i <= n; i++) { dp[i][j] = dp[i - 1][j]; auto it = lower_bound(a.begin(), a.end(), a[i - 1] - 5); if (it == a.end()) { if (dp[0][j - 1] != -1) dp[i][j] = max(dp[i][j], dp[0][j - 1] + 1); } else { int pre = it - a.begin(); if (dp[pre][j - 1] != -1) { dp[i][j] = max(dp[i][j], dp[pre][j - 1] + i - pre); } } res = max(res, dp[i][j]); } } cout << res << endl; } }; class p2345H { public: void solve() { string s; cin >> s; int n = s.size(); vector<vector<int>> dp(n + 1, vector<int>(n + 1, 0)); vector<vector<bool>> ok(n + 2, vector<bool>(n + 1, 0)); for (int i = 1; i <= n; i++) { ok[i][i] = dp[i][i] = 1; ok[i + 1][i] = 1; } for (int len = 2; len <= n; len++) { for (int i = 1; i + len - 1 <= n; i++) { int j = i + len - 1; dp[i][j] = dp[i][j - 1] + dp[i + 1][j] - dp[i + 1][j - 1]; if (s[i - 1] == s[j - 1]) { ok[i][j] = ok[i + 1][j - 1]; if (ok[i][j] != 0) dp[i][j] += 1; } } } int q; cin >> q; while (q--) { int l, r; cin >> l >> r; printf( %lld n , dp[l][r]); } } }; class p733C { public: void solve() { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; int k; cin >> k; vector<int> b(k); for (int i = 0; i < k; i++) cin >> b[i]; vector<tuple<int, char>> res; int start = 0; bool flag = true; for (int i = 0; i < k && start < n; i++) { int sum = 0; int mx = start, end = start; while (sum < b[i] && end < n) { sum += a[end]; if (a[end] > a[mx]) mx = end; end++; } if (sum != b[i]) { flag = false; break; } if (end - start == 1) { start++; continue; } int k = start; bool ok = false; for (; k < end; k++) { if (a[k] == a[mx]) { if (k > start && a[k - 1] < a[k]) ok = true; if (k + 1 < end && a[k + 1] < a[k]) ok = true; } if (ok) break; } if (!ok) { flag = false; break; } if (k > start && a[k - 1] < a[k]) { for (int l = k; l > start; l--) res.emplace_back(i + l - start + 1, L ); for (int r = k; r < end - 1; r++) res.emplace_back(i + 1, R ); } else { for (int r = k; r < end - 1; r++) res.emplace_back(i + k - start + 1, R ); for (int l = k; l > start; l--) res.emplace_back(i + l - start + 1, L ); } start = end; } if (!flag || res.size() != n - k) cout << NO << endl; else { cout << YES << endl; for (auto &[x, y] : res) { cout << x << << y << endl; } } } }; class p914C { public: static const int maxn = 1005; long long f[maxn]; long long c[maxn][maxn]; void init() { const int maxn = 1001; f[1] = 0; for (int i = 2; i < maxn; i++) { int cnt = bitset<32>(i).count(); f[i] = 1 + f[cnt]; } memset(c, 0, sizeof(c)); c[0][0] = 1; for (int i = 1; i < maxn; i++) { c[i][0] = 1; for (int j = 1; j <= i; j++) { c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % 1000000007; } } } void solve() { int k; string s; cin >> s >> k; int n = s.size(); if (k == 0) { if (s[0] >= 1) cout << 1 << endl; else cout << 0 << endl; return; } if (k == 1) { cout << n - 1 << endl; return; } init(); long long res = 0; vector<long long> dp(n, 0); int cnt = 0; for (int i = 0; i < n; i++) { if (s[i] == 1 ) { for (int j = 0; j <= n - i - 1; j++) { if (f[cnt + j] == k - 1) { res = (res + c[n - i - 1][j]) % 1000000007; } } cnt++; } } if (f[cnt] == k - 1) res = (res + 1) % 1000000007; cout << res << endl; } }; class p358D { public: static const int maxn = 3001; int n; int a[maxn], b[maxn], c[maxn]; int dp[maxn][2][2]; void solve() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &a[i]); for (int i = 0; i < n; i++) scanf( %d , &b[i]); for (int i = 0; i < n; i++) scanf( %d , &c[i]); memset(dp, -1, sizeof(dp)); dp[0][0][1] = b[0]; dp[0][0][0] = a[0]; for (int i = 1; i < n; i++) { dp[i][0][0] = max(dp[i - 1][1][1] + a[i], dp[i - 1][0][1] + a[i]); dp[i][0][1] = max(dp[i - 1][1][1] + b[i], dp[i - 1][0][1] + b[i]); dp[i][1][0] = max(dp[i - 1][1][0] + b[i], dp[i - 1][0][0] + b[i]); dp[i][1][1] = max(dp[i - 1][1][0] + c[i], dp[i - 1][0][0] + c[i]); } cout << max(dp[n - 1][1][0], dp[n - 1][0][0]) << endl; } }; class p700B { public: unordered_set<int> us; vector<vector<int>> edge; vector<int> seq; vector<int> dis; vector<int> lg; vector<vector<int>> dp; void dfs(int u, int fa, int depth) { dis[u] = depth; if (us.count(u)) seq.push_back(u); dp[u][0] = fa; for (int i = 1; (1 << i) <= depth; i++) { dp[u][i] = dp[dp[u][i - 1]][i - 1]; } for (auto c : edge[u]) { if (c == fa) continue; dfs(c, u, depth + 1); } } int lca(int x, int y) { if (dis[x] < dis[y]) swap(x, y); while (dis[x] > dis[y]) x = dp[x][lg[dis[x] - dis[y]] - 1]; if (x == y) return x; for (int k = lg[dis[x]] - 1; k >= 0; k--) { if (dp[x][k] != dp[y][k]) { x = dp[x][k]; y = dp[y][k]; } } return dp[x][0]; } void solve() { int n, k; cin >> n >> k; lg = vector<int>(n + 1, 0); dp = vector<vector<int>>(n + 1, vector<int>(21, 0)); for (int i = 1; i <= n; i++) { lg[i] = lg[i - 1]; if (i == (1 << lg[i - 1])) lg[i]++; } us.clear(); seq.clear(); for (int i = 0; i < 2 * k; i++) { int a; cin >> a; us.insert(a); } edge = vector<vector<int>>(n + 1); dis = vector<int>(n + 1); for (int i = 0; i < n - 1; i++) { int x, y; cin >> x >> y; edge[x].push_back(y); edge[y].push_back(x); } dfs(1, 0, 0); long long res = 0; for (int i = 0; i < k; i++) { int u = lca(seq[i], seq[i + k]); res += dis[seq[i]] + dis[seq[i + k]] - 2 * dis[u]; } cout << res << endl; } }; class p700b { public: vector<vector<int>> edge; set<int> us; long long sum = 0; long long dfs(int u, int fa) { long long cnt = 0; if (us.count(u)) cnt++; for (int c : edge[u]) { if (c == fa) continue; long long t = dfs(c, u); sum += min(t, (long long)(us.size() - t)); cnt += t; } return cnt; } void solve() { int n, k; cin >> n >> k; for (int i = 0; i < 2 * k; i++) { int a; cin >> a; us.insert(a); } edge = vector<vector<int>>(n + 1); for (int i = 0; i < n - 1; i++) { int x, y; cin >> x >> y; edge[x].push_back(y); edge[y].push_back(x); } sum = 0; dfs(1, 0); cout << sum << endl; } }; class p822D { public: void solve() { long long t, l, r; cin >> t >> l >> r; vector<long long> f(r + 1, 0); for (int i = 2; i <= r; i++) f[i] = i; for (long long i = 2; i * i <= r; i++) { if (f[i] == i) { for (long long j = i * i; j <= r; j += i) { f[j] = min(f[j], i); } } } vector<long long> dp(r + 1, 0); for (long long i = 2; i <= r; i++) { dp[i] = 1ll * 0x3f3f3f3f * 0x3f3f3f3f; for (long long j = i; j != 1; j /= f[j]) { dp[i] = min(dp[i], dp[i / f[j]] + i * (f[j] - 1) / 2); } } long long res = 0; long long k = 1; for (int i = l; i <= r; i++) { res = (res + k * (dp[i] % 1000000007)) % 1000000007; k = (k * t) % 1000000007; } cout << res << endl; } }; class p747D { public: void solve() { int n, k; cin >> n >> k; vector<int> t(n); vector<int> cnt; for (int i = 0; i < n; i++) cin >> t[i]; for (int i = 0; i < n; i++) { if (t[i] < 0) { cnt.push_back(i); } } if (cnt.size() > k) { cout << -1 << endl; return; } if (cnt.size() == 0) { cout << 0 << endl; return; } int res = 1, last = cnt.back(); k -= cnt.size(); for (int i = 0; i < cnt.size() - 1; i++) { cnt[i] = cnt[i + 1] - cnt[i] - 1; } cnt.pop_back(); sort(cnt.begin(), cnt.end()); for (int i : cnt) { if (i == 0) continue; if (i <= k) k -= i; else res += 2; } if (k < n - last - 1) res++; cout << res << endl; } }; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); p747D ans; ans.solve(); return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 100005; int n, m, s, vis[100005], cy; long long t; int nex(int x, int y) { if (x < m) return (x + y) % n; else return (x - y + n) % n; } int main() { scanf( %d %d , &n, &m); scanf( %d %lld , &s, &t); --s; while (t % n != 0) { s = nex(s, t % n); --t; } t /= n; while (t && (!vis[s])) { vis[s] = ++cy; for (int y = n - 1; y > 0; --y) s = nex(s, y); --t; } if (!t) { cout << s + 1; return 0; } t %= (cy + 1 - vis[s]); while (t) { for (int y = n - 1; y > 0; --y) s = nex(s, y); --t; } cout << s + 1; }

#include <bits/stdc++.h> using namespace std; template <typename T> static ostream& operator<<(ostream& stream, const vector<T>& t); template <typename T> static istream& read(T, T, istream& = cin); template <typename T> static istream& operator>>(istream& stream, vector<T>& t) { return read((t).begin(), (t).end(), stream); } template <typename T> static istream& read(T b, T e, istream& stream) { for (T it = b; it != e; ++it) stream >> *it; return stream; } template <typename T> static void print(T x, string end = n ) { cout << x << end; } template <typename T> static ostream& print(T b, T e, string sep = , ostream& stream = cout) { for (T it = b; it != e; ++it) { stream << *it; if (it + 1 != e) stream << sep; } return stream; } template <typename T> static void print(vector<T> arr, string sep = ) { if (arr.empty()) { return; } print(arr.begin(), arr.end(), sep); cout << n ; } void _() { int n; cin >> n; vector<int> arr(n); cin >> arr; vector<int> tmp(1, n + 1); vector<string> ans(n + 1, string(n, 0 )); for (int j = 0; j <= n - 1; ++j) { int l = 0; vector<int> n_tmp; int ones = arr[j], zeros = n + 1 - arr[j]; for (int x : tmp) { int take_zeros = min(zeros, x - (ones > 0)); int take_ones = x - take_zeros; if (x == 1) { if (ones > zeros) take_ones = 1, take_zeros = 0; else take_ones = 0, take_zeros = 1; } zeros -= take_zeros; ones -= take_ones; for (int i = l; i <= l + take_zeros - 1; ++i) ans[i][j] = 0 ; l += take_zeros; for (int i = l; i <= l + take_ones - 1; ++i) ans[i][j] = 1 ; l += take_ones; if (take_zeros) n_tmp.push_back(take_zeros); if (take_ones) n_tmp.push_back(take_ones); } tmp = n_tmp; } print(n + 1); print(ans, n ); } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(15); _(); }

#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; int main() { ios_base::sync_with_stdio(0); cin.tie(0); ; int n; cin >> n; vector<int> dem(1000); int maxx = INT_MIN; for (int i = 0; i < n; ++i) { int u; cin >> u; dem[--u]++; maxx = max(maxx, dem[u]); } if (n - maxx < maxx - 1) cout << NO ; else cout << YES ; return 0; }

#include <bits/stdc++.h> using namespace std; int a[10]; int main() { int n; while (~scanf( %d , &n)) { memset(a, 0, sizeof(a)); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); sort(a + 1, a + n + 1); printf( %d n , a[(1 + n) / 2]); } }

#include <bits/stdc++.h> using namespace std; const int MAX = 5005; int n; string strs[MAX]; string strp[MAX]; int anspos = 0; int strlens[MAX]; int vis[MAX]; int change[MAX][2]; string ansa, ansb; bool cal(int pos) { int len = strs[pos].size(); strlens[pos] = len; int l = -1, r = len; while (l < len && strs[pos][++l] == strp[pos][l]) ; while (r > 0 && strs[pos][--r] == strp[pos][r]) ; if (l > r) return 1; string cnt = strs[pos].substr(l, r - l + 1); string cnt2 = strp[pos].substr(l, r - l + 1); if (ansa.size() == 0 && ansb.size() == 0) { anspos = pos; ansa = cnt; ansb = cnt2; } if (cnt != ansa || cnt2 != ansb) { return 0; } vis[pos] = 1; change[pos][0] = l, change[pos][1] = r; return 1; } bool myfinds(string &ps) { int nowcntlen = ps.size(); for (int i = 0; i < n; i++) { auto pos = strs[i].find(ps); if (pos != string::npos) { string rester = strs[i].substr(0, pos) + ansb + strs[i].substr(pos + ansb.size()); if (rester != strp[i]) { return 1; } } } return 0; } int addl, addr; string pre; bool check(int len) { addl = 0, addr = 0; while (change[anspos][0] > 0) { int flag = 1; for (int i = 0; i < n; i++) { if (i == anspos) continue; if (!vis[i]) continue; if (change[i][0] > 0 && strs[anspos][change[anspos][0] - 1] == strs[i][change[i][0] - 1]) { change[i][0]--; } else { flag = 0; break; } } if (flag) { change[anspos][0]--; addl++; } else { break; } } while (change[anspos][1] < len - 1) { int flag = 1; for (int i = 0; i < n; i++) { if (i == anspos) continue; if (!vis[i]) continue; if (change[i][1] < strlens[i] - 1 && strs[anspos][change[anspos][1] + 1] == strs[i][change[i][1] + 1]) { change[i][1]++; } else { flag = 0; break; } } if (flag) { change[anspos][1]++; addr++; } else { break; } } } int main() { std::ios::sync_with_stdio(false); cin >> n; ansa.clear(), ansb.clear(); for (int i = 0; i < n; i++) { cin >> strs[i]; } for (int i = 0; i < n; i++) { cin >> strp[i]; } for (int i = 0; i < n; i++) { if (!cal(i)) { cout << NO n ; return 0; } } int nowl = change[anspos][0], nowr = change[anspos][1]; check(strs[anspos].size()); if (addl) { ansa = strs[anspos].substr(nowl - addl, addl) + ansa; ansb = strs[anspos].substr(nowl - addl, addl) + ansb; } if (addr) { ansa += strs[anspos].substr(nowr + 1, addr); ansb += strs[anspos].substr(nowr + 1, addr); } if (myfinds(ansa)) { cout << NO n ; } else { cout << YES n ; cout << ansa << n << ansb << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > E[1010]; int deg[1010], vis[1010]; vector<pair<int, pair<int, int> > > ans; int N, P; int main() { int u, v, d; while (~scanf( %d%d , &N, &P)) { for (int i = 0; i < N; i++) deg[i] = 0, E[i].clear(); for (int i = 0; i < P; i++) scanf( %d%d%d , &u, &v, &d), u--, v--, deg[v]++, E[u].push_back(make_pair(v, d)); ans.clear(); for (int i = 0; i < N; i++) if (deg[i] == 0) { int dd = 1 << 30, u = i; for (u = i; E[u].size() > 0; u = E[u][0].first) dd = min(dd, E[u][0].second); if (dd < (1 << 30)) ans.push_back(make_pair(i, make_pair(u, dd))); } sort(ans.begin(), ans.end()); printf( %d n , ans.size()); for (int i = 0; i < ans.size(); i++) printf( %d %d %d n , ans[i].first + 1, ans[i].second.first + 1, ans[i].second.second); } return 0; }

#include <bits/stdc++.h> using namespace std; int a[55], b[55]; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %d , a + i); for (int i = 1; i <= m; i++) scanf( %d , b + i); long long ans = 1ll << 62; for (int x = 1; x <= n; x++) { long long maxv = -(1ll << 62); for (int y = 1; y <= n; y++) { if (x == y) continue; for (int z = 1; z <= m; z++) { maxv = max(maxv, (long long)a[y] * b[z]); } } ans = min(ans, maxv); } printf( %lld n , ans); return 0; }

#include <bits/stdc++.h> using namespace std; const long long base = 1E9 + 7; const int N = 200100; const double ep = 0.0000001; int n; long long x[N], y[N]; long long cx = 0, cy = 0; void fail() { cout << NO ; exit(0); } bool symmetric(int i, int j) { long long x1 = cx - x[i] * n; long long y1 = cy - y[i] * n; long long x2 = cx - x[j] * n; long long y2 = cy - y[j] * n; return (x1 == -x2) && (y1 == -y2); } int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> x[i] >> y[i]; cx += x[i]; cy += y[i]; } if (n % 2 == 1) fail(); int j = 0; for (j = 1; j < n; j++) if (symmetric(0, j)) break; for (int i = 0; i < n; i++, j++) { if (j == n) j = 0; if (!symmetric(i, j)) fail(); } cout << YES ; return 0; }

#include <bits/stdc++.h> int compare(char *s, char *t, int l) { int i; for (i = 0; i < l; i++) { char a = toupper(s[i]), b = toupper(t[i]); if (a != b) return a - b; } return 0; } int main() { static char ss[100][100 + 1], cc[100 + 1], lucky[100]; static int ll[100]; int n, m, i, j; char c, c_, a, a_; scanf( %d , &n); for (i = 0; i < n; i++) { scanf( %s , ss[i]); ll[i] = strlen(ss[i]); } scanf( %s n%c , cc, &c), m = strlen(cc); c_ = toupper(c); a = c == a ? b : a ; a_ = toupper(a); for (j = 0; j < m; j++) for (i = 0; i < n; i++) if (m - j >= ll[i] && compare(cc + j, ss[i], ll[i]) == 0) memset(lucky + j, 1, ll[i]); for (j = 0; j < m; j++) if (lucky[j]) { if (tolower(cc[j]) == c) cc[j] = isupper(cc[j]) ? a_ : a; else cc[j] = isupper(cc[j]) ? c_ : c; } printf( %s n , cc); return 0; }

#include <bits/stdc++.h> using namespace std; char s[1100]; int main() { scanf( %s , s); for (int i = 0; s[i]; i++) printf( %c , s[i]); for (int i = strlen(s) - 1; i >= 0; i--) printf( %c , s[i]); return 0; }

#include <bits/stdc++.h> using namespace std; string p[105] = { }; int cts[105] = {0}; string pass; int main(int argc, char const *argv[]) { int n, k; cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> p[i]; int xx = p[i].length(); cts[xx]++; } for (int i = 1; i <= 100; i++) { cts[i] += cts[i - 1]; } cin >> pass; int plen = pass.length(); int mans = cts[plen - 1]; mans += 5 * (mans / k); mans++; cout << mans << ; int maxans = cts[plen] - 1; maxans += 5 * (maxans / k); maxans++; cout << maxans << n ; return 0; }

#include <bits/stdc++.h> using namespace std; const double PI = 3.141592653589793238462643383279502884197169399375105820974944592307816406286; double d, h, v, e; int main() { scanf( %lf%lf%lf%lf , &d, &h, &v, &e); if (4 * v - d * d * PI * e <= 0) printf( NO n ); else printf( YES n%.12f n , (PI * h * d * d) / (4 * v - d * d * PI * e)); }

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { int n, m; cin >> n >> m; int sum = 0; for (int i = 0; i < n; i++) { int a; cin >> a; sum += a; } if (sum == m) { cout << YES << endl; } else { cout << NO << endl; } } return 0; }

#include <bits/stdc++.h> using namespace std; const int N_ = 100500; int N, M; vector<int> gph[N_], rev[N_], bth[N_]; int outdg[N_], indg[N_]; bool visited[N_]; vector<int> ord; void dfs(int u) { visited[u] = true; for (int i = 0; i < gph[u].size(); i++) { int v = gph[u][i]; if (!visited[v]) dfs(v); } ord.push_back(u); } queue<int> que; int grp[N_], gn; int c1[N_], c2[N_]; void dfs2(int u) { visited[u] = true; ++c1[gn]; grp[u] = gn; for (int i = 0; i < bth[u].size(); i++) { int v = bth[u][i]; if (!visited[v]) dfs2(v); } } int cnt3; void dfs3(int u) { visited[u] = true; ++cnt3; for (int i = 0; i < rev[u].size(); i++) { int v = rev[u][i]; if (!visited[v]) dfs3(v); } } int main() { scanf( %d%d , &N, &M); for (int e = 1; e <= M; e++) { int u, v; scanf( %d%d , &u, &v); gph[u].push_back(v); rev[v].push_back(u); bth[u].push_back(v); bth[v].push_back(u); ++outdg[u]; ++indg[v]; } memset(visited, 0, sizeof visited); for (int i = 1; i <= N; i++) if (!visited[i]) dfs(i); memset(visited, 0, sizeof visited); for (int i = 1; i <= N; i++) if (!visited[i]) { ++gn; dfs2(i); } memset(visited, 0, sizeof visited); for (int i = ord.size(); i--;) { int u = ord[i]; if (!visited[u]) { cnt3 = 0; dfs3(u); if (cnt3 >= 2) c2[grp[u]] += 1; } } int ans = 0; for (int g = 1; g <= gn; g++) { c2[g] += c1[g] - 1; ans += min(c1[g], c2[g]); } printf( %d n , ans); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { long n, t; cin >> n >> t; string s1, s2; getline(cin, s1); getline(cin, s1, . ); getline(cin, s2); long a = -1, count = 0; for (int i = 0; i < s2.length(); i++) if (s2[i] >= 5 ) { a = i; break; } if (a == -1) { cout << s1 << . << s2; return 0; } if (a == 0) { int c = s1.length() - 1; while (s1[c] == 9 && c >= 0) c--; if (c == -1) { cout << 1 ; for (int i = 0; i < s1.length(); i++) cout << 0 ; return 0; } s1[c]++; for (c++; c < s1.length(); c++) s1[c] = 0 ; cout << s1; return 0; } long b = a - 1; while (s2[b] == 4 && b >= 0 && b >= a - t + 1) { b--; } if (b == -1) { int c = s1.length() - 1; while (s1[c] == 9 && c >= 0) c--; if (c == -1) { cout << 1 ; for (int i = 0; i < s1.length(); i++) cout << 0 ; return 0; } s1[c]++; for (c++; c < s1.length(); c++) s1[c] = 0 ; cout << s1; return 0; } else { s2[b]++; cout << s1 << . ; for (int i = 0; i <= b; i++) cout << s2[i]; return 0; } return 0; }

#include <bits/stdc++.h> using namespace std; const int INF = 400000; const double EPS = 1e-9; int mods(int a, int b) { return (b + (a % b)) % b; } int n, m, k, x, ans, p[105], s[105], strongest[105]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m >> k; for (int i = 0; i < n; i++) cin >> p[i]; for (int i = 0; i < n; i++) { cin >> s[i]; strongest[s[i]] = max(strongest[s[i]], p[i]); } for (int i = 0; i < k; i++) { cin >> x; if (strongest[s[x - 1]] != p[x - 1]) ans++; } cout << ans << n ; return 0; }

#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> istream& operator>>(istream& in, pair<T1, T2>& a) { in >> a.first >> a.second; return in; } template <typename T1, typename T2> ostream& operator<<(ostream& out, pair<T1, T2> a) { out << a.first << << a.second; return out; } template <typename T, typename T1> T amax(T& a, T1 b) { if (b > a) a = b; return a; } template <typename T, typename T1> T amin(T& a, T1 b) { if (b < a) a = b; return a; } const long long INF = 1e18; const int32_t M = 1e9 + 7; const int32_t MM = 998244353; const int N = 3e5 + 5; struct node { node* next[2] = {0}; } ns[19 * N]; int cnt = 1; node* create() { if (cnt < 19 * N) return ns + cnt++; else return new node(); } void insert(int x) { node* tmp = ns; for (int i = 19; i >= 0; i--) { int k = x >> i & 1; if (!tmp->next[k]) tmp->next[k] = create(); tmp = tmp->next[k]; } } int query(int x) { node* tmp = ns; int ans = 0; for (int i = 19; i >= 0; i--) { int k = x >> i & 1; if (tmp->next[k]) { tmp = tmp->next[k]; } else { ans += (1 << i); tmp = tmp->next[!k]; } } return ans; } void solve() { set<int> s; for (int i = 0; i < 1 << 19; i++) { s.insert(i); } int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { int x; cin >> x; s.erase(x); } for (int x : s) { insert(x); } int prev = 0; for (int i = 0; i < m; i++) { int q; cin >> q; prev ^= q; cout << query(prev) << n ; } } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t = 1; while (t--) solve(); return 0; }

#include <bits/stdc++.h> using namespace std; using bigint = long long int; using vi = vector<int>; using vll = vector<long long int>; int cnt[200001]; int main() { int N, A; cin >> N >> A; for (int i = 0; i < N; i++) { int x; cin >> x; cnt[x]++; } int ans = 0; if (cnt[A] == 0) { ans++; cnt[A] = 1; } int left = 0, right = 0; for (int i = 1; i < A; i++) left += cnt[i]; for (int i = A + 1; i < 100001; i++) right += cnt[i]; if (left == right) { cout << ans << n ; return 0; } if (left > right) { if (right + cnt[A] - 1 >= left) cout << ans << n ; else cout << ans + left - (right + cnt[A] - 1) << n ; } else if (right > left) { if (left + cnt[A] - 1 >= right - 1) cout << ans << n ; else cout << ans + (right - 1) - (left + cnt[A] - 1) << n ; } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int H, W, K; cin >> H >> W >> K; vector<string> photo(H); for (int h = 0; h < int(H); ++h) cin >> photo[h]; vector<vector<char> > star(H, vector<char>(W, 0)); for (int r = 1; r < int(H - 1); ++r) for (int c = 1; c < int(W - 1); ++c) { if (photo[r][c] == 1 && photo[r - 1][c] == 1 && photo[r][c - 1] == 1 && photo[r + 1][c] == 1 && photo[r][c + 1] == 1 ) { star[r][c] = 1; } } long long res = 0; for (int c1 = 0; c1 < int(W); ++c1) { vector<int> row_stars(H, 0); for (int c2 = c1 + 3; c2 <= int(W); ++c2) { for (int r = 0; r < int(H); ++r) row_stars[r] += star[r][c2 - 2]; int r1 = 0, stars = 0; for (int r2 = r1 + 3; r2 <= int(H); ++r2) { stars += row_stars[r2 - 2]; while (stars - row_stars[r1 + 1] >= K) { stars -= row_stars[r1 + 1]; ++r1; } if (stars >= K) res += r1 + 1; } } } cout << res << endl; }

#include <bits/stdc++.h> using namespace std; int n, m, a, b, ans[400]; string s[400]; long long calc(int pos, int res) { for (int i = res + 1; i <= 10; i++) { for (int j = 0; j < 1 << i; j++) { string t = ; for (int k = 0; k < i; k++) t = t + (char)(((j >> k) & 1) + 0 ); if (s[pos].find(t) == -1) { ans[pos] = i - 1; return i - 1; } } } } int main() { ios_base::sync_with_stdio(false); cin >> n; for (int i = 1; i <= n; i++) cin >> s[i]; cin >> m; for (int i = 1; i <= m; i++) { cin >> a >> b; s[n + i] = s[a] + s[b]; if (s[n + i].length() > 1000) s[n + i] = s[n + i].substr(0, 500) + s[n + i].substr(s[n + i].length() - 500, 500); cout << calc(n + i, max(ans[a], ans[b])) << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; long long dp[5010][5010]; char s[5010], z[5010]; long long solve() { int M = strlen(s), N = strlen(z); for (int i = 0; i <= M; i++) dp[i][0] = 0; for (int i = 0; i <= N; i++) dp[0][i] = 0; for (int i = 1; i <= M; i++) for (int j = 1; j <= N; j++) { dp[i][j] = dp[i][j - 1]; if (s[i - 1] == z[j - 1]) dp[i][j] = (dp[i][j] + dp[i - 1][j - 1] + 1) % mod; } long long ans = 0; for (int i = 0; i <= M; i++) ans = (ans + dp[i][N]) % mod; return ans; } int main() { scanf( %s %s , s, z); int ans = solve(); printf( %d n , ans); return 0; }

#include <bits/stdc++.h> using namespace std; int a[] = {0, 1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51, 1, 2, 1, 14, 1, 2, 2, 14, 1, 6, 1, 4, 2, 2, 1, 52, 2, 5, 1, 5, 1, 15, 2, 13, 2, 2, 1, 13, 1, 2, 4, 267, 1, 4, 1, 5, 1, 4, 1, 50, 1, 2, 3, 4, 1, 6, 1, 52, 15, 2, 1, 15, 1, 2, 1, 12, 1, 10, 1, 4, 2}; int main() { int n; cin >> n; cout << a[n] << endl; return 0; }

#include <bits/stdc++.h> using namespace std; const int Max_n = 2e5 + 10; const int Max_m = 4e5 + 10; int f[Max_n]; struct A { long long val; int pos; bool operator<(const A &a) const { return val < a.val; } } a[Max_n]; struct Edge { int u, v; long long cost; bool operator<(const Edge &edge) const { return cost < edge.cost; } } edge[Max_m * 2]; int Find(int v) { if (f[v] == v) return v; return f[v] = Find(f[v]); } bool Merge(int m, int n) { int t1 = Find(m); int t2 = Find(n); if (t1 != t2) { f[t1] = t2; return true; } return false; } int main() { int n, m; scanf( %d%d , &n, &m); int cnt = 0; for (int i = 1; i <= n; i++) f[i] = i; for (int i = 1; i <= n; i++) { scanf( %lld , &a[i].val); a[i].pos = i; } sort(a + 1, a + n + 1); for (int i = 2; i <= n; i++) { edge[cnt].u = a[1].pos; edge[cnt].v = a[i].pos; edge[cnt++].cost = a[1].val + a[i].val; edge[cnt].u = a[i].pos; edge[cnt].v = a[1].pos; edge[cnt++].cost = a[1].val + a[i].val; } for (int i = 1; i <= m; i++) { int u, v; long long cost; scanf( %d%d%lld , &u, &v, &cost); edge[cnt].u = u; edge[cnt].v = v; edge[cnt++].cost = cost; edge[cnt].u = v; edge[cnt].v = u; edge[cnt++].cost = cost; } sort(edge, edge + cnt); long long ans = 0; int edgeCnt = 0; for (int i = 0; i < cnt; i++) { if (Merge(edge[i].u, edge[i].v)) { ans += edge[i].cost; edgeCnt++; } if (edgeCnt == n - 1) break; } printf( %lld n , ans); return 0; }

#include <bits/stdc++.h> using namespace std; int defence[4]; int atack[4]; int main() { for (int i = 0; i < 4; i++) cin >> defence[i] >> atack[i]; int maximum = max(defence[0], defence[1]); maximum = max(maximum, atack[0]); maximum = max(maximum, atack[1]); if (defence[0] > atack[2] && defence[0] > atack[3] && atack[1] > defence[2] && atack[1] > defence[3]) { cout << Team 1 ; return 0; } if (defence[1] > atack[2] && defence[1] > atack[3] && atack[0] > defence[2] && atack[0] > defence[3]) { cout << Team 1 ; return 0; } if ((defence[0] + atack[1]) < (defence[1] + atack[0])) { if (defence[1] < atack[3] && atack[0] < defence[2]) { cout << Team 2 ; return 0; } else if (defence[1] < atack[2] && atack[0] < defence[3]) { cout << Team 2 ; return 0; } } else { if (defence[0] < atack[3] && atack[1] < defence[2]) { cout << Team 2 ; return 0; } else if (defence[0] < atack[2] && atack[1] < defence[3]) { cout << Team 2 ; return 0; } } cout << Draw ; return 0; }

#include <bits/stdc++.h> using namespace std; int n, m, k, q; int x[411111], y[411111], a[411111], b[411111], aa[411111], bb[411111]; int ans[411111]; int mi[2000222]; void init(int pos, int l, int r) { mi[pos] = -1; if (l == r) return; init(pos + pos, l, (l + r) / 2); init(pos + pos + 1, (l + r) / 2 + 1, r); } void mod(int pos, int l, int r, int x, int v) { if (x < l || x > r) return; if (l == r) { mi[pos] = v; return; } mod(pos + pos, l, (l + r) / 2, x, v); mod(pos + pos + 1, (l + r) / 2 + 1, r, x, v); mi[pos] = min(mi[pos + pos], mi[pos + pos + 1]); } int fin(int pos, int l, int r, int ll, int rr) { ll = max(ll, l); rr = min(rr, r); if (ll > rr) return 1e9; if (l == ll && r == rr) return mi[pos]; return min(fin(pos + pos, l, (l + r) / 2, ll, rr), fin(pos + pos + 1, (l + r) / 2 + 1, r, ll, rr)); } void solve() { vector<pair<int, int> > ev; for (int i = 0; i < k; i++) { ev.push_back(make_pair(y[i], -(i + 1))); } for (int i = 0; i < q; i++) { ev.push_back(make_pair(bb[i], i + 1)); } sort(ev.begin(), ev.end()); init(1, 0, n - 1); for (int i = 0; i < ev.size(); i++) { int id = ev[i].second; if (id < 0) { id = (-id) - 1; mod(1, 0, n - 1, x[id], y[id]); } else { id = id - 1; if (fin(1, 0, n - 1, a[id], aa[id]) >= b[id]) ans[id] = 1; } } } int main() { cin >> n >> m >> k >> q; for (int i = 0; i < k; i++) { scanf( %d%d , &x[i], &y[i]); x[i]--; y[i]--; } for (int i = 0; i < q; i++) { scanf( %d%d%d%d , &a[i], &b[i], &aa[i], &bb[i]); a[i]--; b[i]--; aa[i]--; bb[i]--; ans[i] = 0; } solve(); for (int i = 0; i < k; i++) swap(x[i], y[i]); for (int i = 0; i < q; i++) { swap(a[i], b[i]); swap(aa[i], bb[i]); } swap(n, m); solve(); for (int i = 0; i < q; i++) if (ans[i]) puts( YES ); else puts( NO ); return 0; }

#include <bits/stdc++.h> using namespace std; int n; int ans[400] = { 1, 9, 245, 126565, 54326037, 321837880, 323252721, 754868154, 328083248, 838314395, 220816781, 893672292, 166441208, 251255697, 114256285, 118775501, 482714697, 11784725, 460862131, 550384565, 106742050, 425241115, 626692854, 674266678, 320014275, 345949512, 527320049, 897822749, 137190263, 491039182, 810384961, 482023334, 658099864, 886790989, 845381174, 371433224, 278969124, 420088324, 696766322, 388302635, 141033366, 46387851, 932125021, 278342766, 371131134, 922501918, 110778457, 506223573, 806353719, 391845991, 923507761, 780307355, 109951115, 830090230, 605558495, 344686604, 988110893, 944684429, 715019947, 799898820, 384672708, 907325090, 758952329, 550672104, 368337206, 394915145, 401744167, 923781939, 831857516, 407845661, 329267374, 927004007, 891609656, 897919613, 481297880, 737337940, 651873737, 287246681, 973133651, 679864988, 784719328, 820504764, 875613823, 806512665, 164851642, 500228957, 951814419, 447763649, 273141670, 979349615, 964027956, 809510400, 276634497, 116631976, 426739449, 175282420, 885948162, 62270880, 974395255, 675165056, 759589968, 837957573, 931897605, 152352780, 585420109, 1772087, 333401718, 898833639, 745874265, 786209423, 691982338, 498790927, 473374639, 274302623, 971280670, 241671319, 13070005, 302088807, 550276351, 436592588, 631667314, 548656698, 730626984, 146295220, 674398632, 400383348, 454138904, 786220712, 118620797, 233440672, 217349271, 274853536, 310607544, 105221205, 769566615, 853585061, 800665807, 695377419, 924327065, 388199705, 551624811, 721435546, 501720515, 308465454, 825369234, 396065729, 451899519, 295058424, 142088952, 473485086, 378771634, 734511215, 462404399, 959198328, 337668263, 794122911, 38911400, 951992982, 472696081, 373904752, 105884826, 630251717, 28980684, 845136347, 353665773, 691661192, 19922354, 231463797, 757917231, 242739918, 979036950, 713722080, 234689388, 2243164, 209872853, 240808787, 539523346, 425797848, 913772061, 224613100, 421742777, 222232478, 92712941, 215137570, 949901408, 274827432, 15162482, 593145989, 274574232, 239282092, 762720192, 804146934, 500629424, 565985054, 81127381, 671811155, 655565571, 890331075, 237994348, 743647404, 667160634, 713914299, 668506729, 741341289, 277636808, 762781382, 14272789, 902864131, 567443405, 149113383, 648844381, 825489976, 933016723, 192288078, 734493315, 240985733, 861817693, 762711459, 525904609, 532463481, 377133989, 620711079, 772561562, 980733194, 227599811, 162774370, 209512798, 787116594, 3509258, 748795368, 378035466, 612938915, 802091952, 857679599, 481748937, 493370392, 358420805, 48301629, 412001241, 463126722, 509578422, 967799131, 994766554, 687287243, 863623583, 771554899, 690911527, 855314994, 923686429, 246862514, 192479791, 133487041, 703444043, 295281758, 801816257, 920762934, 749306433, 973004841, 848644684, 560026478, 952127278, 616654635, 839390326, 975154012, 409583672, 635350249, 343228425, 335331602, 223826406, 952341037, 589677800, 249747234, 555694261, 137143500, 628190328, 461598392, 431912756, 29349807, 759199489, 783281228, 781971312, 915823407, 388508707, 718062705, 27424111, 309999451, 963383322, 831185229, 132910888, 347028136, 850484840, 223055285, 142335980, 144754000, 772005560, 81796039, 167696020, 79454283, 172772542, 201056991, 484957644, 716630285, 763194701, 211505841, 903448791, 926964672, 257752668, 482951716, 411539070, 620249847, 592476107, 170473128, 814662613, 898000271, 57354872, 361106091, 488697643, 889007954, 138725767, 684860983, 36248116, 304610143, 137633385, 413715776, 99010024, 779653665, 100387568, 286328069, 564731826, 621740468, 943513219, 506666491, 249987886, 553719884, 769853086, 337485319, 702455584, 809637762, 755400257, 892290368, 502180086, 364275817, 118162370, 873374339, 261271695, 970132574, 744105500, 434447173, 117975095, 383088393, 625447969, 180281249, 545367713, 133236931, 360175662, 148087453, 806871297, 498529036, 886076476, 65645000, 465138299, 967109895, 331362616, 472283705, 796894900, 199697765, 503759892, 472807906, 187586706, 941198065, 782234442, 57693411, 18678611, 82626204, 395317191, 570588915, 152519440, 449852456, 63696518, 763741345, 878748386, 494317541, 444782633, 93316211, 929164666, 529288371, 165769871, 730546850, 955877127, 994202767, 492009567, 275683011, 415902127, 95725776, 718047399, 786963365, 73091278, 986172399, 174591541, 913259286}; int main() { scanf( %d , &n); printf( %d , ans[n - 1]); return 0; }

#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0; bool t = false; char ch = getchar(); while ((ch < 0 || ch > 9 ) && ch != - ) ch = getchar(); if (ch == - ) t = true, ch = getchar(); while (ch <= 9 && ch >= 0 ) x = x * 10 + ch - 48, ch = getchar(); return t ? -x : x; } int n, Q, lans; struct Line { int v, next, w; } e[100100 << 1]; int h[100100], cnt = 1; inline void Add(int u, int v, int w) { e[cnt] = (Line){v, h[u], w}; h[u] = cnt++; } struct Tree { int rt, p[19][100100], dfn[100100], low[100100], ln[100100], md[100100], dep[100100], tim; void dfs(int u, int ff) { p[0][u] = ff; ln[dfn[u] = ++tim] = u; md[u] = dep[u]; for (int i = 1; i < 19; ++i) p[i][u] = p[i - 1][p[i - 1][u]]; for (int i = h[u]; i; i = e[i].next) { int v = e[i].v; if (v == ff) continue; dep[v] = dep[u] + e[i].w; dfs(v, u); md[u] = max(md[u], md[v]); } low[u] = tim; } pair<int, int> mx[100100 << 2]; int tag[100100 << 2]; void pushup(int now) { mx[now] = max(mx[(now << 1)], mx[(now << 1 | 1)]); } void Build(int now, int l, int r) { if (l == r) { mx[now] = make_pair(dep[ln[l]], ln[l]); return; } int mid = (l + r) >> 1; Build((now << 1), l, mid); Build((now << 1 | 1), mid + 1, r); pushup(now); } void Modify(int now, int l, int r, int L, int R, int w) { if (L <= l && r <= R) { mx[now].first += w; tag[now] += w; return; } int mid = (l + r) >> 1; if (L <= mid) Modify((now << 1), l, mid, L, R, w); if (R > mid) Modify((now << 1 | 1), mid + 1, r, L, R, w); pushup(now); mx[now].first += tag[now]; } int ans[100100], vis[100100]; void pre(int _rt) { rt = _rt; dfs(rt, 0); Build(1, 1, n); for (int i = 2; i <= n; ++i) { ans[i] = ans[i - 1] + mx[1].first; for (int j = mx[1].second; j && !vis[j]; j = p[0][j]) vis[j] = i, Modify(1, 1, n, dfn[j], low[j], dep[p[0][j]] - dep[j]); } } int Solve(int x, int y) { y = min(y, n); if (vis[x] <= y) return ans[y]; int u = x; for (int i = 18; ~i; --i) if (vis[p[i][x]] > y) x = p[i][x]; x = p[0][x]; return ans[y] + md[u] - dep[x] - min(dep[x], min(ans[y] - ans[y - 1], md[x] - dep[x])); } } T1, T2; int mx, rt; void dfs(int u, int ff, int dep) { if (dep > mx) mx = dep, rt = u; for (int i = h[u]; i; i = e[i].next) if (e[i].v != ff) dfs(e[i].v, u, dep + e[i].w); } int main() { n = read(); Q = read(); for (int i = 1, u, v, w; i < n; ++i) u = read(), v = read(), w = read(), Add(u, v, w), Add(v, u, w); mx = 0; dfs(1, 0, 0); T1.pre(rt); while (Q--) { int u = (read() + lans - 1) % n + 1, v = (read() + lans - 1) % n + 1; printf( %d n , lans = T1.Solve(u, v << 1)); } return 0; }

#include <bits/stdc++.h> using namespace std; const long long int inf = 1e9 + 7; const long long int inf2 = inf * inf; priority_queue<long long int, vector<long long int>, greater<long long int>> mnheap; priority_queue<long long int> mxheap; long long int gcd(long long int x, long long int y) { if (x == 0) return y; return gcd(y % x, x); } int is_prime(long long int x) { if (x < 2) return 0; for (long long int i = 2; i * i <= x; i++) { if (x % i == 0) return 0; } return 1; } inline long long int modpw(long long int x, long long int y, long long int z) { long long int res = 1; x = x % z; while (y) { if (y & 1) res = (res * x) % z; x = (x * x) % z; y /= 2; } return res; } inline long long int modinv(long long int x, long long int z) { return modpw(x, z - 2, z); } long long int lcm(long long int x, long long int y) { return (x * y) / gcd(x, y); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, m; cin >> n >> m; int dp[n][m]; string st[n]; for (int i = 0; i < n; i++) cin >> st[i]; int cnt = 0; for (int i = 0; i < n - 1; i++) { if (st[i][m - 1] == R ) cnt++; } for (int i = 0; i < m - 1; i++) { if (st[n - 1][i] == D ) cnt++; } cout << cnt << endl; } }

#include <bits/stdc++.h> int main() { char s[150]; int o = 1, z = 0, a[150]; scanf( %s , &s); for (int i = 0; i < strlen(s); i++) { a[i] = s[i] - 0 ; } for (int i = 0; i < strlen(s) - 1; i++) { if (a[i] == a[i + 1]) { o++; if (o == 7) { printf( YES n ); return 0; } } else o = 1; } printf( NO n ); return 0; }

#include <bits/stdc++.h> using namespace std; const int mxn = 1e5 + 5; int n, a[mxn], c[mxn]; bool vis[mxn]; int main() { scanf( %d , &n); for (int(i) = (int)(1); (i) <= (int)(n); ++(i)) scanf( %d , a + i); int cnt = 0; for (int(i) = (int)(n); (i) >= (int)(1); --(i)) { c[i] = c[i + 1] + (vis[a[i]] == 0); vis[a[i]] = 1; } long long ans = 0; memset(vis, 0, sizeof(vis)); for (int(i) = (int)(1); (i) <= (int)(n); ++(i)) if (!vis[a[i]]) { vis[a[i]] = 1; ans += c[i + 1]; } return 0 * printf( %lld n , ans); }

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 7; int a[N], n, q; long long sum[N << 2][11], mul[11] = {1}; long long SUM[11], LA[11]; int lazy[N << 2][11]; void pushup(int rt) { for (int i = 0; i < 10; ++i) { sum[rt][i] = sum[rt << 1][i] + sum[rt << 1 | 1][i]; } } void pushdown(int rt) { for (int i = 0; i < 10; ++i) SUM[i] = sum[rt << 1][i], LA[i] = lazy[rt << 1][i]; for (int i = 0; i < 10; ++i) { int u = i, v = lazy[rt][i]; if (u == v) continue; for (int j = 0; j < 10; ++j) { if (lazy[rt << 1][j] == u) { LA[j] = lazy[rt][i]; } } SUM[lazy[rt][i]] += sum[rt << 1][i]; SUM[i] -= sum[rt << 1][i]; } for (int i = 0; i < 10; ++i) sum[rt << 1][i] = SUM[i], lazy[rt << 1][i] = LA[i]; for (int i = 0; i < 10; ++i) SUM[i] = sum[rt << 1 | 1][i], LA[i] = lazy[rt << 1 | 1][i]; for (int i = 0; i < 10; ++i) { int u = i, v = lazy[rt][i]; if (u == v) continue; for (int j = 0; j < 10; ++j) { if (lazy[rt << 1 | 1][j] == u) { LA[j] = lazy[rt][i]; } } SUM[lazy[rt][i]] += sum[rt << 1 | 1][i]; SUM[i] -= sum[rt << 1 | 1][i]; } for (int i = 0; i < 10; ++i) sum[rt << 1 | 1][i] = SUM[i], lazy[rt << 1 | 1][i] = LA[i]; for (int i = 0; i < 10; ++i) lazy[rt][i] = i; } void build(int l, int r, int rt) { for (int i = 0; i < 10; ++i) lazy[rt][i] = i; if (l == r) { int x = a[l], index = 0; while (x) { int y = x % 10; x /= 10; sum[rt][y] += mul[index]; index++; } return; } int mid = (l + r) >> 1; build(l, mid, rt << 1); build(mid + 1, r, rt << 1 | 1); pushup(rt); } void update(int l, int r, int rt, int L, int R, int x, int y) { if (L <= l && r <= R) { for (int j = 0; j < 10; ++j) { if (lazy[rt][j] == x) { lazy[rt][j] = y; sum[rt][y] += sum[rt][x]; sum[rt][x] = 0; } } return; } pushdown(rt); int mid = (l + r) >> 1; if (L <= mid) update(l, mid, rt << 1, L, R, x, y); if (R > mid) update(mid + 1, r, rt << 1 | 1, L, R, x, y); pushup(rt); } long long query(int l, int r, int rt, int L, int R) { if (L <= l && r <= R) { long long ret = 0; for (int i = 0; i < 10; ++i) ret += sum[rt][i] * i; return ret; } pushdown(rt); int mid = (l + r) >> 1; long long ret = 0; if (L <= mid) ret += query(l, mid, rt << 1, L, R); if (R > mid) ret += query(mid + 1, r, rt << 1 | 1, L, R); return ret; } int main() { for (int i = 1; i < 11; ++i) mul[i] = mul[i - 1] * 10; scanf( %d%d , &n, &q); for (int i = 1; i <= n; ++i) { scanf( %d , &a[i]); } build(1, n, 1); while (q--) { int op, L, R, x, y; scanf( %d , &op); if (op == 1) { scanf( %d%d%d%d , &L, &R, &x, &y); if (x == y) continue; update(1, n, 1, L, R, x, y); } else { scanf( %d%d , &L, &R); printf( %lld n , query(1, n, 1, L, R)); } } return 0; }

#include <bits/stdc++.h> using namespace std; const long long INF = 1ll << 32; const int mod = 1e9 + 7; inline int add(int x, int y) { x += y; if (x >= mod) return x - mod; return x; } inline int sub(int x, int y) { x -= y; if (x < 0) return x + mod; return x; } inline int mul(int x, int y) { return (x * 1ll * y) % mod; } inline int power(int x, int y) { int ans = 1; while (y) { if (y & 1) ans = mul(ans, x); x = mul(x, x); y >>= 1; } return ans; } inline int inv(int x) { return power(x, mod - 2); } const long long FACTORIAL_SIZE = 1.1e6; long long fact[FACTORIAL_SIZE], ifact[FACTORIAL_SIZE]; void gen_factorial(long long n) { fact[0] = fact[1] = ifact[0] = ifact[1] = 1; for (long long i = 2; i <= n; i++) { fact[i] = (i * fact[i - 1]) % mod; } ifact[n] = inv(fact[n]); for (long long i = n - 1; i >= 2; i--) { ifact[i] = ((i + 1) * ifact[i + 1]) % mod; } } long long nck(long long n, long long k) { long long den = (ifact[k] * ifact[n - k]) % mod; return (den * fact[n]) % mod; } const int N = 300000; long long f(string s) { if (s == Tetrahedron ) return 4; if (s == Cube ) return 6; if (s == Octahedron ) return 8; if (s == Dodecahedron ) return 12; if (s == Icosahedron ) return 20; } void solve() { long long n; cin >> n; long long ans = 0; for (long long i = 0; i < n; i++) { string s; cin >> s; ans += f(s); } cout << ans << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long tc = 1; int i = 1; while (tc--) { solve(); i++; } return 0; }

#include <bits/stdc++.h> using namespace std; long long n; bool isvalid(long long x) { if (x >= 0 && x <= n - 1) return true; else return false; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; vector<long long> a(n); for (long long i = 0; i < n; i++) { cin >> a[i]; } sort(a.begin(), a.end()); vector<long long> b(n); b[0] = a[n - 1]; long long i = n - 2; long long j = n - 3; long long right = 1; long long left = n - 1; while (true) { if (isvalid(i)) { b[right] = a[i]; right++; i -= 2; } if (isvalid(j)) { b[left] = a[j]; left--; j -= 2; } if (isvalid(i) == false && isvalid(j) == false) break; } bool done = true; if (b[0] >= b[1] + b[n - 1]) { done = false; } if (b[n - 1] >= b[n - 2] + b[0]) { done = false; } for (long long i = 1; i <= n - 2; i++) { if (b[i] >= b[i - 1] + b[i + 1]) { done = false; break; } } if (!done) { cout << NO << n ; } else { cout << YES << n ; for (long long i = 0; i < n; i++) { cout << b[i] << ; } } return 0; }

#include <bits/stdc++.h> using namespace std; int ans; int main() { int d, n, u, i, prev; cin >> d >> n; for (i = 0; i < n; i++) { cin >> u; if (i and prev != 1) ans += d - prev + 1; prev = u + 1; if (prev > d) prev -= d; } cout << ans; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { int n; cin >> n; int ans = 1e9; for (int i = 1; i * i <= n; i++) { ans = min(ans, i - 1 + (n - i + i - 1) / i); } cout << ans << n ; } return 0; }

#include <bits/stdc++.h> const int n = 7; const int msiz = 1 << n; const int mod = 1000000007; int a[n]; int ans[msiz]; long long int tans[msiz]; struct matrix { long long int cont[msiz][msiz]; matrix operator*(const matrix& r) const { matrix p; int i, j, k; for (i = 0; i < msiz; i++) { for (j = 0; j <= i; j++) { p.cont[i][j] = 0; for (k = 0; k < msiz; k++) { p.cont[i][j] += cont[i][k] * r.cont[k][j]; p.cont[i][j] %= mod; } } } for (i = 0; i < msiz; i++) { for (j = i + 1; j < msiz; j++) { p.cont[i][j] = p.cont[j][i]; } } return p; } }; matrix q[4]; matrix pwr(int x) { matrix res; if (x == 0) { int i, j; for (i = 0; i < msiz; i++) { for (j = 0; j < msiz; j++) { if (i == j) res.cont[i][j] = 1; else res.cont[i][j] = 0; } } return res; } res = pwr(x / 4); res = res * res; res = res * res; if (x % 4 != 0) res = res * q[x % 4]; return res; } int main() { int i, j, k, l; matrix p; for (i = 0; i < n; i++) { scanf( %d , &a[i]); } for (i = 0; i < msiz; i++) { ans[i] = 0; } ans[0] = 1; for (i = n; i > 0; i--) { for (j = 0; j < msiz; j++) { for (k = 0; k < msiz; k++) { p.cont[j][k] = 0; } } for (j = 0; j < (1 << i); j++) { for (k = 0; k < (1 << i); k++) { for (l = 0; l < (1 << (i - 1)); l++) { if ((j | k | l | (l << 1)) == (1 << i) - 1) p.cont[j][k]++; } } } q[1] = p; q[2] = p * p; q[3] = q[2] * p; p = pwr(a[i - 1]); for (j = 0; j < msiz; j++) { tans[j] = 0; for (k = 0; k < msiz; k++) { tans[j] += ans[k] * p.cont[j][k]; tans[j] %= mod; } } for (j = 0; j < msiz; j++) ans[j] = tans[j]; } printf( %d , ans[0]); }

#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int max_n = 1e5 + 5; string q[max_n]; int dig[10][2]; int main() { string s; cin >> s; int n; scanf( %d , &n); for (int i = 1; i <= n; i++) cin >> q[i]; for (int i = 0; i <= 9; i++) { dig[i][0] = i; dig[i][1] = 10; } for (int i = n; i >= 1; i--) { int d = q[i][0] - 0 ; int len = q[i].length(); int sum = 0, pw = 1; for (int j = 3; j < len; j++) { int k = q[i][j] - 0 ; sum = (1LL * sum * dig[k][1] % mod + dig[k][0]) % mod; pw = 1LL * pw * dig[k][1] % mod; } dig[d][0] = sum; dig[d][1] = pw; } int len = s.length(); int ans = 0; for (int i = 0; i < len; i++) { int d = s[i] - 0 ; ans = (1LL * ans * dig[d][1] % mod + dig[d][0]) % mod; } printf( %d n , ans); return 0; }

#include <bits/stdc++.h> using namespace std; const int inf = 2000000000; int H, T, R, m, hi[205], ti[205], n, hj[205], tj[205], h[205][205], t[3000000][3], w, d[205][205]; void adde(int x, int y, int X, int Y) { t[w][0] = X; t[w][1] = Y; t[w][2] = h[x][y]; h[x][y] = w++; } struct node { int x, y, d; bool operator<(const node &t) const { return d > t.d; } } temp; priority_queue<node> q; bool dij() { for (int i = 0; i <= 200; i++) for (int j = 0; j <= 200; j++) d[i][j] = inf; d[H][T] = 0; temp.x = H; temp.y = T; temp.d = d[H][T]; q.push(temp); while (!q.empty()) { temp = q.top(); q.pop(); int x = temp.x, y = temp.y; if (temp.d == d[x][y]) { for (int i = h[x][y]; i != -1; i = t[i][2]) { int X = t[i][0], Y = t[i][1]; if (d[x][y] + 1 < d[X][Y]) { d[X][Y] = d[x][y] + 1; temp.x = X; temp.y = Y; temp.d = d[X][Y]; q.push(temp); } } } } return d[0][0] != inf; } bool spfa() { int q[21010][2], rq, wq, g[205][205]; bool b[205][205]; for (int i = 0; i <= 200; i++) for (int j = 0; j <= 200; j++) d[i][j] = 0; rq = wq = 0; q[wq][0] = H; q[wq][1] = T; wq++; memset(g, 0, sizeof(g)); g[H][T]++; memset(b, true, sizeof(b)); b[H][T] = false; while (wq--) { int x = q[wq][0], y = q[wq][1]; b[x][y] = true; for (int i = h[x][y]; i != -1; i = t[i][2]) { int X = t[i][0], Y = t[i][1]; if (d[x][y] + 1 > d[X][Y]) { d[X][Y] = d[x][y] + 1; if (b[X][Y]) { g[X][Y]++; if (g[X][Y] > 21000) return true; b[X][Y] = false; q[wq][0] = X; q[wq][1] = Y; wq++; } } } } return false; } int main() { scanf( %d%d%d , &H, &T, &R); scanf( %d , &m); for (int i = 1; i <= m; i++) { scanf( %d%d , &hi[i], &ti[i]); hi[i] -= i; } scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d%d , &hj[i], &tj[i]); tj[i] -= i; } memset(h, -1, sizeof(h)); w = 0; for (int i = 0; i <= R; i++) { for (int j = 0; i + j <= R; j++) { for (int k = 1; (k <= m) && (k <= i); k++) if (i + hi[k] + j + ti[k] > R) adde(i, j, 200, 200); else adde(i, j, i + hi[k], j + ti[k]); for (int k = 1; (k <= n) && (k <= j); k++) if (i + hj[k] + j + tj[k] > R) adde(i, j, 200, 200); else adde(i, j, i + hj[k], j + tj[k]); } } if (dij()) printf( Ivan n%d n , d[0][0]); else if (spfa()) printf( Draw n ); else printf( Zmey n%d n , d[200][200]); return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 101000; int n, z[N], a[N], b[N]; set<pair<int, int> > Set; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); } for (int i = 0; i < n; i++) { scanf( %d , &b[i]); } vector<int> ans; for (int i = 0; i < n; i++) { z[i] = a[i] - b[i]; if (i) z[i] += z[i - 1]; Set.insert(make_pair(z[i], i)); } int line = 0; for (int i = 0; i < n; i++) { if (Set.begin()->first >= line) { ans.push_back(i + 1); } line = z[i]; } line = 0; Set.clear(); for (int i = n - 1; i >= 0; i--) { z[i] = a[i] - b[(i + n - 1) % n]; if (i != n - 1) z[i] += z[i + 1]; Set.insert(make_pair(z[i], i)); } for (int i = n - 1; i >= 0; i--) { if (Set.begin()->first >= line) { ans.push_back(i + 1); } line = z[i]; } sort(ans.begin(), ans.end()); ans.erase(unique(ans.begin(), ans.end()), ans.end()); printf( %d n , (int)ans.size()); for (__typeof((ans).begin()) it = (ans).begin(); it != (ans).end(); it++) { printf( %d , *it); } puts( ); return 0; }

#include <bits/stdc++.h> using namespace std; int n, a, r, m; vector<int> h; vector<long long> pref; long long cost(long long goal) { long long indexl = distance(h.begin(), lower_bound(h.begin(), h.end(), goal)); long long cost_a = 0; if (indexl > 0) { cost_a = goal * (indexl)-pref[indexl - 1]; } long long indexh = distance(h.begin(), upper_bound(h.begin(), h.end(), goal)); long long cost_r = pref[n - 1] - pref[indexh - 1] - (n - 1 - indexh + 1) * goal; long long res = 0; if (cost_a > cost_r) { res = m * cost_r + (cost_a - cost_r) * a; } else { res = m * cost_a + (cost_r - cost_a) * r; }; ; ; return res; } void solve() { cin >> n >> a >> r >> m; m = min(m, a + r); h = vector<int>(n); pref = vector<long long>(n); for (int i = 0; i < n; ++i) { cin >> h[i]; } sort(h.begin(), h.end()); ; for (int i = 0; i < n; ++i) { if (i > 0) { pref[i] = pref[i - 1] + h[i]; } else { pref[i] = h[i]; } } long long answer = LLONG_MAX; for (int i = 0; i < n; ++i) { if (i > 0 && h[i] == h[i - 1]) { continue; } answer = min(answer, cost((long long)h[i])); } answer = min(answer, cost((long long)(pref[n - 1] / n))); answer = min(answer, cost((long long)(1 + pref[n - 1] / n))); cout << answer << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t = 1; for (int i = 1; i <= t; ++i) { solve(); } return 0; }

#include <bits/stdc++.h> typedef struct { double x, y; } point_t; typedef struct { double x, y, r; } circle_t; typedef struct { double A, B, C; } Line; Line zhong_chui_xian(circle_t circle1, circle_t circle2) { Line L1; point_t p; double k; p.x = (circle1.x + circle2.x) / 2; p.y = (circle1.y + circle2.y) / 2; if (fabs(circle1.y - circle2.y) < 1E-8) { L1.A = 1; L1.B = 0; L1.C = -p.x; } else if (fabs(circle1.x - circle2.x) < 1E-8) { L1.A = 0; L1.B = 1; L1.C = -p.y; } else { k = -1 / ((circle1.y - circle2.y) / (circle1.x - circle2.x)); L1.A = k; L1.B = -1; L1.C = p.y - k * p.x; } return L1; } int line_intersect(Line L1, Line L2, point_t& p) { double d, d1, d2, d3; d = L1.A * L2.B - L2.A * L1.B; if (fabs(d) < 1E-8) { d1 = L1.A / L2.A; d2 = L1.B / L2.B; d3 = L1.C / L2.C; if (fabs(d1 - d2) < 1E-8 && fabs(d2 - d3) < 1E-8) return 2; else return 0; } p.x = (L2.C * L1.B - L1.C * L2.B) / d; p.y = (L2.A * L1.C - L1.A * L2.C) / d; return 1; } circle_t yuan_guiji(circle_t circle1, circle_t circle2) { circle_t circle3; double keep1, keep2, keep3; keep1 = (circle2.r * circle2.r * circle1.x - circle1.r * circle1.r * circle2.x) / (circle1.r * circle1.r - circle2.r * circle2.r); keep2 = (circle2.r * circle2.r * circle1.y - circle1.r * circle1.r * circle2.y) / (circle1.r * circle1.r - circle2.r * circle2.r); keep3 = (circle2.r * circle2.r * circle1.x * circle1.x - circle1.r * circle1.r * circle2.x * circle2.x - circle1.r * circle1.r * circle2.y * circle2.y + circle2.r * circle2.r * circle1.y * circle1.y) / (circle1.r * circle1.r - circle2.r * circle2.r); circle3.x = -keep1; circle3.y = -keep2; circle3.r = sqrt(keep3 + keep1 * keep1 + keep2 * keep2); return circle3; } int equa(double A, double B, double C, double& x1, double& x2) { double f = B * B - 4 * A * C; if (f < 0) return -1; x1 = (-B + sqrt(f)) / (2 * A); x2 = (-B - sqrt(f)) / (2 * A); return 1; } double point_line_dis(point_t a, Line ln) { return (fabs(ln.A * a.x + ln.B * a.y + ln.C) / sqrt(ln.A * ln.A + ln.B * ln.B)); } int line_circle_intersect(Line ln, circle_t Y, point_t& p1, point_t& p2) { double t1, t2, len; point_t p3; p3.x = Y.x; p3.y = Y.y; len = point_line_dis(p3, ln); if (len > Y.r) return 0; int zz = -1; if (fabs(ln.B) < 1e-8) { p1.x = p2.x = -1.0 * ln.C / ln.A; zz = equa(1.0, -2.0 * Y.y, Y.y * Y.y + (p1.x - Y.x) * (p1.x - Y.x) - Y.r * Y.r, t1, t2); p1.y = t1; p2.y = t2; } else if (fabs(ln.A) < 1e-8) { p1.y = p2.y = -1.0 * ln.C / ln.B; zz = equa(1.0, -2.0 * Y.x, Y.x * Y.x + (p1.y - Y.y) * (p1.y - Y.y) - Y.r * Y.r, t1, t2); p1.x = t1; p2.x = t2; } else { zz = equa( ln.A * ln.A + ln.B * ln.B, 2.0 * ln.A * ln.C + 2.0 * ln.A * ln.B * Y.y - 2.0 * ln.B * ln.B * Y.x, ln.B * ln.B * Y.x * Y.x + ln.C * ln.C + 2 * ln.B * ln.C * Y.y + ln.B * ln.B * Y.y * Y.y - ln.B * ln.B * Y.r * Y.r, t1, t2); p1.x = t1, p1.y = -1 * (ln.A / ln.B * t1 + ln.C / ln.B); p2.x = t2, p2.y = -1 * (ln.A / ln.B * t2 + ln.C / ln.B); } if (p1.x - p2.x < 1E-8 && p1.y - p2.y < 1E-8) return 1; else return 2; } double dist(double xa, double ya, double xb, double yb) { return sqrt((xa - xb) * (xa - xb) + (ya - yb) * (ya - yb)); } double max(double a, double b) { return a > b ? a : b; } double min(double a, double b) { return a < b ? a : b; } int circle_intersect(circle_t A, circle_t B, point_t& ia, point_t& ib) { if (A.x == B.x && A.y == B.y) return 5; double dd = dist(A.x, A.y, B.x, B.y); if (A.r + B.r + 1E-8 < dd) return 1; double k, a, b, d, aa, bb, cc, c, drt; k = A.r; a = B.x - A.x; b = B.y - A.y; c = B.r; d = (c * c) - (k * k) - (a * a) - (b * b); aa = 4 * (a * a) + 4 * (b * b); bb = 4 * b * d; cc = (d * d) - 4 * (a * a) * (k * k); drt = (bb * bb) - 4 * aa * cc; if (drt < 0) return 5; drt = sqrt(drt); ia.y = (-bb + drt) / 2 / aa; ib.y = (-bb - drt) / 2 / aa; if (fabs(a) < 1E-8) { ia.x = sqrt((k * k) - (ia.y * ia.y)); ib.x = -ia.x; } else { ia.x = (2 * b * ia.y + d) / -2 / a; ib.x = (2 * b * ib.y + d) / -2 / a; } ia.x += A.x; ia.y += A.y; ib.x += A.x; ib.y += A.y; if (fabs(ia.y - ib.y) < 1E-8) { if (fabs(A.r + B.r - dd) < 1E-8) return 2; if (fabs(dd - (max(A.r, B.r) - min(A.r, B.r))) < 1E-8) return 3; } return 4; } int main() { circle_t circle[3]; int i, count; Line L1, L2; point_t p, p1, p2; circle_t circle1, circle2; for (i = 0; i < 3; i++) scanf( %lf%lf%lf , &circle[i].x, &circle[i].y, &circle[i].r); if (fabs(circle[0].r - circle[1].r) < 1E-8) { L1 = zhong_chui_xian(circle[0], circle[1]); if (fabs(circle[1].r - circle[2].r) < 1E-8) { L2 = zhong_chui_xian(circle[1], circle[2]); line_intersect(L1, L2, p); printf( %0.5lf %0.5lf n , p.x, p.y); } else { circle2 = yuan_guiji(circle[1], circle[2]); count = line_circle_intersect(L1, circle2, p1, p2); if (count == 1) { printf( %0.5lf %0.5lf n , p1.x, p1.y); } else if (count == 2) { if ((circle[0].r / dist(circle[0].x, circle[0].y, p1.x, p1.y)) > (circle[0].r / dist(circle[0].x, circle[0].y, p2.x, p2.y))) printf( %0.5lf %0.5lf n , p1.x, p1.y); else printf( %0.5lf %0.5lf n , p2.x, p2.y); } } } else { circle1 = yuan_guiji(circle[0], circle[1]); if (fabs(circle[1].r - circle[2].r) < 1E-8) { L2 = zhong_chui_xian(circle[1], circle[2]); count = line_circle_intersect(L2, circle1, p1, p2); if (count == 1) { printf( %0.5lf %0.5lf n , p1.x, p1.y); } else if (count == 2) { if ((circle[0].r / dist(circle[0].x, circle[0].y, p1.x, p1.y)) > (circle[0].r / dist(circle[0].x, circle[0].y, p2.x, p2.y))) printf( %0.5lf %0.5lf n , p1.x, p1.y); else printf( %0.5lf %0.5lf n , p2.x, p2.y); } } else { circle2 = yuan_guiji(circle[1], circle[2]); count = circle_intersect(circle1, circle2, p1, p2); if (count == 2 || count == 3) { printf( %0.5lf %0.5lf n , p1.x, p1.y); } else if (count == 4) { if ((circle[0].r / dist(circle[0].x, circle[0].y, p1.x, p1.y)) > (circle[0].r / dist(circle[0].x, circle[0].y, p2.x, p2.y))) printf( %0.5lf %0.5lf n , p1.x, p1.y); else printf( %0.5lf %0.5lf n , p2.x, p2.y); } } } return 0; }

#include <bits/stdc++.h> using namespace std; template <typename A, typename B> string to_string(pair<A, B> p); template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p); template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p); string to_string(const string& s) { return + s + ; } string to_string(const char* s) { return to_string((string)s); } string to_string(bool b) { return (b ? true : false ); } string to_string(vector<bool> v) { bool first = true; string res = { ; for (int i = 0; i < static_cast<int>(v.size()); i++) { if (!first) { res += , ; } first = false; res += to_string(v[i]); } res += } ; return res; } template <size_t N> string to_string(bitset<N> v) { string res = ; for (size_t i = 0; i < N; i++) { res += static_cast<char>( 0 + v[i]); } return res; } template <typename A> string to_string(A v) { bool first = true; string res = { ; for (const auto& x : v) { if (!first) { res += , ; } first = false; res += to_string(x); } res += } ; return res; } template <typename A, typename B> string to_string(pair<A, B> p) { return ( + to_string(p.first) + , + to_string(p.second) + ) ; } template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p) { return ( + to_string(get<0>(p)) + , + to_string(get<1>(p)) + , + to_string(get<2>(p)) + ) ; } template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p) { return ( + to_string(get<0>(p)) + , + to_string(get<1>(p)) + , + to_string(get<2>(p)) + , + to_string(get<3>(p)) + ) ; } void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << << to_string(H); debug_out(T...); } const int mod = 1e9 + 7; const int maxn = 200005; const int inf = 1e9; int tiempo[maxn], x[maxn], y[maxn], pref[maxn], dp[maxn]; void solve() { int r, n; cin >> r >> n; for (int i = 1; i <= n; i++) { cin >> tiempo[i] >> x[i] >> y[i]; dp[i] = -inf; } x[0] = y[0] = 1; int ans = -inf; for (int i = 1; i <= n; i++) { for (int j = i - 1; j >= 0; j--) { if (tiempo[i] - tiempo[j] > 2 * r) { dp[i] = max(dp[i], pref[j] + 1); break; } int dist = abs(x[i] - x[j]) + abs(y[i] - y[j]); if (dist <= (tiempo[i] - tiempo[j])) { dp[i] = max(dp[i], dp[j] + 1); } } pref[i] = pref[i - 1]; pref[i] = max(pref[i], dp[i]); ans = max(ans, pref[i]); } cout << ans << n ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t = 1; while (t--) { solve(); } return 0; }

#include <bits/stdc++.h> using namespace std; const long double eps = 1e-9; const int inf = (1 << 30) - 1; const long long inf64 = ((long long)1 << 62) - 1; const long double pi = 3.1415926535897932384626433832795; const string task = ; template <class T> T sqr(T x) { return x * x; } const int nmax = 2100; int a[nmax][nmax]; char s[nmax][nmax]; int n, res; int x[nmax], y[nmax]; int main() { int n; cin >> n; gets(s[0]); for (int i = 0; i < (int)(n); i++) gets(s[i]); for (int i = 0; i < (int)(n); i++) for (int j = 0; j < (int)(n); j++) a[i][j] = s[i][j] - 0 ; int res = 0; memset(x, 0, sizeof x); memset(y, 0, sizeof y); for (int i = n - 1; i > 0; i--) { for (int j = 0; i + j < n; j++) { int now = a[i + j][j] + x[i + j] + y[j]; now = now & 1; if (now) { res++; x[i + j]++; y[j]++; } } } for (int i = 0; i < (int)(n); i++) a[i][i] = (a[i][i] + x[i] + y[i]) & 1; memset(x, 0, sizeof x); memset(y, 0, sizeof y); for (int i = n - 1; i > 0; i--) { for (int j = 0; i + j < n; j++) { int now = a[j][i + j] + x[j] + y[i + j]; now = now & 1; if (now) { res++; y[i + j]++; x[j]++; } } } for (int i = 0; i < (int)(n); i++) a[i][i] = (a[i][i] + x[i] + y[i]) & 1; for (int i = 0; i < (int)(n); i++) if (a[i][i] == 1) res++; cout << res << endl; return 0; }

#include <bits/stdc++.h> using namespace std; const long long inf = (1ll << 60); const int maxn = 10010; long long dp[2][maxn], c; int p[maxn], s[maxn]; int n, id; int main() { scanf( %d%I64d , &n, &c); for (int i = 0; i < n; i++) scanf( %d , p + i); for (int i = 0; i < n; i++) scanf( %d , s + i); for (int i = 1; i <= n; i++) dp[0][i] = inf; for (int i = 0; i < n; i++) { for (int j = 0; j <= i + 1; j++) dp[id ^ 1][j] = inf; for (int j = 0; j <= i; j++) { dp[id ^ 1][j] = min(dp[id ^ 1][j], dp[id][j] + p[i] + c * j); dp[id ^ 1][j + 1] = min(dp[id ^ 1][j + 1], dp[id][j] + s[i]); } id ^= 1; } long long res = inf; for (int i = 0; i <= n; i++) res = min(res, dp[id][i]); cout << res << endl; return 0; }

#include <bits/stdc++.h> using namespace std; void in(long long int &number) { bool negative = false; register int c; number = 0; c = getchar(); if (c == - ) { negative = true; c = getchar(); } for (; (c > 47 && c < 58); c = getchar()) number = number * 10 + c - 48; if (negative) number *= -1; } void in(int &number) { bool negative = false; register int c; number = 0; c = getchar(); if (c == - ) { negative = true; c = getchar(); } for (; (c > 47 && c < 58); c = getchar()) number = number * 10 + c - 48; if (negative) number *= -1; } int k[100005]; int main() { int n, m; in(n); in(m); memset(k, 0, sizeof(k)); vector<long long int> a(n); for (int i = 0; i <= n - 1; i++) in(a[i]); vector<int> dp(n); dp[n - 1] = 1; k[a[n - 1]] = 1; for (int i = n - 2; i >= 0; i--) { if (k[a[i]] == 0) { dp[i] = dp[i + 1] + 1; k[a[i]] = 1; } else dp[i] = dp[i + 1]; } while (m--) { int l; in(l); l--; cout << dp[l] << n ; } return 0; }

#include<bits/stdc++.h> #define mx 100005 #define lli long long int #define ulli unsigned long long int #define mset(a,b) memset(a, b, sizeof(a)) #define infile freopen( in.txt , r , stdin); #define outfile freopen ( out.txt , w ,stdout); #define fileclose fclose (stdin); fclose (stdout); #define test_case lli T; cin>>T;for(lli t=1;t<=T;t++) #define scani(x) scanf( %d ,&x); #define printi(x) printf( %d n ,x); #define scanli(x) scanf( %lld ,&x); #define printli(x) printf( %lld n ,x); #define frep(i,from,to) for(lli i=from;i<=to;i++) #define frev(i,from,to) for(lli i=from;i>=to;i--) using namespace std; int main() { //infile //outfile test_case { lli n; lli x,mini=2000000000,mi; scanli(n); frep(i,1,n) { cin>>x; if(x<mini) { mi=i; mini=x; } } cout<<n-1<< n ; frep(j,1,n) { if(mi!=j) cout<<mi<< <<j<< <<mini<< <<abs(mi-j)+mini<< n ; } } fileclose }

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma ) #pragma GCC optimize( unroll-loops ) using namespace std; long long int MOD = 998244353; double eps = 1e-12; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int k, n, w, product = 0; cin >> k >> n >> w; for (int i = 1; i <= w; i++) { product += (i * k); } long long int res = product - n; if (res <= 0) cout << 0 << endl; else cout << res << endl; return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 32005; int n, m, i, j, f; int a[N]; long long ans; int main() { scanf( %d%d , &n, &m); for (i = m + 1; i <= (n + 1) / 2; i++) { for (j = m + 1; j < 2 * i; j++) { f = (i * (2 * i - j) + (n + 1) * (2 * j - i)) / (i + j); f = max(f, m); if (f > n - m) continue; a[i] += n - m - f; } } for (i = m + 1; i <= (n + 1) / 2; i++) ans += 2 * a[i]; if (n % 2) ans -= a[i - 1]; printf( %I64d n , 3 * ans); return 0; }

#include <bits/stdc++.h> using namespace std; const int Mod = 1e9 + 7; const double pi = 2 * acos(0.0); const int N = 3e5 + 5; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, t; cin >> t; while (t--) { cin >> n; int x, z = 0, tot = 0; for (int i = 0; i < n; i++) { cin >> x; if (!x) z++; tot += x; } cout << z + ((tot + z) == 0) << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; int n, x; int a[105]; long double dp[2][105][10005]; const long double threshold = 1e-12; int main() { scanf( %d%d , &n, &x); long double s = 0.0; for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); s += a[i]; } dp[0][0][0] = 1.0; for (int i = 0; i < n; i++) { int now = i & 1, nxt = now ^ 1; memset(dp[nxt], 0, sizeof(dp[nxt])); for (int j = 0; j <= i; j++) { for (int k = 0; k <= 10000; k++) { dp[nxt][j][k] += dp[now][j][k]; dp[nxt][j + 1][k + a[i + 1]] += dp[now][j][k] * (j + 1) / (n - j); } } } long double ans = 0.0; for (int i = 0; i <= n - 1; i++) for (int j = 0; j <= s; j++) ans += dp[n & 1][i][j] * (min((s - j) / (n - i), ((long double)n / (n - i) + 1) * x / 2.0)); printf( %.10Lf n , ans); return 0; }

#include <bits/stdc++.h> using namespace std; const long long int MOD = 1000000007; const long double PI = 3.14159265; long long int powerWithMod(long long int base, long long int exponent, long long int MODulus = LLONG_MAX) { long long int ansult = 1; base %= MODulus; while (exponent > 0) { if (exponent % 2 == 1) ansult = (ansult * base) % MODulus; exponent >>= 1; base = (base * base) % MODulus; } return ansult; } long long int gcdExtended(long long int a, long long int b, long long int *x, long long int *y) { cout << a << << b << << *x << << *y << n ; if (a == 0) { *x = 0, *y = 1; return b; } long long int x1, y1; long long int gcd = gcdExtended(b % a, a, &x1, &y1); *x = y1 - (b / a) * x1; *y = x1; cout << AFTER << a << << b << << *x << << *y << n ; return gcd; } long long int MODInverse(long long int a, long long int m) { long long int x, y; long long int g = gcdExtended(a, m, &x, &y); cout << g << << x << << y << n ; long long int ans = (x % m + m) % m; return ans; } using namespace std; int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); long long int n, a = 0, x, m = 0; cin >> n; for (int i = 1; i <= n; i++) cin >> x, a += x, m = max(x, m); cout << max(m, (a + n - 2) / (n - 1)) << n ; return 0; }

#include <bits/stdc++.h> using namespace std; const long long int N = 100005; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); { long long int i, j, k, n, m, ans = 0, cnt = 0, sum = 0; cin >> n; vector<long long int> v; long long int a[n]; j = 0; ans = 0; for (i = 0; i < n; i++) { cin >> a[i]; if (a[i] < 0) { j++; if (j == 3) { v.push_back(i - ans); cnt++; ans = i; j = 1; } } if (i == n - 1) { v.push_back(i - ans + 1); cnt++; } } cout << max((long long int)1, cnt) << endl; for (auto x : v) { cout << x << ; } } }

#include <bits/stdc++.h> using namespace std; const int INF = 1e7; const long long MOD = 998244353; vector<vector<int> > occur; vector<vector<long long> > minC, dp; long long gV(int l, int r) { if (l == r + 1) { return 1; } return dp[l][r]; } void calc(int l, int r) { int cMinC = minC[l][r]; vector<int> &cOccur = occur[cMinC]; int fI = cOccur[0]; int lI = cOccur[cOccur.size() - 1]; if (fI < l || r < lI) { dp[l][r] = 0; return; } long long sumR = 0; for (int nR = lI; nR <= r; nR++) { sumR = (sumR + gV(lI + 1, nR) * gV(nR + 1, r)) % MOD; } long long sumL = 0; for (int nL = fI; nL >= l; nL--) { sumL = (sumL + gV(l, nL - 1) * gV(nL, fI - 1)) % MOD; } long long inProd = 1; for (int i = 0; i + 1 < cOccur.size(); i++) { inProd = inProd * gV(cOccur[i] + 1, cOccur[i + 1] - 1) % MOD; } dp[l][r] = (sumL * sumR % MOD) * inProd % MOD; } int main() { int N, M; cin >> M >> N; vector<int> a; for (int i = 0; i < N; i++) { int x; cin >> x; x--; if (a.empty() || a[a.size() - 1] != x) { a.push_back(x); } } N = a.size(); if (N > 2 * M) { cout << 0 << endl; return 0; } minC.resize(N); for (int i = 0; i < N; i++) { minC[i].resize(N); int cMin = a[i]; for (int j = i; j < N; j++) { cMin = min(cMin, a[j]); minC[i][j] = cMin; } } occur.resize(M); for (int i = 0; i < N; i++) { occur[a[i]].push_back(i); } dp.resize(N); for (int i = 0; i < N; i++) { dp[i].resize(N); fill(dp[i].begin(), dp[i].end(), 0); } for (int len = 1; len <= N; len++) { for (int l = 0; l < N; l++) { int r = l + len - 1; if (r >= N) { continue; } calc(l, r); } } cout << dp[0][N - 1] << endl; }

#include <bits/stdc++.h> #pragma comment(linker, /STACK: 2000000 ) using namespace std; int main(void) { srand(time(0)); cout << fixed << setprecision(7); cerr << fixed << setprecision(7); int n; ios_base ::sync_with_stdio(0); cin.tie(0); cin >> n; function<int(int)> ok = [&](int k) { return !k ? 0 : ok(k / 10) | ((k % 10 != 4) && (k % 10 != 7)); }; static int f[1 << 20]; for (int i = 1; i <= n; ++i) f[i] = i; function<int(int)> get = [&](int k) { return k == f[k] ? k : f[k] = get(f[k]); }; for (int i = 1; i < n; ++i) { int a, b, c; cin >> a >> b >> c; if (ok(c)) f[get(a)] = get(b); } static int S[1 << 20]; for (int i = 1; i <= n; ++i) ++S[get(i)]; long long ans = 0; for (int i = 1; i <= n; ++i) ans += 1ll * (n - S[get(i)]) * (n - S[get(i)] - 1); cout << ans << n ; return 0; }

#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; vector<long long> v[100009], vv[100009]; long long vis[100009], dis[101][100001], ar[100001]; void bfs(long long k) { queue<long long> q; memset(vis, 0, sizeof(vis)); for (long long x : vv[k]) { q.push(x); vis[x] = 1; dis[k][x] = 0; } while (!q.empty()) { long long x = q.front(); q.pop(); for (long long y : v[x]) { if (!vis[y]) { vis[y] = 1; q.push(y); dis[k][y] = dis[k][x] + 1; } } } } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, m, k, s, ans = 1e15; cin >> n >> m >> k >> s; for (long long i = 1; i <= n; i++) { cin >> ar[i]; vv[ar[i]].push_back(i); } for (long long i = 0; i < m; i++) { long long x, y; cin >> x >> y; v[x].push_back(y); v[y].push_back(x); } for (long long i = 1; i <= k; i++) bfs(i); for (long long i = 1; i <= n; i++) { vector<long long> hh; long long as = 0; for (long long j = 1; j <= k; j++) hh.push_back(dis[j][i]); sort(hh.begin(), hh.end()); for (long long j = 0; j < s; j++) as += hh[j]; cout << as << ; } cout << endl; }