func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; long long int con = 0; vector<pair<long long int, long long int> > v; long long int t[5000][5001]; vector<vector<pair<long long int, long long int> > > ans(5001); bool istrue[5001]; vector<long long int> a[5001]; long long int dis[5001]; int n; int ppp = 0; queue<int> q; void bfs(int src) { q.push(src); istrue[src] = true; dis[src] = 0; while (!q.empty()) { int p = q.front(); q.pop(); ans[con].push_back({(dis[p] + 1) % 2, p}); for (auto u : a[p]) { if (!istrue[u]) { dis[u] = dis[p] + 1; if (dis[u] % 2) v[con].second++; else v[con].first++; istrue[u] = true; q.push(u); } else { if (dis[u] % 2 == dis[p] % 2) { cout << NO << n ; ppp = 1; return; } } } } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int tt = 1; while (tt--) { long long int m; cin >> n >> m; long long int n1, n2, n3; cin >> n1 >> n2 >> n3; for (int i = 0; i < m; i++) { int x, y; cin >> x >> y; a[x].push_back(y); a[y].push_back(x); } for (int i = 1; i <= n; i++) { if (!istrue[i]) { v.push_back({1, 0}); bfs(i); con++; } if (ppp == 1) return 0; } memset(t, -1, sizeof(t)); if (v[0].first <= n2) t[0][v[0].first] = 0; if (v[0].second <= n2) t[0][v[0].second] = 0; for (int i = 1; i <= (long long int)v.size() - 1; i++) { for (int j = 0; j < n2 + 1; j++) { long long int vv = j - v[i].first; if (vv >= 0 && t[i - 1][vv] != -1) t[i][j] = vv; vv = j - v[i].second; if (vv >= 0 && t[i - 1][vv] != -1) t[i][j] = vv; } } char ss[n + 1]; if (t[(long long int)v.size() - 1][n2] == -1) cout << NO << n ; else { cout << YES << n ; long long int i = (long long int)v.size() - 1, ind = n2; while (i != -1) { long long int pp = ind - t[i][ind], kk = 0; if (v[i].first == pp) kk = 1; for (auto u : ans[i]) { if (u.first == kk) ss[u.second] = 2 ; else ss[u.second] = 1 ; } ind = t[i][ind]; i--; } for (int j = 1; j <= n; j++) { if (ss[j] == 1 ) { if (n1 == 0) ss[j] = 3 ; else n1--; } cout << ss[j]; } cout << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { int n, m; cin >> n >> m; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { int k; cin >> k; if (k % 2 != (i + j) % 2) k++; cout << k << ; } cout << endl; } } int main() { int n; cin >> n; while (n--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MXN = 5e4 + 5; const int INF = 1e9; const long long P = 29; const long long MOD = 1e9 + 7; int t; int main() { srand(time(0)); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout << fixed << setprecision(10); cin >> t; while (t--) { int n, x1, x2, x3; cin >> n; cin >> x1 >> x2; for (int i = 2; i < n; i++) { cin >> x3; } if (x1 + x2 <= x3) cout << 1 << << 2 << << n << n ; else cout << -1 << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int read() { int x = 0, flag = 1; char c = getchar(); while ((c > 9 || c < 0 ) && c != - ) c = getchar(); if (c == - ) flag = 0, c = getchar(); while (c <= 9 && c >= 0 ) { x = (x << 3) + (x << 1) + c - 0 ; c = getchar(); } return flag ? x : -x; } const int maxn = 2005; int f[maxn][maxn]; char s[maxn][maxn]; int main() { int n = read(), m = read(); for (int i = (1); i <= (int)(n); i++) scanf( %s , s[i] + 1); for (int i = (1); i <= (int)(2); i++) for (int j = (1); j <= (int)(m); j++) f[i][j] = 1; for (int i = (3); i <= (int)(n); i++) for (int j = (1); j <= (int)(m); j++) { if (j == 1 || j == m) { f[i][j] = 1; continue; } if (s[i][j] != s[i - 1][j - 1] || s[i][j] != s[i - 1][j] || s[i][j] != s[i - 1][j + 1] || s[i][j] != s[i - 2][j]) { f[i][j] = 1; continue; } int x = 100000; x = min(x, f[i - 1][j - 1]); x = min(x, f[i - 1][j]); x = min(x, f[i - 1][j + 1]); x = min(x, f[i - 2][j]); f[i][j] = x + 1; } long long ans = 0; for (int i = (1); i <= (int)(n); i++) for (int j = (1); j <= (int)(m); j++) ans += f[i][j]; cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename S, typename T> ostream& operator<<(ostream& out, pair<S, T> const& p) { out << ( << p.first << , << p.second << ) ; return out; } template <typename T> ostream& operator<<(ostream& out, vector<T> const& v) { long long l = v.size(); for (long long i = 0; i < l - 1; i++) out << v[i] << ; if (l > 0) out << v[l - 1]; return out; } template <typename T> void trace(const char* name, T&& arg1) { cout << name << : << arg1 << n ; } template <typename T, typename... Args> void trace(const char* names, T&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cout.write(names, comma - names) << : << arg1 << | ; trace(comma + 1, args...); } const long long N = 3e5 + 100; long long MOD; long long power(long long x, long long t) { long long ans = 1; while (t > 0) { if (t & 1) ans = 1LL * ans * x % MOD; x = 1LL * x * x % MOD; t >>= 1; } return ans; } inline long long sub(long long a, long long b) { a %= MOD; b %= MOD; a = ((a - b) % MOD + MOD) % MOD; return a; } inline long long add(long long a, long long b) { a %= MOD; b %= MOD; a = (a + b) % MOD; return a; } inline long long mul(long long a, long long b) { a %= MOD; b %= MOD; a = (a * b) % MOD; return a; } inline long long inv(long long a) { a = a % MOD; a = power(a, MOD - 2); return a; } long long a[N], n, k; map<long long, long long> cnt; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n >> MOD >> k; for (long long i = 1; i <= n; i++) { long long temp; cin >> temp; long long kk = power(temp, 4); long long k2 = mul(k, temp); kk = sub(kk, k2); cnt[kk]++; } long long ans = 0; auto c2 = [](long long a) -> long long { return ((a * (a - 1)) / 2); }; for (auto i : cnt) { ans += c2(i.second); } cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; const long long N = 200000 + 10; const long long INF = 2e9 + 10; long long dic[N], idx[N]; int main() { long long n, k, ii; scanf( %lld%lld , &n, &k); for (long long i = 0; i <= n; ++i) scanf( %lld , idx + i), dic[i] = idx[i]; for (long long i = 1; i <= n + 1; ++i) dic[i] += dic[i - 1] / 2, dic[i - 1] %= 2; for (long long i = 0; i <= n + 1; ++i) { if (dic[i]) { ii = i; break; } } long long x = 0, ans = 0; for (long long i = n + 1; i >= 0; --i) { x = x * 2 + dic[i]; if (abs(x) > INF) break; if (i > ii || i == n + 1 || (i == n && x == idx[i])) continue; if (abs(x - idx[i]) <= k) ++ans; } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; bool sortmahstyle(const pair<int, int> &a, const pair<int, int> &b) { if (a.first < b.first) return true; return false; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n, m; cin >> n >> m; long long int hash[n + 1], col[4]; memset(hash, 0, sizeof(hash)); while (m--) { memset(col, 0, sizeof(col)); long long int inp[3]; for (long long int i = 0; i < 3; i++) { cin >> inp[i]; col[hash[inp[i]]] = 1; } for (long long int i = 0; i < 3; i++) { long long int x = inp[i]; if (hash[x] == 0) { for (long long int j = 1; j < 4; j++) { if (col[j] == 0) { hash[x] = j; col[hash[x]] = 1; break; } } } else { col[hash[x]] = 1; } } } for (long long int i = 1; i < n + 1; i++) cout << hash[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector<long long int> a(n), b(n); set<long long int> s; for (int i = 0; i < n; i++) { cin >> a[i]; s.insert(a[i]); } for (int i = 0; i < n; i++) { cin >> b[i]; s.insert(b[i]); } long long int count = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { long long int temp = a[i] ^ b[j]; if (s.find(temp) != s.end()) count++; } } if (count % 2 != 0) cout << Koyomi << endl; else cout << Karen << endl; } |
#include <bits/stdc++.h> using namespace std; long long a[100010]; int main() { long long n, pos; while (cin >> n >> pos) { for (long long i = 0; i < n; i++) scanf( %I64d , &a[i]); sort(a, a + n); long long res1 = 0, res2, res; if (pos < a[0]) res1 = a[n - 2] - pos; else if (a[0] <= pos && pos <= a[n - 2]) res1 = min((pos - a[0]) * 2 + a[n - 2] - pos, (a[n - 2] - pos) * 2 + pos - a[0]); else if (pos > a[n - 2]) res1 = pos - a[0]; if (pos < a[1]) res2 = a[n - 1] - pos; else if (a[1] <= pos && pos <= a[n - 1]) res2 = min((pos - a[1]) * 2 + a[n - 1] - pos, (a[n - 1] - pos) * 2 + pos - a[1]); else if (pos > a[n - 1]) res2 = pos - a[1]; res = min(res1, res2); if (n == 1) res = 0; printf( %I64d n , res); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100010; const int M = 310; int n, m, s, e0, E; pair<int, int> dp[N][M]; int a[N]; vector<int> elAtB[N]; inline int findj(int j0, int val) { if (j0 >= m) return -1; vector<int> &v = elAtB[val]; if (v.size() == 0) return -1; vector<int>::iterator it = lower_bound(v.begin(), v.end(), j0); if (it == v.end()) return -1; else return *it; } int main() { cin >> n >> m >> s >> e0; E = s / e0; int ost = s - E * e0; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int j = 0; j < m; j++) { int x; cin >> x; elAtB[x].push_back(j); } int ans = 0; for (int i = 0; i <= n; i++) { for (int e = 0; e <= E; e++) { dp[i][e] = make_pair(0, 0); } } for (int i = 0; i < n; i++) { for (int e = 1; e <= E; e++) { int dol = dp[i][e].first; int j0 = dp[i][e].second; int dolnxt = dp[i + 1][e].first; if (dol > dolnxt) { dp[i + 1][e] = make_pair(dol, j0); } int j = findj(j0, a[i]); if (j == -1) continue; else { } dolnxt = dp[i + 1][e - 1].first; int jnxt = dp[i + 1][e - 1].second; if (((dol + 1 > dolnxt) || (dol + 1 == dolnxt && j < jnxt)) && ((i + 1 + j + 1) <= (e - 1) * e0 + ost)) { dp[i + 1][e - 1] = make_pair(dol + 1, j + 1); ans = max(ans, dol + 1); } } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> int main() { int i, j, k, n; scanf( %d , &n); k = sqrt(n); for (i = k; i >= 1; i--) { if (n % i == 0) { j = i; break; } } printf( %d %d , j, (n / j)); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long maxn = 100005; long long n, d, b; long long a[maxn]; bool f(long long x) { long long l = 1 + x; long long r = n - x; deque<pair<long long, long long>> dq; for (long long i = 1; i <= n; i++) if (a[i] != 0) dq.push_front({i, a[i]}); long long t = 1 + x; while (l <= r) { long long left = b; while (left > 0) { if (dq.empty()) return false; pair<long long, long long> p = dq.back(); dq.pop_back(); long long amt = min(p.second, left); if (p.first - l > t * d) return false; p.second -= amt; left -= amt; if (p.second > 0) dq.push_back(p); } l++; if (l <= r) { long long right = b; while (right > 0) { if (dq.empty()) return false; pair<long long, long long> p = dq.front(); dq.pop_front(); long long amt = min(p.second, right); if (r - p.first > t * d) return false; p.second -= amt; right -= amt; if (p.second > 0) dq.push_front(p); } r--; } t++; } return true; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> d >> b; for (long long i = 1; i <= n; i++) cin >> a[i]; long long l = 0; long long r = n; while (r - l > 3) { long long mid = (r - l) / 2 + l; if (f(mid)) r = mid; else l = mid; } for (long long i = l; i <= r; i++) { if (f(i)) { cout << i << n ; break; } } } |
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( O3 ) #pragma GCC target( avx ) #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) const int MOD = 1000000007; const int INF = 1000000009; const int MAXN = 1000005; vector<string> split(const string& s, char c) { vector<string> v; stringstream ss(s); string x; while (getline(ss, x, c)) v.emplace_back(x); return move(v); } template <typename T, typename... Args> inline string arrStr(T arr, int n) { stringstream s; s << [ ; for (int i = 0; i < n - 1; i++) s << arr[i] << , ; s << arr[n - 1] << ] ; return s.str(); } bool is_prime(long long n) { if (n < 2) return false; for (long long x = 2; x * x <= n; x++) { if (n % x == 0) return false; } return true; } vector<long long> get_prime_factors(long long n) { vector<long long> f; for (long long x = 2; x * x <= n; x++) { while (n % x == 0) { f.push_back(x); n /= x; } } if (n > 1) f.push_back(n); return f; } long long fpow(long long x, long long n) { long long res = 1; while (n) { if (n & 1) { res = (1LL * res * x) % MOD; } x = (1LL * x * x) % MOD; n >>= 1; } return (res % MOD); } vector<long long> fac, inv; void create_fac(long long n = MAXN) { fac.resize(n + 5); inv.resize(n + 5); fac[0] = 1; inv[0] = fpow(fac[0], MOD - 2); for (long long i = 1; i <= n; i++) { fac[i] = (fac[i - 1] % MOD * i % MOD) % MOD; inv[i] = fpow(fac[i], MOD - 2); } } long long binomial_coefficient(long long n, long long r) { long long res = 1; res = (res * (fac[n] % MOD)) % MOD; res = (res * (inv[r] % MOD)) % MOD; res = (res * (inv[n - r] % MOD)) % MOD; return res; } long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); } long long sceil(long long a, long long b) { return (a + b - 1) / b; } vector<long long> lp; vector<long long> pr; void sieve(long long n = MAXN) { lp.resize(n + 1); pr.clear(); for (long long i = 2; i <= n; ++i) { if (lp[i] == 0) { lp[i] = i; pr.push_back(i); } for (long long j = 0; j < (long long)pr.size() && pr[j] <= lp[i] && i * pr[j] <= n; ++j) lp[i * pr[j]] = pr[j]; } } long long extended_euclidean(long long a, long long b, long long& x, long long& y) { if (b == 0) { x = 1; y = 0; return a; } long long x1, y1; long long d = extended_euclidean(b, a % b, x1, y1); x = y1; y = x1 - y1 * (a / b); return d; } int mod_inv(long long a, long long m) { long long x, y; long long g = extended_euclidean(a, m, x, y); if (g != 1) { return -1; } else { x = (x % m + m) % m; return x; } } long long solution() { long long n, k; cin >> n >> k; string s; cin >> s; long long ans = 0; if (k <= n) ans = k; vector<long long> f(26, 0); for (auto c : s) { f[c - a ]++; } long long MX = *max_element(f.begin(), f.end()); vector<long long> v(MX, 0); for (int times = MX; times > 0; times--) { for (int i = 0; i < 26; i++) { v[times - 1] += f[i] / times; } } reverse(v.begin(), v.end()); 42; for (long long i = 1; i <= k && i <= n; i++) { if (k % i == 0) { long long times = MX - (lower_bound(v.begin(), v.end(), i) - v.begin()); 42; 42; ans = max(ans, times * i); } } return ans; } int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int tt = 1; cin >> tt; while (tt--) { cout << solution() << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int iinf = 1e9 + 10; const long long inf = 1ll << 60; const long long mod = 1e9 + 7; void GG() { cout << 0 n ; exit(0); } long long mpow(long long a, long long n, long long mo = mod) { long long re = 1; while (n > 0) { if (n & 1) re = re * a % mo; a = a * a % mo; n >>= 1; } return re; } long long inv(long long b, long long mo = mod) { if (b == 1) return b; return (mo - mo / b) * inv(mo % b, mo) % mo; } const int maxn = 1e6 + 5; long long dp[2003][22]; long long fac[200006], ifac[200006]; inline long long CC(int a, int b) { a = a + b; return fac[a] * ifac[b] % mod * ifac[a - b] % mod; } int R[2003], C[2003]; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); ; fac[0] = ifac[0] = 1; for (int i = 1; i <= 200006; ++i) { fac[i] = fac[i - 1] * i % mod; ifac[i] = inv(fac[i]); } int n, m, k, second; cin >> n >> m >> k >> second; vector<pair<int, int> > v; v.push_back({1, 1}); v.push_back({n, m}); for (int i = 0; i < k; ++i) { int r, c; cin >> r >> c; v.push_back({r, c}); } sort(v.begin(), v.end()); for (int i = 1; i <= (int)v.size() - 1; ++i) { R[i] = v[i].first, C[i] = v[i].second; dp[i][0] = CC(R[i] - 1, C[i] - 1); for (int fk = 0; fk < 21; ++fk) { for (int j = 1; j <= i - 1; ++j) { if (R[j] <= R[i] && C[j] <= C[i]) { dp[i][fk] -= dp[j][fk] * CC(R[i] - R[j], C[i] - C[j]) % mod; if (dp[i][fk] < 0) dp[i][fk] += mod; dp[i][fk + 1] += dp[j][fk] * CC(R[i] - R[j], C[i] - C[j]) % mod; if (dp[i][fk + 1] >= mod) dp[i][fk + 1] -= mod; } } } } long long re = 0; for (int fk = 0; fk < 22; ++fk) { re += dp[(int)v.size() - 1][fk] * second % mod; second = (second + 1) / 2; } cout << re * inv(CC(n - 1, m - 1)) % mod << n ; } |
#include <bits/stdc++.h> using namespace std; struct lem { long long m; long long v; int id; bool operator<(const lem& other) const { if (m > other.m) return true; if (m < other.m) return false; if (v > other.v) return true; if (v < other.v) return false; return id > other.id; } }; int N, K, H; lem L[100010]; int asst[100010]; int tempa[100010]; bool solve(long double t) { memset(tempa, 0, sizeof(tempa)); int start = 0; for (int k = K; k >= 1; k--) { bool found = false; for (int i = (start); i <= (N - 1); i++) { long double time = ((long double)k) / ((long double)L[i].v) * ((long double)H); if (time <= t) { found = true; tempa[k] = i; start = i + 1; break; } } if (!found) return false; } return true; } int main() { cin >> N >> K >> H; for (int i = 0; i < N; i++) cin >> L[i].m; for (int i = 0; i < N; i++) cin >> L[i].v; for (int i = 0; i < N; i++) L[i].id = i + 1; sort(L, L + N); long double low = 0.l; long double high = 1000000000.l; int times = 100; while (times--) { long double t = (low + high) / 2.l; if (solve(t)) { for (int i = (1); i <= (K); i++) asst[i] = tempa[i]; high = t; } else { low = t; } } for (int k = (1); k <= (K); k++) { if (k > 1) cout << ; cout << L[asst[k]].id; } cout << endl; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 20; const int inf = 1e9; int dp[maxn][maxn][maxn]; int vis[maxn][maxn][maxn]; int path[maxn][maxn][maxn]; int n, a, b; int h[maxn]; int dfs(int i, int cur, int pre) { cur = cur < 0 ? 0 : cur; pre = pre < 0 ? 0 : pre; if (i == n) { if (cur == 0) return 0; else return inf; } if (vis[i][cur][pre]) return dp[i][cur][pre]; vis[i][cur][pre] = 1; int &ans = dp[i][cur][pre]; ans = inf; int lb = (pre + b - 1) / b, hb = max(lb, max((cur + a - 1) / a, (h[i + 1] + b) / b)); int p; for (int j = lb; j <= hb; j++) { int tmp = j + dfs(i + 1, h[i + 1] + 1 - j * b, cur - j * a); if (ans > tmp) { ans = tmp; path[i][cur][pre] = j; } } return ans; } void print(int i, int cur, int pre) { cur = cur < 0 ? 0 : cur; pre = pre < 0 ? 0 : pre; if (i == n) return; int tmp = path[i][cur][pre], cnt = tmp; while (cnt--) printf( %d , i); print(i + 1, h[i + 1] + 1 - tmp * b, cur - tmp * a); } int main() { cin >> n >> a >> b; for (int i = 1; i <= n; i++) cin >> h[i]; memset(vis, 0, sizeof(vis)); int ans = dfs(2, h[2] + 1, h[1] + 1); cout << ans << n ; print(2, h[2] + 1, h[1] + 1); puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; string s, s1, s2, s3; int sa[300010][20], lcp[300010], rnk[300010], root[300010], cnt[300010][4], col[300010], n; pair<pair<int, int>, int> q[300010]; pair<int, pair<int, int> > lcp_pair[300010]; vector<long long> ansvec; long long ans, mod = 1e9 + 7; int get(int x) { return root[x] = (x == root[x] ? x : get(root[x])); } void merge(int x, int y) { root[y] = x; ans -= (1LL * cnt[y][1] * cnt[y][2] * cnt[y][3]) % mod + (1LL * cnt[x][1] * cnt[x][2] * cnt[x][3]) % mod; while (ans < 0) ans += mod; for (int i = 1; i <= 3; ++i) cnt[x][i] += cnt[y][i]; ans = (ans + 1LL * cnt[x][1] * cnt[x][2] * cnt[x][3]) % mod; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> s1 >> s2 >> s3; n = min(s1.size(), min(s2.size(), s3.size())); s = s1 + 1 + s2 + 2 + s3; for (int i = 0; i < s1.size(); ++i) col[i] = 1; for (int i = s1.size() + 1; i < s1.size() + 1 + s2.size(); ++i) col[i] = 2; for (int i = s.size() - s3.size(); i < s.size(); ++i) col[i] = 3; for (int i = 0; i < s.size(); ++i) sa[i][0] = s[i]; for (int i = 1; i < 20; ++i) { for (int j = 0; j < s.size(); ++j) if (j + (1 << i - 1) < s.size()) q[j] = make_pair(make_pair(sa[j][i - 1], sa[j + (1 << i - 1)][i - 1]), j); else q[j] = make_pair(make_pair(sa[j][i - 1], -1), j); sort(q, q + s.size()); int cnt = 0; for (int j = 0; j < s.size(); ++j) { if (j && q[j].first != q[j - 1].first) ++cnt; sa[q[j].second][i] = cnt; } } for (int i = 0; i < s.size(); ++i) { rnk[sa[i][19]] = i; root[i] = i; cnt[i][col[i]] = 1; } int cnt = 0, index, ii = 0; for (int i = 0; i < s.size(); ++i) { index = sa[i][19]; if (index == s.size() - 1) { cnt = 0; continue; } while (i + cnt < s.size() && rnk[index + 1] + cnt < s.size() && s[i + cnt] == s[rnk[index + 1] + cnt]) ++cnt; lcp[i] = cnt; lcp_pair[ii] = make_pair(lcp[i], make_pair(i, rnk[index + 1])); if (cnt) --cnt; ++ii; } sort(lcp_pair, lcp_pair + s.size() - 1); reverse(lcp_pair, lcp_pair + s.size() - 1); for (int i = n, j = 0; i >= 1; --i) { int x, y; while (j < s.size() - 1 && lcp_pair[j].first >= i) { x = get(lcp_pair[j].second.first); y = get(lcp_pair[j].second.second); merge(x, y); ++j; } ansvec.push_back(ans); } for (int i = ansvec.size() - 1; i >= 0; --i) cout << ansvec[i] << ; } |
#include <bits/stdc++.h> using namespace std; vector<string> v; string s; const int N = 1000001; int n; long long d, arr[N]; unsigned long long gcd(long long x, long long y) { if (y == 0) { return x; } return gcd(y, x % y); } void gen(long long ind, string t) { if (ind == s.size()) { if (t.size() == 3) v.push_back(t); return; } gen(ind + 1, t + s[ind]); gen(ind + 1, t); } long long check() { long long res = 0; for (long long i = 0; i < v.size(); ++i) { if (((v[i][v[i].size() - 1] - 0 ) - (v[i][0] - 0 )) <= d) { res++; } } return res; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, l, r; bool lie = 0; cin >> n >> l >> r; int v[n], s[n]; for (int i = 1; i <= n; ++i) { cin >> v[i]; } for (int i = 1; i <= n; ++i) { cin >> s[i]; } for (int i = 1; i < l; ++i) { if (v[i] != s[i]) { lie = 1; break; } } if (!lie) { for (int i = r + 1; i <= n; ++i) { if (v[i] != s[i]) { lie = 1; break; } } } if (lie) { cout << LIE n ; } else { cout << TRUTH n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1 + 9e6; const int inf = 0x3f3f3f; vector<bool> dp[24]; int n; int a[23]; vector<pair<int, int> > pre[23]; int ans; int main() { ios_base::sync_with_stdio(0); cin.tie(); cout.tie(); cin >> n; for (int i = 0; i < n; ++i) { cin >> a[i]; } for (int i = 0; i < 24; i++) dp[i].resize(1 << n); for (int i = 1; i < n; ++i) { for (int j = 0; j < i; ++j) { for (int k = j; k < i; ++k) { if (a[j] + a[k] == a[i]) { pre[i].push_back({j, k}); } } } } dp[0][0] = 0; dp[0][1] = 1; for (int i = 0; i < n - 1; ++i) { for (int mask = 0; mask < (1 << n); ++mask) { if (dp[i][mask]) { for (int j = 0; j < pre[i + 1].size(); ++j) { int u = pre[i + 1][j].first; int v = pre[i + 1][j].second; if (((mask >> u) & 1) && ((mask >> v) & 1)) { int bit = mask + (1 << (i + 1)); dp[i + 1][bit] = 1; for (int k = 0; k < i + 1; ++k) { if (((bit >> k) & 1)) { dp[i + 1][bit ^ (1 << k)] = 1; } } } } } } } ans = inf; for (int mask = 0; mask < (1 << n); ++mask) { if (dp[n - 1][mask]) { ans = min(ans, (int)(__builtin_popcount(mask))); } } if (ans == inf) cout << -1; else cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; string onezero(int n) { string s = 1 ; for (int i = 1; i < n; ++i) { s += 0 ; } return s; } string findSum(string str1, string str2) { if (str1.length() > str2.length()) swap(str1, str2); string str = ; int n1 = str1.length(), n2 = str2.length(); reverse(str1.begin(), str1.end()); reverse(str2.begin(), str2.end()); int carry = 0; for (int i = 0; i < n1; i++) { int sum = ((str1[i] - 0 ) + (str2[i] - 0 ) + carry); str.push_back(sum % 10 + 0 ); carry = sum / 10; } for (int i = n1; i < n2; i++) { int sum = ((str2[i] - 0 ) + carry); str.push_back(sum % 10 + 0 ); carry = sum / 10; } if (carry) str.push_back(carry + 0 ); reverse(str.begin(), str.end()); return str; } int main() { ios_base::sync_with_stdio(NULL); cin.tie(NULL); cout.tie(NULL); int l; string s, ans; cin >> l >> s; if (s.size() % l != 0) { string zero = onezero(l); for (int i = 0; i < s.size() / l + 1; ++i) { ans += zero; } } else { string temp = s.substr(0, l); for (int i = 0; i < s.size() / l; ++i) { ans += temp; } if (ans <= s) { ans = ; temp = findSum(temp, 1 ); if (temp.size() != l) { temp = onezero(l); ans = onezero(l); } for (int i = 0; i < s.size() / l; ++i) { ans += temp; } } } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const long long int N = 1e5 + 1; long long int n, m, i, j, l, k, x, y, a, b, cnt[3], sum[3]; void solve() { string s; cin >> s; long long int n = s.length(); long long int lst = 0, maxi = -1; long long int val = 0; for (long long int i = 0; i < n; i++) { if (s[i] == L ) { val++; } else { maxi = max(maxi, val); val = 0; } } maxi = max(maxi, val); cout << maxi + 1 << n ; } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int t; cin >> t; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; int a[1010], d[1010]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; d[a[i]]++; } int mx = 0, mxi = 0; for (int i = 1; i <= n; i++) { if (d[a[i]] > mx) mx = d[a[i]]; if (d[a[i]] != 0) { mxi++; d[a[i]] = 0; } } cout << mx << << mxi; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; long long answer = 0; for (int i = s.length() - 1; i > 0; i--) { string temp = s.substr(i - 1, 2); if (stoi(temp) % 4 == 0) { answer += i; } } for (int i = 0; i < s.length(); i++) { if (stoi(s.substr(i, 1)) % 4 == 0) { answer++; } } cout << answer; } |
#include <bits/stdc++.h> using namespace std; int c[1005]; int a[12] = {0, 4, 10, 20, 35, 56, 83, 116, 155, 198, 244, 292}; int main() { long long n; while (cin >> n) { if (n <= 11) { cout << a[n] << endl; } else { long long m; m = a[11] + (n - 11) * 49; cout << m << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; inline int read() { int ret = 0, flag = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) flag = -1; c = getchar(); } while (c >= 0 && c <= 9 ) ret = ret * 10 + (c ^ 0 ), c = getchar(); return flag * ret; } struct use { int x, dis; }; const int N = 5e3 + 5; int T, n, d; vector<int> edge[N]; int dad[N]; int build(int x, int dis) { int sum = 0; if ((x << 1) <= n) { edge[x].push_back(x << 1); sum += dis + 1; sum += build(x << 1, dis + 1); } if ((x << 1 | 1) <= n) { edge[x].push_back(x << 1 | 1); sum += dis + 1; sum += build(x << 1 | 1, dis + 1); } return sum; } void bfs() { queue<use> q; q.push({1, 0}); int now = 0; vector<int> p1, p2; while (q.empty() == 0) { int x = q.front().x, dis = q.front().dis; q.pop(); if (now != dis) { now = dis, p1.clear(), p2.clear(); } for (auto it = edge[x].begin(); it != edge[x].end(); it++) { int y = *it; if (edge[y].size() == 0) { p1.push_back(y); if (p2.size()) { edge[p2[0]].push_back(y); edge[x].erase(it); return; } } if (edge[y].size() != 2) p2.push_back(y); q.push({y, dis + 1}); } } } int main() { T = read(); while (T--) { n = read(), d = read(); for (int i = 1; i <= n; i++) edge[i].clear(); int mn = build(1, 0); int mx = (n - 1) * n / 2; if (!(mn <= d && d <= mx)) { printf( NO n ); continue; } int now = mn; while (now < d) { bfs(); now++; } for (int i = 1; i <= n; i++) { for (int j = 0; j < edge[i].size(); j++) dad[edge[i][j]] = i; } printf( YES n ); for (int i = 2; i <= n; i++) printf( %d , dad[i]); printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; double ans, m; int n; double binpow(double a, int b) { if (b == 0) return 1; else if (b == 1) return a; else if (b % 2 == 0) { double t = binpow(a, b / 2); return t * t; } else return a * binpow(a, b - 1); } int main() { cin >> m >> n; for (double i = 1; i <= m; i++) { ans += i * binpow(i / m, n) * (1 - binpow((i - 1) / i, n)); } cout << fixed << setprecision(15) << ans; } |
#include <bits/stdc++.h> int main() { int i; for (i = 0; i < 10; i++) { printf( ??%d>>%d?? n , i, i); } printf( ??>>? n ); for (i = 0; i < 9; i++) { printf( %d?<>%d n , i, i + 1); } printf( 9?>>?0 n?<>1 n>>?? n ); } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long n; cin >> n; long long t = n; vector<pair<int, int> > laptop; for (int i = 0; i < n; i++) { long long temp1, temp2; cin >> temp1 >> temp2; laptop.push_back(make_pair(temp1, temp2)); } sort(laptop.begin(), laptop.end()); int cur = laptop[0].second; for (int i = 1; i < n; ++i) { if (cur > laptop[i].second) { cout << Happy Alex n ; return 0; } cur = laptop[i].second; } cout << Poor Alex n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e6 + 7, M = 1e9 + 7; vector<int> primes; bool isp[N]; void sieve() { fill(isp, isp + N, 1); isp[0] = isp[1] = 0; for (int i = 2; i * i < N; i++) if (isp[i]) for (int j = i * i; j < N; j += i) isp[j] = 0; for (int i = 2; i < N; i++) if (isp[i]) primes.push_back(i); } vector<pair<int, int> > factorize(int x) { vector<pair<int, int> > ans; for (int i = 2; i * i <= x; i++) { int cnt = 0; while (x % i == 0) cnt++, x /= i; if (cnt) ans.push_back(make_pair(i, cnt)); } if (x > 1) ans.push_back(make_pair(x, 1)); return ans; } int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; long long ans = 1; map<int, int> fac; map<int, int> cnt; vector<vector<pair<int, int> > > factors; int pp[n]; for (int i = 0; i < n; i++) cin >> pp[i]; sort(pp, pp + n); reverse(pp, pp + n); for (int i = 1; i <= n; i++) { int p = pp[i - 1]; if (fac.count(p) == 0) { ans = (ans * p) % M; fac[p] = 1; cnt[p] = 1; vector<pair<int, int> > v; v.push_back(make_pair(p, 1)); factors.push_back(v); } else { vector<pair<int, int> > pf = factorize(p - 1); factors.push_back(pf); for (auto pr : pf) { int p = pr.first; int e = pr.second; int dif = e - fac[p]; if (dif < 0) continue; if (dif == 0) { cnt[p]++; continue; } fac[p] += dif; cnt[p] = 1; for (int i = 0; i < dif; i++) ans = (ans * p) % M; } } } for (auto pf : factors) { bool found = true; for (auto pr : pf) { int p = pr.first; int e = pr.second; int mx = fac[p]; assert(e <= mx); if (e == mx && cnt[p] == 1) { found = false; break; } } if (found) { ans++; break; } } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; unsigned long long n, k, b1, b2, b[200007], ans, dl, dll[200007], an[200007]; map<unsigned long long, unsigned long long> a[11]; int main() { ios::sync_with_stdio(0); cout.tie(0); cin.tie(0); cin >> n >> k; for (unsigned long long i = 1; i <= n; i++) { cin >> b[i]; b1 = b[i]; dl = 0; while (b1 > 0) { dl++; b1 = b1 / 10; } dll[i] = dl; b1 = b[i]; a[dl][b[i] % k]++; } for (unsigned long long i = 1; i <= n; i++) { b1 = 1; for (unsigned long long j = 1; j <= 10; j++) { b1 *= 10; b2 = b[i] * b1; b2 %= k; b2 = k - b2; if (b2 == k) b2 = 0; if (a[j].find(b2) != a[j].end()) { ans += a[j][b2]; if (dll[i] == j && b2 == b[i] % k) ans--; } } } cout << ans; } |
#include <bits/stdc++.h> using namespace std; const int maxn = int(1e6) + 100; const long long inf = 1e6; int n, m; int a[maxn], cnt[maxn], b[maxn]; void read() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); for (int i = 1; i <= n; ++i) b[i] = a[i]; } long long POW(long long num, int times) { long long ans = 1; while (times) { if (times & 1) ans = ans * num; num = num * num; if (ans >= inf) return inf; if (num >= inf) num = inf; times >>= 1; } return ans; } void solve() { long long ans = 0; for (int i = 1; i <= n; ++i) { int num = a[i]; a[i] = 1; long long inv = 1; for (int j = 2; j * j <= num && num != 1; ++j) if (num % j == 0) { int k = 0; int x = a[i]; while (num % j == 0) { k++; if (k == m) k = 0; if (k == 0) a[i] = x; else a[i] *= j; num /= j; } int tmp = POW(j, (m - k) % m); if (tmp == inf) inv = inf; else inv *= tmp; if (inv >= inf) inv = inf; } if (num != 1) a[i] *= num, inv *= POW(num, m - 1); if (inv < inf) ans += cnt[inv]; ++cnt[a[i]]; } printf( %lld n , ans); } int main() { read(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MX = 300000; int n, arr[MX], bit[MX], ans = 0, lis; void update(int x, int V) { while (x <= n) { bit[x] = max(bit[x], V); x += x & -x; } } int get(int x) { int ret = 0; while (x > 0) { ret = max(ret, bit[x]); x -= x & -x; } return ret; } int main() { scanf( %d , &n); memset(bit, 0, sizeof(bit)); for (int j = 1; j <= n; j++) { scanf( %d , &arr[j]); lis = get(arr[j]) + 1; update(arr[j] + 1, lis); ans = max(ans, lis); } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; priority_queue<long long, std::vector<long long>, std::greater<long long> > pqs; queue<long long> q; stack<long long> sta; set<long long> st; set<long long>::iterator P; long long i, j, n, m, t, k, a, b, c, x, mx, mn; string s, s1; char z; vector<pair<long long, long long> > v; map<pair<long long, long long>, long long> mp, pm; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); int T = 1; cin >> T; while (T--) { i = j = n = m = t = k = a = b = c = x = mx = mn = 0; cin >> n >> m; m += 2 * n; for (i = 1; i <= n && m; i++) for (j = i + 1; j <= n && m; j++) cout << i << << j << endl, m--; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct Node { Node *arr[26]; int state; bool isEnd = false; Node() { for (int i = 0; i < 26; i++) arr[i] = nullptr; isEnd = true; } }; void insert(const string &s, Node *root) { Node *curr = root; for (char c : s) { if (curr->arr[c - a ] == nullptr) curr->arr[c - a ] = new Node(); curr = curr->arr[c - a ]; } curr->isEnd = true; } int find_state(Node *curr, bool leaf = true) { bool winning = false; int cnt = 0; for (int i = 0; i < 26; i++) { if (curr->arr[i] != nullptr) { cnt++; if (find_state(curr->arr[i], leaf) == 0) winning = true; } } if (cnt == 0) winning = leaf; return curr->state = winning ? 1 : 0; } int main() { int n, k; cin >> n >> k; Node *root = new Node(); for (int i = 0; i < n; i++) { string s; cin >> s; insert(s, root); } int st1 = find_state(root, false); if (k == 1) { cout << (st1 == 1 ? First : Second ) << endl; } else { int st2 = find_state(root, true); if (st2 == 1 && st1 == 1) { cout << First << endl; } else if (st2 == 1 && st1 == 0) { cout << Second << endl; } else if (st2 == 0 && st1 == 1) { cout << (k % 2 == 0 ? Second : First ) << endl; } else { cout << Second << endl << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int a[100005]; int main() { int n; while (cin >> n) { int ans = 0; for (int i = 1; i < n; i++) { int x, y; cin >> x >> y; ans += a[x] + a[y]; a[x]++, a[y]++; } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = pow(10, 9) + 7; const long long MAX = LONG_LONG_MAX; void solve() { int n; cin >> n; vector<string> a(n, ); for (int i = 0; i < n; i += 1) cin >> a[i]; for (int i = 0; i < n; i += 1) { for (int j = 0; j < n; j += 1) { if (a[i][j] == 1 ) { if (i == n - 1 || j == n - 1) { continue; } if (a[i + 1][j] == 1 || a[i][j + 1] == 1 ) { continue; } else { cout << NO ; return; } } } } cout << YES ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t = 1; cin >> t; while (t > 0) { solve(); t--; cout << endl; } } |
#include <bits/stdc++.h> using namespace std; int8_t sign(int a, int b, int &c, int x, int y) { return a * 1LL * x + b * 1LL * y + c < 0LL ? -1 : 1; } void solve() { int x, y, x1, y1; cin >> x >> y >> x1 >> y1; int16_t ans = 0; int16_t n; cin >> n; for (int i = 0, u, v, c; i < n; i++) { cin >> u >> v >> c; ans += sign(u, v, c, x, y) != sign(u, v, c, x1, y1); } cout << ans; } int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int tkd = 1; while (tkd-- > 0) { solve(); } } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:64777216 ) using namespace std; template <class T> inline T sqr(T x) { return x * x; } const double pi = acos(-1.0), eps = 1e-9; const int INF = 1000 * 1000 * 1000, MAXN = 1000005, MOD = 1000000007; const long long INFL = 1000000000000000000; long long n, m, cnt[MAXN][26]; string x, y; void prepare(string s) { if ((int)s.size() != 0) { freopen((s + .in ).c_str(), r , stdin); freopen((s + .out ).c_str(), w , stdout); } } long long gcd(long long a, long long b) { return (b) ? gcd(b, a % b) : a; } long long lca(long long a, long long b) { return a / gcd(a, b) * b; } void get_data() { cin >> n >> m >> x >> y; } void solve() { long long L = lca((int)x.size(), (int)y.size()); long long g = gcd((int)x.size(), (int)y.size()); long long ans = L; for (int i = 0; i < (int)y.size(); ++i) cnt[i % g][y[i] - a ]++; for (int j = 0; j < (int)x.size(); ++j) ans -= cnt[j % g][x[j] - a ]; cout << ans * (n * (int)x.size() / L); } int main() { prepare( ); get_data(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; char s[2004], temp[2004], e[2004], c, cnt; int n; int q[27]; void f(int x) { cnt++; if (cnt != n * 3) printf( %d , x); else printf( %d n , x); int i; for (i = n - x + 1; i <= n; i++) temp[n - i + 1] = s[i]; for (i = 1; i < n - x + 1; i++) temp[i + x] = s[i]; for (i = 1; i <= n; i++) s[i] = temp[i]; } int main() { int t, i, j, k, x, l1, l2, flag, o; scanf( %d , &t); scanf( %s , s + 1); scanf( %s , e + 1); l1 = strlen(s + 1); l2 = strlen(e + 1); if (l1 != l2) { printf( -1 n ); return 0; } memset(q, 0, sizeof(q)); for (i = 1; i <= l1; i++) { q[s[i] - a ]++; q[e[i] - a ]--; } flag = 1; for (i = 0; i < 26; i++) { if (q[i]) flag = 0; } if (flag == 0) { printf( -1 n ); return 0; } n = l1; printf( %d n , n * 3); cnt = 0; for (o = 0; o < n; o++) { f(n); c = e[n - o]; for (i = n - o; i >= 0; i--) { if (s[i] == c) break; } f(n - i); f(1); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1e9 + 10, MAX = 7e5 + 1e4, MOD = 1e9 + 7, MAXL = 25; void OUT(long double o, int x) { cout << fixed << setprecision(x) << o; return; } long long sth[MAX], mah[MAX], reg[MAX], ti[MAX], en[MAX], he[MAX], hh[MAX], pa[MAX]; long long la[MAX]; pair<pair<long long, long long>, long long> so[MAX]; set<long long> st; map<long long, long long> mp; vector<pair<pair<long long, long long>, long long> > v[MAX]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, m, ans = 0, bo, da, in; bool inff = 0; cin >> n >> m >> bo >> in >> da; st.insert(0); for (int i = 1; i <= n; i++) { cin >> mah[i] >> sth[i] >> reg[i]; if (mah[i] <= da) inff = 1; hh[i] = sth[i]; if (hh[i] <= da && (reg[i] != 0 && mah[i] > da)) { st.insert((da - hh[i]) / reg[i]); st.insert(((da - hh[i]) / reg[i]) + 1); } } for (int i = 1; i <= m; i++) { cin >> ti[i] >> en[i] >> he[i]; so[i] = {{ti[i], en[i]}, he[i]}; } so[0].first.first = -1; sort(so + 1, so + m + 1); for (int i = 1; i <= m; i++) { hh[so[i].first.second] = so[i].second; st.insert(so[i].first.first); st.insert(so[i].first.first - 1); if (so[i].second <= da && (reg[so[i].first.second] != 0 && mah[so[i].first.second] > da)) { st.insert(so[i].first.first + ((da - so[i].second) / reg[so[i].first.second])); st.insert(1 + so[i].first.first + ((da - so[i].second) / reg[so[i].first.second])); } } for (int i = 1; i <= n; i++) { if (reg[i] == 0 && hh[i] <= da) inff = 1; } if (inff == 1 && in != 0) return cout << -1, 0; long long cnt = 0, x = 0; for (int u : st) { mp[u] = cnt; cnt++; } for (int i = 1; i <= n; i++) { hh[i] = sth[i]; la[i] = -1; if (hh[i] <= da) x++; else la[i] = -2; if (hh[i] <= da && (reg[i] != 0 && mah[i] > da)) { pa[mp[1 + ((da - hh[i]) / reg[i])]]--; la[i] = ((da - hh[i]) / reg[i]); } } for (int i = 1; i <= m; i++) { v[mp[ti[i]]].push_back({{ti[i], en[i]}, he[i]}); } for (int u : st) { for (pair<pair<long long, long long>, long long> w : v[mp[u]]) { hh[w.first.second] = w.second; if (la[w.first.second] == -1 || la[w.first.second] >= u) { if (la[w.first.second] != -1) pa[mp[la[w.first.second] + 1]]++; if (hh[w.first.second] > da) x--; else { if ((reg[w.first.second] != 0 && mah[w.first.second] > da)) { pa[mp[1 + u + ((da - hh[w.first.second]) / reg[w.first.second])]]--; la[w.first.second] = u + ((da - hh[w.first.second]) / reg[w.first.second]); } } } else { if (hh[w.first.second] <= da) { x++; if (reg[w.first.second] > 0) { pa[mp[u + 1 + ((da - hh[w.first.second]) / reg[w.first.second])]]--; la[w.first.second] = u + ((da - hh[w.first.second]) / reg[w.first.second]); } else la[w.first.second] = -1; } } } x += pa[mp[u]]; ans = max(ans, (x * bo) + (x * in * u)); } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, k; cin >> n >> k; long long int res = 1; if (k == 1) { cout << n; } else { while (res <= n) res = (long long)(res * 2); cout << res - 1; } return 0; } |
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); const int inf = 99999999; int n; char c[20]; int r[20]; int b[20]; int dp[1 << 16][123]; int main() { int n; cin >> n; int maxi = 0; int ans1 = 0; int ans2 = 0; for (int i = 0; i < n; i++) { cin >> c[i] >> r[i] >> b[i]; maxi += i; ans1 += r[i]; ans2 += b[i]; } memset(dp, -1, sizeof(dp)); dp[0][0] = 0; for (int i = 1; i < 1 << n; i++) { for (int j = 0; j < n; j++) { if (i >> j & 1) { int R = 0; int B = 0; for (int k = 0; k < n; k++) { if (k != j && i >> k & 1) { R += c[k] == R ; B += c[k] == B ; } } R = min(R, r[j]); B = min(B, b[j]); for (int k = 0; k <= maxi; k++) { if (dp[i ^ (1 << j)][k] != -1) { dp[i][k + R] = max(dp[i][k + R], dp[i ^ (1 << j)][k] + B); } } } } } int ans = max(ans1, ans2); for (int i = 0; i <= maxi; i++) { if (dp[(1 << n) - 1][i] != -1) { ans = min(ans, max(ans2 - dp[(1 << n) - 1][i], ans1 - i)); } } cout << ans + n; return 0; } |
#include <bits/stdc++.h> void output1(int n) { for (int i = 0; i < n; ++i) { printf( 10 ); } printf( n ); } void output2(int m) { --m; for (int i = 0; i < m; ++i) { printf( 01 ); } printf( 0 n ); } void output3(int n, int m) { if (n == m + 1) { --n; for (int i = 0; i < n; ++i) { printf( 10 ); } printf( 1 n ); return; } int tmp = n - m - 1; int up = m + 1; up--; for (int i = 0; i < up; ++i) { printf( 1 ); if (tmp) { printf( 1 ); --tmp; } printf( 0 ); } printf( 1 ); if (tmp) { printf( 1 ); } printf( n ); } int main() { int n, m; while (scanf( %d%d , &m, &n) != EOF) { if (m == n) { output1(n); } else if (m == n + 1) { output2(m); } else if (n > m && n <= 2 * m + 2) { output3(n, m); } else { printf( -1 n ); } } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC target( sse4 ) const char nl = n ; using namespace std; using ll = long long; using vi = vector<int>; using vl = vector<ll>; using pii = pair<int, int>; using pll = pair<ll, ll>; using str = string; str to_string(char c) { return str(1, c); } str to_string(bool b) { return b ? true : false ; } str to_string(const char* second) { return (str)second; } str to_string(str second) { return second; } template <class A> str to_string(complex<A> c) { stringstream ss; ss << c; return ss.str(); } str to_string(vector<bool> v) { str res = { ; for (int i = 0; i < (int)v.size(); i++) res += char( 0 + v[i]); res += } ; return res; } template <size_t SZ> str to_string(bitset<SZ> b) { str res = ; for (int i = 0; i < b.size(); i++) res += char( 0 + b[i]); return res; } template <class A, class B> str to_string(pair<A, B> p); template <class T> str to_string(T v) { bool fst = 1; str res = { ; for (const auto& x : v) { if (!fst) res += , ; fst = 0; res += to_string(x); } res += } ; return res; } template <class A, class B> str to_string(pair<A, B> p) { return ( + to_string(p.first) + , + to_string(p.second) + ) ; } void DBG() { cerr << ] << endl; } template <class H, class... T> void DBG(H h, T... t) { cerr << to_string(h); if (sizeof...(t)) cerr << , ; DBG(t...); } string c; int n; int dp[26][26]; signed main() { cin.tie(nullptr); ios_base::sync_with_stdio(false); cin >> n; for (int i = 0; i < 26; i++) { for (int j = 0; j < 26; j++) { dp[i][j] = -1e9; } } int ans = 0; for (int i = 0; i < n; i++) { cin >> c; int m = c.length(); int a = c[0] - a ; int b = c[m - 1] - a ; for (int j = 0; j < 26; j++) { dp[j][b] = max(dp[j][b], dp[j][a] + m); } dp[a][b] = max(dp[a][b], m); } for (int i = 0; i < 26; i++) { ans = max(ans, dp[i][i]); } cout << ans << nl; } |
#include <bits/stdc++.h> using namespace std; const long long N = 5100; const long long M = 15; const long long mod = 1e9 + 7; const long long MOD = 998244353; const long long P = 1336; const long double eps = 0.000000001; const long long inf = 1e9; mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count()); long long w[N], b[N], a[N], dp[N], u[N]; vector<long long> nom[N]; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); srand(time(0)); long long n, k, V; cin >> n >> k >> V; long long sum = 0; if (V == 0) { cout << YES << n ; cout << inf << 1 2 ; return 0; } for (long long i = 0; i < n; i++) { cin >> w[i]; sum += w[i]; b[i] = w[i] % k; a[i] = w[i] - b[i]; if (a[i] > V) a[i] = V / k * k; } if (sum < V) { cout << NO ; return 0; } dp[0] = 1; for (long long i = 0; i < n; i++) { for (long long j = k; j >= 0; j--) { if (dp[j] != 1) continue; long long per = (j + b[i]) % k; if (per == 0) per = k; if (dp[per]) continue; dp[per] = 2; for (auto to : nom[j]) { nom[per].push_back(to); } nom[per].push_back(i); } for (long long j = k; j >= 0; j--) { if (dp[j] == 2) dp[j] = 1; } } for (long long i = 0; i < n; i++) { long long need = (V - a[i]) % k; if (need == 0) need = k; if (!dp[need] && need != k) continue; long long no = -1; vector<pair<long long, pair<long long, long long> > > g; for (long long j = 0; j < n; j++) { u[j] = 0; } for (auto to : nom[need]) { u[to] = 1; } if (u[i] == 0 && need != k) continue; long long s = 0; for (auto to : nom[need]) { u[to] = 1; if (to == i) { s += w[i]; continue; } g.push_back({inf, {to, i}}); s += w[to]; } long long e = -1; for (long long j = 0; j < n; j++) { if (u[j]) continue; e = j; } if (s < V) { need = (V - s) / k; for (long long j = 0; j < n; j++) { if (u[j] || j == e) continue; long long c = w[j] / k; if (w[j] % k) c++; if (c) g.push_back({c, {j, e}}); w[e] += w[j]; } long long c = w[e] / k; if (c < need) continue; g.push_back({need, {e, i}}); } if (s > V) { need = (s - V) / k; if (i) g.push_back({need, {i, 0}}); else g.push_back({need, {i, 1}}); } cout << YES << n ; for (auto to : g) { cout << to.first << << to.second.first + 1 << << to.second.second + 1 << n ; } return 0; } cout << NO ; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 500000 + 24; int a[MAX]; int main() { int n, m, ans, tmp, u, v, fc; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); } m = a[0]; ans = 0; for (int i = 0; i < n; i++) { while (i < n && a[i] == m) { i++; } tmp = 0; u = i; if (m == 0) { while (i + 1 < n && a[i] == 1 && a[i + 1] == 0) { tmp++; i += 2; } } else { while (i + 1 < n && a[i] == 0 && a[i + 1] == 1) { tmp++; i += 2; } } v = i; ans = max(ans, tmp); int j = u; for (; j < v - tmp; j++) { a[j] = m; } fc = (i < n) ? a[i] : a[n - 1]; for (; j < v; j++) { a[j] = fc; } m = a[i]; i--; } printf( %d n , ans); for (int i = 0; i < n - 1; i++) { printf( %d , a[i]); } printf( %d n , a[n - 1]); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; int n, a[maxn], cnt[maxn], mx = 0, last[maxn * 2], ans = 0; void solve1(int x) { for (int i = 1; i <= n; i++) last[n - i] = last[n + i] = -1; last[n] = 0; int cur = 0; for (int i = 1; i <= n; i++) { if (a[i] == x) cur++; else if (a[i] == mx) cur--; if (last[n + cur] == -1) last[n + cur] = i; else ans = max(ans, i - last[n + cur]); } } void solve2(int x) { for (int i = 1; i <= n; i++) cnt[i] = 0; int l = 1, equal = 0; cnt[a[l]]++; if (cnt[a[l]] == x) equal++; for (int i = 2; i <= n; i++) { cnt[a[i]]++; if (cnt[a[i]] == x) equal++; else if (cnt[a[i]] > x) { while (cnt[a[i]] > x) { cnt[a[l]]--; if (cnt[a[l]] == x - 1) equal--; l++; } } if (equal >= 2) ans = max(ans, i - l + 1); } } int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; cnt[a[i]]++; mx = cnt[mx] < cnt[a[i]] ? a[i] : mx; } int limt = sqrt(n); for (int i = 1; i <= n; i++) if (cnt[i] >= limt && i != mx) solve1(i); for (int i = 1; i < limt; i++) solve2(i); cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int arr[6]; for (int i = 0; i < 6; i++) { cin >> arr[i]; } sort(arr, arr + 6); int tracker[10]; for (int i = 0; i < 10; i++) { tracker[i] = 0; } for (int i = 0; i < 6; i++) { tracker[arr[i]]++; } int legs = -1; for (int i = 0; i < 10; i++) { if (tracker[i] >= 4) { legs = i; break; } } if (legs != -1) { int head1 = -1, head2; int taken[6]; int takenCounter = 0; for (int i = 0; i < 6; i++) { taken[i] = 0; } for (int i = 0; i < 6; i++) { if (arr[i] == legs) { taken[i] = 1; takenCounter++; } if (takenCounter == 4) { break; } } for (int i = 0; i < 6; i++) { if (taken[i] == 0) { if (head1 == -1) { head1 = arr[i]; } else { head2 = arr[i]; } } } if (head1 != head2) { cout << Bear ; } else { cout << Elephant ; } } else { cout << Alien ; } } |
#include <bits/stdc++.h> using namespace std; string s; int n, a, b, ans, nr1, nr0, minD; int main() { cin >> n >> a >> b; cin >> s; a--; b--; minD = (int)1e8; nr1 = (int)1e8; nr0 = (int)1e8; for (int i = 0; i < s.size(); i++) { if (s[i] == s[a]) { nr1 = i; if (abs(nr1 - nr0) < minD) minD = abs(nr1 - nr0); } if (s[i] == s[b]) { nr0 = i; if (abs(nr0 - nr1) < minD) minD = abs(nr0 - nr1); } } cout << minD; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> void minn(T& a, T b) { if (a > b) a = b; } template <class T> void maxx(T& a, T b) { if (a < b) a = b; } void debug() { return; } template <class H, class... T> void debug(H a, T... b) { cerr << a; debug(b...); } void is() { return; } template <class H, class... T> void is(H& a, T&... b) { cin >> a; is(b...); } void os() { return; } template <class H, class... T> void os(H a, T... b) { cout << a; os(b...); } const int mod = 1e9 + 7; const int N = 2e5 + 5; int n, q; int nx[N], pr[N], nx100[N]; void sw(int x, int y) { swap(nx[x], nx[y]); pr[nx[x]] = x; pr[nx[y]] = y; int k = x; for (int i = 1; i <= 100; i++) k = pr[k]; for (int i = 1; i <= 105; i++) { nx100[k] = x; x = nx[x]; k = nx[k]; } k = y; for (int i = 1; i <= 100; i++) k = pr[k]; for (int i = 1; i <= 105; i++) { nx100[k] = y; y = nx[y]; k = nx[k]; } } void solve() { is(n, q); for (int i = 1; i <= n; i++) { is(nx[i]); pr[nx[i]] = i; } for (int i = 1; i <= n; i++) { int k = i; for (int j = 1; j <= 100; j++) { k = nx[k]; } nx100[i] = k; } while (q--) { int t, x, y; is(t, x, y); if (t == 2) { int k = x; while (y >= 100) { y -= 100; k = nx100[k]; } while (y--) k = nx[k]; os(k, n ); } else { sw(x, y); } } } signed main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); int T = 1; while (T--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; const int mod = 1e9 + 7; int n, m, a[N], t[N], r[N], second[N]; pair<int, int> T[2][N * 4]; pair<int, int> get_max(int l, int r, int v = 1, int tl = 1, int tr = n) { if (tl > r || tr < l) return make_pair(-mod, 0); if (l <= tl && tr <= r) return T[0][v]; int tm = (tl + tr) / 2; return max(get_max(l, r, v * 2, tl, tm), get_max(l, r, v * 2 + 1, tm + 1, tr)); } pair<int, int> get_min(int l, int r, int v = 1, int tl = 1, int tr = n) { if (tl > r || tr < l) return make_pair(mod, 0); if (l <= tl && tr <= r) return T[1][v]; int tm = (tl + tr) / 2; return min(get_min(l, r, v * 2, tl, tm), get_min(l, r, v * 2 + 1, tm + 1, tr)); } void upd(int p, int v = 1, int tl = 1, int tr = n) { if (tl == tr) { T[0][v] = T[1][v] = make_pair(a[p], p); return; } int tm = (tl + tr) / 2; if (p <= tm) upd(p, v * 2, tl, tm); else upd(p, v * 2 + 1, tm + 1, tr); T[0][v] = max(T[0][v * 2], T[0][v * 2 + 1]); T[1][v] = min(T[1][v * 2], T[1][v * 2 + 1]); } int main() { ios_base::sync_with_stdio(0); cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> a[i]; upd(i); } for (int i = 1; i <= m; i++) cin >> t[i] >> r[i]; for (int i = m; i; i--) second[i] = max(second[i + 1], r[i]); for (int i = 1; i <= m; i++) { if (r[i] > second[i + 1]) { if (t[i] == 1) { for (int j = r[i]; j > second[i + 1]; j--) { pair<int, int> x = get_max(1, j); swap(a[x.second], a[j]); upd(x.second); upd(j); } } else { for (int j = r[i]; j > second[i + 1]; j--) { pair<int, int> x = get_min(1, j); swap(a[x.second], a[j]); upd(x.second); upd(j); } } } } for (int i = 1; i <= n; i++) cout << a[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e6 + 3; const int INFI = 1e9 * 2; const long long LINFI = 1e17; const double pi = acos(-1.0); const int N = 111; const int M = 222222; const int move[8][2] = {1, 0, -1, 0, 0, 1, 0, -1, 1, 1, 1, -1, -1, 1, -1, -1}; int a[N][N]; int main() { int n, m; while (scanf( %d , &n) != EOF) { for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) scanf( %d , &a[i][j]); if (n == 1) printf( %d n , 0); else { for (int i = 0; i < n; i++) { m = 0; for (int j = 0; j < n; j++) if (i != j) m |= a[i][j]; printf( %d , m); } printf( n ); } } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; const long long inff = 0x3f3f3f3f3f3f3f3f; const int N = 5e2 + 8; int n, kk, a[N], dp[2][N][N]; int main() { cin.tie(0); cout.tie(0); cin >> n >> kk; int qw = 0; dp[qw ^ 1][0][0] = 1; for (int i(1); i <= (n); ++i) { scanf( %d , &a[i]); for (int j(0); j <= (kk); ++j) for (int k(0); k <= (kk); ++k) dp[qw][j][k] = dp[qw ^ 1][j][k]; for (int j(kk); j >= (a[i]); --j) for (int k(kk); k >= (0); --k) dp[qw][j][k] = max(dp[qw][j][k], dp[qw ^ 1][j - a[i]][k]); for (int j(kk); j >= (a[i]); --j) for (int k(kk); k >= (0); --k) dp[qw][k][j] = max(dp[qw][k][j], dp[qw ^ 1][k][j - a[i]]); qw ^= 1; } qw ^= 1; int num = 0; for (int i(0); i <= (kk); ++i) if (dp[qw][i][kk - i]) num++; cout << num << endl; for (int i(0); i <= (kk); ++i) if (dp[qw][i][kk - i]) printf( %d , i); puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; string s1, s2, s3; int win(string s1, string s2) { if (s1 == rock ) { if (s2 == rock ) return 0; if (s2 == scissors ) return 1; if (s2 == paper ) return 2; } if (s1 == paper ) { if (s2 == rock ) return 1; if (s2 == scissors ) return 2; if (s2 == paper ) return 0; } if (s1 == scissors ) { if (s2 == rock ) return 2; if (s2 == scissors ) return 0; if (s2 == paper ) return 1; } } int main() { cin >> s1 >> s2 >> s3; if (win(s1, s2) == 1 && win(s1, s3) == 1) { cout << F ; return 0; } if (win(s2, s1) == 1 && win(s2, s3) == 1) { cout << M ; return 0; } if (win(s3, s1) == 1 && win(s3, s2) == 1) { cout << S ; return 0; } cout << ? ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, a[101]; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &a[i]); sort(a, a + n); int i = 1; while (a[i] == a[i - 1] && i < n) i++; if (i == n) printf( NO n ); else printf( %d n , a[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; using namespace placeholders; template <class T> void mini(T &l, T r) { l = min(l, r); } template <class T> void maxi(T &l, T r) { l = max(l, r); } template <class TH> void _dbg(const char *sdbg, TH h) { cerr << sdbg << = << h << n ; } template <class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) { while (*sdbg != , ) cerr << *sdbg++; cerr << = << h << , ; _dbg(sdbg + 1, a...); } template <class T> ostream &operator<<(ostream &os, vector<T> v) { os << [ ; for (auto vv : v) os << vv << , ; return os << ] ; } template <class L, class R> ostream &operator<<(ostream &os, pair<L, R> p) { return os << ( << p.first << , << p.second << ) ; } using llint = long long; const int B = 1e9 + 7; int a[40][40]; llint mem[40], cnt[40]; void add(llint &a, llint b) { a = (a + b) % B; if (a < 0) a += B; } void init() { mem[0] = 1; cnt[0] = 1; for (int i = 1; i < 40; ++i) { int c = 1 << (i - 1); cnt[i] = cnt[i - 1] * 4 % B; add(mem[i], mem[i - 1] * 4 % B + 1ll * c * c % B * c % B * 2 % B); } } llint calc(llint a, llint b) { a %= B, b %= B; return ((a + b) * (b - a + 1) / 2) % B; } pair<llint, llint> get(int x, int y, int k, int d) { llint ret = 0; int sz = 1 << d; if (x < y) swap(x, y); if (x <= 0 || y <= 0 || k <= 0) return make_pair(0, 0); if (x >= sz) { llint a = min(k, sz); llint b = min(y, sz); ret = calc(1, a) * b % B; ; return make_pair(b * calc(1, a) % B, b * a % B); } if (d == 0) return make_pair(1 <= k, 1 <= k); int t = 1 << (d - 1); auto t1 = get(x, y, k, d - 1); auto t2 = get(x - t, y, k - t, d - 1); auto t3 = get(y, y - t, k - t, d - 1); auto t4 = get(x - t, y - t, k, d - 1); ; add(ret, t1.first); add(ret, t2.first + t2.second * t % B); add(ret, t3.first + t3.second * t % B); add(ret, t4.first); llint c = 0; add(c, t1.second); add(c, t2.second); add(c, t3.second); add(c, t4.second); ; return make_pair(ret, c); } llint go(int x1, int y1, int x2, int y2, int k) { llint ret = 0; add(ret, get(x2, y2, k, 30).first); add(ret, -get(x1 - 1, y2, k, 30).first); add(ret, -get(x2, y1 - 1, k, 30).first); add(ret, get(x1 - 1, y1 - 1, k, 30).first); return ret; } void run() { init(); ; int q; scanf( %d , &q); for (int i = 1; i <= q; ++i) { int x1, y1, x2, y2, k; scanf( %d%d%d%d%d , &x1, &y1, &x2, &y2, &k); printf( %lld n , go(x1, y1, x2, y2, k)); } } int main() { run(); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const long long up = 2e5 + 5; pair<int, int> pt[2005]; inline bool cmp(const pair<int, int>& a, const pair<int, int>& b) { if (a.first == b.first) return a.second < b.second; return a.first < b.first; } long long fac[up], inv[up], facinv[up], facinv2[up]; long long pow_mod(long long a, long long k) { long long res = 1; while (k) { if (k & 1) res = (res * a) % mod; a = (a * a) % mod; k >>= 1; } return res; } void init() { fac[0] = fac[1] = 1; for (long long i = 2; i < up; ++i) fac[i] = fac[i - 1] * i % mod; inv[1] = 1, facinv[0] = facinv[1] = 1; facinv2[0] = facinv2[1] = 1; for (long long i = 2; i < up; ++i) { long long t = mod / i, k = mod % i; inv[i] = i * t * t % mod * inv[k] % mod * inv[k] % mod; facinv[i] = facinv[i - 1] * inv[i] % mod; } } long long C(long long n, long long m) { return fac[n] * facinv[n - m] % mod * facinv[m] % mod; } long long ans[2005]; int main() { init(); int h, w, k; cin >> h >> w >> k; for (long long i = 0; i < k; ++i) cin >> pt[i].first >> pt[i].second; pt[k].first = h, pt[k].second = w; ++k; sort(pt, pt + k, cmp); for (long long i = 0; i < k; ++i) { ans[i] = C(pt[i].first + pt[i].second - 2, pt[i].first - 1); for (long long j = 0; j < i; ++j) { ans[i] -= ans[j] * C(pt[i].first - pt[j].first + pt[i].second - pt[j].second, pt[i].first - pt[j].first) % mod; ans[i] = (ans[i] + mod) % mod; } } cout << ans[k - 1] << endl; } |
#include <bits/stdc++.h> using namespace std; const int big = ((long long int)1 << 30); const long long int mod = 1000000007; int main(void) { int n, m, ans = 0, i, q, w, gen = 0; vector<int> kaz; vector<bool> uma; scanf( %d %d , &n, &m); m--; kaz.resize(n); uma.resize(n + 1); for (i = 0; i < n; i++) { scanf( %d , &q); if (i == m && q != 0) { ans++; q = 0; } if (i != m && q == 0) { q = n; } kaz[i] = q; uma[q] = 1; } sort(kaz.begin(), kaz.end()); while (-1) { for (; gen <= n; gen++) { if (uma[gen] == 0) { break; } } if (kaz.back() <= gen) { break; } ans++; kaz.pop_back(); uma[gen] = 1; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> const int INF_INT = 0x3f3f3f3f; const long long INF_LL = 0x7f7f7f7f; const int MOD = 1e9 + 7; const double eps = 1e-10; const double pi = acos(-1); using namespace std; const int N = 200200; int n, m, q; int u[N], v[N]; struct Query { int l, r, s, t, id; Query(int l, int r, int s, int t, int id) : l(l), r(r), s(s), t(t), id(id) {} Query() {} bool operator<(const Query& rhs) const { return l > rhs.l; } }; vector<Query> qs; int dp[1010][1010]; int ans[N]; int main(int argc, char const* argv[]) { scanf( %d%d%d , &n, &m, &q); for (int i = 1; i <= m; i++) scanf( %d%d , &u[i], &v[i]); for (int i = 1; i <= q; i++) { int l, r, s, t; scanf( %d%d , &l, &r); scanf( %d%d , &s, &t); qs.emplace_back(l, r, s, t, i); } sort(qs.begin(), qs.end()); memset((dp), (INF_INT), sizeof(dp)); for (int i = 1; i <= n; i++) dp[i][i] = 0; int cnt = 0; for (int i = m; i >= 1; i--) { dp[u[i]][v[i]] = dp[v[i]][u[i]] = i; for (int j = 1; j <= n; j++) { if (j != u[i]) dp[v[i]][j] = min(dp[v[i]][j], dp[u[i]][j]); if (j != v[i]) dp[u[i]][j] = min(dp[u[i]][j], dp[v[i]][j]); } while (cnt < qs.size() && qs[cnt].l >= i) { ans[qs[cnt].id] = dp[qs[cnt].s][qs[cnt].t] <= qs[cnt].r; cnt++; } } for (int i = 1; i <= q; i++) puts(ans[i] ? Yes : No ); return 0; } |
#include <bits/stdc++.h> using namespace std; bool deb = false; int n; vector<int> p, b; void init() { if (!deb) return; p.resize(n); for (auto& x : p) cin >> x; b.resize(n); for (int i = 0; i < n; ++i) b[p[i]] = i; } int get(int i, int j) { if (deb) return p[i] ^ b[j]; cout << ? << i << << j << endl; int x; cin >> x; if (x == -1) exit(0); return x; } void ans(int cnt, vector<int> p) { cout << ! n ; cout << cnt << endl; for (int x : p) cout << x << ; cout << endl; } int main() { cin >> n; init(); vector<int> a(n); for (int i = 0; i < n; ++i) a[i] = get(0, i); vector<int> x(n); for (int i = 0; i < n; ++i) x[i] = get(i, 0); int cnt = 0; vector<int> pans; for (int i = 0; i < n; ++i) { vector<int> b(n); for (int j = 0; j < n; ++j) b[j] = i ^ a[j]; vector<int> arr(n); for (int i : b) if (i < n) ++arr[i]; if (count(arr.begin(), arr.end(), 1) != n) continue; vector<int> p(n); for (int j = 0; j < n; ++j) p[b[j]] = j; bool f = true; for (int j = 0; j < n; ++j) if ((p[j] ^ b[0]) != x[j]) f = false; if (f) ++cnt, pans = p; } ans(cnt, pans); } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int n, k; while (cin >> n >> k) { int r = n, l = 1; cout << l; l++; for (int i = 1; i < k; i++) if (i % 2) { cout << << r; r--; } else { cout << << l; l++; } if (k % 2) for (int i = k; i < n; i++, l++) cout << << l; else for (int i = k; i < n; i++, r--) cout << << r; cout << endl; } } |
#include <bits/stdc++.h> using namespace std; long long m[1000005], n[1000005], w[1000005]; int main() { long long a, b, c; char ch[10]; while ((scanf( %lld%lld%lld , &a, &b, &c)) != EOF) { long long t; scanf( %lld , &t); long long p = 0, q = 0, r, sum1 = 0, sum2 = 0, f; for (int i = 0; i < t; i++) { scanf( %lld , &f); scanf( %s , ch); if (ch[0] == U ) m[p++] = f; else n[q++] = f; } sort(m, m + p); sort(n, n + q); long long i, j; long long l = 0; for (i = 0; i < a && i < p; i++) { sum2 += m[i]; sum1++; } while (m[i]) { w[l++] = m[i++]; } for (i = 0; i < b && i < q; i++) { sum2 += n[i]; sum1++; } while (n[i]) w[l++] = n[i++]; sort(w, w + l); for (int i = 0; i < c && i < l; i++) { sum2 += w[i]; sum1++; } printf( %lld %lld n , sum1, sum2); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; char s[25][25]; int c[25][25]; int chs[1 << 21]; int dp[1 << 21]; vector<int> hv; int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; ++i) { scanf( %s , s[i]); } for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { scanf( %d , c[i] + j); } } memset(chs, 0x3f, sizeof(chs)); for (int i = 0; i < n; ++i) { hv.push_back(1 << i); for (int j = 0; j < m; ++j) { chs[1 << i] = min(chs[1 << i], c[i][j]); } } for (int i = 0; i < m; ++i) { for (int j = 0; j < 26; ++j) { int num = 0, maxx = 0, sum = 0; for (int k = 0; k < n; ++k) { if (s[k][i] == j + a ) { num |= 1 << k; maxx = max(maxx, c[k][i]); sum += c[k][i]; } } if (!num) { continue; } if (chs[num] == 0x3f3f3f3f) { hv.push_back(num); } chs[num] = min(chs[num], sum - maxx); } } memset(dp, 0x3f, sizeof(dp)); dp[0] = 0; for (int i = 0; i < (1 << n) - 1; ++i) { for (int j : hv) { dp[i | j] = min(dp[i | j], dp[i] + chs[j]); } } printf( %d n , dp[(1 << n) - 1]); return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; const long long mod = 998244353; const long long maxn = 3e5 + 10; long long p[2] = {1000000007, 998244353}; long long seed[2] = {500000004, 500000004}; int main() { int x, a[6]; scanf( %d , &x); for (int i = 0; i < 6; i++) if (x & (1 << i)) a[i] = 1; else a[i] = 0; swap(a[0], a[4]); swap(a[2], a[3]); int y = 0; for (int i = 0; i < 6; i++) if (a[i]) y += 1 << i; printf( %d n , y); return 0; } |
#include <bits/stdc++.h> using namespace std; long long int n; long long int u; string s; int q; int count(long long int number) { if (!number) return 0; int result = 0; while (number % 2 == 0) { result++; number >>= 1; } return result; } long long int solve(long long int start, string s) { int tmp = count(n + 1) - 1; for (int i = 0; i < s.size(); ++i) { int zeros = count(start); long long int total = ((long long int)1 << (zeros + 1)) - 1; if (s[i] == U ) { if (zeros < tmp) { long long int tmp_one = start + (total - 1) / 2 + 1; long long int tmp_two = start - (total - 1) / 2 - 1; if (count(tmp_one) == zeros + 1) { start = tmp_one; } else start = tmp_two; } } else { if (s[i] == L ) { if (zeros) { long long int left = (total - 1) / 2; start = start - left + ((left - 1) / 2); } } else { if (s[i] == R ) { if (zeros) { long long int right = (total - 1) / 2; start = start + (right - 1) / 2 + 1; } } } } } return start; } int main() { cin >> n >> q; for (int i = 0; i < q; ++i) { cin >> u >> s; cout << solve(u, s) << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int boss = 2e5; map<int, int> used; queue<int> q; int n, k, c[2], a[boss + 10]; int main() { int i, answer = 0; cin >> n >> k; for (i = 1; i <= n; i++) { scanf( %d , &a[i]); if (used[a[i]] || c[a[i] % 2] == n / 2) q.push(i); else used[a[i]] = 1, c[a[i] % 2]++; } for (i = 1; i <= k && !q.empty(); i++) { if (used[i]) continue; if (c[i % 2] < n / 2) { c[i % 2]++; answer++; a[q.front()] = i; q.pop(); } } if (!q.empty()) return printf( -1 ), 0; else { cout << answer << endl; for (i = 1; i <= n; i++) printf( %d , a[i]); } } |
#include <bits/stdc++.h> using namespace std; const int mx = 2e5 + 10; int main() { int n, arr[mx], temp, z = 0; queue<int> visit; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &arr[i]); if (arr[i] == 0) visit.push(i); } temp = visit.front(); visit.pop(); for (int i = 0; i < n; i++) { if (arr[i] != 0) { if (visit.size() > 0) { if (abs(visit.front() - i) < abs(i - temp)) { temp = visit.front(); visit.pop(); } } printf( %d , abs(i - temp)); } else { if (i != n - 1) { if (arr[i + 1] == 0) { temp = visit.front(); visit.pop(); } } printf( 0 ); } if (i != n - 1) printf( ); } } |
#include <bits/stdc++.h> using namespace std; template <typename T> inline int len(const T &a) { return a.size(); } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int tc; cin >> tc; while (tc--) { int n, m; cin >> n >> m; vector<int> k(n); vector<int> c(m); for (auto &i : k) { cin >> i; --i; } for (auto &i : c) { cin >> i; } sort(k.rbegin(), k.rend()); int ptr = 0; long long ans = 0; for (int i = 0; i < n; ++i) { if (ptr > k[i] || c[k[i]] == c[ptr]) { ans += c[k[i]]; } else { ans += c[ptr++]; } } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 610001; const long long inf = (long long)5e16; struct node { long long val, id; }; node a[N], b[N]; bool cmp(node x, node y) { if (x.val == y.val) return x.id < y.id; return x.val < y.val; } long long n, m, ans[N], pos[N]; signed main() { scanf( %lld%lld , &m, &n); for (long long i = 1; i <= n; i++) { scanf( %lld , &a[i].val); a[i].id = i; } for (long long i = n + 1; i <= n + n; i++) { scanf( %lld , &b[i].val); b[i].id = i - n; b[i + n].val = b[i].val + m; b[i + n].id = i - n; b[i - n].val = b[i].val - m; b[i - n].id = i - n; } sort(a + 1, a + n + 1, cmp); sort(b + 1, b + 3 * n + 1, cmp); for (long long i = 1, j = 1; i <= n; i++) { while (a[i].val >= b[j].val && j <= 3 * n) j++; ans[0] += a[i].val; ans[j - i + 1] -= (a[i].val + a[i].val); } for (long long i = 1, j = 1; j <= 3 * n; j++) { ans[max(j - n + 1, 0LL)] -= b[j].val; while (b[j].val > a[i].val && i <= n) i++; ans[j - i + 2] += b[j].val + b[j].val; ans[j + 1] -= b[j].val; } long long sum = ans[0], id = 0, mi = inf; for (long long i = 1; i <= 2 * n + 1; i++) { sum += ans[i]; ans[i] += ans[i - 1]; if (mi > sum) { mi = sum; id = i; } } cout << mi << endl; for (long long i = 1; i <= n; i++) pos[a[i].id] = b[i + id - 1].id; for (long long i = 1; i <= n; i++) printf( %d , pos[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; int k, n, a; int d[1001]; bool vis[1001], flag; int main() { scanf( %d%d , &n, &k); int cut = 0; for (int i = 2; i <= k; i++) { if (k % i) continue; int crt = 1; while (k % i == 0) { crt *= i; k /= i; } d[cut++] = crt; } for (int i = 0; i < n; i++) { scanf( %d , &a); for (int j = 0; j < cut; j++) { if (a % d[j] == 0) { vis[j] = true; } } } flag = true; for (int j = 0; j < cut; j++) { flag &= vis[j]; } if (flag) printf( Yes n ); else printf( No n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int dx[] = {0, 1, -1, 0, 0}; const int dy[] = {0, 0, 0, 1, -1}; struct MinCostMaxFlow { int head[20010], total; int next[1000010], aim[1000010], flow[1000010], cost[1000010]; int f[20010], from[20010], p[20010]; bool v[20010]; MinCostMaxFlow() : total(1) {} void Add(int x, int y, int f, int c) { next[++total] = head[x]; aim[total] = y; flow[total] = f; cost[total] = c; head[x] = total; } void Insert(int x, int y, int f, int c) { Add(x, y, f, c); Add(y, x, 0, -c); } bool SPFA() { static queue<int> q; while (!q.empty()) q.pop(); memset(f, 0x3f, sizeof(f)); memset(v, false, sizeof(v)); f[0] = 0; q.push(0); while (!q.empty()) { int x = q.front(); q.pop(); v[x] = false; for (int i = head[x]; i; i = next[i]) if (flow[i] && f[aim[i]] > f[x] + cost[i]) { f[aim[i]] = f[x] + cost[i]; if (!v[aim[i]]) v[aim[i]] = true, q.push(aim[i]); from[aim[i]] = x; p[aim[i]] = i; } } return f[(20010 - 1)] != 0x3f3f3f3f; } int EdmondsKarp() { int re = 0; while (SPFA()) { int max_flow = 0x3f3f3f3f; for (int i = (20010 - 1); i != 0; i = from[i]) max_flow = ((max_flow) < (flow[p[i]]) ? (max_flow) : (flow[p[i]])); for (int i = (20010 - 1); i != 0; i = from[i]) { flow[p[i]] -= max_flow; flow[p[i] ^ 1] += max_flow; } re += f[(20010 - 1)] * max_flow; } return re; } } solver; int m, n; int src[110][110]; int main() { cin >> m >> n; for (int i = 1; i <= m; ++i) for (int j = 1; j <= n; ++j) scanf( %d , &src[i][j]); for (int i = 1; i <= m; ++i) for (int j = 1; j <= n; ++j) { if (i + j & 1) { solver.Insert(0, ((i - 1) * n + j), 1, 0); for (int k = 1; k <= 4; ++k) { int fx = i + dx[k], fy = j + dy[k]; if (!fx || !fy || fx > m || fy > n) continue; solver.Insert(((i - 1) * n + j), ((fx - 1) * n + fy), 1, src[i][j] != src[fx][fy]); } } else solver.Insert(((i - 1) * n + j), (20010 - 1), 1, 0); } cout << solver.EdmondsKarp() << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 51; struct BIT { int x[MAXN]; inline void add(int pos, int val); inline int query(int pos); }; BIT bit; int n, tp, res, totd, r; int x[MAXN], d[MAXN], st[MAXN], f[MAXN], g[MAXN]; long long int dsc[MAXN]; inline int read() { register int num = 0, neg = 1; register char ch = getchar(); while (!isdigit(ch) && ch != - ) { ch = getchar(); } if (ch == - ) { neg = -1; ch = getchar(); } while (isdigit(ch)) { num = (num << 3) + (num << 1) + (ch - 0 ); ch = getchar(); } return num * neg; } inline void BIT::add(int pos, int val) { for (; pos; pos -= pos & -pos) { x[pos] = max(x[pos], val); } } inline int BIT::query(int pos) { int res = 0; for (; pos <= totd; pos += pos & -pos) { res = max(res, x[pos]); } return res; } int main() { n = read(); for (register int i = 0; i <= n + 1; i++) { x[i] = read(); } for (register int i = 1; i <= n; i++) { d[i] = read(); } for (register int i = 1; i <= n; i++) { while (tp && x[i] > (long long int)2 * d[st[tp]] + x[f[st[tp]]]) { tp--; } f[i] = st[tp]; while (tp && (long long int)2 * d[i] + x[f[i]] >= (long long int)2 * d[st[tp]] + x[f[st[tp]]]) { tp--; } st[++tp] = i; } st[tp = 0] = n + 1, res = x[n + 1]; for (register int i = n; i; i--) { while (tp && x[i] < x[g[st[tp]]] - (long long int)2 * d[st[tp]]) { tp--; } g[i] = st[tp]; while (tp && x[g[i]] - (long long int)2 * d[i] <= x[g[st[tp]]] - (long long int)2 * d[st[tp]]) { tp--; } st[++tp] = i; } for (register int i = 1; i <= n; i++) { if (x[g[i]] - x[f[i]] <= 2 * d[i]) { return puts( 0 ), 0; } } for (register int i = 1; i <= n; i++) { res = min(res, x[g[i]] - x[f[i]]); x[i] - x[f[i]] < (long long int)2 * d[i] ? dsc[++totd] = (long long int)2 * d[i] + x[f[i]] : 1; f[i] == 0 && x[g[i]] - x[i] < (long long int)2 * d[i] ? res = min(res, x[i]) : 1; g[i] == n + 1 && x[i] - x[f[i]] < (long long int)2 * d[i] ? res = min(res, x[n + 1] - x[i]) : 1; } sort(dsc + 1, dsc + totd + 1), totd = unique(dsc + 1, dsc + totd + 1) - dsc - 1; for (register int i = 1; i <= n; i++) { if (x[g[i]] - x[i] < (long long int)2 * d[i]) { r = lower_bound(dsc + 1, dsc + totd + 1, x[g[i]] - (long long int)2 * d[i]) - dsc; if (r = bit.query(r)) { res = min(res, x[i] - r); } } if (x[i] - x[f[i]] < (long long int)2 * d[i]) { r = lower_bound(dsc + 1, dsc + totd + 1, x[f[i]] + (long long int)2 * d[i]) - dsc; bit.add(r, x[i]); } } printf( %.1lf n , res * 0.5); } |
#include <bits/stdc++.h> using namespace std; int T, N, M; int A[300][300]; int dx[4] = {0, 1, 0, -1}; int dy[4] = {1, 0, -1, 0}; int main() { scanf( %d , &T); for (; T--;) { scanf( %d%d , &N, &M); bool ok = true; for (int i = 0; i < N; i++) for (int j = 0; j < M; j++) { scanf( %d , &A[i][j]); int cnt = 0; for (int r = 0; r < 4; r++) { int x = i + dx[r], y = j + dy[r]; if (0 <= x && x < N && 0 <= y && y < M) cnt++; } if (A[i][j] > cnt) ok = false; else A[i][j] = cnt; } if (ok) { puts( YES ); for (int i = 0; i < N; i++) { for (int j = 0; j < M; j++) printf( %d%c , A[i][j], j + 1 == M ? n : ); } } else puts( NO ); } } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int r, g, b, w; cin >> r >> g >> b >> w; int count = 0; if (r % 2) count++; if (g % 2) count++; if (b % 2) count++; int m = min(r, min(g, b)); bool flag; if (count == 0) flag = true; else if (count == 1) { if (w % 2 == 0) flag = true; else flag = false; } else if (count == 2) { if (w % 2 == 0) flag = false; else if (m > 0) flag = true; else flag = false; } else { flag = true; } if (flag) cout << Yes n ; else cout << No n ; } } |
#include <bits/stdc++.h> using namespace std; const int N = 55; int n, k, dp[N][N]; long long a[N], sum[N], dq; int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %lld , &a[i]); for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i]; for (int i = 60; i >= 0; i--) { dq |= (long long)1 << i; dp[0][0] = 1; for (int j = 1; j <= n; j++) for (int l = 1; l <= k; l++) { dp[j][l] = 0; for (int o = j - 1; o >= 0; o--) if (((sum[j] - sum[o]) & dq) == dq) dp[j][l] |= dp[o][l - 1]; } if (!dp[n][k]) dq ^= (long long)1 << i; } printf( %lld , dq); } |
#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; vector<vector<int>> a(5, vector<int>(n)); for (int i = 0; i < n; i++) { string s; cin >> s; vector<int> aa(5); for (int j = 0; j < s.size(); j++) { aa[s[j] - a ]++; } for (int j = 0; j < 5; j++) { a[j][i] = 2 * aa[j] - s.size(); } } int ans = 0; for (int i = 0; i < 5; i++) { sort(a[i].begin(), a[i].end(), greater<int>()); long long sum = 0; int j = 0; for (; j < n; j++) { sum += a[i][j]; if (sum <= 0) { break; } } ans = max(j, ans); } cout << ans << n ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; long long n, n2 = 1, a[5010], dat[20010], ans = 0; vector<long long> v, vv[5010]; map<long long, long long> mp; void build(long long k, long long lb, long long ub) { if (lb == ub) return; build(k * 2 + 1, lb, (lb + ub) / 2); build(k * 2 + 2, (lb + ub) / 2 + 1, ub); dat[k] = min(dat[k * 2 + 1], dat[k * 2 + 2]); } long long query(long long k, long long lb, long long ub, long long tlb, long long tub) { if (ub < tlb || tub < lb) return 2e9; if (tlb <= lb && ub <= tub) return dat[k]; return min(query(k * 2 + 1, lb, (lb + ub) / 2, tlb, tub), query(k * 2 + 2, (lb + ub) / 2 + 1, ub, tlb, tub)); } long long dfs(long long lb, long long ub, long long lst) { if (lb > ub) return 0; long long ret = ub - lb + 1, mn = query(0, 0, n2 - 1, lb, ub), res = mn - lst; long long num = mp[mn], pos = lower_bound(vv[num].begin(), vv[num].end(), lb) - vv[num].begin(), pos2 = lower_bound(vv[num].begin(), vv[num].end(), ub + 1) - vv[num].begin() - 1; for (long long i = pos; i < pos2; i++) res += dfs(vv[num][i] + 1, vv[num][i + 1] - 1, mn); res += dfs(lb, vv[num][pos] - 1, mn) + dfs(vv[num][pos2] + 1, ub, mn); ret = min(ret, res); return ret; } int main() { cin >> n; for (int i = 0; i < n; i++) { scanf( %I64d , &a[i]); v.push_back(a[i]); } sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); for (int i = 0; i < v.size(); i++) mp[v[i]] = i; for (int i = 0; i < n; i++) vv[mp[a[i]]].push_back(i); while (n2 < n) n2 *= 2; for (int i = 0; i < 20005; i++) dat[i] = 1e18; for (int i = 0; i < n; i++) dat[i + n2 - 1] = a[i]; build(0, 0, n2 - 1); cout << dfs(0, n - 1, 0) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; #define FOR(i, n) for(int (i)=0; (i)<(n); (i)++) #define FOR1(i, n) for(int (i)=1; (i)<=(n); (i)++) #define FORI(i, n) for(int (i)=n-1; (i)>=0; (i)--) template<class T, class U> void umin(T& x, const U& y){ x = min(x, (T)y);} template<class T, class U> void umax(T& x, const U& y){ x = max(x, (T)y);} template<class T, class U> void init(vector<T> &v, U x, size_t n) { v=vector<T>(n, (T)x); } template<class T, class U, typename... W> void init(vector<T> &v, U x, size_t n, W... m) { v=vector<T>(n); for(auto& a : v) init(a, x, m...); } const int m = 2e5; const ll MOD = 1e9+7; int dp[10][m+1]; int main(int argc, char** argv) { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout << setprecision(15); if (argc == 2 && atoi(argv[1]) == 123456789) freopen( d: code cpp contests stdin , r , stdin); int T = 1; cin >> T; FOR(x, 10) dp[x][0] = 1; FOR1(i, m){ FOR(x, 9){ dp[x][i] = dp[x+1][i-1]; } dp[9][i] = (dp[1][i-1] + dp[0][i-1]) % MOD; } FOR1(t, T){ int n, m; cin >> n >> m; ll sol = 0; while(n){ int d = n%10; sol += dp[d][m]; n /= 10; } sol %= MOD; cout << sol << endl; } if (argc == 2 && atoi(argv[1]) == 123456789) cout << clock()*1.0/CLOCKS_PER_SEC << sec n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long f[110][2][2]; int ans[110]; int n; long long k; long long calc(long long x, long long a, long long b) { if (f[x][a][b] != -1) return f[x][a][b]; f[x][a][b] = 0; int y = n - x + 1; if (x > y) return f[x][a][b] = 1; for (int i = 0; i < 2; i++) if (ans[x] == -1 || ans[x] == i) for (int j = 0; j < 2; j++) if (ans[y] == -1 || ans[y] == j) if (i == j || x < y) if (a || i <= j) if (b || i + j <= 1) f[x][a][b] += calc(x + 1, a || (i < j), b || ((i + j) <= 0)); return f[x][a][b]; } int main() { scanf( %d %I64d , &n, &k); k++; memset(f, -1, sizeof(f)); memset(ans, -1, sizeof(ans)); if (calc(1, 0, 0) < k) return puts( -1 ), 0; for (int i = 1; i <= n; i++) { memset(f, -1, sizeof(f)); ans[i] = 0; if (calc(1, 0, 0) < k) { k -= calc(1, 0, 0); ans[i] = 1; } } for (int i = 1; i <= n; i++) printf( %d , ans[i]); puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; inline int init() { int now = 0, ju = 1; char c; bool flag = false; while (1) { c = getchar(); if (c == - ) ju = -1; else if (c >= 0 && c <= 9 ) { now = now * 10 + c - 0 ; flag = true; } else if (flag) return now * ju; } } inline long long llinit() { long long now = 0, ju = 1; char c; bool flag = false; while (1) { c = getchar(); if (c == - ) ju = -1; else if (c >= 0 && c <= 9 ) { now = now * 10 + c - 0 ; flag = true; } else if (flag) return now * ju; } } char str[200005]; long long mod; long long fastpow(long long base, long long power) { long long ret = 1; for (; power; power >>= 1) { if (power & 1) { ret = (ret * base) % mod; } base = (base * base) % mod; } return ret; } int main() { long long ans = 0x7fffffffffffll, nowans = 0; scanf( %s , str + 1); mod = llinit(); int n = strlen(str + 1); for (int i = 1; i <= n; i++) { nowans *= 10; nowans %= mod; nowans += (str[i] - 0 ); nowans %= mod; } ans = min(ans, nowans); for (int i = 1; i <= n - 1; i++) { nowans -= (1LL * (str[i] - 0 ) * fastpow(10, n - 1)); while (nowans < 0) nowans += mod; nowans %= mod; nowans *= 10; nowans %= mod; nowans += (str[i] - 0 ); nowans %= mod; if (str[i + 1] != 0 ) { ans = min(ans, nowans); } } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MAXN = +100500; const long long INF = 1e9; bool ans[MAXN]; long long get(long long x) { long long l = 0, r = INF; while (l + 1 < r) { long long m = (l + r) / 2; if (m * (m + 1) / 2 <= x) { l = m; } else { r = m; } } return l; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long a, b; cin >> a >> b; long long cnt = 0; long long up = get(a + b); for (long long i = up; i > 0; --i) { if (a >= i) { a -= i; ans[i] = 1; cnt++; } } cout << cnt << n ; for (long long i = 1; i <= up; ++i) { if (ans[i]) { cout << i << ; } } cout << n << up - cnt << n ; for (long long i = 1; i <= up; ++i) { if (!ans[i]) { cout << i << ; } } cout << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 2e5; int arr[MAX]; int main() { int T; cin >> T; while (T--) { int n; cin >> n; for (int i = 0; i < n; i++) { int c; cin >> c; arr[c - 1] = i; } int l = arr[0], r = arr[0]; for (int i = 0; i < n; i++) { if (arr[i] < l) l = arr[i]; else if (arr[i] > r) r = arr[i]; if (i == r - l) cout << 1; else cout << 0; } cout << n ; } } |
#include<iostream> #include<cstdio> #include<cmath> #include<algorithm> #include<string.h> #include<map> #include<vector> #include<string> using namespace std; const int maxN = 3e5+ 10; typedef long long int ll; #define mod 998244353 ll dp[maxN]; ll f[maxN]; string c[maxN]; int main() { int n,m; scanf( %d%d ,&n,&m); f[0]=1; for(int i=1;i<=n*m;i++) { f[i]=f[i-1]*2%mod; } dp[0]=dp[1]=0; for(int i=2;i<=max(n,m);i++) dp[i]=(dp[i-1]+dp[i-2]*2%mod+f[i-2])%mod; for(int i=1;i<=n;i++) cin>>c[i]; ll sum=0; for(int i=1;i<=n;i++) for(int j=0;j<m;j++) if(c[i][j]== o ) sum++; //cout<<dp[4]<<endl; ll ans=0; for(int i=1;i<=n;i++) { for(int j=0;j<m;j++) { int num=0; if(c[i][j]== o ) { while(j<m&&c[i][j]== o ) j++,num++; //cout<<num<<endl; ans=(ans+dp[num]*f[sum-num])%mod; } } } for(int i=0;i<m;i++) { for(int j=1;j<=n;j++) { int num=0; if(c[j][i]== o ) { while(j<=n&&c[j][i]== o ) j++,num++; //cout<<num<<endl; ans=(ans+dp[num]*f[sum-num])%mod; } } } cout<<ans<<endl; } |
#include <bits/stdc++.h> using namespace std; int mp[28]; bool fl[28]; int main() { int n, k; cin >> n >> k; string s; cin >> s; memset(mp, 0, sizeof(mp)); for (int i = 0; i < s.size(); i++) { mp[s[i] - a + 1]++; } int cnt = 0; int ans = 0; for (int i = 1; i <= 26; i++) { if (mp[i] != 0 && fl[i - 1] == 0) { ans += i; cnt++; fl[i] = 1; } if (cnt >= k) break; } if (cnt == k) cout << ans << endl; else cout << -1 << endl; } |
#include <bits/stdc++.h> using namespace std; void upd(long long &x, long long y) { x += y; } struct node { int nxt; long long sta, v[10]; node() { nxt = 0; memset(v, 0, sizeof(v)); } }; struct state { vector<node> nodes; int head[100007]; state() { memset(head, -1, sizeof(head)); } size_t size() const { return nodes.size(); } void sum() { for (int i = 0; i < nodes.size(); i++) for (int j = 1; j <= 9; j++) upd(nodes[i].v[j], nodes[i].v[j - 1]); } void update(int at, long long key, long long v) { int tmp = key % 100007; for (int i = head[tmp]; i != -1; i = nodes[i].nxt) if (nodes[i].sta == key) { upd(nodes[i].v[at], v); return; } node now; now.nxt = head[tmp]; head[tmp] = nodes.size(); now.v[at] = v; now.sta = key; nodes.push_back(now); } long long find(int at, long long key) { int tmp = key % 100007; for (int i = head[tmp]; i != -1; i = nodes[i].nxt) if (nodes[i].sta == key) return nodes[i].v[at]; return 0; } } f[11][20]; long long c[2][20], bit[15]; bitset<200> vis[15], pre[200], tmp; struct big { int a[35], len; void read() { memset(a, 0, sizeof(a)); len = 0; char ch = getchar(); for (; ch < 0 || ch > 9 ; ch = getchar()) ; for (; ch >= 0 && ch <= 9 ; ch = getchar()) a[len++] = ch - 48; } long long mod() { long long ans = 0; for (int i = 0; i < len; i++) ans = (10ll * ans + a[i]) % 1000000000000000007ll; return ans; } void plus() { a[len - 1]++; for (int i = len - 1; i >= 1; i--) a[i - 1] += a[i] / 10, a[i] %= 10; if (a[0] > 9) { a[0] = 1; for (int i = 1; i <= len; i++) a[i] = 0; len++; } } } L, R; int sum[40], times = 0; void dfs(int dep, int cnt, int sum, long long msk) { int mx = sum + (18 - cnt) * 9; tmp = pre[mx >> 1]; if (sum >> 1) tmp ^= pre[(sum >> 1) - 1]; if ((vis[dep - 1] & tmp) == tmp) return; if (dep == 10) { for (int i = sum >> 1; i >= 0; i--) if (vis[dep - 1][i]) { int dif = sum - i - i; if (dif > 1) { ::sum[cnt]++; f[dif][0].update(0, msk, 1); } break; } return; } vis[dep] = vis[dep - 1]; dfs(dep + 1, cnt, sum, msk); for (; cnt < 18;) { vis[dep] |= vis[dep] << dep; dfs(dep + 1, ++cnt, sum += dep, msk += bit[dep]); } } long long solve(int dif, big lim) { long long ans = 0, msk = 0; int len = lim.len; state *F = f[dif]; for (int i = 0; i < len; i++) if (len - i > 18) { for (int j = 0; j < lim.a[i]; j++) ans += F[len - i - 1].find(9, msk); } else if (lim.a[i]) { ans += F[len - i].find(lim.a[i] - 1, msk); msk += bit[lim.a[i]]; } return ans; } long long solve2(big lim) { int len = lim.len; long long ans = 0; int part = 0; for (int i = 0; i < len; i++) { int odd = lim.a[i] >> 1, even = lim.a[i] - odd; ans += c[part][len - 1 - i] * odd + c[part ^ 1][len - 1 - i] * even; part ^= lim.a[i] & 1; } return ans; } inline long long read() { long long x = 0; char ch = getchar(); for (; ch < 0 || ch > 9 ; ch = getchar()) ; for (; ch >= 0 && ch <= 9 ; ch = getchar()) x = x * 10 - 48 + ch; return x; } int main() { pre[0][0] = 1; for (int i = 1; i <= 190; i++) pre[i] = pre[i - 1], pre[i][i] = 1; c[0][0] = 1; for (int i = 1; i <= 18; i++) c[0][i] = c[1][i] = 5ll * (c[0][i - 1] + c[1][i - 1]) % 1000000000000000007ll; bit[1] = 1; for (int i = 2; i < 10; i++) bit[i] = bit[i - 1] << 5; vis[0].set(0); dfs(1, 0, 0, 0); for (int i = 2; i < 10; i++) { f[i][0].sum(); for (int j = 0; j < 18; j++) { state &cur = f[i][j], &nxt = f[i][j + 1]; for (int id = 0, sz = cur.size(); id < sz; id++) { int cnt = j; long long way = cur.nodes[id].v[9]; long long msk = cur.nodes[id].sta, tmp = msk; for (int k = 1; k < 10; k++, tmp >>= 5) { int rem = tmp & 31; if (!rem) continue; cnt += rem; nxt.update(k, msk - bit[k], way); } if (cnt < 18) nxt.update(0, msk, way); } nxt.sum(); } } int Q = read(); while (Q--) { L.read(); R.read(); R.plus(); int k = read(); long long ans = R.mod() - L.mod(); if (!k) { ans -= solve2(R) - solve2(L); for (int i = 2; i < 10; i += 2) ans -= solve(i, R) - solve(i, L); } else for (int i = k + 1; i < 10; i++) ans -= solve(i, R) - solve(i, L); printf( %lld n , (ans % 1000000000000000007ll + 1000000000000000007ll) % 1000000000000000007ll); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long mod = 1000000007; vector<long long> v(100004); vector<long long> t(100004, 0); int n; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int bsearch(int r, int key) { int l = -1; while (r - l > 1) { int m = (r + l) / 2; if (t[m] >= key) { r = m; } else { l = m; } } return r; } int longest() { int length = 1; t[0] = v[0]; for (int i = 1; i < n; ++i) { if (v[i] < t[0]) t[0] = v[i]; else if (v[i] > t[length - 1]) { t[length] = v[i]; length++; } else { t[bsearch(length - 1, v[i])] = v[i]; } } return length; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (int i = 0; i < n; ++i) { cin >> v[i]; } cout << longest(); return 0; } |
#include <bits/stdc++.h> using namespace std; map<long long, long long> dd; map<long long, long long> tong; int main() { long long n; cin >> n; string s; cin >> s; long long sum = 0; for (long long i = 0; i < s.size(); i++) { sum += (s[i] - 0 ); } for (long long i = 2; i <= s.size(); i++) { if (sum % i == 0) { long long tmp = sum / i, dem = 0; long long sum1 = 0; for (long long j = 0; j < s.size(); j++) { sum1 += (s[j] - 0 ); if (sum1 == tmp) { sum1 = 0; dem++; } } if (dem == i) { cout << YES ; return 0; } } } cout << NO ; } |
#include<iostream> #include<cstdio> #include<unordered_map> using namespace std; const int N=105; const int MOD=1000000007; int n,q; int c[N]; int b[N]; int sb[N],sc[N]; int l,r; int solve(int x) { static int f[N][N*N],g[N][N*N]; f[0][0]=g[0][0]=1; for(int i=1;i<=n;i++) { for(int j=0;j<max(i*x+sb[i-1],0);j++) f[i][j]=0; for(int j=max(i*x+sb[i-1],0);j<=sc[i];j++) f[i][j]=((long long)g[i-1][j-max(j-sc[i-1],0)]-(j-min(c[i],j)-1>=0?g[i-1][j-min(c[i],j)-1]:0)+MOD)%MOD; g[i][0]=f[i][0]; for(int j=1;j<=sc[i];j++) g[i][j]=(g[i][j-1]+f[i][j])%MOD; } int ans=0; for(int j=0;j<=sc[n];j++) ans=(ans+f[n][j])%MOD; return ans; } unordered_map<int,int>res; int main() { scanf( %d ,&n); for(int i=1;i<=n;i++) scanf( %d ,&c[i]); for(int i=1;i<n;i++) scanf( %d ,&b[i]); for(int i=1;i<n;i++) sb[i]=sb[i-1]+b[i]; for(int i=1;i<n;i++) sb[i]+=sb[i-1]; for(int i=1;i<=n;i++) sc[i]=sc[i-1]+c[i]; r=(sc[n]-sb[n-1])/n; for(int i=1;i<n;i++) r=min(r,(sc[i]-sb[i-1])/i); l=-sb[n-1]/n; for(int i=1;i<n;i++) l=min(l,sb[i-1]/i); for(int i=l;i<=r;i++) res[i]=solve(i); int pw=1; for(int i=1;i<=n;i++) pw=1LL*pw*(c[i]+1)%MOD; scanf( %d ,&q); while(q--) { int x; scanf( %d ,&x); if(x<l) printf( %d n ,pw); else if(x>r) printf( %d n ,0); else printf( %d n ,res[x]); } return 0; } |
#include <bits/stdc++.h> using namespace std; int m = 1e9 + 7; int p = 31; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); ; long long t = 1; cin >> t; while (t--) { long long w, h; cin >> w >> h; long long k1, k2, k3, k4; cin >> k1; vector<long long> points_h1; for (int i = 0; i < k1; i++) { long long x; cin >> x; points_h1.push_back(x); } cin >> k2; vector<long long> points_h2; for (int i = 0; i < k2; i++) { long long x; cin >> x; points_h2.push_back(x); } cin >> k3; vector<long long> points_v1; for (int i = 0; i < k3; i++) { long long x; cin >> x; points_v1.push_back(x); } cin >> k4; vector<long long> points_v2; for (int i = 0; i < k4; i++) { long long x; cin >> x; points_v2.push_back(x); } long long ans = max({w * (points_v1[points_v1.size() - 1] - points_v1[0]), w * (points_v2[points_v2.size() - 1] - points_v2[0]), h * (points_h1[points_h1.size() - 1] - points_h1[0]), h * (points_h2[points_h2.size() - 1] - points_h2[0])}); cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> void read(T &x) { int f = 0; x = 0; char ch = getchar(); for (; !isdigit(ch); ch = getchar()) f |= (ch == - ); for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - 0 ; if (f) x = -x; } const int N = 200005; int a[N], b[N], c[N], ans[N], n, m, cnt, s; pair<pair<int, int>, int> x[N]; int check(int lim) { priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > Q; int cost = 0, rem = 0, id = 0; for (int i = (cnt); i >= (1); i--) { if (x[i].second == 0) { if (!rem) { if (Q.empty()) return 0; rem = lim, cost += Q.top().first, id = Q.top().second, Q.pop(); if (cost > s) return 0; } rem--, ans[-x[i].first.second] = id; } else { Q.push(make_pair(x[i].first.second, x[i].second)); } } return 1; } int main() { read(n), read(m), read(s); for (int i = (1); i <= (m); i++) { read(a[i]); x[++cnt] = make_pair(make_pair(a[i], -i), 0); } for (int i = (1); i <= (n); i++) { read(b[i]); } for (int i = (1); i <= (n); i++) { read(c[i]); x[++cnt] = make_pair(make_pair(b[i], c[i]), i); } sort(x + 1, x + cnt + 1); int l = 1, r = m + 1; while (l < r) { int mid = (l + r) >> 1; if (check(mid)) r = mid; else l = mid + 1; } if (l == m + 1) puts( NO ); else { puts( YES ); check(l); for (int i = (1); i <= (m); i++) { printf( %d%c , ans[i], n [i == m]); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int arr[1001][1001]; int main() { int n, m, f1 = 0; cin >> n >> m; int cnt = m; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (i != j && arr[i][j] == 0) { arr[i][j] = 1; arr[j][i] = -1; cnt--; } if (cnt == 0) break; } if (cnt > 0) { f1 = 1; break; } cnt = m; } if (f1 == 1) cout << -1 << endl; else { cout << n * m << endl; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) if (arr[i][j] == 1) cout << i + 1 << << j + 1 << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void print1d(vector<T> &a) { for (long long int i = 0; i < a.size(); i++) { cout << a[i] << ; } cout << endl; } vector<long long int> divisor(long long int n) { vector<long long int> a; for (long long int i = 1; i * i <= n; i++) { if (n % i == 0) { if (n / i == i) a.push_back(i); else { a.push_back(i); a.push_back(n / i); } } } return a; } bool sortsecond(const pair<long long int, long long int> &a, const pair<long long int, long long int> &b) { return a.second < b.second; } bool isPrime(long long int n) { for (long long int i = 2; i * i <= n; i++) { if (n % i == 0) return false; } return true; } vector<string> split_string(const string &s, const string &delimiter) { vector<string> token; string ans; size_t end_point, start_point = 0, delim_length = delimiter.length(); while ((end_point = s.find(delimiter, start_point)) != string::npos) { ans = s.substr(start_point, end_point - start_point); start_point = end_point + delim_length; token.push_back(ans); } token.push_back(s.substr(start_point)); return token; } bool is_vowel(const char &a) { switch (a) { case a : case e : case i : case o : case u : case y : case A : case E : case I : case O : case U : return true; break; default: return false; break; } } bool sortstring(const string &a, const string &b) { return a.length() < b.length(); } void convert(string &s) { for (long long int i = 0; i < s.length(); i++) { if (s[i] >= A && s[i] <= Z ) s[i] = s[i] - A + a ; if (s[i] == o ) s[i] = 0 ; else if (s[i] == l || s[i] == i ) s[i] = 1 ; } } const long long int K = 998244353; void solve() { long long int n; cin >> n; string s; cin >> s; long long int fir = 0; long long int las = 0; char c = s[0]; long long int k = 0; for (long long int i = 0; i < n; i++) { k = i; if (s[i] == c) fir++; else { break; } } c = s[n - 1]; for (long long int i = n - 1; i >= k; i--) { if (s[i] == c) las++; else break; } if (s[0] == s[n - 1]) cout << ((las + 1) * (fir + 1)) % K << endl; else cout << (fir + las + 1) % K << endl; return; } int32_t main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); ; solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; #define l1 long long int #define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); #define test l1 t;cin>>t;while(t--) // Function to check // if parentheses are balanced bool isBalanced(string exp) { // Initialising Variables bool flag = true; l1 count = 0; // Traversing the Expression for (l1 i = 0; i < exp.length(); i++) { if (exp[i] == ( ) { count++; } else { // It is a closing parenthesis count--; } if (count < 0) { // This means there are // more Closing parenthesis // than opening ones flag = false; break; } } // If count is not zero, // It means there are // more opening parenthesis if (count != 0) { flag = false; } return flag; } int main() { fast test { l1 i,l; string str,str1= ,str2= ; cin>>str; l=str.size(); l1 a=0,b=0,c=0; for(i=0;i<l;i++) { if(str[i]== A ) { a++; } if(str[i]== B ) { b++; } if(str[i]== C ) { c++; } } l1 arr[3]; arr[0]=a;arr[1]=b;arr[2]=c; sort(arr,arr+3); char temp=NULL; if(arr[2]==a) { temp= A ; } else { if(arr[2]==b) { temp= B ; } else { temp= C ; } } for(i=0;i<l;i++) { if(str[i]==temp) { str1+= ( ; str2+= ) ; } else { str1+= ) ; str2+= ( ; } } if(isBalanced(str1) || isBalanced(str2)) { cout<< YES n ; } else { cout<< NO n ; } } } |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int l = s.size(); int a[2]; int b[2]; a[0] = a[1] = 0; b[0] = b[1] = 0; long long ans_odd = 0LL; long long ans_even = 0LL; for (int i = 0; i < l; i++) { ans_odd++; if (s[i] == a ) { ans_even += a[1 - i % 2]; ans_odd += a[i % 2]; } else { ans_even += b[1 - i % 2]; ans_odd += b[i % 2]; } a[i % 2] += (s[i] == a ); b[i % 2] += (s[i] == b ); } cout << ans_even << << ans_odd << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin.sync_with_stdio(false); cout.sync_with_stdio(false); cin >> n; vector<long long> q(1000100, 0); for (long long i = 0; i < n; i++) { long long t; cin >> t; q[t]++; } long long ans = 0; for (long long i = 0; (i < 1000100 - 1); ++i) { if (q[i] % 2 == 1) ans++; q[i + 1] += q[i] / 2; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, true) : false; } template <typename T> bool chmin(T& a, const T& b) { return b < a ? (a = b, true) : false; } int N, Q; const int MAX_N = 100000; const int BUCKET = 100, SIZE = 1000; char S[MAX_N + 17]; int bucketCnt[BUCKET][10][11][4]; int getId(char c) { if (c == A ) return 0; if (c == C ) return 1; if (c == G ) return 2; return 3; } void init() { for (int i = (int)(0); i < (int)(N); i++) { int bucketL = i / SIZE * SIZE; for (int j = (int)(1); j < (int)(11); j++) { bucketCnt[i / SIZE][(i - bucketL) % j][j][getId(S[i])]++; } } } void change(int idx, char c) { int bucketL = idx / SIZE * SIZE; for (int j = (int)(1); j < (int)(11); j++) { bucketCnt[idx / SIZE][(idx - bucketL) % j][j][getId(S[idx])]--; } S[idx] = c; for (int j = (int)(1); j < (int)(11); j++) { bucketCnt[idx / SIZE][(idx - bucketL) % j][j][getId(S[idx])]++; } } int getImpact(int l, int r, int M, char e[]) { int res = 0; for (int i = (int)(0); i < (int)(BUCKET); i++) { int bucketL = i * SIZE, bucketR = min(N, (i + 1) * SIZE); if (r <= bucketL || bucketR <= l) continue; if (l <= bucketL && bucketR <= r) { for (int j = (int)(0); j < (int)(min(M, bucketR - bucketL)); j++) { int x = (bucketL + j - l) % M; res += bucketCnt[i][j][M][getId(e[x])]; } continue; } for (int j = (int)(max(bucketL, l)); j < (int)(min(bucketR, r)); j++) { int x = (j - l) % M; res += e[x] == S[j]; } } return res; } int main() { scanf( %s , S); N = strlen(S); init(); scanf( %d , &Q); for (int i = (int)(0); i < (int)(Q); i++) { int t; scanf( %d , &t); if (t == 1) { int x; char c[17]; scanf( %d%s , &x, c); x--; change(x, c[0]); } else { int l, r; char e[17]; scanf( %d%d%s , &l, &r, e); l--; int M = strlen(e); printf( %d n , getImpact(l, r, M, e)); } } 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, k; cin >> n >> k; vector<int> v(n); for (auto &it : v) cin >> it; int ans = 0; sort(v.begin(), v.end()); for (int i = n - 1; i >= n - k; i--) ans += v[i - k] / v[i]; for (int i = 0; i < n - 2 * k; i++) ans += v[i]; cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, arr[1000], arr2[1000], i = 0; cin >> n; while (i < n) { cin >> arr[i]; arr2[arr[i]] = i + 1; i++; } sort(arr, arr + n); for (i = 0; i < n; i++) { cout << arr2[arr[i]] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 105; int zy[N][N * N / 2]; bool dp[N][N * N / 2]; deque<int> ans; void dfs(int n, int k) { if (n == 1) { ans.push_back(1); return; } else { if (zy[n][k] > 0) { dfs(n - zy[n][k] + 1, k - zy[n][k]); int sz = ans.size(); ans.push_front(zy[n][k] / 2 + sz); if (zy[n][k] & 1) { for (int i = (int)1; i <= (int)zy[n][k] / 2 - 2; ++i) { ans.push_back(sz + zy[n][k] / 2 + i); ans.push_back(sz + i); } ans.push_back(sz + zy[n][k] - 1); ans.push_back(sz + zy[n][k] / 2 - 1); ans.push_back(sz + zy[n][k] - 2); } else { for (int i = (int)1; i <= (int)zy[n][k] / 2 - 1; ++i) { ans.push_back(sz + zy[n][k] / 2 + i); ans.push_back(sz + i); } } } else { dfs(n + zy[n][k] + 1, k + zy[n][k] * (1 - zy[n][k]) / 2 + 1); int sz = ans.size(); if (ans.front() > ans.back()) { for (int i = (int)1; i <= (int)-zy[n][k] - 1; ++i) ans.push_back(sz + i); } else { for (int i = (int)1; i <= (int)-zy[n][k] - 1; ++i) ans.push_front(sz + i); } } } } int main() { dp[1][1] = 1; for (int i = (int)2; i <= (int)100; ++i) { for (int j = (int)i + 1; j <= (int)i * (i + 1) / 2; ++j) { for (int k = (int)i; k >= (int)2; --k) { if (k * (k + 1) / 2 <= j && dp[i - (k - 1)][j - (k * (k + 1) / 2 - 1)]) { dp[i][j] = 1; zy[i][j] = -k; break; } if (k >= 4 && dp[i - k + 1][j - k]) { dp[i][j] = 1; zy[i][j] = k; break; } } } } int q, n, k; cin >> q; while (q--) { cin >> n >> k; if (!dp[n][k]) { puts( NO ); } else { dfs(n, k); puts( YES ); while (ans.size()) { cout << ans.front() << ; ans.pop_front(); } cout << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; char ara[55][55]; bool ok(int i, int j) { if (i >= n || j < 0 || j >= n) return false; if (ara[i][j] == # ) return false; return true; } int main() { while (cin >> n) { for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cin >> ara[i][j]; } } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (ara[i][j] == . ) { if (ok(i + 1, j) && ok(i + 1, j - 1) && ok(i + 1, j + 1) && ok(i + 2, j)) { ara[i][j] = ara[i + 1][j] = ara[i + 1][j - 1] = ara[i + 1][j + 1] = ara[i + 2][j] = # ; } } } } bool flag = true; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (ara[i][j] == . ) { flag = false; } } } cout << (flag ? YES n : NO n ); } return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.