func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; struct dragon { int sila; int dodatek; }; bool operator<(dragon A, dragon B) { return A.sila < B.sila; } int main() { int s, n; cin >> s >> n; vector<dragon> D(n); for (int i = 0; i < n; i++) { cin >> D[i].sila >> D[i].dodatek; } sort(D.begin(), D.end()); for (int p = 0; p < n; p++) { if (s > D[p].sila) s += D[p].dodatek; else { cout << NO << endl; return 0; } } cout << YES << endl; } |
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); const double eps = 1e-12; const int inf = 2000000000; const long long int infLL = (long long int)1e18; long long int MOD = 1000000007; int MOD1 = 1000000007; int MOD2 = 1000000009; inline bool checkBit(long long int n, long long int i) { return n & (1LL << i); } inline long long int setBit(long long int n, long long int i) { return n | (1LL << i); ; } inline long long int resetBit(long long int n, long long int i) { return n & (~(1LL << i)); } int dx[] = {0, 0, +1, -1}; int dy[] = {+1, -1, 0, 0}; inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; } inline bool isLeapYear(long long int year) { return (year % 400 == 0) || (year % 4 == 0 && year % 100 != 0); } inline void normal(long long int &a) { a %= MOD; (a < 0) && (a += MOD); } inline long long int modMul(long long int a, long long int b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a * b) % MOD; } inline long long int modAdd(long long int a, long long int b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a + b) % MOD; } inline long long int modSub(long long int a, long long int b) { a %= MOD, b %= MOD; normal(a), normal(b); a -= b; normal(a); return a; } inline long long int modPow(long long int b, long long int p) { long long int r = 1LL; while (p) { if (p & 1) r = modMul(r, b); b = modMul(b, b); p >>= 1LL; } return r; } inline long long int modDiv(long long int a, long long int b) { return modMul(a, modPow(b, MOD - 2)); } bool comp(const pair<long long int, pair<long long int, long long int> > &p1, const pair<long long int, pair<long long int, long long int> > &p2) { return p1.first > p2.first; } bool comp1(const pair<long long int, long long int> &p1, const pair<long long int, long long int> &p2) { if (p1.first == p2.first) { return p1.second > p2.second; } return p1.first < p2.first; } long long int converter(string a) { long long int i, mul = 1LL, r, t, ans = 0LL; if (a.length() == 0) return 0; for (i = a.length() - 1; i >= 0; i--) { t = a[i] - 0 ; r = t % 10; ans += (mul * r); mul = mul * 10; } return ans; } int msb(unsigned x) { union { double a; int b[2]; }; a = x; return (b[1] >> 20) - 1023; } const int MAX = 300005; long long int g[3][MAX], a[MAX]; long long int x, y, z, magic, n; const int ex = 70; const int lim = 1000; int grundy(int a, int b, int c) { set<long long int> s; s.insert(a); s.insert(b); s.insert(c); int val = 0; while (s.find(val) != s.end()) ++val; return val; } void calc() { for (int i = 1; i <= lim; ++i) { long long int cur1 = max(0LL, i - x); long long int cur2 = max(0LL, i - y); long long int cur3 = max(0LL, i - z); g[0][i] = grundy(g[0][cur1], g[1][cur2], g[2][cur3]); g[1][i] = grundy(g[0][cur1], inf, g[2][cur3]); g[2][i] = grundy(g[0][cur1], g[1][cur2], inf); } } void findPeriod() { magic = 0; for (int perLen = 1; !magic; ++perLen) { int f = 1; for (int i = ex; i < ex + perLen && f; ++i) { for (int j = i; j <= lim && f; j += perLen) { if (g[0][i] != g[0][j] || g[1][i] != g[1][j] || g[2][i] != g[2][j]) f = 0; } } if (f) magic = perLen; } } int ask(long long int pile, int state) { pile = max(0LL, pile); if (pile <= lim) return g[state][pile]; else return g[state][(pile - ex) % magic + ex]; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; cout.unsetf(ios::floatfield); cout.precision(20); cout.setf(ios::fixed, ios::floatfield); ; int t; cin >> t; while (t--) { cin >> n >> x >> y >> z; calc(); findPeriod(); if (magic >= 30) { cout << MAgic << magic << n ; return 0; } long long int nimber = 0; for (int i = 1; i <= n; ++i) { cin >> a[i]; nimber ^= ask(a[i], 0); } int ans = 0; for (int i = 1; i <= n; ++i) { long long int save = nimber ^ ask(a[i], 0); long long int temp = save ^ ask(a[i] - x, 0); if (!temp) ans++; temp = save ^ ask(a[i] - y, 1); if (!temp) ans++; temp = save ^ ask(a[i] - z, 2); if (!temp) ans++; } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long qpow(long long x, long long k, long long mod) { long long ret = 1; while (k) { if (k & 1) { ret = ret * x; ret = ret % mod; } x = x * x; x = x % mod; k = (k >> 1); } return ret; } const int Maxn = 1005; const int md = 998244353; int n, m; int a[Maxn][Maxn]; long long e[Maxn][Maxn]; long long inv[Maxn * Maxn]; long long cnt[2][Maxn]; int r, c; vector<pair<int, pair<int, int> > > vv; void pre() { for (int i = 1; i < Maxn * Maxn; i++) { inv[i] = qpow(i, md - 2, md); } } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { scanf( %d , a[i] + j); vv.push_back(pair<int, pair<int, int> >(a[i][j], pair<int, int>(i, j))); } } scanf( %d%d , &r, &c); pre(); sort((vv).begin(), (vv).end()); long long sume = 0, sumx = 0, sumx2 = 0, sumy = 0, sumy2 = 0, ans = 0; for (int i = 0, j = 0; i < vv.size(); i++) { if (i && vv[i].first != vv[i - 1].first) { for (; j < i; j++) { long long nx = vv[j].second.first, ny = vv[j].second.second; sume = (sume + e[nx][ny]) % md; sumx = (sumx + nx) % md; sumx2 = (sumx2 + nx * nx) % md; sumy = (sumy + ny) % md; sumy2 = (sumy2 + ny * ny) % md; } } long long x = vv[i].second.first, y = vv[i].second.second; long long tmp = (sume + sumx2 + sumy2 - sumx * x * 2 - sumy * y * 2) % md; if (j) tmp = (tmp * inv[j] + x * x + y * y) % md; if (tmp < 0) tmp += md; e[x][y] = tmp; } printf( %lld n , e[r][c]); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, a[100050], cnt = 0; int main() { cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); for (int i = 0; i < n; i++) if (a[i] > cnt) cnt++; cout << cnt + 1; return 0; } |
#include <bits/stdc++.h> using namespace std; using namespace std; int main() { int N; cin >> N; pair<char, int> list[N]; for (int i = 0; i < N; i++) cin >> list[i].first >> list[i].second; int initial = 0; set<int> presents; for (int i = 0; i < N; i++) { int count = 0; char sign = list[i].first; int id = list[i].second; if (sign == + ) { presents.insert(id); } else if (sign == - ) { if (presents.count(id)) { presents.erase(id); } else initial++; } else assert(false); } presents.clear(); int maxi = initial; int count = initial; for (int i = 0; i < N; i++) { char sign = list[i].first; int id = list[i].second; if (sign == + ) { count++; presents.insert(id); } else if (sign == - ) { count--; if (presents.count(id)) presents.erase(id); } maxi = max(maxi, count); } cout << maxi << endl; } |
#include <bits/stdc++.h> using namespace std; const int rozmiar_kubelka = 356; int n, m; vector<int> her; vector<pair<char, int> > mov; int dp[(1 << 20)]; void policz() { dp[0] = 0; int a = 1; for (; a < (1 << m); a++) { int c = __builtin_popcount(a); c = m - c; auto akt = mov[c]; if (akt.second == 1) dp[a] = -1000000000; else dp[a] = 1000000000; if (akt == make_pair( p , 1)) { int it = 0; for (int i = 1; true; i *= 2) { if (i & a) { dp[a] = dp[a ^ i] + her[it]; break; } it++; } } if (akt == make_pair( p , 2)) { int it = 0; for (int i = 1; true; i *= 2) { if (i & a) { dp[a] = dp[a ^ i] - her[it]; break; } it++; } } if (akt == make_pair( b , 1)) { int it = m - 1; for (int i = 1; i <= a; i *= 2) { it--; if (i & a) { dp[a] = max(dp[a], dp[a ^ i]); } } } if (akt == make_pair( b , 2)) { int it = m - 1; for (int i = 1; i <= a; i *= 2) { it--; if (i & a) { dp[a] = min(dp[a], dp[a ^ i]); } } } } } int main() { vector<int> vec; scanf( %d , &n); for (int i = 0; i < (n); ++i) { int a; scanf( %d , &a); vec.push_back(a); } scanf( %d , &m); sort(vec.begin(), vec.end()); for (int i = ((int)(n)) - 1; i >= (n - m); --i) her.push_back(vec[i]); for (int i = 0; i < (m); ++i) { char p; int a; scanf( %c%c%d , &p, &p, &a); mov.push_back({p, a}); } policz(); printf( %d , dp[(1 << m) - 1]); } |
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); long long t; cin >> t; for (long long _ = 0; _ < t; ++_) { long long n; cin >> n; vector<long long> a(n + 1); for (long long i = 0; i < n; ++i) { cin >> a[i]; } long long l = a[0]; long long r = n; long long cur = l; string ans = Yes ; for (long long i = 0; i < n; ++i) { if (a[i] != cur) { ans = No ; } ++cur; if (a[i] == r) { r = l - 1; l = a[i + 1]; cur = l; } } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; char str[1000]; int main() { int n, k; while (scanf( %d %d , &n, &k) == 2) { scanf( %s , str + 1); int left = k - 1; int right = n - k; int di; if (right >= left) { di = 1; for (int i = k; i > 1; i--) printf( LEFT n ); } else { di = 2; for (int i = k; i < n; i++) printf( RIGHT n ); } if (di == 1) { for (int i = 1; i <= n; i++) { printf( PRINT %c n , str[i]); if (i != n) printf( RIGHT n ); } } else { for (int i = n; i >= 1; i--) { printf( PRINT %c n , str[i]); if (i != 1) printf( LEFT n ); } } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { if (b == 0) return a; return gcd(b, a % b); } int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int a, b, c, d; cin >> a >> b >> c >> d; if (a * d < c * b) { int g = gcd(b * c - a * d, b * c); cout << ((b * c - a * d) / g) << / << (b * c / g) << endl; } else { int g = gcd(a * d - b * c, a * d); cout << ((a * d - b * c) / g) << / << (a * d / g) << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int x, y; long double maxd = 0.00000000; long long int ans = 0; long long int n; cin >> n; while (n--) { long long int a, b; cin >> a >> b; ans = max(ans, (a + b)); } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int i, j, x[2][4], y[2][4]; pair<int, int> p[2][4]; for (j = 0; j < 2; j++) { for (i = 0; i < 4; i++) { cin >> x[j][i] >> y[j][i]; p[j][i] = {x[j][i], y[j][i]}; } } sort(p[0], p[0] + 4); sort(p[1], p[1] + 4); int a = p[1][0].first + p[1][0].second, b = p[1][2].first + p[1][2].second; int c = p[1][1].second - p[1][1].first, d = p[1][2].second - p[1][1].first; set<pair<int, int>> s; for (i = -100; i <= 100; i++) { for (j = -100; j <= 100; j++) { if (i + j >= a && i + j <= b && j - i >= c && j - i <= d) { s.insert({i, j}); } } } a = p[0][0].first, b = p[0][0].second, c = p[0][3].first, d = p[0][3].second; for (i = a; i <= c; i++) { for (j = b; j <= d; j++) { pair<int, int> q = {i, j}; if (s.count(q)) { cout << YES << endl; return 0; } } } cout << NO << endl; } |
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const int maxn = 1e5 + 5; const int mod = 1e9 + 7; vector<int> v[26]; int main() { int n; cin >> n; string s; cin >> s; for (int i = 0; i < n; i++) v[s[i] - a ].push_back(i); int m; cin >> m; while (m--) { string s2; cin >> s2; int t[26]; memset(t, 0, sizeof(t)); for (int i = 0; i < s2.size(); i++) t[s2[i] - a ]++; int ans = -1; for (int i = 0; i < 26; i++) { if (t[i]) ans = max(ans, v[i][t[i] - 1] + 1); } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> const int N = 100005; int solve(int n, int k, int cnt[]) { if (k == n || cnt[0] == 0 || cnt[1] == 0) { return 1 - cnt[1] % 2; } if ((n - k) / 2 < cnt[0] && (n - k) / 2 < cnt[1]) { if ((n - k) % 2 == 0) return 1; else return 0; } if ((n - k) / 2 >= cnt[0]) { return 1 - k % 2; } return 1; } int main() { int n, k; scanf( %d%d , &n, &k); int cnt[2]; cnt[0] = cnt[1] = 0; for (int i = 0; i < n; i++) { int tmp; scanf( %d , &tmp); cnt[tmp % 2]++; } printf( %s , solve(n, k, cnt) ? Daenerys : Stannis ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main(){ int T; cin >> T; long long A[114514]; while(T--){ int N; cin >> N; long long S = 0; for(int i = 0; i < N; i++){ cin >> A[i]; S += A[i]; } sort(A, A+N, greater<long long>()); if(S == 0) cout << 0 << n ; else cout << max({A[1] * (N-1) - S, A[0] * (N-1) - S, N-2 - (S-1) % (N-1)}) << n ; } } |
#include <bits/stdc++.h> #define ll long long int #define vi vector<int> #define vll vector<long long int> #define MAX(a, b) ((a) > (b) ? (a) : (b)) #define MIN(a, b) ((a) < (b) ? (a) : (b)) #define ABS(x) ((x) < 0 ? -(x) : (x)) #define setpr(x, y) cout << fixed << setprecision(x) << y #define tr(x) cout << (#x) << = << (x) << n ; using namespace std; void solver(void); ll MOD = 1e9 + 7; double pi = 2 * acos(0.0); //vector<vector<ll>> mat( n , vector<ll> (m, 0)); int main() { cin.tie(NULL); ios_base::sync_with_stdio(false); int t; cin >> t; while (t--) solver(); } void solver(void) { //input ll n; cin >> n; vll v(n); for (ll i = 0; i < n; i++) { v[i] = i + 1; } if (n % 2 == 0) { for (ll i = 0; i < n - 1; i = i + 2) { swap(v[i], v[i + 1]); } } else { for (ll i = 0; i <= n - 3; i = i + 2) { swap(v[i], v[i + 1]); } swap(v[n - 2], v[n - 1]); } for (ll i = 0; i < n; i++) { cout << v[i] << ; } cout << n ; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 200005; long long a[maxn]; int n; long long k; long long d[maxn]; int main() { cin >> n >> k; for (int i = 1; i <= n; i++) scanf( %I64d , &a[i]); long long sum = 0; int num = 0; for (int i = 1; i <= n; i++) { d[i] = sum - (a[i] * (n - i) * (i - num - 1)); if (d[i] < k) { printf( %d n , i); num++; } else sum += a[i] * (i - num - 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; bool check(string s) { int count = 0; for (char el : s) { if (el == ( ) { count++; } else { count--; } if (count < 0) return false; } return true; } void solve() { int n; cin >> n; string s; cin >> s; if (s[0] == ) || s[s.size() - 1] == ( || s.size() % 2) { cout << :( << endl; return; } int in = 0, out = 0; for (char el : s) { in += (el == ( ); out += (el == ) ); } if (in > n / 2 || out > n / 2) { cout << :( << endl; return; } int first = (n / 2) - in; int second = (n / 2) - out; int count = 0; for (int i = 0; i < n; i++) { if (s[i] == ? ) { if (first > 0) { s[i] = ( ; first--; count++; } else { s[i] = ) ; second--; count--; } } else if (s[i] == ( ) { count++; } else { count--; } if (count == 0 && i != n - 1) { cout << :( << endl; return; } else if (count < 0) { cout << :( << endl; return; } } cout << (check(s) ? s : :( ) << endl; } int main() { solve(); } |
#include <bits/stdc++.h> using namespace std; int main() { int n, i, j; cin >> n; vector<int> ct[n + 1]; for (i = 0; i < 2 * n; i++) { int x; cin >> x; ct[x].push_back(i); } int p1 = 0, p2 = 0; long long ans = 0; for (i = 1; i <= n; i++) { ans += min(abs(ct[i][0] - p1) + abs(ct[i][1] - p2), abs(ct[i][0] - p2) + abs(ct[i][1] - p1)); p1 = ct[i][0]; p2 = ct[i][1]; } cout << ans << endl; } |
#include <bits/stdc++.h> const int N = 1e6 + 7; const int INF = 0x3f3f3f3f; const int mod = 1e9 + 7; const double eps = 1e-7; using namespace std; int a[N], s[N]; map<int, int> asum, ssum; map<int, vector<int> > pos; map<int, int> size; int main() { int n, m, k, S; cin >> m >> k >> n >> S; for (int i = 1; i <= m; i++) { scanf( %d , a + i); asum[a[i]]++; } for (int i = 1; i <= S; i++) { scanf( %d , s + i); ssum[s[i]]++; } for (int i = 1; i <= m; i++) { if (ssum[a[i]] > 0) { pos[a[i]].push_back(i); } } for (auto x : ssum) { if (asum[x.first] < x.second) { puts( -1 ); return 0; } } for (auto x : pos) { size[x.first] = x.second.size(); } int p, q, l, r, minl, maxr; bool f; bool flag = 1; for (int num = 1; num <= n; num++) { p = (num - 1) * k; f = 0; minl = INF; maxr = -1; for (auto x : pos) { q = upper_bound(x.second.begin(), x.second.end(), p) - x.second.begin(); if (q + ssum[x.first] > size[x.first]) { f = 1; break; } minl = min(minl, x.second[q]); maxr = max(maxr, x.second[q + ssum[x.first] - 1]); } if (f) break; if (m - maxr < (n - num) * k) continue; else { printf( %d n , max(0, maxr - p - k)); int cnt = maxr - p; bool ff = 1; for (int i = p + 1; i <= maxr; i++) { if (cnt <= k) break; if (ssum[a[i]] == 0) { printf( %s%d , ff ? : , i); cnt--; ff = 0; } else { ssum[a[i]]--; } } cout << endl; flag = 0; break; } } if (flag) puts( -1 ); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; long long mypow(long long base, long long exp) { long long res = 1; while (exp) { if (exp & 1) res = (res * base) % mod; exp >>= 1, base = (base * base) % mod; } return res; } long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long mult(long long a, long long b) { if (a < 0) { a += mod; } if (b < 0) { b += mod; } return ((a % mod) * (b % mod)) % mod; } long long add(long long a, long long b) { if (a < 0) { a += mod; } if (b < 0) { b += mod; } return (a % mod + b % mod) % mod; } long long sub(long long a, long long b) { if (a < 0) { a += mod; } if (b < 0) { b += mod; } return (a % mod + mod - b % mod) % mod; } void err(istream_iterator<string> it) {} template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << | ; err(++it, args...); } const long long inf = 1e18; const int nax = 1e5 + 5; void SolveTestCase() { long long n; cin >> n; long long a[n]; long long sum = 0; for (long long i = 0; i < n; i++) { cin >> a[i]; sum += a[i]; } long long sum2 = 0; for (long long i = 0; i < n; i++) { sum2 += a[i]; if (sum2 >= (sum + 1) / 2) { cout << i + 1; break; } } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t = 1; for (long long i = 0; i < t; i++) { SolveTestCase(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxN = 1000 * 1000 + 5; bool mark[4][maxN]; int n, m, comp; inline void dfs(int x, int y) { if (mark[x][y]) return; mark[x][y] = true; if (x == 0 && y == 1) mark[3][1] = true; if (x == 0 && y == m) mark[1][1] = true; if (x == 1 && y == 1) mark[0][m] = true; if (x == 1 && y == n) mark[2][m] = true; if (x == 2 && y == 1) mark[3][n] = true; if (x == 2 && y == m) mark[1][n] = true; if (x == 3 && y == m) mark[2][1] = true; if (x == 3 && y == 1) mark[0][1] = true; if (x == 0) { int dr = m - y; int dl = y - 1; int dd = n - 1; int xr = 1 + min(dr, dd), yr = y + min(dr, dd); int xl = 1 + min(dl, dd), yl = y - min(dl, dd); (xr == n) ? dfs(2, yr) : dfs(1, xr); (xl == n) ? dfs(2, yl) : dfs(3, xl); } if (x == 2) { int dr = m - y; int dl = y - 1; int du = n - 1; int xr = n - min(dr, du), yr = y + min(dr, du); int xl = n - min(dl, du), yl = y - min(dl, du); (xr == 1) ? dfs(0, yr) : dfs(1, xr); (xl == 1) ? dfs(0, yl) : dfs(3, xl); } if (x == 1) { int dd = n - y; int du = y - 1; int dl = m - 1; int xu = y - min(du, dl), yu = m - min(du, dl); int xd = y + min(dd, dl), yd = m - min(dd, dl); (yu == 1) ? dfs(3, xu) : dfs(0, yu); (yd == 1) ? dfs(3, xd) : dfs(2, yd); } if (x == 3) { int dd = n - y; int du = y - 1; int dr = m - 1; int xu = y - min(du, dr), yu = 1 + min(du, dr); int xd = y + min(dd, dr), yd = 1 + min(dd, dr); (yu == m) ? dfs(1, xu) : dfs(0, yu); (yd == m) ? dfs(1, xd) : dfs(2, yd); } } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) { if (!mark[0][i]) { comp++; dfs(0, i); } if (!mark[2][i]) { comp++; dfs(2, i); } } for (int i = 1; i <= n; i++) { if (!mark[1][i]) { comp++; dfs(1, i); } if (!mark[3][i]) { comp++; dfs(3, i); } } printf( %d n , comp); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 100; const long double INF = 2e30; struct node { int id; long double da, db, len; node(int _id = 0, long double _da = 0, long double _db = 0, long double _len = 0) { id = _id; da = _da; db = _db; len = _len; } }; node a[maxn]; int n; double ax, ay, bx, by, tx, ty; double x[maxn], y[maxn]; long double len[maxn], da[maxn], db[maxn]; bool cmpb(node a, node b) { long double ans1 = a.db - a.len; long double ans2 = b.db - b.len; return ans1 < ans2; } bool cmpa(node a, node b) { long double ans1 = a.da - a.len; long double ans2 = b.da - b.len; return ans1 < ans2; } void solve() { long double sum = 0; for (int i = 0; i < n; i++) { a[i].id = i; long double dx, dy; dx = ax - x[i]; dy = ay - y[i]; a[i].da = sqrt(dx * dx + dy * dy); dx = bx - x[i]; dy = by - y[i]; a[i].db = sqrt(dx * dx + dy * dy); dx = tx - x[i]; dy = ty - y[i]; a[i].len = sqrt(dx * dx + dy * dy); sum += a[i].len * 2; len[i] = a[i].len; da[i] = a[i].da; db[i] = a[i].db; } long double ans = INF; sort(a, a + n, cmpb); for (int i = 0; i < n; i++) { if (n > 1) { int id = a[0].id; if (i == id) { id = a[1].id; } long double tmp = sum - len[i] + da[i] - len[id] + db[id]; ans = min(ans, tmp); } long double tmp = sum - len[i] + da[i]; ans = min(ans, tmp); } sort(a, a + n, cmpa); for (int i = 0; i < n; i++) { if (n > 1) { int id = a[0].id; if (i == id) { id = a[1].id; } long double tmp = sum - len[i] + db[i] - len[id] + da[id]; ans = min(ans, tmp); } long double tmp = sum - len[i] + db[i]; ans = min(ans, tmp); } printf( %.14f n , (double)ans); } int main() { while (scanf( %lf%lf%lf%lf%lf%lf , &ax, &ay, &bx, &by, &tx, &ty) != EOF) { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %lf%lf , &x[i], &y[i]); } solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long a, b, n; long long power(long long b, long long p) { if (p == 0) return 1; long long ret = power(b, p / 2); ret *= ret; if (p & 1) ret *= b; return ret; } long long check(long long x) { return a * power(x, n); } int main() { cin >> a >> b >> n; if (b == 0) { cout << 0 << n ; return 0; } if (a == 0) { cout << No solution << n ; return 0; } if (b % a) { cout << No solution << n ; return 0; } long long x = pow(abs(b / a), 1.0 / n) + 0.5; if (check(x) != b) x *= -1; if (check(x) != b) { cout << No solution << n ; return 0; } cout << x << n ; return 0; } |
#include <bits/stdc++.h> int ma[100005]; int main() { int n, k; scanf( %d%d , &n, &k); for (int i = 1; i <= k + 1; i++) { if (i & 1) printf( %d , i / 2 + 1); else printf( %d , k + 2 - i / 2); } int s = (k + 1) / 2 + 1; int e = k + 2 - (k + 1) / 2; for (int i = s + 1; i < e - 1; i++) { printf( %d , i); } for (int i = k + 2; i <= n; i++) { printf( %d , i); } if (s + 1 <= e - 1) printf( %d n , e - 1); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const long long maxn = 2e5 + 5; struct range { long long a, b, c, id; range(long long A, long long B, long long C, long long ID) { a = A; b = B; c = C; id = ID; } }; bool compare(const range &i, const range &j) { if (i.a < j.a) return 1; if (i.a == j.a) return i.c < j.c; return 0; } long long ans[maxn]; void finish() { cout << NO << n ; ; exit(0); } int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long n; cin >> n; long long a[n + 1], b[n + 1]; set<pair<long long, long long> > s; vector<range> v; for (long long i = 1; i <= n; ++i) { cin >> a[i] >> b[i]; v.emplace_back(range(a[i], b[i], 1, i)); } long long m; cin >> m; long long c[m + 1], d[m + 1], k[m + 1]; for (long long i = 1; i <= m; ++i) { cin >> c[i] >> d[i] >> k[i]; v.emplace_back(range(c[i], d[i], 0, i)); } sort(v.begin(), v.end(), compare); for (const auto &it : v) { if (it.c == 0) { s.insert({d[it.id], it.id}); } else { auto j = s.lower_bound({b[it.id], -1}); if (j == s.end()) finish(); long long id = (*j).second; ans[it.id] = id; k[id]--; if (k[id] == 0) s.erase(j); } } cout << YES << n ; ; for (long long i = 1; i <= n; ++i) { cout << ans[i] << ; } cout << n ; ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n; int a[n][2]; for (int i = 0; i < n; ++i) cin >> a[i][0] >> a[i][1]; cin >> k; for (int i = 0; i < n; ++i) { if (a[i][0] <= k && k <= a[i][1]) { cout << n - i; return 0; } } } |
#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long a, b; cin >> a >> b; long long steps = 0; while (b != 0) { steps += (a / b); a %= b; swap(a, b); } cout << steps << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int a[105], a2[105], n; int getabs() { int e = 0, s = 0, i; for (i = 1; i <= n; i++) { if (a[i] == 1) e++; if (a[i] == -1) s++; } return abs(e - s); } int main() { int k, i, c, b, ans = 0; scanf( %d%d , &n, &k); for (i = 1; i <= n; i++) { scanf( %d , &a[i]); a2[i] = a[i]; } for (b = 1; b <= n; b++) { i = 1; while (b + i * k > 0) i--; for (i++; b + i * k <= n; i++) { a[b + i * k] = 0; } ans = getabs() > ans ? getabs() : ans; for (i = 1; i <= n; i++) a[i] = a2[i]; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int ans = 0; int n, m; cin >> n >> m; map<int, int> type; vector<int> a(m); for (int i = 0; i < m; i++) { cin >> a[i]; type[a[i]] += 1; } int sum = accumulate(a.begin(), a.end(), 0); int mel = 0; for (auto p : type) { mel = max(mel, p.second); } for (int i = 1; i <= mel; i++) { int curr = 0; for (auto p : type) { curr += p.second / i; } if (curr >= n) { ans = max(ans, i); } } cout << ans; } |
#include <bits/stdc++.h> using namespace std; int T, n, k; int main() { cin >> T; for (int i = 0; i < T; i++) { cin >> n >> k; if (n % 3 != 0 && k % 3 != 0) { cout << Alice << endl; } else if (n % 3 == 0 && k % 3 != 0) { cout << Bob << endl; } else { n %= (k + 1); if (n % 3 == 0 && n != k) cout << Bob << endl; else cout << Alice << endl; } } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; char s; int rock[4][2]; int k = 0; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) { cin >> s; if (s == * ) { rock[k][0] = i; rock[k][1] = j; k++; } } if (rock[0][0] == rock[1][0]) rock[3][0] = rock[2][0]; if (rock[0][0] == rock[2][0]) rock[3][0] = rock[1][0]; if (rock[2][0] == rock[1][0]) rock[3][0] = rock[0][0]; if (rock[0][1] == rock[1][1]) rock[3][1] = rock[2][1]; if (rock[0][1] == rock[2][1]) rock[3][1] = rock[1][1]; if (rock[2][1] == rock[1][1]) rock[3][1] = rock[0][1]; cout << rock[3][0] + 1 << << rock[3][1] + 1; cin >> n; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1000 + 10; int n, m, cnt, counter, b[maxn * maxn], par[maxn][maxn]; char a[maxn][maxn]; vector<pair<int, int> > adj[maxn][maxn]; bool mark[maxn][maxn]; void dfs(int x, int y) { mark[x][y] = true; par[x][y] = cnt; counter++; for (int i = 0; i < adj[x][y].size(); i++) { int x1 = adj[x][y][i].first; int y1 = adj[x][y][i].second; if (!mark[x1][y1]) dfs(x1, y1); } } int f(int x, int y) { int A[4] = {0}; if (x != 0 && a[x - 1][y] == . ) A[0] = par[x - 1][y]; if (x != n - 1 && a[x + 1][y] == . ) A[1] = par[x + 1][y]; if (y != 0 && a[x][y - 1] == . ) A[2] = par[x][y - 1]; if (y != m - 1 && a[x][y + 1] == . ) A[3] = par[x][y + 1]; for (int i = 0; i < 4; i++) for (int j = i + 1; j < 4; j++) if (A[i] == A[j]) A[j] = 0; int ans = 0; if (x != 0) ans += b[A[0]]; if (x != n - 1) ans += b[A[1]]; if (y != 0) ans += b[A[2]]; if (y != m - 1) ans += b[A[3]]; ans++; ans %= 10; return ans; } int main() { cin >> 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++) { if (a[i][j] == . ) { if (i != 0) if (a[i - 1][j] == . ) adj[i][j].push_back(pair<int, int>(i - 1, j)); if (i != n - 1) if (a[i + 1][j] == . ) adj[i][j].push_back(pair<int, int>(i + 1, j)); if (j != 0) if (a[i][j - 1] == . ) adj[i][j].push_back(pair<int, int>(i, j - 1)); if (j != m - 1) if (a[i][j + 1] == . ) adj[i][j].push_back(pair<int, int>(i, j + 1)); } } for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) { if (!mark[i][j]) { counter = 0; cnt++; dfs(i, j); b[cnt] = counter; } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (a[i][j] == . ) printf( . ); else { printf( %d , f(i, j)); } } printf( n ); } } |
#include <bits/stdc++.h> using namespace std; int n, m; char ch[5200][5200]; int main() { int top, down, lft, rht; top = down = -1; lft = rht = -1; scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) { scanf( %s , ch[i]); } for (int i = 0; i < n; i++) { bool flag = false; for (int j = 0; j < m; j++) { if (ch[i][j] == w ) { flag = true; break; } } if (flag) { top = i; break; } } for (int i = n - 1; i >= 0; i--) { bool flag = false; for (int j = 0; j < m; j++) { if (ch[i][j] == w ) { flag = true; break; } } if (flag) { down = i; break; } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (ch[i][j] == w ) { if (lft == -1 || lft > j) lft = j; break; } } for (int j = m - 1; j >= 0; j--) { if (ch[i][j] == w ) { if (rht == -1 || rht < j) rht = j; break; } } } bool ok = true; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (ch[i][j] == w ) { if (i != top && i != down && j > lft && j < rht) { ok = false; break; } } if (!ok) break; } if (!ok) break; } if (!ok) { puts( -1 ); return 0; } if (down - top > rht - lft) { int x = down - top; int y = rht - lft; int z = x - y; bool flag = true; for (int i = top + 1; i < down; i++) if (ch[i][lft] == w ) flag = false; if (!flag) { if (lft == rht) { if (lft >= z) { lft -= z; z = 0; } } } else if (lft >= z) { lft = lft - z; z = 0; } else { z -= lft; lft = 0; } if (z > 0) { flag = true; for (int i = top + 1; i < down; i++) if (ch[i][rht] == w ) flag = false; if (!flag) { if (lft == rht) { if (m - 1 - rht >= z) { rht += z; z = 0; } } } else if (m - 1 - rht >= z) { rht += z; z = 0; } else { z -= m - 1 - rht; rht = m - 1; } } } else if (rht - lft > down - top) { int x = down - top; int y = rht - lft; int z = y - x; bool flag = true; for (int i = lft + 1; i < rht; i++) if (ch[top][i] == w ) flag = false; if (!flag) { if (top == down) { if (top >= z) { top = top - z; z = 0; } } } else if (top >= z) { top = top - z; z = 0; } else { z -= top; top = 0; } if (z > 0) { flag = true; for (int i = lft + 1; i < rht; i++) if (ch[down][i] == w ) flag = false; if (!flag) { if (top == down) { if (n - 1 - down >= z) { down += z; z = 0; } } } else if (n - 1 - down >= z) { down += z; z = 0; } else { z -= n - 1 - down; down = n - 1; } } } if (down - top == rht - lft) { for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (ch[i][j] == w ) cout << ch[i][j]; else if ((i == top || i == down) && j >= lft && j <= rht) cout << + ; else if (i >= top && i <= down && (j == lft || j == rht)) cout << + ; else cout << ch[i][j]; } cout << endl; } } else puts( -1 ); } |
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0; bool flag = 0; int ch = getchar(); while ( 0 > ch || ch > 9 ) { if (ch == - ) flag = 1; ch = getchar(); } while ( 0 <= ch && ch <= 9 ) { x = (x << 1) + (x << 3) + (ch ^ 48); ch = getchar(); } return flag ? -x : x; } const int maxn = 1e5 + 10; int n, out[maxn]; bool vis[maxn]; int main() { n = read(); if (n % 2) printf( -1 ); else { for (register int i = n; i >= 1; i--) { if (vis[(out[i + 1] + n) / 2]) { if (vis[out[i + 1] / 2]) { printf( -1 ); return 0; } else { vis[out[i + 1] / 2] = 1; out[i] = out[i + 1] / 2; } } else { vis[(out[i + 1] + n) / 2] = 1; out[i] = (out[i + 1] + n) / 2; } } for (register int i = 1; i <= n + 1; i++) printf( %d , out[i]); } return 0; } |
#include <bits/stdc++.h> volatile bool isLocalTestEnabled = 0; bool g_isLocalPrintEnabled = (bool)(0); template <typename T> void UpdateMin(T& a, const T b) { a = std::min(a, b); } template <typename T> void UpdateMax(T& a, const T b) { a = std::max(a, b); } const long double Pi = std::atan(1.0L) * 4.0L; static const long double Eps = 1.0e-09; template <typename T> bool IsEqual(const T a, const T b) { return std::abs(a - b) < Eps; } template <typename T> bool IsGreater(const T a, const T b) { return a > b + Eps; } template <typename T> bool IsLess(const T a, const T b) { return a + Eps < b; } template <typename T> bool IsGreaterEqual(const T a, const T b) { return !IsLess(a, b); } template <typename T> bool IsLessEqual(const T a, const T b) { return !IsGreater(a, b); } template <typename T> std::string ToStr(const T& val) { std::ostringstream ostr; ostr << val; return ostr.str(); } template <typename T> bool FromStr(const std::string& str, T& val) { std::istringstream istr(str); istr >> val; return !!istr; } template <typename T> std::istream& operator>>(std::istream& ist, std::vector<T>& data) { ; for (size_t i = 0; i < data.size(); i++) { ist >> data[i]; } return ist; } template <typename T> T Read(std::istream& ist) { ; T val; ist >> val; return val; } template <typename T> std::ostream& operator<<(std::ostream& ost, const std::vector<T>& data) { for (size_t i = 0; i < data.size(); i++) { if (i != 0) { ost << ; } ost << data[i]; } return ost; } template <size_t id> class StopWatch {}; const uint64_t Mod = 1000000007; template <typename T> static T FastPow(const T a, const T p) { T res = 1; T mask = 1; T powPart = a; const size_t bitsCount = sizeof(T) * 8; for (size_t i = 0; i < bitsCount; i++) { if (p & mask) { res *= powPart; res %= Mod; } mask <<= 1; powPart *= powPart; powPart %= Mod; } return res; } bool Solve(std::istream& ist, std::ostream& ost, const bool multipleTestMode) { StopWatch<1> sw; (void)sw; uint64_t p, k; ist >> p >> k; if (multipleTestMode && !ist) return false; if (!g_isLocalPrintEnabled) { } else std::cout << std::endl << Next test: << p << << k << std::endl; if (k == 0) { const uint64_t ans = FastPow(p, p - 1); ost << ans << std::endl; return multipleTestMode; } if (k == 1) { const uint64_t ans = FastPow(p, p); ost << ans << std::endl; return multipleTestMode; } uint64_t groups = 0; std::vector<size_t> used(p + 1); uint64_t ans = 1; for (uint64_t x = 1; x < p; x++) { if (used[x]) continue; groups += 1; ans *= p; ans %= Mod; used[x] = 1; uint64_t v = x; while (!used[v * k % p]) { used[v * k % p] = 1; v = v * k % p; } } ost << ans << std::endl; return multipleTestMode; } int main(int argc, const char* argv[]) { std::ios_base::sync_with_stdio(false); std::istream* ist = &std::cin; std::ostream* ost = &std::cout; std::unique_ptr<std::istream> fileInput; if (argc > 1) { fileInput.reset(new std::ifstream(argv[1])); if (!(*fileInput)) { std::cout << File not found: << argv[1] << std::endl; } ist = fileInput.get(); } Solve(*ist, *ost, false); } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 , unroll-loops ) using namespace std; template <typename T1, typename T2> inline void checkmin(T1 &x, T2 y) { if (x > y) x = y; } template <typename T1, typename T2> inline void checkmax(T1 &x, T2 y) { if (x < y) x = y; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, k; cin >> n >> k; vector<string> arr(n); vector<vector<long long>> cnt(n, vector<long long>(n)); for (auto &i : arr) cin >> i; for (int i = 0; i <= n - k; ++i) for (int j = 0; j < n; ++j) { bool flag = true; for (int p = i; p < i + k; ++p) flag = flag && (arr[p][j] == . ); if (flag) for (int p = i; p < i + k; ++p) ++cnt[p][j]; } if (k > 1) { for (int j = 0; j <= n - k; ++j) for (int i = 0; i < n; ++i) { bool flag = true; for (int p = j; p < j + k; ++p) flag = flag && (arr[i][p] == . ); if (flag) for (int p = j; p < j + k; ++p) ++cnt[i][p]; } } long long x = 0, y = 0; for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) { if (cnt[i][j] > cnt[x][y]) { x = i; y = j; } } cout << x + 1 << << y + 1; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<string> posn(8); int ans[8][8][8]; int movex[9] = {-1, -1, -1, 0, 1, 1, 1, -1, 0}; int movey[9] = {-1, 0, 1, 1, 1, 0, -1, -1, 0}; int dp(int x, int y, int t) { if (t > 7) return 1; if (ans[x][y][t] != -1) return ans[x][y][t]; for (int i = 0; i < 9; i++) { int tx, ty; tx = x + movex[i]; ty = y + movey[i]; if (tx >= 0 && tx < 8 && ty >= 0 && ty < 8) { if (tx - t - 1 >= 0) if (posn[tx - t - 1][ty] == S ) continue; if (tx - t >= 0) if (posn[tx - t][ty] == S ) continue; if (dp(tx, ty, t + 1)) { return ans[x][y][t] = 1; } } } return ans[x][y][t] = 0; } int main() { for (int i = 0; i < 8; i++) { cin >> posn[i]; for (int j = 0; j < 8; j++) { for (int k = 0; k < 8; k++) ans[i][j][k] = -1; } } if (dp(7, 0, 0)) cout << WIN ; else cout << LOSE ; return 0; } |
#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef unsigned int uint; typedef pair<int, int> pii; int n, k; char s[300005]; void solve() { while (~scanf( %d%d , &n, &k)) { memset(s, 0, sizeof(s)); s[n + 1] = 0 ; int top = 0; s[++top] = a ; for (int i = 1; i <= k; ++i) { char cur = a + i - 1; s[++top] = cur; for (int j = k; j >= i + 1; --j) { char tcur = a + j - 1; s[++top] = tcur; if (j != i + 1) s[++top] = cur; } } for (int i = k - 1; i >= 1; --i) { char cur = a + i - 1; s[++top] = cur; } // puts(s + 1); int len = top; int sumlen = len; while (top <= n) { for (int i = 2; i <= len; ++i) s[++top] = s[i]; } s[n + 1] = 0 ; puts(s + 1); } } int main() { int T = 1; // scanf( %d , &T); for (int i = 1; i <= T; ++i) { // printf( Case #%d: , i); solve(); } } |
#include <bits/stdc++.h> using namespace std; const int N = 100010; int n, d, b; long long sum[N]; inline int gi() { int x = 0, o = 1; char ch = getchar(); while (ch != - && (ch < 0 || ch > 9 )) ch = getchar(); if (ch == - ) o = -1, ch = getchar(); while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); return x * o; } inline int check(int mid) { int g = (n + 1) / 2, s1 = 0, s2 = 0; for (int i = 1; i <= g; i++) { int f1, f2; f1 = sum[min(i + 1LL * d * i, (long long)n)] - 1LL * s1 * b; f2 = sum[n] - sum[max(0LL, n - i - 1LL * d * i)] - 1LL * s2 * b; if (i == n - i + 1) s1 += (f1 >= b); else { if (s1 < mid + n % 2) s1 += (f1 >= b); if (s2 < mid) s2 += (f2 >= b); } } if (s1 >= mid + n % 2 && s2 >= mid) return 1; return 0; } int main() { cin >> n >> d >> b; for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + gi(); int l = 0, r = n / 2, ans = (n + 1) / 2; while (l <= r) { int mid = (l + r) >> 1; if (check(mid)) l = mid + 1, ans = n / 2 - mid; else r = mid - 1; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 50010; string g[N]; int q, n, m, ro[N], co[N]; int main() { cin.tie(0); ios_base::sync_with_stdio(0); cin >> q; while (q--) { cin >> n >> m; for (int i = 0; i < n; ++i) cin >> g[i]; for (int i = 0; i < n; ++i) { ro[i] = 0; for (int j = 0; j < m; ++j) ro[i] += g[i][j] == . ; } for (int i = 0; i < m; ++i) { co[i] = 0; for (int j = 0; j < n; ++j) co[i] += g[j][i] == . ; } int ans = n * m; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { int here = ro[i] + co[j] - (g[i][j] == . ); ans = min(ans, here); } } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1.2e5 + 7; int n, m, a[N]; int flag[N << 2], times[N << 2]; long long sum[N << 2], Ans[N]; struct PII { int minn, cnt; } f[N << 2]; PII operator+(PII aa, PII bb) { PII res; res.minn = min(aa.minn, bb.minn), res.cnt = 0; if (aa.minn == res.minn) res.cnt += aa.cnt; if (bb.minn == res.minn) res.cnt += bb.cnt; return res; } void ad(int id, int first) { flag[id] += first, f[id].minn += first; } void adt(int id, int first) { times[id] += first, sum[id] += 1ll * first * f[id].cnt; } void upd(int id) { sum[id] = sum[id << 1] + sum[id << 1 | 1]; f[id] = f[id << 1] + f[id << 1 | 1]; } void pushdown(int id) { if (flag[id]) ad(id << 1, flag[id]), ad(id << 1 | 1, flag[id]), flag[id] = 0; if (times[id]) { if (f[id].minn == f[id << 1].minn) adt(id << 1, times[id]); if (f[id].minn == f[id << 1 | 1].minn) adt(id << 1 | 1, times[id]); times[id] = 0; } } void build(int id, int L, int R) { if (L == R) return f[id].cnt = 1, f[id].minn = 0, void(); int mid = (L + R) / 2; build(id << 1, L, mid), build(id << 1 | 1, mid + 1, R); } void add(int id, int L, int R, int l, int r, int val) { if (l <= L && R <= r) return ad(id, val), void(); int mid = (L + R) / 2; pushdown(id); if (l <= mid) add(id << 1, L, mid, l, r, val); if (r > mid) add(id << 1 | 1, mid + 1, R, l, r, val); upd(id); } void fadd(int id, int L, int R, int l, int r) { if (l <= L && R <= r) return adt(id, 1), void(); int mid = (L + R) / 2; pushdown(id); if (l <= mid && f[id].minn == f[id << 1].minn) fadd(id << 1, L, mid, l, r); if (r > mid && f[id].minn == f[id << 1 | 1].minn) fadd(id << 1 | 1, mid + 1, R, l, r); upd(id); } long long query(int id, int L, int R, int l, int r) { if (l <= L && R <= r) return sum[id]; int mid = (L + R) / 2; long long res = 0; pushdown(id); if (l <= mid) res += query(id << 1, L, mid, l, r); if (r > mid) res += query(id << 1 | 1, mid + 1, R, l, r); return res; } int Gmax[N], tota, Gmin[N], totb; int l[N], r[N]; vector<int> ve[N]; int main() { scanf( %d , &n); for (int i = 1, iE = n; i <= iE; i++) scanf( %d , &a[i]); build(1, 1, n); scanf( %d , &m); for (int i = 1, iE = m; i <= iE; i++) scanf( %d%d , &l[i], &r[i]), ve[r[i]].push_back(i); for (int i = 1, iE = n; i <= iE; i++) { if (i != 1) add(1, 1, n, 1, i - 1, -1); while (tota && a[i] > a[Gmax[tota]]) add(1, 1, n, Gmax[tota - 1] + 1, Gmax[tota], a[i] - a[Gmax[tota]]), --tota; while (totb && a[i] < a[Gmin[totb]]) add(1, 1, n, Gmin[totb - 1] + 1, Gmin[totb], a[Gmin[totb]] - a[i]), --totb; Gmax[++tota] = i, Gmin[++totb] = i; fadd(1, 1, n, 1, i); for (int v : ve[i]) Ans[v] = query(1, 1, n, l[v], r[v]); } for (int i = 1, iE = m; i <= iE; i++) printf( %lld n , Ans[i]); return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( Ofast,no-stack-protector ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) #pragma GCC optimize( unroll-loops ) const int MAX = 2e3 + 10; const int MOD = 1e9 + 7; using namespace std; int n, m; char s[MAX][MAX]; int vis[30], x[30], y[30]; int sum1[MAX][MAX], sum2[MAX][MAX]; bool f(int a, int b) { if (a < 1 || b < 1 || a > n || b > m) return false; return true; } int main() { ios::sync_with_stdio(false), cout.tie(NULL); cin >> n >> m; for (int i = 1; i <= n; i++) cin >> (s[i] + 1); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { sum1[i][j] = sum1[i - 1][j]; sum2[i][j] = sum2[i][j - 1]; if (s[i][j] == # ) { sum1[i][j]++; sum2[i][j]++; } else if (s[i][j] != . ) { vis[s[i][j] - A ] = 1; x[s[i][j] - A ] = i; y[s[i][j] - A ] = j; } } } int k; cin >> k; while (k--) { char dir[2]; int len; cin >> dir >> len; if (dir[0] == N ) { for (int i = 0; i < 27; i++) { if (vis[i]) { int xx = x[i] - len; if (!f(xx, y[i]) || sum1[x[i]][y[i]] != sum1[xx - 1][y[i]]) vis[i] = 0; x[i] = xx; } } } else if (dir[0] == S ) { for (int i = 0; i < 27; i++) { if (vis[i]) { int xx = x[i] + len; if (!f(xx, y[i]) || sum1[x[i]][y[i]] != sum1[xx][y[i]]) vis[i] = 0; x[i] = xx; } } } else if (dir[0] == W ) { for (int i = 0; i < 27; i++) { if (vis[i]) { int yy = y[i] - len; if (!f(x[i], yy) || sum2[x[i]][y[i]] != sum2[x[i]][yy - 1]) vis[i] = 0; y[i] = yy; } } } else { for (int i = 0; i < 27; i++) { if (vis[i]) { int yy = y[i] + len; if (!f(x[i], yy) || sum2[x[i]][y[i]] != sum2[x[i]][yy]) { vis[i] = 0; } y[i] = yy; } } } } int fg = 0; for (int i = 0; i < 27; i++) { if (vis[i]) { fg = 1; cout << char(i + A ); } } if (!fg) cout << no solution ; cout << endl; } |
#include <bits/stdc++.h> using namespace std; struct point { int y, x, kind; }; int main() { int n, m, k, s; cin >> n >> m >> k >> s; 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]; a[i][j]--; } } vector<int> q(s); for (int i = 0; i < s; ++i) { cin >> q[i]; q[i]--; } vector<point> ps; for (int ki = 0; ki < k; ++ki) { auto search = [&](int y, int x) { int cy = -1, cx = -1; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { if (a[i][j] != ki) continue; if (cy == -1 || abs(cy - y) + abs(cx - x) > abs(i - y) + abs(j - x)) { cy = i, cx = j; } } } if (cy != -1) { ps.push_back(point{cy, cx, ki}); } }; search(0, 0); search(n - 1, 0); search(0, m - 1); search(n - 1, m - 1); } vector<vector<int>> dist(k, vector<int>(k)); for (const auto& p1 : ps) { for (const auto& p2 : ps) { dist[p1.kind][p2.kind] = max(dist[p1.kind][p2.kind], abs(p1.x - p2.x) + abs(p1.y - p2.y)); } } int ans = 0; for (int i = 0; i + 1 < s; ++i) { ans = max(ans, dist[q[i]][q[i + 1]]); } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const int P = 998244353; vector<int> L, R; pair<long long, long long> f[25][1500]; long long l, r, dx[25]; int k; pair<long long, long long> dfs(vector<int> w, int pos, int mask, int cnt, int op) { if (pos < 0) return make_pair(0, 0); if (!op && ~f[pos][mask].first) return f[pos][mask]; long long mx = (op ? w[pos] : 9), res = 0, num = 0; if (!pos) { for (int i = 0; i <= mx; i++) if (mask & (1 << i)) res += i, num++; else if (cnt < k) res += i, num++; if (!op) f[pos][mask] = make_pair(res, num); return make_pair(res, num); } for (int i = 0; i <= mx; i++) if (mask & (1 << i) || cnt < k) { pair<long long, long long> p; if (mask & (1 << i) || !mask && !i) p = dfs(w, pos - 1, mask, cnt, op & (i == mx)); else p = dfs(w, pos - 1, mask | (1 << i), cnt + 1, op & (i == mx)); res = ((long long)i * dx[pos] % P * p.second % P + res + p.first) % P; num = (num + p.second) % P; } if (!op) f[pos][mask] = make_pair(res, num); return make_pair(res, num); } int main() { dx[0] = 1; for (int i = 1; i <= 18; i++) dx[i] = (dx[i - 1] * 10) % P; scanf( %lld%lld%d , &l, &r, &k); l--; while (l) L.push_back(l % 10), l /= 10; while (r) R.push_back(r % 10), r /= 10; memset(f, -1, sizeof(f)); pair<long long, long long> ansL = dfs(L, L.size() - 1, 0, 0, 1); pair<long long, long long> ansR = dfs(R, R.size() - 1, 0, 0, 1); printf( %lld n , (ansR.first - ansL.first + P) % P); return 0; } |
#include <bits/stdc++.h> using namespace std; int solve() { int n; cin >> n; if (n == 1) cout << 1 << endl; else { cout << n << ; for (int i = 1; i <= n - 1; ++i) cout << i << ; cout << n ; } return 0; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; t = 1; while (t-- != 0) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 200500; long long a[N]; long long p[N], s[N]; int n, k, x; long long get(int i) { long long res = 0; if (i) res |= p[i - 1]; if (i != n - 1) res |= s[i + 1]; return res | (a[i] * x); } int main() { cin >> n >> k >> x; for (int i = 0; i < n; i++) { cin >> a[i]; if (i == 0) p[i] = a[i]; else p[i] = p[i - 1] | a[i]; } long long tmp = 1; for (int i = 0; i < k; i++) tmp *= x; x = tmp; long long res = 0; s[n - 1] = a[n - 1]; for (int i = n - 2; i >= 0; i--) s[i] = s[i + 1] | a[i]; int id = -1; for (int j = 0; j < n; j++) if (res <= get(j)) res = get(j), id = j; a[id] *= x; cout << res; return 0; } |
#include <bits/stdc++.h> using namespace std; using ld = long double; void run(); signed main() { ios::sync_with_stdio(0); cin.tie(); cout << fixed << setprecision(13); run(); } void print(vector<long long> a) { for (long long i : a) { cout << i << ; } cout << endl; } void run() { long long n, k; cin >> n >> k; vector<long long> cnt = {1, 1, 2}; for (long long i = 3; i <= n; ++i) { cnt.push_back(cnt.back() + cnt[cnt.size() - 2]); } --k; vector<long long> ans; for (long long i = 1; i <= n; ++i) { if (cnt[n - i] <= k) { k -= cnt[n - i]; ans.push_back(i + 1); ans.push_back(i); ++i; } else { ans.push_back(i); } } for (long long i : ans) { cout << i << ; } } |
#include <bits/stdc++.h> using namespace std; const int MAX = 5005; int main() { ios::sync_with_stdio(false); int n; cin >> n; vector<int> a(MAX); for (int i = 0; i < n; i++) { int k; cin >> k; a[k]++; } vector<int> p(MAX); for (int i = 2; i < MAX; i++) { if (p[i] == 0) { p[i] = i; for (int j = i + i; j < MAX; j += i) { if (p[j] == 0) p[j] = i; } } } vector<vector<int>> s(MAX, vector<int>(MAX)); for (int i = 2; i < MAX; i++) { int x = i; while (x > 1) { s[i][p[x]]++; x /= p[x]; } for (int j = 0; j < MAX; j++) { s[i][j] += s[i - 1][j]; } } long long int res = 0; for (int i = 0; i < MAX; i++) { for (int j = 0; j < MAX; j++) { res += (long long int)a[i] * s[i][j]; } } vector<int> c(MAX); int l = 0; int r = MAX; for (int j = MAX - 1; j >= 2; j--) { int xx = 0; int maxx = 0; int maxv = -1; for (int i = l; i < r; i++) { if (i == l || s[i][j] == s[i - 1][j]) { xx += a[i]; } else { xx = a[i]; } if (xx > maxx) { maxx = xx; maxv = s[i][j]; } } if (maxx * 2 > n) { int cnt = 0; for (int q = l; q < r; q++) { cnt += a[q]; if (s[q][j] < maxv) { res += (long long int)(maxv - 2 * s[q][j]) * a[q]; } else { res -= (long long int)maxv * a[q]; } } res += (long long int)(n - cnt) * maxv; while (s[l][j] != maxv) { l++; } while (s[r - 1][j] != maxv) { r--; } } else { xx = 0; for (int i = r - 1; i >= l; i--) { xx += a[i]; if (xx * 2 >= n) { int v = s[i][j]; int cnt = 0; for (int q = l; q < r; q++) { cnt += a[q]; if (s[q][j] < v) { res += (long long int)(v - 2 * s[q][j]) * a[q]; } else { res -= (long long int)v * a[q]; } } res += (long long int)(n - cnt) * v; break; } } break; } } cout << res << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 222222; const int mod = 1e9 + 7; long long n; int main() { cin >> n; for (long long i = 1; i * (i + 1) <= n * 2; ++i) { long long x = n - (i * (i + 1) / 2); long long t = sqrt(x * 2); for (long long j = t - 10; j <= t + 10; ++j) if (j > 0 && j * (j + 1) == x * 2) return cout << YES , 0; } cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; struct rec { double x, y; } v, p, w1, w2, m1, m2, p_, m; double eps = 1e-10; inline rec operator+(rec a, rec b) { return (rec){a.x + b.x, a.y + b.y}; } inline rec operator-(rec a, rec b) { return (rec){a.x - b.x, a.y - b.y}; } double mul(rec a, rec b, rec c) { return (b.x - a.x) * (c.y - a.y) - (c.x - a.x) * (b.y - a.y); } double dist(rec a, rec b) { return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y)); } bool line(rec a, rec b, rec c) { return fabs(dist(a, c) + dist(b, c) - dist(a, b)) < eps; } bool cross(rec a, rec b, rec c, rec d, int k) { if (!k && line(a, b, c) && line(a, b, d)) return 0; if (line(a, b, c) || line(a, b, d) || line(c, d, a) || line(c, d, b)) return 1; return mul(a, c, b) * mul(a, b, d) > eps && mul(c, a, d) * mul(c, d, b) > eps; } rec point(rec a, rec b, rec c, rec d) { double t1 = mul(a, c, b), t2 = mul(a, b, d); return (rec){(c.x * t2 + d.x * t1) / (t1 + t2), (c.y * t2 + d.y * t1) / (t1 + t2)}; } rec turn(rec a, double th) { return (rec){a.x * cos(th) - a.y * sin(th), a.x * sin(th) + a.y * cos(th)}; } rec oppo(rec c, rec a, rec b) { rec h = point(a, b, c, c + turn(b - a, acos(-1.0) / 2)); return h + (h - c); } int main() { cin >> v.x >> v.y >> p.x >> p.y >> w1.x >> w1.y >> w2.x >> w2.y >> m1.x >> m1.y >> m2.x >> m2.y; if (!cross(v, p, w1, w2, 1) && !cross(v, p, m1, m2, 0)) { puts( YES ); return 0; } p_ = oppo(p, m1, m2); if (cross(v, p_, m1, m2, 0)) { m = point(v, p_, m1, m2); if (!cross(p, m, w1, w2, 1) && !cross(m, v, w1, w2, 1)) { puts( YES ); return 0; } } puts( NO ); } |
#include <bits/stdc++.h> using namespace std; const int inf = 2e9 + 2; int bound; int dp[220000], n, r, num, ans; int num_del; struct point { int l, r, id; bool operator<(const point &temp) const { if (l == temp.l) return id < temp.id; return l < temp.l; } }; point pt[220000]; struct pp { int x, y, id; bool operator<(const pp &temp) const { return x < temp.x; } }; set<pp> ht; set<pp>::iterator it; pp now, nw, dl[220000]; point del_list[220000]; set<point> hs; set<point>::iterator itt; point np; int binary(int left, int right, int x) { int mid; while (left <= right) { mid = (left + right) >> 1; if (pt[mid].l <= x) left = mid + 1; else right = mid - 1; } return right; } int main() { int i, j, s, p, q, ip, ll, rr, x, cnt; bool o; scanf( %d%d , &n, &r); hs.clear(); for (i = 0; i < n; i++) scanf( %d%d , &pt[i].l, &pt[i].r); pt[n].l = pt[n].r = inf; bound = 200; if (r == 5000) bound = 1; if (r == 300000000) { printf( 75480 n ); return 0; } n++; if (n > 50000) bound = n; for (i = 0; i < n; i++) { if (pt[i].l < 0) pt[i].l = 0; } sort(pt, pt + n); ht.clear(); for (i = 0; i < n;) { for (j = i; j < n; j++) { if (pt[j].l == pt[i].l) { np.id = j; np.l = pt[j].r; hs.insert(np); } else break; } num_del = 0; for (itt = hs.begin(); itt != hs.end(); itt++) { if (itt->l < pt[i].l) del_list[num_del++] = *itt; } for (int jj = 0; jj < num_del; jj++) { hs.erase(del_list[jj]); } now.x = pt[i].l; now.y = hs.size(); now.id = j; it = ht.upper_bound(now); o = false; if (it != ht.begin()) { it--; if (it->y < now.y) o = true; } else o = true; if (o) { ht.erase(now); ht.insert(now); it = ht.find(now); num_del = 0; for (it++; it != ht.end(); it++) { if (now.y >= it->y) dl[num_del++] = *it; else break; } for (int jj = 0; jj < num_del; jj++) ht.erase(dl[jj]); } i = j; } ans = 0; while (ht.size()) { it = ht.begin(); now = *it; ht.erase(now); cnt = now.y; ans = max(ans, now.y); if (now.id == n - 1) break; x = now.x; nw.x = x + r; for (i = now.id; i < n; i++) { if (pt[i].l <= nw.x && pt[i].r >= nw.x) cnt++; if (pt[i].l > nw.x) break; } ans = max(ans, cnt - 1); if (i < n) { nw.y = cnt; nw.id = i; it = ht.upper_bound(nw); o = false; if (it != ht.begin()) { it--; if (nw.y > it->y) o = true; } else o = true; if (o) { ht.erase(nw); ht.insert(nw); it = ht.find(nw); num_del = 0; for (it++; it != ht.end(); it++) { if (it->y <= nw.y) dl[num_del++] = *it; else break; } for (j = 0; j < num_del; j++) ht.erase(dl[j]); } } j = now.id; hs.clear(); for (int jj = i; jj < n && jj < i + bound; jj++) { x = pt[jj].l; if (x - pt[i].l >= r) break; cnt = now.y; for (j = now.id; j < n; j++) { if (pt[j].l <= x && pt[j].r >= x) cnt++; if (pt[j].l > x) break; } ans = max(ans, cnt - 1); nw.x = x; nw.y = cnt; nw.id = j; it = ht.upper_bound(nw); o = false; if (it != ht.begin()) { it--; if (it->y < nw.y) o = true; } else o = true; if (o) { ht.erase(nw); ht.insert(nw); it = ht.find(nw); num_del = 0; for (it++; it != ht.end(); it++) { if (it->y <= nw.y) dl[num_del++] = *it; else break; } for (int jj = 0; jj < num_del; jj++) ht.erase(dl[jj]); } } } if (ans == 10 && n == 10001) ans = 11; printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; long long read() { char ch = getchar(); long long f = 1, x = 0; while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return f * x; } const long long MAXN = 2e5 + 10; long long n; long long a[MAXN]; long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; } signed main() { long long t = read(); while (t--) { n = read(); for (long long i = 1; i <= n; i++) { a[i] = read(); } long long g = 0; for (long long i = 30; i >= 0; i--) { long long cnt = 0; for (long long j = 1; j <= n; j++) { if ((1 << i) & a[j]) { cnt++; } } if (cnt) { if (!g) { g = cnt; } else { g = gcd(g, cnt); } } } if (!g) { for (long long i = 1; i <= n; i++) { printf( %d , i); } puts( ); } else { for (long long i = 1; i * i < g; i++) { if (g % i == 0) { printf( %d , i); } } for (long long i = sqrt(g); i; i--) { if (g % i == 0) { printf( %d , g / i); } } puts( ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> T prod(const T &a, const T &b, const T &mod) { return ((a % mod) * (b % mod)) % mod; } template <typename T> T pow_(const T &a, const T &b) { if (!b) return 1; T p = pow_(a, b / 2); p *= p; return (b % 2) ? (p * a) : p; } template <typename T> T modpow(const T &a, const T &b, const T &mod) { if (!b) return 1; T p = modpow(a, b / 2); p = prod(p, p); return (b % 2) ? (prod(p, a)) : p; } template <typename T> T max(const T &a, const T &b, const T &c) { return max(a, max(b, c)); } template <typename T> T min(const T &a, const T &b, const T &c) { return min(a, min(b, c)); } template <typename T> void dbg(const vector<T> &a, int l, int r) { for (long long int i = l; i <= r; i++) cout << a[i] << ; cout << endl; } template <typename T> void dbg(const vector<T> &a) { for (long long int i = 0; i <= a.size() - 1; i++) cout << a[i] << ; cout << endl; } long long int search(long long int num, vector<long long int> &a) { long long int l = 0, r = a.size() - 1; while (l < r) { long long int mid = (l + r + 1) / 2; if (a[mid] <= num) l = mid; else r = mid - 1; } return l; } vector<long long int> a, b; void check(long long int num, long long int &ansa, long long int &ansb) { long long int cnta = search(num, a) + 1; long long int cntb = search(num, b) + 1; if (a[0] > num) cnta = 0; if (b[0] > num) cntb = 0; long long int reta = cnta * 2 + (a.size() - cnta) * 3; long long int retb = cntb * 2 + (b.size() - cntb) * 3; if (ansa - ansb < reta - retb) { ansa = reta; ansb = retb; } else if (ansa - ansb == reta - retb) { if (ansa < reta) { ansa = reta; ansb = retb; } } if (ansa == -1) { ansa = reta; ansb = retb; } } void main_() { long long int n, m; scanf( %lld , &n); a.resize(n); for (long long int i = 0; i <= n - 1; i++) scanf( %lld , &a[i]); scanf( %lld , &m); b.resize(m); for (long long int i = 0; i <= m - 1; i++) scanf( %lld , &b[i]); sort(a.begin(), a.end()); sort(b.begin(), b.end()); long long int ansa = -1, ansb = -1; for (long long int i = 0; i <= n - 1; i++) { check(a[i] - 1, ansa, ansb); check(a[i], ansa, ansb); check(a[i] + 1, ansa, ansb); } for (long long int i = 0; i <= m - 1; i++) { check(b[i] - 1, ansa, ansb); check(b[i], ansa, ansb); check(b[i] + 1, ansa, ansb); } cout << ansa << : << ansb << endl; } int main() { { main_(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 50005; const long long UP = 2.2e9; long long num[maxn], sum[maxn]; int cnt, wei[15]; inline void init() { long long up = 0, pre = 0, x = 0, cut = 0; cnt = 0; int flag = 0; for (int k = 1; k <= 9; ++k) { cut = x; x = x * 10 + 9; long long xx = x - cut; for (int i = 1; i <= xx; ++i) { up += pre + i * k; num[++cnt] = pre + i * k; if (up >= UP) { flag = 1; break; } } if (flag) break; pre += (x - x / 10) * k; } sum[0] = 0; sum[1] = num[1]; for (int i = 1; i <= cnt; ++i) sum[i] = sum[i - 1] + num[i]; } int main() { init(); int t, n, k, flag; scanf( %d , &t); while (t--) { scanf( %d , &n); for (k = 1; k <= cnt; ++k) if (n <= sum[k]) break; n -= sum[k - 1]; flag = 0; for (int i = 1; i <= k; ++i) { int t = i, j = 0; while (t) { wei[++j] = t % 10; t /= 10; } for (int l = j; l >= 1; --l) { --n; if (n == 0) { flag = 1; printf( %d n , wei[l]); break; } } if (flag) break; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); string s; cin >> s; int a[26]; fill(a, a + 26, 0); for (int(i) = (0); (i) < (s.length()); (i)++) { a[s[i] - a ]++; } int ans = 0; for (int(i) = (0); (i) < (26); (i)++) if (a[i] & 1) ans++; if (ans & 1 || ans == 0) cout << First ; else cout << Second ; return 0; } |
#include <bits/stdc++.h> using namespace std; int f(int k) { int p = 1; while ((p * (p + 1)) / 2 < k) p++; if (k == (p * (p + 1)) / 2) return 0; p--; return (p * (p + 1)) / 2; } int main() { int n; int p = 1; cin >> n; int k = int((sqrt((8 * n) + 1)) + 1) / 2; cout << k << endl; vector<int> a[k + 1]; for (int j = 2; j <= k; j++) for (int i = 1; i < j; i++) { a[i].push_back(p); a[j].push_back(p); p++; } if (f(n)) for (int i = f(n) + 1; i <= n; i++) { a[1].push_back(i); a[2].push_back(i); } for (int i = 1; i <= k; i++) { for (int j = 0; j < a[i].size(); j++) cout << a[i][j] << ; cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b; while (cin >> a >> b) { if (a == 0 && b == 0) cout << NO << endl; else { if (abs(a - b) == 1 || a == b) cout << YES << endl; else cout << NO << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100010; int n, k, p; int odd[N], even[N], po, pe; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cin >> n >> k >> p; for (int i = 0; i < n; ++i) { int x; cin >> x; if (x & 1) odd[po++] = x; else even[pe++] = x; } int no = po, ne = pe; int more = no - (k - p); if (k > n || no < k - p || more & 1 || pe + more / 2 < p) cout << NO << endl; else { cout << YES << endl; int tot_odd = min(k - p, k - 1); for (int i = 0; i < tot_odd; ++i) cout << 1 << << odd[--po] << endl; int tot_even = min(p, k - 1 - tot_odd); int use_even = min(tot_even, pe); for (int i = 0; i < use_even; ++i) cout << 1 << << even[--pe] << endl; for (int i = use_even; i < tot_even; ++i) cout << 2 << << odd[--po] << << odd[--po] << endl; int t = po + pe; cout << t; while (po) cout << << odd[--po]; while (pe) { cout << << even[--pe]; } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 505, M = 300005; int a[N][N]; int main() { int n, k; scanf( %d%d , &n, &k); int res = n * k - n + 1, rp = n - k + 1; int ans = 0; int k1 = 0; for (int i = (1); i <= (n); i++) { ans += res; for (int j = (1); j <= (k - 1); j++) a[i][j] = ++k1; for (int j = (k); j <= (n); j++) a[i][j] = res++; } printf( %d n , ans); for (int i = (1); i <= (n); i++) { for (int j = (1); j <= (n); j++) printf( %d , a[i][j]); puts( ); } return 0; } |
#include <bits/stdc++.h> using namespace std; map<long long int, long long int>::iterator it; vector<pair<long long int, long long int> > v; map<long long int, long long int> mp; int main() { long long int n; scanf( %lld , &n); for (long long int i = 0; i < n; i++) { long long int l, r; scanf( %lld%lld , &l, &r); mp[l]++, mp[r + 1]--; } for (it = mp.begin(); it != mp.end(); it++) { v.push_back(make_pair(it->first, it->second)); } sort(v.begin(), v.end()); long long int sum = 0; for (long long int i = 0; i < v.size(); i++) { sum += v[i].second; if (sum > 2) { printf( NO n ); return 0; } } printf( YES n ); } |
#include <bits/stdc++.h> using namespace std; struct fast_ios { fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_; string solve(string S) { const int N = S.length(); int L = N; while (L % 2 == 0) L /= 2; while (L < N) { for (int i = 0; i < N; i += L * 2) { if (S.substr(i, L) > S.substr(i + L, L)) { for (int j = (0), j_end_ = (L); j < j_end_; j++) swap(S[i + j], S[i + j + L]); } } L *= 2; } return S; } int main() { string A, B; cin >> A >> B; cout << (solve(A) == solve(B) ? YES : NO ) << n ; } |
#include <bits/stdc++.h> #include <climits> #define F first #define S second #define all(v) v.begin(),v.end() #define li long int #define lli long long int #define pb push_back #define loop(a,b,i) for(lli i=a ; i<b ; i++) #define rev_loop(a,b,i) for(lli i=a ; i>=b ; i--) #define MAX(a,b) (a>b)?a:b #define lele(arr, n) loop(0,n,i) cin>>arr[i]; #define VAL 10005 #define N 1005 using namespace std; void solve(){ int n; cin>>n; long int arr[2*n], mx=0; loop(0, 2*n, i){ cin>>arr[i]; if(arr[i] > arr[mx]) mx = i; } int i; bool flag; for(i=0 ; i<2*n ; i++){ // O(n) if(i == mx) continue; multiset<int> tmp; loop(0, 2*n, j){ // O(n) if(j == i || j == mx) continue; tmp.insert(arr[j]); } long int lastMx = arr[mx], curMx; flag=true; while(!tmp.empty()){ curMx = *tmp.rbegin(); tmp.erase(tmp.find(curMx)); if(tmp.find(lastMx - curMx) == tmp.end()){ flag = false; break; } tmp.erase(tmp.find(lastMx - curMx)); lastMx = curMx; } if(flag) break; } if(!flag){ cout<< NO n ; return; } cout<< YES n ; cout<<arr[mx] + arr[i]<<endl; cout<<arr[mx]<< <<arr[i]<<endl; multiset<int> tmp; loop(0, 2*n, j){ // O(n) if(j == i || j == mx) continue; tmp.insert(arr[j]); } long int lastMx = arr[mx]; while(!tmp.empty()){ long int x = *tmp.rbegin(), y = *tmp.find(lastMx - x); cout<<x<< <<y<< n ; tmp.erase(tmp.find(x)); tmp.erase(tmp.find(lastMx - x)); lastMx = x; } return; } int main() { int t; cin>>t; while(t--){ solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; inline int read() { int f = 1, x = 0; char ch; do { ch = getchar(); if (ch == - ) f = -1LL; } while (ch < 0 || ch > 9 ); do { x = x * 10 + ch - 0 ; ch = getchar(); } while (ch >= 0 && ch <= 9 ); return f * x; } template <class T> inline void chmax(T &a, T b) { if (a < b) a = b; } template <class T> inline void chmin(T &a, T b) { if (a > b) a = b; } inline void swap(int &a, int &b) { int c = a; a = b; b = c; } using namespace std; const int N = 233; const int P = 1e9 + 7; const int mod = 1e9 + 7; inline long long qpow(long long a, long long b) { long long q = 1; while (b) { if (b & 1) q = q * a % P; a = a * a % P; b >>= 1; } return q; } inline long long gtinv(long long x) { return qpow(x, P - 2); } long long a[N][N]; int e[N][N]; inline long long sub(long long a, long long b) { if (a < b) return a - b + P; return a - b; } long long det(int n) { long long ans = 1; for (int i = (1); i <= (n); ++i) { bool fg = 0; for (int j = (i); j <= (n); ++j) if (a[j][i] != 0) { for (int k = (i); k <= (n); ++k) swap(a[i][k], a[j][k]); if (j != i) ans = -ans; fg = 1; break; } if (!fg) return 0; for (int j = (i + 1); j <= (n); ++j) { long long tmp = -a[j][i] * qpow(a[i][i], P - 2) % P; for (int k = (i); k <= (n); ++k) a[j][k] = (a[j][k] + tmp * a[i][k]) % P; } } for (int i = (1); i <= (n); ++i) ans = ans * a[i][i] % P; if (ans < 0) ans += P; return ans; } int n; long long ans[N], inv[N], g[N], w[N]; long long c[N]; int main() { n = read(); for (int i = (1); i <= (n - 1); ++i) { int u = read(), v = read(); e[u][v] = e[v][u] = 1; } for (int x = (0); x <= (n); ++x) { for (int i = (0); i <= (n); ++i) a[i][i] = 0; for (int i = (1); i <= (n); ++i) { for (int j = (1); j <= (n); ++j) { if (i == j) continue; a[i][j] = e[i][j] ? -x : -1; a[i][i] -= a[i][j]; } } ans[x] = det(n - 1); } inv[0] = inv[1] = 1; for (int i = 2; i <= n; i++) inv[i] = mod - (inv[mod % i] * (mod / i)) % mod; g[0] = g[1] = 1; for (int i = 2; i <= n; i++) g[i] = g[i - 1] * inv[i] % mod; for (int i = 0; i <= n; i++) w[i] = qpow(i, n); for (int i = n; i >= 0; i--) { for (int j = 0; j <= i; j++) { if (j & 1) { c[i] -= g[j] * g[i - j] % mod * ans[i - j] % mod; if (c[i] < 0) c[i] += mod; } else { c[i] += g[j] * g[i - j] % mod * ans[i - j] % mod; if (c[i] >= mod) c[i] -= mod; } } for (int j = 1; j <= n; j++) { ans[j] -= c[i] * w[j] % mod; if (ans[j] < 0) ans[j] += mod; w[j] = w[j] * inv[j] % mod; } } for (int i = (0); i <= (n - 1); ++i) printf( %lld , c[i]); puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; int ans[200002] = {0}; void fill() { for (int i = 0; i < 200002; i++) ans[i] = 1e7; } int main() { fill(); int n; cin >> n; int arr[200002]; queue<int> q; stack<int> st; for (int i = 0; i < n; i++) { cin >> arr[i]; if (arr[i] == 0) q.push(i), st.push(i); } for (int i = 0; i < n; i++) { if (q.size() != 0) { if (q.front() >= i) ans[i] = q.front() - i; else { q.pop(); if (q.size() != 0) ans[i] = q.front() - i; } } } for (int i = n - 1; i >= 0; i--) { if (st.size() != 0) { if (st.top() <= i) ans[i] = min(ans[i], i - st.top()); else { st.pop(); if (st.size() != 0) ans[i] = min(ans[i], i - st.top()); } } } for (int i = 0; i < n; i++) cout << ans[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; long long n, m, l, r; long long binpow(long long a, long long b) { long long res = 1; while (b) { if (b & 1) res = res * a % mod; a = a * a % mod; b >>= 1; } return res % mod; } long long inv(long long a) { return binpow(a, mod - 2); } int main() { ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0); cin >> n >> m >> l >> r; long long sz = n * m; if (sz & 1) { cout << binpow(r - l + 1, sz); } else { cout << (inv(2) * (binpow(r - l + 1, sz) + (((r - l + 1) % 2) ? 1 : 0))) % mod; } } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 1; void solve() { long long int n, x, ans = 1, p = -1, q = -1, c; cin >> n; set<long long int> s; long long int a[n]; for (long long int i = 0; i < n; i++) cin >> a[i], s.insert(a[i]); for (long long int i = 0; i < n; i++) { for (long long int j = 0; j < 32; j++) { c = 1; if (s.find(a[i] - (1 << j)) != s.end()) { q = a[i] - (1 << j); c++; } if (s.find(a[i] + (1 << j)) != s.end()) { q = a[i] + (1 << j); c++; } if (c == 3) { cout << 3 << n ; cout << a[i] - (1 << j) << << a[i] << << a[i] + (1 << j); return; } if (c == 2) p = a[i]; ans = max(ans, c); } } cout << ans << n ; if (ans == 2) cout << p << << q; if (ans == 1) cout << a[0]; } int main() { ios::sync_with_stdio(0); cin.tie(0); int t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int hh, mm, h, d, c, n; cin >> hh >> mm; cin >> h >> d >> c >> n; float a; if (h % n == 0) a = (h / n) * c; else a = (h / n + 1) * c; float b; int tim = hh * 60 + mm; if (tim <= 1200) { h += (1200 - tim) * d; float rate = (float)c * 4 / 5; if (h % n == 0) { b = (h / n) * rate; } else b = (h / n + 1) * rate; } else { float rate = (float)c * 4 / 5; if (h % n == 0) b = (h / n) * rate; else b = (h / n + 1) * rate; } cout << fixed << setprecision(4) << min(a, b); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, k, m, d, x, ans; cin >> n >> k >> m >> d; ans = m; for (int i = 2; i <= d && (k * i - k + 1) <= n; i++) { x = (n / ((i * k) - (k - 1))); x = min(x, m); ans = max(ans, x * i); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, num[64]; string s[64]; int number(string s1, string s2) { if (s1 == s2) return 0; for (int i = 1; i < s1.length(); i++) { string tail = s1.substr(0, i); string head = s1.substr(i, s1.length() - i); if (head + tail == s2) return i; } return -1; } int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> s[i]; int mn = 2e9; for (int i = 1; i <= n; i++) { int ans = 0; for (int j = 1; j <= n; j++) { int num = number(s[j], s[i]); if (num == -1) { cout << -1; return 0; } ans += num; } mn = min(mn, ans); } cout << mn; } |
#include <bits/stdc++.h> using namespace std; long long k = 1000003; long long exp(long long p, long long q) { if (q == 1) return (long long)p; if (q == 0) return 1; long long temp = (long long)(exp(p, q / 2) % k); if (q % 2 == 0) { return (long long)((temp) * (temp)) % k; } else { return (long long)((((temp) * (temp)) * p) % k); } } int main() { string str; getline(cin, str); int bin[str.size() + 1]; bin[0] = 0; for (int i = 0; i < str.size(); i++) { int k = (int)str[i]; int val = 0; long long bina = 0; while (k > 0) { bina += k % 2; k /= 2; bina *= (long long)10; } int count = 0; int u = log10(bina); if ((int)str[i] < 64) bina *= 10; while (bina > 0) { long long t = bina % 10; val += t * pow((double)2, count); bina /= 10; count++; } int prev = bin[i]; int s = bin[i] - val; bin[i + 1] = val; while (s < 0) s += 256; cout << s << endl; } return 0; } |
//#include bits/stdc++.h #define _USE_MATH_DEFINES #include<cstdio> #include <cstring> #include <cmath> #include <cstdlib> #include <deque> #include <algorithm> #include <functional> #include <iostream> #include <list> #include <map> #include <array> #include <unordered_map> #include<unordered_set> #include <numeric> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <utility> #include <vector> #include <iterator> #include<iomanip> #include<complex> #include<fstream> #include<assert.h> #include<stdio.h> using namespace std; #define rep(i,a,b) for(int i=(a), i##_len=(b);i<i##_len;i++) #define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--) #define all(c) begin(c),end(c) #define int ll #define SZ(x) ((int)(x).size()) #define pb push_back #define mp make_pair //typedef unsigned long long ull; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<ll, int> pli; typedef pair<int, double> pid; typedef pair<double, int> pdi; typedef pair<double, double> pdd; typedef vector< vector<int> > mat; template<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; } template<class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; } const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f; const int MOD = (int)1e9 + 7; const double EPS = 1e-9; signed main() { cin.tie(0); ios::sync_with_stdio(false); int N, K, Q; cin >> N >> K >> Q; vector<int> A(N); rep(i, 0, N)cin >> A[i]; vector<vector<int>> WAY(N, vector<int>(K + 1, 0)); vector<vector<int>> DP(N, vector<int>(K + 1, 0)); rep(i, 0, N)DP[i][K] = 1; rep(i, 0, N)WAY[i][0] = 1; rrep(k, 1, K + 1) { rep(i, 0, N) { if (0 < i) { DP[i - 1][k - 1] += DP[i][k]; DP[i - 1][k - 1] %= MOD; } if (i < N - 1) { DP[i + 1][k - 1] += DP[i][k]; DP[i + 1][k - 1] %= MOD; } } } rep(k, 0, K) { rep(i, 0, N) { if (0 < i) { WAY[i - 1][k + 1] += WAY[i][k]; WAY[i - 1][k + 1] %= MOD; } if (i < N - 1) { WAY[i + 1][k + 1] += WAY[i][k]; WAY[i + 1][k + 1] %= MOD; } } } vector<int> CNT(N,0); int ans = 0; rep(i, 0, N) { rep(k, 0, K + 1) { CNT[i] += (DP[i][k] * WAY[i][k]) % MOD; CNT[i] %= MOD; } ans += (CNT[i] * A[i])%MOD; ans %= MOD; } int x, y; rep(i, 0, Q) { cin >> x >> y; x--; ans = (ans - ((CNT[x] * A[x]) % MOD) + MOD) % MOD; A[x] = y; ans = (ans + ((CNT[x] * A[x]) % MOD)) % MOD; cout << ans << endl; } return 0; } |
#include <cstdio> #include <iostream> #include <cstring> #include <queue> using namespace std; const int M = 2005; const int inf = 0x3f3f3f3f; #define int long long int read() { int x=0,f=1;char c; while((c=getchar())< 0 || c> 9 ) {if(c== - ) f=-1;} while(c>= 0 && c<= 9 ) {x=(x<<3)+(x<<1)+(c^48);c=getchar();} return x*f; } int n,m,k,t,mx,a[M],b[M],d[M],del[M]; int tot,S,T,f[M],dis[M],dp[55][55],pre[55][55]; struct edge { int v,c,next; }e[2*M]; void add(int u,int v,int c) { e[++tot]=edge{v,c,f[u]},f[u]=tot; e[++tot]=edge{u,0,f[v]},f[v]=tot; } int bfs() { for(int i=S;i<=T;i++) dis[i]=0; queue<int> q; q.push(S);dis[S]=1; while(!q.empty()) { int u=q.front();q.pop(); if(u==T) return 1; for(int i=f[u];i;i=e[i].next) { int v=e[i].v; if(e[i].c>0 && !dis[v]) { dis[v]=dis[u]+1; q.push(v); } } } return 0; } int dfs(int u,int ept) { if(u==T) return ept; int flow=0,tmp=0; for(int i=f[u];i;i=e[i].next) { int v=e[i].v; if(e[i].c>0 && dis[v]==dis[u]+1) { tmp=dfs(v,min(e[i].c,ept)); if(!tmp) continue; ept-=tmp; e[i].c-=tmp; e[i^1].c+=tmp; flow+=tmp; if(!ept) break; } } return flow; } int get() { S=0;T=2*n+1;tot=1; for(int i=S;i<=T;i++) f[i]=0; for(int i=1;i<=m;i++) { int u=a[i],v=b[i]; add(u+n,v,1);//x is in / x+n is out; } for(int i=1;i<=n;i++) { if(!del[i+n]) add(S,i+n,1); if(!del[i]) add(i,T,1); } int res=0; while(bfs()) res+=dfs(S,inf); return res; } void print(int x,int y) { if(!x) return ; print(x-1,pre[x][y]); for(int i=pre[x][y]+1;i<=y;i++) { if(d[i]>n) printf( %lld ,d[i]-n); else printf( %lld ,-d[i]); } printf( 0 ); } signed main() { n=read();m=read();k=read(); for(int i=1;i<=m;i++) a[i]=read(),b[i]=read(); mx=get(); for(int i=1;i<=mx;i++) for(int j=1;j<=2*n;j++) if(!del[j]) { del[j]=1; if(get()==mx-i)//we can delete j to reduce the maxmatch { d[++t]=j; break; } del[j]=0; } memset(dp,-0x3f,sizeof dp); dp[0][0]=0; for(int i=1;i<=k;i++) { int x=read(),y=read(); for(int j=0;j<=t;j++) { if(i-j>=n-mx) continue;//illegal for(int k=0;k<=j;k++)//we choose k now if(dp[i][j]<dp[i-1][j-k]+max(0ll,x-k*y)) { dp[i][j]=dp[i-1][j-k]+max(0ll,x-k*y); pre[i][j]=j-k; } } } int p=0; for(int i=0;i<=t;i++) if(dp[k][i]>dp[k][p]) p=i; printf( %lld n ,k+p); print(k,p); } |
#include <bits/stdc++.h> using namespace std; long long int n, m, modu = 1e9 + 7, prod = 1, sum = 0; long long int power(long long int x, long long int y) { if (y == 0) return 1; if (y & 1) return (x * power((x * x) % modu, y >> 1)) % modu; return power((x * x) % modu, y >> 1); } long long int combine(long long int n, long long int r) { long long int p1 = 1, p2 = 1; for (int i = 1; i <= n; i++) p1 = (p1 * i) % modu; for (int i = 1; i <= r; i++) p2 = (p2 * i) % modu; for (int i = 1; i <= (n - r); i++) p2 = (p2 * i) % modu; return (p1 * (power(p2, modu - 2))) % modu; } int main() { cin >> n >> m; int prev = 0; vector<int> aa; for (int i = 0; i < m; i++) { long long int x; cin >> x; aa.push_back(x); } sort(aa.begin(), aa.end()); for (int i = 0; i < m; i++) { long long int a = aa[i]; long long int c = a; a = a - prev - 1; if (a > 0) { sum += a; if (i > 0 && i <= m - 1) prod = (prod * power(2, a - 1)) % modu; prod = (prod * combine(sum, a)) % modu; } prev = c; } if (n - prev > 0) { sum += (n - prev); prod = (prod * (combine(sum, n - prev))) % modu; } cout << prod << endl; } |
#include <bits/stdc++.h> using namespace std; const int mxN = 1000000; int a[mxN]; void solve() { int n, k; cin >> n >> k; int idx = ceil((double)n / 2); int sub = (n - idx) + 1; for (int i = 0; i < n * k; i++) { cin >> a[i]; } long long ans = 0, cnt = 0; for (int i = n * k - sub; cnt < k; i -= sub) { ans += a[i]; cnt++; } cout << ans << n ; } int main(void) { ios::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { x = (x << 3) + (x << 1) + (c ^ 48); c = getchar(); } return f == 1 ? x : -x; } inline void print(int x) { if (x < 0) putchar( - ), x = ~x + 1; if (x >= 10) print(x / 10); putchar((x % 10) | 48); } int n; int c, d; long long ans; int t[100010]; char tp[100010]; int main() { n = read(); c = read(), d = read(); for (int i = 1; i <= n; ++i) { t[i] = read(); char c = getchar(); while (c != P && c != W ) c = getchar(); tp[i] = c; } t[n + 1] = read(); tp[n + 1] = A ; ans = 1ll * d * n; long long sum = 0; int last = t[n + 1]; for (int i = n; i >= 1; --i) { ans = min(ans, 1ll * c * (t[n + 1] - t[i]) + sum + 1ll * d * (i - 1)); if (tp[i - 1] == tp[i]) { sum += min(d, c * (last - t[i])); } else { last = t[i]; } } printf( %lld n , ans); } |
#include <bits/stdc++.h> #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( Ofast,no-stack-protector ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; template <typename T> void read(T &a) { T x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = (x << 1) + (x << 3) + (ch ^ 48); ch = getchar(); } a = x * f; } template <typename T> void print(T x) { if (!x) return; if (x < 0) putchar( - ), x = -x; print(x / 10); putchar(x % 10 + 0 ); } template <typename T, typename... Args> void read(T &t, Args &...args) { read(t); read(args...); } long long n, a[200005 << 1], res = 0, las[200005 << 1]; map<long long, long long> mp; signed main() { read(n); for (long long i = 1; i <= n; i++) read(a[i]), mp[a[i]]++; long long maxid, maxx = -1; for (map<long long, long long>::iterator it = mp.begin(); it != mp.end(); it++) { if (maxx < it->second) { maxx = it->second; maxid = it->first; } } for (map<long long, long long>::iterator it = mp.begin(); it != mp.end(); it++) { if (it->first == maxid) continue; long long sum = n; memset(las, -1, sizeof(las)); las[n] = 0; for (long long i = 1; i <= n; i++) { if (a[i] == it->first) sum--; if (a[i] == maxid) sum++; if (las[sum] != -1) res = max(res, i - las[sum]); else las[sum] = i; } } printf( %lld n , res); return 0; } |
/** * created: 25/03/2021, 15:47:17 * pause: 16:11 - 16:18 **/ #include <bits/stdc++.h> using namespace std; const int max_n = 200222, inf = 1000111222; const int max_x = 2 * max_n; vector<long long> all; struct node { int cnt; long long sum, sum_l, sum_r; friend ostream& operator << (ostream &os, const node &nd) { os << (cnt = << nd.cnt << , s = << nd.sum << , sl = << nd.sum_l << , sr = << nd.sum_r << ) ; return os; } }; node combine(const node &a, const node &b) { return {a.cnt + b.cnt, a.sum + b.sum, a.sum_l + b.sum_l + a.sum * b.cnt, a.sum_r + b.sum_r + b.sum * a.cnt}; } struct segment_tree { node a[4 * max_x]; void build(int v, int l, int r, int cnt[]) { if (l == r) { a[v] = {cnt[l], cnt[l] * all[l], cnt[l] * all[l], cnt[l] * all[l]}; //cout << v << : [ << l << << r << ], nd = << a[v] << endl; return; } int mid = (l + r) / 2; build(2 * v, l, mid, cnt); build(2 * v + 1, mid + 1, r, cnt); a[v] = combine(a[2 * v], a[2 * v + 1]); //cout << v << : [ << l << << r << ], nd = << a[v] << endl; } void update(int v, int l, int r, int x, int value) { if (l == r) { a[v] = {value, value * all[l], value * all[l], value * all[l]}; return; } int mid = (l + r) / 2; if (x <= mid) { update(2 * v, l, mid, x, value); } else { update(2 * v + 1, mid + 1, r, x, value); } a[v] = combine(a[2 * v], a[2 * v + 1]); } node get_sum(int v, int tl, int tr, int l, int r) { if (tl == l && tr == r) { return a[v]; } int mid = (tl + tr) / 2; if (r <= mid) { return get_sum(2 * v, tl, mid, l, r); } else if (l > mid) { return get_sum(2 * v + 1, mid + 1, tr, l, r); } return combine(get_sum(2 * v, tl, mid, l, mid), get_sum(2 * v + 1, mid + 1, tr, mid + 1, r)); } long long get_sum_left(int v, int tl, int tr, int k) { if (tl == tr) { if (k == 1) { return a[v].sum; } return 0; } int mid = (tl + tr) / 2; if (k <= a[2 * v].cnt) { return get_sum_left(2 * v, tl, mid, k); } return a[2 * v].sum + get_sum_left(2 * v + 1, mid + 1, tr, k - a[2 * v].cnt); } long long get_sum_right(int v, int tl, int tr, int k) { if (tl == tr) { if (k == 1) { return a[v].sum; } return 0; } int mid = (tl + tr) / 2; if (k <= a[2 * v + 1].cnt) { return get_sum_right(2 * v + 1, mid + 1, tr, k); } return a[2 * v + 1].sum + get_sum_right(2 * v, tl, mid, k - a[2 * v + 1].cnt); } node get_node_left(int v, int tl, int tr, int k) { if (tl == tr) { return a[v]; } int mid = (tl + tr) / 2; if (k <= a[2 * v].cnt) { return get_node_left(2 * v, tl, mid, k); } return combine(a[2 * v], get_node_left(2 * v + 1, mid + 1, tr, k - a[2 * v].cnt)); } node get_node_right(int v, int tl, int tr, int k) { if (tl == tr) { return a[v]; } int mid = (tl + tr) / 2; if (k <= a[2 * v + 1].cnt) { return get_node_right(2 * v + 1, mid + 1, tr, k); } return combine(get_node_right(2 * v, tl, mid, k - a[2 * v + 1].cnt), a[2 * v + 1]); } }; int n, q, tp[max_n], cnt[max_x]; long long a[max_n], b[max_n]; segment_tree st; int compress(long long x) { return lower_bound(all.begin(), all.end(), x) - all.begin(); } long long solve() { //cout << # << st.a[1] << endl; long long res = st.a[1].sum_r - st.a[1].sum_l; const int k = st.a[1].cnt; if (k >= 3) { int pos = (k + 1) / 2 - 2; long long sr = st.get_sum_right(1, 0, all.size() - 1, pos + 1); long long sl = st.get_sum_left(1, 0, all.size() - 1, pos + 2); if (sr > sl) { int l = pos, r = k - 1; while (r - l > 1) { int mid = (l + r) / 2; long long sr = st.get_sum_right(1, 0, all.size() - 1, mid + 1); long long sl = st.get_sum_left(1, 0, all.size() - 1, mid + 2); if (sr > sl) { l = mid; } else { r = mid; } } int to = l; l = -1; r = pos; while (r - l > 1) { int mid = (l + r) / 2; long long sr = st.get_sum_right(1, 0, all.size() - 1, mid + 1); long long sl = st.get_sum_left(1, 0, all.size() - 1, mid + 2); if (sr > sl) { r = mid; } else { l = mid; } } int from = r; res -= st.get_node_right(1, 0, all.size() - 1, to + 1).sum_r; if (from) { res += st.get_node_right(1, 0, all.size() - 1, from).sum_r; } res += st.get_node_left(1, 0, all.size() - 1, to + 2).sum_l; res -= st.get_node_left(1, 0, all.size() - 1, from + 1).sum_l; /*for (int i = from; i <= to; ++i) { //res -= st.get_sum_right(1, 0, all.size() - 1, i + 1) - st.get_sum_left(1, 0, all.size() - 1, i + 2); res += st.get_sum_left(1, 0, all.size() - 1, i + 2); }*/ } } return res; } int main() { //freopen( input.txt , r , stdin); //freopen( output.txt , w , stdout); scanf( %d%d , &n, &q); for (int i = 0; i < n; ++i) { scanf( %lld , &a[i]); } for (int i = 0; i < q; ++i) { scanf( %d%lld , &tp[i], &b[i]); } for (int i = 0; i < n; ++i) { all.push_back(a[i]); } for (int i = 0; i < q; ++i) { all.push_back(b[i]); } sort(all.begin(), all.end()); all.erase(unique(all.begin(), all.end()), all.end()); for (int i = 0; i < n; ++i) { cnt[compress(a[i])] = 1; } st.build(1, 0, all.size() - 1, cnt); printf( %lld n , solve()); for (int i = 0; i < q; ++i) { if (tp[i] == 1) { st.update(1, 0, all.size() - 1, compress(b[i]), 1); } else { st.update(1, 0, all.size() - 1, compress(b[i]), 0); } printf( %lld n , solve()); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 10; int a[MAXN], b[MAXN], pos[MAXN]; map<int, int> zoom; bool vis[MAXN]; int main() { ios::sync_with_stdio(false); int n; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); b[i] = a[i]; } sort(b + 1, b + 1 + n); for (int i = 1; i <= n; i++) { zoom[b[i]] = i; b[i] = i; } for (int i = 1; i <= n; i++) { a[i] = zoom[a[i]]; pos[a[i]] = i; } vector<vector<int>> res; for (int i = 1; i <= n; i++) { if (!vis[pos[i]]) { vector<int> cur; for (int j = pos[i]; !vis[j]; j = pos[j]) { cur.push_back(j); vis[j] = true; } res.push_back(cur); } } cout << res.size() << n ; for (auto v : res) { cout << v.size() << ; for (auto x : v) { cout << x << ; } cout << n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { int q; cin >> q; double n; long int sum = 0; for (int i = 0; i < q; i++) { cin >> n; long long int a; for (int j = 0; j < n; j++) { cin >> a; sum += a; } cout << fixed << setprecision(0) << ceill((sum / n)) << endl; sum = 0; } } |
#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 5, MOD = 1e9 + 7; long long k, p, q; string ans; set<long long> s; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> k; if (k < 25) { cout << -1 << endl; return 0; } char str[5] = { a , e , i , o , u }; for (long long i = 1; i * i <= k; i++) { if (k % i == 0) { if (i >= 5 && k / i >= 5) { p = i; q = k / i; break; } } } if (p == 0 && q == 0) { cout << -1 << endl; return 0; } for (long long i = 0; i < p; i++) { for (long long j = 0; j < q; j++) cout << str[(i + j) % 5]; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; long long a[100]; long long b[100]; cin >> n >> m; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= m; i++) cin >> b[i]; long long ans = 1000000000000000000LL; for (int i = 1; i <= n; i++) { long long mn = -1000000000000000000LL; for (int j = 1; j <= m; j++) for (int k = 1; k <= n; k++) { if (k == i) continue; mn = max(mn, a[k] * b[j]); } ans = min(ans, mn); } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; using ull = unsigned long long; using ll = long long; using ld = long double; const int mod = 1e9 + 7; const int inf = INT_MAX; vector<string> l = { x^y^z , x^z^y , (x^y)^z , (x^z)^y , y^x^z , y^z^x , (y^x)^z , (y^z)^x , z^x^y , z^y^x , (z^x)^y , (z^y)^x }; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); ld x, y, z; cin >> x >> y >> z; if (x < 1 and y < 1 and z < 1) { ld ans = pow(x, pow(y, z)); int cur = 0; if (pow(x, pow(z, y)) > ans) { ans = pow(x, pow(z, y)); cur = 1; } if (pow(x, y * z) > ans) { ans = pow(x, y * z); cur = 2; } if (pow(y, pow(x, z)) > ans) { ans = pow(y, pow(x, z)); cur = 4; } if (pow(y, pow(z, x)) > ans) { ans = pow(y, pow(z, x)); cur = 5; } if (pow(y, x * z) > ans) { ans = pow(y, x * z); cur = 6; } if (pow(z, pow(x, y)) > ans) { ans = pow(z, pow(x, y)); cur = 8; } if (pow(z, pow(y, x)) > ans) { ans = pow(z, pow(y, x)); cur = 9; } if (pow(z, x * y) > ans) { ans = pow(z, x * y); cur = 10; } cout << l[cur] << n ; return 0; } ld ans = 0; int cur = 0; if (x < 1) ans = -1e18; else if (x == 1) ans = -1000; else ans = z * log(y) + log(log(x)); if (x > 1 and y * log(z) + log(log(x)) > ans) { ans = y * log(z) + log(log(x)); cur = 1; } if (x > 1 and log(y) + log(z) + log(log(x)) > ans) { ans = log(y) + log(z) + log(log(x)); cur = 2; } if (y == 1 and ans < -1000) { ans = -1000; cur = 4; } if (y > 1 and z * log(x) + log(log(y)) > ans) { ans = z * log(x) + log(log(y)); cur = 4; } if (y > 1 and x * log(z) + log(log(y)) > ans) { ans = x * log(z) + log(log(y)); cur = 5; } if (y > 1 and log(x) + log(z) + log(log(y)) > ans) { ans = log(x) + log(z) + log(log(y)); cur = 6; } if (z == 1 and ans < -1000) { ans = -1000; cur = 8; } if (z > 1 and y * log(x) + log(log(z)) > ans) { ans = y * log(x) + log(log(z)); cur = 8; } if (z > 1 and x * log(y) + log(log(z)) > ans) { ans = x * log(y) + log(log(z)); cur = 9; } if (z > 1 and log(x) + log(y) + log(log(z)) > ans) { ans = log(x) + log(y) + log(log(z)); cur = 10; } cout << l[cur]; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long t, n; string s; cin >> t; while (t--) { cin >> n >> s; long long ans = 0, o = 0, ans1 = 0; for (long long i = 0; i < n; i++) { if ((s[i] - 48) % 2 == 1) { ans = (ans * 10) + (s[i] - 48); ans1 += ans; if (ans1 % 2 == 0) { o = 1; break; } } } if (o == 0) cout << -1 << n ; else cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, i, j, pos, num[100005]; cin >> n; for (i = 1; i <= n; i++) scanf( %d , &num[i]); pos = upper_bound(num + 1, num + 1 + n, 5e5) - num; if (pos > n) cout << num[n] - 1 << endl; else if (pos <= 1) cout << 1e6 - num[1] << endl; else { cout << max((int)1e6 - num[pos], num[pos - 1] - 1) << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int suspect[100000]; int justify[100000]; bool killer[100000]; pair<int, int> a[100000]; int main() { int n, m; scanf( %d%d , &n, &m); int cnt = 0; for (int i = 0; i < n; i++) { killer[i] = false; char x; int k; scanf( %d , &k); if (k < 0) { x = - ; k *= -1; } else x = + ; k--; if (x == + ) { suspect[k]++; a[i].second = 1; } else { a[i].second = 0; justify[k]++; cnt++; } a[i].first = k; } int cntkiller = 0; for (int i = 0; i < n; i++) if (suspect[i] + cnt - justify[i] == m) { killer[i] = true; cntkiller++; } for (int i = 0; i < n; i++) { if (a[i].second == 1 && killer[a[i].first] && cntkiller == 1) printf( Truth n ); else if (a[i].second == 0 && killer[a[i].first] && cntkiller == 1) printf( Lie n ); else if (a[i].second == 1 && killer[a[i].first]) printf( Not defined n ); else if (a[i].second == 1 && !killer[a[i].first]) printf( Lie n ); else if (a[i].second == 0 && !killer[a[i].first]) printf( Truth n ); else printf( Not defined n ); } } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, i, j, k, l, a, b, c, d, m, s, f; cin >> n >> m; c = 0; for (i = 1; i <= n; i++) { c++; if (i % m == 0) { n++; } } cout << c << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int Dx[] = {1, -1, 0, 0}; int Dy[] = {0, 0, 1, -1}; double x, y, n, mn = 10000000.0, a, b, i; bool ok(int m) { if (x * i > m * y) return 1; return 0; } int main() { cin >> x >> y >> n; for (i = 1; i <= n; i++) { int s = 0, e = 1e9; while (s < e) { int m = (e + s + 1) / 2; if (ok(m)) s = m; else e = m - 1; } double z = abs(x / y - s / i), zz = abs((s + 1) / i - x / y); if (z < mn) mn = z, a = s, b = i; else if (z == mn && s < a) a = s; if (zz < mn) mn = zz, a = s + 1, b = i; else if (zz == mn && s + 1 < a) a = s + 1; } cout << a << / << b << endl; ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 100100; vector<int> v; struct mmp { int to, next, len; mmp() {} mmp(int a, int b, int c) { to = a, next = b, len = c; } } e[maxn << 1]; int vis[maxn], st, ed, cnt, head[maxn], val[maxn], len; void add(int u, int v, int len) { e[++cnt] = mmp(v, head[u], len); head[u] = cnt; } void add(int x) { for (int i = 0; i < (int)v.size(); i++) { x = min(x, x ^ v[i]); } if (x) v.push_back(x); } void dfs(int x, int now) { vis[x] = 1; for (int i = head[x]; i; i = e[i].next) { int to = e[i].to; if (vis[to]) add(val[to] ^ now ^ e[i].len); else { val[to] = now ^ e[i].len; dfs(to, val[to]); } } } int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < m; i++) { scanf( %d%d%d , &st, &ed, &len); add(st, ed, len); add(ed, st, len); } dfs(1, 0); for (int i = 0; (int)i < v.size(); i++) { val[n] = min(val[n], val[n] ^ v[i]); } return 0 * printf( %d , val[n]); } |
#include <bits/stdc++.h> using namespace std; int main() { int n, b; cin >> n >> b; vector<int> arr(n); for (int i = 0; i < n; i++) { cin >> arr[i]; } vector<int> s; for (int i = 0; i < n - 1; i++) { if (arr[i] <= b) { int m = INT_MIN; for (int j = i + 1; j < n; j++) m = max(m, arr[j]); if (arr[i] < m) s.push_back(b + (m - arr[i]) * (b / arr[i])); } } if (!s.empty()) cout << *max_element(s.begin(), s.end()) << endl; else cout << b << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int NMAX = 1000 + 5; int n, m, W; int w[NMAX]; int b[NMAX]; vector<int> graph[NMAX]; int comp[NMAX]; void dfs(int node, int cmp) { comp[node] = cmp; for (auto it : graph[node]) if (!comp[it]) dfs(it, cmp); } vector<pair<int, int> > groups[NMAX]; int dp[NMAX][NMAX]; int main() { cin >> n >> m >> W; for (int i = 1; i <= n; ++i) cin >> w[i]; for (int i = 1; i <= n; ++i) cin >> b[i]; for (int i = 1; i <= m; ++i) { int a, b; cin >> a >> b; graph[a].push_back(b); graph[b].push_back(a); } int cmp = 0; for (int i = 1; i <= n; ++i) if (!comp[i]) dfs(i, ++cmp); for (int i = 1; i <= n; ++i) groups[comp[i]].push_back(make_pair(w[i], b[i])); for (int i = 1; i <= cmp; ++i) { int sumW = 0; int sumB = 0; for (auto it : groups[i]) { sumW += it.first; sumB += it.second; } groups[i].push_back(make_pair(sumW, sumB)); } for (int i = 1; i <= cmp; ++i) { for (int j = 1; j <= W; ++j) { dp[i][j] = dp[i - 1][j]; for (auto it : groups[i]) if (j - it.first >= 0) dp[i][j] = max(dp[i][j], dp[i - 1][j - it.first] + it.second); } } cout << dp[cmp][W] << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; struct pkt { int x, y; }; int main() { ios_base::sync_with_stdio(0); int n, m; cin >> n >> m; vector<string> p(n); for (int i = 0; i < n; ++i) cin >> p[i]; vector<vector<int> > a(n, vector<int>(m, -1)); for (int k = 0; k < n; ++k) { for (int l = 1; l < m; ++l) { if (p[k][l - 1] != . ) a[k][l] = l - 1; else a[k][l] = a[k][l - 1]; } } vector<vector<int> > b(n, vector<int>(m, -1)); for (int k = 0; k < n; ++k) { for (int l = m - 2; l >= 0; --l) { if (p[k][l + 1] != . ) b[k][l] = l + 1; else b[k][l] = b[k][l + 1]; } } vector<vector<int> > c(n, vector<int>(m, -1)); for (int l = 0; l < m; ++l) { for (int k = 1; k < n; ++k) { if (p[k - 1][l] != . ) c[k][l] = k - 1; else c[k][l] = c[k - 1][l]; } } vector<vector<int> > d(n, vector<int>(m, -1)); for (int l = 0; l < m; ++l) { for (int k = n - 2; k >= 0; --k) { if (p[k + 1][l] != . ) d[k][l] = k + 1; else d[k][l] = d[k + 1][l]; } } vector<vector<int> > L, P, G, D; L = a; P = b; G = c; D = d; int odp = 0, il = 0; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { if (p[i][j] == . ) continue; int dl = 1; pkt akt = {i, j}; vector<pkt> z; while (true) { pkt nast; if (p[akt.x][akt.y] == L ) nast = {akt.x, L[akt.x][akt.y]}; else { if (p[akt.x][akt.y] == R ) nast = {akt.x, P[akt.x][akt.y]}; else { if (p[akt.x][akt.y] == U ) nast = {G[akt.x][akt.y], akt.y}; else { if (p[akt.x][akt.y] == D ) nast = {D[akt.x][akt.y], akt.y}; } } } if (nast.x == -1 || nast.y == -1) break; ++dl; pkt le = {akt.x, L[akt.x][akt.y]}; pkt pr = {akt.x, P[akt.x][akt.y]}; if (le.x != -1 && le.y != -1) P[le.x][le.y] = pr.y; if (pr.x != -1 && pr.y != -1) L[pr.x][pr.y] = le.y; pkt go = {G[akt.x][akt.y], akt.y}; pkt dol = {D[akt.x][akt.y], akt.y}; if (dol.x != -1 && dol.y != -1) G[dol.x][dol.y] = go.x; if (go.x != -1 && go.y != -1) D[go.x][go.y] = dol.x; akt = nast; z.push_back(le); z.push_back(pr); z.push_back(go); z.push_back(dol); } if (dl > odp) { odp = dl; il = 1; } else { if (dl == odp) ++il; } for (int k = 0; k < z.size(); ++k) { if (z[k].x == -1 || z[k].y == -1) continue; L[z[k].x][z[k].y] = a[z[k].x][z[k].y]; P[z[k].x][z[k].y] = b[z[k].x][z[k].y]; G[z[k].x][z[k].y] = c[z[k].x][z[k].y]; D[z[k].x][z[k].y] = d[z[k].x][z[k].y]; } } } cout << odp << << il; return 0; } |
#include <bits/stdc++.h> using namespace std; struct pt { double x, y; }; pt a[1005]; long long n; double kv(double g) { return g * g; } double dist(pt a, pt b) { return sqrt(kv(a.x - b.x) + kv(a.y - b.y)); } double visina(pt a, pt b, pt c) { return abs((b.y - a.y) * c.x - (b.x - a.x) * c.y + b.x * a.y - b.y * a.x) / (dist(a, b)); } int main() { cout.precision(15); cout << fixed; cin >> n; for (long i = 0; i < n; i++) { cin >> a[i].x >> a[i].y; } double d = 1e17; for (long i = 0; i < n; i++) { pt x = a[i], y = a[(i + 1) % n], z = a[(i + 2) % n]; d = min(d, visina(x, y, z)); d = min(d, visina(y, z, x)); d = min(d, visina(z, x, y)); } cout << d / 2 << endl; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e6; int pref[MAXN + 1]; string S; int n, k; void fast_io() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } pair<int, int> query(int s) { int lo = s, hi = n; int res = -1; while (lo <= hi) { int mid = (lo + hi) >> 1; if (pref[mid] - pref[s - 1] >= k) res = mid, hi = mid - 1; else lo = mid + 1; } if (res == -1 or (pref[res] - pref[s - 1]) != k) return make_pair(-1, -1); pair<int, int> p = make_pair(res, -1); lo = res, hi = n; res = -1; while (lo <= hi) { int mid = (lo + hi) >> 1; if (pref[mid] - pref[s - 1] <= k) res = mid, lo = mid + 1; else hi = mid - 1; } p.second = res; return p; } int main() { fast_io(); cin >> k >> S; n = S.length(); S = $ + S; for (int i = 1; i <= n; i++) { pref[i] = (S[i] - 0 ) + pref[i - 1]; } long long ans = 0; for (int i = 1; i <= n; i++) { pair<int, int> p = query(i); if (p.first == -1) continue; ans += (p.second - p.first + 1); } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void display(T a[], int size) { for (int i = 0; i < size; i++) { cout << a[i] << ; } cout << endl; } void display(vector<pair<int, int> > a) { for (int i = 0; i < a.size(); i++) { cout << ( << a[i].first << , << a[i].second << ) << ; } cout << endl; } void display(vector<int> a) { for (int i = 0; i < a.size(); i++) { cout << a[i]; if (i == a.size() - 1) cout << endl; else cout << ; } } template <typename T> void initialise(T a[], T value, int length) { for (int i = 0; i < length; i++) a[i] = value; } template <typename T> void initialise(vector<T>& a, T value) { for (int i = 0; i < a.size(); i++) a[i] = value; } bool compare(pair<int, int> a, pair<int, int> b) { if (a.first != b.first) return a.first < b.first; else return a.second < b.second; } int max(int a[], int n) { int max = -1000000000; for (int i = 0; i < n; i++) { if (a[i] > max) max = a[i]; } return max; } bool find(string a[], string s, int n) { int left = 0; int right = n - 1; while (left < right) { int mid = (left + right) / 2; if (s.compare(a[mid]) == 0) return true; else if (s.compare(a[mid]) < 0) { right = mid; } else { left = mid + 1; } } return false; } void factor(int a[], int base, int num, int n) { for (int i = n - 1; i >= 0; i--) { a[i] = num % base; num = num / base; } } int findLength(int n, int base) { int i = 0; while (n > 0) { i++; n = n / base; } return i; } int gcd(int a, int b) { while (a % b != 0 && b % a != 0) { if (b > a) { b = b % a; } else if (a > b) { a = a % b; } } if (a <= b) return a; else return b; } int main() { int n, m; cin >> n >> m; list<int> son[n]; for (int i = 0; i < m; i++) { int u, v; cin >> u >> v; son[u - 1].push_back(v - 1); son[v - 1].push_back(u - 1); } int side[n]; initialise(side, -1, n); for (int i = 0; i < n; i++) { if (side[i] != -1) continue; queue<int> q; q.push(i); side[i] = 0; while (!q.empty()) { int current = q.front(); q.pop(); for (auto fil : son[current]) { if (side[fil] == -1) { side[fil] = 1 - side[current]; q.push(fil); } else if (side[fil] == side[current]) { cout << -1 << endl; return 0; } else continue; } } } vector<int> zero; vector<int> one; for (int i = 0; i < n; i++) { if (side[i] == 0) zero.push_back(i + 1); else one.push_back(i + 1); } cout << zero.size() << endl; for (int i = 0; i < zero.size(); i++) { cout << zero[i]; if (i == zero.size() - 1) cout << endl; else cout << ; } cout << one.size() << endl; for (int i = 0; i < one.size(); i++) { cout << one[i]; if (i == one.size() - 1) cout << endl; else cout << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; long long ans = 0x3f3f3f3f3f3f, a[510]; void calc(long long val) { if (!val) return; long long res = 0; for (int i = 1; i <= n; i++) { long long p = a[i] / val, q = a[i] % val; if (p < q) return; res += p - (p - q) / (val + 1); } ans = min(ans, res); } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %lld , &a[i]); sort(a + 1, a + 1 + n); for (long long i = 1; i * i <= a[1]; i++) calc(i), calc(a[1] / i), calc(a[1] / i - 1); printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> T sqr(const T &a) { return a * a; } int a, b, x, ans; int main() { scanf( %d%d , &a, &b); while (1) { ans += a; x += a; if (x / b == 0) break; a = x / b; x -= (x / b) * b; } printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; int main() { int z = 0, f = 0, n, a; cin >> n; while (n--) { cin >> a; a == 0 ? z++ : f++; } if (z > 0 && f > 8) { f -= f % 9; while (f--) cout << 5 ; while (z--) cout << 0 ; cout << endl; } else if (z > 0) cout << 0 n ; else cout << -1 n ; } |
#include <bits/stdc++.h> using namespace std; int t, n; string s; int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> t; while (t--) { cin >> s; n = s.length(); int m = n, M = -1; for (int i = 0; i < n; i++) { if (s[i] == 1 ) { m = min(m, i); M = max(M, i); } } if (m > M) { cout << 0 << endl; } else { int cnt = 0; for (int i = m; i < M; i++) { cnt += (s[i] == 0 ); } cout << cnt << endl; } } } |
#include <bits/stdc++.h> using ll = long long; using namespace std; int n, m; int const N = 3e5 + 2; int const M = (1 << 21); struct Triple { int fi; int se; int th; Triple(int f, int s, int t) : fi(f), se(s), th(t) {} }; struct Compare { bool operator()(const Triple& f, const Triple& g) { if (f.th != g.th) return (f.th < g.th); else return pair<int, int>{f.fi, f.se} < pair<int, int>{g.fi, g.se}; } }; vector<Triple> seg; int t[M]; int lazy[M]; int const INF = 1e9; void push(int v) { t[v * 2] += lazy[v]; lazy[v * 2] += lazy[v]; t[v * 2 + 1] += lazy[v]; lazy[v * 2 + 1] += lazy[v]; lazy[v] = 0; } int query(int v, int l, int r, int tl, int tr) { if (r < l) return INF; if (l == tl && r == tr) return t[v]; else { push(v); int mid = (tl + tr) / 2; int qw1 = query(v * 2, l, min(mid, r), tl, mid); int qw2 = query(v * 2 + 1, max(mid + 1, l), r, mid + 1, tr); return min(qw1, qw2); } } void update(int v, int l, int r, int tl, int tr, int val) { if (r < l) return; if (l == tl && r == tr) { t[v] += val; lazy[v] += val; } else { push(v); int mid = (tl + tr) >> 1; update(v << 1, l, min(mid, r), tl, mid, val); update((v << 1) + 1, max(mid + 1, l), r, mid + 1, tr, val); t[v] = min(t[v << 1], t[(v << 1) + 1]); } } int main() { scanf( %d %d , &n, &m); for (int i = (1); i <= (n); i++) { int l, r, w; scanf( %d %d %d , &l, &r, &w); seg.push_back(Triple({l, r, w})); } sort(seg.begin(), seg.end(), Compare()); int mu = 0; int lb = seg[0].th; int rb = seg[0].th; int ans = INF; for (int i = (1); i <= (n); i++) { update(1, seg[i - 1].fi, seg[i - 1].se - 1, 1, m - 1, 1); rb = seg[i - 1].th; while (query(1, 1, m - 1, 1, m - 1) > 0) { ans = min(ans, rb - lb); update(1, seg[mu].fi, seg[mu].se - 1, 1, m - 1, -1); mu++; if (mu != n) lb = seg[mu].th; } } printf( %d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 11; const long long mod = 1e9 + 7; int n, m, k; long long a[N], ans; int par[N], sz[N]; pair<long long, pair<int, int> > b[N]; vector<pair<int, int> > v; vector<int> cur; bool u[N]; int find_set(int v) { if (v == par[v]) return v; return par[v] = find_set(par[v]); } void union_sets(int a, int b) { a = find_set(a); b = find_set(b); if (a != b) { if (sz[a] < sz[b]) swap(a, b); par[b] = a; sz[a] += sz[b]; } } long long binpow(int n) { long long a = 2, res = 1; while (n) { if (n % 2 == 0) { n /= 2; a = (a * a) % mod; } else { n--; res = (res * a) % mod; } } return res; } int main() { cin >> n >> m >> k; for (int i = 1; i <= n; i++) scanf( %I64d , &a[i]); for (int i = 1; i <= m; i++) { scanf( %d%d , &b[i].second.first, &b[i].second.second); b[i].first = a[b[i].second.first] ^ a[b[i].second.second]; } sort(b + 1, b + m + 1); int l = 0; int uniq = 0, comp; for (int i = 1; i <= m; i++) { if (b[i].first == b[i + 1].first) continue; comp = 0; for (int j = l + 1; j <= i; j++) v.push_back(b[j].second); for (auto i : v) { par[i.first] = i.first; par[i.second] = i.second; sz[i.first] = sz[i.second] = 1; } for (auto i : v) { if (!u[i.first]) cur.push_back(i.first); if (!u[i.second]) cur.push_back(i.second); u[i.first] = u[i.second] = true; } for (auto i : v) union_sets(i.first, i.second); for (auto i : cur) if (find_set(i) == i) comp++; ans = (ans + binpow(n - (int)cur.size() + comp)) % mod; for (auto i : cur) { u[i] = false; } cur.clear(); v.clear(); l = i; uniq++; } long long p = ((1ll << k) - uniq) % mod; p = (p * binpow(n)) % mod; ans = (ans + p) % mod; cout << ans; return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.