func_code_string
stringlengths 59
71.4k
|
|---|
/*mjytxdy!*/ #include <bits/stdc++.h> using namespace std; #define pb push_back #define fi first #define se second #define all(x) x.begin(),x.end() #define SZ(x) ((int)x.size()) #define pii pair<int,int> #define pil pair<int,ll> #define pli pair<ll,int> #define pll pair<ll,ll> #define inl inline #define rep(i,l,r) for(int i=(l);i<=(r);i++) #define per(i,r,l) for(int i=(r);i>=(l);i--) #define trv(i,u) for(int i=head[u];i;i=e[i].next) #define lb(x) ((x)&(-(x))) #define debug(x) cout<<#x : <<x<< n #define myput puts( QaQ ) #define file(x) freopen(#x .in , r ,stdin),freopen(#x .out , w ,stdout); typedef long long ll; template<class T>inl bool ylmin(T &a,T b){return a<b?0:(a=b,1);} template<class T>inl bool ylmax(T &a,T b){return a>b?0:(a=b,1);} template<class T>inl T abs(T x){return x<0?-x:x;} inl char read(){ static const int IO_LEN=1024*1024; static char buf[IO_LEN],*ioh,*iot; if(ioh==iot){ iot=(ioh=buf)+fread(buf,1,IO_LEN,stdin); if(ioh==iot) return -1; } return *ioh++; } template<class T>inl void read(T &x){ static int iosig;static char ioc; for(iosig=0,ioc=read();!isdigit(ioc);ioc=read()) if(ioc== - ) iosig=1; for(x=0;isdigit(ioc);ioc=read())x=(x<<1)+(x<<3)+(ioc^ 0 ); if(iosig) x=-x; } const int MAXN = 1e5 + 10; struct Node{ int x,y; }a[MAXN]; int n,m; vector<int> S,T,Set; map<pii,bool> Map; inl bool cmp(Node a,Node b){ return a.x-a.y>b.x-b.y; } struct Segment{ #define ls rt<<1 #define rs rt<<1|1 pii Min[MAXN<<2]; int tag; inl void pushup(int rt){ Min[rt]=min(Min[ls],Min[rs]); } inl pii query(int rt,int l,int r,int L,int R){ if(L>R) return {2e9,-1}; if(l>=L && r<=R) return Min[rt]; int mid=l+r>>1; if(R<=mid) return query(ls,l,mid,L,R); else if(L>mid) return query(rs,mid+1,r,L,R); else return min(query(ls,l,mid,L,R),query(rs,mid+1,r,L,R)); } inl void update(int rt,int l,int r,int pos) { if(l==r) return Min[rt]={2e9,-1},void(); int mid=l+r>>1; if(pos<=mid) update(ls,l,mid,pos); else update(rs,mid+1,r,pos); pushup(rt); } inl void build(int rt,int l,int r,int opt){ if(l==r) { Min[rt]={opt?a[l].y:a[l].x,l}; return ; } int mid=l+r>>1; build(ls,l,mid,opt),build(rs,mid+1,r,opt); pushup(rt); } #undef ls #undef rs }t[2]; int main(){ //freopen( in.txt , r ,stdin); read(n),read(m); rep(i,1,n) read(a[i].x),read(a[i].y),Map[{a[i].x,a[i].y}]=1; sort(a+1,a+n+1,cmp); per(i,n,1) Set.push_back(a[i].x-a[i].y); t[0].build(1,1,n,0),t[1].build(1,1,n,1); int delta=0;S.push_back(-1),T.push_back(-1); rep(i,1,n) { int pos=n-(lower_bound(all(Set),delta)-Set.begin())+1; pii lans=t[0].query(1,1,n,1,pos-1),rans=t[1].query(1,1,n,pos,n); lans.fi-=t[0].tag,rans.fi-=t[1].tag; pii Min=min(lans,rans); int id=Min.se; if(a[id].x-a[id].y==delta) { if(S.back()!=a[id].x && T.back()!=a[id].y) { t[0].tag++,S.push_back(a[id].x); t[1].tag++,T.push_back(a[id].y); } } else if(a[id].x-a[id].y>delta) { if(S.back()!=a[id].x) delta++,t[0].tag++,S.push_back(a[id].x); } else if(a[id].x-a[id].y<delta) { if(T.back()!=a[id].y) delta--,t[1].tag++,T.push_back(a[id].y); } t[0].update(1,1,n,id);t[1].update(1,1,n,id); } rep(i,1,m) { int x,y; read(x),read(y); if(Map[{x,y}]) {puts( LOSE );continue;} if(binary_search(all(S),x) || binary_search(all(T),y)) {puts( WIN );continue;} x-=lower_bound(all(S),x)-S.begin(); y-=lower_bound(all(T),y)-T.begin(); puts(x==y? LOSE : WIN ); } return 0; } |
#include <bits/stdc++.h> using std::bitset; using std::cerr; using std::cin; using std::complex; using std::cout; using std::deque; using std::endl; using std::ios_base; using std::iterator; using std::map; using std::max; using std::max_element; using std::min; using std::min_element; using std::multimap; using std::multiset; using std::pair; using std::queue; using std::reverse; using std::set; using std::sort; using std::stable_sort; using std::stack; using std::string; using std::swap; using std::unique; using std::vector; namespace MySpace { struct Small_Segment_Tree { vector<int> a; int l, r; private: int __summ(int L, int R, int l, int r, int v) { if (L <= l && r <= R) return a[v]; if (R <= l || r <= L) return 0; int m = (l + r) / 2; return __summ(L, R, l, m, 2 * v + 1) + __summ(L, R, m, r, 2 * v + 2); } void __set(int P, int l, int r, int v, int V) { if (l + 1 == r) { a[v] = V; return; } int m = (l + r) / 2; if (P < m) { __set(P, l, m, 2 * v + 1, V); a[v] = a[2 * v + 1] + a[2 * v + 2]; } else { __set(P, m, r, 2 * v + 2, V); a[v] = a[2 * v + 1] + a[2 * v + 2]; } } public: int Summ(int L, int R) { if (R < L) return 0; return __summ(L, R + 1, l, r, 0); } void Set(int P, int V) { __set(P, l, r, 0, V); } Small_Segment_Tree(int _n) { a.resize(4 * _n); l = 0, r = _n; } }; long long inq(long long x, long long q, long long MOD) { if (q == 0) return 1; long long l = inq(x, q / 2, MOD); if (q % 2) return l * l % MOD * x % MOD; return l * l % MOD; } }; // namespace MySpace using namespace MySpace; long long n, m; long long a[500000]; int main() { ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0); cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = n; i < 2 * n; i++) cin >> a[i]; sort(a, a + 2 * n); long long s1 = 0, s2 = 0; for (int i = 0; i < n; i++) s1 += a[i]; for (int i = n; i < 2 * n; i++) s2 += a[i]; if (s1 == s2) { cout << -1; return 0; } for (int i = 0; i < 2 * n; i++) cout << a[i] << ; } |
#include <bits/stdc++.h> struct event { int t, time, L, R, idx; event() {} event(int t, int time, int L, int R, int idx) : t(t), time(time), L(L), R(R), idx(idx) {} bool operator<(const event& a) const { return (time < a.time || (time == a.time && t < a.t)); } } e[200005 * 23]; int n, m, i, j, ai, place[200005], L, R, en, idx, ans[200005], fw[200005]; void modify(int j) { for (; j <= n; j = (j | (j - 1)) + 1) ++fw[j]; } int query(int j) { int rt = 0; for (; j; j &= (j - 1)) rt += fw[j]; return rt; } int main(int argc, char* const argv[]) { scanf( %d%d , &n, &m); for (i = 1; i <= n; i++) { scanf( %d , &ai); place[ai] = i; } for (i = 1; i <= m; i++) { scanf( %d%d , &L, &R); e[++en] = event(2, R, L, R, i); e[++en] = event(2, L - 1, L, R, -i); } for (i = 1; i <= n; i++) { j = i; while (j <= n) { e[++en] = event(1, place[i], place[j], 0, 0); j += i; } } std::sort(e + 1, e + en + 1); for (i = 1; i <= en; i++) if (e[i].t == 1) modify(e[i].L); else { idx = abs(e[i].idx); ans[idx] += (query(e[i].R) - query(e[i].L - 1)) * (e[i].idx / idx); } for (i = 1; i <= m; i++) printf( %d n , ans[i]); return 0; } |
#include <bits/stdc++.h> const int inf = 0x7FFFFFFF; using namespace std; int dep[2014], shortcut[20][2014]; struct Edge { int u, v, w; bool operator<(const Edge &A) const { return w < A.w; } } E[4000005]; int mp[2014][2014]; int fa[2014], d[2014]; int find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]); } vector<int> G[2014], Q; int get_lca(int a, int b) { if (dep[a] < dep[b]) swap(a, b); for (int i = 20 - 1; i >= 0; i--) { if (dep[a] - dep[b] >> i & 1) { a = shortcut[i][a]; } } if (a == b) return a; for (int i = 20 - 1; i >= 0; i--) { if (shortcut[i][a] != shortcut[i][b]) { a = shortcut[i][a]; b = shortcut[i][b]; } } return shortcut[0][a]; } int main() { int N; scanf( %d , &N); for (int i = 1; i <= N; i++) for (int j = 1; j <= N; j++) scanf( %d , &mp[i][j]); int tot = 0; for (int i = 1; i <= N; i++) for (int j = i + 1; j <= N; j++) { E[tot].u = i; E[tot].v = j; E[tot].w = mp[i][j]; tot++; } sort(E, E + tot); for (int i = 1; i <= N; i++) fa[i] = i; for (int i = 0; i < tot; i++) { int u = E[i].u; int v = E[i].v; if (find(u) != find(v)) { fa[find(u)] = find(v); G[u].push_back(v); G[u].push_back(E[i].w); G[v].push_back(u); G[v].push_back(E[i].w); } } int *parent = shortcut[0]; d[1] = 0; parent[1] = -1; dep[1] = 0; Q.push_back(1); for (int head = 0; head < int(Q.size()); head++) { int u = Q[head]; for (int i = 0; i < int(G[u].size()); i += 2) { int v = G[u][i]; int w = G[u][i + 1]; if (v != parent[u]) { parent[v] = u; dep[v] = dep[u] + 1; d[v] = d[u] + w; Q.push_back(v); } } } for (int i = 1; i < 20; i++) { for (int j = 1; j <= N; j++) { int &res = shortcut[i][j]; res = shortcut[i - 1][j]; if (~res) { res = shortcut[i - 1][res]; } } } bool ok = true; int num = 0; for (int i = 1; i <= N; i++) if (fa[i] == i) num++; if (num > 1) ok = false; for (int u = 1; ok && u <= N; u++) { if (mp[u][u] != 0) ok = false; for (int v = u + 1; ok && v <= N; v++) { if (mp[u][v] != mp[v][u]) ok = false; if (mp[u][v] == 0) ok = false; int mid = get_lca(u, v); if (d[u] + d[v] - d[mid] * 2 != mp[u][v]) ok = false; } } puts(ok ? YES : NO ); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long inf = 1e18; const long long mod = 1e9 + 7; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); long long q; cin >> q; ; for (long long i = (1); i <= (q); i++) { long long n; cin >> n; ; long long r; cin >> r; ; set<long long, greater<long long>> s; for (long long i = (1); i <= (n); i++) { long long x; cin >> x; ; s.insert(x); } long long k = 0, st = 0; for (long long j : s) { if (j - r * k <= 0) { cout << k << n ; st = 1; break; } k++; } if (!st) cout << k << n ; } } |
#include <bits/stdc++.h> using namespace std; const int mx = 2e5 + 10; long long x[mx], y[mx]; ifstream fin( input.txt ); ofstream fout( output.txt ); long long sum[5]; int main() { string b; cin >> b; int x = 0, y = 0; for (int i = 0; i < b.size(); i++) { if (b[i] == x ) x++; else y++; } if (x > y) { for (int i = 1; i <= x - y; i++) cout << x ; return 0; } for (int i = 1; i <= y - x; i++) cout << y ; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; const int M = 1e9 + 7; const int MOD = 998244353; const double PI = 3.141592653589793238460; const int bs = 1e9 + 7; unsigned long long power(unsigned long long a, unsigned long long b) { unsigned long long res = 1; if (a == 0) return 0; if (a == 1) return 1; for (; b > 0; b >>= 1) { if (b & 1) res = (res * a); if (res > MOD) res %= MOD; a = (a * a); if (a > MOD) a = a % MOD; } return res; } bool isPrime[1000001]; vector<unsigned long long> prime; void seive(int limit) { isPrime[0] = isPrime[1] = 1; for (int i = 2; i * i <= limit; i++) { if (!isPrime[i]) for (int j = i * i; j <= limit; j += i) { isPrime[j] = 1; } } for (int i = 2; i <= limit; i++) if (!isPrime[i]) prime.push_back(i); } map<string, int> m; unsigned long long parent[100100], sz[100100]; vector<pair<unsigned long long, unsigned long long>> v[100010]; vector<pair<pair<unsigned long long, unsigned long long>, pair<unsigned long long, unsigned long long>>> rem; int visited[100010], valid[100010], cum[100110]; int n, q1, q2; int finds(int i) { while (parent[i] != i) i = parent[i]; return i; } int unions(int x, int y) { int xr = finds(x); int yr = finds(y); if (xr == yr) return 0; if (sz[xr] > sz[yr]) parent[yr] = xr; else if (sz[xr] < sz[yr]) parent[xr] = yr; else { sz[yr]++; parent[xr] = yr; } return 1; } void dfs(int node, int pnode, int x) { cum[node] = x; visited[node] = 1; for (int i = 0; i < v[node].size(); i++) { if (!visited[v[node][i].first]) dfs(v[node][i].first, node, x ^ (v[node][i].second)); } } void process() { for (int i = 0; i < n; i++) if (!visited[i]) dfs(i, i, 0); for (int i = 0; i < rem.size(); i++) { int x = rem[i].first.first, y = rem[i].first.second; int idx = rem[i].second.first, t = rem[i].second.second; if (cum[x] ^ cum[y] != t) valid[idx] = 0; else valid[idx] = 1; } } int main() { ios_base::sync_with_stdio(false), cin.tie(0); int tt = 1; while (tt--) { cin >> n >> q1 >> q2; for (int i = 0; i < n; i++) { string s; cin >> s; m[s] = i; parent[i] = i; sz[i] = 0; } for (int i = 0; i < q1; i++) { int t; cin >> t; string a, b; cin >> a >> b; int x = m[a], y = m[b]; if (unions(x, y)) { v[x].push_back({y, t - 1}); v[y].push_back({x, t - 1}); valid[i] = 1; } else rem.push_back({{x, y}, {i, t - 1}}); } process(); for (int i = 0; i < q1; i++) { if (valid[i]) cout << YES << n ; else cout << NO << n ; } for (int i = 0; i < q2; i++) { string a, b; cin >> a >> b; int x = m[a], y = m[b]; if (finds(x) != finds(y)) cout << 3 << n ; else cout << (cum[x] ^ cum[y]) + 1 << n ; } } } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n, m; cin >> n >> m; if (n > 26) cout << m; else { n = pow(2, n); cout << m % n; } return 0; } |
#include <bits/stdc++.h> const long long INFLL = 1e18; using namespace std; const int MAXN = 2 * 100000; const int INF = 1000 * 1000 * 1000; int a[MAXN + 1], used[MAXN + 10]; int main() { int n; scanf( %d , &n); int ans = 1; for (int i = 0; i < n; i++) { scanf( %d , &a[i]); if (used[a[i]]) { ans++; } used[a[i]] = 1; } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<vector<int>> segT; vector<int> lazy; long long n, m, l, r; string s; void buildT(int ss, int se, int si) { if (ss == se) { if (s[ss] == 4 ) segT[si][0] = 1; else segT[si][1] = 1; segT[si][2] = 1; segT[si][3] = 1; return; } int mid = (ss + se) / 2; buildT(ss, mid, 2 * si + 1); buildT(mid + 1, se, 2 * si + 2); segT[si][0] = segT[2 * si + 1][0] + segT[2 * si + 2][0]; segT[si][1] = segT[2 * si + 1][1] + segT[2 * si + 2][1]; segT[si][2] = max(segT[2 * si + 1][2] + segT[2 * si + 2][1], segT[2 * si + 1][0] + segT[2 * si + 2][2]); segT[si][3] = max(segT[2 * si + 1][3] + segT[2 * si + 2][0], segT[2 * si + 1][1] + segT[2 * si + 2][3]); } void upd(int ss, int se, int si) { if (lazy[si] == 1) { swap(segT[si][0], segT[si][1]); swap(segT[si][2], segT[si][3]); if (ss != se) { lazy[2 * si + 1] ^= 1; lazy[2 * si + 2] ^= 1; } lazy[si] = 0; } if (r < ss || l > se) return; if (ss >= l && se <= r) { swap(segT[si][0], segT[si][1]); swap(segT[si][2], segT[si][3]); if (ss != se) { lazy[2 * si + 1] ^= 1; lazy[2 * si + 2] ^= 1; } return; } int mid = (ss + se) / 2; upd(ss, mid, 2 * si + 1); upd(mid + 1, se, 2 * si + 2); segT[si][0] = segT[2 * si + 1][0] + segT[2 * si + 2][0]; segT[si][1] = segT[2 * si + 1][1] + segT[2 * si + 2][1]; segT[si][2] = max(segT[2 * si + 1][2] + segT[2 * si + 2][1], segT[2 * si + 1][0] + segT[2 * si + 2][2]); segT[si][3] = max(segT[2 * si + 1][3] + segT[2 * si + 2][0], segT[2 * si + 1][1] + segT[2 * si + 2][3]); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int i, j; cin >> n >> m; cin >> s; long long lim = 2 * pow(2, ceil(log(n) / log(2.0))) + 2; vector<int> temp(lim, 0); vector<vector<int>> temp2(lim, vector<int>(4, 0)); segT = temp2; lazy = temp; buildT(0, n - 1, 0); string typ; for (i = 0; i < m; i++) { cin >> typ; if (typ.compare( switch ) == 0) { cin >> l >> r; l -= 1; r -= 1; upd(0, n - 1, 0); } else { if (lazy[0] == 1) cout << segT[0][3] << endl; else cout << segT[0][2] << endl; } } } |
#include <bits/stdc++.h> using namespace ::std; int main() { long long int temp, q, v1, v2, t, d, i, sum = 0; cin >> v1 >> v2 >> t >> d; long long int a[t]; sum = d * (t - 1); i = 0; temp = 0; bool ff = false; while (1) { if (!ff) { i += v1; a[temp] = i; temp++; ff = true; continue; } else if (i + d - sum + d <= v2) { i += d; sum -= d; a[temp] = i; } else { for (long long int k = d - 1; k >= -d; k--) { if (i + k - sum + d <= v2) { i += k; sum -= d; a[temp] = i; break; } } } temp++; if (temp == t) break; } long long int s = 0; for (long long int j = 0; j < t; j++) s += a[j]; cout << s; } |
#include <bits/stdc++.h> using namespace std; const long long N = 1e6 + 1e5, inf = 3e18, mod = 1e9 + 7; long long tc, n, m, q, a, b, c, d, i, j, k; long long A[N]; vector<long long> vec; string s; int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> tc; while (tc--) { cin >> n >> m; long long flag1 = 0, flag2 = 0; for (i = 2; i < n + 2; i++) { cin >> A[i]; if (A[i] == m) flag1 = 1; if (A[i] >= m && (A[i - 1] >= m || A[i - 2] >= m)) flag2 = 1; } if (flag1 && flag2 || (n == 1 && A[2] == m)) cout << yes n ; else cout << no n ; } } |
#include <bits/stdc++.h> using namespace std; const long long int N = 2e5 + 5; void solve() { long long int n; cin >> n; double ans, pi = 3.14159265358979323846; double rad = (2.0 * sin(pi / (2.0 * (double)n))); ans = (cos(pi / (4.0 * n))) / sin(pi / (2.0 * (double)n)); cout << fixed << setprecision(15) << ans << n ; } signed main() { ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL); long long int t = 1; cin >> t; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, l[10], r[10], t = 1; double ans = 0, o = 1; cin >> n; for (int i = 0; i < n; i++) { t *= 2; cin >> l[i] >> r[i]; o *= r[i] - l[i] + 1; } if (n == 1) { cout << setprecision(10) << fixed << (r[0] + l[0]) / 2.0 << endl; return 0; } for (int i = 1; i <= 10000; i++) { for (int g = 0; g < n; g++) { if (r[g] <= i) continue; for (int j = 1; j < t; j++) { int a[10] = {}, t2 = j, o = 0; while (t2) { a[o++] = t2 % 2; t2 /= 2; } if (a[g]) continue; double k = 1; bool ch = 0; for (int h = 0; h < n; h++) { if (h == g) continue; if (a[h] && (r[h] < i || l[h] > i)) { ch = 1; h = n; } if (!a[h] && l[h] >= i) { ch = 1; h = n; } if (!a[h]) k *= min(i - 1, r[h]) - l[h] + 1; } if (ch) continue; k *= r[g] - max(i + 1, l[g]) + 1; ans += k * i; } } } for (int i = 1; i <= 10000; i++) { for (int j = 1; j < t; j++) { int a[10] = {}, t2 = j, o = 0, d = 0; while (t2) { a[o++] = t2 % 2; if (a[o - 1]) d++; t2 /= 2; } double k = 1; if (d == 1) continue; bool ch = 0; for (int h = 0; h < n; h++) { if (a[h] && (r[h] < i || l[h] > i)) { ch = 1; h = n; } if (!a[h] && l[h] >= i) { ch = 1; h = n; } if (!a[h]) k *= min(i - 1, r[h]) - l[h] + 1; } if (ch) continue; ans += k * i; } } cout << setprecision(10) << fixed << ans / o << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; template <class T> inline T read() { T x = 0, f = 1; char s = getchar(); while (s < 0 || s > 9 ) { if (s == - ) f = -1; s = getchar(); }; while (s >= 0 && s <= 9 ) { x = (x << 3) + (x << 1) + s - 48; s = getchar(); }; return x * f; } template <typename T> inline void wri(T x) { if (x < 0) { x = -x; putchar( - ); }; if (x / 10) wri(x / 10); putchar(x % 10 + 48); } template <typename T> inline void print(T x, char s) { wri(x); putchar(s); } struct node { int l, r, val, add; } e[800010]; int a[200010], ans[200010]; void build_tree(int node, int start, int end) { e[node].l = start, e[node].r = end; if (start == end) { e[node].add = 0; e[node].val = a[start]; return; } int mid = (start + end) >> 1; build_tree(node << 1, start, mid), build_tree(node << 1 | 1, mid + 1, end); } void update(int x, int q, int val) { if (e[x].l == q && e[x].r == q) { e[x].val = val, e[x].add = 0; return; } int mid = (e[x].l + e[x].r) >> 1; e[x << 1].add = max(e[x << 1].add, e[x].add); e[x << 1 | 1].add = max(e[x << 1 | 1].add, e[x].add); e[x].add = 0; if (q <= mid) update(x << 1, q, val); else update(x << 1 | 1, q, val); } void query(int x) { if (e[x].l == e[x].r) { ans[e[x].l] = max(e[x].val, e[x].add); return; } e[x << 1].add = max(e[x << 1].add, e[x].add); e[x << 1 | 1].add = max(e[x << 1 | 1].add, e[x].add); query(x << 1), query(x << 1 | 1); } int main() { int n; n = read<int>(); for (register int i = (1); i < (n + 1); i++) a[i] = read<int>(); build_tree(1, 1, n); int q; q = read<int>(); while (q--) { int x, y, z; x = read<int>(); if (x == 1) { y = read<int>(), z = read<int>(); update(1, y, z); } else y = read<int>(), e[1].add = max(e[1].add, y); } query(1); for (register int i = (1); i < (n + 1); i++) print(ans[i], ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; string cnv; cnv.reserve(62); for (char i = a ; i <= z ; ++i) { cnv.push_back(i); } for (char i = A ; i <= Z ; ++i) { cnv.push_back(i); } for (char i = 0 ; i <= 9 ; ++i) { cnv.push_back(i); } for (int i = 0; i < t; ++i) { int n, m, k; cin >> n >> m >> k; vector<string> mas(n); int cnt = 0; for (int j = 0; j < n; ++j) { cin >> mas[j]; for (char c : mas[j]) { cnt += (c == R ); } } int cur = 0; int perc = cnt / k; int bigger = cnt % k; int curcnt = 0; for (int i = 0; i < n; ++i) { if (i & 1) { for (int j = 0; j < m; ++j) { if (mas[i][j] == R && curcnt == perc + (cur < bigger)) { ++cur; curcnt = 0; } if (mas[i][j] == R ) ++curcnt; mas[i][j] = cnv[cur]; } } else { for (int j = m - 1; j >= 0; --j) { if (mas[i][j] == R && curcnt == perc + (cur < bigger)) { ++cur; curcnt = 0; } if (mas[i][j] == R ) ++curcnt; mas[i][j] = cnv[cur]; } } } for (int i = 0; i < n; ++i) { cout << mas[i] << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, k, l[50 + 1]; void Answer() { int j = 1, s = n; for (int i = 1; i <= k; i++) { if (i > s) s += n - (++j) + 1; cout << j << ; for (int u = n - 1; u > n - j; u--) cout << l[u] << ; cout << l[s - i] << endl; } } int main() { cin >> n >> k; for (int i = 0; i < n; i++) cin >> l[i]; sort(l, l + n); Answer(); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> inline void smin(T &a, U b) { if (a > b) a = b; } template <typename T, typename U> inline void smax(T &a, U b) { if (a < b) a = b; } int power(int a, int b, int m, int ans = 1) { for (; b; b >>= 1, a = 1LL * a * a % m) if (b & 1) ans = 1LL * ans * a % m; return ans; } char s[500010]; int l[12], r[12]; int sz, ed; int cnt[500010], ord[500010 << 1]; struct node { int deep, fail, cnt, nxt[30], val[12]; void clear() { memset(nxt, -1, sizeof nxt); memset(val, 0, sizeof val); deep = fail = cnt = 0; } } mem[500010 << 1]; struct automaton { void init() { for (int i = 0; i < 26; i++) mem[0].nxt[i] = 1; mem[0].deep = -1; mem[1].clear(); mem[1].cnt = 1; sz = 2, ed = 1; } void insert(int c, int id) { if (~mem[ed].nxt[c]) { int p1 = mem[ed].nxt[c]; if (mem[p1].deep == mem[ed].deep + 1) { mem[p1].val[id]++; ed = p1; return; } int p2 = sz++; mem[p2] = mem[p1]; mem[p2].deep = mem[ed].deep + 1; mem[p2].cnt = 0; for (int i = 0; i < 12; i++) mem[p2].val[i] = 0; mem[p2].val[id] = 1; mem[p1].fail = p2; while (mem[ed].nxt[c] == p1) { mem[ed].nxt[c] = p2; mem[p1].cnt -= mem[ed].cnt; mem[p2].cnt += mem[ed].cnt; ed = mem[ed].fail; } ed = p2; return; } int p = sz++; mem[p].clear(); mem[p].deep = mem[ed].deep + 1; mem[p].val[id] = 1; while (mem[ed].nxt[c] == -1) { mem[ed].nxt[c] = p; mem[p].cnt += mem[ed].cnt; ed = mem[ed].fail; } int p1 = mem[ed].nxt[c]; if (mem[p1].deep == mem[ed].deep + 1) mem[p].fail = p1; else { int p2 = sz++; mem[p2] = mem[p1]; mem[p2].deep = mem[ed].deep + 1; mem[p2].cnt = 0; for (int i = 0; i < 12; i++) mem[p2].val[i] = 0; mem[p].fail = mem[p1].fail = p2; while (mem[ed].nxt[c] == p1) { mem[ed].nxt[c] = p2; mem[p1].cnt -= mem[ed].cnt; mem[p2].cnt += mem[ed].cnt; ed = mem[ed].fail; } } ed = p; } void build(int n) { memset(cnt, 0, sizeof cnt); for (int i = 1; i < sz; i++) cnt[mem[i].deep]++; for (int i = 1; i < 500010; i++) cnt[i] += cnt[i - 1]; for (int i = 1; i < sz; i++) ord[--cnt[mem[i].deep]] = i; for (int i = sz - 2; i >= 0; i--) { int cur = ord[i], prv = mem[cur].fail; for (int j = 0; j <= n; j++) mem[prv].val[j] += mem[cur].val[j]; } long long ans = 0; for (int i = 2; i < sz; i++) if (mem[i].val[n]) { int ok = 1; for (int j = 0; j < n; j++) if (mem[i].val[j] < l[j] || mem[i].val[j] > r[j]) { ok = 0; break; } if (ok) ans += mem[i].cnt; } printf( %I64d n , ans); } } sam; int main() { int n; scanf( %s %d , s, &n); sam.init(); int len = strlen(s); for (int i = 0; i < len; i++) sam.insert(s[i] - a , n); for (int i = 0; i < n; i++) { scanf( %s %d %d , s, l + i, r + i); ed = 1; len = strlen(s); for (int j = 0; j < len; j++) sam.insert(s[j] - a , i); } sam.build(n); } |
#include <bits/stdc++.h> using namespace std; double cal(int n, int *a, double x) { double ret = 0, t1 = 0, t2 = 0; for (int i = 0; i < n; i++) { t1 += a[i] - x; t2 += a[i] - x; t1 = max(0., t1); t2 = min(0., t2); ret = max(ret, t1); ret = max(ret, -t2); } return ret; } int main() { int n; scanf( %d , &n); static int a[200000]; for (int i = 0; i < n; i++) { scanf( %d , a + i); } double l = -10001, r = 10001, ans; for (int t = 0; t < 100; t++) { double d1 = (2 * l + r) / 3, d2 = (l + 2 * r) / 3; double e1 = cal(n, a, d1), e2 = cal(n, a, d2); if (e1 <= e2) { r = d2; ans = e1; } else { l = d1; ans = e2; } } printf( %.9lf n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1005; char g[N][N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) { long double h, c, t; cin >> h >> c >> t; if (t >= h) { cout << 1 n ; continue; } if ((h + c) / 2 >= t) { cout << 2 n ; continue; } int x = 0; x = (h - t) / (2 * t - h - c); long double curd = 100000000.0; int res = -1; for (int i = max(0, x - 50); i <= x + 50; ++i) { long double xx = (i + 1) * h + i * c; xx = 1.0 * xx / (2 * i + 1); xx = abs(xx - t); if (xx < curd) { curd = xx; res = i; } } cout << 2 * res + 1 << n ; } } |
#include <bits/stdc++.h> using namespace std; int Day12[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; int prime100[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103}; template <typename T> inline bool isLeap(T y) { return (y % 400 == 0) || (y % 100 ? y % 4 == 0 : false); } template <typename T> inline T GCD(T a, T b) { a = abs(a); b = abs(b); if (a < b) swap(a, b); while (b) { a = a % b; swap(a, b); } return a; } template <typename T> inline T LCM(T x, T y) { T tp = GCD(x, y); if ((x / tp) * 1. * y > 9e18) return 9e18; return (x / tp) * y; } template <typename T> inline T BIGMOD(T A, T B, T M = 1000000007) { T ret = 1; while (B) { if (B & 1) ret = (ret * A) % M; A = (A * A) % M; B = B >> 1; } return ret; } template <typename T> inline T BigMod(T A, T B, T M) { T ret = 1; while (B) { if (B & 1) ret = (ret * A) % M; A = (A * A) % M; B = B >> 1; } return ret; } long long int MySqrt(long long int n) { long long int p = sqrt(n); if ((p + 1) * (p + 1) <= n) return p + 1; else if (p * p <= n) return p; else return p - 1; } long long int MyPow(long long int x, long long int n) { if (n == 0) return 1; else if (n % 2 == 0) return MyPow(x * x, n / 2); else return x * MyPow(x * x, ((n - 1) / 2)); } long long int modInverse(long long int n) { return BIGMOD(n, (long long int)1000000007 - 2) % 1000000007; } void solve() { long long int ans = 1, n; cin >> n; if (n % 2 == 1) printf( 0 n ); else { n /= 2; for (int i = 1; i <= n; i++) ans *= 2; printf( %lld n , ans); } } char arr[505][505]; int Left[505][505]; int Right[505][505]; int Up[505][505]; int Low[505][505]; void Now() { int n, m, cnt = 0; cin >> n >> m; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> arr[i][j]; if (arr[i][j] == * ) cnt++; } } for (int i = 1; i < n; i++) { for (int j = 0; j < m; j++) { if (arr[i - 1][j] == * ) Up[i][j] += 1 + Up[i - 1][j]; } } for (int i = 0; i < n; i++) { for (int j = 1; j < m; j++) { if (arr[i][j - 1] == * ) Left[i][j] += 1 + Left[i][j - 1]; } } for (int i = n - 1; i >= 0; i--) { for (int j = m - 2; j >= 0; j--) { if (arr[i][j + 1] == * ) Right[i][j] += 1 + Right[i][j + 1]; } } for (int i = n - 2; i >= 0; i--) { for (int j = m - 1; j >= 0; j--) { if (arr[i + 1][j] == * ) Low[i][j] += 1 + Low[i + 1][j]; } } for (int i = 1; i < n - 1; i++) { for (int j = 1; j < m - 1; j++) { if (Left[i][j] > 0 && Up[i][j] > 0 && Right[i][j] > 0 && Low[i][j] > 0 && arr[i][j] == * ) { if (Left[i][j] + Up[i][j] + Right[i][j] + Low[i][j] + 1 == cnt) { printf( YES n ); exit(0); } } } } printf( NO n ); } int main() { solve(); } |
#include <bits/stdc++.h> using namespace std; void solve() { int n, m; int x, y; int z = 1; cin >> n >> m; cin >> x >> y; cout << x << << y << n ; cout << 1 << << y << n ; for (int i = 1; i <= n; i++) { vector<pair<int, int>> v; for (int j = 1; j <= m; j++) { if ((i == x && j == y) || (i == 1 && j == y)) continue; v.push_back({i, j}); } if (z) { reverse(v.begin(), v.end()); } for (auto it : v) { cout << it.first << << it.second << n ; } z ^= 1; } } int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; int n, q, a[N], node[4 * N]; vector<int> pos[N]; void init(int i, int l, int r) { if (l == r) { node[i] = (a[l] == 0 ? 1e9 : a[l]); return; } int m = (l + r) >> 1; init(i << 1, l, m); init(i << 1 | 1, m + 1, r); node[i] = min(node[i << 1], node[i << 1 | 1]); } int get(int i, int l, int r, int a, int b) { if (l > r || a > r || b < l) return (int)1e9; if (a <= l && r <= b) return node[i]; int m = (l + r) >> 1; return min(get(i << 1, l, m, a, b), get(i << 1 | 1, m + 1, r, a, b)); } int main() { scanf( %d %d , &n, &q); bool f = false; bool zero = false; for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); if (a[i] == q) f = true; if (a[i]) pos[a[i]].push_back(i); else zero = true; } if (!f && !zero) return !printf( NO ); init(1, 1, n); for (int i = 1; i <= q; i++) { if (pos[i].size() > 0) { if (get(1, 1, n, pos[i][0], pos[i][pos[i].size() - 1]) < i) return !printf( NO ); } } puts( YES ); int l = 1; while (l <= n) { while (l <= n && a[l]) l++; int r = l; while (r <= n && !a[r]) r++; if (l > 1) { for (int j = l; j < r; j++) a[j] = f ? a[l - 1] : q; if (!f) f = true; } else if (r <= n) { for (int j = l; j < r; j++) a[j] = f ? a[r] : q; if (!f) f = true; } else for (int j = l; j < r; j++) a[j] = q; l = r; } for (int i = 1; i <= n; i++) printf( %d , a[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> inline void ckmax(T& x, T y) { x = (y > x ? y : x); } template <typename T> inline void ckmin(T& x, T y) { x = (y < x ? y : x); } namespace Fread { const int SIZE = 1 << 21; char buf[SIZE], *S, *T; inline char getchar() { if (S == T) { T = (S = buf) + fread(buf, 1, SIZE, stdin); if (S == T) return n ; } return *S++; } } // namespace Fread namespace Fwrite { const int SIZE = 1 << 21; char buf[SIZE], *S = buf, *T = buf + SIZE; inline void flush() { fwrite(buf, 1, S - buf, stdout); S = buf; } inline void putchar(char c) { *S++ = c; if (S == T) flush(); } struct NTR { ~NTR() { flush(); } } ztr; } // namespace Fwrite namespace Fastio { struct Reader { template <typename T> Reader& operator>>(T& x) { char c = Fread ::getchar(); T f = 1; while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = Fread ::getchar(); } x = 0; while (c >= 0 && c <= 9 ) { x = x * 10 + (c - 0 ); c = Fread ::getchar(); } x *= f; return *this; } Reader& operator>>(char& c) { c = Fread ::getchar(); while (c == n || c == ) c = Fread ::getchar(); return *this; } Reader& operator>>(char* str) { int len = 0; char c = Fread ::getchar(); while (c == n || c == ) c = Fread ::getchar(); while (c != n && c != ) { str[len++] = c; c = Fread ::getchar(); } str[len] = 0 ; return *this; } Reader() {} } cin; const char endl = n ; struct Writer { template <typename T> Writer& operator<<(T x) { if (x == 0) { Fwrite ::putchar( 0 ); return *this; } if (x < 0) { Fwrite ::putchar( - ); x = -x; } static int sta[45]; int top = 0; while (x) { sta[++top] = x % 10; x /= 10; } while (top) { Fwrite ::putchar(sta[top] + 0 ); --top; } return *this; } Writer& operator<<(char c) { Fwrite ::putchar(c); return *this; } Writer& operator<<(char* str) { int cur = 0; while (str[cur]) Fwrite ::putchar(str[cur++]); return *this; } Writer& operator<<(const char* str) { int cur = 0; while (str[cur]) Fwrite ::putchar(str[cur++]); return *this; } Writer() {} } cout; } // namespace Fastio const int MAXN = 1000, MAXM = 3e4; const int INF = 2e9 + 233; int n, m, s, t; struct EDGE { int nxt, to, w, id; } edge[MAXM * 2 + 5]; int head[MAXN + 5], tot; inline void add_edge(int u, int v, int w, int id) { edge[++tot].nxt = head[u]; edge[tot].to = v; edge[tot].w = w; edge[tot].id = id; head[u] = tot; } pair<int, pair<int, int> > ans; int dfn[MAXN + 5], ofn[MAXN + 5], cnt_dfn; int fa[MAXN + 5], fw[MAXN + 5], fid[MAXN + 5]; int num[MAXN + 5]; long long sum[MAXN + 5], sumid[MAXN + 5]; unsigned long long sumhash[MAXN + 5]; map<unsigned long long, bool> vis; int id[MAXN + 5], lca[MAXN + 5]; set<pair<int, int> > S[MAXN + 5]; vector<pair<int, int> > to_del[MAXN + 5]; int an[MAXN + 5][10], dep[MAXN + 5]; int get_lca(int u, int v) { if (dep[u] < dep[v]) swap(u, v); for (int i = 9; i >= 0; --i) { if (dep[an[u][i]] >= dep[v]) { u = an[u][i]; } } if (u == v) return u; for (int i = 9; i >= 0; --i) { if (an[u][i] != an[v][i]) { u = an[u][i]; v = an[v][i]; } } return an[u][0]; } int l(int id) { int x = edge[id * 2].to; int y = edge[id * 2 - 1].to; if (dfn[x] < dfn[y]) swap(x, y); return x; } void dfs(int u) { dfn[u] = ++cnt_dfn; an[u][0] = fa[u]; dep[u] = dep[fa[u]] + 1; for (int i = 1; i <= 9; ++i) { an[u][i] = an[an[u][i - 1]][i - 1]; } for (int i = head[u]; i; i = edge[i].nxt) { int v = edge[i].to; if (edge[i].id == fid[u]) continue; if (!dfn[v]) { fa[v] = u; fw[v] = edge[i].w; fid[v] = edge[i].id; dfs(v); num[u] += num[v]; sum[u] += sum[v]; sumid[u] += sumid[v]; sumhash[u] += sumhash[v]; if (((int)(S[id[u]]).size()) < ((int)(S[id[v]]).size())) { swap(id[u], id[v]); } for (set<pair<int, int> >::iterator it = S[id[v]].begin(); it != S[id[v]].end(); ++it) { S[id[u]].insert(*it); } } else if (dfn[v] < dfn[u]) { num[u]++; num[v]--; sum[u] += edge[i].w; sum[v] -= edge[i].w; sumid[u] += edge[i].id; sumid[v] -= edge[i].id; S[id[u]].insert(make_pair(dfn[u], edge[i].id)); to_del[v].push_back(make_pair(dfn[u], edge[i].id)); unsigned long long hashw = (((unsigned long long)rand() << 30) ^ (rand() << 15) ^ rand()); while (vis[hashw]) { hashw = (((unsigned long long)rand() << 30) ^ (rand() << 15) ^ rand()); } vis[hashw] = 1; sumhash[u] += hashw; sumhash[v] -= hashw; } } for (int i = 0; i < ((int)(to_del[u]).size()); ++i) { S[id[u]].erase(to_del[u][i]); } assert(((int)(S[id[u]]).size()) == num[u]); if (num[u] >= 2) { lca[u] = get_lca(l(S[id[u]].begin()->second), l(S[id[u]].rbegin()->second)); } ofn[u] = cnt_dfn; } int main() { srand((unsigned long long)time(0) ^ (unsigned long long)(new char)); Fastio ::cin >> n >> m; Fastio ::cin >> s >> t; for (int i = 1; i <= m; ++i) { int u, v, w; Fastio ::cin >> u >> v >> w; add_edge(u, v, w, i); add_edge(v, u, w, i); } for (int i = 1; i <= n; ++i) { id[i] = i; } ans = make_pair(INF, make_pair(INF, INF)); dfs(s); if (!dfn[t]) { Fastio ::cout << 0 << Fastio ::endl; Fastio ::cout << 0 << Fastio ::endl; Fastio ::cout << Fastio ::endl; return 0; } for (int u = t; u != s; u = fa[u]) { if (num[u] == 0) { ckmin(ans, make_pair(fw[u], make_pair(fid[u], 0))); } else if (num[u] == 1) { ckmin(ans, make_pair(fw[u] + (int)sum[u], make_pair(fid[u], (int)sumid[u]))); int x = l(sumid[u]); for (int v = x; v != u; v = fa[v]) { if (num[v] == 1) { if (dfn[get_lca(t, x)] < dfn[v]) { ckmin(ans, make_pair(fw[u] + fw[v], make_pair(fid[u], fid[v]))); } } } } else { int x = lca[u]; for (int v = x; v != u; v = fa[v]) { if (num[u] == num[v] && sum[u] == sum[v] && sumid[u] == sumid[v] && sumhash[u] == sumhash[v]) { if (dfn[get_lca(t, x)] < dfn[v]) { ckmin(ans, make_pair(fw[u] + fw[v], make_pair(fid[u], fid[v]))); } } } } } if (ans.first == INF) { Fastio ::cout << -1 << Fastio ::endl; return 0; } Fastio ::cout << ans.first << Fastio ::endl; if (ans.second.second == 0) { Fastio ::cout << 1 << Fastio ::endl; Fastio ::cout << ans.second.first << Fastio ::endl; } else { Fastio ::cout << 2 << Fastio ::endl; Fastio ::cout << ans.second.first << << ans.second.second << Fastio ::endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; long long a, f, sec, t = 0, h = 0; cin >> a; vector<long long> par; vector<long long> m; for (int i = 0; i < s.length(); i++) { if (s[i - 1] == s[i]) { h++; } par.push_back(h); } for (int i = 0; i < a; i++) { cin >> f >> sec; m.push_back(par[sec - 1] - par[f - 1]); } for (int i = 0; i < a; i++) { cout << m[i] << endl; } } |
#include <bits/stdc++.h> using namespace std; long long dp[2]; void solve() { long long n; cin >> n; for (int i = 0; i < n; i++) { dp[i % 2] = dp[i % 2] + dp[!(i % 2)] + 1; if (dp[i % 2] > 1000000007) dp[i % 2] %= 1000000007; } cout << (dp[0] + dp[1] + 1000000007) % (1000000007); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ; solve(); } |
#include <bits/stdc++.h> using namespace std; int main() { int n, t; cin >> n >> t; int* time = new int[n]; for (int i = 0; i < n; i++) { cin >> time[i]; } int sum = 0, count = 0; int ans = INT_MIN; for (int i = 0; i < n; i++) { if (sum + time[i] <= t) { sum += time[i]; count++; } else { sum = sum - time[i - count] + time[i]; } ans = max(ans, count); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n; vector<int> a; int was[100100]; int t[100100]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (int i = 1; i <= 2 * n; i++) { int x; cin >> x; a.push_back(x); } vector<int> ans; int cnt = 0; for (int i = 0; i < 2 * n; i++) { if (!was[a[i]]) { t[a[i]] = i; ans.push_back(a[i]); was[a[i]] = true; } else { was[a[i]] = true; cnt += i - t[a[i]] - 1; ans.insert(ans.begin() + t[a[i]] + 1, a[i]); for (int j = 0; j < ans.size(); j++) { t[ans[j]] = j; } } } cout << cnt; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> tab[100100], ans; int n, ls[10]; bool used[100100]; bool chek(int a, int b) { for (int i = 0; i < 4; i++) if (tab[a][i] == b) return true; return false; } int main() { scanf( %d , &n); for (int i = 0; i < n + n; i++) { int a, b; scanf( %d%d , &a, &b); if (a == b) { puts( -1 ); return 0; } tab[a].push_back(b); tab[b].push_back(a); } for (int i = 1; i <= n; i++) { if (tab[i].size() != 4) { puts( -1 ); return 0; } } if (n <= 10) { int ar[30] = {}; for (int i = 0; i < n; i++) ar[i] = i + 1; do { ar[n] = ar[0]; ar[n + 1] = ar[1]; bool ok = true; for (int i = 0; i < n; i++) { if (!chek(ar[i], ar[i + 1]) || !chek(ar[i], ar[i + 2])) { ok = false; break; } } if (ok) { for (int i = 0; i < n; i++) printf( %d%c , ar[i], i == n - 1 ? n : ); return 0; } } while (std::next_permutation(ar, ar + n)); puts( -1 ); return 0; } int start = 1, pre = -1; while (!used[start]) { used[start] = true; ans.push_back(start); int nxt = start; for (int i = 0; i < 4; i++) { int cnt = 0; for (int j = 0; j < 4; j++) if (chek(tab[start][i], tab[start][j])) cnt++; if (cnt == 2 && tab[start][i] != pre) { nxt = tab[start][i]; break; } } if (nxt == start) { puts( -1 ); return 0; } pre = start; start = nxt; } if ((int)ans.size() < n) { puts( -1 ); return 0; } ans.push_back(ans[0]); ans.push_back(ans[1]); for (int i = 0; i < n; i++) { if (!chek(ans[i], ans[i + 1]) || !chek(ans[i], ans[i + 2])) { puts( -1 ); return 0; } } for (int i = 0; i < n; i++) printf( %d%c , ans[i], i == n - 1 ? n : ); return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, q, sum, x; int main(void) { scanf( %lld%lld , &n, &q); while (q--) { scanf( %lld , &x); while (x % 2 == 0) { sum = (x + 1) / 2 + 1, sum = n - sum, x += sum + 1; } printf( %lld n , x / 2 + 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; set<pair<int, int> > s[2]; bool eq(pair<int, int> a, pair<int, int> b) { return (a.first == b.first && a.second == b.second); } int main() { int n, m, i, a, b, j; scanf( %d%d , &n, &m); for (i = 0; i < n; i++) { scanf( %d%d , &a, &b); if (b < a) swap(a, b); s[0].insert(make_pair(a, b)); } for (i = 0; i < m; i++) { scanf( %d%d , &a, &b); if (b < a) swap(a, b); s[1].insert(make_pair(a, b)); } set<int> ans; for (auto i : s[0]) for (auto j : s[1]) { if (i.first == j.first && i.second == j.second) continue; else if (i.first != j.first && i.first != j.second && i.second != j.first && i.second != j.second) continue; else if (i.first == j.first) { for (auto k : s[0]) { if (eq(k, j)) continue; if (k.first == j.second || k.second == j.second) return !printf( -1 n ); } for (auto k : s[1]) { if (eq(k, i)) continue; if (k.first == i.second || k.second == i.second) return !printf( -1 n ); } ans.insert(i.first); } else if (i.first == j.second) { for (auto k : s[0]) { if (eq(k, j)) continue; if (k.first == j.first || k.second == j.first) return !printf( -1 n ); } for (auto k : s[1]) { if (eq(k, i)) continue; if (k.first == i.second || k.second == i.second) return !printf( -1 n ); } ans.insert(i.first); } else if (i.second == j.second) { for (auto k : s[0]) { if (eq(k, j)) continue; if (k.first == j.first || k.second == j.first) return !printf( -1 n ); } for (auto k : s[1]) { if (eq(k, i)) continue; if (k.first == i.first || k.second == i.first) return !printf( -1 n ); } ans.insert(i.second); } else if (i.second == j.first) { for (auto k : s[0]) { if (eq(k, j)) continue; if (k.first == j.second || k.second == j.second) return !printf( -1 n ); } for (auto k : s[1]) { if (eq(k, i)) continue; if (k.first == i.first || k.second == i.first) return !printf( -1 n ); } ans.insert(i.second); } } if ((int)ans.size() > 1) return !printf( 0 n ); cout << *ans.begin() << endl; } |
#include <bits/stdc++.h> using namespace std; using LL = long long; const LL INF = 2000000000000000000L; struct Event { char c; LL v; int pos; }; void Dfs(int pos, vector<vector<pair<LL, int>>>& edge, vector<bool>& parallel, vector<LL>& ans) { if (edge[pos].size() == 0) { ans[pos] = 1; return; } if (parallel[pos]) { for (auto [vv, j] : edge[pos]) { Dfs(j, edge, parallel, ans); } } else { int j = 0; for (int i = 0; i < edge[pos].size(); ++i) { if (edge[pos][i].first < edge[pos][j].first) j = i; } Dfs(edge[pos][j].second, edge, parallel, ans); } } int main() { ios::sync_with_stdio(false); cin.tie(0); int times; cin >> times; while (times--) { int n; cin >> n; string ss; getline(cin, ss); string s; for (char c : ss) { if (c == ) continue; s.push_back(c); } vector<vector<pair<LL, int>>> edge(s.size()); vector<bool> sign(s.size()); stack<Event> st; for (int i = 0; i < s.size(); ++i) { if (s[i] == ) ) { vector<pair<LL, int>> x; bool parallel = false; int j = i; while (true) { Event e = st.top(); st.pop(); if (e.c == ( ) { j = e.pos; break; } if (e.c == P ) parallel = true; if (e.c == S ) parallel = false; if (e.c == * ) { x.push_back({e.v, e.pos}); } } sign[j] = parallel; for (int i = 0; i < x.size(); ++i) { edge[j].push_back(x[i]); } if (parallel) { LL ans = 0; for (auto [a, b] : x) ans += a; st.push({ * , ans, j}); } else { LL ans = INF; for (auto [a, b] : x) ans = min(ans, a); st.push({ * , ans, j}); } } else { st.push({s[i], 1, i}); } } vector<LL> ans(s.size()); Dfs(0, edge, sign, ans); cout << REVOLTING ; for (int i = 0; i < s.size(); ++i) { if (s[i] == * ) cout << ans[i] * n * st.top().v << ; } cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; int *arr = new int[n]; for (int i = 0; i < n; i++) cin >> arr[i]; sort(arr, arr + n); reverse(arr, arr + n); cout << arr[k - 1]; return 0; } |
#include <bits/stdc++.h> using namespace std; int basecon(int n, int b); int gcd(int a, int b) { if (b == 0) return a; else return gcd(b, a % b); } int basecon(int n, int b) { int sum = 0; while (n) { sum = sum + (n % b); n = n / b; } return sum; } int main() { int n, sum = 0, y, g; cin >> n; y = n - 2; for (int i = 2; i < n; ++i) { sum = sum + basecon(n, i); } g = gcd(sum, y); sum = sum / g; y = y / g; cout << sum << / << y << endl; } |
#include <bits/stdc++.h> using namespace std; vector<int> v, ans; void op(int i) { int x = v[i + 2]; v[i + 2] = v[i + 1]; v[i + 1] = v[i]; v[i] = x; if (ans.size() >= 2 && ans[ans.size() - 1] == i + 1 && ans[ans.size() - 2] == i + 1) ans.pop_back(), ans.pop_back(); else ans.push_back(i + 1); } void reach(int x, int y) { while (y > x + 1) op(y - 2), y -= 2; if (y == x + 1) op(y - 1), op(y - 1); } int main(int argc, char **argv) { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, st = 0, temp = 0; ans.clear(); cin >> n; v.resize(n); vector<int> ar(501, -1); int val = -1, x, y; for (int i = 0; i < n; i++) { cin >> v[i]; if (ar[v[i]] != -1) val = v[i], x = ar[v[i]], y = i; ar[v[i]] = i; } if (val != -1) v[x] = v[y] = 2000; while (n - st > 3) { int mi = 1000, in; for (int j = st; j < n; j++) if (v[j] < mi) mi = v[j], in = j; reach(st, in); st++; } if (val == -1) { while (!(v[st] <= v[st + 1] && v[st + 1] <= v[st + 2])) { op(st), temp++; if (temp > 5) { cout << -1 << endl; goto brk; } } } else { while (v[st + 1] != 2000 || v[st + 2] != 2000) op(st); while (st >= 0 && val < v[st]) op(st), op(st), st--; } cout << ans.size() << endl; for (auto x : ans) cout << x << ; cout << endl; brk:; } } |
#include <bits/stdc++.h> using namespace std; char a[5004][5004]; int vis[5004] = {0}; int fl = 0; int n; void dfs(int x, int par) { if (fl == 1) return; vis[x] = 1; for (int i = 0; i < n; i++) { if (a[x][i] == 1 && a[i][par] == 1 ) { printf( %d %d %d n , par + 1, x + 1, i + 1); fl = 1; return; } if (vis[i] == 0 && a[x][i] == 1 ) { if (fl == 1) return; dfs(i, x); if (fl == 1) return; } } } int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %s , a[i]); } for (int i = 0; i < n; i++) { if (vis[i] == 0) { dfs(i, i); } } if (fl == 0) { printf( -1 n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int il[5]; int wyn = 0; void printState() {} int n; int main() { ios::sync_with_stdio(0); cin >> n; while (n--) { int tmp; cin >> tmp; il[tmp]++; } int tmp; if (il[1] > il[2]) { wyn += il[2]; il[3] += il[2]; il[1] -= il[2]; il[2] = 0; printState(); wyn += il[1] / 3 * 2; il[3] += il[1] / 3; il[1] = il[1] % 3; printState(); if (il[1] == 1 && il[3] > 0) { tmp = min(il[1], il[3]); wyn += tmp; il[1] -= tmp; il[3] -= tmp; il[4] += tmp; } else if (il[1] == 1) { printState(); tmp = min(1, il[4] / 2); il[1] -= tmp; il[4] -= 2 * tmp; wyn += 2 * tmp; } else if (il[1] == 2 && il[4] > 0) { wyn += il[1]; il[4] -= il[1]; il[3] += il[1] * 2; il[1] = 0; } else if (il[1] == 2) { tmp = min(il[1], il[3]); wyn += tmp; il[1] -= tmp; il[3] -= tmp; } printState(); } else { wyn += il[1]; il[3] += il[1]; il[2] -= il[1]; il[1] = 0; printState(); wyn += il[2] / 3 * 2; il[3] += il[2] / 3 * 2; il[2] = il[2] % 3; printState(); if (il[2] == 1 && il[4] > 0) { il[2] = 0; il[4] -= 1; il[3] += 2; wyn += 1; } else if (il[2] == 1 && il[3] >= 2) { il[3] -= 2; il[2] -= 1; il[4] += 2; wyn += 2; } else if (il[2] == 2) { il[4] += 1; il[2] -= 2; wyn += 2; } printState(); } cout << (il[2] + il[1] > 0 ? -1 : wyn) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e3 + 20; bool A[maxn][maxn]; int d[maxn]; vector<pair<int, int> > ans; void solve(set<int> &a) { if ((int)a.size() == 1) { int k = *a.begin(); for (int i = 0; i < k + 1; i++) for (int j = i + 1; j < k + 1; j++) A[i][j] = A[j][i] = 1; return; } set<int> tmp; int k = *a.rbegin(), mn = *a.begin(); for (auto x : a) if (x != k) tmp.insert(k - x); solve(tmp); for (int i = 0; i <= k - mn; i++) for (int j = i + 1; j <= k - mn; j++) A[i][j] = !A[i][j], A[j][i] = !A[j][i]; for (int i = 0; i <= k - mn; i++) for (int j = k - mn + 1; j <= k; j++) A[i][j] = A[j][i] = 1; for (int i = k - mn + 1; i <= k; i++) for (int j = i + 1; j <= k; j++) A[i][j] = A[j][i] = 1; } int main() { int m; cin >> m; set<int> tmp; for (int i = 0; i < m; i++) cin >> d[i], tmp.insert(d[i]); solve(tmp); for (int i = 0; i <= d[m - 1]; i++) for (int j = i + 1; j <= d[m - 1]; j++) if (A[i][j]) ans.push_back({i, j}); printf( %d n , (int)ans.size()); for (auto x : ans) printf( %d %d n , x.first + 1, x.second + 1); } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int n, m, i; cin >> n >> m; long long int arr[n + 5]; map<long long int, long long int> ma; queue<long long int> q; for (i = 0; i < n; i++) { cin >> arr[i]; ma[arr[i]] = 0; q.push(arr[i]); } long long int result = 0, cnt = 0; long long int ans[m + 5]; while (!q.empty()) { if (cnt >= m) break; long long int x = q.front(); if (!ma.count(x + 1)) { q.push(x + 1); ans[cnt] = x + 1; ma[x + 1] = ma[x] + 1; result += ma[x + 1]; cnt++; } if (cnt >= m) break; if (!ma.count(x - 1)) { q.push(x - 1); ans[cnt] = x - 1; ma[x - 1] = ma[x] + 1; result += ma[x - 1]; cnt++; } q.pop(); } cout << result << n ; for (i = 0; i < m; i++) cout << ans[i] << ; cout << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX_H = 100; const int MAX_W = 100; int hs[MAX_H], vs[MAX_W]; int ps[MAX_H][MAX_W], as[MAX_H * MAX_W]; int main() { int h, w, q; scanf( %d%d%d , &h, &w, &q); for (int y = 0, p = 0; y < h; y++) for (int x = 0; x < w; x++, p++) ps[y][x] = p; while (q--) { int op; scanf( %d , &op); if (op == 1) { int y; scanf( %d , &y); y--; int tp = ps[y][0]; for (int x = 1; x < w; x++) ps[y][x - 1] = ps[y][x]; ps[y][w - 1] = tp; } else if (op == 2) { int x; scanf( %d , &x); x--; int tp = ps[0][x]; for (int y = 1; y < h; y++) ps[y - 1][x] = ps[y][x]; ps[h - 1][x] = tp; } else { int y, x, v; scanf( %d%d%d , &y, &x, &v); y--, x--; as[ps[y][x]] = v; } } for (int y = 0, p = 0; y < h; y++) for (int x = 0; x < w; x++, p++) { printf( %d , as[p]); putchar(x + 1 < w ? : n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1000000000000000000; struct fun { long long a, b, nr; }; void Dodaj(deque<fun>& D, fun nowy) { while (D.size() >= 2) { fun ost = D.front(); D.pop_front(); fun przed = D.front(); if ((ost.b - nowy.b) * (ost.a - przed.a) > (nowy.a - ost.a) * (przed.b - ost.b)) { D.push_front(ost); break; } } D.push_front(nowy); } int Pytaj(deque<fun>& D, long long x) { while (D.size() >= 2) { fun ost = D.back(); D.pop_back(); fun przed = D.back(); if (ost.a * x + ost.b < przed.a * x + przed.b) { D.push_back(ost); break; } } return D.back().nr; } int main() { ios_base::sync_with_stdio(0); int n, m, p; cin >> n >> m >> p; vector<long long> s(n); s[0] = 0; for (int i = 1; i < n; ++i) { cin >> s[i]; s[i] += s[i - 1]; } vector<long long> a(m); for (int i = 0; i < m; ++i) { int h, t; cin >> h >> t; --h; a[i] = t - s[h]; } sort(a.begin(), a.end()); vector<long long> prefA(m); prefA[0] = a[0]; for (int i = 1; i < m; ++i) prefA[i] = prefA[i - 1] + a[i]; vector<vector<long long> > dp(p, vector<long long>(m, INF)); for (int i = 0; i < m; ++i) dp[0][i] = a[i] * (i + 1) - prefA[i]; for (int i = 1; i < p; ++i) { deque<fun> D; Dodaj(D, {-(i - 1), dp[i - 1][i - 1] + prefA[i - 1], i - 1}); for (int j = i; j < m; ++j) { int nr = Pytaj(D, a[j]); dp[i][j] = dp[i - 1][nr] + a[j] * (j - nr) - prefA[j] + prefA[nr]; Dodaj(D, {-j, dp[i - 1][j] + prefA[j], j}); } } long long odp = INF; for (int i = 0; i < p; ++i) odp = min(odp, dp[i][m - 1]); cout << odp; return 0; } |
#include <bits/stdc++.h> using std::abs; using std::cerr; using std::cin; using std::cout; using std::map; using std::max; using std::min; using std::pair; using std::set; using std::string; using std::swap; using std::vector; using ll = long long; using uint = unsigned int; using pii = pair<int, int>; using pll = pair<ll, ll>; template <typename T> void err(vector<string>::iterator it, T a) { cerr << it->substr((*it)[0] == ) << = << a << n ; } template <typename T, typename... Ts> void err(vector<string>::iterator it, T a, Ts... as) { cerr << it->substr((*it)[0] == ) << = << a << , ; err(++it, as...); } struct init { init() { cin.tie(0); std::iostream::sync_with_stdio(0); cout << std::fixed << std::setprecision(10); cerr << std::fixed << std::setprecision(10); srand(228); } ~init() { cerr << Time elapsed: << 1.0 * (double)clock() / CLOCKS_PER_SEC << s. n ; } } init; const int MAXN = 1001, INF = 1e9 + 7; int ans[MAXN]; vector<int> wo[MAXN]; int ret[20][MAXN]; int main() { int n; cin >> n; for (int step = 1, pw = 0; step < n; step *= 2, ++pw) { vector<int> q0, q1; for (int i = 0; i < n; i += step * 2) { for (int j = 0; j < step && i + j < n; ++j) { wo[i + j].emplace_back(pw * 2 + 1); q0.emplace_back(i + j); } for (int j = step; j < step + step && i + j < n; ++j) { q1.emplace_back(i + j); wo[i + j].emplace_back(pw * 2); } } if (!q0.empty()) { cout << q0.size() << n ; for (int i : q0) cout << i + 1 << ; cout << std::endl; for (int i = 0; i < n; ++i) cin >> ret[pw * 2][i]; } if (!q1.empty()) { cout << q1.size() << n ; for (int i : q1) cout << i + 1 << ; cout << std::endl; for (int i = 0; i < n; ++i) cin >> ret[pw * 2 + 1][i]; } } cout << -1 n ; for (int i = 0; i < n; ++i) { int mn = INF; for (int j : wo[i]) mn = min(mn, ret[j][i]); cout << mn << ; } cout << std::endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long vis[80]; long long prime[80] = {0}; long long a[200000]; long long fc[80][200000] = {{0}}; int n; int pnum; int get_primes(int m) { memset(vis, 0, sizeof(vis)); int cnt = 1; for (int i = 2; i < m; i++) { if (!vis[i]) { prime[cnt++] = i; for (int j = i * i; j < m; j += i) vis[j] = 1; } } return cnt; } void change(long long k, long long g) { for (int i = 1; i <= pnum;) { if (k % prime[i] == 0) { fc[i][g] ^= 1; k /= prime[i]; } else i++; } return; } long long gauss() { long long g = 0; int i, j; for (j = 1; j <= n && g < pnum; j++) { for (i = g + 1; i <= pnum; i++) if (fc[i][j] == 1) break; if (i <= pnum) { g++; for (int p = j; p <= n; p++) swap(fc[g][p], fc[i][p]); for (int p = g + 1; p <= pnum; p++) { if (fc[p][j] == 1) { for (int q = j; q <= n; q++) fc[p][q] ^= fc[g][q]; } } } } return g; } long long qpow(long long a, long long b, long long m) { long long ans = 1; while (b) { if (b & 1) { ans = (ans * a) % m; b--; } b /= 2; a = a * a % m; } return ans; } int main() { int cas = 1; int t = 1; get_primes(70); pnum = 19; { memset(fc, 0, sizeof(fc)); cin >> n; for (int i = 1; i <= n; i++) cin >> a[i], change(a[i], i); int r = gauss(); long long ans = qpow(2, (long long)(n - r), 1000000007) - 1; printf( %lld n , ans); } } |
#include <bits/stdc++.h> using namespace std; long long MOD = 1e9 + 7; long long FastPower(long long x, long long y) { long long res = 1; x = x % MOD; while (y > 0) { if (y & 1) res = (res * x) % MOD; y = y >> 1; x = (x * x) % MOD; } return res; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, k; string s; cin >> s; n = s.size(); long long x = 0, y = 0; y = FastPower(2, n - 1); for (int i = 0, j = n - 1; i < n; i++, j--) { if (s[j] == 1 ) { x += FastPower(2, i); x %= MOD; } } cout << (x * y) % MOD; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int b; map<int, long long> mp; long long a = -1; if (n > 1) { for (int i = 0; i < n; i++) { cin >> b; mp[b - i] += b; a = max(a, mp[b - i]); } cout << a; } else { cin >> b; cout << b; } } |
#include <bits/stdc++.h> using namespace std; string s[100000]; int u = 0; char nonu[2][5] = { etr , etra }; int nonul[2] = {3, 4}; char adj[2][10] = { lios , liala }; int adjl[2] = {4, 5}; char ver[2][10] = { initis , inites }; int verl[2] = {6, 6}; bool isn(int v, int &u) { int len = s[v].length(); for (int j = 0; j < 2; j++) if (len >= nonul[j]) { bool f = false; for (int i = 0; i < nonul[j]; i++) if (s[v][len - nonul[j] + i] != nonu[j][i]) { f = true; break; } if (!f) { u = j; return true; } } return false; } bool judge(int v) { int len = s[v].length(); for (int j = 0; j < 2; j++) if (len >= nonul[j]) { bool f = false; for (int i = 0; i < nonul[j]; i++) if (s[v][len - nonul[j] + i] != nonu[j][i]) { f = true; break; } if (!f) return true; } for (int j = 0; j < 2; j++) if (len >= adjl[j]) { bool f = false; for (int i = 0; i < adjl[j]; i++) if (s[v][len - adjl[j] + i] != adj[j][i]) { f = true; break; } if (!f) return true; } for (int j = 0; j < 2; j++) if (len >= verl[j]) { bool f = false; for (int i = 0; i < verl[j]; i++) if (s[v][len - verl[j] + i] != ver[j][i]) { f = true; break; } if (!f) return true; } return false; } bool judge1(int v, int u) { int len = s[v].length(); for (int j = 0; j < 2; j++) if (len >= adjl[j]) { bool f = false; for (int i = 0; i < adjl[j]; i++) if (s[v][len - adjl[j] + i] != adj[j][i]) { f = true; break; } if (!f) { if (j != u) return false; else return true; } } for (int j = 0; j < 2; j++) if (len >= verl[j]) { bool f = false; for (int i = 0; i < verl[j]; i++) if (s[v][len - verl[j] + i] != ver[j][i]) { f = true; break; } if (!f) return false; } return false; } bool judge2(int v, int u) { int len = s[v].length(); for (int j = 0; j < 2; j++) if (len >= adjl[j]) { bool f = false; for (int i = 0; i < adjl[j]; i++) if (s[v][len - adjl[j] + i] != adj[j][i]) { f = true; break; } if (!f) return false; } for (int j = 0; j < 2; j++) if (len >= verl[j]) { bool f = false; for (int i = 0; i < verl[j]; i++) if (s[v][len - verl[j] + i] != ver[j][i]) { f = true; break; } if (!f) { if (j != u) return false; else return true; } } return false; } int main() { int n = 0; while (cin >> s[n]) n++; if (n == 1 && judge(0)) { cout << YES << endl; return 0; } bool f = false; int y = 0; for (int i = 0; i < n; i++) if (isn(i, u)) { y = i; if (!f) f = true; else { cout << NO << endl; return 0; } } if (!f) { cout << NO << endl; return 0; } for (int i = 0; i < y; i++) if (!judge1(i, u)) { cout << NO << endl; return 0; } for (int i = y + 1; i < n; i++) if (!judge2(i, u)) { cout << NO << endl; return 0; } cout << YES << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int t; cin >> t; while (t--) { long long int n; cin >> n; long long int to = 0, thr = 0; while (n % 2 == 0) { to++; n = n / 2; } while (n % 3 == 0) { thr++; n = n / 3; } if (n > 1) { cout << -1 ; cout << n ; } else { if (to > thr) { cout << -1 ; cout << n ; } else { cout << 2 * thr - to; cout << n ; } } } } |
#include <bits/stdc++.h> using namespace std; inline long long read() { long long x = 0, f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = -1; ch = getchar(); } while (isdigit(ch)) { x = (x << 1) + (x << 3) + ch - 0 ; ch = getchar(); } return x * f; } inline long long fast_pow(long long a, long long b, long long p) { long long t = 1; a %= p; while (b) { if (b & 1) t = t * a % p; b >>= 1ll; a = a * a % p; } return t; } long long inv[1010101], fac[1010101], n, h[1010101], K; inline long long C(long long n, long long m) { if (n < 0 || m < 0 || n < m) return 0; return fac[n] * inv[m] % 998244353 * inv[n - m] % 998244353; } int main() { n = read(), K = read(); long long ttt = 0; for (int i = 1; i <= n; i++) { h[i] = read(); } for (int i = 1; i <= n; i++) { if (h[i] != h[(i + 1 == n + 1) ? 1 : (i + 1)]) ttt++; } fac[0] = inv[0] = inv[1] = 1; for (long long i = 2; i <= n; i++) inv[i] = (998244353 - (998244353 / i) * inv[998244353 % i] % 998244353) % 998244353; for (int i = 2; i <= n; i++) inv[i] = inv[i - 1] * inv[i] % 998244353; for (long long i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % 998244353; long long ans = 0; long long inv2 = fast_pow(2ll, 998244353 - 2, 998244353); for (long long i = 0; i <= ttt; i++) { ans = (ans + C(ttt, i) * fast_pow(K - 2 + 998244353, ttt - i, 998244353) % 998244353 * ((fast_pow(2ll, i, 998244353) - ((i % 2 == 1) ? 0 : C(i, i / 2))) * inv2 % 998244353 + 998244353) % 998244353) % 998244353; } cout << ans * fast_pow(K, n - ttt, 998244353) % 998244353; return 0; } |
#include <bits/stdc++.h> int cmp(const void *a, const void *b) { return (*(int *)a - *(int *)b); } int main() { char str[100005]; int i, j, k; scanf( %s , str); int l = strlen(str); int cB = 0, cb = 0, cu = 0, ca = 0, cs = 0, cr = 0, cl = 0; for (i = 0; i < l; i++) { if (str[i] == B ) { cB++; } else if (str[i] == b ) { cb++; } else if (str[i] == u ) { cu++; } else if (str[i] == a ) { ca++; } else if (str[i] == s ) { cs++; } else if (str[i] == l ) { cl++; } else if (str[i] == r ) { cr++; } else { continue; } } int arry[5]; arry[0] = cB; arry[1] = cs; arry[2] = cr; arry[3] = cl; arry[4] = cb; qsort(arry, 5, sizeof(int), cmp); int m1 = arry[0]; int m2; if (cu <= ca) { m2 = cu; } else { m2 = ca; } int ans; if (m2 >= 2 * m1) { ans = m1; } else if (m2 < 2 * m1) { ans = m2 / 2; } printf( %d n , ans); return (0); } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; for (int i = 0; i < t; i++) { int n; cin >> n; int a[n]; for (int j = 1; j <= n; j++) { a[j] = pow(2, j); } int f = 0, s = 0; for (int j = 1; j <= n; j++) { if (j < n / 2 || j == n) f += a[j]; else { s += a[j]; } } cout << f - s << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, a[100], b[100]; scanf( %d %d , &n, &m), a[0] = n - 2, b[0] = m - 2; for (int i = 1; i < max(n, m); i++) a[i] = b[i] = 2; if (n == 1) a[0] = 1; else if (n == 2) a[0] = 3, a[1] = 4; if (m == 1) b[0] = 1; else if (m == 2) b[0] = 3, b[1] = 4; for (int i = 0; i < n; i++, putchar(10)) for (int j = 0; j < m; j++) printf( %d , a[i] * b[j]); return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int MAXN = 1111111; const int N = 105; const int M = 25; int cmp(int a, int b) { return a > b; } int n, m, s[N], c[M], t[M], dp[MAXN], st; void init() { memset(dp, INF, sizeof(dp)); scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &s[i]); scanf( %d%*c , &m); for (int j = 0; j < m; j++) scanf( %c%*c%d%*c , &c[j], &t[j]); } int DP(int state, int num) { if (dp[state] != INF) return dp[state]; int &ans = dp[state]; ans = 0; if (c[num] == p ) { int bit; for (bit = 0; bit < m; bit++) if ((state & (1 << bit))) break; if (t[num] == 1) ans = (DP((state ^ (1 << bit)), num + 1) + s[bit]); else ans = (DP((state ^ (1 << bit)), num + 1) - s[bit]); } else if (c[num] == b ) { if (t[num] == 1) ans = -INF; else ans = INF; for (int i = 0; i < m; i++) { if ((state & (1 << i))) { if (t[num] == 1) ans = (ans) > (DP((state ^ (1 << i)), num + 1)) ? (ans) : (DP((state ^ (1 << i)), num + 1)); else ans = (ans) < (DP((state ^ (1 << i)), num + 1)) ? (ans) : (DP((state ^ (1 << i)), num + 1)); } } } return ans; } void solve() { sort(s, s + n, cmp); st = (1 << m) - 1; printf( %d n , DP(st, 0)); } int main() { init(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[] = {0, 1, 2, 9, 64, 625, 7776, 117649, 2097152}; const long long M = 1000000007ll; int main(void) { std::ios::sync_with_stdio(false); long long k, n, m, t; while (cin >> n >> m) { n -= m; t = 1; k = n; while (k) { if (k & 1) t = t * n % M; n = n * n % M; k >>= 1; } cout << a[m] * t % M << endl; } return 0; } |
#include <bits/stdc++.h> const long long N = 1e5 + 5; using namespace std; struct node { long long sum[10], lazy[10]; } lv[4 * N]; long long n, a[N], q; void init(long long i, long long l, long long r) { for (long long k = 0; k < 10; k++) lv[i].lazy[k] = k; if (l == r) { long long x = 1, z; while (a[l] != 0) { z = a[l] % 10; lv[i].sum[z] += x; x *= 10; a[l] /= 10; } return; } long long mid = (l + r) / 2; init(i * 2, l, mid); init(i * 2 + 1, mid + 1, r); for (long long k = 0; k < 10; k++) lv[i].sum[k] = lv[i * 2].sum[k] + lv[i * 2 + 1].sum[k]; } void dolazy(long long i, long long l, long long r) { if (l != r) { for (long long k = 0; k < 10; k++) { lv[i * 2].lazy[k] = lv[i].lazy[lv[i * 2].lazy[k]]; lv[i * 2 + 1].lazy[k] = lv[i].lazy[lv[i * 2 + 1].lazy[k]]; } } long long cur[10]; for (long long k = 0; k < 10; k++) cur[k] = 0; for (long long k = 0; k < 10; k++) cur[lv[i].lazy[k]] += lv[i].sum[k]; for (long long k = 0; k < 10; k++) lv[i].sum[k] = cur[k], lv[i].lazy[k] = k; } void update(long long i, long long l, long long r, long long L, long long R, long long x, long long y) { dolazy(i, l, r); if (L > r || l > R) return; if (L <= l && r <= R) { lv[i].lazy[x] = y; dolazy(i, l, r); return; } long long mid = (l + r) / 2; update(i * 2, l, mid, L, R, x, y); update(i * 2 + 1, mid + 1, r, L, R, x, y); for (long long k = 0; k < 10; k++) lv[i].sum[k] = lv[i * 2].sum[k] + lv[i * 2 + 1].sum[k]; } long long get(long long i, long long l, long long r, long long L, long long R) { dolazy(i, l, r); if (L > r || l > R) return 0; if (L <= l && r <= R) { long long ans = 0; for (int k = 0; k < 10; k++) ans += lv[i].sum[k] * k; return ans; } long long mid = (l + r) / 2; return get(i * 2, l, mid, L, R) + get(i * 2 + 1, mid + 1, r, L, R); } int main() { cin >> n >> q; for (long long i = 1; i <= n; i++) cin >> a[i]; init(1, 1, n); while (q--) { long long query, l, r, x, y; cin >> query >> l >> r; if (query == 1) { cin >> x >> y; update(1, 1, n, l, r, x, y); } else { cout << get(1, 1, n, l, r) << n ; } } } |
#include <bits/stdc++.h> using namespace std; void init() { return; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); init(); int n; cin >> n; long long int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } long long int ans = 0ll, prev = 0ll; for (int i = 0; i < n; i++) { long long int temp1 = min(a[i] / 2, prev); long long int temp2 = (a[i] - 2 * temp1) / 3; ans += temp1 + temp2; prev += a[i] - 3 * (temp1 + temp2); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, t; cin >> n >> m; vector<int> f; for (int i = 0; i < m; i++) { cin >> t; f.insert(f.begin(), t); } for (int i = 0; i < m; i++) { t = i; for (int j = i + 1; j < m; j++) if (f[j] > f[t]) t = j; swap(f[i], f[t]); } t = f[0] - f[n - 1]; for (int i = 0; i < m - n + 1; i++) { if ((f[i] - f[i + n - 1]) < t) t = f[i] - f[i + n - 1]; } cout << t; return 0; } |
#include <bits/stdc++.h> using namespace std; const int ALL = (1 << 30) - 1; int ans[(1 << 22) + 10]; int a[int(1e6) + 2]; int n; void add(int x, int val) { if (ans[x] != 0) return; ans[x] = val; for (int i = 0; i < 22; ++i) add(x & (ALL - (1 << i)), val); } void task() { scanf( %d , &n); for (int i = 0; i < n; ++i) scanf( %d , &a[i]); for (int i = 0; i < n; ++i) { int x = 0; for (int j = 0; j < 22; ++j) if (!(a[i] & (1 << j))) x += 1 << j; add(x, a[i]); } for (int i = 0; i < n; ++i) printf( %d , ans[a[i]] ? ans[a[i]] : -1); } int main() { task(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n; string s; cin >> s; int l = s.length(), ct = 1; for (int i = 1; i < l; i++) { if (s[i] != s[i - 1]) ct++; } if (ct >= (n - 1)) cout << n; else cout << ct + 2; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 4e5 + 10; const int inf = 1e9; int main() { ios::sync_with_stdio(false); string s; cin >> s; s = + s; int i; int ans = 0; int sum = 0; for (i = 1; i < (int)s.size(); i++) { if (s[i] == M ) { sum++; } if (s[i] == F && sum > 0) { ans = max(ans + 1, sum); } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int a, b, c, d, e, f; cin >> a >> b >> c >> d >> e >> f; long long int minbcd; minbcd = min(b, min(c, d)); long long int cnt; cnt = minbcd * f; long long int x; x = d - minbcd; cnt = cnt + (min(x, a) * e); long long int minad; minad = min(a, d); long long int cnt1; cnt1 = minad * e; long long int y; y = d - minad; long long int minbcy; minbcy = min(b, min(c, y)); cnt1 = cnt1 + (minbcy * f); if (cnt >= cnt1) cout << cnt; else cout << cnt1; return 0; } |
#include <bits/stdc++.h> using namespace std; char inp1[100005]; char inp2[100005]; char res[100005]; bool mk[100005]; bool mk1[100005]; char getDiff(char a, char b, char c) { for (int i = 0; i < 26; i++) if (a != ( a + i) && b != ( a + i) && c != ( a + i)) return ( a + i); return -1; } int main() { int n, t, s = 0; cin >> n >> t; cin >> inp1 >> inp2; memset(mk, 0, sizeof mk); memset(mk1, 0, sizeof mk1); for (int i = 0; i < n; i++) if (inp1[i] != inp2[i]) s++; res[n] = 0 ; if (s > 2 * t) { cout << -1 << endl; return 0; } if (s <= 2 * t && s >= t) { int c = 0; for (int i = 0; i < n; i++) if (inp1[i] != inp2[i] && c < t) mk[i] = true, c++; c = 0; for (int i = n - 1; i >= 0; i--) if (inp1[i] != inp2[i] && c < t) mk1[i] = true, c++; for (int i = 0; i < n; i++) { if (mk[i] == true && mk1[i] == true) res[i] = getDiff(inp1[i], inp2[i], 0); else if (mk[i]) res[i] = inp2[i]; else if (mk1[i]) res[i] = inp1[i]; else res[i] = inp1[i]; } cout << res << endl; return 0; } if (s < t) { int c = 0; for (int i = 0; i < n; i++) { if (inp1[i] != inp2[i]) res[i] = getDiff(inp1[i], inp2[i], 0), c++; } for (int i = 0; i < n; i++) { if (inp1[i] == inp2[i] && c < t) res[i] = getDiff(inp1[i], inp2[i], 0), c++; else if (inp1[i] == inp2[i]) res[i] = inp1[i]; } cout << res << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int m, n, k; pair<long long, long long> ptsx[100005]; pair<long long, long long> ptsy[100005]; bool removed[100005]; long long get(int l, int r, int u, int d, int dep) { while (removed[ptsx[l].second]) l++; while (removed[ptsx[r].second]) r--; while (removed[ptsy[u].second]) u++; while (removed[ptsy[d].second]) d--; if (dep == k) { long long xd = ptsx[r].first - ptsx[l].first; long long yd = ptsy[d].first - ptsy[u].first; if (xd == 0) xd++; if (yd == 0) yd++; return ((xd + 1) / 2) * ((yd + 1) / 2); } long long ans = (1LL) << 62; removed[ptsx[l].second] = true; ans = min(ans, get(l + 1, r, u, d, dep + 1)); removed[ptsx[l].second] = false; removed[ptsx[r].second] = true; ans = min(ans, get(l, r - 1, u, d, dep + 1)); removed[ptsx[r].second] = false; removed[ptsy[u].second] = true; ans = min(ans, get(l, r, u + 1, d, dep + 1)); removed[ptsy[u].second] = false; removed[ptsy[d].second] = true; ans = min(ans, get(l, r, u, d - 1, dep + 1)); removed[ptsy[d].second] = false; return ans; } int main() { ios_base::sync_with_stdio(0); cout << fixed << setprecision(12); cin >> n >> k; for (int i = 0, _i = (n); i < _i; ++i) { int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2; ptsx[i] = make_pair(x1 + x2, i); ptsy[i] = make_pair(y1 + y2, i); } sort(ptsx, ptsx + n); sort(ptsy, ptsy + n); cout << get(0, n - 1, 0, n - 1, 0) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>; const ll MOD = 1e9 + 7; const int inf = (1 << 30) - 1; const ll INF = (1LL << 60) - 1; const ld EPS = 1e-10; template <typename T> bool chmax(T &x, const T &y) { return (x < y) ? (x = y, true) : false; }; template <typename T> bool chmin(T &x, const T &y) { return (x > y) ? (x = y, true) : false; }; int main() { int T; cin >> T; while (T--) { int N, K, L; cin >> N >> K >> L; int d[N]; for (int i = 0; i < N; i++) { cin >> d[i]; d[i] = L - d[i]; } int pos = -inf; bool ans = true; for (int i = 0; i < N; i++) { if (d[i] < 0) { ans = false; break; } else if (d[i] >= K) pos = -inf; else if (pos == -inf) pos = -d[i]; else if (d[i] <= pos) { ans = false; break; } else if (pos < -d[i]) pos = -d[i]; else pos++; } cout << (ans ? Yes : No ) << endl; } } |
#include <bits/stdc++.h> using namespace std; set<long long> f, l, s; long long sf = 0, sl = 0; long long ksum = 0, cnt = 0, kmin = 0; void update(long long b, long long t) { int c = l.size(); if (t == 1) s.insert(b); else s.erase(b); if (c == 1 && cnt == 0) { ksum = kmin = *s.rbegin(); cnt = 1; return; } if (c > cnt) { if (b > kmin) { ksum += b; } else { kmin = *(--s.find(kmin)); ksum += kmin; } cnt++; } else if (c < cnt) { ksum -= max(b, kmin); if (b <= kmin) { kmin = *s.upper_bound(kmin); } cnt--; } else { if (c == 0) return; if (b >= kmin) { if (t == 1) { ksum += b - kmin; kmin = *s.upper_bound(kmin); } else { kmin = *(--s.lower_bound(kmin)); ksum -= b - kmin; } } } } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n; while (n--) { long long a, b; cin >> a >> b; if (a == 0) { if (b < 0) { f.erase(f.find(-b)); } else { f.insert(b); } sf += b; } else { if (b < 0) { l.erase(l.find(-b)); } else { l.insert(b); } sl += b; } if (b < 0) update(-b, -1); else update(b, 1); if (l.size() == 0) { cout << sf << endl; } else if (f.size() == 0) { cout << 2 * sl - *l.begin() << endl; } else { if (*f.rbegin() > *l.begin()) { cout << sf + sl + ksum << endl; } else { cout << sf + 2 * sl - *l.begin() + *f.rbegin() << endl; } } } } |
#include <bits/stdc++.h> using namespace std; int main() { int t; scanf( %d , &t); int ji = 0; while (t--) { int n; scanf( %d , &n); int arr[n + 1]; int brr[n + 1]; memset(arr, 0, sizeof(arr)); memset(brr, 0, sizeof(brr)); int ls; int size = 0; for (int a = 0; a < n; a++) { scanf( %d , &ls); if (arr[ls] == 0) { brr[size] = ls; size++; } arr[ls]++; } int min = n; for (int a = 0; a < size; a++) { if (arr[brr[a]] < min) { min = arr[brr[a]]; } } int num = n; int bo = true; for (int a = 2; a < min + 2; a++) { ls = 0; bo = true; for (int b = 0; b < size; b++) { int tt = arr[brr[b]] / a + 1; if (arr[brr[b]] % a == 0) { ls = ls + arr[brr[b]] / a; } else if (arr[brr[b]] >= (tt * (a - 1)) && arr[brr[b]] <= (tt * a)) { ls = ls + tt; } else { bo = false; break; } } if (bo && num > ls) { num = ls; } } printf( %d n , num); } } |
#include <bits/stdc++.h> int n, k, m, c, arr[100005], ans; inline void check() { int i = 0; while (i < m) { if (arr[i] == i + 1) i++; else break; } if (i) c += (m - i + 1), ans += (m - i); else c += m, ans += (m - 1); } int main() { scanf( %d %d , &n, &k); ans = c = 0; while (k--) { scanf( %d , &m); for (int i = 0; i < m; ++i) scanf( %d , &arr[i]); check(); } ans += (c - 1); printf( %d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; template <class t, class u> void chmax(t& first, u second) { if (first < second) first = second; } template <class t, class u> void chmin(t& first, u second) { if (second < first) first = second; } template <class t> using vc = vector<t>; template <class t> using vvc = vc<vc<t>>; using pi = pair<ll, ll>; using vi = vc<ll>; template <class t, class u> ostream& operator<<(ostream& os, const pair<t, u>& p) { return os << { << p.first << , << p.second << } ; } template <class t> ostream& operator<<(ostream& os, const vc<t>& v) { os << { ; for (auto e : v) os << e << , ; return os << } ; } using uint = unsigned; using ull = unsigned long long; template <ll i, class T> void print_tuple(ostream&, const T&) {} template <ll i, class T, class H, class... Args> void print_tuple(ostream& os, const T& t) { if (i) os << , ; os << get<i>(t); print_tuple<i + 1, T, Args...>(os, t); } template <class... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) { os << { ; print_tuple<0, tuple<Args...>, Args...>(os, t); return os << } ; } void print(ll x, ll suc = 1) { cout << x; if (suc == 1) cout << n ; if (suc == 2) cout << ; } ll read() { ll i; cin >> i; return i; } vi readvi(ll n, ll off = 0) { vi v(n); for (ll i = ll(0); i < ll(n); i++) v[i] = read() + off; return v; } template <class T> void print(const vector<T>& v, ll suc = 1) { for (ll i = ll(0); i < ll(v.size()); i++) print(v[i], i == ll(v.size()) - 1 ? suc : 2); } string readString() { string s; cin >> s; return s; } template <class T> T sq(const T& t) { return t * t; } void yes(bool ex = true) { cout << Yes << endl; if (ex) exit(0); } void no(bool ex = true) { cout << No << endl; if (ex) exit(0); } constexpr ll ten(ll n) { return n == 0 ? 1 : ten(n - 1) * 10; } const ll infLL = LLONG_MAX / 3; const ll inf = infLL; ll topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); } ll topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); } ll botbit(signed first) { return first == 0 ? 32 : __builtin_ctz(first); } ll botbit(ll first) { return first == 0 ? 64 : __builtin_ctzll(first); } ll popcount(signed t) { return __builtin_popcount(t); } ll popcount(ll t) { return __builtin_popcountll(t); } bool ispow2(ll i) { return i && (i & -i) == i; } ll mask(ll i) { return (ll(1) << i) - 1; } bool inc(ll first, ll second, ll c) { return first <= second && second <= c; } template <class t> void mkuni(vc<t>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); } ll rand_int(ll l, ll r) { static random_device rd; static mt19937_64 gen(rd()); return uniform_int_distribution<ll>(l, r)(gen); } void priv(vi s) { cout << s.size(); for (auto i : s) cout << << i + 1; cout << endl; } ll ask(vi s, vi t, ll v) { static ll num = 0; num++; assert(num <= 11111); priv(s); priv(t); cout << v + 1 << endl; ll res; cin >> res; return res; } void answer(vc<pi> ans) { cout << ANSWER << endl; for (auto e : ans) cout << e.first + 1 << << e.second + 1 << endl; } const ll nmax = 510; vi t[nmax]; bool rem[nmax]; ll tsize(ll v, ll p) { ll ret = 1; for (auto to : t[v]) if (to != p && !rem[to]) ret += tsize(to, v); return ret; } ll findc(ll v, ll p, ll s) { ll ret = 1, mx = 0; for (auto to : t[v]) if (to != p && !rem[to]) { ll f = findc(to, v, s); if (f <= 0) return f; else { ret += f; chmax(mx, f); } } chmax(mx, s - ret); if (mx * 2 <= s) return -v; else return ret; } signed main() { cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(20); ll n; cin >> n; vi sz(n); for (ll i = ll(1); i < ll(n); i++) { vi s{0}; vi tmp(n - 1); iota(tmp.begin(), tmp.end(), 1); sz[i] = ask(s, tmp, i); } vi idx(n - 1); iota(idx.begin(), idx.end(), 1); sort(idx.begin(), idx.end(), [&](ll i, ll j) { return sz[i] > sz[j]; }); vc<pi> ans; for (auto i : idx) { memset(rem, 0, sizeof(rem)); ll cur = 0; while (1) { cur = -findc(cur, -1, tsize(cur, -1)); vi vs; for (auto to : t[cur]) if (!rem[to]) vs.push_back(to); ll lw = 0, up = vs.size() + 1; while (up - lw > 1) { const ll m = (lw + up) / 2; vi s(vs.begin(), vs.begin() + m); if (ask(s, {i}, cur) < m) up = m; else lw = m; } if (lw == (ll)vs.size()) break; rem[cur] = true; cur = vs[lw]; } t[cur].push_back(i); t[i].push_back(cur); ans.emplace_back(cur, i); } answer(ans); } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-10; struct point { double x, y; }; struct segment { double a, b, c; }; point operator+(point a, point b) { return (point){a.x + b.x, a.y + b.y}; } point operator-(point a, point b) { return (point){a.x - b.x, a.y - b.y}; } double operator*(point a, point b) { return a.x * b.x + a.y * b.y; } double operator/(point a, point b) { return a.x * b.y - a.y * b.x; } point operator*(point a, double b) { return (point){a.x * b, a.y * b}; } point operator/(point a, double b) { return (point){a.x / b, a.y / b}; } int T; point I, J, K, L; segment midline(point A, double a, double b) { segment line; line.a = b; line.b = -a; line.c = -(A.x * line.a + A.y * line.b); return line; } point getpoint(segment A, segment B) { point C; C.x = (-A.c * B.b + B.c * A.b) / (A.a * B.b - B.a * A.b); C.y = (-A.a * B.c + B.a * A.c) / (A.a * B.b - B.a * A.b); return C; } point mirror(point A, point B) { point C; C = A + (B - A) * 2; return C; } int zero1(double x) { return x > eps; } int zero0(double x) { return x < -eps; } int solve(point A, point B, point C) { point D, E, F, G, H; point IJ, JK, KL, LI; segment lineAC, lineBC, lineD, lineE, lineHG; bool ans; ans = false; lineAC = (segment){A.y - C.y, C.x - A.x, A / C}; lineBC = (segment){B.y - C.y, C.x - B.x, B / C}; D = (A + C) / 2; E = (B + C) / 2; lineD = midline(D, lineAC.a, lineAC.b); lineE = midline(E, lineBC.a, lineBC.b); F = getpoint(lineD, lineE); G = mirror(E, C); H = mirror(F, C); lineHG = (segment){H.y - G.y, G.x - H.x, H / G}; I = getpoint(lineHG, lineD); J = mirror(I, C); K = mirror(J, B); L = mirror(I, A); IJ = J - I; JK = K - J; KL = L - K; LI = I - L; if (zero1(IJ / JK) && zero1(JK / KL) && zero1(KL / LI) && zero1(LI / IJ)) ans = true; if (zero0(IJ / JK) && zero0(JK / KL) && zero0(KL / LI) && zero0(LI / IJ)) ans = true; return ans; } void print() { printf( YES n%.9lf %.9lf %.9lf %.9lf %.9lf %.9lf %.9lf %.9lf n , I.x, I.y, J.x, J.y, K.x, K.y, L.x, L.y); } int main() { point A, B, C; scanf( %d , &T); while (T--) { scanf( %lf%lf%lf%lf%lf%lf , &A.x, &A.y, &B.x, &B.y, &C.x, &C.y); if (solve(A, B, C)) print(); else if (solve(A, C, B)) print(); else if (solve(B, C, A)) print(); else printf( NO n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; int a[111]; int memo[111][1 << 17]; pair<pair<int, int>, int> child[111][1 << 17]; int bt[66]; class MathFunction { private: long long sieve_size; bitset<1010> bs; vector<int> primes; public: int primeid[1010]; bool isPrime(long long N) { if (N <= sieve_size) return bs[N]; for (int i = 0; i < (int)primes.size(); i++) if (N % primes[i] == 0) return false; return true; } void sieve(long long upperbound) { sieve_size = upperbound + 1; bs.set(); bs[0] = bs[1] = 0; for (long long i = 2; i < sieve_size; i++) { if (bs[i]) { for (long long j = i * i; j < sieve_size; j += i) bs[j] = 0; primeid[(int)i] = primes.size(); primes.push_back((int)i); } } } vector<int> primeFactors(long long N) { vector<int> factors; long long idx = 0, pf = primes[idx]; while (N != 1 && (pf * pf <= N)) { while (N % pf == 0) { N /= pf; factors.push_back(pf); } pf = primes[++idx]; } if (N != 1) factors.push_back(N); return factors; } }; MathFunction mat; int dp(int pos, int bitmask) { if (pos == n) return 0; if (memo[pos][bitmask] >= 0) return memo[pos][bitmask]; int q = abs(1 - a[pos]) + dp(pos + 1, bitmask); child[pos][bitmask] = pair<pair<int, int>, int>(pair<int, int>(pos + 1, bitmask), 1); for (int i = 2; i < a[pos] + a[pos]; i++) { if ((bitmask & bt[i]) == 0) { int d = abs(i - a[pos]) + dp(pos + 1, bitmask | bt[i]); if (d < q) { q = d; child[pos][bitmask] = pair<pair<int, int>, int>( pair<int, int>(pos + 1, bitmask | bt[i]), i); } } } return memo[pos][bitmask] = q; } void printAns(int pos, int bitmask) { if (pos == n) return; pair<int, int> nx = child[pos][bitmask].first; int val = child[pos][bitmask].second; printf( %d , val); printAns(nx.first, nx.second); } int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); } mat.sieve(100); bt[1] = 0; for (int i = 2; i <= 61; i++) { vector<int> v = mat.primeFactors(i); int b = 0; for (int j = 0; j < v.size(); j++) { if (mat.primeid[v[j]] <= 15) b |= (1 << mat.primeid[v[j]]); } bt[i] = b; } memset(memo, -1, sizeof memo); dp(0, 0); printAns(0, 0); return 0; } |
#include <bits/stdc++.h> using namespace std; using namespace std; const long long mod2 = 998244353; long long fpow(long long x, long long y) { x = x % 1000000007; long long sum = 1; while (y) { if (y & 1) sum = sum * x; sum %= 1000000007; y = y >> 1; x = x * x; x %= 1000000007; } return sum; } long long inv(long long a, long long m = 1000000007) { long long c = m; long long y = 0, x = 1; if (m == 1) return 0; while (a > 1) { long long q = a / m; long long t = m; m = a % m, a = t; t = y; y = x - q * y; x = t; } if (x < 0) x += c; return x; } long long gcd(long long a, long long b) { if (!a) return b; return gcd(b % a, a); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); long long n; cin >> n; vector<long long> a(n); for (int i = 0; i < n; i++) cin >> a[i]; long long res = 1; for (int i = 0; i < 10; i++) { long long ele = a[rng() % n]; vector<long long> div, cnt; for (long long j = 1; j * j <= ele; j++) { if ((ele % j) == 0) { if (j * j == ele) { div.push_back(j); cnt.push_back(0); } else { div.push_back(j); cnt.push_back(0); div.push_back(ele / j); cnt.push_back(0); } } } sort(div.begin(), div.end()); for (int j = 0; j < n; j++) { long long g = gcd(ele, a[j]); cnt[lower_bound(div.begin(), div.end(), g) - div.begin()]++; } for (int j = 0; j < div.size(); j++) { for (int k = j + 1; k < div.size(); k++) { if (div[k] % div[j] == 0) cnt[j] += cnt[k]; } if (2 * cnt[j] >= n) res = max(res, div[j]); } } cout << res << n ; } |
#include <bits/stdc++.h> #define int long long #define mod 1000000007 #define inv 500000004 using namespace std; int ksm(int a, int b) { int ans = 1, base = a % mod; while (b) { if (b & 1) ans = (ans * base) % mod; base = (base * base) % mod; b /= 2; } return ans % mod; } struct Edge{ int to; int next; }; Edge edge[405]; int head[205], cnt = 0; void add(int u, int v) { cnt++; edge[cnt].to = v; edge[cnt].next = head[u]; head[u] = cnt; } int n, fa[205][25], f[205][205], dep[205]; void dfs(int u, int fath) { for (int i = head[u]; i; i = edge[i].next) { int v = edge[i].to; if (v == fath) continue; dep[v] = dep[u] + 1; fa[v][0] = u; for (int j = 1; j <= 22; j++) { fa[v][j] = fa[fa[v][j - 1]][j - 1]; } dfs(v, u); } } int lca(int x, int y) { if (dep[x] < dep[y]) swap(x, y); for (int i = 22; i >= 0; i--) { if (dep[fa[x][i]] >= dep[y]) { x = fa[x][i]; } } if (x == y) return x; for (int i = 22; i >= 0; i--) { if (fa[x][i] != fa[y][i]) { x = fa[x][i]; y = fa[y][i]; } } return fa[x][0]; } signed main() { cin >> n; for (int i = 1; i < n; i++) { int u, v; cin >> u >> v; add(u, v); add(v, u); } for (int i = 1; i <= n; i++) f[0][i] = 1; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { f[i][j] = ((f[i - 1][j] + f[i][j - 1]) % mod * inv % mod) % mod; } } int ans = 0; for (int rt = 1; rt <= n; rt++) { memset(dep, 0, sizeof dep); memset(fa, 0, sizeof fa); dep[rt] = 1; dfs(rt, 0); for (int i = 1; i <= n; i++) { for (int j = 1; j <= i - 1; j++) { int LCA = lca(i, j); ans = (ans % mod + f[dep[i]-dep[LCA]][dep[j]-dep[LCA]] % mod) % mod; } } } cout << (ans % mod * ksm(n, mod - 2) % mod) % mod; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> inline bool umin(T1& x, const T2& y) { return x > y ? x = y, true : false; } template <typename T1, typename T2> inline bool umax(T1& x, const T2& y) { return x < y ? x = y, true : false; } const int N = (int)5e2 + 5; const int INF = (int)1e9 + 17; const long long LLINF = (long long)1e18 + 17; const int mod = 998244353; inline void add(int& x, int y) { x = (x + y >= mod ? x + y - mod : x + y); } inline int mul(int x, int y) { return 1ll * x * y % mod; } int n, m; int cnt[N]; int nxt[N][N]; int prv[N][N]; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(nullptr), cout.tie(nullptr); cin >> n >> m; prv[0][0] = 1; for (int total = (0); total < (n); ++total) { for (int maxEqual = (0); maxEqual < (total + 1); ++maxEqual) { for (int equal = (0); equal < (total + 1); ++equal) { if (prv[maxEqual][equal] == 0) continue; add(nxt[max(maxEqual, equal + 1)][equal + 1], prv[maxEqual][equal]); add(nxt[max(maxEqual, 1)][1], prv[maxEqual][equal]); } } memcpy(prv, nxt, sizeof nxt); memset(nxt, 0, sizeof nxt); } for (int maxEqual = (0); maxEqual < (n + 1); ++maxEqual) { for (int equal = (0); equal < (maxEqual + 1); ++equal) { add(cnt[maxEqual], prv[maxEqual][equal]); } } int answer = 0; for (int a = (0); a < (n + 1); ++a) for (int b = (0); b < (n + 1); ++b) { if (a * b >= m) continue; add(answer, mul(cnt[a], cnt[b])); } if (answer % 2 == 0) answer /= 2; else answer = (answer + mod) / 2; cout << answer << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 100010; const long long INF = (long long)1 << 60; long long x[maxn], y[maxn], n; inline long long sqr(long long x) { return x * x; } long long p[maxn], cnt; long long ans; bool cmpy(int a, int b) { return y[a] < y[b]; } void solve(int l, int r) { if (l == r) return; int m = (l + r) >> 1; solve(l, m); solve(m + 1, r); cnt = 0; for (int i = l; i <= r; i++) { if (sqr(x[m] - x[i]) >= ans) continue; p[cnt++] = i; } sort(p, p + cnt, cmpy); for (int i = 0; i < cnt; i++) { for (int j = i + 1; j < cnt && sqr(y[p[j]] - y[p[i]]) < ans; j++) ans = min(ans, sqr(y[p[j]] - y[p[i]]) + sqr(x[p[j]] - x[p[i]])); } } int main() { scanf( %lld , &n); y[0] = 0; for (int i = 1; i <= n; i++) scanf( %lld , &y[i]), x[i] = i, y[i] += y[i - 1]; ans = INF; solve(1, n); printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxsize = 100005; const int inf = 1061109567; vector<int> edge[maxsize]; vector<pair<int, int> > base[maxsize]; int nnext[maxsize]; int n; int deepth[maxsize]; int siz[maxsize]; int last = 0; int ans[10 * maxsize]; int cnt = 0; void dfs1(int u) { if (edge[u].size() == 0) { deepth[u] = 1; return; } int maxi = 0; for (auto v : edge[u]) { siz[v] = siz[u] + 1; dfs1(v); maxi = max(deepth[v], maxi); base[u].push_back({deepth[v], v}); } deepth[u] = maxi + 1; sort(base[u].begin(), base[u].end()); return; } void dfs2(int u) { for (auto v : base[u]) { nnext[last] = v.second; last = v.second; printf( %d , v.second); dfs2(v.second); } return; } int main() { scanf( %d , &n); for (int i = 0; i < n - 1; i++) { int u; scanf( %d , &u); edge[u].push_back(i + 1); } dfs1(0); printf( 0 ); dfs2(0); puts( ); int gg = 0; while (nnext[gg]) { int r = siz[gg] - siz[nnext[gg]] + 1; for (int i = 0; i < r; i++) ans[cnt++] = nnext[gg]; gg = nnext[gg]; } printf( %d n , cnt); for (int i = 0; i < cnt; i++) printf( %d , ans[i]); puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, cnt = 0, i; char str[10], o[5]; scanf( %d , &n); scanf( %s , o); for (i = 0; i < n; i++) { scanf( %s , str); if (str[5] == o[0] && str[6] == o[1] && str[7] == o[2]) cnt++; if (str[0] == o[0] && str[1] == o[1] && str[2] == o[2]) cnt++; } if (cnt % 2) printf( contest n ); else printf( home n ); return 0; } |
#include <bits/stdc++.h> using namespace std; void input(vector<long long>& v, long n) { for (long long i = 0; i < n; i++) { long long in; cin >> in; v.push_back(in); } } void output(vector<long long> v) { for (long long i = 0; i < v.size(); i++) cout << v[i] << ; } long long max_of_three(long long a, long long b, long long c) { if (a >= b && a >= c) return a; else if (b >= a && b >= c) return b; else return c; } long long max_of_4(long long a, long long b, long long c, long long d) { if (a >= b && a >= c && a >= d) return a; else if (b >= a && b >= c && b >= d) return b; else if (c >= a && c >= d && c >= b) return c; else return d; } map<long long, long long> frequency(vector<long long> v) { map<long long, long long> m; for (long long i = 0; i < v.size(); i++) { if (m.find(v[i]) != m.end()) m[v[i]]++; else { m.insert({v[i], 1}); } } return m; } long long max_occuring_int(std::map<long long, long long> m) { long long max_x = 0; long long i = 0, n = m.size(); std::map<long long, long long>::iterator it = m.begin(); for (i = 0; i < n; i++) { if (it->second > max_x) max_x = it->second; it++; } return max_x; } vector<long long> give_unique_in_vector(vector<long long> v) { sort((v).begin(), (v).end()); auto it = unique((v).begin(), (v).end()); v.resize(std::distance(v.begin(), it)); vector<long long> x = v; return x; } bool isVowel(char c) { return (c == a | c == e || c == i || c == o || c == u || c == y || c == A || c == E || c == I || c == O || c == U || c == Y ); } string removeWord(string str, string word) { if (str.find(word) != string::npos) { size_t p = -1; string tempWord = word + ; while ((p = str.find(word)) != string::npos) str.replace(p, tempWord.length(), ); tempWord = + word; while ((p = str.find(word)) != string::npos) str.replace(p, tempWord.length(), ); } return str; } long long calc(long long i, long long j, long long n) { return (i + 1 - 1) * n + j + 1; } bool compare_descending(long long a, long long b) { return a > b; } void solve() { long long n, k; cin >> n >> k; vector<long long> v; input(v, n); long long max_change_of_min = *min_element((v).begin(), (v).end()) + k; long long price = max_change_of_min; for (long long i = 0; i < (long long)(n); ++i) { long long low = v[i] - k; long long high = v[i] + k; if (low <= 0) low = 1; if (price >= low && price <= high) { } else { cout << -1 n ; return; } } cout << price << endl; ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long test; cin >> test; while (test--) solve(); return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; const int maxn = 100001, inf = 2147483647; const long long mod = 1 ? 998244353 : 1000000007, linf = 9223372036854775807; const double pi = acos(-1); inline long long mi(long long a, long long b, long long mm = mod) { a %= mm; long long u = 1; while (b) { if (b & 1) u = u * a % mm; a = a * a % mm, b >>= 1; } return u; } inline long long gcd(long long a, long long b) { long long c = a % b; while (c) a = b, b = c, c = a % b; return b; } inline void mem(int* a, int p = 0, int len = maxn) { for (int i = 0; i < len; i++) a[i] = p; } struct p { } e; int t, n, a[maxn], b[maxn], x, m; signed main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> t; while (t--) { x = 0; b[0] = 10000, b[1] = 0; cin >> n >> m; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) cin >> a[0], x += abs(a[0]), b[0] = min(b[0], abs(a[0])), b[1] += a[0] < 0; cout << x - 2 * b[0] * (b[1] % 2) << endl; } } |
#include <bits/stdc++.h> using namespace std; int N; int A[5005]; int DP[5005][5005]; void Read() { scanf( %d , &N); for (int i = 1; i <= N; i++) scanf( %d , &A[i]); } void precalcDP() { for (int i = 1; i <= N; i++) { for (int j = i; j <= N; j++) DP[i][j - i] = A[j]; for (int k = 0; (1 << k) <= N; k++) for (int j = 0; j < N; j++) if ((j & (1 << k)) != 0) DP[i][j] ^= DP[i][j ^ (1 << k)]; } for (int j = 1; j <= N; j++) { for (int i = 1; j + i <= N; i++) DP[i][j] = max(DP[i][j], max(DP[i][j - 1], DP[i + 1][j - 1])); } } void Query(int a, int b) { int dist = b - a; printf( %d n , DP[a][dist]); } int main() { Read(); precalcDP(); int Q; scanf( %d , &Q); for (int i = 1; i <= Q; i++) { int x, y; scanf( %d%d , &x, &y); Query(x, y); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, i, j, k, t, s, x, y, h[100005], hh[100005], d, l; int main() { cin >> n; for (i = 0; i < n; i++) scanf( %d , h + i); m = h[n - 1]; for (i = n - 2; i >= 0; i--) { if (h[i] <= m) hh[i] = m - h[i] + 1; else m = h[i]; } for (i = 0; i < n; i++) printf( %d , hh[i]); } |
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> std::istream& operator>>(std::istream& i, pair<T, U>& p) { i >> p.first >> p.second; return i; } template <typename T> std::istream& operator>>(std::istream& i, vector<T>& t) { for (auto& v : t) { i >> v; } return i; } template <typename T, typename U> std::ostream& operator<<(std::ostream& o, const pair<T, U>& p) { o << p.first << << p.second; return o; } template <typename T> std::ostream& operator<<(std::ostream& o, const vector<T>& t) { if (t.empty()) o << n ; for (size_t i = 0; i < t.size(); ++i) { o << t[i] << n [i == t.size() - 1]; } return o; } template <typename T> using minheap = priority_queue<T, vector<T>, greater<T>>; template <typename T> using maxheap = priority_queue<T, vector<T>, less<T>>; template <typename T> bool in(T a, T b, T c) { return a <= b && b < c; } unsigned int logceil(int first) { return 8 * sizeof(int) - __builtin_clz(first); } namespace std { template <typename T, typename U> struct hash<pair<T, U>> { hash<T> t; hash<U> u; size_t operator()(const pair<T, U>& p) const { return t(p.first) ^ (u(p.second) << 7); } }; } // namespace std template <typename T, typename F> T bsh(T l, T h, const F& f) { T r = -1, m; while (l <= h) { m = (l + h) / 2; if (f(m)) { l = m + 1; r = m; } else { h = m - 1; } } return r; } template <typename F> double bshd(double l, double h, const F& f, double p = 1e-9) { unsigned int r = 3 + (unsigned int)log2((h - l) / p); while (r--) { double m = (l + h) / 2; if (f(m)) { l = m; } else { h = m; } } return (l + h) / 2; } template <typename T, typename F> T bsl(T l, T h, const F& f) { T r = -1, m; while (l <= h) { m = (l + h) / 2; if (f(m)) { h = m - 1; r = m; } else { l = m + 1; } } return r; } template <typename F> double bsld(double l, double h, const F& f, double p = 1e-9) { unsigned int r = 3 + (unsigned int)log2((h - l) / p); while (r--) { double m = (l + h) / 2; if (f(m)) { h = m; } else { l = m; } } return (l + h) / 2; } template <typename T> T gcd(T a, T b) { if (a < b) swap(a, b); return b ? gcd(b, a % b) : a; } template <typename T> class vector2 : public vector<vector<T>> { public: vector2() {} vector2(size_t a, size_t b, T t = T()) : vector<vector<T>>(a, vector<T>(b, t)) {} }; template <typename T> class vector3 : public vector<vector2<T>> { public: vector3() {} vector3(size_t a, size_t b, size_t c, T t = T()) : vector<vector2<T>>(a, vector2<T>(b, c, t)) {} }; template <typename T> class vector4 : public vector<vector3<T>> { public: vector4() {} vector4(size_t a, size_t b, size_t c, size_t d, T t = T()) : vector<vector3<T>>(a, vector3<T>(b, c, d, t)) {} }; template <typename T> class vector5 : public vector<vector4<T>> { public: vector5() {} vector5(size_t a, size_t b, size_t c, size_t d, size_t e, T t = T()) : vector<vector4<T>>(a, vector4<T>(b, c, d, e, t)) {} }; template <typename F> struct NoOp { void setup(unsigned int) {} void op(F& p, F n, unsigned int, unsigned int) { p = n; } void down(F&, F&, F&, unsigned int, unsigned int) {} }; template <typename F, typename SetOp, typename PowerOp> struct Lazy { void setup(unsigned int s) { this->s = s; L = new F[s](); } void down(F& u, F& l, F& r, unsigned int i, unsigned int s) { op(l, L[i], i << 1, s >> 1); op(r, L[i], i << 1 | 1, s >> 1); L[i] = 0; } void op(F& p, F n, unsigned int i, unsigned int s) { p = sop(p, pop(n, s)); if (i < this->s) this->L[i] = sop(this->L[i], n); } SetOp sop; PowerOp pop; F* L; unsigned int s; }; template <typename F, typename CombineOp, typename ModifyOp = NoOp<F>> struct SegTree { void setup(unsigned int s, F def) { n = 1 << logceil(s); T = vector<F>(2 * n, def); for (unsigned int i = n - 1; i > 0; i--) T[i] = cop(T[i << 1], T[i << 1 | 1]); mop.setup(2 * n); } void setup(vector<F>& data, F def = F()) { n = 1 << logceil(data.size()); T = vector<F>(2 * n, def); copy(data.begin(), data.end(), T.begin() + n); for (unsigned int i = n - 1; i > 0; i--) T[i] = cop(T[i << 1], T[i << 1 | 1]); mop.setup(2 * n); } inline void put(unsigned int first, F n) { put(first, first, n); } inline void put(unsigned int from, unsigned int to, F v) { put2(from, to + 1, v, 1, n); } inline F get(unsigned int first) { return get(first, first); } inline F get(unsigned int from, unsigned int to) { return get2(from, to + 1, 1, n); } void put2(unsigned int from, unsigned int to, F v, unsigned int i, unsigned int s) { if (from == 0 && to == s) { mop.op(T[i], v, i, s); return; } mop.down(T[i], T[i << 1], T[i << 1 | 1], i, s); s >>= 1; i <<= 1; if (to <= s) { put2(from, to, v, i, s); } else if (from >= s) { put2(from - s, to - s, v, i | 1, s); } else { put2(from, s, v, i, s); put2(0, to - s, v, i | 1, s); } T[i >> 1] = cop(T[i], T[i | 1]); } F get2(unsigned int from, unsigned int to, unsigned int i, unsigned int s) { while (true) { if (from == 0 && to == s) return T[i]; mop.down(T[i], T[i << 1], T[i << 1 | 1], i, s); s >>= 1; i <<= 1; if (to > s) { to -= s; if (from >= s) { from -= s; i |= 1; } else return cop(get2(from, s, i, s), get2(0, to, i | 1, s)); } } } unsigned int n; vector<F> T; CombineOp cop; ModifyOp mop; }; template <typename F> struct AddOp { F operator()(F a, F b) { return a + b; } }; template <typename F> struct MinOp { F operator()(F a, F b) { return std::min(a, b); } }; template <typename F> struct MaxOp { F operator()(F a, F b) { return std::max(a, b); } }; template <typename F> struct MultiplyOp { F operator()(F a, F b) { return a * b; } }; template <typename F> struct MultOp { F operator()(F a, unsigned int b) { return a * b; } }; template <typename F> struct IdempOp { F operator()(F a, unsigned int b) { return a; } }; template <typename F> struct InverseOp { F operator()(F a, F b) { return b ? b - a : a; } }; template <typename T> using AddSumTree = SegTree<T, AddOp<T>, Lazy<T, AddOp<T>, MultOp<T>>>; template <typename T> using AddMaxTree = SegTree<T, MaxOp<T>, Lazy<T, AddOp<T>, IdempOp<T>>>; template <typename T> using AddMinTree = SegTree<T, MinOp<T>, Lazy<T, AddOp<T>, IdempOp<T>>>; template <typename T> using AssignMinTree = SegTree<T, MinOp<T>, Lazy<T, MinOp<T>, IdempOp<T>>>; template <typename T> using AssignMaxTree = SegTree<T, MaxOp<T>, Lazy<T, MaxOp<T>, IdempOp<T>>>; template <typename T> using XorTree = SegTree<T, AddOp<T>, Lazy<T, InverseOp<T>, MultOp<T>>>; template <typename T> using SetMinTree = SegTree<T, MinOp<T>>; template <typename T> using SetMaxTree = SegTree<T, MaxOp<T>>; template <typename T> using SetMulTree = SegTree<T, MultiplyOp<T>>; class developinggame { public: void solve(istream& cin, ostream& cout) { int N; cin >> N; vector<pair<int, std::pair<int, int>>> P(N); cin >> P; vector<vector<int>> In(3e5 + 1), Out(3e5 + 1); for (int i = 0; i < N; ++i) { In[P[i].first].push_back(i); Out[P[i].second.first].push_back(i); } AddMaxTree<int> A; A.setup(3e5 + 1, 0); std::pair<int, int> best{-1, 0}; for (int i = 1; i <= 3e5; ++i) { for (int j : In[i]) A.put(P[j].second.first, P[j].second.second, 1); int g = A.get(0, 3e5); best = max(best, {g, i}); for (int j : Out[i]) A.put(P[j].second.first, P[j].second.second, -1); } int l = best.second; vector<int> X(3e5 + 2, 0); for (auto& p : P) { if (p.first <= l && p.second.first >= l) { X[p.second.first]++; X[p.second.second + 1]--; } } std::pair<int, int> ans{-1, 0}; for (int i = 1; i <= 3e5; ++i) { X[i] += X[i - 1]; ans = max(ans, {X[i], i}); } int first = ans.second; vector<int> Ans; for (int i = 0; i < N; ++i) { auto& p = P[i]; if (p.first <= l && p.second.first >= l && p.second.first <= first && p.second.second >= first) { Ans.push_back(i + 1); } } cout << best.first << n << Ans; } }; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); developinggame solver; std::istream& in(std::cin); std::ostream& out(std::cout); solver.solve(in, out); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int h, r, spheres = 0; cin >> r >> h; spheres = (h / r) * 2; if (h % r < r / 2.) spheres += 1; else { spheres += 2; if (h % r > 1.732 * r / 2.) spheres += 1; } cout << spheres; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, x = 0, y = 0; string a, b; cin >> a >> b; if (a.size() > b.size()) { n = a.size(); } else { n = b.size(); } for (int i = 0; i < n; i++) { if (b[x] == a[y]) { x++; y++; } else { x++; } if (b[x] == 0 || a[y] == 0) { cout << (y + 1); break; } } } |
#include <bits/stdc++.h> long long x, n, d1, d2, now; int main() { scanf( %lld %lld , &n, &x); d1 = x; d2 = x; long long l, r, ans = 0l; for (int i = 1; i <= n; i++) { scanf( %lld %lld , &l, &r); if (l <= d1 && r >= d2) continue; if (r < d1) { ans += (d1 - r); d2 = d1; d1 = r; } else if (l > d2) { ans += (l - d2); d1 = d2; d2 = l; } else { d1 = (d1 < l) ? l : d1; d2 = (d2 > r) ? r : d2; } } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long inf = 1e10; void solve() { long long n, m, k; cin >> n >> m >> k; long long moves = (n + m - 2) + (n * m) - 1; for (long long i = 0; i < m + n; i++) { cin >> k; } cout << moves << n ; for (long long i = 0; i < n - 1; i++) { cout << U ; } for (long long i = 0; i < m - 1; i++) { cout << L ; } string r(m - 1, R ); string l(m - 1, L ); for (long long i = 0; i < n; i++) { if (i % 2) { cout << l; } else cout << r; if (i != n - 1) cout << D ; } cout << n ; } int32_t main() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); long long t = 1; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int X, Y; int n; int cnt; bool used[1000][1000]; bool edge[1000][1000][4]; const int DX[] = {1, 0, -1, 0}, DY[] = {0, 1, 0, -1}; vector<int> ans; void dfs(int x, int y) { if (x < 0 || x >= X || y < 0 || y >= Y || used[x][y]) return; used[x][y] = true; cnt++; for (int i = 0; i < 4; i++) { if (!edge[x][y][i]) { dfs(x + DX[i], y + DY[i]); } } } int main() { scanf( %d%d%d , &X, &Y, &n); for (int i = 1; i <= n; i++) { int x1, y1, x2, y2; scanf( %d%d%d%d , &x1, &y1, &x2, &y2); if (x1 == x2) { for (int j = y1; j < y2; j++) { edge[x1 - 1][j][0] = true; edge[x1][j][2] = true; } } else if (y1 == y2) { for (int j = x1; j < x2; j++) { edge[j][y1 - 1][1] = true; edge[j][y1][3] = true; } } } for (int i = 0; i < X; i++) for (int j = 0; j < Y; j++) if (!used[i][j]) { cnt = 0; dfs(i, j); ans.push_back(cnt); } sort(ans.begin(), ans.end()); for (int i = 0; i < ans.size(); i++) printf( %d , ans[i]); puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1010; char s[100]; bool ops[256]; int relabel[N * 6]; int va[N * 6][2]; int typ[N * 6]; bool vis[N * 6], beres[N * 6]; string detail[N * 6]; map<string, int> ex; map<pair<pair<int, int>, int>, int> rel; vector<string> ans; char usea; int usev; string nxtvar() { while (true) { string cur = string() + usea + to_string(usev); if (!ex.count(cur)) { ex.insert(make_pair(cur, 0)); return cur; } if (++usev == 1000) { usev = 0; ++usea; } } } int strcnt; int gid(const string& str) { auto it = ex.find(str); if (it != ex.end()) return it->second; ex.insert(make_pair(str, ++strcnt)); detail[strcnt] = str; return strcnt; } int nid(const string& str) { detail[++strcnt] = str; return ex[str] = strcnt; } void dfs(int u) { if (vis[u]) return; vis[u] = true; if (typ[u] == 0) { relabel[u] = u; return; } if (typ[u] == -1) { if (beres[u]) { if (typ[va[u][0]]) { beres[va[u][0]] = true; } else { if (detail[va[u][0]] != res ) ans.push_back( res= + detail[va[u][0]]); return; } } dfs(va[u][0]); relabel[u] = relabel[va[u][0]]; return; } dfs(va[u][0]); dfs(va[u][1]); pair<pair<int, int>, int> spec( make_pair(relabel[va[u][0]], relabel[va[u][1]]), typ[u]); relabel[u] = u; if (!rel.count(spec)) { rel.insert(make_pair(spec, u)); detail[u] = nxtvar(); ans.push_back((beres[u] ? string( res ) : detail[u]) + = + detail[relabel[va[u][0]]] + char(typ[u]) + detail[relabel[va[u][1]]]); } else relabel[u] = rel[spec]; } int main() { usea = a ; usev = 0; ops[ $ ] = true; ops[ ^ ] = true; ops[ # ] = true; ops[ & ] = true; int t; scanf( %d , &t); while (t--) { scanf( %s , s); char *p1 = s, *p2; while (*p1 != = ) ++p1; string a(s, p1); p2 = p1; while (!ops[*p2] && *p2) ++p2; if (ops[*p2]) { string b(p1 + 1, p2), c(p2 + 1); int bi = gid(b), ci = gid(c); int ai = nid(a); typ[ai] = *p2; va[ai][0] = bi; va[ai][1] = ci; } else { string b(p1 + 1); int bi = gid(b); int ai = nid(a); typ[ai] = -1; va[ai][0] = bi; } } int resi = gid( res ); beres[resi] = true; dfs(resi); printf( %lu n , ans.size()); for (auto str : ans) puts(str.c_str()); return 0; } |
#include <bits/stdc++.h> using namespace std; void read(vector<long long> &v) { for (int i = 0; i < v.size(); i++) cin >> v[i]; } void print(vector<long long> v) { for (int i = 0; i < v.size(); i++) cout << v[i] << ; } long long n, m, a, b, temp, x, y; string str; set<string> strings; unordered_map<string, vector<int>> mp; bool check(int l, int r) { for (auto s : strings) { if (r - l + 1 < s.size()) continue; auto it = lower_bound(mp[s].begin(), mp[s].end(), l); if (it == mp[s].end()) continue; int val = *it; if (val <= (r - s.size() + 1)) return 0; } return 1; } int start; int solve() { int l = 0; int r = 0; int ans = 0; for (int l = 0; l < str.size(); l++) { while (r < l) r++; if (!check(l, r)) { if (r - l > ans) { ans = r - l; start = l; } continue; } while (r < str.size()) { if (check(l, r)) r++; else break; } if (r - l > ans) { ans = r - l; start = l; } } return ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> str; cin >> n; for (int i = 0; i < n; i++) { string s; cin >> s; strings.insert(s); } for (auto s : strings) { string temp; if (s.size() > str.size()) continue; for (int i = 0; i <= str.length() - s.length(); i++) { temp = str.substr(i, s.length()); if (temp == s) mp[s].push_back(i); } } long long ans = solve(); cout << ans << << start; } |
#include <bits/stdc++.h> using namespace std; long long x, y; int n; pair<long long, long long> a[200001]; vector<long long> numbers; map<long long, int> matchs; long long matchsReverse[400001]; int increase[400001]; int decrease[400001]; long long answer[400001]; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> x >> y; a[i] = make_pair(x, y); numbers.push_back(x); numbers.push_back(y); } sort(numbers.begin(), numbers.end()); int last = -1, num = 0; for (int i = 0; i < numbers.size(); i++) { if (last != numbers[i]) { num++; matchs[numbers[i]] = num; matchsReverse[num] = numbers[i]; last = numbers[i]; } } for (int i = 0; i < n; i++) { a[i] = make_pair(matchs[a[i].first], matchs[a[i].second]); increase[a[i].first]++; decrease[a[i].second]++; } long long cnt = 0; for (int i = 1; i <= 400000; i++) { answer[cnt] += matchsReverse[i] - 1 - matchsReverse[i - 1]; answer[cnt + increase[i]]++; cnt += increase[i]; cnt -= decrease[i]; } for (int i = 1; i <= n; i++) cout << answer[i] << ; } |
#include <bits/stdc++.h> using namespace std; int pos[200000 + 10], b[200000 + 10]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; for (int i = 1; i <= n; i++) { int x; cin >> x; if (x) { pos[x] = 0; } } for (int i = 1; i <= n; i++) { cin >> b[i]; if (b[i]) { pos[b[i]] = i; } } int start = 1; int end = b[n]; bool flag = true; for (int i = n - 1, j = end - 1; j > 0; j--, i--) { if (b[i] != j) { flag = false; } } if (flag) { start = end + 1; } if (start != 1) { for (int i = start; i <= n; i++) { if (pos[i] > i - start) { start = 1; break; } } } int ans = n - start + 1; ans += pos[start]; int mx = 0; for (int i = start + 1; i <= n; i++) { int t = pos[i] - pos[start]; mx = max(mx, t - i + start); } cout << ans + mx << n ; } |
#include <bits/stdc++.h> using namespace std; const double PI = 3.141592653589793238460; using namespace std; const int N = 200200; vector<int> g[N]; int w[N], vis[N], done[N]; int can_back[N]; int n, m, s; long long maximum = 0; void dfs(int u, int par) { vis[u] = 1; for (auto v : g[u]) { if (v == par) continue; if (vis[v]) can_back[v] = 1; else dfs(v, u); if (can_back[v] == 1) can_back[u] = 1; } } void findmax(int u, long long sum) { done[u] = 1; if (g[u].size() == 1 and u != s) { sum += w[u]; maximum = max(maximum, sum); return; } if (can_back[u] == 0) sum += w[u]; for (auto v : g[u]) { if (!done[v]) findmax(v, sum); } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> w[i]; } for (int i = 1; i <= m; i++) { int u, v; cin >> u >> v; g[u].push_back(v); g[v].push_back(u); } cin >> s; can_back[s] = 1; dfs(s, 0); long long ans = 0; for (int i = 1; i <= n; i++) { if (can_back[i] == 1) ans += w[i]; } findmax(s, 0); ans += maximum; cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; vector<int> adjL(N, -1); for (int n = 0; n < N; n++) { cin >> adjL[n]; adjL[n]--; } bool c = false; for (int i = 0; i < N; i++) { int node = i; for (int x = 0; x < 3; x++) { if (adjL[node] != -1) { node = adjL[node]; } } if (node == i) { cout << YES ; c = true; break; } } if (!c) cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e6 + 5; int n, ri[N]; char s[N]; struct node { int ch[26], par, val; } t[N]; int sz = 1, root = 1, last = 1; void extend(int c) { int p = last, np = ++sz; t[np].val = t[p].val + 1; ri[np]++; for (; p && !t[p].ch[c]; p = t[p].par) t[p].ch[c] = np; if (!p) t[np].par = root; else { int q = t[p].ch[c]; if (t[q].val == t[p].val + 1) t[np].par = q; else { int nq = ++sz; t[nq] = t[q]; t[nq].val = t[p].val + 1; t[q].par = t[np].par = nq; for (; p && t[p].ch[c] == q; p = t[p].par) t[p].ch[c] = nq; } } last = np; } int vis[N]; void walk(int id) { int u = root, len = n + n - 1, ans = 0, nowLen = 0; for (int i = 1; i <= len; i++) { int c = s[i] - a ; if (t[u].ch[c]) u = t[u].ch[c], nowLen++; else { while (u && !t[u].ch[c]) u = t[u].par; if (!u) u = root, nowLen = 0; else nowLen = t[u].val + 1, u = t[u].ch[c]; } if (vis[u] != id && nowLen >= n) vis[u] = id, ans += ri[u]; if (n != 1) while (t[t[u].par].val + 1 >= n) u = t[u].par, nowLen = t[u].val; } printf( %d n , ans); } int c[N], a[N]; void RadixSort() { for (int i = 1; i <= sz; i++) c[t[i].val]++; for (int i = 1; i <= n; i++) c[i] += c[i - 1]; for (int i = sz; i >= 1; i--) a[c[t[i].val]--] = i; } void solve() { RadixSort(); int u; for (int i = sz; i >= 1; i--) u = a[i], ri[t[u].par] += ri[u]; int m; scanf( %d , &m); for (int i = 1; i <= m; i++) { scanf( %s , s + 1); n = strlen(s + 1); for (int i = 1; i < n; i++) s[i + n] = s[i]; walk(i); } } int main() { scanf( %s , s + 1); n = strlen(s + 1); for (int i = 1; i <= n; i++) extend(s[i] - a ); solve(); } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int64_t n, m; cin >> n >> m; if (n <= m) { cout << n << endl; } else { n -= m; int64_t l = 0, r = 2e9; while (l < r) { int64_t m = (l + r) / 2; int64_t val = m * (m + 1) / 2; if (val >= n) { r = m; } else { l = m + 1; } } cout << l + m << endl; } return 0; } |
#define _USE_MATH_DEFINES #include<iostream> #include<fstream> #include<string> #include<vector> #include<utility> #include<algorithm> #include<climits> #include<set> #include<map> #include<cmath> #include<iomanip> #include<iterator> #include<queue> #include<stack> #include<cctype> #include<deque> #include<time.h> #include<bitset> #include<random> #include <functional> #include<unordered_set> #include<unordered_map> #include<random> #include<numeric> #include<chrono> #include<sstream> #include <valarray> #include<list> #include<complex> #include<cassert> typedef long long ll; typedef long double ld; typedef unsigned long long ull; #pragma warning(disable : 4996) #pragma comment(linker, /STACK:16777216 ) #define pb push_back #define en n #define forn(i,n) for(int i = 0;i<n;i++) #define for0(i,n) for(int i = 0;i<n;i++) #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() #define vec vector #define pii pair<int,int> #define pll pair<ll,ll> #define szof(x) int(x.size()) #define sqr(x) ((x)*(x)) #define debug(x) cerr<<#x<< = <<x<< n using namespace std; const int INF = 1000000000 + 1e8; const ll LINF = 2000000000000000000; const int N = 1e5 + 10; const int MOD = 1e9 + 7; ll l[N]; ll r[N]; void inc(int i1, int change, ll* t) { for (int i = i1; i < N; i = i | (i + 1)) { t[i] += change; } } ll prefix(int i1, ll* t) { ll res = 0; for (int i = i1; i >= 0; i = (i & (i + 1)) - 1) { res += t[i]; } return res; } //возвращает prefix [i1, i2] ll prefix(int i1, int i2, ll* t) { return prefix(i2, t) - (i1 == 0 ? 0 : prefix(i1 - 1, t)); } const int SEGTREE_SIZE = 2e5 + 10; const ll NO_OPERATION = 1e18 + 5; struct segtree { struct node { ll set; ll min; ll max; }; vector<node> t; int size; const node NEUTRAL_ELEM = { NO_OPERATION, LINF, -LINF }; const node ZERO = { NO_OPERATION , 0, 0 }; void modify_op(ll& a, ll b, ll len) { if (b == NO_OPERATION) return; if (a == NO_OPERATION) { a = b * len; } else { a += b * len; } } node sum_op(node &a, node &b) { node res; res.min = min(a.min, b.min); res.max = max(a.max, b.max); res.set = NO_OPERATION; return res; } void push(int v, int tl, int tr) { if (t[v].set == NO_OPERATION || tr - tl == 1) { return; } int tm = (tr + tl) / 2; modify_op(t[v * 2 + 1].set, t[v].set, 1); modify_op(t[v * 2 + 1].min, t[v].set, 1); modify_op(t[v * 2 + 1].max, t[v].set, 1); modify_op(t[v * 2 + 2].set, t[v].set, 1); modify_op(t[v * 2 + 2].min, t[v].set, 1); modify_op(t[v * 2 + 2].max, t[v].set, 1); t[v].set = NO_OPERATION; } void init(int n) { size = 1; while (size < n) { size *= 2; } t.assign(2 * size, ZERO); } segtree(int n = SEGTREE_SIZE) { init(n); } segtree(vector<pii>& a) { init(a.size()); build(a); } void build(vector<pii>& a, int v, int tl, int tr) { if (tr - tl == 1) { if (tl < a.size()) t[v] = { NO_OPERATION, a[tl].second, a[tl].first }; return; } int tm = (tr + tl) / 2; build(a, v * 2 + 1, tl, tm); build(a, v * 2 + 2, tm, tr); t[v] = sum_op(t[v * 2 + 1], t[v * 2 + 2]); } void build(vector<pii>& a) { build(a, 0, 0, size); } void modify(int v, int tl, int tr, int l, int r, ll val) { push(v, tl, tr); if (tr <= l || tl >= r) { return; } if (l <= tl && tr <= r) { modify_op(t[v].set, val, 1); modify_op(t[v].min, val, 1); modify_op(t[v].max, val, 1); return; } int tm = (tl + tr) / 2; modify(v * 2 + 1, tl, tm, l, r, val); modify(v * 2 + 2, tm, tr, l, r, val); t[v] = sum_op(t[v * 2 + 1], t[v * 2 + 2]); } void modify(int l, int r, ll val) { modify(0, 0, size, l, r, val); } node get(int v, int tl, int tr, int l, int r) { push(v, tl, tr); if (tr <= l || tl >= r) { return NEUTRAL_ELEM; } if (l <= tl && tr <= r) { return t[v]; } int tm = (tl + tr) / 2; auto g1 = get(v * 2 + 1, tl, tm, l, r); auto g2 = get(v * 2 + 2, tm, tr, l, r); return sum_op(g1, g2); } node get(int l, int r) { if (l >= r) { return ZERO; } return get(0, 0, size, l, r); } }; void solve() { int n, m; cin >> n >> m; vector<int> k(n + 1); vector<pii> left(n + 1); vector<pii> right(n + 1); for(int i = 1; i <= n; i++){ cin >> k[i]; cin >> left[i].first >> left[i].second; cin >> right[i].first >> right[i].second; } for (int i = 0; i <= n; i++) { if (left[i].first <= k[i] && k[i] <= left[i].second) { inc(i, 1, l); } if (right[i].first <= k[i] && k[i] <= right[i].second) { inc(i, 1, r); } } vector<int> dpl(n + 1), dpr(n + 1); vector<int> pl(n + 1), pr(n + 1); int last_l = INF, last_r = INF; if (left[n].first <= k[n] && k[n] <= left[n].second) { dpl[n] = 1; last_l = n; pl[n] = n + 1; } if (right[n].first <= k[n] && k[n] <= right[n].second) { dpr[n] = 1; last_r = n; pr[n] = n + 1; } auto st_left = segtree(left); auto st_right = segtree(right); for (int i = n - 1; i >= 0; i--) { int temp_l = last_l, temp_r = last_r; if (last_r != INF) { bool ok = (prefix(i + 1, last_r, r) == last_r - (i + 1) + 1); auto res = st_left.get(i, last_r + 1); ok &= res.max <= k[i]; ok &= res.min >= k[i]; if (ok) { dpl[i] = 1; pl[i] = last_r; temp_l = i; } } if (last_l != INF) { bool ok = (prefix(i + 1, last_l, l) == last_l - (i + 1) + 1); auto res = st_right.get(i, last_l + 1); ok &= res.max <= k[i]; ok &= res.min >= k[i]; if (ok) { dpr[i] = 1; pr[i] = last_l; temp_r = i; } } last_l = temp_l, last_r = temp_r; } if (dpl[0]) { cout << YES << en; bool first = true; int cur = 0; bool is_left = true; while (cur != n + 1) { if (!first) { cout << (is_left == 0) << ; } first = 0; int nt; if (is_left) { nt = pl[cur]; } else { nt = pr[cur]; } is_left ^= 1; for (int i = cur + 1; i < nt; i++) { cout << (is_left == 0) << ; } cur = nt; } return; } if (dpr[0]) { cout << YES << en; bool first = 1; int cur = 0; bool is_left = false; while (cur != n + 1) { if (!first) { cout << (is_left == 0) << ; } first = 0; int nt; if (is_left) { nt = pl[cur]; } else { nt = pr[cur]; } is_left ^= 1; for (int i = cur + 1; i < nt; i++) { cout << (is_left == 0) << ; } cur = nt; } return; } cout << NO << en; } int main() { srand(time(0)); ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); #ifdef _DEBUG freopen( input.txt , r , stdin); //freopen( output.txt , w , stdout); #endif int tst = 1; //cin >> tst; while (tst--) solve(); } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 3; const int INF = 1e9; const int MOD = 1e9 + 7; int n; int a[MAXN]; long long seg[12][4 * MAXN]; void add(int j, int l, int r, long long val, int b = 0, int e = n, int k = 0) { if (l <= b && e <= r) { seg[j][k] += val; return; } if (r <= b || e <= l) return; int mid = (b + e) / 2; add(j, l, r, val, b, mid, k * 2 + 1); add(j, l, r, val, mid, e, k * 2 + 2); } long long get(int j, int i, int b = 0, int e = n, int k = 0) { if (i < b || i >= e) return 0; if (b + 1 == e) return seg[j][k]; int mid = (b + e) / 2; return seg[j][k] + get(j, i, b, mid, k * 2 + 1) + get(j, i, mid, e, k * 2 + 2); } int main() { cin >> n; int k; cin >> k; for (int i = 0; i < n; i++) { int x; cin >> x; x--; a[x] = i; } for (int i = 0; i < n; i++) { if (a[i] == 0) { add(1, a[i], n, 1); } else { for (int j = 2; j <= k + 1; j++) { long long x = get(j - 1, a[i] - 1); add(j, a[i], n, x); } add(1, a[i], n, 1); } } cout << get(k + 1, n - 1); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1LL << 60; int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } int lcm(int a, int b) { return a * b / gcd(a, b); } const int N = 2e5 + 5; int v[N], in[N]; vector<int> e[N]; bool cmp(int a, int b) { return in[a] < in[b]; } void solve() { int n; cin >> n; for (auto &li : e) li.clear(); for (int i = (0); i < (n - 1); ++i) { int x, y; cin >> x >> y; x--, y--; e[x].push_back(y); e[y].push_back(x); } vector<int> ch, gen; for (int i = (0); i < (n); ++i) { v[i] = 0; int z; cin >> z; in[--z] = i; ch.push_back(z); } for (int i = (0); i < (n); ++i) sort((e[i]).begin(), (e[i]).end(), cmp); queue<int> q; q.push(0); v[0] = 1; while (!q.empty()) { int t = q.front(); q.pop(); gen.push_back(t); for (auto to : e[t]) { if (v[to]) continue; v[to] = 1; q.push(to); } } for (int i = (0); i < (n); ++i) if (gen[i] != ch[i]) { puts( No ); return; } puts( Yes ); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); solve(); return 0; } |
#include <bits/stdc++.h> int cnt[111], ans, b, d, pr[111], v[111]; int main() { scanf( %d%d , &b, &d); int k = b; for (int i = 2; k > 1; i++) { if (k % i) continue; while (k % i == 0) cnt[i]++, k /= i; } bool flag = true; k = d; for (int i = 2; k > 1; i++) { if (k % i) continue; int x = 1; while (k % i == 0) pr[i]++, k /= i, x *= i; v[x] = -i; if (cnt[i] == 0) { flag = false; continue; } int p = (pr[i] - 1) / cnt[i] + 1; if (p > ans) ans = p; } if (flag) printf( 2-type n%d n , ans); else { if (b % d == 1) printf( 3-type n ); else if ((b + 1) % d == 0) printf( 11-type n ); else { flag = true; for (int i = 2; i <= d; i++) { if (v[i] >= 0 || cnt[-v[i]] || b % i == 1 || (b + 1) % i == 0) continue; flag = false; break; } if (flag) printf( 6-type n ); else printf( 7-type n ); } } } |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; bool res = false; for (int i = 0; i < s.size() - 1; ++i) { if (s[i] == A && s[i + 1] == B ) { for (int j = i + 2; j < s.size() - 1; ++j) { if (s[j] == B && s[j + 1] == A ) { cout << YES n ; return 0; } } break; } } for (int i = 0; i < s.size() - 1; ++i) { if (s[i] == B && s[i + 1] == A ) { for (int j = i + 2; j < s.size() - 1; ++j) { if (s[j] == A && s[j + 1] == B ) { cout << YES n ; return 0; } } break; } } cout << NO n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int N, M; string grid[1000]; vector<vector<pair<int, char>>> startAdj; vector<bool> visited; vector<int> merged; vector<vector<pair<int, char>>> adj; vector<int> value; vector<int> greaterCount; void flood(int start, int pos) { if (visited[pos]) return; visited[pos] = true; merged[pos] = start; for (int i = 0; i < startAdj[pos].size(); i++) { if (startAdj[pos][i].second != = ) { adj[start].push_back(startAdj[pos][i]); } } for (int i = 0; i < startAdj[pos].size(); i++) { if (startAdj[pos][i].second == = ) { flood(start, startAdj[pos][i].first); } } } int main() { ios_base::sync_with_stdio(false); cin >> N >> M; for (int i = 0; i < N; i++) cin >> grid[i]; startAdj.assign(N + M + 1, vector<pair<int, char>>()); for (int i = 0; i < N; i++) for (int j = 0; j < M; j++) startAdj[i + 1].push_back({j + 1 + N, grid[i][j]}); for (int j = 0; j < M; j++) { for (int i = 0; i < N; i++) { char c = grid[i][j]; if (c == > ) c = < ; else if (c == < ) c = > ; startAdj[j + 1 + N].push_back({i + 1, c}); } } visited.assign(N + M + 1, false); merged.assign(N + M + 1, 0); adj.assign(N + M + 1, vector<pair<int, char>>()); value.assign(N + M + 1, 0); greaterCount.assign(N + M + 1, 0); for (int i = 1; i <= N + M; i++) { if (!visited[i]) { flood(i, i); } } bool works = true; for (int i = 1; i <= N + M; i++) { for (int j = 0; j < adj[i].size(); j++) { if (adj[i][j].second == > ) greaterCount[i]++; if (merged[adj[i][j].first] == i) works = false; } } if (works) { vector<int> curr; for (int i = 1; i <= N + M; i++) if (merged[i] == i && greaterCount[i] == 0) curr.push_back(i); vector<int> next; int v = 1; while (curr.size() != 0) { for (int i = 0; i < curr.size(); i++) { value[curr[i]] = v; for (int j = 0; j < adj[curr[i]].size(); j++) { if (adj[curr[i]][j].second == < ) { greaterCount[merged[adj[curr[i]][j].first]]--; if (greaterCount[merged[adj[curr[i]][j].first]] == 0) { next.push_back(merged[adj[curr[i]][j].first]); } } } } curr = next; next.clear(); v++; } for (int i = 1; i <= N + M; i++) { if (!value[i] && merged[i] == i) works = false; } } if (works) { cout << Yes n ; for (int i = 0; i < N; i++) { if (i) cout << ; cout << value[merged[i + 1]]; } cout << n ; for (int i = 0; i < M; i++) { if (i) cout << ; cout << value[merged[i + 1 + N]]; } cout << n ; } else { cout << No n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long n, k; cin >> n >> k; vector<long long> arr(n); for (long long i = 0; i < n; i++) cin >> arr[i]; long long c = 0; for (long long i = 1; i < n; i++) { if (arr[i] + arr[i - 1] < k) { c += k - arr[i] - arr[i - 1]; arr[i] = k - arr[i - 1]; } } cout << c << n ; for (auto i : arr) cout << i << ; ; cout << n ; return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.