func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; const long long INF = 1000000000; template <class T> T read(T &x) { char c; int flag = 1; while ((c = getchar()) < 0 || c > 9 ) if (c == - ) flag *= -1; x = c - 0 ; while ((c = getchar()) >= 0 && c <= 9 ) x = x * 10 + c - 0 ; x *= flag; return x; } int dep[100005]; int fa[100005]; vector<int> adj[100005]; void dfs(int x, int f) { for (int i : adj[x]) { if (i == f) continue; fa[i] = x; dep[i] = dep[x] + 1; dfs(i, x); } } int main() { ios::sync_with_stdio(false); cin.tie(0); int n, k; cin >> n >> k; for (int i = 1; i < n; ++i) { int u, v; cin >> u >> v; adj[u].push_back(v); adj[v].push_back(u); } dfs(1, -1); int root = 1; for (int i = 1; i <= n; ++i) if (dep[root] < dep[i]) root = i; memset(dep, 0, sizeof dep); ; dfs(root, -1); int tar = root; for (int i = 1; i <= n; ++i) if (dep[tar] < dep[i]) tar = i; vector<int> v; while (tar != root) { v.push_back(tar); tar = fa[tar]; } v.push_back(root); if (v.size() != (k << 1) + 1) return cout << No << endl, 0; memset(dep, 0, sizeof dep); ; root = v[k]; dfs(root, -1); for (int i = 1; i <= n; ++i) { if (dep[i] == k) continue; int sz = adj[i].size() - 1 + (root == i); if (sz < 3) return cout << No << endl, 0; } cout << Yes << endl; } |
#include <bits/stdc++.h> using namespace std; int dp[1003][1003], a[1003]; pair<pair<int, int>, int> from[1003][1003]; vector<pair<int, int> > sol; int main() { int N; cin >> N; for (int i = 1; i <= N; i++) cin >> a[i]; if (N % 2 == 0) { N++; a[N] = 0; } memset(dp, 0x3f3f3f3f, sizeof(dp)); dp[1][1] = 0; for (int i = 3; i <= N; i += 2) { for (int j = 1; j <= i - 2; j++) { if (dp[i - 2][j] + max(a[j], a[i - 1]) < dp[i][i]) { dp[i][i] = dp[i - 2][j] + max(a[j], a[i - 1]); from[i][i] = make_pair(make_pair(j, i - 1), j); } if (dp[i - 2][j] + max(a[j], a[i]) < dp[i][i - 1]) { dp[i][i - 1] = dp[i - 2][j] + max(a[j], a[i]); from[i][i - 1] = make_pair(make_pair(j, i), j); } if (dp[i - 2][j] + max(a[i], a[i - 1]) < dp[i][j]) ; { dp[i][j] = dp[i - 2][j] + max(a[i], a[i - 1]); from[i][j] = make_pair(make_pair(i, i - 1), j); } } } int best = 0x3f3f3f3f, missing; for (int i = 1; i <= N; i++) if (dp[N][i] + a[i] < best) { best = dp[N][i] + a[i]; missing = i; } printf( %d n , best); if (a[missing]) sol.push_back(make_pair(missing, 0)); int start = N; while (start != 1) { int x2 = from[start][missing].first.first; int x3 = from[start][missing].first.second; sol.push_back(make_pair(x2, x3)); missing = from[start][missing].second; start -= 2; } for (int i = sol.size() - 1; i >= 0; i--) { if (sol[i].second) printf( %d %d n , sol[i].first, sol[i].second); else printf( %d n , sol[i].first); } } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 10; int bit[MAXN + 100], ans[MAXN], _pos[MAXN]; vector<pair<int, int> > _query[MAXN]; vector<int> d[MAXN]; void upd(int id) { for (; id <= MAXN; id += id & (-id)) bit[id]++; return; } int get(int id) { int now = 0; for (; id > 0; id = id & (id - 1)) now += bit[id]; return now; } int main() { ios::sync_with_stdio(0); int n, q; cin >> n >> q; for (int i = 0; i < n; i++) { int x; cin >> x; _pos[x] = i + 1; } for (int i = 0; i < q; i++) { int x, y; cin >> x >> y; _query[y].push_back({i, x}); } for (int i = 1; i <= n; i++) for (int j = i; j <= n; j += i) d[max(_pos[i], _pos[j])].push_back(min(_pos[i], _pos[j])); for (int i = 1; i <= n; i++) { for (auto j : d[i]) upd(j); for (auto j : _query[i]) ans[j.first] = get(i) - get(j.second - 1); } for (int i = 0; i < q; i++) cout << ans[i] << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); int q, n; cin >> q; while (q--) { cin >> n; vector<int> a(1 + n), answer(1 + n, 0); map<int, unordered_set<int> > m; vector<bool> vis(n + 1, false); for (int i = 1; i <= n; ++i) { cin >> a[i]; } for (int i = 1; i <= n; ++i) { if (!vis[i]) { int j = i; vis[i] = true; while (a[j] != i) { m[i].insert(j); j = a[j]; vis[j] = true; } m[i].insert(j); } } for (auto p : m) { int temp = p.second.size(); answer[p.first] = temp; for (auto r : p.second) { answer[r] = temp; } } for (int i = 1; i <= n; ++i) cout << answer[i] << ; cout << n ; } return 0; } |
#include <bits/stdc++.h> #include<unordered_set> using namespace std; #define ll long long int #define f1(i,n) for(i=0;i<n;i++) #define f2(i,a,n) for(i=n-1;i>=a;i--) #define f3(i,a,n) for(i=a;i<n;i++) #define vl vector<long long int> #define um unordered_map<ll,ll> #define us unordered_set<ll> #define pb push_back #define mp make_pair #define sv(v) sort(v.begin(),v.end()) #define rv(v) reverse(v.begin(),v.end()) #define sa(v,n) sort(v,v+n) #define ra(v,n) sort(v,v+n,greater<int>()) #define mod 1000000007 void solution(){ ll k{},kg{},l{},h{},r{},u{},n=0,m{},p{},x=0,y{},o=0,sum=0,sum1{},pos{},ch=0,c1=0,c2=0,i=0,j=0,ans=0,a{},b=0,c=0,i1,i2,p1,q,d=0,w,result{},avg{}; string s,s1,s2; cin>>n; vl v,v1; //map<ll,ll> mp; f1(i,n){ cin>>x; if(x%2==0) v.pb(x); else v1.pb(x); } f1(i,v.size()) cout<<v[i]<< ; f1(i,v1.size()) cout<<v1[i]<< ; cout<<endl; } //nobody read comments! int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ll t=1; cin>>t; while(t--) solution(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]) { long long n, m, k, l; scanf( %lld%lld%lld%lld , &n, &m, &k, &l); n /= m; m = (m + k + l - 1) / m; printf( %lld n , (n >= m) ? m : -1); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { vector<int> even_bag, odd_bag; int n, all, x; cin >> n; for (int i = 0; i < n; i++) { cin >> x; all += x; if (x & 1) odd_bag.push_back(x); else even_bag.push_back(x); } cout << ((all & 1) ? odd_bag.size() : even_bag.size()) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int NMAX = 1e5 + 7; long long n, a[NMAX], b[NMAX]; long long dp[NMAX]; struct linija { long long a, b; }; linija c[NMAX]; int sz, cur; double prijesek_x(int i, int j) { return (double)(c[i].b - c[j].b) / (c[j].a - c[i].a); } void dodaj(linija L) { c[sz].a = L.a; c[sz].b = L.b; while (sz >= 2 && prijesek_x(sz, sz - 1) <= prijesek_x(sz - 1, sz - 2)) { c[sz - 1].a = c[sz].a; c[sz - 1].b = c[sz].b; sz--; } sz++; } long long dobij(int ide) { while (cur + 1 < sz && (double)ide > prijesek_x(cur, cur + 1)) cur++; return 1LL * c[cur].a * ide + 1LL * c[cur].b; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %I64d , &a[i]); for (int i = 1; i <= n; i++) scanf( %I64d , &b[i]); linija L = {b[1], 0}; dodaj(L); for (int i = 2; i <= n; i++) { dp[i] = dobij(a[i]); linija L = {b[i], dp[i]}; dodaj(L); } printf( %I64d n , dp[n]); return 0; } |
#include <bits/stdc++.h> using namespace std; long long power(long long x, long long y, long long m); long long modInverse(long long n, long long m); long long nCr(long long n, long long r, long long m); long long ceiling(long long x, long long y); bool sortbyth(const tuple<long long, int, int>& a, const tuple<long long, int, int>& b) { if (get<0>(a) != get<0>(b)) return get<0>(a) > get<0>(b); else return get<1>(a) < get<1>(b); } int dx[] = {-1, -1, -1, 0, 1, 1, 1, 0}; int dy[] = {-1, 0, 1, 1, 1, 0, -1, -1}; void aksayushx() { string s; cin >> s; int n = s.length(); stack<pair<int, int>> st; for (int i = 0; i < n; i++) { if (s[i] == 0 && (!st.empty() && st.top().first == 1 )) st.pop(); else st.push({s[i], i}); } while (!st.empty()) { s[st.top().second] = 0 ; st.pop(); } cout << s << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t = 1; while (t--) aksayushx(); return 0; } long long power(long long x, long long y, long long m) { long long res = 1; x = x % m; if (x == 0) return 0; while (y > 0) { if (y & 1) res = (res * x) % m; y = y >> 1; x = (x * x) % m; } return res; } long long modInverse(long long n, long long m) { return power(n, m - 2, m); } long long ceiling(long long x, long long y) { return (x + y - 1) / y; } |
#include <bits/stdc++.h> using namespace std; long long n, m; const long long inf = 0x3f3f3f3f; const long long size = 100000; struct data { long long id, step; long long x, y, z; data(){}; data(long long u, long long v) : id(u), step(v){}; data(long long a, long long b, long long c) : x(a), y(b), z(c){}; bool operator<(const data& p) const { return step > p.step; } }; priority_queue<data> q; vector<pair<long long, long long> > ve[size + 10]; vector<data> edge; vector<data> res; long long dist[size + 10]; long long path[size + 10]; long long TT[size + 10]; bool vis[size + 10]; void init() { memset(dist, inf, sizeof(dist)); memset(vis, false, sizeof(vis)); memset(path, -1, sizeof(path)); memset(TT, -1, sizeof(TT)); for (int i = 0; i <= n; i++) { ve[i].clear(); } edge.clear(); res.clear(); while (!q.empty()) q.pop(); } void dij() { dist[1] = 0; q.push(data(1, dist[1])); while (!q.empty()) { data temp = q.top(); q.pop(); if (vis[temp.id]) continue; else vis[temp.id] = true; if (temp.id == n) return; for (auto u : ve[temp.id]) { long long v = u.first; long long color = u.second; if (!vis[v] && dist[temp.id] + color < dist[v]) { dist[v] = dist[temp.id] + color; TT[v] = temp.id; q.push(data(v, dist[v])); } } } } int main() { long long x, y, z; init(); cin >> n >> m; for (int i = 0; i < m; i++) { cin >> x >> y >> z; ve[x].push_back(make_pair(y, !z + size)); ve[y].push_back(make_pair(x, !z + size)); edge.push_back(data(x, y, !z + size)); } dij(); long long pre = n; while (pre != 1) { path[pre] = TT[pre]; pre = TT[pre]; } for (int i = 0; i < m; i++) { x = edge[i].x; y = edge[i].y; z = edge[i].z; if (path[x] == y || path[y] == x) { if (z == size + 1) { res.push_back(data(x, y, 1LL)); } } else { if (z == size) { res.push_back(data(x, y, 0LL)); } } } cout << res.size() << endl; for (auto i : res) { cout << i.x << << i.y << << i.z << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > v; int main(void) { int n, m, a, b; scanf( %d%d , &n, &m); for (int i = 0; i < m; i++) { scanf( %d%d , &a, &b); v.push_back(make_pair(b, a)); } sort(v.rbegin(), v.rend()); long long ans = 0; int i = 0; while (n) { int del = min(n, v[i].second); ans += (long long)del * v[i].first; n -= del; i++; if (i == v.size()) break; } printf( %lld n , ans); } |
#include <bits/stdc++.h> using namespace std; long long read() { long long x = 0, F = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) F = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { x = (x << 3) + (x << 1) + c - 0 ; c = getchar(); } return x * F; } int add(int a, int b) { return (a + b >= 51123987) ? a + b - 51123987 : a + b; } int dec(int a, int b) { return (a - b < 0) ? a - b + 51123987 : a - b; } int mul(long long a, int b) { return 1LL * a * b % 51123987; } int ans, Tk, n, L[2000000 + 5], R[2000000 + 5], ecnt, head[2000000 + 5]; char s[2000000 + 5]; struct edge { int to, nxt, c; } e[2000000 + 5]; void add(int u, int v, int c) { e[++ecnt] = (edge){v, head[u], c}; head[u] = ecnt; } struct Palindromic_Tree { int dep[2000000 + 5], fa[2000000 + 5], len[2000000 + 5]; int lst, tot; void init() { memset(head, 0, sizeof(head)); ecnt = 0; memset(fa, 0, sizeof(fa)), memset(len, 0, sizeof(len)), memset(dep, 0, sizeof(dep)); tot = 0, lst = 0; len[++tot] = -1; fa[0] = fa[1] = 1; } int get_id(int x, int c) { for (int i = head[x]; i; i = e[i].nxt) if (e[i].c == c) return e[i].to; return 0; } void Insert(int c, int L) { int p = lst; while (s[L - len[p] - 1] != s[L]) p = fa[p]; if (!get_id(p, c)) { int np = ++tot, k = fa[p]; len[np] = len[p] + 2; while (s[L - len[k] - 1] != s[L]) k = fa[k]; fa[np] = get_id(k, c); dep[np] = dep[fa[np]] + 1; add(p, np, c); } lst = get_id(p, c); } } T; int main() { n = read(); scanf( %s , s + 1); T.init(); for (int i = 1; i <= n; i++) { T.Insert(s[i] - a , i); L[i] = T.dep[T.lst]; ans = add(ans, L[i]); } ans = mul(1LL * ans * (ans - 1) / 2, 1); T.init(); reverse(s + 1, s + n + 1); for (int i = n; i >= 1; i--) { T.Insert(s[n - i + 1] - a , n - i + 1); R[i] = T.dep[T.lst]; R[i] = add(R[i], R[i + 1]); } for (int i = 1; i < n; i++) ans = dec(ans, mul(L[i], R[i + 1])); printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; template <class T> inline void read(T &x) { char ch; bool flag = false; while (!isdigit(ch = getchar())) flag |= ch == - ; for (x = ch ^ 48; isdigit(ch = getchar()); x = x * 10 + (ch ^ 48)) ; if (flag) x = -x; } inline int input() { int x; char ch; bool flag = false; while (!isdigit(ch = getchar())) flag |= ch == - ; for (x = ch ^ 48; isdigit(ch = getchar()); x = x * 10 + (ch ^ 48)) ; return flag ? -x : x; } const int mod = 1e9 + 7; inline int add(int x, int y) { x += y; return x >= mod ? x - mod : x; } inline void inc(int &x, int y) { x += y; x -= x >= mod ? mod : 0; } inline int Power(int x, int y) { int res = 1; while (y) { if (y & 1) res = (long long)res * x % mod; x = (long long)x * x % mod, y >>= 1; } return res; } template <class T> void chkmax(T &x, T y) { x = x > y ? x : y; } template <class T> void chkmin(T &x, T y) { x = x < y ? x : y; } template <class T> T gcd(T x, T y) { return !y ? x : gcd(x % y, y); } int n, a[300005]; int cnt[300005 << 1]; int lmax[300005], lmin[300005], rmax[300005], rmin[300005]; long long ans; void divide(int l, int r) { if (l == r) return void(); int mid = l + r >> 1; divide(l, mid), divide(mid + 1, r); rmin[mid] = INT_MAX, rmax[mid] = 0; lmin[mid + 1] = INT_MAX, lmax[mid + 1] = 0; for (int i = mid; i >= l; --i) { lmin[i] = min(lmin[i + 1], a[i]); lmax[i] = max(lmax[i + 1], a[i]); } for (int i = mid + 1; i <= r; ++i) { rmin[i] = min(rmin[i - 1], a[i]); rmax[i] = max(rmax[i - 1], a[i]); } for (int i = mid, lp = mid + 1, rp = mid + 1; i >= l; --i) { int pos = lmax[i] - lmin[i] + i; if (pos > mid && pos <= r && rmin[pos] > lmin[i] && rmax[pos] < lmax[i]) ++ans; while (lp <= r && rmax[lp] < lmax[i]) --cnt[300005 + rmax[lp] - lp], ++lp; while (rp <= r && rmin[rp] > lmin[i]) ++cnt[300005 + rmax[rp] - rp], ++rp; if (lp < rp) ans += cnt[300005 + lmin[i] - i]; } for (int i = mid + 1; i <= r; ++i) cnt[300005 + rmax[i] - i] = 0; for (int i = mid + 1, lp = mid, rp = mid; i <= r; ++i) { int pos = rmin[i] - rmax[i] + i; if (pos >= l && pos <= mid && lmin[pos] > rmin[i] && lmax[pos] < rmax[i]) ++ans; while (lp >= l && lmin[lp] > rmin[i]) ++cnt[lmax[lp] + lp], --lp; while (rp >= l && lmax[rp] < rmax[i]) --cnt[lmax[rp] + rp], --rp; if (lp < rp) ans += cnt[rmin[i] + i]; } for (int i = l; i <= mid; ++i) cnt[lmax[i] + i] = 0; } int main() { ios::sync_with_stdio(false); cin >> n, ans = n; for (int i = 1; i <= n; ++i) { int x, y; cin >> x >> y; a[x] = y; } divide(1, n); printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int n; pair<int, int> s[300100]; pair<int, int> r[300100]; int res[300300]; int s1[300300]; int r1[300300]; map<pair<int, int>, int> rep; int dp[94040]; void add(int a, int b, int x, int l = 1, int h = 1e4 + 2, int p = 1) { if (a == l && b == h) { dp[p] += x; return; } int m = (l + h) / 2; if (b <= m) { add(a, b, x, l, m, 2 * p); } else if (a > m) { add(a, b, x, m + 1, h, 2 * p + 1); } else { add(m + 1, b, x, m + 1, h, 2 * p + 1); add(a, m, x, l, m, 2 * p); } dp[p] = dp[2 * p] + dp[2 * p + 1]; } int cal(int a, int b, int x = 0, int l = 1, int h = 1e4 + 2, int p = 1) { if (a == l && b == h) { return dp[p]; } int m = (l + h) / 2; if (b <= m) { return cal(a, b, x, l, m, 2 * p); } else if (a > m) { return cal(a, b, x, m + 1, h, 2 * p + 1); } else { return cal(m + 1, b, x, m + 1, h, 2 * p + 1) + cal(a, m, x, l, m, 2 * p); } } map<pair<int, int>, int> ch; int main() { cin >> n; for (int i = 1; i <= n; i++) { scanf( %d , &s[i].first); scanf( %d , &r[i].first); r[i].second = i; s[i].second = i; rep[make_pair(s[i].first, r[i].first)]++; s1[i] = s[i].first; r1[i] = r[i].first; } sort(s + 1, s + n + 1); for (int i = 1; i <= n;) { int j; for (j = i; j <= n; j++) { if (s[i].first != s[j].first) break; int in = s[j].second; res[in] += i - 1; if (r[in].first - 1 >= 1) res[in] -= cal(1, r[in].first - 1); } for (int k = i; k < j; k++) { int in = s[k].second; add(r[in].first, r[in].first, 1); } i = j; } sort(r + 1, r + n + 1); for (int i = 1; i <= n;) { int j; for (j = i; j <= n; j++) { if (r[i].first != r[j].first) break; int in = r[j].second; res[in] += i - 1; } i = j; } vector<pair<long long, long long> > v; for (int i = 1; i <= n; i++) { if (res[i] == n - rep[make_pair(s1[i], r1[i])] && !ch.count(make_pair(s1[i], r1[i]))) { ch[make_pair(s1[i], r1[i])] = 1; v.push_back(make_pair(s1[i], r1[i])); } } sort(v.begin(), v.end()); reverse(v.begin(), v.end()); ch[v[0]]++; if (v.size() > 1) ch[v.back()]++; int m; double t; for (int i = 1; i < v.size() - 1; i++) { double bef = -1e18; int l = i + 1, r = v.size() - 1; while (l <= r) { m = (l + r) / 2; t = 1.0 * (1.0 * v[m].second - v[i].second) / (v[m].second * v[i].second) / (1.0 * v[i].first - v[m].first) * (1.0 * v[i].first * v[m].first); if (l == r) { bef = max(bef, t); break; } m++; double t1 = 1.0 * (1.0 * v[m].second - v[i].second) / (v[m].second * v[i].second) / (1.0 * v[i].first - v[m].first) * (1.0 * v[i].first * v[m].first); if (t >= t1) { r = m - 2; bef = max(bef, t); } else { l = m + 1; bef = max(bef, t1); } } m = i + 1; t = 1.0 * (1.0 * v[m].second - v[i].second) / (v[m].second * v[i].second) / (1.0 * v[i].first - v[m].first) * (1.0 * v[i].first * v[m].first); bef = max(bef, t); m = v.size() - 1; t = 1.0 * (1.0 * v[m].second - v[i].second) / (v[m].second * v[i].second) / (1.0 * v[i].first - v[m].first) * (1.0 * v[i].first * v[m].first); bef = max(bef, t); double aft = 1e18; l = 0, r = i - 1; while (l <= r) { int m = (l + r) / 2; t = 1.0 * (1.0 * v[m].second - v[i].second) / (v[m].second * v[i].second) / (1.0 * v[i].first - v[m].first) * (1.0 * v[i].first * v[m].first); if (l == r) { aft = min(aft, t); break; } m++; double t1 = 1.0 * (1.0 * v[m].second - v[i].second) / (v[m].second * v[i].second) / (1.0 * v[i].first - v[m].first) * (1.0 * v[i].first * v[m].first); if (t <= t1) { r = m - 2; aft = min(aft, t); } else { l = m + 1; aft = min(aft, t1); } } m = 0; t = 1.0 * (1.0 * v[m].second - v[i].second) / (v[m].second * v[i].second) / (1.0 * v[i].first - v[m].first) * (1.0 * v[i].first * v[m].first); aft = min(aft, t); m = i - 1; t = 1.0 * (1.0 * v[m].second - v[i].second) / (v[m].second * v[i].second) / (1.0 * v[i].first - v[m].first) * (1.0 * v[i].first * v[m].first); aft = min(aft, t); if (aft >= bef) { ch[v[i]]++; } } for (int i = 1; i <= n; i++) { if (ch[make_pair(s1[i], r1[i])] == 2) printf( %d , i); } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; void solve(long long cno) { long long n, i, j, k; cin >> n; long long arr[n]; for (i = 0; i < n; i++) { cin >> arr[i]; } if (n < 3) { cout << 0 << endl; for (auto x : arr) { cout << x << ; } return; } sort(arr, arr + n); long long ans[n]; long long ptr = 0; for (i = 1; i < n; i += 2) { ans[i] = arr[ptr++]; } for (i = 0; i < n; i += 2) { ans[i] = arr[ptr++]; } cout << (n - 1) / 2 << endl; for (auto x : ans) { cout << x << ; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long TESTS = 1; long long i = 1; while (TESTS--) { solve(i); i++; } return 0; } |
#include <bits/stdc++.h> double A[200000], B[200000]; int i, j, n, m; double p; int main() { scanf( %d , &n); for (i = 1; i <= n; i++) { scanf( %lf , &p); B[i] = p * (B[i - 1] + 1); A[i] = (A[i - 1] + 2 * B[i - 1] + 1) * p + (1 - p) * A[i - 1]; } printf( %.9lf n , A[n]); } |
//#include<ext/pb_ds/assoc_container.hpp> //#include<ext/pb_ds/hash_policy.hpp> #include<bits/stdc++.h> #define closeSync ios::sync_with_stdio(0);cin.tie(0);cout.tie(0) #define multiCase int T;cin>>T;for(int t=1;t<=T;t++) #define rep(i,a,b) for(int i=(a);i<=(b);i++) #define repp(i,a,b) for(int i=(a);i<(b);i++) #define per(i,a,b) for(int i=(a);i>=(b);i--) #define perr(i,a,b) for(int i=(a);i>(b);i--) #define pb push_back #define eb emplace_back #define mst(a,b) memset(a,b,sizeof(a)) using namespace std; //using namespace __gnu_pbds; typedef long long ll; typedef unsigned long long ull; typedef pair<int,int> P; const int INF=0x3f3f3f3f; const ll LINF=0x3f3f3f3f3f3f3f3f; const double eps=1e-12; const double PI=acos(-1.0); const double angcst=PI/180.0; const ll mod=998244353; ll gcd(ll a,ll b){return b==0?a:gcd(b,a%b);} ll qmul(ll a,ll b){ll r=0;while(b){if(b&1)r=(r+a)%mod;b>>=1;a=(a+a)%mod;}return r;} ll qpow(ll a,ll n){ll r=1;while(n){if(n&1)r=(r*a)%mod;n>>=1;a=(a*a)%mod;}return r;} ll qpow(ll a,ll n,ll p){ll r=1;while(n){if(n&1)r=(r*a)%p;n>>=1;a=(a*a)%p;}return r;} map<int,char> mp; void solve() { int n; cin>>n; while(n--) { int r=0; rep(i,1,5) { int d;cin>>d; r=r*10+d; } cout<<mp[r]; } } int main() { closeSync; mp[10010]= a ; mp[11020]= b ; mp[20011]= c ; mp[21012]= d ; mp[11011]= e ; mp[21021]= f ; mp[22022]= g ; mp[12021]= h ; //mp[11011]= i ; mp[12012]= j ; mp[10120]= k ; mp[11130]= l ; mp[20121]= m ; mp[21122]= n ; mp[11121]= o ; mp[21131]= p ; mp[22132]= q ; mp[12131]= r ; //mp[11121]= s ; mp[12122]= t ; mp[10221]= u ; mp[11231]= v ; mp[12113]= w ; mp[20222]= x ; mp[21223]= y ; mp[11222]= z ; //multiCase { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> inline T read(register T& t) { register T f = 1; register char ch = getchar(); t = 0; while (ch < 0 || ch > 9 ) { if (ch == - ) f = -f; ch = getchar(); } while (ch >= 0 && ch <= 9 ) t = t * 10 + ch - 0 , ch = getchar(); t *= f; return t; } template <typename T, typename... Args> inline void read(T& t, Args&... args) { read(t); read(args...); } const long long p = 998244353; inline long long power(register long long x, register long long k = p - 2) { register long long re = 1; for (; k; k >>= 1, x = x * x % p) if (k & 1) re = re * x % p; return re; } int n; int a[300005]; struct ST { int lg[300005]; int val[300005]; int st[300005][20]; inline int Max(int x, int y) { if (val[x] < val[y]) return y; return x; } ST() { lg[1] = 0; for (int i = 2; i <= 300000; i++) lg[i] = lg[i >> 1] + 1; } void build(int* x, int n, int type) { for (int i = 1; i <= n; i++) val[i] = x[i] * type; for (int i = 1; i <= n; i++) st[i][0] = i; for (int i = 1; i < 20; i++) for (int j = 1; j + (1 << i) - 1 <= n; j++) st[j][i] = Max(st[j][i - 1], st[j + (1 << i - 1)][i - 1]); } inline int ask(int l, int r) { int len = lg[r - l + 1]; return Max(st[l][len], st[r - (1 << len) + 1][len]); } } L0, R0; int l_lim[300005], r_lim[300005]; int l[300005][20], r[300005][20]; int main() { read(n); if (n == 1) return printf( 0 ), 0; for (int i = 1; i <= n; i++) read(a[i]), a[n + i] = a[n + n + i] = a[i]; for (int i = 1; i <= n * 3; i++) l_lim[i] = max(1, i - a[i]), r_lim[i] = min(n * 3, i + a[i]); L0.build(l_lim, n * 3, -1); R0.build(r_lim, n * 3, 1); for (int i = 1; i <= n * 3; i++) l[i][0] = l_lim[i], r[i][0] = r_lim[i]; for (int i = 1; i < 20; i++) for (int j = 1; j <= n * 3; j++) { int L = L0.ask(l[j][i - 1], r[j][i - 1]); int R = R0.ask(l[j][i - 1], r[j][i - 1]); l[j][i] = min(l[L][i - 1], l[R][i - 1]); r[j][i] = max(r[L][i - 1], r[R][i - 1]); } for (int i = n + 1; i <= n + n; i++) { int ans = 0; int x = i, y = i; for (int j = 20 - 1; j >= 0; j--) { if (max(r[x][j], r[y][j]) - min(l[x][j], l[y][j]) + 1 >= n) continue; int tx = x, ty = y; x = L0.ask(l[tx][j], r[ty][j]); y = R0.ask(l[tx][j], r[ty][j]); ans += (1 << j); } printf( %d , ans + 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int array[n]; for (int i = 0; i < n; i++) { cin >> array[i]; } if (n == 1) { cout << 1 << endl; return 0; } int Count = 1; vector<int> vec; for (int i = 0; i < n - 1; i++) { if (array[i] < array[i + 1]) { Count++; } else if (array[i] >= array[i + 1]) { vec.push_back(Count); Count = 1; } if (i == n - 2) { vec.push_back(Count); } } cout << *max_element(vec.begin(), vec.end()); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; string inp; cin >> inp; bool found = false; for (int i = 0; (i < n - 1) && k; ++i) { if (inp[i] == 4 && inp[i + 1] == 7 ) { if (((i + 1) & 1) && (i < n - 2) && (inp[i + 2] == 7 )) { if (k & 1) inp[i + 1] = 4 ; cout << inp << endl; found = true; break; } else if ((((i + 1) & 1) == 0) && (i) && (inp[i - 1] == 4 )) { if (k & 1) inp[i] = 7 ; cout << inp << endl; found = true; break; } else if (((i + 1) & 1)) { inp[i + 1] = 4 ; --k; } else if (((i + 1) % 2) == 0) { inp[i] = 7 ; --k; } } } if (!found) cout << inp << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, y; cin >> n; set<int> t; for (int i = 0; i < n; i++) { cin >> y; if (y != 0) t.insert(y); } cout << t.size() << endl; } |
#include <bits/stdc++.h> using namespace std; const int N = (1 << 20) + 69; int heap[N], idx[N], val[N]; int g, h; void dream(int curr) { while (curr < ((1 << (h - 1)) - 1) && heap[curr] > min(heap[2 * curr + 1], heap[2 * curr + 2])) { int& left = heap[2 * curr + 1]; int& right = heap[2 * curr + 2]; if (left < right) { swap(left, heap[curr]); curr = 2 * curr + 1; } else { swap(right, heap[curr]); curr = 2 * curr + 2; } } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; scanf( %d , &t); for (int i = 0; i < t; i++) { scanf( %d %d , &h, &g); set<int> remain; for (int j = 0; j < (1 << h) - 1; j++) { scanf( %d , &heap[j]); remain.insert(heap[j]); idx[heap[j]] = j; } for (int j = (1 << h) - 2; j >= (1 << g) - 1; j--) dream(j); for (int j = (1 << (g - 1)) - 1; j < (1 << g) - 1; j++) { val[j] = min(heap[2 * j + 1], heap[2 * j + 2]); dream(j); } for (int j = (1 << (g - 1)) - 2; j >= 0; j--) { int lbound = max(val[2 * j + 1], val[2 * j + 2]); while (heap[2 * j + 1] <= lbound) { heap[2 * j + 1] = INT_MAX; dream(2 * j + 1); } while (heap[2 * j + 2] <= lbound) { heap[2 * j + 2] = INT_MAX; dream(2 * j + 2); } val[j] = min(heap[2 * j + 1], heap[2 * j + 2]); dream(j); } long long ans1 = 0; for (int j = 0; j < (1 << g) - 1; j++) { ans1 += val[j]; remain.erase(val[j]); } printf( %I64d n , ans1); for (auto v : remain) printf( %d , idx[v] + 1); printf( n ); } } |
#include <bits/stdc++.h> using namespace std; struct node { vector<int> adj; } graf[5 * 10010]; bool mark[5 * 10010]; int last[5 * 10010]; void DFS(int u, int lst) { last[u] = lst; mark[u] = true; for (int i = 0; i < graf[u].adj.size(); i++) if (!mark[graf[u].adj[i]]) DFS(graf[u].adj[i], u); } int main() { int n, r1, r2; scanf( %d%d%d , &n, &r1, &r2); for (int i = 1; i <= n; i++) { if (i == r1) continue; int tmp; scanf( %d , &tmp); graf[i].adj.push_back(tmp); graf[tmp].adj.push_back(i); } DFS(r2, 0); for (int i = 1; i <= n; i++) { if (i == r2) continue; printf( %d , last[i]); } printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> cyc; vector<int> path; void dfs(vector<int> *graph, int node, vector<bool> vis, int pnode) { if (vis[node] == true) { path.pop_back(); for (int i = path.size() - 1; i >= 0; i--) { if (path[i] != node) { cyc.push_back(path[i]); } else { cyc.push_back(node); break; } } path.push_back(node); return; } vis[node] = true; for (int i = 0; i < graph[node].size(); i++) { if (graph[node][i] != pnode && cyc.size() == 0) { path.push_back(graph[node][i]); dfs(graph, graph[node][i], vis, node); path.pop_back(); } } } void doWork(vector<int> *graph, int node, vector<int> &dp, vector<bool> &vis, int pnode) { if (dp[node] == -1) { dp[node] = dp[pnode] + 1; } vis[node] = true; for (int i = 0; i < graph[node].size(); i++) { if (vis[graph[node][i]] == false) { doWork(graph, graph[node][i], dp, vis, node); } } } int main() { int n; cin >> n; vector<int> graph[n + 1]; int p, q; for (int i = 0; i < n; i++) { cin >> p >> q; graph[p].push_back(q); graph[q].push_back(p); } vector<bool> vis(n + 1, false); path.push_back(1); dfs(graph, 1, vis, -1); vector<int> dp(n + 1, -1); for (int i = 0; i < cyc.size(); i++) { dp[cyc[i]] = 0; } vector<bool> vis1(n + 1, false); doWork(graph, cyc[0], dp, vis1, -1); for (int i = 1; i <= n; i++) { cout << dp[i] << ; } cout << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n; int a[200009], b[200009]; bool k[200009]; int mx; int main() { scanf( %d , &n); for (int j = 1; j <= n; j++) scanf( %d , &a[j]); for (int j = 1; j <= n; j++) scanf( %d , &b[j]); for (int j = 1; j <= n; j++) k[a[j]] = 1; if (!k[1]) { int o = 1; bool kk = 0; while (b[o] != 1) o++; for (int j = o; j <= n; j++) if (b[j] != j - o + 1) { kk = 1; break; } if (kk == 0) { if (o == 1) { printf( 0 ); return 0; } if (k[n - o + 2] == 1) { for (int j = 1; j < o; j++) if (b[j] != 0 && j - b[j] + n - o + 2 > 0) { kk = 1; break; } if (kk == 0) { printf( %d , o - 1); return 0; } } } } for (int j = 1; j <= n; j++) if (b[j] != 0 && j - b[j] + 1 > mx) mx = j - b[j] + 1; printf( %d , mx + n); return 0; } |
#include <bits/stdc++.h> using namespace std; string s; int n; int ok = 0; int main() { ios::sync_with_stdio(false); cin >> n; cin >> s; for (int i = 0; i <= n - 5; i++) { if (s[i] == * ) { for (int j = 1; j <= n; j++) { int now = i, total = 0; while (now < n && s[now] == * && total < 5) { total++; now = now + j; } if (total == 5) { ok = 1; goto output; } } } } output: if (ok) { cout << yes ; } else cout << no ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 500500, MOD = 1e9 + 7; long long Norm(long long x) { return ((x % MOD + MOD) % MOD); } int n; long long prefsumx[2 * MAX], prefsumy[2 * MAX]; long long prefpov[2 * MAX]; long long prefob[2 * MAX], prefprav[2 * MAX]; pair<int, int> tocke[2 * MAX]; long long UmToc(int a, int b) { return (long long)tocke[a].first * tocke[b].second - (long long)tocke[b].first * tocke[a].second; } long long Suma(long long polje[2 * MAX], int a, int b) { if (a > b) b += n; long long ret = polje[b]; if (a) ret -= polje[a - 1]; return ret; } long long Povrsina(int a, int b) { if (a == b || a + 1 == b) return 0; return Suma(prefpov, a, b - 1) + UmToc(b, a); } void GenPref() { for (int i = 0; i < 2 * n; i++) { prefpov[i] = UmToc(i, i + 1); prefsumx[i] = tocke[i].first; prefsumy[i] = tocke[i].second; if (i) { prefpov[i] += prefpov[i - 1]; prefsumx[i] += prefsumx[i - 1]; prefsumy[i] += prefsumy[i - 1]; } prefsumx[i] = Norm(prefsumx[i]); prefsumy[i] = Norm(prefsumy[i]); } } int main() { scanf( %d , &n); for (int i = n - 1; i >= 0; i--) scanf( %d%d , &tocke[i].first, &tocke[i].second); for (int i = n; i <= 2 * n; i++) tocke[i] = tocke[i % n]; GenPref(); long long summanj = 0; for (int i = 0, j = 1; i < n; i++) { j = max(j, i + 1); for (; Povrsina(i, j) <= Povrsina(j, i); j++) ; j--; if (Povrsina(i, j) == Povrsina(j, i) && i > (j % n)) j--; if (j == i + 1) continue; int kol = j - (i + 1); prefob[i] += kol; prefprav[i + 2]--; prefprav[j + 1]++; summanj = Norm(summanj + Norm(Suma(prefsumx, i + 2, j)) * tocke[i].second - Norm(Suma(prefsumy, i + 2, j)) * tocke[i].first); } long long tprav = 0, tsum = 0; for (int i = 0; i < 2 * n; i++) { tprav += prefprav[i]; tsum += prefob[i] + tprav; tsum = Norm(tsum); summanj = Norm(summanj + Norm(UmToc(i, i + 1)) * tsum); } long long rje = Norm(Norm((long long)n * (n - 3) / 2) * Norm(Povrsina(0, n - 1)) - 2 * summanj); printf( %lld n , rje); return 0; } |
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( Ofast ) #pragma GCC optimize(3) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) #pragma GCC target( sse3 , sse2 , sse ) #pragma GCC target( avx , sse4 , sse4.1 , sse4.2 , ssse3 ) #pragma GCC target( f16c ) #pragma GCC optimize( inline , fast-math , unroll-loops , no-stack-protector ) #pragma GCC push_options #pragma GCC pop_options #pragma GCC reset_options #pragma GCC optimize( O3 ) const double eps = 1e-9; const int INFMEM = 63; const int INF = 1061109567; const long long LINF = 4557430888798830399LL; const double DINF = numeric_limits<double>::infinity(); const long long MOD = 1000000007; const int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1}; const int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1}; const double PI = 3.141592653589793; inline void fastll(long long &input_number) { input_number = 0; int ch = getchar_unlocked(); int sign = 1; while (ch < 0 || ch > 9 ) { if (ch == - ) sign = -1; ch = getchar_unlocked(); } while (ch >= 0 && ch <= 9 ) { input_number = (input_number << 3) + (input_number << 1) + ch - 0 ; ch = getchar_unlocked(); } input_number *= sign; } inline void open(string a) { freopen((a + .in ).c_str(), r , stdin); freopen((a + .out ).c_str(), w , stdout); } inline void fasterios() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } long long n, q; long long isi[200005]; long long sufmax[200005]; pair<long long, long long> forced[200005]; int main() { fasterios(); memset(forced, -1, sizeof(forced)); memset(sufmax, -1, sizeof(sufmax)); cin >> n; for (int i = 1; i <= n; i++) cin >> isi[i]; cin >> q; for (int i = 1; i <= n; i++) forced[i] = {isi[i], 0}; for (int i = 1; i <= q; i++) { long long t; cin >> t; if (t == 1) { long long pos, val; cin >> pos >> val; forced[pos] = {val, i}; } else { long long val; cin >> val; sufmax[i] = val; } } for (int i = q - 1; i >= 0; i--) sufmax[i] = max(sufmax[i], sufmax[i + 1]); for (int i = 1; i <= n; i++) { cout << max(forced[i].first, sufmax[forced[i].second]) << n [i == n]; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> inline int Chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; } template <typename T> inline int Chkmin(T &a, T b) { return a > b ? a = b, 1 : 0; } template <typename T> inline T read() { T sum = 0, fl = 1; char ch = getchar(); for (; !isdigit(ch); ch = getchar()) if (ch == - ) fl = -1; for (; isdigit(ch); ch = getchar()) sum = (sum << 3) + (sum << 1) + ch - 0 ; return sum * fl; } inline void proc_status() { ifstream t( /proc/self/status ); cerr << string(istreambuf_iterator<char>(t), istreambuf_iterator<char>()) << endl; } const int Maxn = 100000 + 100; int N, Stack[Maxn], top; pair<long long, long long> A[Maxn]; inline double get_slope(pair<long long, long long> a, pair<long long, long long> b) { return (double)(b.second - a.second) / (b.first - a.first); } inline void Solve() { sort(A + 1, A + N + 1); int tot = 0; A[N + 1].first = 1e7; for (int i = 1; i <= N; ++i) if (A[i].first != A[i + 1].first) A[++tot] = A[i]; for (int i = 1; i <= tot; ++i) { while (top >= 2 && get_slope(A[i], A[Stack[top]]) >= get_slope(A[i], A[Stack[top - 1]])) --top; Stack[++top] = i; } cout << top - 1 << endl; } inline void Input() { N = read<int>(); for (int i = 1; i <= N; ++i) A[i].first = read<long long>(), A[i].second = read<long long>() - A[i].first * A[i].first; } int main() { Input(); Solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, k, m; cin >> n >> k >> m; vector<string> words; words.push_back( ____jj ); long long cost[n + 1]; unordered_map<string, long long> u; for (int i = 0; i < n; ++i) { string h; cin >> h; words.push_back(h); } for (int i = 1; i <= n; ++i) { cin >> cost[i]; } for (int i = 1; i <= n; ++i) { u[words[i]] = cost[i]; } for (int i = 1; i <= k; i++) { int j; cin >> j; int arr[j + 1]; long long min = 0; long long min_ind = 0; for (int l = 1; l <= j; l++) { cin >> arr[l]; if (cost[arr[l]] < min) { min = cost[arr[l]]; min_ind = arr[l]; } if (min == 0) { min = cost[arr[l]]; min_ind = arr[l]; } } for (int p = 1; p <= j; ++p) { u[words[arr[p]]] = cost[min_ind]; } } long long tot_cost = 0; for (int i = 0; i < m; ++i) { string d; cin >> d; tot_cost += u[d]; } cout << tot_cost << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long sz = 2 * 1e5 + 5, mod = 1e9 + 7; vector<long long> adj[sz]; long long dp[sz][2], x[sz]; void dfs(long long v, long long p) { dp[v][x[v]] = 1; for (auto u : adj[v]) { if (u == p) continue; dfs(u, v); dp[v][1] = (dp[v][1] * dp[u][1] + dp[v][1] * dp[u][0] + dp[v][0] * dp[u][1]) % mod; dp[v][0] = (dp[v][0] * dp[u][1] + dp[v][0] * dp[u][0]) % mod; } } int main() { long long n, u, i; cin >> n; for (i = 1; i < n; i++) { cin >> u; adj[u].push_back(i); } for (i = 0; i < n; i++) cin >> x[i]; dfs(0, -1); cout << dp[0][1] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; map<tuple<unsigned long, int, int>, pair<long long, long long> > m; pair<long long, long long> zml(long long x, bitset<10> s, int p, int k, bool limit) { if (int(s.count()) > k) return {0, 0}; if (p == -1) return {1, 0}; if (s.count() == 1 && s[0]) s.reset(); if (!limit && m.count({s.to_ulong(), p, k})) return m[{s.to_ulong(), p, k}]; long long r = 1; for (int i = 0; i < p; i++) r *= 10; long long y = x / r; long long ret1 = 0; long long ret2 = 0; for (int i = 0; i <= y; i++) { bitset<10> t = s; t[i] = 1; pair<long long, long long> z = zml(i == y ? x - y * r : r - 1, t, p - 1, k, limit && i == y); ret1 += z.first; ret1 %= mod; ret2 += z.second; ret2 %= mod; ret2 += z.first * (((r % mod) * i) % mod); ret2 %= mod; } if (!limit) return m[{s.to_ulong(), p, k}] = {ret1, ret2}; else return {ret1, ret2}; } int main() { long long l, r; int k; cin >> l >> r >> k; cout << (zml(r, bitset<10>(), 18, k, 1).second - zml(l - 1, bitset<10>(), 18, k, 1).second + mod) % mod << endl; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:102400000,102400000 ) using namespace std; const int maxn = 1e3 + 10; const int inf = 0x7fffffff; const long long INF = 9E18; const int mod = 1e9 + 7; const long long mod2 = 1e9 + 9; const double eps = 1e-7; const double pi = acos(-1.0); template <typename T> inline bool read(T &x) { T f = 1; char ch = getchar(); if (ch == EOF) return false; for (; ch < 0 || ch > 9 ; ch = getchar()) if (ch == - ) f = -1; for (x = 0; ch >= 0 && ch <= 9 ; ch = getchar()) x = x * 10 + ch - 0 ; x *= f; return true; } int dcmp(double x) { return fabs(x) <= eps ? 0 : (x > 0 ? 1 : -1); } int main() { int test; cin >> test; while (test--) { double x; cin >> x; if (dcmp(x) == 0) cout << Y 0 0 << endl; else { if (x * x - 4 * x < 0) cout << N << endl; else { double res = (x + sqrt(x * x - 4 * x)) / 2; double a = x / res; cout << fixed << setprecision(10) << Y << a << << res << endl; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> inline void read(T &x) { bool b = 0; char c; while (!isdigit(c = getchar()) && c != - ) ; if (c == - ) c = getchar(), b = 1; x = c - 48; while (isdigit(c = getchar())) x = (x << 3) + (x << 1) + c - 48; if (b) x = -x; } template <typename T> inline void wrip(T x) { if (x > 9) wrip(x / 10); putchar(x % 10 + 48); } template <typename T> inline void write(T x) { if (x < 0) putchar( - ), x = -x; wrip(x); putchar( ); } template <typename T> inline void writeln(T x) { if (x < 0) putchar( - ), x = -x; wrip(x); putchar( n ); } inline char readch() { char c; do c = getchar(); while (c == n || c == ); return c; } inline void reads(string &s) { char c; while ((c = getchar()) == || c == n ) ; s = c; while ((c = getchar()) != && c != n && c != EOF) s += c; } inline void getlines(string &s) { char c; while ((c = getchar()) == n ) ; s = c; while ((c = getchar()) != n ) s += c; } const long double pi = acos(-1); const int inf = 1e9, mod = 1e9 + 7, N = 1e6 + 11; int n; long long m, a[N], cnt[N], pwm[N]; inline long long pw(long long a, long long b) { long long res = 1; while (b) { if (b % 2) res = res * a % mod; a = a * a % mod; b /= 2; } return res; } int main() { int ntest; read(ntest); while (ntest--) { read(n); read(m); for (int i = 1; i <= n; i++) read(a[i]); if (m == 1) { if (n % 2) cout << 1 << n ; else cout << 0 << n ; continue; } for (int i = 1; i <= n; i++) cnt[a[i]]++; sort(a + 1, a + n + 1); n = unique(a + 1, a + n + 1) - a - 1; reverse(a + 1, a + n + 1); long long lim = 2e6, res = 0; long long Max = 0; pwm[0] = 1; for (int i = 1; i <= 1e6; i++) { pwm[i] = pwm[i - 1] * m; if (pwm[i] >= 1e7) { Max = i; break; } } for (int i = 1; i <= n; i++) { if (cnt[a[i]] % 2 == 0) continue; long long num = 1, sum = 0; for (int j = i + 1; j <= n; j++) { num *= pwm[min(Max, a[j - 1] - a[j])]; if (num <= cnt[a[j]]) { cnt[a[j]] -= num; goto line0; } sum = (sum + pw(m, a[j]) * cnt[a[j]]) % mod; num -= cnt[a[j]]; cnt[a[j]] = 0; if (num >= lim) break; } for (int j = i + 1; j <= n; j++) if (cnt[a[j]]) sum = (sum + pw(m, a[j]) * cnt[a[j]]) % mod; res = (pw(m, a[i]) - sum + mod) % mod; break; line0:; } for (int i = 1; i <= n; i++) cnt[a[i]] = 0; cout << res << n ; } } |
#include <bits/stdc++.h> #pragma comment(linker, /stack:640000000 ) using namespace std; int fx[] = {0, 0, -1, 1, -1, 1, 1, -1}; int fy[] = {1, -1, 0, 0, 1, 1, -1, -1}; struct debugger { template <typename T> debugger& operator,(const T& v) { cerr << v << ; return *this; } } dbg; const int N = (int)3e5; int a[N], b[N], c[N], d[N], n, b1[N], c1[N]; int bits[32][N], k[32]; bool valid() { memset(bits, 0, sizeof(bits)); for (int i = 0; i < 31; i++) { for (int j = 0; j < n; j++) { if (a[j] < 0) return false; if (a[j] & (1 << i)) bits[i][j] = 1; else bits[i][j] = 0; } } memset(k, 0, sizeof(k)); for (int i = 0; i < 31; i++) { for (int j = 0; j < n; j++) { k[i] += bits[i][j]; } } memset(b1, 0, sizeof(b1)); memset(c1, 0, sizeof(c1)); for (int i = 0; i < 31; i++) { for (int j = 0; j < n; j++) { int _b = bits[i][j] ? k[i] : 0; int _c = bits[i][j] ? n : k[i]; b1[j] += _b << i; c1[j] += _c << i; } } for (int i = 0; i < n; i++) { if (b[i] != b1[i] || c[i] != c1[i]) return false; } return true; } int main() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &b[i]); for (int i = 0; i < n; i++) scanf( %d , &c[i]); long long int sum = 0LL; for (int i = 0; i < n; i++) { d[i] = b[i] + c[i]; sum += (long long int)d[i]; } sum /= (2 * n); for (int i = 0; i < n; i++) a[i] = (d[i] - sum) / n; if (!valid()) printf( -1 n ); else { for (int i = 0; i < n; i++) printf( %d , a[i]); printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; string proc(char *a) { int n = strlen(a); char s[100]; int i = 0, j = 0; while (i < n) { if (a[i] == u ) s[j++] = o , s[j++] = o ; else s[j++] = a[i]; i++; } s[j] = 0 ; strcpy(a, s); n = j; i = j = 0; while (i < n) { if (i < n - 1 && a[i] == a[i + 1] && a[i] == o ) s[j++] = u , i += 2; else s[j++] = a[i++]; } s[j] = 0 ; strcpy(a, s); n = j; i = j = 0; while (i < n) { int t = i; if (a[i] == k ) { while (a[i] == k && i < n) i++; if (a[i] == h ) s[j++] = h , i++; else { while (t < i) s[j++] = k , t++; s[j++] = a[i++]; } } else s[j++] = a[i++]; } s[j] = 0 ; return string(s); } int main() { int n; cin >> n; cin.ignore(); char a[1000][100]; vector<string> ret; for (int i = 0; i < n; i++) { cin.getline(a[i], 100); ret.push_back(proc(a[i])); } sort(ret.begin(), ret.end()); int ans = 0; int i = 0; while (i < n) { int t = i + 1; while (t < n && ret[i] == ret[t]) t++; ans++; i = t; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = (int)1e9 + 7; const int INF = (int)1e9; const long long LINF = (long long)1e18; const long double PI = acos((long double)-1); const long double EPS = 1e-9; inline long long gcd(long long a, long long b) { long long r; while (b) { r = a % b; a = b; b = r; } return a; } inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } inline long long fpow(long long n, long long k, int p = MOD) { long long r = 1; for (; k; k >>= 1) { if (k & 1) r = r * n % p; n = n * n % p; } return r; } template <class T> inline int chkmin(T& a, const T& val) { return val < a ? a = val, 1 : 0; } template <class T> inline int chkmax(T& a, const T& val) { return a < val ? a = val, 1 : 0; } template <class T> inline T isqrt(T k) { T r = sqrt(k) + 1; while (r * r > k) r--; return r; } template <class T> inline T icbrt(T k) { T r = cbrt(k) + 1; while (r * r * r > k) r--; return r; } inline void addmod(int& a, int val, int p = MOD) { if ((a = (a + val)) >= p) a -= p; } inline void submod(int& a, int val, int p = MOD) { if ((a = (a - val)) < 0) a += p; } inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; } inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); } int n, a, b, k; string s; void solve() { cin >> n >> a >> b >> k >> s; vector<pair<int, int> > v; int st = -1; for (int i = (0); i < (n); i++) { if (s[i] == 1 ) { if (st != -1) { v.push_back(make_pair(st, i - st)); st = -1; } } else if (st == -1) { st = i; } } if (st != -1) { v.push_back(make_pair(st, n - st)); } long long can = 0; for (int i = (0); i < (int((v).size())); i++) { can += v[i].second / b; } long long tot = can - a + 1; vector<int> ans; for (int i = 0; i < int((v).size()) && tot > 0; i++) { int st = v[i].first; int len = v[i].second; for (int j = st; tot > 0 && j + b - 1 <= st + len - 1; j += b) { ans.push_back(j + b - 1); tot--; } } cout << int((ans).size()) << n ; for (int i = (0); i < (int((ans).size())); i++) cout << ans[i] + 1 << n [i == int((ans).size()) - 1]; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 3000 + 10; int ans[maxn][maxn]; int N, M, K; set<pair<pair<int, int>, int> > seti; queue<pair<int, int> > qu; vector<int> ve[maxn]; pair<int, int> prv[maxn][maxn]; void BFS() { ans[0][0] = 1; prv[0][0] = make_pair(0, 0); qu.push(make_pair(0, 0)); while (qu.size() > 0) { pair<int, int> id = qu.front(); qu.pop(); for (int i = 0; i < ve[id.second].size(); i++) { if (seti.find(make_pair(make_pair(id.first, id.second), ve[id.second][i])) == seti.end() && ans[id.second][ve[id.second][i]] == 0) { ans[id.second][ve[id.second][i]] = ans[id.first][id.second] + 1; prv[id.second][ve[id.second][i]] = make_pair(id.first, id.second); qu.push(make_pair(id.second, ve[id.second][i])); } } } } int main() { cin >> N >> M >> K; while (M--) { int u, v; cin >> u >> v; u--, v--; ve[u].push_back(v), ve[v].push_back(u); } while (K--) { int a, b, c; cin >> a >> b >> c; a--, b--, c--; seti.insert(make_pair(make_pair(a, b), c)); } BFS(); for (int i = 0; i < N; i++) ve[i].clear(); int way = 1000 * 1000 * 1000; int fir = -1, sec = -1; for (int i = 0; i < N; i++) { if (ans[i][N - 1] != 0 && ans[i][N - 1] < way) { fir = i, sec = N - 1; way = ans[i][N - 1]; } } if (fir == -1) { cout << -1; return 0; } cout << way - 1 << n ; vector<int> path; while (fir != 0 && (way--) > 0) { path.push_back(sec); pair<int, int> prev = prv[fir][sec]; sec = prev.second; fir = prev.first; } if (sec != 0) path.push_back(sec); path.push_back(fir); while (path.size() > 0) { cout << path.back() + 1 << ; path.pop_back(); } } |
#include <bits/stdc++.h> const int inf = 1e9 + 7; const int mod = 1e9 + 7; using namespace std; int main() { long long N; cin >> N; long long cnt = 1; long long now = 10; while (now <= N) { now *= 10; cnt++; } long long ans = (cnt - 1) * 9; long long n = cnt - 1; long long sum = 0; while (n--) { sum = sum * 10 + 9; } sum = N - sum; while (sum) { ans += sum % 10; sum /= 10; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); long long int n; char c; cin >> n >> c; n--; if (n % 4 >= 2) n -= 2; long long int ans = n / 4 * 16; n %= 4; ans += n * 7; n %= 2; if (c >= d ) ans += g - c; else ans += c - a + 4; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int ar[100001]; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n, cur = 0; string s; cin >> n; cin >> s; for (int i = 0; i < n; i++) { cin >> ar[i]; } for (int i = 0; i < 10000000; i++) { if (s[cur] == < ) { cur -= ar[cur]; } else { cur += ar[cur]; } if (cur < 0 || cur >= n) { cout << FINITE ; return 0; } } cout << INFINITE ; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> adj[200005]; vector<int> toposort; bool color[200005]; bool visit[200005]; bool flag; int mp[200005]; void topo(int index) { color[index] = true; for (int i = 0; i < adj[index].size(); i++) { int next = adj[index][i]; if (color[next] == true) { flag = true; return; } if (!visit[next]) { visit[next] = true; topo(next); } } color[index] = false; toposort.push_back(index); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) { int n, m; cin >> n >> m; memset(visit, 0, sizeof(visit)); memset(color, 0, sizeof(color)); memset(mp, 0, sizeof(mp)); flag = false; vector<int> unx; vector<int> uny; vector<int> dix, diy; toposort.clear(); for (int i = 0; i < m; i++) { int op, x, y; cin >> op >> x >> y; if (op == 1) { adj[x].push_back(y); dix.push_back(x); diy.push_back(y); } else { unx.push_back(x); uny.push_back(y); } } for (int i = 1; i <= n; i++) { if (!visit[i]) { topo(i); } adj[i].clear(); } if (flag) { cout << NO << endl; continue; } reverse(toposort.begin(), toposort.end()); for (int i = 0; i < toposort.size(); i++) { mp[toposort[i]] = i; } cout << YES << endl; for (int i = 0; i < dix.size(); i++) { cout << dix[i] << << diy[i] << endl; } for (int i = 0; i < unx.size(); i++) { if (mp[unx[i]] < mp[uny[i]]) { cout << unx[i] << << uny[i] << endl; } else { cout << uny[i] << << unx[i] << endl; } } } } |
#include <bits/stdc++.h> using namespace std; int ch[42][42][42][42], qs[42][42], ans[42][42][42][42]; int b[42][42], cou[42][42]; char a[42]; int main() { int n, m, q, i, j, ii, jj; scanf( %d %d %d , &n, &m, &q); for (i = 1; i <= n; i++) { scanf( %s , a + 1); for (j = 1; j <= m; j++) if (a[j] == 1 ) b[i][j] = 1; } for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { qs[i][j] = b[i][j] + qs[i - 1][j] + qs[i][j - 1] - qs[i - 1][j - 1]; } } for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { if (b[i][j] == 1) continue; for (ii = 1; ii <= i; ii++) { for (jj = 1; jj <= j; jj++) { if (qs[i][j] - qs[i][jj - 1] - qs[ii - 1][j] + qs[ii - 1][jj - 1] == 0) ch[i][j][ii][jj] = 1; ch[i][j][ii][jj] += ch[i][j][ii][jj - 1]; ch[i][j][ii][jj] += ch[i][j][ii - 1][jj]; ch[i][j][ii][jj] -= ch[i][j][ii - 1][jj - 1]; } } } } for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { for (ii = 1; ii <= i; ii++) { for (jj = 1; jj <= j; jj++) { ans[i][j][ii][jj] = ch[i][j][i][j] - ch[i][j][ii - 1][j] - ch[i][j][i][jj - 1] + ch[i][j][ii - 1][jj - 1]; } } } } for (ii = 1; ii <= n; ii++) { for (jj = 1; jj <= m; jj++) { for (i = 1; i <= ii; i++) { for (j = 1; j <= jj; j++) { ans[ii][jj][i][j] += ans[ii - 1][jj][i][j]; ans[ii][jj][i][j] += ans[ii][jj - 1][i][j]; ans[ii][jj][i][j] -= ans[ii - 1][jj - 1][i][j]; } } } } while (q--) { scanf( %d %d %d %d , &i, &j, &ii, &jj); printf( %d n , ans[ii][jj][i][j] - ans[ii][j - 1][i][j] - ans[i - 1][jj][i][j] + ans[i - 1][j - 1][i][j]); } return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; const int MOD = 1000000007; vector<pii> ree; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; for (int i = (0); i < (n); i++) { int x, v; cin >> x >> v; ree.push_back({x + v, x - v}); } sort(ree.begin(), ree.end()); int cl = -2e9, a = 0; for (int i = (0); i < (n); i++) if (cl <= ree[i].second) cl = ree[i].first, a++; cout << a << endl; } |
#include <bits/stdc++.h> using namespace std; template <typename T> ostream& operator<<(ostream& stream, const pair<T, T>& p) { return stream << ( << p.first << , << p.second << ) ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int T; cin >> T; while (T--) { int i, j, n; cin >> n; long long a[n]; for (i = 0; i < n; i++) { cin >> a[i]; } long long mx = a[0], mxdiff = a[0] - a[1]; for (i = 1; i < n; i++) { if (mx - a[i] > mxdiff) mxdiff = mx - a[i]; mx = max(mx, a[i]); } if (mxdiff > 0) cout << (long long)(log2f(mxdiff)) + 1 << n ; else cout << 0 << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; int a[maxn]; vector<int> b; int n; void get_input() { cin >> n; } void solve() { for (int i = 0; i < n; i++) { cin >> a[i]; b.push_back(a[i]); } sort(b.begin(), b.begin() + n); int cnt = 0; for (int i = 0; i < n; i++) { if (b[i] != a[i]) { cnt++; } } cout << (cnt > 2 ? NO : YES ); } void output() {} int main() { ios ::sync_with_stdio(0), cin.tie(0), cout.tie(0); int t = 1; while (t--) { get_input(), solve(), output(); } return 0; } |
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = -1; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + ch - 48; ch = getchar(); } return x * f; } int n, m, W; int w[100010], b[100010]; int f[1010]; vector<int> v[1010]; int find(int x) { if (x == f[x]) return x; f[x] = find(f[x]); return f[x]; } int dp[1010]; int main() { n = read(), m = read(), W = read(); for (int i = 1; i <= n; ++i) w[i] = read(); for (int i = 1; i <= n; ++i) b[i] = read(); for (int i = 1; i <= n; ++i) f[i] = i; for (int i = 1; i <= m; ++i) { int u = read(), v = read(); f[find(u)] = find(v); } int tot = n; for (int i = 1; i <= n; ++i) v[find(i)].push_back(i); for (int i = 1; i <= n; ++i) { int len = v[i].size() - 1; int ww = 0, bb = 0; if (len < 0) continue; for (int j = 0; j <= len; ++j) ww += w[v[i][j]], bb += b[v[i][j]]; if (len > 0) { if (ww > W) continue; v[i].push_back(++tot); w[tot] = ww, b[tot] = bb; } } for (int i = 1; i <= n; ++i) { int len = v[i].size() - 1; if (len < 0) continue; for (int j = W; j >= 0; --j) { for (int k = 0; k <= len; ++k) { int x = v[i][k]; if (j >= w[x]) dp[j] = max(dp[j], dp[j - w[x]] + b[x]); } } } int ans = 0; for (int i = 1; i <= W; ++i) ans = max(ans, dp[i]); printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; long long int power(long long int base, long long int exp) { long long int res = 1; base = base % 1000000007; while (exp) { if (exp & 1) res = (res * base) % 1000000007; base = (base * base) % 1000000007; exp >>= 1; } return res; } int main() { long long int n; scanf( %lld , &n); if (n == 0) printf( 1 n ); else printf( %lld n , power(2, n - 1) * (power(2, n) + 1) % 1000000007); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; ; vector<int> a(n); int m = 1000; for (__typeof(0) i = 0; i < n; i++) { cin >> a[i]; m = min(a[i], m); } int minc = 0; for (__typeof(0) i = 0; i < n; i++) minc += (a[i] == m); if (minc > n / 2) cout << Bob n ; else cout << Alice n ; return 0; } |
#include <bits/stdc++.h> char now[100], s[20][100]; int ans, n, m, a[20]; bool check() { for (int i = 1; i <= m; i++) { int sum = 0; for (int j = 0; j < n; j++) sum += now[j] != s[i][j]; if (sum != a[i]) return (false); } return (true); } void dfs(int x, int y) { if (y == a[1]) { ans += check(); return; } for (int i = x; i < n; i++) { now[i] = 1 - s[1][i] + 0 ; dfs(i + 1, y + 1); now[i] = s[1][i]; } } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) scanf( %s%d , s[i], &a[i]); for (int i = 0; i < n; i++) now[i] = s[1][i]; dfs(0, 0); printf( %d n , ans); return (0); } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; inline int yes(int x) { return x * 2; } inline int no(int x) { return x * 2 + 1; } vector<int> E1[210], E2[210]; inline void build(int x, int y) { E1[x].push_back(y); E2[y].push_back(x); } bool vis[210]; bool vis2[210]; vector<int> ord; int scc[210]; int nid = 0; int cho[210]; bool ok = 1; void dfs2(int x) { vis2[x] = 1; for (auto i : E2[x]) { if (!vis2[i]) dfs2(i); } } void dfs1(int x) { vis[x] = 1; for (auto i : E1[x]) { if (!vis[i]) dfs1(i); } if (!vis2[x]) { cho[x] = 1; dfs2(x ^ 1); if (vis2[x]) { ok = 0; } } } int main() { ios::sync_with_stdio(false); cin.tie(0); ; int n, m; cin >> n >> m; for (int i = 0, a, b, c; i < m; i++) { cin >> a >> b >> c; if (c) { build(yes(a), yes(b)); build(no(a), no(b)); build(no(b), no(a)); build(yes(b), yes(a)); } else { build(no(a), yes(b)); build(no(b), yes(a)); build(yes(b), no(a)); build(yes(a), no(b)); } } for (int i = 1; i <= 2 * n; i++) { if (!vis[i]) dfs1(i); } if (!ok) { cout << Impossible n ; return 0; } vector<int> ans; for (int i = 1; i <= n; i++) { if (cho[yes(i)] == 1) { ans.push_back(i); } } cout << ans.size() << n ; for (auto i : ans) { cout << i << ; } cout << n ; } |
#include <bits/stdc++.h> using namespace std; int mo[10]; int main() { int n; scanf( %d , &n); int a[n + 1]; for (int i = int(0); i <= int(n - 1); i++) { scanf( %d , a + i); } sort(a, a + n); a[0] = 1; for (int i = int(1); i <= int(n - 1); i++) { if (a[i] > a[i - 1]) a[i] = a[i - 1] + 1; else a[i] = a[i - 1]; } printf( %d n , a[n - 1] + 1); } |
#include <bits/stdc++.h> using namespace std; const int maxn = 15; const int maxe = 1086 * 1086 * 4; const int mod = 1000000007; const double eps = 1e-6; char s[maxn][maxn]; int n = 10; bool is_x(int x, int y) { if (x < 0 || x >= n || y < 0 || y >= n) return false; return s[x][y] == X ; } bool check(int x, int y) { int cnt = 0; for (int i = x; i < n; i++) if (is_x(i, y)) cnt++; else break; ; for (int i = x - 1; i >= 0; i--) if (is_x(i, y)) cnt++; else break; ; if (cnt >= 5) return true; cnt = 0; for (int i = y; i < n; i++) if (is_x(x, i)) cnt++; else break; ; for (int i = y - 1; i >= 0; i--) if (is_x(x, i)) cnt++; else break; ; if (cnt >= 5) return true; cnt = 0; for (int i = 0; i < n; i++) if (is_x(x + i, y + i)) cnt++; else break; ; for (int i = -1; i >= -n; i--) if (is_x(x + i, y + i)) cnt++; else break; ; if (cnt >= 5) return true; cnt = 0; for (int i = 0; i < n; i++) if (is_x(x + i, y - i)) cnt++; else break; ; for (int i = -1; i >= -n; i--) if (is_x(x + i, y - i)) cnt++; else break; ; if (cnt >= 5) return true; return false; } int main() { n = 10; for (int i = 0; i < n; i++) scanf( %s , s[i]); for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) { if (s[i][j] == . ) { s[i][j] = X ; if (check(i, j)) { puts( YES ); return 0; } s[i][j] = . ; } } puts( NO ); } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, l = 1; cin >> n; for (long long int i = 1; i < n; i++) { l += i; if (l > n) { l -= n; } cout << l << ; } } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, m, i, j, k, l, p = 0, q, x, y, z; scanf( %lld %lld %lld %lld , &n, &m, &k, &l); x = l * 2; x = min(x, n); i = x / 2; for (; i >= 0; i--) { x = i * 2; x = n - x; x = min(x, k); for (j = x; j >= 0; j--) { y = (i * 2) + j; y = n - y; y *= 2; if (y <= m) p++; } } printf( %lld , p); } |
#include <bits/stdc++.h> using namespace std; int f[305][305][305]; int p[305][305]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) scanf( %d , &p[i][j]); f[0][0][0] = p[0][0]; for (int x1 = 0; x1 < n; x1++) for (int y1 = 0; y1 < n; y1++) if (x1 + y1 != 0) for (int x2 = 0; x2 < n; x2++) { f[x1][y1][x2] = -1 << 30; int y2 = x1 + y1 - x2; int add; if (x1 == x2 && y1 == y2) add = p[x1][y1]; else add = p[x1][y1] + p[x2][y2]; if (x1 - 1 >= 0 && x2 - 1 >= 0) { f[x1][y1][x2] = max(f[x1][y1][x2], f[x1 - 1][y1][x2 - 1] + add); } if (x1 - 1 >= 0 && y2 - 1 >= 0) { f[x1][y1][x2] = max(f[x1][y1][x2], f[x1 - 1][y1][x2] + add); } if (y1 - 1 >= 0 && x2 - 1 >= 0) { f[x1][y1][x2] = max(f[x1][y1][x2], f[x1][y1 - 1][x2 - 1] + add); } if (y1 - 1 >= 0 && y2 - 1 >= 0) { f[x1][y1][x2] = max(f[x1][y1][x2], f[x1][y1 - 1][x2] + add); } } printf( %d n , f[n - 1][n - 1][n - 1]); } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 5100; int n, T; int pr[MAXN], t[MAXN]; double rest[MAXN]; double dp[MAXN][MAXN]; double pw[MAXN]; int main() { ios_base::sync_with_stdio(false); cin >> n >> T; for (int i = 1; i <= n; ++i) { cin >> pr[i] >> t[i]; double mult = (100. - pr[i]) / 100.; rest[i] = 1.; for (int k = 1; k < t[i]; ++k) { rest[i] *= mult; if (rest[i] < 1e-15) { rest[i] = 0.; } } } dp[0][0] = 1.; for (int i = 1; i <= n; ++i) { if (t[i] == 1) { for (int j = 1; j <= T; ++j) { dp[i][j] = dp[i - 1][j - 1]; } } else { double p = pr[i] / 100., q = 1 - p; double cur_val = 0.; double last_prob = p; { double tmp = q; int pw = t[i] - 2; while (pw) { if (pw & 1) { last_prob *= tmp; } pw /= 2; tmp *= tmp; } if (last_prob < 1e-15) { last_prob = 0.; } } for (int j = 1, r = 0; j <= T; ++j) { if (j > r + (t[i] - 1)) { cur_val -= dp[i - 1][r] * last_prob; ++r; } cur_val *= q; cur_val += p * dp[i - 1][j - 1]; dp[i][j] = cur_val; if (j >= t[i]) { dp[i][j] += rest[i] * dp[i - 1][j - t[i]]; } if (dp[i][j] < 1e-15) { dp[i][j] = 0.; } } } } double res = 0.; for (int i = 1; i < n; ++i) { pw[1] = 1; double q = (100. - pr[i + 1]) / 100.; for (int j = 2; j <= t[i + 1]; ++j) { pw[j] = pw[j - 1] * q; if (pw[j] < 1e-15) { pw[j] = 0.; } } for (int j = t[i + 1] + 1; j <= T; ++j) { pw[j] = 0.; } for (int j = 1; j <= T; ++j) { res += i * dp[i][j] * pw[T + 1 - j]; } } for (int j = 1; j <= T; ++j) { res += n * dp[n][j]; } cout << fixed << setprecision(10); cout << res << n ; return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /stack:67108864 ) using namespace std; template <class T> T abs(T a) { return (a) > 0 ? (a) : -(a); } template <class T> T sqr(T a) { return (a) * (a); } const long double PI = 3.1415926535897932, EPS = 1E-9; const int INF = 1000 * 1000 * 1000, NMAX = 16; int n, m; int sldknfhskjdf = 0; int a[NMAX][NMAX]; int result = 0; int answer[NMAX][NMAX]; int dx[4][5] = { {0, 1, 1, 1, 2}, {0, 0, 0, 1, 2}, {0, 1, 1, 1, 2}, {0, 1, 2, 2, 2}}; int dy[4][5] = { {0, 0, 1, 2, 0}, {0, 1, 2, 1, 1}, {2, 0, 1, 2, 2}, {1, 1, 0, 1, 2}}; void brute(int x, int y) { if (x == n) { if (sldknfhskjdf > result) { result = sldknfhskjdf; memcpy(answer, a, sizeof(a)); } return; } if (y >= m) { brute(x + 1, 0); return; } if (sldknfhskjdf + (m - y + m * (n - x - 1)) / 5 <= result) return; for (int idx = 0; idx < int(4); ++idx) { bool can = true; for (int i = 0; i < int(5); ++i) { int nx = x + dx[idx][i]; int ny = y + dy[idx][i]; if (nx < 0 || nx >= n || ny < 0 || ny >= m || a[nx][ny] != 0) { can = false; break; } } if (can) { ++sldknfhskjdf; for (int i = 0; i < int(5); ++i) { int nx = x + dx[idx][i]; int ny = y + dy[idx][i]; a[nx][ny] = sldknfhskjdf; } brute(x, y + 1); for (int i = 0; i < int(5); ++i) { int nx = x + dx[idx][i]; int ny = y + dy[idx][i]; a[nx][ny] = 0; } --sldknfhskjdf; } } brute(x, y + 1); } int main() { for (int i = 0; i < int(NMAX); ++i) for (int j = 0; j < int(NMAX); ++j) { a[i][j] = 0; } for (int i = 0; i < int(NMAX); ++i) for (int j = 0; j < int(NMAX); ++j) { answer[i][j] = 0; } cin >> n >> m; const string h = 13 nA.BBB.C.. nAAABCCCD. nA.EB.FCD. nEEEFFFDDD nG.E.HFIII nGGGJHHHI. nGK.JHL.IM n.KJJJLMMM nKKK.LLL.M n ; if (n == 9 && m == 9) { cout << h; return 0; } brute(0, 0); cout << result << endl; for (int i = 0; i < int(n); ++i) { for (int j = 0; j < int(m); ++j) { if (answer[i][j] == 0) { cout << . ; } else { cout << char( A + answer[i][j] - 1); } } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 1e9 + 9; int n, vl, ans, tmp[110000], ret[110000]; void redo(vector<int>& a) { int i, j, s, p, q, nn = 0; for (i = 0; i < a.size(); i++) { if (nn == 0 || a[nn - 1] < a[i]) a[nn++] = a[i]; } a.resize(nn); } void dfs(int id, vector<int>& a, int now) { int i, j, s, p, q; if (ans <= now) return; for (i = 0; i < a.size(); i++) { if (a[i] != 0) break; } if (i >= a.size()) { ans = now; for (i = 0; i < now; i++) ret[i] = tmp[i]; return; } if (id >= 18) return; bool you = false; for (i = 0; i < a.size(); i++) { if (abs(a[i]) & (1 << id)) { you = true; break; } } if (!you) dfs(id + 1, a, now); else { vector<int> na; na.resize(a.size()); tmp[now] = (1 << id); for (i = 0; i < a.size(); i++) { if (abs(a[i]) & (1 << id)) na[i] = a[i] - (1 << id); else na[i] = a[i]; } sort(na.begin(), na.end()); redo(na); dfs(id + 1, na, now + 1); tmp[now] = -(1 << id); na.resize(a.size()); for (i = 0; i < a.size(); i++) { if (abs(a[i]) & (1 << id)) na[i] = a[i] + (1 << id); else na[i] = a[i]; } sort(na.begin(), na.end()); redo(na); dfs(id + 1, na, now + 1); } } int main() { vector<int> a; a.clear(); scanf( %d , &n); int i, j, s, p, q; for (i = 0; i < n; i++) { scanf( %d , &vl); a.push_back(vl); } sort(a.begin(), a.end()); redo(a); ans = inf; dfs(0, a, 0); printf( %d n , ans); for (i = 0; i < ans; i++) printf( %d , ret[i]); printf( n ); return 0; } |
#include <bits/stdc++.h> int main() { int T; scanf( %d , &T); while (T--) { int n; scanf( %d , &n); int sum = 0; for (int i = 0; i < n; i++) { int t; scanf( %d , &t); if (t <= 2048) { sum += t; } } printf( %s n , sum >= 2048 ? YES : NO ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; string colours; cin >> n >> colours; string collec[] = { RGB , RBG , BRG , BGR , GRB , GBR }; int index; int max = INT_MAX; for (int i = 0; i < 6; i++) { int count = 0; for (int j = 0; j < n; j++) { if (colours[j] != collec[i][j % 3]) count++; } if (count < max) { max = count; index = i; } } cout << max << endl; for (int i = 0; i < n; i++) cout << collec[index][i % 3]; } |
#include <bits/stdc++.h> using namespace std; string s[51]; int main() { int tot = 1; cin >> s[1]; int len = s[1].size(); for (int i = 2; i <= s[1].size(); i += 1) { s[i] = s[i - 1]; string ss; ss.resize(1); ss[0] = s[i][len - 1]; s[i].insert(0, ss); s[i].erase(len, 1); int add = 1; for (int j = 1; j < i; j += 1) if (s[i] == s[j]) add = 0; tot += add; } printf( %d , tot); return 0; } |
/** * created: 05/04/2021, 13:22:49 **/ #include <bits/stdc++.h> using namespace std; const int max_n = 6066, inf = 1000111222; template<typename T> ostream& operator << (ostream &os, const vector<T> &v) { os << [ ; for (int i = 0; i < v.size(); ++i) { if (i) { os << ; } os << v[i]; } os << ] ; return os; } struct Animal { int a[3], wins, id; int get_strength() const { return a[wins]; } }; ostream& operator << (ostream &os, const Animal &a) { os << a.id; return os; } pair<int, long long> solve_triv(vector<Animal> a) { const int n = a.size(); int pos = 0; long long ans = 0; while (ans < 3LL * n * n * n) { ++ans; int nxt = (pos + 1) % n; if (a[pos].get_strength() < a[nxt].get_strength()) { a[pos].wins = 0; a[nxt].wins = 1; } else { ++a[pos].wins; if (a[pos].wins == 3) { return {a[pos].id, ans}; } swap(a[pos], a[nxt]); } pos = nxt; } return {-1, -1}; } bool red[max_n]; int closest_not_red[max_n], num_before[max_n]; pair<int, long long> solve(vector<Animal> a) { const int n = a.size(); int pos = 0; long long ans = 0; while (ans < 2 * n || a[pos].wins != 1) { ++ans; int nxt = (pos + 1) % n; if (a[pos].get_strength() < a[nxt].get_strength()) { a[pos].wins = 0; a[nxt].wins = 1; } else { ++a[pos].wins; if (a[pos].wins == 3) { return {a[pos].id, ans}; } swap(a[pos], a[nxt]); } pos = nxt; } while (true) { rotate(a.begin(), a.begin() + pos, a.end()); pos = 0; int tot_red = 0, first_red = -1; for (int i = 0; i < n; ++i) { red[i] = a[i].a[0] < a[(i + n - 1) % n].a[1]; tot_red += red[i]; if (first_red == -1 && red[i]) { first_red = i; } } assert(!red[pos] && a[pos].wins == 1); for (int i = 0; i < n; ++i) { assert(!red[i] || !red[(i + 1) % n]); } if (!tot_red) { break; } if (0) { for (int i = pos; i < pos + n; ++i) { cout << ( << a[i % n].id << , wins = << a[i % n].wins << << NR [red[i % n]] << ) ; } cout << endl; break; } int full_circles = inf, last_red = inf; for (int i = n - 1; i >= 0; --i) { if (!red[i]) { int nxt_red = last_red; if (nxt_red == inf) { nxt_red = first_red; } int nxt = (i + 1) % n; if (red[nxt]) { nxt = (nxt + 1) % n; } if (a[i].a[2] > a[nxt].a[0]) { int circles = nxt_red - i; if (circles < 0) { circles += n; } --circles; full_circles = min(full_circles, circles); } } else { last_red = i; } } vector<pair<int, int>> v; int tot_not_red = 0; for (int i = 0; i < n; ++i) { if (red[i]) { closest_not_red[i] = inf; auto it = lower_bound(v.begin(), v.end(), make_pair(a[i].a[0], inf)); if (it != v.begin()) { --it; closest_not_red[i] = 1; int circles = max(0, tot_not_red - it->second - 1); full_circles = min(full_circles, circles); } } else { ++tot_not_red; while (!v.empty() && v.back().first > a[i].a[1]) { v.pop_back(); } v.push_back({a[i].a[1], tot_not_red}); } } v.clear(); int tot_not_red_left = tot_not_red; tot_not_red = 0; for (int i = n - 1; i >= 0; --i) { if (red[i]) { if (closest_not_red[i] == inf) { auto it = lower_bound(v.rbegin(), v.rend(), make_pair(a[i].a[0], inf)); if (it != v.rbegin()) { --it; int circles = max(0, tot_not_red_left + it->second - 1); full_circles = min(full_circles, circles); } } } else { ++tot_not_red; if (v.empty() || v.back().first > a[i].a[1]) { v.push_back({a[i].a[1], tot_not_red}); } --tot_not_red_left; } } if (full_circles == inf) { break; } ans += full_circles * (n - 1); const int M = n - tot_red; for (int i = 0; i < M; ++i) { num_before[i] = -1; } tot_not_red = 0; for (int i = 0; i < n; ++i) { if (red[i]) { int num = ((tot_not_red - full_circles) % M + M) % M; //cout << %% << i << << tot_not_red << << num << endl; assert(num_before[num] == -1); num_before[num] = i; } else { ++tot_not_red; } } vector<Animal> na; na.reserve(n); tot_not_red = 0; int add = 0; for (int i = 0; i < n; ++i) { if (!red[i]) { if (num_before[tot_not_red] != -1) { na.push_back(a[num_before[tot_not_red]]); } if (tot_not_red == M - full_circles) { pos = na.size(); add = num_before[tot_not_red] != -1; } na.push_back(a[i]); ++tot_not_red; } } if (!full_circles) { add = 0; } assert(na.size() == n); for (int i = 0; i < n; ++i) { na[i].wins = 0; if (i == pos) { na[i].wins = 1 + add; } } //cout << a << -> << na << << full_circles << endl; a.swap(na); //cout << # << ans << << pos << endl; long long need_ans = ans + 2 * n + 2; while (ans < need_ans || a[pos].wins != 1) { ++ans; int nxt = (pos + 1) % n; if (a[pos].get_strength() < a[nxt].get_strength()) { a[pos].wins = 0; a[nxt].wins = 1; } else { ++a[pos].wins; if (a[pos].wins == 3) { return {a[pos].id, ans}; } swap(a[pos], a[nxt]); } pos = nxt; } } return {-1, -1}; } int n; Animal a[max_n]; const int seed = chrono::steady_clock::now().time_since_epoch().count(); mt19937 generator(seed * 0); int rnd() { return generator() >> 1; } int rnd(int r) { return rnd() % r; } int rnd(int l, int r) { return l + rnd(r - l + 1); } int main() { //freopen( input.txt , r , stdin); //freopen( output.txt , w , stdout); if (0) { for (int test = 0; ; ++test) { n = rnd(4, 500); vector<int> v; for (int i = 0; i < 3 * n; ++i) { v.push_back(i); } shuffle(v.begin(), v.end(), generator); for (int i = 0; i < n; ++i) { for (int j = 0; j < 3; ++j) { a[i].a[j] = v.back(); v.pop_back(); } sort(a[i].a, a[i].a + 3); swap(a[i].a[0], a[i].a[1]); if (rnd(2)) { swap(a[i].a[0], a[i].a[2]); } a[i].id = i; } auto p1 = solve_triv({a, a + n}); auto p2 = solve({a, a + n}); if (p1 != p2) { cout << OK: << p1.first << << p1.second << endl; cout << WA: << p2.first << << p2.second << endl; cout << n << endl; for (int i = 0; i < n; ++i) { for (int j = 0; j < 3; ++j) { cout << a[i].a[j] << ; } cout << endl; } return 1; } if (test % 1000 == 0) cout << + << test << n ; } } scanf( %d , &n); for (int i = 0; i < n; ++i) { for (int j = 0; j < 3; ++j) { scanf( %d , &a[i].a[j]); } a[i].id = i; } //auto ans = solve_triv({a, a + n}); auto ans = solve({a, a + n}); printf( %d %lld n , ans.first, ans.second); return 0; } |
#include <bits/stdc++.h> using namespace std; int a[100000]; int b[100000]; int main() { int n, m, y0, y1; cin >> n >> m >> y0 >> y1; for (int x = 0; x < n; ++x) { cin >> a[x]; } for (int x = 0; x < m; ++x) { cin >> b[x]; } int i = 0, j = 0, pp = -1; int kk = 0; for (int x = 0; x < n; ++x) { while (j < m && abs(a[x] - b[j + 1]) < abs(a[x] - b[j])) j++; if (j != pp || abs(a[x] - b[j]) == abs(a[x - 1] - b[j])) { kk++; pp = j; } else if (j + 1 < m && abs(a[x] - b[j]) == abs(a[x] - b[j + 1])) { kk++; pp = ++j; } else pp = j; } cout << n - kk << endl; } |
#include <bits/stdc++.h> using namespace std; int n; char a[1005], b[1005]; int minn, maxx; int main() { scanf( %d , &n); scanf( %s%s , a, b); sort(a, a + n); sort(b, b + n); for (int i = 0, j = 0; i < n; i++) { while (j < n && b[j] < a[i]) j++; if (j < n) j++; else minn++; } for (int i = 0, j = 0; i < n; i++) { while (j < n && b[j] <= a[i]) j++; if (j < n) { maxx++; j++; } } printf( %d n%d n , minn, maxx); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; int t; cin >> t; while (t--) { int n; cin >> n; vector<int> arr(n); map<int, int> mp; for (int i = 0; i < n; i++) { cin >> arr[i]; mp[arr[i]]++; } int ans = 0; int ct = 0; for (int i = 0; i <= 100; i++) { if (ct < 2) { if (mp[i] == 0) { ans += (2 - ct) * i; if (ct == 1) ct++; else ct += 2; } else if (mp[i] % 2 == 0) continue; else if (mp[i] == 1) { if (ct == 1) continue; else { ct++; ans += i; } } } else break; } cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; int n, p; int sum[200000]; int main() { scanf( %d %d , &n, &p); for (int i = 1; i <= n; ++i) { scanf( %d , &sum[i]); sum[i] = (sum[i - 1] + sum[i]) % p; } int ans = 0; int l, r; for (int i = 1; i < n; ++i) { l = sum[i]; r = sum[n] - sum[i]; if (r < 0) r += p; if (l + r > ans) ans = l + r; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int order[3][4] = {{0, 1, 2, 3}, {0, 2, 3, 1}, {0, 3, 1, 2}}; long long solve(long long n) { long long four = 1; while (four * 4 <= n) { four *= 4; } int part = (n - 1) % 3; n -= four; n /= 3; long long res = four * (part + 1); while (n > 0) { res += order[part][n / four] * four; n %= four; four /= 4; } return res; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int tc; long long n; cin >> tc; while (tc--) { cin >> n; long long ans = solve(n); cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; using namespace std::chrono; long long google_itr = 1; const long long mod = 1e9 + 7; const long long inf = 1e18; void virus() { long long len, k; cin >> len >> k; string seq; cin >> seq; long long zero = 0, one = 0; for (auto i = 0; i < k; i++) { long long enc = -1; for (auto j = i; j < len; j += k) { if (seq[j] != ? ) { if (enc != -1 and seq[j] - 0 != enc) { cout << NO n ; return; } enc = seq[j] - 0 ; } } if (enc != -1) (enc == 0) ? zero++ : one++; } if (one > (k / 2) or zero > (k / 2)) { cout << NO n ; return; } cout << YES n ; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t; cin >> t; while (t--) { auto start = high_resolution_clock::now(); virus(); auto stop = high_resolution_clock::now(); auto duration = duration_cast<seconds>(stop - start); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 5e3 + 3, M = 1e5 + 3; const double eps = 1e-7; int n, m, k, u[M], v[M], id[M]; double w[M]; bool vis[M]; struct dsu { int fa[N]; inline void init(int range) { for (register int i = (1); i <= (range); ++i) fa[i] = i; } int Fnd(int u) { return fa[u] == u ? u : fa[u] = Fnd(fa[u]); } } D; inline bool cmp(int A, int B) { return w[A] < w[B]; } int res, tmp; inline int chk(double mid) { for (register int i = (1); i <= (m); ++i) id[i] = i, vis[i] = 0; for (register int i = (1); i <= (m); ++i) if (u[i] == 1 || v[i] == 1) w[i] += mid; sort(id + 1, id + m + 1, cmp); D.init(n); res = 0, tmp = 0; double val = 0; for (register int i = (1); i <= (m); ++i) { int Fu = D.Fnd(u[id[i]]), Fv = D.Fnd(v[id[i]]); if (Fu == Fv) continue; D.fa[Fu] = Fv; vis[id[i]] = 1; tmp++; if (u[id[i]] == 1 || v[id[i]] == 1) { res++; } if (tmp == n - 1) break; } for (register int i = (1); i <= (m); ++i) if (u[i] == 1 || v[i] == 1) w[i] -= mid; return res; } int main() { scanf( %d%d%d , &n, &m, &k); if (k == 0) { if (n > 1) puts( -1 ); else puts( 0 ); return 0; } for (register int i = (1); i <= (m); ++i) { static int ___; scanf( %d%d%d , u + i, v + i, &___); w[i] = (double)___ + eps * 1.0 * i; } double L = -1e7, R = 1e7, mid; while (L + eps < R) { mid = (L + R) / 2; if (chk(mid) > k) L = mid; else R = mid; } if (chk(L) != k) chk(R); printf( %d n , n - 1); for (register int i = (1); i <= (m); ++i) if (vis[i]) printf( %d , i); return 0; } |
#include <bits/stdc++.h> using namespace std; const int Max_N = 55; const int dx[] = {233, 0, 0, 1, -1}; const int dy[] = {233, 1, -1, 0, 0}; namespace Disjoint_set { int fa[Max_N * Max_N], siz[Max_N * Max_N]; int getf(int u) { return fa[u] == u ? u : fa[u] = getf(fa[u]); } void init(int n) { for (int i = 1; i <= n; i++) fa[i] = i, siz[i] = 1; } void merge(int u, int v) { u = getf(u), v = getf(v); if (u == v) return; if (siz[u] > siz[v]) swap(u, v); siz[v] += siz[u], fa[u] = v; } } // namespace Disjoint_set using namespace Disjoint_set; int N, r1, c1, r2, c2; char Map[Max_N][Max_N]; inline int encode(int x, int y) { return (x - 1) * N + y; } inline bool inside(int n, int m) { return 1 <= n && n <= N && 1 <= m && m <= N; } int main() { scanf( %d , &N); scanf( %d%d%d%d , &r1, &c1, &r2, &c2); for (int i = 1; i <= N; i++) scanf( %s , Map[i] + 1); init(N * N); for (int i = 1; i <= N; i++) for (int j = 1; j <= N; j++) if (Map[i][j] == 0 ) for (int k = 1; k <= 4; k++) if (inside(i + dx[k], j + dy[k]) && Map[i + dx[k]][j + dy[k]] == 0 ) merge(encode(i, j), encode(i + dx[k], j + dy[k])); if (getf(encode(r1, c1)) == getf(encode(r2, c2))) return printf( %d n , 0), 0; int Ans = 2 * N * N, f1 = getf(encode(r1, c1)), f2 = getf(encode(r2, c2)); for (int i = 1; i <= N; i++) for (int j = 1; j <= N; j++) if (getf(encode(i, j)) == f1) for (int k = 1; k <= N; k++) for (int w = 1; w <= N; w++) if (getf(encode(k, w)) == f2) Ans = min(Ans, abs(i - k) * abs(i - k) + abs(j - w) * abs(j - w)); printf( %d n , Ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int conv[1000000]; int a[1000000]; int b[1000000]; int n; int best = 0; int d[1000000]; int main() { ios_base::sync_with_stdio(0); cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; a[i]--; } for (int i = 0; i < n; i++) { cin >> b[i]; b[i]--; } for (int i = 0; i < n; i++) { conv[a[i]] = i; } for (int i = 0; i < n; i++) { b[i] = conv[b[i]]; } reverse(b, b + n); for (int i = 0; i < n; i++) { int l = -1; int r = best; while (r - l > 1) { int mid = (r + l) >> 1; if (d[mid] > b[i]) { r = mid; } else { l = mid; } } if (r == best) { d[best++] = b[i]; } else { d[r] = b[i]; } } cout << best; return 0; } |
#include <bits/stdc++.h> using namespace std; int a[1000]; int main() { long long p; int k; cin >> p >> k; int kol = 0; while (p > 0) { a[kol] = kol % 2 ? (k - p % k) % k : p % k; p = (kol % 2 ? (p + k - 1) : p) / k; kol++; } if (kol % 2 == 0) { a[kol++] = 1; } cout << kol << endl; for (int i = 0; i < kol; i++) cout << a[i] << ; cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; map<int, int> mp; const int N = 1e5 + 3, M = 2e5 + 3; int b[N], st[N], tp, he[N], to[M], ne[M], d[N], a[N]; bool f[N]; void dfs(int x) { for (int i, j; i = he[x];) if (he[x] = ne[i], !f[j = i >> 1]) f[j] = 1, dfs(to[i]), st[++tp] = i; } int main() { int m, i, j, k, n = 0, t = 1; scanf( %d , &m), --m; for (i = 1; i <= m; ++i) if (scanf( %d , b + i), !mp[b[i]]) a[mp[b[i]] = ++n] = b[i]; for (i = 1; i <= m; ++i) { scanf( %d , &j); if (j < b[i]) puts( -1 ), exit(0); if (!mp[j]) a[mp[j] = ++n] = j; j = mp[j], k = mp[b[i]], ++d[j], ++d[k]; ne[++t] = he[j], to[t] = k, he[j] = t; ne[++t] = he[k], to[t] = j, he[k] = t; } for (i = 1, j = 0; i <= n; ++i) if (d[i] & 1) ++j; if (j > 2) puts( -1 ), exit(0); if (j == 2) { for (i = 1; i <= n; ++i) if (d[i] & 1) { dfs(i); break; } } else dfs(i = 1); if (tp < m) puts( -1 ), exit(0); for (printf( %d , a[i]), i = tp; i; --i) printf( %d , a[to[st[i]]]); return 0; } |
#include <bits/stdc++.h> using namespace std; const double PI{3.1415926535897932384626433832795}; const int MOD{static_cast<int>(1e9 + 7)}; const double EPS{1e-9}; template <typename T> T ModAdd(const T &a, const T &b, const int &mod = MOD) { return ((a) % mod + (a) % mod) % mod; } template <typename T> T ModSub(const T &a, const T &b, const int &mod = MOD) { return ((((a % mod) - (b % mod)) % mod) + mod) % mod; } template <typename T> T ModMul(const T &a, const T &b, const int &mod = MOD) { return ((a % mod) * (b % mod)) % mod; } template <typename T> bool AdditionLimitFlow(const T &a, const T &x) { T MAXIMUM_INT{a}, MINIMUM_INT{a}; switch (sizeof(a)) { case 8: MAXIMUM_INT = LLONG_MAX; MINIMUM_INT = LLONG_MIN; break; case 4: MAXIMUM_INT = INT_MAX; MINIMUM_INT = INT_MIN; break; default: cerr << PARAMETER SHOULD BE EITHER int OR long long !! << endl; assert(0); break; } bool overflow{false}, underflow{false}; if ((x > 0) && (a > MAXIMUM_INT - x)) overflow = true; if ((x < 0) && (a < MINIMUM_INT - x)) underflow = true; if (overflow) { cerr << OVERFLOW: [ << a << , << x << ] << endl; return overflow; } if (underflow) { cerr << UNDERFLOW: [ << a << , << x << ] << endl; return underflow; } return false; } template <typename T> bool SubstractionLimitFlow(const T &a, const T &x) { T MAXIMUM_INT{}, MINIMUM_INT{}; switch (sizeof(a)) { case 8: MAXIMUM_INT = LLONG_MAX; MINIMUM_INT = LLONG_MIN; break; case 4: MAXIMUM_INT = INT_MAX; MINIMUM_INT = INT_MIN; break; default: cerr << PARAMETER SHOULD BE EITHER int OR long long !! << endl; assert(0); break; } bool overflow{false}, underflow{false}; if ((x < 0) && (a > MAXIMUM_INT + x)) overflow = true; if ((x > 0) && (a < MINIMUM_INT + x)) underflow = true; if (overflow) { cerr << OVERFLOW: [ << a << , << x << ] << endl; return overflow; } if (underflow) { cerr << UNDERFLOW: [ << a << , << x << ] << endl; return underflow; } return false; } template <typename T> bool MultiplicationLimitFlow(const T &a, const T &x) { T MAXIMUM_INT{}, MINIMUM_INT{}; switch (sizeof(a)) { case 8: MAXIMUM_INT = LLONG_MAX; MINIMUM_INT = LLONG_MIN; break; case 4: MAXIMUM_INT = INT_MAX; MINIMUM_INT = INT_MIN; break; default: cerr << PARAMETER SHOULD BE EITHER int OR long long !! << endl; assert(0); break; } bool overflow{false}, underflow{false}; if ((a == -1) && (x == MINIMUM_INT)) overflow = true; if ((x == -1) && (a == MINIMUM_INT)) overflow = true; if (a > MAXIMUM_INT / x) overflow = true; if (a < MINIMUM_INT / x) underflow = true; if (overflow) { cerr << OVERFLOW: [ << a << , << x << ] << endl; return overflow; } if (underflow) { cerr << UNDERFLOW: [ << a << , << x << ] << endl; return underflow; } return false; } template <typename T, size_t N> istream &operator>>(istream &is, array<T, N> &ARR) { for (T &a : ARR) is >> a; return is; } template <typename T, size_t N> ostream &operator<<(ostream &os, array<T, N> &ARR) { for (T const &a : ARR) os << a << ; return os; } template <typename T> istream &operator>>(istream &is, vector<T> &VEC) { for (T &v : VEC) is >> v; return is; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &VEC) { for (T const &v : VEC) os << v << ; return os; } template <typename T> istream &operator>>(istream &is, deque<T> &DEQ) { for (T &d : DEQ) is >> d; return is; } template <typename T> ostream &operator<<(ostream &os, const deque<T> &DEQ) { for (const T &d : DEQ) os << d << ; return os; } template <typename T> istream &operator>>(istream &is, list<T> &LIS) { for (T &l : LIS) is >> l; return is; } template <typename T> ostream &operator<<(ostream &os, const list<T> &LIS) { for (T const &l : LIS) os << l << ; return os; } template <typename T> ostream &operator<<(ostream &os, const set<T> &ST) { for (auto const &s : ST) os << s << ; return os; } template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &U_ST) { for (T const &us : U_ST) os << us << ; return os; } template <typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &PR) { is >> PR.first >> PR.second; return is; } template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &PR) { os << [ << PR.first << : << PR.second << ] ; return os; } template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &MP) { os << [ ; for (pair<T1, T2> const &m : MP) os << m << ; os << ] ; return os; } template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &U_MP) { os << [ ; for (pair<T1, T2> const &um : U_MP) os << um << ; os << ] ; return os; } template <typename T> ostream &operator<<(ostream &os, stack<T> STACK) { while (!STACK.empty()) { os << STACK.top() << ; STACK.pop(); } return os; } template <typename T> ostream &operator<<(ostream &os, queue<T> QUEUE) { while (!QUEUE.empty()) { os << QUEUE.front() << ; QUEUE.pop(); } return os; } template <typename T, size_t R, size_t C> ostream &operator<<(ostream &os, array<array<T, C>, R> &MAT) { for (array<T, C> &ROW : MAT) os << ROW << endl; return os; } template <typename T> ostream &operator<<(ostream &os, vector<vector<T>> &MAT) { for (vector<T> &ROW : MAT) os << ROW << endl; return os; } template <typename T> T max(const T &A, const T &B, const T &C) { T mx{A}; (mx < B) && (mx = B); (mx < C) && (mx = C); return mx; } template <typename T> T min(const T &A, const T &B, const T &C) { T mn{A}; (mn > B) && (mn = B); (mn > C) && (mn = C); return mn; } template <typename T> int cntDigits(const T &N) { return (static_cast<int>(log10(N)) + 1); } template <typename T> bool isPowOfTwo(const T &N) { return (N && (!(N & (N - 1)))); } template <typename T> bool dblEqual(const T &a, const T &b) { return abs(a - b) < EPS; } void TEST_CASES() { int n{}; cin >> n; vector<int> arr(n); cin >> arr; int mn{*min_element(arr.begin(), arr.end())}; if (mn == 1) cout << 1 << endl; else { bool alldivisible{true}; for (int i{}; i < n; ++i) { if (arr.at(i) % mn) { alldivisible = false; break; } } if (alldivisible) cout << mn << endl; else cout << -1 << endl; } } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cerr.setf(std::ios::boolalpha); cout << std::fixed; cout << std::setprecision(6); unsigned TT{1}; while (TT--) { TEST_CASES(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int r[100005], t, n, m, ans = 0; vector<int> id[100005]; set<int> v; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) { scanf( %d , &t); v.insert(t); id[t].push_back(i); r[t] = max(r[t], i); } for (auto it : v) { int sum = 0; for (int i = 0; i < id[it].size() && sum < 2; i++) { t = 0; if (id[it][i] < r[it - 1]) t++; if (id[it][i] < r[it + 1]) t++; sum = max(sum, t); } ans += sum; } printf( %d n , n * 3 - 2 - ans - v.size()); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; int cnt; int dfn[300005], low[300005], bel[300005], tot, scc; bool vis[300005], ins[300005]; string ori[100005]; stack<int> s; map<string, int> hashh; vector<int> g[300005], dag[300005]; pair<long long, long long> a[300005]; pair<long long, long long> dp[300005]; pair<long long, long long> operator+(const pair<long long, long long> &a, const pair<long long, long long> &b) { return make_pair(a.first + b.first, a.second + b.second); } void down(string &a) { for (int i = 0; i < a.length(); i++) if ( A <= a[i] && a[i] <= Z ) a[i] = a[i] - A + a ; } pair<long long, long long> calc(string a) { pair<long long, long long> t = make_pair(0, 0); for (int i = 0; i < a.length(); i++) if (a[i] == r ) t.first++; t.second = a.length(); return t; } void add(string &s) { down(s); if (hashh.count(s) == 0) hashh[s] = ++cnt; pair<long long, long long> t = calc(s); a[hashh[s]] = t; } void tarjan(int u) { s.push(u); ins[u] = 1; dfn[u] = low[u] = ++tot; for (int i = 0; i < g[u].size(); i++) { int v = g[u][i]; if (dfn[v] == 0) { tarjan(v); low[u] = min(low[u], low[v]); } else if (ins[v]) low[u] = min(low[u], dfn[v]); } if (dfn[u] == low[u]) { int v; scc++; dp[scc] = make_pair(1 << 30, 1 << 30); do { v = s.top(); s.pop(); ins[v] = 0; bel[v] = scc; dp[scc] = min(dp[scc], a[v]); } while (v != u); } } void dfs(int u) { if (vis[u]) return; vis[u] = 1; for (int i = 0; i < dag[u].size(); i++) { int v = dag[u][i]; dfs(v); dp[u] = min(dp[u], dp[v]); } } int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> ori[i]; add(ori[i]); } cin >> m; for (int i = 1; i <= m; i++) { string u, v; cin >> u >> v; add(u); add(v); g[hashh[u]].push_back(hashh[v]); } for (int i = 1; i <= cnt; i++) if (dfn[i] == 0) tarjan(i); for (int i = 1; i <= cnt; i++) for (int j = 0; j < g[i].size(); j++) if (bel[i] != bel[g[i][j]]) dag[bel[i]].push_back(bel[g[i][j]]); for (int i = 1; i <= scc; i++) if (vis[i] == 0) dfs(i); pair<long long, long long> ans; for (int i = 1; i <= n; i++) ans = ans + dp[bel[hashh[ori[i]]]]; cout << ans.first << << ans.second; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1000000000; const long long LINF = 1e17; const double PI = 3.141592653589793238; const int mod = 1000000007; const double eps = 0.000001; template <typename T, typename TT> ostream &operator<<(ostream &s, pair<T, TT> t) { return s << ( << t.first << , << t.second << ) ; } template <typename T> ostream &operator<<(ostream &s, vector<T> t) { for (int i = 0; i < (t).size(); i++) s << t[i] << ((i < (t).size() - 1) ? : ); return s; } template <typename T> ostream &operator<<(ostream &s, set<T> t) { for (T x : t) s << x << ; return s; } template <typename T> istream &operator>>(istream &s, vector<T> &t) { for (int _i = 0; _i < t.size(); _i++) s >> t[_i]; return s; } int main(int argc, const char *argv[]) { int n; cin >> n; int q[10][1023], p[10][1023]; for (int i = (0); i < (int)(10); i++) for (int j = (0); j < (int)(n); j++) q[i][j] = p[i][j] = INF; for (int i = (0); i < (int)(10); i++) { vector<int> cq, cp; for (int j = (0); j < (int)(n); j++) { if (j & (1 << i)) cp.push_back(j + 1); else cq.push_back(j + 1); } if (cp.size() > 0) { cout << cp.size() << n << cp << n ; fflush(stdout); for (int j = (0); j < (int)(n); j++) cin >> p[i][j]; } if (cq.size() < n) { cout << cq.size() << n << cq << n ; fflush(stdout); for (int j = (0); j < (int)(n); j++) cin >> q[i][j]; } } cout << -1 n ; for (int j = (0); j < (int)(n); j++) { int minv = INF; for (int i = (0); i < (int)(10); i++) { if (j & (1 << i)) minv = min(minv, q[i][j]); else minv = min(minv, p[i][j]); } cout << minv << ; } } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, sum = 0, k; cin >> n; char a[n]; cin >> a; for (int i = 0; i < n; i++) { k = int(a[i]); if (k % 2 == 0) { sum = sum + (i + 1); } } cout << sum; return 0; } |
#include <bits/stdc++.h> using namespace std; int arr[200005]; int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; for (int i = 0; i < n; i++) cin >> arr[i]; sort(arr, arr + n); int now = arr[0], cnt = 1; set<int> sup; stack<int> sdown; sup.insert(now); for (int i = 1; i < n; i++) { if (arr[i] == now) { cnt++; sdown.push(arr[i]); } else { now = arr[i]; sup.insert(now); cnt = 1; } if (cnt >= 3) { cout << NO << endl; return 0; } } cout << YES << endl; cout << sup.size() << endl; bool flag = true; for (auto i = sup.begin(); i != sup.end(); i++) { if (flag) { cout << *i; flag = false; } else cout << << *i; } cout << endl; cout << sdown.size() << endl; flag = true; while (!sdown.empty()) { if (flag) { cout << sdown.top(); flag = false; } else cout << << sdown.top() << endl; sdown.pop(); } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; struct __timestamper {}; int main() { int n; scanf( %d , &n); vector<int> l(n), r(n); for (int i = 0; i < n; i++) scanf( %d%d , &l[i], &r[i]); double ans = 0; for (int i = 1; i <= 10000; i++) { double prob[3]; prob[0] = 1; prob[1] = prob[2] = 0; for (int j = 0; j < n; j++) { double p = max(r[j] - max(l[j], i) + 1, 0) * 1.0 / (r[j] - l[j] + 1); prob[2] += prob[1] * p; prob[1] = prob[1] * (1.0 - p) + prob[0] * p; prob[0] *= 1.0 - p; } ans += prob[2]; } printf( %.10f n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007LL; const int lmt = 1005; const long long inf = 1LL << 62; long long dp[lmt][lmt], a[lmt], req[lmt]; int n; long long solve(int idx, int left) { if (idx > n) return 0; if (dp[idx][left] != -1) return dp[idx][left]; long long ans = min(a[idx], solve(idx + 1, left) + a[idx]); if (left > 0) ans = max(solve(idx + 1, left - 1), ans); return dp[idx][left] = ans; } void process() { memset(dp, -1, sizeof(dp)); for (int i = 0; i <= n; i++) { req[i] = solve(1, i); } } int main() { int q; scanf( %d%d , &n, &q); for (int i = 1; i <= n; i++) scanf( %lld , &a[i]); process(); while (q--) { long long val; scanf( %lld , &val); for (int i = 0; i <= n; i++) { if ((req[i] + val) >= 0) { printf( %d n , i); break; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; mt19937 rng( (unsigned int)chrono::steady_clock::now().time_since_epoch().count()); const int MAGIC = 239; const int N = 100010; vector<int> g[N]; bool in_st[N]; bool was[N]; bool dfs(int v) { was[v] = true; in_st[v] = true; for (int u : g[v]) { if (was[u]) { if (!in_st[u]) { in_st[v] = false; return false; } } else { if (!dfs(u)) { in_st[v] = false; return false; } } } in_st[v] = false; return true; } vector<int> vis; int depth[N]; int md[N]; int md2[N]; int mver[N]; int mver2[N]; void Update(int v, int x, int y) { if (x < md[v]) { md2[v] = md[v]; mver2[v] = mver[v]; md[v] = x; mver[v] = y; } else { if (x < md2[v]) { md2[v] = x; mver2[v] = y; } } } void solve(int v) { vis.push_back(v); was[v] = true; md[v] = md2[v] = depth[v]; mver[v] = mver2[v] = v; for (int u : g[v]) { if (was[u]) { assert(depth[u] < depth[v]); Update(v, depth[u], u); } else { depth[u] = depth[v] + 1; solve(u); Update(v, md[u], mver[u]); Update(v, md2[u], mver2[u]); } } } int main() { ios::sync_with_stdio(false); cin.tie(0); int tt; cin >> tt; while (tt--) { int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { g[i].clear(); } for (int i = 0; i < m; i++) { int x, y; cin >> x >> y; --x; --y; g[x].push_back(y); } vector<int> order(n); iota(order.begin(), order.end(), 0); shuffle(order.begin(), order.end(), rng); int root = -1; for (int iter = 0; iter < min(n, MAGIC); iter++) { for (int i = 0; i < n; i++) { was[i] = in_st[i] = false; } if (dfs(order[iter])) { root = order[iter]; break; } } if (root == -1) { cout << -1 << n ; continue; } for (int i = 0; i < n; i++) { was[i] = false; } vis.clear(); depth[root] = 0; solve(root); vector<bool> is_good(n); for (int i : vis) { if (i == root) { is_good[i] = true; } else { if (md[i] < depth[i] && md2[i] >= depth[i]) { is_good[i] = is_good[mver[i]]; } else { is_good[i] = false; } } } vector<int> res; for (int i = 0; i < n; i++) { if (is_good[i]) { res.push_back(i); } } if ((int)res.size() * 5 < n) { cout << -1 << n ; continue; } for (int i = 0; i < (int)res.size(); i++) { if (i > 0) { cout << ; } cout << res[i] + 1; } cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int gems[30050], maxi = INT_MIN; int dp[30005][600], kood; int solve(int i, int d) { int change = 300 + (d - kood); if (i > maxi) return 0; if (dp[i][change] != -1) return dp[i][change]; if (d == 1) { return dp[i][change] = gems[i] + max(solve(i + d, d), solve(i + d + 1, d + 1)); } return dp[i][change] = gems[i] + max(solve(i + d - 1, d - 1), max(solve(i + d, d), solve(i + d + 1, d + 1))); } int main() { int n, d, x; cin >> n >> d; kood = d; memset(dp, -1, sizeof(dp)); for (int i = 0; i < n; i++) { cin >> x; gems[x]++; maxi = max(maxi, x); } cout << solve(d, d) << endl; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; struct node { int a, b, id; bool operator<(const node& tem) const { return a > tem.a; } } vec[maxn]; bool used[maxn]; int n; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &vec[i].a); for (int i = 1; i <= n; i++) scanf( %d , &vec[i].b); for (int i = 1; i <= n; i++) vec[i].id = i; sort(vec + 1, vec + 1 + n); priority_queue<pair<int, int> > q; int pcou = 1, cnt = 0; for (int i = 1; i <= n / 2 + 1; i++) { while (pcou <= n && pcou <= 2 * i - 1) { q.push(pair<int, int>(vec[pcou].b, vec[pcou].id)); ++pcou; } if (!q.empty()) { ++cnt; int id = q.top().second; q.pop(); used[id] = 1; } } printf( %d n , cnt); for (int i = 1; i <= n; i++) if (used[i]) printf( %d , i); return 0; } |
#include <bits/stdc++.h> const int long long N = 10e8 + 7; using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; int arr[n]; vector<int> odd, even; for (int i = 0; i < n; i++) { cin >> arr[i]; if (arr[i] % 2 == 0) even.push_back(arr[i]); else odd.push_back(arr[i]); } int p = int(odd.size()), q = even.size(); if (p % 2 == 0 && q % 2 == 0) { cout << YES << n ; continue; } bool flag = 0; for (int i = 0; i < p; i++) { for (int j = 0; j < q; j++) { if (int(abs(even[j] - odd[i])) == 1) flag = 1; } if (flag) break; } if (flag) cout << YES << n ; else cout << NO << n ; } } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; set<int> st; set<int>::iterator it; int n, m, used[N], hmm[N]; vector<int> graph[N], vec, b[N]; void lmao() { if (st.size() == 0) { return; } it = st.begin(); int u = *it; for (int i = 0; i < graph[u].size(); i++) { int v = graph[u][i]; st.erase(v); } st.erase(u); lmao(); for (int i = 0; i < b[u].size(); i++) { int v = b[u][i]; if (hmm[v]) return; } hmm[u] = 1; vec.push_back(u); } int main() { cin.tie(0), ios::sync_with_stdio(0); cin >> n >> m; for (int i = 1; i <= n; i++) st.insert(i); for (int i = 1; i <= m; i++) { int u, v; cin >> u >> v; graph[u].push_back(v); b[v].push_back(u); } lmao(); cout << vec.size() << n ; for (int i = 0; i < vec.size(); i++) cout << vec[i] << ; } |
#include <bits/stdc++.h> using namespace std; void sort_vec(vector<int> x, vector<int> b, int cnt) { int index; int max = 101; for (; cnt > 0; cnt--) { for (int j = 0; j < x.size(); j++) { if (x[j] < max) { index = j; max = x[j]; } } cout << x[index] << << b[index] << endl; x[index] = 101; b[index] = 101; } } int main() { int x, y, a, b; cin >> x >> y >> a >> b; vector<int> va; vector<int> vb; int cnt = 0; for (int i = b; i <= y; i++) { for (int j = a; j <= x; j++) { if (j <= i) continue; cnt++; va.push_back(j); vb.push_back(i); } } cout << cnt << endl; int index, tmp = 101; while (cnt > 0) { tmp = 101; for (int i = 0; i < va.size(); i++) { if (va[i] < tmp) { tmp = va[i]; index = i; } } cout << va[index] << << vb[index] << endl; va.erase(va.begin() + index, va.begin() + index + 1); vb.erase(vb.begin() + index, vb.begin() + index + 1); cnt--; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 410; int cl[maxn * maxn]; int po[maxn * maxn]; int pre[maxn * maxn * 2]; int cnt[maxn * maxn * 2]; short cc[maxn * maxn * 2]; short F[maxn][maxn]; short g[maxn][maxn]; int a[maxn][maxn]; int b[maxn][maxn]; int pos[maxn][maxn]; int n, m; int find(int x) { return cnt[x] ? x : pre[x] = find(pre[x]); } inline void init(int x, short f[][maxn], int a[][maxn]) { int tot = maxn * maxn; for (int i = x; i <= n; i++) { for (int j = 1; j <= m; j++) { cl[a[i][j]] = 0, po[a[i][j]] = a[i][j] + 1; cc[a[i][j] + 1] = 0; cnt[a[i][j] + 1] = 1; } } for (int i = 0; i <= m; i++) f[x - 1][i] = 0; for (int j = 1; j <= m; j++) { for (int i = x; i <= n; i++) { if (cl[a[i][j]] != j) { pos[i][j] = tot; cnt[tot] = 1; cc[tot] = j; pre[tot] = po[a[i][j]]; po[a[i][j]] = tot; tot++; } else { pos[i][j] = po[a[i][j]]; cnt[pos[i][j]]++; } cl[a[i][j]] = j; } } for (int i = n; i >= x; i--) { for (int j = m; j > 0; j--) { int p = pos[i][j]; cnt[p]--; f[i][j] = cc[find(p)]; } } for (int i = x; i <= n; i++) { for (int j = 1; j <= m; j++) { f[i][j] = max(f[i][j], max(f[i - 1][j], f[i][j - 1])); } } } int main() { int w = 0; scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { scanf( %d , &a[i][j]); b[i][m - j + 1] = a[i][j]; } } int ans = 0; for (int i = 1; i <= n; i++) { init(i, F, a); init(i, g, b); for (int j = i; j <= n; j++) { int r = 1; for (int k = 1; k <= m; k++) { for (int len = m - g[j][m - k + 1]; r <= len; r++) { if (F[j][r] >= k) break; } ans = max(ans, (j - i + 1) * (r - k)); } } } printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; int N; int mov[2][4] = {{-1, 0, 0, 1}, {0, -1, 1, 0}}; long long X[31], Y[31]; vector<int> graph[31]; void BuildTree(int node, int parent, int dir, long long dist) { if (graph[node].size() > 4) { cout << NO n ; exit(0); } for (int i = 0, j = 0; i < graph[node].size(); i++) if (graph[node][i] != parent) { if (dir == 3 - j) j = (j + 1) % 4; X[graph[node][i]] = X[node] + dist * mov[0][j]; Y[graph[node][i]] = Y[node] + dist * mov[1][j]; BuildTree(graph[node][i], node, j, dist / 2); j = (j + 1) % 4; } } int main() { ios_base::sync_with_stdio(0); cin.tie(); cin >> N; for (int i = 0; i < N - 1; i++) { int u, v; cin >> u >> v; graph[u].push_back(v); graph[v].push_back(u); } BuildTree(1, 1, -1, 1ll << 30); cout << YES n ; for (int i = 1; i <= N; i++) cout << X[i] << << Y[i] << n ; } |
#include <bits/stdc++.h> using namespace std; pair<int, int> a[2 * (int)(1e5 + 51)], b[2 * (int)(1e5 + 51)]; bool visited[2 * (int)(1e5 + 51)]; vector<int> g[2 * (int)(1e5 + 51)]; void dfs(int x) { visited[x] = 1; for (auto v : g[x]) { if (!visited[v]) dfs(v); } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t; cin >> t; while (t--) { int n; cin >> n; for (int i = 1; i <= n; i++) { int x; cin >> x; a[i] = {x, i}; } for (int i = 1; i <= n; i++) { int x; cin >> x; b[i] = {x, i}; } sort(a + 1, a + 1 + n); reverse(a + 1, a + 1 + n); sort(b + 1, b + 1 + n); reverse(b + 1, b + 1 + n); for (int i = 1; i < n; i++) g[a[i + 1].second].push_back({a[i].second}); for (int i = 1; i < n; i++) if (((int)g[b[i + 1].second].size() && g[b[i + 1].second][0] != b[i].second) || !(int)g[b[i + 1].second].size()) g[b[i + 1].second].push_back(b[i].second); dfs(b[1].second); dfs(a[1].second); string ans = ; for (int i = 1; i <= n; i++) { if (visited[i]) ans += 1 ; else ans += 0 ; visited[i] = 0; g[i].clear(); } cout << ans << n ; } } |
#include <bits/stdc++.h> using namespace std; long long po(long long x, long long y) { if (y == 0) return 1; else return x * po(x, y - 1); } vector<long long> a[7], b[7]; void solve(long long l, long long r, long long d) { if (l == r) return; long long m = (l + r) >> 1; for (long long i = l; i <= m; i++) a[d].push_back(i); for (long long i = m + 1; i <= r; i++) b[d].push_back(i); solve(l, m, d + 1); solve(m + 1, r, d + 1); } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); long long t; cin >> t; while (t--) { long long n; cin >> n; for (long long i = 0; i < 7; i++) { a[i].clear(); b[i].clear(); } solve(1, n, 0); long long ans = 0; for (long long i = 0; i < 7; i++) { if (a[i].empty() || b[i].empty()) break; cout << a[i].size() << << b[i].size() << ; for (auto it : a[i]) cout << it << ; for (auto it : b[i]) cout << it << ; cout << endl; long long x; cin >> x; ans = max(ans, x); } cout << -1 << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long x, y, n; cin >> x >> y >> n; long long a = -1, b = -1; for (int i = 1; i <= n; i++) { int t = x * i * 1.0 / y; if (abs(t * y - i * x) > abs((t + 1) * y - i * x)) t++; if (a == -1 || (abs(t * y - i * x) * b < abs(a * y - b * x) * i)) a = t, b = i; } cout << a << / << b; return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, i; void input() { cin >> n; return; } void output() { return; } void lolicon() { n = abs(n); while (!(i * (i + 1) / 2 >= n && (i * (i + 1) / 2 - n) % 2 == 0)) i++; cout << i; } int main() { ios_base::sync_with_stdio(false); input(); lolicon(); output(); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long M = 1e9 + 7; const long long INF = LLONG_MAX / 2; const long long N = 1e4; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t; cin >> t; while (t--) { long long n, k; cin >> n >> k; string s; cin >> s; sort(s.begin(), s.end()); char last = s[n - 1]; vector<string> a(k); for (long long i = 0; i < k; i++) a[i].append(1, s[i]); long long i = k, j = 0; if (count(a.begin(), a.end(), a[0]) == k && s[i] == last) while (i < n) { a[j % k].append(1, s[i]); i++; j++; } else a[j].append(s.substr(k, n - k)); cout << *max_element(a.begin(), a.end()) << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; long double PI = acosl(-1); bool compare_int(int a, int b) { return (a > b); } bool compare_string(string a, string b) { return a.size() < b.size(); } bool compare_pair(const pair<int, int> &a, const pair<int, int> &b) { if (a.second == b.second) return a.first > b.first; else return (a.second > b.second); } int32_t main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int r, c; cin >> r >> c; if (r == 1 and c == 1) { cout << 0 << endl; return 0; } if (r == 1) { for (int i = 1; i <= c; i++) cout << i + 1 << ; return 0; } if (c == 1) { for (int i = 1; i <= r; i++) cout << i + 1 << endl; return 0; } for (int i = 1; i <= r; i++) { for (int j = 1; j <= c; j++) { cout << i * (r + j); j == c ? cout << endl : cout << ; } } } |
#include <bits/stdc++.h> using namespace std; int n, n1, n2, mn, mx; int A[100001]; int main() { cin >> n >> n1 >> n2; for (int i = 0; i < n; i++) { cin >> A[i]; } sort(A, A + n); mn = min(n1, n2); mx = max(n1, n2); double s1 = 0; double s2 = 0; int nr = 0; int k = 0; for (int i = n - 1; k < mn; i--, k++) { s1 = s1 + A[i]; nr = i; } k = 0; for (int i = nr - 1; k < mx; i--, k++) { s2 = s2 + A[i]; } cout << fixed << s1 / mn + s2 / mx << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; double res; long long n, m, k, i, j, x = 1, y, t, a[1000001], b[1000001]; int main() { cin >> n; for (i = 1; i <= n; i++) { cin >> t; if (t == 1) { cin >> k >> m; a[k] += m; y += k * m; printf( %.10f , (double)y / x); cout << endl; } if (t == 2) { cin >> k; y += k; x++; b[x] = k; printf( %.10f , (double)y / x); cout << endl; } if (t == 3) { a[x - 1] += a[x]; y -= a[x] + b[x]; a[x] = 0; x--; printf( %.10f , (double)y / x); cout << endl; } } } |
#include <bits/stdc++.h> using namespace std; const signed long long int INF = 1e9; int main() { int n; cin >> n; vector<signed long long int> a(n); for (int i(0); i < n; i++) { scanf( %lld , &a[i]); } int s, f; scanf( %d %d , &s, &f); vector<signed long long int> d(n + 1); d[0] = a[0]; for (int i(1); i < n; i++) { d[i] = d[i - 1] + a[i]; } signed long long int ans = 0; signed long long int tp = INF; for (int i(0); i < n; i++) { int l = (i + s - 1 + n) % n; int r = (i + f - 2 + n) % n; signed long long int tmp = 0; if (l <= r) { tmp += d[r]; if (l - 1 >= 0) tmp -= d[l - 1]; } else { tmp += d[r]; tmp += d[n - 1]; if (l - 1 >= 0) tmp -= d[l - 1]; } if (ans <= tmp) { signed long long int ti; if (i == 0) ti = 1; else ti = n - 1 - i + 2; if (ans == tmp) { tp = min(tp, ti); } else { ans = tmp; tp = ti; } } } cout << tp; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, x; cin >> n; if (n % 2 == 0) { x = n / 2; cout << x * (x + 1); } else { x = (n + 1) / 2; cout << (x - 1) * x + x; } return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.