func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; const long long inf = 1e9 + 7; const long long INF = 1LL << 60; template <class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template <class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } struct UnionFind { vector<long long> par, w; UnionFind(long long n) : par(n, -1), w(n, 0) {} void init(long long n) { par.assign(n, -1); w.assign(n, 0); } long long root(long long x) { if (par[x] < 0) return x; else return par[x] = root(par[x]); } bool issame(long long x, long long y) { return root(x) == root(y); } bool merge(long long x, long long y) { x = root(x); y = root(y); if (x == y) { ++w[x]; return false; } if (par[x] > par[y]) swap(x, y); par[x] += par[y]; par[y] = x; w[x] += w[y]; ++w[x]; return true; } long long size(long long x) { return -par[root(x)]; } long long wei(long long x) { return w[root(x)]; } }; void solve() { long long n, m, q; cin >> n >> m >> q; UnionFind uf(n + m); long long cnt = n + m; for (long long i = 0; i < q; ++i) { long long r, c; cin >> r >> c; --r, --c; if (!uf.issame(r, c + n)) { uf.merge(r, c + n); --cnt; } } cout << cnt - 1 << n ; } signed main() { ios::sync_with_stdio(false); cin.tie(0); solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; struct union_find { vector<int> uf; vector<int> num_segments; vector<bool> used; union_find(int n) { uf.assign(n, -1); num_segments.assign(n, 0); used.assign(n, false); for (int i = 0; i < n; ++i) { if (i % 2 == 0) num_segments[i] = 1; } } int find(int i) { if (uf[i] < 0) return i; else return uf[i] = find(uf[i]); } bool merge(int a, int b) { a = find(a); b = find(b); if (a == b) return false; if (uf[a] <= uf[b]) { uf[b] = a; if (uf[a] == uf[b]) { uf[a]--; } num_segments[a] = min(num_segments[a] + num_segments[b], 2 * (int)uf.size()); used[a] = used[a] || used[b]; } else if (uf[b] < uf[a]) { uf[a] = b; num_segments[b] = min(num_segments[a] + num_segments[b], 2 * (int)uf.size()); used[b] = used[a] || used[b]; } return true; } }; int main() { ios::sync_with_stdio(false); cin.tie(0); int N, K; cin >> N >> K; string s; cin >> s; vector<vector<int>> groups(K); vector<vector<int>> groups_for_bit(N); for (int i = 0; i < K; ++i) { int k; cin >> k; groups[i].resize(k); for (int j = 0; j < k; ++j) { cin >> groups[i][j]; groups[i][j]--; groups_for_bit[groups[i][j]].push_back(i); } } auto inverse = [](int x) { return x ^ 1; }; union_find uf(2 * K); int num_segments = 0; auto unset = [&](int i) { if (uf.used[i]) { uf.used[i] = false; num_segments -= uf.num_segments[i]; ; } }; auto set = [&](int i) { assert(!uf.used[i]); uf.used[i] = true; num_segments += uf.num_segments[i]; ; }; for (int i = 0; i < N; ++i) { ; int g = -1; if (groups_for_bit[i].size() == 0) { ; } else if (groups_for_bit[i].size() == 1) { g = uf.find(2 * groups_for_bit[i][0]); int ig = uf.find(inverse(g)); ; unset(g); unset(ig); if (s[i] == 0 ) { uf.num_segments[ig] = N * 3; } else { uf.num_segments[g] = N * 3; } } else { g = uf.find(2 * groups_for_bit[i][0]); int h = uf.find(2 * groups_for_bit[i][1]); int ig = uf.find(inverse(g)); int ih = uf.find(inverse(h)); ; ; unset(g); unset(ig); unset(h); unset(ih); if (s[i] == 0 ) { uf.merge(ig, h); uf.merge(g, ih); } else { uf.merge(g, h); uf.merge(ig, ih); } } if (g >= 0) { g = uf.find(g); int ig = uf.find(inverse(g)); set(uf.num_segments[g] <= uf.num_segments[ig] ? g : ig); } cout << num_segments << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const pair<int, int> Dir[8] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}, {1, 1}, {1, -1}, {-1, -1}, {-1, 1}}; template <typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val) { std::fill((T *)array, (T *)(array + N), val); } signed main() { long long n; scanf( %lld , &n); long long dp[2] = {1, 2}; long long turn = 1; while (1) { long long next = dp[0] + dp[1]; if (next > n) { break; } dp[0] = dp[1]; dp[1] = next; turn++; } printf( %lld n , turn); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, k, ad, a[444444], u[444444]; char str[11]; int getnum(char str[]) { int ret = 0, neg = -1, i = 1; if (str[0] != - ) { neg = 1; i = 0; } for (; str[i]; i++) { ret = ret * 10 + str[i] - 0 ; } ret *= neg; return ret; } int main() { int i, j, fg = 0, nd, pd, ll, lt, rt, ds, mid, ld; scanf( %d%d , &n, &k); ad = k; for (i = 1; i <= n; i++) { scanf( %s , str); if (str[0] == ? ) a[i + ad] = 1; else u[i + ad] = getnum(str); } for (i = 1; i <= ad; i++) { u[i] = -1010000000 + i; u[ad + n + i] = 1010000000 + i; } for (i = 1; i <= k; i++) { if (fg) break; nd = pd = -1; ll = u[i]; for (j = i + k; j <= n + 2 * ad; j += k) { if (a[j]) continue; if (u[j] <= ll) { fg = 1; break; } ll = u[j]; } if (fg) break; for (j = i; j <= n + 2 * ad; j += k) { if (pd == -1 && !a[j] && u[j] >= 0) { pd = j; break; } } for (j = pd; j >= 1; j -= k) { if (nd == -1 && !a[j] && u[j] < 0) { nd = j; break; } } for (j = pd + k; j <= n + 2 * ad; j += k) { ld = j - k; if (!a[j]) { if (u[ld] >= u[j]) fg = 1; continue; } if (fg) break; a[j] = 0; u[j] = u[ld] + 1; } if (fg) break; for (j = nd - k; j >= 1; j -= k) { ld = j + k; if (!a[j]) { if (u[j] >= u[ld]) fg = 1; continue; } if (fg) break; a[j] = 0; u[j] = u[ld] - 1; } mid = (pd - nd) / k - 1; if (mid > u[pd] - u[nd]) { fg = 1; break; } lt = -((mid - 1) / 2); rt = mid / 2; if (u[pd] <= rt) { ds = rt - u[pd] + 1; rt -= ds; lt -= ds; } if (u[nd] >= lt) { ds = u[nd] - lt + 1; rt += ds; lt += ds; } for (j = nd + k; j < pd; j += k) { u[j] = lt; lt++; } } if (fg) puts( Incorrect sequence ); else { for (i = k + 1; i <= k + n; i++) printf( %d , u[i]); puts( ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int kMod = 10007; char buf[222]; int m, n, l; int dp[222][222][222]; int f[222]; int s; struct Matrix { int v[444][444]; void clear() { memset(v, 0, sizeof(v)); } } I, A, F; Matrix operator*(const Matrix &a, const Matrix &b) { Matrix c; c.clear(); for (int i = 0; i < s; ++i) for (int k = 0; k <= i; ++k) if (a.v[i][k]) for (int j = 0; j <= k; ++j) if (b.v[k][j]) c.v[i][j] = (c.v[i][j] + a.v[i][k] * b.v[k][j]) % kMod; return c; } Matrix powMod(const Matrix &a, int b) { Matrix res = I, tmp = a; while (b) { if (b & 1) res = res * tmp; b >>= 1; tmp = tmp * tmp; } return res; } int main() { scanf( %s , buf + 1); m = strlen(buf + 1); scanf( %d , &n); l = m + n; if (buf[1] != buf[m]) { dp[0][0][1] = 1; } else { dp[0][0][0] = 1; } for (int l = 0; l < m; ++l) { for (int r = 0; r < m - l; ++r) { for (int k = 0; k < 222; ++k) if (dp[l][r][k]) { if (buf[l + 1] != buf[m - r]) { int i, j; i = l + 1, j = r; if (buf[i + 1] != buf[m - j]) { dp[i][j][k + 1] += dp[l][r][k]; dp[i][j][k + 1] %= kMod; } else { dp[i][j][k] += dp[l][r][k]; dp[i][j][k] %= kMod; } i = l, j = r + 1; if (buf[i + 1] != buf[m - j]) { dp[i][j][k + 1] += dp[l][r][k]; dp[i][j][k + 1] %= kMod; } else { dp[i][j][k] += dp[l][r][k]; dp[i][j][k] %= kMod; } } else { int i, j; i = l + 1, j = r + 1; if (i + j >= m) { f[k] += dp[l][r][k]; f[k] %= kMod; } else { if (buf[i + 1] != buf[m - j]) { dp[i][j][k + 1] += dp[l][r][k]; dp[i][j][k + 1] %= kMod; } else { dp[i][j][k] += dp[l][r][k]; dp[i][j][k] %= kMod; } } } } } } s = (m - 1) + ((m - 1) / 2 + 1) * 2; for (int i = 0; i < s; ++i) I.v[i][i] = 1; for (int i = 0; i < m - 1; ++i) { A.v[i + 1][i]++; A.v[i][i] += 24; } for (int i = m - 1; i < (m - 1) + ((m - 1) / 2 + 1); ++i) { if (i + 1 < (m - 1) + ((m - 1) / 2) + 1) A.v[i + 1][i]++; A.v[i][i] += 25; A.v[(m - 1) + ((m - 1) / 2 + 1) + (i - (m - 1))][i]++; } for (int i = (m - 1) + ((m - 1) / 2 + 1); i < s; ++i) { A.v[i][i] += 26; } for (int i = 0; i < m; ++i) { F.v[i][i] = 1; } F = powMod(A, (l - 1) / 2 + 1) * F; int ans = 0; for (int k = 0; k < 222; ++k) if (f[k]) { int n24 = k, n25 = (m - k - 1) / 2 + 1; int from = (m - 1) - k; int to = (m - 1) + ((m - 1) / 2 + 1) + n25 - 1; ans = (ans + F.v[to][from] * f[k]) % kMod; } if (l & 1) { F.clear(); for (int i = 0; i < m; ++i) { F.v[i][i] = 1; } F = powMod(A, (l - 1) / 2) * F; for (int k = 0; k < 222; ++k) if (f[k]) { int n24 = k, n25 = (m - k - 1) / 2 + 1; if ((m - n24) % 2 == 0) { int from = (m - 1) - k; int to = (m - 1) + n25 - 1; ans -= F.v[to][from] * f[k] % kMod; if (ans < 0) ans += kMod; } } } printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int c, t, n, a[1000005], b[1000005], used[100005]; int main() { cin >> t; while (t--) { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; used[i] = 0; } for (int i = 1; i <= n; i++) cin >> b[i]; if (n % 2 == 1 && a[n / 2 + 1] != b[n / 2 + 1]) { cout << NO << endl; continue; } c = 1; long long int l, r; if (n % 2 == 1) l = n / 2, r = n / 2 + 2; else l = n / 2, r = n / 2 + 1; for (int j = l; j >= 1; j--) { long long int ok = 1; for (int i = 1; i <= n / 2; i++) { if (used[i] == 1) continue; if ((a[i] == b[l] && a[n - i + 1] == b[r]) || (a[i] == b[r] && a[n - i + 1] == b[l])) { used[i] = 1; ok = 0; break; } } if (ok == 1) { c = 0; break; } l--; r++; } if (c == 1) cout << YES << endl; else cout << NO << endl; } }
|
#include <bits/stdc++.h> #define mp make_pair #define fi first #define se second #define pb push_back #define eb emplace_back #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define forn(i, n) for (int i = 0; i < (int)(n); ++i) #define for1(i, n) for (int i = 1; i <= (int)(n); ++i) #define ms(x, y) memset(x, y, sizeof(x)) #define SZ(x) int(x.size()) #define fk cout<< fk <<endl #define db(x) cout<<(#x)<< = <<(x)<<endl #define db2(x,y) cout<<(#x)<< = <<(x)<< <<(#y)<< = <<(y)<<endl using namespace std; typedef pair<int, int> pii; typedef vector<int> vi; typedef long long i64; template<class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; } template<class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; } void fastio(){ios::sync_with_stdio(false); cin.tie(0); cout.precision(10); cout<<fixed;} //1.integer overflow (1e5 * 1e5) (2e9 + 2e9) //2.runtime error //3.boundary condition int tc,n,k,cnt[30],need[30]; string s; int main() { fastio(); cin>>tc; while(tc--){ cin>>n>>k; cin>>s; ms(cnt,0); for(int i=0; i<n; ++i){ int num=int(s[i])-int( a ); ++cnt[num]; } bool ok=true; for(int i=0; i<26; ++i){ if(cnt[i]%k!=0) ok=false; } if(ok){ cout<<s<< n ; continue; } bool have=false; string ans= ; for(int i=n-1; i>=0; --i){ string res= ; int cur=int(s[i])-int( a ); --cnt[cur]; if(cur==25) continue; int all_need=0; ms(need,0); for(int j=0; j<26; ++j){ int goal=(cnt[j]+k-1)/k*k; need[j]=goal-cnt[j]; all_need+=goal-cnt[j]; } if(all_need<=n-i){ if(all_need==n-i){ int find=-1; for(int j=cur+1; j<26; ++j){ if(need[j]>0){ find=j; break; } } if(find!=-1){ have=true; for(int j=0; j<i; ++j) res+=s[j]; char ch=char(int( a )+find); res+=ch; --need[find]; for(int j=0; j<26; ++j){ while(need[j]>0){ char ch_temp=char(int( a )+j); res+=ch_temp; need[j]--; } } ans=res; break; } } else{ if(((n-i)-all_need)%k==0){ int find=-1; for(int j=cur+1; j<26; ++j){ if(need[j]>0){ find=j; break; } } if(find==cur+1){ need[0]+=(n-i)-all_need; have=true; for(int j=0; j<i; ++j) res+=s[j]; res+=char(int( a )+cur+1); --need[cur+1]; for(int j=0; j<26; ++j){ while(need[j]>0){ res+=char(int( a )+j); --need[j]; } } ans=res; break; } else{ need[cur+1]+=k; need[0]+=(n-i)-all_need-k; have=true; for(int j=0; j<i; ++j) res+=s[j]; res+=char(int( a )+cur+1); --need[cur+1]; for(int j=0; j<26; ++j){ while(need[j]>0){ res+=char(int( a )+j); --need[j]; } } ans=res; break; } } } } } // if(have) assert(SZ(ans)==n); if(have) cout<<ans<< n ; else cout<<-1<< n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m; int main() { scanf( %d%d , &n, &m); if (n > m) swap(n, m); int ans; if (n == 1) ans = m; else if (n == 2) { if (m % 4 <= 2) ans = m + m % 4; else ans = m + 1; } else ans = (n * m + 1) / 2; printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) using namespace std; long long gcd(long long a, long long b) { return (b == 0) ? a : gcd(b, a % b); } long long lcm(long long a, long long b) { return ((a * b) / (gcd(a, b))); } bool compare(const pair<long long, long long> &a, const pair<long long, long long> &b) { return a.second < b.second; } long long ceil(long long a, long long b) { return (a + b - 1) / b; } long long binpowmod(long long a, long long b, long long m) { long long res = 1; while (b > 0) { if (b & 1) { res = ((res % m) * (a % m)) % m; } a = ((a % m) * (a % m)) % m; b >>= 1; } res %= m; return res; } long long binpow(long long a, long long b) { long long res = 1; while (b > 0) { if (b & 1) { res = ((res) * (a)); } a = ((a) * (a)); b >>= 1; } return res; } void swap(long long *a, long long *b) { long long temp = *a; *a = *b; *b = temp; } long long sum_digits(long long x) { long long s = 0; while (x) { s += (x % 10); x /= 10; } return s; } bool is_perfect_square(long long n) { return (floor(double(sqrt(n))) == ceil(double(sqrt(n)))); } vector<int> pr; void prime() { const int N = 10000000; int lp[N + 1] = {0}; for (int i = 2; i <= N; ++i) { if (lp[i] == 0) { lp[i] = i; pr.push_back(i); } for (int j = 0; j < (int)pr.size() && pr[j] <= lp[i] && i * pr[j] <= N; ++j) lp[i * pr[j]] = pr[j]; } } long long bs(vector<long long> &arr, long long l, long long r, long long x) { long long mid = 0; if (r >= l) { mid = l + (r - l) / 2; if (arr[mid] == x) return mid; if (arr[mid] > x) return bs(arr, l, mid - 1, x); return bs(arr, mid + 1, r, x); } return -1; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; std::vector<long long> v; int c1 = 0, c2 = 0; for (int i = (0); i < (n); i++) { int x; cin >> x; if (x == 1) c1++; else c2++; } if (c1 == 0) v = std::vector<long long>(n, 2); else if (c2 == 0) v = std::vector<long long>(n, 1); else { v.push_back(2); c2--; v.push_back(1); c1--; while ((c2)--) v.push_back(2); while ((c1)--) v.push_back(1); } for (int i = (0); i < (n); i++) cout << v[i] << ; }
|
#include <bits/stdc++.h> using namespace std; int a[200100]; int sub[200100]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int t; cin >> t; while (t--) { int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } sort(a + 1, a + n + 1); for (int i = 1; i <= n; i++) { sub[i] = sub[i - 1] + a[i - 1]; a[i] = a[i] - sub[i]; } sort(a + 1, a + 1 + n); cout << a[n] << endl; memset(sub, 0, sizeof(sub)); } }
|
#include <bits/stdc++.h> using namespace std; const long long int mod = 1000000007ll; const long long int MOD = 1000000009ll; int local_debug = 0; long long int bit_count(long long int _x) { long long int _ret = 0; while (_x) { if (_x % 2 == 1) _ret++; _x /= 2; } return _ret; } long long int bit(long long int _mask, long long int _i) { long long int x = 1; return (_mask & (x << _i)) == 0 ? 0 : 1; } long long int powermod(long long int _a, long long int _b, long long int _m = mod) { long long int _r = 1; while (_b) { if (_b % 2 == 1) _r = (_r * _a) % _m; _b /= 2; _a = (_a * _a) % _m; } return _r; } long long int power(long long int _a, long long int _b) { long long int _r = 1; while (_b) { if (_b % 2 == 1) _r = (_r * _a); _b /= 2; _a = (_a * _a); } return _r; } long long int add(long long int a, long long int b, long long int m = mod) { a %= m; b %= m; long long int x = a + b; while (x >= m) x -= m; return x; } long long int sub(long long int a, long long int b, long long int m = mod) { long long int x = a - b; while (x < 0) x += m; return x; } long long int mul(long long int a, long long int b, long long int m = mod) { a %= m; b %= m; long long int x = a * b; x %= m; return x; } long long int gcd(long long int a, long long int b) { if (a < b) { a = a ^ b; b = a ^ b; a = a ^ b; } if (b == 0) return a; long long int t; while (b) { t = b; b = a % b; a = t; } return a; } long long int lcm(long long int a, long long int b) { return (a * b) / gcd(a, b); } long long int maxSubArraySum(vector<long long int> a, long long int size) { long long int max_so_far = a[0]; long long int curr_max = a[0]; for (long long int i = 1; i < size; i++) { curr_max = max(a[i], curr_max + a[i]); max_so_far = max(max_so_far, curr_max); } return max_so_far; } int main() { long long int n; scanf( %lld , &n); ; vector<long long> hrr(n); vector<long long> grr(n); for (int i = 0; i < n; i++) { scanf( %lld , &hrr[i]); ; scanf( %lld , &grr[i]); ; } int count = 0; for (int i = 0; i < n; i++) { for (int j = 0; j <= n; j++) { if (hrr[i] == grr[j]) { count++; } } } cout << count << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 105; int atk[N], atk2[N], def2[N]; bool mark[N]; int main() { int n, len; while (scanf( %d%d , &n, &len) != EOF) { int lena = 0, lend = 0, i, j; for (i = 0; i < n; i++) { char s[5]; int v; scanf( %s%d , s, &v); if (s[0] == A ) atk2[lena++] = v; else def2[lend++] = v; } for (int i = 0; i < len; i++) scanf( %d , &atk[i]); sort(atk, atk + len); sort(atk2, atk2 + lena); sort(def2, def2 + lend); memset(mark, false, sizeof(mark)); int ans1 = 0, ans2 = 0; for (i = 0, j = 0; i < lend && j < len; i++) { while (j < len && (mark[j] || atk[j] <= def2[i])) j++; if (j == len) break; mark[j] = true; } if (j < len) { for (i = 0, j = 0; i < lena && j < len; i++) { while (j < len && (mark[j] || atk[j] < atk2[i])) j++; if (j == len) break; mark[j] = true; ans1 += atk[j] - atk2[i]; } if (j < len) { for (i = 0; i < len; i++) if (!mark[i]) ans1 += atk[i]; } else ans1 = 0; } for (i = len - 1, j = 0; i >= 0 && j < lena && atk[i] >= atk2[j]; i--, j++) { ans2 += atk[i] - atk2[j]; } printf( %d n , max(ans1, ans2)); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long n, a[10000], first = -1, val, t = 1; cin >> n; cin >> a[0]; for (int i = 1; i < n; i++) { cin >> a[i]; if (a[i - 1] > a[i] || a[i - 1] == a[i]) t = 0; } if (t == 1) { cout << YES ; return 0; } for (int i = 0; i < n - 1; i++) { if (a[i] > a[i + 1] || a[i] == a[i + 1]) { first = i; val = a[i]; break; } } if (first == -1) { first == n - 1; val = a[n - 1]; } for (int i = 0; a[i] != val; i++) { if (a[i] == a[i + 1]) { cout << NO ; return 0; } } for (int i = first; i < n - 1; i++) { if (a[i] != a[i + 1]) { first = i; break; } if (a[i + 1] == val) { first = i + 1; } } for (int i = first; i < n - 1; i++) { if (a[i] < a[i + 1] || a[i] == a[i + 1]) { cout << NO ; return 0; } } cout << YES ; }
|
#include <bits/stdc++.h> using namespace std; long long int n, a, k; char s[2000007], res[2000007]; bool vis[2000007]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; long long int maxn = -1; for (long long int i = 0; i < n; ++i) { cin >> s >> k; long long int len = strlen(s); long long int cur = INT_MIN; for (long long int j = 0; j < k; ++j) { cin >> a; a--; maxn = max(maxn, a + len); for (long long int jj = max(cur, a); jj <= a + len - 1; ++jj) { if (!vis[jj]) { vis[jj] = 1; res[jj] = s[jj - a]; } } cur = max(cur, a + len - 1); } } for (long long int i = 0; i < maxn; ++i) if (!res[i]) cout << a ; else cout << res[i]; return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimaze( Ofast ); #pragma GCC optimize( unroll-loops ) using namespace std; const long long maxk = 1e8 + 113; const long long maxb = 1e18 + 113; const long long inf = 2e18; struct line { long long k, b; line() { this->k = 0; this->b = 0; } line(long long k, long long b) { this->k = k; this->b = b; } long long func(long long x) { return k * x + b; } }; struct LiChao { vector<line> ms; vector<int> le, re; long long range; LiChao() { this->range = maxk - 113; ms.push_back(line()); le.push_back(-1); re.push_back(-1); } LiChao(long long range) { this->range = range; ms.push_back(line()); le.push_back(-1); re.push_back(-1); } void clear() { ms.clear(); le.clear(); re.clear(); ms.push_back(line()); le.push_back(-1); re.push_back(-1); } void push(int v, bool e) { if (!e && le[v] == -1) { le[v] = ms.size(); ms.push_back(ms[v]); le.push_back(-1); re.push_back(-1); } if (e && re[v] == -1) { re[v] = ms.size(); ms.push_back(ms[v]); le.push_back(-1); re.push_back(-1); } } void add(int v, long long l, long long r, line in) { long long m = (l + r) >> 1; if (l > r) return; if (in.func(m) > ms[v].func(m)) swap(in, ms[v]); if (l == r) return; if (in.func(l) > ms[v].func(l)) { push(v, 0); add(le[v], l, m, in); } else { push(v, 1); add(re[v], m + 1, r, in); } } void add(line in) { add(0, -range, range, in); } long long get(int v, long long l, long long r, long long x) { if (l >= r) return ms[v].func(x); long long m = (l + r) >> 1; if (x <= m) { if (le[v] == -1) return ms[v].func(x); return max(get(le[v], l, m, x), ms[v].func(x)); } else { if (re[v] == -1) return ms[v].func(x); return max(get(re[v], m + 1, r, x), ms[v].func(x)); } } long long get(long long x) { return get(0, -range, range, x); } }; signed main() { srand(1); ios_base::sync_with_stdio(false); cin.tie(NULL); cout.setf(ios::fixed); cout.precision(15); long long n, s; cin >> n >> s; long long df = 0; vector<pair<long long, long long>> ed; for (int i = 0; i < n; i++) { long long v, c; cin >> v >> c; df = max(df, v); ed.push_back({c, -v}); } ed.push_back({s, 1}); sort(ed.begin(), ed.end()); long long range = 1e9 + 113 + s / df; LiChao ms(range); long long le = -1; for (int i = 0; i < ed.size(); i++) { ed[i].second *= -1; long long r = max(le, 1LL); while (ms.get(r) < ed[i].first) r <<= 1; r = min(r, range); while (le + 1 < r) { long long m = (le + r) / 2; if (ms.get(m) < ed[i].first) le = m; else r = m; } if (ed[i].second != -1) { long long k = ed[i].second; ms.add(line(k, -r * k + ms.get(r) - ed[i].first)); le = r; } else { cout << r; return 0; } } }
|
#include <bits/stdc++.h> using namespace std; void read() { freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); } string a1, a2, b1, b2; void check() { if (a1[0] == X ) swap(a1[0], a1[1]); else if (a1[1] == X ) swap(a1[1], a2[1]); else if (a2[1] == X ) swap(a2[1], a2[0]); else if (a2[0] == X ) swap(a2[0], a1[0]); } void solve() { cin >> a1 >> a2 >> b1 >> b2; for (int i = 0; i < 65; ++i) { check(); if (a1 == b1 && a2 == b2) { cout << YES ; return; } } cout << NO ; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int T = 1; while (T--) { solve(); cout << n ; } cerr << nTime elapsed: << 1.0 * clock() / CLOCKS_PER_SEC << s. n ; }
|
#include <bits/stdc++.h> using namespace std; int main() { char s[1000000]; cin >> s; int l = strlen(s); int a[26][2]; char x = 0; int diff = 0; for (int i = 0; i < 26; i++) { a[i][0] = 0; a[i][1] = 0; } for (int i = 0; s[i] != 0 ; i++) { x = (int)s[i]; x = x - 97; diff = i - a[x][1]; if (a[x][0] == 0) { diff++; } if (diff > a[x][0]) { a[x][0] = diff; } a[x][1] = i; } for (int i = 0; i < 26; i++) { diff = l - a[i][1]; if (diff > a[i][0]) { a[i][0] = diff; } } int min = 1000000; for (int i = 0; i < 26; i++) { if ((a[i][0] < min) && (a[i][0] != 0)) { min = a[i][0]; } } cout << min << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T> void debug(T a, T b) { ; } template <class T> void chmin(T& a, const T& b) { if (a > b) a = b; } template <class T> void chmax(T& a, const T& b) { if (a < b) a = b; } namespace std { template <class S, class T> ostream& operator<<(ostream& out, const pair<S, T>& a) { out << ( << a.first << , << a.second << ) ; return out; } } // namespace std const int INF = 7e8; int n; int ar[300005]; int sum[300005]; vector<int> Tpos, Opos; int solve1(int a, int b, int A, int B) { if (B == INF) return INF; if (b == INF) return INF; int Tlen = B - b; int tmp = sum[b] * 1000; int pt = sum[b] * 100; int Trange = Tlen * 2000; tmp += max(0, Trange - pt); pt -= min(Trange, pt); tmp += 1000; pt += 100; int rest = (sum[n] - sum[B + 1]) * 1000; tmp += max(0, rest - pt); return tmp; } int solve2(int a, int b, int A, int B) { if (a == -1) return INF; if (A == -1) return INF; int Tlen = a - A; int tmp = sum[A] * 1000; int pt = sum[A] * 100; tmp += max(0, 1000 - pt); pt -= min(pt, 1000); int Trange = Tlen * 2000; tmp += Trange; pt += Tlen * 200; int rest = (sum[n] - sum[a + 1]) * 1000; tmp += max(0, rest - pt); return tmp; } int main() { cin >> n; Opos.push_back(-1); Tpos.push_back(-1); for (int i = 0; i < (n); ++i) { int a; scanf( %d , &a); ar[i] = a / 1000; if (ar[i] == 1) Opos.push_back(i); else Tpos.push_back(i); } Tpos.push_back(INF); Opos.push_back(INF); for (int i = 0; i < (n); ++i) sum[i + 1] = sum[i] + ar[i]; int res = INF; for (int i = 0; i < (n + 1); ++i) { int tmp = sum[i] * 1000; int pt = sum[i] * 100; int rest = (sum[n] - sum[i]) * 1000; tmp += max(0, rest - pt); chmin(res, tmp); } int prev = res; for (int i = 0; i < ((int)Tpos.size() - 1); ++i) { int a = Tpos[i], b = Tpos[i + 1]; int B = *lower_bound((Opos).begin(), (Opos).end(), b); int A = *(--lower_bound((Opos).begin(), (Opos).end(), a)); int X = solve1(a, b, A, B); int Y = solve2(a, b, A, B); chmin(res, X); chmin(res, Y); } cout << res << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAX = 2e5 + 100, inf = 0x3f3f3f3f; const int mod97 = 1e9 + 7, mod33 = 998244353; const int drc[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}}; struct edge { int to, cap, dis, nt; } e[MAX]; int tot, head[555]; int MinCost, MaxFlow; int n, m, K, Q, H; int ans[205][205]; int a[105][105]; int b[105]; void add(int x, int y, int cap, int dis) { e[tot].to = y; e[tot].cap = cap; e[tot].dis = dis; e[tot].nt = head[x]; head[x] = tot; tot++; } bool Bellman_Ford(int S, int T) { int pre[T + 1], flow[T + 1], dis[T + 1]; bool in[T + 1]; memset(dis, 0x3f, sizeof(dis)); memset(in, 0, sizeof(in)); dis[S] = 0; flow[S] = inf; pre[S] = -1; queue<int> q; q.push(S); in[S] = 1; while (q.size()) { int tmp = q.front(); q.pop(); in[tmp] = 0; for (int i = head[tmp]; ~i; i = e[i].nt) { int j = e[i].to; if (e[i].cap > 0 && dis[j] > dis[tmp] + e[i].dis) { dis[j] = dis[tmp] + e[i].dis; flow[j] = min(flow[tmp], e[i].cap); pre[j] = i ^ 1; if (!in[j]) { q.push(j); in[j] = 1; } } } } if (dis[T] == inf) return 0; MinCost += dis[T] * flow[T]; MaxFlow += flow[T]; for (int i = T; i > 0; i = e[pre[i]].to) { if (i > 0 && i < (n << 1 | 1)) { ans[e[pre[i]].to][i] += flow[T]; } e[pre[i]].cap += flow[T]; e[pre[i] ^ 1].cap -= flow[T]; } return 1; } void Solve() { MaxFlow = MinCost = tot = 0; while (Bellman_Ford(0, n << 1 | 1)) ; int sum = 0; for (int i = 1; i <= n; ++i) sum += b[i]; if (sum != MaxFlow) { puts( NO ); return; } puts( YES ); for (int i = 1; i <= n; ++i) { for (int j = 1; j <= n; ++j) { printf( %d , ans[i][j + n] - ans[j + n][i]); } puts( ); } return; } int Main() { int t = 1; while (t--) { while (~scanf( %d%d , &n, &m)) { memset(head, -1, sizeof(head)); int sum1 = 0; for (int i = 1; i <= n; ++i) { int x; scanf( %d , &x); sum1 += x; add(0, i, x, 0); add(i, 0, 0, 0); add(i, i + n, inf, 0); add(i + n, i, 0, 0); } for (int i = 1; i <= n; ++i) { int x; scanf( %d , &x); sum1 -= x; b[i] = x; add(i + n, n << 1 | 1, x, 0); add(n << 1 | 1, i + n, 0, 0); } for (int i = 1; i <= m; ++i) { int x, y; scanf( %d%d , &x, &y); add(x, y + n, inf, 0); add(y + n, x, 0, 0); add(y, x + n, inf, 0); add(x + n, y, 0, 0); } if (sum1) { puts( NO ); continue; } Solve(); } } return 0; } int main() { return Main(); }
|
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int k = 0, l; int n = s.length(); if (n <= 20) { cout << 1 << << n << endl; cout << s; } else { int m; if (n % 20 == 0) m = n / 20; else m = (n / 20) + 1; if (n % m == 0) { cout << m << << (n / m) << endl; for (int i = 0; i < m; i++) { for (int j = k; j < (n / m) + k; j++) { cout << s[j]; } cout << n ; k = k + (n / m); } } else { cout << m << << (n / m) + 1 << endl; l = n % m; for (int i = 0; i < l; i++) { for (int j = k; j <= (n / m) + k; j++) { cout << s[j]; } cout << << endl; k = k + (n / m) + 1; } for (int y = 0; y < (m - l); y++) { for (int z = k; z < k + (n / m); z++) { cout << s[z]; } k = k + n / m; cout << * << endl; } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; void fastscan(int& number) { bool negative = false; register int c; number = 0; c = getchar(); while (c == 10) c = getchar(); if (c == - ) { negative = true; c = getchar(); } for (; (c > 47 && c < 58); c = getchar()) number = number * 10 + c - 48; if (negative) number *= -1; } const int N = 150005; struct line { long long k, b; line(long long K = 0, long long B = -1000000007ll * 1000000007ll) { k = K; b = B; } }; long long f(line p, long long x) { return p.k * x + p.b; } line t[4 * N]; void cl(int k) { k++; k *= 4; for (int i = 1; i <= k; i++) t[i] = line(); } void add(int v, int l, int r, line p) { int m = (l + r) / 2; bool M = f(p, m) > f(t[v], m); bool L = f(p, l) > f(t[v], l); if (M) swap(p, t[v]); if (r - l == 1) return; if (L != M) add(v * 2, l, m, p); else add(v * 2 + 1, m, r, p); } long long get(int v, int l, int r, int pos) { if (r - l == 1) return f(t[v], pos); int m = (l + r) / 2; if (pos <= m) return max(f(t[v], pos), get(v * 2, l, m, pos)); else return max(f(t[v], pos), get(v * 2 + 1, m, r, pos)); } int n, used[N], color[N], cnt[N], col; long long a[N], ans; vector<int> g[N]; void dfsCnt(int v, int p) { cnt[v] = 1; for (int i = 0; i < g[v].size(); i++) { int to = g[v][i]; if (used[to] || to == p) continue; dfsCnt(to, v); cnt[v] += cnt[to]; } } int centr(int u) { dfsCnt(u, 0); col++; queue<int> q; q.push(u); while (!q.empty()) { int v = q.front(); q.pop(); color[v] = col; int can = 1; if (!can) continue; for (int i = 0; i < g[v].size(); i++) { int to = g[v][i]; if (used[to] || color[to] == col) continue; if (!(cnt[u] >= 2 * cnt[to])) { q.push(to); can = 0; } } if (can) { used[v] = 1; return v; } } assert(0); } vector<line> upd; long long pr[N], sum1[N], sum2[N], st; int k; void dfs(int v, int p, int d) { pr[v] = pr[p] + a[v]; sum1[v] = sum1[p] + d * a[v]; sum2[v] = sum2[p] + pr[v]; cnt[v] = 1; ans = max(ans, get(1, 0, k, d - 1) + sum2[v] - st * d); ans = max(ans, sum1[v]); upd.push_back(line(pr[v], sum1[v])); for (int i = 0; i < g[v].size(); i++) { int to = g[v][i]; if (used[to] || to == p) continue; dfs(to, v, d + 1); cnt[v] += cnt[to]; } } void solve(int v, int K) { v = centr(v); k = max(K, 1); pr[v] = sum1[v] = sum2[v] = st = a[v]; for (int i = 0; i < g[v].size(); i++) { int to = g[v][i]; if (used[to]) continue; dfs(to, v, 2); while (!upd.empty()) { add(1, 0, k, upd.back()); upd.pop_back(); } } cl(k); for (int i = g[v].size() - 1; i >= 0; i--) { int to = g[v][i]; if (used[to]) continue; dfs(to, v, 2); while (!upd.empty()) { add(1, 0, k, upd.back()); upd.pop_back(); } } cl(k); for (int i = 0; i < g[v].size(); i++) { int to = g[v][i]; if (used[to]) continue; solve(to, cnt[to] / 2 + 1); } } int main() { cin >> n; for (int i = 2; i <= n; i++) { int a, b; fastscan(a); fastscan(b); g[a].push_back(b); g[b].push_back(a); } for (int i = 1; i <= n; i++) { int x; fastscan(x); a[i] = x; } solve(1, n / 2 + 1); cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; string s; cin >> s; stack<char> stack; int left = 0, right = 0, size = 0; for (int i = 0; i < s.length(); i++) { stack.push(s[i]); if (s[i] == ( ) { left++; continue; } if (s[i] == ) && left != 0) { left--; stack.pop(); continue; } if (s[i] == ) && left == 0) { right++; continue; } } cout << left << n ; } int main() { int t; cin >> t; while (t--) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; const long long MOD = 998244353; const int maxn = 1000000 + 100; long long n, ans; long long inv[maxn], pro[maxn], invpro[maxn]; void Prepare_C() { inv[1] = 1; for (int i = 2; i < maxn; ++i) { inv[i] = (MOD - MOD / i) * inv[MOD % i] % MOD; } pro[0] = invpro[0] = 1; for (int i = 1; i < maxn; ++i) { pro[i] = pro[i - 1] * i % MOD; invpro[i] = invpro[i - 1] * inv[i] % MOD; } } long long get_C(long long n, long long m) { if (n < m) { return 0; } return pro[n] * invpro[m] % MOD * invpro[n - m] % MOD; } long long Lucas(long long n, long long m) { if (n < MOD && m < MOD) { return get_C(n, m); } long long tmp = get_C(n % MOD, m % MOD); if (tmp == 0) { return 0; } return tmp * Lucas(n / MOD, m / MOD) % MOD; } long long fast_pow(long long x, long long n) { long long ans; for (ans = 1; n != 0; n >>= 1) { if ((n & 1) == 1) { ans = (ans * x) % MOD; } x = (x * x) % MOD; } return ans; } int main() { ios::sync_with_stdio(false); Prepare_C(); while (scanf( %I64d , &n) != EOF) { ans = 0; for (long long i = 1; i <= n; ++i) { long long first = 1; long long second = 1; if (i % 2 == 0) { first = (-1 * first % MOD + MOD) % MOD; second = first; } first = 2 * first % MOD * Lucas(n, i) % MOD * fast_pow(3, (n - i) * n + i) % MOD; long long tmp = ((fast_pow(3, n - i) - 1) % MOD + MOD) % MOD; tmp = ((fast_pow(tmp, n) - fast_pow(3, (n - i) * n)) % MOD + MOD) % MOD; second = 3 * second % MOD * Lucas(n, i) % MOD * tmp % MOD; ans = (ans + first + second) % MOD; } printf( %I64d n , ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; bool myfunction(int i, int j) { return (i < j); } void solve() { long long n; cin >> n; set<long long> st; long long a; for (long long int i = 0; i < n; i++) { cin >> a; st.insert(a); } if (st.size() > 3) { cout << -1; return; } else if (st.size() == 1) { cout << 0; return; } else if (st.size() == 2) { auto it = st.begin(); int a = *it; it++; int b = *it; if ((a + b) % 2 == 0) { cout << (b - a) / 2; } else cout << (b - a); return; } else { auto it = st.begin(); int a = *it; it++; int b = *it; it++; int c = *it; if (c - b != b - a) { cout << -1 ; return; } else cout << b - a; return; } } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int test = 1; while (test--) solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; #define int ll set<int> s; const int N = 200000 + 7; const int M = 998244353; int n; int a[N], pre[2][N], total[N]; int getsumx(int mod, int l, int r) { if (l > r) return 0; return pre[mod][r] - pre[mod][l - 1]; } int get(int pre, int fin) { int in = 0; in = getsumx((pre + 2) % 2, pre + 2, fin + 1); if (fin + 2 <= n) { in += total[n] - total[fin + 1]; } return in; } int megasmart(int nn, int vec[]) { n = nn; int sol = 0; int lim = 0; for (int i = 0; i < n; i++) { a[i] = vec[i + 1]; lim += a[i]; } reverse(a, a + n); for (int i = 1; i <= n; i++) { for (int m = 0; m <= 1; m++) { pre[m][i] = pre[m][i - 1]; } pre[i % 2][i] += a[i - 1]; total[i] = total[i - 1] + a[i - 1]; } lim--; lim /= 2; for (int it = 0; it < 2; it++) { for (int pre = it; pre < n; pre++) { int lo = 0, hi = (n - 1 - pre) / 2, first = n + 1; while (lo <= hi) { int j = (lo + hi) / 2; int fin = pre + 2 * j; bool ok = 0; if (get(pre, fin) <= lim) { ok = 1; } if (ok) { first = j; hi = j - 1; } else { lo = j + 1; } } hi = (n - 1 - pre) / 2; if (first <= hi) { sol += hi - first + 1; } if (n - 4 - pre >= 0) { lo = 0, hi = (n - 4 - pre) / 2; first = n + 1; while (lo <= hi) { int j = (lo + hi) / 2; int fin = pre + 2 * j; bool ok = 0; if (get(pre, fin) - a[n - 1] <= lim) { ok = 1; } if (ok) { first = j; hi = j - 1; } else { lo = j + 1; } } hi = (n - 4 - pre) / 2; if (first <= hi) { sol += hi - first + 1; } } } lim -= a[0]; } lim += 2 * a[0]; { int in = a[0]; for (int i = 1; i < n; i++) { in += a[i]; sol += (in <= lim); } } return sol % M; } int vec[N]; signed main() { ios::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; for (int i = 1LL; i <= n; i++) { cin >> vec[i]; } cout << megasmart(n, vec) << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int in; int a[105][105]; int b[100000]; int max(int l, int n) { int m = a[l][0]; int in = 0; for (int x = 0; x < n; x++) { if (m < a[l][x]) { m = a[l][x]; in = x; } } return in; } int main() { int n, m; cin >> n >> m; int i, j; for (i = 0; i < m; ++i) for (j = 0; j < n; ++j) cin >> a[i][j]; for (j = 0; j < m; ++j) { b[max(j, n)] += 1; } int m1 = b[0]; if (m != 1) for (i = 1; i < m; ++i) { if (m1 < b[i]) { m1 = b[i]; in = i; } } else in = max(0, n); cout << (in + 1); }
|
#include <bits/stdc++.h> using namespace std; int a[51]; int b[51]; int d1[51]; int d2[51]; int main() { int n, l; int i, j, k; cin >> n >> l; for (i = 1; i <= n; i++) { cin >> a[i]; if (i >= 2) d1[i] = a[i] - a[i - 1]; } d1[1] = a[1] + l - a[n]; for (i = 1; i <= n; i++) { cin >> b[i]; if (i >= 2) d2[i] = b[i] - b[i - 1]; } d2[1] = b[1] + l - b[n]; int same = 0; for (i = 1; i <= n; i++) { int flag = 1; for (k = 1, j = i; k <= n; j++, k++) { if (j > n) j = 1; if (d1[j] != d2[k]) { flag = 0; break; } } if (flag == 1) { same = 1; break; } } if (same == 1) cout << YES << endl; else cout << NO << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long int n, i; cin >> n; long long int a[n], b[n], c[n + 1], x = n - 1; for (i = 0; i < n; i++) { b[i] = 0; c[i + 1] = 1; } c[0] = 1; for (i = 0; i < n; i++) { cin >> a[i]; a[i]--; b[a[i]]++; if (a[i] == x) { while (b[x]) { if (x == 0 && b[x]) { x = -1; break; } x--; if (x == 0 && b[x]) { x = -1; break; } } } c[i + 1] += i + 1 - (n - 1 - x); } for (i = 0; i <= n; i++) cout << c[i] << ; }
|
#include <bits/stdc++.h> using namespace std; const int N = 200010, M = 1000010, P = 1e9 + 7; const int inf = 0x3f3f3f3f; const int INF = 0xcfcfcfcf; const double eps = 1e-9, pi = asin(1) * 2; long long read(); int ADD(int a, int b) { return a + b >= P ? a + b - P : a + b; } int MINUS(int a, int b) { return a - b < 0 ? a - b + P : a - b; } int n, k, odd = 0, even = 0; long long read() { long long s = 0; bool flag = false; char ch = getchar(); for (; ch < 0 || ch > 9 ; ch = getchar()) if (ch == - ) flag = true; for (; 0 <= ch && ch <= 9 ; ch = getchar()) s = (s << 3) + (s << 1) + (ch ^ 0 ); if (flag) return -s; return s; } int main() { n = read(), k = read(); for (int i = 1; i <= n; i++) { int x = read(); if (x & 1) odd++; else even++; } if (k == 0) { printf( Daenerys n ); return 0; } if (k == n) { if (odd & 1) printf( Stannis n ); else printf( Daenerys n ); return 0; } if (n - k & 1) { if (odd > even) { if (even <= n - k >> 1) { if ((odd + even) - (n - k) & 1) printf( Stannis n ); else printf( Daenerys n ); } else printf( Stannis n ); } else { if (odd <= n - k >> 1) printf( Daenerys n ); else printf( Stannis n ); } } else { if (odd >= even) { if (even <= (n - k >> 1)) { if ((odd + even) - (n - k) & 1) printf( Stannis n ); else printf( Daenerys n ); } else printf( Daenerys n ); } else printf( Daenerys n ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, m; cin >> n >> m; vector<int> h(n * m + 1), v(m * n + 1); vector<vector<int> > A(n, vector<int>(m)); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> A[i][j]; } } for (int i = 0; i < n; i++) { int a = 0; for (int j = 0; j < m; j++) { a = max(a, A[i][j]); } h[a] = 1; } for (int j = 0; j < m; j++) { int a = 0; for (int i = 0; i < n; i++) { a = max(a, A[i][j]); } v[a] = 1; } vector<vector<int> > ans(n, vector<int>(m)); int x = -1, y = -1; queue<pair<int, int> > q; for (int i = n * m; i >= 1; i--) { x += h[i]; y += v[i]; if (h[i] || v[i]) { ans[x][y] = i; } else { pair<int, int> v = q.front(); q.pop(); ans[v.first][v.second] = i; } if (h[i]) { for (int j = y - 1; j >= 0; j--) { q.push({x, j}); } } if (v[i]) { for (int j = x - 1; j >= 0; j--) { q.push({j, y}); } } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cout << ans[i][j] << ; } cout << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); long int n, m, a; cin >> n >> m >> a; long int colNum = ceil((double)a / (double)(2 * m)); a -= (colNum - 1) * m * 2; long int rowNum = ceil((double)a / 2); a -= rowNum * 2; if (a == 0) cout << colNum << << rowNum << R ; else cout << colNum << << rowNum << L ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int pas = 0, tem, tem1; int n; cin >> n; vector<int> parent(n + 1, 0); int x, y; vector<vector<int> > s(n + 1, (vector<int>(3))); for (int i = 1; i <= n; i++) { cin >> s[i][1] >> s[i][2]; } for (int i = 1; i <= n; i++) { if (parent[i] == 0) { parent[i] = i; pas++; } for (int j = i + 1; j <= n; j++) { if ((s[i][1] == s[j][1]) || (s[i][2] == s[j][2])) if (parent[j] == 0) parent[j] = parent[i]; else { if (parent[i] != parent[j]) { tem = parent[j]; tem1 = parent[i]; for (int h = 1; h <= n; h++) if (parent[h] == tem) parent[h] = tem1; pas--; } } } } pas--; cout << pas; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; const long long inf = (1LL << 60); const double pi = acos(-1); long long powmod(long long a, long long b) { long long res = 1; a %= mod; assert(b >= 0); for (; b; b >>= 1) { if (b & 1) res = res * a % mod; a = a * a % mod; } return res; } inline void pcas(int ca) { printf( Case %d: , ca); } const int maxn = 1e5 + 10; int nex[maxn]; char s[maxn], t[maxn]; int dp[maxn], cnt[maxn]; int lens, lent; void kmp() { nex[0] = -1; int j = -1; int i = 0; while (i < lent) { while (j != -1 && t[i] != t[j]) j = nex[j]; nex[++i] = ++j; } } int main() { scanf( %s , s); scanf( %s , t); lens = strlen(s), lent = strlen(t); kmp(); if (lens < lent) { cout << 0; return 0; } bool flag; for (int i = lent - 1; i < lens; ++i) { flag = 1; for (int j = 0; j < lent; ++j) { if (s[i - j] != t[lent - j - 1] && s[i - j] != ? ) { flag = 0; break; } } dp[i] = dp[i - 1]; if (flag) { cnt[i] = dp[i - lent]; for (int j = nex[lent]; ~j; j = nex[j]) { cnt[i] = max(cnt[i], cnt[i - lent + j]); } cnt[i]++; dp[i] = max(cnt[i], dp[i]); } } printf( %d n , dp[lens - 1]); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; const long long INF = 1e9 + 5; const long long mod = 1e9 + 7; const double pi = 3.1415926536; int main() { ios::sync_with_stdio(0); cin.tie(0); ios_base::sync_with_stdio(0); ; int n, m; cin >> n >> m; bool valid = false; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { int x; cin >> x; if (x == 1 && (i == 0 || j == 0 || i == (n - 1) || j == (m - 1))) valid = true; } } if (valid) cout << 2 n ; else cout << 4 n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { long long n, q; cin >> n >> q; vector<long long> a(n); for (long long i = 0; i < n; i++) { cin >> a[i]; } long long x = 0, y = 0; for (long long i = 0; i < n; i++) { y = max(y, x + a[i]); x = max(x, y - a[i]); } cout << max(x, y) << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long N = 100005; string A; void solve() { long long n, mi = 0, pl = 0; cin >> A; A = + + A; n = A.size() - 1; stack<char> s; for (__typeof((n)) i = (1); i <= (n); i++) { if (s.empty()) s.push(A[i]); else if (s.top() == A[i]) s.pop(); else s.push(A[i]); } if (s.empty()) cout << Yes << n ; else cout << No << n ; } signed main() { long long t; ios_base::sync_with_stdio(false); t = 1; while (t--) solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const double eps = 1e-7; double L, R, m1, m2, a, b, l; double calc(double alp) { return a * sin(alp) + b * cos(alp) - l * sin(alp) * cos(alp); } int main() { scanf( %lf%lf%lf , &a, &b, &l); if (a > b) swap(a, b); if (l <= b) { printf( %.8lf n , min(l, a)); return 0; } L = 0; R = acos(-1) / 2; while (R - L > eps) { m1 = (2 * L + R) / 3; m2 = (L + 2 * R) / 3; if (calc(m1) > calc(m2)) L = m1; else R = m2; } L = min(calc(L), l); if (L < eps) puts( My poor head =( ); else printf( %.8lf n , L); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<vector<int>> v; v.resize(n, vector<int>(7)); for (int i = 0; i < n; i++) { for (int j = 0; j < 7; j++) { scanf( %1d , &v[i][j]); } } int max_rooms = 0, cur = 0; for (int i = 0; i < 7; i++) { for (int j = 0; j < n; j++) { cur += v[j][i]; } max_rooms = max(max_rooms, cur); cur = 0; } cout << max_rooms << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int a; long long x[] = { 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8092, 16184, 32368, 64736, 129472, 258944, 517888, 1035776, 2071552, 4143104, 8286208, 16572416, 33144832, 66289664, 132579328, 265158656, 530317312, 1060634624, 2121269248, 4242538496, 8485076992, 16970153984, 33940307968}; cin >> a; cout << x[a] << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7; int n, m, g[405][405]; int in[405], dpv[405], dpb[405]; int bfs() { queue<int> q; q.push(1); memset(dpv, 0x3f, sizeof dpv); dpv[1] = 0; while (q.size()) { int u = q.front(); q.pop(); for (int i = 1; i <= n; ++i) { if (!g[u][i]) continue; if (dpv[i] == INF) { dpv[i] = dpv[u] + 1; q.push(i); } } } return dpv[n]; } int bfs2() { queue<int> q; q.push(1); memset(dpb, 0x3f, sizeof dpb); dpb[1] = 0; while (q.size()) { int u = q.front(); q.pop(); in[u] = false; for (int i = 1; i <= n; ++i) { if (g[u][i] || dpb[u] + 1 == dpv[i]) continue; if (dpb[i] == INF) { dpb[i] = dpb[u] + 1; q.push(i); } } } return dpb[n]; } int main() { ios_base::sync_with_stdio(0); while (scanf( %d%d , &n, &m) == 2) { memset(g, 0, sizeof g); while (m--) { int u, v; scanf( %d%d , &u, &v); g[u][v] = g[v][u] = 1; } int vehicle = bfs(); if (vehicle == INF) puts( -1 ); else { int bus = bfs2(); if (bus == INF) puts( -1 ); else printf( %d n , max(vehicle, bus)); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, k, mod = 1000000007; char t[2042]; long long dp[2042][2042], suff[2042][2042]; int solve() { dp[n][0] = 1; for (int cInd = n - 1; cInd >= 0; cInd--) { dp[cInd][0] = 1; for (int kLeft = 0; kLeft <= k; kLeft++) { bool f = 0; for (int d = 0; cInd + d + 1 <= n; d++) { if (kLeft - (n - (cInd + d)) * (d + 1) >= 0) { dp[cInd][kLeft] += (1LL * dp[cInd + d + 1][kLeft - (n - (cInd + d)) * (d + 1)] * ( z - t[d + cInd])) % mod; } else { f = 1; break; } } if (f) { for (int d = n - cInd - 1; 1; d--) { if (kLeft - (n - (cInd + d)) * (d + 1) >= 0) { dp[cInd][kLeft] += (1LL * dp[cInd + d + 1][kLeft - (n - (cInd + d)) * (d + 1)] * ( z - t[d + cInd])) % mod; } else { f = 1; break; } } } dp[cInd][kLeft] += (suff[cInd + 1][kLeft] + dp[cInd + 1][kLeft] * (t[cInd] - a )) % mod; dp[cInd][kLeft] %= mod; suff[cInd][kLeft] += (1LL * dp[cInd + 1][kLeft] * (t[cInd] - a ) + suff[cInd + 1][kLeft]) % mod; } } return dp[0][k]; } int main() { cin >> n >> k; cin >> t; cout << solve() << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int c=200002, sok=2e9; long long t[c], kom[c], h[c], ki[c], n, m, maxi; priority_queue<pair<long long, int> > q; vector<pair<long long, int> > ans; int holvan(int a) { if (!ki[a]) { return a; } return ki[a]=holvan(ki[a]); } void unio(int a, int b) { a=holvan(a), b=holvan(b); ki[b]=a; h[a]+=h[b]; } void pb(int l, int r) { long long sum=kom[r]-kom[l-1], d=(r-l+1), atl=(sum-1)/d; q.push({atl, l}); } int main() { ios_base::sync_with_stdio(false); cin >> n >> m; for (int i=1; i<=n; i++) { cin >> t[i]; kom[i]=kom[i-1]+t[i], h[i]=1; if (i<n) { pb(i, i); } } ans.push_back({sok, 0}); n--; while (q.size()>0) { long long ert=q.top().first, id=q.top().second; q.pop(); if (!ki[id]) { maxi=max(maxi, h[id]+h[id+h[id]]-1); ans.push_back({ert, maxi}); int kov=id+h[id]; if (kov!=n+1) { unio(id, kov); pb(id, id+h[id]-1); } } } reverse(ans.begin(), ans.end()); int si=ans.size(); for (int i=si-2; i>=0; i--) { ans[i].first=min(ans[i].first, ans[i+1].first); } for (int i=1; i<=m; i++) { int x; cin >> x; int lo=-1, hi=ans.size(), mid; while (hi-lo>1) { mid=(lo+hi)/2; if (ans[mid].first>=x) { hi=mid; } else { lo=mid; } } cout << ans[hi].second << ; } cout << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; unsigned long long x1, out; unsigned long long Fac(unsigned long long x1) { unsigned long long out = 1; for (int i = 1; i <= x1; i++) out = out * i; return out; } unsigned long long Cnk(unsigned long long a, unsigned long long b, unsigned long long c) { unsigned long long outL = 1; vector<int> fac; if (b > c) { unsigned long long nCount = a - b; for (int i = 2; i <= c; i++) fac.push_back(i); while (nCount > 0) { outL = outL * a; a--; nCount--; for (int i = 0; i < fac.size(); i++) { if (fac[i] > -1 && outL % fac[i] == 0) { outL = outL / fac[i]; fac[i] = -1; } } } } else { unsigned long long nCount = a - c; for (int i = 2; i <= b; i++) fac.push_back(i); while (nCount > 0) { outL = outL * a; a--; nCount--; for (int i = 0; i < fac.size(); i++) { if (fac[i] > -1 && outL % fac[i] == 0) { outL = outL / fac[i]; fac[i] = -1; } } } } for (int i = 0; i < fac.size(); i++) { if (fac[i] > -1) outL = outL / fac[i]; } return outL; } int main() { int n, m, t; cin >> n >> m >> t; for (int i = 4; i <= n; i++) { for (int y = 1; y <= m; y++) { if (i + y != t) continue; out += (Cnk(n, i, n - i) * Cnk(m, y, m - y)); } } cout << out; cin >> x1; }
|
#include <bits/stdc++.h> #pragma comment(linker, /STACK:64000000 ) using namespace std; const int inf = (int)1e9; const int mod = inf + 7; const double eps = 1e-9; const double pi = acos(-1.0); int n; string second; int a[100]; vector<int> g[202]; int dp[77][77][77][4]; int calc(vector<int> &a, int n, vector<int> &b, int m, vector<int> &c, int k) { n = a.size() - n; m = (int)b.size() - m; k = (int)c.size() - k; int x = a[n]; int cnt = 0; for (int i = m; i < b.size(); i++) if (b[i] < x) cnt++; for (int i = k; i < c.size(); i++) if (c[i] < x) cnt++; return cnt; } int get(int a, int b, int c, int ty) { if (a + b + c == 0) return 0; int &res = dp[a][b][c][ty]; if (res != -1) return res; res = inf; if (a > 0) { if (ty != 1) res = min(res, get(a - 1, b, c, 0) + calc(g[0], a, g[1], b, g[2], c)); } if (b > 0) { res = min(res, get(a, b - 1, c, 1) + calc(g[1], b, g[0], a, g[2], c)); } if (c > 0) { res = min(res, get(a, b, c - 1, 2) + calc(g[2], c, g[1], b, g[0], a)); } return res; } int main() { cin >> n >> second; for (int i = 0; i < n; i++) { if (second[i] == V ) a[i] = 1; else if (second[i] == K ) a[i] = 0; else a[i] = 2; g[a[i]].push_back(i); } memset(dp, -1, sizeof dp); cout << get(g[0].size(), g[1].size(), g[2].size(), 3) << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); double t, a, b, c, d, k; cin >> t; while (t--) { cin >> a >> b >> c >> d >> k; double p1, p2; p1 = ceil(a / c); p2 = ceil(b / d); if (p1 + p2 <= k) { cout << p1 << << p2 << endl; } else { cout << -1 << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m; double ax, ay, bx, by, tx, ty, x, y; char s[100100]; double len(double x1, double y1, double x2, double y2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); } int main() { ios_base::sync_with_stdio(false); cin >> ax >> ay >> bx >> by >> tx >> ty; cin >> n; vector<pair<double, int> > v1, v2; double total = 0; for (int i = 0; i < n; i++) { cin >> x >> y; v1.push_back(make_pair(len(ax, ay, x, y) - len(tx, ty, x, y), i)); v2.push_back(make_pair(len(bx, by, x, y) - len(tx, ty, x, y), i)); total += 2 * len(tx, ty, x, y); } sort(v1.begin(), v1.end()); sort(v2.begin(), v2.end()); double res = total; double case1 = total + v1[0].first; double case2 = total + v2[0].first; res = min(case1, case2); if (v1[0].second != v2[0].second) { double case3 = total + v1[0].first + v2[0].first; res = min(res, case3); } else if (n > 1) { double case4 = total + v1[0].first + v2[1].first; res = min(res, case4); double case5 = total + v1[1].first + v2[0].first; res = min(res, case5); } printf( %.10lf , res); return 0; }
|
#include <bits/stdc++.h> int main() { int n; scanf( %d , &n); char arr[n][n + 1]; int i, j, k; int sum = 0; int count; for (i = 0; i < n; i++) scanf( %s , arr[i]); for (i = 0; i < n; i++) { count = 0; for (j = 0; j < n; j++) { if (arr[i][j] == C ) count++; } sum += ((count * (count - 1)) / 2); } for (i = 0; i < n; i++) { count = 0; for (j = 0; j < n; j++) { if (arr[j][i] == C ) count++; } sum += ((count * (count - 1)) / 2); } printf( %d , sum); return 0; }
|
#include <bits/stdc++.h> using namespace std; #define mod1 1000000007 #define mod2 998244353 #define ff first #define ss second #define int long long #define ll unsigned long long #define pb push_back #define mp make_pair #define pii pair<int,int> #define inf 9e18 #define N 15000005 #define pi 2*asin(1.0) #define endl n void fast() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #ifndef ONLINE_JUDGE freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); #endif } int32_t main() { fast(); int t; cin>>t; while(t--){ int n,m; cin>>n>>m; int arr[n]; for(int i=0;i<n;i++){ cin>>arr[i]; } int cnt=n; int len=0; for(int i=n-1;i>=0;i--){ if(arr[i]==cnt){ cnt--; } else{ len=i+1; break; } } double ans=1.0; for(int i=0;i<m;i++){ int r; double p; cin>>r>>p; if(r>=len){ ans=(ans*(1.0-p)); } } ans=1.0-ans; if(len==0) ans=1.0; cout<<fixed<<setprecision(6)<<ans<<endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { for (const auto& x : v) os << x << ; return os << n ; } template <typename T> void operator>>(istream& is, vector<T>& v) { for (auto& x : v) is >> x; } ll power(ll a, ll n) { if (n == 0) { return 1; } ll sqrt_a = pow(a, n / 2); if (n % 2 == 1) { return sqrt_a * sqrt_a * a; } else { return sqrt_a * sqrt_a; } } template <typename T> T sign(T a) { if (a < 0) return -1; if (a > 0) return 1; return 0; } template <typename T> T log_2(T n) { T i = 1; T j = 0; while (i < n) { i *= 2; ++j; } return j; } template <typename T> T mod(T a, T b) { T ans = a % b; return ans < 0 ? ans + b : ans; } ll gcd(ll a, ll b) { while (b) { a %= b; swap(a, b); } return a; } ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } class Node { public: char symbol; bool passed = false; vector<ll> neighbores = vector<ll>(); }; template <typename T> class Compare { public: bool operator()(T& a, T& b) { if (a.first < b.first) { return true; } else if (a.first == b.first) { return a.second < b.second; } else { return false; } } }; vector<ll> divs(ll n) { vector<ll> ans; while (n != 1) { for (ll i = 2; i <= n; ++i) { if (n % i == 0) { ans.push_back(i); n /= i; break; } } } return ans; } void solve() { ll a, b, c; cin >> a >> b >> c; if (a < c) { cout << 1 ; } else { cout << -1 ; } if (b * a > c) { cout << b << n ; } else { cout << -1 n ; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ll t; cin >> t; while (t--) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; string read(char x[]) { scanf( %s , x); return x; } const int N = 8; const int M = 2e5 + 23; int n, m, x[M], y[M], ans; map<int, pair<long long, long long>> mp; void solve() { scanf( %d %d , &n, &m); for (int i = 0; i < n; i++) scanf( %d , x + i); for (int i = 0; i < m; i++) scanf( %d , y + i); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { mp[x[i] + y[j]] = {mp[x[i] + y[j]].first | (1ll << i), mp[x[i] + y[j]].second | (1ll << j)}; } } for (auto v1 : mp) for (auto v2 : mp) { long long m1 = v1.second.first | v2.second.first, m2 = v1.second.second | v2.second.second; ans = max(ans, __builtin_popcountll(m1) + __builtin_popcountll(m2)); } printf( %d , ans); } int main() { solve(); }
|
#include <bits/stdc++.h> using namespace std; bool myfunction(int i, int j) { return (i < j); } int main() { long h[2003]; int n, a, b; scanf( %d%d%d , &n, &a, &b); for (int i = 0; i < n; i++) { scanf( %ld , &h[i]); } sort(h, h + n, myfunction); int x = h[b] - h[b - 1]; printf( %d , x); return 0; }
|
#include <bits/stdc++.h> template <class t> inline void read(t &s) { s = 0; register long long f = 1; register char c = getchar(); while (!isdigit(c)) { if (c == - ) f = -1; c = getchar(); } while (isdigit(c)) s = (s << 3) + (s << 1) + (c ^ 48), c = getchar(); s *= f; return; } template <class t, class... A> inline void read(t &x, A &...a) { read(x); read(a...); } template <class t> inline void write(t x) { if (x < 0) putchar( - ), x = -x; long long buf[21], top = 0; while (x) buf[++top] = x % 10, x /= 10; if (!top) buf[++top] = 0; while (top) putchar(buf[top--] ^ 0 ); return; } inline void setIn(std::string s) { freopen(s.c_str(), r , stdin); return; } inline void setOut(std::string s) { freopen(s.c_str(), w , stdout); return; } inline void setIO(std::string s = ) { setIn(s + .in ); setOut(s + .out ); return; } template <class t> inline bool checkmin(t &x, t y) { if (x > y) { x = y; return 1; } return 0; } template <class t> inline bool checkmax(t &x, t y) { if (x < y) { x = y; return 1; } return 0; } inline long long lowbit(long long x) { return x & (-x); } const long long MaxN = 1e5 + 50; long long f[MaxN], g[MaxN], b[MaxN], n, m; struct BIT { long long a[MaxN]; inline void init() { std::memset(a, 0, sizeof a); } inline void upd(long long x, long long k) { ++x; while (x <= m + 1) checkmax(a[x], k), x += lowbit(x); } inline long long ask(long long x) { ++x; register long long ans = 0; while (x) checkmax(ans, a[x]), x ^= lowbit(x); return ans; } } tr; signed main(void) { read(n, m); register long long l, r; while (n--) read(l, r), ++b[l], --b[r + 1]; for (long long i = 1; i <= m; ++i) b[i] += b[i - 1]; tr.init(); for (long long i = 1; i <= m; ++i) f[i] = tr.ask(b[i]) + 1, tr.upd(b[i], f[i]); tr.init(); for (long long i = m; i; --i) g[i] = tr.ask(b[i]) + 1, tr.upd(b[i], g[i]); register long long ans = 0; for (long long i = 0; i <= m; ++i) checkmax(ans, f[i] + g[i + 1]); write(ans), std::puts( ); return 0; }
|
#include <bits/stdc++.h> using namespace std; int b[1002][1002] = {0}; int main() { int a[8][3] = {{7, 3, 5}, {2, 6, 4}, {1, 5, 7}, {0, 4, 6}, {3, 7, 1}, {0, 2, 6}, {1, 3, 5}, {0, 2, 4}}; int x[8]; int y[8]; int d[8]; int n; int m; int tmpx, tmpy; int sum = 0; cin >> n >> m; if (n == 2) { cout << 0 n ; return 0; } for (int i = 0; i < m; ++i) { cin >> tmpx >> tmpy; b[tmpx][1] = 1; b[tmpx][n] = 1; b[1][tmpy] = 1; b[n][tmpy] = 1; } for (int i = 2; i <= n / 2; ++i) { x[0] = i; x[1] = n + 1 - i; x[2] = n; x[3] = n; x[4] = n + 1 - i; x[5] = i; x[6] = 1; x[7] = 1; y[0] = 1; y[1] = 1; y[2] = i; y[3] = n + 1 - i; y[4] = n; y[5] = n; y[6] = n + 1 - i; y[7] = i; bool g = false; int count; int mx = 0; for (int j = 0; j < 256; ++j) { count = 0; for (int k = 0; k < 8; ++k) { d[k] = ((j >> k) & 1); count += d[k]; } g = false; for (int k = 0; k < 8 && (!g); ++k) { if (d[k] == 1) { if (b[x[k]][y[k]] == 1) { g = true; break; } for (int u = 0; u < 3; ++u) { if (d[a[k][u]] == 1) { g = true; break; } } } } if (g) continue; if (count > mx) mx = count; } sum += mx; } if (n % 2 == 1) { if (b[n / 2 + 1][1] == 0 || b[n / 2 + 1][n] == 0 || b[1][n / 2 + 1] == 0 || b[n][n / 2 + 1] == 0) { ++sum; } } cout << sum << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int M = 100004; unordered_map<string, int> mp; unordered_set<int> st[M]; vector<int> g[M]; string s[M]; int m = 0; int getid(string &t) { if (mp.count(t)) return mp[t]; else { s[++m] = t; return mp[t] = m; } } int val[M]; struct P { int v, s0, s1; } sv[M]; P dfs(int u, int p) { if (g[u].empty()) return P{p, 0, 0}; else if (sv[u].v != -1) return sv[u]; P win = P{-1, -1, -1}, lose = P{-1, -1, -1}; for (int v : g[u]) { P nw = dfs(v, p ^ 1); int s0 = nw.s0, s1 = nw.s1; if (p == 0) { s0 += val[v]; if (nw.v == 1 && (s0 > win.s0 || s0 == win.s0 && s1 < win.s1)) win = P{1, s0, s1}; if (nw.v == 0 && (s0 > lose.s0 || s0 == lose.s0 && s1 < lose.s1)) lose = P{0, s0, s1}; } else { s1 += val[v]; if (nw.v == 0 && (s1 > win.s1 || s1 == win.s1 && s0 < win.s0)) win = P{0, s0, s1}; if (nw.v == 1 && (s1 > lose.s1 || s1 == lose.s1 && s0 < lose.s0)) lose = P{1, s0, s1}; } } if (win.v != -1) return sv[u] = win; else return sv[u] = lose; } int main() { int n; memset(sv, -1, sizeof(sv)); cin >> n; string t; for (int i = 0; i < n; i++) { cin >> t; for (int j = 0; j < t.size(); j++) { string u = ; for (int k = j; k < t.size(); k++) { u += t[k]; int x = getid(u); st[x].insert(i); } } } for (int i = 0; i <= m; i++) { for (char ch = a ; ch <= z ; ch++) { string t = s[i] + ch; if (mp.count(t)) { int x = mp[t]; g[i].push_back(x); } t = string( ) + ch + s[i]; if (mp.count(t)) { int x = mp[t]; g[i].push_back(x); } } int sum = 0, mx = 0; for (char ch : s[i]) { int x = ch - a + 1; mx = max(mx, x); sum += x; } val[i] = sum * mx + st[i].size(); } P p = dfs(0, 0); puts(p.v ? First : Second ); printf( %d %d n , p.s0, p.s1); }
|
#include <bits/stdc++.h> using namespace std; void File() { freopen( CF1045H.in , r , stdin); freopen( CF1045H.out , w , stdout); } template <typename T> void read(T &_) { _ = 0; T f = 1; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) f = -1; for (; isdigit(c); c = getchar()) _ = (_ << 1) + (_ << 3) + (c ^ 0 ); _ *= f; } const int maxn = 5e5 + 10; const int mod = 1e9 + 7; const int N = 1e5; long long fac[maxn], ifac[maxn]; int c[5]; long long qpow(long long x, long long y) { long long ret = 1; x %= mod; while (y) { if (y & 1) ret = ret * x % mod; x = x * x % mod; y >>= 1; } return ret; } void math_init() { fac[0] = 1; for (int i = 1, i_end_ = N; i <= i_end_; ++i) fac[i] = fac[i - 1] * i % mod; ifac[N] = qpow(fac[N], mod - 2); for (int i = N - 1, i_end_ = 0; i >= i_end_; --i) ifac[i] = ifac[i + 1] * (i + 1) % mod; } long long C(int x, int y) { if (x < 0 || y < 0 || x < y) return 0; return fac[x] * ifac[y] % mod * ifac[x - y] % mod; } long long calc(int x, int y) { if (!x && !y) return 1; return C(x + y - 1, y - 1); } long long solve(char *s, bool type) { long long ret = 0; int len = strlen(s + 1), lim = 0, res[5]; for (int i = 0, i_end_ = 3; i <= i_end_; ++i) lim += c[i], res[i] = c[i]; ++lim; if (len < lim) return 0; if (len > lim) { type = 1; len = lim; for (int i = 1, i_end_ = len; i <= i_end_; ++i) s[i] = 1 ; } for (int i = 1, i_end_ = len; i <= i_end_; ++i) { if (i > 2) --res[(s[i - 2] ^ 0 ) << 1 | (s[i - 1] ^ 0 )]; if (s[i] == 0 || i == 1) continue; if (i > 1) --res[(s[i - 1] ^ 0 ) << 1]; if (res[2] >= res[1] - 1 && res[2] <= res[1]) { ret = (ret + calc(res[0], res[2] + 1) * calc(res[3], res[1])) % mod; } if (i > 1) ++res[(s[i - 1] ^ 0 ) << 1]; } if (type) { if (len > 1) --res[(s[len - 1] ^ 0 ) << 1 | (s[len] ^ 0 )]; if (!res[0] && !res[1] && !res[2] && !res[3]) ++ret; } return ret; } int main() { char L[maxn], R[maxn]; math_init(); scanf( %s%s , L + 1, R + 1); for (int i = 0, i_end_ = 3; i <= i_end_; ++i) read(c[i]); printf( %lld n , ((solve(R, 1) - solve(L, 0)) % mod + mod) % mod); return 0; }
|
#include <bits/stdc++.h> using namespace std; int a[1000001]; int l, r; int jum, jaw; int main() { int n, m, k; cin >> n >> m >> k; k--; for (int i = 1; i <= n; i++) { int dum; cin >> dum; a[dum]++; } l = 1; r = m; for (int i = 1; i <= m; i++) { if (a[i] + jum > k) { jaw += jum + a[i] - k; a[i] = k - jum; jum = k; } else { jum += a[i]; } } while (r < 1000000) { r++; jum -= a[l]; l++; if (a[r] + jum > k) { jaw += jum + a[r] - k; a[r] = k - jum; jum = k; } else { jum += a[r]; } } cout << jaw << endl; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1010; int a[maxn]; int main() { int n = 4; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); int sum, ans; sum = ans = 0; ans = a[3]; int l = 0; n = 2; while (n >= 0) { if (ans > sum) sum += a[n--]; else { ans += a[n--]; } } if (ans == sum) cout << YES << endl; else cout << NO << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 50010, K = 11; int n, k; int s[N][K]; struct Data { int mn[K], mx[K]; int cnt; Data() { for (int i = 0; i < K; i++) { mn[i] = 1e9; mx[i] = -1e9; } cnt = 0; } }; bool operator<(const Data &u, const Data &v) { return u.mx[1] < v.mx[1]; return 1; } bool check(const Data &u, const Data &v) { int l = 0, r = 0; for (int i = 1; i <= k; i++) { if (u.mx[i] > v.mn[i]) { r = 1; } if (u.mn[i] < v.mx[i]) { l = 1; } } return l && r; } void update(Data &u, const Data &v) { for (int i = 1; i <= k; i++) { u.mx[i] = max(u.mx[i], v.mx[i]); u.mn[i] = min(u.mn[i], v.mn[i]); } u.cnt += v.cnt; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> k; for (int i = 1; i <= n; i++) { for (int j = 1; j <= k; j++) { cin >> s[i][j]; } } set<Data> a; for (int i = 1; i <= n; i++) { Data foo; for (int j = 1; j <= k; j++) { foo.mx[j] = foo.mn[j] = s[i][j]; foo.cnt = 1; } if (a.empty()) { a.insert(foo); cout << 1 << endl; continue; } while (!a.empty()) { auto it = a.lower_bound(foo); if (it == a.end()) { break; } Data bar = *it; if (check(foo, bar)) { update(foo, bar); a.erase(it); } else { break; } } while (!a.empty()) { auto it = a.lower_bound(foo); if (it == a.begin()) { break; } it--; Data bar = *it; if (check(bar, foo)) { update(foo, bar); a.erase(it); } else { break; } } a.insert(foo); cout << a.rbegin()->cnt << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { while (a > 0 && b > 0) { if (a < b) swap(a, b); a %= b; } return a + b; } const int maxN = (int)1e6 + 10; long long a[maxN]; long long k; vector<long long> factor(long long x) { vector<long long> cur; for (int i = 2; 1LL * i * i <= x; i++) { if (x % i == 0) { while (x % i == 0) { x /= i; } cur.push_back(i); } } if (x > 1) cur.push_back(x); return cur; } int n; int e[maxN]; int vals[maxN][13]; map<long long, int> all; long long dp[10000][20]; long long ndp[10000][20]; vector<pair<int, int> > best[10000]; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> a[i]; } for (int i = 1; i <= n; i++) { cin >> e[i]; } long long d = a[1]; for (int i = 2; i <= n; i++) { d = gcd(d, a[i]); } if (d == 1) { cout << 0; return 0; } auto t = factor(d); vector<pair<long long, int> > ss; for (int i = 1; i <= n; i++) { long long cop = a[i]; for (int j = 0; j < t.size(); j++) { while (cop % t[j] == 0) { cop /= t[j]; vals[i][j]++; } } a[i] /= cop; ss.push_back(make_pair(a[i], e[i])); } sort(ss.begin(), ss.end()); vector<pair<long long, int> > vals; int ii = 0; int m = t.size(); while (ii < ss.size()) { int j = ii; while (j < ss.size() && ss[j].first == ss[ii].first) j++; j--; for (int k = ii; k <= j && k <= ii + m - 1; k++) vals.push_back(ss[k]); ii = j + 1; } for (int i = 0; i < (1 << m); i++) { for (int j = 0; j <= m; j++) { dp[i][j] = (long long)1e18; ndp[i][j] = (long long)1e18; } } dp[0][0] = 0; int r = vals.size(); for (int u = 0; u < vals.size(); u++) { auto f = vals[u]; vector<bool> is_good(1 << m, false); for (int i = 0; i < (1 << m); i++) { for (int j = 0; j <= m; j++) { ndp[i][j] = dp[i][j]; } long long s = 1; long long x = f.first; for (int j = 0; j < m; j++) { if (!(i & (1 << j))) continue; while (x % t[j] == 0) { s *= t[j]; x /= t[j]; } } if (s <= k) { best[i].push_back(make_pair(f.second, u)); is_good[i] = true; } } } vector<bool> need(vals.size(), false); for (int i = 0; i < (1 << m); i++) { sort(best[i].begin(), best[i].end()); for (int j = 0; j < min((int)best[i].size(), m); j++) { need[best[i][j].second] = true; } } for (int u = 0; u < vals.size(); u++) { if (!need[u]) continue; auto f = vals[u]; vector<bool> is_good(1 << m, false); for (int i = 0; i < (1 << m); i++) { for (int j = 0; j <= m; j++) { ndp[i][j] = dp[i][j]; } long long s = 1; long long x = f.first; for (int j = 0; j < m; j++) { if (!(i & (1 << j))) continue; while (x % t[j] == 0) { s *= t[j]; x /= t[j]; } } if (s <= k) { is_good[i] = true; } } for (int i = 0; i < (1 << m); i++) { if (!is_good[i]) continue; int st = ((1 << m) - 1) ^ i; int msk = st; while (true) { for (int j = 0; j < m; j++) { ndp[st | i][j + 1] = min(ndp[st | i][j + 1], dp[st][j] + f.second); } if (st == 0) break; st = (msk & (st - 1)); } } for (int i = 0; i < (1 << m); i++) { for (int j = 0; j <= m; j++) { dp[i][j] = ndp[i][j]; } } } long long mn = (long long)1e18 - 10; bool ok = false; for (int i = 0; i <= m; i++) { if (dp[(1 << m) - 1][i] > (long long)1e16) continue; ok = true; mn = min(mn, i * dp[(1 << m) - 1][i]); } if (ok) cout << mn; else cout << -1; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n, m; cin >> n >> m; int a[n][m], b[n][m]; for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) cin >> a[i][j]; for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) cin >> b[i][j]; for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) if (a[i][j] > b[i][j]) swap(a[i][j], b[i][j]); bool pass = true; for (int i = 0; i < n - 1; ++i) for (int j = 0; j < m - 1; ++j) { if (a[i][j] >= a[i + 1][j] || a[i][j] >= a[i][j + 1] || b[i][j] >= b[i + 1][j] || b[i][j] >= b[i][j + 1]) pass = false; } for (int i = 0; i < m - 1; ++i) if (a[n - 1][i] >= a[n - 1][i + 1] || b[n - 1][i] >= b[n - 1][i + 1]) pass = false; for (int i = 0; i < n - 1; ++i) if (a[i][m - 1] >= a[i + 1][m - 1] || b[i][m - 1] >= b[i + 1][m - 1]) pass = false; pass ? puts( Possible ) : puts( Impossible ); }
|
#include <bits/stdc++.h> using namespace std; int c[120][120], ct[120], n; int ccc[120], Ciel, Jiro, cnt; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , ct + i); int p1 = ct[i] / 2 - 1, p2 = ct[i] - ct[i] / 2; for (int j = 0; j < ct[i]; j++) { scanf( %d , &c[i][j]); if (j <= p1) Ciel += c[i][j]; else if (j >= p2) Jiro += c[i][j]; else ccc[cnt++] = c[i][j]; } } sort(ccc, ccc + cnt); for (int i = cnt - 1; i >= 0; i--) { if ((cnt - i) % 2) Ciel += ccc[i]; else Jiro += ccc[i]; } printf( %d %d n , Ciel, Jiro); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long M = 998244353; long long modpow(long long base, long long exp, long long modulus = M) { base %= modulus; long long result = 1; while (exp > 0) { if (exp & 1) result = (result * base) % modulus; base = (base * base) % modulus; exp >>= 1; } return result; } long long modinv(long long a, long long mod = M) { return modpow(a, mod - 2); } string s; int n; long long f[1000010], invf[1000010]; long long C(long long a, long long b) { if (b > a || b < 0 || a < 0) return 0; return (((f[a] * invf[b]) % M) * invf[a - b]) % M; } int main() { ios::sync_with_stdio(false); cin >> s; n = s.length(); f[0] = invf[0] = 1; for (int i = 1; i <= n; ++i) { f[i] = (f[i - 1] * i) % M; invf[i] = modinv(f[i]); } int lb = 0, rb = 0, lq = 0, rq = 0; for (int i = 0; i < n; ++i) { if (s[i] == ) ) ++rb; else if (s[i] == ? ) ++rq; } long long ans = 0; for (int i = 0; i < n; ++i) { if (s[i] == ) ) --rb; if (s[i] == ( ) ++lb; if (s[i] == ? ) --rq, ++lq; ans += (1ll * lb * C(lq + rq, rq - lb + rb) + 1ll * lq * C(lq + rq - 1, rq - lb + rb - 1)) % M; ans %= M; } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; using PII = pair<int, int>; PII a[300005]; int idx[300005]; map<int, int> mp; int main() { int n; ; scanf( %d , &n); for (int i = 0; i < n; ++i) { scanf( %d %d , &a[i].first, &a[i].second); idx[i] = i; } sort(idx, idx + n, [&](int l, int r) { if (a[l].first != a[r].first) return a[l].first > a[r].first; else return a[l].second < a[r].second; }); bool f = false; for (int i = 0; i < n; ++i) { auto it = mp.upper_bound(a[idx[i]].second); if (it != mp.begin()) { f = true; --it; printf( %d %d n , it->second + 1, idx[i] + 1); break; } else { mp[a[idx[i]].second] = idx[i]; } } if (!f) puts( -1 -1 ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long N = 1e6 + 5; long long n; long long a[N]; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; cin >> n; if (n == 0) { cout << 1 1 ; return 0; } long long l = 1, r = n; for (long long cur = 1; cur <= n; cur += 2) { a[l++] = cur; a[r--] = cur; } l = n + 1; r = 2 * n - 1; for (long long cur = 2; cur <= n; cur += 2) { a[l++] = cur; a[r--] = cur; } for (long long i = 1; i <= 2 * n; i++) { if (a[i] == 0) a[i] = n; cout << a[i] << ; } return 0; }
|
#include <bits/stdc++.h> const double Pi = 3.14159265; const int N = 2e5 + 10; const unsigned long long base = 163; const int INF = 0x3f3f3f3f; const int mod = 1e9 + 7; const double eps = 1e-10; const double pi = acos(-1); using namespace std; long long inv[N]; long long dp[N]; int main() { long long p = mod; long long n; cin >> n; inv[1] = 1; for (int i = 2; i <= n; i++) inv[i] = (p - p / i) * inv[p % i] % p; long long ans = 1; for (int i = n; i >= 2; --i) { dp[i] = n / i * inv[n - n / i]; for (int j = i + i; j <= n; j += i) { dp[i] -= dp[j]; dp[i] %= mod; } dp[i] += mod; dp[i] %= mod; ans += dp[i]; ans %= mod; } cout << ans; return 0; }
|
#include <bits/stdc++.h> const int N = 2e5 + 5; using namespace std; int n, k, m, ans[N], x[N], y[N], mx; map<pair<int, int>, int> Mp; template <typename T> inline T read() { T x = 0, w = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) w = -1; c = getchar(); } while (c >= 0 && c <= 9 ) x = x * 10 + c - 0 , c = getchar(); return x * w; } struct PQ { priority_queue<int> q1, q2; int cnt; PQ() { cnt = 0; } void ins(int x) { cnt++, q1.push(x); } void del(int x) { cnt--, q2.push(x); } int top() { while (!q1.empty() && !q2.empty() && q1.top() == q2.top()) q1.pop(), q2.pop(); return q1.top(); } bool empty() { return !cnt; } } q; struct BIT { int t[N << 2]; int lowbit(int x) { return x & (-x); } void modify(int x, int y) { for (int i = x; i <= mx; i += lowbit(i)) t[i] += y; } int query(int x) { int res = 0; for (int i = x; i; i -= lowbit(i)) res += t[i]; return res; } int kth(int x) { int sum = 0, pos = 0; for (int i = 20; i >= 0; i--) if (pos + (1 << i) <= mx && sum + t[pos + (1 << i)] < x) pos += (1 << i), sum += t[pos]; return pos + 1; } } BIT; struct SegTree { vector<int> vec[N << 2], op[N << 2]; void modify(int p, int l, int r, int ql, int qr, int x) { if (ql <= l && r <= qr) return (void)(vec[p].push_back(x)); int mid = (l + r) >> 1; if (ql <= mid) modify(p << 1, l, mid, ql, qr, x); if (mid < qr) modify(p << 1 | 1, mid + 1, r, ql, qr, x); } void dfs(int p, int l, int r) { for (int x, y, i = 0; i < vec[p].size(); i++) { x = vec[p][i], x = BIT.query(x - 1), x = BIT.kth(x + 1); BIT.modify(x, -1), op[p].push_back(x), q.ins(x); } if (l == r) { ans[l] = q.top() - n; for (int i = 0; i < op[p].size(); i++) BIT.modify(op[p][i], 1), q.del(op[p][i]); return; } int mid = (l + r) >> 1; dfs(p << 1, l, mid), dfs(p << 1 | 1, mid + 1, r); for (int i = 0; i < op[p].size(); i++) BIT.modify(op[p][i], 1), q.del(op[p][i]); } } T; int mabs(int x) { return x > 0 ? x : -x; } int main() { n = read<int>(), k = read<int>(), m = read<int>(); for (int i = 1; i <= m; i++) { x[i] = read<int>(), y[i] = read<int>(); if (!Mp[make_pair(x[i], y[i])]) Mp[make_pair(x[i], y[i])] = i; else { T.modify(1, 1, m, Mp[make_pair(x[i], y[i])], i - 1, y[i] + mabs(x[i] - k)); mx = max(mx, y[i] + mabs(x[i] - k)), Mp[make_pair(x[i], y[i])] = 0; } } for (int i = 1; i <= m; i++) if (Mp[make_pair(x[i], y[i])]) { T.modify(1, 1, m, Mp[make_pair(x[i], y[i])], m, y[i] + mabs(x[i] - k)); mx = max(mx, y[i] + mabs(x[i] - k)), Mp[make_pair(x[i], y[i])] = 0; } mx += m; for (int i = 1; i <= mx; i++) BIT.modify(i, 1); q.ins(n), T.dfs(1, 1, m); for (int i = 1; i <= m; i++) printf( %d n , ans[i]); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long sum[2000005]; int main() { long long n; double k; cin >> n >> k; vector<long long> v; for (int i = 0; i < n; i++) { long long a; cin >> a; v.push_back(a); } for (int i = 1; i <= n; i++) { sum[i] = sum[i - 1] + v[i - 1]; } double total = 0; int go = n - k + 1; for (int i = 0; i < v.size(); i++) { if (go + i - 1 == v.size()) { break; } total += (sum[go + i] - sum[i]) / (double)go; } printf( %.10llf n , total); }
|
#include <bits/stdc++.h> using namespace std; long long rdtsc() { long long tmp; asm( rdtsc : =A (tmp)); return tmp; } inline int myrand() { return abs((rand() << 15) ^ rand()); } inline int rnd(int x) { return myrand() % x; } const int maxn = (int)1600 + 10; int a[maxn][maxn]; int used[maxn][maxn]; int maxu; const int maxg = 4; const int go[maxg][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}}; int cnt; int st[maxn * maxn][2]; int h, w; inline bool ok(int y, int x) { return 0 <= y && 0 <= x && y < h && x < w; } void dfs(int y, int x) { used[y][x] = maxu; st[cnt][0] = y, st[cnt][1] = x, ++cnt; for (int g = 0; g < maxg; ++g) { int ny = y + go[g][0], nx = x + go[g][1]; if (!ok(ny, nx) || used[ny][nx] || !a[ny][nx]) continue; dfs(ny, nx); } } const int K = 6; bool check(int y, int x) { int col = used[y][x]; for (int g = 0; g < maxg; ++g) { int ry = y, rx = x; for (int it = 0; it < K; ++it) { ry += go[g][0], rx += go[g][1]; if (!ok(ry, rx)) break; if (used[ry][rx] != col) return 0; } } return 1; } struct Point { double x, y; Point() {} Point(double _x, double _y) : x(_x), y(_y) {} inline Point operator-(const Point &p) const { return Point(x - p.x, y - p.y); } inline Point operator*(const double k) const { return Point(x * k, y * k); } inline double operator^(const Point &p) const { return x * p.y - y * p.x; } inline double operator*(const Point &p) const { return x * p.x + y * p.y; } inline double abs() const { return sqrt(x * x + y * y); } }; double value[maxn][maxn]; const int K2 = 3; bool solve() { if (scanf( %d%d , &h, &w) < 2) return 0; for (int i = 0; i < h; ++i) { for (int j = 0; j < w; ++j) { scanf( %d , &a[i][j]); } } for (int i = 0; i < h; ++i) { for (int j = 0; j < w; ++j) { used[i][j] = 0; } } maxu = 0; vector<int> ans; for (int i = 0; i < h; ++i) { for (int j = 0; j < w; ++j) { if (used[i][j] || !a[i][j]) continue; ++maxu; cnt = 0; dfs(i, j); assert(cnt >= 500); int cool = 0; long long sumy = 0, sumx = 0; for (int i = 0; i < cnt; ++i) { if (!check(st[i][0], st[i][1])) continue; ++cool; sumy += st[i][0], sumx += st[i][1]; } Point c(sumx, sumy); c = c * (1.0 / cool); int y = -1, x = -1; double maxval = -1; for (int i = 0; i < cnt; ++i) { if (!check(st[i][0], st[i][1])) continue; Point cur(st[i][1], st[i][0]); cur = cur - c; if (maxval < cur.abs()) maxval = cur.abs(), y = st[i][0], x = st[i][1]; } double a = maxval; Point dir(x, y); dir = dir - c; dir = dir * (1.0 / a); maxval = -1; for (int i = 0; i < cnt; ++i) { if (!check(st[i][0], st[i][1])) continue; Point cur(st[i][1], st[i][0]); cur = cur - c; maxval = max(maxval, abs(dir ^ cur)); } double b = maxval; a += K / 2, b += K / 2; fprintf(stderr, a = %.3f, b = %.3f n , a, b); fprintf(stderr, center : (%.3f %.3f) n , c.y, c.x); for (int i = 0; i < cnt; ++i) { Point cur(st[i][1], st[i][0]); cur = cur - c; Point real((cur * dir) / dir.abs(), (cur ^ dir) / dir.abs()); double coef = ((real.x / a) * (real.x / a)) + ((real.y / b) * (real.y / b)); double curValue = (real * max(0.0, (sqrt(coef) - 1.0))).abs(); value[st[i][0]][st[i][1]] = curValue - 5; } int res = 0; for (int i = 0; i < cnt; ++i) { int y = st[i][0], x = st[i][1]; if (value[y][x] < 0) continue; int col = used[y][x]; bool fail = 0; for (int dy = -K2; !fail && dy <= K2; ++dy) { for (int dx = -K2; dx <= K2; ++dx) { int ny = y + dy, nx = x + dx; if (!ok(ny, nx) || used[ny][nx] != col) continue; if (value[ny][nx] > value[y][x] + (1e-9)) { fail = 1; break; } } } if (!fail) { value[y][x] = 1e18; ++res; } } ans.push_back(res); } } sort(ans.begin(), ans.end()); printf( %d n , ((int)(ans).size())); for (int i = 0; i < ((int)(ans).size()); ++i) printf( %d%c , ans[i], n [i == ((int)(ans).size()) - 1]); return 1; } int main() { srand(rdtsc()); while (1) { if (!solve()) break; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 2000000 + 10; int a[N], b[N]; int n, m; int main() { int x, y; scanf( %d%d , &n, &m); { for (int i = 0; i < m; i++) { scanf( %d%d , &x, &y); x--; y--; a[x]++; a[y]++; } for (int i = 0; i < n; i++) b[i] = n - 1 - a[i]; long long total = 0; for (int i = 0; i < n; i++) total += (long long)a[i] * b[i]; total /= 2; cout << (long long)n * (n - 1) / 2 * (n - 2) / 3 - total << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, i, m[6222000], k, a, b, x, y, sum, z, m1[5000]; string s; int main() { cin >> n; for (i = 0; i < n; i++) { cin >> m[i]; } sort(m, m + n); for (i = 1; i < n; i++) { if (m[i] == m[i - 1]) z++; else z = 0; if (z == 2) { cout << NO ; return 0; } } for (i = 1; i < n; i++) { if (m[i] == m[i - 1]) k++; } cout << YES n << n - k << endl; cout << m[0] << ; for (i = 1; i < n; i++) { if (m[i] != m[i - 1]) cout << m[i] << ; } cout << endl << k << endl; reverse(m, m + n); for (i = 0; i < n - 1; i++) { if (m[i] == m[i + 1]) cout << m[i] << ; } }
|
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > vec; int grid1[2050], grid2[2050]; int main() { int n; cin >> n; int r = 0, c = 0; long long ans = 0; for (int i = 1; i <= n; i++) { int x, y; cin >> x >> y; ans += grid1[x + y]; grid1[x + y]++; ans += grid2[x - y + 1000]; grid2[x - y + 1000]++; } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize Ofast using namespace std; const long long BIG_INF = 1e18; const int N = 1e6 + 7; const int T = 1 << 20; template <class T, class G> ostream &operator<<(ostream &os, const pair<T, G> ¶) { os << para.first << << para.second; return os; } template <class T> ostream &operator<<(ostream &os, const vector<T> &vec) { for (const T &el : vec) os << el << ; return os; } template <class T> ostream &operator<<(ostream &os, const set<T> &vec) { for (const T &el : vec) os << el << ; return os; } template <class T> istream &operator>>(istream &is, vector<T> &vec) { for (T &el : vec) is >> el; return is; } template <class T, class G> istream &operator>>(istream &os, pair<T, G> ¶) { os >> para.first >> para.second; return os; } template <class T> void setmax(T &a, T b) { a = (a >= b ? a : b); } template <class T> void setmin(T &a, T b) { a = (a <= b ? a : b); } mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); std::vector<int> zet(const std::string &w) { int n = (int)w.size(); std::vector<int> p(n); int j = 0; for (int i = 1; i < n; ++i) { p[i] = std::max(std::min(p[j] + j - i, p[i - j]), 0); while (p[i] + i < n && w[p[i]] == w[p[i] + i]) p[j = i]++; } return p; } void solve() { int n; cin >> n; string second; cin >> second; vector<vector<int> > zzz; vector<int> dp(n); for (int i = 0; i < n; i++) { string temp = second.substr(i); zzz.push_back(zet(temp)); int dl_suf = n - i; dp[i] = dl_suf; for (int j = 0; j < i; j++) { int dl_wsp = zzz[j][i - j]; if (dl_wsp < dl_suf and second[j + dl_wsp] < second[i + dl_wsp]) setmax(dp[i], dp[j] + dl_suf - dl_wsp); } } int ans = 0; for (auto &u : dp) setmax(ans, u); cout << ans << n ; } signed main() { ios::sync_with_stdio(0); cin.tie(0); int test = 1; cin >> test; for (int i = 1; i <= test; i++) solve(); }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; set<int> adj[maxn * 2 + 20]; int ans[maxn], n; vector<int> ans_eu; map<pair<int, int>, int> mp; void find_eu(int v) { while (adj[v].size()) { int tmp = *adj[v].begin(); adj[v].erase(tmp); adj[tmp].erase(v); find_eu(tmp); } ans_eu.push_back(v); } void solve() { for (int i = 1, tmp = maxn * 2 + 9; i < maxn * 2 + 10; i++) if (adj[i].size() % 2 == 1) adj[tmp].insert(i), adj[i].insert(tmp); for (int i = maxn * 2 + 9; i > 0; i--) { if (adj[i].size()) { ans_eu.clear(); find_eu(i); for (int j = 1; j < ans_eu.size(); j++) if (max(ans_eu[j], ans_eu[j - 1]) != maxn * 2 + 9) ans[mp[{ans_eu[j], ans_eu[j - 1]}]] = j % 2; } } for (int i = 1; i <= n; i++) cout << (ans[i] ? r : b ); cout << endl; } int main() { cin >> n; for (int i = 1, x, y; i <= n; i++) { cin >> x >> y; adj[x].insert(y + maxn); adj[y + maxn].insert(x); mp[{x, y + maxn}] = mp[{y + maxn, x}] = i; } solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0), cin.tie(0); int T; cin >> T; while (T--) { long long p, q; cin >> p >> q; long long ans = -1; for (long long i = 1; i * i <= q; ++i) { long long pp = p; if (q % i == 0) { while (i != 1 and pp % q == 0 and pp % i == 0) { pp /= i; } long long ppp = p; while (ppp % q == 0 and ppp % (q / i) == 0) { ppp /= (q / i); } if (ppp % q != 0) ans = max(ans, ppp); } if (pp % q != 0) ans = max(ans, pp); } assert(ans != -1); cout << ans << n ; } return 0; }
|
#include <bits/stdc++.h> const int N = 100001; int Pri[200005]; int NN, Cnt[100005], Mac[100005]; bool Use[200005]; void GetPrimeList() { int TmpN = sqrt(N); for (int i = 2; i <= N; ++i) Use[i] = true; for (int i = 2; i <= N; ++i) { if (Use[i]) Pri[++Pri[0]] = i; for (int j = 1; j <= Pri[0] && i * Pri[j] <= N; ++j) { Use[i * Pri[j]] = false; if (i % Pri[j] == 0) break; } if (i <= TmpN) NN = Pri[0]; } ++NN; for (int i = 1; i <= N; ++i) Use[i] = false; } int Add(int x) { int t = x; for (int i = 1; i <= NN; ++i) if (t % Pri[i] == 0) { if (Cnt[Pri[i]] != 0) return Mac[Pri[i]]; for (; t % Pri[i] == 0; t /= Pri[i]) ; } if (t != 1 && Cnt[t] != 0) return Mac[t]; t = x; for (int i = 1; i <= NN; ++i) if (t % Pri[i] == 0) { ++Cnt[Pri[i]]; Mac[Pri[i]] = x; for (; t % Pri[i] == 0; t /= Pri[i]) ; } if (t != 1) { ++Cnt[t]; Mac[t] = x; } Use[x] = true; return -1; } void Del(int x) { int t = x; for (int i = 1, j, k; i <= NN; ++i) if (t % Pri[i] == 0) { --Cnt[Pri[i]]; Mac[Pri[i]] = 0; for (; t % Pri[i] == 0; t /= Pri[i]) ; } if (t != 1) { --Cnt[t]; Mac[t] = 0; } Use[x] = false; } int main() { GetPrimeList(); int n, m, num; char op; scanf( %d %d n , &n, &m); for (int i = 1, ret; i <= m; ++i) { scanf( %c %d n , &op, &num); if (op == + ) { if (Use[num]) puts( Already on ); else { ret = Add(num); if (ret == -1) puts( Success ); else printf( Conflict with %d n , ret); } } else { if (!Use[num]) puts( Already off ); else { Del(num); puts( Success ); } } } return 0; }
|
#include <bits/stdc++.h> const int MAXN = 2e5 + 7; struct Edge { int t, next; } edge[MAXN << 1]; int head[MAXN], cnt; std::pair<int, int> p[MAXN]; int color[MAXN]; int n; void add(int u, int v) { edge[++cnt] = (Edge){v, head[u]}; head[u] = cnt; } void dfs(int u, int col) { if (color[u] != -1) return; color[u] = col; for (int e = head[u]; e; e = edge[e].next) { int v = edge[e].t; dfs(v, col ^ 1); } } int main(int argc, char *argv[]) { memset(color, -1, sizeof color); scanf( %d , &n); int l, r; for (int i = 0; i < n; i++) { scanf( %d %d , &l, &r); add(i << 1, i << 1 | 1); add(i << 1 | 1, i << 1); p[i << 1] = std::make_pair(l, i << 1); p[i << 1 | 1] = std::make_pair(r + 1, i << 1 | 1); } std::sort(p, p + 2 * n); for (int i = 0; i < n; i++) { int u = p[i << 1].second, v = p[i << 1 | 1].second; add(u, v), add(v, u); } for (int i = 0; i < n; i++) { if (color[i << 1] == -1) dfs(i << 1, 0); printf( %d , color[i << 1]); } puts( ); return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename A, typename B> inline void chmin(A &a, B b) { if (a > b) a = b; } template <typename A, typename B> inline void chmax(A &a, B b) { if (a < b) a = b; } template <class A, class B> ostream &operator<<(ostream &ost, const pair<A, B> &p) { ost << { << p.first << , << p.second << } ; return ost; } template <class T> ostream &operator<<(ostream &ost, const vector<T> &v) { ost << { ; for (long long i = 0; i < v.size(); i++) { if (i) ost << , ; ost << v[i]; } ost << } ; return ost; } template <class T> vector<long long> zalgorithm(T s) { vector<long long> a(s.size()); a[0] = s.size(); long long i = 1, j = 0; while (i < s.size()) { while (i + j < s.size() && s[j] == s[i + j]) j++; a[i] = j; if (j == 0) { i++; continue; } long long k = 1; while (i + k < s.size() && k + a[k] < j) a[i + k] = a[k], k++; i += k; j -= k; } return a; } long long N, K, M; vector<long long> calcPre(const string &s, const string &p) { string X = s + p; vector<long long> z = zalgorithm(X); vector<long long> a(p.size() + 1); for (long long i = 1; i <= p.size(); i++) { if (z[X.size() - i] == i) a[i] = 1; } return a; } vector<long long> calcSuf(const string &s, const string &p) { string X = p + s; vector<long long> z = zalgorithm(X); vector<long long> a(p.size() + 1); for (long long i = 1; i <= p.size(); i++) { if (z[X.size() - i] == i) a[i] = 1; } return a; } long long calcOcc(const string &s, const string &p) { string X = p + s; vector<long long> z = zalgorithm(X); long long ret = 0; for (long long i = 0; i < s.size(); i++) if (z[p.size() + i] >= p.size()) ret++; return ret; } long long mrg(const vector<long long> &a, const vector<long long> &b) { long long cnt = 0; for (long long i = 0; i < a.size(); i++) if (a[i] && b[b.size() - 1 - i]) cnt++; return cnt; } vector<long long> pre[222], suf[222]; long long occ[222]; vector<string> first; void calc(string s) { long long t; if (N <= 1) { t = 0; } else { t = 2; while (first[t].size() < s.size()) t++; } for (long long k = 0; k < (2); k++) { pre[t + k] = calcPre(first[t + k], s); suf[t + k] = calcSuf(first[t + k], s); occ[t + k] = calcOcc(first[t + k], s); chmin(occ[t + k], K + 1); } long long BC = mrg(suf[t], pre[t + 1]); long long BA = mrg(suf[t], pre[t]); for (long long i = t + 2; i <= N; i++) { occ[i] = occ[i - 1] + occ[i - 2] + BC; chmin(occ[i], K + 1); swap(pre[i], pre[i - 2]); swap(suf[i], suf[i - 2]); swap(BC, BA); } } signed main() { first.push_back( 0 ); first.push_back( 1 ); while (first.back().size() < 10000) { first.push_back(first[first.size() - 2] + first[first.size() - 1]); } cin >> N >> K >> M; K--; string ans; for (long long i = 0; i < M; i++) { if (i) { if (suf[N][ans.size()]) { if (K == 0) break; K--; } } calc(ans + 0 ); long long tmp = occ[N]; if (tmp <= K) { K -= tmp; ans += 1 ; calc(ans); } else { ans += 0 ; } } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<int> v, w; int m; long long int f(int d, int target) { long long int timeSpent = 0; long long int totDone = 0; long long int koytaDone = 0; long long int lastSpent = 0; for (int i = 0; i < v.size(); i++) { if (v[i] <= d) { timeSpent += v[i]; lastSpent += v[i]; koytaDone++; totDone++; if (totDone == target) return timeSpent; } if (koytaDone == m) { koytaDone = 0; timeSpent += lastSpent; lastSpent = 0; } } return LLONG_MAX / 3; } int main() { int t, n, inp; long long int tot; scanf( %d , &t); while (t--) { v.clear(); w.clear(); scanf( %d %d , &n, &m); cin >> tot; while (n--) { scanf( %d , &inp); v.push_back(inp); w.push_back(inp); } sort(w.begin(), w.end()); int lo = 1, hi = w.size(), ans = 0, ans_d = 1; while (lo <= hi) { int mid = (lo + hi) / 2; int tem_d = w[mid - 1]; if (f(tem_d, mid) <= tot) { ans = mid; ans_d = tem_d; lo = mid + 1; } else hi = mid - 1; } cout << ans << << ans_d << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int dp[1123456], p[1123456]; int main() { int n, i, j; scanf( %d , &n); for (i = 0; i < n; ++i) { scanf( %d , &j); p[j] = i; } dp[1] = 1; int ans = 1; for (i = 2; i <= n; ++i) { if (p[i] > p[i - 1]) { dp[i] = 1 + dp[i - 1]; } else { dp[i] = 1; } ans = max(ans, dp[i]); } cout << n - ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int ans[1005]; void calc() { int i, j; for (i = 2; i < 1000; i++) { if (ans[i] == 0) { ans[i] = 1; int k = i; for (j = 2; j <= 10; j++) { if (k * i < 1000) { ans[k * i] = 1; k = k * i; } else break; } for (j = i + i; j <= 1002; j += i) { if (!ans[j]) ans[j] = -1; } } } } int main() { calc(); int n, i; cin >> n; if (n == 1) { cout << 0; return 0; } vector<int> v; for (i = 2; i <= n; i++) { if (ans[i] == 1) v.push_back(i); } cout << v.size() << endl; for (i = 0; i < v.size(); i++) { cout << v[i] << ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int a[1000][1000]; int b[1000][1000]; int f[1000][1000]; int sum[4][1000][1000]; int dx[4] = {0, 0, -1, 1}; int dy[4] = {-1, 1, 0, 0}; int gcd(int a, int b) { if (a % b == 0) { return b; } else { return gcd(b, a % b); } } int main() { int n, m, x = -1, y = -1, g = -1, i, j, k; vector<int> v; vector<int> w; scanf( %d %d , &n, &m); for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { scanf( %d , &a[i][j]); } } for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { if (a[i][j] == 1) { if (j == 0) { sum[0][i][j] = 1; } else { sum[0][i][j] = sum[0][i][j - 1] + 1; } } else { sum[0][i][j] = 0; } } for (j = m - 1; j >= 0; j--) { if (a[i][j] == 1) { sum[1][i][j] = sum[1][i][j + 1] + 1; } else { sum[1][i][j] = 0; } } } for (i = 0; i < m; i++) { for (j = 0; j < n; j++) { if (a[j][i] == 1) { if (j == 0) { sum[2][j][i] = 1; } else { sum[2][j][i] = sum[2][j - 1][i] + 1; } } else { sum[2][j][i] = 0; } } for (j = n - 1; j >= 0; j--) { if (a[j][i] == 1) { sum[3][j][i] = sum[3][j + 1][i] + 1; } else { sum[3][j][i] = 0; } } } for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { if (a[i][j] == 1 && x == -1) { x = i; y = j; } } } for (i = 0; i < n; i++) { int x = 0; for (j = 0; j < m; j++) { if (a[i][j] == 0) { if (x > 1) { if (g == -1) { g = x - 1; } else { g = gcd(g, x - 1); } } x = 0; } else { x++; } } if (x > 1) { if (g == -1) { g = x - 1; } else { g = gcd(g, x - 1); } } } for (i = 0; i < m; i++) { int x = 0; for (j = 0; j < n; j++) { if (a[j][i] == 0) { if (x > 1) { if (g == -1) { g = x - 1; } else { g = gcd(g, x - 1); } } x = 0; } else { x++; } } if (x > 1) { if (g == -1) { g = x - 1; } else { g = gcd(g, x - 1); } } } for (i = 2; i <= g; i++) { if (g % i == 0) v.push_back(i); } for (i = 0; i < v.size(); i++) { int c1 = 0; queue<pair<int, int> > q; for (j = 0; j < n; j++) { for (k = 0; k < m; k++) { b[j][k] = f[j][k] = 0; } } f[x][y] = 1; q.push(make_pair(x, y)); while (!q.empty()) { int x = q.front().first; int y = q.front().second; int c = 0; q.pop(); b[x][y] = 1; for (j = 0; j < 4; j++) { if (sum[j][x][y] <= v[i]) continue; c++; for (k = 1; k <= v[i]; k++) b[x + dx[j] * k][y + dy[j] * k] = 1; if (f[x + dx[j] * v[i]][y + dy[j] * v[i]] == 1) continue; f[x + dx[j] * v[i]][y + dy[j] * v[i]] = 1; q.push(make_pair(x + dx[j] * v[i], y + dy[j] * v[i])); } if (c & 1) c1++; } if (c1 <= 2) { int f1 = 0; for (j = 0; j < n; j++) { for (k = 0; k < m; k++) { if (a[j][k] != b[j][k]) { f1 = 1; break; } } } if (f1 == 0) w.push_back(v[i]); } } if (w.size() == 0) { puts( -1 ); return 0; } for (i = 0; i < w.size(); i++) { if (i > 0) putchar( ); printf( %d , w[i]); } puts( ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const long long INF = 1e9 + 9; const long long N = 500500; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); long long T; cin >> T; while (T--) { long long n, ans = 0, mx; cin >> n; for (long long b = 0; b <= 6; b++) { vector<long long> x, y; for (long long i = 1; i <= n; i++) { if (i & (1 << b)) { x.push_back(i); } else y.push_back(i); } if (x.size() == 0 || y.size() == 0) continue; cout << x.size() << << y.size() << ; for (auto z : x) cout << z << ; for (auto z : y) cout << z << ; cout << endl; cin >> mx; ans = max(ans, mx); } cout << -1 << ans << endl; cout.flush(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; struct edge { int v, w; edge() {} edge(int V, int W) { v = V, w = W; } }; struct node { long long x, y, z; node() {} node(long long X, long long Y, long long Z) { x = X, y = Y, z = Z; } } p[100005]; vector<edge> G[100005]; int n; long long f1[100005], f2[100005], Size[100005]; bool cmp(node u, node v) { return v.x * u.y < u.x * v.y; } void dfs(int u, int fa) { Size[u]++; for (int i = 0; i < G[u].size(); i++) { int v = G[u][i].v; if (v == fa) continue; dfs(v, u); Size[u] += Size[v], f1[u] += f1[v]; } int len = 0; for (int i = 0; i < G[u].size(); i++) { int v = G[u][i].v, w = G[u][i].w; if (v == fa) continue; p[++len] = node(Size[v], f2[v] + (w << 1), w); } sort(p + 1, p + len + 1, cmp); for (int i = 1; i <= len; i++) f1[u] += (p[i].z + f2[u]) * p[i].x, f2[u] += p[i].y; } int main() { scanf( %d , &n); for (int i = 1, u, v, w; i < n; i++) { scanf( %d %d %d , &u, &v, &w); G[u].push_back(edge(v, w)); G[v].push_back(edge(u, w)); } dfs(1, 0); printf( %.8f , f1[1] * 1.0 / (n - 1)); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = (int)1e6 + 5; const int mod = (int)1e9 + 7; string a; int x, n; int u[N]; int main() { ios_base::sync_with_stdio(false); cin >> a; cin >> n; for (int i = 1; i <= n; i++) { cin >> x; u[x]++; } for (int i = 1; i <= a.size() / 2; i++) u[i] += u[i - 1]; for (int i = 0; i < a.size(); i++) { if (u[i + 1] & 1) swap(a[i], a[a.size() - i - 1]); } cout << a << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; struct masivs { long long in; long long out; long long poz; }; masivs mas[100005]; long long i, j, k, n, m, a, b, c; vector<pair<pair<long long, long long>, long long> > ab; int main() { std::cin.sync_with_stdio(false); std::cin.tie(0); cin >> n >> m; i = 0; while (i < n) { mas[i].poz = i; i++; } i = 0; while (i < m) { cin >> a >> b >> c; a--; b--; mas[a].in += c; mas[b].out += c; k = min(mas[a].in, mas[a].out); mas[a].in -= k; mas[a].out -= k; k = min(mas[b].in, mas[b].out); mas[b].in -= k; mas[b].out -= k; i++; } j = 0; i = 0; while (i < n) { while (mas[i].in) { while (mas[j].out == 0) { j++; } k = min(mas[i].in, mas[j].out); ab.push_back({{i + 1, j + 1}, k}); mas[i].in -= k; mas[j].out -= k; } i++; } cout << ab.size() << n ; for (j = 0; j < ab.size(); j++) { cout << ab[j].first.first << << ab[j].first.second << << ab[j].second << n ; } return 0; }
|
#include <bits/stdc++.h> const int MAX_N = 5e2 + 5; int n, f[MAX_N][MAX_N], g[MAX_N]; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d , &f[i][i]); for (int l = 1; l < n; ++l) for (int i = 1; i + l <= n; ++i) for (int j = i; j < i + l; ++j) if (f[i][j] && f[i][j] == f[j + 1][i + l]) f[i][i + l] = f[i][j] + 1; for (int i = 1; i <= n; ++i) { g[i] = i; for (int j = 1; j <= i; ++j) if (f[j][i]) g[i] = std::min(g[i], g[j - 1] + 1); } printf( %d n , g[n]); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 400005; int n, m, h[N], p[N]; set<int> S; set<int>::iterator it; inline void read(int &i) { i = 0; char c = getchar(); bool j = 0; for (; !isdigit(c); c = getchar()) if (c == - ) j = 1; for (; isdigit(c); c = getchar()) i = (i << 1) + (i << 3) + c - 0 ; i = j ? -i : i; } struct Segment_Tree { int sz, mx[N << 2]; inline void mdf(int u, int l, int r, int x, int y) { if (l == r) { mx[u] = y; return; } int mid = (l + r) >> 1; if (x <= mid) mdf(u << 1, l, mid, x, y); else mdf(u << 1 | 1, mid + 1, r, x, y); mx[u] = max(mx[u << 1], mx[u << 1 | 1]); } inline int qry(int u, int l, int r, int L, int R) { if (L <= l && r <= R) return mx[u]; int mid = (l + r) >> 1, as = 0; if (L <= mid) as = max(as, qry(u << 1, l, mid, L, R)); if (mid < R) as = max(as, qry(u << 1 | 1, mid + 1, r, L, R)); return as; } inline void mdf(int x, int y) { mdf(1, 0, sz, x, y); } inline int qry(int l, int r) { return qry(1, 0, sz, l, r); } } A, B; int main() { read(n); read(m); A.sz = n + 100; B.sz = m + 200; int op, x, y; for (int tim = 1; tim <= m; ++tim) { read(op), read(x); if (op == 1) { x = n + 1 - x; read(y); y = tim + 10 - y; p[y] = x; h[x] = y; S.insert(x); for (int i = y + 1; i <= y + 9; ++i) if (p[i]) A.mdf(p[i], 0); for (int i = y; i <= y + 9; ++i) if (p[i]) { int f = A.qry(0, p[i] - 1) + 1; A.mdf(p[i], f); B.mdf(i, f); } } else { it = S.end(); while (x--) it--, B.mdf(h[*it], 0); int del = *it; A.mdf(*it, 0); it++; for (; it != S.end(); it++) { int f = B.qry(0, h[*it] - 1) + 1; B.mdf(h[*it], f); A.mdf(*it, f); } S.erase(del); p[h[del]] = 0; h[del] = 0; } printf( %d n , A.qry(1, n)); } return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) #pragma GCC optimization( unroll-loops ) using namespace std; const int maxn = 1e4 + 5; set<string> st3; int dp[maxn][4]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); string s1, sx, sy, sz; cin >> s1; int len = s1.size(); if (len <= 6) cout << 0 << endl; else { if (len >= 7) { dp[len - 2][2] = 1; sx = ; sx = sx + s1[len - 2] + s1[len - 1]; st3.insert(sx); } if (len >= 8) { dp[len - 3][3] = 1; sx = ; sx = sx + s1[len - 3] + s1[len - 2] + s1[len - 1]; st3.insert(sx); } for (int i = len - 4; i >= 5; i--) { sx = ; sy = ; sx = sx + s1[i] + s1[i + 1]; sy = sy + s1[i + 2] + s1[i + 3]; if ((sx != sy && dp[i + 2][2]) || dp[i + 2][3]) { dp[i][2] = 1; st3.insert(sx); } sx = ; sy = ; sx = sx + s1[i] + s1[i + 1] + s1[i + 2]; sy = sy + s1[i + 3] + s1[i + 4] + s1[i + 5]; if ((sx != sy && dp[i + 3][3]) || dp[i + 3][2]) { dp[i][3] = 1; st3.insert(sx); } } cout << st3.size() << endl; for (auto& it : st3) cout << it << endl; } }
|
#include <bits/stdc++.h> using namespace std; int k, c, fact[10010], refact[10010]; int POW(int a, int b) { int res; for (res = 1; b; (b & 1) && (res = 1LL * res * a % 1000000007), a = 1LL * a * a % 1000000007, b >>= 1) ; return res; } int C(int n, int m) { if (m > n) return 0; return 1LL * fact[n] * refact[m] % 1000000007 * refact[n - m] % 1000000007; } void Init() { fact[0] = refact[0] = 1; for (int i = 1; i <= 1010; ++i) { fact[i] = 1LL * fact[i - 1] * i % 1000000007; refact[i] = POW(fact[i], 1000000007 - 2); } } void Work() { int i, cnt, ans = 1; scanf( %d%d , &k, &cnt); for (i = 2; i <= k; ++i) { scanf( %d , &c); ans = 1LL * ans * C(cnt + c - 1, cnt) % 1000000007; cnt += c; } printf( %d n , ans); } int main() { Init(); Work(); return 0; }
|
#include <bits/stdc++.h> const int MAXNUM = 255000; int n; int m; int ecnt; int a[MAXNUM]; int b[MAXNUM]; int inflow[MAXNUM]; int outflow[MAXNUM], direct[MAXNUM]; int head[MAXNUM], to[MAXNUM * 2], next[MAXNUM * 2], c[MAXNUM * 2], from[MAXNUM * 2]; inline int readint() { char c = getchar(); while (!isdigit(c)) c = getchar(); int x = 0; while (isdigit(c)) { x = x * 10 + c - 0 ; c = getchar(); } return x; } inline void addEdge(int &u, int &v, int &i) { int x = readint(); outflow[u] += x; outflow[v] += x; to[ecnt] = v; c[ecnt] = x; from[ecnt] = i; next[ecnt] = head[u]; head[u] = ecnt++; to[ecnt] = u; c[ecnt] = x; from[ecnt] = i; next[ecnt] = head[v]; head[v] = ecnt++; } void makeDirect() { std::stack<int> st; st.push(1); outflow[1] = 0; while (!st.empty()) { int u = st.top(); st.pop(); for (int p = head[u]; p; p = next[p]) { int &v = to[p]; if (inflow[v] == outflow[v] && v != n) continue; inflow[v] += c[p]; outflow[v] -= c[p]; if (inflow[v] == outflow[v] && v != n) st.push(v); int x = from[p]; if (v == a[x]) direct[x] = 1; } } } int main() { scanf( %d%d , &n, &m); ecnt = 1; for (int i = 0; i < m; ++i) { a[i] = readint(); b[i] = readint(); addEdge(a[i], b[i], i); } makeDirect(); for (int i = 0; i < m; ++i) printf( %d n , direct[i]); }
|
#include <bits/stdc++.h> #pragma comment(linker, /STACK:100000000 ) using namespace std; vector<vector<int> > g; vector<int> cl; int q = 0; int n; void dfs(int v) { cl[v] = q; if (cl[g[v][0]] == 0) dfs(g[v][0]); } void swap(int i, int j) { g[i][0] = g[j][0] + g[i][0]; g[j][0] = g[i][0] - g[j][0]; g[i][0] = g[i][0] - g[j][0]; } int calc() { int ans = 0; vector<int> t; t.resize(q + 1, 0); for (int i = 0; i < n; i++) t[cl[i]]++; for (int i = 1; i <= q; i++) { ans += t[i] - 1; } return ans; } int main() { cin >> n; g.resize(n); cl.assign(n, 0); int t; for (int i = 0; i < n; i++) { cin >> t; g[i].push_back(t - 1); } int m; cin >> m; for (int i = 0; i < n; i++) { if (cl[i] == 0) { q++; dfs(i); } } int w = calc(); if (m == w) { cout << 0; } if (m > w) { cout << m - w << n ; for (int i = 0; i < m - w; i++) { int v1 = 0, v2 = 1; while (cl[v1] == cl[v2]) v2++; cout << v1 + 1 << << v2 + 1 << ; swap(v1, v2); q = 0; cl.assign(n, 0); for (int i = 0; i < n; i++) { if (cl[i] == 0) { q++; dfs(i); } } } } if (m < w) { cout << w - m << n ; for (int i = 0; i < w - m; i++) { int v1 = 0, v2 = 0; while (g[v1][0] == v1) v1++; while (cl[v1] != cl[v2] || v1 == v2) v2++; cout << v1 + 1 << << v2 + 1 << ; swap(v1, v2); q = 0; cl.assign(n, 0); for (int i = 0; i < n; i++) { if (cl[i] == 0) { q++; dfs(i); } } } } }
|
#include <bits/stdc++.h> using namespace std; long long int n; long long int ppow(long long int i, long long int j) { if (i >= 998244353) i %= 998244353; long long int res = 1LL; while (j) { if (j & 1LL) { res *= i; if (res >= 998244353) res %= 998244353; } i *= i; if (i >= 998244353) i %= 998244353; j >>= 1LL; } return res; } long long int k[1000002]; long long int r[1000002]; long long int C(int a, int b) { long long int up = k[a]; long long int dw = r[a - b] * r[b]; if (dw >= 998244353) dw %= 998244353; up *= dw; if (up >= 998244353) up %= 998244353; return up; } long long int p3[1000002]; int main() { scanf( %lld , &n); p3[0] = 1; for (int i = 1; i < 1000002; i++) { p3[i] = p3[i - 1]; p3[i] *= 3LL; if (p3[i] >= 998244353) p3[i] %= 998244353; } k[0] = 1LL; for (int i = 1; i < 1000002; i++) { k[i] = k[i - 1]; k[i] *= (long long int)(i); if (k[i] >= 998244353) k[i] %= 998244353; } r[1000002 - 1] = ppow(k[1000002 - 1], 998244353 - 2); for (int i = 1000002 - 2; i >= 0; i--) { r[i] = r[i + 1] * (long long int)(i + 1); if (r[i] >= 998244353) r[i] %= 998244353; } long long int ans = 0; for (int i = 1; i <= n; i++) { long long int way = C(n, i) * ppow(3, i); if (way >= 998244353) way %= 998244353; way *= ppow(p3[n], n - i); if (way >= 998244353) way %= 998244353; if (i & 1) { ans += way; } else { ans += 998244353 - way; } if (ans >= 998244353) ans %= 998244353; } for (int i = 1; i <= n; i++) { { long long int way = 3LL * C(n, i); if (way >= 998244353) way %= 998244353; long long int dif_col = ppow(p3[n - i] + 998244353 - 1LL, n); way *= dif_col; if (way >= 998244353) way %= 998244353; if (i & 1) { ans += way; } else { ans += 998244353 - way; } if (ans >= 998244353) ans %= 998244353; } { long long int way = ((p3[i] + 998244353 - 3LL) % 998244353) * C(n, i); if (way >= 998244353) way %= 998244353; way *= ppow(p3[n - i], n); if (way >= 998244353) way %= 998244353; if (i & 1) { ans += way; } else { ans += 998244353 - way; } if (ans >= 998244353) ans %= 998244353; } } printf( %lld n , ans); return 0; }
|
#include <bits/stdc++.h> void rep(const char *s, int x) { for (int i = 1; i <= x; i++) printf( %s , s); } void leading0() { putchar( 1 ); putchar( r ); rep( 0srt , 30); rep( lst , 30); putchar( l ); putchar( e ); } int main() { printf( r0l ); rep( l , 31); leading0(); putchar( u ); leading0(); putchar( u ); putchar( u ); putchar( u ); rep( r1 , 31); putchar( d ); putchar( d ); putchar( d ); rep( d , 3); rep( 1l , 31); putchar( u ); rep( re , 31); rep( u , 3); for (int j = 1; j <= 31; j++) { printf( edsddduuutttt1d0uuudst0 ); putchar( u ); rep( ust , 3); if (j > 1) { printf( dddd10utu10rtdr10ltled1uuuu ); printf( edsddduuutttt1d0uuudst0 ); putchar( u ); rep( ust , 3); printf( dddr01dtl1rt ); printf( uu ); putchar( l ); } else { putchar( l ); putchar( d ); } } putchar( d ); putchar( r ); }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; for (int i = n; i < 2 * n; ++i) cout << i << ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int dp[255][105][105]; int c[255][255]; int cc[1005]; int N; string s; int f(char l, int i, int k) { if (i == N) return 0; if (dp[l][i][k] != -1) return dp[l][i][k]; int r = f(s[i], i + 1, k) + c[l][s[i]]; if (k) { for (char x = a ; x <= z ; x++) r = max(r, f(x, i + 1, k - 1) + c[l][x]); } return dp[l][i][k] = r; } int main() { int k, m; char x, y; int z; cin >> s >> k >> m; N = s.size(); for (int i = 0; i < m; i++) { cin >> x >> y >> z; c[x][y] = z; } memset(dp, -1, sizeof(dp)); cout << f( # , 0, k) << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int32_t main() { ios_base::sync_with_stdio(false); long long n, m, k; cin >> n >> m >> k; long long l = 1, r = 1e9 + 1; while (r - l > 1) { long long mid = (l + r) / 2; long long ans = mid; if (k >= mid) ans += ((mid - 1) * mid) / 2; if (k > mid) ans += k - mid; if (k < mid) ans += (((mid - 1) + (k - mid)) * ((mid - 1) - (k - mid) + 1)) / 2; long long t = n - k + 1; if (t >= mid) ans += ((mid - 1) * mid) / 2; if (t > mid) ans += t - mid; if (t < mid) ans += (((mid - 1) + (t - mid)) * ((mid - 1) - (t - mid) + 1)) / 2; if (ans > m) r = mid; else l = mid; } cout << l << endl; }
|
#include <bits/stdc++.h> using namespace std; template <class Flow = int, class Cost = int> struct MinCostFlow { const Flow INF_FLOW = 1000111000; const Cost INF_COST = 1000111000111000LL; int n, t, S, T; Flow totalFlow; Cost totalCost; vector<int> last, visited; vector<Cost> dis; struct Edge { int to; Flow cap; Cost cost; int next; Edge(int to, Flow cap, Cost cost, int next) : to(to), cap(cap), cost(cost), next(next) {} }; vector<Edge> edges; MinCostFlow(int n) : n(n), t(0), totalFlow(0), totalCost(0), last(n, -1), visited(n, 0), dis(n, 0) { edges.clear(); } int addEdge(int from, int to, Flow cap, Cost cost) { edges.push_back(Edge(to, cap, cost, last[from])); last[from] = t++; edges.push_back(Edge(from, 0, -cost, last[to])); last[to] = t++; return t - 2; } pair<Flow, Cost> minCostFlow(int _S, int _T) { S = _S; T = _T; SPFA(); while (1) { while (1) { for (int i = 0; i < n; i++) visited[i] = 0; if (!findFlow(S, INF_FLOW)) break; } if (!modifyLabel()) break; } return make_pair(totalFlow, totalCost); } private: void SPFA() { for (int i = 0; i < n; i++) dis[i] = INF_COST; priority_queue<pair<Cost, int> > Q; Q.push(make_pair(dis[S] = 0, S)); while (!Q.empty()) { int x = Q.top().second; Cost d = -Q.top().first; Q.pop(); if (dis[x] != d) continue; for (int it = last[x]; it >= 0; it = edges[it].next) if (edges[it].cap > 0 && dis[edges[it].to] > d + edges[it].cost) Q.push(make_pair(-(dis[edges[it].to] = d + edges[it].cost), edges[it].to)); } Cost disT = dis[T]; for (int i = 0; i < n; i++) dis[i] = disT - dis[i]; } Flow findFlow(int x, Flow flow) { if (x == T) { totalCost += dis[S] * flow; totalFlow += flow; return flow; } visited[x] = 1; Flow now = flow; for (int it = last[x]; it >= 0; it = edges[it].next) if (edges[it].cap && !visited[edges[it].to] && dis[edges[it].to] + edges[it].cost == dis[x]) { Flow tmp = findFlow(edges[it].to, min(now, edges[it].cap)); edges[it].cap -= tmp; edges[it ^ 1].cap += tmp; now -= tmp; if (!now) break; } return flow - now; } bool modifyLabel() { Cost d = INF_COST; for (int i = 0; i < n; i++) if (visited[i]) for (int it = last[i]; it >= 0; it = edges[it].next) if (edges[it].cap && !visited[edges[it].to]) d = min(d, dis[edges[it].to] + edges[it].cost - dis[i]); if (d == INF_COST) return false; for (int i = 0; i < n; i++) if (visited[i]) dis[i] += d; return true; } }; int main() { int n; scanf( %d , &n); int a[n]; for (int i = 0; i < n; i++) scanf( %d , &a[i]); MinCostFlow<int, long long> mcf(3 * (n + 2)); mcf.addEdge(0, 1, 4, 0); mcf.addEdge(3 * (n + 1), 3 * (n + 1) + 1, 4, 0); for (int i = 0; i < n; i++) { mcf.addEdge(1, (i + 1) * 3, 1, 0); mcf.addEdge((i + 1) * 3, (i + 1) * 3 + 1, 1, -1); mcf.addEdge((i + 1) * 3 + 2, (i + 1) * 3, 1, 0); mcf.addEdge((i + 1) * 3 + 1, (n + 1) * 3, 1, 0); int u, d, l; u = d = l = 0; for (int j = i + 1; j < n; j++) { if (a[j] + 1 == a[i] && d < 4) { mcf.addEdge(3 * (i + 1) + 1, 3 * (j + 1), 1, 0); d++; } else if (a[j] - 1 == a[i] && u < 4) { mcf.addEdge(3 * (i + 1) + 1, 3 * (j + 1), 1, 0); u++; } else if (!((a[i] - a[j]) % 7) && !l) { mcf.addEdge(3 * (i + 1) + 1, 3 * (j + 1) + 2, 1, 0); mcf.addEdge(3 * (i + 1) + 2, 3 * (j + 1) + 2, 1, 0); l = 1; } } } pair<int, int> mcmf = mcf.minCostFlow(0, 3 * (n + 1) + 1); if (mcmf.first == 4) cout << -mcmf.second << endl; else cout << 0 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAX = 1e6 + 6; vector<int> adj[MAX]; bool visited[MAX]; void dfs(int source, int &nodes, int &total) { total += adj[source].size(); visited[source] = true; nodes++; for (auto &each : adj[source]) { if (!visited[each]) { dfs(each, nodes, total); } } } int main() { int n, m; scanf( %d %d , &n, &m); for (int i = int(0); i < int(m); i++) { int a, b; scanf( %d %d , &a, &b); adj[a].push_back(b); adj[b].push_back(a); } for (int i = int(1); i < int(n + 1); i++) { if (!visited[i]) { int total = 0; int nodes = 0; dfs(i, nodes, total); if (total != (1LL * nodes * (nodes - 1))) { puts( NO ); return 0; } } } puts( YES ); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int M = 1e9 + 7; long long int M1 = 998244353; long long int dr[8] = {-1, 0, 0, 1, -1, -1, 1, 1}; long long int dc[8] = {0, 1, -1, 0, -1, 1, -1, 1}; long long int gcd(long long int a, long long int b) { if (b == 0) return a; return gcd(b, a % b); } long long int lcm(long long int a, long long int b) { return a * b / gcd(a, b); } void setdecimals(long long int x) { cout << fixed << setprecision((int)x); } long long int setbits(long long int x) { long long int c = __builtin_popcountll(x); return c; } long long int stoi(string &s) { long long int c = 0; for (auto i : s) c = c * 10 + i - 0 ; return c; } void print(long long int a) { cerr << a; } void print(char a) { cerr << a; } void print(string a) { cerr << a; } void print(bool a) { cerr << a; } void print(double a) { cerr << a; } void print(float a) { cerr << a; } template <class T, class X> void print(pair<T, X> p); template <class T> void print(vector<T> v); template <class T> void print(set<T> v); template <class T, class X> void print(map<T, X> v); template <class T> void print(multiset<T> v); template <class T, class X> void print(pair<T, X> p) { cerr << { ; print(p.first); cerr << , ; print(p.second); cerr << } ; } template <class T> void print(vector<T> v) { cerr << [ ; for (T i : v) { print(i); cerr << ; } cerr << ] ; } template <class T> void print(set<T> v) { cerr << [ ; for (T i : v) { print(i); cerr << ; } cerr << ] ; } template <class T> void print(multiset<T> v) { cerr << [ ; for (T i : v) { print(i); cerr << ; } cerr << ] ; } template <class T, class X> void print(map<T, X> v) { cerr << [ ; for (auto i : v) { print(i); cerr << ; } cerr << ] ; } long long int power(long long int x, long long int y, long long int m) { if (y == 0) return 1; long long int p = power(x, y / 2, m) % m; p = p * p % m; if (y % 2 == 0) return p; return x * p % m; } long long int modInverse(long long int a, long long int m) { return power(a, m - 2, m); } vector<long long int> primes(long long int n) { vector<long long int> sieve(n + 1, 1); vector<long long int> arr; for (long long int i = 2; i * i <= n; i++) { for (long long int j = i * i; j <= n; j = j + i) { if (sieve[j] == 1) sieve[j] = 0; } } for (long long int i = 2; i < n + 1; i++) { if (sieve[i] && i != 1) arr.push_back(i); } return arr; } class DSU { long long int n; vector<long long int> parent, rank; public: DSU(long long int x) { n = x; parent.resize(n); rank.resize(n, 0); for (long long int i = 0; i < n; i++) parent[i] = i; } long long int get(long long int a) { return parent[a] = parent[a] == a ? a : get(parent[a]); } void merge(long long int a, long long int b) { a = get(a); b = get(b); if (a == b) return; if (rank[a] == rank[b]) rank[a]++; if (rank[a] > rank[b]) parent[b] = a; else parent[a] = b; } }; const int N = 200001; long long int factorialNumInverse[N + 1]; long long int naturalNumInverse[N + 1]; long long int fact[N + 1]; void InverseofNumber(long long int p) { naturalNumInverse[0] = naturalNumInverse[1] = 1; for (int i = 2; i <= N; i++) naturalNumInverse[i] = naturalNumInverse[p % i] * (p - p / i) % p; } void InverseofFactorial(long long int p) { factorialNumInverse[0] = factorialNumInverse[1] = 1; for (int i = 2; i <= N; i++) factorialNumInverse[i] = (naturalNumInverse[i] * factorialNumInverse[i - 1]) % p; } void factorial(long long int p) { fact[0] = 1; for (int i = 1; i <= N; i++) { fact[i] = (fact[i - 1] * i) % p; } } long long int Binomial(long long int N, long long int R, long long int p) { long long int ans = ((fact[N] * factorialNumInverse[R]) % p * factorialNumInverse[N - R]) % p; return ans; } vector<long long int> KMP(string &s) { long long int n = (long long int)s.length(); vector<long long int> pi(n, 0); for (long long int i = 1; i < n; i++) { long long int j = pi[i - 1]; while (j > 0 && s[i] != s[j]) j = pi[j - 1]; if (s[i] == s[j]) j++; pi[i] = j; } return pi; } long long int sz(vector<long long int> &v) { return (long long int)v.size(); } long long int sz(string &s) { return (long long int)s.size(); } void input() {} void read(vector<long long int> &arr) { for (long long int i = 0; i < (long long int)arr.size(); i++) cin >> arr[i]; } long long int testcases() { long long int testcase = 1; cin >> testcase; return testcase; } void solve() { long long int n, m; cin >> n >> m; long long int x, y, c, d; cin >> x >> y >> c >> d; x--; y--; c--; d--; long long int f = 0; long long int ans = 0; long long int dr = 1, dc = 1; while (1) { if (x == c || y == d) { break; } if (x == -1 || x == n) { ans--; y -= dc; x -= dr; dr = -dr; } else if (y == -1 || y == m) { ans--; x -= dr; y -= dc; dc = -dc; } else { x += dr; y += dc; ans++; } } cout << ans << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); input(); setdecimals(5); long long int t, i; t = testcases(); i = 1; while (i <= t) { solve(); i++; } return 0; }
|
#include <bits/stdc++.h> const double PI = 3.141592653589793238460; long long int gcd(long long int a, long long int b) { if (a == 0) return b; return gcd(b % a, a); } long long int max(long long int a, long long int b) { if (a > b) return a; else return b; } long long int min(long long int a, long long int b) { if (a < b) return a; else return b; } long long int power(long long int a, long long int b) { long long int i, p = 1; for (i = 0; i < b; i++) { p *= a; } return p; } using namespace std; int main() { ios::sync_with_stdio(false); long long int n, i; cin >> n; vector<pair<long long int, long long int> > p; p.push_back({0, 0}); p.push_back({0, 1}); p.push_back({1, 1}); p.push_back({1, 0}); for (i = 0; i < n; i++) { p.push_back({i + 2, i + 1}); p.push_back({i + 1, i + 2}); p.push_back({i + 2, i + 2}); } cout << p.size() << n ; for (i = 0; i < p.size(); i++) { cout << p[i].first << << p[i].second << n ; } return 0; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.