Datasets:
malteklaes
/
cpp-code-code_search_net-style

Dataset card Data Studio Files
xet
Community
1
func_code_string
stringlengths
59
71.4k
#include <bits/stdc++.h> using namespace std; using ll = long long; const int inf = 0x3f3f3f3f; const int N = 1e5 + 5; const int M = 1e5 + 5; const int mod = 1e9 + 7; int T; int n, ind, l, r; int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> ind >> l >> r; if (l == 1 && r == n) { cout << 0; } else if (l == 1) { cout << abs(r - ind) + 1; } else if (r == n) { cout << abs(ind - l) + 1; } else { if (ind >= l && ind <= r) { cout << min(r - ind, ind - l) + 2 + r - l; } else if (ind < l) { cout << r - ind + 2; } else { cout << ind - l + 2; } } cout << endl; return 0; }
#include <bits/stdc++.h> using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << : << arg1 << std::endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cerr.write(names, comma - names) << : << arg1 << | ; __f(comma + 1, args...); } const int mod = 1e9 + 7; int main() { int n; cin >> n; map<string, int> mp; for (int i = 0; i < n; i++) { string s; cin >> s; if (mp.find(s) != mp.end()) { cout << YES n ; continue; } else { cout << NO n ; mp[s] = 1; } } return 0; }
#include <bits/stdc++.h> using namespace std; namespace output { void pr(short x) { cout << x; } void pr(unsigned x) { cout << x; } void pr(int x) { cout << x; } void pr(long long x) { cout << x; } void pr(unsigned long long x) { cout << x; } void pr(double x) { cout << x; } void pr(long double x) { cout << x; } void pr(char x) { cout << x; } void pr(const char* x) { cout << x; } void pr(const string& x) { cout << x; } void pr(bool x) { cout << (x ? true : false ); } template <class S, class T> void pr(const pair<S, T>& x) { pr(1 ? ( : ), pr(x.first), pr(1 ? , : ), pr(x.second), pr(1 ? ) : ); } template <class T> void pr(const vector<T>& x) { pr(1 ? { : ); bool _ = 0; for (const auto& v : x) pr(_ ? 1 ? , : : ), pr(v), _ = 1; pr(1 ? } : ); } template <class T> void pr(const set<T>& x) { pr(1 ? { : ); bool _ = 0; for (const auto& v : x) pr(_ ? 1 ? , : : ), pr(v), _ = 1; pr(1 ? } : ); } template <class T> void pr(const multiset<T>& x) { pr(1 ? { : ); bool _ = 0; for (const auto& v : x) pr(_ ? 1 ? , : : ), pr(v), _ = 1; pr(1 ? } : ); } template <class S, class T> void pr(const map<S, T>& x) { pr(1 ? { : ); bool _ = 0; for (const auto& v : x) pr(_ ? 1 ? , : : ), pr(v), _ = 1; pr(1 ? } : ); } template <class S, class... T> void pr(const S& a, const T&... b) { pr(a); if (sizeof...(b)) pr( ), pr(b...); else pr( n ); } } // namespace output using namespace output; const int MN = 5e5 + 5; long long n, m, i, ds[MN][2], sz[MN], t[MN][2], h[MN][2], lst[MN][2], x, y; map<long long, long long> psa[MN]; char ch; long long fnd(long long n, long long p) { return ds[n][p] == n ? n : fnd(ds[n][p], p); } long long ttt(long long n, long long p) { return ds[n][0] == n ? (lst[n][0] >= p ? lst[n][0] : 0) : max(lst[n][0] >= p ? lst[n][0] : 0, ttt(ds[n][0], max(t[n][0], p))); } long long qu(long long n, long long p) { if (ds[n][1] == n) { if (psa[n].empty()) return 0LL; auto it = psa[n].lower_bound(p); auto ed = psa[n].end(); ed--; if (it == psa[n].begin()) return ed->second; else { it--; return ed->second - it->second; } } else { if (psa[n].empty()) return qu(ds[n][1], max(t[n][1], p)); auto it = psa[n].lower_bound(p); auto ed = psa[n].end(); ed--; if (it == psa[n].begin()) return ed->second + qu(ds[n][1], max(t[n][1], p)); else { it--; return ed->second - it->second + qu(ds[n][1], max(t[n][1], p)); } } } int main() { scanf( %lld%lld , &n, &m); for (i = 1; i <= n; i++) { sz[i] = 1; ds[i][0] = ds[i][1] = i; } for (i = 1; i <= m; i++) { scanf( %c%lld , &ch, &x); if (ch == U ) { scanf( %lld , &y); x = fnd(x, 1), y = fnd(y, 1); if (h[x][1] < h[y][1]) swap(x, y); if (h[x][1] == h[y][1]) h[x][1]++; sz[x] += sz[y]; ds[y][1] = x; t[y][1] = i; } else if (ch == M ) { scanf( %lld , &y); x = fnd(x, 0), y = fnd(y, 0); if (h[x][0] < h[y][0]) swap(x, y); if (h[x][0] == h[y][0]) h[x][0]++; ds[y][0] = x; t[y][0] = i; } else if (ch == Q ) { long long tt = ttt(x, 0); printf( %lld n , qu(x, tt)); } else if (ch == Z ) { x = fnd(x, 0); lst[x][0] = i; } else if (ch == A ) { x = fnd(x, 1); long long lst = 0; if (psa[x].size()) { auto it = psa[x].end(); it--; lst = it->second; } psa[x][i] = lst + sz[x]; } } return 0; }
#include <bits/stdc++.h> using namespace std; void solve(); int main() { srand(time(0)); cout.setf(ios::fixed); cout.precision(10); int tn = 1; for (int i = 0; i < tn; ++i) solve(); } vector<int> g[100001]; const long long mod = 1000000007; inline void add(long long &a, long long b) { a += b; a %= mod; } pair<long long, long long> dfs(int u) { sort(g[u].begin(), g[u].end()); long long res[2][2][2]; memset(res, 0, sizeof(res)); res[1][0][0] = 1; for (int i = 0; i < ((int)(g[u]).size()); ++i) { pair<long long, long long> c = dfs(g[u][i]); long long even = c.first; long long odd = c.second; long long cres[2][2][2]; for (int sum = 0; sum < 2; ++sum) for (int was_odd = 0; was_odd < 2; ++was_odd) for (int was_even = 0; was_even < 2; ++was_even) cres[sum][was_odd][was_even] = res[sum][was_odd][was_even]; for (int sum = 0; sum < 2; ++sum) for (int was_odd = 0; was_odd < 2; ++was_odd) for (int was_even = 0; was_even < 2; ++was_even) { add(res[sum ^ 1][1][was_even], odd * cres[sum][was_odd][was_even]); add(res[sum][was_odd][1], even * cres[sum][was_odd][was_even]); } } for (int sum = 0; sum < 2; ++sum) for (int was_odd = 0; was_odd < 2; ++was_odd) for (int was_even = 0; was_even < 2; ++was_even) { if ((was_odd && sum == 1) || (was_even && sum == 0)) add(res[sum][was_odd][was_even], res[sum][was_odd][was_even]); } long long odd = 0, even = 0; for (int was_odd = 0; was_odd < 2; ++was_odd) for (int was_even = 0; was_even < 2; ++was_even) { add(odd, res[1][was_odd][was_even]); add(even, res[0][was_odd][was_even]); } return make_pair(even, odd); } void solve() { int n; cin >> n; for (int i = 0; i < n - 1; ++i) { int p; cin >> p; --p; g[p].push_back(i + 1); } pair<long long, long long> res = dfs(0); cout << (res.first + res.second) % mod << n ; }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int n, m; cin >> n >> m; int a[n][m]; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) cin >> a[i][j]; int flag = 0; for (int i = n - 2; i >= 1; i--) { for (int j = m - 2; j >= 1; j--) { if ((a[i + 1][j] == a[i][j - 1]) || (a[i][j + 1] == a[i - 1][j])) { flag = 1; break; } else if (a[i][j] == 0) { a[i][j] = min(a[i + 1][j], a[i][j + 1]) - 1; } if (a[i][j] <= a[i - 1][j] || a[i][j] <= a[i][j - 1]) { flag = 1; break; } } } int sum = 0; for (int i = 0; i < n - 1; i++) { if (a[i][0] >= a[i + 1][0] || a[i][m - 1] >= a[i + 1][m - 1]) { flag = 1; break; } } for (int i = 0; i < m - 1; i++) { if (a[0][i] >= a[0][i + 1] || a[n - 1][i] >= a[n - 1][i + 1]) { flag = 1; break; } } if (flag == 1) { cout << -1 << n ; return 0; } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) sum += a[i][j]; } cout << sum; return 0; }
#include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; namespace IO_Optimization { inline int read() { int X = 0, w = 0; char ch = 0; while (!isdigit(ch)) { w |= ch == - ; ch = getchar(); } while (isdigit(ch)) { X = (X << 3) + (X << 1) + (ch ^ 48); ch = getchar(); } return w ? -X : X; } inline void write(long long x) { if (x < 0) putchar( - ), x = -x; if (x > 9) write(x / 10); putchar(x % 10 + 0 ); } } // namespace IO_Optimization using namespace IO_Optimization; int n, k; double sum; struct Node { int num, pos; } a[2000 + 2], b[2000 + 2]; struct Trans { int s[2000 + 2]; } ans[2000 + 2]; int tot1, tot2; inline bool cmp(Node x, Node y) { return x.num > y.num; } int main() { n = read(), k = read(); for (register int i = 1; i <= n; ++i) { int x = read(), y = read(); if (y == 1) a[++tot1].num = x, a[tot1].pos = i; else b[++tot2].num = x, b[tot2].pos = i; } sort(a + 1, a + 1 + tot1, cmp); int noww = k - 1 < tot1 ? k - 1 : tot1; for (register int i = 1; i <= noww; ++i) { ans[i].s[++ans[i].s[0]] = a[i].pos; sum += a[i].num * 0.5; } if (tot1 <= k - 1) { for (register int i = 1; i <= tot2; ++i) { int nowww = tot1 + i < k ? tot1 + i : k; sum += b[i].num; ans[nowww].s[++ans[nowww].s[0]] = b[i].pos; } } else { int minn = 1e9; for (register int i = k; i <= tot1; ++i) { sum += a[i].num; ans[k].s[++ans[k].s[0]] = a[i].pos; minn = a[i].num < minn ? a[i].num : minn; } for (register int i = 1; i <= tot2; ++i) { sum += b[i].num; ans[k].s[++ans[k].s[0]] = b[i].pos; minn = b[i].num < minn ? b[i].num : minn; } sum -= minn * 0.5; } printf( %.1lf n , sum); for (register int i = 1; i <= k; ++i, puts( )) { write(ans[i].s[0]); cout << ; for (register int j = 1; j <= ans[i].s[0]; ++j) { write(ans[i].s[j]); cout << ; } } return 0; }
#include <bits/stdc++.h> using namespace std; long long a[1 << 20], b[1 << 20], ans; char s[20][1 << 20]; int bit[1 << 20], now, k, n, m, i, N; void FWT(long long *a, int o) { for (int i = 1; i < N; i <<= 1) for (int j = 0; j < N; j += i << 1) for (int k = 0; k < i; k++) { long long x = a[j + k + i], y = a[j + k]; a[j + k] = y + x; a[j + k + i] = y - x; if (o) a[j + k] >>= 1, a[j + k + i] >>= 1; } } int main() { scanf( %d%d , &n, &m); N = 1 << n; for (i = 0; i < n; i++) scanf( %s , s[i]); for (k = 0; k < m; a[now]++, k++) for (i = now = 0; i < n; i++) now |= (1 << i) * (s[i][k] == 1 ); for (i = 0; i < N; i++) bit[i] = bit[i >> 1] + (i & 1); for (i = 0; i < N; i++) b[i] = min(bit[i], bit[(N - 1) ^ i]); FWT(a, 0); FWT(b, 0); for (i = 0; i < N; i++) a[i] *= b[i]; FWT(a, 1); ans = a[1]; for (i = 1; i < (1 << n); i++) ans = min(ans, a[i]); printf( %I64d n , ans); }
#include <bits/stdc++.h> using namespace std; using ll = long long; void solve(istream &cin = std::cin, ostream &cout = std::cout) { int test; cin >> test; int n, m; ll t; while (cin >> n >> m >> t) { vector<int> p(n); for (int &x : p) cin >> x; const int bound = *max_element(p.begin(), p.end()) + 1; auto check = [&](int d) { if (d == bound) return pair<int, bool>(-1, false); ll last = 0, sum_t = 0; int ptr = 0; bool good = true; int done = 0; for (int x : p) { if (x <= d) { if (ptr == m) { sum_t += last; ptr = 0; last = 0; } { sum_t += x; last += x; ptr++; if (sum_t > t) good = false; else done++; } } } return pair<int, bool>(done, good); }; int left = 0, right = bound; while (right - left > 1) { int mid = (left + right) / 2; if (check(mid).second) left = mid; else right = mid; } int ans = -1, d = -1; for (int i = left; i <= right; i++) { int cur = check(i).first; if (ans < cur) { ans = cur; d = i; } } if (d > t) d = t; cout << ans << << d << endl; } } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed; cout << setprecision(20); solve(); return 0; }
#include <bits/stdc++.h> using namespace std; const int inf = int(1e9) + 7; const double eps = 1e-9; vector<pair<int, int> > g[111]; int dp[111][111][30]; int n, m; int dfs(int u, int v, int x) { if (dp[u][v][x]) return dp[u][v][x]; dp[u][v][x] = 2; for (int i = 0; i < int((g[u]).size()); ++i) { pair<int, int> to = g[u][i]; if (to.second >= x) { if (dfs(v, to.first, to.second) == 2) { dp[u][v][x] = 1; break; } } } return dp[u][v][x]; } int main() { cin >> n >> m; for (int i = 1; i <= m; ++i) { int u, v; char c; cin >> u >> v >> c; g[u].push_back(make_pair(v, c - 97)); } for (int i = 1; i <= n; i++) { for (int j = 0; j < 26; j++) { dp[i][i][j] = 2; } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (!dp[i][j][0]) { dfs(i, j, 0); } if (dp[i][j][0] == 1) cout << A ; else cout << B ; } cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { double n, a, d, t, v; cin >> n >> a >> d; double minitime = 0; for (int i = 0; i < n; i++) { cin >> t >> v; double t1 = v / a; double s = a * 0.5 * t1 * t1; if (s > d) { t += sqrt(2 * d / a); } else { double x = d - s; double t2 = x / v; t += t1 + t2; } t = max(minitime, t); minitime = t; cout << t << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; long long int dp[5005][5005]; int main() { long long int n, m, k; cin >> n >> m >> k; long long int arr[n + 1]; long long int sum[n + 1]; for (int i = 1; i <= n; i++) cin >> arr[i]; sum[1] = 0; for (int i = 1; i <= m; i++) sum[1] += arr[i]; for (int i = 2; i <= n - m + 1; i++) sum[i] = sum[i - 1] + arr[i + m - 1] - arr[i - 1]; long long int res = -1; for (int i = 1; i <= n - m + 1; i++) dp[1][i] = max(dp[1][i - 1], sum[i]); for (int i = 2; i <= k; i++) { for (int j = 1; j <= n - m + 1; j++) { if (j > m * (i - 1)) dp[i][j] = max(dp[i][j - 1], dp[i - 1][j - m] + sum[j]); } } cout << dp[k][n - m + 1] << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); string s; char big = a ; string s1 = ; cin >> s; for (int i = s.size() - 1; i >= 0; i--) { if (int(s[i]) >= int(big)) { s1 += s[i]; big = s[i]; } } reverse(s1.begin(), s1.end()); cout << s1; return 0; }
#include <bits/stdc++.h> using namespace std; int n, m; vector<pair<int, int>> g[51][51]; int ch[51][51], vis[51][51], cnt; pair<int, int> par[51][51]; bool isValid(int x, int y) { if (x < 0 || y < 0 || x > n - 1 || y > m - 1) return false; return true; } int dx[] = {-1, 0, 0, 1}; int dy[] = {0, 1, -1, 0}; void dfs(int x, int y, int px, int py) { vis[x][y] = 1; par[x][y] = {px, py}; for (auto i = 0; i < 4; i++) { int curX = x + dx[i], curY = y + dy[i]; if (isValid(curX, curY) && ch[curX][curY] == ch[x][y]) { if (vis[curX][curY] == 0) dfs(curX, curY, x, y); else if (par[x][y].first != curX || par[x][y].second != curY) cnt++; } } } void Solve() { cin >> n >> m; for (auto i = 0; i < n; i++) { for (auto j = 0; j < m; j++) { char c; cin >> c; ch[i][j] = c - A + 1; } } for (auto i = 0; i < n - 1; i++) { for (auto j = 0; j < m - 1; j++) { if (ch[i + 1][j] == ch[i][j]) g[i][j].push_back({i + 1, j}), g[i + 1][j].push_back({i, j}); if (ch[i][j + 1] == ch[i][j + 1]) g[i][j].push_back({i, j + 1}), g[i][j + 1].push_back({i, j}); } } for (auto i = 0; i < n; i++) { for (auto j = 0; j < m; j++) { if (vis[i][j] == 0) { cnt = 0; dfs(i, j, -1, -1); if (cnt > 0) { cout << Yes ; return; } } } } cout << No ; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int T = 1; while (T--) Solve(); return 0; }
#include <bits/stdc++.h> int main() { int a, b, ans = 0; scanf( %d %d , &a, &b); if (a > b) { ans = (a - b) / 2; printf( %d %d , b, ans); } else if (a < b) { ans = (b - a) / 2; printf( %d %d , a, ans); } else if (a == b) { ans = (a - b) / 2; printf( %d %d , b, ans); } return 0; }
#include <bits/stdc++.h> using namespace std; long long n, m1, m2, len, bo, ans, fa[1000005], f[1000000], dep[1000000], nex[1000000], wen[1000000], hea[1000000], val[1000000], v[1000000]; struct arr { long long x, y, z, bo; } a[1000000]; bool cmp(arr x, arr y) { return x.z < y.z; } void add(long long x, long long y, long long z) { ++len; nex[len] = hea[x]; wen[len] = y; val[len] = z; hea[x] = len; } long long find(long long x) { if (fa[x] == x) return x; fa[x] = find(fa[x]); return fa[x]; } void dfs(long long x, long long y) { f[x] = y; dep[x] = dep[y] + 1; for (long long i = hea[x]; i; i = nex[i]) if (wen[i] != y) { v[wen[i]] = val[i]; dfs(wen[i], x); } } signed main() { scanf( %lld%lld%lld , &n, &m1, &m2); for (long long i = 1; i <= m1; i++) scanf( %lld%lld , &a[i].x, &a[i].y); for (long long i = m1 + 1; i <= m1 + m2; i++) scanf( %lld%lld%lld , &a[i].x, &a[i].y, &a[i].z); sort(a + 1, a + m1 + m2 + 1, cmp); for (long long i = 1; i <= n; i++) fa[i] = i; for (long long i = 1, j = 0; i <= m1 + m2 && j < n - 1; i++) { long long x = find(a[i].x), y = find(a[i].y); if (x != y) { ++j; a[i].bo = 1; fa[find(x)] = find(y); add(a[i].x, a[i].y, a[i].z); add(a[i].y, a[i].x, a[i].z); } } dfs(1, 0); for (long long i = 1; i <= n; i++) fa[i] = i; for (long long i = m1 + 1; i <= m1 + m2; i++) if (!a[i].bo) { long long x = find(a[i].x), y = find(a[i].y), z = a[i].z; while (x != y) { if (dep[x] < dep[y]) swap(x, y); if (v[x] == 0) ans += z, ++bo; fa[x] = find(f[x]); x = find(x); } } if (bo < m1) ans = -1; printf( %lld , ans); }
#include <bits/stdc++.h> using namespace std; const int MAXK = 1005, MAXM = 30, MOD = 7340033; int f[MAXM][MAXK]; void DP() { static int g[MAXK]; int m, k, i, j; f[0][0] = 1; for (m = 1; m < MAXM; m++) { memset(g, 0, sizeof(g)); g[0] = 1; for (i = 1; i <= 4; i++) for (k = MAXK - 1; k >= 0; k--) { for (j = 1; j <= k; j++) g[k] = (g[k] + (long long)g[k - j] * f[m - 1][j]) % MOD; } f[m][0] = 1; for (k = 1; k < MAXK; k++) f[m][k] = g[k - 1]; } } int GetM(int n) { int res = 0; for (; (n & 1) && n > 1; n >>= 1) res++; return res; } int main() { DP(); int tests, n, m, k; scanf( %d , &tests); while (tests--) { scanf( %d%d , &n, &k); m = GetM(n); printf( %d n , f[m][k]); } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxN = 2000 + 5; char s[maxN]; int t, n, k; vector<pair<int, int> > ans; void Reverse(int l, int r) { ans.push_back(make_pair(l, r)); for (int i = l; i <= (l + r) / 2; ++i) swap(s[i], s[l + r - i]); } int main() { scanf( %d , &t); while (t--) { scanf( %d%d , &n, &k); scanf( %s , s + 1); ans.clear(); for (int i = 1; i <= n; ++i) { if (i % 2 && s[i] == ) ) { int j = i + 1; while (s[j] == ) ) ++j; Reverse(i, j); } if (i % 2 == 0 && s[i] == ( ) { int j = i + 1; while (s[j] == ( ) ++j; Reverse(i, j); } } if (k < n / 2) { int pos = (k - 1) * 2 + 1; ans.push_back(make_pair(pos + 1, n - 1)); } printf( %d n , ans.size()); for (int i = 0; i != ans.size(); ++i) printf( %d %d n , ans[i].first, ans[i].second); } return 0; }
#include <bits/stdc++.h> int main() { int n, i, z = 0, o = 0; char str[120]; scanf( %d , &n); getchar(); gets(str); for (i = 0; i < n; i++) { if (str[i] == 0 ) { z++; } else { o++; } } if (o > 0) { printf( 1 ); } for (i = 0; i < z; i++) { printf( 0 ); } printf( n ); return 0; }
#include <bits/stdc++.h> using namespace std; int n, a, b; vector<pair<int, int> > res; vector<vector<int> > v; int cl[100000 * 2 + 5]; bool visited[100000 * 2 + 5]; void dfs(int now, int color) { if (visited[now]) return; visited[now] = true; cl[now] = color + 1; for (int i = 0; i < v[now].size(); i++) { dfs(v[now][i], !color); } } int main() { scanf( %d , &n); v.resize(n * 2); for (int i = 0; i < n; i++) { scanf( %d %d , &a, &b); a--; b--; res.push_back(make_pair(a, b)); v[a].push_back(b); v[b].push_back(a); } for (int i = 0; i < 2 * n; i += 2) { v[i].push_back((i + 1) % (n * 2)); v[(i + 1) % (n * 2)].push_back(i); } for (int i = 0; i < 2 * n; i++) { if (!visited[i]) { dfs(i, 0); } } for (int i = 0; i < n; i++) { printf( %d %d n , cl[res[i].first], cl[res[i].second]); } }
#include <bits/stdc++.h> using namespace std; string s; long long int n, k; long long int L, R; bool query(long long int l, long long int r) { l = max(1LL, l); r = min(n, r); cout << l << << r << endl; cin >> s; if (s == Bad ) exit(0); if (s == Yes ) { if (l == r) exit(0); return true; } return false; } int main() { ios_base::sync_with_stdio(0); srand(time(NULL)); string s; cin >> n >> k; L = 1; R = n; while (true) { long long int len = (R - L + 1); if (len <= 5 * k + 4) { len = rand() % len; query(L + len, L + len); L = max(1LL, L - k); R = min(n, R + k); } else { long long int M = (L + R) / 2; if (query(L, M)) { L = L - k; R = M + k; } else { L = M - k; R = R + k; } } L = max(1LL, L); R = min(n, R); } exit(0); }
#include <bits/stdc++.h> using namespace std; int a[200100]; int b[200100]; int p[200100]; int m[200100]; int main() { int n; scanf( %d , &n); for (int i = (0); i < (n); ++i) scanf( %d , &a[i]); for (int i = (0); i < (n); ++i) { scanf( %d , &b[i]); p[b[i]] = i; } int res = 0; m[0] = p[a[0]]; for (int i = (1); i < (n); ++i) m[i] = ((m[i - 1] < p[a[i]]) ? (p[a[i]]) : (m[i - 1])); for (int i = n - 1; i > 0; --i) if (m[i - 1] > p[a[i]]) res = n - i; cout << res << endl; return 0; }
#include <bits/stdc++.h> using namespace std; vector<pair<long long, long long> > v; map<char, bool> mpp; map<int, int>::iterator it; set<string> s; set<pair<int, int> >::iterator iter; deque<char> d; long long a[500001]; int main() { ios::sync_with_stdio(false); long long n, a, b, c, d, ans = 1, y1, y2, y3, y4; cin >> n >> a >> b >> c >> d; if (a >= d) { y1 = 1; y2 = a - d + 1; } else { y2 = 1; y1 = d - a + 1; } y4 = c + y1 - b; y3 = y4 + a - d; if (y1 <= 0) { y4 += 1 - y1; y3 += 1 - y1; y2 += 1 - y1; y1 += 1 - y1; } if (y2 <= 0) { y4 += 1 - y2; y3 += 1 - y2; y1 += 1 - y2; y2 += 1 - y2; } if (y3 <= 0) { y4 += 1 - y3; y1 += 1 - y3; y2 += 1 - y3; y3 += 1 - y3; } if (y4 <= 0) { y1 += 1 - y4; y3 += 1 - y4; y2 += 1 - y4; y4 += 1 - y4; } if (y4 > n || y3 > n || y2 > n || y1 > n) { cout << 0; return 0; } if (n - max(y1, max(y2, max(y3, y4))) > 0) ans += n - max(y1, max(y2, max(y3, y4))); cout << ans * n; return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; int dp[maxn], num[30]; int main() { int i, j, k, n, m, t, l, ans, x, y, z; char s[maxn]; scanf( %d , &t); while (t--) { scanf( %d%d%d , &n, &m, &k); scanf( %s , s); ans = 1e9; memset(num, 0, sizeof(num)); for (i = 0; i < k; i++) { num[s[i] - A + 1]++; } for (l = 1; l <= 26; l++) { if (num[l] == 0) continue; for (i = 0; i <= k; i++) dp[i] = 0; dp[0] = 1; for (i = 1; i <= 26; i++) { if (num[i] == 0 || i == l) continue; for (j = k; j >= num[i]; j--) if (dp[j - num[i]] == 1) dp[j] = 1; } for (i = 0; i <= k; i++) { if (dp[i] == 1) { if (i + num[l] >= n) { x = max(0, n - i); z = k - num[l] - i; if (z + num[l] - x >= m) { y = max(0, m - z); ans = min(ans, x * y); } } } } } printf( %d n , ans); } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; const int INF = 0x3f3f3f3f; const double eps = 1e-9; const int mod = 1e9 + 7; int dp[N]; int main() { dp[0] = 1; int num; while (scanf( %d , &num) != EOF) { bool flag = 0; if (num == 1) { printf( 1 1 n ); printf( 1 n ); return 0; } int ans, cnt; for (int i = 1; i <= 2; i++) { for (int j = 0; j < N; j++) { if (j >= i) { dp[j] += dp[j - i]; } if (dp[j] == num) { ans = j; cnt = i; flag = 1; break; } } if (flag) { printf( %d %d n , ans, cnt); if (cnt == 1) printf( 1 n ); else printf( 1 2 n ); break; } } } return 0; }
#include <bits/stdc++.h> using namespace std; const double eps = 1e-9; const int mod = (int)1e+9 + 7; const double pi = acos(-1.); const int maxn = 1000100; long long a[maxn]; int main() { { srand(time(0)); const string file = ; if (!file.empty()) { freopen((file + .in ).c_str(), r , stdin); freopen((file + .out ).c_str(), w , stdout); } } int n; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %lld , &a[i]); } long long ans = 0, pref = 0; for (int i = 0; i < n; i++) { ans += pref * (min(a[i], i ? a[i - 1] : mod) - 1) + a[i] - 1; ans %= mod; long long h = min(i ? a[i - 1] : mod, i + 1 == n ? mod : a[i + 1]); h = min(h, a[i]); h--; pref *= h; pref += min(a[i], i + 1 < n ? a[i + 1] : mod) - 1; pref %= mod; } printf( %lld , ans); return (0); }
#include <bits/stdc++.h> using namespace std; int main() { long long a1, a2, a3, a4, c = 0; cin >> a1 >> a2 >> a3 >> a4; string s; cin >> s; for (int i = 0; i < s.size(); i++) { if (s[i] == 1 ) c += a1; else if (s[i] == 2 ) c += a2; else if (s[i] == 3 ) c += a3; else if (s[i] == 4 ) c += a4; } cout << c; return 0; }
#include <bits/stdc++.h> using namespace std; class Edge { public: int neighbour; int edge_number; int weight; Edge(int neigh, int edge_no, int weig) { neighbour = neigh; edge_number = edge_no; weight = weig; } }; int main() { int n, m; cin >> n >> m; vector<vector<Edge> > adj_list(n + 1); for (int i = 1; i <= m; i++) { int vertex1, vertex2, weight; cin >> vertex1 >> vertex2 >> weight; Edge temp = Edge(vertex2, i, weight); adj_list[vertex1].push_back(temp); temp = Edge(vertex1, i, weight); adj_list[vertex2].push_back(temp); } int source; cin >> source; vector<bool> check_list(n + 1, false); priority_queue<pair<long long int, int> > pq; vector<pair<int, int> > parent(n + 1, make_pair(0, 0)); for (int i = 1; i <= n; i++) { if (i != source) pq.push(make_pair(LLONG_MIN, i)); else pq.push(make_pair(0, i)); } vector<pair<long long int, int> > dist(n + 1, make_pair(LLONG_MAX, 0)); dist[source].first = 0; while (!pq.empty()) { int vertex = pq.top().second; pq.pop(); if (check_list[vertex] == false) { check_list[vertex] = true; for (int i = 0; i < adj_list[vertex].size(); i++) { if (dist[adj_list[vertex][i].neighbour].first > dist[vertex].first + adj_list[vertex][i].weight) { parent[adj_list[vertex][i].neighbour].first = adj_list[vertex][i].edge_number; parent[adj_list[vertex][i].neighbour].second = adj_list[vertex][i].weight; dist[adj_list[vertex][i].neighbour].first = dist[vertex].first + adj_list[vertex][i].weight; dist[adj_list[vertex][i].neighbour].second = adj_list[vertex][i].weight; pq.push(make_pair((-1) * (dist[adj_list[vertex][i].neighbour].first), adj_list[vertex][i].neighbour)); } else if (dist[adj_list[vertex][i].neighbour].first == dist[vertex].first + adj_list[vertex][i].weight) { if (dist[adj_list[vertex][i].neighbour].second > adj_list[vertex][i].weight) { parent[adj_list[vertex][i].neighbour].first = adj_list[vertex][i].edge_number; parent[adj_list[vertex][i].neighbour].second = adj_list[vertex][i].weight; dist[adj_list[vertex][i].neighbour].second = adj_list[vertex][i].weight; } } } } } long long int ans = 0; for (int i = 1; i <= n; i++) { ans += parent[i].second; } cout << ans << endl; for (int i = 1; i <= n; i++) { if (source != i) cout << parent[i].first << ; } }
#include <bits/stdc++.h> using namespace std; long long dp[55][55]; int main() { int n, m, t; cin >> n >> m >> t; dp[0][0] = 1; for (int i = 1; i <= 31; ++i) for (int j = 1; j <= 31; ++j) dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j]; long long sol = 0; for (int i = 4; i <= n; ++i) for (int j = 1; j <= m; ++j) if (i + j == t) { sol = sol + dp[n + 1][i + 1] * dp[m + 1][j + 1]; } cout << sol << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int dp[81][81][81][81]; vector<pair<int, int>> graph[81]; int solve(int v, int l, int r, int k) { if (k == 0) return 0; if (dp[v][l][r][k] != -1) return dp[v][l][r][k]; int &ret = dp[v][l][r][k]; ret = 1000000; for (auto e : graph[v]) { int w = e.second; int u = e.first; if (u < r && u > v) { ret = min(ret, solve(u, v, r, k - 1) + w); } if (u > l && u < v) { ret = min(ret, solve(u, l, v, k - 1) + w); } } return ret; } int main() { int n, k; scanf( %d %d , &n, &k); int m; scanf( %d , &m); for (int i = 0; i < m; i++) { int a, b, c; scanf( %d %d %d , &a, &b, &c); graph[a].push_back({b, c}); } int ans = 1000000; memset(dp, -1, sizeof dp); for (int i = 1; i <= n; i++) { ans = min(ans, solve(i, 0, n + 1, k - 1)); } printf( %d n , ans >= 1000000 ? -1 : ans); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { char s1[1000], s2[1000], s3[1000]; int i, l1, l2, l3; scanf( %s%s%s , s1, s2, s3); l1 = strlen(s1); l2 = strlen(s2); l3 = strlen(s3); strcat(s1, s2); sort(s1, s1 + l1 + l2); sort(s3, s3 + l3); if (l1 + l2 == l3) { for (i = 0; i <= (l1 + l2); i++) { if (s1[i] != s3[i]) { printf( NO n ); break; } else if (i == l1 + l2) { printf( YES n ); } } } else { printf( NO n ); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { string a, b; cin >> a >> b; if (a == b) cout << a; else cout << 1; return 0; }
// #include <bits/stdc++.h> using namespace std; #define fi first #define se second #define all(x) x.begin(), x.end() #define lch (o << 1) #define rch (o << 1 | 1) typedef double db; typedef long long ll; typedef unsigned int ui; typedef pair<int, int> pint; typedef tuple<int, int, int> tint; const int N = 1e5 + 5; const int INF = 0x3f3f3f3f; const ll INF_LL = 0x3f3f3f3f3f3f3f3f; int a[N]; int mxsuf[N]; int main() { ios::sync_with_stdio(0); int n; cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; vector<int> vec; int pre = 1; for (int i = 2; i < n; i++) { int sgn1 = a[i] - a[i - 1]; sgn1 /= abs(sgn1); int sgn2 = a[i + 1] - a[i]; sgn2 /= abs(sgn2); if (sgn1 * sgn2 == -1) { vec.push_back(i - pre + 1); pre = i; } } vec.push_back(n - pre + 1); int m = vec.size(); for (int i = m - 1; i >= 0; i--) mxsuf[i] = max(mxsuf[i + 1], vec[i]); int dir = a[2] - a[1]; dir /= abs(dir); int ans = 0; int mxpre = 0; for (int i = 0; i < m; i++) { if (i - 2 >= 0) mxpre = max(mxpre, vec[i - 2]); if (dir == -1 && i > 0) { int mx = max(vec[i - 1], vec[i]); int mn = min(vec[i - 1], vec[i]); bool flag = (mxpre >= mx); if (i + 1 < m) flag |= mxsuf[i + 1] >= mx; flag |= (mn % 2 == 0); flag |= (mn % 2 == 1) && (mn < mx); ans += !flag; } dir *= -1; } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 700 + 5; int n, m, d[N], cnt[N][N]; bitset<N> adj[N]; long long ans; int main() { scanf( %d%d , &n, &m); for (int i = 0, u, v; i < m; i++) { scanf( %d%d , &u, &v); d[--u]++, d[--v]++; adj[u][v] = adj[v][u] = true; } for (int u = 0; u < n; u++) for (int v = u; v < n; v++) cnt[u][v] = cnt[v][u] = (adj[u] & adj[v]).count(); for (int u = 0; u < n; u++) for (int v = 0; v < n; v++) if (adj[u][v]) { for (int x = 0; x < n; x++) ans += 1LL * (u ^ x && v ^ x) * (cnt[u][x] - adj[x][v]) * (cnt[v][x] - adj[x][u]); ans -= cnt[u][v] * (d[u] - 2); } printf( %lld n , ans / 10); }
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; struct Sync_stdio { Sync_stdio() { cin.tie(NULL); ios_base::sync_with_stdio(false); } } _sync_stdio; struct FAIL { FAIL() { cout << CHANGE!!! << n ; } }; string go(int iter, long long a, long long b, long long x) { string res; vector<int> used(26); for (int l = (0); l < (iter); ++l) { int j = 0; for (int i = (0); i < (a); ++i) { while (used[j]) { ++j; } res += a + j; ++j; } char sym = res[res.size() - x]; for (int i = (0); i < (b); ++i) { res += sym; } for (int i = (0); i < (26); ++i) { used[i] = 0; } for (int i = (0); i < (a); ++i) { used[res[res.size() - 1 - i] - a ] = 1; } } return res; } int solve(int a, int b, int l, int r, int x) { string s1 = go(10, a, b, x + 1); set<char> ss; for (int i = (l); i < (r + 1); ++i) { ss.insert(s1[i]); } return ss.size(); } int main() { long long a, b, l, r; cin >> a >> b >> l >> r; --l, --r; long long start = l / (a + b); long long end = r / (a + b); if (r - l > 6 * (a + b)) { cout << max(a + 1LL, a + a - b) << n ; return 0; } l -= start * (a + b); r -= start * (a + b); int res = INT_MAX; for (int i = (0); i < (a); ++i) { res = min(res, solve(a, b, l, r, i)); } cout << res; }
// Author: HarshKumar #include <bits/stdc++.h> using namespace std; #define ll int64_t const ll N = 1e6 + 6, M = 1e9 + 7; int main() { ios::sync_with_stdio(false), cin.tie(nullptr); ll n, k; cin >> n >> k; ll x = min(k * k + 1, n); string s(x, a ); map<char, ll> f; for (ll i = 0; i < k; i++) f[ a + i] = i; for (ll i = 1; i < x; i++) s[i] = a + f[s[i - 1]] % k, f[s[i - 1]]++; s.erase(s.begin()); cout << a ; n--; x--; for (ll i = 0; i < n; i++) cout << s[i % x]; }
#include <bits/stdc++.h> using namespace std; long long inf = std::numeric_limits<long long>::max(); int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long T; cin >> T; while (T--) { long long n, i; cin >> n; string str; cin.ignore(); cin >> str; long long len = str.length(); long long count = 0; for (i = 0; i < len; i++) { string y = ; y += str[i]; long long num = stoi(y); if (num > 0) { count += (num); } if (i != (n - 1) && num > 0) { count++; } } cout << count << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; char s[10]; int f[2001], c[2001], mtr[2001][2001], n, m, q, x, y; int main() { scanf( %d%d%d , &n, &m, &q); for (int i = 1; i <= n; i++) { f[i] = i; for (int j = 1; j <= m; j++) { scanf( %d , &mtr[i][j]); c[j] = j; } } while (q--) { scanf( %s%d%d , s, &x, &y); if (s[0] == c ) swap(c[x], c[y]); else if (s[0] == r ) swap(f[x], f[y]); else printf( %d n , mtr[f[x]][c[y]]); } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; char s[maxn]; struct Node { int sum, pmx, lmx, mi, ma, d; Node() {} Node(int a, int b, int c, int d, int e, int f) { sum = a; pmx = b; lmx = c; mi = d; ma = e; d = f; } }; Node segT[maxn << 2]; void maintain(int curPos) { segT[curPos].sum = segT[curPos << 1].sum + segT[curPos << 1 | 1].sum; segT[curPos].pmx = max(segT[curPos << 1].pmx, max(segT[curPos << 1 | 1].ma - 2 * segT[curPos << 1].mi + segT[curPos << 1].sum, segT[curPos << 1 | 1].pmx - segT[curPos << 1].sum)); segT[curPos].lmx = max(segT[curPos << 1].lmx, max(segT[curPos << 1 | 1].lmx - segT[curPos << 1].sum, segT[curPos << 1].ma - 2 * segT[curPos << 1 | 1].mi - 2 * segT[curPos << 1].sum)); segT[curPos].mi = min(segT[curPos << 1].mi, segT[curPos << 1 | 1].mi + segT[curPos << 1].sum); segT[curPos].ma = max(segT[curPos << 1].ma, segT[curPos << 1 | 1].ma + segT[curPos << 1].sum); segT[curPos].d = max(max(segT[curPos << 1].d, segT[curPos << 1 | 1].d), max(segT[curPos << 1].ma + segT[curPos << 1 | 1].pmx - segT[curPos << 1].sum, segT[curPos << 1].lmx + segT[curPos << 1].sum + segT[curPos << 1 | 1].ma)); } void build(int curPos, int curL, int curR) { if (curL == curR) { curR = s[curL] == ( ? 1 : -1; segT[curPos] = Node(curR, -curR, -curR, curR, curR, 0); return; } int mid = curL + curR >> 1; build(curPos << 1, curL, mid); build(curPos << 1 | 1, mid + 1, curR); maintain(curPos); } void update(int pos, int curPos, int curL, int curR) { if (curL == curR) return build(curPos, curL, curR); int mid = curL + curR >> 1; if (pos <= mid) update(pos, curPos << 1, curL, mid); else update(pos, curPos << 1 | 1, mid + 1, curR); maintain(curPos); } int main() { int n, m; scanf( %d%d , &n, &m); scanf( %s , s + 1); n = n * 2 - 2; build(1, 1, n); printf( %d n , segT[1].d); while (m--) { int x, y; scanf( %d%d , &x, &y); swap(s[x], s[y]); update(x, 1, 1, n); update(y, 1, 1, n); printf( %d n , segT[1].d); } return 0; }
#include <bits/stdc++.h> using namespace std; long long mo(long long a) { return a % (long long)(1e9 + 7); } long long po(long long x, long long y, long long p) { long long res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y >>= 1; x = (x * x) % p; } return res % p; } vector<long long> a; long long solve(long long last_bit, vector<long long> &cur) { if (last_bit < 0) return 0; long long n = cur.size(); vector<long long> ze, one; for (long long i = 0; i < n; i++) { if ((1LL << last_bit) & cur[i]) one.push_back(cur[i]); else ze.push_back(cur[i]); } if (ze.size() == 0 || one.size() == 0) return solve(last_bit - 1, cur); else return 1 + max(solve(last_bit - 1, ze), solve(last_bit - 1, one)); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n; cin >> n; a.resize(n); for (long long i = 0; i < a.size(); i++) cin >> a[i]; ; long long ans = solve(30, a); cout << n - ans - 1 << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int a, b; cin >> a >> b; int p; string s[100]; string s1, s2, s3 = , s4 = , s5 = , s6, s7, s8, s9; for (int i = 0; i < a; i++) { int p = 0; cin >> s[i]; s6 = s[i]; reverse(s6.begin(), s6.end()); if (s[i] == s6) { s7 = s[i]; } } for (int i = 0; i < a - 1; i++) { s2 = s[i]; reverse(s[i].begin(), s[i].end()); for (int j = i + 1; j < a; j++) { if (s[i] == s[j]) { s3 = s3 + s2; s8 = s[j]; s4 = s8 + s4; } } } s9 = s3 + s7 + s4; cout << s9.size() << endl; int l = s9.size(); if (l != 0) { cout << s3 + s7 + s4 << endl; } }
#include <bits/stdc++.h> int n, m, q; char str[1005]; bool a[1005][1005]; std::vector<std::pair<int, int> > del; int num[1005][1005], tot, ld, ru; std::set<std::pair<int, int> > s; namespace FU { int f[1005 * 1005]; std::vector<int> inv[1005 * 1005]; std::set<int> su; void init(int i) { if (su.count(i)) return; su.insert(i); f[i] = i; inv[i].push_back(i); } void mrg(int u, int v) { init(u); init(v); u = f[u]; v = f[v]; if (u == v) return; for (int i = 0; i < inv[u].size(); i++) { f[inv[u][i]] = v; inv[v].push_back(inv[u][i]); } inv[u].clear(); } bool cnn(int u, int v) { init(u); init(v); return f[u] == f[v]; } void cl() { for (std::set<int>::iterator i = su.begin(); i != su.end(); i++) { f[*i] = 0; inv[*i].clear(); } su.clear(); } } // namespace FU using namespace FU; inline void dfs(int x, int y, int id) { num[x][y] = id; for (int i = x - 1; i <= x + 1; i++) for (int j = y - 1; j <= y + 1; j++) if (a[i][j] && !num[i][j]) dfs(i, j, id); } inline void R1(int x, int y) { for (int i = x - 1; i <= x + 1; i++) for (int j = y - 1; j <= y + 1; j++) if (0 <= i && i <= n + 1 && 0 <= j && j <= m + 1 && num[i][j]) mrg(num[x][y], num[i][j]); } inline void R2(int x, int y) { for (int i = x - 2; i <= x + 2; i++) for (int j = y - 2; j <= y + 2; j++) if (0 <= i && i <= n + 1 && 0 <= j && j <= m + 1 && num[i][j] && num[x][y] != num[i][j]) s.insert(std::make_pair(num[x][y], num[i][j])); } inline bool chk(int x, int y) { for (int i = x - 2; i <= x + 2; i++) for (int j = y - 2; j <= y + 2; j++) if (0 <= i && i <= n + 1 && 0 <= j && j <= m + 1 && num[i][j]) if ((cnn(num[x][y], ld) && cnn(num[i][j], ru)) || (cnn(num[x][y], ru) && cnn(num[i][j], ld))) return 1; return 0; } int main() { scanf( %d%d%d , &n, &m, &q); for (int i = 3; i <= n + 1; i++) a[i][0] = 1; for (int i = 1; i <= n - 2; i++) a[i][m + 1] = 1; for (int i = 3; i <= m + 1; i++) a[0][i] = 1; for (int i = 1; i <= m - 2; i++) a[n + 1][i] = 1; for (int i = 1; i <= n; i++) { scanf( %s , str + 1); for (int j = 1; j <= m; j++) a[i][j] = str[j] == # ; } for (int i = 0; i <= n + 1; i++) for (int j = 0; j <= m + 1; j++) if (a[i][j] && !num[i][j]) dfs(i, j, ++tot); for (int i = 0; i <= n + 1; i++) for (int j = 0; j <= m + 1; j++) if (num[i][j]) R2(i, j); ld = num[3][0]; ru = num[0][3]; while (q--) { cl(); init(ld); init(ru); del.clear(); int k; scanf( %d , &k); int lst = tot; bool flg = 1; for (int i = 1; i <= k; i++) { int x, y; scanf( %d%d , &x, &y); num[x][y] = ++tot; R1(x, y); del.push_back(std::make_pair(x, y)); } for (std::set<int>::iterator i = su.begin(); i != su.end(); i++) for (std::set<int>::iterator j = su.begin(); j != su.end(); j++) if (cnn(*i, ld) && cnn(*j, ru) && (s.count(std::make_pair(*i, *j)) || s.count(std::make_pair(*j, *i)))) flg = 0; for (std::vector<std::pair<int, int> >::iterator it = del.begin(); it != del.end(); it++) if (chk(it->first, it->second)) flg = 0; puts(flg ? YES : NO ); fflush(stdout); for (std::vector<std::pair<int, int> >::iterator it = del.begin(); it != del.end(); it++) num[it->first][it->second] = 0; tot -= k; } }
#include <bits/stdc++.h> const int MAXN = 100010; int flag[MAXN << 2]; int a[MAXN << 2]; int add; int N, Q; void PushDown(int rt) { int lc = rt << 1; int rc = rt << 1 | 1; if (flag[rt]) { flag[lc] += flag[rt]; flag[rc] += flag[rt]; flag[rt] = 0; } return; } void build(int l, int r, int rt) { flag[rt] = 0; if (l == r) { scanf( %d , &a[rt]); return; } int m = (l + r) >> 1; build(l, m, rt << 1); build(m + 1, r, rt << 1 | 1); return; } void Update(int x, int c, int l, int r, int rt) { if (l == x && r == x) { flag[rt] = 0; a[rt] = c; return; } PushDown(rt); int m = (l + r) >> 1; if (x <= m) Update(x, c, l, m, rt << 1); else Update(x, c, m + 1, r, rt << 1 | 1); return; } int Query(int x, int l, int r, int rt) { if (l == x && r == x) { return a[rt] + flag[rt]; } PushDown(rt); int m = (l + r) >> 1; if (x <= m) return Query(x, l, m, rt << 1); else return Query(x, m + 1, r, rt << 1 | 1); } int main() { while (~scanf( %d%d , &N, &Q)) { build(1, N, 1); while (Q--) { int op, v, x; scanf( %d , &op); switch (op) { case 1: scanf( %d%d , &v, &x); Update(v, x, 1, N, 1); break; case 2: scanf( %d , &v); flag[1] += v; break; case 3: scanf( %d , &v); printf( %d n , Query(v, 1, N, 1)); break; } } } return 0; }
#include <bits/stdc++.h> int a[100001], b[100000], map[100000], c[634][100001]; int main() { int n, q; std::cin >> n >> q; for (int i = 1; i <= n; ++i) std::cin >> a[i]; memcpy(b, &a[1], sizeof(b)); std::stable_sort(b, b + n); int N = 0, i = 0; while (i < n) { int r = std::upper_bound(b, b + n, b[i]) - b; if (r - i >= b[i]) map[N++] = b[i]; i = r; } for (int i = 0; i < N; ++i) for (int j = 1; j <= n; ++j) c[i][j] = c[i][j - 1] + (a[j] == map[i]); while (q--) { int l, r, count = 0; std::cin >> l >> r; for (int i = 0; i < N; ++i) count += map[i] == c[i][r] - c[i][l - 1]; std::cout << count << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 10, Mod = 1e9 + 7; long long fact[2 * MAXN], dp[MAXN], ps[MAXN], inv[MAXN * 2]; pair<long long, long long> a[MAXN]; long long power(long long x, long long y) { if (!y) return 1; long long ans = power(x, y / 2); ans *= ans; ans %= Mod; if (y % 2) ans *= x; ans %= Mod; return ans; } long long c(int n, int r) { long long ans = fact[n]; ans *= inv[r]; ans %= Mod; ans *= inv[n - r]; ans %= Mod; return ans; } int main() { fact[0] = 1; inv[0] = 1; for (int i = 1; i < 2 * MAXN; i++) { fact[i] = (fact[i - 1] * i) % Mod; inv[i] = power(fact[i], Mod - 2); } int w, h, n; cin >> w >> h >> n; for (int i = 1; i <= n; i++) cin >> a[i].first >> a[i].second; n++; a[n].first = w; a[n].second = h; sort(a + 1, a + 1 + n); for (int i = 1; i <= n; i++) { dp[i] = c(a[i].first + a[i].second - 2, a[i].first - 1); dp[i] %= Mod; for (int j = 1; j < i; j++) if (a[j].first <= a[i].first and a[j].second <= a[i].second) { dp[i] -= dp[j] * c(a[i].first - a[j].first + a[i].second - a[j].second, a[i].first - a[j].first); dp[i] %= Mod; dp[i] += Mod; dp[i] %= Mod; } } cout << dp[n] << endl; return 0; }
#include <bits/stdc++.h> using namespace std; double p[21], dp[(1 << 21)], ans[21]; int n, k; int main() { scanf( %d %d , &n, &k); for (int i = 0; i < n; i++) scanf( %lf , p + i); dp[0] = 1; for (int bit = 1; bit < (1 << n); bit++) if (__builtin_popcount(bit) <= k) { double rp = 1; for (int i = 0; i < n; i++) if ((bit & (1 << i))) rp -= p[i]; for (int i = 0; i < n; i++) if ((bit & (1 << i))) { if (p[i] < 1e-9) continue; dp[bit] += dp[bit ^ (1 << i)] * p[i] / (rp + p[i]); ans[i] += dp[bit ^ (1 << i)] * p[i] / (rp + p[i]); } } for (int i = 0; i < n; i++) printf( %.11lf , ans[i]); }
#include <bits/stdc++.h> const int N = 100, M = 1000; int n, m; double dp[N + 2][N * M + 2]; int main() { scanf( %d %d , &n, &m); if (m == 1) { printf( 1.0 ); return 0; } dp[0][0] = m - 1; int sumr = 0; for (int i = 1; i <= n; i++) { int rank; scanf( %d , &rank); sumr += rank; double sum = 0.0; for (int j = 1; j <= n * m; j++) { sum += dp[i - 1][j - 1]; if (j > m) sum -= dp[i - 1][j - m - 1]; if (j >= rank) dp[i][j] = (sum - dp[i - 1][j - rank]) / (m - 1); else dp[i][j] = sum / (m - 1); } } double ans = 1.0; for (int i = 1; i < sumr; i++) ans += dp[n][i]; printf( %.10lf , ans); return 0; }
#include <bits/stdc++.h> int Set(int N, int pos) { return N = N | (1 << pos); } int reSet(int N, int pos) { return N = N & ~(1 << pos); } bool check(int N, int pos) { return (bool)(N & (1 << pos)); } using namespace std; string s; int n; bool dp[10010][4], taken[10010][4]; bool isSafe(int pos, int l1) { if (pos - l1 < 0) return true; for (int i = 0; i < l1; i++) { if (s[pos + i] != s[pos - l1 + i]) return true; } return false; } bool go(int pos, int pre) { if (pos > n) return false; if (pos == n) return dp[pos][pre] = true; if (taken[pos][pre]) return dp[pos][pre]; taken[pos][pre] = true; bool ret = false; if (pre == 3) { ret |= go(pos + 2, 2); if (isSafe(pos, 3)) ret |= go(pos + 3, 3); } if (pre == 2) { ret |= go(pos + 3, 3); if (isSafe(pos, 2)) ret |= go(pos + 2, 2); } if (pre == 1) { ret |= go(pos + 1, 1); ret |= go(pos + 2, 2); ret |= go(pos + 3, 3); } return dp[pos][pre] = ret; } set<string> S; void get_solution(int pos, int pre) { if (pos > n || taken[pos][pre]) return; taken[pos][pre] = true; string res; if (pre == 1) { if (dp[pos + 1][1]) get_solution(pos + 1, 1); if (dp[pos + 2][2]) { res = s.substr(pos, 2); S.insert(res); get_solution(pos + 2, 2); } if (dp[pos + 3][3]) { res = s.substr(pos, 3); S.insert(res); get_solution(pos + 3, 3); } } if (pre == 2) { if (dp[pos + 2][2]) { res = s.substr(pos, 2); S.insert(res); get_solution(pos + 2, 2); } if (dp[pos + 3][3]) { res = s.substr(pos, 3); S.insert(res); get_solution(pos + 3, 3); } } if (pre == 3) { if (dp[pos + 2][2]) { res = s.substr(pos, 2); S.insert(res); get_solution(pos + 2, 2); } if (dp[pos + 3][3]) { res = s.substr(pos, 3); S.insert(res); get_solution(pos + 3, 3); } } } int main() { int tc, t = 1; while (cin >> s) { n = s.size(); memset(taken, false, sizeof taken); if (go(5, 1)) { memset(taken, false, sizeof taken); get_solution(5, 1); } for (int i = 0; i < n + 1; i++) { for (int j = 1; j < 4; j++) { } } set<string>::iterator it; cout << S.size() << endl; for (it = S.begin(); it != S.end(); it++) { cout << *it << endl; } S.clear(); } return 0; }
/* * author: zhaoyiping * time: 2021-06-04 23:08:02 */ #include <bits/stdc++.h> using namespace std; const int MAXN = 3e5 + 5; // vector<int> g[MAXN]; long long a[MAXN]; long long c[MAXN]; int fa[MAXN][20]; int deep[MAXN]; int main() { ios::sync_with_stdio(false); cin.tie(0); int q; cin >> q >> a[0] >> c[0]; for (int i = 1; i <= q; i++) { int op; cin >> op; if (op == 1) { int p, aa, cc; cin >> p >> aa >> cc; a[i] = aa; c[i] = cc; fa[i][0] = p; deep[i] = deep[p] + 1; for (int j = 1; j < 20; j++) { fa[i][j] = fa[fa[i][j - 1]][j - 1]; } } else { int v; long long w; cin >> v >> w; int beg = v; for (int i = 19; i >= 0; i--) if (a[fa[beg][i]]) beg = fa[beg][i]; long long tt = 0; long long ans = 0; for (int i = deep[v] - deep[beg]; i >= 0; i--) { int now = v; for (int j = 0; j < 20; j++) { if ((1 << j) & i) now = fa[now][j]; } if (a[now] >= w) { tt += w; ans += c[now] * w; a[now] -= w; w = 0; break; } else { tt += a[now]; ans += c[now] * a[now]; w -= a[now]; a[now] = 0; } } cout << tt << << ans << endl; } } return 0; }
#include <bits/stdc++.h> using namespace std; string toBinary(long long n) { string r; while (n != 0) { r = (n % 2 == 0 ? 0 : 1 ) + r; n /= 2; } return r; } int main() { int total; cin >> total; while (total--) { string binaryNum; long long num; cin >> num; binaryNum = toBinary(num); long long length = binaryNum.length(); long long counter = 1; long long ans = 0; long long powers = 2; long long value = 0; ans = ans + num; while (counter < length) { value = num / powers; ans = ans + value; powers = powers * 2; counter++; } cout << ans << endl; } }
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:667772160 ) template <class T1> void deb(T1 e1) { cout << e1 << endl; } template <class T1, class T2> void deb(T1 e1, T2 e2) { cout << e1 << << e2 << endl; } template <class T1, class T2, class T3> void deb(T1 e1, T2 e2, T3 e3) { cout << e1 << << e2 << << e3 << endl; } template <class T1, class T2, class T3, class T4> void deb(T1 e1, T2 e2, T3 e3, T4 e4) { cout << e1 << << e2 << << e3 << << e4 << endl; } template <class T1, class T2, class T3, class T4, class T5> void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) { cout << e1 << << e2 << << e3 << << e4 << << e5 << endl; } template <class T1, class T2, class T3, class T4, class T5, class T6> void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5, T6 e6) { cout << e1 << << e2 << << e3 << << e4 << << e5 << << e6 << endl; } string str; int main() { int n; scanf( %d , &n); getchar(); getline(cin, str); int ans = 0, cont = 0; for (int i = 0; i < n; i++) { if (isalpha(str[i])) { if (isupper(str[i])) cont++; } else { ans = max(ans, cont); cont = 0; } } ans = max(ans, cont); printf( %d n , ans); return 0; }
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; const int M = 1000005; const int nmax = 500010; const int MOD = (1e9) + 7; int nextX[] = {1, -1, 0, 0}; int nextY[] = {0, 0, 1, -1}; int n, m, t; int f[1010][1010]; char s[1010][1010]; bool good(int x, int y) { return (x >= 1 && x <= n && y >= 1 && y <= m); } int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> n >> m >> t; for (int i = 1; i <= n; i++) cin >> s[i] + 1; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) f[i][j] = -1; queue<pair<int, int> > que; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { int nr = 0; for (int k = 0; k < 4; k++) { int x = i + nextX[k]; int y = j + nextY[k]; if (!good(x, y)) continue; if (s[i][j] == s[x][y]) nr++; } if (nr > 0) { que.push({i, j}); f[i][j] = 0; } } while (!que.empty()) { int x = que.front().first; int y = que.front().second; que.pop(); for (int k = 0; k < 4; k++) { int nxt_x = x + nextX[k]; int nxt_y = y + nextY[k]; if (!good(nxt_x, nxt_y)) continue; if (s[nxt_x][nxt_y] != s[x][y] && f[nxt_x][nxt_y] == -1) { f[nxt_x][nxt_y] = f[x][y] + 1; que.push({nxt_x, nxt_y}); } } } for (int i = 1; i <= t; i++) { int x, y; long long int p; cin >> x >> y >> p; if (f[x][y] == -1 || p < f[x][y]) cout << s[x][y] << n ; else { long long int diff = p - f[x][y]; if (diff % 2 == 0) cout << s[x][y] << n ; else if (s[x][y] == 1 ) cout << 0 n ; else cout << 1 n ; } } return 0; }
#include <bits/stdc++.h> using namespace std; int n, m, c0, d0, hsl; int a[15], b[15], c[15], d[15]; int dp[1005][15]; bool dpf[1005][15]; int proc(int x, int num) { if (num == 0) { return 0; } else if (dpf[x][num]) { return dp[x][num]; } else { int &ret = dp[x][num]; ret = 0; dpf[x][num] = true; for (int i = 0; (i <= (a[num] / b[num])) && (x >= c[num] * i); i++) { ret = max(ret, proc(x - c[num] * i, num - 1) + d[num] * i); } return ret; } } int main() { scanf( %d %d %d %d , &n, &m, &c0, &d0); for (int i = 1; i <= m; i++) { scanf( %d %d %d %d , &a[i], &b[i], &c[i], &d[i]); } hsl = 0; for (int i = 0; i <= n; i++) { hsl = max(hsl, proc(i, m) + ((n - i) / c0) * d0); } printf( %d n , hsl); }
#include <bits/stdc++.h> using namespace std; long long l, w, k; int main() { cin >> l >> w >> k; if (k > l + w - 2) { cout << -1; return 0; } if (k + 1 <= max(l, w)) { long long e = max(l, w); long long t = min(l, w); long long j = (t / (k + 1)) * max(l, w); long long u = (e / (k + 1)) * min(l, w); if (j > u) cout << j; else cout << u; } else { long long e = min(l, w); cout << (e / (k + 2 - max(l, w))); } return 0; }
#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> istream& operator>>(istream& in, pair<T1, T2>& a) { in >> a.first >> a.second; return in; } template <typename T1, typename T2> ostream& operator<<(ostream& out, pair<T1, T2> a) { out << a.first << << a.second; return out; } template <typename T, typename T1> T maxs(T& a, T1 b) { if (b > a) a = b; return a; } template <typename T, typename T1> T mins(T& a, T1 b) { if (b < a) a = b; return a; } const int N = 1e6 + 5; int a[N]; int p[N]; pair<int, int> rnk[N]; int root(int first) { if (p[first] == first) return first; return p[first] = root(p[first]); } int solve() { int n; cin >> n; vector<int> v(n + 1), r(n + 1); for (int i = 1; i < n + 1; i++) { char c; cin >> c; if (c == ? ) v[i] = -1; else v[i] = c - 48; } int j1 = n + 1; int j2 = n + 1; for (int i = n; i > 0; i--) { if (v[i] == 0) { j1 = i; } else if (v[i] == 1) { j2 = i; } a[i] = max(j1, j2) - i; rnk[i] = {a[i], i}; } sort(rnk + 1, rnk + 1 + n); for (int i = 1; i <= n + 1; i++) p[i] = i; int j = 1; for (int i = 1; i <= n; i++) { while (j <= n && rnk[j].first < i) { p[rnk[j].second] = rnk[j].second + 1; j++; } int cnt = 0; int l = 1; while (1) { int j = root(l); if (j > n) break; cnt++; l = j + i; } cout << cnt << ; } return 0; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t = 1; while (t--) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; struct e { int a, b; }; e p[100005]; int n, k; bool use[100005]; priority_queue<int, vector<int>, std::greater<int> > Q; bool criteriu(e a, e b) { return a.b > b.b; } long long af; int main() { scanf( %d %d , &n, &k); for (int i = 1; i <= n; i++) { scanf( %d , &p[i].a); } for (int i = 1; i <= n; i++) { scanf( %d , &p[i].b); } sort(p + 1, p + n + 1, criteriu); for (int i = 1; i <= n; i++) { if (!use[p[i].a]) { use[p[i].a] = true; } else { Q.push(p[i].b); } } for (int i = 1; i <= k; i++) { if (!use[i]) { af += Q.top(); Q.pop(); } } printf( %lld n , af); return 0; }
#include <bits/stdc++.h> long long n, m, Q; long long T; std::vector<long long> req, l, r; std::vector<long long> fill(std::vector<long long>& req) { std::vector<long long> ans(m + 1); long long tem = T; for (long long i = m; i; i--) { ans[i] = 0; if (i < m) ans[i] = ans[i + 1]; if (~req[i]) ans[i] = req[i]; tem -= ans[i]; } if (tem < 0) return std::vector<long long>(); for (long long i = m, last = m + 1; tem && ~i; i--) { if (~req[i]) { long long mx = (i < m) ? (last - 1 - i) * (req[i] - ans[i + 1]) : 0; if (mx <= tem) { for (long long j = i + 1; j < last; j++) ans[j] = req[i]; tem -= mx; } else { for (long long j = i + 1; j < last; j++) ans[j] += (tem / (last - 1 - i)) + ((tem % (last - 1 - i)) >= (j - i)); tem = 0; } last = i; } } if (tem) return std::vector<long long>(); return ans; } long long q[100001], h, t; bool check(std::vector<long long> a, std::vector<long long> b) { long long n = (long long)a.size() - 1, m = (long long)b.size() - 1; h = t = 0; for (long long i = 2; i <= n; i++) a[i] += a[i - 1]; for (long long i = 2; i <= m; i++) b[i] += b[i - 1]; for (long long i = 1; i <= n; i++) a[i] -= 1ll * i * m; for (long long i = 1; i <= m; i++) b[i] -= 1ll * i * n; for (long long i = 1; i <= m; i++) { while (h < t - 1 && (1ll * (b[q[t]] - b[i]) * (q[t] - q[t - 1]) >= 1ll * (b[q[t - 1]] - b[q[t]]) * (i - q[t]))) --t; q[++t] = i; } for (long long i = 1; i <= n; i++) { while (h < t - 1 && (b[q[t]] + q[t] * i) >= (b[q[t - 1]] + q[t - 1] * i)) --t; if (b[q[t]] + q[t] * i < a[n] - a[i]) return 0; } return 1; } bool judge(long long x, long long y = -1) { std::vector<long long> Req = req; if (~y) { for (long long i = 1; i <= x; i++) Req[i] = y; } std::vector<long long> now = fill(Req); if (now.empty()) return 0; if (now[1] != now[x]) { for (long long i = 1; i <= x; i++) if (~req[i] && req[i] != now[1]) return 0; for (long long i = 1; i <= x; i++) Req[i] = now[1]; now = fill(Req); if (now.empty()) return 0; } std::reverse(now.begin() + 1, now.end()); return check(l, now) & check(now, r); } signed main() { scanf( %lld%lld , &n, &m); l.resize(n + 1), r.resize(n + 1); for (long long i = 1; i <= n; i++) scanf( %lld%lld , &l[i], &r[i]); std::sort(l.begin() + 1, l.end()); std::sort(r.begin() + 1, r.end()); req.resize(m + 1); for (long long i = 1; i <= m; i++) req[i] = -1; req[0] = 0x7f7f7f7f; scanf( %lld , &Q); for (long long i = 1, a, b; i <= Q; i++) { scanf( %lld%lld , &a, &b); req[a] = b; } scanf( %lld , &T); long long l = 1, r = m, mid, ans = -1; while (l <= r) { mid = (l + r) >> 1; if (judge(mid)) ans = mid, l = mid + 1; else r = mid - 1; } if (!~ans) { printf( -1 -1 ); return 0; } for (long long i = 1; i <= ans; i++) if (~req[i]) { printf( %lld %lld n , ans, req[i]); return 0; } l = fill(req)[1], r = n; long long ans1; while (l <= r) { mid = (l + r) >> 1; if (judge(ans, mid)) ans1 = mid, l = mid + 1; else r = mid - 1; } printf( %lld %lld n , ans, ans1); }
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 7; const int MOD = 1e9 + 7; long long a[maxn]; int main() { int n; scanf( %d , &n); long long ans = 0; for (int i = 1; i <= n; ++i) { scanf( %lld , &a[i]); ans += a[i] * (n - a[i] + 1); if (i == 1) continue; long long t1 = a[i - 1], t2 = a[i]; if (t1 > t2) swap(t1, t2); ans -= t1 * (n - t2 + 1); } printf( %lld n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int a[1000][1000]; int main(int argc, const char* argv[]) { int n, m, k; cin >> n >> m >> k; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> a[i][j]; } } int r[1000]; int c[1000]; for (int i = 0; i < 1000; i++) { r[i] = c[i] = i; } for (int i = 0; i < k; i++) { char cc; int x, y; cin >> cc >> x >> y; if (cc == c ) { swap(c[x - 1], c[y - 1]); } else if (cc == r ) { swap(r[x - 1], r[y - 1]); } else { cout << a[r[x - 1]][c[y - 1]] << endl; ; } } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long n; long long cur = 9; long long ans = 0; long long dig = 1; cin >> n; while (n > 0) { ans += min(n * dig, cur * dig); n -= cur; cur *= 10; dig++; } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int mx = 1e3 + 10; bool f[2][mx]; int nxt[mx], bef[mx]; int d[mx]; int main() { int n, x, u; scanf( %d %d , &n, &x); memset(bef, -1, sizeof bef); memset(nxt, -1, sizeof nxt); for (int i = 1; i <= n; i++) { scanf( %d , &u); if (u != 0) { nxt[i] = u; bef[u] = i; } } int lx = 0; int c = 0; for (int i = 1; i <= n; i++) { if (bef[i] == -1) { u = i; int len = 0; int lenx = 0; while (u != -1) { if (u == x || lenx > 0) lenx++; len++; u = nxt[u]; } if (lenx == 0) d[c++] = len; else lx = lenx; } } int rw = 0; f[0][0] = true; for (int i = 0; i < c; i++) { rw ^= 1; for (int s = 0; s < mx; s++) { f[rw][s] = f[rw ^ 1][s]; if (s >= d[i]) f[rw][s] |= f[rw ^ 1][s - d[i]]; } } vector<int> ans; for (int s = 0; s < n; s++) if (f[rw][s]) printf( %d n , s + lx); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; const int L = 20; int h[N], par[N][L]; int getLca(int u, int v) { if (h[v] < h[u]) swap(u, v); int k = h[v] - h[u]; for (int i = 0; i < L; i++) if (k >> i & 1) v = par[v][i]; if (u == v) return v; for (int i = L - 1; i >= 0; i--) if (par[u][i] != par[v][i]) u = par[u][i], v = par[v][i]; return par[u][0]; } int dis(int u, int v) { return h[u] + h[v] - 2 * h[getLca(u, v)]; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n = 5, mx = 2, ans = 2; for (int i = 2; i <= 4; i++) h[i] = par[i][0] = 1; int q; cin >> q; while (q--) { int v; cin >> v; h[n] = h[v] + 1; par[n][0] = v; for (int i = 1; i < L; i++) par[n][i] = par[par[n][i - 1]][i - 1]; n++; h[n] = h[v] + 1; par[n][0] = v; for (int i = 1; i < L; i++) par[n][i] = par[par[n][i - 1]][i - 1]; if (h[v] == h[mx]) mx = n, ans++; ans = max(ans, dis(n, mx)); n++; cout << ans << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; string str; cin >> t; while (t--) { cin >> str; sort(str.begin(), str.end()); int sz = str.size(); if (str[0] == str[sz - 1]) cout << -1 << endl; else cout << str << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; using cd = complex<double>; const long long INF = 1e15; const int mod = 1e9 + 7; const double Pi = acos(-1); void Fastio() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); } int n, cnt = 0; long long x, y; bool Deg[200005]; vector<int> Adj[200005]; void DFS(int node, int p = -1) { int c = 0; for (auto x : Adj[node]) { if (x != p) { DFS(x, node); if (Deg[x]) { c++; } } } cnt += min(2, c); if (c < 2) { Deg[node] = true; } } signed main() { Fastio(); cin >> n >> x >> y; for (int i = 1; i < n; i++) { int u, v; cin >> u >> v; Adj[u].emplace_back(v); Adj[v].emplace_back(u); } if (x >= y) { for (int i = 1; i <= n; i++) { if (Adj[i].size() == n - 1) { cout << y * (n - 2) + x; return 0; } } cout << y * (n - 1); return 0; } DFS(1); cout << x * cnt + y * (n - 1 - cnt); }
#include <bits/stdc++.h> using namespace std; const int maxn = 105; const long long INF = (long long)0x7fffffffffff; long long dp[maxn][maxn][maxn], wi[maxn], c[maxn]; long long min(long long a, long long b) { return a > b ? b : a; } int main() { int n, m, k, temp, flag = 1, ans1 = 0; cin >> n >> m >> k; for (int i = 0; i <= n; i++) { for (int j = 0; j <= m; j++) { for (int l = 0; l <= n; l++) { dp[i][j][l] = INF; } } } for (int i = 1; i <= n; i++) { cin >> c[i]; } for (int i = 1; i <= m; i++) cin >> wi[i]; if (c[1] == 0) for (int i = 1; i <= m; i++) dp[1][i][1] = wi[i]; else dp[1][c[1]][1] = 0; for (int i = 2; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> wi[j]; for (int l = 1; l <= i; l++) { if (c[i] == 0) { for (int p = 1; p <= m; p++) { if (p == j) { dp[i][j][l] = min(dp[i][j][l], dp[i - 1][j][l] + wi[j]); } else { dp[i][j][l] = min(dp[i][j][l], dp[i - 1][p][l - 1] + wi[j]); } } } else { for (int p = 1; p <= m; p++) { if (p == c[i]) { dp[i][c[i]][l] = min(dp[i][c[i]][l], dp[i - 1][c[i]][l]); } else { dp[i][c[i]][l] = min(dp[i][c[i]][l], dp[i - 1][p][l - 1]); } } } } } } long long ans = INF; for (int i = 1; i <= m; i++) ans = min(ans, dp[n][i][k]); if (ans >= INF) cout << -1 << endl; else cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 3e3 + 5; const int mod = 998244353; inline void add_mod(int &a, int b) { a += b; if (a >= mod) a -= mod; } inline void chk_mod(int &a) { if (a < 0) a += mod; } inline long long pw(long long a, long long b) { long long res = 1; while (b) { if (b & 1) res = res * a % mod; a = a * a % mod; b >>= 1; } return res; } long long pw2[MAXN], icoef[MAXN]; int n, c; int a[MAXN]; namespace Subtask1 { int sum[MAXN][MAXN], f[MAXN][MAXN], g[MAXN][MAXN]; void solve(void) { for (int i = 1; i <= n; ++i) { for (int j = 1; j <= c; ++j) sum[i][j] = sum[i - 1][j]; ++sum[i][a[i]]; } for (int i = 1; i <= n; ++i) { if (c == 1) { f[i][i] = 1; continue; } static int t[MAXN]; for (int j = 1; j <= c; ++j) t[j] = 0; int cnt = 0, cur = 1; for (int j = i; j <= n; ++j) { int ct = ++t[a[j]]; if (ct == 1) { ++cnt; if (cnt == c) { for (int k = 1; k <= c; ++k) if (k != a[i]) cur = cur * (pw2[t[k]] - 1) % mod; chk_mod(cur); } } else if (cnt == c && a[j] != a[i]) chk_mod(cur = cur * icoef[ct - 1] % mod * (pw2[ct] - 1) % mod); if (cnt == c && a[j] != a[i]) f[i][j] = cur * icoef[ct] % mod * pw2[t[a[i]] - 1] % mod; } } g[n + 1][0] = 1; for (int i = n; i >= 1; --i) { int mxp = (n - i + 1) / c; for (int j = i; j <= n; ++j) if (f[i][j]) for (int k = 1; k <= mxp; ++k) g[i][k] = (g[i][k] + (long long)g[j + 1][k - 1] * f[i][j]) % mod; g[i][0] = pw2[n - i]; for (int j = 1; j <= n; ++j) add_mod(g[i][0], mod - g[i][j]); for (int j = 0; j <= n; ++j) add_mod(g[i][j], g[i + 1][j]); } add_mod(g[1][0], mod - 1); for (int i = 0; i <= n; ++i) printf( %d , g[1][i]); exit(0); } } // namespace Subtask1 namespace Subtask2 { const int ALL = (1 << 12) + 5; long long g[MAXN][ALL]; void solve(void) { int all = (1 << c) - 1; g[0][0] = 1; for (int k = n; k >= 1; --k) { int mxp = (n - k + 1) / c; int cura = (1 << (a[k] - 1)); for (int i = mxp; i >= 0; --i) for (int mask = all - 1; mask >= 0; --mask) if (g[i][mask]) { if ((mask | cura) == all) g[i + 1][0] += g[i][mask]; else g[i][mask | cura] += g[i][mask]; } if (k % 20 == 0) { for (int i = 0; i <= mxp; ++i) for (int mask = 0; mask <= all; ++mask) g[i][mask] %= mod; } } g[0][0] += mod - 1; int mxp = n / c; for (int i = 0; i <= n; ++i) { if (i > mxp) { printf( 0 ); continue; } int res = 0; for (int mask = 0; mask < all; ++mask) add_mod(res, g[i][mask] % mod); printf( %d , res); } exit(0); } } // namespace Subtask2 int main(void) { pw2[0] = 1; for (int i = 1; i < MAXN; ++i) pw2[i] = pw2[i - 1] * 2 % mod; for (int i = 0; i < MAXN; ++i) icoef[i] = pw((pw2[i] - 1 + mod) % mod, mod - 2); scanf( %d%d , &n, &c); for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); if (c <= 12) Subtask2::solve(); else Subtask1::solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); long long int n; cin >> n; long long int k; cin >> k; long long int sum = k; for (int i = (int)2; i <= (int)n; i++) { cin >> k; sum = sum + ((k - 1ll) * ((long long int)i - 1ll)) + k; } cout << sum << n ; return 0; }
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (a == 0) return b; if (b == 0) return a; return gcd(b % a, a); } long long power(long long a, long long b) { long long res = 1; while (b > 0) { if (b % 2 != 0) res = (res * 1ll * a); b /= 2; a = (a * 1ll * a); } return res; } void solve() { string s; cin >> s; long long n = s.length(); bool v = false; bool h = false; for (long long i = 0; i < n; i++) { if (s[i] == 1 ) { if (!h) { h = true; cout << 1 << << 1 << endl; } else { h = false; cout << 1 << << 3 << endl; } } else { if (!v) { v = true; cout << 3 << << 4 << endl; } else { v = false; cout << 1 << << 4 << endl; } } } return; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int n, m, k; string s; vector<string> t; vector<pair<pair<int, int>, int> > cro; bool cmp(const pair<pair<int, int>, int> &x, const pair<pair<int, int>, int> &y) { if (x.second == y.second) { if (x.first.first == y.first.first) return x.first.second < y.first.second; return x.first.first < y.first.first; } return x.second < y.second; } int main() { cin >> n >> m >> k; for (int i = 0; i < (n); i++) { cin >> s; t.push_back(s); } for (int i = 0; i < (n); i++) { for (int j = 0; j < (m); j++) { if (t[i][j] == * ) { for (int r = (1); r <= (min(i, min(j, min(n - i - 1, m - j - 1)))); r++) { if ((t[i - r][j] == * ) && (t[i + r][j] == * ) && (t[i][j - r] == * ) && (t[i][j + r] == * )) cro.push_back(make_pair(make_pair(i, j), r)); } } } } if (cro.size() < k) cout << -1 n ; else { sort((cro).begin(), (cro).end(), cmp); cout << cro[k - 1].first.first + 1 << << cro[k - 1].first.second + 1 << n ; cout << cro[k - 1].first.first + 1 - cro[k - 1].second << << cro[k - 1].first.second + 1 << n ; cout << cro[k - 1].first.first + 1 + cro[k - 1].second << << cro[k - 1].first.second + 1 << n ; cout << cro[k - 1].first.first + 1 << << cro[k - 1].first.second + 1 - cro[k - 1].second << n ; cout << cro[k - 1].first.first + 1 << << cro[k - 1].first.second + 1 + cro[k - 1].second << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; void fio() {} void pti() { double timeuse = clock() * 1000.0 / CLOCKS_PER_SEC; cerr << Timeuse << timeuse << ms << endl; } void end() { exit(0); } namespace io { const int SIZ = 55; int que[SIZ], op, qr; char ch; template <class I> inline void gi(I& w) { ch = getchar(), op = 1, w = 0; while (!isdigit(ch)) { if (ch == - ) op = -1; ch = getchar(); } while (isdigit(ch)) { w = w * 10 + ch - 0 ; ch = getchar(); } w *= op; } template <typename T, typename... Args> inline void gi(T& t, Args&... args) { gi(t); gi(args...); } template <class I> inline void print(I w) { qr = 0; if (!w) putchar( 0 ); if (w < 0) putchar( - ), w = -w; while (w) que[++qr] = w % 10 + 0 , w /= 10; while (qr) putchar(que[qr--]); } } // namespace io using io::gi; using io::print; const int N = 5005; int n, m; int a[N]; int main() { fio(); gi(n, m); int t = 0; for (int i = 1; i <= n; ++i) { a[i] = i; t += (i - 1) >> 1; if (t >= m) { int res = (t - m) << 1; a[i] += res; for (int j = n, s = 1e9; j > i; --j, s -= a[i] + 1) a[j] = s; for (int j = 1; j <= n; ++j) print(a[j]), putchar( ); end(); } } print(-1); end(); }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 100; const int Mod = 1e9 + 7; struct Mat { long long A[2][2]; Mat() { memset(A, 0, sizeof(A)); } void init(void) { for (int i = 0; i < 2; i++) for (int j = 0; j < 2; j++) A[i][j] = (i == j); } Mat operator+(struct Mat A) { struct Mat B; for (int i = 0; i < 2; i++) { for (int j = 0; j < 2; j++) { B.A[i][j] = this->A[i][j] + A.A[i][j]; B.A[i][j] %= Mod; } } return B; } Mat operator*(struct Mat A) { struct Mat B; for (int i = 0; i < 2; i++) { for (int j = 0; j < 2; j++) { for (int k = 0; k < 2; k++) { B.A[i][j] += (this->A[i][k] * A.A[k][j]); B.A[i][j] %= Mod; } } } return B; } Mat operator^(int t) { struct Mat A, B; A.init(); for (int i = 0; i < 2; i++) for (int j = 0; j < 2; j++) B.A[i][j] = this->A[i][j]; while (t) { if (t & 1) A = A * B; t >>= 1; B = B * B; } return A; } }; struct Mat Tree[N << 2], Laze[N << 2], f; int A[N]; void pushUp(int n) { Tree[n] = (Tree[n << 1] + Tree[n << 1 | 1]); } void pushDown(int n) { Tree[n << 1] = Laze[n] * Tree[n << 1]; Tree[n << 1 | 1] = Laze[n] * Tree[n << 1 | 1]; Laze[n << 1] = Laze[n] * Laze[n << 1]; Laze[n << 1 | 1] = Laze[n] * Laze[n << 1 | 1]; Laze[n].init(); } void build(int l, int r, int rt) { Laze[rt].init(); if (l == r) { Tree[rt] = f ^ (A[l] - 1); return; } int mid = (l + r) >> 1; build(l, mid, rt << 1); build(mid + 1, r, rt << 1 | 1); pushUp(rt); } void update(int l, int r, int rt, int _l, int _r, struct Mat x) { if (l >= _l && r <= _r) { Tree[rt] = x * Tree[rt]; Laze[rt] = x * Laze[rt]; return; } pushDown(rt); int mid = (l + r) >> 1; if (_r <= mid) { update(l, mid, rt << 1, _l, _r, x); } else if (_l > mid) { update(mid + 1, r, rt << 1 | 1, _l, _r, x); } else { update(l, mid, rt << 1, _l, _r, x); update(mid + 1, r, rt << 1 | 1, _l, _r, x); } pushUp(rt); } int query(int l, int r, int rt, int _l, int _r) { if (l >= _l && r <= _r) { return Tree[rt].A[0][0]; } pushDown(rt); int mid = (l + r) >> 1; if (_r <= mid) { return query(l, mid, rt << 1, _l, _r); } else if (_l > mid) { return query(mid + 1, r, rt << 1 | 1, _l, _r); } return (query(l, mid, rt << 1, _l, _r) + query(mid + 1, r, rt << 1 | 1, _l, _r)) % Mod; } int main(void) { int n, m; for (int i = 0; i < 2; i++) for (int j = 0; j < 2; j++) f.A[i][j] = 1; f.A[1][1] = 0; cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> A[i]; } build(1, n, 1); while (m--) { int type, l, r; cin >> type >> l >> r; if (type == 1) { int x; cin >> x; update(1, n, 1, l, r, f ^ x); } else if (type == 2) { cout << query(1, n, 1, l, r) << endl; } } return 0; }
#include <bits/stdc++.h> using namespace std; bool solve() { int a, b; scanf( %d %d , &a, &b); int both = int(floor(pow((double)a * b, 1.0 / 3) + 0.5)); if (both == 0) return a == 1 && b == 1; if (a % both != 0 || b % both != 0) return false; if ((long long)a * b != (long long)both * both * both) return false; long long A = a / both; long long B = b / both; if (B * B * A != b || A * A * B != a) return false; return true; } int main() { int t; cin >> t; while (t--) { if (solve()) puts( Yes ); else puts( No ); } }
#include <bits/stdc++.h> using namespace std; void cline() { cout << n ; } template <typename T, typename... V> void cline(T t, V... v) { cout << t; if (sizeof...(v)) cout << ; cline(v...); } void cspc() { cout << ; } template <typename T, typename... V> void cspc(T t, V... v) { cout << t; if (sizeof...(v)) cout << ; cspc(v...); } const long long N = 2e5 + 4; long long state[2 * N][2]; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); memset(state, 0, sizeof(state)); long long n, m; cin >> n >> m; long long ind = -1; long long a[n]; for (long long i = 0; i < n; i++) { cin >> a[i]; if (m == a[i]) ind = i; } long long oki = 0, cnt = 0; for (long long i = 0; i < n; i++) { if (a[i] < m) oki--; else if (a[i] > m) oki++; if (i >= ind) state[N + oki][i & 1]++; } oki = 0; for (long long i = 0; i <= ind; ++i) { if (i % 2 == 1) { cnt += state[N + oki + 1][0]; cnt += state[N + oki][1]; } else { cnt += state[N + oki][0]; cnt += state[N + oki + 1][1]; } if (a[i] < m) oki--; else oki++; } cspc(cnt); return 0; }
#include <bits/stdc++.h> using namespace std; long long C[1200][1200]; int main() { for (int i = 0; i < 1200; i++) C[i][i] = C[i][0] = 1LL; for (int i = 2; i < 1200; i++) for (int j = 1; j < i; j++) C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % 1000000007; long long k, n, m; scanf( %I64d%I64d%I64d , &n, &m, &k); if (n - 1 < 2 * k || m - 1 < 2 * k) printf( 0 n ); else printf( %I64d n , C[n - 1][2 * k] * C[m - 1][2 * k] % 1000000007); return 0; }
#include <bits/stdc++.h> using namespace std; template <typename T> void chkmax(T& x, T y) { if (x < y) x = y; } template <typename T> void chkmin(T& x, T y) { if (x > y) x = y; } inline int read() { int x = 0; char c = getchar(); bool f = 0; while (c < 48) f |= c == - , c = getchar(); while (c > 47) x = x * 10 + (c ^ 48), c = getchar(); return f ? -x : x; } const int maxn = 5e5 + 10, P = 998244353; int n, m, A[maxn]; char str[maxn]; inline void Add(int& x, int y) { x += y; if (x >= P) x -= P; } struct matrix { int arr[2][2]; void clear() { memset(arr, 0, sizeof arr); } inline int* operator[](const int& pos) { return arr[pos]; } inline void print() { for (int i = (0), iend = (1); i <= iend; ++i) for (int j = (0), jend = (1); j <= jend; ++j) printf( %d%c , arr[i][j], n [j < 1]); } } E; matrix operator*(matrix A, matrix B) { matrix res; res.clear(); for (int k = (0), kend = (1); k <= kend; ++k) for (int i = (0), iend = (1); i <= iend; ++i) for (int j = (0), jend = (1); j <= jend; ++j) Add(res[i][j], 1ll * A[i][k] * B[k][j] % P); return res; } matrix qp(matrix A, long long k) { matrix res = E; for (; k; k >>= 1, A = A * A) if (k & 1) res = res * A; return res; } void minit() { E.clear(); for (int i = (0), iend = (1); i <= iend; ++i) E[i][i] = 1; } matrix val[maxn << 2]; void ins(int k, int l, int r, int x) { if (l == r) { auto tmp = val[k].arr; tmp[1][1] = 0, tmp[0][1] = 1; tmp[0][0] = (A[x] + 1), tmp[1][0] = x > 1 && A[x - 1] == 1 ? 9 - A[x] : 0; return; } x <= ((l + r) >> 1) ? ins(k << 1, l, ((l + r) >> 1), x) : ins(k << 1 | 1, ((l + r) >> 1) + 1, r, x), val[k] = val[k << 1] * val[k << 1 | 1]; } void solve() { minit(); scanf( %d%d%s , &n, &m, str + 1); for (int i = (1), iend = (n); i <= iend; ++i) A[i] = str[i] - 0 , ins(1, 1, n, i); while (m--) { int xx = read(), yy = read(); A[xx] = yy; ins(1, 1, n, xx); if (xx < n) ins(1, 1, n, xx + 1); printf( %d n , val[1][0][0]); } } signed main() { solve(); return 0; }
#include <bits/stdc++.h> using namespace std; template <class T> inline void minu(T& x, T y) { x = min(x, y); } template <class T> inline void maxu(T& x, T y) { x = max(x, y); } inline long long bit(long long n) { return 1LL << n; } template <class T> ostream& operator<<(ostream& os, vector<T> x) { for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); it++) os << *it << ; return os; } long long dx[8] = {1, -1, 0, 0, -1, 1, 1, -1}; long long dy[8] = {0, 0, 1, -1, -1, 1, -1, 1}; const long long mod = 1e9 + 7; long long pow2[200005]; long long memo[505][505]; long long rec(long long n, long long k, long long t) { if (k < 0) return 0; if (t == 0) { return k == 0 ? 1 : 0; } if (n == 0) { return (k == 0 && t == 0) ? 1 : 0; } if (t < n) { return rec(t, k, t) * pow2[t * (n - t)] % mod; } long long& ret = memo[n][k]; if (ret >= 0) return ret; ret = 0; for (long long bt = 0; bt < ((long long)n); ++bt) { ret += rec(n - 1, k - 1, bt) * (pow2[n - bt] - 1 + mod) % mod * pow2[bt] % mod; ret %= mod; } return ret; } int main() { long long n, k; cin >> n >> k; pow2[0] = 1; for (long long i = 0; i < ((long long)200000); ++i) pow2[i + 1] = pow2[i] * 2 % mod; long long ans = 0; for (long long i = 0; i < ((long long)505); ++i) for (long long j = 0; j < ((long long)505); ++j) memo[i][j] = -1; for (long long t = 0; t < ((long long)n + 1); ++t) ans = (ans + rec(n, k, t)) % mod; cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int cnt[200005], n, k, a[200010], ans, sum, num = 1; int main() { cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> a[i]; sum += a[i]; } if (sum % k) { cout << No ; return 0; } else { sum /= k; for (int i = 1; i < n; i++) { ans += a[i]; cnt[num]++; if (ans > sum) { cout << No ; return 0; } if (ans == sum) { ans = 0; num++; } } ans += a[n]; if (ans != sum) { cout << No ; return 0; } else cnt[num]++; cout << Yes << endl; for (int i = 1; i <= num; i++) cout << cnt[i] << ; } }
#include <bits/stdc++.h> using namespace std; int isreq(char c) { return (c == H ) || (c == Q ) || (c == 9 ); } int main() { int n; cin >> n; int cnt = 0; string str; for (int i = 0; i < n; i++) { cin >> str; if (str[1] == + ) { cnt++; } else if (str[1] == - ) { cnt--; } } cout << cnt << endl; }
#include <bits/stdc++.h> using namespace std; template <class T> int len(const T& c) { return (int)c.size(); } int main() { int n, bb; double b1; vector<double> b; cin >> n >> bb; for (int i(0), _n(n); i < _n; ++i) { cin >> b1; b.push_back(b1); } double sum = accumulate(b.begin(), b.end(), 0); double mx = *max_element(b.begin(), b.end()); double avg = (sum + bb) / n; if (mx > avg) { cout << -1; return 0; } for (int i(0), _n(n); i < _n; ++i) printf( %.6f n , avg - b[i]); }
#include <bits/stdc++.h> using namespace std; int main() { int r, c; int j, i; cin >> r >> c; char a; map<int, int> m, n; for (j = 0; j < r; j++) { for (i = 0; i < c; i++) { cin >> a; if (a == S ) { m[i]++; n[j]++; } } } cout << (r * c) - (m.size() * n.size()); }
#include <bits/stdc++.h> using namespace std; const int maxn = 402; int a[maxn], f[maxn][2]; int n, m, s, ans; int main() { int i, j, k; scanf( %d%d , &n, &m); while (m--) { scanf( %d , &k); while (k--) { scanf( %d , &i); a[i] = ++s; } } for (k = 1; k <= n; k++) if (!a[k]) break; for (i = 1; i <= s; i++) { if (a[i] != i) { for (j = i + 1; j <= n; j++) if (a[j] == i) break; if (i != k) { f[++ans][0] = i; f[ans][1] = k; } f[++ans][0] = j; f[ans][1] = i; a[k] = a[i]; a[i] = i; k = j; } } printf( %d n , ans); for (i = 1; i <= ans; i++) printf( %d %d n , f[i][0], f[i][1]); return 0; }
#include <bits/stdc++.h> using namespace std; vector<int> a, b; int main() { int n, m; cin >> n >> m; int x = n + m; int mx = 1; while (1LL * mx * (mx + 1) / 2 <= x) mx++; mx--; for (int i = mx; i >= 1; i--) { if (n >= i) { n -= i; a.push_back(i); } else { m -= i; b.push_back(i); } } printf( %d n , (int)a.size()); for (int i : a) printf( %d , i); puts( ); printf( %d n , (int)b.size()); for (int i : b) printf( %d , i); puts( ); }
#include <bits/stdc++.h> using namespace std; int n; int p[4][4]; int a[(1 << 16)]; int sum1[4]; int sum2[4]; int dio1, dio2; bool ok; int mask; void dfs(int x) { int i, j; if (x == n * n) { if (dio1 == dio2 && dio1 == sum1[0] && sum1[1] == dio1 && sum1[2] == dio1 && sum2[0] == dio1 && sum2[1] == dio1 && sum2[2] == dio1) { ok = true; printf( %d n , dio1); for (i = 0; i < n; i++) { printf( %d , p[i][0]); for (j = 1; j < n; j++) printf( %d , p[i][j]); printf( n ); } } return; } for (i = 0; i < n * n && !ok; i++) if ((mask & (1 << i)) == 0) { mask |= (1 << i); p[x / n][x % n] = a[i]; sum1[x / n] += a[i]; sum2[x % n] += a[i]; if (x / n == x % n) dio1 += a[i]; if (x == 2 || x == 4 || x == 6) dio2 += a[i]; dfs(x + 1); sum1[x / n] -= a[i]; sum2[x % n] -= a[i]; if (x / n == x % n) dio1 -= a[i]; if (x == 2 || x == 4 || x == 6) dio2 -= a[i]; mask ^= (1 << i); } } void dfs2(int x) { int i, j; if (x == n * n) { if (dio1 == dio2 && dio1 == sum1[0] && sum1[1] == dio1 && sum2[0] == dio1 && sum2[1] == dio1) { ok = true; printf( %d n , dio1); for (i = 0; i < n; i++) { printf( %d , p[i][0]); for (j = 1; j < n; j++) printf( %d , p[i][j]); printf( n ); } } return; } for (i = 0; i < n * n && !ok; i++) if ((mask & (1 << i)) == 0) { mask |= (1 << i); p[x / n][x % n] = a[i]; sum1[x / n] += a[i]; sum2[x % n] += a[i]; if (x / n == x % n) dio1 += a[i]; if (x == 1 || x == 2) dio2 += a[i]; dfs2(x + 1); sum1[x / n] -= a[i]; sum2[x % n] -= a[i]; if (x / n == x % n) dio1 -= a[i]; if (x == 1 || x == 2) dio2 -= a[i]; mask ^= (1 << i); } } int sum; void super_dfs(int x) { int i, j; if (x == 16) { if (dio1 == dio2 && dio1 == sum1[0] && dio1 == sum1[3]) if (dio1 == sum2[1]) { ok = true; printf( %d n , dio1); for (i = 0; i < n; i++) { printf( %d , p[i][0]); for (j = 1; j < n; j++) printf( %d , p[i][j]); printf( n ); } } return; } int tem; int znac; if (x > 3 && sum1[0] != sum) return; if (x == 7) { if (ok) return; tem = (1 << 16) - 1; tem ^= mask; while (tem > 0) { znac = tem - (tem & (tem - 1)); if (a[znac] == sum1[0] - sum1[1]) { mask |= znac; p[1][3] = a[znac]; sum1[1] = sum1[0]; sum2[3] += a[znac]; super_dfs(x + 1); sum1[1] -= a[znac]; sum2[3] -= a[znac]; mask ^= znac; break; } tem &= (tem - 1); } return; } if (x == 8) { tem = (1 << 16) - 1; tem ^= mask; while (tem > 0 && !ok) { znac = tem - (tem & (tem - 1)); mask |= znac; p[(x >> 2)][(x & 3)] = a[znac]; sum1[(x >> 2)] += a[znac]; sum2[(x & 3)] += a[znac]; if ((x >> 2) == (x & 3)) dio1 += a[znac]; if (x == 3 || x == 6 || x == 12) dio2 += a[znac]; int tt = (1 << 16) - 1; tt ^= mask; while (tt > 0) { int zc = tt - (tt & (tt - 1)); if (a[zc] + sum2[0] == sum) { sum2[0] = sum; sum1[3] += a[zc]; dio2 += a[zc]; mask |= zc; p[3][0] = a[zc]; super_dfs(x + 1); dio2 -= a[zc]; sum2[0] -= a[zc]; sum1[3] -= a[zc]; mask ^= zc; } tt &= (tt - 1); } if ((x >> 2) == (x & 3)) dio1 -= a[znac]; if (x == 3 || x == 6 || x == 12) dio2 -= a[znac]; sum1[(x >> 2)] -= a[znac]; sum2[(x & 3)] -= a[znac]; mask ^= znac; tem &= (tem - 1); } return; } if (x == 9) { if (ok) return; tem = (1 << 16) - 1; tem ^= mask; while (tem > 0) { znac = tem - (tem & (tem - 1)); if (a[znac] == sum2[0] - dio2) { mask |= znac; p[2][1] = a[znac]; sum2[1] += a[znac]; sum1[2] += a[znac]; dio2 = sum2[0]; super_dfs(x + 1); sum2[1] -= a[znac]; sum1[2] -= a[znac]; dio2 -= a[znac]; mask ^= znac; break; } tem &= (tem - 1); } return; } if (x == 11) { if (ok) return; if (sum1[1] - sum1[2] != dio1 - sum2[3]) return; tem = (1 << 16) - 1; tem ^= mask; while (tem > 0) { znac = tem - (tem & (tem - 1)); if (a[znac] == dio1 - sum2[3]) { mask |= znac; p[2][3] = a[znac]; sum2[3] = dio1; sum1[2] += a[znac]; super_dfs(13); sum2[3] -= a[znac]; sum1[2] -= a[znac]; mask ^= znac; break; } tem &= (tem - 1); } return; } if (x == 13) { if (ok) return; tem = (1 << 16) - 1; tem ^= mask; while (tem > 0) { znac = tem - (tem & (tem - 1)); if (a[znac] == sum2[0] - sum2[1]) { mask |= znac; p[3][1] = a[znac]; sum2[1] = sum2[0]; sum1[3] += a[znac]; super_dfs(x + 1); sum2[1] -= a[znac]; sum1[3] -= a[znac]; mask ^= znac; break; } tem &= (tem - 1); } return; } if (x == 14) { if (ok) return; tem = (1 << 16) - 1; tem ^= mask; while (tem > 0) { znac = tem - (tem & (tem - 1)); if (a[znac] == sum2[1] - sum2[2]) { mask |= znac; p[3][2] = a[znac]; sum2[2] = sum2[1]; sum1[3] += a[znac]; super_dfs(x + 1); sum2[2] -= a[znac]; sum1[3] -= a[znac]; mask ^= znac; break; } tem &= (tem - 1); } return; } tem = (1 << 16) - 1; tem ^= mask; while (tem > 0 && !ok) { znac = tem - (tem & (tem - 1)); mask |= znac; p[(x >> 2)][(x & 3)] = a[znac]; sum1[(x >> 2)] += a[znac]; sum2[(x & 3)] += a[znac]; if ((x >> 2) == (x & 3)) dio1 += a[znac]; if (x == 3 || x == 6 || x == 12) dio2 += a[znac]; super_dfs(x + 1); if ((x >> 2) == (x & 3)) dio1 -= a[znac]; if (x == 3 || x == 6 || x == 12) dio2 -= a[znac]; sum1[(x >> 2)] -= a[znac]; sum2[(x & 3)] -= a[znac]; mask ^= znac; tem &= (tem - 1); } } int main() { scanf( %d , &n); int i; int ss = 0; for (i = 0; i < n * n; i++) { scanf( %d , &a[(1 << i)]); ss += a[(1 << i)]; } if (n == 1) { printf( %d n , a[1]); printf( %d n , a[1]); return 0; } if (n == 2) { for (i = 0; i < n * n; i++) a[i] = a[(1 << i)]; dfs2(0); return 0; } if (n == 3) { for (i = 0; i < n * n; i++) a[i] = a[(1 << i)]; dfs(0); return 0; } if (n == 4) { sum = ss / n; super_dfs(0); return 0; } return 0; }
#include <bits/stdc++.h> using namespace std; int N, M, A, B; int main() { scanf( %d%d%d%d , &N, &M, &A, &B); int rA = (A - 1) / M + 1, cA = A - (rA - 1) * M; int rB = (B - 1) / M + 1, cB = B - (rB - 1) * M; if (B == N) cB = M; if (rA == rB) { puts( 1 ); exit(0); } if (rA + 1 == rB) { if (cA == 1 && cB == M) puts( 1 ); else puts( 2 ); exit(0); } int fA = (cA == 1); int fB = (cB == M); if (fA + fB) { printf( %d n , 3 - fA - fB); exit(0); } if (cB + 1 == cA) puts( 2 ); else puts( 3 ); return 0; }
#include <bits/stdc++.h> using namespace std; int ans[11][11]; bool ok; string s; int sol; queue<int> dulj, broj; int pomocnopolje[11][11]; void bfs(int x, int y, int a, int b) { broj.push(a); dulj.push(1); int v[10] = {0}; while (!broj.empty()) { int duljina = dulj.front(); dulj.pop(); int br = broj.front(); broj.pop(); if (!v[(br + x) % 10]) { v[(br + x) % 10] = duljina; broj.push((br + x) % 10); dulj.push(duljina + 1); } if (!v[(br + y) % 10]) { v[(br + y) % 10] = duljina; broj.push((br + y) % 10); dulj.push(duljina + 1); } } pomocnopolje[a][b] = v[b] - 1; return; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> s; for (int i = 0; i < 10; i++) { for (int j = i; j < 10; j++) { ok = 1; sol = 0; for (int k = 0; k < 10; k++) { for (int l = 0; l < 10; l++) { bfs(i, j, k, l); } } for (int znj = 1; znj < s.size() and ok; znj++) { int a = s[znj - 1] - 0 , b = s[znj] - 0 ; if (pomocnopolje[a][b] >= 0) sol += pomocnopolje[a][b]; else ok = 0; } if (ok) { ans[i][j] = sol; ans[j][i] = sol; } else { ans[i][j] = -1; ans[j][i] = -1; } } } for (int i = 0; i < 10; i++) { for (int j = 0; j < 10; j++) { cout << ans[i][j] << ; } cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 5; const int INF = 0x3f3f3f3f; template <typename Tp> struct RMQ { int n; int len[MAXN]; Tp mx[MAXN][21]; Tp mi[MAXN][21]; void build_rmq() { for (int j = 1; (1 << j) <= n; j++) for (int i = 1; i + (1 << j) - 1 <= n; i++) { mx[i][j] = max(mx[i][j - 1], mx[i + (1 << (j - 1))][j - 1]); mi[i][j] = min(mi[i][j - 1], mi[i + (1 << (j - 1))][j - 1]); } } int QueryMax(int L, int R) { if (L > R) return 0; int k = len[R - L + 1]; return max(mx[L][k], mx[R - (1 << k) + 1][k]); } int QueryMin(int L, int R) { if (L > R) return INF; int k = len[R - L + 1]; return min(mi[L][k], mi[R - (1 << k) + 1][k]); } void init(Tp *a, int sz) { n = sz; for (int i = 1; i <= n; i++) mx[i][0] = mi[i][0] = a[i]; build_rmq(); for (int i = 0; i <= n; i++) len[i] = (i == 0 ? -1 : len[i >> 1] + 1); } }; RMQ<int> st; int n, q, mx = 0, tim = 0; vector<int> E[MAXN]; int in[MAXN], out[MAXN], pos[MAXN], dep[MAXN], fa[MAXN][20]; void dfs(int now, int f = 1, int dp = 0) { mx = max(mx, dp); fa[now][0] = f; for (int i = 1; i < 20; i++) fa[now][i] = fa[fa[now][i - 1]][i - 1]; in[now] = ++tim; dep[now] = dp; pos[tim] = now; for (int v : E[now]) { dfs(v, now, dp + 1); } out[now] = tim; } int up(int L, int R, int now) { if (in[now] <= L && out[now] >= R) return dep[now]; for (int i = 19; i >= 0; i--) { int f = fa[now][i]; if (in[f] <= L && out[f] >= R) continue; now = fa[now][i]; } return dep[fa[now][0]]; } int main() { scanf( %d%d , &n, &q); for (int i = 2; i <= n; i++) { int x; scanf( %d , &x); E[x].push_back(i); } dfs(1); st.init(in, n); for (int i = 1; i <= q; i++) { int l, r; scanf( %d%d , &l, &r); if (l == r) { printf( %d %d n , l, mx); } else { int Mi = st.QueryMin(l, r); int Mx = st.QueryMax(l, r); int dep1, dep2; int now1, now2; int st1, st2; now1 = min(st.QueryMin(l, pos[Mi] - 1), st.QueryMin(pos[Mi] + 1, r)); now2 = max(st.QueryMax(l, pos[Mx] - 1), st.QueryMax(pos[Mx] + 1, r)); st1 = pos[Mx], st2 = pos[Mi]; dep1 = up(now1, Mx, st1); dep2 = up(Mi, now2, st2); if (dep1 > dep2) printf( %d %d n , st2, dep1); else printf( %d %d n , st1, dep2); } } return 0; }
#include <bits/stdc++.h> namespace std { template <typename A, typename B> inline string to_string(pair<A, B> p); template <typename A, typename B, typename C> inline string to_string(tuple<A, B, C> p); template <typename A, typename B, typename C, typename D> inline string to_string(tuple<A, B, C, D> p); inline string to_string(const string& s) { return + s + ; } inline string to_string(const char* s) { return to_string((string)s); } inline string to_string(bool b) { return (b ? true : false ); } inline string to_string(vector<bool> v) { bool first = true; string res = { ; for (int i = 0; i < static_cast<int>(v.size()); i++) { if (!first) { res += , ; } first = false; res += to_string(v[i]); } res += } ; return res; } template <size_t N> inline string to_string(bitset<N> v) { string res = ; for (size_t i = 0; i < N; i++) { res += static_cast<char>( 0 + v[i]); } return res; } template <typename A> inline string to_string(A v) { bool first = true; string res = { ; for (const auto& x : v) { if (!first) { res += , ; } first = false; res += to_string(x); } res += } ; return res; } template <typename A, typename B> inline string to_string(pair<A, B> p) { return ( + to_string(p.first) + , + to_string(p.second) + ) ; } template <typename A, typename B, typename C> inline string to_string(tuple<A, B, C> p) { return ( + to_string(get<0>(p)) + , + to_string(get<1>(p)) + , + to_string(get<2>(p)) + ) ; } template <typename A, typename B, typename C, typename D> inline string to_string(tuple<A, B, C, D> p) { return ( + to_string(get<0>(p)) + , + to_string(get<1>(p)) + , + to_string(get<2>(p)) + , + to_string(get<3>(p)) + ) ; } } // namespace std inline void debug_out() { std::cerr << std::endl; } template <typename Head, typename... Tail> inline void debug_out(Head H, Tail... T) { std::cerr << << std::to_string(H); debug_out(T...); } using namespace std; int main() { int n, m; scanf( %d%d , &n, &m); vector<vector<int>> e(n); for (int i = 0; i < m; i++) { int v, u; scanf( %d%d , &v, &u); v--; u--; e[v].push_back(u); e[u].push_back(v); } vector<pair<int, int>> color(n); vector<int> b(n); for (int i = 0; i < n; i++) { scanf( %d , &color[i].first); color[i].first--; color[i].second = i; b[i] = color[i].first; } sort((color).begin(), (color).end()); bool good = true; vector<int> use(n); for (int i = 0; i < n; i++) { int v = color[i].second; int tgt = color[i].first; vector<int> mask(tgt + 1); for (auto u : e[v]) { if (use[u]) { assert(b[u] <= tgt); mask[b[u]] = 1; } } for (int j = 0; j < tgt; j++) { if (mask[j] == 0) { good = false; } } if (mask[tgt]) { good = false; } use[v] = 1; } if (!good) { puts( -1 ); return 0; } for (auto x : color) { cout << x.second + 1 << ; } cout << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; while (n--) { int a; cin >> a; if (a < 4) { cout << 1 << endl; } else { if (a % 2 == 0) { cout << (a / 2) << endl; } else { cout << ((a - 1) / 2) << endl; } } } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 100000 + 10; const int M = 1000000007; const double eps = 1e-9; const double PI = acos(-1); const int oo = 1000000000; typedef double TT; struct point { TT x, y; point() : x(0), y(0) {} point(TT a, TT b) { x = a; y = b; } point operator+(const point& p) const { return point(x + p.x, y + p.y); } friend ostream& operator<<(ostream& os, const point& p) { return os << ( << p.x << , << p.y << ) ; } point operator-(const point& p) const { return point(x - p.x, y - p.y); } bool operator<(const point& p) const { if (x - p.x) return x < p.x; return y < p.y; } bool operator==(const point& p) const { return x == p.x && y == p.y; } bool operator!=(const point& p) const { return !(*this == p); } void scan() { scanf( %lf%lf , &x, &y); } double len() { return sqrt(x * x + y * y); } double dist(const point& p) const { return (p - *this).len(); } point operator*(TT d) { return point(x * d, y * d); } point operator/(TT d) { return point(x / d, y / d); } TT operator*(const point& p) const { return x * p.x + y * p.y; } TT operator^(const point& p) const { return x * p.y - y * p.x; } double linePointDist(point a, point b, bool seg = false) { point c = *this; if (seg) { if ((b - a) * (c - b) > 0) return b.dist(c); if ((a - b) * (c - a) > 0) return a.dist(c); } return abs((b - a) ^ (c - a)) / a.dist(b); } void rotate(double theta, point Z = point(0, 0)) { TT ox = x - Z.x; TT oy = y - Z.y; x = ox * cos(theta) - oy * sin(theta) + Z.x; y = ox * sin(theta) + oy * cos(theta) + Z.y; } }; double areaOfTri(point a, point b, point c) { point x = b - a; point y = c - a; return (x ^ y) / 2.0; } double areaOfPolygon(vector<point>& P) { TT area = 0; for (int i = 1; i < P.size() - 1; ++i) area += (P[i] - P[0]) ^ (P[i + 1] - P[0]); return abs(area / 2.0); } bool collinear(point a, point b, point c) { return areaOfTri(a, b, c) == 0; } vector<point> x(4), y(4); int main() { double mnx = oo, mxx = -oo, mny = oo, mxy = -oo; for (int i = 0; i < 4; ++i) { x[i].scan(); mnx = min(mnx, x[i].x); mny = min(mny, x[i].y); mxx = max(mxx, x[i].x); mxy = max(mxy, x[i].y); } point dx((mnx + mxx) / 2, (mny + mxy) / 2); for (int i = 0; i < 4; ++i) y[i].scan(); for (int i = 0; i < 4; ++i) if (y[i].x >= mnx && y[i].x <= mxx && y[i].y >= mny && y[i].y <= mxy) return cout << YES , 0; double area = abs(areaOfPolygon(y)); for (int i = 0; i < 4; ++i) { double cc = abs(areaOfTri(y[3], y[0], x[i])); for (int j = 1; j < 4; ++j) cc += abs(areaOfTri(y[j - 1], y[j], x[i])); if (abs(cc - area) < eps) return cout << YES , 0; } double cc = abs(areaOfTri(y[3], y[0], dx)); for (int j = 1; j < 4; ++j) cc += abs(areaOfTri(y[j - 1], y[j], dx)); if (abs(cc - area) < eps) return cout << YES , 0; cout << NO ; return 0; }
#include <bits/stdc++.h> using namespace std; long long a, b, c, l; long long sum; int main() { cin >> a >> b >> c >> l; sum = ((l + 1) * (l + 2) * (l + 3)) / 6; for (long long i = 0; i <= l; i++) { long long temp1 = a - b - c + i; if (temp1 >= 0) { long long temp2 = l - i; long long x = min(temp1, temp2); sum -= (x + 1) * (x + 2) / 2; } } for (long long i = 0; i <= l; i++) { long long temp1 = b - a - c + i; if (temp1 >= 0) { long long temp2 = l - i; long long x = min(temp1, temp2); sum -= (x + 1) * (x + 2) / 2; } } for (long long i = 0; i <= l; i++) { long long temp1 = c - b - a + i; if (temp1 >= 0) { long long temp2 = l - i; long long x = min(temp1, temp2); sum -= (x + 1) * (x + 2) / 2; } } cout << sum << endl; }
#include <bits/stdc++.h> using namespace std; using ll = long long int; using pii = pair<int, int>; constexpr int ALPHABET_SIZE = z - a + 1; constexpr int MAX_SIZE = 256; constexpr int INF = 1e8; int n; string s; string as, bs, cs; vector<int> next_pos[ALPHABET_SIZE]; int calced_pos[MAX_SIZE][MAX_SIZE][MAX_SIZE]; int calced_mark[MAX_SIZE][MAX_SIZE][MAX_SIZE]; int added_mark[MAX_SIZE][MAX_SIZE][MAX_SIZE]; int dda[(int)3e5]; int ddb[(int)3e5]; int ddc[(int)3e5]; void promote(int s_pos, int mark, int type) { int dsize = 0; int dptr = 0; if (type == 1) { for (int bb = 0; bb <= bs.size(); bb++) { for (int cc = 0; cc <= cs.size(); cc++) { dda[dsize] = s_pos; ddb[dsize] = bb; ddc[dsize] = cc; dsize++; calced_mark[s_pos][bb][cc] = mark; added_mark[s_pos][bb][cc] = mark; } } } else if (type == 2) { for (int aa = 0; aa <= as.size(); aa++) { for (int cc = 0; cc <= cs.size(); cc++) { dda[dsize] = aa; ddb[dsize] = s_pos; ddc[dsize] = cc; dsize++; calced_mark[aa][s_pos][cc] = mark; added_mark[aa][s_pos][cc] = mark; } } } else { for (int aa = 0; aa <= as.size(); aa++) { for (int bb = 0; bb <= bs.size(); bb++) { dda[dsize] = aa; ddb[dsize] = bb; ddc[dsize] = s_pos; dsize++; calced_mark[aa][bb][s_pos] = mark; added_mark[aa][bb][s_pos] = mark; } } } while (dptr < dsize) { int a = dda[dptr]; int b = ddb[dptr]; int c = ddc[dptr]; dptr++; int &m = calced_mark[a][b][c]; m = mark; added_mark[a][b][c] = mark; int &pos = calced_pos[a][b][c]; if (a == 0 && b == 0 && c == 0) { pos = 0; } if (a < as.size()) { int &p = calced_pos[a + 1][b][c]; int &mm = calced_mark[a + 1][b][c]; int &am = added_mark[a + 1][b][c]; if (am != mark) { if (mm != mark) { p = INF; mm = mark; dda[dsize] = a + 1; ddb[dsize] = b; ddc[dsize] = c; dsize++; } if (pos < n) p = min(p, next_pos[as[a] - a ][pos] + 1); } } if (b < bs.size()) { int &p = calced_pos[a][b + 1][c]; int &mm = calced_mark[a][b + 1][c]; int &am = added_mark[a][b + 1][c]; if (am != mark) { if (mm != mark) { p = INF; mm = mark; dda[dsize] = a; ddb[dsize] = b + 1; ddc[dsize] = c; dsize++; } if (pos < n) p = min(p, next_pos[bs[b] - a ][pos] + 1); } } if (c < cs.size()) { int &p = calced_pos[a][b][c + 1]; int &mm = calced_mark[a][b][c + 1]; int &am = added_mark[a][b][c + 1]; if (am != mark) { if (mm != mark) { p = INF; mm = mark; dda[dsize] = a; ddb[dsize] = b; ddc[dsize] = c + 1; dsize++; } if (pos < n) p = min(p, next_pos[cs[c] - a ][pos] + 1); } } } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); int q; cin >> n >> q; cin >> s; memset(calced_mark, 0, sizeof(calced_mark)); memset(added_mark, 0, sizeof(added_mark)); for (int i = 0; i < ALPHABET_SIZE; i++) { next_pos[i].resize(n, INF); } for (int i = n - 1; i >= 0; i--) { if (i + 1 < n) { for (int z = 0; z < ALPHABET_SIZE; z++) { next_pos[z][i] = next_pos[z][i + 1]; } } int c = s[i] - a ; next_pos[c][i] = i; } int mark = 228; char c, which; int num; while (q--) { mark++; cin >> c >> num; if (c == - ) { if (num == 1) { as.pop_back(); } else if (num == 2) { bs.pop_back(); } else if (num == 3) { cs.pop_back(); } } else { cin >> which; if (num == 1) { as.push_back(which); promote(as.size() - 1, mark, num); } else if (num == 2) { bs.push_back(which); promote(bs.size() - 1, mark, num); } else if (num == 3) { cs.push_back(which); promote(cs.size() - 1, mark, num); } } cout << (calced_pos[as.size()][bs.size()][cs.size()] <= s.size() ? YES : NO ) << endl; } }
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const long long INF = 1e18; const int MAXN = 2e5 + 5; const int T = 1e3 + 10; int dx[] = {-1, 1, 0, 0}; int dy[] = {0, 0, -1, 1}; long long binpow(long long val, long long deg) { if (!deg) return 1; if (deg & 1) return binpow(val, deg - 1) * val % MOD; long long res = binpow(val, deg / 2); return (res * res) % MOD; } long long inv(long long a) { return binpow(a, MOD - 2); } pair<int, int> operator+(const pair<int, int>& a, const pair<int, int>& b) { return make_pair(a.first + b.first, a.second + b.second); } pair<int, int> operator-(const pair<int, int>& a, const pair<int, int>& b) { return make_pair(a.first - b.first, a.second - b.second); } void rotate90(int& first, int& second, int x0, int y0) { first = first - x0; second = second - y0; swap(first, second); first = -first; first += x0; second += y0; } long long i, j; long long n, m; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cout << fixed; cout.precision(10); cin >> n >> m; set<int> column, line; while (m--) { int first, second; cin >> first >> second; column.insert(first); line.insert(second); cout << (n - column.size()) * (n - line.size()) << ; } return 0; }
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; const double PI = 3.141592653589793238463; const int INF = 0x3f3f3f3f; const int INFS = 1000000000; const long long LLINF = 9223372036854775807; const int M = 1000000007; const double EPS = 1e-9; set<int> get(int n) { set<int> ans = {}; for (int i = 2; i * i <= n; ++i) { if (n % i == 0) { ans.insert(i); while (n % i == 0) n /= i; } } if (n != 1) ans.insert(n); return ans; } signed main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); int n, m; cin >> n >> m; vector<set<int> > a(n + 1); for (int i = 1; i < n + 1; i++) a[i] = get(i); map<int, int> curr; vector<bool> on(n + 1, false); char t; int i; while (m--) { cin >> t >> i; if (t == + ) { if (on[i]) cout << Already on << endl; else { bool ok = true; int j; for (auto x : a[i]) { if (curr[x] != 0) { ok = false; j = curr[x]; break; } } if (ok) { cout << Success << endl; for (auto x : a[i]) curr[x] = i; on[i] = true; } else { cout << Conflict with << j << endl; } } } else { if (!on[i]) cout << Already off << endl; else { cout << Success << endl; for (auto x : a[i]) curr[x] = 0; on[i] = false; } } } return 0; }
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<vi> vvi; typedef vector<vll> vvll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef vector<pii> vpii; typedef vector<pll> vpll; typedef vector<vpii> vvpii; typedef vector<vpll> vvpll; #define pb push_back #define mp make_pair #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define sz(x) (int)(x).size() #define fi first #define se second template<class T> bool ckmin(T &a, const T &b) {return a > b ? a = b, 1 : 0;} template<class T> bool ckmax(T &a, const T &b) {return a < b ? a = b, 1 : 0;} namespace debug { void __print(int x) {cerr << x;} void __print(long long x) {cerr << x;} void __print(double x) {cerr << x;} void __print(long double x) {cerr << x;} void __print(char x) {cerr << << x << ;} void __print(const string &x) {cerr << << x << ;} void __print(bool x) {cerr << (x ? true : false );} template<typename T, typename V> void __print(const pair<T, V> &x) {cerr << { ; __print(x.first); cerr << , ; __print(x.second); cerr << } ;} template<typename T> void __print(const T &x) {int f = 0; cerr << { ; for(auto z : x) cerr << (f++ ? , : ), __print(z); cerr << } ;} void _print() {cerr << ] n ;} template <typename T, typename... V> void _print(T t, V... v) {__print(t); if(sizeof...(v)) cerr << , ; _print(v...);} #ifdef ljuba #define dbg(x...) cerr << LINE( << __LINE__ << ) -> << [ << #x << ] = [ ; _print(x) #else #define dbg(x...) #endif } using namespace debug; const char nl = n ; mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); int mat[1000][1000]; int m, k; bool moze(int n, const vi &v) { for(int i = 0; i < n; ++i) { for(int j = 0; j < n; ++j) { mat[i][j] = -1; } } vpii nz; for(int i = 0; i < k; ++i) { if(v[i]) { nz.pb({v[i], i+1}); } } sort(all(nz)); for(int i = 1; i < n; i += 2) { for(int j = 0; j < n; j += 2) { if(mat[i][j] != -1) continue; if(sz(nz) && nz.back().fi > 0) { nz.back().fi--; mat[i][j] = nz.back().se; if(nz.back().fi == 0) nz.pop_back(); } } } pii kasnije{-1, -1}; if(sz(nz) && nz.back().fi > 0) { kasnije = nz.back(); nz.pop_back(); } dbg(kasnije); for(int i = 0; i < n; i += 2) { for(int j = 1; j < n; j += 2) { if(mat[i][j] != -1) continue; if(sz(nz) && nz.back().fi > 0) { nz.back().fi--; mat[i][j] = nz.back().se; if(nz.back().fi == 0) nz.pop_back(); } } } if(kasnije.fi != -1) nz.pb(kasnije); for(int i = 0; i < n; i += 2) { for(int j = 0; j < n; j += 2) { if(mat[i][j] != -1) continue; if(sz(nz) && nz.back().fi > 0) { nz.back().fi--; mat[i][j] = nz.back().se; if(nz.back().fi == 0) nz.pop_back(); } } } for(int i = 0; i < n; ++i) { for(int j = 0; j < n; ++j) { if(i % 2 == 1 && j % 2 == 1) continue; if(sz(nz)) { nz.back().fi--; mat[i][j] = nz.back().se; if(nz.back().fi == 0) nz.pop_back(); } } } return nz.empty(); } void solve() { cin >> m >> k; vi v(k); for(auto &z : v) cin >> z; int mx = *max_element(all(v)); int n = -1; for(int i = 1; ; ++i) { ll izraz = i * 1LL * ((i + 1) / 2); if(mx <= izraz) { ckmax(n, i); break; } } for(int i = 1; ; ++i) { ll izraz = i * 1LL * i; ll temp = i / 2; izraz -= temp * 1LL * temp; if(m <= izraz) { ckmax(n, i); break; } } while(!moze(n, v)) ++n; cout << n << nl; for(int i = 0; i < n; ++i) { for(int j = 0; j < n; ++j) { if(mat[i][j] == -1) mat[i][j] = 0; cout << mat[i][j] << ; } cout << nl; } } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); #ifdef ljuba freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); freopen( error.txt , w , stderr); #endif int testCases = 1; cin >> testCases; while(testCases--) solve(); }
#include <bits/stdc++.h> using namespace std; int n, ans, kol[100500]; vector<int> v; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (int i = 0; i < n; i++) { int x; cin >> x; v.push_back(x); } sort(v.begin(), v.end()); for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (kol[j] <= v[i]) { kol[j]++; break; } for (int i = 0; i < n; i++) ans += (kol[i] > 0); cout << ans; }
#include <bits/stdc++.h> using namespace std; int main() { int n, x, y, dist1, dist2; char ch[3], a; ch[0] = getchar(); a = getchar(); ch[2] = getchar(); cin >> n; n = n % 4; if (n == 1 && ((ch[0] == ^ && ch[2] == > ) || (ch[0] == > && ch[2] == v ) || (ch[0] == v && ch[2] == < ) || (ch[0] == < && ch[2] == ^ ))) cout << cw ; else if (n == 1 && ((ch[0] == ^ && ch[2] == < ) || (ch[0] == < && ch[2] == v ) || (ch[0] == v && ch[2] == > ) || (ch[0] == > && ch[2] == ^ ))) cout << ccw ; else if (n == 3 && ((ch[0] == ^ && ch[2] == < ) || (ch[0] == > && ch[2] == ^ ) || (ch[0] == v && ch[2] == > ) || (ch[0] == < && ch[2] == v ))) cout << cw ; else if (n == 3 && ((ch[0] == ^ && ch[2] == > ) || (ch[0] == < && ch[2] == ^ ) || (ch[0] == v && ch[2] == < ) || (ch[0] == > && ch[2] == v ))) cout << ccw ; else cout << undefined ; }
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; string s; int a; int x = 0, y = n + 1; for (int i = 0; i < m; i++) { cin >> s; cin >> s; cin >> s; if (s[0] == r ) { cin >> s; cin >> a; if (a > x) x = a; } else { cin >> s; cin >> a; if (a < y) y = a; } } if (y - x <= 1 || x == n || y == 1) cout << -1; else cout << y - x - 1; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int q, n; cin >> q; while (q--) { cin >> n; vector<int> original; int temp; for (int i = 0; i < n; i++) { cin >> temp; original.push_back(temp); } for (int i = 0; i < original.size(); i++) { int days = 0; int origpos = i; int newpos = original[i]; bool home = false; while (!home) { newpos = original[newpos - 1]; if (newpos == original[i]) { home = true; } days++; } cout << days << ; } cout << endl; } }
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; priority_queue<int> q; for (int i = 0; i < 32; i++) { if (n & (1 << i)) { q.push(i); } } if (q.size() > k) { cout << NO n ; } else { while (q.size() != k) { int f = q.top(); q.pop(); if (f == 0) { cout << NO n ; return 0; } q.push(f - 1); q.push(f - 1); } cout << YES n ; while (!q.empty()) { int val = 1 << q.top(); cout << val << ; q.pop(); } } return 0; }
#include <bits/stdc++.h> using namespace std; template <class T> inline T mod_v(T num) { if (num >= 0) return num % 1000000007; else return (num % 1000000007 + 1000000007) % 1000000007; } template <class T> inline T gcd(T a, T b) { a = abs(a); b = abs(b); while (b) { a = a % b; swap(a, b); } return a; } template <class T> T fast_pow(T n, T p) { if (p == 0) return 1; if (p % 2) { T g = mod_v(mod_v(n) * mod_v(fast_pow(n, p - 1))); return g; } else { T g = fast_pow(n, p / 2); g = mod_v(mod_v(g) * mod_v(g)); return g; } } template <class T> inline T modInverse(T n) { return fast_pow(n, 1000000007 - 2); } template <class T> inline void debug(string S1, T S2, string S3) { cout << S1 << S2 << S3; } template <class T> inline T in() { register char c = 0; register T num = 0; bool n = false; while (c < 33) c = getchar(); while (c > 33) { if (c == - ) n = true; else num = num * 10 + c - 0 ; c = getchar(); } return n ? -num : num; } class data { public: int t, w; }; int dp[108][208][208]; int n; data ara[108]; vector<int> ans; int re(int p, int s, int u) { if (p == n) { return s; return ((s >= u) ? s : 100000000); } if (dp[p][s][u] != -1) return dp[p][s][u]; dp[p][s][u] = 1 << 30; if (u - ara[p].w - ara[p].t >= 0) { dp[p][s][u] = min(dp[p][s][u], re(p + 1, s - ara[p].t, u - ara[p].t - ara[p].w)); } ans.push_back(p + 1); dp[p][s][u] = min(dp[p][s][u], re(p + 1, s, u)); ans.pop_back(); return dp[p][s][u]; } int main() { n = in<int>(); int t = 0, w = 0; for (int i = 0; i < n; i++) { scanf( %d %d , &ara[i].t, &ara[i].w); t += ara[i].t; } memset(dp, -1, sizeof(dp)); ; printf( %d n , re(0, t, t)); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector<long long int> vec(n); for (int i = 0; i < n; i++) { cin >> vec[i]; } sort(vec.begin(), vec.end()); long long int sum = vec[n - 1]; int x = n - 2; while (k--) { sum += vec[x]; x--; } cout << sum << n ; } }