Datasets:
malteklaes
/
cpp-code-code_search_net-style

Dataset card Data Studio Files Community
1
func_code_string
stringlengths
59
71.4k
#include <bits/stdc++.h> #pragma GCC optimize ( O3 ) #pragma GCC optimize ( Ofast ) using namespace std; #define int int64_t #define SQ(a) (a)*(a) const int INF = 1e15; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, m; cin >> n >> m; vector<vector<pair<int, int>>> g(n); for (int i = 0, a, b, c; i < m; i++) { cin >> a >> b >> c; a--, b--; g[a].push_back({b, c}); g[b].push_back({a, c}); } vector<int> deven(n, INF); vector<vector<int>> dodd(51, vector<int> (n, INF)); deven[0] = 0; priority_queue<array<int, 3>> Q; // {dist, v, (-1 OR w_last)} Q.push({0, 0, -1}); vector<vector<bool>> vis(52, vector<bool> (n)); while (!Q.empty()) { int d = -Q.top()[0]; int v = Q.top()[1]; int lw= Q.top()[2]; Q.pop(); if (vis[lw + 1][v]) continue; vis[lw + 1][v] = true; if (lw == -1) { // even steps for (auto [u, w] : g[v]) { if (dodd[w][u] > d) { dodd[w][u] = d; Q.push({-d, u, w}); } } } else { for (auto [u, w] : g[v]) { if (deven[u] > d + SQ(lw + w)) { deven[u] = d + SQ(lw + w); Q.push({-deven[u], u, -1}); } } } } for (int i = 0; i < n; i++) cout << (deven[i] == INF ? -1 : deven[i]) << ; cout << n ; }
#include <bits/stdc++.h> using namespace std; int main(int argc, const char* argv[]) { int n; cin >> n; int a[n]; int b[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < n; i++) { cin >> b[i]; } long long mx = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { long long an = 0; long long bn = 0; for (int t = i; t <= j; t++) { an = an | a[t]; bn = bn | b[t]; } if (an + bn > mx) { mx = an + bn; } } } cout << mx; }
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int mod = 1e9 + 7; const int N = 1e5 + 5; long long a[N], b[N]; long long n, h; bool cmp(int a, int b) { return a > b; } long long judge(int index) { for (int i = 0; i <= index; i++) { b[i] = a[i]; } sort(b, b + index + 1, cmp); long long sum; if (index % 2 == 0) sum = b[index], index--; else sum = 0; for (int i = 0; i <= index; i += 2) { sum += b[i]; } if (sum <= h) return 1; else return 0; } int main() { std::ios::sync_with_stdio(false); cin >> n >> h; for (int i = 0; i < n; i++) { cin >> a[i]; } int l = 0, r = n - 1; long long res; while (l <= r) { int mid = (l + r) / 2; if (judge(mid)) { l = mid + 1; res = mid; } else { r = mid - 1; } } cout << res + 1 << n ; return 0; }
#include <bits/stdc++.h> using namespace std; signed long long int a[100000 + 5], b[100000 + 5]; int n, m; signed long long int func(signed long long int x) { signed long long int ans = 0; for (int i = 1; i <= n; ++i) { if (a[i] < x) ans += x - a[i]; } for (int i = 1; i <= m; ++i) { if (x < b[i]) ans += b[i] - x; } return ans; } signed long long int ter(signed long long int i, signed long long int j) { if (i == j) return i; if (j - i == 2) { signed long long int mi = j - 1; if (func(mi) < func(i) && func(mi) < func(j)) return mi; if (func(i) < func(j) && func(i) < func(mi)) return i; return j; } signed long long int l, r; l = i + (j - i) / 3; r = j - (j - i) / 3; if (func(l) > func(r)) return ter(l, j); else return ter(i, r); } int main() { cin >> n >> m; for (int i = 1; i <= n; ++i) cin >> a[i]; for (int i = 1; i <= m; ++i) cin >> b[i]; cout << func(ter(0, 2 * 1000000007 + 1)); }
#include <bits/stdc++.h> using namespace std; int n; int a[120000]; void query(int L, int R) { int M = (L + R) / 2; printf( ? %d n , M); fflush(stdout); printf( ? %d n , n / 2 + M); fflush(stdout); scanf( %d %d , a + M, a + M + n / 2); if (a[M] == a[n / 2 + M]) { printf( ! %d n , M); fflush(stdout); return; } if (((a[M + n / 2] - a[M]) < 0) ^ ((a[L + n / 2] - a[L]) < 0)) query(L, M); else query(M, R); } int main() { scanf( %d , &n); if (n % 4) { printf( ! -1 n ); fflush(stdout); return 0; } printf( ? 1 n ); fflush(stdout); printf( ? %d n , n / 2 + 1); fflush(stdout); scanf( %d %d , a + 1, a + n / 2 + 1); if (a[1] == a[n / 2 + 1]) { printf( ! %d n , 1); fflush(stdout); return 0; } printf( ? %d n , n / 2); fflush(stdout); printf( ? %d n , n); fflush(stdout); scanf( %d %d , a + n / 2, a + n); if (a[n / 2] == a[n]) { printf( ! %d n , n / 2); fflush(stdout); return 0; } query(1, n / 2); }
#include <bits/stdc++.h> using namespace std; long long readi() { long long input = 0; char c = ; while (c < - ) { c = getchar(); } bool negative = false; if (c == - ) { negative = true; c = getchar(); } while (c >= 0 ) { input = 10 * input + (c - 0 ); c = getchar(); } if (negative) { input = -input; } return input; } void printi(long long output) { if (output == 0) { putchar( 0 ); return; } if (output < 0) { putchar( - ); output = -output; } int aout[20]; int ilen = 0; while (output) { aout[ilen] = ((output % 10)); output /= 10; ilen++; } for (int i = ilen - 1; i >= 0; i--) { putchar(aout[i] + 0 ); } return; } string reads() { string input = ; char c = ; while (c <= ) { c = getchar(); } while (c > ) { input += c; c = getchar(); } return input; } void prints(string output) { for (int i = 0; i < output.length(); i++) { putchar(output[i]); } return; } long long getrand() { long long rand1 = (rand() % 536870912); long long rand2 = (rand() % 536870912); return (rand1 * 536870912ll + rand2); } int N; long long arr[5][1010]; bool bad[1010]; int ans; long long scalar(long long a, long long b, long long c) { long long res = 0ll; for (long long i = 0; i < 5; i++) { res += ((arr[i][b] - arr[i][a]) * (arr[i][c] - arr[i][a])); } return res; } int32_t main() { srand(time(NULL)); cout << fixed << setprecision(10); cerr << fixed << setprecision(10); ios_base::sync_with_stdio(false); if (fopen( cf850a.in , r )) { freopen( cf850a.in , r , stdin); } cin >> N; for (int i = 0; i < N; i++) { for (int j = 0; j < 5; j++) { cin >> arr[j][i]; } } if (N >= 100) { cout << 0 n ; return 0; } for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { if (j == i) { continue; } for (int k = j + 1; k < N; k++) { if (k == i) { continue; } if (scalar(i, j, k) > 0) { bad[i] = true; } } } } for (int i = 0; i < N; i++) { if (!bad[i]) { ans++; } } cout << ans << n ; for (int i = 0; i < N; i++) { if (!bad[i]) { cout << i + 1 << n ; } } return 0; }
#include <bits/stdc++.h> void mergesort(char z[], int left, int right) { char temp[1000]; if (left >= right) { return; } int mid = (left + right) / 2; mergesort(z, left, mid); mergesort(z, mid + 1, right); int lenl = mid; int lenr = right; int i = left, j = mid + 1, k = left; while (i <= lenl && j <= lenr) { if (z[i] >= z[j]) { temp[k] = z[i]; k++; i++; } else { temp[k] = z[j]; k++; j++; } } while (i <= lenl) { temp[k] = z[i]; k++; i++; } while (j <= lenr) { temp[k] = z[j]; k++; j++; } for (int i = left; i <= right; i++) { z[i] = temp[i]; } } int main() { int a, b, c, d, e, f, g, h; char z[1000]; scanf( %d , &a); getchar(); for (int i = 0; i < a; i++) { scanf( %s , z); getchar(); b = strlen(z); mergesort(z, 0, b - 1); if (b == 1) { printf( YES n ); } else { for (int j = 0; j < b - 1; j++) { if ((z[j] - z[j + 1]) == 1) { } else { printf( NO n ); break; } if (j == b - 2) { printf( YES n ); } } } } return 0; }
#include <bits/stdc++.h> using namespace std; int n, m; string s; vector<int> q; int mo[] = {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; int h, w; int data(int x, int y) { int tmp = 0; for (int i = 0; i < x - 1; i++) tmp += mo[i]; return tmp + y; } int cal(int x, int y, int z) { return x * 60 * 60 + y * 60 + z; } int getpos(string s) { int p = data((s[5] - 0 ) * 10 + s[6] - 0 , (s[8] - 0 ) * 10 + s[9] - 0 ); int res = (p - 1) * 24 * 60 * 60; res += cal((s[11] - 0 ) * 10 + s[12] - 0 , (s[14] - 0 ) * 10 + s[15] - 0 , (s[17] - 0 ) * 10 + s[18] - 0 ); return res; } int main() { cin >> n >> m; h = 0; getline(cin, s); while (getline(cin, s)) { int t = getpos(s); q.push_back(t); while (h < q.size() && t - q[h] >= n) h++; if (q.size() - h >= m) { for (int i = 0; i <= 18; i++) cout << s[i]; cout << endl; return 0; } } cout << -1 << endl; return 0; }
#include <bits/stdc++.h> template <typename _Tp> void read(_Tp &x) { char ch(getchar()); bool f(false); while (!isdigit(ch)) f |= ch == 45, ch = getchar(); x = ch & 15, ch = getchar(); while (isdigit(ch)) x = x * 10 + (ch & 15), ch = getchar(); if (f) x = -x; } template <typename _Tp, typename... Args> void read(_Tp &t, Args &...args) { read(t); read(args...); } const int N = 100005, mod = 1000000007; template <typename _Tp1, typename _Tp2> inline void add(_Tp1 &a, _Tp2 b) { (a += b) >= mod && (a -= mod); } template <typename _Tp1, typename _Tp2> inline void sub(_Tp1 &a, _Tp2 b) { (a -= b) < 0 && (a += mod); } long long ksm(long long a, long long b = mod - 2) { long long res = 1; while (b) { if (b & 1) res = res * a % mod; a = a * a % mod, b >>= 1; } return res; } long long fac[N], inv[N], ifac[N]; void init() { fac[0] = fac[1] = inv[0] = inv[1] = ifac[0] = ifac[1] = 1; for (int i = 2; i < N; ++i) fac[i] = fac[i - 1] * i % mod, inv[i] = inv[mod % i] * (mod - mod / i) % mod, ifac[i] = ifac[i - 1] * inv[i] % mod; } inline long long C(int n, int m) { return n < m || m < 0 ? 0 : fac[n] * ifac[m] % mod * ifac[n - m] % mod; } int f[N]; std::map<int, int> mp; int cnt[N], pw[N]; int main() { init(); int n, k; read(n, k); for (int i = 0; i <= n; ++i) pw[i] = ksm(k - 1, i); f[0] = 0; for (int i = 0; i < n; ++i) f[i + 1] = (1LL * (k - 1) * i % mod * f[i] % mod + 1) * inv[n - i] % mod; for (int i = 1; i <= n; ++i) add(f[i], f[i - 1]); int a = 0, s = 0; for (int i = 1, x; i <= n; ++i) { read(x); if (x != -1) ++mp[x]; else ++a; } for (auto it : mp) ++cnt[it.second]; cnt[0] += k - mp.size(); for (int i = 0; i <= n; ++i) if (cnt[i]) { int tmp = 0; for (int j = 0; j <= a; ++j) add(tmp, 1LL * f[i + j] * C(a, j) % mod * pw[a - j] % mod); add(s, 1LL * tmp * cnt[i] % mod); } s = ksm(k, mod - 1 - a) * s % mod; printf( %lld n , 1LL * (f[n] - s + mod) * n % mod); return 0; }
/* Author: QAQAutoMaton Lang: C++ Code: C.cpp Mail: [email protected] Blog: https://www.qaq-am.com/ */ #include<bits/stdc++.h> #define debug(...) fprintf(stderr,__VA_ARGS__) #define DEBUG printf( Passing [%s] in LINE %d n ,__FUNCTION__,__LINE__) #define Debug debug( Passing [%s] in LINE %d n ,__FUNCTION__,__LINE__) #define all(x) x.begin(),x.end() #define x first #define y second using namespace std; typedef unsigned uint; typedef long long ll; typedef unsigned long long ull; typedef complex<double> cp; typedef pair<int,int> pii; int inf; const double eps=1e-8; const double pi=acos(-1.0); template<class T,class T2>int chkmin(T &a,T2 b){return a>b?a=b,1:0;} template<class T,class T2>int chkmax(T &a,T2 b){return a<b?a=b,1:0;} template<class T>T sqr(T a){return a*a;} template<class T,class T2>T mmin(T a,T2 b){return a<b?a:b;} template<class T,class T2>T mmax(T a,T2 b){return a>b?a:b;} template<class T>T aabs(T a){return a<0?-a:a;} template<class T>int dcmp(T a,T b){return a>b;} template<int *a>int cmp_a(int x,int y){return a[x]<a[y];} template<class T>bool sort2(T &a,T &b){return a>b?swap(a,b),1:0;} #define min mmin #define max mmax #define abs aabs struct __INIT__{ __INIT__(){ fill((unsigned char*)&inf,(unsigned char*)&inf+sizeof(inf),0x3f); } }__INIT___; namespace io { const int SIZE = (1 << 21) + 1; char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55]; int f, qr; // getchar #define gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS ++)) : *iS ++) // print the remaining part inline void flush () { fwrite (obuf, 1, oS - obuf, stdout); oS = obuf; } // putchar inline void putc (char x) { *oS ++ = x; if (oS == oT) flush (); } template<typename A> inline bool read (A &x) { for (f = 1, c = gc(); c < 0 || c > 9 ; c = gc()) if (c == - ) f = -1;else if(c==EOF)return 0; for (x = 0; c <= 9 && c >= 0 ; c = gc()) x = x * 10 + (c & 15); x *= f; return 1; } inline bool read (char &x) { while((x=gc())== ||x== n || x== r ); return x!=EOF; } inline bool read(char *x){ while((*x=gc())== n || *x== ||*x== r ); if(*x==EOF)return 0; while(!(*x== n ||*x== ||*x== r ||*x==EOF))*(++x)=gc(); *x=0; return 1; } template<typename A,typename ...B> inline bool read(A &x,B &...y){ return read(x)&&read(y...); } template<typename A> inline bool write (A x) { if (!x) putc ( 0 ); if (x < 0) putc ( - ), x = -x; while (x) qu[++ qr] = x % 10 + 0 , x /= 10; while (qr) putc (qu[qr --]); return 0; } inline bool write (char x) { putc(x); return 0; } inline bool write(const char *x){ while(*x){putc(*x);++x;} return 0; } inline bool write(char *x){ while(*x){putc(*x);++x;} return 0; } template<typename A,typename ...B> inline bool write(A x,B ...y){ return write(x)||write(y...); } //no need to call flush at the end manually! struct Flusher_ {~Flusher_(){flush();}}io_flusher_; } using io :: read; using io :: putc; using io :: write; char s[100005]; int p[1005],q[1005],rp[1005]; int t1,t2,t3,t4,t5,t6; int a[1005][1005],b[1005][1005]; int v[4]; signed main(){ #ifdef QAQAutoMaton freopen( C.in , r ,stdin); freopen( C.out , w ,stdout); #endif int t; read(t); for(;t;--t){ int n,m; read(n,m); for(int i=0;i<n;++i)for(int j=0;j<n;++j){ read(a[i][j]); --a[i][j]; } read(s+1); pii x={1,0},y={2,0},z={3,0}; for(int i=1;i<=m;++i){ switch(s[i]){ case R :++y.y;break; case L :--y.y;break; case D :++x.y;break; case U :--x.y;break; case I :swap(y,z);break; case C :swap(x,z);break; } } ((x.y%=n)+=n)%=n; ((y.y%=n)+=n)%=n; ((z.y%=n)+=n)%=n; for(int i=0;i<n;++i){ for(int j=0;j<n;++j){ v[1]=i;v[2]=j;v[3]=a[i][j]; b[(v[x.x]+x.y)%n][(v[y.x]+y.y)%n]=(v[z.x]+z.y)%n; } } for(int i=0;i<n;++i)for(int j=0;j<n;++j)write(b[i][j]+1,j==n-1? n : ); putc( n ); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, bx, x; long long X = 0; cin >> n >> bx; for (int i = 1; i <= n; i++) { cin >> x; X += x * pow(bx, n - i); } int m, by, y; long long Y = 0; cin >> m >> by; for (int i = 1; i <= m; i++) { cin >> y; Y += y * pow(by, m - i); } if (X == Y) { cout << = ; return 0; } if (X > Y) { cout << > ; return 0; } cout << < ; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long x; cin >> x; while (x--) { string str; cin >> str; long long n, b, m, v, finl, finl2; finl2 = 0; v = 0; b = 0; m = 0; v = 0; for (n = 0; n < str.size(); n++) { finl = (int)str[n] - 48; if (finl == 0) b++; else if (finl % 2 == 0) m++; finl2 = finl + finl2; } if (finl2 % 3 == 0) v = 1; if (b >= 2 && v == 1 || b >= 1 && m >= 1 && v == 1) cout << red ; else cout << cyan ; cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, si, mi, t; cin >> n; for (int i = 0; i < n; i++) { cin >> t; if (t == 1) { si = i; } if (t == n) { mi = i; } } if (si < mi) { cout << max(mi, n - 1 - si); } else { cout << max(si, n - 1 - mi); } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 50005; long long num[maxn]; int main() { long long sum = 0, ans = 0; int n; scanf( %d , &n); for (int i = 0; i < n; i++) cin >> num[i], sum += num[i]; if (n == 0) { cout << 0 << endl; return 0; } sum = sum / n; for (int i = 0; i < n - 1; i++) { if (num[i] < sum) { ans += sum - num[i]; num[i + 1] -= (sum - num[i]); } else if (num[i] > sum) { ans += num[i] - sum; num[i + 1] += num[i] - sum; } num[i] = sum; } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; void mohammed() { ios::sync_with_stdio(0); ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0); } int main() { mohammed(); int n, x, y; map<int, int> mp; cin >> n; for (int i = 0; i < n; i++) { cin >> x >> y; mp[x]++; mp[y + 1]--; } x = 0; for (map<int, int>::iterator it = mp.begin(); it != mp.end(); it++) { it->second += x; if (it->second > 2) return cout << NO n , 0; x = it->second; } cout << YES n ; return 0; }
#include <bits/stdc++.h> using namespace std; int n, k; long long l; long long mo = 998244353; long long A[4005][4005][2]; long long B[4005]; long long a, b; long long f(long long x, long long y) { long long mid = 1; while (y) { if (y & 1) { mid = mid * x % mo; } x = x * x % mo; y >>= 1; } return mid; } int main() { cin >> n >> k >> l; A[0][0][0] = 1; for (int i = 0; i <= 2 * n; i++) { for (int j = 0; j <= i; j++) { A[i + 1][j + 1][0] = (A[i + 1][j + 1][0] + A[i][j][0]) % mo; A[i + 1][j + 1][1] = (A[i + 1][j + 1][1] + A[i][j][1]) % mo; if (j) { A[i + 1][j - 1][0] = (A[i + 1][j - 1][0] + A[i][j][0] * j) % mo; A[i + 1][j - 1][1] = (A[i + 1][j - 1][1] + A[i][j][1] * j) % mo; } if (j >= k) { A[i + 1][j][1] = (A[i + 1][j][1] + A[i][j][0]) % mo; } } } B[0] = 1; for (int i = 1; i <= n * 2 + 1; i++) { B[i] = B[i - 1] * i % mo; } a = A[2 * n + 1][0][1] * B[n] % mo * f(2, n) % mo; b = f(B[2 * n + 1], mo - 2) * l % mo; cout << a * b % mo << endl; }
#include <bits/stdc++.h> using namespace std; const int MAX_N = (int)2e5 + 7; long long dp[MAX_N]; long long num[MAX_N][2]; long long dist[MAX_N][2]; vector<int> a[MAX_N]; long long ans = 0; void go(int v, int pr = -1) { ++num[v][0]; for (int to : a[v]) { if (to == pr) continue; go(to, v); for (int i = 0; i < 2; ++i) for (int j = 0; j < 2; ++j) { ans += dist[v][i] * num[to][j] + dist[to][j] * num[v][i]; if (!i && !j) { ans += num[to][j] * num[v][i]; } } num[v][0] += num[to][1]; dist[v][0] += dist[to][1]; num[v][1] += num[to][0]; dist[v][1] += dist[to][0] + num[to][0]; } } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; for (int i = 0; i < n - 1; ++i) { int x, y; cin >> x >> y; --x; --y; a[x].push_back(y); a[y].push_back(x); } go(0); cout << ans << n ; }
#include <bits/stdc++.h> using namespace std; const int maxlongint = 2147483647; const int inf = 1000000000; int main() { int a, b, c, d, e, f, ans = 0, k = -1, n1, n2; cin >> a >> b >> c >> d >> e >> f; ans = a * b + c * d + e * f; for (n1 = 1; n1 <= 1000; n1++) if (n1 * n1 == ans) { k = n1; break; } if (k == -1) { cout << -1 << endl; return 0; } if (b == k) swap(a, b); if (d == k) swap(c, d); if (f == k) swap(e, f); if (a == k && c == k && e == k) { cout << k << endl; for (n1 = 1; n1 <= b; n1++) { for (n2 = 1; n2 <= k; n2++) putchar( A ); printf( n ); } for (n1 = 1; n1 <= d; n1++) { for (n2 = 1; n2 <= k; n2++) putchar( B ); printf( n ); } for (n1 = 1; n1 <= f; n1++) { for (n2 = 1; n2 <= k; n2++) putchar( C ); printf( n ); } return 0; } int sd = 0; if (c == k) { sd = 1; swap(a, c); swap(b, d); } else if (e == k) { sd = 2; swap(a, e); swap(b, f); } if (a != k) { cout << -1 << endl; return 0; } if (d == k - b) swap(c, d); if (f == k - b) swap(e, f); if (c != k - b || e != k - b) { cout << -1 << endl; return 0; } { cout << k << endl; for (n1 = 1; n1 <= b; n1++) { for (n2 = 1; n2 <= k; n2++) putchar( A + sd); printf( n ); } for (n1 = 1; n1 <= k - b; n1++) { if (sd != 1) for (n2 = 1; n2 <= d; n2++) putchar( B ); else for (n2 = 1; n2 <= d; n2++) putchar( A ); if (sd != 2) for (n2 = 1; n2 <= f; n2++) putchar( C ); else for (n2 = 1; n2 <= f; n2++) putchar( A ); printf( n ); } return 0; } }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> v(n); multiset<int> list; for (int i = 0; i < n; i++) { cin >> v[i]; } for (int i = 0; i < n; i++) { int x; cin >> x; list.insert(x); } for (int i = 0; i < n; ++i) { auto current = list.lower_bound(n - v[i]); if (current == list.end()) { current = list.begin(); } cout << (v[i] + *current) % n << ; list.erase(current); } }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; struct edge { int u, v; int adj(int x) { return u + v - x; } }; int n, c[N]; vector<int> adj[N]; vector<edge> e; int lvl[N], pre[N], root; vector<int> cycle; void dfs1(int u) { for (auto ind : adj[u]) if (ind != pre[u]) { auto ei = e[ind]; int v = ei.adj(u); if (lvl[v]) { if ((lvl[u] + lvl[v]) % 2 == 0 && cycle.empty()) { for (int w = u; w != v; w = e[pre[w]].adj(w)) cycle.push_back(pre[w]); reverse((cycle).begin(), (cycle).end()); cycle.push_back(ind); root = v; } } else { lvl[v] = lvl[u] + 1; pre[v] = ind; dfs1(v); } } } long long int ans[N]; bool vis[N]; long long int dfs2(int u, int pre) { if (vis[u]) return 0; vis[u] = 1; long long int sum = 0; for (auto ind : adj[u]) if (ind != pre) { int v = e[ind].adj(u); sum += dfs2(v, ind); } if (pre != -1) ans[pre] = c[u] - sum; return c[u] - sum; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int m; cin >> n >> m; for (int i = 0; i < (int)(n); i++) cin >> c[i]; e.resize(m); for (int i = 0; i < (int)(m); i++) { cin >> e[i].u >> e[i].v; e[i].u--; e[i].v--; adj[e[i].u].push_back(i); adj[e[i].v].push_back(i); } bool ok = 1; for (int u = 0; u < (int)(n); u++) if (!lvl[u]) { cycle.clear(); lvl[u] = 1; pre[u] = -1; dfs1(u); if (cycle.empty()) { ok &= dfs2(u, -1) == 0; } else { auto delta = dfs2(root, -1) / 2; for (auto ind : cycle) { ans[ind] += delta; delta = -delta; } } } if (ok) { cout << YES n ; for (int i = 0; i < (int)(m); i++) cout << ans[i] << n ; } else cout << NO n ; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { cout << setprecision(10); ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; for (int i = 1; i <= n; i++) { int x; cin >> x; if (x == 1) { cout << HARD n ; return 0; } } cout << EASY n ; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 41, K = 11; bitset<40> a[N]; vector<int> steps[K]; int n, k; bool ok = true; void go(int pos, bitset<40> is_one, bitset<40> is_question) { if (pos == k) { if (is_question != 0) { ok = false; return; } int ones = is_one.count(); if (is_one != a[ones]) { ok = false; return; } return; } int ones = 0, zeros = 0, questions = 0; for (int i : steps[pos]) { if (is_question[i]) { questions++; } else if (is_one[i]) { ones++; } else { zeros++; } is_question[i] = 0; is_one[i] = 1; } for (int i = 0; i < zeros; i++) { is_one[steps[pos][i]] = 0; } go(pos + 1, is_one, is_question); for (int i = zeros; i < questions + zeros; i++) { is_one[steps[pos][i]] = 0; go(pos + 1, is_one, is_question); } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int _ = 1; while (_--) { cin >> n >> k; for (int i = 0; i <= n; i++) { a[i] = 0; for (int j = 0; j < i; j++) { a[i][n - j - 1] = 1; } } for (int i = 0; i < k; i++) { int q; cin >> q; while (q--) { int x; cin >> x; steps[i].push_back(--x); } } bitset<40> is_one = 0; bitset<40> is_question = (1ll << n) - 1; go(0, is_one, is_question); cout << (n == 1 || ok ? ACCEPTED : REJECTED ) << endl; } }
#include <bits/stdc++.h> using namespace std; int main() { long long xmax, ymax, sx, sy, i, j; cin >> xmax >> ymax >> sx >> sy; cout << sx << << sy << endl; for (i = sx - 1; i >= 1; i--) cout << i << << sy << endl; i++; for (j = sy + 1; j <= ymax; j++) cout << i << << j << endl; j--; for (j = sy - 1; j >= 1; j--) cout << i << << j << endl; j++; for (i = 2; i <= xmax; i++) { if (i % 2 == 0) { for (j = 1; j <= ymax; j++) { if (i <= sx && j == sy) continue; else cout << i << << j << endl; } j--; } else { for (j = ymax; j >= 1; j--) { if (i <= sx && j == sy) continue; else cout << i << << j << endl; } j++; } } return 0; }
#include <bits/stdc++.h> using namespace std; long long i, m, n, x, y; set<long long> a, b; int main() { cin >> n >> m; for (i = 0; i < m; i++) { cin >> x >> y; a.insert(x); b.insert(y); cout << (n - a.size()) * (n - b.size()) << ; } return 0; }
#include <bits/stdc++.h> using namespace std; const int INF = 1000000000; const int MAX = 1000007; int n; long long a, b; vector<int> primes(int x) { vector<int> p; for (int i = 2; i * i <= x; ++i) if (x % i == 0) { p.push_back(i); while (x % i == 0) { x /= i; } } if (x != 1) p.push_back(x); return p; } long long dp[MAX][3]; long long solve(vector<int> c) { vector<int> p = primes(c[0]); vector<int> p1 = primes(c[0] - 1); for (int i = (0); i < (p1.size()); i++) p.push_back(p1[i]); p1 = primes(c[0] + 1); for (int i = (0); i < (p1.size()); i++) p.push_back(p1[i]); p1 = primes(c.back()); for (int i = (0); i < (p1.size()); i++) p.push_back(p1[i]); p1 = primes(c.back() + 1); for (int i = (0); i < (p1.size()); i++) p.push_back(p1[i]); p1 = primes(c.back() - 1); for (int i = (0); i < (p1.size()); i++) p.push_back(p1[i]); sort(p.begin(), p.end()); p.resize(unique(p.begin(), p.end()) - p.begin()); long long res = 1LL * INF * INF; for (int t = (0); t < (p.size()); t++) { int pr = p[t]; dp[0][0] = dp[0][1] = dp[0][2] = 0; for (int i = (0); i < (n); i++) { int val = min(c[i] % pr, pr - c[i] % pr); dp[i + 1][0] = dp[i + 1][1] = dp[i + 1][2] = 1LL * INF * INF; if (val <= 1) { dp[i + 1][2] = min(dp[i][2] + a * val, min(dp[i][1] + a * val, dp[i][0] + a * val)); } dp[i + 1][1] = min(dp[i][0], dp[i][1]) + b; if (val <= 1) { dp[i + 1][0] = dp[i][0] + a * val; } } long long r = min(dp[n][2], min(dp[n][1], dp[n][0])); res = min(res, r); } return res; } int main() { cin >> n >> a >> b; swap(a, b); vector<int> c(n); for (int i = (0); i < (n); i++) { scanf( %d , &c[i]); } long long res = solve(c); cout << res << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int a[55][55]; int query(int xa, int ya, int xb, int yb) { if (xa > xb || ya > yb) swap(xa, xb), swap(ya, yb); cout << ? << xa + 1 << << ya + 1 << << xb + 1 << << yb + 1 << endl; int p; cin >> p; return p; } int h[2]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; a[0][0] = 1, a[n - 1][n - 1] = 0; for (int i = 0; i < n; i++) { for (int j = i + 2; j < n; j += 2) { int p = query(i, j - 2, i, j); p ^= 1; a[i][j] = p ^ a[i][j - 2]; p = query(j - 2, i, j, i); p ^= 1; a[j][i] = p ^ a[j - 2][i]; } if (i < n - 1) { int p = query(i, i, i + 1, i + 1); p ^= 1; a[i + 1][i + 1] = p ^ a[i][i]; } } a[0][1] = 0; for (int i = 0; i < n; i++) { if (i & 1) { int p = query(i - 1, n - 2, i, n - 1); p ^= 1; a[i][n - 1] = a[i - 1][n - 2] ^ p; for (int j = n - 3; j >= 0; j -= 2) { int p = query(i, j, i, j + 2); p ^= 1; a[i][j] = a[i][j + 2] ^ p; } } else { if (i) { int p = query(i - 2, 1, i, 1); p ^= 1; a[i][1] = a[i - 2][1] ^ p; } for (int j = 3; j < n; j += 2) { int p = query(i, j - 2, i, j); p ^= 1; a[i][j] = a[i][j - 2] ^ p; } } } int ind; for (int i = 0; i < n - 2; i++) { if (i % 2 == 0 && a[i + 2][i + 2] == 0 && a[i][i] == 1) { ind = i; break; } } if (!(a[ind][ind] == a[ind][ind + 2]) ^ (a[ind][ind + 1] == a[ind + 1][ind + 2])) { int p = query(ind, ind, ind + 1, ind + 2); if (p) { h[a[ind + 1][ind + 2]] = 1; h[1 - a[ind + 1][ind + 2]] = 0; } else { h[a[ind + 1][ind + 2]] = 0; h[1 - a[ind + 1][ind + 2]] = 1; } } else { int p = query(ind, ind + 1, ind + 2, ind + 2); if (p) { h[a[ind][ind + 1]] = 0; h[1 - a[ind][ind + 1]] = 1; } else { h[a[ind][ind + 1]] = 1; h[1 - a[ind][ind + 1]] = 0; } } cout << ! << endl; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if ((i + j) % 2) { cout << h[a[i][j]]; } else { cout << a[i][j]; } } cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; char a[100][40]; char b[100][40]; int at[1445], use[100], ok[100], idx[100], pos[100], sum[100], cnt; int dp[43205], ans_dd, ans_hh, ans_mm; int pt[43205][100]; void run_to(int t) { while (1) { int next_dd = ans_dd; int next_hh = ans_hh; int next_mm = ans_mm; if (++next_mm == 60) { next_mm = 0; if (++next_hh == 24) { next_hh = 0; next_dd++; } } if ((next_dd - 1) * cnt + at[next_hh * 60 + next_mm] >= t) break; ans_dd = next_dd; ans_hh = next_hh; ans_mm = next_mm; } } void output(int t, int i, int cnt) { if (~i) { int x = pt[t][i]; if (~x) { output(t - use[idx[x]], i - 1, cnt + 1); run_to(t - use[idx[x]] + 1); printf( %d %d %02d:%02d , x + 1, ans_dd, ans_hh, ans_mm); run_to(t); printf( %d %02d:%02d n , ans_dd, ans_hh, ans_mm); } else { output(t, i - 1, cnt); } } else { printf( %d n , cnt); } } int main() { int m, n, all, hh, mm; scanf( %d%d%d , &m, &n, &all); for (int i = 0; i < m; i++) scanf( %s , a[i]); for (int i = 0; i < m; i++) scanf( %d , use + i); for (int i = 0; i < 4; i++) { scanf( %d:%d- , &hh, &mm); int st = hh * 60 + mm; scanf( %d:%d , &hh, &mm); int ed = hh * 60 + mm; for (int x = st; x <= ed; x++) at[x] = -1; } for (int x = 0; x < 1440; x++) if (~at[x]) at[x] = cnt++; all *= at[1440] = cnt; for (int x = 1439; ~x; x--) if (at[x] < 0) at[x] = at[x + 1]; for (int i = 0; i < n; i++) { scanf( %s , b[i]); for (idx[i] = 0; idx[i] < m; idx[i]++) if (!strcmp(b[i], a[idx[i]])) break; if (idx[i] != m) ok[i] = 1; scanf( %d%d:%d%d , pos + i, &hh, &mm, sum + i); pos[i] = (pos[i] - 1) * cnt + at[hh * 60 + mm]; } for (int i = 0; i < n; i++) { int k = -1; for (int j = 0; j < n; j++) if (ok[j] && (k < 0 || pos[j] < pos[k])) k = j; for (int x = all; ~x; x--) pt[x][i] = -1; for (int x = all; ~x; x--) { int t = x + use[idx[k]]; if (t <= pos[k] && sum[k] + dp[x] > dp[t]) { dp[t] = sum[k] + dp[x]; pt[t][i] = k; } } ok[k] = 0; } int x = max_element(dp, dp + all + 1) - dp; printf( %d n , dp[x]); output(x, n - 1, 0); }
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const long long INF = 2e18; const int N = 11234; int n, m; set<string> st; char s[N]; int dp[N][4]; void dfs(int pos, string pre, int len) { if (pos - 1 < 5) return; if (dp[pos][len]) return; dp[pos][len] = 1; string str = ; for (int i = 1; i >= 0; --i) str += s[pos - i]; if (str != pre) { st.insert(str); dfs(pos - 2, str, 2); } if (pos - 2 >= 5) { str = ; for (int i = 2; i >= 0; --i) str += s[pos - i]; if (str != pre) { st.insert(str); dfs(pos - 3, str, 3); } } } int main() { while (scanf( %s , s) != EOF) { int i, j; memset(dp, 0, sizeof(dp)); st.clear(); n = strlen(s); if (n < 5) puts( 0 ); else { dfs(n - 1, , 0); printf( %d n , st.size()); set<string>::iterator it = st.begin(); for (; it != st.end(); ++it) { cout << *it << endl; } } } }
#include <bits/stdc++.h> template <class C, class E> inline bool contains(const C &container, const E &element) { return container.find(element) != container.end(); } template <class T> inline void checkmin(T &a, T b) { if (b < a) a = b; } template <class T> inline void checkmax(T &a, T b) { if (b > a) a = b; } using namespace std; class UnionFind { public: UnionFind(int elements) : _subsets(elements), _setCount(elements) { for (int i = 0; i < elements; ++i) { _subsets[i].parent = i; _subsets[i].rank = 0; } } int Find(int i) { if (_subsets[i].parent != i) _subsets[i].parent = Find(_subsets[i].parent); return _subsets[i].parent; } void Union(int x, int y) { int xroot = Find(x); int yroot = Find(y); if (xroot == yroot) return; --_setCount; if (_subsets[xroot].rank < _subsets[yroot].rank) _subsets[xroot].parent = yroot; else if (_subsets[xroot].rank > _subsets[yroot].rank) _subsets[yroot].parent = xroot; else { _subsets[yroot].parent = xroot; _subsets[xroot].rank++; } } struct subset { int parent; int rank; }; void Trace() { for (int i = (0), _b = ((_subsets.size()) - 1); i <= _b; i++) cout << i << : << Find(i) << | ; cout << endl; } vector<subset> _subsets; int _setCount; }; vector<int> res; struct Node { Node(int v) { l = r = NULL; val = v; } Node(Node *_l, Node *_r) { l = _l; r = _r; } Node *l, *r; int val; void Solve() { if (l == NULL) { cout << val << ; } else { l->Solve(); r->Solve(); } } }; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout << std::setprecision(15); cout << std::fixed; int n; cin >> n; res.reserve(n); UnionFind uf(n + 1); vector<Node *> d(n + 1); for (int i = (1), _b = (n); i <= _b; i++) { d[i] = new Node(i); } for (int i = (0), _b = ((n - 1) - 1); i <= _b; i++) { int a, b; cin >> a >> b; int ra = uf.Find(a); int rb = uf.Find(b); Node *na = d[ra]; Node *nb = d[rb]; assert(na != NULL); assert(nb != NULL); d[ra] = NULL; d[rb] = NULL; uf.Union(ra, rb); int nr = uf.Find(ra); Node *nn = new Node(na, nb); d[nr] = nn; } int rootR = uf.Find(1); d[rootR]->Solve(); return 0; }
#include <bits/stdc++.h> using namespace std; long long tc, n, m, a, b, k; string str; char c; set<long long> s; map<long long, long long> mp; int main() { int k2, k3, k5, k6, ans = 0; cin >> k2 >> k3 >> k5 >> k6; int x = min(k2, k5); x = min(x, k6); ans += 256 * x; k2 -= x; x = min(k2, k3); ans += 32 * x; cout << ans << n ; }
#include <bits/stdc++.h> using namespace std; string inp[100005]; int num[100005]; int tl; int ch[1200005][27]; int fail[1200005], len[1200005], elen[1200005]; long long cost[1200005]; int rt = 1, tot = 1, last = 1; void add(int x, int c, int _elen) { int p = last; int np = ++tot; len[np] = len[p] + 1; cost[np] = c; elen[np] = _elen; last = np; while (p && !ch[p][x]) { ch[p][x] = np; p = fail[p]; } if (!p) { fail[np] = rt; } else { int q = ch[p][x]; if (len[q] == len[p] + 1) { fail[np] = q; } else { int nq = ++tot; memcpy(ch[nq], ch[q], sizeof(ch[q])); len[nq] = len[p] + 1; fail[nq] = fail[q]; fail[np] = fail[q] = nq; while (p && ch[p][x] == q) { ch[p][x] = nq; p = fail[p]; } } } } int freq[600005], tpsort[1200005]; void TopoSort() { for (int i = (1); i <= (tot); i += (1)) freq[len[i]]++; for (int i = (1); i <= (tl); i += (1)) freq[i] += freq[i - 1]; for (int i = (tot); i >= (1); i -= (1)) tpsort[--freq[len[i]]] = i; } int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; for (int i = (1); i <= (n); i += (1)) cin >> inp[i]; for (int i = (1); i <= (n); i += (1)) cin >> num[i]; for (int i = (0); i <= (1200005 - 1); i += (1)) elen[i] = 1000000000; tl = 0; for (int i = (1); i <= (n); i += (1)) { int t = inp[i].length(); for (int j = (0); j <= (t - 1); j += (1)) { add(inp[i][j] - a , num[i], j + 1); } add(26, 0, 0); tl += t + 1; } TopoSort(); long long mx = 0; for (int i = (tot); i >= (1); i -= (1)) { int u = tpsort[i]; cost[fail[u]] += cost[u]; elen[fail[u]] = min(elen[fail[u]], elen[u]); if (elen[u] > len[fail[u]]) { mx = max(mx, cost[u] * min(elen[u], len[u])); } } printf( %lld n , mx); return 0; }
#include <bits/stdc++.h> using namespace std; const int dx[] = {-1, 0, 1, 0}; const int dy[] = {0, -1, 0, 1}; inline int read() { int ans = 0; bool f = 1; char ch = getchar(); while (!isdigit(ch)) f ^= ch == - , ch = getchar(); while (isdigit(ch)) ans = ((ans << 2) + ans << 1) + (ch ^ 48), ch = getchar(); return f ? ans : -ans; } long long n, m; bool CanMove(long long x, long long y) { return (x >= 0 && x < n && y >= 0 && y < m); } long long DFS1(long long x, long long y, long long sx, long long sy) { x--, y--; sx--, sy--; long long val[n][m]; queue<pair<long long, long long> > q; for (long long i = 0; i < n; i++) for (long long j = 0; j < m; j++) val[i][j] = 0; q.push(make_pair(x, y)); val[x][y] = 1; while (!q.empty()) { pair<long long, long long> p = q.front(); q.pop(); long long X = p.first, Y = p.second; if (CanMove(X + 1, Y + 2) && val[X + 1][Y + 2] == 0) { q.push(make_pair(X + 1, Y + 2)); val[X + 1][Y + 2] = val[X][Y] + 1; } if (CanMove(X + 1, Y - 2) && val[X + 1][Y - 2] == 0) { q.push(make_pair(X + 1, Y - 2)); val[X + 1][Y - 2] = val[X][Y] + 1; } if (CanMove(X - 1, Y + 2) && val[X - 1][Y + 2] == 0) { q.push(make_pair(X - 1, Y + 2)); val[X - 1][Y + 2] = val[X][Y] + 1; } if (CanMove(X - 1, Y - 2) && val[X - 1][Y - 2] == 0) { q.push(make_pair(X - 1, Y - 2)); val[X - 1][Y - 2] = val[X][Y] + 1; } if (CanMove(X + 2, Y + 1) && val[X + 2][Y + 1] == 0) { q.push(make_pair(X + 2, Y + 1)); val[X + 2][Y + 1] = val[X][Y] + 1; } if (CanMove(X + 2, Y - 1) && val[X + 2][Y - 1] == 0) { q.push(make_pair(X + 2, Y - 1)); val[X + 2][Y - 1] = val[X][Y] + 1; } if (CanMove(X - 2, Y + 1) && val[X - 2][Y + 1] == 0) { q.push(make_pair(X - 2, Y + 1)); val[X - 2][Y + 1] = val[X][Y] + 1; } if (CanMove(X - 2, Y - 1) && val[X - 2][Y - 1] == 0) { q.push(make_pair(X - 2, Y - 1)); val[X - 2][Y - 1] = val[X][Y] + 1; } } return val[sx][sy]; } vector<pair<long long, long long> > DFS2(long long x, long long y, long long sx, long long sy) { x--, y--; sx--, sy--; long long val[n][m]; pair<long long, long long> pre[n][m]; for (long long i = 0; i < n; i++) for (long long j = 0; j < m; j++) val[i][j] = 0; vector<pair<long long, long long> > v; v.clear(); queue<pair<long long, long long> > q; q.push(make_pair(x, y)); val[x][y] = 1; while (!q.empty()) { pair<long long, long long> pp = q.front(); q.pop(); long long X = pp.first, Y = pp.second; if (CanMove(X + 1, Y + 2) && val[X + 1][Y + 2] == 0) { q.push(make_pair(X + 1, Y + 2)); val[X + 1][Y + 2] = val[X][Y] + 1; pre[X + 1][Y + 2] = make_pair(X, Y); } if (CanMove(X + 1, Y - 2) && val[X + 1][Y - 2] == 0) { q.push(make_pair(X + 1, Y - 2)); val[X + 1][Y - 2] = val[X][Y] + 1; pre[X + 1][Y - 2] = make_pair(X, Y); } if (CanMove(X - 1, Y + 2) && val[X - 1][Y + 2] == 0) { q.push(make_pair(X - 1, Y + 2)); val[X - 1][Y + 2] = val[X][Y] + 1; pre[X - 1][Y + 2] = make_pair(X, Y); } if (CanMove(X - 1, Y - 2) && val[X - 1][Y - 2] == 0) { q.push(make_pair(X - 1, Y - 2)); val[X - 1][Y - 2] = val[X][Y] + 1; pre[X - 1][Y - 2] = make_pair(X, Y); } if (CanMove(X + 2, Y + 1) && val[X + 2][Y + 1] == 0) { q.push(make_pair(X + 2, Y + 1)); val[X + 2][Y + 1] = val[X][Y] + 1; pre[X + 2][Y + 1] = make_pair(X, Y); } if (CanMove(X + 2, Y - 1) && val[X + 2][Y - 1] == 0) { q.push(make_pair(X + 2, Y - 1)); val[X + 2][Y - 1] = val[X][Y] + 1; pre[X + 2][Y - 1] = make_pair(X, Y); } if (CanMove(X - 2, Y + 1) && val[X - 2][Y + 1] == 0) { q.push(make_pair(X - 2, Y + 1)); val[X - 2][Y + 1] = val[X][Y] + 1; pre[X - 2][Y + 1] = make_pair(X, Y); } if (CanMove(X - 2, Y - 1) && val[X - 2][Y - 1] == 0) { q.push(make_pair(X - 2, Y - 1)); val[X - 2][Y - 1] = val[X][Y] + 1; pre[X - 2][Y - 1] = make_pair(X, Y); } } while (sx != x || sy != y) { v.push_back(make_pair(sx + 1, sy + 1)); pair<long long, long long> pp = pre[sx][sy]; sx = pp.first, sy = pp.second; } return v; } vector<pair<long long, long long> > v; long long x, y, sx, sy; long long fl1, fl2; int main(int argc, char const *argv[]) { ios::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m >> x >> y >> sx >> sy; fl1 = ((x + y) % 2 != (sx + sy) % 2); long long aa = DFS1(x, y, n / 2, m / 2); long long bb = DFS1(sx, sy, n / 2, m / 2); long long cc = DFS1(x, y, n / 2 + 1, m / 2); long long dd = DFS1(sx, sy, n / 2 + 1, m / 2); if (fl1 == 0) fl2 = ((dd < aa) || (bb <= aa)); else fl2 = (!((aa <= dd) || ((cc - 1) <= dd))); cout << (fl2 ? BLACK : WHITE ) << endl; if (fl2) { if (fl1) { v = DFS2(sx, sy, n / 2 + 1, m / 2); for (long long i = (long long)v.size() - 1; i >= 0; i--) { long long a, b; cin >> a >> b; cout << v[i].first << << v[i].second << endl; } } else { if (dd < aa) { v = DFS2(sx, sy, n / 2 + 1, m / 2); for (long long i = (long long)v.size() - 1; i >= 0; i--) { long long a, b; cin >> a >> b; cout << v[i].first << << v[i].second << endl; if ((a == v[i].first) && (b == v[i].second)) return 0; } } else { v = DFS2(sx, sy, n / 2, m / 2); for (long long i = (long long)v.size() - 1; i >= 0; i--) { long long a, b; cin >> a >> b; long long c, d; c = abs(sx - a); d = abs(sy - b); if ((c == 1 && d == 2) || (c == 2 && d == 1)) { cout << a << << b << endl; return 0; } else { cout << v[i].first << << v[i].second << endl; sx = v[i].first, sy = v[i].second; } } long long a, b; cin >> a >> b; long long c, d; c = abs(sx - a); d = abs(sy - b); if ((c == 1 && d == 2) || (c == 2 && d == 1)) { cout << a << << b << endl; return 0; } else { sx++, sy += 2; cout << sx << << sy << endl; cin >> a >> b; c = abs(sx - a); d = abs(sy - b); if ((c == 1 && d == 2) || (c == 2 && d == 1)) { cout << a << << b << endl; return 0; } else { sx -= 2; sy--; cout << sx << << sy << endl; sx += 2; sy--; cin >> a >> b; cout << sx << << sy << endl; } } } } } else { if (!fl1) { v = DFS2(x, y, n / 2, m / 2); cout << v[v.size() - 1].first << << v[v.size() - 1].second << endl; for (long long i = (long long)v.size() - 2; i >= 0; i--) { long long a, b; cin >> a >> b; cout << v[i].first << << v[i].second << endl; } } else { if (aa <= dd) { v = DFS2(x, y, n / 2, m / 2); cout << v[v.size() - 1].first << << v[v.size() - 1].second << endl; if (v[v.size() - 1].first == x && v[v.size() - 1].second == y) return 0; for (long long i = (long long)v.size() - 2; i >= 0; i--) { long long a, b; cin >> a >> b; cout << v[i].first << << v[i].second << endl; if (v[i].first == x && v[i].second == y) return 0; } } else { v = DFS2(x, y, n / 2 + 1, m / 2); long long P = sx, Q = sy; long long X = x, Y = y; for (long long i = (long long)v.size() - 1; i >= 0; i--) { long long c, d; c = abs(X - P); d = abs(Y - Q); if ((c == 1 && d == 2) || (c == 2 && d == 1)) { cout << P << << Q << endl; return 0; } else { cout << v[i].first << << v[i].second << endl; cin >> P >> Q; X = v[i].first; Y = v[i].second; } } long long c, d; c = abs(X - P); d = abs(Y - Q); if ((c == 1 && d == 2) || (c == 2 && d == 1)) { cout << P << << Q << endl; return 0; } else { X -= 2, Y++; cout << X << << Y << endl; cin >> P >> Q; c = abs(X - P); d = abs(Y - Q); if ((c == 1 && d == 2) || (c == 2 && d == 1)) { cout << P << << Q << endl; return 0; } else { X += 2, Y++; cout << X << << Y << endl; cin >> P >> Q; X--, Y -= 2; cout << X << << Y << endl; return 0; } } } } } return 0; }
#include <bits/stdc++.h> using namespace std; const long long N = 2e5 + 10; int col[N], par[N], to[N]; int num = 0; void dfs(int u, int from) { if (col[u] == 2) return; if (col[u] == 1) { ++num; return; } col[u] = 1; par[u] = from; dfs(to[u], u); col[u] = 2; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n, cnt = 0; cin >> n; for (int i = 1; i <= n; ++i) cin >> to[i]; int b[N]; for (int i = 0; i < n; ++i) { int x; cin >> x; if (x) ++cnt; } for (int i = 1; i <= n; ++i) if (!col[i]) dfs(i, -1); if (num == 1) num = 0; cout << num + ((cnt % 2) ? 0 : 1); }
#include <bits/stdc++.h> using namespace std; int main() { long long int n, k, q; long long int i, j; cin >> n >> k >> q; long long int arr[n][2]; for (i = 0; i < n; i++) { cin >> arr[i][0] >> arr[i][1]; } long long int temp[200010]; for (i = 0; i < 200001; i++) { temp[i] = 0; } for (i = 0; i < n; i++) { temp[arr[i][0]] = temp[arr[i][0]] + 1; temp[arr[i][1] + 1] = temp[arr[i][1] + 1] - 1; } for (i = 1; i < 200001; i++) { temp[i] = temp[i - 1] + temp[i]; } long long int ans[200010]; ans[0] = 0; for (i = 1; i < 200001; i++) { if (temp[i] >= k) ans[i] = ans[i - 1] + 1; else ans[i] = ans[i - 1]; } int s, e; while (q--) { cin >> s >> e; cout << ans[e] - ans[s - 1] << endl; } return (0); }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int i, j; int arr1[n], arr2[n], p[n]; for (i = 1; i <= n; i++) cin >> arr1[i]; for (i = 1; i <= n; i++) cin >> arr2[i]; for (i = 1; i <= n; i++) p[arr1[i]] = arr2[i]; for (i = 1; i <= n; i++) cout << p[i] << ; return 0; }
#include <bits/stdc++.h> using namespace std; int a, b, c, Count = 1; int main() { cin >> a >> b >> c; if ((a + b > c) && (a + c > b) && (b + c > a)) { cout << 0 << endl; return 0; } while ((a + b < c) || (a + c < b) || (b + c < a)) { ++Count; if (a + b < c) { if (a < b) a++; else b++; } else if (a + c < b) { if (a < c) a++; else c++; } else if (b + c < a) { if (b < c) b++; else c++; } } cout << Count << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long n, k; cin >> n >> k; long long x = __builtin_popcount(n); if (k > n || k < x) { cout << NO << endl; } else { cout << YES n ; k = k - x; long long count[30] = {0}; int i = 0; int a = n; n = 0; while (a > 0) { count[i] = a % 2; n++; a = a / 2; i++; } long long cur = 29; while (k--) { if (count[cur]) { count[cur - 1] += 2; count[cur]--; } else if (count[cur] == 0) { cur = cur - 1; k++; } } cur = 1; for (int i = 0; i < 30; i++) { for (int j = 0; j < count[i]; j++) { cout << cur << ; } cur *= 2; } cout << endl; } }
#include <bits/stdc++.h> using namespace std; void solve() { long long n; cin >> n; vector<vector<long long>> adj(n + 1, vector<long long>(n + 1, 0)); for (long long i = 1; i <= n; i++) { for (long long j = 1; j <= n; j++) { cin >> adj[i][j]; } } vector<long long> del(n + 1), v, ans; for (long long i = 1; i <= n; i++) cin >> del[i]; for (long long k = n; k >= 1; k--) { v.push_back(del[k]); for (long long i = 1; i <= n; i++) { for (long long j = 1; j <= n; j++) { adj[i][j] = min(adj[i][j], adj[i][del[k]] + adj[del[k]][j]); } } long long sum = 0; for (long long i = 0; i < v.size(); i++) { for (long long j = 0; j < v.size(); j++) { sum += adj[v[i]][v[j]]; } } ans.push_back(sum); } for (long long i = ans.size() - 1; i >= 0; i--) { cout << ans[i] << ; } cout << endl; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long qu = 1; for (long long cas = 1; cas <= qu; cas++) { solve(); } }
#include <bits/stdc++.h> using namespace std; int main() { long long a, b; cin >> a >> b; if (b - a >= 5l) printf( 0 ); else { long long p = 1l, t = b; while (t > a && t > 0) { p *= t; p %= 10; t--; } printf( %I64d , p); } }
#include <bits/stdc++.h> int n; int p[512]; int c[512][512]; int a[512]; int main() { int i, j, k; scanf( %d , &n); for (i = 1; i <= n; i++) { for (j = 1; j <= n; j++) { scanf( %d , &c[i][j]); } } for (i = 1; i <= n; i++) { scanf( %d , &p[i]); } for (i = 1; i <= n; i++) { for (j = 1; j <= n; j++) { if (c[i][j] == i) continue; for (k = 1; k <= n; k++) { if (p[k] == c[i][j]) break; if ((p[k] < c[i][j]) && (p[k] != i)) break; } if (p[k] == c[i][j]) { a[i] = c[i][j]; break; } } } for (i = 1; i < n; i++) printf( %d , a[i]); printf( %d n , a[n]); return 0; }
#include <bits/stdc++.h> using namespace std; const long int m = 1000000007; int prsb(long long int n) { int pos = 0; long long int m = 1; while (!(n & m)) { m = m << 1; pos++; } return pos; } int main() { int t; cin >> t; while (t--) { long long int a, b; cin >> a >> b; long long int x, y, z; int n, c = 0; x = min(a, b); y = max(a, b); z = y / x; if (y % x != 0) { c = -1; } else if (z == 1) { c = 0; } else if (z && (!(z & (z - 1)))) { n = prsb(z); c += n / 3; n = n % 3; c += n / 2; n = n % 2; c += n / 1; } else { c = -1; } cout << c << endl; } }
#include <bits/stdc++.h> using namespace std; int main() { long long i, a, b, c, d, mn, mx; cin >> a >> b >> c >> d; mn = min(b, d); b -= mn; d -= mn; if (d > b) { for (i = 0; i < 1000; i++) { if (d % a == 0) { cout << d + mn; return 0; } d += c; } } else if (d < b) { for (i = 0; i < 1000; i++) { if (b % c == 0) { cout << b + mn; return 0; } b += a; } } else if (d == b) { cout << d + mn; return 0; } cout << -1 ; return 0; }
#include <bits/stdc++.h> using namespace std; struct T { double x, y; }; T ball; double g1, g2, r, h; double ll, rr, eps = 1e-8; int main() { scanf( %lf%lf%lf%lf%lf%lf , &g1, &g2, &h, &ball.x, &ball.y, &r); ll = 0; rr = ball.x; while (rr - ll > eps) { double m = (ll + rr) / 2; double xl = m - (ball.x - m); double a, b, c; a = ball.y - (h - r); b = m - xl; c = -a * m - b * (h - r); double yl = -c / b; if (yl < g1) rr = m; else if (yl > g2) ll = m; else { if ((b * g2 + c) / sqrt(a * a + b * b) < r) ll = m; else if (yl - r < g1) rr = m; else { printf( %.10lf , m); return 0; } } } printf( -1 ); return 0; }
#include <bits/stdc++.h> using namespace std; const int NMax = 301000, MMax = 200; int N, A[NMax]; map<int, int> S; long long sum[NMax]; vector<int> R; int main() { scanf( %d , &N); for (int i = 1; i <= N; i++) { scanf( %d , A + i); S[A[i]] = max(S[A[i]], i); if (A[i] >= 0) sum[i] = sum[i - 1] + A[i]; else sum[i] = sum[i - 1]; } long long maxx = -(~0uLL >> 1); pair<int, int> ans; for (int i = 1; i <= N; i++) { int t = S[A[i]]; if (t > i) { long long first = sum[t] - sum[i - 1]; if (A[i] < 0) first += (long long)A[i] * 2; if (first > maxx) { maxx = first; ans = make_pair(i, t); } } } printf( %I64d , maxx); for (int i = 1; i < ans.first; i++) R.push_back(i); for (int i = ans.first + 1; i < ans.second; i++) if (A[i] < 0) R.push_back(i); for (int i = ans.second + 1; i <= N; i++) R.push_back(i); printf( %d n , (int)R.size()); for (int i = 0; i < R.size(); i++) printf( %d , R[i]); puts( ); return 0; }
#include <bits/stdc++.h> using namespace std; inline long toInt(string s) { long v; istringstream sin(s); sin >> v; return v; } template <class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); } template <class T> inline T sqr(T x) { return x * x; } long long pw(long long x, long long y) { long long ans = 1; for (long long i = 0; i < y; i++) { ans = ans * x; } return ans; } long long factorial(long long x) { long long ans = 1; for (int i = 1; i < x + 1; i++) { ans = ans * i; } return ans; } long long combination(long long x, long long y) { return factorial(x) / factorial(y) / factorial(x - y); } long long permutation(long long x, long long y) { return factorial(x) / factorial(x - y); } string flip(string s) { string ss; for (int i = 0; i < s.size(); i++) { ss = toString(s[i]) + ss; } return ss; } long long mod(long long a, long long b) { if (a % b == 0) { return 0; } else { return a % b; } } int main() { long long n; cin >> n; vector<long long> v(n); long long a, b; for (long long i = 0; i < n - 1; i++) { cin >> a >> b; v[a - 1]++; v[b - 1]++; } long long ans = 0; for (long long i = 0; i < n; i++) { if (v[i] >= 2) { ans += combination(v[i], 2); } } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int mo = 998244353, M = 16; int n, m, a[35], x[10], y[10]; int f[31][M][M][M][M][2][2]; bool v[31][M][M][M][M][2][2]; int F(int bit, int JW1, int JW2, int JW3, int JW4, int fl1, int fl2) { if (bit == 30) return !JW1 && !JW2 && !JW3 && !JW4 && fl1 && fl2; if (v[bit][JW1][JW2][JW3][JW4][fl1][fl2]) return f[bit][JW1][JW2][JW3][JW4][fl1][fl2]; v[bit][JW1][JW2][JW3][JW4][fl1][fl2] = 1; int &ans = f[bit][JW1][JW2][JW3][JW4][fl1][fl2]; for (int sta = (int)(0); sta <= (int)((1 << n) - 1); sta++) { int NJW1 = JW1, NJW2 = JW2, NJW3 = JW3, NJW4 = JW4; for (int i = (int)(1); i <= (int)(n); i++) if (sta & (1 << (i - 1))) { if (x[i] <= 0) NJW1 -= x[i]; if (y[i] <= 0) NJW2 -= y[i]; if (x[i] >= 0) NJW3 += x[i]; if (y[i] >= 0) NJW4 += y[i]; } if (((NJW1 ^ NJW3) & 1) || ((NJW2 ^ NJW4) & 1)) continue; int nfl1 = ((NJW3 & 1) == a[bit] ? fl1 : (NJW3 & 1) < a[bit]); int nfl2 = ((NJW4 & 1) == a[bit] ? fl2 : (NJW4 & 1) < a[bit]); NJW1 /= 2; NJW2 /= 2; NJW3 /= 2; NJW4 /= 2; ans = (ans + F(bit + 1, NJW1, NJW2, NJW3, NJW4, nfl1, nfl2)) % mo; } return ans; } int main() { scanf( %d%d , &n, &m); for (int i = (int)(0); i <= (int)(29); i++) a[i] = (m >> i) & 1; bool fl1 = 0, fl2 = 0, fl3 = 0, fl4 = 0; for (int i = (int)(1); i <= (int)(n); i++) { scanf( %d%d , &x[i], &y[i]); fl1 |= (x[i] < 0); fl2 |= (x[i] > 0); fl3 |= (y[i] < 0); fl4 |= (y[i] > 0); } if (!fl1 || !fl2 || !fl3 || !fl4) return puts( 0 ), 0; printf( %d n , (F(0, 0, 0, 0, 0, 1, 1) + mo - 1) % mo); }
#include <bits/stdc++.h> using namespace std; int deg[200040], erased[200500], depth[200040]; void dfs(int x, int d, vector<vector<int>>& adj, int pa) { for (auto u : adj[x]) if (u != pa) dfs(u, d + 1, adj, x); depth[x] = d; } int main() { int n; cin >> n; vector<vector<int>> adj(n + 1); int root; for (int i = 1; i <= n; i++) { int p; cin >> p; if (p == 0) { root = i; continue; } adj[p].push_back(i); adj[i].push_back(p); deg[i]++; deg[p]++; } dfs(root, 0, adj, 0); set<pair<int, int>> S; for (int i = 1; i <= n; i++) { if (deg[i] % 2 == 0) S.insert({-depth[i], i}); } vector<int> res; while (!S.empty()) { int x = (*S.begin()).second; S.erase({-depth[x], x}); erased[x] = 1; for (auto u : adj[x]) { if (erased[u]) continue; deg[u]--; if (deg[u] % 2 == 0) { S.insert({-depth[u], u}); } else S.erase({-depth[u], u}); } res.push_back(x); } if (res.size() != n) { cout << NO ; return 0; } cout << YES n ; for (auto u : res) { cout << u << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int n, a[1005]; int main() { int i, t, mini = 1000000, s, val, tfin; cin >> n; for (i = 1; i <= n; i++) cin >> a[i]; for (t = 1; t <= 105; t++) { s = 0; for (i = 1; i <= n; i++) { val = abs(t + 1 - a[i]); val = min(val, abs(t - a[i])); val = min(val, abs(t - 1 - a[i])); s += val; } if (mini > s) { mini = s; tfin = t; } } cout << tfin << << mini; return 0; }
#include <bits/stdc++.h> using namespace std; long long md = 1000000007; long long bexp(long long a, long long b) { if (b == 0) return 1; if (b == 1) return a; long long r = bexp(a, b / 2); r = r * r; if (b % 2 == 0) return r; else return r * a; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int test_case = 1; cin >> test_case; while (test_case--) { long long n, i, j, m, k; cin >> n; long long a[n]; for (i = 0; i < n; i++) { cin >> a[i]; } long long pr = -1; long long ans = 0; for (i = 0; i < n; i++) { if (a[i] != 0) { if (pr == -1) { pr = i; } else { ans += i - pr - 1; pr = i; } } } cout << ans << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; const int P = 998244353; int n, m, a[N], pre[N], rec[N], f[N]; inline void add(int &x, int y) { x += y; if (x >= P) x -= P; } inline void sub(int &x, int y) { x -= y; if (x < 0) x += P; } struct BL { int bel[N], tag[450], w[N], size, cnt, sum[450][N], ans[450]; void init() { sum[1][0] = ans[1] = 1; size = sqrt(n); for (int i = 1; i <= n; ++i) bel[i] = (i - 1) / size + 1; cnt = bel[n]; for (int i = 1; i <= cnt; ++i) tag[i] = m; } void update(int pos, int x) { int px = bel[pos]; sub(sum[px][w[pos]], f[pos - 1]); if (w[pos] <= tag[px]) sub(ans[px], f[pos - 1]); w[pos] = x; add(sum[px][x], f[pos - 1]); if (x <= tag[px]) add(ans[px], f[pos - 1]); } void ins(int x, int y, int d) { if (x > y) return; if (bel[x] + 1 >= bel[y]) { for (int i = x; i <= y; ++i) update(i, w[i] + d); return; } for (int i = x; i <= bel[x] * size; ++i) update(i, w[i] + d); for (int i = (bel[y] - 1) * size + 1; i <= y; ++i) update(i, w[i] + d); for (int i = bel[x] + 1; i <= bel[y] - 1; ++i) { if (d > 0) sub(ans[i], sum[i][tag[i]]); tag[i] -= d; if (d < 0) add(ans[i], sum[i][tag[i]]); } } int qry(int x) { int res = 0; for (int i = x; bel[i] == bel[x]; --i) if (w[i] <= tag[bel[x]]) add(res, f[i - 1]); for (int i = bel[x] - 1; i >= 1; --i) add(res, ans[i]); return res; } } bl; int main() { scanf( %d%d , &n, &m); bl.init(); f[0] = 1; for (int i = 1; i <= n; ++i) { scanf( %d , &a[i]); pre[i] = rec[a[i]], rec[a[i]] = i; bl.ins(pre[pre[i]] + 1, pre[i], -1), bl.ins(pre[i] + 1, i, 1); f[i] = bl.qry(i); add(bl.sum[bl.bel[i + 1]][0], f[i]); add(bl.ans[bl.bel[i + 1]], f[i]); } printf( %d n , f[n]); return 0; }
#include <bits/stdc++.h> using namespace std; template <class T> T gcd(T a, T b) { return b <= 0 ? a : gcd(b, a % b); } template <class T> T lcm(T a, T b) { return (a * b) / gcd(a, b); } template <class T> T large(T a, T b) { return a > b ? a : b; } template <class T> T small(T a, T b) { return a < b ? a : b; } template <class T> T dif(T a, T b) { return a - b < 0 ? b - a : a - b; } template <class T> string toStr(const T &x) { stringstream s; s << x; return s.str(); } template <class T> int toInt(const T &x) { stringstream s; s << x; int r; s >> r; return r; } void in() {} int main() { ios_base::sync_with_stdio(0); cin.tie(0); map<int, vector<pair<int, string> > > m1; map<int, string> m2; int n, m, a, b, i; string s; cin >> n >> m; for (i = 0; i < n; i++) { cin >> s >> a >> b; m1[a].push_back(make_pair(b, s)); } for (i = 0; i < m1.size(); i++) { sort(m1[i].rbegin(), m1[i].rend()); } for (auto it : m1) { for (i = 0; i < it.second.size(); i++) { if (it.second[1].first == it.second[2].first) { cout << ? << endl; break; } else { if (i < 1) cout << it.second[i].second << << it.second[i + 1].second << endl; } } } return 0; }
#include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; const int maxn = 1e6; const int INF = 0x7fffffff; const int mod = 1e9 + 7; const double eps = 1e-7; const double Pi = acos(-1.0); inline int read_int() { char c; int ret = 0, sgn = 1; do { c = getchar(); } while ((c < 0 || c > 9 ) && c != - ); if (c == - ) sgn = -1; else ret = c - 0 ; while ((c = getchar()) >= 0 && c <= 9 ) ret = ret * 10 + (c - 0 ); return sgn * ret; } inline long long read_ll() { char c; long long ret = 0, sgn = 1; do { c = getchar(); } while ((c < 0 || c > 9 ) && c != - ); if (c == - ) sgn = -1; else ret = c - 0 ; while ((c = getchar()) >= 0 && c <= 9 ) ret = ret * 10 + (c - 0 ); return sgn * ret; } int n, res = 1; string s; int main() { cin >> n >> s; for (int i = 1; i < n; i++) { res += (s[i] != s[i - 1]); } cout << ((res + 2) < (n) ? (res + 2) : (n)) << endl; return 0; }
#include<bits/stdc++.h> using namespace std; int main(){ int t; cin >> t; while(t--){ int n; cin >> n; vector <int> a(n); int k = INT_MAX,z = -1; for(int i=0;i<n;i++){ cin >> a[i]; k = min(k,a[i]); if(k==a[i]){ z = i; } } cout << n-1 << endl; for(int i=0;i<n;i++){ if(i!=z){ cout << i+1 << << z+1 << << max(1,k+abs(z-i)) << << k << endl; } } //cout << endl; } }
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 999; vector<int> v[maxn]; vector<pair<int, int> > g[maxn]; int fa[maxn], dep[maxn], siz[maxn], Top[maxn], son[maxn], dfn[maxn], clk; void dfs1(int x) { siz[x] = 1; dfn[x] = ++clk; for (int y : v[x]) { if (y == fa[x]) continue; fa[y] = x; dep[y] = dep[x] + 1; dfs1(y); siz[x] += siz[y]; if (siz[y] > siz[son[x]]) son[x] = y; } } void dfs2(int x, int topf) { Top[x] = topf; if (son[x]) dfs2(son[x], topf); for (int y : v[x]) { if (y != fa[x] && y != son[x]) dfs2(y, y); } } int LCA(int x, int y) { while (Top[x] ^ Top[y]) if (dep[Top[x]] < dep[Top[y]]) y = fa[Top[y]]; else x = fa[Top[x]]; return dep[x] > dep[y] ? y : x; } int n, st[maxn], V[maxn], imp[maxn], top, a[maxn], s[maxn]; bool cmp(int x, int y) { return dfn[x] < dfn[y]; } inline int dis(int x, int y) { int lca = LCA(x, y); return dep[x] + dep[y] - 2 * dep[lca]; } void add(int x, int y) { int t = dis(x, y); g[x].push_back(make_pair(y, t)); g[y].push_back(make_pair(x, t)); } void insert(int x) { int lca = LCA(x, s[top]); while (top > 1 && dfn[s[top - 1]] >= dfn[lca]) add(s[top - 1], s[top]), --top; if (lca != s[top]) add(lca, s[top]), s[top] = lca; s[++top] = x; } struct node { int x, t, id, d, fl; friend bool operator<(node a, node b) { return a.t == b.t ? (a.id == b.id ? a.d > b.d : a.id < b.id) : a.t < b.t; } } Dis[maxn]; struct nd { node first; int second; friend bool operator<(nd x, nd y) { return y.first < x.first; } }; priority_queue<nd> q; int vis[maxn]; vector<int> tmp; void dfs3(int x, int faa) { tmp.push_back(x); for (auto now : g[x]) { int y = now.first; if (y == faa) continue; dfs3(y, x); } } int n1, n2; node To(int x, pair<int, int> y) { node ret = Dis[x]; if (y.second <= ret.d) { ret.d -= y.second; return ret; } int dist = y.second - ret.d; ret.t += (dist + V[ret.id] - 1) / V[ret.id]; ret.d = (V[ret.id] * ((dist + V[ret.id] - 1) / V[ret.id]) - dist); return ret; } void dj() { while (q.size()) q.pop(); for (int i = (1); i <= (n1); ++i) Dis[st[i]] = node{st[i], 0, i, 0, 1}, q.push(nd{Dis[st[i]], st[i]}); while (q.size()) { int x = q.top().second; q.pop(); if (vis[x]) continue; vis[x] = 1; for (auto y : g[x]) { node t = To(x, y); if ((!Dis[y.first].fl) || t < Dis[y.first]) Dis[y.first] = t, q.push(nd{Dis[y.first], y.first}); } } for (int i = (1); i <= (n2); ++i) cout << Dis[imp[i]].id << ; cout << endl; } void init() { top = 0; for (int x : tmp) g[x].clear(), vis[x] = 0, Dis[x] = node{0, 0, 0, 0}; tmp.clear(); } int main() { cin >> n; for (int i = (1); i <= (n - 1); ++i) { int x, y; cin >> x >> y; v[x].push_back(y); v[y].push_back(x); } dfs1(1); dfs2(1, 1); int q; cin >> q; while (q--) { cin >> n1 >> n2; for (int i = (1); i <= (n1); ++i) cin >> st[i] >> V[i], a[i] = st[i]; for (int i = (1); i <= (n2); ++i) cin >> imp[i], a[i + n1] = imp[i]; sort(a + 1, a + 1 + n1 + n2); int len = unique(a + 1, a + 1 + n1 + n2) - a - 1; sort(a + 1, a + 1 + len, cmp); s[top = 1] = 1; for (int i = (1); i <= (len); ++i) if (a[i] != 1) insert(a[i]); while (top > 1) add(s[top - 1], s[top]), --top; dj(); dfs3(1, 0); init(); } }
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c; cin >> a >> b >> c; map<int, vector<int> > vec; for (int i = 0; i < a; i++) { int g; cin >> g; vec[g % c].push_back(g); } for (int i = 0; i < c; i++) { if (vec[i].size() >= b) { cout << Yes << endl; for (int j = 0; j < b; j++) { cout << vec[i][j]; if (j != b - 1) { cout << ; } else { cout << endl; } } return 0; } } cout << No << endl; }
#include <bits/stdc++.h> using namespace std; const double EPS = 1e-4; const long double PI = acos((long double)-1.0); const long long int MOD = 1e9 + 7; long long int powmod(long long int a, long long int b, long long int mod) { long long int res = 1; a %= mod; for (; b; b >>= 1) { if (b & 1) res = res * a % mod; a = a * a % mod; } return res; } const int debug = 1; template <typename T> void DBG(vector<T> v) { if (debug) { for (T t : v) cout << t << ; cout << endl; } } template <typename T> void DBG(T t) { if (debug) cout << t << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.precision(10); cout << fixed; string s; cin >> s; vector<int> counts(26, 0); for (char c : s) { counts[c - a ]++; } vector<char> result(s.size(), . ); for (int prime = 2; prime <= s.size(); prime++) { bool is_prime = true; for (int divisor = 2; divisor * divisor <= prime; divisor++) { if (prime % divisor == 0) { is_prime = false; break; } } if (is_prime) { set<char> se; for (int i = prime; i <= s.size(); i += prime) { for (int divisor = 2; divisor * divisor <= i; divisor++) { if (i % divisor == 0) se.insert(result[divisor - 1]); } } se.erase( . ); if (se.size() > 1) { cout << NO << endl; return 0; } char c; if (se.size() == 1) { char c = *se.begin(); } else { int m = 0; for (int k = 0; k < (26); ++k) { if (counts[m] < counts[k]) m = k; } c = a + m; } for (int i = prime; i <= s.size(); i += prime) { if (result[i - 1] == . ) { if (!counts[c - a ]) { cout << NO << endl; return 0; } counts[c - a ]--; result[i - 1] = c; } } } } for (int i = 0; i < (26); ++i) { if (counts[i]) result[0] = a + i; } DBG( YES ); DBG(string(result.begin(), result.end())); }
#include <bits/stdc++.h> using ll = long long; using namespace std; void debugi(vector<int>& vec) { int n = (int)vec.size(); for (int i = 0; i < n; i++) { cout << vec[i] << ; } cout << endl; } void debugl(vector<ll>& vec) { int n = (int)vec.size(); for (int i = 0; i < n; i++) { cout << vec[i] << ; } cout << endl; } void debugmap(map<int, int>& mp) { for (auto x : mp) { cout << x.first << << x.second << , ; } cout << endl; } void debugset(set<int>& st) { for (auto x : st) { cout << x << ; } cout << endl; } void debugparri(vector<pair<int, int>>& arr) { for (int i = 0; i < (int)arr.size(); i++) { cout << [ << arr[i].first << : << arr[i].second << ] << ; } cout << endl; } void debugpi(pair<int, int>& pi) { cout << pi.first << << pi.second << endl; } void debugq(queue<int> q) { while (!q.empty()) { cout << q.front() << ; q.pop(); } cout << endl; } ll mod = 1000000007; bool check(int n, int i, int j) { if ((0 <= i & i < n) && (0 <= j & j < n)) { return true; } return false; } int main(int argc, const char* argv[]) { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; for (int tt = 0; tt < t; tt++) { int n; cin >> n; vector<int> arr(n); for (int i = 0; i < n; i++) { cin >> arr[i]; } vector<int> pre(n), suf(n); int s = 0; for (int i = 0; i < n; i++) { if (arr[i] != i + 1) { s += 1; } pre[i] = s; } s = 0; for (int i = n - 1; i >= 0; i--) { if (arr[i] != i + 1) { s += 1; } suf[i] = s; } int cnt = 0; for (int i = 0; i < n; i++) { if (pre[i] != 0 && suf[i] != 0 && arr[i] == i + 1) { cnt += 1; } } if (cnt == 0) { if (s == 0) { cout << 0 << endl; continue; } else { cout << 1 << endl; continue; } } cout << 2 << endl; continue; } return 0; }
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const long long N = 200; long long c[N][N], dp[N][N * N + N], g[N][N]; long long modp(long long a, long long b) { if (b == 0) return 1; long long u = modp(a, b / 2); u = (u * u) % mod; if (b & 1) return (a * u) % mod; return u; } int32_t main() { long long n, m, o; cin >> n >> m >> o; for (long long i = 0; i < N; i++) c[i][0] = dp[i][0] = 1; for (long long i = 1; i < N; i++) for (long long j = 1; j <= i; j++) c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod; for (long long i = 1; i <= n; i++) for (long long j = 0; j <= n; j++) g[i][j] = modp(c[n][j], (m + n - i) / n); for (long long i = 1; i <= n; i++) for (long long j = 1; j <= n * i; j++) for (long long k = max(j - n, 0LL); k <= j; k++) { dp[i][j] = (dp[i][j] + dp[i - 1][k] * g[i][j - k]) % mod; } cout << dp[n][o] << n ; }
#include <bits/stdc++.h> using namespace std; const long long INF = 1LL * 1001 * 1001 * 1001 * 1001 * 1001 * 1001; const int N = 10000; struct edge { long long a, b, cap, flow; edge(long long a, long long b, long long cap) : a(a), b(b), cap(cap), flow(0) {} long long cap_to(long long u) { return u == b ? cap - flow : flow; } long long another(long long u) { return u == b ? a : b; } void add_flow(long long u, long long first) { flow += (u == b ? first : -first); } }; struct dinic_graph { vector<edge> e; vector<long long> g[N]; long long pos[N], d[N], p[N]; void add_edge(long long a, long long b, long long c) { g[a].push_back((int)e.size()); g[b].push_back((int)e.size()); e.push_back(edge(a, b, c)); } bool bfs(long long S, long long T) { d[S] = 1; queue<long long> q; q.push(S); while (q.size()) { long long u = q.front(); q.pop(); if (u == T) return 1; for (int i = 0; i < g[u].size(); i++) { long long to = e[g[u][i]].another(u); if (!d[to] && e[g[u][i]].cap_to(to)) { d[to] = d[u] + 1; q.push(to); } } } return 0; } bool dfs(long long u, long long t) { if (u == t) return 1; for (; pos[u] < g[u].size(); pos[u]++) { long long to = e[g[u][pos[u]]].another(u); if (d[to] == d[u] + 1 && e[g[u][pos[u]]].cap_to(to)) { p[to] = g[u][pos[u]]; if (dfs(to, t)) return 1; } } return 0; } long long dinic(long long S, long long T) { long long max_flow = 0; while (1) { memset(d, 0, sizeof(d)); if (!bfs(S, T)) return max_flow; memset(pos, 0, sizeof(pos)); while (dfs(S, T)) { long long cur_f = INF; for (long long u = T; u != S; u = e[p[u]].another(u)) cur_f = min(cur_f, e[p[u]].cap_to(u)); for (long long u = T; u != S; u = e[p[u]].another(u)) e[p[u]].add_flow(u, cur_f); max_flow += cur_f; } } } }; int n, m; int x1[55], mezhdy[55], x2[55], nami[55]; vector<int> x, y; dinic_graph g; bool in(double x, double y, int pos) { return x >= min(x1[pos], x2[pos]) && x <= max(x1[pos], x2[pos]) && y >= min(mezhdy[pos], nami[pos]) && y <= max(mezhdy[pos], nami[pos]); } int main() { ios_base::sync_with_stdio(0); cin >> n >> m; for (int i = 0; i < m; i++) { cin >> x1[i] >> mezhdy[i] >> x2[i] >> nami[i]; x2[i]++; nami[i]++; x.push_back(x1[i]); x.push_back(x2[i]); y.push_back(mezhdy[i]); y.push_back(nami[i]); } sort(x.begin(), x.end()); sort(y.begin(), y.end()); x.erase(unique(x.begin(), x.end()), x.end()); y.erase(unique(y.begin(), y.end()), y.end()); int S = 0; int T = (int)x.size() + (int)y.size() + 1; for (int i = 1; i < x.size(); i++) g.add_edge(S, i, x[i] - x[i - 1]); for (int i = 1; i < y.size(); i++) g.add_edge(i + x.size(), T, y[i] - y[i - 1]); for (int i = 1; i < x.size(); i++) for (int j = 1; j < y.size(); j++) { double xx = 1.0 * (x[i] + x[i - 1]) / 2; double yy = 1.0 * (y[j] + y[j - 1]) / 2; bool ok = 0; for (int p = 0; p < m; p++) if (in(xx, yy, p)) ok = 1; if (ok) g.add_edge(i, j + x.size(), INF); } cout << g.dinic(S, T); }
#include <bits/stdc++.h> using namespace std; int main() { int a, b, n; cin >> a >> b >> n; if (abs(a) + abs(b) <= n) { if ((n - abs(a) - abs(b)) % 2 == 0) cout << Yes ; else cout << No ; } else { cout << No ; } }
#include <bits/stdc++.h> using namespace std; int l[100000], r[100000], u[100000], d[100000]; int dp[2], dp2[2]; int main() { int i; int n, m, q; char c; scanf( %d %d %d , &n, &m, &q); for (i = 0; i < n; i++) scanf( %c , &c), l[i] = (c == B ); for (i = 0; i < n; i++) scanf( %c , &c), r[i] = (c == B ); for (i = 0; i < m; i++) scanf( %c , &c), u[i] = (c == B ); for (i = 0; i < m; i++) scanf( %c , &c), d[i] = (c == B ); for (i = 0; i < n; i++) dp[!l[i]]++; dp[!u[0]]++, dp[!d[0]]++; for (i = 1; i < m; i++) { dp2[0] = min(dp[0], dp[1] + n) + u[i] + d[i]; dp2[1] = min(dp[1], dp[0] + n) + !u[i] + !d[i]; swap(dp, dp2); } for (i = 0; i < n; i++) dp[!r[i]]++; int ans = min(dp[0], dp[1]); dp[0] = dp[1] = 0; for (i = 0; i < m; i++) dp[!u[i]]++; dp[!l[0]]++, dp[!r[0]]++; for (i = 1; i < n; i++) { dp2[0] = min(dp[0], dp[1] + m) + l[i] + r[i]; dp2[1] = min(dp[1], dp[0] + m) + !l[i] + !r[i]; swap(dp, dp2); } for (i = 0; i < m; i++) dp[!d[i]]++; ans = min(ans, min(dp[0], dp[1])); printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int n, m, now; int a[3005], b[3005]; int vis[3005], f[3005], c[3005]; int ok[3005]; int findcir(int *a, int n) { int ret = 0; for (int i = 1; i <= n; i++) b[a[i]] = i; memset(vis, 0, sizeof(vis)); for (int i = 1; i <= n; i++) { if (vis[i]) continue; int j; ret++; for (j = i; !vis[j]; j = b[j]) { f[j] = ret; vis[j] = 1; c[ret]++; } } return ret; } void Swap(int x) { if (!x) return; for (int i = 1; i <= n; i++) for (int j = i + 1; j <= n; j++) if (f[i] == f[j]) { printf( %d %d , i, j); x--; if (!x) return; swap(a[i], a[j]); findcir(a, n); } } void move(int x) { if (!x) return; for (int i = 1; i <= n; i++) for (int j = i + 1; j <= n; j++) if (f[i] != f[j]) { printf( %d %d , i, j); x--; if (!x) return; swap(a[i], a[j]); findcir(a, n); } } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); now = findcir(a, n); now = n - now; scanf( %d , &m); printf( %d n , abs(now - m)); if (now > m) { Swap(now - m); } else move(m - now); return 0; }
#include <bits/stdc++.h> using namespace std; const double eps = 1e-9; set<long long> s; set<int> si; set<long long>::iterator it; vector<long long> v; vector<int> vi; int n, m, q, k; int a[200005]; int main() { int i, j, t; int w, h; ; scanf( %d%d , &w, &h); ; int u1, d1, u2, d2; ; scanf( %d%d , &u1, &d1); ; ; scanf( %d%d , &u2, &d2); ; for (i = h; i >= 0; i--) { w = w + i; if (d1 == i) w -= u1; if (d2 == i) w -= u2; w = max(0, w); } printf( %d n , w); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; for (int i = 0; i < t; i++) { int x; cin >> x; cout << x / 2 << endl; } }
#include <bits/stdc++.h> using namespace std; long long int n, x; vector<int> a; long long int tarkib(long long int r, long long int n) { long long int a = 1; for (long long int i = n; i > (n - r); i--) a = a * i; for (long long int i = 2; i < r + 1; i++) a = a / i; return a; } int main() { long long int r; cin >> n; for (long long int i = 0; i < n; i++) { cin >> x; a.push_back(x); } sort(a.begin(), a.end()); long long int i; for (i = 3; i < n; i++) { if (a[i] > a[i - 1]) break; } i--; i--; if (a[0] == a[1]) { if (a[1] == a[2]) { r = 3; i += 2; } else { r = 1; } } else { if (a[1] == a[2]) { i++; r = 2; } else { r = 1; } } cout << tarkib(r, i); return 0; }
#include <bits/stdc++.h> using namespace std; int main(void) { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; if (n <= 450 and m == n * (n - 1) / 2) { cout << NO n ; return 0; } vector<set<int>> g(n + 1); for (int i = 0; i < m; ++i) { int u, v; cin >> u >> v; g[u].insert(v); g[v].insert(u); } int x = -1, y = -1; for (int i = 1; i <= n and x == -1; ++i) { if ((int)g[i].size() == n - 1) continue; for (int j = 1; j <= n and x == -1; ++j) { if (i == j) continue; if (g[i].find(j) == g[i].end()) tie(x, y) = tie(i, j); } } vector<int> v1, v2; int cur = 3; for (int i = 1; i <= n; ++i) { if (i == x) { v1.push_back(1); v2.push_back(1); } else if (i == y) { v1.push_back(2); v2.push_back(1); } else { v2.push_back(cur); v1.push_back(cur++); } } cout << YES n ; for (auto x : v1) cout << x << ; cout << n ; for (auto x : v2) cout << x << ; }
#include <bits/stdc++.h> const long long mod = 1e9 + 7; const long long maxn = 1e5 + 7; const double pi = acos(-1); using namespace std; long long t, n, m; long long hang; long long weizhi; long long temp; long long four = 1; long long weishu; long long weishu2; long long lie; int ans[50]; map<int, int> MP; long long cal() { long long res = 0; long long a = 1; weishu2 = weishu; for (int i = weishu2; i >= 1; i--) { res += a * ans[i]; a <<= 2; } return res; } int main() { ios::sync_with_stdio(false); MP[1] = 2; MP[2] = 3; MP[3] = 1; cin >> t; while (t--) { memset(ans, 0, sizeof(ans)); weishu = 1; four = 1; cin >> n; hang = (n - 1) / 3 + 1; while (hang > four) { hang -= four; four <<= 2; weishu++; } if (n % 3 == 0) { lie = 3; } else { lie = n % 3; } weishu2 = weishu; temp = hang - 1; while (temp) { ans[weishu2--] = temp % 4; temp >>= 2; } ans[1] = 1; if (lie == 2) { for (int i = 1; i <= weishu; i++) { ans[i] = MP[ans[i]]; } } else if (lie == 3) { for (int i = 1; i <= weishu; i++) { ans[i] = MP[ans[i]]; ans[i] = MP[ans[i]]; } } cout << cal() << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const long long MOD = LLONG_MAX; long long gcd(long long x, long long y) { if (y == 0) return x; else return gcd(y, x % y); } long long power(long long x, unsigned long long y) { long long res = 1; x = x % MOD; if (x == 0) return 0; while (y > 0) { if (y & 1) res = (res * x) % MOD; y = y >> 1; x = (x * x) % MOD; } return res; } void solve() { long long n, m, b, c, d, ans = 0, one = 0; cin >> n; long long a[n]; for (long long i = (long long)0; i < n; i++) { cin >> a[i]; if (a[i] >= 2 * one) { a[i] -= 2 * one; ans += one + a[i] / 3; one = a[i] % 3; } else { one += a[i] % 2; one -= a[i] / 2; ans += a[i] / 2; } } cout << ans << n ; } int32_t main() { std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long t = 1; while (t--) solve(); }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int t, n, hold; cin >> t; while (t--) { bool ans = false; cin >> n; long long int x; for (long long int i = 0; i < n; i++) { cin >> hold; if (i == 0) x = hold; if (x != hold) ans = true; } if (ans) cout << 1 << endl; else cout << n << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const long long MAXN = 200005; vector<long long> byk[MAXN]; long long pangkat(long long x, long long y) { long long ret = 1; for (long long i = 1; i <= y; i++) ret *= x; return ret; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n, a; cin >> n; for (long long no = 1; no <= n; no++) { cin >> a; for (long long i = 2; i * i <= a; i++) { long long pa = 0; while (a % i == 0) { pa++; a /= i; } if (pa) byk[i].push_back(pa); } if (a > 1) byk[a].push_back(1); } long long ans = 1; for (long long i = 1; i <= 200000; i++) { if (byk[i].size() > n - 2) { sort(byk[i].begin(), byk[i].end()); if (byk[i].size() == n - 1) ans *= pangkat(i, byk[i][0]); else ans *= pangkat(i, byk[i][1]); } } cout << ans << n ; return 0; }
#include <bits/stdc++.h> long long mpow(long long a, long long n, long long mod) { long long ret = 1; long long b = a; while (n) { if (n & 1) ret = (ret * b) % mod; b = (b * b) % mod; n >>= 1; } return (long long)ret; } using namespace std; int n, m, s; pair<int, int> bug[(int)(1e5 + 25)]; int ANS[(int)(1e5 + 25)]; pair<pair<int, int>, int> ch[(int)(1e5 + 25)]; bool chk(int x) { priority_queue<pair<int, int> > pq; long long ans = 0; int last = m; for (int i = n; i >= 1;) { int j = i; while (j > 0 && ch[j].first.first >= bug[last].first) { pq.push(make_pair(-ch[j].first.second, ch[j].second)); j--; } i = j; if (j == 0) { break; } if (pq.empty()) { return 0; } pair<int, int> temp = pq.top(); pq.pop(); int dum = x; ans += (-temp.first); while (last > 0 && dum > 0) { ANS[bug[last].second] = temp.second; dum--; last--; } if (last <= 0) { break; } } while (last > 0) { if (pq.empty()) { return 0; } pair<int, int> temp = pq.top(); pq.pop(); int dum = x; ans += (-temp.first); while (last > 0 && dum > 0) { ANS[bug[last].second] = temp.second; dum--; last--; } } return (ans <= s); } void solve() { scanf( %d , &n); scanf( %d , &m); scanf( %d , &s); for (int i = 1; i <= m; i++) { scanf( %d , &bug[i].first); bug[i].second = i; } for (int i = 1; i <= n; i++) { scanf( %d , &ch[i].first.first); } for (int i = 1; i <= n; i++) { scanf( %d , &ch[i].first.second); ch[i].second = i; } sort(bug + 1, bug + m + 1); sort(ch + 1, ch + n + 1); int lo = 1, hi = m; while (lo < hi) { int mid = (lo + hi) >> 1; if (chk(mid)) { hi = mid; } else { lo = mid + 1; } } if (!chk(lo)) { printf( NO ); return; } printf( YES n ); for (int i = 1; i <= m; i++) { cout << ANS[i] << ; } } int main() { int t = 1; for (int i = 1; i <= t; i++) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; int dir4[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}}; int dir8[8][2] = {{-1, 0}, {1, 0}, {0, 1}, {0, -1}, {-1, 1}, {1, -1}, {1, 1}, {-1, -1}}; int dir8h[8][2] = {{2, 1}, {-2, -1}, {-1, 2}, {1, -2}, {1, 2}, {-2, 1}, {2, -1}, {-1, -2}}; int setbit(int num, int index, int value) { return (value) ? (num | (1 << index)) : (num & ~(1 << index)); } bool getbit(int num, int index) { return ((num >> index) & 1) == 1; } int cntbits(int num) { int cnt = 0; while (num) { if (num & 1) cnt++; num /= 2; } return cnt; } double eps = 1e-8; const int N = 1e5 + 100; vector<int> v[N]; bool a[N], can[N]; int root; bool dfs(int node, int pa) { if (node != root && v[node].size() == 1) { if (a[node]) { can[node] = 1; return 1; } else { can[node] = 0; return 0; } } else { if (a[node]) can[node] = 1; else can[node] = 0; for (int i = 0; i < v[node].size(); i++) { if (v[node][i] != pa) { bool x = dfs(v[node][i], node); if (!x) can[node] = 0; } } if (a[node]) return 1; return 0; } } int main() { ios_base::sync_with_stdio(false); int n, p, c; cin >> n; for (int i = 1; i <= n; i++) { cin >> p >> c; a[i] = c; if (p != -1) v[p].push_back(i), v[i].push_back(p); else root = i; } bool cc = dfs(root, -1); vector<int> res; for (int i = 1; i <= n; i++) { if (can[i]) res.push_back(i); } if (res.size() > 0) { for (int i = 0; i < res.size(); i++) cout << res[i] << ; } else cout << -1; }
#include <bits/stdc++.h> using namespace std; const int N = 2010; int n, m1, m2; int tp1[N], tp2[N]; struct Graph { int in[N]; bitset<N> e[N]; void floyd() { for (int k = 2; k <= 2 * n + 1; k++) for (int i = 2; i <= 2 * n + 1; i++) if (e[i][k]) e[i] |= e[k]; } void dfs(int u) { if (in[u]) return; in[u] = 1, in[u ^ 1] = -1; for (int v = 2; v <= 2 * n + 1; v++) if (e[u][v]) dfs(v); } void solve() { for (int i = 1; i <= n; i++) { if (!in[2 * i]) { if (e[2 * i][2 * i + 1]) dfs(2 * i + 1); else dfs(2 * i); } printf( %d , in[2 * i] == 1); } } } f, g; int main() { scanf( %d%d%d , &n, &m1, &m2); for (int i = 1; i <= m1; i++) { int u, v; scanf( %d%d , &u, &v); u = (u > 0) ? 2 * u : -2 * u + 1; v = (v > 0) ? 2 * v : -2 * v + 1; f.e[u ^ 1][v] = f.e[v ^ 1][u] = 1; } for (int i = 1; i <= m2; i++) { int u, v; scanf( %d%d , &u, &v); u = (u > 0) ? 2 * u : -2 * u + 1; v = (v > 0) ? 2 * v : -2 * v + 1; g.e[u ^ 1][v] = g.e[v ^ 1][u] = 1; } f.floyd(), g.floyd(); bool pd1 = 0, pd2 = 0; for (int i = 1; i <= n; i++) { if (f.e[2 * i][2 * i + 1] && f.e[2 * i + 1][2 * i]) pd1 = 1; if (g.e[2 * i][2 * i + 1] && g.e[2 * i + 1][2 * i]) pd2 = 1; } if (pd1 && pd2) { puts( SIMILAR ); return 0; } if (pd1) { g.solve(); return 0; } if (pd2) { f.solve(); return 0; } for (int i = 1; i <= n; i++) { if (f.e[2 * i][2 * i + 1]) tp1[i] = -1; else if (f.e[2 * i + 1][2 * i]) tp1[i] = 1; else tp1[i] = 0; if (g.e[2 * i][2 * i + 1]) tp2[i] = -1; else if (g.e[2 * i + 1][2 * i]) tp2[i] = 1; else tp2[i] = 0; if (tp1[i] == tp2[i]) continue; if ((tp1[i] == 1 && tp2[i] == -1) || (tp1[i] == -1 && tp2[i] == 1)) { f.solve(); return 0; } else if (tp1[i] == 0) { if (tp2[i] == 1) { f.dfs(2 * i + 1), f.solve(); return 0; } else { f.dfs(2 * i), f.solve(); return 0; } } else if (tp2[i] == 0) { if (tp1[i] == 1) { g.dfs(2 * i + 1), g.solve(); return 0; } else { g.dfs(2 * i), g.solve(); return 0; } } } for (int i = 2; i <= 2 * n + 1; i++) for (int j = 2; j <= 2 * n + 1; j++) { if (i == j || !(f.e[i][j] ^ g.e[i][j])) continue; if (f.e[i][j]) { g.dfs(i), g.dfs(j ^ 1), g.solve(); return 0; } if (g.e[i][j]) { f.dfs(i), f.dfs(j ^ 1), f.solve(); return 0; } } puts( SIMILAR ); }
#include <bits/stdc++.h> using namespace std; const int N = 51; const long long inf = (long long)1e14; const long long real_inf = (long long)1e18; inline long long value(const pair<long long, long long>& task, long long t) { return task.first - t * task.second; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n; vector<pair<long long, long long>> tasks(n); for (int i = 0; i < n; ++i) { cin >> tasks[i].first; tasks[i].first *= 1000; } for (int i = 0; i < n; ++i) { cin >> tasks[i].second; } sort(tasks.begin(), tasks.end()); reverse(tasks.begin(), tasks.end()); auto ok = [&](long long t) -> bool { long long dp[N][N][N]; for (int i = 0; i < n; ++i) { for (int j = 0; j <= n; ++j) { for (int k = 0; k <= n; ++k) { dp[i][j][k] = real_inf; } } } dp[0][0][1] = value(tasks[0], t); for (int i = 0; i < n - 1; ++i) { for (int j = 0; j <= n; ++j) { for (int k = 0; k <= n; ++k) { if (dp[i][j][k] == real_inf) { continue; } if (tasks[i].first == tasks[i + 1].first) { dp[i + 1][j][k + 1] = min(dp[i + 1][j][k + 1], dp[i][j][k] + value(tasks[i + 1], t)); if (j > 0) { dp[i + 1][j - 1][k] = min(dp[i + 1][j - 1][k], dp[i][j][k]); } } else { dp[i + 1][j + k][1] = min(dp[i + 1][j + k][1], dp[i][j][k] + value(tasks[i + 1], t)); if (j > 0 || k > 0) { dp[i + 1][j + k - 1][0] = min(dp[i + 1][j + k - 1][0], dp[i][j][k]); } } } } } for (int i = 0; i <= n; ++i) { for (int j = 0; j <= n; ++j) { if (dp[n - 1][i][j] <= 0) { return true; } } } return false; }; long long left = 0, right = inf, best = inf; while (left <= right) { long long middle = (left + right) / 2; if (ok(middle)) { best = middle; right = middle - 1; } else { left = middle + 1; } } cout << best << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int power(int num1, int num2) { int ans = 1; for (int i = 0; i < num2; i++) { ans *= num1; } return ans; } int main() { string str; int num1, help = 0; cin >> num1 >> str; for (int i = 0; i < str.size(); i++) { help += power(10, i) * (str[i] - 0 ); } cout << help + num1; return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5; vector<int> G[MAXN + 5]; int maxFrom[MAXN + 5], down[MAXN + 5], up[MAXN + 5]; int id[MAXN + 5], sz[MAXN + 5], diam[MAXN + 5]; bool flag[MAXN + 5]; int ID; int n, m, Q; map<int, int> cnt; vector<int> accSum[MAXN + 5]; vector<double> accWeightedSum[MAXN + 5]; vector<int> vals[MAXN + 5]; map<pair<int, int>, double> oldAns; void dfs(int u, int p = -1) { id[u] = ID; sz[ID]++; down[u] = 0; flag[u] = 1; for (int v : G[u]) { if (v == p) continue; dfs(v, u); down[u] = max(down[u], 1 + down[v]); } } void dfs2(int u, int p = -1, int parentWithoutme = 0) { if (~p) up[u] = 1 + parentWithoutme; else up[u] = 0; maxFrom[u] = max(up[u], down[u]); diam[ID] = max(diam[ID], maxFrom[u]); cnt[maxFrom[u]]++; vector<int> paths = {up[u], 0}; for (int v : G[u]) { if (v == p) continue; paths[1] = max(paths[1], 1 + down[v]); if (paths[0] < paths[1]) swap(paths[0], paths[1]); } for (int v : G[u]) { if (v == p) continue; dfs2(v, u, ((paths[0] != (1 + down[v])) ? paths[0] : paths[1])); } } void calc(int u) { cnt.clear(); ID = u; dfs(u); dfs2(u); accSum[ID].resize(cnt.size() + 1); accWeightedSum[ID].resize(cnt.size() + 1); accSum[ID][0] = 0; accWeightedSum[ID][0] = 0; int i = 0; for (auto p : cnt) { vals[ID].push_back(p.first); accSum[ID][i + 1] = accSum[ID][i] + p.second; accWeightedSum[ID][i + 1] = accWeightedSum[ID][i] + p.first * (1. * p.second / sz[ID]); i++; } } int main() { int c, c2; scanf( %d%d%d , &n, &m, &Q); for (c = 0; c < m; c++) { int u, v; scanf( %d%d , &u, &v); u--; v--; G[u].push_back(v); G[v].push_back(u); } for (c = 0; c < n; c++) { if (flag[c]) continue; calc(c); } for (c = 0; c < Q; c++) { int u, v; scanf( %d%d , &u, &v); u--; v--; if (id[u] == id[v]) printf( -1 n ); else { if (id[u] > id[v]) swap(u, v); if (oldAns.count({id[u], id[v]}) > 0) { printf( %.9f n , oldAns[{id[u], id[v]}]); } else { if (sz[id[u]] > sz[id[v]]) swap(u, v); int minDiam = max(diam[id[u]], diam[id[v]]); double ret = 0; int j = 0; for (int x : vals[id[u]]) { int i = lower_bound(vals[id[v]].begin(), vals[id[v]].end(), minDiam - x) - vals[id[v]].begin(); double f = 1. * (accSum[id[u]][j + 1] - accSum[id[u]][j]) / sz[id[u]]; ret += f * (accWeightedSum[id[v]].back() - accWeightedSum[id[v]][i] + (x + 1.0) * (sz[id[v]] - accSum[id[v]][i]) / sz[id[v]]); ret += f * (1. * accSum[id[v]][i] / sz[id[v]]) * minDiam; j++; } if (id[u] > id[v]) swap(u, v); oldAns[{id[u], id[v]}] = ret; printf( %.9f n , ret); } } } return 0; }
#include <bits/stdc++.h> using namespace std; int a[105]; int main() { int n, k, x; cin >> n >> k; for (int i = 0; i < n; i++) cin >> a[i]; int ans = 0; bool yes = true; for (int i = 0; i < n; i++) if (a[i] < k) { yes = false; break; } while (!yes) { for (int i = 0; i < n; i++) if ((a[i] < a[i + 1] || i == n - 1) && a[i] < k) a[i]++; yes = true; for (int i = 0; i < n; i++) if (a[i] < k) { yes = false; break; } ans++; } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; long long a[300005] = {0}; long long two[300005] = {0}; const long long mod = 1e9 + 7; int main() { two[0] = 1; for (int i = 1; i <= 300000; i++) { two[i] = (two[i - 1] * 2LL) % mod; } long long res = 0; int n; while (cin >> n) { a[0] = 0; for (int i = 1; i <= n; i++) { cin >> a[i]; } sort(a, a + n + 1); res = 0; for (int i = 1; i <= n; i++) { res += (a[i] * (two[i - 1] - two[n - i])); res %= mod; } cout << res << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main(int argc, char* argv[]) { cin.sync_with_stdio(false); cout.sync_with_stdio(false); int N, M; cin >> N >> M; vector<string> data(N); for (int i = 0; i < N; i++) cin >> data[i]; vector<string> data_rev(M, string(N, . )); for (int i = 0; i < N; i++) for (int j = 0; j < M; j++) data_rev[j][i] = data[i][j]; vector<vector<int> > starts(M); for (int i = 0; i < M; i++) { starts[i].push_back(0); for (int j = 1; j < N; j++) { if (data_rev[i][j] != data_rev[i][j - 1]) { starts[i].push_back(j); } } starts[i].push_back(N); } vector<vector<short> > already_counted(starts.size()); for (size_t i = 0; i < starts.size(); i++) { already_counted[i] = vector<short>(starts[i].size(), (short)0); } long long main_res = 0LL; for (int i = 0; i < M; i++) { for (size_t j = 3; j < starts[i].size(); j++) { if (!already_counted[i][j - 1]) { int h = starts[i][j - 1] - starts[i][j - 2]; if (h <= starts[i][j] - starts[i][j - 1] && h <= starts[i][j - 2] - starts[i][j - 3]) { int i_after_last = i + 1; while (i_after_last < M) { int j_absolute_1 = starts[i][j - 1]; int j_absolute_2 = starts[i][j - 2]; int j_absolute_3 = starts[i][j - 2] - 1; if (data_rev[i][j_absolute_1] != data_rev[i_after_last][j_absolute_1] || data_rev[i][j_absolute_2] != data_rev[i_after_last][j_absolute_2] || data_rev[i][j_absolute_3] != data_rev[i_after_last][j_absolute_3]) { break; } int idx_ = lower_bound(starts[i_after_last].begin(), starts[i_after_last].end(), starts[i][j - 1]) - starts[i_after_last].begin(); if (idx_ < starts[i_after_last].size() && starts[i_after_last][idx_] == starts[i][j - 1] && starts[i_after_last][idx_ - 1] == starts[i][j - 2] && h <= starts[i_after_last][idx_ - 1] - starts[i_after_last][idx_ - 2] && h <= starts[i_after_last][idx_ + 1] - starts[i_after_last][idx_]) { already_counted[i_after_last][idx_] = (short)1; i_after_last++; } else break; } int sz = (i_after_last - i); main_res += (sz * (sz + 1)) / 2; } } } } cout << main_res << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d; while (~scanf( %d%d%d%d , &a, &b, &c, &d)) { int t = d - c; if (c - b == t && b - a == t) { printf( %d n , d + t); } else if (a != 0 && b != 0 && c != 0 && d != 0 && b * b == a * c && c * c == b * d && d * d % c == 0) { printf( %d n , d * d / c); } else printf( 42 n ); } return 0; }
#include <bits/stdc++.h> using namespace std; int read() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } int n, d; long long k, now; int a[1005][1005]; void Dfs(int u, int i) { if (a[u][i] == k) { a[u][i] = 0; a[u][i + 1]++; Dfs(u, i + 1); } } int main() { n = read(); k = read(); d = read(); int t = n; for (int i = 1; i <= d; i++) t = t / k + (int)(t % k > 0); memset(a, 0, sizeof(a)); if (t == 1) { for (int u = 2; u <= n; u++) { for (int i = 1; i <= d; i++) a[u][i] = a[u - 1][i]; a[u][1] += 1; Dfs(u, 1); } for (int i = 1; i <= d; i++) { for (int j = 1; j <= n; j++) printf( %d , a[j][i] + 1); puts( ); } } else puts( -1 ); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long int n, k, i, j, mx, ans = 0; cin >> n >> k; long long int arr[n]; for (i = 0; i < n; i++) cin >> arr[i]; sort(arr, arr + n); for (i = 0; i < n / 2; i++) swap(arr[i], arr[n - 1 - i]); for (i = 0; i < n; i++) { mx = 0; for (j = 0; j < k && i + j < n; j++) { mx = max(mx, arr[i + j]); } ans += (2 * (mx - 1)); i += k - 1; } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int t, n, m; int tot; int op[1005 * 1005 * 3][7]; string s; int a[1005][1005]; int p[1005][1005]; int sum; void check(int x1, int x2, int x3, int x4, int x, int y, int add) { sum = x1 + x2 + x3 + x4; if (!sum) return; if (sum == 1) { if (x3 != 1) p[x][y + 1] += add; if (x2 != 1) p[x + 1][y] += add; if (x4 != 1) p[x][y] += add; if (x1 != 1) p[x + 1][y + 1] += add; return; } if (sum == 2) { if (x3 == 1) p[x][y + 1] += add; if (x2 == 1) p[x + 1][y] += add; if (x4 == 1) p[x][y] += add; if (x1 == 1) p[x + 1][y + 1] += add; return; } if (sum == 3) { if (x3 != 1) p[x][y + 1] += add; if (x2 != 1) p[x + 1][y] += add; if (x4 != 1) p[x][y] += add; if (x1 != 1) p[x + 1][y + 1] += add; return; } if (sum == 4) { p[x][y + 1] += add; p[x + 1][y] += add; p[x + 1][y + 1] += add; p[x][y] += add; return; } } namespace solve1 { void main() { for (int i = 1; i < n; i += 2) for (int j = 1; j < m; j += 2) check(a[i][j], a[i][j + 1], a[i + 1][j], a[i + 1][j + 1], i, j, 1); return; } } // namespace solve1 namespace solve2 { void main() { for (int i = 1; i < n; i += 2) for (int j = 1; j < m; j += 2) check(a[i][j], a[i][j + 1], a[i + 1][j], a[i + 1][j + 1], i, j, 1); for (int j = 1; j < m; j += 2) check(0, 0, a[n][j], a[n][j + 1], n - 1, j, 10000); return; } } // namespace solve2 namespace solve3 { void main() { for (int i = 1; i < n; i += 2) for (int j = 1; j < m; j += 2) check(a[i][j], a[i][j + 1], a[i + 1][j], a[i + 1][j + 1], i, j, 1); for (int i = 1; i < n; i += 2) check(0, a[i][m], 0, a[i + 1][m], i, m - 1, 100); return; } } // namespace solve3 namespace solve4 { void main() { for (int i = 1; i < n; i += 2) for (int j = 1; j < m; j += 2) check(a[i][j], a[i][j + 1], a[i + 1][j], a[i + 1][j + 1], i, j, 1); for (int j = 1; j <= m - 2; j += 2) check(0, 0, a[n][j], a[n][j + 1], n - 1, j, 10000); for (int i = 1; i <= n - 2; i += 2) check(0, a[i][m], 0, a[i + 1][m], i, m - 1, 100); check(0, 0, 0, a[n][m], n - 1, m - 1, 1000000); return; } } // namespace solve4 void Print(int x, int y) { if (x % 2 == 1 && y % 2 == 1) printf( %d %d %d %d %d %d n , x, y, x + 1, y, x, y + 1); if (x % 2 == 0 && y % 2 == 1) printf( %d %d %d %d %d %d n , x, y, x - 1, y, x, y + 1); if (x % 2 == 1 && y % 2 == 0) printf( %d %d %d %d %d %d n , x, y, x, y - 1, x + 1, y); if (x % 2 == 0 && y % 2 == 0) printf( %d %d %d %d %d %d n , x, y, x - 1, y, x, y - 1); } void pRint(int x, int y) { if (y == m - 1) { if (x % 2 == 1) printf( %d %d %d %d %d %d n , x, y, x + 1, y, x, y + 1); else printf( %d %d %d %d %d %d n , x, y, x - 1, y, x, y + 1); } else { if (x % 2 == 1) printf( %d %d %d %d %d %d n , x, y, x + 1, y, x, y - 1); else printf( %d %d %d %d %d %d n , x, y, x - 1, y, x, y - 1); } } void prInt(int x, int y) { if (x == n - 1) { if (y % 2 == 1) printf( %d %d %d %d %d %d n , x, y, x + 1, y, x, y + 1); else printf( %d %d %d %d %d %d n , x, y, x, y - 1, x + 1, y); } else { if (y % 2 == 1) printf( %d %d %d %d %d %d n , x, y, x - 1, y, x, y + 1); else printf( %d %d %d %d %d %d n , x, y, x - 1, y, x, y - 1); } } void priNt(int x, int y) { if (x == n - 1 && y == m - 1) printf( %d %d %d %d %d %d n , x, y, x + 1, y, x, y + 1); if (x == n - 1 && y == m) printf( %d %d %d %d %d %d n , x, y, x + 1, y, x, y - 1); if (x == n && y == m - 1) printf( %d %d %d %d %d %d n , x, y, x - 1, y, x, y + 1); if (x == n && y == m) printf( %d %d %d %d %d %d n , x, y, x - 1, y, x, y - 1); } void print() { for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { if ((p[i][j] % 100) & 1) tot++; if ((p[i][j] / 100) & 1) tot++; if ((p[i][j] / 10000) & 1) tot++; if ((p[i][j] / 1000000) & 1) tot++; } printf( %d n , tot); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { if ((p[i][j] % 100) & 1) Print(i, j); if ((p[i][j] / 100) & 1) pRint(i, j); if ((p[i][j] / 10000) & 1) prInt(i, j); if ((p[i][j] / 1000000) & 1) priNt(i, j); } } int main() { scanf( %d , &t); while (t--) { memset(p, 0, sizeof p); tot = 0; scanf( %d %d , &n, &m); for (int i = 1; i <= n; i++) { cin >> s; for (int j = 0; j < m; j++) a[i][j + 1] = (s[j] == 1 ); } if (n % 2 == 0 && m % 2 == 0) solve1::main(); if (n % 2 == 1 && m % 2 == 0) solve2::main(); if (n % 2 == 0 && m % 2 == 1) solve3::main(); if (n % 2 == 1 && m % 2 == 1) solve4::main(); print(); } return 0; }
#include <bits/stdc++.h> using namespace std; long long n, m; long long bin(long long l, long long h) { long long ans; while (l <= h) { long long mid = (l + h) / 2; if (n - (mid * (mid + 1)) / 2 <= 0) { ans = mid; h = mid - 1; } else l = mid + 1; } return ans; } int main() { long long p = 1414213562; cin >> n >> m; if (m >= n) { cout << n << endl; return 0; } long long ans = m; n -= m; long long ans2 = bin(1, p); ans += ans2; cout << ans << endl; }
#include <bits/stdc++.h> int main() { char c; std::set<char> s; while (std::cin >> c) { if ((c >= a ) && (c <= z )) { s.insert(c); } } std::cout << s.size() << n ; }
#include <bits/stdc++.h> using namespace std; char c; string s; set<char> q; int i, sum; int main() { getline(cin, s); for (i = 0; i < s.size(); i++) if (isalpha(s[i])) q.insert(s[i]); cout << q.size() << endl; return 0; }
#include <bits/stdc++.h> using namespace std; vector<string> mas; int n, m; void input() { cin >> n >> m; mas.clear(); mas.resize(n); for (int i = 0; i < n; ++i) cin >> mas[i]; } void solve() { string ans = mas[0]; for (int i = 0; i < m; ++i) { char save = ans[i]; for (char d = a ; d <= z ; d++) { ans[i] = d; bool f = 1; for (int j = 0; j < n; ++j) { int err = 0; for (int c = 0; c < m; ++c) { if (ans[c] != mas[j][c]) err++; } if (err > 1) { f = 0; break; } } if (f) { cout << ans << n ; return; } } ans[i] = save; } cout << -1 n ; } int main() { int Q; cin >> Q; while (Q--) { input(); solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; vector<int> roda(int f, vector<int> valores) { vector<int> temp(valores); if (f == 0) { temp[17] = valores[5]; temp[18] = valores[6]; temp[21] = valores[17]; temp[22] = valores[18]; temp[13] = valores[21]; temp[14] = valores[22]; temp[5] = valores[13]; temp[6] = valores[14]; } else if (f == 1) { temp[3] = valores[17]; temp[4] = valores[19]; temp[16] = valores[3]; temp[14] = valores[4]; temp[10] = valores[16]; temp[9] = valores[14]; temp[17] = valores[10]; temp[19] = valores[9]; } else if (f == 2) { temp[20] = valores[7]; temp[19] = valores[8]; temp[24] = valores[20]; temp[23] = valores[19]; temp[15] = valores[24]; temp[16] = valores[23]; temp[7] = valores[15]; temp[8] = valores[16]; } else if (f == 3) { temp[1] = valores[24]; temp[3] = valores[22]; temp[5] = valores[1]; temp[7] = valores[3]; temp[9] = valores[5]; temp[11] = valores[7]; temp[24] = valores[9]; temp[22] = valores[11]; } else if (f == 4) { temp[2] = valores[23]; temp[4] = valores[21]; temp[6] = valores[6]; temp[8] = valores[8]; temp[10] = valores[10]; temp[12] = valores[12]; temp[23] = valores[23]; temp[21] = valores[21]; } else if (f == 5) { temp[1] = valores[15]; temp[2] = valores[13]; temp[18] = valores[1]; temp[20] = valores[2]; temp[12] = valores[18]; temp[11] = valores[20]; temp[15] = valores[12]; temp[13] = valores[11]; } return temp; } bool checa(vector<int> valores) { for (int i = 0; i < 6; i++) { int cor = valores[1 + i * 4]; for (int j = 1; j < 4; j++) if (valores[1 + i * 4 + j] != cor) return false; } return true; } int main() { vector<int> valores(25); int i; for (i = 1; i < 25; i++) cin >> valores[i]; int resp = 0; for (i = 0; i < 6; i++) { resp = resp || checa(roda(i, valores)); resp = resp || checa(roda(i, roda(i, roda(i, valores)))); } if (resp) puts( YES ); else puts( NO ); }
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 10; const int p = 1e9 + 7; struct edge { int l, r, uk; }; edge a[MAXN]; int dp[4 * MAXN]; int b[MAXN]; int n, m; void update(int k) { dp[k] = (dp[k * 2] + dp[k * 2 + 1]) % p; if (k > 1) update(k / 2); } long long getsum(int v, int ll, int rr, int l, int r) { if (ll > r || rr < l) return 0; if (ll >= l && rr <= r) return dp[v]; return (getsum(v * 2, ll, (ll + rr) / 2, l, r) + getsum(v * 2 + 1, (ll + rr) / 2 + 1, rr, l, r)) % p; } bool operator<(edge a, edge b) { return a.r < b.r; } int binr(int l, int r, int q) { while (l < r - 1) { if (b[(l + r) / 2] < q) l = (l + r) / 2; else r = (l + r) / 2; } return r; } int main() { int i, size = 1, uk, l; cin >> n >> m; while (size < m) { size *= 2; } for (i = 0; i < m; i++) { cin >> a[i].l >> a[i].r; } sort(a, a + m); b[0] = 0; b[1] = a[0].r; uk = 2; for (i = 1; i < m; i++) { if (a[i - 1].r != a[i].r) { b[uk] = a[i].r; uk++; } a[i].uk = uk; } dp[size] = 1; update(size / 2); int uk1 = 1; for (i = 0; i < m; i++) { l = binr(-1, uk - 1, a[i].l); l++; if (i != 0 && a[i - 1].r != a[i].r) uk1++; dp[size + uk1] = (dp[size + uk1] + getsum(1, 1, size, l, uk1)) % p; update((size + uk1) / 2); } uk--; if (a[m - 1].r != n) cout << 0; else cout << dp[size + uk1]; return 0; }
#include <bits/stdc++.h> using namespace std; int a[200]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); int res = 0, ans = 0; a[0] = -10; for (int i = 1; i <= n; i++) { if (a[i] == a[i - 1] + 1) res++; else res = 0; ans = max(res, ans); } ans = max(ans - 1, 0); int f1 = 0; for (int i = 1; i <= n + 1; i++) { if (a[i] == i) { f1++; } } int f2 = 0; for (int i = n; i >= 0; i--) { if (a[i] == (1000 - n + i)) { f2++; } } if (f1 >= n || f2 >= n) { f1 = n; f2 = n; } ans = max(ans, max(f1, f2) - 1); printf( %d n , ans); }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, m; cin >> n >> m; vector<long int> a[n + 1], b[n + 1]; vector<pair<int, int> > v; for (int i = 0; i <= n; i++) a[i].resize(m + 1), b[i].resize(m + 1); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) cin >> a[i][j]; } for (int i = 1; i <= n - 1; i++) { for (int j = 1; j <= m - 1; j++) { if (a[i][j + 1] == 1 && a[i + 1][j] == 1 && a[i + 1][j + 1] == 1 && a[i][j] == 1) { v.push_back(make_pair(i, j)); b[i][j + 1] = 1; b[i][j] = 1; b[i + 1][j] = 1; b[i + 1][j + 1] = 1; } } } int ct = 1; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (a[i][j] != b[i][j]) ct = 0; } } if (ct == 0) cout << -1; else { cout << v.size() << n ; for (int i = 0; i < v.size(); i++) cout << v[i].first << << v[i].second << n ; } }
#include <bits/stdc++.h> using namespace std; int main() { long long i, j, n, a, b, m, k, y, z, cos, pos, color; long long r[5005], c[5005], x[100009]; cin >> n >> m >> k; for (i = 1; i <= k; i++) { cin >> cos >> pos >> color; x[i] = color; if (cos == 1) r[pos] = i; else c[pos] = i; } for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { y = max(r[i], c[j]); cout << x[y] << ; } cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, swaps = 0; vector<int> seq; cin >> n; seq.resize(n * 2); for (int i = 0; i < n * 2; i++) cin >> seq[i]; for (int i = 0; i < 2 * n - 1; i += 2) { int j = i + 1; while (seq[j] != seq[i]) j++; for (int k = j; k > i + 1; k--) { swap(seq[k - 1], seq[k]); swaps++; } } cout << swaps << endl; }
#include <bits/stdc++.h> using namespace std; char s[2000][2000]; int n, m; bool h[300][300]; bool v[300][300]; const long long mod = 1000000007; void get(int x, int y, bool& h, bool& v) { int cnt = 0; for (int i = 0; i < 3; i++) for (int j = 0; j < 3; j++) { if (s[x + i][y + j] == O ) cnt++; } if (cnt == 5 || cnt == 4 || cnt == 1 || cnt == 0) { v = h = true; return; } if (cnt == 2 || cnt == 3) { h = s[x][y] == O ; v = !h; return; } h = (s[x][y + 1] == O ); v = !h; } long long calc1(int y) { if (n % 2 != 0) return 0; for (int i = 0; i < n; i++) if (!v[i][y]) return 0; return 1; } long long tmp[300]; long long dp[300]; long long calc2(int y) { if (y + 1 >= m) return 0; for (int i = 0; i <= n; i++) tmp[i] = 0; tmp[0] = 1; for (int i = 0; i < n; i++) { if (h[i][y] && h[i][y + 1]) { tmp[i + 1] += tmp[i]; tmp[i + 1] %= mod; } if (i < n - 1 && v[i][y] && v[i + 1][y] && v[i + 1][y + 1] && v[i][y + 1]) { tmp[i + 2] += tmp[i]; tmp[i + 2] %= mod; } } if (calc1(y) && calc1(y + 1)) tmp[n] = (tmp[n] - 1 + mod) % mod; return tmp[n]; } int main() { scanf( %d %d n , &n, &m); for (int i = 0; i < 4 * n + 1; i++) { gets(s[i]); } for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) get(4 * i + 1, 4 * j + 1, h[i][j], v[i][j]); dp[0] = 1; for (int i = 0; i < m; i++) { dp[i + 1] += dp[i] * calc1(i); dp[i + 2] += dp[i] * calc2(i); dp[i + 1] %= mod; dp[i + 2] %= mod; } cout << dp[m] << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 5; long long a[N]; long long dp[N][20]; int main() { int n, m, k; cin >> n >> m >> k; a[0] = 0; for (int i = 1; i <= m; i++) dp[0][i] = -1e10; long long ans = 0; for (int i = 1; i <= n; i++) { scanf( %lld , &a[i]); for (int j = 1; j <= m; j++) { if (j == 1) dp[i][j] = max(a[i] - k, dp[i - 1][m] + a[i] - k); else dp[i][j] = dp[i - 1][j - 1] + a[i]; ans = max(ans, dp[i][j]); } } printf( %I64d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int n; long long ar[100100]; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> ar[i]; } sort(ar, ar + n); long long dif1 = ar[1] - ar[0], dif2 = -1; int cnt1 = 0, cnt2 = 0; if (n == 1) { cout << -1 << endl; return 0; } else if (n == 2) { if (ar[0] == ar[1]) { cout << 1 << endl << ar[0]; return 0; } else { if ((ar[0] + ar[1]) % 2 == 0) { cout << 3 << endl << ar[0] - (ar[1] - ar[0]) << << (ar[1] + ar[0]) / 2 << << ar[1] + (ar[1] - ar[0]) << endl; return 0; } else { cout << 2 << endl << ar[0] - (ar[1] - ar[0]) << << ar[1] + (ar[1] - ar[0]) << endl; return 0; } } } else { set<long long> nd; set<long long> ans; for (int i = 1; i < n; i++) { nd.insert(ar[i] - ar[i - 1]); } if (nd.size() > 2) { cout << 0 << endl; } else if (nd.size() == 1) { ans.insert(ar[0] - (ar[1] - ar[0])); ans.insert(ar[n - 1] + (ar[1] - ar[0])); cout << ans.size() << endl; for (auto it : ans) { cout << it << endl; } } else { int ls1 = -1, ls2 = -1; dif1 = *nd.begin(); dif2 = *(++nd.begin()); if (dif1 != 2 * dif2 && dif2 != 2 * dif1) { cout << 0 << endl; return 0; } for (int i = 1; i < n; i++) { if (ar[i] - ar[i - 1] == dif1) { cnt1++; ls1 = i; } else { cnt2++; ls2 = i; } } if (cnt1 == 1 && dif1 % 2 == 0 && dif1 > dif2) { cout << 1 << endl; cout << ar[ls1 - 1] + dif2 << endl; return 0; } if (cnt2 == 1 && dif2 % 2 == 0 && dif1 < dif2) { cout << 1 << endl; cout << ar[ls2 - 1] + dif1 << endl; return 0; } cout << 0 << endl; } } return 0; }
#include <bits/stdc++.h> using namespace std; long long a[100009], b[100009], s[100009]; signed main() { ios_base::sync_with_stdio(false), cin.tie(NULL); long long i, j, n, m, c; cin >> n >> m >> c; for (i = 1; i <= n; i++) cin >> a[i]; for (i = 1; i <= m; i++) cin >> b[i], s[i] = (b[i] + s[i - 1]); long long x = n - m; for (i = 1; i <= n; i++) { long long t = min(i, m); long long g = min(i, min(n + 1 - i, x + 1)); long long y = s[t] - s[max(t - g, 0ll)]; a[i] = (a[i] + y) % c; } for (i = 1; i <= n; i++) cout << a[i] << ; }
#include <bits/stdc++.h> using namespace std; long long mas[200004]; long long mas2[200004]; struct ver { long long abs; int number; long long maxabs; int masnumber; ver *l; ver *r; }; void build(ver *v, int l, int r, long long *m) { if (l == r) { v->abs = m[l]; v->number = l; v->masnumber = l; v->maxabs = m[l]; } else { ver *a = new ver; ver *b = new ver; v->l = a; v->r = b; build(a, l, (l + r) / 2, m); build(b, (l + r) / 2 + 1, r, m); if (a->maxabs < b->maxabs) { v->maxabs = b->maxabs; v->masnumber = b->masnumber; } else { v->maxabs = a->maxabs; v->masnumber = a->masnumber; } } } pair<long long, long long> maxver(ver *v, int l, int r, int zl, int zr) { pair<long long, long long> answer; answer.first = -100000; answer.second = 0; if (l > zr || r < zl) return answer; else { if (zl <= l && r <= zr) { answer.first = v->maxabs; answer.second = v->masnumber; return answer; } else { pair<long long, long long> left; pair<long long, long long> right; left = maxver(v->l, l, (l + r) / 2, zl, zr); right = maxver(v->r, (l + r) / 2 + 1, r, zl, zr); if (left.first < right.first) return right; else return left; } } } int main() { ver *root = new ver; int n, k; pair<long long, long long> answer; long long maxans = 0; answer.first = 0; answer.second = 0; cin >> n >> k; for (int i = 1; i <= n; i++) cin >> mas[i]; for (int i = 0; i < 200004; i++) mas2[i] = 0; for (int i = n - k + 1; i <= n; i++) mas2[n - k + 1] += mas[i]; for (int i = n - k; i >= 1; i--) mas2[i] = mas2[i + 1] + mas[i] - mas[i + k]; build(root, 1, n, mas2); for (int i = 1; i <= n - 2 * k + 1; i++) { pair<long long, long long> an = maxver(root, 1, n, i + k, n); if (an.first + mas2[i] > maxans) { maxans = an.first + mas2[i]; answer.first = i; answer.second = an.second; } } cout << answer.first << << answer.second; return 0; }
#include <bits/stdc++.h> using namespace std; double x[100000]; int main() { ios_base::sync_with_stdio(false); int n, m; cin >> n >> m; for (int i = 1; i <= n; i++) cin >> x[i]; double ans = 0; for (int i = 1; i <= m; i++) { int fi, se, we; cin >> fi >> se >> we; ans = max(ans, (x[fi] + x[se]) / (double)(we)); } if (n == 1) { cout << 0.0000000000 << endl; return 0; } cout << fixed << setprecision(10) << ans << endl; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; while (n--) { string s; cin >> s; bool b = true, b1 = false, b2 = true, b3 = false; int sum = 0; for (int i = 0; i < s.size(); i++) { sum += (int)s[i] - 48; int x = (int)s[i] - 48; if (x % 2 == 0) { if (x != 0) b3 = true; if (x == 0 && b2 == false) b3 = true; } if (s[i] == 0 && b2) { b1 = true; b2 = false; } } if (sum % 3 == 0 && b1 && b3) cout << red << endl; else cout << cyan << endl; } }