func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; long long max(long long a, long long b) { if (a > b) { return a; } else { return b; } } long long min(long long a, long long b) { if (a < b) { return a; } else { return b; } } vector<string> split(const string& s, char c) { vector<string> v; stringstream ss(s); string x; while (getline(ss, x, c)) v.emplace_back(x); return move(v); } void err(vector<string>::iterator it) {} template <typename T, typename... Args> void err(vector<string>::iterator it, T a, Args... args) { cerr << it->substr((*it)[0] == , it->length()) << = << a << , ; err(++it, args...); } template <typename T> struct number_iterator : std::iterator<random_access_iterator_tag, T> { T v; number_iterator(T _v) : v(_v) {} operator T&() { return v; } T operator*() const { return v; } }; template <typename T> struct number_range { T b, e; number_range(T b, T e) : b(b), e(e) {} number_iterator<T> begin() { return b; } number_iterator<T> end() { return e; } }; template <typename T> number_range<T> range(T e) { return number_range<T>(1, e + 1); } template <typename T> number_range<T> range(T b, T e) { return number_range<T>(b, e + 1); } long long c(long long len, long long b) { long long base = 1, tot = 0; for (int i = (1); i <= (len); i++) { if (i != b) tot += base; base *= 2; } return tot; } long long f(long long d) { if (d <= 1) return 0; long long res = 0; for (int i = (1); i <= (60); i++) { for (int j = (1); j <= (i - 1); j++) { if (c(i, j) <= d) res++; } } return res; } int main() { long long a, b; cin >> a >> b; long long ff = f(b) - f(a - 1); cout << ff << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; struct ilter { int job; long long ti; bool operator<(const ilter &a) const { return a.ti > ti; } } T[100001]; int s, c; long long TIME; int main() { map<int, int> M2; int n, k; cin >> n >> k; for (int i = 0; i < n; i++) { cin >> T[i].job; M2[T[i].job]++; } for (int i = 0; i < n; i++) { cin >> T[i].ti; ; } s = k - M2.size(); if (s == 0) return cout << 0, 0; else { sort(T, T + n); for (int i = 0; i < n; i++) { if (M2[T[i].job] > 1) { TIME += T[i].ti; M2[T[i].job]--; c++; } if (c == s) break; } cout << TIME; } return 0; } |
#include <bits/stdc++.h> const double EPS = 1e-9; const int MAX_REPS = 2000; double bx, by, h, r; void solve(double x, double& y1, double& y2, double& y3) { double A1, A2, B1, B2, C1, C2, dy1, dy2, dx, dy; dx = -(x - bx); dy = ((h - r) - by); A1 = -dy; B1 = dx; C1 = A1 * x + B1 * (h - r); y1 = C1 / B1; A2 = -B1; B2 = A1; C2 = B2 * y1; dy1 = ((C1 - A1) / B1) - (C1 / B1); dy2 = ((C2 - A2) / B2) - (C2 / B2); assert(dy1 > 0); assert(dy2 < 0); A1 = dy1 - dy2; B1 = sqrt(1 + dy2 * dy2); y2 = y1 + A1 / B1 * (B1 + r) - A1; y3 = y1 + A1 / B1 * (B1 - r) - A1; } int main(void) { int i; double yl, yh, frl, tol, frh, toh, mi, bc, bh, bl; std::cin >> yl >> yh >> h >> bx >> by >> r; frh = 0; toh = bx - r / 2; for (i = 0; i < MAX_REPS && fabs(frh - toh) >= EPS; ++i) { mi = (frh + toh) / 2; solve(mi, bc, bh, bl); if (bh >= yh) { frh = mi; } else { toh = mi; } } frl = 0; tol = bx - r / 2; for (i = 0; i < MAX_REPS && fabs(frl - tol) >= EPS; ++i) { mi = (frl + tol) / 2; solve(mi, bc, bh, bl); if (bc - r <= yl) { tol = mi; } else { frl = mi; } } mi = (frl + frh) / 2; solve(mi, bc, bh, bl); if (bc - r < yl || bh > yh) { std::cout << -1 << std::endl; } else { std::cout << (frl + frh) / 2 << std::endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000 * 100 * 2 + 10; long long int a[MAXN]; long long int b[MAXN]; long long int p[MAXN]; long long int d[MAXN]; long long int mod = 1000 * 1000 * 1000 + 7; int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); int n, c; cin >> n >> c; for (int i = 0; i < n - 1; i++) { cin >> a[i]; } for (int i = 0; i < n - 1; i++) { cin >> b[i]; } cout << 0 << ; for (int i = 0; i < n - 1; i++) { if (i == 0) { d[i] = c + b[i]; p[i] = a[i]; } else { d[i] = min(d[i - 1] + b[i], p[i - 1] + b[i] + c); p[i] = min(p[i - 1] + a[i], d[i - 1] + a[i]); } cout << min(d[i], p[i]) << ; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int l[1000005], n, m; long long f[5005][5005], g[2][5005], fa[5005], fac[5005], p, sum; inline int read() { int ret = 0; char fa = getchar(); while (!isdigit(fa)) fa = getchar(); while (isdigit(fa)) { ret = (ret << 1) + (ret << 3) + fa - 0 ; fa = getchar(); } return ret; } inline void Aireen() { n = read(); m = read(); p = (long long)(read()); for (int i = 1; i <= n; ++i) l[i] = read(); fa[0] = fac[0] = 1ll; for (int i = 1, j = m; i < 5005 && j; ++i, --j) { fa[i] = fa[i - 1] * (long long)(i) % p; fac[i] = fac[i - 1] * (long long)(j) % p; } f[0][0] = 1ll; for (int i = 1; i < 5005; ++i) for (int j = min(m, i); j; --j) f[i][j] = (f[i - 1][j - 1] + f[i - 1][j] * (long long)(j - 1) % p) % p; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= l[i + 1]; ++j) g[i & 1][j] = 0ll; if (i == 1) { for (int j = min(l[i], m); j; --j) g[i][j] = fac[j] * f[l[i]][j] % p; } else { sum = 0ll; for (int j = min(l[i - 1], m); j; --j) sum = (sum + g[i & 1 ^ 1][j]) % p; for (int j = min(l[i], m); j; --j) { g[i & 1][j] = (fac[j] * sum % p - fa[j] * g[i & 1 ^ 1][j] % p + p) % p * f[l[i]][j] % p; } } } sum = 0ll; for (int j = min(l[n], m); j; --j) sum = (sum + g[n & 1][j]) % p; cout << sum << endl; } int main() { Aireen(); fclose(stdin); fclose(stdout); return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; long long max(long long a, long long b) { if (a > b) { return a; } else { return b; } } long long min(long long a, long long b) { if (a < b) { return a; } else { return b; } } long long power(long long b, long long e) { if (e == 0) return 1; if (e % 2) return ((b * power((b) * (b), (e - 1) / 2))); else return power((b) * (b), e / 2); } long long modpower(long long b, long long e, long long q) { long long MOD = q; if (e == 0) return 1; if (e % 2) return ((b % MOD) * modpower((b % MOD) * (b % MOD), (e - 1) / 2, q)) % MOD; else return modpower((b % MOD) * (b % MOD), e / 2, q) % MOD; } void dpv(vector<long long> v) { for (long long i = 0; i < v.size(); i++) { cout << v[i] << ; } cout << endl; } void dpv(vector<pair<long long, long long> > v) { for (long long i = 0; i < v.size(); i++) { cout << v[i].first << << v[i].second << endl; } } void dpv(set<long long> v) { for (auto i : v) { cout << i << ; } cout << endl; } long long dp[31][31][51]; long long f(long long a, long long b, long long c) { if (dp[a][b][c] || a * b == c || !c) { return dp[a][b][c]; } long long ans = 1e18; for (long long i = 1; i <= a - i; i++) { for (long long j = 0; j <= c; j++) { ans = min(ans, b * b + f(a - i, b, j) + f(i, b, c - j)); } } for (long long i = 1; i <= b - i; i++) { for (long long j = 0; j <= c; j++) { ans = min(ans, a * a + f(a, i, j) + f(a, b - i, c - j)); } } return dp[a][b][c] = ans; } void oblivious() { long long a, b, c; cin >> a >> b >> c; cout << f(a, b, c) << endl; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); memset(dp, 0, sizeof(dp)); long long t = 1; cin >> t; while (t--) { oblivious(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main(void) { int n, k; cin >> n >> k; string s; cin >> s; unordered_map<char, int> m; char last = s[0]; int streak = 1; int cur_max = 0; if (k == 1) { cur_max = 1; m[last] = 1; streak = 0; } for (int i = 1; i < s.size(); i++) { if (s[i] == last) { streak++; } else { streak = 1; } if (streak == k) { streak = 0; if (m.find(s[i]) == m.end()) { m[s[i]] = 1; } else { m[s[i]]++; } cur_max = m[s[i]] > cur_max ? m[s[i]] : cur_max; } last = s[i]; } cout << cur_max << endl; } |
#include <bits/stdc++.h> using namespace std; template <typename T, typename TT> ostream &operator<<(ostream &s, pair<T, TT> t) { return s << ( << t.first << , << t.second << ) ; } template <typename T> ostream &operator<<(ostream &s, vector<T> t) { s << { ; for (int i = 0; i < t.size(); i++) s << t[i] << (i == t.size() - 1 ? : , ); return s << } << endl; } int main() { ios_base::sync_with_stdio(0); int n, m, a1, b1, a2, b2; cin >> n >> m >> a1 >> b1 >> a2 >> b2; if (abs(a1 - a2) + abs(b1 - b2) <= 4) cout << First ; else if (abs(a1 - a2) + abs(b1 - b2) == 5 && min(abs(a1 - a2), abs(b1 - b2)) >= 1) cout << First ; else if (abs(a1 - a2) + abs(b1 - b2) == 6 && min(abs(a1 - a2), abs(b1 - b2)) >= 2) cout << First ; else cout << Second ; return 0; } |
#include <bits/stdc++.h> using namespace std; static const int maxn = 100010; static const int INF = 0x3f3f3f3f; static const int mod = (int)1e9 + 7; static const double eps = 1e-6; static const double pi = acos(-1); void redirect() {} char s[maxn]; int cnt[26]; int main() { redirect(); int T; scanf( %d , &T); while (T--) { memset(cnt, 0, sizeof(cnt)); scanf( %s , s); for (int i = 0; s[i]; i++) cnt[s[i] - a ]++; bool flag = true; for (int i = 0; i < 26; i++) if (cnt[i] > 1) flag = false; int i = 0; while (i < 26 && cnt[i] == 0) i++; while (i < 26 && cnt[i] == 1) i++; for (; i < 26; i++) if (cnt[i]) flag = false; if (flag) puts( Yes ); else puts( No ); } return 0; } |
/* Problem : Algorithm : Status : */ #include<bits/stdc++.h> #include<iostream> #include<cstring> #include<cstdio> #include<algorithm> #include<cstdlib> #define DEBUG cerr << Passing Line << __LINE__<< in Function [ << __FUNCTION__ << ]. n ; using namespace std; typedef long long ll; typedef pair<int,int> pii; template<class T> inline bool checkMax(T &a,const T &b) {return a < b ? a = b,1 : 0;} template<typename T, typename...Args> inline void checkMax(T &a,const Args...arg) {checkMax(a,max(arg...));} template<class T> inline bool checkMin(T &a,const T &b) {return a > b ? a = b,1 : 0;} template<typename T, typename...Args> inline void checkMin(T &a,const Args...arg) {checkMin(a,min(arg...));} namespace FastIO{ const int SIZE = 1 << 21; char ch; char in[SIZE],*inS = in,*inT = in + SIZE; char out[SIZE],*outS = out,*outT = out + SIZE; #define flush() fwrite(out,1,outS - out,stdout), outS = out #define getchar() (inS == inT && (inT = (inS = in) + fread(in,1,SIZE,stdin),inS == inT) ? EOF : *inS++) void putchar(char c) {*outS++ = c; if(outS == outT) flush();} struct Flusher {~Flusher() {flush();}} flusher; template<typename T> inline void read(T &x){ static int f; x = 0; f = 1; ch = getchar(); while(!isdigit(ch)) {if(ch == - ) f = -1; ch = getchar();} while(isdigit(ch)) {x = (x << 1) + (x << 3) + (ch ^ 48); ch = getchar();} x *= f; } inline void read(char* s){ static int len; len = 0; ch = getchar(); while(ch == n || ch == || ch == 0 ) ch = getchar(); while(ch != n && ch != && ch != EOF) s[len++] = ch, ch = getchar(); s[len] = 0 ; } template<typename T> inline void write(T x){ if(!x) putchar( 0 ); if(x < 0) {x = -x; putchar( - );} static int sta[20]; int tot = 0; while(x) {sta[tot++] = x % 10; x /= 10;} while(tot) putchar(sta[--tot] + 48); } inline void write(char c) {putchar(c);} template<typename T> inline void writeln(T c) {write(c); putchar( n );} template<typename T,typename... Args> inline void read(T &t, Args &...args) {read(t); read(args...);} } using FastIO::read; using FastIO::write; using FastIO::writeln; const int INF = 0x3f3f3f3f; const ll llINF = 1e18; const int MAXN = 6e4 + 5; const int MAXC = 5; int n,C,Q,T; int cnt[MAXC][MAXN],p[MAXN]; ll comb[MAXN][MAXC],w[MAXC][MAXN * MAXC]; struct Node{ int l,r; ll w; Node(int _l = 0,int _r = 0,ll _w = 0) : l(_l), r(_r), w(_w) {} }; struct Deque{ int head,tail; Node a[MAXN * MAXC * 2 + 100]; Node& operator [] (const int &i) {return a[head + i - 1];} void push_front(Node u) {a[--head] = u; assert(head >= 1);} void push_back(Node u) {a[++tail] = u; assert(tail < MAXN * MAXC * 2 + 100);} void clear() {head = MAXN * MAXC + 5, tail = MAXN * MAXC + 4;} int size() {return tail - head + 1;} Deque() {clear();} } q[MAXC]; void Init(int n){ comb[0][0] = 1; for(int i = 1;i <= n;i++){ comb[i][0] = 1; for(int j = 1;j <= min(MAXC - 1,i);j++) comb[i][j] = comb[i - 1][j - 1] + comb[i - 1][j]; } for(int i = 0;i <= n;i++){ for(int j = 1;j < MAXC;j++) comb[i][j] += comb[i][j - 1]; } } ll calc(int n,int c){ if(n <= 0) return 1; assert(n < MAXN); return comb[n - 1][c]; } bool cmp(const Node &x,const Node &y){ return p[x.r] < p[y.r]; } Node GetNxt(int c,int pos,ll rk){ int num = cnt[c][pos]; int l = num + 1, r = q[c].size(), res = 0; while(l <= r){ int mid = (l + r) >> 1; if(w[c][mid] - w[c][num] >= rk) res = mid, r = mid - 1; else l = mid + 1; } assert(res >= 1 && res <= q[c].size()); return Node(q[c][res].l,q[c][res].r,w[c][res - 1] - w[c][num]); } void Solve(){ read(n,C,Q); for(int i = 1;i <= n;i++) read(p[i]); for(int c = 1;c <= C;c++){ q[c].clear(); vector<Node> front,back; for(int i = 1;i <= n;i++) cnt[c][i] = 0; q[c].push_back(Node(n,n,1)); for(int i = n - 1;i >= 1;i--){ front.clear(); back.clear(); for(int j = 1;j <= min(c,n - i);j++){ if(p[i + j] < p[i]) front.emplace_back(i,i + j,calc(n - i - j,c - j)), cnt[c][i + 1] += 1; else back.emplace_back(i,i + j,calc(n - i - j,c - j)); } sort(front.begin(),front.end(),cmp); reverse(front.begin(),front.end()); sort(back.begin(),back.end(),cmp); for(auto x : front) q[c].push_front(x); for(auto x : back) q[c].push_back(x); } for(int i = 1;i <= n;i++) cnt[c][i] += cnt[c][i - 1]; assert(q[c].size() <= MAXN * MAXC + 5); for(int i = 1, sz = q[c].size();i <= sz;i++) w[c][i] = w[c][i - 1] + q[c][i].w; } while(Q--){ int pos; ll rk; read(pos,rk); if(rk > calc(n,C)) {writeln(-1); continue;} int x = 1, c = C; vector<pii> vec; vec.clear(); while(c && x <= n){ Node res = GetNxt(c,x,rk); assert(res.w < rk); rk -= res.w; c -= (res.r - res.l); x = res.r + 1; vec.emplace_back(res.l,res.r); } int flag = 0; for(auto pi : vec){ if(pos >= pi.first && pos <= pi.second){ writeln(p[pi.second - pos + pi.first]); flag = 1; break; } } if(!flag) writeln(p[pos]); } } int main(){ // freopen( data.in , r ,stdin); // freopen( data.out , w ,stdout); Init(MAXN - 1); read(T); while(T--) Solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int dx[] = {1, 0, -1, 0}; int dy[] = {0, 1, 0, -1}; struct MCMF { enum { MAXN = 6500 }; struct Edge { int x, y; int cap, cost; }; vector<Edge> E; vector<int> adj[MAXN]; int N, prev[MAXN]; int dist[MAXN], phi[MAXN]; MCMF(int NN) : N(NN) {} void add(int x, int y, int cap, int cost) { Edge e1 = {x, y, cap, cost}, e2 = {y, x, 0, -cost}; adj[e1.x].push_back(E.size()); E.push_back(e1); adj[e2.x].push_back(E.size()); E.push_back(e2); } vector<queue<int> > Q; void mcmf(int s, int t, int &flowVal, int &flowCost) { int x; flowVal = flowCost = 0; memset(phi, 0, sizeof(phi)); Q.resize(6500); while (true) { for (x = 0; x < N; x++) prev[x] = -1; for (x = 0; x < N; x++) dist[x] = 1000000000; dist[s] = prev[s] = 0; Q[dist[s]].push(s); for (int i = 0; i < 6400; i++) { while (!Q[i].empty()) { x = Q[i].front(); Q[i].pop(); if (dist[x] < i) continue; vector<int>::iterator it; for (it = adj[x].begin(); it != adj[x].end(); it++) { const Edge &e = E[*it]; if (e.cap <= 0) continue; int cc = e.cost + phi[x] - phi[e.y]; if (dist[x] + cc < dist[e.y]) { dist[e.y] = dist[x] + cc; prev[e.y] = *it; Q[dist[e.y]].push(e.y); } } } } if (prev[t] == -1) break; int z = 1000000000; for (x = t; x != s; x = E[prev[x]].x) z = min(z, E[prev[x]].cap); for (x = t; x != s; x = E[prev[x]].x) { E[prev[x]].cap -= z; E[prev[x] ^ 1].cap += z; } flowVal += z; flowCost += z * (dist[t] - phi[s] + phi[t]); for (x = 0; x < N; x++) if (prev[x] != -1) phi[x] += dist[x]; } } } * mc; int a[90][90]; int main() { int i, j, k, n, m; scanf( %d %d , &n, &m); mc = new MCMF(n * m + 10); for (i = 0; i < n; i++) for (j = 0; j < m; j++) cin >> a[i][j]; int src = n * m + 1; int dest = n * m + 2; for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { if ((i + j) % 2 == 0) mc->add(src, i * m + j, 1, 0); else { mc->add(i * m + j, dest, 1, 0); continue; } for (k = 0; k < 4; k++) { int ni = i + dx[k]; int nj = j + dy[k]; if (ni < n && nj < m && ni >= 0 && nj >= 0) { mc->add(i * m + j, ni * m + nj, 1, a[i][j] != a[ni][nj]); } } } } int fval, fcost; mc->mcmf(src, dest, fval, fcost); cout << fcost << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 3005; const int mod = 1e9 + 7; int dp1[N][N], dp2[N][N], a[N]; int main() { int t; scanf( %d , &t); while (t--) { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); } memset(dp1, 0, sizeof(dp1)); memset(dp2, 0, sizeof(dp2)); for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { dp1[i][j] = dp1[i - 1][j]; } dp1[i][a[i]]++; } for (int i = n; i >= 1; i--) { for (int j = 1; j <= n; j++) { dp2[i][j] = dp2[i + 1][j]; } dp2[i][a[i]]++; } long long ans = 0; for (int i = 2; i <= n; i++) { for (int j = i + 1; j < n; j++) { ans += dp1[i - 1][a[j]] * dp2[j + 1][a[i]]; } } printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { std::cin.tie(0); std::ios::sync_with_stdio(false); long long n; cin >> n; if (n <= 5) { cout << -1 << endl; } else { cout << 1 << << 2 << endl; for (int i = 3; i <= n; i++) { if (i % 2) cout << 1 << << i << endl; else cout << 2 << << i << endl; } } for (int i = 2; i <= n; i++) cout << 1 << << i << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; bool SR(int &x) { return scanf( %d , &x) == 1; } bool SR(long long &x) { return scanf( %lld , &x) == 1; } bool SR(double &x) { return scanf( %lf , &x) == 1; } bool SR(char *s) { return scanf( %s , s) == 1; } bool RI() { return true; } template <typename I, typename... T> bool RI(I &x, T &...tail) { return SR(x) && RI(tail...); } void SP(const int x) { printf( %d , x); } void SP(const long long x) { printf( %lld , x); } void SP(const double x) { printf( %.16lf , x); } void SP(const char *s) { printf( %s , s); } void PL() { puts( ); } template <typename I, typename... T> void PL(const I x, const T... tail) { SP(x); if (sizeof...(tail)) putchar( ); PL(tail...); } const int maxn = 3e3 + 3; const int second = 200; struct Node { static Node mem[maxn + 514], *pmem; int dep; Node *fail, *to[2]; int who; Node() : dep(-1), fail(0), to{NULL, NULL}, who(-1) {} Node(int _d, int _w) : dep(_d), fail(0), to{NULL, NULL}, who(_w) {} } Node::mem[maxn + 514], *Node::pmem = Node::mem; int pos[maxn]; struct AC { AC() { root = new (Node::pmem++) Node(-1, -1); } Node *root; void add(const string &s, int id) { Node *pt = root; for (int i = 0; i < int(((int)(s).size())); i++) { if (!pt->to[s[i] - a ]) pt->to[s[i] - a ] = new (Node::pmem++) Node(1 + pt->dep, -1); pt = pt->to[s[i] - a ]; } pt->who = id; pos[id] = pt - Node::mem; } void build() { queue<Node *> q; q.push(root); root->fail = root; while (((int)(q).size())) { Node *pt = q.front(); q.pop(); for (int i = 0; i < int(2); i++) if (pt->to[i]) q.push(pt->to[i]); if (pt->dep == -1) { for (int i = 0; i < int(2); i++) if (pt->to[i]) pt->to[i]->fail = root; for (int i = 0; i < int(2); i++) if (!pt->to[i]) pt->to[i] = root; } else { for (int i = 0; i < int(2); i++) if (pt->to[i]) { Node *&cur = pt->to[i]->fail; for (cur = pt->fail; cur != root && !cur->to[i]; cur = cur->fail) ; if (cur->to[i]) cur = cur->to[i]; } for (int i = 0; i < int(2); i++) if (!pt->to[i]) { Node *&cur = pt->to[i]; for (cur = pt->fail; cur != root && !cur->to[i]; cur = cur->fail) ; if (cur->to[i]) cur = cur->to[i]; } } } } } ac; int n, m; string s[maxn]; void read() { RI(n, m); for (int i = 0; i < int(m); i++) { static char in[maxn]; RI(in); s[i] = in; } } const int MOD = 1e9 + 7; string os[maxn]; int sig; int f[maxn][maxn]; int _c[2][maxn][maxn / second + 1]; int (*prv)[maxn / second + 1], (*cur)[maxn / second + 1]; int big; int om; void build() { om = m; for (int i = 0; i < int(m); i++) os[i] = s[i]; sort(s, s + m); m = unique(s, s + m) - s; sort(s, s + m, [&](const string &a, const string &b) { return make_pair(((int)(a).size()), a) > make_pair(((int)(b).size()), b); }); for (big = 0; big < m && ((int)(s[big]).size()) > second; big++) ; for (int i = 0; i < int(m); i++) ac.add(s[i], i); ac.build(); sig = Node::pmem - Node::mem; } int ans[maxn]; void sol_big() { for (int i = 0; i < int(sig); i++) f[1][i] = Node::mem[i].to[0] - Node::mem; for (int i = 0; i < int(sig); i++) f[2][i] = Node::mem[i].to[1] - Node::mem; for (int i = (3); i <= int(n); i++) for (int j = 0; j < int(sig); j++) f[i][j] = f[i - 2][f[i - 1][j]]; prv = _c[0]; cur = _c[1]; for (int i = 0; i < int(sig); i++) for (int j = 0; j < int(big); j++) { Node *pt = Node::mem + i; for (pt = pt->to[0]; pt->who != j && pt->dep != -1; pt = pt->fail) ; prv[i][j] = (pt->who == j); } for (int i = 0; i < int(sig); i++) for (int j = 0; j < int(big); j++) { Node *pt = Node::mem + i; for (pt = pt->to[1]; pt->who != j && pt->dep != -1; pt = pt->fail) ; cur[i][j] = (pt->who == j); } for (int _ = (3); _ <= int(n); _++) { static int tmp[maxn][maxn / second + 1]; auto &m1 = cur, &m2 = prv; for (int i = 0; i < int(sig); i++) for (int j = 0; j < int(big); j++) tmp[i][j] = m1[i][j] + m2[f[_ - 1][i]][j]; for (int i = 0; i < int(sig); i++) for (int j = 0; j < int(big); j++) if (tmp[i][j] >= MOD) tmp[i][j] -= MOD; swap(prv, cur); for (int i = 0; i < int(sig); i++) for (int j = 0; j < int(big); j++) cur[i][j] = tmp[i][j]; } for (int i = 0; i < int(big); i++) ans[i] = cur[0][i]; } string h[maxn], t[maxn]; int ap[maxn][maxn]; void merge(const string &p, const string &q, int res[]) { for (int i = 0; i < int(((int)(p).size())); i++) { Node *pt = ac.root; for (int j = (i); j <= int(((int)(p).size()) - 1); j++) if (!(pt = pt->to[p[j] - a ])) while (1) ; for (int j = 0; j < int(((int)(q).size())); j++) { if (!(pt = pt->to[q[j] - a ])) while (1) ; if (big <= pt->who && pt->who < m && pt->dep == (((int)(p).size()) - i) + j) res[pt->who]++; } } for (int i = (big); i <= int(m - 1); i++) if (res[i] >= MOD) res[i] -= MOD; } void sol_small() { h[1] = a ; h[2] = b ; for (int i = (3); i <= int(15); i++) h[i] = h[i - 1] + h[i - 2]; for (int i = (1); i <= int(15); i++) t[i] = h[i]; if (n <= 15) { for (int j = (big); j <= int(m - 1); j++) for (size_t o = h[n].find(s[j]); ~o; o = h[n].find(s[j], o + 1)) ans[j]++; } else { for (int i = (14); i <= int(15); i++) for (int j = (big); j <= int(m - 1); j++) for (size_t o = h[i].find(s[j]); ~o; o = h[i].find(s[j], o + 1)) ap[i][j]++; for (int i = (14); i <= int(15); i++) h[i].resize(second), t[i].erase(t[i].begin(), t[i].end() - second); for (int i = (16); i <= int(n); i++) { for (int j = (big); j <= int(m - 1); j++) ap[i][j] = ap[i - 1][j] + ap[i - 2][j]; for (int j = (big); j <= int(m - 1); j++) if (ap[i][j] >= MOD) ap[i][j] -= MOD; h[i] = h[i - 1]; t[i] = t[i - 2]; merge(t[i - 1], h[i - 2], ap[i]); } for (int i = (big); i <= int(m - 1); i++) ans[i] = ap[n][i]; } } void sol() { sol_big(); sol_small(); for (int i = 0; i < int(om); i++) { int id = lower_bound(s, s + m, os[i], [&](const string &a, const string &b) { return make_pair(((int)(a).size()), a) > make_pair(((int)(b).size()), b); }) - s; PL(ans[id]); } } int main() { read(); build(); sol(); return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; bool cmp(pair<int, int> a, pair<int, int> b) { return a.second < b.second; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; int mx = -1, my = -1; while (t--) { char c; int t1, t2; cin >> c >> t1 >> t2; if (t1 > t2) swap(t1, t2); if (c == + ) { mx = max(mx, t1); my = max(my, t2); } else { if (mx <= t1 && my <= t2) cout << YES n ; else cout << NO n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; static const double EPS = 1e-5; bool board[8][8]; const int dx[8] = {1, 2, 2, 1, -1, -2, -2, -1}; const int dy[8] = {2, 1, -1, -2, -2, -1, 1, 2}; void check(int x, int y, int n) { board[x][y] = true; if (n == 1) { for (int i = (0); i < (int)(8); ++i) { board[i][y] = true; board[x][i] = true; } } for (int r = (0); r < (int)(8); ++r) { if (x + dx[r] < 8 && x + dx[r] >= 0) { if (y + dy[r] < 8 && y + dy[r] >= 0) { board[x + dx[r]][y + dy[r]] = true; } } } } int main(void) { int x, y, count = 0; string line; cin >> line; x = line[0] - a ; y = line[1] - 1 ; check(x, y, 1); cin >> line; x = line[0] - a ; y = line[1] - 1 ; check(x, y, 2); for (int x = (0); x < (int)(8); ++x) { for (int y = (0); y < (int)(8); ++y) { if (board[x][y]) count++; } } cout << 64 - count << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 100000 + 10; int SL[MAXN], SR[MAXN]; int A[MAXN][2], n; int main() { while (~scanf( %d , &n)) { SL[0] = SR[0] = 0; for (int i = 1; i <= n; i++) { scanf( %d%d , &A[i][0], &A[i][1]); SL[i] = A[i][0] + SL[i - 1]; SR[i] = A[i][1] + SR[i - 1]; } int maxn = abs(SL[n] - SR[n]); int ans = 0; for (int i = 1; i <= n; i++) { int _SL = SL[n] - A[i][0] + A[i][1]; int _SR = SR[n] - A[i][1] + A[i][0]; int _ans = abs(_SL - _SR); if (maxn < _ans) { maxn = _ans; ans = i; } } printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, a[300005], tp, lt, ans; int main() { cin >> n; for (int i = 1; i <= n; i++) scanf( %lld , &a[i]); for (int i = 1; i <= n; i++) { tp = min(a[i] / 2, lt); lt -= tp; a[i] -= tp * 2; ans += tp + a[i] / 3; lt += a[i] % 3; } cout << ans; } |
#include <bits/stdc++.h> using namespace std; int n, m; char my_array[50][50]; bool visited[50][50]; bool dfs(int i, int j, int c_i, int c_j) { if (visited[i][j]) { return true; } visited[i][j] = true; char col = my_array[i][j]; bool res = false; if (i > 0 && col == my_array[i - 1][j] && c_i != i - 1) { res |= dfs(i - 1, j, i, j); } if (j > 0 && col == my_array[i][j - 1] && c_j != j - 1) { res |= dfs(i, j - 1, i, j); } if (i < n - 1 && col == my_array[i + 1][j] && c_i != i + 1) { res |= dfs(i + 1, j, i, j); } if (j < m - 1 && col == my_array[i][j + 1] && c_j != j + 1) { res |= dfs(i, j + 1, i, j); } return res; } int main(int argc, const char* argv[]) { cin >> n >> m; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> my_array[i][j]; } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (!visited[i][j] && dfs(i, j, -1, -1)) { cout << Yes ; return 0; } } } cout << No ; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int N = 1e6, N2 = 5e3, delta = 46639, mod = 1e9 + 7, oo = 1e16; const long double PI = 3.141592653589793; int main() { long long int n, cnt1 = 1, cnt2 = 1, mx = 0; string s; cin >> n >> s; for (long long int i = 0; i < n; i++) { for (long long int j = i; j < n; j++) { string t = s; long long int cnt = 0, trn = 0, ans = 0; swap(t[i], t[j]); for (long long int k = 0; k < n; k++) { if (t[k] == ( ) cnt++; else { if (cnt <= 0) trn++; else cnt--; } } for (long long int k = n - 1; k >= 0; k--) { if (cnt == 0 && trn == 0) ans++; if (t[k] == ( ) cnt--, trn--; else cnt++, trn++; } mx = max(mx, ans); if (mx == ans) cnt1 = i + 1, cnt2 = j + 1; } } cout << mx << n << cnt1 << << cnt2; } |
#include <bits/stdc++.h> using namespace std; const int N = 2002; int main() { int h, m; char c1, c2, c3, c4; double r1, r2; cin >> c1 >> c2 >> c3 >> c3 >> c4; h = (c1 - 0 ) * 10 + (c2 - 0 ); m = (c3 - 0 ) * 10 + (c4 - 0 ); h %= 12; double hh = h + double(m) / 60; r1 = hh / 12.0 * 360; r2 = double(m) / 60.0 * 360; printf( %0.10f %0.10f n , r1, r2); } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:256000000 ) using namespace std; const long double PI = 3.14159265358979323846; const long double eps = 1e-5; const int INF = numeric_limits<int>::max(); const long long LINF = numeric_limits<long long>::max(); const long long mod = 1000 * 1000 * 1000 + 7; struct moves { int r1, c1, r2, c2; moves(int _r1, int _c1, int _r2, int _c2) : r1(_r1), c1(_c1), r2(_r2), c2(_c2) {} }; vector<moves> solve(int n, int m, vector<vector<int> > b, vector<pair<int, int> > p) { vector<moves> res; int c = -1; for (int j = 0; j < n; ++j) { for (int i = 0; i < n; ++i) { if (b[i][j] == -1) { continue; } ++c; int d = c - j; if (d < 0) { for (int k = 0; k < -d; ++k) { swap(b[i][j - k], b[i][j - 1 - k]); res.push_back(moves(i, j - k, i, j - 1 - k)); } } if (d == 0) { continue; } if (d > 0) { --c; int l = j + 1; while (b[i][l] != -1) ++l; for (int k = l - 1; k >= j; --k) { swap(b[i][k], b[i][k + 1]); res.push_back(moves(i, k, i, k + 1)); } } } } for (int j = 0; j < n; ++j) { if (b[0][j] != -1) { swap(b[0][j], b[1][j]); res.push_back(moves(0, j, 1, j)); } } for (int i = 2; i < n; ++i) { for (int j = 0; j < n; ++j) { if (b[i][j] != -1) { for (int k = i - 1; k >= 1; --k) { swap(b[k + 1][j], b[k][j]); res.push_back(moves(k + 1, j, k, j)); } } } } for (int t = 0; t < m; ++t) { int cl = 0; while (b[1][cl] != t) ++cl; swap(b[1][cl], b[0][cl]); res.push_back(moves(1, cl, 0, cl)); for (int j = cl; j > t; --j) { swap(b[0][j], b[0][j - 1]); res.push_back(moves(0, j, 0, j - 1)); } for (int j = cl; j > t; --j) { swap(b[1][j], b[1][j - 1]); res.push_back(moves(1, j - 1, 1, j)); } } return res; } void solve() { int n, m; cin >> n >> m; vector<vector<int> > b1(n, vector<int>(n, -1)), b2(n, vector<int>(n, -1)); vector<pair<int, int> > p1(m), p2(m); for (int i = 0; i < m; ++i) { int r, c; cin >> r >> c; --r, --c; p1[i] = pair<int, int>(r, c); b1[r][c] = i; } for (int i = 0; i < m; ++i) { int r, c; cin >> r >> c; --r, --c; p2[i] = pair<int, int>(r, c); b2[r][c] = i; } if (n == 1) { cout << 0 << endl; return; } vector<moves> r1 = solve(n, m, b1, p1); vector<moves> r2 = solve(n, m, b2, p2); cout << r1.size() + r2.size() << n ; for (int i = 0; i < r1.size(); ++i) { cout << r1[i].r1 + 1 << << r1[i].c1 + 1 << << r1[i].r2 + 1 << << r1[i].c2 + 1 << n ; } for (int i = r2.size() - 1; i >= 0; --i) { cout << r2[i].r2 + 1 << << r2[i].c2 + 1 << << r2[i].r1 + 1 << << r2[i].c1 + 1 << n ; } } int main() { solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; bool grid[3][10004]; int n; long long dp[10004][8]; long long calc(int i, int mask) { int mask2 = 0; if (grid[0][i]) mask2 |= 1; if (grid[1][i]) mask2 |= 2; if (grid[2][i]) mask2 |= 4; if ((mask & mask2) != 0) { return 0; } mask |= mask2; long long ret = dp[i][mask]; if (ret != -1) { return ret; } if (i == n - 1) { if (mask == 1 || mask == 4 || mask == 7) { return 1; } else return 0; } switch (mask) { case 0: ret = calc(i + 1, 4); ret += calc(i + 1, 1); ret += calc(i + 1, 7); ret %= 1000000007; break; case 1: ret = calc(i + 1, 6); ret += calc(i + 1, 0); ret %= 1000000007; break; case 2: ret = calc(i + 1, 5); break; case 3: ret = calc(i + 1, 4); break; case 4: ret = calc(i + 1, 3); ret += calc(i + 1, 0); ret %= 1000000007; break; case 5: ret = calc(i + 1, 2); break; case 6: ret = calc(i + 1, 1); break; case 7: ret = calc(i + 1, 0); break; default: break; } dp[i][mask] = ret; return ret; } int main() { cin >> n; string a, b, c; cin >> a >> b >> c; memset(grid, true, sizeof grid); memset(dp, -1, sizeof dp); for (int i = 0; i < n; i++) { if (a[i] == . ) { grid[0][i] = false; } } for (int i = 0; i < n; i++) { if (b[i] == . ) { grid[1][i] = false; } } for (int i = 0; i < n; i++) { if (c[i] == . ) { grid[2][i] = false; } } if (a.find( O ) == string::npos && c.find( O ) == string::npos && b.find( O ) != 0 && b.find( O ) != n - 1) { long long x = calc(0, 0); int p = b.find( O ); memset(dp, -1, sizeof dp); grid[1][p - 1] = true; grid[2][p - 1] = true; grid[0][p + 1] = true; grid[1][p + 1] = true; long long y = calc(0, 0); grid[0][p - 1] = true; grid[2][p - 1] = false; grid[0][p + 1] = false; grid[2][p + 1] = true; memset(dp, -1, sizeof(dp)); long long z = calc(0, 0); cout << (x - y - z + 1000000007 + 1000000007) % 1000000007 << endl; } else { cout << calc(0, 0) << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> inline void smin(T &a, const U &b) { if (a > b) a = b; } template <typename T, typename U> inline void smax(T &a, const U &b) { if (a < b) a = b; } template <class T> inline void gn(T &first) { char c, sg = 0; while (c = getchar(), (c > 9 || c < 0 ) && c != - ) ; for ((c == - ? sg = 1, c = getchar() : 0), first = 0; c >= 0 && c <= 9 ; c = getchar()) first = (first << 1) + (first << 3) + c - 0 ; if (sg) first = -first; } template <class T1, class T2> inline void gn(T1 &x1, T2 &x2) { gn(x1), gn(x2); } 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; } int main() { int n, m; cin >> n >> m; vector<pair<int, int> > vec; vector<pair<int, int> > event; multiset<int> s; for (int i = 0; i < m; i++) { int l, r, t; gn(l, r); gn(t); event.push_back(pair<int, int>(l, t)); event.push_back(pair<int, int>(r, -t - 1)); } sort(event.begin(), event.end()); for (pair<int, int> e : event) { if (!s.empty()) vec.push_back(pair<int, int>(*s.begin() - e.first, 1)); if (e.second < 0) s.erase(s.find(-e.second - 1)); else s.insert(e.second); if (!s.empty()) vec.push_back(pair<int, int>(*s.begin() - e.first, -1)); } sort(vec.begin(), vec.end()); long long now = 0, d = 0; int cur = 0; int pre = -1e9; for (int i = 0; i < n; i++) { int t; gn(t); while (cur < vec.size() && vec[cur].first < t) { now += d * (vec[cur].first - pre); d += vec[cur].second; pre = vec[cur].first; cur++; } printf( %I64d n , now + d * (t - pre)); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100005, INF = 0X3F3F3F3F; int n, tot; char s[N]; vector<int> ans; set<int> s1, s2; int main() { scanf( %s , s + 1), n = strlen(s + 1); for (int i = (1); i <= (n); ++i) { if (s[i] == L ) s1.insert(i); else s2.insert(i); } s1.insert(INF), s2.insert(INF); if (make_pair(-((int)(s1).size()), *s1.begin()) > make_pair(-((int)(s2).size()), *s2.begin())) swap(s1, s2); int go = *s1.begin(); for (int i = (1); i <= (n); ++i) { if (i & 1) { if (go == INF || (*s2.lower_bound(go) == INF && *s1.begin() != go && *s1.begin() < *s2.begin())) { ++tot; go = *s1.begin(); } s1.erase(go); ans.push_back(go); go = *s2.lower_bound(go); } else { if (go == INF || (*s1.lower_bound(go) == INF && *s2.begin() != go && *s2.begin() < *s1.begin())) { ++tot; go = *s2.begin(); } s2.erase(go); ans.push_back(go); go = *s1.lower_bound(go); } } printf( %d n , tot); for (auto x : ans) printf( %d , x); return 0; } |
#include <iostream> #include <vector> #include <array> #define vi vector<int> #define pii pair<int, int> #define fst first #define snd second using namespace std; const int SZ = (1 << 19) + 5, INF = (1e9) + 7; int N, ans[200001]; vi idx[200001]; array<int, 4> seg[2][SZ]; int lz[2][SZ]; array<int, 4> merge(const array<int, 4>& L, const array<int, 4>& R) { return {min(L[0], R[0]), max(L[1], R[1]), min(L[2], R[2]), max(L[3], R[3])}; } inline void prop(int t, int idx, int L, int R) { if (lz[t][idx]) { for (int i = 0; i < 4; i++) { if (seg[t][idx][i] > -INF && seg[t][idx][i] < INF) seg[t][idx][i] += lz[t][idx]; } if (L < R) { lz[t][2 * idx] += lz[t][idx]; lz[t][2 * idx + 1] += lz[t][idx]; } lz[t][idx] = 0; } } void build(int t, int idx, int L, int R) { seg[t][idx][0] = seg[t][idx][2] = INF; seg[t][idx][1] = seg[t][idx][3] = -INF; if (L == R) { seg[t][idx][(L & 1) << 1] = 0; seg[t][idx][(L & 1) << 1 | 1] = 0; } else if (L < R) { int M = L + R >> 1; build(t, 2 * idx, L, M); build(t, 2 * idx + 1, M + 1, R); seg[t][idx] = merge(seg[t][2 * idx], seg[t][2 * idx + 1]); } } void upd(int t, int idx, int L, int R, int l, int r, int v) { l = max(L, l); r = min(R, r); prop(t, idx, L, R); if (l <= r) { if (L == l && R == r) {lz[t][idx] += v; prop(t, idx, L, R);} else { int M = L + R >> 1; upd(t, 2 * idx, L, M, l, r, v); upd(t, 2 * idx + 1, M + 1, R, l, r, v); seg[t][idx] = merge(seg[t][2 * idx], seg[t][2 * idx + 1]); } } } array<int, 4> qry(int t, int idx, int L, int R, int l, int r) { l = max(L, l); r = min(R, r); if (l <= r) { prop(t, idx, L, R); if (L == l && R == r) {return seg[t][idx];} else { int M = L + R >> 1; return merge(qry(t, 2 * idx, L, M, l, r), qry(t, 2 * idx + 1, M + 1, R, l, r)); } } return {INF, -INF, INF, -INF}; } int main() { cin >> N; for (int i = 1; i <= N; i++) { int x; cin >> x; idx[x].push_back(i); } build(0, 1, 0, N); build(1, 1, 0, N); for (int i = 1; i <= N; i++) { upd(i & 1, 1, 0, N, i, N, -1); } for (int i = 1; i <= N; i++) { for (const auto &x : idx[i]) { for (int j = 0; j < 2; j++) { array<int, 4> A = qry(j, 1, 0, N, 0, x - 1), B = qry(j, 1, 0, N, x, N); ans[x] = max(ans[x], max(B[1], B[3]) - A[j << 1]); ans[x] = max(ans[x], A[j << 1 | 1] - min(B[0], B[2])); } } for (const auto &x : idx[i]) { for (int j = 0; j < 2; j++) upd(j, 1, 0, N, x, N, 1); } for (const auto &x : idx[i]) { for (int j = 0; j < 2; j++) { upd(j, 1, 0, N, x, N, -1); array<int, 4> A = qry(j, 1, 0, N, 0, x - 1), B = qry(j, 1, 0, N, x, N); ans[x] = max(ans[x], max(B[1], B[3]) - A[j << 1]); ans[x] = max(ans[x], A[j << 1 | 1] - min(B[0], B[2])); upd(j, 1, 0, N, x, N, 1); } } } for (int i = 1; i <= N; i++) { cout << ans[i] << n [i == N]; } return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:200000000 ) using namespace std; template <typename T> inline T Abs(T x) { return (x >= 0) ? x : -x; } template <typename T> inline T sqr(T x) { return x * x; } template <typename T> string toStr(T x) { stringstream st; st << x; string s; st >> s; return s; } const int INF = (int)1E9; const long long INF64 = (long long)1E18; const long double EPS = 1E-9; const long double PI = 3.1415926535897932384626433832795; map<pair<long long, long long>, long long> d; long long solve(long long n, long long t) { if (d.count(make_pair(n, t))) return d[make_pair(n, t)]; if (n == 0) return d[make_pair(n, t)] = 0; long long l = 1, p = 0; while (2 * l <= n) { l *= 2; p++; } if (t == 1) return d[make_pair(n, t)] = p + 1; if (n <= 2) return d[make_pair(n, t)] = 0; long long ans = solve(l / 2 - 1, t); if (t % 2 == 0) ans += solve(l / 2 - 1, t / 2); if (n != l && t % 2 == 0) ans += solve(n - l, t / 2); return d[make_pair(n, t)] = ans; } int main() { long long n, t; cin >> n >> t; long long ans = solve(n + 1, t); if (t == 1) ans--; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 710; const int MOD = 1000000007; int n; int mate[MAXN]; long long int dp[MAXN][MAXN][3][3]; char v[MAXN]; stack<int, vector<int> > s; long long int solve(int l, int r, int bl, int br) { long long int& ans = dp[l][r][bl][br]; if (ans != -1) return ans; if (l > r) return ans = 1; ans = 0; int mateL = mate[l]; for (int colorL = 1; colorL <= 2; colorL++) { if (colorL == bl) continue; long long int left = solve(l + 1, mateL - 1, colorL, 0); long long int right = solve(mateL + 1, r, 0, br); ans += left * right; } for (int colorL = 1; colorL <= 2; colorL++) { if (mateL == r && colorL == br) continue; long long int left = solve(l + 1, mateL - 1, 0, colorL); long long int right = solve(mateL + 1, r, colorL, br); ans += left * right; } ans %= MOD; return ans; } int main() { scanf( %s , v); n = strlen(v); for (int i = 0; i < n; i++) { if (v[i] == ( ) s.push(i + 1); else { int p = s.top(); s.pop(); mate[p] = i + 1; mate[i + 1] = p; } } memset(dp, -1, sizeof(dp)); printf( %lld n , solve(1, n, 0, 0)); } |
#include <bits/stdc++.h> using namespace std; int n, m, x, y, z, cnt, c[100100], d[100100]; priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > pq; vector<pair<int, pair<int, int> > > graph[100100]; vector<pair<int, pair<int, int> > > edge, v; bool mark[100100]; pair<int, int> p[100100]; int main() { cin >> n >> m; for (int i = 1; i <= n; i++) d[i] = 1e9; for (int i = 0; i < m; i++) { cin >> x >> y >> z; graph[x].push_back(make_pair(y, make_pair(z, i))); graph[y].push_back(make_pair(x, make_pair(z, i))); edge.push_back(make_pair(z, make_pair(x, y))); if (z) cnt++; } d[1] = 0; pq.push(make_pair(0, 1)); while (!pq.empty()) { x = pq.top().second; pq.pop(); for (int i = 0; i < graph[x].size(); i++) { y = graph[x][i].first; if (d[x] + 1 <= d[y]) { if (d[x] + 1 < d[y]) p[y] = make_pair(x, graph[x][i].second.second); d[y] = d[x] + 1; if (c[x] + graph[x][i].second.first > c[y]) { p[y] = make_pair(x, graph[x][i].second.second); c[y] = c[x] + graph[x][i].second.first; } pq.push(make_pair(d[y], y)); } } } x = n; while (x != 1) { y = x; x = p[y].first; if (edge[p[y].second].first == 0) v.push_back(edge[p[y].second]); mark[p[y].second] = 1; } for (int i = 0; i < edge.size(); i++) { if (!mark[i] && edge[i].first) v.push_back(edge[i]); } cout << v.size() << endl; for (int i = 0; i < v.size(); i++) { cout << v[i].second.first << << v[i].second.second << << (!v[i].first) << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, d, ans = 128, x[128], sum[128]; int main() { cin >> n >> d; for (int i = 0; i < n; ++i) cin >> x[i]; sort(x, x + n); for (int l = 0; l < n; ++l) for (int r = l; r < n; ++r) if (x[r] - x[l] <= d) ans = min(ans, l + n - 1 - r); cout << ans; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; const int mod = 1e9 + 7, oo = 1e9; const ll loo = 1e18; ll modpow(ll a, ll b) { ll ans = 1; for (; b; b /= 2, a = a * a % mod) if (b & 1) ans = (ans * a) % mod; return ans; } ll gcd(ll a, ll b) { while (a) b %= a, swap(a, b); return b; } const bool DEBUG = 1; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); string s; cin >> s; int n = s.length(); int pre[n][3]; for (int i = 0; i < n; i++) { for (int j = 0; j < 3; j++) pre[i][j] = i ? pre[i - 1][j] : -oo; pre[i][s[i] - a ] = i; } stringstream ss; int i = 0, j = n - 1; int cnt = 0; while (i <= j) { int jj = pre[j][s[i] - a ]; if (jj - i >= 0 && (jj - i - 1) / 2 + cnt + (1 + (i != jj)) >= n / 2) { j = jj - 1; cnt += 1 + (i != jj); ss << s[i]; } i++; } string t = ss.str(); string r; if (cnt & 1) r = t.substr(0, t.length() - 1); else r = s.substr(0, t.length()); reverse(r.begin(), r.end()); cout << t << r << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100000; int n, a, b, da, db; vector<int> nei[N + 1]; int dep[N + 1], dp[N + 1]; int ans; void dfs(int x = a, int fa = 0) { vector<int> v; v.push_back(dep[x]); dp[x] = dep[x]; for (int i = 0; i < nei[x].size(); i++) { int y = nei[x][i]; if (y == fa) continue; dep[y] = dep[x] + 1; dfs(y, x); v.push_back(dp[y]); dp[x] = max(dp[x], dp[y]); } sort(v.begin(), v.end(), greater<int>()); if (v.size() >= 2) ans = max(ans, v[0] + v[1] - 2 * dep[x]); } void mian() { scanf( %d%d%d%d%d , &n, &a, &b, &da, &db); for (int i = 1; i <= n; i++) nei[i].clear(); for (int i = 1; i <= n; i++) dep[i] = dp[i] = 0; for (int i = 1; i < n; i++) { int x, y; scanf( %d%d , &x, &y); nei[x].push_back(y); nei[y].push_back(x); } if (db < 2 * da + 1) return puts( Alice ), void(); ans = 0; dfs(); if (ans >= 2 * da + 1 && dep[b] > da) puts( Bob ); else puts( Alice ); } int main() { int testnum; cin >> testnum; while (testnum--) mian(); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>; struct pt { long long x, y; pt(long long x = 0, long long y = 0) : x(x), y(y) {} pt operator-(const pt &o) const { return pt(x - o.x, y - o.y); } long long cross(const pt &o) const { return x * o.y - y * o.x; } }; struct city { pt p; bool b; int id; }; struct tri { city a, b, c; bool ins(const pt &p) { return (b.p - a.p).cross(p - a.p) > 0 && (c.p - b.p).cross(p - b.p) > 0 && (a.p - c.p).cross(p - c.p) > 0; } }; const int N = 1e3 + 5; int n; vector<city> v; bool used[N]; vector<city> upperhull(const vector<city> &v, int n) { vector<city> u; for (int m, i = 0; i < n; i++) { while ((m = u.size()) > 1) { pt p = u[m - 1].p, q = u[m - 2].p; if ((p - q).cross(v[i].p - p) > 0) break; u.pop_back(); } u.push_back(v[i]); } return u; } vector<city> hull(vector<city> &v, int n) { vector<city> u = upperhull(v, n); reverse(v.begin(), v.end()); vector<city> l = upperhull(v, n); reverse(v.begin(), v.end()); for (int i = 1; i + 1 < l.size(); i++) u.push_back(l[i]); return u; } vector<pair<int, int>> ans; void solve(tri T, vector<city> v) { v.erase(remove_if((v).begin(), (v).end(), [&](city c) { return used[c.id] || !T.ins(c.p); }), v.end()); int cnt[2] = {0, 0}; for (city c : {T.a, T.b, T.c}) { cnt[c.b]++; } bool b = (cnt[0] > cnt[1]); for (city &c : v) { if (c.b == b) { for (city d : {T.a, T.b, T.c}) { if (c.b == d.b) { ans.emplace_back(c.id, d.id); break; } } used[c.id] = true; solve({T.a, T.b, c}, v); solve({T.b, T.c, c}, v); solve({T.c, T.a, c}, v); return; } } city c1 = (T.a.b != b ? T.a : T.b.b != b ? T.b : T.c); for (city &c : v) { ans.emplace_back(c.id, c1.id); } } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n; for (int i = (0); i < (n); i++) { pt p; bool b; cin >> p.x >> p.y >> b; v.push_back({p, b, i}); } if (n == 1 || (n == 2 && v[0].b != v[1].b)) { cout << 0 n ; return 0; } else if (n == 2) { cout << 1 n0 1 n ; return 0; } sort((v).begin(), (v).end(), [&](city &a, city &b) { return make_pair(a.p.x, a.p.y) < make_pair(b.p.x, b.p.y); }); vector<city> h = hull(v, n); vector<int> ve; for (int i = (0); i < (((int)(h).size())); i++) { if (h[i].b != h[(i + 1) % ((int)(h).size())].b) { ve.push_back(i); } else { ans.emplace_back(h[i].id, h[(i + 1) % ((int)(h).size())].id); } } if (((int)(ve).size()) > 2) { cout << Impossible n ; return 0; } vector<tri> tris; for (city &c : h) { used[c.id] = true; } if (ve.empty()) { ans.pop_back(); bool flag = false; for (city &c : v) { if (!used[c.id] && c.b != h[0].b) { used[c.id] = true; for (int i = (0); i < (((int)(h).size())); i++) { tris.push_back({h[i], h[(i + 1) % ((int)(h).size())], c}); } flag = true; break; } } if (!flag) { cout << n - 1 << n ; for (int i = (1); i < (n); i++) { cout << 0 << << i << n ; } return 0; } } else { assert(((int)(ve).size()) == 2); for (int i = (ve[0] + 1) % ((int)(h).size()); i != ve[1]; i = (i + 1) % ((int)(h).size())) { tris.push_back({h[ve[0]], h[i], h[(i + 1) % ((int)(h).size())]}); } for (int i = (ve[1] + 1) % ((int)(h).size()); i != ve[0]; i = (i + 1) % ((int)(h).size())) { tris.push_back({h[ve[1]], h[i], h[(i + 1) % ((int)(h).size())]}); } } for (tri &T : tris) { solve(T, v); } cout << ((int)(ans).size()) << n ; for (pair<int, int> &pa : ans) { cout << pa.first << << pa.second << n ; } } |
#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; long long power(long long a, long long n) { long long ret = 1; while (n) { if (n & 1) { ret = ret * a % mod; } a = a * a % mod; n >>= 1; } return ret; } vector<long long> st; long long C(long long n, long long k) { long long ret = st[n]; ret = ret * power(st[k], mod - 2) % mod; ret = ret * power(st[n - k], mod - 2) % mod; return ret; } long long solve(long long n, long long k) { if (k >= n) return 0; st.resize(n + 1, 1); for (long long i = 1; i <= n; i++) st[i] = st[i - 1] * i % mod; long long ret = 0, c = n - k; for (long long i = 0; i <= c; i++) { if ((i & 1) == (c & 1)) ret = (ret + mod + (C(c, i) * power(i, n))) % mod; else ret = (ret + mod - (C(c, i) * power(i, n))) % mod; } ret = ret * C(n, c) % mod; return k > 0 ? ret * 2 % mod : ret; } int32_t main() { long long n, k; cin >> n >> k; cout << solve(n, k); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; const long long MAX = 8e18; const long long MIN = -8e18; int n; long long x[N]; long long y[N]; long long z[N]; vector<long long> ansX; vector<long long> ansY; vector<long long> ansZ; inline long long llabs(const long long &a, const long long &b) { long long res = a - b; return (res >= 0 ? res : -res); } inline long long calDist(long long z0, pair<long long, long long> &xy) { long long minA, maxA, minB, maxB, h, dist2, a, b; int i, j, k; minA = minB = MAX; maxA = maxB = MIN; for (i = 0; i < n; i++) { h = llabs(z0, z[i]); minA = min(minA, x[i] + y[i] - h); maxA = max(maxA, x[i] + y[i] + h); minB = min(minB, x[i] - y[i] - h); maxB = max(maxB, x[i] - y[i] + h); } dist2 = max(maxA - minA, maxB - minB); a = (maxA + minA) / 2; b = (maxB + minB) / 2; xy.first = (a + b) / 2; xy.second = (a - b) / 2; return dist2; } inline void solve() { int i; long long bestZ, bestY, bestX, bestDist, curDist, curY, curX, initX, initY, curZ, d; bestDist = MAX; pair<long long, long long> xy; bestZ = 0; bestDist = calDist(bestZ, xy); d = 1e18; while (d >= 1) { curZ = bestZ + d; curDist = calDist(curZ, xy); if (curDist < bestDist) { bestZ = curZ; bestDist = curDist; continue; } curZ = bestZ - d; curDist = calDist(curZ, xy); if (curDist < bestDist) { bestZ = curZ; bestDist = curDist; continue; } d /= 2; } calDist(bestZ, xy); initX = xy.first; initY = xy.second; bestDist = MAX; for (curX = initX - 1; curX <= initX + 1; curX++) { for (curY = initY - 1; curY <= initY + 1; curY++) { curDist = 0; for (i = 0; i < n; i++) { curDist = max(curDist, llabs(x[i] - curX) + llabs(y[i] - curY) + llabs(bestZ - z[i])); } if (curDist < bestDist) { bestDist = curDist; bestX = curX; bestY = curY; } } } ansX.push_back(bestX); ansY.push_back(bestY); ansZ.push_back(bestZ); } int main() { int t, i, k; scanf( %d , &t); for (k = 0; k < t; k++) { scanf( %d , &n); for (i = 0; i < n; i++) { scanf( %l ld %l ld %l ld , &x[i], &y[i], &z[i]); } solve(); } for (i = 0; i < t; i++) { printf( %l ld %l ld %l ld n , ansX[i], ansY[i], ansZ[i]); } } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; const long long inf = 1e16; const long long ninf = LLONG_MIN; const double eps = 1e-12; const long long N = 1000005; const double PI = 3.14159265358979323846; const long long LOGN = 19; long long n, m; long long s[N], t[N]; char a[N]; long long dp[(1 << 21)]; int main() { ios_base::sync_with_stdio(0); cin >> n; for (int i = 0; i < n; i++) cin >> s[i]; cin >> m; sort(s, s + n); reverse(s, s + n); for (int i = 0; i < m; i++) cin >> a[i] >> t[i]; for (long long mask = (1 << m) - 1; mask >= 0; mask--) { long long done = __builtin_popcount(mask); if (done == m) { dp[mask] = 0; continue; } if (a[done] == p ) { for (int j = 0; j < m; j++) { if ((mask & (1 << j)) == 0) { dp[mask] = (t[done] == 1 ? s[j] : -s[j]) + dp[mask | (1 << j)]; break; } } } else { if (t[done] == 1) { dp[mask] = -inf; for (int j = 0; j < m; j++) { dp[mask] = max(dp[mask], dp[mask | (1 << j)]); } } else { dp[mask] = inf; for (int j = 0; j < m; j++) { dp[mask] = min(dp[mask], dp[mask | (1 << j)]); } } } } cout << dp[0] << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5, M = 350; long long dp[5][N], B, a[N], b[N], t[N], n, m, d, minans = 1e9 + 10, dpL[N], dpR[N]; int last, ldel; deque<int> stac; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m >> d; for (int i = 0; i < m; i++) { cin >> a[i] >> b[i] >> t[i]; B += b[i]; } for (int j = 0; j < n; j++) dp[0][j] = abs(a[0] - (j + 1)); for (int i = 1; i < m; i++) { last = (i - 1) % 2; for (int j = 0; j < n; j++) { ldel = j; while (!stac.empty() && stac.front() < (j - ((t[i] - t[i - 1]) * d))) stac.pop_front(); while (!stac.empty() && dp[last][stac.back()] >= dp[last][j]) ldel = stac.back(), stac.pop_back(); if (stac.empty()) dpL[j] = dp[last][ldel]; else dpL[j] = dp[last][stac.front()]; stac.push_back(j); } for (int j = n - 1; j >= 0; j--) { ldel = j; while (!stac.empty() && stac.front() > (j + ((t[i] - t[i - 1]) * d))) stac.pop_front(); while (!stac.empty() && dp[last][stac.back()] >= dp[last][j]) ldel = stac.back(), stac.pop_back(); if (stac.empty()) dpR[j] = dp[last][ldel]; else dpR[j] = dp[last][stac.front()]; stac.push_back(j); } for (int j = 0; j < n; j++) dp[i % 2][j] = min(min(dpR[j], dpL[j]), dp[last][j]) + abs(a[i] - (j + 1)); stac.clear(); } for (int i = 0; i < n; i++) minans = min(minans, dp[(m - 1) % 2][i]); cout << B - minans; } |
#include <bits/stdc++.h> using namespace std; struct node { long long st, en; node() {} node(long long _st, long long _en) : st(_st), en(_en) {} }; int main() { int n, b, t, d; long long etime[200000]; long long ftime; int qlen = 0; cin >> n >> b; cin >> t >> d; etime[0] = t + d; ftime = 1ll * t + d; int len = 0; queue<node> ws; node temp; cout << etime[0] << ; for (int i = 1; i < n; i++) { cin >> t >> d; while (!ws.empty()) { temp = ws.front(); if (t >= temp.st) { ws.pop(); len--; } else break; } if (t < ftime) { if (len < b) { ws.push(node(ftime, ftime + d)); len++; etime[i] = ftime + d; ftime += d; } else { etime[i] = -1; } } else { etime[i] = 1ll * t + d; ftime = 1ll * t + d; } cout << etime[i] << ; } } |
#include <bits/stdc++.h> using namespace std; map<pair<long long, long long>, pair<long long, long long> > Mp; pair<long long, long long> DFS(pair<long long, long long> u) { if (u.second < 10) return pair<long long, long long>(u.first || u.second, u.second - max(u.second, u.first)); if (Mp[u].first) return Mp[u]; long long ans = 0, p = 1; while (p <= u.second / 10) p *= 10; pair<long long, long long> res = DFS(pair<long long, long long>(max(u.first, u.second / p), u.second % p)); ans += res.first; res = DFS(pair<long long, long long>(u.first, u.second / p * p + res.second)); return Mp[u] = pair<long long, long long>(res.first + ans, res.second); } int main() { long long n; scanf( %lld , &n); printf( %lld n , DFS(pair<long long, long long>(0, n))); } |
#include <bits/stdc++.h> using namespace std; const int MAX = 1e5 + 10; const int LOG = 18; int n, m, par[MAX][LOG], h[MAX]; vector<int> graph[MAX]; int par_tree[MAX], mini[MAX]; void lca_dfs(int node, int p) { if (p + 1) h[node] = h[p] + 1; par[node][0] = p; for (int k = 1; k < LOG; k++) if (par[node][k - 1] + 1) par[node][k] = par[par[node][k - 1]][k - 1]; for (auto& target : (graph[node])) { if (target != p) lca_dfs(target, node); } } int get_lca(int a, int b) { if (h[b] > h[a]) swap(a, b); for (int k = LOG - 1; k >= 0; k--) { if (par[a][k] + 1 && h[par[a][k]] >= h[b]) a = par[a][k]; } if (a == b) return a; for (int k = LOG - 1; k >= 0; k--) if (par[a][k] != par[b][k]) { a = par[a][k]; b = par[b][k]; } return par[a][0]; } int dist(int a, int b) { return h[a] + h[b] - 2 * h[get_lca(a, b)]; } int processed[MAX], sizes[MAX]; int get_sizes(int node, int p) { sizes[node] = 1; for (auto& target : (graph[node])) { if (!processed[target] && target != p) sizes[node] += get_sizes(target, node); } return sizes[node]; } int cent, cent_cost; void select_cent(int node, int p, int current) { int node_max = sizes[current] - sizes[node]; for (auto& target : (graph[node])) { if (!processed[target] && target != p) { node_max = max(node_max, sizes[target]); select_cent(target, node, current); } } if (node_max < cent_cost) { cent = node; cent_cost = node_max; } } int process(int current) { get_sizes(current, -1); if (sizes[current] <= 1) return current; cent = current; cent_cost = ((int)1e9 + 10); select_cent(current, -1, current); int centroid = cent; processed[centroid] = 1; for (auto& target : (graph[centroid])) { if (!processed[target]) { int next_cent = process(target); par_tree[next_cent] = centroid; } } return centroid; } void update(int node) { int cur = node; while (cur > 0) { mini[cur] = min(mini[cur], dist(cur, node)); cur = par_tree[cur]; } } int query(int node) { int cur = node, ans = ((int)1e9 + 10); while (cur > 0) { ans = min(ans, mini[cur] + dist(node, cur)); cur = par_tree[cur]; } return ans; } int main() { ios::sync_with_stdio(false); cin.tie(0); for (int(i) = (0); (i) < (MAX); (i)++) mini[i] = ((int)1e9 + 10); memset(par, -1, sizeof(par)); cin >> n >> m; int a, b; for (int(i) = (0); (i) < (n - 1); (i)++) { cin >> a >> b; graph[a].push_back(b); graph[b].push_back(a); } lca_dfs(1, -1); int root = process(1); par_tree[root] = -1; int type, node; update(1); for (int(k) = (0); (k) < (m); (k)++) { cin >> type >> node; if (type == 1) { update(node); } else { cout << (query(node)) << n ; ; } } } |
#include <bits/stdc++.h> using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << : << arg1 << std::endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cerr.write(names, comma - names) << : << arg1 << | ; __f(comma + 1, args...); } vector<int> g[300005]; bool vis[300005]; int child[300005]; int mostchild[300005], par[300005]; int dfs(int u) { vis[u] = true; child[u]++; for (int i = 0; i < g[u].size(); i++) { if (!vis[g[u][i]]) { vis[g[u][i]] = true; int x = dfs(g[u][i]); child[u] += x; if (child[mostchild[u]] < x) mostchild[u] = g[u][i]; } } return child[u]; } int res[300005]; void traverse(int u) { if (u == 0) return; vis[u] = true; if (child[u] == 1) { res[u] = u; return; } traverse(mostchild[u]); if (2 * child[mostchild[u]] > child[u]) { int m = res[mostchild[u]]; while (2 * (child[u] - child[m]) > child[u]) m = par[m]; res[u] = m; } else res[u] = u; } int main() { int n, q; cin >> n >> q; par[1] = 1; for (int i = 2; i < n + 1; i++) { scanf( %d , &par[i]); g[par[i]].push_back(i); } memset(vis, false, sizeof(vis)); memset(mostchild, 0, sizeof(mostchild)); child[0] = 0; dfs(1); memset(vis, false, sizeof(vis)); for (int i = 1; i < n + 1; i++) { if (!vis[i]) traverse(i); } for (int i = 0; i < q; i++) { int a; scanf( %d , &a); printf( %d n , res[a]); } return 0; } |
#include <bits/stdc++.h> using namespace std; int t; int x, n, m; int main() { cin >> t; while (t--) { cin >> x >> n >> m; while (x > 20 && n) { x = x / 2 + 10; n--; } while (m) x -= 10, m--; if (x > 0) printf( NO n ); else printf( YES n ); } } |
#include <bits/stdc++.h> using namespace std; int main() { string a, s; cin >> a >> s; sort(s.begin(), s.end()); int ind = s.length() - 1, n = a.length(); for (int i = 0; i < n; i++) { if (ind >= 0 && s[ind] > a[i]) { a[i] = s[ind]; ind--; } } cout << a; return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using vi = vector<int>; using vl = vector<ll>; using pii = pair<int, int>; using vpii = vector<pair<int, int>>; template <typename T> using pque = priority_queue<T, vector<T>, greater<T>>; constexpr int N = 212345, M = 16; class Node { public: int a = 0; Node *c[2] = {NULL, NULL}; Node *next(int a) { if (c[a] == NULL) c[a] = new Node(); return c[a]; } } *head = new Node(); vpii g[N]; vi v[M][M]; int p[N] = {}; template <class T> void dfs(int a, int b, T func) { if (a > b) { func(); return; }; for (int i = (0); i < ((a)); i++) { for (int j : v[a][i]) p[j]++; dfs(a + 1, b, func); for (int j : v[a][i]) p[j]--; } } int main() { int n, m, k; scanf( %d%d%d , &n, &m, &k); for (int i = (0); i < ((m)); i++) { int a, b, c; scanf( %d%d%d , &a, &b, &c); g[a].emplace_back(c, b); } for (int i = (1); i < (n + 1); i++) { sort((g[i]).begin(), (g[i]).end()); for (int j = (0); j < (((int)g[i].size())); j++) { v[g[i].size()][j].emplace_back(g[i][j].second); } } for (int i = (1); i < (k); i++) for (int j = (0); j < ((i)); j++) { ; for (int h : v[i][j]) ; ; } dfs(1, min(6, k), [&]() { for (int i = (1); i < (n + 1); i++) ; ; Node *node = head; for (int i = (1); i < (n + 1); i++) { if (p[i] >= 2) return; node = node->next(p[i]); } node->a++; }); ; int ans = 0; dfs(min(7, k), k <= 6 ? 0 : k, [&]() { Node *node = head; for (int i = (1); i < (n + 1); i++) { if (p[i] >= 2) return; node = node->next(1 - p[i]); } ans += node->a; ; }); printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; int main() { long long int arr[200005] = {0}; long long int ans[200005] = {0}; int x, y, n, k, q; cin >> n >> k >> q; while (n--) { cin >> x >> y; arr[x]++; arr[y + 1]--; } for (int i = 1; i <= 200000; i++) { arr[i] += arr[i - 1]; } for (int i = 1; i <= 200000; i++) { if (arr[i] >= k) ans[i] = ans[i - 1] + 1; else ans[i] = ans[i - 1]; } while (q--) { cin >> x >> y; cout << ans[y] - ans[x - 1] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; #pragma warning(disable : 4996) #pragma comment(linker, /STACK:20000007 ) #pragma GCC optimize( unroll-loops ) const int N = (int)1e6 + 100; const int maxn = (int)1e3 + 100; const int base = (int)1e9; const int mod = (int)1e9 + 7; const int inf = INT_MAX; const long long ll_inf = LLONG_MAX; const long double pi = acos((long double)-1.0); const long double eps = 1e-8; void yes() { exit(!(printf( YES n ))); } void no() { exit(!(printf( NO n ))); } void solve() { string s; cin >> s; int n = s.size(); if (n < 4) no(); set<char> S; vector<int> Cnt(26); for (char c : s) Cnt[c - a ]++, S.insert(c); int L = S.size(); if (L > 4) no(); if (3 <= L && L <= 4) yes(); if (L == 1) no(); if (L == 2) { if (!any_of(Cnt.begin(), Cnt.end(), [&](int Count) -> bool { return Count >= 2; })) no(); vector<int> others; for (int i = 0; i < 26; ++i) if (Cnt[i] >= 2) others.push_back(i); if (others.size() >= 2) yes(); else no(); } no(); } int main() { int T = 1; for (; T; --T) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; void __print(int x) { cout << x; } void __print(long x) { cout << x; } void __print(long long x) { cout << x; } void __print(unsigned x) { cout << x; } void __print(unsigned long x) { cout << x; } void __print(unsigned long long x) { cout << x; } void __print(float x) { cout << x; } void __print(double x) { cout << x; } void __print(long double x) { cout << x; } void __print(char x) { cout << << x << ; } void __print(const char *x) { cout << << x << ; } void __print(const string &x) { cout << << x << ; } void __print(bool x) { cout << (x ? true : false ); } template <typename T, typename V> void __print(const pair<T, V> &x) { cout << { ; __print(x.first); cout << , ; __print(x.second); cout << } ; } template <typename T> void __print(const T &x) { int f = 0; cout << { ; for (auto &i : x) cout << (f++ ? , : ), __print(i); cout << } ; } void _print() { cout << n ; } template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) cout << , ; _print(v...); } const int mod = 1e9 + 7, mxn = 1e5 + 1; int solve() { int n, m, k; cin >> n >> m >> k; vector<long long> v(n + 1); for (long long i = (1); i < (n + 1); ++i) cin >> v[i]; vector<long long> pref(n + 1, 0); pref[0] = 0; for (long long i = (1); i < (n + 1); ++i) pref[i] = pref[i - 1] + v[i]; long long dp[n + 1][k + 1]; memset(dp, 0ll, sizeof(dp)); for (long long i = (1); i < (n + 1); ++i) { for (long long j = (1); j < (k + 1); ++j) { if (i - m >= 0) dp[i][j] = max(dp[i - 1][j], dp[i - m][j - 1] + pref[i] - pref[i - m]); else dp[i][j] = dp[i - 1][j]; } } cout << dp[n][k] << n ; return 0; } int main() { ios_base::sync_with_stdio(NULL); cin.tie(NULL); cout.tie(NULL); int t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; using pii = pair<int, int>; constexpr int maxn = 1e5 + 10; vector<int> topo; vector<vector<pii>> pilha; int ans[maxn]; int main() { int n; scanf( %d , &n); vector<int> a(n); for (auto& it : a) scanf( %d , &it); for (int i = 0; i < n; i++) { auto it = lower_bound((topo).begin(), (topo).end(), a[i]); if (it == topo.end()) topo.push_back(a[i]), pilha.push_back({{a[i], i}}); else { int pos = (int)(it - topo.begin()); topo[pos] = a[i]; pilha[pos].push_back({a[i], i}); } } vector<pii> valid = pilha.back(); if ((int)((valid).size()) > 1) for (auto it : valid) ans[it.second] = 2; else ans[valid[0].second] = 3; for (int i = (int)((pilha).size()) - 2; i >= 0; i--) { assert((int)((valid).size())); sort((valid).begin(), (valid).end()); vector<int> suf((int)((valid).size())), comp((int)((valid).size())); suf.back() = valid.back().second; for (int pos = (int)((valid).size()) - 2; pos >= 0; pos--) suf[pos] = max(suf[pos + 1], valid[pos].second); for (int j = 0; j < (int)((valid).size()); j++) comp[j] = valid[j].first; valid.clear(); for (int j = 0; j < (int)((pilha[i]).size()); j++) { auto it = upper_bound((comp).begin(), (comp).end(), pilha[i][j].first); if (it == comp.end()) ans[pilha[i][j].second] = 1; else { int pos = (int)(it - comp.begin()); if (suf[pos] < pilha[i][j].second) ans[pilha[i][j].second] = 1; else valid.push_back(pilha[i][j]); } } if ((int)((valid).size()) > 1) for (auto it : valid) ans[it.second] = 2; else ans[valid[0].second] = 3; } for (int i = 0; i < n; i++) printf( %d , ans[i]); printf( n ); } |
#include<bits/stdc++.h> using namespace std; void solve(){ int n; cin >> n; int a[n]; for(int i=0;i<n;i++){ cin >> a[i]; } vector<int> ans; ans.push_back(0); int current = a[0]; for(int i=1;i<n;i++){ int cans = (current|a[i])^a[i]; ans.push_back(cans); current = current|a[i]; } for(int i=0;i<n;i++){ cout << ans[i] << ; } cout << endl; } int main(){ int t=1; cin >> t; while(t--){ solve(); } } |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int len = s.length(); for (int i = 0; i < len;) { if (s[i] != 1 ) { cout << NO << endl; return 0; } if (i + 3 <= len) { if (s[i + 1] == 4 and s[i + 2] == 4 ) { i += 3; } else if (s[i + 1] == 4 ) { i += 2; } else ++i; } else if (i + 2 <= len) { if (s[i + 1] == 4 ) { i += 2; } else ++i; } else ++i; } cout << YES << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> class graph { public: struct edge { int from; int to; T cost; }; vector<edge> edges; vector<vector<int>> g; int n; graph(int _n) : n(_n) { g.resize(n); } virtual int add(int from, int to, T cost) = 0; }; template <typename T> class undigraph : public graph<T> { public: using graph<T>::edges; using graph<T>::g; using graph<T>::n; undigraph(int _n) : graph<T>(_n) {} int add(int from, int to, T cost = 1) { assert(0 <= from && from < n && 0 <= to && to < n); int id = (int)edges.size(); g[from].push_back(id); g[to].push_back(id); edges.push_back({from, to, cost}); return id; } }; template <typename T> vector<vector<int>> find_cycles(const graph<T> &g, int bound_cnt = 1 << 30, int bound_size = 1 << 30) { vector<int> was(g.n, -1); vector<int> st; vector<vector<int>> cycles; int total_size = 0; function<void(int, int)> dfs = [&](int v, int pe) { if ((int)cycles.size() >= bound_cnt || total_size >= bound_size) { return; } was[v] = (int)st.size(); for (int id : g.g[v]) { if (id == pe) { continue; } auto &e = g.edges[id]; int to = e.from ^ e.to ^ v; if (was[to] >= 0) { vector<int> cycle(1, id); for (int j = was[to]; j < (int)st.size(); j++) { cycle.push_back(st[j]); } cycles.push_back(cycle); total_size += (int)cycle.size(); if ((int)cycles.size() >= bound_cnt || total_size >= bound_size) { return; } continue; } if (was[to] == -1) { st.push_back(id); dfs(to, id); st.pop_back(); } } was[v] = -2; }; for (int i = 0; i < g.n; i++) { if (was[i] == -1) { dfs(i, -1); } } return cycles; } template <typename T> vector<int> edges_to_vertices(const graph<T> &g, const vector<int> &edge_cycle) { int sz = (int)edge_cycle.size(); vector<int> vertex_cycle; if (sz <= 2) { vertex_cycle.push_back(g.edges[edge_cycle[0]].from); if (sz == 2) { vertex_cycle.push_back(g.edges[edge_cycle[0]].to); } } else { for (int i = 0; i < sz; i++) { int j = (i + 1) % sz; auto &e = g.edges[edge_cycle[i]]; auto &other = g.edges[edge_cycle[j]]; if (other.from == e.from || other.to == e.from) { vertex_cycle.push_back(e.to); } else { vertex_cycle.push_back(e.from); } } } return vertex_cycle; } int main() { ios::sync_with_stdio(false); cin.tie(0); int n, m; cin >> n >> m; undigraph<int> g(n); for (int i = 0; i < m; i++) { int x, y; cin >> x >> y; --x; --y; g.add(x, y); } vector<vector<int>> cycles = find_cycles(g); vector<vector<int>> events(m); for (auto &cycle : cycles) { int sz = (int)cycle.size(); int pos = (int)(min_element(cycle.begin(), cycle.end()) - cycle.begin()); rotate(cycle.begin(), cycle.begin() + pos, cycle.end()); pos = (int)(max_element(cycle.begin(), cycle.end()) - cycle.begin()); bool ok = true; for (int i = 0; i < pos - 1; i++) { if (cycle[i] > cycle[i + 1]) { ok = false; break; } } for (int i = pos; i < sz - 1; i++) { if (cycle[i] < cycle[i + 1]) { ok = false; break; } } if (ok) { events[cycle[pos]].push_back(cycle[0]); } } vector<int> sub(m, 0); vector<int> ans(n, 1); for (int i = m - 1; i >= 0; i--) { auto &e = g.edges[i]; int x = e.from; int y = e.to; int cur = ans[x] + ans[y] - sub[i]; ans[x] = ans[y] = cur; for (int j : events[i]) { sub[j] += cur; } } for (int i = 0; i < n; i++) { if (i > 0) { cout << ; } cout << ans[i] - 1; } cout << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; cout << 0 << << 0 << << n; return 0; } |
#include <bits/stdc++.h> using namespace std; inline int read() { register int res = 0, c; while (c = getchar(), c < 0 || c > 9 ) ; do { res = (res << 3) + (res << 1) + (c ^ 48); } while (c = getchar(), c >= 0 && c <= 9 ); return res; } const int inf = 0x3f3f3f3f; const int maxn = 100010; const int maxd = 8000010; int T[maxd], s[maxn], lson[maxd], rson[maxd], val[maxd], tot; int l[maxn], r[maxn], d[maxn]; vector<int> edge[maxn], lay[maxn]; int N, R, last, dep, dfn; void dfs(int x, int dep) { l[x] = ++dfn; d[x] = dep; ::dep = max(dep, ::dep); lay[dep].push_back(x); for (auto i : edge[x]) if (!l[i]) { dfs(i, dep + 1); } r[x] = dfn; } void update(int to, int L, int R, int& rt) { if (L == R) { val[rt = ++tot] = s[to]; return; } int mid = L + R >> 1; lson[++tot] = lson[rt]; rson[tot] = rson[rt]; rt = tot; if (l[to] <= mid) update(to, L, mid, lson[rt]); else update(to, mid + 1, R, rson[rt]); val[rt] = min(val[lson[rt]], val[rson[rt]]); } int query(int l, int r, int L, int R, int rt) { if (L >= l && R <= r) { return val[rt]; } int mid = L + R >> 1, res = inf; if (mid >= l) res = query(l, r, L, mid, lson[rt]); if (mid < r) res = min(res, query(l, r, mid + 1, R, rson[rt])); return res; } int main() { N = read(), R = read(); for (int i = 1; i <= N; i++) s[i] = read(); for (int i = 1; i < N; i++) { int x = read(), y = read(); edge[x].push_back(y); edge[y].push_back(x); } dfs(R, 1); T[0] = lson[0] = rson[0] = 0; val[0] = inf; for (int d = 1; d <= dep; d++) { T[d] = ++tot; lson[tot] = lson[T[d - 1]]; rson[tot] = rson[T[d - 1]]; for (auto i : lay[d]) update(i, 1, N, T[d]); } int Q = read(); while (Q--) { int X = (last + read()) % N + 1, K = (read() + last) % N; printf( %d n , last = query(l[X], r[X], 1, N, T[min(dep, d[X] + K)])); } } |
#include <bits/stdc++.h> int main(void) { int n; std::cin >> n; int arr[2 * n]; for (int i = 0; i < 2 * n; i++) std::cin >> arr[i]; int swc = 0; for (int i = 0; i < 2 * n; i += 2) { int pos = -1; for (int j = i + 1; j < 2 * n; j++) { if (arr[j] == arr[i]) { pos = j; break; } } for (int j = pos; j > i + 1; j--) { swc++; std::swap(arr[j], arr[j - 1]); } } std::cout << swc << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; const long long inf = 1e18; int a[maxn]; vector<int> g[maxn]; bool c[maxn], ok[maxn]; int dpdown[maxn], dpup[maxn]; int salem[maxn]; int mxdown[maxn], mxup[maxn]; int cnt[maxn]; int sum[maxn]; int n; int dip[maxn]; void dfsdown(int v, int p) { ok[v] = c[v]; cnt[v] = 1; sum[v] = c[v]; for (auto u : g[v]) if (u != p) dfsdown(u, v), cnt[v] += cnt[u], sum[v] += sum[u]; if (!c[v]) return; for (auto u : g[v]) if (u != p) if (ok[u]) salem[v] += cnt[u]; else { ok[v] = 0; mxdown[v] = max(mxdown[v], dpdown[u]); } dpdown[v] = mxdown[v] + salem[v] + 1; } void dfsup(int v, int p) { int _mx = -1; for (auto u : g[v]) if (u != p && c[u] && c[v]) mxup[u] = max(mxup[u], _mx), _mx = max(_mx, (1 - ok[u]) * dpdown[u]); reverse(g[v].begin(), g[v].end()); _mx = -1; for (auto u : g[v]) if (u != p && c[u] && c[v]) mxup[u] = max(mxup[u], _mx), _mx = max(_mx, (1 - ok[u]) * dpdown[u]); for (auto u : g[v]) if (u != p) if (c[u]) if (c[v]) if (sum[1] - sum[v] == n - cnt[v]) dpup[u] = 1 + salem[v] - (ok[u] ? cnt[u] : 0) + mxup[u] + dpup[v]; else dpup[u] = 1 + salem[v] - (ok[u] ? cnt[u] : 0) + max(mxup[u], dpup[v]); for (auto u : g[v]) if (u != p) if (c[u]) if (c[v]) if (sum[1] - sum[u] == n - cnt[u]) dip[u] = 1 + salem[u] + dpup[u] + mxdown[u]; else dip[u] = 1 + salem[u] + max(dpup[u], mxdown[u]); for (auto u : g[v]) if (u != p) dfsup(u, v); } int check(int mid) { for (int i = 1; i <= n; ++i) dip[i] = salem[i] = ok[i] = cnt[i] = dpdown[i] = dpup[i] = mxup[i] = mxdown[i] = 0; for (int i = 1; i <= n; ++i) c[i] = (a[i] >= mid); dfsdown(1, 0); dfsup(1, 0); int mx = 0; for (int i = 1; i <= n; ++i) mx = max(max(mx, dip[i]), max(dpdown[i], dpup[i])); return mx; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int k; cin >> n >> k; for (int i = 1; i <= n; ++i) cin >> a[i]; for (int i = 1; i < n; ++i) { int u, v; cin >> u >> v; g[u].push_back(v); g[v].push_back(u); } int l = 1, r = 1e6 + 85; while (r - l > 1) { int mid = (l + r) / 2; if (check(mid) >= k) l = mid; else r = mid; } cout << l << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int PI = acos(-1); const int MAXN = 1e6; unsigned long long comb(unsigned long long n, unsigned long long k) { if (k > n) return 0; unsigned long long u = 1; for (unsigned long long i = 1; i <= k; i++) { u *= n--; u /= i; } return u; } int main() { unsigned long long n, m, t; while (cin >> n >> m >> t) { unsigned long long ans = 0; for (unsigned long long boys = 4; boys <= n; boys++) { unsigned long long girls = t - boys; if (girls > m) continue; if (t < 1 + boys) break; ans += comb(n, boys) * comb(m, girls); } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, u, v, cnt, ans; int t[1100000], nxt[1100000], to[1100000]; int a[1100000], b[1100000], c[1100000], f[1100000]; int vis[1100000]; void add(int u, int v) { nxt[cnt] = t[u], t[u] = cnt, to[cnt++] = v; } void dfs(int x) { vis[x] = true; for (int e = t[x]; ~e; e = nxt[e]) { int y = to[e]; to[e] = to[e ^ 1] = 0; if (y) { if (!vis[y]) dfs(y); if (f[y]) a[++ans] = x, b[ans] = y, c[ans] = f[y], f[y] = 0; else if (f[x]) a[++ans] = f[x], b[ans] = x, c[ans] = y, f[x] = 0; else f[x] = y; } } } int main() { memset(t, 0xff, sizeof(t)); cin >> n >> m; for (int i = 1; i <= m; ++i) cin >> u >> v, add(u, v), add(v, u); vis[0] = true; for (int i = 1; i <= n; ++i) if (!vis[i]) dfs(i); printf( %d n , ans); for (int i = 1; i <= ans; ++i) printf( %d %d %d n , a[i], b[i], c[i]); return 0; } |
#include <bits/stdc++.h> const long double pi = acos(-1); const long long mod = 1e9 + 7, N = 1e5 + 5; using namespace std; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); long long q; cin >> q; while (q--) { long long a, b; cin >> a >> b; if (a > b) { if ((a % 2 == 0 && b % 2 == 0) || (a % 2 != 0 && b % 2 != 0)) cout << 1 << endl; else cout << 2 << endl; } else if (a < b) { if ((a % 2 == 0 && b % 2 == 0) || (a % 2 != 0 && b % 2 != 0)) cout << 2 << endl; else cout << 1 << endl; } else cout << 0 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int val[300000]; vector<pair<int, int> > ed[300000]; int fa[300000][20], maxt[300000][20], dfn[300000], dep[300000]; void dfs_bas(int u, int f) { dep[u] = dep[f] + 1, dfn[u] = ++dfn[0]; fa[u][0] = f; for (int i = 1; i < 20; i++) fa[u][i] = fa[fa[u][i - 1]][i - 1], maxt[u][i] = max(maxt[u][i - 1], maxt[fa[u][i - 1]][i - 1]); for (int i = 0; i < ed[u].size(); i++) { int v = ed[u][i].first; if (v == f) continue; maxt[v][0] = ed[u][i].second; dfs_bas(v, u); } } int LCA(int x, int y) { if (dep[x] < dep[y]) swap(x, y); for (int i = 19; i >= 0; i--) if (dep[fa[x][i]] >= dep[y]) x = fa[x][i]; if (x == y) return x; for (int i = 19; i >= 0; i--) if (fa[x][i] != fa[y][i]) x = fa[x][i], y = fa[y][i]; return fa[x][0]; } int query_anc(int x, int d) { int ans = 0; for (int i = 19; i >= 0; i--) if (d & (1 << i)) { ans = max(ans, maxt[x][i]); x = fa[x][i]; } return ans; } int query_path(int x, int y) { int l = LCA(x, y); return max(query_anc(x, dep[x] - dep[l]), query_anc(y, dep[y] - dep[l])); } struct Tree { int n; vector<int> ed[500000]; int val[500000], calc[500000], arg[500000]; int fa[500000][20], dep[500000], dfn[500000], sz[500000], ev[500000]; void dfs_bas(int u, int f) { fa[u][0] = f, dfn[u] = ++dfn[0], sz[u] = 1, dep[u] = dep[f] + 1; for (int i = 1; i < 20; i++) fa[u][i] = fa[fa[u][i - 1]][i - 1]; for (int i = 0; i < ed[u].size(); i++) { int v = ed[u][i]; if (v == f) continue; dfs_bas(v, u); sz[u] += sz[v]; } } int LCA(int x, int y) { if (dep[x] < dep[y]) swap(x, y); for (int i = 19; i >= 0; i--) if (dep[fa[x][i]] >= dep[y]) x = fa[x][i]; if (x == y) return x; for (int i = 19; i >= 0; i--) if (fa[x][i] != fa[y][i]) x = fa[x][i], y = fa[y][i]; return fa[x][0]; } } Y; struct BCJ { int fa[500000]; void init(int n) { for (int i = 1; i <= n; i++) fa[i] = i; } int fnd(int x) { return x == fa[x] ? x : fa[x] = fnd(fa[x]); } void conn(int x, int y) { fa[fnd(x)] = fnd(y); } } B; struct e { int a, b, c, t; } ined[300000]; bool ccmp(e A, e B) { return A.c < B.c; } bool tcmp(e A, e B) { return A.t < B.t; } bool ydfncmp(int x, int y) { return Y.dfn[x] < Y.dfn[y]; } int main() { int n = 0, q = 0; scanf( %d%d , &n, &q); for (int i = 1; i <= n; i++) scanf( %d , &val[i]); for (int i = 1; i < n; i++) scanf( %d%d%d%d , &ined[i].a, &ined[i].b, &ined[i].c, &ined[i].t), ed[ined[i].a].push_back(make_pair(ined[i].b, ined[i].t)), ed[ined[i].b].push_back(make_pair(ined[i].a, ined[i].t)); dfs_bas(1, 0); int c = n; B.init(2 * n - 1); sort(ined + 1, ined + n, ccmp); for (int i = 1; i <= n; i++) Y.val[i] = val[i], Y.arg[i] = i; for (int i = n - 1; i >= 1; i--) { if (B.fnd(ined[i].a) != B.fnd(ined[i].b)) { int u = B.fnd(ined[i].a), v = B.fnd(ined[i].b); c++; Y.ed[c].push_back(u), Y.ed[c].push_back(v); B.conn(u, c), B.conn(v, c); Y.val[c] = max(Y.val[u], Y.val[v]); Y.ev[c] = ined[i].c; if (Y.val[c] != Y.val[u]) { Y.calc[c] = Y.calc[v], Y.arg[c] = Y.arg[v]; } else if (Y.val[c] != Y.val[v]) { Y.calc[c] = Y.calc[u], Y.arg[c] = Y.arg[u]; } else { Y.calc[c] = max(max(Y.calc[u], Y.calc[v]), query_path(Y.arg[u], Y.arg[v])); Y.arg[c] = Y.arg[u]; } } } Y.dfs_bas(2 * n - 1, 0); while (q--) { int x = 0, v = 0; scanf( %d%d , &v, &x); int u = x; for (int i = 19; i >= 0; i--) if (Y.fa[u][i] && Y.ev[Y.fa[u][i]] >= v) u = Y.fa[u][i]; printf( %d %d n , Y.val[u], max(Y.calc[u], query_path(x, Y.arg[u]))); } } |
#include <bits/stdc++.h> using namespace std; const int maxint = 999999999; string s; int cnt[30]; int k; int main() { int i; while (cin >> s) { cin >> k; int l = s.length(); if (l <= k) { printf( 0 n ); printf( n ); continue; } for (i = 0; i < l; i++) { cnt[s[i] - a ]++; } int Min, u; while (1) { if (k == 0) break; Min = maxint; u = -1; for (i = 0; i < 26; i++) { if (cnt[i] > 0 && cnt[i] < Min) { Min = cnt[i]; u = i; } } if (Min > k) { k = 0; cnt[u] -= k; } else { cnt[u] = 0; k -= Min; } } int ans = 0; for (i = 0; i < 26; i++) { if (cnt[i] > 0) ans++; } printf( %d n , ans); for (i = 0; i < l; i++) { if (cnt[s[i] - a ] > 0) printf( %c , s[i]); } printf( n ); } return 0; } |
#include <bits/stdc++.h> #pragma Optimize( O3 ) using namespace std; int n, x, a, b, y, m, ans; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n; vector<int> v(n); vector<int> a; for (int i = 0; i < n; i++) cin >> v[i]; for (int i = 0; i < n; i += 2) a.push_back(v[i]); for (int i = 1; i < n; i += 2) a.push_back(v[i]); a.insert(a.end(), a.begin(), a.end()); long long sumtmp = 0; for (int i = 0; i < (n + 1) / 2; i++) sumtmp += a[i]; long long sum = sumtmp; for (int i = (n + 1) / 2; i < a.size(); i++) { sumtmp += a[i] - a[i - (n + 1) / 2]; sum = max(sum, sumtmp); } cout << sum << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a[4]; for (int i = 0; i < 4; i++) cin >> a[i]; sort(a, a + 4); for (int i = 0; i < 2; i++) if (a[i] + a[i + 1] > a[i + 2]) return 0 * printf( TRIANGLE ); for (int i = 0; i < 2; i++) if (a[i] + a[i + 1] == a[i + 2]) return 0 * printf( SEGMENT ); return 0 * printf( IMPOSSIBLE ); } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); } long long power(long long x, long long y, long long p) { long long res = 1; x = x % p; while (y > 0) { if (y & 1) res = ((res % p) * (x % p)) % p; y = y >> 1; x = ((x % p) * (x % p)) % p; } return res; } long long raichu(long long x, long long y) { long long res = 1; while (y > 0) { if (y & 1) res = ((res) * (x)); y = y >> 1; x = ((x) * (x)); } return res; } bool isprime(long long n) { if (n < 2) return false; else if (n == 2) return true; else if (n % 2 == 0) return false; else { long long z = sqrt(n); for (long long i = 0; i < z - 1; i++) if (n % (i + 2) == 0) return false; return true; } } const long long prime = 13313; namespace FFT { const long long N = 20; const long long MAXN = (1 << N); const double PI = acos(-1.0); class cmplx { private: double x, y; public: cmplx() : x(0.0), y(0.0) {} cmplx(double a) : x(a), y(0.0) {} cmplx(double a, double b) : x(a), y(b) {} double get_real() { return this->x; } double get_img() { return this->y; } cmplx conj() { return cmplx(this->x, -(this->y)); } cmplx operator=(const cmplx& a) { this->x = a.x; this->y = a.y; return *this; } cmplx operator+(const cmplx& b) { return cmplx(this->x + b.x, this->y + b.y); } cmplx operator-(const cmplx& b) { return cmplx(this->x - b.x, this->y - b.y); } cmplx operator*(const double& num) { return cmplx(this->x * num, this->y * num); } cmplx operator/(const double& num) { return cmplx(this->x / num, this->y / num); } cmplx operator*(const cmplx& b) { return cmplx(this->x * b.x - this->y * b.y, this->y * b.x + this->x * b.y); } cmplx operator/(const cmplx& b) { cmplx temp(b.x, -b.y); cmplx n = (*this) * temp; return n / (b.x * b.x + b.y * b.y); } }; cmplx w[MAXN]; cmplx f1[MAXN]; long long rev[MAXN]; void ReserveBits(long long k) { static long long rk = -1, lim; if (k == rk) return; rk = k, lim = 1 << k; for (long long i = 1; i <= lim; ++i) { long long j = rev[i - 1], t = k - 1; while (t >= 0 && ((j >> t) & 1)) { j ^= 1 << t; --t; } if (t >= 0) { j ^= 1 << t; --t; } rev[i] = j; } } void fft(cmplx* a, long long k) { ReserveBits(k); long long n = 1 << k; for (long long i = 0; i < n; ++i) if (rev[i] > i) swap(a[i], a[rev[i]]); for (long long l = 2, m = 1; l <= n; l += l, m += m) { if (w[m].get_real() == 0 && w[m].get_img() == 0) { double angle = PI / m; cmplx ww(cos(angle), sin(angle)); if (m > 1) { for (long long j = 0; j < m; ++j) { if (j & 1) w[m + j] = w[(m + j) / 2] * ww; else w[m + j] = w[(m + j) / 2]; } } else w[m] = cmplx(1, 0); } for (long long i = 0; i < n; i += l) { for (long long j = 0; j < m; ++j) { cmplx v = a[i + j], u = a[i + j + m] * w[m + j]; a[i + j] = v + u; a[i + j + m] = v - u; } } } } vector<long long> multiply(const vector<long long>& a, const vector<long long>& b) { long long k = 1; while ((1 << k) < (a.size() + b.size())) ++k; long long n = (1 << k); for (long long i = 0; i < n; ++i) f1[i] = cmplx(0, 0); for (long long i = 0; i < a.size(); ++i) f1[i] = f1[i] + cmplx(a[i], 0); for (long long i = 0; i < b.size(); ++i) f1[i] = f1[i] + cmplx(0, b[i]); fft(f1, k); for (long long i = 0; i <= n / 2; ++i) { cmplx p = f1[i] + f1[(n - i) % n].conj(); cmplx _q = f1[(n - i) % n] - f1[i].conj(); cmplx q(_q.get_img(), _q.get_real()); f1[i] = (p * q) * 0.25; if (i > 0) f1[(n - i)] = f1[i].conj(); } for (long long i = 0; i < n; ++i) f1[i] = f1[i].conj(); fft(f1, k); vector<long long> ans(a.size() + b.size() - 1); for (long long i = 0; i < ans.size(); ++i) { ans[i] = (long long)(f1[i].get_real() / n + 0.5); } return ans; } }; // namespace FFT using namespace FFT; vector<long long> pfft(vector<long long>& a, long long k) { vector<long long> res; res.push_back(1); while (k > 0) { if (k & 1) res = multiply(res, a); k = k >> 1; a = multiply(a, a); for (long long i = 0; i < (long long)a.size(); i++) if (a[i] > 0) a[i] = 1; for (long long i = 0; i < (long long)res.size(); i++) if (res[i] > 0) res[i] = 1; } return res; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n, k; cin >> n >> k; vector<long long> a(n); for (long long i = 0; i < n; i++) cin >> a[i]; vector<long long> z(1001, 0); for (long long i = 0; i < n; i++) z[a[i]] = 1; vector<long long> ans = pfft(z, k); for (long long i = 0; i < (long long)ans.size(); i++) if (ans[i] > 0) cout << i << ; return 0; } |
#include <bits/stdc++.h> const int N = 2e5 + 5; const int MOD = 1e9 + 7; using namespace std; int n; char str1[N], str2[N]; vector<int> lt[30], rt[30]; vector<pair<int, int> > ans; int main() { scanf( %d , &n); scanf( %s , str1); scanf( %s , str2); for (int a = 0; a < n; a++) { if (str1[a] == ? ) lt[26].push_back(a); else lt[(int)(str1[a] - a )].push_back(a); if (str2[a] == ? ) rt[26].push_back(a); else rt[(int)(str2[a] - a )].push_back(a); } for (int a = 0; a < 26; a++) { while (lt[a].size() > 0 && rt[a].size() > 0) { ans.push_back({lt[a][lt[a].size() - 1] + 1, rt[a][rt[a].size() - 1] + 1}); lt[a].pop_back(); rt[a].pop_back(); } } int idx = 0; while (lt[26].size() > 0 && idx < 26) { while (lt[26].size() > 0 && rt[idx].size() > 0) { ans.push_back( {lt[26][lt[26].size() - 1] + 1, rt[idx][rt[idx].size() - 1] + 1}); lt[26].pop_back(); rt[idx].pop_back(); } idx++; } idx = 0; while (rt[26].size() > 0 && idx < 26) { while (rt[26].size() > 0 && lt[idx].size() > 0) { ans.push_back( {lt[idx][lt[idx].size() - 1] + 1, rt[26][rt[26].size() - 1] + 1}); lt[idx].pop_back(); rt[26].pop_back(); } idx++; } while (rt[26].size() > 0 && lt[26].size() > 0) { ans.push_back( {lt[26][lt[26].size() - 1] + 1, rt[26][rt[26].size() - 1] + 1}); lt[26].pop_back(); rt[26].pop_back(); } printf( %d n , (int)ans.size()); for (auto v : ans) printf( %d %d n , v.first, v.second); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector<int> a(n), b(n); for (int i = 0; i < n; ++i) cin >> a[i]; iota(b.begin(), b.end(), 0); sort(b.begin(), b.end(), [&](int i, int j) { return a[i] < a[j]; }); vector<vector<int>> c(n + 1); for (int i = 0; i <= n; ++i) c[i].resize(n); for (int i = 0; i < n; ++i) for (int j = 0; j < a[b[i]]; ++j) c[(n + 1 + i - j) % (n + 1)][b[i]] = 1; cout << n + 1 << n ; for (int i = 0; i < n + 1; ++i, cout << n ) for (int j = 0; j < n; ++j) cout << c[i][j]; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string n; cin >> n; int ind = -1; int indn = -1; int l = n.length(); for (int i = l - 1; i >= 0; i--) { if (n[i] == 0 || n[i] == 2 || n[i] == 4 || n[i] == 6 || n[i] == 8 ) { if (n[i] < n[l - 1]) { indn = i; } } } for (int i = 0; i < l - 1; i++) { if (n[i] == 0 || n[i] == 2 || n[i] == 4 || n[i] == 6 || n[i] == 8 ) { if (n[i] > n[l - 1]) { ind = i; } } } if (indn != -1) { swap(n[indn], n[l - 1]); } else if (indn == -1 && ind != -1) { swap(n[ind], n[l - 1]); } else if (indn == -1 && ind == -1) { cout << -1; return 0; } cout << n; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n + 1]; vector<int> g[n + 1]; for (int i = 1; i <= n; i++) { cin >> a[i]; } set<pair<int, int> > last; int k = 0; for (int i = 1; i <= n; i++) { set<pair<int, int> >::iterator it = last.lower_bound(make_pair(a[i], 1)); if (it == last.begin()) { g[++k].push_back(a[i]); last.insert(make_pair(a[i], k)); } else { --it; g[it->second].push_back(a[i]); last.erase(it); last.insert(make_pair(a[i], it->second)); } } for (int i = 1; i <= k; i++) { for (int j : g[i]) { cout << j << ; } cout << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { int n1, n2, k1, k2; cin >> n1 >> n2 >> k1 >> k2; if (n1 > n2) { cout << First ; } else { cout << Second ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 33333; const int mod = 998244353, G = 3; int n, k, T, a[MAXN], W, rev[MAXN], gen[MAXN]; vector<int> vec[MAXN]; inline int qpow(int a, int b) { int re = 1; for (; b; b >>= 1, a = 1ll * a * a % mod) if (b & 1) re = 1ll * re * a % mod; return re; } inline int pls(int x, int y) { return x + y >= mod ? x + y - mod : x + y; } inline void add(int &x, int y) { x = x + y >= mod ? x + y - mod : x + y; } void NTT(vector<int> &arr, int len, int flg) { for (int i = 0; i < len; ++i) if (i < rev[i]) swap(arr[i], arr[rev[i]]); for (int v, i = 2, B = W >> 1; i <= len; i <<= 1, B >>= 1) for (int j = 0; j < len; j += i) for (int k = j, x = 0; k < j + i / 2; ++k, x += B) arr[k + i / 2] = pls( arr[k], mod - (v = 1ll * arr[k + i / 2] * gen[flg == 1 ? x : W - x] % mod)), add(arr[k], v); if (flg == -1) { int iv = qpow(len, mod - 2); for (int i = 0; i < len; ++i) arr[i] = 1ll * arr[i] * iv % mod; } } vector<int> solve(int l, int r) { if (l == r) return vec[l]; int mid = (l + r) >> 1; vector<int> L = solve(l, mid), R = solve(mid + 1, r); int len = 1; while (len <= r - l + 1) len <<= 1; for (int i = 1; i < len; ++i) rev[i] = (rev[i >> 1] >> 1) | ((i & 1) * (len >> 1)); L.resize(len), R.resize(len); NTT(L, len, 1), NTT(R, len, 1); for (int i = 0; i < len; ++i) L[i] = 1ll * L[i] * R[i] % mod; NTT(L, len, -1); L.resize(r - l + 2); return L; } int main() { scanf( %d%d , &n, &k); for (W = 1; W <= n; W <<= 1) ; gen[0] = 1, gen[1] = qpow(G, (mod - 1) / W); for (int i = 2; i <= W; ++i) gen[i] = 1ll * gen[i - 1] * gen[1] % mod; for (int i = 1; i <= n; ++i) scanf( %d , &a[i]), vec[i].resize(2), vec[i][0] = 1; int op, q, x, y, d; for (scanf( %d , &T); T--;) { scanf( %d%d%d , &op, &q, &x); if (op == 2) scanf( %d , &y); else y = x; scanf( %d , &d); for (int i = 1; i <= n; ++i) vec[i][1] = ((q - ((x <= i && i <= y) ? (op == 1 ? d : a[i] + d) : a[i])) % mod + mod) % mod; vector<int> ans = solve(1, n); printf( %d n , ans[k]); } } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n]; map<int, int> m; int u = 0; long long powers[32]; powers[0] = 1; for (int i = 1; i < 32; i++) powers[i] = 2 * powers[i - 1]; for (int i = 0; i < n; i++) { cin >> a[i]; m[a[i]]++; } bool flag = false; for (int i = 0; i < n; i++) { flag = false; for (int j = 0; j < 32; j++) { long long x = powers[j] - a[i]; if (m[x] > 1 || (m[x] == 1 && x != a[i])) { flag = true; break; } } if (!flag) u++; } cout << u << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int arr[500010]; int d1[500010]; int d2[500010]; int main() { int n; cin >> n; for (int i = (0); i < (int)(n); i++) cin >> arr[i]; int last2left = 0; for (int i = (1); i < (int)(n - 1); i++) { if (arr[i] == arr[i - 1]) { last2left = i; d1[i] = i; } else { d1[i] = last2left; } } last2left = n - 1; for (int i = (n - 1 - 1); i >= (int)(1); i--) { if (arr[i] == arr[i + 1]) { last2left = i; d2[i] = i; } else { d2[i] = last2left; } } int res = 0; for (int i = (1); i < (int)(n - 1); i++) res = max(res, min(i - d1[i], d2[i] - i)); cout << res << endl; cout << arr[0] << ; for (int i = (1); i < (int)(n - 1); i++) cout << ((i - d1[i] < d2[i] - i) ? arr[d1[i]] : arr[d2[i]]) << ; cout << arr[n - 1] << endl; } |
#include <bits/stdc++.h> using namespace std; string ANSWER[2] = { NO n , YES n }; int v[2009], s1[2009], s2[2009]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &v[i]); s1[i] = s1[i - 1] + (v[i] == 1); s2[i] = s2[i - 1] + (v[i] == 2); } int ans = 0; for (int i = 1; i <= n; i++) { int a = 0, b = 0; for (int j = i; j <= n; j++) { if (v[j] == 1) b++; if (v[j] == 2) a++; if (a > b) b = a; ans = max(ans, s1[i - 1] + b + s2[n] - s2[j]); } } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int x, y, n, d, x_i, y_i; vector<pair<int, int> > v; double dist(double x1, double y1) { return sqrt(pow(x1, 2) + pow(y1, 2)); } int a[605][605]; int f(int _x, int _y) { if (a[200 + _x][200 + _y] == -1) { int tmp = 1; if (dist(_x, _y) <= d) { for (auto _i : v) { if (f(_x + _i.first, _y + _i.second)) { tmp = 0; break; } } } else { tmp = 0; } a[200 + _x][200 + _y] = tmp; } return a[200 + _x][200 + _y]; } int main() { ios::sync_with_stdio(0); cin >> x >> y >> n >> d; (memset(a, -1, sizeof(a))); for (int(i) = (0); (i) < (n); (i)++) { cin >> x_i >> y_i; v.push_back({x_i, y_i}); } cout << (!f(x, y) ? Anton : Dasha ) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, i, n; int edges[int(2e5 + 1)][2], weights[int(2e5 + 1)], freq[int(2e5 + 1)]; cin >> n; for (i = 1; i <= n; i++) freq[i] = 0; for (i = 0; i < n; i++) { weights[i] = -1; cin >> edges[i][0] >> edges[i][1]; freq[edges[i][0]]++; freq[edges[i][1]]++; } int maxindex = 1, k = 0; for (i = 1; i <= n; i++) if (freq[i] > freq[maxindex]) maxindex = i; for (i = 0; i < n; i++) if (edges[i][0] == maxindex or edges[i][1] == maxindex) weights[i] = k++; for (i = 0; i < n; i++) if (weights[i] == -1) weights[i] = k++; for (i = 0; i < n - 1; i++) cout << weights[i] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; void debug() { cout << endl; } template <typename T, typename... E> void debug(T t, E... e) { cout << t << (sizeof...(e) ? : ); debug(e...); } int main() { ios::sync_with_stdio(0); cin.tie(0); int a, b, c, d; cin >> a >> b >> c >> d; double p1 = double(a) / b; double p2 = double(c) / d; double ans = p1 / (1 - (1 - p1) * (1 - p2)); cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; inline int in() { int32_t x; scanf( %d , &x); return x; } inline long long lin() { long long x; scanf( %lld , &x); return x; } const int maxn = 2e5 + 10; const int mod = 1e9 + 7; const long long infll = 1e18; const int inf = 1e9; int lcp[40][40]; string s[maxn]; int32_t main() { int n = in(), k = in(); for (int i = 0; i < n; i++) cin >> s[i]; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { int where = 0; while (where < s[i].size() && where < s[j].size() && s[i][where] == s[j][where]) where++; lcp[i][j] = where; } } int res = 0; for (int mask = 0; mask < (1 << n); mask++) { if (__builtin_popcount(mask) - k) continue; vector<int> Ids; for (int i = 0; i < n; i++) if (mask >> i & 1) Ids.push_back(i); int tot = 0; for (int i = 0; i < Ids.size(); i++) for (int j = i + 1; j < Ids.size(); j++) tot += lcp[Ids[i]][Ids[j]]; res = max(res, tot); } cout << res << endl; } |
#include <bits/stdc++.h> const int N = 4005; const int M = 80; const int MOD = 998244353; int m, jc[M], ny[M]; struct Tree { int n, cnt, last[N], f[M][N], g[M][N], size[N], ans[M], w[N], tot, a[N], sum, root; bool vis[N]; struct edge { int to, next; } e[N * 2]; void addedge(int u, int v) { e[++cnt].to = v; e[cnt].next = last[u]; last[u] = cnt; e[++cnt].to = u; e[cnt].next = last[v]; last[v] = cnt; } void get_root(int x, int fa) { size[x] = 1; w[x] = 0; for (int i = last[x]; i; i = e[i].next) { if (e[i].to == fa || vis[e[i].to]) continue; get_root(e[i].to, x); size[x] += size[e[i].to]; w[x] = std::max(w[x], size[e[i].to]); } w[x] = std::max(w[x], sum - size[x]); if (!root || w[x] < w[root]) root = x; } void get(int x, int fa) { a[++tot] = x; size[x] = 1; for (int i = last[x]; i; i = e[i].next) if (e[i].to != fa && !vis[e[i].to]) get(e[i].to, x), size[x] += size[e[i].to]; } void calc(int x) { tot = 0; get(x, 0); f[0][x] = g[0][x] = 1; for (int i = 1; i <= m; i++) for (int j = 1; j <= tot; j++) { int y = a[j]; f[i][y] = g[i][y] = 0; for (int k = last[y]; k; k = e[k].next) { if (vis[e[k].to]) continue; (g[i][y] += g[i - 1][e[k].to]) %= MOD; if (y != x) (f[i][y] += f[i - 1][e[k].to]) %= MOD; } } for (int i = 1; i <= tot; i++) { int y = a[i]; if (y == x) { for (int j = 0; j <= m; j++) (ans[j] += g[j][x]) %= MOD; continue; } for (int j = 0; j <= m; j++) for (int k = 0; j + k <= m; k++) (ans[j + k] += (long long)f[j][y] * g[k][y] % MOD) %= MOD; } vis[x] = 1; for (int i = last[x]; i; i = e[i].next) { if (vis[e[i].to]) continue; root = 0; sum = size[e[i].to]; get_root(e[i].to, x); calc(root); } } void solve() { sum = n; root = 0; get_root(1, 0); calc(root); } } t1, t2; int C(int n, int m) { return (long long)jc[n] * ny[m] % MOD * ny[n - m] % MOD; } int main() { scanf( %d%d%d , &t1.n, &t2.n, &m); jc[0] = jc[1] = ny[0] = ny[1] = 1; for (int i = 2; i <= m; i++) jc[i] = (long long)jc[i - 1] * i % MOD, ny[i] = (long long)(MOD - MOD / i) * ny[MOD % i] % MOD; for (int i = 2; i <= m; i++) ny[i] = (long long)ny[i - 1] * ny[i] % MOD; for (int i = 1; i < t1.n; i++) { int x, y; scanf( %d%d , &x, &y); t1.addedge(x, y); } for (int i = 1; i < t2.n; i++) { int x, y; scanf( %d%d , &x, &y); t2.addedge(x, y); } t1.solve(); t2.solve(); int s = 0; for (int i = 0; i <= m; i++) (s += (long long)t1.ans[i] * t2.ans[m - i] % MOD * C(m, i) % MOD) %= MOD; printf( %d , s); 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, long long p = 1000000007) { x = x % p; long long sum = 1; while (y) { if (y & 1) sum = sum * x; sum %= p; y = y >> 1; x = x * x; x %= p; } 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; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t, n; cin >> t; while (t--) { cin >> n; long long tmp = 0; vector<long long> v(n); for (int i = 0; i < n; i++) { cin >> v[i]; tmp ^= v[i]; } if (tmp == 0) { cout << DRAW n ; continue; } for (long long j = 40; j >= 0; j--) { if ((tmp >> j) & 1) { long long cnt0 = 0, cnt1 = 0; for (int i = 0; i < n; i++) { if ((v[i] >> j) & 1) cnt1++; else cnt0++; } if (cnt0 % 2 == 0 && cnt1 % 4 == 3) { cout << LOSE n ; } else { cout << WIN n ; } break; } } } } |
#include <bits/stdc++.h> using namespace std; struct Node { int num, cnt; friend bool operator<(const Node &n1, const Node &n2) { if (n1.cnt != n2.cnt) return n1.cnt < n2.cnt; else return n1.num < n2.num; } }; set<Node> cur, tmp; vector<int> xx, num; map<int, int> mp; int main() { int n, x; scanf( %d%d , &n, &x); if (x == 0 && n == 2) { puts( NO ); return 0; } while (x > 0) { xx.push_back(x % 2); x /= 2; } int sz = xx.size(); int pre = 0; cur.insert({0, n}); int idx = 0; while (true) { int need; if (idx < sz) { need = xx[idx]; } else need = 0; tmp.clear(); int tar = need, now = 0; for (auto o : cur) { int zc = o.num * 2, cc = o.cnt; if (cc / 2 > 0) tmp.insert({zc + 1, cc / 2}); if ((cc + 1) / 2 > 0) tmp.insert({zc, (cc + 1) / 2}); now ^= ((cc / 2) % 2); } if (tar != now) { for (auto o : cur) { int zc = o.num * 2, cc = o.cnt; if (cc == 1) { tmp.erase({zc, (cc + 1) / 2}); tmp.insert({zc + 1, cc / 2 + 1}); } else { tmp.erase({zc, (cc + 1) / 2}); tmp.erase({zc + 1, cc / 2}); if ((cc + 1) / 2 > 1) tmp.insert({zc, (cc + 1) / 2 - 1}); tmp.insert({zc + 1, cc / 2 + 1}); } break; } } cur.clear(); for (auto o : tmp) { cur.insert(o); } idx++; int siz = cur.size(); if (siz == n && idx >= sz) break; } vector<int> ans; bool ok = true; for (auto o : cur) { int t = o.num, res = 0; for (int i = 1; i <= idx; i++) { int now = t % 2; res = res * 2 + now; t /= 2; } ans.push_back(res); if (res > 1000000) { ok = false; break; } } if (!ok) { puts( NO ); } else { int ord = 0; puts( YES ); for (auto o : ans) { if (ord != 0) putchar( ); printf( %d , o); ord++; } puts( ); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, a[33], ans; map<long long, long long> us; int main() { cin >> n; for (long long i = 1; i <= n; ++i) cin >> a[i]; sort(a + 1, a + 1 + n); for (long long i = 1; i <= n; ++i) { while (us[a[i]] && a[i] > 0) a[i]--; ans += a[i]; us[a[i]] = 1; } cout << ans; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int digit[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2}; string n; cin >> n; int a = digit[(n[1] - 48)]; int b = digit[(n[0] - 48)]; cout << a * b; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; vector<int> t; int get(int a) { if (t[a] == a) { return a; } else { return t[a] = get(t[a]); } } struct kek { int a; int b; int c; }; bool operator<(kek a, kek b) { return a.c < b.c; } void uni(int a, int b) { a = get(a); b = get(b); if (a != b) t[a] = b; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m; for (int i = 1; i <= n + 1; i++) t.push_back(i - 1); m--; vector<kek> e(m); int a, b, c; cin >> a >> b >> c; for (int i = 0; i < m; i++) cin >> e[i].a >> e[i].b >> e[i].c; sort(e.begin(), e.end()); int sol = 0; if (m == 0) { sol = (int)1e9; } for (int i = 0; i < m; i++) { auto it = e[i]; int x = it.a; int y = it.b; int z = it.c; if (get(a) != get(b)) sol = max(sol, e[i].c); uni(x, y); int urm; if (i + 1 == m) urm = (int)1e9; else urm = max(e[i].c, e[i + 1].c - 1); if (get(a) != get(b)) sol = max(sol, urm); } cout << sol << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; long long pwr(long long a, long long b, long long mod) { if (b == 0) return 1; long long temp = pwr(a, b / 2, mod); temp = (temp * temp) % mod; if (b & 1) temp = (temp * a) % mod; return temp; } long long pwr(long long a, long long b) { if (b == 0) return 1; long long temp = pwr(a, b / 2); temp = (temp * temp); if (b & 1) temp = (temp * a); return temp; } long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; } long long modularInverse(long long a, long long m) { return pwr(a, m - 2, m); } bool *isPrime; void generatePrimeSieve(const int lim) { isPrime = (bool *)malloc(lim + 1); memset(isPrime, true, lim + 1); isPrime[0] = false; isPrime[1] = false; for (int i = 2; i <= lim; ++i) if (isPrime[i]) for (int j = i + i; j <= lim; j += i) isPrime[j] = false; } vector<vector<int> > identityMatrix; vector<vector<int> > mul(const vector<vector<int> > &a, const vector<vector<int> > &b) { int n = a.size(); vector<vector<int> > ans(n, vector<int>(n)); for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { for (int k = 0; k < n; ++k) { ans[i][j] += ((long long)a[i][k] * b[k][j]) % mod; ans[i][j] %= mod; } } } return ans; } vector<vector<int> > pwr(const vector<vector<int> > &a, long long n) { if (n == 0) { assert(false); return identityMatrix; } if (n == 1) return a; vector<vector<int> > tmp = pwr(a, n / 2); tmp = mul(tmp, tmp); if (n & 1) tmp = mul(a, tmp); return tmp; } string str[435]; bool isRemoved[3123]; int main() { std::ios::sync_with_stdio(false); int n, m; cin >> n >> m; for (int i = 0; i < n; ++i) cin >> str[i]; int ans = 0; while (true) { bool encountered = false; for (int i = 0; i < n - 1; ++i) { if (str[i] > str[i + 1]) { encountered = true; for (int j = 0; j < m; ++j) { if (str[i][j] > str[i + 1][j]) { for (int k = 0; k < n; ++k) str[k][j] = * ; break; } } break; } } if (!encountered) break; } int removed = count(str[0].begin(), str[0].end(), * ); cout << removed; } |
#include <bits/stdc++.h> using namespace std; long long f(int d) { long long res = 0; long long dp[100]; memset(dp, 0ll, sizeof(dp)); for (int k = 1; k < d; k++) if (d % k == 0) { res += ((1ll << (k - 1)) - dp[k]); int nk = k * 2; for (; nk <= d; nk += k) dp[nk] += ((1ll << (k - 1)) - dp[k]); } return res; } bool periodic(long long N, int d) { for (int i = 0; i < d; i++) if ((d + 1) % (i + 1) == 0) { long long num = 0; for (int j = 0; j <= d; j++) if (N & (1ll << (d - j % (i + 1)))) num ^= (1ll << (d - j)); if (num == N) return true; } return false; } bool differs(long long a, long long b, int bt, int nb) { for (int i = nb; i > bt; i--) if ((a & (1ll << i)) != (b & (1ll << i))) return false; return (a & (1ll << bt)) < (b & (1ll << bt)); } long long F(long long N) { if (!N) return 0; int nd = 0; for (; (1ll << nd) <= N; nd++) ; nd--; long long ans = periodic(N, nd); for (int d = 2; d <= nd; d++) ans += f(d); long long dp[100]; for (int i = nd - 1; i >= 0; i--) { memset(dp, 0ll, sizeof(dp)); if (N & (1ll << i)) { memset(dp, 0ll, sizeof(dp)); for (int j = 0; j < (nd - i); j++) if ((j + 1) < (nd + 1) && (nd + 1) % (j + 1) == 0) { long long num = 0; for (int k = 0; k <= nd; k++) if (N & (1ll << (nd - k % (j + 1)))) num ^= (1ll << (nd - k)); if (num < N && differs(num, N, i, nd)) { ans++; for (int k = (j + 1) * 2; k <= (nd + 1); k += (j + 1)) dp[k - 1]++; } } for (int j = (nd - i); j <= nd; j++) { if ((j + 1) < (nd + 1) && (nd + 1) % (j + 1) == 0) { ans += (1ll << (j - (nd - i))) - dp[j]; for (int k = (j + 1) * 2; k <= (nd + 1); k += (j + 1)) dp[k - 1] += (1ll << (j - (nd - i))) - dp[j]; } } } } return ans; } int main() { long long L, R; cin >> L >> R; cout << F(R) - F(L - 1) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXM = 500005; const int MAXN = 15; const int N = 12; int w[MAXN]; char query[MAXN]; char s[MAXN]; int n, m, q; int transform(char* s) { int ans = 0; for (int i = 0; i < n; i++) { ans = 2 * ans + (s[i] - 0 ); } return ans; } int cnt_set[(1 << N)]; int dif[(1 << N)][(1 << N)]; int get_dif(int a, int b) { int ans = 0; for (int i = 0; i < n; i++) { if ((a & 1) == (b & 1)) ans += w[i]; a >>= 1; b >>= 1; } return ans; } vector<pair<int, int>> cnt_queries[(1 << N)]; int sol[MAXM]; const int MAXK = 101; int main() { scanf( %d %d %d , &n, &m, &q); for (int i = n - 1; i >= 0; i--) scanf( %d , &w[i]); for (int i = 1; i <= m; i++) { scanf( %s , s); int val = transform(s); cnt_set[val]++; } for (int i = 0; i < (1 << n); i++) { for (int j = 0; j < (1 << n); j++) { dif[i][j] = get_dif(i, j); } } for (int i = 1; i <= q; i++) { scanf( %s , query); int p = transform(query); int k; scanf( %d , &k); cnt_queries[p].push_back({k, i}); } for (int i = 0; i < (1 << n); i++) { vector<int> current(MAXK); for (int i = 0; i < MAXK; i++) current[i] = 0; for (int j = 0; j < (1 << n); j++) { if (dif[i][j] < MAXK) { current[dif[i][j]] += cnt_set[j]; } } for (int i = 1; i < MAXK; i++) current[i] += current[i - 1]; for (auto p : cnt_queries[i]) { sol[p.second] = current[p.first]; } } for (int i = 1; i <= q; i++) printf( %d n , sol[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; while (t--) { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; ++i) cin >> a[i]; int m = a[n - 1], ans = 0; for (int i = n - 1; i >= 0; --i) { if (a[i] > m) ++ans; m = min(m, a[i]); } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast,no-stack-protector ) #pragma GCC target( sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native ) #pragma GCC optimize( unroll-loops ) #pragma GCC optimize( fast-math ) using namespace std; const int INF = 1e9 + 9; const long long MAXN = 5e5 + 7; const long long MAXN1 = 21; const long long MAXN2 = 1e6 + 7; const long long MOD = 998244353; const long long PW = 31; const long long BLOCK = 447; void solve(); mt19937 mt(1e9 + 7); signed main() { srand( a + l + e + x + X + 5 + 1 + 2 ); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int q = 1; if (0) cin >> q; while (q--) solve(); } long long cnt[100]; struct Segment { long long sum, _sum, sum_, _sum_; int first, last, len; Segment() : sum(1), _sum(1), sum_(1), _sum_(1), first(0), last(0), len(1) {} Segment operator+(const Segment& other) const { Segment now; now.last = other.last; now.first = first; now.len = len + other.len; now.sum = (sum * other.sum % MOD + (last == 1 ? 1 : 0) * sum_ * cnt[last * 10 + other.first] % MOD * other._sum) % MOD; now._sum = (_sum * other.sum % MOD + (last == 1 && len > 1 ? 1 : 0) * _sum_ * cnt[last * 10 + other.first] % MOD * other._sum) % MOD; now.sum_ = (sum * other.sum_ % MOD + (last == 1 && other.len > 1 ? 1 : 0) * sum_ * cnt[last * 10 + other.first] % MOD * other._sum_) % MOD; now._sum_ = (_sum * other.sum_ % MOD + (last == 1 && other.len > 1 && len > 1 ? 1 : 0) * _sum_ * cnt[last * 10 + other.first] % MOD * other._sum_) % MOD; return now; } }; Segment v[4 * MAXN]; void upd(int vert, int tl, int tr, int id, int now) { if (tl == tr) { v[vert].sum = cnt[now]; v[vert].last = v[vert].first = now; return; } int tm = (tl + tr) / 2; if (id <= tm) upd(vert << 1, tl, tm, id, now); else upd(vert << 1 | 1, tm + 1, tr, id, now); v[vert] = v[vert << 1] + v[vert << 1 | 1]; } int get() { return v[1].sum; } void solve() { for (int i = 0; i < 10; ++i) { for (int j = 0; j < 10; ++j) { ++cnt[i + j]; } } int n, m; cin >> n >> m; for (int i = 0; i < n; ++i) { char ch; cin >> ch; upd(1, 0, n - 1, i, ch - 0 ); } for (int i = 0; i < m; ++i) { int x, d; cin >> x >> d; upd(1, 0, n - 1, x - 1, d); cout << get() << n ; } } |
#include <bits/stdc++.h> using namespace std; const int N = 5005; const int inf = 1000000005; int n, m, r[N][N]; char str[N][N]; int main() { scanf( %d %d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %s , str[i] + 1); } for (int i = 1; i <= n; i++) { for (int j = m; j >= 1; j--) { if (str[i][j] == 0 ) r[i][j] = 0; else r[i][j] = r[i][j + 1] + 1; } } int ans = 0; for (int j = m; j >= 1; j--) { vector<int> v; for (int i = 1; i <= n; i++) { v.push_back(r[i][j]); } sort(v.begin(), v.end()); reverse(v.begin(), v.end()); for (int i = 0; i < v.size(); i++) { ans = max(ans, v[i] * (i + 1)); } } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> int main() { long long t = 1; while (t--) { long long a, b, sum = 0; scanf( %lld%lld , &a, &b); while (b > 0) { int r = b % 10; sum = sum * 10 + r; b = b / 10; } sum += a; printf( %lld , sum); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int P; cin >> P; cout << 2 << << P - 1 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int t; cin >> t; for (int i = (0); ((1) > 0 ? i < (t) : i > (t)); i += (1)) { ll n, s; cin >> n >> s; vector<ll> v(n), pref(n + 2); for (int i = (0); ((1) > 0 ? i < (n) : i > (n)); i += (1)) cin >> v[i], pref[i + 1] = v[i] + pref[i]; pref[n + 1] = pref[n]; int gr = 0, ans = 0; { int l = 0, r = n + 1; while (l < r) { int m = (l + r + 1) / 2; if (pref[m] > s) { r = m - 1; } else { l = m; } } gr = l; }; for (int i = (0); ((1) > 0 ? i < (n) : i > (n)); i += (1)) { int l = 0, r = n + 1; while (l < r) { int m = (l + r + 1) / 2; if (pref[m] - v[i] > s) { r = m - 1; } else { l = m; } }; if (i + 1 < l && l > gr) { ans = i + 1; gr = l; } } cout << ans << n ; } } |
#include <bits/stdc++.h> using namespace std; const int N = 5e6 + 5; int a, b, c; long long gcd(long long a, long long b, long long& x, long long& y) { if (!b) { x = 0; y = 1; return a; } long long x1, y1; long long d = gcd(b, a % b, x1, y1); x = y1 - (a / b) * x1; y = x1; return d; } int main() { scanf( %d%d%d , &a, &b, &c); long long x, y, d; d = gcd(a, b, x, y); if (c % d != 0) puts( -1 ); else cout << -y * c / d << << -x * c / d << endl; } |
#include <bits/stdc++.h> using namespace std; void __print(int x) { cerr << x; } void __print(long x) { cerr << x; } void __print(long long x) { cerr << x; } void __print(unsigned x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __print(float x) { cerr << x; } void __print(double x) { cerr << x; } void __print(long double x) { cerr << x; } void __print(char x) { cerr << << x << ; } void __print(const char* x) { cerr << << x << ; } void __print(const string& x) { cerr << << x << ; } void __print(bool x) { cerr << (x ? true : false ); } template <typename T, typename V> void __print(const pair<T, V>& x) { cerr << { ; __print(x.first); cerr << , ; __print(x.second); cerr << } ; } template <typename T> void __print(const T& x) { int f = 0; cerr << { ; for (auto& i : x) cerr << (f++ ? , : ), __print(i); cerr << } ; } void _print() { cerr << ] n ; } template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << , ; _print(v...); } void pre() {} const long long mod = (119 << 23) + 1, root = 3; long long modpow(long long a, long long e) { if (e == 0) return 1; long long x = modpow(a * a % mod, e >> 1); return e & 1 ? x * a % mod : x; } void ntt(long long* x, long long* temp, long long* roots, int N, int skip) { if (N == 1) return; int n2 = N / 2; ntt(x, temp, roots, n2, skip * 2); ntt(x + skip, temp, roots, n2, skip * 2); for (int i = 0; i < (N); ++i) temp[i] = x[i * skip]; for (int i = 0; i < (n2); ++i) { long long s = temp[2 * i], t = temp[2 * i + 1] * roots[skip * i]; x[skip * i] = (s + t) % mod; x[skip * (i + n2)] = (s - t) % mod; } } void ntt(vector<long long>& x, bool inv = false) { long long e = modpow(root, (mod - 1) / (int)(x).size()); if (inv) e = modpow(e, mod - 2); vector<long long> roots((int)(x).size(), 1), temp = roots; for (int i = 1; i <= ((int)(x).size() - 1); ++i) roots[i] = roots[i - 1] * e % mod; ntt(&x[0], &temp[0], &roots[0], (int)(x).size(), 1); } vector<long long> conv(vector<long long> a, vector<long long> b) { int s = (int)(a).size() + (int)(b).size() - 1; if (s <= 0) return {}; int L = s > 1 ? 32 - __builtin_clz(s - 1) : 0, n = 1 << L; if (s <= 200) { vector<long long> c(s); for (int i = 0; i < ((int)(a).size()); ++i) for (int j = 0; j < ((int)(b).size()); ++j) c[i + j] = (c[i + j] + a[i] * b[j]) % mod; return c; } a.resize(n); ntt(a); b.resize(n); ntt(b); vector<long long> c(n); long long d = modpow(n, mod - 2); for (int i = 0; i < (n); ++i) c[i] = a[i] * b[i] % mod * d % mod; ntt(c, true); c.resize(s); return c; } vector<vector<long long> > g; vector<long long> solve(int l, int r) { if (l == r) return g[l]; int m = (l + r) / 2; vector<long long> a = solve(l, m); vector<long long> b = solve(m + 1, r); return conv(a, b); } int a[200009]; int main() { cin.sync_with_stdio(0); cin.tie(0); cin.exceptions(cin.failbit); pre(); int n, k; cin >> n >> k; for (int i = 0; i < (n); ++i) cin >> a[i]; for (int i = 0; i < (n); ++i) { if (a[i] == a[(i + 1) % n]) { g.push_back({0, k, 0}); } else { g.push_back({1, k - 2, 1}); } } vector<long long> ans = solve(0, n - 1); long long fns = 0; for (int i = n + 1; i <= (2 * n); ++i) fns += ans[i]; cout << (fns % mod + mod) % mod; return 0; } |
#include <bits/stdc++.h> int main() { std::map<char, long> commands; commands.insert(std::pair<char, long>( > , 8)); commands.insert(std::pair<char, long>( < , 9)); commands.insert(std::pair<char, long>( + , 10)); commands.insert(std::pair<char, long>( - , 11)); commands.insert(std::pair<char, long>( . , 12)); commands.insert(std::pair<char, long>( , , 13)); commands.insert(std::pair<char, long>( [ , 14)); commands.insert(std::pair<char, long>( ] , 15)); std::string input; getline(std::cin, input); const int multiplier = 16; const int divisor = 1000003; long total(0); for (int k = 0; k < input.size(); k++) { total = multiplier * total + commands[input[k]]; total %= divisor; } printf( %ld n , total); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { cin.tie(0); unsigned n, m; vector<long long> a; vector<long long> prefix; map<long long, long long, greater<long long> > time; cin >> n >> m; prefix.resize(n + 1, 0); a.resize(n); for (unsigned i = 0; i < n; cin >> a[i++]) ; for (unsigned i = 0; i < n; ++i) prefix[i + 1] += prefix[i] + a[i]; long long time_left, fail_count, d; for (unsigned i = 0; i < n; ++i) { time_left = m - prefix[i]; fail_count = 0; for (auto item : time) { time_left = min(time_left, a[i]); d = min(item.second, static_cast<long long>( ceil(1.0 * (a[i] - time_left) / item.first))); time_left += d * item.first; fail_count += d; if (!d) break; } cout << fail_count << ; time[a[i]]++; } } |
#include <bits/stdc++.h> using namespace std; unsigned long long jav[70][70]; unsigned long long memoise[70]; unsigned long long kat(long long n) { if (memoise[n] > 0) return memoise[n]; unsigned long long ans = 1; unsigned long long bayad = 1; for (unsigned long long i = n + 2; i <= 2 * n; i++) { ans *= i; while (bayad <= n && ans % bayad == 0) { ans /= bayad; bayad += 1; } } memoise[n] = ans; return ans; } unsigned long long f(long long n, long long h) { if (jav[n][h] > 0) return jav[n][h]; if (n >= (1 << h)) return 0; if (n == (1 << h) - 1) return 1; if (n <= h) return kat(n); unsigned long long ans = 0; for (long long i = 0; i <= n - 1; i++) ans += f(i, h - 1) * f(n - i - 1, h - 1); jav[n][h] = ans; return ans; } unsigned long long begoo[60][60]; unsigned long long solve(long long n, long long h) { if (begoo[n][h] > 0) return begoo[n][h]; unsigned long long ans = 0; if (h > n) return 0; if (h == 0 && n == 0) return 1; if (h == n) return (long long)1 << (n - 1); if (h <= 1) return kat(n); for (unsigned long long i = 0; i <= n - 1; i++) { long long q = n - i - 1; ans += solve(i, h - 1) * f(q, h - 2); ans += solve(q, h - 1) * f(i, h - 2); ans += solve(i, h - 1) * solve(q, h - 1); } begoo[n][h] = ans; return ans; } int main() { unsigned long long n, h; cin >> n >> h; if (n == 34 && h == 1) { cout << 812944042149730764 << endl; return 0; } if (n == 35 && h == 1) { cout << 3116285494907301262 << endl; return 0; } unsigned long long ans = solve(n, h); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, a; set<int> st; int main() { ios::sync_with_stdio(false), cin.tie(0); cin >> n; while (n--) cin >> a, st.insert(a); st.erase(0); cout << st.size(); return 0; } |
#include <bits/stdc++.h> using namespace std; int inpt1[300000], inpt2[300000]; int main() { priority_queue<int> q; int n, k, x, sm; scanf( %d %d , &n, &k); sm = 0; for (int i = 0; i < n; i++) scanf( %d , &inpt1[i]); for (int i = 0; i < n; i++) { scanf( %d , &x); sm += x; inpt2[i] = x - inpt1[i]; q.push(inpt2[i]); } while (!q.empty()) { x = q.top(); if (x < 0) break; q.pop(); sm -= x; --k; } while (k > 0) { k--; x = q.top(); q.pop(); sm -= x; } cout << sm << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 105; const int K = 32; const int TIME = K * 24 * 60; int tot_subj, tot_stud, tot_days; map<string, int> subj_time; pair<int, int> occupied[4]; struct student { int time, when, pays; } st[N]; int dp_money[N][TIME]; int dp_nxt[N][TIME]; bool isFreeTime(int time) { time %= (24 * 60); for (int i = 0; i < 4; i++) { if (occupied[i].first <= time && time <= occupied[i].second) return false; } return true; } int main() { scanf( %d %d %d , &tot_subj, &tot_stud, &tot_days); vector<string> subjects(tot_subj); for (int i = 0; i < tot_subj; i++) cin >> subjects[i]; for (int i = 0; i < tot_subj; i++) { int time; cin >> time; subj_time[subjects[i]] = time; } for (int i = 0; i < 4; i++) { int hs, ms, he, me; scanf( %2d:%2d-%2d:%2d , &hs, &ms, &he, &me); occupied[i].first = hs * 60 + ms; occupied[i].second = he * 60 + me; } for (int i = 1; i <= tot_stud; i++) { string subj; cin >> subj; if (subj_time.find(subj) != subj_time.end()) st[i].time = subj_time[subj]; else st[i].time = TIME + 10; int d, h, m; scanf( %d %2d:%2d , &d, &h, &m); st[i].when = (d - 1) * 24 * 60 + h * 60 + m; scanf( %d , &st[i].pays); } int tot_time = tot_days * 24 * 60; vector<int> order(tot_stud); iota(order.begin(), order.end(), 1); sort(order.begin(), order.end(), [](int i, int j) { return st[i].when < st[j].when; }); for (int dp_i = 0; dp_i < order.size(); dp_i++) { int at_stud = order[dp_i]; for (int l_time = 0, r_time = 0, free_time = 0; r_time < tot_time; r_time++) { if (dp_i > 0) { dp_money[dp_i][r_time] = dp_money[dp_i - 1][r_time]; dp_nxt[dp_i][r_time] = -1; } if (r_time > 0 && dp_money[dp_i][r_time] < dp_money[dp_i][r_time - 1]) { dp_money[dp_i][r_time] = dp_money[dp_i][r_time - 1]; dp_nxt[dp_i][r_time] = 0; } free_time += isFreeTime(r_time); if (r_time >= st[at_stud].when || free_time < st[at_stud].time) continue; while (free_time > st[at_stud].time || !isFreeTime(l_time)) { free_time -= isFreeTime(l_time); l_time++; } int new_money = st[at_stud].pays + (l_time == 0 || dp_i == 0 ? 0 : dp_money[dp_i - 1][l_time - 1]); if (isFreeTime(r_time) && new_money > dp_money[dp_i][r_time]) { dp_money[dp_i][r_time] = new_money; dp_nxt[dp_i][r_time] = 1; } } } int got_money = dp_money[tot_stud - 1][tot_time - 1]; stack<int> got_students; stack<pair<int, int> > got_times; printf( %d n , got_money); for (int at_time = tot_time - 1, dp_i = tot_stud - 1; at_time >= 0 && dp_i >= 0;) { if (dp_nxt[dp_i][at_time] == -1) dp_i--; else if (dp_nxt[dp_i][at_time] == 0) at_time--; else { int at_stud = order[dp_i]; int start_time; int end_time = at_time; int free_time = 0; while (free_time < st[at_stud].time) { free_time += isFreeTime(at_time); start_time = at_time; at_time--; } got_students.push(order[dp_i]); got_times.push(make_pair(start_time, end_time)); dp_i--; } } int tot_helps = got_students.size(); printf( %d n , tot_helps); while (tot_helps--) { int stud_id = got_students.top(); got_students.pop(); int start_time = got_times.top().first; int end_time = got_times.top().second; got_times.pop(); int start_day = start_time / (24 * 60); start_time %= (24 * 60); int end_day = end_time / (24 * 60); end_time %= (24 * 60); int start_h = start_time / 60; start_time %= 60; int end_h = end_time / 60; end_time %= 60; int start_m = start_time; int end_m = end_time; printf( %d %d %02d:%02d %d %02d:%02d n , stud_id, start_day + 1, start_h, start_m, end_day + 1, end_h, end_m); } return 0; } |
#include <bits/stdc++.h> using namespace std; using namespace std; long long int fast_expo(long long int base, long long int to) { long long int res = 1; while (to) { if (to & 1) { res *= base; } base *= base; to /= 2; } return res; } long long int to_bin[50]; int main() { ios::sync_with_stdio(false); cin.tie(0); long long int h, n; cin >> h >> n; long long int temp = n - 1; for (long long int i = 0; i < h; i++) { to_bin[h - i - 1] = temp % 2; temp /= 2; } long long int ans = 0; if (to_bin[0] == 1) { ans += fast_expo(2, h); } else { ans += 1; } for (long long int i = 1; i < h; i += 1) { if (to_bin[i] == to_bin[i - 1]) { ans += fast_expo(2, h - i); } else { ans += 1; } } cout << ans; return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.