func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; const long long inf = LLONG_MAX / 2; const long long MX = 1e5 + 10; int a[MX]; set<int> s; vector<int> v; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, m; cin >> n >> m; for (long long(i) = (0); (i) <= (n - 1); ++(i)) { cin >> a[i]; s.insert(a[i]); } int num = 1; while (m >= num) { if (!s.count(num)) { m -= num; v.push_back(num); } num++; } cout << v.size() << endl; for (auto it : v) { cout << it << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long tr(long long d) { return d * (d + 1) / 2; } inline long long tr2(long long d) { return 2 * tr(d) - d; } int n; long long solve(int y, int x, long long c) { long long res = 4 * (tr(c + 1) - c - 1) + 1; if (c - (y + 1) >= 0) res -= tr2(c - (y + 1) + 1); if (c - (n - y) >= 0) res -= tr2(c - (n - y) + 1); if (c - (x + 1) >= 0) res -= tr2(c - (x + 1) + 1); if (c - (n - x) >= 0) res -= tr2(c - (n - x) + 1); if (c - (y + x + 2) >= 0) res += tr(c - (y + x + 2) + 1); if (c - (y + 1 + n - x) >= 0) res += tr(c - (y + 1 + n - x) + 1); if (c - (x + 1 + n - y) >= 0) res += tr(c - (x + 1 + n - y) + 1); if (c - (n - x + n - y) >= 0) res += tr(c - (n - x + n - y) + 1); return res; } int main() { int y, x, c; while (scanf( %d%d%d%d , &n, &y, &x, &c) >= 1) { --y, --x; int l = -1, r = (int)2e9 + 1; while (l + 1 < r) { int m = l + (r - l) / 2; if (solve(y, x, m) >= (long long)c) r = m; else l = m; } printf( %d n , r); } return 0; } |
#include <bits/stdc++.h> using namespace std; void setIO(string name = ) { ios_base::sync_with_stdio(0); cin.tie(0); if (int((name).size())) { freopen((name + .in ).c_str(), r , stdin); freopen((name + .out ).c_str(), w , stdout); } } long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } long long mcm(long long a, long long b) { return (a * b) / gcd(a, b); } bool prime(long long n, long long i) { if (i > sqrt(n)) return true; if (n % i == 0) return false; else return prime(n, i + 1); } struct compii { bool operator()(const pair<int, int> &a, const pair<int, int> &b) { if (a.first == a.second) return a.second < b.second; return a.first > b.first; } }; bool comp(int a, int b) { return a > b; } int dx[] = {1, 0, -1, 0}; int dy[] = {0, 1, 0, -1}; void solve() { int n; cin >> n; vector<int> num(n); int c0 = 0; int c1 = 0; for (auto &x : num) { cin >> x; if (x == 1) c1++; else c0++; } int i = 0; for (i = 0; i < n; i++) { if (num[i] == 1) c1--; else c0--; if (c1 == 0) break; if (c0 == 0) break; } cout << i + 1 << endl; } int main() { setIO( ); int t = 1; while (t-- > 0) solve(); return 0; } |
#include <bits/stdc++.h> #define int long long using namespace std; const int maxm=5e5+5; int stk[maxm],head; int d[maxm]; int a[maxm]; int n; // int rt[maxm],tot; int lc[maxm*40],rc[maxm*40],ma[maxm*40]; inline void pp(int k){ ma[k]=max(ma[lc[k]],ma[rc[k]]); } void update(int x,int val,int l,int r,int &k,int last){ k=++tot; lc[k]=lc[last]; rc[k]=rc[last]; if(l==r){ ma[k]=val; return ; } int mid=(l+r)/2; if(x<=mid)update(x,val,l,mid,lc[k],lc[last]); else update(x,val,mid+1,r,rc[k],rc[last]); pp(k); } int ask(int st,int ed,int l,int r,int k){ if(!k)return 0; if(st<=l&&ed>=r)return ma[k]; int mid=(l+r)/2; int ans=0; if(st<=mid)ans=max(ans,ask(st,ed,l,mid,lc[k])); if(ed>mid)ans=max(ans,ask(st,ed,mid+1,r,rc[k])); return ans; } // void solve(){ cin>>n; //init tot=0; ma[0]=0; // for(int i=1;i<=n;i++){ cin>>a[i]; } int ans=0; head=0; for(int i=1;i<=n;i++){ while(head&&a[stk[head]]<a[i]){ head--; } d[i]=1; d[i]=max(d[i],ask(1,a[i],1,n,rt[i-1])+1); if(head){ int k=stk[head]; d[i]=max(d[i],ask(1,a[i],1,n,rt[k-1])+2); } update(a[i],d[i],1,n,rt[i],rt[i-1]); stk[++head]=i; ans=max(ans,d[i]); } cout<<ans<<endl; } signed main(){ ios::sync_with_stdio(0); int T;cin>>T; while(T--){ solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<long long int> fact(2000006); vector<long long int> prime_check(1e7 + 2); vector<long long int> primes; long long powmod(long long x, long long y, long long m) { long long res = 1LL; while (y) { if (y & 1) res = (res * x) % m; x = (x * x) % m; y /= 2; } return res; } void init_fact() { fact[0] = 1; for (long long int i = 1; i < 2000006; i++) { fact[i] = (fact[i - 1] * i) % 1000000007; } } long long int C(long long int n, long long int r) { if (n < r) return 0; long long int temp = fact[n] * powmod(fact[r], 1000000007 - 2, 1000000007) % 1000000007; temp *= powmod(fact[n - r], 1000000007 - 2, 1000000007); temp %= 1000000007; return temp; } void Sieve() { for (long long int i = 2; i <= 1e7 + 1; i++) { if (prime_check[i]) continue; primes.push_back(i); for (long long int j = 2 * i; j <= 1e7 + 1; j += i) prime_check[j] = i; } } long long int phi(long long int n) { long long int i, res = n; for (i = 2; i * i <= n; i++) if (n % i == 0) { while (n % i == 0) n /= i; res -= res / i; } if (n > 1) res -= res / n; return res; } long long int n, x, y; vector<long long int> a(2000006), b(2000006), cnt(2000006), sum(2000006); int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n >> x >> y; for (long long int i = 1; i <= n; i++) cin >> a[i], b[a[i]]++; for (long long int i = 1; i < 2000006; i++) cnt[i] = cnt[i - 1] + b[i], sum[i] = sum[i - 1] + b[i] * i; long long int c = x / y; long long int ans = INT64_MAX; for (long long int i = 2; i <= 1e6; i++) { long long int cost = 0, f = i - min(i, c); for (long long int j = 0; j <= 1e6; j += i) { long long int st = j + 1, en = j + i, st2 = max(st, st + f - 1); long long int c1 = cnt[st2 - 1] - cnt[st - 1]; long long int c2 = cnt[en] - cnt[st2 - 1]; long long int c3 = sum[en] - sum[st2 - 1]; cost += c1 * x + y * (c2 * en - c3); } ans = min(ans, cost); } cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; void solve() { int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2; if ((x1 <= x2 && y1 <= y2) || x1 + y1 <= max(x2, y2)) { cout << Polycarp ; } else { cout << Vasiliy ; } } int main() { ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; char a[105], b[105]; int main() { int n, q, l, r; for (scanf( %d%d %s , &n, &q, a); q--;) { memcpy(b, a, sizeof(a)); scanf( %d%d , &l, &r); l--, r--; int s[10] = {0}, i = l, p = n, d = 1; for (; i >= l && i <= r; i += d) { if (b[i] >= 0 && b[i] <= 9 ) s[(b[i]--) - 0 ]++, p = n; else if (b[i] == < || b[i] == > ) { if (b[p] == < || b[p] == > ) b[p] = 0; p = i; d = b[i] == < ? -1 : 1; } } for (i = 0; i < 10; i++) printf( %d , s[i]); puts( ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, a[6], t; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &t), a[t]++; } if (a[0] == 0) { printf( -1 n ); return 0; } int k = a[5] / 9; for (int i = 0; i < k; i++) { printf( 555555555 ); } if (k == 0) { printf( 0 n ); } else { while (a[0]--) printf( 0 ); printf( n ); } return 0; } |
#include <bits/stdc++.h> const int MAXN = 210; const int mod = 1e9 + 7; void reduce(int& x) { x += x >> 31 & mod; } int mul(int x, int y) { return (long long)x * y % mod; } void fma(int& x, int y, int z) { x = ((long long)y * z + x) % mod; } struct vec { int x, y; vec() { x = y = 0; } vec(int a, int b) { x = a, y = b; } vec operator+(vec b) const { return vec(x + b.x, y + b.y); } vec operator-(vec b) const { return vec(x - b.x, y - b.y); } long long operator^(vec b) const { return (long long)x * b.y - (long long)y * b.x; } long long operator*(vec b) const { return (long long)x * b.x + (long long)y * b.y; } bool operator==(vec b) const { return x == b.x && y == b.y; } } ps[MAXN]; int n; long long cross(vec x, vec y, vec z) { return (y - x) ^ (z - x); } inline int sgn(long long x) { return x < 0 ? -1 : x > 0; } int dp[MAXN][MAXN]; int main() { std::ios_base::sync_with_stdio(false), std::cin.tie(0); std::cin >> n; for (int i = 1; i <= n; ++i) std::cin >> ps[i].x >> ps[i].y; long long area = 0; for (int i = 1; i <= n; ++i) area += ps[i] ^ ps[i == n ? 1 : i + 1]; for (int i = 1; i < n; ++i) dp[i][i + 1] = 1; for (int L = 3; L <= n; ++L) for (int l = 1; l + L - 1 <= n; ++l) { int r = l + L - 1; for (int p = l + 1; p < r; ++p) if (sgn(cross(ps[p], ps[r], ps[l])) == sgn(area)) fma(dp[l][r], dp[l][p], dp[p][r]); } std::cout << dp[1][n] << std::endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; template <int mod = mod> struct Modular { int val; Modular() { val = 0; } Modular(long long _val) { val = Normalize(_val); } Modular(int _val) { val = Normalize(_val); } inline int Normalize(long long& _val) { if (_val < 0) _val = _val % mod + mod; if (_val >= mod) _val %= mod; return _val; } inline int Normalize(int& _val) { if (_val < 0) _val = _val % mod + mod; if (_val >= mod) _val %= mod; return _val; } inline Modular modinv(int a, int m = mod) { int u = 0, v = 1; while (a != 0) { int t = m / a; m -= t * a; swap(a, m); u -= t * v; swap(u, v); } assert(m == 1); return u; } inline Modular modinv() { return modinv(val); } inline Modular modpow(long long p) const { assert(p >= 0); Modular a = *this, result = 1; while (p > 0) { if (p & 1) result *= a; a *= a; p >>= 1; } return result; } static unsigned Fastmod(uint64_t x, unsigned m = mod) { return x % m; unsigned xhi = x >> 32, xlo = (unsigned)x; unsigned q, r; asm( divl %4 n : =a (q), =d (r) : d (xhi), a (xlo), r (m)); return r; } inline Modular& operator+=(const Modular& other) { val += other.val; if (val >= mod) val -= mod; return *this; } inline Modular& operator-=(const Modular& other) { val -= other.val; if (val < 0) val += mod; return *this; } inline Modular& operator%=(const Modular& other) { val %= other.val; return *this; } inline Modular& operator*=(const Modular& other) { val = Fastmod((uint64_t)val * other.val); return *this; } inline Modular& operator/=(const Modular& other) { return *this *= modinv(other.val); } inline friend Modular operator+(const Modular& a, const Modular& b) { return Modular(a) += b; } inline friend Modular operator-(const Modular& a, const Modular& b) { return Modular(a) -= b; } inline friend Modular operator%(const Modular& a, const Modular& b) { return Modular(a) %= b; } inline friend Modular operator*(const Modular& a, const Modular& b) { return Modular(a) *= b; } inline friend Modular operator/(const Modular& a, const Modular& b) { return Modular(a) /= b; } inline friend istream& operator>>(istream& stream, Modular& m) { long long x; stream >> x; m.val = m.Normalize(x); return stream; } inline friend ostream& operator<<(ostream& stream, const Modular& m) { return stream << m.val; } inline Modular operator++() { return *this += 1; } inline Modular operator--() { return *this -= 1; } inline Modular operator++(int) { Modular x = *this; ++*this; return x; } inline Modular operator--(int) { Modular x = *this; --*this; return x; } inline Modular operator-() const { return Modular(-val); } inline friend bool operator==(const Modular& a, const Modular& b) { return a.val == b.val; } inline friend bool operator!=(const Modular& a, const Modular& b) { return a.val != b.val; } inline friend bool operator>(const Modular& a, const Modular& b) { return a.val > b.val; } inline friend bool operator<(const Modular& a, const Modular& b) { return a.val < b.val; } inline friend bool operator>=(const Modular& a, const Modular& b) { return a.val >= b.val; } inline friend bool operator<=(const Modular& a, const Modular& b) { return a.val <= b.val; } }; const int G = 3; const int N = 1 << 20; Modular<mod> root[1 << 20]; Modular<mod> _pow2[(1 << 20) + 1]; struct ntt { ntt() { root[N / 2] = 1; root[N / 2 + 1] = ((Modular<mod>)G).modpow((mod - 1) / N); for (int i = N / 2 + 2; i < N; ++i) root[i] = root[i - 1] * root[N / 2 + 1]; for (int i = N / 2; --i;) root[i] = root[2 * i]; for (int i = 0; i <= 20; i++) _pow2[1 << i] = ((Modular<mod>)(1 << i)).modinv(); } vector<Modular<mod> > Convolute(vector<Modular<mod> >& a, vector<Modular<mod> >& b) { int s = a.size() + b.size() - 1, n = 1; while (n < s) n *= 2; vector<Modular<mod> > c(n); a.resize(n); NTT(a); b.resize(n); NTT(b); for (int i = 0; i < n; i++) c[i] = a[i] * b[i] * _pow2[n]; reverse(c.begin() + 1, c.end()); NTT(c); c.resize(s); return c; } void NTT(vector<Modular<mod> >& a) { int n = a.size(); for (int i = 0, j = 0; i < n; ++i) { if (i > j) swap(a[i], a[j]); for (int k = n / 2; (j ^= k) < k; k /= 2) ; } for (int k = 1; k < n; k *= 2) { for (int i = 0; i < n; i += 2 * k) { for (int j = 0; j < k; j++) { Modular<mod> z = root[j + k] * a[i + j + k], &ai = a[i + j]; a[i + j + k] = ai - z; ai += z; } } } } } NTT; void solve() { int n, x, y; cin >> n >> x >> y; vector<Modular<mod> > a(x + 1); for (int i = 0; i <= n; ++i) { int var; cin >> var; a[var] = 1; } vector<Modular<mod> > b = a; reverse(begin(b), end(b)); b = NTT.Convolute(a, b); vector<int> c(1e6 + 1); for (int i = 0; i < int(b.size()); ++i) { if (b[i] == 0 || !(abs(x - i))) continue; int idx = 2 * (y + abs(x - i)); if (idx <= 1e6) c[idx] = 1; } vector<int> dp(1e6 + 1); for (int i = 2; i <= 1e6; ++i) { if (!c[i]) continue; for (int j = i; j <= 1e6; j += i) { dp[j] = max(dp[j], i); } } int q; cin >> q; while (q--) { int l; cin >> l; if (dp[l]) { cout << dp[l] << ; continue; } cout << -1 << ; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; t = 1; while (t--) solve(); } |
#include <bits/stdc++.h> using namespace std; const int N = 505; long long dp_hor[2][N][N], dp_vert[2][N][N]; vector<pair<int, int>> cost_hor[N][N], cost_vert[N][N]; long long inf = 1e18; int main() { ios::sync_with_stdio(0); cin.tie(0); int n, m, k; cin >> n >> m >> k; for (int i = 1; i <= k; i++) { int x, y, d, t, e; cin >> x >> y >> d >> t >> e; if (x + y >= t && ((x + y) % 4) == (t % 4)) cost_hor[x][y].push_back({1e9, e}), cost_vert[x][y].push_back({1e9, e}); if (x + y >= t + 1 && ((x + y) % 4) == ((t + 1) % 4)) cost_hor[x + d][y - d].push_back({1e9, e}), cost_vert[x + d][y - d].push_back({1e9, e}); if (x + y + d >= t + 2 && ((x + y + d) % 4) == ((t + 2) % 4)) { if (x + y >= t + 1 && ((x + y) % 4) == ((t + 1) % 4)) cost_hor[x + d][y].push_back({d, e}); else cost_hor[x + d][y].push_back({1e9, e}); if (x + y >= t && ((x + y) % 4) == (t % 4)) cost_vert[x + d][y].push_back({d, e}); else cost_vert[x + d][y].push_back({1e9, e}); } if (x + y + d >= t + 3 && ((x + y + d) % 4) == ((t + 3) % 4)) { if (x + y >= t && ((x + y) % 4) == (t % 4)) cost_hor[x][y + d].push_back({d, e}); else cost_hor[x][y + d].push_back({1e9, e}); cost_vert[x][y + d].push_back({1e9, e}); } } for (int x = 0; x < 2; x++) for (int y = 0; y < N; y++) for (int z = 0; z < N; z++) dp_hor[x][y][z] = dp_vert[x][y][z] = inf; for (int x = 0; x < n; x++) { for (int y = 0; y < m; y++) { int f = x & 1; for (int z = 0; z < N; z++) dp_hor[f][y][z] = dp_vert[f][y][z] = inf; if (x == 0 && y == 0) { dp_hor[f][y][0] = dp_vert[f][y][0] = 0; } sort(cost_hor[x][y].begin(), cost_hor[x][y].end()); sort(cost_vert[x][y].begin(), cost_vert[x][y].end()); long long cost = 0; for (int z = y; z >= 1; z--) { while (cost_hor[x][y].size() > 0 && cost_hor[x][y].back().first > z) { pair<int, int> t = cost_hor[x][y].back(); cost_hor[x][y].pop_back(); cost += t.second; } dp_hor[f][y][z] = dp_hor[f][y - 1][z - 1] + cost; } cost = 0; for (int z = x; z >= 1; z--) { while (cost_vert[x][y].size() > 0 && cost_vert[x][y].back().first > z) { pair<int, int> t = cost_vert[x][y].back(); cost_vert[x][y].pop_back(); cost += t.second; } dp_vert[f][y][z] = dp_vert[f ^ 1][y][z - 1] + cost; } for (int z = 1; z <= x; z++) { dp_hor[f][y][0] = min(dp_hor[f][y][0], dp_vert[f][y][z]); } for (int z = 1; z <= y; z++) { dp_vert[f][y][0] = min(dp_vert[f][y][0], dp_hor[f][y][z]); } } } long long ans = inf; for (int z = 1; z < m; z++) { ans = min(ans, dp_hor[(n - 1) & 1][m - 1][z]); } for (int z = 1; z < n; z++) { ans = min(ans, dp_vert[(n - 1) & 1][m - 1][z]); } if (ans == inf) ans = 0; cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << : << arg1 << std::endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cerr.write(names, comma - names) << : << arg1 << | ; __f(comma + 1, args...); } template <class T> ostream& operator<<(ostream& os, vector<T> V) { os << [ ; for (auto v : V) os << v << ; return os << ] ; } template <class L, class R> ostream& operator<<(ostream& os, pair<L, R> P) { return os << ( << P.first << , << P.second << ) ; } const long long int mod = 1e9 + 7; const long long int maxn = 5 * 100001; long long int power(long long int x, long long int n) { x %= mod; long long int res = 1; for (; n > 0; n >>= 1) { if (n & 1) res = (res * x) % mod; x = (x * x) % mod; } return res; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n; cin >> n; pair<long long int, long long int> a[n]; for (long long int i = 0; i < n; i++) { cin >> a[i].first; a[i].second = i + 1; } sort(a, a + n); long long int dp[n + 1]; dp[n] = 0; dp[n - 1] = mod; dp[n - 2] = mod; dp[n - 3] = a[n - 1].first - a[n - 3].first; long long int got[n + 5]; got[n - 3] = n; got[n - 2] = n; got[n - 1] = n; for (long long int i = n - 4; i >= 0; i--) { long long int mini = mod; mini = min(mini, a[i + 2].first - a[i].first + dp[i + 3]); if (i + 4 <= n) mini = min(mini, a[i + 3].first - a[i].first + dp[i + 4]); if (i + 5 <= n) mini = min(mini, a[i + 4].first - a[i].first + dp[i + 5]); for (long long int j = 2; j <= 4; j++) { if (j + i + 1 <= n) { if (mini == a[i + j].first - a[i].first + dp[i + j + 1]) { got[i] = i + j + 1; break; } } } dp[i] = mini; } long long int ans[n + 1]; long long int m = 0; for (long long int i = 0, j = 0; i < n; i = j) { m++; while (j != got[i]) { ans[a[j].second] = m; j++; } } cout << dp[0] << << m << endl; for (long long int i = 1; i <= n; i++) { cout << ans[i] << ; } } |
#include <bits/stdc++.h> using namespace std; const int inf = INT_MAX; int n; struct node { long double x, y; } a[100010]; bool check(long double xx) { long double l, r; l = -1e19, r = 1e19; for (int i = 0; i < n; ++i) { if (a[i].y >= xx * 2 || l > r) return false; l = max(l, a[i].x - sqrt(2 * a[i].y * xx - a[i].y * a[i].y)); r = min(r, a[i].x + sqrt(2 * a[i].y * xx - a[i].y * a[i].y)); } return l <= r; } int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) scanf( %lf%lf , &a[i].x, &a[i].y); for (int i = 0; i < n; ++i) if (a[i].y * a[n - 1].y < 0) { printf( -1 ); return 0; } else a[i].y = (a[i].y > 0) ? a[i].y : -a[i].y; long double l = 0, r = 1e19, mid; for (int i = 0; i <= 100; i++) { mid = (l + r) / 2; if (check(mid)) r = mid; else l = mid; } printf( %.10Lf , mid); } |
#include <bits/stdc++.h> #include <algorithm> #include <unordered_map> using namespace std; typedef long long ll; typedef vector<long long int> vll; typedef vector<int> vi; typedef unordered_map<int, int> umap; typedef vector<bool> vb; typedef pair<int, int> pii; typedef vector<pii> vpii; typedef vector<pair<int, vi>> vpiv; typedef unordered_map<ll, vll> ull; typedef set<ll> sll; #define min(a, b) ((a > b) ? b : a) #define max(a, b) ((a > b) ? a : b) #define run(i, n) for (int i = 0; i < n; i++) #define rund(i, n) for (int i = n - 1; i >= 0; i--) #define in(v) insert(v) #define pb(v) push_back(v) #define mp(v, u) make_pair(v, u) #define MOD 1000000007 #define lim 10000000 #define INF 1000000009 #define f first #define s second #define yes cout << YES << endl #define no cout << NO << endl //-------------------Number theory------------ // generate prime numbers till n vb seive(int n) { vb prime(n + 1, true); prime[0] = false; prime[1] = false; for (ll i = 2; i * i <= n; i++) { if (prime[i]) for (ll j = i * i; j <= n; j += i) { prime[j] = false; } } return prime; } //euler totient function vll totient(ll n) { vll tot(n + 1); run(i, n + 1) { tot[i] = i; } for (int i = 2; i * i <= n; i++) { if (tot[i] == i) { for (int j = i; j <= n; j += i) { tot[j] /= i; tot[j] *= i - 1; } } } return tot; } //modular exponentiation ll modExp(ll a, ll n, ll p) { if (n == 1) { return a % p; } if (n % 2) { ll t = modExp(a, n / 2, p); return (a * t % p * t) % p; } else { ll t = modExp(a, n / 2, p); return t % p * t % p; } } //a inverse mod p, where a and p are coprime ll modInv(ll a, ll p, vb prime) { // we know if a and p are coprime then a^totient(p) = 1 mod p => a^{totient(p)-1}=a^-1 mod p vll tmp = totient(p); ll t = tmp[t]; return modExp(a, t, p); } //----------------Segment Tree -SUM ----------------------------------------------- void buildSeg(int *a, int *t, int v, int l, int r) { //initially v should be passed as 1 //declare t in main method if (l == r) { t[v] = a[l]; return; } int m = (l + r) / 2; buildSeg(a, t, 2 * v, l, m); //build Left sub-tree buildSeg(a, t, 2 * v + 1, m + 1, r); //build Right sub-tree // store the sum of left and right sub-segments in the present node t[v] = t[2 * v] + t[2 * v + 1]; } ll sumQuery(int *t, int v, int tl, int tr, int l, int r) { // start = 0 and end = n-1 initially . // v initially should be 1 . if (l > r) { return 0; } if (tl == l && tr == r) { return t[v]; } else { int tm = (tl + tr) / 2; if (tl <= l && l <= tm && tl <= r && r <= tm) { // the query range is completely in left sub-segment return sumQuery(t, 2 * v, tl, tm, l, r); } else if (tm < l && l <= tr && tm < r && r <= tr) { return sumQuery(t, 2 * v + 1, tm + 1, tr, l, r); } else { ll s1 = sumQuery(t, 2 * v, tl, tm, l, tm); ll s2 = sumQuery(t, 2 * v + 1, tm + 1, tr, tm + 1, r); return s1 + s2; } } } // few helpers void print(vll a) { for (int i = 0; i < a.size(); i++) { cout << a[i] << ; } cout << endl; } void inp(vll &a) { int i = 0; for (auto &it : a) { int t; cin >> t; it = t; } } class myComparator { public: bool operator()(pair<ll, ll> &p1, pair<ll, ll> &p2) { if (p1.first < p2.first) return true; else if (p1.first == p2.first) return p1.second > p2.second; else return false; } }; class four { public: ll x1, y1, x2, y2; }; int p1 = 1000000007; int p2 = 1824236251; ll p = 998244353; //----------------MAIN METHOD (Code)------------------------------------------------ ll merge(vll& arr, vll& left, vll& right) { ll i = 0, j = 0, count = 0; while (i < left.size() || j < right.size()) { if (i == left.size()) { arr[i+j] = right[j]; j++; } else if (j == right.size()) { arr[i+j] = left[i]; i++; } else if (left[i] <= right[j]) { arr[i+j] = left[i]; i++; } else { arr[i+j] = right[j]; count += left.size()-i; j++; } } return count; } ll getInvCount(vll& arr) { if (arr.size() < 2) return 0; int m = (arr.size() + 1) / 2; vll left(arr.begin() , arr.begin()+m); vll right(arr.begin()+ m, arr.end()); return getInvCount(left) + getInvCount(right) + merge(arr, left, right); } ll findInv(string &tmp , string&s , unordered_map<char,vector<ll>>& t){ int inv = 0; int c1 =0,c2 =0 , c3 = 0 , c4 =0; vector<ll> id; for(auto i:tmp ){ if(i== A ){ id.pb(t[ A ][c1++]); } if(i== N ){ id.pb(t[ N ][c2++]); } if(i== O ){ id.pb(t[ O ][c3++]); } if(i== T ){ id.pb(t[ T ][c4++]); } } // print(id); return getInvCount(id); } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t ; cin>>t; while(t--){ string s;cin>>s; unordered_map<char,int> freq; unordered_map<char,vll> rec; string ans = ; ll inversion_number = 0; vector<char> letter = { A , N , O , T }; for(int i=0;i<s.length();i++){ freq[s[i]] ++; rec[s[i]].pb(i); } int i = 1; do{ string tmp = ; for(auto c : letter){ run(i,freq[c]){ tmp+=c; } } // cout<<tmp<<endl; ll temp = findInv(tmp,s,rec); if(temp >= inversion_number){ inversion_number = temp; ans = tmp; } }while( next_permutation(letter.begin(),letter.end())); cout<<ans<<endl; } } |
#include<bits/stdc++.h> using namespace std; int read() { char c=getchar(); int x=0,f=1; while (c< 0 || c> 9 ) { if (c== - ) f=-1; c=getchar(); } while (c>= 0 && c<= 9 ) { x=x*10+c- 0 ; c=getchar(); } return x*f; } const int p=998244353; int a[1200005],b[1200005],c[1200005],fac[1200005],inv[1200005]; int pow_3[1200005],inv_3[1200005],R[1200005]; void add(int &x,int y) {x+=y; if (x>=p) x-=p;} int pow_mod(int x,int k) { int ans=1; while (k) { if (k&1) ans=1LL*ans*x%p; x=1LL*x*x%p; k>>=1; } return ans; } void ntt(int *x,int n,int f) { pow_3[1]=pow_mod(3,(p-1)/n); if (f==1) { pow_3[0]=1; for (int i=1; i<n; i++) pow_3[i]=1LL*pow_3[i-1]*pow_3[1]%p; } else { inv_3[0]=1; inv_3[1]=pow_mod(pow_3[1],p-2); for (int i=2; i<n; i++) inv_3[i]=1LL*inv_3[i-1]*inv_3[1]%p; } int t=0,tp=1; while (tp<n) tp<<=1,++t; for (int i=0; i<tp; i++) R[i]=(R[i>>1]>>1)|((i&1)?(tp>>1):0); for (int i=0; i<n; i++) if (i<R[i]) swap(x[i],x[R[i]]); for (int l=2; l<=n; l<<=1) { int m=l/2; for (int *y=x; y!=x+n; y+=l) { for (int j=0; j<m; j++) { int tmp; if (f==1) tmp=1LL*y[j+m]*pow_3[n/l*j]%p; else tmp=1LL*y[j+m]*inv_3[n/l*j]%p; y[j+m]=y[j]-tmp; if (y[j+m]<0) y[j+m]+=p; y[j]+=tmp; if (y[j]>=p) y[j]-=p; } } } if (f==-1) { int tmp=pow_mod(n,p-2); for (int i=0; i<n; i++) x[i]=1LL*x[i]*tmp%p; } } int f[300005],tot; vector<int> vec[300005]; char s[300005]; int calc(int x) { return 1LL*f[x+1]*pow_mod(2,tot-x)%p; } int main() { for (int i=0; i<=300001; i++) a[i]=i/2; for (int i=0; i<=300001; i++) b[i]=pow_mod(2,i); int N=1; while (N<=600000) N<<=1; ntt(a,N,1); ntt(b,N,1); for (int i=0; i<N; i++) c[i]=1LL*a[i]*b[i]%p; ntt(c,N,-1); f[0]=0; int sum=0; for (int i=1; i<=300001; i++) { f[i]=(i-1)/2; add(f[i],sum); if (i>=2) add(f[i],c[i-2]); add(sum,f[i]); } int n=read(),m=read(); tot=0; for (int i=0; i<n; i++) { scanf( %s , s); for (int j=0; j<m; j++) { vec[i].push_back((s[j]== o )?1:-1); if (s[j]== o ) ++tot; } } int ans=0; for (int i=0; i<n; i++) { int cnt=0; for (int j=0; j<m; j++) { if (vec[i][j]==1) ++cnt; else { if (cnt>0) add(ans,calc(cnt)); cnt=0; } } if (cnt>0) add(ans,calc(cnt)); } for (int j=0; j<m; j++) { int cnt=0; for (int i=0; i<n; i++) { if (vec[i][j]==1) ++cnt; else { if (cnt>0) add(ans,calc(cnt)); cnt=0; } } if (cnt>0) add(ans,calc(cnt)); } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const unsigned long long N = 1e10; int getLen(unsigned long long a) { int len = 0; while (a) { len++; a /= 10; } return len; } unsigned long long gcd(unsigned long long a, unsigned long long b) { return b == 0 ? a : gcd(b, (a % b)); } unsigned long long lcm(unsigned long long a, unsigned long long b) { unsigned long long t = gcd(a, b); if (getLen(a / t) + getLen(b) > 22) return 0; return a / gcd(a, b) * b; } int main() { unsigned long long t, w, b; unsigned long long p; cin >> t >> w >> b; if (w == b) { printf( 1/1 n ); return 0; } unsigned long long mi = min(w, b); if (t < mi) { printf( 1/1 n ); return 0; } unsigned long long l = lcm(w, b); if (l <= 0) p = mi - 1; else { unsigned long long x = t / l; if (x == 0) { p = mi - 1; } else { p = min(mi, t - x * l + 1) + x * mi - 1; } } unsigned long long d = gcd(p, t); printf( %lld/%lld n , p / d, t / d); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> istream& operator>>(istream& is, vector<T>& v) { for (T& x : v) is >> x; return is; } template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << (i + 1 == (int)v.size() ? : ); } return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << ( << p.first << , << p.second << ) ; return os; } template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) { os << ( << get<0>(t) << , << get<1>(t) << , << get<2>(t) << ) ; return os; } template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) { os << ( << get<0>(t) << , << get<1>(t) << , << get<2>(t) << , << get<3>(t) << ) ; return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) { os << { ; for (auto itr = m.begin(); itr != m.end();) { os << ( << itr->first << , << itr->second << ) ; if (++itr != m.end()) os << , ; } os << } ; return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) { os << { ; for (auto itr = m.begin(); itr != m.end();) { os << ( << itr->first << , << itr->second << ) ; if (++itr != m.end()) os << , ; } os << } ; return os; } template <typename T> ostream& operator<<(ostream& os, const set<T>& s) { os << { ; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << , ; } os << } ; return os; } template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) { os << { ; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << , ; } os << } ; return os; } template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) { os << { ; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << , ; } os << } ; return os; } template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << (i + 1 == (int)v.size() ? : ); } return os; } void debug_out() { cerr << n ; } template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) { cerr << head; if (sizeof...(Tail) > 0) cerr << , ; debug_out(move(tail)...); } template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; } template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; } template <class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; } template <class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return true; } return false; } const int INF = 1e9; const long long IINF = 1e18; const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; const char dir[4] = { D , R , U , L }; const long long MOD = 1000000007; namespace n91 { using usize = std::size_t; using u64 = std::uint64_t; std::vector<bool> stob(std::string s) { std::vector<u64> num(s.size() / 9 + 10, 0); for (usize i = 0; i < s.size(); i += 9) { const std::string t = s.substr(i, 9); u64 mul = 1; u64 add = 0; for (const auto c : t) { add = add * 10 + (c - 0 ); mul *= 10; } for (auto& d : num) { d = d * mul + add; add = d >> 32; d -= add << 32; } } std::vector<bool> res(num.size() * 32); for (usize i = 0; i < num.size(); ++i) { for (usize j = 0; j < 32; ++j) { res[i * 32 + j] = num[i] >> j & 1; } } while (!res.empty() && !res.back()) { res.pop_back(); } return res; } } // namespace n91 const int MAX = 2048; using u64 = uint64_t; using BS = bitset<2 * MAX>; BS calc(const string& s) { int n = s.size(); vector<u64> num(n / 9 + 10, 0); for (int i = 0; i < n; i += 9) { string t = s.substr(i, 9); u64 mul = 1, add = 0; for (auto c : t) { add = add * 10 + (c - 0 ); mul *= 10; } for (auto& d : num) { d = d * mul + add; add = d >> 32; d -= add << 32; } } BS res; for (int i = 0; i < num.size(); i++) { for (int j = 0; j < 32; j++) { res[i * 32 + j] = num[i] >> j & 1; } } return res; } vector<BS> bases; vector<int> idx(MAX, -1); vector<int> solve(BS b, int x) { for (int i = MAX - 1; i >= 0; i--) { if (!b[i]) continue; if (~idx[i]) b ^= bases[idx[i]]; else { b.set(MAX + x, 1); idx[i] = bases.size(); bases.emplace_back(b); return {}; } } vector<int> res; for (int i = 0; i < MAX; i++) { if (b[MAX + i]) { res.emplace_back(i); } } return res; }; int main() { cin.tie(0); ios::sync_with_stdio(false); int m; cin >> m; for (int i = 0; i < m; i++) { string S; cin >> S; vector<int> ans = solve(calc(S), i); cout << ans.size(); for (int x : ans) cout << << x; cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 300; inline long long read() { long long s = 0, ww = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) ww = -1; ch = getchar(); } while ( 0 <= ch && ch <= 9 ) { s = 10 * s + ch - 0 ; ch = getchar(); } return s * ww; } struct vec { long long x, y; vec() {} vec(long long _x, long long _y) { x = _x, y = _y; } inline friend vec operator-(vec a, vec b) { return vec(a.x - b.x, a.y - b.y); } inline friend long long Cross(vec a, vec b) { return a.x * b.y - a.y * b.x; } inline friend bool InUpper(vec a) { return a.y > 0 || (a.y == 0 && a.x > 0); } } p[N + 5]; inline bool cmp(pair<long long, long long> i, pair<long long, long long> j) { vec a = p[i.second] - p[i.first], b = p[j.second] - p[j.first]; bool k1 = InUpper(a), k2 = InUpper(b); if (k1 != k2) return k1 < k2; return Cross(a, b) > 0; } long long f[N + 5][N + 5][7]; long long n; pair<long long, long long> seg[N * N + 5]; int main() { n = read(); for (register int i = 1; i <= n; i++) { long long x = read(), y = read(); p[i] = vec(x, y); } int cnt = 0; for (register int i = 1; i <= n; i++) for (register int j = 1; j <= n; j++) if (i != j) seg[++cnt] = make_pair(i, j); sort(seg + 1, seg + cnt + 1, cmp); for (register int i = 1; i <= n; i++) f[i][i][1] = 1; for (register int k = 1; k <= cnt; k++) { int u = seg[k].first, v = seg[k].second; for (register int i = 1; i <= n; i++) for (register int j = 1; j <= 5; j++) f[i][v][j + 1] += f[i][u][j]; } long long ans = 0; for (register int i = 1; i <= n; i++) ans += f[i][i][6]; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int S; cin >> S; if (S == 1) { cout << 1 << << 1 << n ; cout << 1 << n ; return 0; } cout << (S - 1) * 2 << << 2 << n ; cout << 1 << << 2; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX_N = 2000 + 10; bool mrk[MAX_N][MAX_N]; bool Ver[MAX_N][MAX_N]; bool Hor[MAX_N][MAX_N]; int N; int Total; void Solve(int x, int y) { bool flag = false; if ((mrk[x][y] ^ Ver[x][y] ^ Hor[x][y]) == 1) flag = true; int dx = -1, dy = 1; if (x < y) dx = 1, dy = -1; if (x + dx != y + dx) Ver[x + dx][y] ^= (Ver[x][y] ^ flag); if (y + dy != x + dy) Hor[x][y + dy] ^= (Hor[x][y] ^ flag); mrk[x][y] ^= flag; if (flag) Total++; } int main() { ios::sync_with_stdio(false); cin >> N; for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) { char temp; cin >> temp; mrk[j][i] = (temp - 0 ); } for (int l = 0; l < N; l++) for (int i = 0; i <= l; i++) { Solve(N - 1 - i, l - i); Solve(i, N - 1 - (l - i)); } cout << Total << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int m, n, i, j, l, r, u, d, sum; char s[209]; while (scanf( %d , &n) != EOF) { getchar(); scanf( %s , s); sum = 0; for (i = 0; i < n; i++) { l = r = u = d = 0; for (j = i + 1; j < n; j++) { int x = 1, y = 1; for (int k = i; k <= j; k++) { if (s[k] == U ) y++; else if (s[k] == D ) y--; else if (s[k] == L ) x--; else x++; } if (x == 1 && y == 1) sum++; } } printf( %d n , sum); } return 0; } |
#include <bits/stdc++.h> using namespace std; int p, numb, hh, i, j, l, n, m, a; char k; bool flag; int h[200000], check[500000], check1[500000], prime[500000], dp[500000]; int main() { for (i = 2; i <= 100000; i++) if (check[i] == 0) { for (j = 2 * i; j <= 100000; j += i) check[j] = 1; } for (i = 2; i <= 100000; i++) if (check[i] == 0) { l++; prime[l] = i; } cin >> n >> m; for (i = 1; i <= m; i++) { cin >> k >> a; hh = a; flag = true; if (k == + ) { if (dp[a] == 1) { cout << Already on << endl; } else if (a == 1) { dp[a] = 1; cout << Success << endl; } else { numb = 0; hh = a; for (j = 1; prime[j] * prime[j] <= a; j++) if (a % prime[j] == 0) { while (a % prime[j] == 0) a /= prime[j]; if (check1[prime[j]] > 0) { cout << Conflict with << check1[prime[j]] << endl; flag = false; break; } else { numb++; h[numb] = prime[j]; } } if (flag) { if (check[a] == 0 && a > 1) { if (check1[a] > 0) { cout << Conflict with << check1[a] << endl; flag = false; } else check1[a] = hh; } if (flag) { for (p = 1; p <= numb; p++) check1[h[p]] = hh; cout << Success << endl; dp[hh] = 1; } } } } else { if (dp[a] == 1) { hh = a; cout << Success << endl; for (j = 1; prime[j] * prime[j] <= a; j++) if (a % prime[j] == 0) { while (a % prime[j] == 0) a /= prime[j]; check1[prime[j]] = 0; } if (check[a] == 0 && a > 1) check1[a] = 0; dp[hh] = 0; } else cout << Already off << endl; } } } |
#include <bits/stdc++.h> using namespace std; int n, a, b, k[100100]; const int du = 0.000001; bool cmp(int x, int y) { return x > y; } int main() { scanf( %d%d%d , &n, &a, &b); long long sum = 0; for (int i = 1; i <= n; ++i) { scanf( %d , &k[i]); sum += k[i]; } if (a == b) { printf( %d , n - 1); return 0; } sort(k + 2, k + 1 + n, cmp); double cnt = 0; int xx = sum; double hah = b; cnt = a * k[1] / 1.0 / xx; if (cnt >= b) { printf( 0 n ); return 0; } for (int i = 2; i <= n; ++i) { xx = xx - k[i]; cnt = a * k[1] / 1.0 / xx; if (cnt >= b) { printf( %d n , i - 1); return 0; } } printf( %d n , n); return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long int c(long long int n, long long int i) { if (i == 0) return 1; else if (i == 1) return n; else if (i == 2) return (n * (n - 1)) / 2; else if (i == 3) return (n * (n - 1) * (n - 2)) / 6; else if (i == 4) return (n * (n - 1) * (n - 2) * (n - 3)) / 24; } int main() { long long int d[5]; d[0] = 1; d[1] = 0; d[2] = 1; d[3] = 2; d[4] = 9; long long int n, k; cin >> n >> k; long long int ans = 0; for (long long int i = 0; i <= k; i++) ans += d[i] * c(n, i); cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int f(int n) { if (n < 10) { return n; } int ans = 1; while (n) { if (n % 10 != 0) { ans *= n % 10; } n /= 10; } return ans; } int g[1000005]; int cnt[10][1000005]; int main() { ios::sync_with_stdio(false); cin.tie(NULL); for (int i = 1; i <= 1000000; i++) { if (i < 10) { g[i] = i; } else { g[i] = g[f(i)]; } if (i <= 60) { } for (int j = 1; j <= 9; j++) { cnt[j][i] = cnt[j][i - 1]; } cnt[g[i]][i]++; } int T; cin >> T; while (T--) { int l, r, k; cin >> l >> r >> k; cout << cnt[k][r] - cnt[k][l - 1] << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1e9; const int N = 100200; struct Node { int to, cost; }; vector<Node> g[N]; int dist[105][N] = {}, arr[N] = {}, n, m, type[N] = {}, k, s, vis[N] = {}; void addedge(int u, int v, int cost) { g[u].push_back((Node){v, cost}); g[v].push_back((Node){u, cost}); } void bfs(int s, int n, int* d) { queue<int> que; memset(vis, 0, sizeof(vis)); int p, to, cost; que.push(s); vis[s] = 1; while (!que.empty()) { p = que.front(); que.pop(); const int sz = g[p].size(); for (int i = 0; i < sz; i++) { to = g[p][i].to; if (to > n - 1 || vis[to]) continue; d[to] = d[p] + 1; que.push(to); vis[to] = 1; } } } int main(void) { std::ios::sync_with_stdio(false); cin >> n >> m >> k >> s; for (int i = 0; i < n; i++) cin >> type[i]; int u, v; for (int i = 0; i < m; i++) { cin >> u >> v; u--; v--; addedge(u, v, 1); } for (int i = 0; i < n; i++) { addedge(n - 1 + type[i], i, 1); } for (int i = 1; i <= k; i++) { bfs(n - 1 + i, n, dist[i]); } for (int i = 0; i < n; i++) { int ans = 0; for (int j = 1; j <= k; j++) arr[j] = dist[j][i] - 1; sort(arr + 1, arr + k + 1); for (int i = 1; i <= s; i++) ans += arr[i]; cout << ans << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; long n, l, x, y, a[1 << 20]; set<long> has; long hx, hy; long ans; long thx, thy; void check(long ps) { if (ps < 0 || ps > l) return; hx = thx; hy = thy; if (has.find(ps + x) != has.end()) hx = 1; if (has.find(ps + y) != has.end()) hy = 1; if (has.find(ps - x) != has.end()) hx = 1; if (has.find(ps - y) != has.end()) hy = 1; if (hx && hy) ans = ps; } int main() { ios_base::sync_with_stdio(0); cin >> n >> l >> x >> y; for (int i = 0; i < n; i++) { cin >> a[i]; has.insert(a[i]); } hx = hy = 0; for (int i = 0; i < n; i++) { if (has.find(a[i] + x) != has.end()) hx = 1; if (has.find(a[i] + y) != has.end()) hy = 1; if (has.find(a[i] - x) != has.end()) hx = 1; if (has.find(a[i] - y) != has.end()) hy = 1; } thx = hx; thy = hy; if (hx && hy) { cout << 0 << endl; } else { ans = -1; for (int i = 0; i < n; i++) { check(a[i] - x); check(a[i] + x); check(a[i] - y); check(a[i] + y); } if (ans >= 0) cout << 1 << endl << ans << endl; else { cout << 2 << endl; cout << x << << y << endl; } } cin.get(); cin.get(); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; int k; bool debug = false; int a[105]; int main() { cin >> n; for (int i = 0, x; i < n; i++) { scanf( %d , &x); a[x]++; } for (int i = 0; i < 105; i++) k += a[i] / 2; printf( %d n , k / 2); return 0; } |
#include <bits/stdc++.h> using namespace std; int t, n, m, a[1005], b[1005], ans; bool c[1005], lol; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> t; while (t--) { lol = false; fill(c, c + 1005, false); cin >> n >> m; for (int i = 0; i < n; ++i) { cin >> a[i]; c[a[i]] = true; } for (int i = 0; i < m; ++i) { cin >> b[i]; if (c[b[i]] == true) { ans = b[i]; lol = true; } } if (lol == true) cout << YES n1 << ans << n ; else cout << NO n ; } } |
#include <bits/stdc++.h> using namespace std; vector<pair<int, int>> adj[200003]; vector<pair<int, pair<int, int>>> edges; vector<long long> len; set<int> vertices; void dijkstra(int start) { set<int> vis; priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> pq; pq.push(make_pair(0, start)); while (!pq.empty()) { while (!pq.empty() && vis.find(pq.top().second) != vis.end()) pq.pop(); if (pq.empty()) break; long long l = pq.top().first; int v = pq.top().second; pq.pop(); vis.insert(v); if (l != 0) len.push_back(l); for (int i = 0; i < adj[v].size(); i++) { if (vis.find(adj[v][i].first) == vis.end()) { pq.push(make_pair(l + 1ll * adj[v][i].second, adj[v][i].first)); } } } } int main() { ios::sync_with_stdio(false); cin.tie(0); int n, m, k; cin >> n >> m >> k; for (int i = 0; i < m; i++) { int a, b, w; cin >> a >> b >> w; edges.push_back(make_pair(w, make_pair(a, b))); } sort(edges.begin(), edges.end()); for (int i = 0; i < k && i < edges.size(); i++) { vertices.insert(edges[i].second.first); vertices.insert(edges[i].second.second); adj[edges[i].second.first].push_back( make_pair(edges[i].second.second, edges[i].first)); adj[edges[i].second.second].push_back( make_pair(edges[i].second.first, edges[i].first)); } for (int x : vertices) { dijkstra(x); } sort(len.begin(), len.end()); cout << len[2 * k - 1] << endl; } |
#include <bits/stdc++.h> using namespace std; signed main() { long long int t; cin >> t; while (t--) { long long int n, x, i; cin >> n >> x; long long int second = 0; long long int a[n]; for (long long int i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); for (i = n - 1; i >= 0; i--) { second += a[i]; if (second / (n - i) < x) break; } cout << n - (i + 1) << endl; } } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; long long n, k, l, a[1000010], m, p, q, b[1000010], d, c[1000010], f[1000010], g[1000010], ans; struct BIT { long long a[1000010]; void clear() { memset(a, 0, sizeof(a)); } void add(int x, long long v) { for (; x <= 1000010 - 5; x += x & (-x)) a[x] = (a[x] + v + mod) % mod; } long long get(int x) { long long ans = 0; for (; x; x -= x & (-x)) ans = (ans + a[x]) % mod; return ans; } } tr; int main() { scanf( %lld%lld%lld , &n, &l, &k); for (int i = 1; i <= n; i++) scanf( %lld , &a[i]), b[i] = a[i]; sort(b + 1, b + n + 1); d = unique(b + 1, b + n + 1) - b - 1; for (int i = 1; i <= n; i++) a[i] = lower_bound(b + 1, b + d + 1, a[i]) - b; m = l / n; p = l % n; if (!p) { m--; p += n; } q = max(0ll, m - k + 1); q %= mod; int cnt = 0; for (int i = 1; i <= k - 1; i++) for (int j = 1; j <= n; j++) c[++cnt] = a[j]; for (int i = 1; i <= p; i++) c[++cnt] = a[i]; for (int i = cnt - p + 1; i <= cnt; i++) f[i] = 1, tr.add(c[i], f[i]); for (int i = k - 1; i; --i) { for (int j = 1; j <= n; j++) { int pos = (i - 1) * n + j; f[pos] = (tr.get(1000010 - 5) - tr.get(c[pos] - 1) + mod) % mod; } for (int j = 1; j <= n; j++) { int pos = (i - 1) * n + j; if (pos + n <= cnt) tr.add(c[pos + n], -f[pos + n]); tr.add(c[pos], f[pos]); } } for (int i = max(cnt - p - m * n + 1, 1ll); i <= cnt; i++) ans = (ans + f[i]) % mod; memset(c, 0, sizeof(c)); tr.clear(); cnt = 0; for (int i = 1; i <= k; i++) for (int j = 1; j <= n; j++) c[++cnt] = a[j]; for (int i = cnt - n + 1; i <= cnt; i++) g[i] = 1, tr.add(c[i], g[i]); for (int i = k - 1; i; --i) { for (int j = 1; j <= n; j++) { int pos = (i - 1) * n + j; g[pos] = (tr.get(1000010 - 5) - tr.get(c[pos] - 1) + mod) % mod; } for (int j = 1; j <= n; j++) { int pos = (i - 1) * n + j; tr.add(c[pos + n], -g[pos + n]); tr.add(c[pos], g[pos]); } } long long tmp = 0; for (int i = 1; i <= min(m, k - 1); i++) { for (int j = 1; j <= n; j++) { int pos = (k - i) * n + j; tmp = (tmp + g[pos]) % mod; } ans = (ans + tmp) % mod; } tmp = 0; for (int i = 1; i <= k; i++) for (int j = 1; j <= n; j++) { int pos = (i - 1) * n + j; tmp = (tmp + g[pos]) % mod; } tmp = tmp * q % mod; ans = (ans + tmp) % mod; printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int maxn = 1e6 + 5; int n, q, m; const int N = 105; const int L = 1505; char s[maxn]; int tr[maxn][30], tot = 0; int fail[maxn], w[maxn]; vector<int> g[maxn]; void add(char *s, int id) { int u = 0; int n = strlen(s); for (int i = 0; i < n; i++) { int c = s[i] - a ; if (!tr[u][c]) tr[u][c] = ++tot; u = tr[u][c]; } w[id] = u; } struct bit_tree { long long c[maxn], n; void init(int x) { n = x; } inline int lowbit(int x) { return x & (-x); } inline void update(int x, int v) { for (int i = x; i <= n; i += lowbit(i)) { c[i] += v; } } inline long long query(int x) { long long ans = 0; for (int i = x; i > 0; i -= lowbit(i)) ans += c[i]; return ans; } } T; void ac() { queue<int> q; for (int i = 0; i < 26; i++) { if (tr[0][i]) q.push(tr[0][i]), fail[tr[0][i]] = 0; } while (!q.empty()) { int u = q.front(); q.pop(); for (int i = 0; i < 26; i++) { if (tr[u][i]) { fail[tr[u][i]] = tr[fail[u]][i]; q.push(tr[u][i]); } else { tr[u][i] = tr[fail[u]][i]; } } } } int ins[maxn], out[maxn], cnt = 0; int vis[maxn]; void dfs(int x) { ins[x] = ++cnt; for (int i : g[x]) dfs(i); out[x] = cnt; } int main() { cin >> q >> n; for (int i = 1; i <= n; i++) { cin >> s; add(s, i); } ac(); for (int i = 1; i <= tot; i++) { g[fail[i]].push_back(i); } dfs(0); T.init(cnt); for (int i = 1; i <= n; i++) { vis[i] = 1; T.update(ins[w[i]], 1); T.update(out[w[i]] + 1, -1); } char c; int id; while (q--) { cin >> c; if (c == + ) { cin >> id; if (vis[id]) continue; vis[id] = 1; T.update(ins[w[id]], 1); T.update(out[w[id]] + 1, -1); } else if (c == - ) { cin >> id; if (!vis[id]) continue; vis[id] = 0; T.update(ins[w[id]], -1); T.update(out[w[id]] + 1, +1); } else { cin >> s; int m = strlen(s); long long p = 0, ans = 0; for (int i = 0; i < m; i++) { p = tr[p][s[i] - a ]; ans += T.query(ins[p]); } printf( %lld n , ans); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 7; int n, m; vector<int> d[MAXN]; int r[MAXN]; vector<pair<int, int> > g[MAXN]; inline void add_edge(int u, int v, int c) { g[u].push_back(make_pair(c, v)); g[v].push_back(make_pair(c, u)); } int col[MAXN]; inline bool dfs(int u, int c) { if (col[u] != -1) return col[u] == c; col[u] = c; for (auto e : (g[u])) { if (!dfs(e.second, c ^ e.first)) return 0; } return 1; } inline void read(int &x) { x = 0; int 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(); } x *= f; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); read(n); read(m); for (int i = (1); i <= (n); ++i) read(r[i]); for (int i = (1); i <= (m); ++i) { int x; read(x); for (int j = (1); j <= (x); ++j) { int p; read(p); d[p].push_back(i); } } for (int i = (1); i <= (n); ++i) add_edge(d[i][0], d[i][1], r[i] ^ 1); memset(col, -1, sizeof col); bool ans = 1; for (int i = 1; i <= m && ans; ++i) if (col[i] == -1) ans &= dfs(i, 0); cout << (ans ? YES : NO ) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long inf = 1ll << 60; int n; long long a[100100][4], f[100100][4], mx[4], sum[100100]; int main() { scanf( %d , &n); for (int j = 1; j <= 3; j++) { for (int i = 1; i <= n; i++) scanf( %I64d , &a[i][j]); } for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i][1] + a[i][2] + a[i][3]; f[n + 1][1] = -inf; f[n + 1][2] = -inf; f[n + 1][3] = 0; mx[1] = sum[n] + f[n + 1][1]; mx[3] = sum[n] + f[n + 1][3]; for (int i = n; i >= 1; i--) { f[i][1] = a[i][1] + f[i + 1][1]; f[i][1] = max(f[i][1], a[i][1] + a[i][2] + f[i + 1][2]); f[i][1] = max(f[i][1], a[i][1] + a[i][2] + a[i][3] + f[i + 1][3]); f[i][1] = max(f[i][1], mx[3] - sum[i - 1]); f[i][2] = a[i][2] + f[i + 1][2]; f[i][2] = max(f[i][2], a[i][2] + a[i][1] + f[i + 1][1]); f[i][2] = max(f[i][2], a[i][2] + a[i][3] + f[i + 1][3]); f[i][3] = a[i][3] + f[i + 1][3]; f[i][3] = max(f[i][3], a[i][3] + a[i][2] + f[i + 1][2]); f[i][3] = max(f[i][3], a[i][3] + a[i][2] + a[i][1] + f[i + 1][1]); f[i][3] = max(f[i][3], mx[1] - sum[i - 1]); mx[1] = max(mx[1], sum[i - 1] + f[i][1]); mx[3] = max(mx[3], sum[i - 1] + f[i][3]); } printf( %I64d n , f[1][1]); return 0; } |
#include <bits/stdc++.h> using namespace std; long long int arr[1000000]; int main() { int n; cin >> n; long long int count = 0; for (int i = 0; i < n; i++) { cin >> arr[i]; } long long int Min = arr[0]; long long int Max = arr[0]; for (int i = 1; i < n; i++) { if (arr[i] >= arr[i - 1]) Min = Max = arr[i]; else { int j = i; long long int mmin = arr[j - 1]; long long int mmax = arr[j - 1]; int c = 0; while (arr[j - 1] > arr[j]) { mmin = min(arr[j], mmin); mmax = max(arr[j], mmax); j++; if (j == n) break; c++; } count += mmax - mmin; i += c; } } cout << count << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, k = 0, nod; cin >> a; for (int i = 2; i < a; i++) { int b = a; while (b != 0) { k += b % i; b /= i; } } int b = a - 2; for (int i = k; i > 0; i--) if (k % i == 0 && b % i == 0) { nod = i; k /= nod; b /= nod; break; } cout << k << / << b; } |
#include <bits/stdc++.h> using namespace std; long long a[(20ll + (long long)2e5)], b[(20ll + (long long)2e5)], c[(20ll + (long long)2e5)], *d[(20ll + (long long)2e5)], e[(20ll + (long long)2e5)]; int main() { long long n; scanf( %lld , &n); for (long long i = 1; i <= n; i++) { scanf( %lld , &a[i]); a[i] *= i * (n - i + 1); b[i] = a[i]; } for (long long i = 1; i <= n; i++) { scanf( %lld , &c[i]); d[i] = &b[i]; } sort(d + 1, d + n + 1, [](long long* l, long long* r) { return *l < *r; }); sort(c + 1, c + 1 + n, greater<long long>()); for (long long i = 1; i <= n; i++) { *d[i] = c[i]; } long long s = 0, mod = 998244353ll; for (long long i = 1; i <= n; i++) s = (s + (a[i] % mod * (b[i] % mod)) % mod) % mod; printf( %lld n , s); ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 7; struct Tree { int n; vector<long long> t; vector<int> mx; vector<int> val; vector<int> weights; void add_val(int v, int l, int r, int now) { t[v] = weights[v] * (long long)now; mx[v] = now; val[v] = now; } void push(int v, int l, int r) { if (val[v] == -1) return; int m = (l + r) / 2; add_val(2 * v, l, m, val[v]); add_val(2 * v + 1, m, r, val[v]); val[v] = -1; } void relax(int v) { t[v] = t[2 * v] + t[2 * v + 1]; mx[v] = max(mx[2 * v], mx[2 * v + 1]); weights[v] = weights[2 * v] + weights[2 * v + 1]; } void build(vector<int>& a, vector<int>& w, int v, int l, int r) { if (r - l == 1) { t[v] = a[l] * (long long)w[l]; mx[v] = a[l]; weights[v] = w[l]; return; } int m = (l + r) / 2; build(a, w, 2 * v, l, m); build(a, w, 2 * v + 1, m, r); relax(v); } Tree(vector<int>& a, vector<int>& w) : n(a.size()), t(4 * n), val(4 * n, -1), weights(4 * n), mx(4 * n) { build(a, w, 1, 0, n); } long long get_sum(int l, int r, int vt, int lt, int rt) { if (l >= rt || lt >= r) { return 0; } if (l <= lt && rt <= r) { return t[vt]; } push(vt, lt, rt); int mt = (lt + rt) / 2; auto first = get_sum(l, r, 2 * vt, lt, mt); auto second = get_sum(l, r, 2 * vt + 1, mt, rt); relax(vt); return first + second; } long long get_sum(int l, int r) { return get_sum(l, r, 1, 0, n); } void change_max(int l, int r, int now, int vt, int lt, int rt) { if (l >= rt || lt >= r) { return; } int mt = (lt + rt) / 2; if (l <= lt && rt <= r) { if (mx[vt] < now) { add_val(vt, lt, rt, now); return; } if (rt - lt == 1) return; push(vt, lt, rt); if (mx[2 * vt] < now) { add_val(2 * vt, lt, mt, now); change_max(l, r, now, 2 * vt + 1, mt, rt); } else { change_max(l, r, now, 2 * vt, lt, mt); } relax(vt); return; } push(vt, lt, rt); change_max(l, r, now, 2 * vt, lt, mt); change_max(l, r, now, 2 * vt + 1, mt, rt); relax(vt); } void change_max(int l, int r, int now) { change_max(l, r, now, 1, 0, n); } int get_pos(int val, int vt, int lt, int rt) { if (rt - lt == 1) { return (t[vt] >= val ? lt : -1); } push(vt, lt, rt); int mt = (lt + rt) / 2; if (mx[2 * vt] >= val) { return get_pos(val, 2 * vt, lt, mt); } return get_pos(val, 2 * vt + 1, mt, rt); } int get_pos(int val) { return get_pos(val, 1, 0, n); } void print(int vt, int lt, int rt) { if (rt - lt == 1) { cout << mx[vt] << ; return; } push(vt, lt, rt); int mt = (lt + rt) / 2; print(2 * vt, lt, mt); print(2 * vt + 1, mt, rt); relax(vt); } void print() { cout << FXS n ; print(1, 0, n); cout << n ; } }; void add(int& first, int second) { first += second; if (first >= INF) { first -= INF; } if (first < 0) { first += INF; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, k, L; cin >> n >> k >> L; set<int> xs; set<int> ys; vector<int> color(n); vector<pair<int, int>> points(n); map<int, vector<int>> ymp; for (int i = 0; i < n; ++i) { int c, first, second; cin >> first >> second >> c; --c; color[i] = c; points[i] = {first, second}; ymp[second].push_back(i); xs.insert(first); ys.insert(second); } ys.insert(L); map<int, int> nx; vector<int> xval; int now = 0; for (int first : xs) { nx[first] = now++; xval.push_back(first); } int res = 0; vector<pair<int, int>> xcur; vector<multiset<int>> allx(k); int y_prev = 0; for (int y_up : ys) { vector<int> fx; vector<int> lens; map<int, int> posq; int pr = 0; for (auto t : xcur) { lens.push_back(xval[t.first] - pr + 1); posq[t.first] = lens.size() - 1; pr = xval[t.first] + 1; } lens.push_back(L - pr); vector<int> color_count(k, 0); int exist_colors = 0; int rt = 0; while (rt < (int)xcur.size() && exist_colors < k) { int c = xcur[rt].second; ++color_count[c]; exist_colors += (color_count[c] == 1); ++rt; } if (exist_colors == k) { fx.push_back(xval[xcur[rt - 1].first]); } for (int lt = 0; lt < (int)xcur.size(); ++lt) { int c = xcur[lt].second; --color_count[c]; exist_colors -= (color_count[c] == 0); while (rt < (int)xcur.size() && exist_colors < k) { int c = xcur[rt].second; ++color_count[c]; exist_colors += (color_count[c] == 1); ++rt; } if (exist_colors == k) { fx.push_back(xval[xcur[rt - 1].first]); } else break; } while (fx.size() < lens.size()) { fx.push_back(L); } Tree tree(fx, lens); pr = 0; for (int y_down : ys) { if (y_down == y_up) break; int dy = y_down - pr + 1; int ddy = y_up - y_prev; add(res, ddy * (long long)dy % INF * ((L * (long long)L - tree.get_sum(0, fx.size())) % INF) % INF); for (auto ind : ymp[y_down]) { int first = nx[points[ind].first]; int c = color[ind]; allx[c].erase(allx[c].find(first)); } vector<pair<int, pair<int, int>>> queries; for (auto ind : ymp[y_down]) { int first = nx[points[ind].first]; int c = color[ind]; int x_ind = upper_bound(xcur.begin(), xcur.end(), make_pair(first, INF)) - xcur.begin() - 1; auto it = allx[c].lower_bound(first); int prv = 0, nxt; if (it != allx[c].end()) { nxt = xval[*it]; } else { nxt = L; } it = allx[c].upper_bound(first); if (it != allx[c].begin()) { prv = posq[*(--it)] + 1; } prv = max(prv, tree.get_pos(xval[first])); queries.push_back({x_ind, {prv, nxt}}); } sort(queries.rbegin(), queries.rend()); for (auto t : queries) { int x_ind = t.first; int prv = t.second.first; int nxt = t.second.second; tree.change_max(prv, x_ind + 1, nxt); } pr = y_down + 1; } for (auto ind : ymp[y_up]) { xcur.push_back({nx[points[ind].first], color[ind]}); } sort(xcur.begin(), xcur.end()); for (int i = 0; i < k; ++i) { allx[i].clear(); } for (auto t : xcur) { allx[t.second].insert(t.first); } y_prev = y_up; } cout << res << n ; } |
#include <bits/stdc++.h> using namespace std; int const N = 1e3 + 10, K = 10 + 2, E = -(1e8 + 10); long long dp[N][N][K][2]; int n, m, kk; string s, t; void read_input() { cin >> n >> m >> kk; cin >> s >> t; } void solve() { s = * + s, t = * + t; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) for (int k = 1; k <= kk; k++) { dp[i][j][k][1] = (s[i] == t[j] ? 1 + max(dp[i - 1][j - 1][k][1], dp[i - 1][j - 1][k - 1][0]) : 0); dp[i][j][k][0] = max({dp[i - 1][j][k][0], dp[i][j - 1][k][0], dp[i][j][k][1]}); } cout << dp[n][m][kk][0]; } int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); read_input(), solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << : << arg1 << n ; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cout.write(names, comma - names) << : << arg1 << | ; __f(comma + 1, args...); } long long pows(long long a, long long b) { long long res = 1; while (b > 0) { if (b & 1) res = res * a; a = a * a; b >>= 1; } return res; } long long powm(long long x, long long y, long long m = 998244353) { x = x % m; long long res = 1; while (y) { if (y & 1) res = res * x; res %= m; y = y >> 1; x = x * x; x %= m; } return res; } long long modInverse(long long a, long long m) { return powm(a, m - 2, m); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, m, i, j, k, x, y, z, t, e, f, p, q, g, l, r, w, h, count1 = 0, prod = 1, a, b, c, d, index, x1, x2, y1, y2, diff, ans = 0, sum = 0, sum1 = 0, sum2 = 0, flag = 0, flag1 = 0, flag2 = 0; string s, s1, s2; cin >> n >> k; set<long long> st; vector<pair<long long, long long>> v(n); for (i = 0; i < n; i++) { cin >> v[i].first; v[i].second = i + 1; } sort(v.begin(), v.end(), greater<pair<long long, long long>>()); vector<long long> v1(n + 1); for (i = k + 1; i <= k + n; i++) { st.insert(i); } for (i = 0; i < n; i++) { p = *st.lower_bound(v[i].second); v1[v[i].second] = p; st.erase(p); ans += (p - v[i].second) * v[i].first; } cout << ans << n ; for (i = 1; i <= n; i++) { cout << v1[i] << ; } } |
#include <bits/stdc++.h> using namespace std; const long long inf = 5e9; long long w[20], s[20], m; bool solve(int bm) { long long l = 0, r = m; for (int i = 0; i < 14; ++i) { if (bm % 3 == 0) l += w[i]; else if (bm % 3 == 1) r += w[i]; bm /= 3; } return l == r; } void special4() { while (m > 0) { if (m % 4 == 2) { cout << NO n ; exit(0); } if (m % 4 == 3) { m += 4; } m /= 4; } cout << YES n ; } int main() { w[0] = 1; cin >> w[1] >> m; if (w[1] <= 3) { cout << YES n ; return 0; } for (int i = 2; i < 20; ++i) { w[i] = w[i - 1] * w[1]; if (w[i] > inf) w[i] = 0; } if (w[1] == 4) { special4(); return 0; } for (int bm = 0; bm < (int)5e6; ++bm) { if (solve(bm)) { cout << YES n ; return 0; } } cout << NO n ; }; |
#include <bits/stdc++.h> using namespace std; int main() { int n, b; cin >> n >> b; int a[n], maxx = b; for (int x = 0; x < n; x++) cin >> a[x]; for (int x = 0; x < n; x++) { for (int y = x + 1; y < n; y++) maxx = max(maxx, (b / a[x]) * a[y] + (b % a[x])); } cout << maxx; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; int n, k; vector<vector<long long>> adj, leaf; vector<long long> level, par, out; vector<long long> counti; void dfs(int src, int lvl, int p = -1) { int child = 0; level[src] = lvl; for (auto it : adj[src]) { if (it == p) continue; par[it] = src; child++; dfs(it, lvl + 1, src); } if (!child) leaf.push_back({src, lvl, 0}); out[src] = child; } class comp { public: bool operator()(vector<long long> a, vector<long long> b) { return a[1] - a[2] < b[1] - b[2]; } }; void solve() { cin >> n >> k; adj.resize(n); for (int i = 0, x, y; i < n - 1; i++) { cin >> x >> y; x--, y--; adj[x].push_back(y); adj[y].push_back(x); } level.resize(n); par.resize(n); out.resize(n); dfs(0, 0); vector<long long> total(n, 0); priority_queue<vector<long long>, vector<vector<long long>>, comp> pq; for (auto it : leaf) pq.push(it); long long ans = 0; while (!pq.empty() && k--) { auto f = pq.top(); pq.pop(); long long node = f[0]; ans += f[1] - total[node]; if (node) { total[par[node]] += f[2] + 1; --out[par[node]]; if (!out[par[node]]) { pq.push({par[node], f[1] - 1, total[par[node]]}); } } } cout << ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); } |
#include <bits/stdc++.h> using namespace std; const int N = 100000 + 77, L = 17; int n, q, tim = 1, root = 1; int b[N], d[N], Par[N][L], St[N], En[N]; long long S[N << 2], lz[N << 2]; inline void Shift(int l, int r, int id) { long long x = lz[id]; lz[id] = 0; S[id] += (r - l) * x; if (r - l > 1) lz[id << 1] += x, lz[id << 1 ^ 1] += x; } void Add(int ql, int qr, int x, int l = 1, int r = n + 1, int id = 1) { Shift(l, r, id); if (qr <= l || r <= ql) return; if (ql <= l && r <= qr) { lz[id] += x; Shift(l, r, id); return; } int mid = ((l + r) >> 1); Add(ql, qr, x, l, mid, id << 1); Add(ql, qr, x, mid, r, id << 1 ^ 1); S[id] = S[id << 1] + S[id << 1 ^ 1]; } long long Get(int ql, int qr, int l = 1, int r = n + 1, int id = 1) { Shift(l, r, id); if (qr <= l || r <= ql) return 0; if (ql <= l && r <= qr) return S[id]; int mid = ((l + r) >> 1); return Get(ql, qr, l, mid, id << 1) + Get(ql, qr, mid, r, id << 1 ^ 1); } vector<int> a[N]; void dfs(int v = 1) { St[v] = tim++; for (int i = 1; i < L; ++i) Par[v][i] = Par[Par[v][i - 1]][i - 1]; for (int u : a[v]) { if (u == Par[v][0]) continue; Par[u][0] = v; d[u] = d[v] + 1; dfs(u); } En[v] = tim; } inline bool isPar(int v, int u) { return St[v] <= St[u] && En[u] <= En[v]; } inline int GetPar(int v, int k) { for (int i = 0; i < L; ++i) if (k & (1 << i)) v = Par[v][i]; return v; } inline int GetLca(int v, int u) { if (d[v] < d[u]) swap(v, u); v = GetPar(v, d[v] - d[u]); if (v == u) return v; for (int i = L - 1; i >= 0; --i) if (Par[v][i] != Par[u][i]) v = Par[v][i], u = Par[u][i]; return Par[v][0]; } inline int GetLca(int r, int v, int u) { int t = GetLca(v, u); if (isPar(r, t)) return t; if (isPar(r, u) || isPar(r, v)) return r; if (!isPar(t, r)) return t; int x = GetLca(r, v); int y = GetLca(r, u); return (d[x] > d[y] ? x : y); } inline void Update(int r, int v, int u, int x) { int t = GetLca(r, v, u); if ((!isPar(t, r))) { Add(St[t], En[t], x); return; } Add(1, n + 1, x); if (r == t) return; int p = GetPar(r, d[r] - d[t] - 1); Add(St[p], En[p], -x); } inline long long GetSum(int r, int v) { if (!isPar(v, r)) return Get(St[v], En[v]); long long res = Get(1, n + 1); if (r == v) return res; int p = GetPar(r, d[r] - d[v] - 1); res -= Get(St[p], En[p]); return res; } int main() { scanf( %d %d , &n, &q); for (int i = 1; i <= n; ++i) scanf( %d , b + i); for (int v, u, i = 1; i < n; ++i) scanf( %d %d , &v, &u), a[v].push_back(u), a[u].push_back(v); d[1] = 1; dfs(); for (int i = 1; i <= n; ++i) Add(St[i], St[i] + 1, b[i]); while (q--) { int tp, v, u, x; scanf( %d %d , &tp, &v); if (tp == 1) { root = v; } else if (tp == 2) { scanf( %d %d , &u, &x); Update(root, v, u, x); } else { printf( %lld n , GetSum(root, v)); } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long int Pow(long long int a, long long int b, long long int md, long long int ans = 1) { for (; b; b >>= 1, a = a * a % md) if (b & 1) ans = ans * a % md; return ans % md; } const long long int MAXK = 1e6 + 10; const long long int MAXN = 2e3 + 10; const long long int INF = 8e18; const long long int MOD = 1e9 + 7; long long int dp[MAXN][MAXN], fact[MAXK], inv[MAXK], ans = 0, n, m, k; long long int add(long long int x, long long int y) { return (x + y) % MOD; } long long int mul(long long int x, long long int y) { return x * y % MOD; } long long int C(long long int x, long long int y) { if (y > x) return 0; return fact[x] * inv[y] % MOD * inv[x - y] % MOD; } int main() { scanf( %lld%lld%lld , &n, &m, &k); if (m == 1) return !printf( %lld n , Pow(k, n, MOD)); fact[0] = inv[0] = 1; for (long long int i = 1; i < MAXK; i++) { fact[i] = fact[i - 1] * i % MOD; inv[i] = Pow(fact[i], MOD - 2, MOD); } dp[0][0] = 1; for (long long int i = 1; i <= n; i++) { for (long long int j = 1; j <= i; j++) { dp[i][j] = j * (dp[i - 1][j] + dp[i - 1][j - 1]) % MOD; } } for (long long int i = 1; i <= n; i++) { for (long long int j = 0; j <= i; j++) { ans = add(ans, mul(Pow(j, n * (m - 2) % MOD, MOD), mul(dp[n][i] * dp[n][i] % MOD, mul(C(k - i, i - j), mul(C(k, i), C(i, j)))))); } } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> #define pb push_back #define speed ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0) using namespace std; typedef long long ll; typedef long double ld; typedef vector <ll> vll; typedef pair<ll,ll> pll; typedef vector <pair<ll,ll>> vpll; typedef vector <vll> vvll; const ll N=1e5+1; ll t,n,k; int main() { speed; cin>>t; while(t--) { cin>>n>>k; vll ans; cout<<n-(k+1)/2<< n ; for(int i=(k+1)/2;i<=n;i++) if(i!=k) cout<<i<< ; cout<< n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[200010]; long long vis[200100]; long long x, n, k, sum, y; string s; long long dfs(long long x, long long k, long long y) { if (x == y) return k; return dfs(a[x], k + 1, y); } long long poww(long long ba) { if (ba == 0) return 1; if (ba == 1) return 3; if (ba % 2 == 0) return poww(ba / 2) * poww(ba / 2); return poww(ba / 2) * poww(ba / 2) * 3; } int main() { long long q; cin >> q; while (q--) { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } for (int i = 1; i <= n; i++) { cout << dfs(a[i], 0, i) + 1 << ; } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1010; string s[maxn]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) cin >> s[i]; int ans = 6, cnt; for (int i = 1; i <= n; i++) { for (int j = i + 1; j <= n; j++) { cnt = 0; for (int k = 0; k < 6; k++) if (s[i][k] != s[j][k]) cnt++; ans = min(ans, (cnt + 1) / 2 - 1); } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main(void) { int t; long long s, a, b, c; scanf( %d , &t); while (t--) { scanf( %I64d %I64d %I64d %I64d , &s, &a, &b, &c); printf( %I64d n , s / c + s / c / a * b); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; int i, j; cin >> s; for (i = 0; i < s.size(); i++) if (s[i] == . ) break; if (s[i - 1] == 9 ) { cout << GOTO Vasilisa. ; return 0; } if (s[i + 1] >= 5 ) s[i - 1]++; for (j = 0; j < i; j++) cout << s[j]; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, m, k, n2; long long dip, cert, losers; cin >> n >> k; dip = n / (2 * (k + 1)); cert = k * dip; losers = n - dip - cert; cout << dip << << cert << << losers; return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; int a[25], b[25]; int dp[1 << 24]; int main() { int n, k; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &a[i]); scanf( %d , &k); for (int i = 1; i <= k; i++) scanf( %d , &b[i]); dp[0] = 1; for (int i = 1; i < (1 << n); i++) { int sum = 0, ans = 0; for (int j = 0; j < n; j++) { if ((i >> j) & 1) { sum += a[j]; ans = (ans + dp[i ^ (1 << j)]) % mod; if (sum > 1e9) sum = 1e9 + 1; } } bool ok = 1; for (int j = 1; j <= k; j++) { if (sum == b[j]) ok = 0; } if (!ok) continue; dp[i] = (dp[i] + ans) % mod; } printf( %d n , dp[(1 << n) - 1]); } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long x, long long y) { if (x == 0) return y; return gcd(y % x, x); } int main() { int t; long long r, b, k; scanf( %d , &t); while (t--) { scanf( %I64d%I64d%I64d , &r, &b, &k); long long Gcd = gcd(r, b); r /= Gcd; b /= Gcd; if (r <= (k - 1) * b + 1 && b <= (k - 1) * r + 1) printf( OBEY n ); else printf( REBEL n ); } } |
#include <bits/stdc++.h> using namespace std; long long a[1000000], prime[1000000]; vector<long long> v[3000000]; int main() { ios::sync_with_stdio(false); cin.tie(), cout.tie(); long long e; for (long long i = 3; i * i <= 1000000; i += 2) if (a[i] == 0) for (long long j = i * i; j <= 1000000; j = j + (i * 2)) a[j] = 1; prime[0] = 2; for (long long i = 3, j = 1; i <= 1000000; i += 2) if (a[i] == 0) { prime[j++] = i; e = j; } long long n; cin >> n; long long b, c = 0, d = 1, f = 0, g = 0, h; for (long long i = 0; i < n; i++) { cin >> b; for (long long j = 0;; j++) { c = 0; if (prime[j] > sqrt(b)) { break; } if (b % prime[j] == 0) { while (b % prime[j] == 0) { c++; b /= prime[j]; } } v[prime[j]].push_back(c); g = max(g, prime[j]); } if (b > 1) { g = max(g, b); v[b].push_back(1); } } for (long long i = 0; i < 210000; i++) { long long y = prime[i]; if (v[y].size() == n - 1) { sort(v[y].begin(), v[y].end()); long long x = v[y][0]; d = d * (pow(y, x)); } if (v[y].size() == n) { sort(v[y].begin(), v[y].end()); long long x = v[y][1]; d = d * (pow(y, x)); } } cout << d << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t = 1; while (t--) { long long n, k, s; cin >> n >> k >> s; if (s >= k && s <= k * (n - 1)) { long long step = s / k; long long x = s - k * step; long long last = 1, fact = 1; cout << YES << endl; for (int i = 0; i < k; i++) { long long tmp = step; if (x) { tmp++; x--; } last += tmp * fact; cout << last << ; fact *= -1; } cout << endl; } else { cout << NO << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 5023; int grundy[N], canCut[N], mex[N]; void init() { memset(grundy, 0, sizeof(grundy)); memset(canCut, 0, sizeof(canCut)); for (int i = 1; i < N; i++) { for (int j = 0; j < i; j++) { mex[grundy[max(0, j - 1)] ^ grundy[max(0, i - j - 2)]] = i; } for (int j = 0;; j++) { if (mex[j] != i) { grundy[i] = j; break; } } } } bool firstWin(int x, int n) { int sg = 0, len = 0; for (int i = 0; i < n; i++) { if (canCut[i] && abs(x - i) > 1) { len++; } else { sg ^= grundy[len]; len = 0; } } return sg == 0; } int main() { string s; while (cin >> s) { init(); int n = s.size(); for (int i = 1; i + 1 < n; i++) { if (s[i - 1] == s[i + 1]) canCut[i] = 1; } int ans = -1; for (int i = 0; i < n; i++) { if (canCut[i] && firstWin(i, n)) { ans = i + 1; break; } } if (ans == -1) printf( Second n ); else printf( First n%d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; map<int, int> mp; vector<int> ans; int a; for (int i = 0; i < n; i++) { scanf( %d , &a); mp[a] = 1; } n = m; for (int i = 1; i <= n; i++) { if (i > m) break; if (mp[i] == 0) { if (i <= m) { ans.push_back(i); m -= i; } } } cout << ans.size() << endl; for (int i = 0; i < ans.size(); i++) cout << ans[i] << ; } |
#include <bits/stdc++.h> using namespace std; int n, cnt, T; vector<int> g[128]; void input(int x) { if (g[x].size()) return; if (cnt == 16) { g[x].push_back(1), g[x].push_back(1); return; } cnt++; printf( ? %d n , x); fflush(stdout); int nw, y; scanf( %d , &nw); while (nw--) { scanf( %d , &y); g[x].push_back(y); } return; } void solve() { cnt = 0; for (int i = 0; i < 128; i++) g[i].clear(); cin >> n; input(1); if (g[1].size() == 2) { printf( ! 1 n ); fflush(stdout); return; } deque<int> q; q.push_back(1); int nw = 1; while (g[nw].size() != 1) { for (int i = 0; i < g[nw].size(); i++) if (g[g[nw][i]].size() == 0) { nw = g[nw][i]; break; } q.push_front(nw); input(nw); if (g[nw].size() == 2) { cout << ! << nw << endl; fflush(stdout); return; } } nw = 1; while (g[nw].size() != 1) { for (int i = 0; i < g[nw].size(); i++) if (g[g[nw][i]].size() == 0) { nw = g[nw][i]; break; } q.push_back(nw); input(nw); if (g[nw].size() == 2) { cout << ! << nw << endl; fflush(stdout); return; } } nw = q[q.size() / 2]; int dep = q.size() / 2; vector<int> pa; if (q.size() != 1) { pa.push_back(q[q.size() / 2 - 1]); pa.push_back(q[q.size() / 2 + 1]); } int couter = 0; while (dep != n - 3 && dep != n - 1) { vector<int> maybe; input(nw); if (g[nw].size() == 2) { cout << ! << nw << endl; fflush(stdout); return; } for (int i = 0; i < g[nw].size(); i++) { bool ok = 1; for (int j = 0; j < pa.size(); j++) if (pa[j] == g[nw][i]) ok = 0; if (ok) maybe.push_back(g[nw][i]); } dep++; pa.clear(); couter = couter * 10 + maybe.size(); if (maybe.size() == 1) { pa.push_back(nw); nw = maybe[0]; continue; } int nwchk = maybe[0]; for (int i = 0; i < dep - 2; i++) { input(nwchk); if (g[nwchk].size() == 2) { cout << ! << nwchk << endl; fflush(stdout); return; } for (int j = 0; j < g[nwchk].size(); j++) if (g[g[nwchk][j]].size() == 0) nwchk = g[nwchk][j]; } input(nwchk); if (g[nwchk].size() == 2) { cout << ! << nwchk << endl; fflush(stdout); return; } pa.push_back(nw); if (g[nwchk].size() == 1) nw = maybe[1]; else nw = maybe[0]; } if (dep == n - 1) { cout << ! << nw << endl; fflush(stdout); return; } input(nw); vector<int> maybe; for (int i = 0; i < g[nw].size(); i++) { maybe.push_back(g[nw][i]); input(g[nw][i]); if (g[g[nw][i]].size() == 2) { cout << ! << g[nw][i] << endl; fflush(stdout); return; } } for (int i = 0; i < maybe.size(); i++) for (int j = 0; j < g[maybe[i]].size(); j++) { input(g[maybe[i]][j]); if (g[g[maybe[i]][j]].size() == 2) { cout << ! << g[maybe[i]][j] << endl; fflush(stdout); return; } } if (T == 7) { cout << ! << couter; fflush(stdout); exit(0); } cout << ! -1 n ; fflush(stdout); return; } int main() { cin >> T; while (T--) solve(); } |
#include <bits/stdc++.h> using namespace std; using ll = long long; const int INF = 1000000000; const ll LINF = 1001002003004005006ll; int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1}; template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; } template <class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { for (int i = 0; i < (int)v.size(); i++) os << v[i] << (i + 1 == (int)v.size() ? : ); return os; } template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &x : v) is >> x; return is; } signed main() { int n; cin >> n; vector<int> bx; for (int i = 0; i < (n); i++) { cout << ? << 0 << << i << endl; int x; cin >> x; bx.push_back(x); } vector<int> px; for (int i = 0; i < (n); i++) { cout << ? << i << << 0 << endl; int x; cin >> x; px.push_back(x); } int cnt = 0; vector<int> print_res; for (int i = 0; i < (n); i++) { bool f = true; vector<int> b; for (auto x : bx) b.push_back(x ^ i); auto v = b; sort(begin(v), end(v)); for (int j = 0; j < (n); j++) if (v[j] != j) f = false; if (!f) continue; vector<int> p; for (auto x : px) p.push_back(x ^ b[0]); for (int j = 0; j < (n); j++) if (p[b[j]] != j) f = false; if (!f) continue; cnt++; print_res = p; } cout << ! << endl; cout << cnt << endl; cout << print_res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<pair<long long, long long> > h; vector<vector<long long> > g; long long p[500001][21]; long long volume[500001]; long long n, dt, ans, s, f; void dfs(long long v, long long m) { p[v][0] = m; for (long long i = 0; i < g[v].size(); i++) { long long k = g[v][i]; if (k != m) { volume[k] = volume[v] + 1; dfs(k, v); } } } void prepare() { for (long long i = 0; i <= 500000; i++) for (long long k = 1; k <= 20; k++) p[i][k] = -1; dfs(1, -1); for (long long k = 1; k <= 20; k++) for (long long i = 1; i <= 500000; i++) if (p[i][k - 1] != -1) p[i][k] = p[p[i][k - 1]][k - 1]; ans = 1; cout << ans << ; s = 1; f = 2; } long long kanst(long long v, long long k) { while (k > 0) { long long k0 = log2(k); v = p[v][k0]; k -= 1 << k0; } return v; } long long lca(long long a, long long b) { if (a == b) return a; if (volume[b] > volume[a]) swap(a, b); a = kanst(a, volume[a] - volume[b]); if (a == b) return a; for (long long j = 20; j >= 0; j--) { if (p[a][j] != p[b][j]) { a = p[a][j]; b = p[b][j]; } } return p[a][0]; } int main() { cin >> n; g.resize(200001); vector<long long> d; d.resize(n + 1); for (long long i = 2; i <= n; i++) { long long a; cin >> a; d[i] = i; g[i].push_back(a); g[a].push_back(i); } prepare(); for (long long k = 3; k <= n; k++) { if (volume[s] + volume[k] - 2 * volume[lca(s, k)] > ans) { ans = volume[s] + volume[k] - 2 * volume[lca(s, k)]; f = k; } if (volume[f] + volume[k] - 2 * volume[lca(f, k)] > ans) { ans = volume[f] + volume[k] - 2 * volume[lca(f, k)]; s = k; } cout << ans << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; char s[5005], t[5005]; long long DP[5005][5005]; int main(int argc, char** argv) { scanf( %s%s , s, t); int lens = strlen(s); int lent = strlen(t); long long ans = 0; for (int i = 1; i <= lens; i++) { for (int j = 1; j <= lent; j++) { DP[i][j] = DP[i][j - 1]; if (s[i - 1] == t[j - 1]) DP[i][j] = (DP[i][j] + DP[i - 1][j - 1] + 1) % mod; } ans = (ans + DP[i][lent]) % mod; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using ::std::cin; using ::std::cout; using ::std::endl; using ::std::multiset; using ::std::pair; using ::std::vector; int main() { ::std::ios_base::sync_with_stdio(false); int n, m; cin >> n >> m; vector<int> a(n); for (int i = 0; i < n; ++i) cin >> a[i]; vector<pair<int, int>> tr; for (int i = 0; i < m; ++i) { int t, r; cin >> t >> r; while (!tr.empty() && tr.back().second <= r) tr.pop_back(); tr.push_back({t, r}); } tr.push_back({-1, 0}); multiset<int> s; for (int i = 0; i < tr[0].second; ++i) s.insert(a[i]); for (int i = 0; i < static_cast<int>(tr.size()); ++i) { for (int j = tr[i].second - 1; j >= tr[i + 1].second; --j) { if (tr[i].first == 2) { a[j] = *s.begin(); s.erase(s.begin()); } else { a[j] = *--s.end(); s.erase(--s.end()); } } } for (int x : a) cout << x << ; cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 500010; int ans[N]; void solve() { int n; cin >> n; int d = 0; for (int i = 0; i <= 30; i++) { ans[i] = (1 << i); } int sum = 0; for (int i = 0; i <= 30; i++) { sum += ans[i]; if (sum >= n) { d = i; break; } } int extra = sum - n; for (int i = d; i >= 1; i--) { long long need = (ans[i] - ans[i - 1] + 0ll) * (d - i + 1ll); if (extra > need) { extra -= need; for (int j = d; j >= i; j--) ans[j] = ans[i - 1]; } else { int dv = (extra / (d - i + 1)); int c = (extra % (d - i + 1)); for (int j = d; j >= i; j--) ans[j] -= dv; for (int j = i; j < i + c; j++) ans[j]--; break; } } cout << d << n ; for (int i = 1; i <= d; i++) cout << ans[i] - ans[i - 1] << ; cout << n ; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int tt; cin >> tt; while (tt--) { solve(); } return 0; } |
#include <bits/stdc++.h> const double PI = 3.1415926535897932384626; const int KL = 1e6; const long long MOD = 1e9 + 7; using namespace std; void show(complex<double> a) { cout << fixed << setprecision(10) << a.real() << + << a.imag() << i << endl; } complex<double> rot(complex<double> a, complex<double> o, double alpha) { return (a - o) * polar(1.0, alpha * PI / 180.0) + o; } complex<double> intersection(complex<double> a, complex<double> b, double h) { double m = (a.imag() - b.imag()) / (a.real() - b.real()); double p = a.imag() - m * a.real(); complex<double> ret((h - p) / m, h); return ret; } double h, w; double alpha; int main() { cin >> w >> h >> alpha; if (w < h) swap(h, w); if (alpha >= 90) alpha = 180 - alpha; double wt = sqrt(w * w + h * h); if (alpha == 0) { cout << fixed << setprecision(10) << w * h << endl; return 0; } complex<double> a(-w / 2.0, h / 2.0); complex<double> b(w / 2.0, h / 2.0); complex<double> d(w / 2.0, -h / 2.0); complex<double> o(0, 0); double mx_angle = 2 * abs(arg(b)) * 180.0 / PI; if (alpha >= mx_angle) { cout << fixed << setprecision(10) << h * h / sin(alpha * PI / 180.0) << endl; return 0; } complex<double> a1 = rot(a, o, alpha); complex<double> b1 = rot(b, o, alpha); complex<double> c1 = rot(d, o, alpha); complex<double> A = intersection(a1, b1, h / 2); complex<double> B = intersection(b1, c1, h / 2); double d1 = A.real() - a.real(); double d2 = b.real() - B.real(); double wt1 = d1 / cos(alpha * PI / 180.0); double wt2 = d2 / sin(alpha * PI / 180.0); double area = d1 * wt1 * sin(alpha * PI / 180.0) + d2 * wt2 * cos(alpha * PI / 180.0); double ans = w * h - area; cout << fixed << setprecision(10) << ans << endl; return 0; } |
#include <bits/stdc++.h> struct SFountain { size_t beauty; size_t price; SFountain() = default; SFountain(size_t b, size_t p) : beauty(b), price(p) {} static bool less_price(const SFountain &lhs, const SFountain &rhs) { return lhs.price < rhs.price; } static bool less_beauty(const SFountain &lhs, const SFountain &rhs) { return lhs.beauty < rhs.beauty; } }; size_t maxSum(const std::vector<SFountain> &fountains, size_t max_price) { if (fountains.size() < 2) return 0; size_t max_beauty_total = 0; size_t max_beauty = 0; std::vector<SFountain> x; for (const SFountain &fountain : fountains) { auto upper = std::upper_bound(x.begin(), x.end(), SFountain(0, max_price - fountain.price), SFountain::less_price); if (upper != x.begin()) { --upper; max_beauty_total = std::max(max_beauty_total, fountain.beauty + upper->beauty); } if (max_beauty < fountain.beauty) { max_beauty = fountain.beauty; x.push_back(fountain); } } return max_beauty_total; } int main() { size_t n, c, d, maxC = 0, maxD = 0; std::cin >> n >> c >> d; std::vector<SFountain> coins; std::vector<SFountain> diamonds; coins.reserve(n); diamonds.reserve(n); for (size_t i = 0; i < n; ++i) { SFountain fountain; char price_type; std::cin >> fountain.beauty >> fountain.price >> price_type; if (price_type == C && fountain.price <= c) { coins.push_back(fountain); maxC = std::max(maxC, fountain.beauty); } else if (price_type == D && fountain.price <= d) { diamonds.push_back(fountain); maxD = std::max(maxD, fountain.beauty); } } std::sort(coins.begin(), coins.end(), SFountain::less_price); std::sort(diamonds.begin(), diamonds.end(), SFountain::less_price); size_t maxMixed = !coins.empty() && !diamonds.empty() ? maxC + maxD : 0; std::cout << std::max(std::max(maxSum(coins, c), maxSum(diamonds, d)), maxMixed) << std::endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int dx[] = {0, 0, -1, 1, -1, -1, 1, 1}; int dy[] = {-1, 1, 0, 0, -1, 1, -1, 1}; bool mark[100007]; long long int n, in = -1, prime[100007]; void seive() { prime[++in] = 2; for (long long int i = 3; i * i < 100007; i += 2) { if (mark[i] == 0) for (long long int j = i * i; j < 100007; j += 2 * i) mark[j] = 1; } for (long long int i = 3; i < 100007; i += 2) { if (mark[i] == 0) prime[++in] = i; } } int main() { seive(); cin >> n; long long int c, div = 1; for (long long int i = 0; i <= in; i++) { if (n % prime[i] == 0) { c = 1; while (n % prime[i] == 0) { n /= prime[i]; c++; } div *= c; } } if (n > 2) div *= 2; cout << div << endl; } |
#include <bits/stdc++.h> using namespace std; int n; int a[200001]; vector<int> G[200001]; int res[200001]; vector<int> divisor; vector<int> now; int gcd(int x, int y) { if (y == 0) return x; return gcd(y, x % y); } void dfs(int v, int p) { for (int i = 0; i < G[v].size(); i++) { if (p != G[v][i]) { res[G[v][i]] = gcd(res[v], a[G[v][i]]); dfs(G[v][i], v); } } } void dfs2(int v, int p, int dist) { for (int i = 0; i < divisor.size(); i++) { now[i] += (a[v] % divisor[i] == 0); if (now[i] >= dist) { res[v] = max(res[v], divisor[i]); } } for (int i = 0; i < G[v].size(); i++) { if (p != G[v][i]) { dfs2(G[v][i], v, dist + 1); } } for (int i = 0; i < divisor.size(); i++) { now[i] -= (a[v] % divisor[i] == 0); } } int main(void) { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); } for (int i = 0; i < n - 1; i++) { int f, t; scanf( %d%d , &f, &t); f--; t--; G[f].push_back(t); G[t].push_back(f); } int tmp = a[0]; a[0] = 0; dfs(0, -1); a[0] = tmp; for (int i = 1; i * i <= a[0]; i++) { if (a[0] % i == 0) { divisor.push_back(i); divisor.push_back(a[0] / i); if (i * i == a[0]) { divisor.pop_back(); } } } sort(divisor.begin(), divisor.end()); now.resize(divisor.size()); dfs2(0, -1, 0); for (int i = 0; i < n; i++) { printf( %d%c , res[i], i + 1 == n ? n : ); } return 0; } |
#include <bits/stdc++.h> using namespace std; #define int long long void solve() { int n, m, k; cin >> n >> m >> k; vector<tuple<int, int, int>> edges(m + 2), edges_large, edges_small; vector<int> values; for (int i = 1; i <= m; i++) { int a, b, c; cin >> a >> b >> c; edges[i] = {a, b, c}; if (c > k) edges_large.push_back(edges[i]); else edges_small.push_back(edges[i]); values.push_back(c); } sort(values.begin(), values.end()); vector<int> fa(n + 2); for (int i = 1; i <= n; i++) fa[i] = i; function<int(int)> find = [&](int x) -> int { return x == fa[x] ? x : fa[x] = find(fa[x]); }; int tot = 1; function<void(int, int)> merge = [&](int x, int y) -> void { x = find(x); y = find(y); if (x != y) fa[x] = y, tot++; }; for (auto [u, v, w] : edges_small) merge(u, v); int flag = tot == n; if (flag) { int i = lower_bound(values.begin(), values.end(), k) - values.begin(); int j = i - 1; int ans = 1e18; if (i >= 0 && i < m) ans = min(ans, abs(k - values[i])); if (j >= 0 && j < m) ans = min(ans, abs(k - values[j])); cout << ans << endl; } else { int ans = 0; vector<pair<int, pair<int, int>>> ve; for (auto [x, y, z] : edges_large) ve.push_back({z, {x, y}}); sort(ve.begin(), ve.end()); for (int i = 0; i < ve.size(); i++) { auto [w, pr] = ve[i]; auto [u, v] = pr; if (find(u) != find(v)) merge(u, v), ans += w - k; if (tot == n) break; } cout << ans << endl; } } signed main() { ios::sync_with_stdio(false); int t; cin >> t; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; long long int visited[100001]; vector<long long int> adj[100001]; long long int sum = 0; void dfs(long long int s) { if (visited[s] == 1) { return; } sum++; visited[s] = 1; for (auto u : adj[s]) { dfs(u); } } long long int binpow(long long int x, long long int n) { if (n == 0) return 1; long long u = binpow(x, n / 2); u = (u * u); if (n % 2 == 1) u = (u * x); return u; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int n, m; cin >> n >> m; while (m--) { long long int x, y; cin >> x >> y; adj[x].push_back(y); adj[y].push_back(x); } memset(visited, 0, sizeof(visited)); ; long long int ans = 1; for (long long int i = 1; i <= n; i++) { if (visited[i] == 0) { sum = 0; dfs(i); long long int y = sum - 1; long long int r = binpow(2, y); ans = ans * r; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long dp[10010], leftx[10010], rightx[10010], l[5010], r[5010]; int main() { ios::sync_with_stdio(false); cin.tie(NULL); int n, x; cin >> n >> x; vector<int> ry; for (int i = 0; i < n; i++) { int a, b; cin >> a >> b; l[i] = a; r[i] = b; ry.push_back(a); ry.push_back(b); } ry.push_back(x); sort(ry.begin(), ry.end()); set<int> rt; for (auto val : ry) { rt.insert(val); } ry.clear(); for (auto val : rt) { ry.push_back(val); } int ind = -1; for (int i = 0; i < ry.size(); i++) { if (ry[i] == x) ind = i; } for (int i = 0; i < ry.size(); i++) dp[i] = 1e18; for (int i = 0; i < ry.size(); i++) { if (ry[i] == x) dp[i] = 0; } for (int i = 0; i <= n; i++) { if (i) { for (int j = 0; j < ry.size(); j++) { long long val = 0; if (ry[j] < l[i - 1] || ry[j] > r[i - 1]) val = min(abs(l[i - 1] - ry[j]), abs(r[i - 1] - ry[j])); dp[j] = min(leftx[j] + ry[j] + val, rightx[j] - ry[j] + val); } } leftx[0] = dp[0] - ry[0]; for (int j = 1; j < ry.size(); j++) leftx[j] = min(leftx[j - 1], dp[j] - ry[j]); rightx[ry.size() - 1] = dp[ry.size() - 1] + ry[ry.size() - 1]; for (int j = (int)ry.size() - 2; j >= 0; j--) rightx[j] = min(rightx[j + 1], dp[j] + ry[j]); } long long mini = 1e18; for (int j = 0; j < ry.size(); j++) mini = min(mini, dp[j]); cout << mini << n ; } |
#include <bits/stdc++.h> bool chCount[26]; int main() { int n, m; std::cin >> n >> m; int max = -1; for (; n >= 1; --n) { int min = 1000000000 + 10; for (int i = 0; i < m; ++i) { int x; std::cin >> x; min = std::min(x, min); } max = std::max(min, max); } std::cout << max; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int a, m; cin >> a >> m; a %= m; map<int, bool> vis; while (!vis[a]) { vis[a] = true; if (!a) { cout << Yes n ; return 0; } a *= 2; a %= m; } cout << No n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int nMax = 100007; int parent[nMax]; vector<int> g[nMax]; bool used[nMax]; void dfs(int root, int parent, int& cnt, int b, bool& bad) { if (root == b) { bad = true; } used[root] = true; ++cnt; for (int i = 0; i < g[root].size(); ++i) { int to = g[root][i]; if (used[to] == false && to != parent) dfs(to, root, cnt, b, bad); } } int main() { int n, pos; scanf( %d%d , &n, &pos); for (int i = 0; i < n; ++i) { int a; scanf( %d , &a); parent[i] = a - 1; if (a != 0) { g[i].push_back(a - 1); g[a - 1].push_back(i); } } --pos; int h = 1; int t = pos; while (parent[t] != -1) { ++h; t = parent[t]; } vector<int> c; for (int i = 0; i < n; ++i) { int cnt = 0; bool bad = false; if (used[i] == false) { dfs(i, -1, cnt, pos, bad); if (!bad) c.push_back(cnt); } } int to = (int)pow(2.0, (int)c.size()); set<int> s; set<int>::iterator it; for (int i = 1; i < to + 1; ++i) { int t = i, sum = 0; for (int j = 0; j < c.size(); ++j) { if (t & 1) sum += c[j]; t >>= 1; } s.insert(sum); } set<int> ans; ans.insert(h); for (it = s.begin(); it != s.end(); ++it) ans.insert(*it + h); for (it = ans.begin(); it != ans.end(); ++it) cout << *it << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 1; const int size = 1 << 8, M = 1e6 + 10; int n, q, w[N], head[N], ne[N], cnt; void add(int f, int t) { w[++cnt] = t; ne[cnt] = head[f]; head[f] = cnt; } int fa[N], a[N], h[N]; void dfs(int x) { for (int i = head[x]; i; i = ne[i]) { int v = w[i]; if (fa[v]) continue; fa[v] = x; h[v] = h[x] + 1; dfs(v); } } int ance[N], go[M][2], id, dp[N][size]; void trie(int x) { for (int i = 15, p = 1; i >= 0; i--) { int w = x >> i & 1; if (!go[p][w]) go[p][w] = ++id; p = go[p][w]; } } int query(int x) { int ans = 0; for (int i = 15, p = 1; i >= 0; i--) { int w = x >> i & 1; if (go[p][w ^ 1]) ans |= (1 << i), p = go[p][w ^ 1]; else p = go[p][w]; } return ans; } int main() { scanf( %d%d , &n, &q); for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); for (int i = 1; i < n; ++i) { int u, v; scanf( %d%d , &u, &v); add(u, v); add(v, u); } fa[1] = h[1] = 1; dfs(1); fa[1] = 0; for (int i = 1; i <= n; ++i) { for (; id; id--) go[id][0] = go[id][1] = 0; id = 1; int p = i; for (int j = 0; p && j < size; j++, p = fa[p]) trie(a[p] ^ (h[i] - h[p])); ance[i] = p; for (int j = 0; j < size; j++) dp[i][j] = query(j << 8); } for (int i = 1; i <= q; ++i) { int u, v; scanf( %d%d , &u, &v); int p = v, dep = 0, ans = 0; for (; h[p] - size >= h[u]; p = ance[p], dep++) ans = max(ans, dp[p][dep]); for (; h[p] >= h[u]; p = fa[p]) ans = max(ans, a[p] ^ (h[v] - h[p])); printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int n = 10000; long long qm[6][n + 2]; void ask(int i, long long b) { int j = min(b, (long long)n); vector<long long> v; long long r = qm[i - 1][j]; for (int s = 1; s <= j; ++s) { v.push_back(r + b); ++r; r += qm[i - 1][min(r + j, (long long)n)]; if (r > (long long)2e18) break; } printf( %d n , int(v.size())); for (auto t : v) printf( %lld , t); cout << endl; int t; cin >> t; if (t == -1) exit(0); if (t == 0) ask(i - 1, b); r = qm[i - 1][j]; for (int s = 1; s <= j; ++s) { ++r; --t; if (!t) ask(i - 1, r + b); r += qm[i - 1][min(r + j, (long long)n)]; } } int main() { for (int i = 1; i <= 4; ++i) { for (int j = 1; j <= n; ++j) { long long r = qm[i - 1][j]; for (int s = 1; s <= j; ++s) { ++r, r += qm[i - 1][min(r + j, (long long)n)]; if (r > (long long)2e18) break; } qm[i][j] = r; } } ask(5, 1); } |
#include <bits/stdc++.h> using namespace std; void swap(int &a, int &b) { int temp; temp = a; a = b; b = temp; } void printarr(int a[], int n) { for (int i = 0; i < 2 * n; i++) cout << a[i] << ; cout << endl; } int main() { long long int n, k, v; cin >> n; int a[2 * n], i, j, count = 0; for (i = 0; i < 2 * n; i++) cin >> a[i]; for (i = 0; i < 2 * n; i += 2) { if (a[i] != a[i + 1]) { j = a[i]; for (k = i + 1; k < 2 * n; k++) { if (j == a[k]) { v = k; while (v > i + 1) { count++; swap(a[v], a[v - 1]); v--; } } } } } cout << count; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; int add(int a, int b) { return a + b - (a + b >= MOD) * MOD; } int mult(int a, int b) { return ((long long)a * b) % MOD; } int n, h, w; char s[500013]; int dX[200], dY[200]; int diffx, diffy; int maxx, minx; int maxy, miny; int hasx_[1000013], hasy_[1000013]; int& hasx(int i) { return hasx_[i + 500000]; } int& hasy(int i) { return hasy_[i + 500000]; } void calc() { int x = 0, y = 0; for (int i = 0; i < n; i++) { x += dX[s[i]]; y += dY[s[i]]; maxx = max(maxx, x); minx = min(minx, x); maxy = max(maxy, y); miny = min(miny, y); if (!hasx(x)) hasx(x) = i + 1; if (!hasy(y)) hasy(y) = i + 1; } diffx = x; diffy = y; } int main() { dX[ U ] = -1; dX[ D ] = 1; dY[ L ] = -1; dY[ R ] = 1; scanf( %d%d%d %s , &n, &h, &w, &s); calc(); if (maxx - minx + 1 <= h && maxy - miny + 1 <= w && diffx == 0 && diffy == 0) return printf( -1 n ), 0; int bot = -1, top = h; int lef = -1, rig = w; int x = 0, y = 0; int step = 0; int ans = 0; while (top > bot + 1 && rig > lef + 1) { int tryt = 1e9; if (x + top - 1 + maxx >= h) tryt = hasx(h - (top + x - 1)); int tryb = 1e9; if (x + bot + 1 + minx <= -1) tryb = hasx(-1 - (bot + x + 1)); int tryr = 1e9; if (y + rig - 1 + maxy >= w) tryr = hasy(w - (rig + y - 1)); int tryl = 1e9; if (y + lef + 1 + miny <= -1) tryl = hasy(-1 - (lef + y + 1)); if (min(min(tryt, tryb), min(tryr, tryl)) < 1e7) { if (tryt < min(tryb, min(tryr, tryl))) { int cur = mult(rig - lef - 1, mult(step, n) + tryt); ans = add(ans, cur); top -= 1; } else if (tryb < min(tryt, min(tryr, tryl))) { int cur = mult(rig - lef - 1, mult(step, n) + tryb); ans = add(ans, cur); bot += 1; } else if (tryr < min(tryt, min(tryb, tryl))) { int cur = mult(top - bot - 1, mult(step, n) + tryr); ans = add(ans, cur); rig -= 1; } else if (tryl < min(tryt, min(tryb, tryr))) { int cur = mult(top - bot - 1, mult(step, n) + tryl); ans = add(ans, cur); lef += 1; } } else { x += diffx; y += diffy; step += 1; } } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } inline void R(int &xx) { xx = 0; char ch = getchar(); while (ch < 0 || ch > 9 ) ch = getchar(); while (ch >= 0 && ch <= 9 ) xx = xx + xx + (xx << 3) + ch - 48, ch = getchar(); } inline void R(long long &xx) { xx = 0; char ch = getchar(); while (ch < 0 || ch > 9 ) ch = getchar(); while (ch >= 0 && ch <= 9 ) xx = xx + xx + (xx << 3) + ch - 48, ch = getchar(); } int n, prime[100011], tot; bool f[100011], u[100011]; vector<pair<int, int> > ans; vector<int> tmp; inline void init() { for (int i = 2; i <= n; i++) { if (!f[i]) prime[++tot] = i; for (int j = 1; j <= tot && i * prime[j] < 100011; j++) { f[i * prime[j]] = 1; if (!(i % prime[j])) break; } } } int main() { R(n); init(); for (int i = tot; i >= 1; i--) { int pr = prime[i]; tmp.clear(); for (int j = pr; j <= n; j += pr) if (!u[j]) tmp.push_back(j); if (tmp.size() & 1) swap(tmp[1], tmp[tmp.size() - 1]); for (int t = 0; t < ((int)tmp.size() - 1); t += 2) { ans.push_back(make_pair(tmp[t], tmp[t + 1])); u[tmp[t]] = u[tmp[t + 1]] = 1; } } printf( %d n , ans.size()); for (int i = 0; i < ans.size(); i++) printf( %d %d n , ans[i].first, ans[i].second); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<long long> b, c; long long s[1000000]; long long d[1000000]; int F(long long x) { vector<long long> a = b; a.push_back(x); sort(a.rbegin(), a.rend()); long long n = a.size(); s[0] = 0; for (int i = 1; i <= n; ++i) { s[i] = s[i - 1] + a[i - 1]; d[i] = -1; } int y = 1; int pos = a.size() - 1; while (pos >= 0 && y <= n) { if (a[pos] > y && pos + 1 > y) { d[y] = pos + 1; ++y; continue; } --pos; } for (long long i = 1; i <= n; ++i) { if (d[i] == -1) { d[i] = s[n] - s[i]; continue; } d[i] = (d[i] - i) * i + s[n] - s[d[i]]; } if (s[n] > n * (n - 1)) { return -1; } for (long long k = 1; k < n; ++k) { if (s[k] > k * (k - 1) + d[k]) { if (a[k - 1] > x) { return -1; } return 1; } } return 0; } int main() { ios_base::sync_with_stdio(0); cin.tie(nullptr); int n; cin >> n; int t = 0; for (int i = 0; i < n; ++i) { int x; cin >> x; b.push_back(x); t += x; t %= 2; } for (int i = 0; i <= n + 2; ++i) { if (i % 2 == t) { c.push_back(i); } } int l = -1; int r = c.size(); int pos = -1; while (r - l > 1) { int m = (l + r) / 2; if (F(c[m]) == 1) { r = m; continue; } if (F(c[m]) == -1) { l = m; continue; } pos = m; break; } if (pos == -1) { cout << -1; return 0; } l = -1; r = pos + 1; while (r - l > 1) { int m = (l + r) / 2; if (F(c[m]) == 0) { r = m; } else { l = m; } } int pos1 = r; l = pos - 1; r = c.size(); while (r - l > 1) { int m = (l + r) / 2; if (F(c[m]) == 0) { l = m; } else { r = m; } } for (int i = pos1; i <= l; ++i) { cout << c[i] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 10; const int MN = 1e5 + 10; int n, a[MN << 1], b[MN << 1]; struct cmp { bool operator()(const int &x, const int &y) { if (a[x] + b[x] != a[y] + b[y]) return a[x] + b[x] > a[y] + b[y]; return x > y; } }; set<int, cmp> S; int main() { ios_base ::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> n; long long ans = 0; for (int i = 0; i < n; ++i) { cin >> a[2 * i] >> b[2 * i] >> a[2 * i + 1] >> b[2 * i + 1]; int x = a[2 * i] + b[2 * i], y = a[2 * i + 1] + b[2 * i + 1]; if (a[2 * i] > b[2 * i + 1] || b[2 * i] > a[2 * i + 1]) { if (x >= y) S.insert(2 * i), S.insert(2 * i + 1); else { if (a[2 * i] > b[2 * i + 1]) ans += a[2 * i] - b[2 * i + 1]; else ans += a[2 * i + 1] - b[2 * i]; } } } bool turn = false; while (!S.empty()) { int x = *S.begin(); S.erase(S.begin()); if (!turn) ans += a[x]; else ans -= b[x]; turn = !turn; } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> inline void read(T &x) { x = 0; char c = getchar(), f = 0; for (; c < 0 || c > 9 ; c = getchar()) if (c == - ) f = 1; for (; c >= 0 && c <= 9 ; c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48); if (f) x = -x; } const int P = 1e9 + 7; int n, D, dp[3005][3005], s[3005][3005], res; struct edge { int to, nxt; } e[3005]; int et, head[3005], iv[3005]; inline int ksm(int x, int q = P - 2) { int r = 1; for (; q; q >>= 1, x = 1ll * x * x % P) if (q & 1) r = 1ll * r * x % P; return r; } inline void adde(int x, int y) { e[++et] = (edge){y, head[x]}, head[x] = et; } inline void dfs(int x) { for (int i = 1; i <= n + 1; i++) dp[x][i] = 1; for (int i = head[x]; i; i = e[i].nxt) { dfs(e[i].to); for (int j = 1; j <= n + 1; j++) dp[x][j] = 1ll * dp[x][j] * s[e[i].to][j] % P; } for (int i = 1; i <= n + 1; i++) s[x][i] = (s[x][i - 1] + dp[x][i]) % P; } inline int inv(int x) { return x < 0 ? P - iv[-x] : iv[x]; } int main() { read(n), read(D); for (int i = 2, f; i <= n; i++) read(f), adde(f, i); iv[1] = 1; for (int i = 2; i <= n + 1; i++) iv[i] = 1ll * iv[P % i] * (P - P / i) % P; dfs(1); for (int i = 1, w = 1; i <= n + 1; (res += 1ll * w * s[1][i] % P) %= P, w = 1, i++) for (int j = 1; j <= n + 1; j++) if (i ^ j) w = 1ll * w * (D - j) % P * inv(i - j) % P; return printf( %d n , (res + P) % P), 0; } |
#include <bits/stdc++.h> using namespace std; const int SIZE = 20 + 5; const int Mod = 1e9 + 7; int inv[SIZE], n; long long a[SIZE], m, ans; inline long long read() { char ch = getchar(); long long f = 1, x = 0; while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = (x << 1) + (x << 3) + ch - 0 ; ch = getchar(); } return x * f; } inline int Qpow(int b, int p) { long long ans = 1, t = b; for (; p; p >>= 1, t = t * t % Mod) if (p & 1) ans = ans * t % Mod; return ans % Mod; } inline int C(long long y, int x) { if (y < 0 || x < 0 || y < x) return 0; y %= Mod; if (y == 0 || x == 0) return 1; int ans = 1; for (int i = 0; i < x; i++) ans = (long long)ans * (y - i) % Mod; for (int i = 1; i <= x; i++) ans = (long long)ans * inv[i] % Mod; return ans; } int main() { for (int i = 1; i <= 20; i++) inv[i] = Qpow(i, Mod - 2); std::cin >> n >> m; for (int i = 1; i <= n; i++) a[i] = read(); for (int x = 0; x < (1 << n); x++) { if (!x) ans = (ans + C(n + m - 1, n - 1)) % Mod; else { long long t = n + m; int p = 0; for (int i = 0; i < n; i++) { if (x >> i & 1) { p++; t -= a[i + 1]; } } t -= p + 1; if (p & 1) ans = (ans - C(t, n - 1)) % Mod; else ans = (ans + C(t, n - 1)) % Mod; } } printf( %lld , (ans + Mod) % Mod); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MX = 1e5 + 5; int n; int M[9][2] = {{0, 0}, {-1, -1}, {1, 1}, {0, 1}, {1, 0}, {0, -1}, {-1, 0}, {1, -1}, {-1, 1}}; int compute(vector<int> Arr, int A0, int A1, int val) { Arr[0] = A0; Arr[1] = A1; int d = Arr[1] - Arr[0]; int ans = val; for (int i = 2; i < n; i++) { if (d + Arr[i - 1] != Arr[i]) { if (d + Arr[i - 1] != Arr[i] + 1) { if (d + Arr[i - 1] != Arr[i] - 1) { return -1; } else { Arr[i]--; ans++; } } else { Arr[i]++; ans++; } } } return ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int val; cin >> n; vector<int> A; for (int i = 0; i < n; cin >> val, A.push_back(val), i++) ; int ans = -1; for (int i = 0; i < 9; i++) { int num = compute(A, A[0] + M[i][0], A[1] + M[i][1], abs(M[i][0]) + abs(M[i][1])); if (num != -1) { if (ans == -1) ans = num; else ans = min(ans, num); } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> const int N = 200100; char a[N], b[N]; int cnt[330]; int main() { int la, lb, i; long long ans = 0; scanf( %s%s , a, b); la = strlen(a), lb = strlen(b); for (i = 0; i < lb - la; i++) cnt[b[i]]++; for (i = 0; i < la; i++) { cnt[b[lb - la + i]]++; if (a[i] == 0 ) ans += cnt[ 1 ]; else ans += cnt[ 0 ]; cnt[b[i]]--; } printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int f[1100000], p[1100000], n, m, a[110], b[30], c[30]; char cc; bool cmp(int a, int b) { return a > b; } void init() { scanf( %d , &n); for (int i = (1); i <= (n); ++i) scanf( %d , &a[i]); sort(a + 1, a + 1 + n, cmp); scanf( %d n , &n); for (int i = (0); i <= (n - 1); ++i) { scanf( %c%d n , &cc, &b[i]); c[i] = (cc == p ); } m = (1 << n) - 1; p[0] = 0; for (int i = (1); i <= (m); ++i) p[i] = p[i >> 1] + (i & 1); } void work() { int x, y; f[m] = 0; for (int i = (m - 1); i >= (0); --i) { x = p[i]; f[i] = b[x] == 2 ? 100000000 : -100000000; for (int j = (1); j <= (n); ++j) { y = 1 << (j - 1); if (i & y) continue; if (b[x] == 1) { if (c[x]) f[i] = max(f[i], a[j] + f[i ^ y]); else f[i] = max(f[i], f[i ^ y]); } else { if (c[x]) f[i] = min(f[i], f[i ^ y] - a[j]); else f[i] = min(f[i], f[i ^ y]); } } } cout << f[0]; } int main() { init(); work(); return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; vector<int> arr(n); vector<pair<int, int>> sorted_arr(n); for (int i = 0; i < n; i++) { cin >> arr[i]; sorted_arr[i] = {arr[i], i}; } sort(sorted_arr.begin(), sorted_arr.end()); vector<int> pos(n); for (int i = 0; i < n; i++) { pos[i] = sorted_arr[i].second; } vector<int> next(n), prev(n); next[n - 1] = n; for (int i = n - 2; i >= 0; i--) { int j = i + 1; while (j < n && arr[i] > arr[j]) { j = next[j]; } next[i] = j; } prev[0] = -1; for (int i = 1; i < n; i++) { int j = i - 1; while (j >= 0 && arr[i] > arr[j]) { j = prev[j]; } prev[i] = j; } int ans = 0; for (int i = 1; i < n - 1; i++) { if (i - prev[i] < next[i] - i) { for (int j = prev[i] + 1; j < i; j++) { int k = pos[arr[i] - arr[j] - 1]; if (i < k && k < next[i]) ans++; } } else { for (int j = next[i] - 1; j > i; j--) { int k = pos[arr[i] - arr[j] - 1]; if (prev[i] < k && k < i) ans++; } } } cout << ans; } signed main() { ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr); solve(); cout << n ; } |
#include <bits/stdc++.h> using namespace std; long long n; long long s(long long x) { long long ans = 0; while (x) ans += x % 10, x /= 10; return ans; } long long solve(long long x) { return x * x + s(x) * x - n; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; long long sq = sqrt(n); int i; for (i = sq - 1000000; i <= sq + 1000000; i++) { if (i > 0) if (solve(i) == 0) { cout << i << n ; return 0; } } cout << -1 << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; double y111, y222, yw, xb, yb, r; double ASIN(double w) { if (w < -1.0) w = -1.0; if (w > 1.0) w = 1.0; return asin(w); } int main() { cin >> y111 >> y222 >> yw >> xb >> yb >> r; y111 += 1E-9; y222 -= 1E-9; double st = yw - r; double plo = 2 * st - y111, phi = 2 * st - y222; if (plo > phi) swap(plo, phi); double D = sqrt(((xb) * (xb)) + ((plo - yb) * (plo - yb))); double ang = ASIN(r / D); complex<double> dir = complex<double>(0, plo) - complex<double>(xb, yb); dir *= polar(1.0, -ang); double ty = yb + (fabs(xb / dir.real())) * dir.imag(); if (ty < phi - r + 1E-9) { double X = xb + ((st - yb) / dir.imag()) * dir.real(); printf( %.18lf n , X); } else puts( -1 ); return 0; } |
#include <bits/stdc++.h> using namespace std; const double sn = 1e-6; int n, k; char arr[55][10]; string s[55]; string res[55]; int main() { scanf( %d%d , &n, &k); for (int i = 0; i < n - k + 1; i++) { scanf( %s , arr[i]); string st(arr[i]); s[i] = st; } string val = Aa ; for (int i = 0; i < n - k + 1; i++) { if (s[i] == NO ) { if (res[i] != ) { res[i + k - 1] = res[i]; continue; } res[i] = val; res[i + k - 1] = val; val[1] = val[1] + 1; if (val[1] > z ) { val[0] = val[0] + 1; val[1] = a ; } } } for (int i = 0; i < n; i++) { if (res[i] == ) { res[i] = val; val[1] = val[1] + 1; if (val[1] > z ) { val[0] = val[0] + 1; val[1] = a ; } } } for (int i = 0; i < n; i++) { printf( %s , res[i].c_str()); if (i != n - 1) printf( ); } printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string x; cin >> x; int y; if (x.size() == 1) { y = x[0] - 0 ; if (!(y % 4)) cout << 4; else cout << 0; return 0; } y = x[x.size() - 1] - 0 + ((x[x.size() - 2] - 0 ) * 10); if (!(y % 4)) cout << 4; else cout << 0; return 0; } |
#include <bits/stdc++.h> using namespace std; int min(int a, int b) { if (a < b) return a; else return b; } int main() { int n, a, b, c, j; bool t = false; cin >> n; for (int i = 0; i < (4); ++i) { cin >> a >> b; if (a < 1 || b < 1) c = n + 1; else c = min(a, b); cin >> a >> b; if (a < 1 || b < 1) j = n + 1; else j = min(a, b); if (n >= c + j) { t = true; a = i + 1; break; } } if (t) cout << a << << c << << n - c; else cout << -1; } |
#include <bits/stdc++.h> using namespace std; const int N = 102; double dp[N][N][N][3]; int vis[N][N][N][3]; double call(int r, int s, int p, int id) { if (id == 0) { if (r == 0) return 0; if (s + p == 0) return 1; } else if (id == 1) { if (s == 0) return 0; if (r + p == 0) return 1; } else { if (p == 0) return 0; if (r + s == 0) return 1; } if (vis[r][s][p][id] == 1) return dp[r][s][p][id]; vis[r][s][p][id] = 1; double ret = 0; double total = ((r + s + p - 1) * (r + s + p)) / 2; double pr = ((r * (r - 1)) / 2) / total; double ps = ((s * (s - 1)) / 2) / total; double pp = ((p * (p - 1)) / 2) / total; double prs = (r * s) / total; double prp = (r * p) / total; double psp = (s * p) / total; double prob = pr + ps + pp; if (r >= 1 and s >= 1) ret = ret + prs * call(r, s - 1, p, id); if (r >= 1 and p >= 1) ret = ret + prp * call(r - 1, s, p, id); if (s >= 1 and p >= 1) ret = ret + psp * call(r, s, p - 1, id); return dp[r][s][p][id] = ret / (1 - prob); } int main() { ios_base::sync_with_stdio(0); cin.tie(nullptr); int r, s, p; cin >> r >> s >> p; cout << fixed << setprecision(9) << call(r, s, p, 0) << << call(r, s, p, 1) << << call(r, s, p, 2) << n ; } |
#include <bits/stdc++.h> using namespace std; const double PI = 3.141592653589793238; long long powmod(long long a, long long b) { long long res = 1; a %= 1000000007; for (; b; b >>= 1) { if (b & 1) res = res * a % 1000000007; a = a * a % 1000000007; } return res; } long long fac[1000005]; void factorial(int mx) { fac[0] = 1ll; for (int i = 1; i <= mx; i++) { fac[i] = fac[i - 1] * (long long)i; fac[i] %= 1000000007; } } int main() { factorial(1000005 - 5); int n, m, vol, type; long long ans, cnt = 1ll; scanf( %d , &n); scanf( %d , &m); vector<vector<int> > vec(m); for (int i = 0; i < n; i++) { scanf( %d , &vol); while (vol--) { scanf( %d , &type); vec[type - 1].push_back(i); } } for (int i = 0; i < m; i++) sort(vec[i].begin(), vec[i].end()); sort(vec.begin(), vec.end()); ans = 1ll; for (int i = 1; i <= m - 1; i++) { if (vec[i] == vec[i - 1]) ans *= ++cnt; else cnt = 1; ans %= 1000000007; } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; for (int ti = 0; ti < t; ti++) { int n, k; cin >> n >> k; vector<int> arr(n); for (int i = 0; i < n; i++) cin >> arr[i]; sort(arr.begin(), arr.end()); vector<int> weights(k); for (int i = 0; i < k; i++) cin >> weights[i]; sort(weights.begin(), weights.end()); long long total = 0; for (int i = n - 1; i >= n - k; i--) { total += arr[i]; } int w = 0; for (int i = k - 1; i >= 0; i--) { if (weights[i] <= 1) break; total += arr[w]; w += weights[i] - 1; } for (int i = 0; i < k; i++) { if (weights[i] > 1) break; total += arr[n - 1 - i]; } cout << total << endl; } return 0; } |
#include <bits/stdc++.h> long long ago; using namespace std; template <class T = long long int> T nxt() { T x; cin >> x; return x; } long long int pw(long long int a, long long int b, long long int mod) { if (!b) return 1; if (b & 1) return a * pw(a * a % mod, b / 2, mod) % mod; return pw(a * a % mod, b / 2, mod) % mod; } const long long int N = 1000 + 10; const long long int INF = 8e18; const long long int MOD = 1e9 + 7; long long int n, m, mark[N]; double dist[N], S[N], Z[N]; vector<pair<long long int, double>> adj[N]; priority_queue<pair<double, long long int>, vector<pair<double, long long int>>, greater<pair<double, long long int>>> pq; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cout << setprecision(15) << fixed; cin >> n; for (long long int i = 1; i <= n; i++) { for (long long int j = 1; j <= n; j++) { long long int p = nxt(); if (i == j || p == 0) continue; adj[j].emplace_back(i, double(p) / 100); } } fill(Z, Z + N, 1.0); fill(dist, dist + N, INF); dist[n] = 0; pq.push({0, n}); while (!pq.empty()) { long long int u = pq.top().second; pq.pop(); if (mark[u]) continue; mark[u] = 1; for (auto [v, p] : adj[u]) { if (mark[v]) continue; S[v] += Z[v] * p * (dist[u] + 1); Z[v] *= (1 - p); dist[v] = (S[v] + Z[v]) / (1 - Z[v]); pq.push({dist[v], v}); } } cout << dist[1] << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; int n; cin >> n >> s; vector<int> vec; for (int i = 0; i < s.length(); ++i) { if (s[i] == B ) { int res = 0; while (i < s.length() && s[i] == B ) { ++res; ++i; } vec.push_back(res); continue; } } cout << vec.size() << n ; for (int i = 0; i < (int)vec.size(); ++i) { cout << vec[i] << ; } cout << n ; } |
#include <bits/stdc++.h> using namespace std; const int MaxN = 1e5; struct NOOD { int flag; int l; int r; int v; } num[MaxN + 5]; int ans[MaxN + 5], p[MaxN + 5]; bool ok[MaxN + 5], flag; int Max; int n, m; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) { scanf( %d%d%d%d , &num[i].flag, &num[i].l, &num[i].r, &num[i].v); } for (int i = 1; i <= n; i++) ans[i] = -100000000; for (int i = m; i >= 1; i--) { if (num[i].flag == 1) { for (int j = num[i].l; j <= num[i].r; j++) ans[j] -= num[i].v; } else { for (int j = num[i].l; j <= num[i].r; j++) { if (ok[j] && ans[j] < num[i].v) continue; ans[j] = num[i].v; ok[j] = 1; } } } for (int i = 1; i <= n; i++) p[i] = ans[i]; for (int i = 1; i <= m; i++) { if (num[i].flag == 1) { for (int j = num[i].l; j <= num[i].r; j++) p[j] += num[i].v; } else { Max = -100000000; for (int j = num[i].l; j <= num[i].r; j++) Max = max(Max, p[j]); if (Max != num[i].v) flag = 1; } } if (flag) printf( NO n ); else { printf( YES n ); for (int i = 1; i <= n; i++) printf( %d , ans[i]); printf( n ); } } |
#include <bits/stdc++.h> using namespace std; long long solve() { long long n, i, j, k; cin >> n >> k; long long arr[n]; for (i = 0; i < n; i++) cin >> arr[i]; sort(arr, arr + n); j = 0; for (i = 0; i < n && arr[i] < 0; i += k) j += 2 * abs(arr[i]); for (i = n - 1; i >= 0 && arr[i] > 0; i -= k) j += 2 * arr[i]; j -= max(abs(arr[0]), abs(arr[n - 1])); return j; } int main() { long long t; cin >> t; while (t--) cout << solve() << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; string a, b, tem; scanf( %d , &n); a = <3 ; for (int i = 0, j = 0; i < n; ++i) { cin >> tem; a += tem; a += <3 ; } cin >> b; int len1 = a.length(), po1 = 0, po2 = 0; int len2 = b.length(); while (1) { if (po1 == len1) { printf( yes n ); return 0; } if (po2 == len2) { printf( no n ); return 0; } if (a[po1] == b[po2]) po1++; po2++; } } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.