func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, k; cin >> n >> k; string s; cin >> s; map<char, int> m; for (int i = 0; i < s.size(); i++) { m[s[i]]++; } char a = A ; bool flag1 = true; for (int i = 1; i < k; i++) { if (m[a] == 0) { flag1 = false; break; } a++; } bool flag = false; for (int i = 0; i < s.size(); i++) { if (a == s[i]) { flag = true; break; } } int c = 999999; if (flag == true && flag1 == true) { for (auto x : m) { if (x.second < c) { c = x.second; } } cout << c * k; } else { cout << 0 ; } } |
#include <bits/stdc++.h> using namespace std; set<int> inT; set<int>::iterator it; int ans[300000]; vector<int> pak; int main() { int n, m, l, r, x, i; cin >> n >> m; for (i = 0; i < n; i++) { inT.insert(i); } for (i = 0; i < m; i++) { cin >> l >> r >> x; l--; r--; x--; it = inT.lower_bound(l); while (it != inT.end()) { if (*it > r) break; if (*it != x) { pak.push_back(*it); ans[*it] = x + 1; } it++; } for (x = 0; x < pak.size(); x++) inT.erase(pak[x]); pak.clear(); } for (i = 0; i < n; i++) cout << ans[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using cd = complex<double>; const int max_n = 200500; vector<int> g[max_n]; vector<int> og[max_n]; vector<int> used(max_n); bool find_cycles(int x) { used[x] = 1; for (int i : g[x]) { if (used[i] == 1) { return true; } if (!used[i] && find_cycles(i)) { return true; } } used[x] = 2; return false; } vector<int> ts; void top_sort(int x) { used[x] = 1; for (int i : g[x]) { if (!used[i]) { top_sort(i); } } ts.push_back(x); } vector<int> dp1(max_n); void calc_dp1(int x) { used[x] = 1; dp1[x] = x; for (int i : og[x]) { if (!used[i]) { calc_dp1(i); } dp1[x] = min(dp1[x], dp1[i]); } } vector<int> dp2(max_n); void calc_dp2(int x) { used[x] = 1; dp2[x] = x; for (int i : g[x]) { if (!used[i]) { calc_dp2(i); } dp2[x] = min(dp2[x], dp2[i]); } } int main() { cout.precision(20); cout << fixed; ios_base::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; for (int i = 0; i < m; i++) { int a, b; cin >> a >> b; g[a].push_back(b); og[b].push_back(a); } for (int i = 1; i <= n; i++) { if (!used[i]) { if (find_cycles(i)) { cout << -1; return 0; } } } fill(used.begin(), used.end(), 0); for (int i = 1; i <= n; i++) { if (!used[i]) { top_sort(i); } } reverse(ts.begin(), ts.end()); fill(used.begin(), used.end(), 0); for (int i = 0; i < n; i++) { if (!used[ts[i]]) { calc_dp1(ts[i]); } } fill(used.begin(), used.end(), 0); for (int i = 0; i < n; i++) { if (!used[ts[i]]) { calc_dp2(ts[i]); } } int cnt = 0; for (int i = 1; i <= n; i++) { cnt += dp1[i] == i && dp2[i] == i; } cout << cnt << n ; for (int i = 1; i <= n; i++) { cout << (dp1[i] == i && dp2[i] == i ? A : E ); } } |
#include <bits/stdc++.h> using namespace std; int x[2][2]; int main() { for (int i = 0; i < 2; i++) for (int j = 0; j < 2; j++) scanf( %d , x[i] + j); printf( %d n , (max(1, abs(x[0][0] - x[1][0])) + max(1, abs(x[0][1] - x[1][1])) + 2) * 2); return 0; } |
#include <bits/stdc++.h> using namespace std; int x[3]; int main() { int a, b, c, n, ans = 0, t = 0; cin >> n; cin >> x[0] >> x[1] >> x[2]; n--; while (n--) { if (t == 0) { if (x[0] < x[1]) { ans += x[0]; t = 1; } else { ans += x[1]; t = 2; } } else if (t == 1) { if (x[0] < x[2]) { ans += x[0]; t = 0; } else { ans += x[2]; t = 2; } } else { if (x[2] < x[1]) { ans += x[2]; t = 1; } else { ans += x[1]; t = 0; } } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, k; int c[5005], h[11], f[505]; int cnt[100005]; int fcnt[100005]; int cache[5005][505]; int solve(int idx1, int idx2) { if (idx1 == 0 || idx2 == 0) return 0; int &ret = cache[idx1][idx2]; if (ret != -1) return ret; ret = 0; for (int i = 0; i <= k && i <= idx1; i++) ret = max(ret, solve(idx1 - i, idx2 - 1) + h[i]); return ret; } int main() { scanf( %d%d , &n, &k); for (int i = 0; i < n * k; i++) { scanf( %d , &c[i]); cnt[c[i]]++; } for (int i = 0; i < n; i++) { scanf( %d , &f[i]); fcnt[f[i]]++; } for (int i = 1; i <= k; i++) scanf( %d , &h[i]); int ans = 0; for (int i = 0; i < 100005; i++) { if (fcnt[i]) { memset(cache, -1, sizeof(cache)); ans += solve(cnt[i], fcnt[i]); } } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int const mxn = 1e3 + 10; vector<pair<int, int> > ha[3], adj0[mxn][mxn], adj1[mxn][mxn]; int mark[mxn][mxn][3], fl[mxn][mxn][3]; int n, m; int ans = 1e9; string l[mxn]; void connect(int i, int j, int i2, int j2) { if (i2 < 0 or i2 >= n or j2 < 0 or j2 >= m) return; else { if (l[i2][j2] == . ) adj1[i][j].push_back({i2, j2}); else if (l[i2][j2] != # ) adj0[i][j].push_back({i2, j2}); } } int main() { cin >> n >> m; for (int i = 0; i < n; i++) cin >> l[i]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (l[i][j] == 1 or l[i][j] == 2 or l[i][j] == 3 ) { ha[l[i][j] - 1 ].push_back({i, j}); } connect(i, j, i + 1, j); connect(i, j, i - 1, j); connect(i, j, i, j + 1); connect(i, j, i, j - 1); } } for (int now = 0; now <= 2; now++) { queue<pair<int, int> > q; for (int i = 0; i < ha[now].size(); i++) { q.push(ha[now][i]); fl[ha[now][i].first][ha[now][i].second][now] = 0; mark[ha[now][i].first][ha[now][i].second][now] = 1; } while (q.size()) { int v1, v2; v1 = q.front().first, v2 = q.front().second; q.pop(); queue<pair<int, int> > q0; q0.push({v1, v2}); while (q0.size()) { int a1, a2; a1 = q0.front().first, a2 = q0.front().second; q0.pop(); for (int j = 0; j < adj0[a1][a2].size(); j++) { int u1 = adj0[a1][a2][j].first, u2 = adj0[a1][a2][j].second; if (!mark[u1][u2][now]) { q0.push({u1, u2}); q.push({u1, u2}); mark[u1][u2][now] = 1; fl[u1][u2][now] = fl[v1][v2][now]; } } } for (int j = 0; j < adj1[v1][v2].size(); j++) { int k1 = adj1[v1][v2][j].first, k2 = adj1[v1][v2][j].second; if (!mark[k1][k2][now]) { mark[k1][k2][now] = 1; q.push({k1, k2}); fl[k1][k2][now] = fl[v1][v2][now] + 1; } } } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (l[i][j] == . and mark[i][j][0] and mark[i][j][1] and mark[i][j][2]) ans = min(ans, (fl[i][j][0] + fl[i][j][2] + fl[i][j][1]) - 2); else if (l[i][j] != # and mark[i][j][0] and mark[i][j][1] and mark[i][j][2]) ans = min(ans, fl[i][j][0] + fl[i][j][2] + fl[i][j][1]); } } if (ans == 1e9) cout << -1; else cout << ans; } |
#include <bits/stdc++.h> using namespace std; struct custom_hash { static uint64_t splitmix64(uint64_t x) { x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } size_t operator()(uint64_t x) const { static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); return splitmix64(x + FIXED_RANDOM); } }; long long getPairsCount(int arr[], int n, long long sum) { unordered_map<int, int, custom_hash> m; for (int i = 0; i < n; i++) m[arr[i]]++; long long twice_count = 0; for (int i = 0; i < n; i++) { twice_count += m[sum - arr[i]]; if (sum - arr[i] == arr[i]) twice_count--; } return twice_count / 2; } int main() { int t; cin >> t; while (t--) { int n; cin >> n; int ara[n]; long long sum = 0; for (int i = 0; i < n; i++) { cin >> ara[i]; sum += ara[i]; } sum *= 2; if (sum % n) { cout << 0 n ; continue; } cout << getPairsCount(ara, n, sum / n) << endl; } } |
#include <bits/stdc++.h> using namespace std; const pair<int, int> MOD = make_pair(1e9 + 7, 1e9 + 9); const int base = 1e6 + 3; const int N = 1e5 + 100, B = 600; pair<int, int> operator+(pair<int, int> a, pair<int, int> b) { return make_pair((a.first + b.first) % MOD.first, (a.second + b.second) % MOD.second); } pair<int, int> operator-(pair<int, int> a, pair<int, int> b) { return make_pair((a.first - b.first + MOD.first) % MOD.first, (a.second - b.second + MOD.second) % MOD.second); } pair<int, int> operator*(pair<int, int> a, int x) { return make_pair(1ll * a.first * x % MOD.first, 1ll * a.second * x % MOD.second); } pair<int, int> operator*(pair<int, int> a, pair<int, int> b) { return make_pair(1ll * a.first * b.first % MOD.first, 1ll * a.second * b.second % MOD.second); } int n, K, q; int a[N]; vector<pair<int, int>> open_Hash[B], close_Hash[B]; pair<int, int> base_pow[N], inv_pow[N]; int good[N]; int bm(int b, int p, int m) { if (p == 0) return 1; int t = bm(b, p / 2, m); t = 1ll * t * t % m; if (p & 1) return 1ll * b * t % m; return t; } void pre() { base_pow[0] = {1, 1}; inv_pow[0] = {1, 1}; for (int i = 1; i < N; i++) { base_pow[i] = base_pow[i - 1] * base; inv_pow[i].first = bm(base_pow[i].first, MOD.first - 2, MOD.first); inv_pow[i].second = bm(base_pow[i].second, MOD.second - 2, MOD.second); } } bool recal(int l, int r, vector<pair<int, int>> &close, vector<pair<int, int>> &open) { vector<int> stk; for (int i = l; i <= r; i++) { if (a[i] < 0 && stk.size() > 0 && stk.back() == abs(a[i])) stk.pop_back(); else stk.push_back(a[i]); } close.clear(); open.clear(); bool pos = false; for (int i = 0; i < stk.size(); i++) { if (stk[i] > 0) pos = true; if (stk[i] < 0 && pos) return false; } for (int i = 0; i < stk.size(); i++) { if (stk[i] > 0) break; int x = abs(stk[i]); int kth = close.size(); close.push_back(base_pow[kth] * x); } for (int i = 1; i < close.size(); i++) { close[i] = close[i - 1] + close[i]; } for (int i = (int)stk.size() - 1; i >= 0; i--) { if (stk[i] < 0) break; int x = abs(stk[i]); int kth = open.size(); open.push_back(base_pow[kth] * x); } for (int i = 1; i < open.size(); i++) { open[i] = open[i - 1] + open[i]; } return true; } bool find_hash(vector<pair<int, int>> &all_open, int sz, pair<int, int> hhh) { assert(sz > 0); int psz = 0; pair<int, int> h = {0, 0}; while (psz < sz && all_open.size() > 0) { auto t = all_open.back(); all_open.pop_back(); int which_block = t.first, idx = t.second; int cur_sz = open_Hash[which_block].size() - idx; assert(cur_sz > 0); if (cur_sz + psz < sz) { pair<int, int> hh = (open_Hash[which_block].back() - (idx > 0 ? open_Hash[which_block][idx - 1] : make_pair(0, 0))) * inv_pow[idx]; hh = hh * base_pow[psz]; h = h + hh; psz += cur_sz; } else { int lage = sz - psz; pair<int, int> hh = (open_Hash[which_block][idx + lage - 1] - (idx > 0 ? open_Hash[which_block][idx - 1] : make_pair(0, 0))) * inv_pow[idx]; hh = hh * base_pow[psz]; h = h + hh; if (idx + lage < open_Hash[which_block].size()) all_open.push_back({which_block, idx + lage}); psz += lage; } } if (psz < sz) return 0; if (hhh != h) return 0; return 1; } int query(int l, int r) { int bl = l / B, br = r / B; if (bl == br) { vector<pair<int, int>> p, s; int x = recal(l, r, p, s); if (x && (int)p.size() == 0 && (int)s.size() == 0) return 1; return 0; } if (recal(l, (bl + 1) * B - 1, close_Hash[B - 2], open_Hash[B - 2]) == 0) return 0; if (close_Hash[B - 2].size() > 0) return 0; vector<pair<int, int>> all_open; if (open_Hash[B - 2].size() > 0) all_open.push_back({B - 2, 0}); for (int b = bl + 1; b < br; b++) { if (!good[b]) return 0; if (close_Hash[b].size() == 0) { if (open_Hash[b].size() > 0) all_open.push_back({b, 0}); continue; } int sz = close_Hash[b].size(); if (!find_hash(all_open, sz, close_Hash[b].back())) return 0; if (open_Hash[b].size() > 0) all_open.push_back({b, 0}); } if (recal(br * B, r, close_Hash[B - 1], open_Hash[B - 1]) == 0) return 0; if (open_Hash[B - 1].size() > 0) return 0; if (close_Hash[B - 1].size() > 0 && !find_hash(all_open, close_Hash[B - 1].size(), close_Hash[B - 1].back())) return 0; if (all_open.size() > 0) return 0; return 1; } int main() { ios::sync_with_stdio(0); cin.tie(0); pre(); cin >> n >> K; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0, j = 0; i < n; i += B, j++) { good[j] = recal(i, min(i + B - 1, n - 1), close_Hash[j], open_Hash[j]); } int q; cin >> q; while (q--) { int t; cin >> t; if (t == 1) { int idx, x; cin >> idx >> x; idx--; a[idx] = x; int b = idx / B; int l = b * B, r = min(l + B - 1, n - 1); good[b] = recal(l, r, close_Hash[b], open_Hash[b]); } else { int l, r; cin >> l >> r; l--, r--; if (query(l, r)) cout << Yes << endl; else cout << No << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; template <typename X> inline bool minimize(X& p, X q) { if (p <= q) return 0; p = q; return 1; } template <typename X> inline bool maximize(X& p, X q) { if (p >= q) return 0; p = q; return 1; } const int MAXN = 100005; int Ya[MAXN], Yb[MAXN], L[MAXN]; inline double dis(int dx, int dy) { return sqrt(1.0 * dx * dx + 1.0 * dy * dy); } int main() { int N, M, a, b; scanf( %d%d%d%d , &N, &M, &a, &b); for (int i = 1; i <= N; ++i) scanf( %d , Ya + i); for (int i = 1; i <= M; ++i) scanf( %d , Yb + i); for (int i = 1; i <= M; ++i) scanf( %d , L + i); double ans = 1e100; int ap = 1, bp = 1; for (int i = 1, j = 1; i <= M; ++i) { int temp = ceil((double)a * Yb[i] / b); while (j < N && Ya[j] < temp) ++j; if (minimize(ans, dis(a, Ya[j]) + dis(b - a, Yb[i] - Ya[j]) + L[i])) ap = j, bp = i; if (j != 1 && minimize(ans, dis(a, Ya[j - 1]) + dis(b - a, Yb[i] - Ya[j - 1]) + L[i])) ap = j - 1, bp = i; } printf( %d %d n , ap, bp); return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> inline bool chkmin(T &x, T y) { return y < x ? x = y, 1 : 0; } template <class T> inline bool chkmax(T &x, T y) { return x < y ? x = y, 1 : 0; } inline long long Max(long long x, long long y) { return x > y ? x : y; } inline long long Min(long long x, long long y) { return x < y ? x : y; } int n, m; long long dp[2002][2002]; void Add(long long &x, long long y) { x += y; if (x >= 1000000007) x %= 1000000007; if (x < 0) (x += 1000000007) %= 1000000007; } int main() { scanf( %d%d , &n, &m); for (int i = (1), i_end_ = (n); i <= i_end_; i++) dp[i][1] = 1; for (int k = (2), k_end_ = (m); k <= k_end_; k++) for (int i = (1), i_end_ = (n); i <= i_end_; i++) for (int j = i; j <= n; j += i) Add(dp[j][k], dp[i][k - 1]); long long ans = 0; for (int i = (1), i_end_ = (n); i <= i_end_; i++) Add(ans, dp[i][m]); printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; long long t, t0, t2, x, x2; void cmp(long double &temp, long long &o, long long &o2, long long y, long long y2) { if (y2 > x2) return; long double newTemp = (1.0 * t * y + t2 * y2) / (y + y2); if (newTemp < t0) return; if (newTemp > temp + 1e-9) return; if (newTemp < temp || y + y2 > o + o2) o = y, o2 = y2, temp = newTemp; } int main() { cin >> t >> t2 >> x >> x2 >> t0; if (t0 == t2) { if (t != t0) cout << 0 << << x2 << endl; else cout << x << << x2 << endl; } else if (t0 == t) cout << x << << 0 << endl; else { long double temp = 1e9; long long o = 0, o2 = 0; cmp(temp, o, o2, 0, x2); cmp(temp, o, o2, x, 0); for (long long y = 0; y <= x; y++) { long long y2 = (y * (t0 - t) + t2 - t0 - 1) / (t2 - t0); cmp(temp, o, o2, y, y2); } cout << o << << o2 << endl; } } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; using vpii = vector<pii>; using vpll = vector<pll>; template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { for (const auto &x : v) os << x << ; return os << endl; } ll ceil_div(ll a, ll b) { return (a + b - 1) / b; } void solve(int n) { if (n == 1) { cout << -1 << endl; return; } for (int i = 0; i < n; i++) { cout << (i == 0 ? 2 : 3); } cout << endl; } int main(int argc, char const *argv[]) { int T; cin >> T; for (int t = 0; t < T; t++) { int n; cin >> n; solve(n); } return 0; } |
#include <bits/stdc++.h> using namespace std; #define cp ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); #define ll long long int #define vint vector<int> #define vllint vector<ll> #define pair_int pair<int , int> #define pair_ll_int pair<ll , ll> #define vector_of_pair_int vector<pair_int> #define pb push_back #define test_case int t; cin>>t; while(t--) #define umap unordered_map <int,int> #define mapint map<int,int> #define infinity 1000000000 #define mp make_pair int main() { cp test_case { ll n; cin>>n; if(n<=256) { int count=0; ll temp=n; while(temp!=1) { count++; if(temp%2==0) temp=temp/2; else temp=temp/2+1; } cout<<count+n-3<<endl; for (int i = 1; i <=n-3; ++i) { /* code */ cout<<3+i-1<< <<3+i<<endl; } for (int i = 0; i < count; ++i) { /* code */ cout<<n<< <<2<<endl; } } else { int count=0; ll temp=n; while(temp!=1) { count++; temp=ceil(float(temp)/float(16)); } cout<<count+n<<endl; for (int i = 3; i <n; ++i) { /* code */ if(i!=16) { cout<<i<< <<i+1<<endl; } } for (int i = 0; i < count; ++i) { /* code */ cout<<n<< <<16<<endl; } for (int i = 0; i < 4; ++i) { /* code */ cout<<16<< <<2<<endl; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 205; int mem[N][N]; int asol[N]; bool query(int i, int j) { i = asol[i]; j = asol[j]; if (mem[i][j] != -1) return mem[i][j]; if (i == j) return false; cout << ? << i << << j << endl; char c; cin >> c; mem[i][j] = (c == < ); mem[j][i] = !mem[i][j]; return mem[i][j]; } int main() { int t; cin >> t; while (t--) { memset(mem, -1, sizeof mem); int n; cin >> n; for (int i = 1; i <= 2 * n; i++) asol[i] = i; shuffle(asol + 1, asol + 2 * n + 1, mt19937(23232)); vector<int> worse; for (int i = 1; i < 2 * n; i += 2) { if (query(i, i + 1)) worse.push_back(i); else worse.push_back(i + 1); } sort(worse.begin(), worse.end(), query); int xx = worse.back(); worse.pop_back(); int yy = worse.back(); vector<int> choto, boro; for (int i = 1; i <= 2 * n; i++) { if (i == yy) continue; if (query(yy, i)) boro.push_back(i); else choto.push_back(i); } if (boro.size() <= n) { sort(choto.begin(), choto.end(), query); cout << ! << endl; } else { int xxpr = (xx % 2 ? xx + 1 : xx - 1); vector<int> worse; if (query(xx, xxpr)) worse.push_back(xx); else worse.push_back(xxpr); int unpaired = -1; for (int x : boro) { if (x == xx || x == xxpr) continue; if (unpaired == -1) unpaired = x; else { if (query(unpaired, x)) worse.push_back(unpaired); else worse.push_back(x); unpaired = -1; } } if (unpaired != -1) worse.push_back(unpaired); sort(worse.begin(), worse.end(), query); cout << ! << endl; } } } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int tt; cin >> tt; while(tt--) { int n; cin >> n; vector<int> a(n); for(int i = 0; i < n; i++) { cin >> a[i]; } set<int> s; s.insert(a[0]); bool ok = true; for(int i = 1; i < n; i++) { int x = min(a[i], a[i - 1]); int y = max(a[i], a[i - 1]); if(s.upper_bound(x) != s.end()) { if(*s.upper_bound(x) < y) { ok = false; break; } } s.insert(a[i]); } cout << (ok ? YES : NO ) << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a[3]; int x[3]; int last = 0; cin >> a[0] >> a[1] >> a[2]; cin >> x[0] >> x[1] >> x[2]; for (int i = 0; i < 3; ++i) { int t = a[i] - x[i]; if (t > 0) t /= 2; last += t; } if (last < 0) cout << No n ; else cout << Yes n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const double EPS = -1e8; const double Pi = acos(-1); bool inline equ(double a, double b) { return fabs(a - b) < EPS; } int _R(int& x) { return scanf( %d , &x); } int _R(long long& x) { return scanf( % PRId64, &x); } int _R(double& x) { return scanf( %lf , &x); } int _R(char* s) { return scanf( %s , s); } int R() { return 0; } template <typename T1, typename... T2> int R(T1& x, T2&... tail) { int tmp = _R(x); return tmp + R(tail...); } template <typename Iter, typename F> inline void out(Iter s, Iter e, F of) { bool flag = 0; for (Iter it = s; it != e; it++) { if (flag) printf( ); else flag = 1; of(*it); } puts( ); } const int MAXN = 1e5 + 10; struct Edge { int u, v; long long c; bool operator<(const Edge& e) const { return c < e.c; } }; int n, m; Edge es[MAXN * 2]; struct DSJ { int mom[MAXN], sz[MAXN]; void init() { for (int i = (1); i <= (n); i++) mom[i] = i; } int find(int x) { return mom[x] = mom[x] == x ? x : find(mom[x]); } void merge(int a, int b) { a = find(a), b = find(b); mom[b] = a; } } dsj; struct Tree { static const int LOG = 22; vector<pair<int, int> > g[MAXN]; int dep[MAXN]; int mom[LOG][MAXN], mx[LOG][MAXN]; int sz[MAXN], root[MAXN]; inline void adde(Edge& e) { g[e.u].push_back(pair<int, int>(e.v, e.c)); g[e.v].push_back(pair<int, int>(e.u, e.c)); } void dfs(int u, int p, int c, int d, int rt) { mom[0][u] = p; mx[0][u] = c; dep[u] = d; root[u] = rt; for (pair<int, int> e : g[u]) { int v, tc; tie(v, tc) = e; if (v == p) continue; dfs(v, u, tc, d + 1, rt); } } inline void predo() { for (int i = (1); i <= (n); i++) if (!dep[i]) { dfs(i, -1, 0, 1, i); } for (int j = (1); j <= (LOG - 1); j++) for (int i = (1); i <= (n); i++) { mom[j][i] = mom[j - 1][mom[j - 1][i]]; mx[j][i] = max(mx[j - 1][i], mx[j - 1][mom[j - 1][i]]); } for (int i = (1); i <= (n); i++) sz[root[i]]++; } inline int lca(int a, int b) { if (dep[a] < dep[b]) swap(a, b); int jmp = dep[a] - dep[b]; for (int k = 0; k < (LOG); k++) if ((jmp >> k) & 1) a = mom[k][a]; if (a == b) return a; for (int k = (LOG - 1); k >= (0); k--) if (mom[k][a] != mom[k][b]) { a = mom[k][a]; b = mom[k][b]; } return mom[0][a]; } inline int qry(int a, int b) { int anc = lca(a, b); int res = 0; { int jmp = dep[a] - dep[anc]; for (int k = 0; k < (LOG); k++) if ((jmp >> k) & 1) { res = max(res, mx[k][a]); a = mom[k][a]; } } { int jmp = dep[b] - dep[anc]; for (int k = 0; k < (LOG); k++) if ((jmp >> k) & 1) { res = max(res, mx[k][b]); b = mom[k][b]; } } return res; } } tree; int main() { R(n, m); for (int i = (1); i <= (m); i++) R(es[i].u, es[i].v, es[i].c); sort(es + 1, es + 1 + m); long long mst_cst = 0ll; dsj.init(); for (int i = (1); i <= (m); i++) { Edge& e = es[i]; if (dsj.find(e.u) != dsj.find(e.v)) { dsj.merge(e.u, e.v); mst_cst += e.c; tree.adde(e); } } tree.predo(); int q; R(q); while (q--) { int a, b; R(a, b); if (tree.root[a] == tree.root[b]) { if (tree.sz[tree.root[a]] < n) puts( -1 ); else printf( %I64d n , mst_cst - tree.qry(a, b)); } else { if (tree.sz[tree.root[a]] + tree.sz[tree.root[b]] < n) puts( -1 ); else printf( %I64d n , mst_cst); } } } |
#include <bits/stdc++.h> using namespace std; #define rep(i, a, b) for(int i = a; i < b; ++i) int debug = 0; const int N = 510; int n, p[N], a[N][N]; int main() { cin >> n; rep(i, 1, n + 1) { cin >> p[i]; } rep(i, 1, n + 1) { int x = i, y = i; rep(_, 0, p[i]) { a[x][y] = p[i]; if (y > 1 && a[x][y - 1] == 0) { --y; } else { ++x; } } } rep(i, 1, n + 1) { rep(j, 1, i + 1) { cout << a[i][j] << ; } cout << n ; } } |
#include <bits/stdc++.h> using namespace std; long long getmax(long long arr[]) { long long m = 0; for (long long i = 0; i < 26; i++) { m = max(m, arr[i]); } return m; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n, m; cin >> n >> m; string arr[n]; long long alpha[26]; long long res = 0; for (long long i = 0; i < n; i++) cin >> arr[i]; long long marks[m]; for (long long i = 0; i < m; i++) cin >> marks[i]; for (long long i = 0; i < m; i++) { memset(alpha, 0, sizeof(alpha)); for (long long j = 0; j < n; j++) { int k = arr[j][i] - A ; alpha[k]++; } long long c = getmax(alpha); res += c * marks[i]; } cout << res << n ; } |
#include <bits/stdc++.h> using namespace std; struct ee { int d; int y; }; ee e[120]; ee r[1200]; bool ok(ee a, ee b) { return a.y > b.y; } int main() { int n; int k; while (cin >> n >> k) { memset(e, 0, sizeof(e)); memset(r, 0, sizeof(r)); for (int i = 0; i < n; i++) { cin >> e[i].y; e[i].d = i + 1; } sort(e, e + n, ok); int m = 0, m2 = 0; int ss; for (int i = 0; i < k; i++) { ss = e[0].y - e[n - 1].y; if (ss <= 1) { break; } e[0].y--; e[n - 1].y++; r[i].d = e[0].d; r[i].y = e[n - 1].d; sort(e, e + n, ok); m++; if (ss > e[0].y - e[n - 1].y) { m2 = m; ss = e[0].y - e[n - 1].y; } } cout << ss << << m2 << endl; for (int i = 0; i < m2; i++) { cout << r[i].d << << r[i].y << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int a[1001]; int dp[1010][1010]; int from[1010][1010][2]; int del[1010][1010][2]; int main() { int i, j, n; cin >> n; for (i = 0; i < n; i++) cin >> a[i]; if (n % 2) n++; for (i = 0; i <= n + 2; i++) for (j = 0; j <= n + 2; j++) dp[i][j] = 2000000000; dp[0][1] = 0; for (i = 0; i < n; i++) for (j = i + 1; j < n; j++) { if (dp[i][j + 2] > dp[i][j] + max(a[j], a[j + 1])) { dp[i][j + 2] = dp[i][j] + max(a[j], a[j + 1]); from[i][j + 2][0] = i, from[i][j + 2][1] = j; del[i][j + 2][0] = j, del[i][j + 2][1] = j + 1; } if (dp[j + 1][j + 2] > dp[i][j] + max(a[i], a[j])) { dp[j + 1][j + 2] = dp[i][j] + max(a[i], a[j]); from[j + 1][j + 2][0] = i, from[j + 1][j + 2][1] = j; del[j + 1][j + 2][0] = i, del[j + 1][j + 2][1] = j; } if (dp[j][j + 2] > dp[i][j] + max(a[i], a[j + 1])) { dp[j][j + 2] = dp[i][j] + max(a[i], a[j + 1]); from[j][j + 2][0] = i, from[j][j + 2][1] = j; del[j][j + 2][0] = i, del[j][j + 2][1] = j + 1; } } i = n, j = n + 1; cout << dp[i][j] << endl; vector<int> res; while (i || j) { int p1 = from[i][j][0], p2 = from[i][j][1]; res.push_back(del[i][j][0] + 1), res.push_back(del[i][j][1] + 1); i = p1, j = p2; } for (i = n - 1; i >= 0; i -= 2) { cout << res[i - 1]; if (a[res[i] - 1]) cout << << res[i]; cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxk = 50, maxn = 100; int k, x, n, m; inline int calc(int x, int y) { if (!x && y == 2) return 1; return 0; } struct node { long long c1[2], c2[2][2]; bool h, t; node operator+(const node &Other) const { node N = {}; N.h = h; N.t = Other.t; for (int i = 0; i < 2; ++i) N.c1[i] = c1[i] + Other.c1[i]; for (int i = 0; i < 2; ++i) for (int j = 0; j < 2; ++j) N.c2[i][j] = c2[i][j] + Other.c2[i][j]; ++N.c2[t][Other.h]; return N; } } f[maxk + 1] = {}; int dp[3][3][maxn + 1][maxn + 1]; int s1[3][3][maxn + 1][maxn + 1], s2[3][3][maxn + 1][maxn + 1]; int main() { scanf( %d%d%d%d , &k, &x, &n, &m); f[1].c1[0] = 1; f[2].c1[1] = 1; f[2].h = f[2].t = 1; for (int i = 3; i <= k; ++i) f[i] = f[i - 2] + f[i - 1]; if (n > 1) { memset(dp, -1, sizeof(dp)); for (int i = 0; i < 3; ++i) dp[i][i][1][0] = 0; for (int h = 0; h < 3; ++h) { for (int i = 2; i <= n; ++i) for (int j1 = 0; j1 < 3; ++j1) for (int k = 0; k < i - 1; ++k) if (~dp[h][j1][i - 1][k]) { for (int j2 = 0; j2 < 3; ++j2) dp[h][j2][i][k + calc(j1, j2)] = j1; } for (int t = 0; t < 3; ++t) for (int k = 0; k < n; ++k) if (~dp[h][t][n][k] && !s1[h][t][k][0]) { s1[h][t][k][0] = 1; for (int dep = n, c = t, j = k; dep; --dep) { s1[h][t][k][dep] = c; int d = dp[h][c][dep][j]; j -= calc(d, c); c = d; } } } } else { for (int i = 0; i < 3; ++i) { s1[i][i][0][0] = 1; s1[i][i][0][1] = i; } } if (m > 1) { memset(dp, -1, sizeof(dp)); for (int i = 0; i < 3; ++i) dp[i][i][1][0] = 0; for (int h = 0; h < 3; ++h) { for (int i = 2; i <= m; ++i) for (int j1 = 0; j1 < 3; ++j1) for (int k = 0; k < i - 1; ++k) for (int j2 = 0; j2 < 3; ++j2) if (~dp[h][j1][i - 1][k]) dp[h][j2][i][k + calc(j1, j2)] = j1; for (int t = 0; t < 3; ++t) for (int k = 0; k < m; ++k) if (~dp[h][t][m][k]) { s2[h][t][k][0] = 1; for (int dep = m, c = t, j = k; dep; --dep) { s2[h][t][k][dep] = c; int d = dp[h][c][dep][j]; j -= calc(d, c); c = d; } } } } else { for (int i = 0; i < 3; ++i) { s2[i][i][0][0] = 1; s2[i][i][0][1] = i; } } for (int h1 = 0; h1 < 3; ++h1) for (int t1 = 0; t1 < 3; ++t1) for (int i = 0; i < n; ++i) if (s1[h1][t1][i][0]) { for (int h2 = 0; h2 < 3; ++h2) for (int t2 = 0; t2 < 3; ++t2) for (int j = 0; j < m; ++j) if (s2[h2][t2][j][0]) { long long cnt = f[k].c1[0] * i + f[k].c1[1] * j; cnt += f[k].c2[0][0] * calc(t1, h1) + f[k].c2[0][1] * calc(t1, h2) + f[k].c2[1][0] * calc(t2, h1) + f[k].c2[1][1] * calc(t2, h2); if (cnt == x) { for (int k = 1; k <= n; ++k) putchar(s1[h1][t1][i][k] + 65); putchar( n ); for (int k = 1; k <= m; ++k) putchar(s2[h2][t2][j][k] + 65); putchar( n ); return 0; } } } puts( Happy new year! ); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, i, j, k, l, tot, ans, v; long long o, p; long long f[110010]; struct rec { long long x, y; } a[100010]; bool cmp(rec x, rec y) { return x.x < y.x || ((x.x == y.x) && (x.y < y.y)); } int find(int k, int l, long long x) { while (k < l) { int mid = (k + l) / 2; if (f[mid] <= x) k = mid + 1; else l = mid; } return k; } int main() { cin >> n; for (i = 0; i < n; i++) { scanf( %I64d%I64d , &a[i].x, &a[i].y); } cin >> v; for (i = 0; i < n; i++) { o = a[i].x; p = a[i].y; a[i].x = -o + p * v; a[i].y = o + p * v; } sort(a, a + n, cmp); tot = 1; f[0] = -1e12, f[1] = 1e12; for (i = 0; i < n; i++) { j = find(0, tot, a[i].y); if (f[j] > a[i].y) f[j] = a[i].y; if (j >= tot) f[++tot] = 1e12; } ans = tot - 1; f[tot = 1] = 1e12; for (i = 0; i < n; i++) if ((a[i].x >= 0) && (a[i].y >= 0)) { j = find(0, tot, a[i].y); if (f[j] > a[i].y) f[j] = a[i].y; if (j >= tot) f[++tot] = 1e12; } printf( %d %d n , tot - 1, ans); cin >> n; return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; int a[100000]; int main() { int n, k; cin >> n >> k; int sum = 0; bool ok = false; vector<int> ans; for (int i = 0; i < n; i++) { cin >> a[i]; sum += a[i]; } if (sum % k != 0) { printf( No n ); } else { sum /= k; int temp = 0; int cnt = 0; for (int i = 0; i < n; i++) { temp += a[i]; cnt++; if (temp > sum) { printf( No n ); ok = true; break; } else if (temp == sum) { temp = 0; ans.push_back(cnt); cnt = 0; } } if (!ok) { printf( Yes n ); for (int i = 0; i < ans.size(); i++) { if (i > 0) printf( ); printf( %d , ans[i]); } printf( n ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int SIZE = 2100; struct kstr { int C[30]; bool mask[110]; } A[SIZE]; int CC[30]; int main() { int K, N, len; char S[110]; cin >> K >> S >> N; len = strlen(S); for (int i = 0; i != len; i++) CC[S[i] - a ]++; for (int i = 0; i != K; i++) { for (int j = 0; j != len; j++) A[i].mask[j] = true; for (int j = 0; j != 30; j++) A[i].C[j] = CC[j]; } int a; char ch; while (N--) { cin >> a >> ch; int sumch = 0; for (int i = 0; i != K; i++) if (sumch + A[i].C[ch - a ] >= a) { a -= sumch; A[i].C[ch - a ]--; for (int j = 0; j != len; j++) { if (S[j] == ch && A[i].mask[j]) a--; if (!a) { A[i].mask[j] = false; break; } } break; } else sumch += A[i].C[ch - a ]; } for (int i = 0; i != K; i++) for (int j = 0; j != len; j++) if (A[i].mask[j]) cout << S[j]; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > v[100000]; int f[100000]; int d[100000]; void dfs(int x) { int i; for (i = 0; i < v[x].size(); i++) { if (f[v[x][i].first] == 0) { d[v[x][i].first] = d[x] + v[x][i].second; f[v[x][i].first] = 1; dfs(v[x][i].first); } } } int main() { int n, i, j; long long sum = 0; scanf( %d , &n); for (i = 0; i < n - 1; i++) { int x, y, w; scanf( %d %d %d , &x, &y, &w); v[x - 1].push_back(make_pair(y - 1, w)); v[y - 1].push_back(make_pair(x - 1, w)); sum += w * 2; } f[0] = 1; dfs(0); sort(d, d + n); sum -= d[n - 1]; printf( %I64d n , sum); return 0; } |
#include <bits/stdc++.h> using namespace std; void fast_io() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } long long r(long long num, long long den) { if (den == 1) return num; else if (num == 1) return den; if (num > den) return num / den + r(num % den, den); else return den / num + r(num, den % num); } void solve() { long long a, b; cin >> a >> b; cout << r(a, b) << endl; } int main() { fast_io(); solve(); return 0; } |
#include <bits/stdc++.h> int n; int a[(200010) << 1], b[(200010) << 1]; int pa[(200010) << 1], sa[(200010) << 1]; int pb[(200010) << 1], sb[(200010) << 1]; struct node { int x, y; } p[(200010)]; long long solve(int t) { memset(a, 0, sizeof(a)); memset(b, 0, sizeof(b)); memset(pa, 0, sizeof(pa)); memset(pb, 0, sizeof(pb)); memset(sa, 0, sizeof(sa)); memset(sb, 0, sizeof(sb)); for (int i = 0; i < (200010) << 1; ++i) { b[i] = ((200010) << 1) - 1; } for (int i = 0; i < n; ++i) { if ((p[i].x & 1) ^ t) continue; a[p[i].x] = std::max(a[p[i].x], p[i].y); b[p[i].x] = std::min(b[p[i].x], p[i].y); } pb[0] = sb[((200010) << 1) - 1] = ((200010) << 1) - 1; for (int i = 1; i < (200010) << 1; ++i) { pa[i] = std::max(pa[i - 1], a[i]); pb[i] = std::min(pb[i - 1], b[i]); } for (int i = ((200010) << 1) - 2; ~i; --i) { sa[i] = std::max(sa[i + 1], a[i]); sb[i] = std::min(sb[i + 1], b[i]); } long long ret = 0; for (int i = 1 + t; i < ((200010) << 1) - 1; i += 2) { int l = std::min(pa[i - 1], sa[i + 1]); int r = std::max(pb[i - 1], sb[i + 1]); if (l <= r) { ret += (200010); continue; } if ((l ^ i) & 1) ++l; if ((r ^ i) & 1) --r; ret += ((((200010) << 1) - 1 - l) >> 1) + 1; ret += (r >> 1) + 1; } return ret; } int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) { int x, y; scanf( %d%d , &x, &y); p[i] = {x + y + (200010), x - y + (200010)}; } long long ans = 1ll * ((200010) << 1) * (((200010) << 1) - 2) / 2 - solve(0) - solve(1); printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; inline void pisz(int n) { printf( %d n , n); } const int fx[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}}; const int fxx[8][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1}}; template <typename T, typename TT> ostream& operator<<(ostream& s, pair<T, TT> t) { return s << ( << t.first << , << t.second << ) ; } template <typename T> ostream& operator<<(ostream& s, vector<T> t) { for (int i = 0; i < ((int)((t).size())); i++) s << t[i] << ; return s; } int main() { int n; string A; int cursor; cin >> n >> cursor >> A; cursor--; n--; cursor = min(cursor, n - cursor); int middle = n / 2; int leftmost = cursor, rightmost = cursor; for (int i = cursor; i <= middle; i++) if (A[i] != A[n - i]) rightmost = i; for (int i = cursor; i >= 0; i--) if (A[i] != A[n - i]) leftmost = i; int vertical_moves = 0; for (int i = leftmost; i <= rightmost; i++) vertical_moves += min(abs(A[i] - A[n - i]), 26 - abs(A[i] - A[n - i])); int horizontal_moves = min((cursor - leftmost) + (rightmost - leftmost), (rightmost - cursor) + (rightmost - leftmost)); int total_moves = horizontal_moves + vertical_moves; cout << total_moves; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int MXN = 1e3 + 7; const int mod = 998244353; int n, m; int ar[MXN][MXN]; int br[MXN]; struct lp { int m, v; } A[MXN][MXN], B[MXN][MXN]; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) scanf( %d , &ar[i][j]); } for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { br[j] = ar[i][j]; } sort(br + 1, br + 1 + m); int k = unique(br + 1, br + 1 + m) - br - 1; for (int j = 1; j <= m; ++j) { A[i][j].m = k; A[i][j].v = lower_bound(br + 1, br + 1 + k, ar[i][j]) - br; } } for (int i = 1; i <= m; ++i) { for (int j = 1; j <= n; ++j) { br[j] = ar[j][i]; } sort(br + 1, br + 1 + n); int k = unique(br + 1, br + 1 + n) - br - 1; for (int j = 1; j <= n; ++j) { B[j][i].m = k; B[j][i].v = lower_bound(br + 1, br + 1 + k, ar[j][i]) - br; } } for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { int t = abs(A[i][j].v - B[i][j].v); if (A[i][j].v > B[i][j].v) { printf( %d , max(A[i][j].m, B[i][j].m + t)); } else if (A[i][j].v < B[i][j].v) { printf( %d , max(A[i][j].m + t, B[i][j].m)); } else { printf( %d , max(A[i][j].m, B[i][j].m)); } } printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << : << arg1 << std::endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cerr.write(names, comma - names) << : << arg1 << | ; __f(comma + 1, args...); } bool ok(int x) { if (x < 0) return false; for (int i = 0; i * i <= x; i++) if (i * i == x) return true; return false; } int main() { int n; scanf( %d , &n); int mx = -10000000; for (int i = (0); i < (n); ++i) { int x; scanf( %d , &x); if (ok(x)) continue; mx = max(mx, x); } printf( %d n , mx); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, a, b, c, d; cin >> n >> a >> b >> c >> d; if ((a + b) * n < c - d) cout << No n ; else if ((a - b) * n > c + d) cout << No n ; else cout << Yes n ; } return 0; } |
#include <bits/stdc++.h> int M[50] = {0, 2, 3, 5, 7, 13, 17, 19, 31, 61, 89, 107, 127, 521, 607, 1279, 2203, 2281, 3217, 4253, 4423, 9689, 9941, 11213, 19937, 21701, 23209, 44497, 86243, 110503, 132049, 216091, 756839, 859433, 1257787, 1398269, 2976221, 3021377, 6972593, 13466917, 20996011}; int main(void) { int i, n, x = 1; scanf( %d , &n); for (i = 1; i < M[n]; i++) { x *= 2; x %= 1000000007; } printf( %d , (x + 1000000007 - 1) % 1000000007); } |
#include <bits/stdc++.h> using namespace std; long long a[200100]; int main() { long long k, Answer = 0; int n; cin >> n >> k; for (int i = 0; i < n; i++) scanf( %I64d , &a[i]); for (int i = 0; i < n; i++) { Answer += a[i] / k; a[i] = a[i] % k; if (a[i] + a[i + 1] >= k) a[i + 1] += a[i]; else if (a[i] > 0) { a[i + 1] = 0; Answer++; } } cout << Answer; return 0; } |
#include <bits/stdc++.h> using namespace std; void substr(int start, int end, char in[], char out[]) { for (int i = start; i < end; ++i) out[i - start] = in[i]; out[end - start] = 0 ; } int main() { int n, p, q; char s[100]; cin >> n >> p >> q; cin >> s; int pdivmax = n / p + 1, qdivmax = n / q + 1; bool divided = false; if (p == q) { if (n % p == 0) { cout << n / p << endl; for (int i = 0; i < n; i += p) { char out[100]; substr(i, i + p, s, out); cout << out << endl; } divided = true; } } else { for (int i = 0; i < pdivmax; ++i) { for (int j = 0; j < qdivmax; ++j) { if (p * i + q * j == n) { cout << i + j << endl; for (int k = 0; k < p * i; k += p) { char out[100]; substr(k, k + p, s, out); cout << out << endl; } for (int k = p * i; k < n; k += q) { char out[100]; substr(k, k + q, s, out); cout << out << endl; } divided = true; break; } } if (divided) break; } } if (!divided) cout << -1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, i, j, k, l, m, t; vector<int> a[10001]; cin >> n; for (i = 1; i < n; i++) { cin >> m >> t; a[m].push_back(t); a[t].push_back(m); } l = 0; m = 0; int b[30001], c[30001]; for (t = 1; t <= n; t++) { j = 0; for (i = 0; i < a[t].size(); i++) { j++; b[j] = a[t][i]; } l = 0; for (i = 1; i <= a[t].size(); i++) { for (j = 0; j < a[b[i]].size(); j++) { l++; c[l] = a[b[i]][j]; } } for (i = 1; i <= l; i++) if (c[i] > t) m++; } cout << m << endl; } |
#include <bits/stdc++.h> using namespace std; bool not_prime[100000]; long long int primes[100000]; int p, prime_factors[100000], pf_count[100000], q; int a[10000]; void find_primes() { long long int i, j; p = 0; for (i = 2; i < 100000; i++) { if (not_prime[i] == false) { primes[p++] = i; for (j = 2; i * j < 100000; j++) { not_prime[i * j] = false; } } } } void factor(long long int n) { q = 0; for (int i = 0; i < p; i++) { int count = 0; while (n % primes[i] == 0) { count++; n /= primes[i]; } if (count > 0) { prime_factors[q] = i; pf_count[q++] = count; } } if (n > 1) { primes[p++] = n; prime_factors[q] = p - 1; pf_count[q++] = 1; } } int rec(int d, long long int b) { int ret = 0; if (d == q) { long long int x = 1; for (int i = 0; i < q; i++) { for (int j = 0; j < a[i]; j++) x *= primes[prime_factors[i]]; } if (x <= b) return 0; else return 1; } for (int j = pf_count[d]; j >= 0; j--) { a[d] = j; int tmp = rec(d + 1, b); if (tmp == 0) break; ret += tmp; } return ret; } int main() { long long int a, b, n; int ans = 0; cin >> a >> b; n = a - b; if (a == b) { cout << infinity << endl; } else if (a < b) { cout << 0 << endl; } else { find_primes(); factor(n); cout << rec(0, b) << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { int a[3], b[3]; int k, d; cin >> a[0] >> a[1] >> a[2] >> k; for (int i = 0; i < 3; i++) { a[i]--; b[i] = 0; } sort(a, a + 3); for (int i = 0; i < 3; i++) { d = k / (3 - i); for (int j = i; j < 3; j++) { int t = min(a[i], d); b[j] += t; a[j] -= t; k -= t; if (d % (3 - i) > j && a[j]) { k--; b[j]++; a[j]--; } } } cout << (long long)(b[0] + 1) * (b[1] + 1) * (b[2] + 1); } |
#include <bits/stdc++.h> using namespace std; bool prime(long long int i) { if (i == 1) return false; if ((i == 2) || (i == 3)) return true; if ((i % 2 == 0) || (i % 3 == 0)) return false; else { for (long long int j = 5; j * j <= i; j += 6) if ((i % j == 0) || (i % (j + 2) == 0)) return false; } return true; } int main() { long long p, y, ans; cin >> p >> y; int f = 0; if (p == y) { cout << -1 ; return 0; } for (long long i = y; i > p; i--) { int f1 = 0; if (prime(i)) { f = 1; ans = i; break; } for (long long j = 2; j <= p; j++) { if (i % j == 0) { f1 = 1; break; } } if (f1 == 0) { ans = i; f = 1; break; } } if (f == 1) { cout << ans; } else { cout << -1 ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 600; int mat[2000][2000]; int quad[20][20]; int cont[20][20]; int main() { int n, m; scanf( %d%d , &n, &m); int foi = 0; int result = -1; for (int i = 0; i < m; i++) { int x, y; for (int h = 0; h < 5; h++) { for (int k = 0; k < 5; k++) { quad[h][k] = 0; cont[h][k] = 0; } } scanf( %d%d , &x, &y); x--; y--; mat[x][y]++; int maiorX = max(x - 2, 0); int menorX = min(x + 2, n - 1) + 1; int maiorY = max(y - 2, 0); int menorY = min(y + 2, n - 1) + 1; for (int h = maiorX; h < menorX; h++) { for (int k = maiorY; k < menorY; k++) { if (mat[h][k]) { cont[h - maiorX][k - maiorY]++; if (h - maiorX - 1 >= 0) { cont[h - maiorX][k - maiorY] += cont[h - maiorX - 1][k - maiorY]; } } } } int pode = 0; for (int h = 0; h < 5; h++) { int soma = 0; for (int k = 0; k < 5; k++) { if (cont[h][k] >= 3) { soma++; if (soma >= 3) { pode = 1; } } else { soma = 0; } } } if (foi == 0 && pode) { result = i + 1; foi = 1; } } printf( %d n , result); return 0; } |
#include <bits/stdc++.h> using namespace std; inline void prnt(bool ok) { cout << (ok ? YES : NO ); } const int ppr = 257; const long long INF = 2e18; const int inf = 2e9; const int mod = 1e9 + 7; const int N = 3e6 + 123; const long double pi = 3.141592653589793238462643; const int dx[] = {1, 0, -1, 0}; const int dy[] = {0, 1, 0, -1}; long long n, m, a[N], b[N], q, cur; vector<long long> g[N]; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n >> m; while (m--) { long long x, y; cin >> x >> y; if (x < y) swap(x, y); g[y].push_back(x); a[x]++; b[y]++; } for (long long i = 1; i <= n; i++) cur += a[i] * b[i]; cin >> q; cout << cur << n ; while (q--) { long long x; cin >> x; cur -= a[x] * b[x]; a[x] += g[x].size(); b[x] = 0; for (auto to : g[x]) { cur -= a[to] * b[to]; b[to]++; a[to]--; cur += a[to] * b[to]; g[to].push_back(x); } g[x].clear(); cout << cur << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = (int)1e5 + 5; string check(char x, int n) { string it = ; it.push_back(x); string z = ; for (int i = 0; i < n; i++) { z = z + 0 ; } it = it + z; return it; } int main() { int tc; cin >> tc; while (tc--) { int x; int count = 0; vector<string> v; cin >> x; string it = to_string(x); int size = it.length(); for (int i = 0; i < size; i++) { if (it[size - 1 - i] != 0 ) { string second = check(it[size - 1 - i], i); count++; v.push_back(second); } } reverse(v.begin(), v.end()); cout << count << endl; for (auto& i : v) { cout << i << ; } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long f[2010][2010], n, s, ans, m; int main() { int n, m; cin >> n >> m; for (int i = 1; i <= n; ++i) { s = 0; for (int j = 0; j <= m - 2; ++j) s = (s + f[i - 1][j]) % 1000000007, f[i][j] = ((j == 0 ? 1 : f[i][j - 1]) + s) % 1000000007; } for (int i = 1; i <= n; ++i) for (int j = 0; j <= m - 2; ++j) ans = (ans + (m - j - 1) * (f[i][j] - f[i - 1][j]) % 1000000007 * f[n - i + 1][j] % 1000000007) % 1000000007; cout << (ans + 1000000007) % 1000000007; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3F3F3F3F; const int MAXN = 100001; char str[MAXN]; inline void solve(int test) { int t, sx, sy, ex, ey; scanf( %d %d %d %d %d , &t, &sx, &sy, &ex, &ey); scanf( %s , str); ; int X, Y; X = ex - sx, Y = ey - sy; pair<char, char> S; if (Y < 0) S.first = S ; else S.first = N ; if (X < 0) S.second = W ; else S.second = E ; X = abs(X); Y = abs(Y); for (int i = 0; i < t; ++i) { char G = str[i]; if (S.first == G) Y--; else if (S.second == G) X--; if (X <= 0 && Y <= 0) { printf( %d n , i + 1); return; } } printf( -1 n ); } int main() { solve(0); return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 1 << 30; char buf[1000]; string nextLine(int length = 100) { cin.getline(buf, length); string s(buf); return s; } string next(int length = 100) { string tmp; cin >> tmp; return tmp; } int nextInt() { int tmp; scanf( %d , &tmp); return tmp; } long long mod = 1E9 + 7; long long add(long long a, long long b) { return (a + b) % mod; } const int MAXN = 5010; string s1, s2; int m, n; long long dp[MAXN][MAXN]; long long get(int starta, int startb) { if (starta == m) return 0; if (startb == n) return 0; long long &ret = dp[starta][startb]; if (ret != -1) return ret; ret = 0; if (s2[startb] == s1[starta]) { ret++; ret = add(ret, get(starta + 1, startb + 1)); } ret = add(ret, get(starta, startb + 1)); return ret; } int main() { s1 = next(); s2 = next(); m = ((int)(s1).size()); n = ((int)(s2).size()); long long sum = 0; for (int i = 0, _i = (MAXN); i < _i; ++i) for (int j = 0, _j = (MAXN); j < _j; ++j) dp[i][j] = -1; for (int i = 0, _i = (m); i < _i; ++i) { sum = add(sum, get(i, 0)); } cout << sum << endl; } |
#include <iostream> #include <string> #include<bits/stdc++.h> #include<algorithm> using namespace std; int main() { int t; cin>>t; while(t--) { long long n,k; cin>>n>>k; long long a=n,b=1; if(n%2==0) { k--; k=k%n; cout<<b+k<<endl; } else { k--; long long t=n/2; long long y=k/t; long long j=k+y+1; long long ans=j%n; if(!ans)ans=n; cout<<ans<<endl; } } } |
#include <bits/stdc++.h> using namespace std; const int maxN = 1e5; int n; char ans[maxN + 1]; string s; int main() { ios_base::sync_with_stdio(false); cin >> n; cin.ignore(); for (int i = 0; i < n; i++) { getline(cin, s); for (int j = 0; j < s.length(); j++) { if (ans[j] == 0) ans[j] = ? ; if (s[j] == ? || ans[j] == X ) continue; if (ans[j] == ? && s[j] != ? ) ans[j] = s[j]; else if (ans[j] != ? && s[j] != ? && ans[j] != s[j]) ans[j] = X ; } } for (int i = 0; i < s.length(); i++) { if (ans[i] == X ) ans[i] = ? ; else if (ans[i] == ? ) ans[i] = a ; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; char a[100020]; char b[100020]; int zf[100020]; int zb[100020]; int main() { scanf( %s , a); scanf( %s , b); int la = strlen(a); int lb = strlen(b); zf[0] = 0; zb[la] = lb; for (int i = 1; i <= la; i++) { if (a[i - 1] == b[zf[i - 1]]) { zf[i] = zf[i - 1] + 1; } else { zf[i] = zf[i - 1]; } } for (int i = la - 1; i >= 0; i--) { if (a[i] == b[zb[i + 1] - 1]) { zb[i] = zb[i + 1] - 1; } else { zb[i] = zb[i + 1]; } } int ans = lb + 1; int p = -1; for (int i = 0; i <= la; i++) { int tmp = max(zb[i] - zf[i], 0); if (ans > tmp) { ans = tmp; p = i; } } for (int i = 0; i < zf[p]; i++) { printf( %c , b[i]); } for (int i = max(zf[p], zb[p]); i < lb; i++) { printf( %c , b[i]); } if (ans == lb) { printf( - ); } printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int maxn = 1e6 + 500; const long long int mod = 998244353; int dep[maxn], low[maxn], ans[maxn], dp[maxn]; int head[maxn], cnt; int n, k; struct C { int next, to; } E[maxn]; void add(int x, int y) { E[cnt].to = y; E[cnt].next = head[x]; head[x] = cnt++; } void dfs1(int u, int fa) { low[u] = 0x7f7f7f7f; dep[u] = dep[fa] + 1; if (head[u] == -1) { low[u] = dep[u]; dp[u] = 1; } else { for (int i = head[u]; i + 1; i = E[i].next) { int v = E[i].to; dfs1(v, u); low[u] = min(low[u], low[v]); if (low[v] - k <= dep[u]) dp[u] += dp[v]; } } } int dfs(int u, int fa) { if (head[u] == -1) return 1; int ans = 0; for (int i = head[u]; i + 1; i = E[i].next) { int v = E[i].to; int temp = dp[u]; if (low[v] - k <= dep[u]) temp -= dp[v]; ans = max(ans, temp + dfs(v, u)); } return ans; } int main() { int x; scanf( %d%d , &n, &k); memset(head, -1, sizeof head); for (int i = 2; i <= n; i++) { scanf( %d , &x); add(x, i); } dfs1(1, 0); printf( %d n , dfs(1, 0)); } |
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; int m, n, a[100009], b[100009]; long long sa, sb; long long proca() { long long ans = 0; ans += sa; for (int(x) = (1); (x) < (n); ++(x)) { ans += min(sa, (long long)b[x]); } return ans; } long long procb() { long long ans = 0; ans += sb; for (int(x) = (1); (x) < (m); ++(x)) ans += min(sb, (long long)a[x]); return ans; } int main() { while (scanf( %d%d , &m, &n) == 2) { sa = sb = 0; for (int(x) = (0); (x) < (m); ++(x)) { scanf( %d , &a[x]); sa += a[x]; } for (int(x) = (0); (x) < (n); ++(x)) { scanf( %d , &b[x]); sb += b[x]; } sort(a, a + m); reverse(a, a + m); sort(b, b + n); reverse(b, b + n); cout << min(proca(), procb()) << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct Edge { int t, v, next; Edge() {} Edge(int a, int b, int c) : t(a), v(b), next(c) {} }; Edge e[600005]; int head[300005]; long long dis[300005]; int p[300005]; priority_queue<pair<long long, int>, vector<pair<long long, int> >, greater<pair<long long, int> > > q; void dijkstra(int k) { memset(dis, 0x3f, sizeof(dis)); dis[1] = 0; q.push(pair<long long, int>(0, 1)); int cnt = 0; while (!q.empty()) { pair<long long, int> t = q.top(); q.pop(); if (dis[t.second] < t.first) continue; int a = t.second; long long b = t.first; if (p[a] && cnt < k) { printf( %d , p[a]); cnt++; } for (int i = head[a]; i; i = e[i].next) if (b + e[i].v < dis[e[i].t]) { int u = e[i].t; dis[u] = b + e[i].v; p[u] = ((i + 1) >> 1); q.push(pair<long long, int>(dis[u], u)); } } printf( n ); } int main() { int n, m, k; scanf( %d%d%d , &n, &m, &k); k = min(k, n - 1); for (int i = 1; i <= m; i++) { int x, y, z; scanf( %d%d%d , &x, &y, &z); e[2 * i - 1] = Edge(y, z, head[x]); head[x] = 2 * i - 1; e[2 * i] = Edge(x, z, head[y]); head[y] = 2 * i; } printf( %d n , k); dijkstra(k); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, i, j; char s[101]; cin >> n >> m; for (i = 0; i < n; i++) { cin >> s; for (j = 0; j < m; j++) { if (s[j] == . ) s[j] = ((i + j) % 2 == 0) ? B : W ; } cout << s << endl; } return 0; } |
#include <bits/stdc++.h> int main() { srand(1598743157); int v[4]; for (int i = 0; i < 4; i++) scanf( %d , &v[i]); while (v[0] != 1 || v[1] != 1 || v[2] != 1 || v[3] != 1) { bool ok = true; bool was = false; while (ok) { ok = false; for (int i = 0; i < 4; i++) if (v[i] % 2 == 0 && v[(i + 1) % 4] % 2 == 0) { printf( /%d n , i + 1); v[i] /= 2; v[(i + 1) % 4] /= 2; ok = true; was = true; } } if (was) continue; int i = rand() % 4; printf( +%d n , i + 1); v[i]++; v[(i + 1) % 4]++; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long dp[2][100010]; long long MOD = 1000000007; int main() { string s1, s2; int k; while (cin >> s1 >> s2 >> k) { s1 = s1 + s1; int cntS = 0, cntD = 0; for (int i = 0; i < s2.size(); ++i) if (s1.substr(i, s2.size()) == s2) cntS++; else cntD++; if (s1.substr(0, s2.size()) == s2) dp[0][0] = 1, dp[1][0] = 0; else dp[0][0] = 0, dp[1][0] = 1; for (int i = 1; i <= k; ++i) { dp[0][i] = dp[0][i - 1] * (cntS - 1) + dp[1][i - 1] * (cntS); dp[1][i] = dp[0][i - 1] * (cntD) + dp[1][i - 1] * (cntD - 1); dp[0][i] %= MOD; dp[1][i] %= MOD; } cout << dp[0][k] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int M = 1e5 + 10; int main() { ios::sync_with_stdio(0); int n; cin >> n; string s; cin >> s; s += _ ; int ln = 0, lng = 0, imin = 0; for (int i = 0; i < s.length(); i++) { if (s[i] == ( ) { imin = 1; ln = 0; } else if (s[i] == ) ) { imin = 0; ln = 0; } else if (!imin) { if (s[i] != _ ) { ln++; lng = max(lng, ln); } else ln = 0; } else ln = 0; } cout << lng << ; imin = 0, ln = 0; int cnt = 0; for (int i = 0; i < s.length(); i++) { if (s[i] == ( ) { imin = 1; ln = 0; } else if (s[i] == ) ) { imin = 0; if (ln) cnt++; ln = 0; } else if (imin) { if (s[i] != _ ) ln++; else { if (ln) cnt++; ln = 0; } } else ln = 0; } cout << cnt << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int N, K; cin >> N >> K; using arr2 = array<int, 2>; vector<arr2> binTrie; const int w = 30; binTrie.push_back({-1, -1}); vector<int> sz(1, 0); auto add = [&](int x) { int v = 0; for (int i = w - 1; i >= 0; --i) { int b = (x >> i) & 1; ++sz[v]; if (binTrie[v][b] >= 0) { v = binTrie[v][b]; continue; } int v_ = binTrie.size(); binTrie[v][b] = v_; binTrie.push_back({-1, -1}); sz.push_back(0); v = v_; } ++sz[v]; }; auto xor_lower_bound_size = [&](int x, int k) { int v = 0, ret = 0; for (int i = w - 1; i >= 0; --i) { int b = ((x ^ k) >> i) & 1; int t = (k >> i) & 1; if ((!t) and binTrie[v][b ^ 1] >= 0) ret += sz[binTrie[v][b ^ 1]]; if (binTrie[v][b] < 0) { v = -1; break; } v = binTrie[v][b]; } if (v >= 0) ret += sz[v]; return ret; }; vector<int> A(N + 1); for (int i = 0; i < N; ++i) { cin >> A[i + 1]; A[i + 1] ^= A[i]; } long long ans = 0; for (int i = 0; i <= N; ++i) { ans += xor_lower_bound_size(A[i], K); add(A[i]); } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long t = 1; cin >> t; while (t--) { long long n, k; cin >> n >> k; if (k > n) { cout << NO n ; continue; } if (n % 2 == 0 && k % 2 == 1 && k > n / 2) { cout << NO n ; continue; } if (n % 2 != 0 && k % 2 == 0) { cout << NO n ; continue; } if (k % 2 != n % 2) { cout << YES n ; cout << n - 2 * (k - 1) << ; for (long long i = 0; i < k - 1; i++) cout << 2 << ; cout << endl; continue; } if (n % 2 == k % 2) { cout << YES n ; cout << n - (k - 1) << ; for (long long i = 0; i < k - 1; i++) cout << 1 << ; cout << endl; continue; } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (a < b) swap(a, b); if (b == 0) return a; while ((a = a % b) != 0) { swap(a, b); } return b; } long long mpow(long long x, long long y, long long m) { long long res = 1; while (y > 0) { if (y & 1) res = res * x % m; y = y >> 1; x = x * x % m; } return res; } long long ncr(long long n, long long r) { if (r > n) return 0; long long res = 1; for (long long i = (1); i < (r + 1); i++) res = res * (n - r + i) / i; return res; } long long *sieve(long long n) { long long *lpf = new long long[n + 1]; for (long long i = 1; i <= n; i++) lpf[i] = i; long long rt = (long long)floor(sqrt(n)) + 1; for (long long i = (2); i < (rt); i++) { if (lpf[i] != i) continue; for (long long j = i * i; j <= n; j += i) { if (lpf[j] == j) lpf[j] = i; } } return lpf; } void solve() { long long n; cin >> n; long long a[n]; for (long long i = (0); i < (n); i++) cin >> a[i]; long long mx = *max_element(a, a + n), mn = *min_element(a, a + n); if (mx == mn) { if (mx != 0) cout << NO ; else { cout << YES n ; for (long long i = (0); i < (n); i++) cout << 1 ; } return; } long long k; for (long long i = (0); i < (n); i++) { long long prev = i - 1; if (prev == -1) prev = n - 1; if (a[i] == mx && a[prev] != mx) { k = i; break; } } long long pt = k; long long b[n]; b[pt] = mx; pt--; if (pt == -1) pt = n - 1; if (a[pt] == 0) b[pt] = mx * 2; else b[pt] = mx + a[pt]; pt--; if (pt == -1) pt = n - 1; while (pt != k) { b[pt] = b[(pt + 1) % n] + a[pt]; pt--; if (pt == -1) pt = n - 1; } cout << YES n ; for (long long i = (0); i < (n); i++) cout << b[i] << ; } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t = 1; for (long long i = (1); i < (t + 1); i++) { solve(); cout << n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { int m, n; cin >> m >> n; vector<pair<int, int>> a, b; a.resize(n); for (int i = 0; i < n; ++i) { a[i].second = i; cin >> a[i].first; } sort(a.begin(), a.end()); b.resize(n); for (int i = 0; i < n; ++i) { b[i].second = i; cin >> b[i].first; } sort(b.begin(), b.end()); vector<long long> sum; sum.resize(n * 2 + 1); for (int i = 0; i < n * 2 + 1; ++i) { sum[i] = 0; } for (int i = 0, p0 = 0, p1 = 0, p2 = 0; i < n; ++i) { while (p0 < n && b[p0].first < a[i].first - 1.0 * m / 2) { ++p0; } while (p1 < n && b[p1].first < a[i].first) { ++p1; } while (p2 < n && b[p2].first < a[i].first + 1.0 * m / 2) { ++p2; } int beg = n - i; sum[beg + 0] += m - a[i].first; sum[beg + p0] -= m - a[i].first; sum[beg + p0] += a[i].first; sum[beg + p1] -= a[i].first; sum[beg + p1] += -a[i].first; sum[beg + p2] -= -a[i].first; sum[beg + p2] += m + a[i].first; sum[beg + n] -= m + a[i].first; } for (int i = 1; i < n * 2; ++i) { sum[i] += sum[i - 1]; } for (int i = 0; i < n; ++i) { sum[i] += sum[i + n]; } vector<long long> rsum; rsum.resize(n * 2 + 1); for (int i = 0; i < n * 2 + 1; ++i) { rsum[i] = 0; } for (int i = 0, p0 = 0, p1 = 0, p2 = 0; i < n; ++i) { while (p0 < n && a[p0].first <= b[i].first - 1.0 * m / 2) { ++p0; } while (p1 < n && a[p1].first <= b[i].first) { ++p1; } while (p2 < n && a[p2].first <= b[i].first + 1.0 * m / 2) { ++p2; } int beg = n - i - 1; rsum[beg + 0] += -b[i].first; rsum[beg + p0] -= -b[i].first; rsum[beg + p0] += b[i].first; rsum[beg + p1] -= b[i].first; rsum[beg + p1] += -b[i].first; rsum[beg + p2] -= -b[i].first; rsum[beg + p2] += b[i].first; rsum[beg + n] -= b[i].first; } for (int i = 1; i < n * 2; ++i) { rsum[i] += rsum[i - 1]; } for (int i = 0; i < n; ++i) { rsum[i] += rsum[i + n]; } vector<long long> cost; cost.resize(n); for (int i = 0; i < n; ++i) { cost[i] = sum[i] + rsum[n - 1 - i]; } long long cur = (long long)(1e18); int pos; for (int i = 0; i < n; ++i) { if (cost[i] < cur) { cur = cost[i]; pos = i; } } cout << cur << endl; vector<int> at; at.resize(n); for (int i = 0; i < n; ++i) { at[a[i].second] = b[(i + pos) % n].second; } for (int i = 0; i < n; ++i) { cout << at[i] + 1 << ; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int getFldsFromLine(char *line, std::vector<char *> &res, const char *sep = t n v f r ); int main(int argc, char **argv) { FILE *infile = stdin; char *line; line = (char *)calloc(5000000, sizeof(char)); if (line == NULL) { fprintf(stderr, Couldn t allocate space for %s nBye! n , line ); exit(-1); }; std::vector<char *> flds; int numFlds, numCases, caseNum = 0; fgets(line, 5000000, infile); numFlds = getFldsFromLine(line, flds); numCases = atoi(flds[0]); bool isGood = false; for (caseNum = 1; caseNum <= numCases; ++caseNum) { fgets(line, 5000000, infile); numFlds = getFldsFromLine(line, flds); int num1 = atoi(flds[1]), num2 = atoi(flds[2]); if ((num1 >= 2400) && (num2 > num1)) isGood = true; } if (isGood) printf( YES n ); else printf( NO n ); return (0); } int getFldsFromLine(char *line, std::vector<char *> &res, const char *sep) { res.clear(); char *tok = strtok(line, sep); while (tok) { res.push_back(tok); tok = strtok(0, sep); } return res.size(); } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k, j, i, l, r, ans = 0, x, y, minimum; scanf( %d , &n); scanf( %d , &k); int count_a[n], count_b[n]; char str[n + 1], ch; scanf( %s , str); for (i = 0; i < n; i++) { count_a[i] = 0; count_b[i] = 0; } for (i = 0; i < n; i++) { if (str[i] == a ) count_a[i]++; if (str[i] == b ) count_b[i]++; } for (i = 1; i < n; i++) { count_a[i] += count_a[i - 1]; count_b[i] += count_b[i - 1]; } l = 0; r = 0; while (r < n) { if (l == 0) { x = count_a[r]; y = count_b[r]; } else { x = count_a[r] - count_a[l - 1]; y = count_b[r] - count_b[l - 1]; } minimum = min(x, y); if (k >= minimum) { ans = max(ans, r - l + 1); r++; } else l++; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> #pragma GCC target( avx2 ) #pragma GCC optimize( O3 ) #pragma GCC optimize( unroll-loops ) #pragma GCC optimize( Ofast ) using namespace std; const long long INF64 = 1e18; const long long INF32 = 1e9; const double EPS = static_cast<double>(1e-10); const double PI = 2.0 * acos(0.0); const long long MOD = (long long)1e9 + 7; long long powMod(long long a, long long b) { long long res = 1; a %= MOD; assert(b >= 0); for (; b; b >>= 1) { if (b & 1) res = res * a % MOD; a = a * a % MOD; } return res; } long long invMod(long long a) { long long b = MOD, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } return (MOD + u) % MOD; } const long long day[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; mt19937 rnd(239); vector<long long> prefixSum(vector<long long> &a) { vector<long long> b; std::partial_sum(a.begin(), a.end(), b.begin()); return b; } long long mostSignDigit(long long n) { double k = log10(n); return (long long)pow(10, k - floor(k)); } long long numOfDigits(long long n) { return (long long)floor(log10(n)) + 1; } bool isPowerOfTwo(long long x) { return x && (!(x & (x - 1))); } bool allPositive(vector<long long> &a) { return all_of(begin(a), end(a), [](long long x) { return x > 0; }); } bool anyPositive(vector<long long> &a) { return any_of(begin(a), end(a), [](long long x) { return x > 0; }); } bool nonePositive(vector<long long> &a) { return none_of(begin(a), end(a), [](long long x) { return x > 0; }); } void FILEIO() { freopen( in.txt , r , stdin); freopen( out.txt , w , stdout); } void __print(long long x) { cerr << x; } void __print(long x) { cerr << x; } void __print(unsigned x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __print(float x) { cerr << x; } void __print(double x) { cerr << x; } void __print(long double x) { cerr << x; } void __print(char x) { cerr << << x << ; } void __print(const char *x) { cerr << << x << ; } void __print(const string &x) { cerr << << x << ; } void __print(bool x) { cerr << (x ? T : F ); } template <typename T, typename V> void __print(const pair<T, V> &x) { cerr << { ; __print(x.first); cerr << , ; __print(x.second); cerr << } ; } template <typename T> void __print(const T &x) { long long f = 0; cerr << { ; for (auto &i : x) cerr << (f++ ? , : ), __print(i); cerr << } ; } void _print() { cerr << ] n ; } template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << , ; _print(v...); } vector<vector<long long>> adj; vector<long long> lvl; vector<long long> par; void dfs(long long vertex) { for (long long nxt : adj[vertex]) { if (lvl[nxt] == 0) { par[nxt] = vertex; lvl[nxt] = lvl[vertex] + 1; dfs(nxt); } } } void init(long long n) { adj.clear(); adj.assign(n, vector<long long>()); lvl.clear(); lvl.resize(n); par.clear(); par.resize(n); } void DFS() { lvl[0] = 1; dfs(0); } void solve() { long long n, m; cin >> n >> m; init(n); for (long long i = (0); i < (m); i++) { long long u, v; cin >> u >> v; u--, v--; adj[u].push_back(v); adj[v].push_back(u); }; DFS(); ; ; long long mx = -1, umx = 0; for (long long u = (0); u < (n); u++) { if (lvl[u] > mx) { umx = u; mx = lvl[u]; } } if (mx >= (n + 1) / 2) { vector<long long> ans; long long u = umx; for (long long i = (0); i < (mx); i++) { if (((long long)(ans).size()) >= (n + 1) / 2) break; ans.push_back(u); u = par[u]; } reverse(begin(ans), end(ans)); cout << PATH << endl; cout << ((long long)(ans).size()) << endl; for (long long i = (0); i < (((long long)(ans).size())); i++) cout << ans[i] + 1 << ; cout << endl; } else { vector<vector<long long>> lvlvec(mx); for (long long u = (0); u < (n); u++) lvlvec[lvl[u] - 1].push_back(u); ; vector<pair<long long, long long>> ans; for (long long i = (0); i < (mx); i++) { vector<long long> vc = lvlvec[i]; for (long long j = (0); j < (((long long)(vc).size()) / 2); j++) { long long a = vc[2 * j], b = vc[2 * j + 1]; ans.push_back(make_pair(a, b)); } if (((long long)(ans).size()) * 2 >= (n + 1) / 2) break; } cout << PAIRING << endl; cout << ((long long)(ans).size()) << endl; for (long long i = (0); i < (((long long)(ans).size())); i++) { cout << ans[i].first + 1 << << ans[i].second + 1 << n ; } } } signed main() { ios_base::sync_with_stdio(false); cin.tie(); long long t; cin >> t; for (long long i = (1); i <= (t); i++) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 10; int n, q, a, b, blo, arr[N]; struct node { int a, b, id; } qq[N]; long long ans[N], dp[N]; bool cmp(node a, node b) { if (a.b != b.b) return a.b > b.b; return a.a < b.a; } int main() { scanf( %d , &n); blo = sqrt(n); for (int i = 1; i <= n; i++) scanf( %d , &arr[i]); scanf( %d , &q); for (int i = 1; i <= q; i++) { scanf( %d%d , &qq[i].a, &qq[i].b); qq[i].id = i; } sort(qq + 1, qq + q + 1, cmp); int n_b = -1; for (int i = 1; i <= q; i++) { node nn = qq[i]; if (nn.b >= blo) { for (int i = nn.a; i <= n; i += nn.b) ans[nn.id] += arr[i]; } else { if (nn.b != n_b || dp[nn.a] == 0) { for (int j = n; j >= 1; j--) { if (j + nn.b > n) dp[j] = arr[j]; else dp[j] = dp[j + nn.b] + arr[j]; } n_b = nn.b; } ans[nn.id] = dp[nn.a]; } } for (int i = 1; i <= q; i++) { printf( %I64d n , ans[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int stones, counter = 0; string colours; cin >> stones; cin >> colours; for (int i = 0; i < stones - 1; i++) { if (colours[i] == colours[i + 1]) { counter++; } } cout << counter << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; bool possible(int smaller, int bigger) { return (bigger <= smaller * 3 + 1); } int main() { ios::sync_with_stdio(false); int q; cin >> q; for (int i = 0; i < q; ++i) { int b, w; cin >> b >> w; if ((b < w && !possible(b, w)) || (w < b && !possible(w, b))) { cout << NO << endl; continue; } cout << YES << endl; int offset = (b < w) ? 1 : 0; if (b < w) swap(b, w); int column = 1; while (w + 1 < b) { cout << column << << (2 + offset) << endl; column++; cout << column << << (1 + offset) << endl; cout << column << << (2 + offset) << endl; cout << column << << (3 + offset) << endl; column++; w -= 1; b -= 3; } if (w < b) { cout << column << << (2 + offset) << endl; b--; column++; } for (; 0 < b; b--) { cout << column << << (1 + offset) << endl; cout << column << << (2 + offset) << endl; column++; } } } |
#include <bits/stdc++.h> using namespace std; int main() { string s; int man = 0, ans = 0, n, m; int a[1000]; while (cin >> n >> m) { ans = 0; if (n > m) { printf( %d n , n - m); } else { while (n < m) { if (m % 2 != 0) { m++; ans++; } m /= 2; ans++; } ans += n - m; printf( %d n , ans); } } } |
#include <bits/stdc++.h> using namespace std; const double EPS = 1e-9; const double pi = acos(-1); const long long int INF = 1e18; const int inf = 1e9; const int MOD = 1e9 + 7; const int nax = 1000000 + 10; int n, arr[nax]; int main() { ios::sync_with_stdio(0); cin >> n; if (n % 10 == 0) { cout << n; return 0; } if (n <= 5) cout << 0; else { int div = (n + 10 - 1) / 10; int ans = 10 * div; int rem = (n % 10); if (rem <= 5) ans -= 10; cout << ans; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; scanf( %d %d , &n, &k); if (k > (n * n + 1) / 2) { printf( NO ); return 0; } int i, j, count = 0; printf( YES n ); for (i = 0; i < n; i++) { for (j = 0; j < n; j++) { if ((i + j) % 2 == 0 and count < k) { count++; printf( L ); } else printf( S ); } printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 36; long long dp[maxn][maxn]; int main() { long long n, h; cin >> n >> h; for (long long i = 0; i <= n; i++) dp[0][i] = 1; for (long long i = 1; i <= n; i++) for (long long j = 1; j <= n; j++) for (long long k = 0; k < i; k++) { dp[i][j] += dp[k][j - 1] * dp[i - 1 - k][j - 1]; } cout << dp[n][n] - dp[n][h - 1] << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { string ans1, ans2; string s1, s2, ss1, ss2; int a, b; cin >> s1 >> s2; a = atoi(s1.c_str()) + atoi(s2.c_str()); stringstream ss; ss << a; ss >> ans1; for (int i = 0; i < s1.length(); ++i) { if (s1[i] != 0 ) { ss1 += s1[i]; } } for (int i = 0; i < ans1.length(); ++i) { if (ans1[i] != 0 ) { ans2 += ans1[i]; } } for (int i = 0; i < s2.length(); ++i) { if (s2[i] != 0 ) { ss2 += s2[i]; } } b = atoi(ss1.c_str()) + atoi(ss2.c_str()); stringstream sss; sss << b; sss >> ans1; if (ans1 == ans2) { cout << YES ; } else cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; unsigned long long mod, dp[18][250005]; unsigned long long fac[250005], inv[250005]; unsigned long long n, k; inline unsigned long long qpow(unsigned long long a, unsigned long long b) { unsigned long long res = 1ll, tp = a; while (b) { if (b & 1ll) { res *= tp; res %= mod; } tp *= tp; tp %= mod; b >>= 1ll; } return res; } inline unsigned long long cal(int a, int b) { return (((fac[a] * inv[b]) % mod) * inv[a - b]) % mod; } inline unsigned long long calc() { int i, j, l; fac[0] = 1ll; for (i = 1; i <= n; i++) fac[i] = fac[i - 1] * ((unsigned long long)(i)) % mod; inv[n] = qpow(fac[n], mod - 2ll); for (i = n - 1; i >= 0; i--) inv[i] = inv[i + 1] * ((unsigned long long)(i + 1)) % mod; for (i = 1; i <= n; i++) { dp[1][i] = inv[i]; } unsigned long long ans = dp[1][n] * cal(k, 1) % mod; int t = min(17, ((int)(k))); for (i = 2; i <= t; i++) { for (j = 1; j <= n; j++) { if ((j & n) != j) { continue; } int cnt = 0; for (l = j; l; l = (l - 1) & j) { dp[i][j] += dp[i - 1][j ^ l] * inv[l]; cnt++; if (cnt == 18) { cnt = 0; dp[i][j] %= mod; } } dp[i][j] %= mod; } ans += dp[i][n] * cal(k, i); ans %= mod; } ans *= fac[n]; ans %= mod; return ans; } int main() { cin >> n >> k >> mod; unsigned long long ans = qpow(k, n); if (n & 1) { cout << ans << endl; return 0; } ans = (ans - calc() + mod) % mod; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long n; static const long long maxn = 2005; long long M[maxn][maxn]; long long MyM[maxn][maxn]; vector<vector<long long>*> graph; long long dsu[maxn]; bool PreCheck() { for (long long i = 0; i < n; i++) { if (M[i][i] != 0) return false; } for (long long i = 0; i < n; i++) for (long long j = 0; j < n; j++) { if (M[i][j] != M[j][i]) return false; } return true; } long long edge_count = 0; struct edge { long long u; long long v; long long d; bool operator<(const edge& rhs) const { return d < rhs.d; } }; long long dsu_root(long long i) { while (dsu[i] != i) { dsu[i] = dsu[dsu[i]]; i = dsu[i]; } return i; } bool dsu_connected(long long i, long long j) { return dsu_root(i) == dsu_root(j); } void dsu_join(long long i, long long j) { long long r = rand() % 2; if (r) dsu[dsu_root(i)] = j; else dsu[dsu_root(j)] = i; } void init() { for (long long i = 0; i < n; i++) { dsu[i] = i; vector<long long>* v = new vector<long long>(); graph.push_back(v); } } bool dfs_visited[maxn]; void dfs(long long i, long long root, long long curr) { if (dfs_visited[i]) return; dfs_visited[i] = true; for (auto it : *graph[i]) { if (dfs_visited[it]) continue; else { long long d = curr + M[i][it]; MyM[root][it] = d; MyM[it][root] = d; dfs(it, root, d); } } } bool FinalCheck() { for (long long i = 1; i < n; i++) { if (!dsu_connected(i, 0)) return false; } for (long long i = 0; i < n; i++) for (long long j = 0; j < i; j++) { if (M[i][j] != MyM[i][j]) return false; } return true; } int main() { ios_base::sync_with_stdio(0); cin >> n; init(); for (long long i = 0; i < n; i++) for (long long j = 0; j < n; j++) { cin >> M[i][j]; MyM[i][j] = 0; } if (!PreCheck()) { cout << NO << endl; return 0; } vector<edge> edges; for (long long i = 0; i < n; i++) for (long long j = 0; j < i; j++) { edge curr; curr.u = i; curr.v = j; curr.d = M[i][j]; if (curr.d > 0) edges.push_back(curr); } sort(edges.begin(), edges.end()); for (auto it : edges) { if (!dsu_connected(it.u, it.v)) { edge_count++; graph[it.u]->push_back(it.v); graph[it.v]->push_back(it.u); dsu_join(it.u, it.v); } } if (edge_count != n - 1) { cout << NO << endl; return 0; } for (long long i = 0; i < n; i++) { memset(dfs_visited, 0, sizeof(dfs_visited)); dfs(i, i, 0); } if (FinalCheck()) { cout << YES << endl; } else { cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX_N = 200005; int l[MAX_N], r[MAX_N]; int a[MAX_N]; int n; int F[MAX_N]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= n; i++) { l[i] = i; while (a[l[i] - 1] >= a[i]) l[i] = l[l[i] - 1]; } for (int i = n; i >= 1; i--) { r[i] = i; while (a[r[i] + 1] >= a[i]) r[i] = r[r[i] + 1]; } for (int i = 1; i <= n; i++) F[r[i] - l[i] + 1] = max(F[r[i] - l[i] + 1], a[i]); for (int i = n; i >= 1; i--) F[i] = max(F[i], F[i + 1]); for (int i = 1; i <= n; i++) printf( %d , F[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; namespace FFT { const int N = 20; const int MAXN = (1 << N); class cmplx { private: double x, y; public: cmplx() : x(0.0), y(0.0) {} cmplx(double a) : x(a), y(0.0) {} cmplx(double a, double b) : x(a), y(b) {} double get_real() { return this->x; } double get_img() { return this->y; } cmplx conj() { return cmplx(this->x, -(this->y)); } cmplx operator=(const cmplx& a) { this->x = a.x; this->y = a.y; return *this; } cmplx operator+(const cmplx& b) { return cmplx(this->x + b.x, this->y + b.y); } cmplx operator-(const cmplx& b) { return cmplx(this->x - b.x, this->y - b.y); } cmplx operator*(const double& num) { return cmplx(this->x * num, this->y * num); } cmplx operator/(const double& num) { return cmplx(this->x / num, this->y / num); } cmplx operator*(const cmplx& b) { return cmplx(this->x * b.x - this->y * b.y, this->y * b.x + this->x * b.y); } cmplx operator/(const cmplx& b) { cmplx temp(b.x, -b.y); cmplx n = (*this) * temp; return n / (b.x * b.x + b.y * b.y); } }; cmplx w[MAXN]; cmplx f1[MAXN]; int rev[MAXN]; void ReserveBits(int k) { static int rk = -1, lim; if (k == rk) return; rk = k, lim = 1 << k; for (int i = 1; i <= lim; ++i) { int j = rev[i - 1], t = k - 1; while (t >= 0 && ((j >> t) & 1)) { j ^= 1 << t; --t; } if (t >= 0) { j ^= 1 << t; --t; } rev[i] = j; } } void fft(cmplx* a, int k) { ReserveBits(k); int n = 1 << k; for (int i = 0; i < n; ++i) if (rev[i] > i) swap(a[i], a[rev[i]]); for (int l = 2, m = 1; l <= n; l += l, m += m) { if (w[m].get_real() == 0 && w[m].get_img() == 0) { double angle = M_PI / m; cmplx ww(cos(angle), sin(angle)); if (m > 1) { for (int j = 0; j < m; ++j) { if (j & 1) w[m + j] = w[(m + j) / 2] * ww; else w[m + j] = w[(m + j) / 2]; } } else w[m] = cmplx(1, 0); } for (int i = 0; i < n; i += l) { for (int j = 0; j < m; ++j) { cmplx v = a[i + j], u = a[i + j + m] * w[m + j]; a[i + j] = v + u; a[i + j + m] = v - u; } } } } vector<long long> mul(vector<long long> a, vector<long long> b) { int k = 1; while ((1 << k) < (a.size() + b.size())) ++k; int n = (1 << k); for (int i = 0; i < n; ++i) f1[i] = cmplx(0, 0); for (int i = 0; i < a.size(); ++i) f1[i] = f1[i] + cmplx(a[i], 0); for (int i = 0; i < b.size(); ++i) f1[i] = f1[i] + cmplx(0, b[i]); fft(f1, k); for (int i = 0; i <= n / 2; ++i) { cmplx p = f1[i] + f1[(n - i) % n].conj(); cmplx _q = f1[(n - i) % n] - f1[i].conj(); cmplx q(_q.get_img(), _q.get_real()); f1[i] = (p * q) * 0.25; if (i > 0) f1[(n - i)] = f1[i].conj(); } for (int i = 0; i < n; ++i) f1[i] = f1[i].conj(); fft(f1, k); vector<long long> ans(a.size() + b.size() - 1); for (int i = 0; i < ans.size(); ++i) { ans[i] = (long long)(f1[i].get_real() / n + 0.5); } return ans; } }; // namespace FFT int buff = 2e5 + 5; int main() { ios_base::sync_with_stdio(false); long long int n, x; long long int an[200005]; cin >> n >> x; long long int nn = 2 * buff + 5; vector<long long int> v(nn, 0); vector<long long int> v1(nn, 0); v[0] = 1; v1[buff] = 1; long long int cool = 0; for (int i = 0; i <= n - 1; i++) { long long int xx; cin >> xx; if (xx < x) cool++; an[0] += v[cool]; v[cool]++; v1[buff - cool]++; } vector<long long int> res = FFT::mul(v, v1); int sz = res.size(); an[0] = (n * (n + 1)) / 2; for (int i = buff + 1; i <= buff + n; i++) { an[i - buff] = res[i]; an[0] -= res[i]; } for (int i = 0; i <= n; i++) { cout << an[i]; cout << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int h; long long n, l = 1, r, rpta = 0, aux2; cin >> h >> n; r = 1LL << h; aux2 = r; int aux = 1; while (r > l) { rpta++; long long m = (l + r) / 2; if (n <= m && aux == 0) { rpta += aux2 - 1; } else if (n > m && aux == 1) { rpta += aux2 - 1; } else aux ^= 1; if (n <= m) r = m; else l = m + 1; aux2 >>= 1; } cout << rpta << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MaxN = (int)1e3 + 10; int a[MaxN][MaxN]; int main() { int n, i, m, k, x, y, j; char c; scanf( %d%d%d n , &n, &m, &k); for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) scanf( %d , &a[i][j]); scanf( n ); for (i = 1; i <= m; i++) a[0][i] = i; for (i = 1; i <= n; i++) a[i][0] = i; for (i = 1; i <= k; i++) { scanf( %c , &c); if (c == c ) { scanf( %d%d n , &x, &y); swap(a[0][x], a[0][y]); } if (c == r ) { scanf( %d%d n , &x, &y); swap(a[x][0], a[y][0]); } if (c == g ) { scanf( %d%d n , &x, &y); printf( %d n , a[a[x][0]][a[0][y]]); } } cin.get(); cin.get(); } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; const int M = 1e4 + 10; const int MOD = 1e9 + 7; const int inf = 1e9; const double pi = acos(-1.0); const double eps = 1e-6; int dx[] = {0, -1, 0, 1}; int dy[] = {1, 0, -1, 0}; int n, m; int a[101]; int sum[102]; int l, r; int res; int main() { cin >> n >> m; sum[0] = 0; for (int i = 0; i < n; i++) { cin >> a[i]; sum[i + 1] += sum[i] + a[i]; } for (int i = 0; i < m; i++) { cin >> l >> r; int v = sum[r] - sum[l - 1]; if (v > 0) res += v; } cout << res; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> inline void read(T& s) { s = 0; int f = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { s = s * 10 + c - 0 ; c = getchar(); } s *= f; } void exkmp(char* s, char* t, int n, int m, int* f, int* g) { int mx = 0; f[1] = n; for (int i = 2; i <= m; i++) { f[i] = max(0, min(mx + f[mx] - i, f[i - mx + 1])); while (i + f[i] <= m && t[i + f[i]] == t[f[i] + 1]) f[i]++; if (i + f[i] > mx + f[mx]) mx = i; } mx = 0; for (int i = 1; i <= n; i++) { g[i] = max(0, min(f[i - mx + 1], mx + g[mx] - i)); while (i + g[i] <= n && s[i + g[i]] == t[g[i] + 1]) g[i]++; if (i + g[i] > mx + g[mx]) mx = i; } } int n, m; char a[1000005], b[1000005], at[1000005]; int f[1000005], g1[1000005], g2[1000005]; int mxw[1000005]; int main() { n = m = 1; char c = getchar(); while (c != n ) { a[n++] = c; c = getchar(); } c = getchar(); while (c != n ) { b[m++] = c; c = getchar(); } n--; m--; if (n != m) { printf( -1 -1 n ); return 0; } if (a[1] != b[n]) { printf( -1 -1 n ); return 0; } int mxi = 1; for (mxi; mxi < n && a[mxi + 1] == b[n - mxi]; mxi++) ; for (int i = 1; i <= m; i++) at[i] = a[m + 1 - i]; exkmp(a, b, n, m, f, g1); exkmp(b, at, n, m, f, g2); memset(mxw, 23, sizeof(mxw)); for (int i = 1; i <= n; i++) mxw[1 + n - g2[i] - i] = min(mxw[1 + n - g2[i] - i], i); for (int i = 1; i <= n; i++) mxw[i] = min(mxw[i], mxw[i - 1]); for (int i = mxi; i >= 1; i--) { int mx = min(g1[i + 1] + 1, n - i); int gg = mxw[i]; if (gg > mx) continue; printf( %d %d n , i - 1, gg + i - 1); return 0; } printf( -1 -1 n ); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> inline void smin(T &a, U b) { if (a > b) a = b; } template <typename T, typename U> inline void smax(T &a, U b) { if (a < b) a = b; } int n, i, j, o, ans, cnt, num; double a, b, c, d, first[1010], second[1010], p, q, r; pair<pair<double, double>, double> m[1010 * 1010]; bool cmp(pair<pair<double, double>, double> a, pair<pair<double, double>, double> b) { if (fabs(a.first.first - b.first.first) > 1e-8) return a.first.first < b.first.first; if (fabs(a.first.second - b.first.second) > 1e-8) return a.first.second < b.first.second; return a.second < b.second; } int main() { scanf( %d , &n); for (i = 0; i < n; i++) { scanf( %lf %lf %lf %lf , &a, &b, &c, &d); p = a / b, q = c / d; r = p * p + q * q; first[i] = p / r, second[i] = q / r; } for (i = 0; i < n; i++) { for (j = i + 1; j < n; j++) { p = first[i] + first[j], q = second[i] + second[j]; m[o++] = pair<pair<double, double>, double>( pair<double, double>(p, q), fabs(first[i] - first[j]) < 1e-8 ? 0x3f3f3f3f : (second[i] - second[j]) / (first[i] - first[j])); } } sort(m, m + o, cmp); for (i = 0; i < o; i = j) { cnt = num = 1; for (j = i + 1; j < o; j++) { if (fabs(m[j].first.first - m[j - 1].first.first) > 1e-8) break; if (fabs(m[j].first.second - m[j - 1].first.second) > 1e-8) break; if (fabs(m[j].second - m[j - 1].second) > 1e-8) { cnt = (long long)cnt * (num + 1) % 1000000007; num = 1; } else num++; } cnt = (long long)cnt * (num + 1) % 1000000007; ans = (ans + cnt) % 1000000007; ans = (ans + 1000000007 - (j - i + 1)) % 1000000007; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> int main() { long n; scanf( %ld , &n); std::vector<long> a(n); for (long p = 0; p < n; p++) { scanf( %ld , &a[p]); } sort(a.begin(), a.end()); long cur(0); for (long p = 0; p < n; p++) { if (a[p] >= cur + 1) { ++cur; } } printf( %ld n , cur); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int q, w, e, r, t = 0, y = 0; bool s[100001], d[100001]; char a[2]; cin >> q >> w; for (e = 1; e <= q; e++) { s[e] = 1; d[e] = 0; } bool c = 1, v; for (e = 0; e < w; e++) { scanf( %s%d , a, &r); if (a[0] == + ) { if ((t == 0) || (t == r)) t = r; else s[r] = 0; d[r] = 1; if ((t != r) && (d[t] == 0)) s[t] = 0; y++; } else { if (t == 0) t = r; if ((t != r) && (d[r] == 0)) { s[t] = 0; t = r; } if (d[r]) { d[r] = 0; y--; } if (y > 0) s[r] = 0; } } e = 0; for (w = 1; w <= q; w++) if (s[w]) e++; cout << e << n ; for (w = 1; w <= q; w++) if (s[w]) printf( %d , w); return 0; } |
#include <bits/stdc++.h> using namespace std; const long double eps = 1e-9; const int inf = (1 << 30) - 1; const long long inf64 = ((long long)1 << 62) - 1; const long double pi = acos(-1); template <class T> T sqr(T x) { return x * x; } template <class T> T abs(T x) { return x < 0 ? -x : x; } template <class T> vector<T> ReadVector(int n) { vector<T> a(n); for (int i = 0; i < n; ++i) { cin >> a[i]; } return a; } template <class T> void WriteVector(const vector<T>& a) { for (int i = 0; i < ((int)(a).size()); ++i) { cout << a[i] << (i + 1 < ((int)(a).size()) ? : n ); } } void Solve() { long long x; cin >> x; vector<long long> a; a.push_back(x); vector<string> res; while (a[0] != 1) { long long val = -1; for (int i = 0; i < ((int)(a).size()); ++i) { for (int j = 0; j <= i; ++j) { long long tmp = a[i] + a[j]; val = tmp; for (int k = ((int)(a).size()) - 1; k >= 0; --k) { tmp = min(tmp, tmp ^ a[k]); } if (tmp > 0) { res.push_back(to_string(a[i]) + + + to_string(a[j])); break; } val = -1; } if (val > 0) { break; } } for (int i = ((int)(a).size()) - 1; i >= 0; --i) { if ((val ^ a[i]) < val) { res.push_back(to_string(a[i]) + ^ + to_string(val)); val ^= a[i]; } } for (int i = 0; i < ((int)(a).size()); ++i) { if ((a[i] ^ val) < a[i]) { res.push_back(to_string(a[i]) + ^ + to_string(val)); a[i] ^= val; } } a.push_back(val); sort((a).begin(), (a).end()); } cout << ((int)(res).size()) << n ; for (int i = 0; i < ((int)(res).size()); ++i) { cout << res[i] << n ; } } int main() { ios_base::sync_with_stdio(0); std::cin.tie(nullptr); int tc = 1; for (int ti = 0; ti < tc; ++ti) { Solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; char ara[100005]; map<int, int> mp; int main() { int t, test; long long a, b, c, n; char ch; double d; gets(ara); t = strlen(ara); int aa = ara[t - 1] - 0 ; int bb = ara[t - 2] - 0 ; aa += (bb * 10); if (aa % 4 == 0) { cout << 4 n ; } else { cout << 0 n ; } return 0; } |
#include<cstdio> #include<vector> #include<map> #include<set> #include<algorithm> #include<cstdlib> #include<cstring> #include<cmath> #include<string> #include<deque> #include<queue> using namespace std; #define db double #define ll long long int T; struct node{ ll x,y; }p[10]; int u[10], u2[10]; ll x[10],y[10],s[10], u3[10]; ll ans; void c1(ll px, ll py) { ll now = 0; now += abs(px - x[u2[1]]) + abs(py - y[u2[1]]); now += abs(px - x[u2[3]]); now += abs(py - y[u2[2]]); s[1] = u3[1] * (x[u2[2]] - px); s[2] = u3[2] * (y[u2[3]] - py); s[3] = u3[3] * (x[u2[4]] - px); s[4] = u3[4] * (y[u2[4]] - py); sort(s+1, s+5); for(int i=1; i<=4; i++) now+=abs(s[i] - s[2]); // if (now==4){ // printf( %lld %lld n , px, py); // for(int i=1; i<=4; i++) printf( %d ,u2[i]); // printf( n ); // for(int i=1; i<=4; i++) printf( %lld %lld n , x[i], y[i]); // printf( n ); // } ans = min(ans, now); } int main() { scanf( %d ,&T); for(;T--;) { int n = 4; ans = 0; for(int i=1; i<=n; i++) { scanf( %lld %lld ,&p[i].x, &p[i].y); ans += p[i].x + p[i].y; u[i] = i; } for(;1;) { for(int i=1; i<=n; i++) x[i] = p[u[i]].x, y[i] = p[u[i]].y; for(int i=1; i<=n; i++) u2[i] = i, u3[i] = 1; c1(x[1], y[1]); c1(x[1], y[2]); c1(x[3], y[1]); c1(x[3], y[2]); u2[1] = 2; u2[2] = 1; u2[3] = 4; u2[4] = 3; u3[1] = u3[3] = -1; c1(x[2], y[1]); c1(x[2], y[2]); c1(x[4], y[1]); c1(x[4], y[2]); u2[1] = 3; u2[2] = 4; u2[3] = 1; u2[4] = 2; u3[1] = 1; u3[2] = -1; u3[3] = 1; u3[4] = -1; c1(x[1], y[3]); c1(x[1], y[4]); c1(x[3], y[3]); c1(x[3], y[4]); u2[1] = 4; u2[2] = 3; u2[3] = 2; u2[4] = 1; u3[1] = u3[3] = -1; u3[2] = u3[4] = -1; c1(x[2], y[3]); c1(x[2], y[4]); c1(x[4], y[3]); c1(x[4], y[4]); if (!next_permutation(u+1, u+1+n)) break; } printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; int ans; int a[2002], b[2002]; int le; int p; int ssearch(int x) { int maxd = 0; for (int i = 1; i <= n; i++) { int z = abs(a[i] - b[x - le + i]) + abs(b[x - le + i] - p); if (z > maxd) maxd = z; } return maxd; } int main() { int k; scanf( %d%d%d , &n, &k, &p); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); } for (int i = 1; i <= k; i++) { scanf( %d , &b[i]); } sort(a + 1, a + 1 + n); sort(b + 1, b + 1 + k); le = n; for (int i = 1; i <= n; i++) if (a[i] >= p) { le = i - 1; break; } ans = 2147483647; for (int i = le; i <= k + le - n; i++) { int y = ssearch(i); if (y < ans) ans = y; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> #define ull unsigned long long #define ll long long #define il inline #define db double #define ls rt << 1 #define rs rt << 1 | 1 #define pb push_back #define mp make_pair #define pii pair<int, int> #define X first #define Y second #define pcc pair<char, char> #define vi vector<int> #define vl vector<ll> #define rep(i, x, y) for(int i = x; i <= y; i ++) #define rrep(i, x, y) for(int i = x; i >= y; i --) #define rep0(i, n) for(int i = 0; i < (n); i ++) #define per0(i, n) for(int i = (n) - 1; i >= 0; i --) #define ept 1e-9 #define sz(x) (x).size() #define All(x) (x).begin(), (x).end() using namespace std; inline int read() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } inline ll read1() { ll x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } #define int long long const int N = 50010; const int mod = 998244353; int n, m; int d[N][25]; void add(int &a, int b) {a += b; if (a >= mod) a -= mod;} void dec(int &a, int b) {a -= b; if (a < 0) a += mod;} int pow_mod(int a, int i) { int s = 1; while (i) { if (i & 1) s = 1LL * s * a % mod; a = 1LL * a * a % mod; i >>= 1; } return s; } signed main() { n = read(); m = read(); rep0(i, n) rep0(j, m) d[j][i] = read(); rep0(i, m) sort(d[i], d[i] + n); int ans = m; int jc = 1; rep(i, 1, n) jc = 1LL * jc * i % mod; jc = pow_mod(jc, mod - 2); rep0(i, m) { int res = 1; rrep(j, n - 1, 0) res = 1LL * res * max(0LL, d[i][j] - (j + 1)) % mod; dec(ans, 1LL * res * jc % mod); } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int count1(int x) { int ans = 0; while (x) { ans += x & 1; x >>= 1; } return ans; } int main() { int n, p; cin >> n >> p; for (int x = 0; x * (p + 1) <= n; x++) if (count1(n - x * p) <= x) { cout << x; return 0; } cout << -1; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ii = pair<int, int>; using vi = vector<int>; using vll = vector<ll>; using vii = vector<ii>; const ll MOD = 998244353; const ll INF = 1e18 + 9; const int MAXN = 1000006; const int MAXC = 20; int n, arr[MAXN], num[MAXC]; ll dist[MAXC][MAXC], mem[1 << MAXC], realDist[1 << MAXC][MAXC]; ll solve(int p) { if (mem[p] != -1) return mem[p]; mem[p] = INF; for (int i = 0; i < MAXC; i++) { if ((p & (1 << i)) == 0) { mem[p] = min(mem[p], solve(p | (1 << i)) + realDist[p][i]); } } return mem[p]; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; for (int i = 0; i < n; i++) { cin >> arr[i]; arr[i]--; for (int j = 0; j < MAXC; j++) { dist[arr[i]][j] += num[j]; } num[arr[i]]++; } int p = 0; for (int i = 0; i < (1 << MAXC); i++) { for (int j = 0; j < MAXC; j++) { for (int k = 0; k < MAXC; k++) { if (i & (1 << k)) realDist[i][j] += dist[k][j]; } } } memset(mem, -1, sizeof(mem)); ll ans = INF; mem[(1 << MAXC) - 1] = 0; for (int i = 0; i < MAXC; i++) { ans = min(ans, solve(p | (1 << i))); } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; long long a[3000], b[3000]; map<long long, pair<long long, long long> > mymap; pair<long long, long long> p1, p2; int main() { std::ios::sync_with_stdio(false); long long n, m, sa = 0, sb = 0; p1.first = p1.second = p2.first = p2.second = -1; mymap.clear(); cin >> n; for (long long i = (long long)(1); i <= (long long)(n); i++) { cin >> a[i]; sa += a[i]; } cin >> m; for (long long i = (long long)(1); i <= (long long)(m); i++) { cin >> b[i]; sb += b[i]; } long long curdiff = abs(sa - sb); for (long long i = (long long)(1); i <= (long long)(n); i++) { for (long long j = (long long)(1); j <= (long long)(m); j++) { long long tmpsa, tmpsb; tmpsa = sa - a[i] + b[j]; tmpsb = sb + a[i] - b[j]; if (abs(tmpsa - tmpsb) < curdiff) { curdiff = abs(tmpsa - tmpsb); p1.first = i; p1.second = j; } } } for (long long i = (long long)(1); i <= (long long)(n - 1); i++) { for (long long j = (long long)(i + 1); j <= (long long)(n); j++) { long long val = a[i] + a[j]; val = val * 2ll; mymap[val] = make_pair(i, j); } } map<long long, pair<long long, long long> >::iterator it; for (long long i = (long long)(1); i <= (long long)(m - 1); i++) { for (long long j = (long long)(i + 1); j <= (long long)(m); j++) { long long val = sa - sb + 2 * (b[i] + b[j]); it = mymap.lower_bound(val); if (it != mymap.begin()) it--; if (it == mymap.end()) continue; long long temp = val; temp = abs(val - it->first); if (temp < curdiff) { curdiff = temp; p1.first = (it->second).first; p1.second = i; p2.first = (it->second).second; p2.second = j; } it++; if (it != mymap.end()) { temp = abs(val - it->first); if (temp < curdiff) { curdiff = temp; p1.first = (it->second).first; p1.second = i; p2.first = (it->second).second; p2.second = j; } } } } cout << curdiff << endl; if (p2.first != -1) { cout << 2 << endl; cout << p1.first << << p1.second << endl; cout << p2.first << << p2.second << endl; } else if (p1.first != -1) { cout << 1 << endl; cout << p1.first << << p1.second << endl; } else { cout << 0 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; scanf( %d , &t); while (t--) { int n; scanf( %d , &n); vector<int> vt; while (n) { int lst = -1; for (int i = 2;; i++) { if (1ll * i * (i - 1) / 2 <= n) lst = i; else break; } vt.push_back(lst); n -= 1ll * lst * (lst - 1) / 2; } int maxi = vt[0]; reverse(vt.begin(), vt.end()); printf( 1 ); int x = 0, sum = 0; for (int i = 1; i <= maxi; i++) { printf( 3 ); while (x < vt.size() && i == vt[x]) { printf( 7 ); x++; } } printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2000 + 50; int n, cnt[maxn], a[maxn]; vector<int> q; int main() { cin >> n; int sign = 0; for (int i = 1; i < n; i++) { int x, y; cin >> x >> y; if (x > y) swap(x, y); if (y != n) sign = 1; cnt[x]++; a[i] = x; } sort(a + 1, a + n); for (int i = 1; i < n; i++) { if (a[i] < i) { sign = 1; } } if (sign) { cout << NO << endl; return 0; } cout << YES << endl; for (int i = 1; i < n; i++) { if (cnt[i]) { q.push_back(i); } } int opt = 1; for (int x = 0; x < q.size(); x++) { int pre = n; for (int i = 1; i <= cnt[q[x]] - 1; i++) { while (cnt[opt]) opt++; cout << pre << << opt << endl; pre = opt; opt++; } cout << pre << << q[x] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int mxn = 0; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int t = 1; cin >> t; while (t--) { long long int i, j, k, n, m; string s; cin >> s; n = s.length(); string a, b, c; i = -1; j = n; while ((i + 1) < (j - 1) && s[i + 1] == s[j - 1]) { a += s[i + 1]; i++, j--; } c = a; reverse(c.begin(), c.end()); long long int pr = -1, sf = -1; for (long long int i1 = i + 1; i1 < j; i1++) { long long int st = i + 1, en = i1; while (st <= en && s[st] == s[en]) st++, en--; if (st > en) pr = i1; } for (long long int i1 = i + 1; i1 < j; i1++) { long long int st = i1, en = j - 1; while (st <= en && s[st] == s[en]) st++, en--; if (st > en) { sf = i1; break; } } if (pr != -1) { if (pr - i > j - sf) { for (long long int i1 = i + 1; i1 <= pr; i1++) b += s[i1]; } else { for (long long int i1 = sf; i1 < j; i1++) b += s[i1]; } } cout << a << b << c << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 650; int kd[MAXN], edges[100010][2]; int idA[MAXN], idB[MAXN]; int g[MAXN][MAXN]; int P; inline int advPow(int a, int b) { int ret = 1; while (b) { if (b & 1) ret = (long long)ret * a % P; a = (long long)a * a % P; b >>= 1; } return ret; } inline int inverse(int a) { return advPow(a, P - 2); } int gauss(int N) { int ret = 1; for (int col = 1; col <= N; col++) { int pos = 0; for (int row = col; row <= N; row++) if (g[row][col]) { pos = row; break; } if (pos && pos != col) { for (int i = 1; i <= N; i++) swap(g[pos][i], g[col][i]); ret *= -1; } if (pos == 0) return 0; int inv = inverse(g[col][col]); for (int row = 1; row <= N; row++) { if (!g[row][col] || row == col) continue; int cur = (long long)g[row][col] * inv % P; for (int i = col; i <= N; i++) g[row][i] = (g[row][i] - (long long)g[col][i] * cur % P + P) % P; } } for (int i = 1; i <= N; i++) ret = (long long)ret * g[i][i] % P; return (ret + P) % P; } struct Node { int v, nxt; } d[100010]; int head[MAXN], etot; inline void addEdge(int a, int b) { etot++; d[etot].v = b; d[etot].nxt = head[a]; head[a] = etot; } int rin[MAXN], rout[MAXN]; int plans[MAXN][MAXN]; queue<int> que; int main() { int N, M; scanf( %d%d%d , &N, &M, &P); for (int i = 1; i <= M; i++) { int a, b; scanf( %d%d , &a, &b); if (a == b) continue; rin[b]++, rout[a]++; addEdge(a, b); } for (int i = 1; i <= N; i++) if (!rin[i]) que.push(i); for (int i = 1; i <= N; i++) plans[i][i] = 1; int cnt1 = 0, cnt2 = 0; for (int i = 1; i <= N; i++) if (!rin[i]) idA[++cnt1] = i; for (int i = 1; i <= N; i++) if (!rout[i]) idB[++cnt2] = i; if (cnt1 != cnt2) { puts( 0 ); return 0; } while (!que.empty()) { int u = que.front(); que.pop(); for (int e = head[u]; e; e = d[e].nxt) { rin[d[e].v]--; for (int i = 1; i <= N; i++) (plans[i][d[e].v] += plans[i][u]) %= P; if (!rin[d[e].v]) que.push(d[e].v); } } for (int i = 1; i <= cnt1; i++) for (int j = 1; j <= cnt2; j++) g[i][j] = plans[idA[i]][idB[j]]; printf( %d n , gauss(cnt1)); } |
#include <bits/stdc++.h> using namespace std; int main() { double r, x, y, x1, y1; cin >> r >> x >> y >> x1 >> y1; double dist = sqrt(pow(x - x1, 2) + pow(y - y1, 2)); double ans = dist / (2 * r); cout << ceil(ans) << endl; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 3e5; int a[MAX] = {}; int main() { int t; cin >> t; while (t--) { char c; long long s; cin >> c >> s; long long a1 = 0; for (int i = 0; i < 18; i++) { a1 = a1 * 2 + s % 2; s /= 10; } if (c == + ) { a[a1]++; } else if (c == - ) { a[a1]--; } else { cout << a[a1] << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> l[100007]; int parent[100007]; int color[100007]; int k; int p; int dfs(int u, int c) { int sz = l[u].size(); { for (int i = 0; i < sz; i++) { if (color[u] - color[l[u][i]] >= k && color[l[u][i]] != 0) { parent[l[u][i]] = u; return u; } else if (color[l[u][i]] == 0) { color[l[u][i]] = c + 2; parent[l[u][i]] = u; return dfs(l[u][i], c + 1); } } } } int main() { int n, m; cin >> n >> m >> k; int a, b; for (int i = 0; i < m; i++) { cin >> a >> b; l[a].push_back(b); l[b].push_back(a); } color[1] = 1; int u = dfs(1, 0); int v = parent[u]; int cycle = 1; while (v != u) { v = parent[v]; cycle++; } cout << cycle << endl; cout << u << ; v = parent[u]; while (v != u) { cout << v << ; v = parent[v]; } } |
#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; int n, m, k; int p[40]; struct query { int l, r, x; }; struct query q[500005]; int max0[500005], max1[500005]; long long dp[500005]; long long s[500005]; void solve() { cin >> n >> k >> m; p[0] = 1; for (int i = 1; i < 40; i++) p[i] = (p[i - 1] << 1); n++; for (int(i) = (1); (i) <= (m); ++(i)) cin >> q[i].l >> q[i].r >> q[i].x; m++; q[m].l = n; q[m].r = n; q[m].x = 0; long long ans = 1; for (int(j) = (0); (j) <= (k - 1); ++(j)) { for (int(i) = (0); (i) <= (n); ++(i)) { max0[i] = max1[i] = -1; } for (int(i) = (1); (i) <= (m); ++(i)) { if (q[i].x & p[j]) { if (max1[q[i].l] < q[i].r) max1[q[i].l] = q[i].r; } else { if (max0[q[i].r] < q[i].l) max0[q[i].r] = q[i].l; } } for (int i = 0; i <= n; i++) s[i] = 0; int L0 = 0; int R1 = -1; dp[0] = 1; s[0] = 1; for (int i = 1; i <= n; i++) { R1 = max(R1, max1[i]); if (i <= R1) { dp[i] = 0; } else { dp[i] = (L0 == 0 ? s[i - 1] : s[i - 1] - s[L0 - 1]); dp[i] %= mod; } s[i] = (s[i - 1] + dp[i]) % mod; L0 = max(L0, max0[i]); } ans = (ans * dp[n]) % mod; } if (ans < 0) ans += mod; cout << (ans) << n ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int T = 1; for (int t = 1; t <= T; t++) solve(); } |
#include <bits/stdc++.h> using namespace std; const int inf = 1e9; bool dentro[410000]; int main() { int n, k; scanf( %d %d , &n, &k); int vazio = 0; int v[n]; vector<int> proximo(n, inf); vector<int> mapa(n, -1); for (int i = 0; i < n; i++) { scanf( %d , &v[i]); if (mapa[v[i]] != -1) { proximo[mapa[v[i]]] = i; } mapa[v[i]] = i; } int resp = 0; priority_queue<pair<int, int> > q; int qt = 0; for (int i = 0; i < n; i++) { if (dentro[v[i]]) { q.push(pair<int, int>(proximo[i], v[i])); continue; } if (qt < k) { q.push(pair<int, int>(proximo[i], v[i])); qt++; dentro[v[i]] = true; resp++; continue; } pair<int, int> aux = q.top(); q.pop(); resp++; int u = aux.second; dentro[u] = false; dentro[v[i]] = true; q.push(pair<int, int>(proximo[i], v[i])); } printf( %d n , resp); return 0; } |
#include <bits/stdc++.h> using namespace std; int mapping[200001]; int main(int narg, char **arg) { int h, m, n; cin >> h >> m >> n; int hh = 0, occup_size = 0; while (true) { mapping[hh] = occup_size; hh += m; hh %= h; occup_size++; if (!hh) break; } int n_occup = h / occup_size; map<int, int> occup[n_occup]; for (int i = 0; i < occup_size; i++) mapping[i] = mapping[i * n_occup]; long long counter = 0; map<int, pair<int, int> > positions; for (int i = 0; i < n; i++) { char op; int id, hash_value; cin >> op >> id; int i_occup, i_start; if (op == + ) { cin >> hash_value; i_occup = hash_value % n_occup; i_start = mapping[hash_value / n_occup]; while (true) { map<int, int>::iterator it = occup[i_occup].upper_bound(i_start); if (it == occup[i_occup].begin()) { occup[i_occup][i_start] = i_start; it = occup[i_occup].begin(); } else { --it; if (it->second >= i_start - 1) { if (it->second == occup_size - 1) { counter += occup_size - i_start; i_start = 0; continue; } it->second++; counter += it->second - i_start; i_start = it->second; } else { it = occup[i_occup].insert(make_pair(i_start, i_start)).first; } } map<int, int>::iterator it2 = it; ++it2; if (it2 != occup[i_occup].end()) { if (it->second + 1 == it2->first) { it->second = it2->second; occup[i_occup].erase(it2); } } break; } positions[id] = make_pair(i_occup, i_start); } else { pair<int, int> p = positions[id]; i_occup = p.first; i_start = p.second; positions.erase(id); map<int, int>::iterator it = occup[i_occup].upper_bound(i_start); --it; if (it->first == i_start) { int last = it->second; occup[i_occup].erase(it); if (last != i_start) occup[i_occup][i_start + 1] = last; } else if (it->second == i_start) it->second--; else { int last = it->second; it->second = i_start - 1; occup[i_occup][i_start + 1] = last; } } } cout << counter << endl; return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.