func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; struct ad { int l, r, i; bool operator<(const ad a) const { if (l != a.l) return l < a.l; return r > a.r; } }; const int INF = 1000000000; const int MAXN = 200005; const int SZ = 1 << 18; int N, M, A, B; long long res, resi, resj, C; pair<int, int> arr[2 * SZ]; ad S[MAXN]; vector<ad> T; set<pair<int, int> > Q, R; void build() { for (int i = SZ - 1; i > 0; i--) { arr[i] = max(arr[2 * i], arr[2 * i + 1]); } } inline pair<int, int> rmq(int l, int r) { l += SZ, r += SZ + 1; pair<int, int> res(0, 0); for (; l < r; l /= 2, r /= 2) { if (l & 1) res = max(res, arr[l++]); if (r & 1) res = max(res, arr[--r]); } return res; } inline long long calc(ad &a, int A, int B) { if (a.l > B || a.r < A) return 0; return min(a.r, B) - max(a.l, A); } int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> N >> M; for (int i = 0; i < N; i++) { cin >> S[i].l >> S[i].r; S[i].i = i; } sort(S, S + N); for (int i = 0; i < N; i++) { if (i > 0 && T.back().r >= S[i].r) continue; else T.push_back(S[i]); } for (int i = 0; i < T.size(); i++) { arr[SZ + i] = pair<int, int>(T[i].r - T[i].l, i); Q.insert(pair<int, int>(T[i].l, i)); R.insert(pair<int, int>(T[i].r, i)); } build(); for (int i = 0; i < M; i++) { cin >> A >> B >> C; set<pair<int, int> >::iterator it, jt; it = Q.upper_bound(pair<int, int>(A, INF)); jt = R.lower_bound(pair<int, int>(B, -INF)); if (it != Q.begin()) { it--; long long k = calc(T[it->second], A, B) * C; if (k > res) { res = k; resi = T[it->second].i + 1; resj = i + 1; } } if (jt != R.end()) { long long k = calc(T[jt->second], A, B) * C; if (k > res) { res = k; resi = T[jt->second].i + 1; resj = i + 1; } } it = Q.lower_bound(pair<int, int>(A, -INF)); jt = R.upper_bound(pair<int, int>(B, INF)); if (it != Q.end() && jt != R.begin()) { jt--; if (it->second <= jt->second) { pair<int, int> p = rmq(it->second, jt->second); if (p.first * C > res) { res = p.first * C; resi = T[p.second].i + 1; resj = i + 1; } } } } cout << res << n ; if (res > 0) { cout << resi << << resj << n ; } } |
#include <bits/stdc++.h> using namespace std; int fastio() { ios_base::sync_with_stdio(false); cout << fixed << setprecision(10); cin.tie(nullptr); return 0; } int __fastio = fastio(); void __print(int x) { cerr << x; } void __print(long x) { cerr << x; } void __print(long long x) { cerr << x; } void __print(unsigned x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __print(float x) { cerr << x; } void __print(double x) { cerr << x; } void __print(long double x) { cerr << x; } void __print(char x) { cerr << << x << ; } void __print(const char *x) { cerr << << x << ; } void __print(const string &x) { cerr << << x << ; } void __print(bool x) { cerr << (x ? 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 i : x) cerr << (f++ ? , : ), __print(i); cerr << } ; } void _print() { cerr << ] n ; } template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << , ; _print(v...); } void solve() { int n, m; cin >> n >> m; vector<int> res(n + 1); set<int> alive; for (int i = 1; i <= n; i++) alive.insert(i); vector<tuple<int, int, int>> events; for (int i = 0; i < m; i++) { int l, r, x; cin >> l >> r >> x; events.emplace_back(l, r, x); } for (auto [l, r, x] : events) { auto lb = alive.lower_bound(l); vector<int> killed; while (lb != alive.end() && *lb <= r) { killed.push_back(*lb); ++lb; } for (auto &k : killed) { if (k != x) { res[k] = x; alive.erase(k); } } } for (int i = 1; i <= n; i++) cout << res[i] << ; } int main() { int t = 1; while (t--) { solve(); } } |
#include <bits/stdc++.h> const long long N = 2e5 + 5, MOD = 1e9 + 7; using namespace std; int dx[] = {-1, -1, 0, 1, 1, 1, 0, -1}; int dy[] = {0, 1, 1, 1, 0, -1, -1, -1}; long long n, m, a[N], cnt, ans; string s; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m; for (int i = 1; i <= n; ++i) cin >> a[i], a[i] += a[i - 1]; for (long long i = 1, x; i <= m; i++) { cin >> x; long long lb = lower_bound(a + 1, a + n + 1, x) - a; cout << lb << << x - a[lb - 1] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; enum { MAXN = 100010 }; pair<long long, long long> d[MAXN]; int x[MAXN], t[MAXN]; long long minv[MAXN]; int solveB(int n) { int mans = 0; for (int i = 0; i < n; i++) { int f = upper_bound(minv, minv + mans, d[i].second) - minv + 1; if (f > mans) { minv[mans] = d[i].second; mans = f; } else minv[f - 1] = min(minv[f - 1], d[i].second); } return mans; } int solveA(int n) { int mans = 1; minv[0] = 0; for (int i = 0; i < n; i++) if (d[i].first >= 0) { int f = upper_bound(minv, minv + mans, d[i].second) - minv + 1; if (f > 1) { if (f > mans) { minv[mans] = d[i].second; mans = f; } else minv[f - 1] = min(minv[f - 1], d[i].second); } } return mans - 1; } int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d%d , &x[i], &t[i]); int v; scanf( %d , &v); for (int i = 0; i < n; i++) d[i] = make_pair(x[i] + (long long)t[i] * v, -x[i] + (long long)t[i] * v); sort(d, d + n); int ansA = solveA(n); int ansB = solveB(n); printf( %d n%d n , ansA, ansB); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; long long n; cin >> n; long long arr[n]; for (long long i = 0; i < n; ++i) { cin >> arr[i]; } if (n == 1) { cout << 1 << << 1 << n ; cout << 1 << n ; cout << 1 << << 1 << n ; cout << 1 << n ; cout << 1 << << 1 << n ; cout << -(arr[0] + 2) << n ; return 0; } if (n == 2) { cout << 1 << << 1 << n ; cout << n - arr[0] << n ; cout << 2 << << 2 << n ; cout << n - arr[1] << n ; cout << 1 << << 2 << n ; cout << -n << << -n << n ; return 0; } long long dist[n]; for (long long i = 0; i < n; ++i) { dist[i] = n - (arr[i] % n); dist[i] %= n; } vector<long long> vec; for (long long i = 0; i < n - 1; ++i) { long long X = ((n - 1) - dist[i]) % (n - 1); X %= (n - 1); X += n - 1; X %= (n - 1); long long temp = (dist[i] + n * X); vec.push_back(temp); assert(temp >= -1000000000000000000 && temp <= 1000000000000000000); assert(temp % (n - 1) == 0); } cout << 1 << n - 1 << n ; for (long long i = 0; i < vec.size(); ++i) { cout << vec[i] << ; arr[i] = arr[i] + vec[i]; assert(arr[i] % n == 0); } cout << n ; cout << n << << n << n ; cout << dist[n - 1] << n ; arr[n - 1] += dist[n - 1]; assert(arr[n - 1] % n == 0); cout << 1 << << n << n ; for (long long i = 0; i < n; ++i) { cout << -arr[i] << ; assert(arr[i] % n == 0); } cout << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; int a; for (int i = 0; i < t; i++) { int n, m; cin >> n >> m; if (n == 1 && m == 1) { cout << 1 << endl; } else if ((n == 1 && m != 1) || (m == 1 && n != 1)) { if ((n * m) % 2 == 0) { a = (n * m) / 2; cout << a << endl; } else { a = (n * m) / 2; cout << a + 1 << endl; } } if ((n * m) % 2 == 1 && n != 1 && m != 1) { a = (n * m) / 2; a++; cout << a << endl; } if ((n * m) % 2 == 0 && n != 1 && m != 1) { a = (n * m) / 2; cout << a << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; const int TMXN = 1e6 * 4 + 1; const int INF = 1e9 + 7; const long long INFL = 1e18; int n, k; char a[N]; int mink = INF; int pref[N]; int main() { cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> a[i]; if (!(a[i] - 48)) { pref[i] = pref[i - 1] + 1; } else { pref[i] = pref[i - 1]; } } for (int i = n + 1; i <= N; i++) { pref[i] = pref[i - 1]; } for (int i = 1; i <= n; i++) { int l = 0; int r = max(n - i, i - 1) + 1; if (a[i] == 0 ) { while (r - l > 1) { int mid = (r + l) / 2; if (pref[i + mid] - pref[max(i - mid - 1, 0)] >= k + 1) { r = mid; } else { l = mid; } } if (pref[i + r] - pref[max(i - r - 1, 0)] >= k + 1) { mink = min(mink, r); } if (pref[i + l] - pref[max(i - l - 1, 0)] >= k + 1) { mink = min(mink, l); } } } cout << mink; return 0; } |
#include <bits/stdc++.h> using namespace std; int32_t main() { int64_t t; cin >> t; for (int64_t i = 0; i < t; i++) { int64_t a, b; cin >> a >> b; if (a == b) { cout << 0 << endl; continue; } int64_t k = abs(b - a); int64_t ans = k / 5; k %= 5; ans += k / 2; k %= 2; ans += k; cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; vector<int> all[2010]; int dist(pair<int, int> a, pair<int, int> b) { return abs(a.first - b.first) + abs(a.second - b.second); } int main() { int n, m, k; scanf( %d%d%d , &n, &m, &k); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { all[i].push_back(j); } } for (int q = 0; q < k; q++) { int x, y; scanf( %d%d , &x, &y); int d = sqrt(q); pair<int, int> ans(1000000, 1000000); for (int j = 0; j <= n && j <= dist(ans, make_pair(x, y)); j++) { for (int k = 0; k < 2; k++) { int i = x; if (k) i = min(n, i + j); else i = max(0, i - j); if (all[i].size() == 0) continue; int t = lower_bound(all[i].begin(), all[i].end(), y) - all[i].begin(); int p1 = all[i][(t == all[i].size() ? t - 1 : t)]; int p2 = all[i][(t - 1 == -1 ? t : t - 1)]; pair<int, int> now(i, p2); if (abs(p1 - y) < abs(p2 - y)) now.second = p1; if (dist(make_pair(x, y), ans) > dist(make_pair(x, y), now)) ans = now; if (dist(make_pair(x, y), ans) == dist(make_pair(x, y), now) && now < ans) ans = now; } } printf( %d %d n , ans.first, ans.second); all[ans.first].erase( lower_bound(all[ans.first].begin(), all[ans.first].end(), ans.second)); } return 0; } |
#include <bits/stdc++.h> using namespace std; int i, i0, n, m, a[105]; bool vis[100]; vector<int> ans; int main() { while (scanf( %d , &n) != EOF) { for (i = 0; i < n; i++) scanf( %d , &a[i]); sort(a, a + n); for (i = 0; i < n; i++) { if (a[i] == 0) { ans.push_back(a[i]); vis[0] = 1; break; } } for (i = 0; i < n; i++) { if (a[i] < 10 && a[i] != 0) { ans.push_back(a[i]); vis[1] = 1; break; } } for (i = 0; i < n; i++) { if (a[i] < 100 && a[i] % 10 == 0 && a[i] >= 10) { ans.push_back(a[i]); vis[2] = 1; break; } } for (i = 0; i < n; i++) { if (a[i] == 100) { ans.push_back(a[i]); vis[3] = 1; break; } } if (vis[1] == 0 && vis[2] == 0) { for (i = 0; i < n; i++) if (a[i] < 100 && a[i] >= 10) { ans.push_back(a[i]); break; } } printf( %d n , ans.size()); for (i = 0; i < ans.size(); i++) { printf( %d , ans[i]); if (ans.size() - 1 == i) printf( n ); else printf( ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); int n; cin >> n; string second; cin >> second; for (int i = 0; i < (int)n; i++) { if (i < n - 2 && second[i] == o && second[i + 1] == g && second[i + 2] == o ) { cout << *** ; int j = i + 3; bool flag = false; while (j < n - 1) { if (second[j] == g && second[j + 1] == o ) { flag = true; j += 2; } else break; } i = j - 1; } else { cout << second[i]; } } } |
#include <bits/stdc++.h> int f[1000001]; int main() { int n; scanf( %d , &n); f[0] = 0; f[1] = 1; f[2] = 1; int i, j, k; for (i = 3;; i++) { f[i] = f[i - 1] + f[i - 2]; if (f[i] > 1000000000) break; } int idx = i; int no = 0; for (i = 0; i < idx; i++) { for (j = i; j < idx; j++) { for (k = i; k < idx; k++) { if ((long long)f[i] + (long long)f[j] + (long long)f[k] == n) { no = 1; printf( %d %d %d n , f[i], f[j], f[k]); break; } } if (no) break; } if (no) break; } if (no == 0) printf( I m too stupid to solve this problem n ); scanf( ); } |
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; int n, nn, sz[133333], p; vector<int> g[133333], V; void dfs_sz(int x, int par) { sz[x] = 1; for (int to : g[x]) { if (to != par) { dfs_sz(to, x); sz[x] += sz[to]; } } if (sz[x] == n / 2 || sz[x] == n / 2 + 1) { V.push_back(x); if (~par) V.push_back(par); } } int dp[133333]; int dfs(int x, int par) { if (g[x].size() - (par != -1) == 0) { dp[x] = 1; return dp[x]; } vector<int> v; for (int to : g[x]) { if (to != par) { dfs(to, x); v.push_back(dp[to]); } } sort(v.begin(), v.end()); if (v.size() == 1) { if (v[0] == 1) { dp[x] = -2; p = x; } else { dp[x] = inf; } } else if (v.size() == 2) { if (v[1] < 0) { dp[x] = inf; } else if (v[0] < 0) { if (v[0] + v[1] == 0) dp[x] = v[0] - 1; else dp[x] = inf; } else { if (v[0] == v[1]) { dp[x] = v[0] + 1; } } } else if (v.size() == 3) { if (v[0] == v[1] && v[2] == v[1] + 1) { dp[x] = -v[2] - 1; p = x; } else { dp[x] = inf; } } return dp[x]; } int main() { cin >> nn; n = (1 << nn) - 2; for (int i = 1; i < n; i++) { int x, y; cin >> x >> y; g[x].push_back(y); g[y].push_back(x); } dfs_sz(1, -1); set<int> ans; for (int x : V) { p = 0; dfs(x, -1); if (dp[x] == -nn && p) ans.insert(p); } cout << ans.size() << endl; for (int x : ans) { cout << x << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string a, s = ; int b; cin >> b; for (int i = -1; i < b; i++) { getline(cin, a); int len = a.length(); if (len >= 2 and a.substr(len - 2, 2) == po ) { s += FILIPINO ; s += n ; } else if (len >= 4 and a.substr(len - 4, 4) == masu or len >= 4 and a.substr(len - 4, 4) == desu ) { s += JAPANESE ; s += n ; } else if (len >= 5 and a.substr(len - 5, 5) == mnida ) { s += KOREAN ; s += n ; } } cout << s; } |
#include <bits/stdc++.h> int xx[4][5] = { {0, 0, 0, 1, 2}, {0, 1, 1, 1, 2}, {0, 1, 2, 2, 2}, {0, 1, 1, 1, 2}}; int yy[4][5] = { {0, 1, 2, 1, 1}, {2, 0, 1, 2, 2}, {1, 1, 0, 1, 2}, {0, 0, 1, 2, 0}}; struct num { int x, y, z; }; int l[(20 * 20 * 25)], r[(20 * 20 * 25)], d[(20 * 20 * 25)], u[(20 * 20 * 25)], c[(20 * 20 * 25)], add[(20 * 20 * 25)], s[(20 * 20)], tmp[(20 * 20)]; num o[100], name[(20 * 20 * 25)], best[100]; int bb[20][20]; char out[20][20]; int n, m, i, j, k, i1, len = 0, ans = 0, ss = 0; int bo; inline int calc(int x, int y) { return (x - 1) * m + y; } void remove(int x) { l[r[x]] = l[x]; r[l[x]] = r[x]; for (int i = d[x]; i != x; i = d[i]) { for (int j = r[i]; j != i; j = r[j]) { u[d[j]] = u[j]; d[u[j]] = d[j]; s[c[j]]--; ss++; } } } void resume(int x) { for (int i = u[x]; i != x; i = u[i]) for (int j = l[i]; j != i; j = l[j]) { u[d[j]] = j; d[u[j]] = j; s[c[j]]++; ss++; } l[r[x]] = x; r[l[x]] = x; } void dfs(int t) { if (ss > 400000000) return; if (bo) return; if (!r[0]) { if (t >= ans) { memcpy(best, o, sizeof(o)); bo = 1; } return; } int x = 0, min = 100000, num = 0; for (int i = r[0]; i; i = r[i]) { if (s[i] < min) min = s[i], x = i; num++; } if (num / 5 + t + 1 <= ans) return; remove(x); for (int i = d[x]; i != x; i = d[i]) { for (int j = r[i]; j != i; j = r[j]) remove(c[j]); if (add[i] == 1) o[t + 1] = name[i]; dfs(t + add[i]); for (int j = l[i]; j != i; j = l[j]) resume(c[j]); } resume(x); } int main() { scanf( %d%d , &n, &m); for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) { r[len] = len + 1; ++len; l[len] = len - 1; c[len] = len; tmp[len] = len; add[len] = 1; s[len] = 1; } for (i = 1; i <= n - 2; i++) for (j = 1; j <= m - 2; j++) for (k = 0; k < 4; k++) for (i1 = 0; i1 < 5; i1++) { int x = i + xx[k][i1], y = j + yy[k][i1]; ++len; add[len] = 1; name[len].x = i; name[len].y = j; name[len].z = k; s[calc(x, y)]++; c[len] = calc(x, y); if (i1 == 0) l[len] = len + 4; else l[len] = len - 1; if (i1 == 4) r[len] = len - 4; else r[len] = len + 1; u[len] = tmp[calc(x, y)]; d[tmp[calc(x, y)]] = len; tmp[calc(x, y)] = len; } for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) { len++; c[len] = calc(i, j); r[len] = l[len] = len; u[len] = tmp[calc(i, j)]; d[tmp[calc(i, j)]] = len; u[calc(i, j)] = len; d[len] = calc(i, j); s[calc(i, j)]++; } for (ans = 0; ans <= 100; ans++) { bo = 0; ss = 0; dfs(0); if (ss >= 400000000) { ans++; break; } if (!bo) break; } ans--; if (ans < 0) ans = 0; printf( %d n , ans); for (i = 1; i <= ans; i++) for (j = 0; j < 5; j++) bb[best[i].x + xx[best[i].z][j]][best[i].y + yy[best[i].z][j]] = i; for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) { if (bb[i][j] == 0) out[i][j] = . ; else out[i][j] = A + bb[i][j] - 1; } for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) printf( %c , out[i][j]); printf( n ); } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; int type0, type1; void dfs(int s, bool visited[], vector<int> adj[], int type[], int ctr) { if (visited[s]) return; visited[s] = true; type[s] = ctr; if (ctr == 0) type0++; else type1++; ctr = (ctr + 1) % 2; for (auto u : adj[s]) dfs(u, visited, adj, type, ctr); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, m; cin >> n >> m; bool visited[n + 1]; memset(visited, false, sizeof(visited)); vector<int> adj[n + 1]; for (int i = 0; i < m; i++) { int a, b; cin >> a >> b; adj[a].push_back(b); adj[b].push_back(a); } int type[n + 1]; memset(type, -1, sizeof(type)); type0 = 0; type1 = 0; int ctr = 0; for (int i = 1; i <= n; i++) { if (!visited[i]) { dfs(i, visited, adj, type, ctr); } } if (type0 <= type1) { cout << type0 << n ; for (int i = 1; i <= n; i++) { if (type[i] == 0) cout << i << ; } } else { cout << type1 << n ; for (int i = 1; i <= n; i++) { if (type[i] == 1) cout << i << ; } } cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:16777216 ) const double EPS = 1e-7; double iabs(const double a) { return (a < -EPS) ? -a : a; } double imin(const double a, const double b) { return (a - b > EPS) ? b : a; } double imax(const double a, const double b) { return (a - b > EPS) ? a : b; } template <class I> I iabs(const I a) { return (a < 0) ? -a : a; } template <class I> I imin(const I a, const I b) { return (a < b) ? a : b; } template <class I> I imax(const I a, const I b) { return (a < b) ? b : a; } template <class I> inline I mod_pow(const I& x, const long long p, const I& m) { if (p == 0) return 1; I mult = (p & 1) ? x : 1; I t = mod_pow(x, p / 2, m) % m; return (((mult * t) % m) * t) % m; } template <class T> inline T ipow(const T& x, const long long p) { if (p == 0) return 1; T mult = (p & 1) ? x : 1; T h = ipow(x, p / 2); return h * h * mult; } unsigned long long gcd(unsigned long long a, unsigned long long b) { if (a == 0) return b; return gcd(b % a, a); } template <int SIZE> class DSU { public: int parent[SIZE]; int rank[SIZE]; int count; void clear() { for (int i = 0; i < SIZE; i++) { this->parent[i] = -1; this->rank[i] = 0; } this->count = 0; } DSU() { this->clear(); } void make(int x) { this->parent[x] = x; this->rank[x] = 1; this->count++; } bool in_a_set(int x) { return this->parent[x] != -1; } int find(int x) { if (x == this->parent[x]) return x; return this->parent[x] = find(this->parent[x]); } void combine(int x, int y) { x = this->find(x); y = this->find(y); if (x != y) { if (this->rank[x] > this->rank[y]) this->parent[x] = y; else this->parent[y] = x; } } }; class BigInt { public: const static unsigned int N = 1000; const static unsigned int base = 10; unsigned int len; short sign; unsigned int digits[N]; BigInt(const BigInt& bi) { this->len = bi.len; this->sign = bi.sign; for (unsigned int i = 0; i < this->len; ++i) (*this)[i] = bi[i]; } BigInt(long long n) { this->len = 0; this->sign = (n >= 0) ? 1 : -1; this->digits[0] = 0; while (n) { this->digits[this->len] = n % this->base; n /= this->base; this->len++; } if (this->len == 0) this->len = 1; } BigInt(string s) { this->sign = (s[0] == - ) ? 1 : -1; this->digits[0] = 0; if (s[0] == - ) s = s.substr(1, s.length() - 1); this->len = s.length(); for (unsigned int i = 0; i < this->len; i++) (*this)[i] = s[this->len - i - 1] - 0 ; } string toString() const { stringstream ss; for (int i = this->len - 1; i >= 0; --i) ss << (*this)[i]; return ss.str(); } unsigned int& operator[](const unsigned int i) { return digits[i]; } unsigned int operator[](const unsigned int i) const { if (i < this->len) return this->digits[i]; return 0; } bool iszero() const { if (this->len <= 1 && this->digits[0] == 0) return true; return false; } BigInt& operator=(const BigInt& rval) { if (this != &rval) { this->len = rval.len; this->sign = rval.sign; for (unsigned int i = 0; i < this->len; ++i) (*this)[i] = rval[i]; } return *this; } BigInt operator+(const BigInt& rhs) const { BigInt s(0); unsigned long long r = 0, d, i; for (i = 0; i < max(this->len, rhs.len); i++) { d = (*this)[i] + rhs[i] + r; r = d / this->base; s[i] = d % this->base; } s.len = max(this->len, rhs.len); if (r) s[s.len++] = r; return s; } BigInt operator+(unsigned long long rhs) const { BigInt s(*this); unsigned long long r = 0, d, i = 0; while (rhs != 0 || r != 0) { d = s[i] + (rhs % s.base) + r; rhs /= s.base; r = d / s.base; s[i] = d % s.base; i++; } if (i > s.len) s.len = i; return s; } BigInt operator*(unsigned long long rhs) const { if (rhs == 0) return BigInt(0); BigInt s(*this); unsigned long long r = 0, d, i; for (i = 0; i < s.len; ++i) { d = s[i] * rhs + r; r = d / this->base; s[i] = d % this->base; } while (r) s[s.len++] = r % this->base, r /= this->base; return s; } BigInt operator*(const BigInt& rhs) const { BigInt s(0); if (rhs.iszero()) return s; unsigned long long r, d, i, j, k; for (i = 0; i < this->N; i++) s[i] = 0; for (i = 0; i < this->len; i++) { r = 0; for (j = 0, k = i; j < rhs.len; j++, k++) { d = (*this)[i] * rhs[j] + r + s[k]; r = d / this->base; s[k] = d % this->base; } while (r) s[k++] = r % this->base, r /= this->base; if (k > s.len) s.len = k; } while (s.len > 1 && s[s.len - 1] == 0) s.len--; return s; } unsigned int operator%(unsigned int rhs) { BigInt t(*this); unsigned long long pow = 1; unsigned long long mod = 0; for (unsigned int i = 0; i < this->len && pow != 0; i++) { mod = (((*this)[i] % rhs) * pow + mod) % rhs; pow = (pow * this->base) % rhs; } return mod; } }; vector<long long> genprimes(const int n) { vector<long long> res; res.push_back(2); long long m, t, j; for (int i = 3; i <= n; i++) { j = 0; m = res.size(); t = (long long)sqrt(i * 1.0) + 1; while (j < m && res[j] < t && i % res[j] != 0) j++; if (j == m || res[j] >= t) res.push_back(i); } return res; } const unsigned long long N = 1000; const long long INF = 100000000; long long n, m, i, j, k, t, d; int main(int argc, char* argv[]) { cin >> n; if (n < 3) cout << -1 n ; else { for (i = n; i > 0; i--) cout << i << ; cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> l[1000000]; int main() { int n; cin >> n; int a[n], b[n], c[n]; for (int i = 0; i < n; i++) { cin >> a[i]; l[a[i]].push_back(i + 1); } int q = 0; for (int i = 0; i < n; i++) { int j = a[i]; if (a[j - 1] != j) q = 1; } int m = 1; for (int i = 1; i <= n; i++) { int z = 0; for (std::vector<int>::iterator it = l[i].begin(); it != l[i].end(); ++it) { b[*it - 1] = m; z = 1; } if (z == 1) { c[m - 1] = i; m++; } } if (q == 0) { cout << m - 1 << endl; for (int i = 0; i < n; i++) { cout << b[i] << ; } cout << endl; for (int i = 0; i < m - 1; i++) { cout << c[i] << ; } } else cout << -1 ; } |
#include <bits/stdc++.h> using namespace std; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n; cin >> n; long long mxmx = -1, mnmx = -1; while (n--) { long long x, y, h, w; char c; cin >> c; if (c == + ) { cin >> x >> y; if (x < y) swap(x, y); mxmx = max(mxmx, x); mnmx = max(mnmx, y); } else { cin >> h >> w; if (max(h, w) >= mxmx && min(h, w) >= mnmx) cout << YES << n ; else cout << NO << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (b == 0) { return a; } else { return gcd(b, a % b); } } long long lcm(long long a, long long b) { return (a * b) / (gcd(a, b)); } void solve() { long long n; cin >> n; vector<long long> arr(n); map<long long, vector<long long>> vec; for (long long i = 0; i < n; i++) { cin >> arr[i]; for (long long k = 0; k < 32; k++) { if (arr[i] & 1 << k) { vec[k].push_back(i); } } } long long ans = -1; for (auto itr = vec.rbegin(); itr != vec.rend(); itr++) { if (itr->second.size() == 1) { ans = *itr->second.begin(); cout << arr[ans] << ; break; } } for (long long i = 0; i < n; i++) { if (i == ans) { continue; } cout << arr[i] << ; } cout << n ; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin.tie(0); cout.tie(0); long long t; t = 1; while (t--) { solve(); } } |
#include <bits/stdc++.h> #define inf 0x3f3f3f3f #define IOS ios_base::sync_with_stdio(0); cin.tie(0); #define rep(i, a, n) for(int i = a; i <= n; ++ i) #define per(i, a, n) for(int i = n; i >= a; -- i) //#define ONLINE_JUDGE using namespace std; typedef long long ll; const int mod=1e9+7; template<typename T>void write(T x) { if(x<0) { putchar( - ); x=-x; } if(x>9) { write(x/10); } putchar(x%10+ 0 ); } template<typename T> void read(T &x) { x = 0;char ch = getchar();ll f = 1; while(!isdigit(ch)){if(ch == - )f*=-1;ch=getchar();} while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f; } int gcd(int a,int b){return b==0?a:gcd(b,a%b);} int lcm(int a,int b){return a/gcd(a,b)*b;}; ll ksm(ll a,ll n){ ll ans=1; while(n){ if(n&1) ans=(ans*a)%mod; a=a*a%mod; n>>=1; } return ans%mod; } //============================================================== #define int ll const int maxn=1e3+100; int t,n,k,a[maxn]; ll cnt[maxn]; map<int,int>need; ll f[maxn],finv[maxn]; void init(){ f[0]=1; rep(i,1,maxn-1)f[i]=f[i-1]*i%mod; finv[maxn-1]=ksm(f[maxn-1],mod-2); per(i,0,maxn-2){ finv[i]=(finv[i+1]*(i+1))%mod; } } ll C(ll n,ll k){ return (f[n]*finv[n-k]%mod*finv[k]%mod)%mod; } signed main() { #ifndef ONLINE_JUDGE freopen( in.txt , r ,stdin); freopen( out.txt , w ,stdout); #endif //clock_t c1 = clock(); //=========================================================== read(t); init(); while(t--){ need.clear(); read(n),read(k); rep(i,1,n) read(a[i]); sort(a+1,a+1+n); int mx=0; ll ans=1; per(i,n-k+1,n)mx+=a[i],need[a[i]]++; rep(i,1,n)cnt[a[i]]++; for(auto x:need){ int now=x.first; int num=x.second; ans=(ans*C(cnt[now],num))%mod; } write(ans%mod),putchar( n ); fill(cnt,cnt+n+1,0); } //=========================================================== //std::cerr << Time: << clock() - c1 << ms << std::endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long i, j, n, m, f1, f2, t, k, a, b, x1, x2, w; long long ans = -1; vector<long long> vis; vector<vector<long long>> adj; long long dfs(long long v) { vis[v] = 1; long long value = 1; for (long long u : adj[v]) { if (!vis[u]) { value += dfs(u); } } if (value % 2 == 0) ans++; return value; } int main() { t = 1; while (t--) { cin >> n; adj.assign(n + 1, {}); vis.assign(n + 1, 0); for (i = 1; i < n; i++) { cin >> a >> b; adj[a].push_back(b); adj[b].push_back(a); } if (n & 1) { cout << -1; return 0; } dfs(1); cout << ans; } } |
#include <bits/stdc++.h> using namespace std; long long sum(long long a[], long long n, long long s) { for (long long i = 0; i < n; i++) s += a[i]; return s; } long long power(long long x, long long y, long long p) { long long res = 1; x = x % p; if (x == 0) return 0; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } void solve() { long double a, b, x, y, z; cin >> a >> b; x = int((a + b) / (2 * b)); y = 2.0 * x; z = (1.0 * a + 1.0 * b) / y; if (a < b) { cout << -1 << endl; return; } cout << setprecision(12) << z << endl; return; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); long long t, T; T = 1; for (t = 1; t <= T; t++) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e3 + 9; char s[N]; bool vis[N]; struct Point { long long x, y, id; Point(long long _x = 0, long long _y = 0, long long _id = 0) { x = _x; y = _y; id = _id; } Point operator-(const Point& b) const { return Point(x - b.x, y - b.y); } } p[N], p0, tem[N]; long long cross(Point a, Point b) { return a.x * b.y - b.x * a.y; } bool cmp(Point a, Point b) { return cross(a - p0, b - p0) >= 0; } int main() { int n; scanf( %d , &n); p0 = Point(10000000000, 10000000000); for (int i = 1; i <= n; ++i) { scanf( %lld %lld , &p[i].x, &p[i].y); p[i].id = i; if (p[i].y < p0.y || (p0.y == p[i].y && p[i].x < p0.x)) p0 = p[i]; } scanf( %s , s); vector<int> ans; ans.push_back(p0.id); vis[p0.id] = 1; int sp = 0; for (int i = 2; i <= n; ++i, ++sp) { int cnt = 0; for (int j = 1; j <= n; ++j) { if (vis[j]) continue; tem[++cnt] = p[j]; } sort(tem + 1, tem + 1 + cnt, cmp); int nex; if (s[sp] == L ) nex = tem[1].id; else nex = tem[cnt].id; ans.push_back(nex); vis[nex] = 1; p0 = p[nex]; } for (int i = 0; i < (int)ans.size(); ++i) printf( %d , ans[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, ans; int a[100005]; vector<int> v[100005]; void solve() { int i, j, k, flag = 0, ok, sz, tmp; for (i = 1; i <= 500; i++) { ok = 1; random_shuffle(a + 1, a + n + 1); for (j = 1; j <= m; j++) { sz = v[a[j]].size(); for (k = 0; k < sz; k++) { if (j == n) tmp = 1; else tmp = j + 1; if (v[a[j]][k] == a[tmp]) { ok = 0; break; } } } if (ok) { flag = 1; for (j = 1; j <= m; j++) { if (j == n) tmp = 1; else tmp = j + 1; printf( %d %d n , a[j], a[tmp]); } break; } } if (!flag) printf( -1 n ); } int main() { int i, j, l, r; while (~scanf( %d%d , &n, &m)) { for (i = 1; i <= n; i++) { v[i].clear(); a[i] = i; } for (i = 1; i <= m; i++) { scanf( %d%d , &l, &r); v[l].push_back(r); v[r].push_back(l); } solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const double PI = 3.14159265359; int n, k; long long S; vector<vector<long long>> dp(25); vector<long long> fact(20, 1ll); long long getFactVal(int mask, vector<long long>& vi) { long long ans = 0; int m = vi.size(); for (int i = 0; i < m; i++) { if ((1 << i) & mask) { if (vi[i] > 19) { return S + 1; } else { ans += fact[vi[i]]; } } if (ans > S) { return S + 1; } } return ans; } long long getVal(int mask, vector<long long>& vi) { long long ans = 0; int m = vi.size(); for (int i = 0; i < m; i++) { if ((1 << i) & mask) { ans += vi[i]; } } return ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> k >> S; vector<long long> v1, v2; for (int i = 0; i < n; i++) { long long x; cin >> x; if (i < n / 2) v1.push_back(x); else v2.push_back(x); } fact.push_back(0ll); for (int i = 1; i <= 19; i++) { fact[i] = fact[i - 1] * i; } for (int mask2 = 0; mask2 < (1 << v2.size()); mask2++) { auto val = getFactVal(mask2, v2); if (val <= S) { for (int mask1 = 0; mask1 < (1 << v2.size()); mask1++) { if (!(mask1 & mask2)) { auto val2 = getVal(mask1, v2); if (val + val2 <= S) { dp[__builtin_popcount(mask2)].push_back(val + val2); } } } } } long long ans = 0; for (int i = 0; i < 25; i++) { if (dp[i].size()) { sort(dp[i].begin(), dp[i].end()); } } for (int mask2 = 0; mask2 < (1 << v1.size()); mask2++) { auto val = getFactVal(mask2, v1); int k1 = __builtin_popcount(mask2); if (val <= S && k1 <= k) { for (int mask1 = 0; mask1 < (1 << v1.size()); mask1++) { if (!(mask1 & mask2)) { auto val2 = getVal(mask1, v1) + val; if (val2 <= S) { for (int i = 0; i <= min(k - k1, 13); i++) { if (dp[i].size()) { ans += upper_bound(dp[i].begin(), dp[i].end(), S - val2) - lower_bound(dp[i].begin(), dp[i].end(), S - val2); } } } } } } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int count = 0; int len = s.size(); bool small = false; for (int i = 0; i < len; i++) { if (s[i] < a ) { count++; } if (s[0] >= a ) { small = true; } } if (count == len || (count == len - 1 && small)) { for (int i = 0; i < len; i++) { if (i == 0 && count == len) { s[i] = s[i] + 32; } else if (i == 0 && small) { s[i] = s[i] - 32; } else { s[i] = s[i] + 32; } } } cout << s << endl; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; int deep[200000 + 10], to[200000 + 10]; int len; string s; stack<int> tmp; int best_deep[200000 + 10]; void dfs(int l, int r, int dep) { deep[l] = dep; if (l == r - 1) { best_deep[l] = dep; return; } int now = l + 1; int MAX_ = 0; while (now < r - 1) { dfs(now, to[now], dep + 1); MAX_ = max(MAX_, best_deep[now]); now = to[now] + 1; } best_deep[l] = MAX_; } int res[200000 + 10]; void recover(int l, int r, int dep) { if (dep - 1 == best_deep[l] >> 1) { for (int i = l; i <= r; ++i) { res[i] = 1; } return; } if (l == r - 1) { return; } int now = l + 1; while (now < r - 1) { recover(now, to[now], dep + 1); now = to[now] + 1; } } int main() { scanf( %d , &len); cin >> s; for (int i = 0; i <= len - 1; ++i) { if (s[i] == ( ) tmp.push(i); else { to[tmp.top()] = i; tmp.pop(); } } int now = 0; while (now < len - 1) { dfs(now, to[now], 1); now = to[now] + 1; } now = 0; while (now < len - 1) { for (int i = now; i <= to[now]; ++i) { best_deep[i] = best_deep[now]; } now = to[now] + 1; } now = 0; while (now < len - 1) { recover(now, to[now], 1); now = to[now] + 1; } for (int i = 0; i <= len - 1; ++i) { printf( %d , res[i]); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int R, x1, y1, x2, y2; scanf( %d%d%d%d%d , &R, &x1, &y1, &x2, &y2); if ((long long)(x2 - x1) * (x2 - x1) + (long long)(y2 - y1) * (y2 - y1) >= (long long)R * R) { printf( %.12f %.12f %.12f n , (double)x1, (double)y1, (double)R); } else if (x1 == x2 && y1 == y2) { printf( %.12f %.12f %.12f n , x1 + R / 2.0, (double)y1, R / 2.0); } else { double L = R + hypot(x2 - x1, y2 - y1); L /= 2; double dx = x1 - x2, dy = y1 - y2, dl = hypot(dx, dy); dx = dx / dl * L + x2; dy = dy / dl * L + y2; printf( %.12f %.12f %.12f n , dx, dy, L); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long i, j, p, l, m, n, c, d, t, k; long long a[int(3e5 + 11)]; string s; long long dp[4][2][int(3e5 + 11)]; int main() { cin >> s; long long n = s.size(); long long pas1 = 0, pas2 = 0; for (int i = 1; i <= n; i++) { if (s[i - 1] == a ) { dp[0][0][i] = dp[1][1][i - 1] + dp[0][1][i - 1]; dp[0][1][i] = dp[1][0][i - 1] + dp[0][0][i - 1] + 1; dp[2][0][i] = dp[2][1][i - 1] + dp[3][1][i - 1]; dp[2][1][i] = dp[2][0][i - 1] + dp[3][0][i - 1]; } else { dp[3][0][i] = dp[2][1][i - 1] + dp[3][1][i - 1]; dp[3][1][i] = dp[2][0][i - 1] + dp[3][0][i - 1] + 1; dp[1][0][i] = dp[1][1][i - 1] + dp[0][1][i - 1]; dp[1][1][i] = dp[1][0][i - 1] + dp[0][0][i - 1]; } pas1 += dp[0][0][i] + dp[3][0][i]; pas2 += dp[0][1][i] + dp[3][1][i]; } cout << pas1 << << pas2; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, k; struct node { int ou, j1, j2, j3; } a[10020]; void setup() { int i, j; int ou = 2, ji = 1; for (i = 1; i <= 10010; i++) { while (ou % 3 == 0) ou += 2; a[i].ou = ou; ou += 2; a[i].j1 = ji; a[i].j2 = ji + 2; a[i].j3 = ji + 4; ji += 6; } } int main() { int i, j; setup(); while (scanf( %d%d , &n, &k) != EOF) { printf( %d n , a[n].j3 * k); for (i = 1; i <= n; i++) printf( %d %d %d %d n , a[i].ou * k, a[i].j1 * k, a[i].j2 * k, a[i].j3 * k); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long inf = 1000000000000000ll; long long b[230400], h[230400], d[230400], ans, t[230400], n, m; struct node { long long c, e; } a[230400]; struct seg { long long l, r, val, z; } s[230400 * 4]; bool cmp(node u, node v) { if (u.c == v.c) return u.e < v.e; return u.c < v.c; } void build(long long p, long long l, long long r) { s[p].l = l; s[p].r = r; if (l == r) { s[p].val = t[l]; s[p].z = 0; return; } long long mid = (l + r) >> 1; build(p << 1, l, mid); build((p << 1) | 1, mid + 1, r); s[p].val = min(s[p << 1].val, s[(p << 1) | 1].val); s[p].z = 0; } void pass(long long p) { s[p].val += s[p].z; if (s[p].l != s[p].r) s[p << 1].z += s[p].z, s[(p << 1) | 1].z += s[p].z; s[p].z = 0; } void update(long long p, long long l, long long r, long long w) { if (s[p].l > r || s[p].r < l) { pass(p); return; } if (s[p].l >= l && s[p].r <= r) { s[p].z += w; pass(p); return; } pass(p); update(p << 1, l, r, w); update((p << 1) | 1, l, r, w); s[p].val = min(s[p << 1].val, s[(p << 1) | 1].val); } long long qry(long long p, long long l, long long r) { pass(p); if (s[p].l > r || s[p].r < l) return inf; if (s[p].l >= l && s[p].r <= r) return s[p].val; return min(qry(p << 1, l, r), qry((p << 1) | 1, l, r)); } int main() { scanf( %d%d , &n, &m); for (long long i = 1; i <= n; i++) scanf( %lld , &b[i]); d[n] = b[n]; for (long long i = n - 1; i; i--) d[i] = max(d[i + 1], b[i]); for (long long i = 1; i <= n; i++) t[i] = t[i - 1] + b[i]; build(1, 1, n); for (long long i = 0; i < m; i++) scanf( %lld , &a[i].e); for (long long i = 0; i < m; i++) scanf( %lld , &a[i].c); sort(a, a + m, cmp); for (long long i = 0; i < m; i++) { if (d[1] < a[i].e) continue; long long lf, rt, mid; lf = 0; rt = n + 1; while (rt - lf > 1) { mid = (lf + rt) >> 1; if (d[mid] < a[i].e) rt = mid; else lf = mid; } if (qry(1, lf, n) >= a[i].c) update(1, lf, n, -a[i].c), ans++; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const int maxN = 1e5 + 9, maxV = 536, MOD = 1e9 + 7, AND = (1 << 20) - 1, lg = 21; vector<int> farg[maxN], adj[maxN], adjc[maxN], elems[maxN]; int incom[maxN], comp[maxN], idx; set<pair<int, int> > mys; stack<int> stc; bool vi[maxN]; void dfs(int nd) { if (vi[nd]) return; vi[nd] = 1; for (int sn : adj[nd]) dfs(sn); stc.push(nd); } void sfd(int nd) { if (vi[nd]) return; vi[nd] = 1; for (int sn : farg[nd]) sfd(sn); comp[nd] = idx; elems[idx].push_back(nd); } bool makeQuery(int a, int b) { cout << ? << a + 1 << << b + 1 << n ; cout.flush(); int ans; cin >> ans; return ans == 1; } void procesavec(vector<int> &one, vector<int> &two) { while (one.size() && two.size()) { if (makeQuery(one.back(), two.back())) { two.pop_back(); } else { one.pop_back(); } } } int n, m; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m; for (int u, v, i = 0; i < m; i++) { cin >> u >> v; u--; v--; adj[u].push_back(v); farg[v].push_back(u); } for (int i = 0; i < n; i++) dfs(i); memset(vi, 0, sizeof vi); while (stc.size()) { while (stc.size() && vi[stc.top()]) stc.pop(); if (stc.empty()) break; sfd(stc.top()); idx++; } for (int i = 0; i < n; i++) { for (int to : adj[i]) { if (comp[to] == comp[i]) continue; incom[comp[to]]++; adjc[comp[i]].push_back(comp[to]); } } for (int i = 0; i < idx; i++) { mys.insert(pair<int, int>(incom[i], i)); } int nd = mys.begin()->second; mys.erase(mys.begin()); while (mys.size() && mys.begin()->first == 0) { int frontup = mys.begin()->second; mys.erase(pair<int, int>(incom[frontup], frontup)); procesavec(elems[nd], elems[frontup]); if (elems[nd].empty()) swap(nd, frontup); for (int cmp : adjc[frontup]) { mys.erase(pair<int, int>(incom[cmp]--, cmp)); mys.insert(pair<int, int>(incom[cmp], cmp)); } } cout << ! << elems[nd].back() + 1 << n ; } |
#include <bits/stdc++.h> using namespace std; int main() { int a[102][102]; int b, c, i, j, n, m; cin >> n >> m; for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) cin >> a[i][j]; b = n; while (b % 2 == 0 && b / 2 != 0) { c = 0; for (i = 1; i <= b / 2; i++) for (j = 1; j <= m; j++) if (a[i][j] != a[b - i + 1][j]) c = 1; if (c == 1) break; b = b / 2; } printf( %d n , b); return 0; } |
#include <bits/stdc++.h> using namespace std; int cnt[200005]; int calc(int t) { int res = 0; for (int i = 1; i <= 200000; i++) { res += cnt[i] / t; } return res; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n, k; cin >> n >> k; for (int i = 0; i < n; i++) { int a; cin >> a; cnt[a]++; } int lf = 1, ri = 200005, mid; while (lf < ri) { mid = (lf + ri) / 2; if (calc(mid) < k) ri = mid; else lf = mid + 1; } if (calc(mid) < k) mid--; int p, tot = 0; while (tot < k) { for (int i = 1; i <= 200000; i++) { if (tot == k) break; p = cnt[i] / mid; for (int j = 0; j < p; j++) { cout << i << ; tot++; if (tot == k) break; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long int n; cin >> n; pair<long long int, long long int> a[n]; for (long long int i = 0; i < n; i++) cin >> a[i].first >> a[i].second; sort(a, a + n); long long int x1 = -1, y1 = -1, x2 = -1, y2 = -1; for (long long int i = 0; i < n; i++) { long long int x = a[i].first, y = a[i].second; if (x > y1) { x1 = x, y1 = y; continue; } if (x > y2) { x2 = x, y2 = y; continue; } return cout << NO , 0; } cout << YES ; } |
#include <bits/stdc++.h> using namespace std; int main() { long long t, s, n, e; cin >> t; for (int i = 0; i < t; i++) { cin >> s >> n >> e; long long l = 0, r = e + 1, m; if (e == 0) { if (s > n) cout << 1 << endl; else cout << 0 << endl; continue; } while (r - l > 1) { m = (r + l) / 2; if (n + m < s + e - m) { l = m; } else r = m; } if (n < s + e) l++; cout << l << endl; } } |
#include <bits/stdc++.h> using namespace std; const int N = 1000000 + 10; inline int read() { int x = 0; bool f = true; char c = getchar(); while (!isdigit(c)) { if (c == - ) f = false; c = getchar(); } while (isdigit(c)) x = (x << 1) + (x << 3) + (c ^ 48), c = getchar(); return f ? x : -x; } int n, c[N], t[N], a[N], b[N]; int main() { n = read(); for (register int i = 1; i <= n; ++i) c[i] = read(); for (register int i = 1; i <= n; ++i) t[i] = read(); for (register int i = 1; i <= n; ++i) a[i] = c[i] - c[i - 1], b[i] = t[i] - t[i - 1]; sort(a + 2, a + n + 1), sort(b + 2, b + n + 1); for (register int i = 1; i <= n; ++i) if (a[i] != b[i]) return puts( No ) & 0; puts( Yes ); return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; int main() { int n; cin >> n; int x[n], y[n], dx[n], dy[n], s[n]; for (int i = 0; i < n; i++) { cin >> x[i] >> y[i] >> dx[i] >> dy[i] >> s[i]; } float ans = -1; int eff_s; float t1, t2; for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { if (dx[i] * dy[j] == dx[j] * dy[i]) { if (dx[i] * (y[j] - y[i]) == dy[i] * (x[j] - x[i])) { eff_s = 0; if (dy[i] * (y[j] - y[i]) > 0) eff_s += s[i]; if (dy[j] * (y[i] - y[j]) > 0) eff_s += s[j]; if (eff_s != 0) { t1 = sqrt((y[j] - y[i]) * (y[j] - y[i]) + (x[j] - x[i]) * (x[j] - x[i])) / eff_s; if (ans == -1 || ans > t1) { ans = t1; } } } } else { t1 = (sqrt(dx[i] * dx[i] + dy[i] * dy[i]) * (dy[j] * (x[j] - x[i]) - dx[j] * (y[j] - y[i]))) / (s[i] * (dx[i] * dy[j] - dx[j] * dy[i])); t2 = (sqrt(dx[j] * dx[j] + dy[j] * dy[j]) * (dy[i] * (x[i] - x[j]) - dx[i] * (y[i] - y[j]))) / (s[j] * (dx[j] * dy[i] - dx[i] * dy[j])); if (t1 >= 0 && t2 >= 0 && (ans == -1 || ans > max(t1, t2))) { ans = max(t1, t2); } } } } if (ans == -1) cout << No show :( ; else cout << setprecision(14) << ans; return 0; } |
#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; namespace Xrocks {} using namespace Xrocks; namespace Xrocks { class in { } user_input; class out { } output; in& operator>>(in& X, int& Y) { scanf( %d , &Y); return X; } in& operator>>(in& X, char* Y) { scanf( %s , Y); return X; } in& operator>>(in& X, float& Y) { scanf( %f , &Y); return X; } in& operator>>(in& X, double& Y) { scanf( %lf , &Y); return X; } in& operator>>(in& X, char& C) { scanf( %c , &C); return X; } in& operator>>(in& X, string& Y) { cin >> Y; return X; } in& operator>>(in& X, long long& Y) { scanf( %lld , &Y); return X; } template <typename T> in& operator>>(in& X, vector<T>& Y) { for (auto& x : Y) user_input >> x; return X; } template <typename T> out& operator<<(out& X, const T& Y) { cout << Y; return X; } template <typename T> out& operator<<(out& X, vector<T>& Y) { for (auto& x : Y) output << x << ; return X; } out& operator<<(out& X, const int& Y) { printf( %d , Y); return X; } out& operator<<(out& X, const char& C) { printf( %c , C); return X; } out& operator<<(out& X, const string& Y) { printf( %s , Y.c_str()); return X; } out& operator<<(out& X, const long long& Y) { printf( %lld , Y); return X; } out& operator<<(out& X, const float& Y) { printf( %f , Y); return X; } out& operator<<(out& X, const double& Y) { printf( %lf , Y); return X; } out& operator<<(out& X, const char Y[]) { printf( %s , Y); return X; } template <typename T> T max(T A) { return A; } template <typename T, typename... args> T max(T A, T B, args... S) { return max(A > B ? A : B, S...); } template <typename T> T min(T A) { return A; } template <typename T, typename... args> T min(T A, T B, args... S) { return min(A < B ? A : B, S...); } template <typename T> void vectorize(int y, vector<T>& A) { A.resize(y); } template <typename T, typename... args> void vectorize(int y, vector<T>& A, args&&... S) { A.resize(y); vectorize(y, S...); } long long fast(long long a, long long b, long long pr) { if (b == 0) return 1 % pr; long long ans = 1 % pr; while (b) { if (b & 1) ans = (ans * a) % pr; b >>= 1; a = (a * a) % pr; } return ans; } int readInt() { int n = 0; int ch = getchar_unlocked(); int sign = 1; while (ch < 0 || ch > 9 ) { if (ch == - ) sign = -1; ch = getchar_unlocked(); } while (ch >= 0 && ch <= 9 ) n = (n << 3) + (n << 1) + ch - 0 , ch = getchar_unlocked(); n = n * sign; return n; } long long readLong() { long long n = 0; int ch = getchar_unlocked(); int sign = 1; while (ch < 0 || ch > 9 ) { if (ch == - ) sign = -1; ch = getchar_unlocked(); } while (ch >= 0 && ch <= 9 ) n = (n << 3) + (n << 1) + ch - 0 , ch = getchar_unlocked(); n = n * sign; return n; } long long readBin() { long long n = 0; int ch = getchar_unlocked(); int sign = 1; while (ch < 0 || ch > 1 ) { if (ch == - ) sign = -1; ch = getchar_unlocked(); } while (ch >= 0 && ch <= 1 ) n = (n << 1) + (ch - 0 ), ch = getchar_unlocked(); return n; } long long inv_(long long val, long long pr = static_cast<long long>(998244353)) { return fast(val, pr - 2, pr); } } // namespace Xrocks class solve { public: solve() { int n, m, k; user_input >> n >> m >> k; vector<pair<int, int> > Edges(m); vector<int> Ans(m); vector<int> degree(n); vector<vector<pair<int, int> > > adj(n); set<pair<int, int> > Good_set; vector<int> in_good_set(n, true); for (int i = 0; i < m; i++) { user_input >> Edges[i].first >> Edges[i].second; Edges[i].first--; Edges[i].second--; adj[Edges[i].first].push_back({Edges[i].second, i}); adj[Edges[i].second].push_back({Edges[i].first, i}); degree[Edges[i].first]++; degree[Edges[i].second]++; } for (int i = 0; i < n; i++) { Good_set.insert({degree[i], i}); } while (!Good_set.empty() && Good_set.begin()->first < k) { int node = Good_set.begin()->second; for (auto& y : adj[node]) { int x = y.first; if (in_good_set[x]) { Good_set.erase({degree[x], x}); --degree[x]; Good_set.insert({degree[x], x}); } } Good_set.erase({degree[node], node}); in_good_set[node] = false; } for (int i = m - 1; i >= 0; i--) { Ans[i] = Good_set.size(); int u = Edges[i].first, v = Edges[i].second; if (in_good_set[u] && in_good_set[v]) { Good_set.erase({degree[u], u}); --degree[u]; Good_set.insert({degree[u], u}); Good_set.erase({degree[v], v}); --degree[v]; Good_set.insert({degree[v], v}); while (!Good_set.empty() && Good_set.begin()->first < k) { int node = Good_set.begin()->second; for (auto& y : adj[node]) { int x = y.first; if (y.second >= i) continue; if (in_good_set[x]) { Good_set.erase({degree[x], x}); --degree[x]; Good_set.insert({degree[x], x}); } } Good_set.erase({degree[node], node}); in_good_set[node] = false; } } } for (int i = 0; i < m; i++) { output << Ans[i] << n ; } } }; int32_t main() { int t = 1, i = 1; if (0 || 0) scanf( %d , &t); while (t--) { if (0) printf( Case #%d: , i++); new solve; } output << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; void Solved() { int n; cin >> n; int one = 0; int two = 0; vector<int> ans; long long sum = 0; for (int i = 1; i <= n; i++) { int te; cin >> te; if (te % 2 == 0) { two++; } else { one++; } } if (two > 0) { sum += 2; ans.push_back(2); two--; } while (1) { if (two == 0 && one == 0) { break; } if (sum % 2 == 0) { if (one > 0) { ans.push_back(1); sum += 1; one--; } else { ans.push_back(2); sum += 2; two--; } } else { if (two > 0) { ans.push_back(2); sum += 2; two--; } else { ans.push_back(1); one--; sum += 1; } } } for (int i = 0; i < ans.size(); i++) { cout << ans[i] << ; } cout << endl; } int main() { Solved(); return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; #pragma GCC optimize( O3 ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { for (ll i = 0; i < v.size(); ++i) os << v[i] << ; return os; } template <typename T> ostream& operator<<(ostream& os, const set<T>& v) { for (auto it : v) os << it << ; return os; } template <typename T, typename S> ostream& operator<<(ostream& os, const pair<T, S>& v) { os << v.first << << v.second; return os; } const ll mod = 1e9 + 7; const ll inf = 2e18; const ll ninf = -2e18; ll takemod(ll a) { return ((a % mod) + mod) % mod; } ll pow(ll a, ll b, ll m) { ll ans = 1; a %= m; while (b) { if (b & 1) ans = (ans * a) % m; b /= 2; a = (a * a) % m; } return ans; } ll modinv(ll a) { return takemod(pow(takemod(a), mod - 2, mod)); } void solve() { ll n; cin >> n; string s1, s2; cin >> s1 >> s2; ll arr[26][26]; memset(arr, 0, sizeof(arr)); for (ll i = 0; i < n; i++) { ll a = s1[i] - a ; ll b = s2[i] - a ; if (a == b) continue; if (a > b) { cout << -1 << n ; return; } arr[a][b]++; } ll ans = 0; for (ll i = 0; i <= 20; i++) { for (ll j = i + 1; j <= 20; j++) { if (!arr[i][j]) continue; for (ll k = j + 1; k <= 20; k++) { if (arr[i][k]) { arr[j][k] += arr[i][k]; arr[i][k] = 0; } } ans++; } } cout << ans << n ; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); time_t t1, t2; t1 = clock(); ll t; cin >> t; while (t--) solve(); t2 = clock(); cerr << n << t2 - t1 << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> string i2s(T x) { ostringstream o; o << x; return o.str(); } template <class T> vector<T> split(const string& s) { vector<T> v; istringstream is(s); T t; while (is >> t) v.push_back(t); return v; } vector<string> splitStr(const string& s, const string& d = , bool keepEmpty = false) { if (d.empty()) return split<string>(s); vector<string> v; string t; for (int _n = ((int((s).size()))), i = 0; i < _n; ++i) if (d.find(s[i]) != string::npos) { if (keepEmpty || !t.empty()) { v.push_back(t); t = ; } } else t += s[i]; if (!t.empty()) v.push_back(t); return v; } int main() { std::ios::sync_with_stdio(false); int N, M; string s; cin >> N >> M; vector<string> v(N); for (int _n = (N), i = 0; i < _n; ++i) { cin >> v[i]; } int mini = 1000, maxi = 0, minj = 1000, maxj = 0; for (int _n = (N), i = 0; i < _n; ++i) for (int _n = (M), j = 0; j < _n; ++j) if (v[i][j] == X ) { mini = min(i, mini); minj = min(j, minj); maxi = max(i, maxi); maxj = max(j, maxj); } bool poss = true; for (int i = (mini); i <= (maxi); ++i) for (int j = (minj); j <= (maxj); ++j) if (v[i][j] != X ) { poss = false; break; } string ans = (poss ? YES : NO ); cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; int a[n]; long long int sum = 0; for (int i = 0; i < n; i++) { cin >> a[i]; sum += 1ll * a[i]; } long long int m = ceil(sum / 2); long long int temp = 0; for (int i = 0; i < n; i++) { temp += 1ll * a[i]; if (2 * temp >= sum) { cout << i + 1 << n ; break; } } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename TYPE> inline TYPE sqr(const TYPE& a) { return a * a; } const long double EPS = 1e-9; const long double PI = 2 * acos(0.0); const int N = 300010; int a[N]; int main() { int n; scanf( %d , &n); long long s = 0; for (int i = 0; i < n; ++i) { scanf( %d , &a[i]); s += a[i]; } sort(a, a + n); long long ans = s; for (int i = 0; i + 1 < n; ++i) { ans += s; s -= a[i]; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; inline int read(); const int M = 200016, MOD = 1000000007; int sz; int ch[M][26], len[M], link[M], pre[M]; void extend(const char *s) { for (int i = 0, lst = 0; s[i]; ++i) { int c = s[i] - a , cur = ++sz; len[cur] = len[lst] + 1; int p = lst; while (!ch[p][c]) ch[p][c] = cur, p = link[p]; if (ch[p][c] != cur) { int q = ch[p][c]; if (len[p] + 1 == len[q]) link[cur] = q; else { int clone = ++sz; memcpy(ch[clone], ch[q], sizeof(ch[q])); link[clone] = link[q]; len[clone] = len[p] + 1; while (ch[p][c] == q) ch[p][c] = clone, p = link[p]; link[q] = link[cur] = clone; } } lst = cur; pre[cur] = i + 1; } } pair<int, int> qrys[M * 2 * 26]; int qcnt; int qans[M * 2 * 26]; vector<int> sons[M]; vector<int> qry[M]; set<int> st[M]; int tar[M]; void merge(int a, int b) { if (st[tar[a]].size() < st[tar[b]].size()) swap(a, b); for (auto x : st[tar[b]]) st[tar[a]].insert(x); st[tar[b]].clear(); tar[b] = tar[a]; } void solve(int u) { for (auto v : sons[u]) solve(v), merge(u, v); for (auto qid : qry[u]) { int l = qrys[qid].first, r = qrys[qid].second; auto it = st[tar[u]].lower_bound(l); if (it != st[tar[u]].end() && *it <= r) qans[qid] = 1; } } char tex[M], pat[M * 2]; int lef[M], rig[M], pid[M], pln[M], pcnt; int solved[M]; void foreach_query(int ftq, int id, int now, int tag) { if (pat[id] && ch[now][pat[id] - a ]) foreach_query(ftq, id + 1, ch[now][pat[id] - a ], tag); for (int c = pat[id] ? pat[id] + 1 : a ; c <= z ; ++c) { int tmp = ch[now][c - a ]; if (tmp && rig[ftq] - lef[ftq] >= id - pid[ftq]) { ++qcnt; if (tag == 0) { qrys[qcnt] = {lef[ftq] + id - pid[ftq], rig[ftq]}; qry[tmp].push_back(qcnt); } else if (qans[qcnt] == 1 && !solved[ftq]) { solved[ftq] = 1; for (int xj = pid[ftq]; xj < id; ++xj) putchar(pat[xj]); putchar(c); printf( n ); } } } } int main(void) { scanf( %s , tex); extend(tex); for (int i = 1; i <= sz; ++i) sons[link[i]].push_back(i); for (int i = 0; i <= sz; ++i) { tar[i] = i; if (pre[i]) st[i].insert(pre[i]); } int q = read(); for (int i = 1; i <= q; ++i) { lef[i] = read(), rig[i] = read(), pid[i] = pcnt; scanf( %s , pat + pid[i]); pln[i] = strlen(pat + pid[i]); pcnt += pln[i] + 1; foreach_query(i, pid[i], 0, 0); } solve(0); qcnt = 0; for (int i = 1; i <= q; ++i) { foreach_query(i, pid[i], 0, 1); if (!solved[i]) printf( -1 n ); } return 0; } inline int read() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; int arr[n]; for (int i = 0; i < n; ++i) { cin >> arr[i]; } for (int i = 0; i < n; i++) { for (int j = 0; j < n; ++j) { if (j == i) continue; for (int k = 0; k < n; ++k) { if (j == k) continue; else if (i == k) continue; if (arr[j] + arr[k] == arr[i]) { cout << i + 1 << << k + 1 << << j + 1; return 0; } } } } cout << -1; return 0; } |
#include <bits/stdc++.h> using namespace std; inline int lowbit(int x) { return x & -x; } int read() { int kkk = 0, x = 1; char c = getchar(); while ((c < 0 || c > 9 ) && c != - ) c = getchar(); if (c == - ) c = getchar(), x = -1; while (c >= 0 && c <= 9 ) kkk = kkk * 10 + (c - 0 ), c = getchar(); return kkk * x; } int n, K, p, minn[101], dp[500001], tree[110], DP[10001][101], a[500001]; inline int MOD(int x) { return x + ((x >> 31) & p); } void sbsolve() { memset(DP, 0x3f, sizeof(DP)); DP[0][0] = 0; for (int j = 1; j <= K; ++j) { memset(minn, 0x3f, sizeof(minn)); for (int i = j - 1; i <= n; ++i) { for (int k = 0; k < p; ++k) DP[i][j] = min(DP[i][j], minn[k] + MOD(a[i] - k)); minn[a[i]] = min(minn[a[i]], DP[i][j - 1]); } } printf( %d n , DP[n][K]); } void xg(int zone, int v) { while (zone <= p) { tree[zone] = max(tree[zone], v); zone += lowbit(zone); } } int cx(int zone) { int bck = 0; while (zone) { bck = max(tree[zone], bck); zone -= lowbit(zone); } return bck; } int main() { n = read(), K = read(), p = read(); for (int i = 1; i <= n; ++i) a[i] = MOD(a[i - 1] + read() % p - p); if (n < K * p) { sbsolve(); return 0; } int ans = a[n]; for (int i = 1; i <= n; ++i) a[i] += 1; dp[1] = 1; xg(a[1], dp[1]); for (int i = 2; i <= n; ++i) { dp[i] = cx(a[i]) + 1; xg(a[i], dp[i]); } if (dp[n] >= K) printf( %d n , ans); else printf( %d n , ans + p); return 0; } |
#include <bits/stdc++.h> using namespace std; const int max_n = 1000, max_k = 100; int dp[max_n][max_k]; int p[max_n + 5]; int main() { int n, k, mod; cin >> n >> k >> mod; p[0] = 10 % k; for (int i = 0; i < n; i++) p[i + 1] = p[i] * 10 % k; memset(dp, 0, sizeof dp); for (int dig = 1; dig < 10; dig++) dp[0][dig % k] = (1 + dp[0][dig % k]) % mod; for (int i = 0; i < n - 1; i++) for (int dig = (i + 1 == n - 1); dig < 10; dig++) { if (dig) { int newr = dig * p[i] % k; dp[i + 1][newr] = (1 + dp[i + 1][newr]) % mod; } for (int r = 0; r < k; r++) { int newr = r ? (dig * p[i] + r) % k : 0; dp[i + 1][newr] = (dp[i][r] + dp[i + 1][newr]) % mod; } } cout << dp[n - 1][0] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; const ll INF = 4e18; const int N = 5e5 + 1; vector<int> vec; vector<pair<int, ll> > g[N]; int n, op, t, l, r, q, s, pos[N][2]; void construct(int node = 1, int b = 1, int e = n) { pos[node][op] = ++t; if (b == e) { if (op == 0) g[pos[node][0]].push_back({b, 0}); else g[b].push_back({pos[node][1], 0}); return; } int m = (b + e) >> 1; construct(node << 1, b, m); construct(node << 1 | 1, m + 1, e); if (op == 0) { g[pos[node][0]].push_back({pos[node << 1][0], 0}); g[pos[node][0]].push_back({pos[node << 1 | 1][0], 0}); } else { g[pos[node << 1][1]].push_back({pos[node][1], 0}); g[pos[node << 1 | 1][1]].push_back({pos[node][1], 0}); } } void query(int node = 1, int b = 1, int e = n) { if (b > e || b > r || e < l) return; if (l <= b && e <= r) { vec.push_back(pos[node][op]); return; } int m = (b + e) >> 1; query(node << 1, b, m); query(node << 1 | 1, m + 1, e); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> q >> s; t = n; op = 0; construct(); op = 1; construct(); while (q--) { cin >> op; if (op == 1) { int v, u, w; cin >> v >> u >> w; g[v].push_back({u, w}); } else { op -= 2; int v, w; cin >> v >> l >> r >> w; query(); if (op == 0) { for (int x : vec) { g[v].push_back({x, w}); } } else { for (int x : vec) { g[x].push_back({v, w}); } } vec.clear(); } } priority_queue<pair<ll, int> > pq; pq.push({0, s}); vector<ll> dis(N, INF); dis[s] = 0; for (int i = 1; i <= n; i += 1) { pq.push({-dis[i], i}); } while (!pq.empty()) { int u = pq.top().second; pq.pop(); for (auto x : g[u]) { int v = x.first; int cost = x.second; if (dis[v] > dis[u] + cost) { dis[v] = dis[u] + cost; pq.push({-dis[v], v}); } } } for (int i = 1; i <= n; i += 1) { if (dis[i] >= INF) dis[i] = -1; cout << dis[i] << ; } cout << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<long long> primes; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int n, q; cin >> n >> q; vector<pair<int, int> > ans; int tmp(-1); vector<bool> state; for (int i = 0; i < n; ++i) { int x; cin >> x; if (tmp <= x) { if (!i) tmp = x; else { ans.push_back(make_pair(tmp, x)); tmp = x; state.push_back(true); } } else { ans.push_back(make_pair(x, tmp)); state.push_back(false); } } int nw = n - 1; while (q--) { long long y; cin >> y; if (!y) cout << n ; else { if (y < n) { if (state[y - 1]) cout << ans[y - 1].first << << ans[y - 1].second << n ; else cout << ans[y - 1].second << << ans[y - 1].first << n ; } else { y -= n; if (!y) cout << tmp << << ans[0].first << n ; else cout << tmp << << ans[y % nw].first << n ; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; int powP[2001] = {1}; int invPowP[2001] = {1}; int hashW[2001] = {0}; vector<pair<int, int> > hashTable[100003]; void findPos(string& w, string& subW, vector<int>& posSubW) { unsigned int j = 0, k = subW.size(); for (unsigned int i = 0; (i + k) <= w.size(); i++) { while (j < subW.size() && w[i] == subW[j]) { i++; j++; } if (j == subW.size()) posSubW.push_back(i - j + 1); if (j > 0) { i -= j; j = 0; } } } void fillHash(string& w) { for (unsigned int i = 0; i < w.size(); i++) hashW[i + 1] = (hashW[i] + (((long long)w[i] - 96) * (long long)powP[i]) % 100003) % 100003; } int myMod(int a, int m) { if (a >= 0) return a % m; return m * ((-a / m) + 1) + a; } int getHash(int i, int j) { int hashVal = myMod(hashW[j] - hashW[i - 1], 100003), inverse = invPowP[i - 1]; return ((long long)hashVal * (long long)inverse) % (long long)100003; ; } inline int modPow(long long a, int b, int m) { long long ans = 1; while (b > 0) { if (b & 1) ans = (ans * a) % m; a = (a * a) % m; b >>= 1; } return ans; } int getInverse(int a, int m) { return modPow(a, m - 2, m); } bool cmpHash(unsigned int wSize, pair<int, int>& a, pair<int, int> b) { unsigned int i = 0, j = wSize, mid; while (i < j) { mid = (i + j) / 2; if (getHash(a.first, a.first + mid) != getHash(b.first, b.first + mid)) return false; else i = mid + 1; } return true; } int main() { vector<int> posS, posE; string w, s, e; for (unsigned int i = 1; i < 2001; i++) powP[i] = (((long long)powP[i - 1] * (long long)37)) % (long long)100003; for (unsigned int i = 1; i < 2001; i++) invPowP[i] = getInverse(powP[i], 100003); cin >> w >> s >> e; findPos(w, s, posS); findPos(w, e, posE); fillHash(w); int cont = 0, hashVal; bool found = false; for (unsigned int i = 0; i < posS.size(); i++) for (unsigned int j = 0; j < posE.size(); j++) { if (posS[i] <= posE[j] && (posS[i] + s.size() - 1) <= (posE[j] + e.size() - 1)) { found = 0; hashVal = getHash(posS[i], posE[j] + e.size() - 1); for (unsigned int k = 0; k < hashTable[hashVal].size(); k++) { if ((hashTable[hashVal][k].second - hashTable[hashVal][k].first) == (posE[j] - posS[i])) { if (cmpHash(1 + posE[j] - posS[i], hashTable[hashVal][k], make_pair(posS[i], posE[j]))) { found = true; break; } } } if (!found) { cont++; hashTable[hashVal].push_back(make_pair(posS[i], posE[j])); } } } cout << cont << endl; return 0; } |
#include <bits/stdc++.h> const long long mod = 1e8; using namespace std; bool in(int x, int l, int r) { return l <= x && x <= r; } void solve() { long long l, r; cin >> l >> r; vector<long long> v; long long p = -1; for (int i = 61; i >= 0; i--) { unsigned long long mask = 1ull << i; if (mask & r) { v.push_back(i); if (mask & l) { continue; } else { p = i; break; } } } long long ans = 0; if (v.size() == 0) { cout << l << n ; return; } int q = 0; for (int i = p - 1; i >= 0; i--) { unsigned long long mak = 1ull << i; if (mak & r) q++; } if (q == p) { cout << r << n ; return; } for (int i = 0; i < v.size(); i++) { if (v[i] != p) ans += pow(2, v[i]); } for (int i = p - 1; i >= 0; i--) ans += pow(2, i); cout << ans << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void read(T &x) { x = 0; bool f = 0; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) f = 1; for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48); if (f) x = -x; } template <typename T> inline void Mx(T &x, T y) { x < y && (x = y); } template <typename T> inline void Mn(T &x, T y) { x > y && (x = y); } long long T, n, l, r; int main() { read(T); while (T--) { read(n), read(l), read(r); if (n == 2) { } long long sum = 0, pre = 0; for (int i = 1; i < n; i++) { sum += (n - i) * 2; if (l < sum) { long long t = l - pre; long long x = (t & 1) ? i : (t / 2) + i, y = (t / 2) + i; while (l < sum && l <= r) { printf( %lld , x); x == i ? y++, x = y : x = i; l++; } } if (l == sum && l <= r) printf( %lld , n), l++; pre = sum; if (l > r) break; } if (l <= r) printf( 1 ); puts( ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int maxn = 100; int b, d, lenA, lenC; string a, c; int dp[maxn + 10], nex[maxn + 10]; void cope(int x) { dp[x] = 0; nex[x] = x; int use = 0; while (use < lenA) { if (a[use] == c[nex[x]]) { if (++nex[x] == lenC) { dp[x]++; nex[x] = 0; } } use++; } } int main() { std::ios::sync_with_stdio(false); while (cin >> b >> d) { cin >> a >> c; lenA = a.length(), lenC = c.length(); for (int(i) = 0; (i) < (lenC); (i)++) cope(i); int x = 0, num = 0; for (int(i) = 0; (i) < (b); (i)++) { num += dp[x]; x = nex[x]; } num /= d; cout << num << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, m, i, j, k, ct; bool swapped = false; cin >> n >> m; if (n < m) { swap(n, m); swapped = true; } vector<vector<int>> ans(n, vector<int>(m, -1)); ct = 0; if (m == 1) { for (i = 1; i < n; i += 2) ans[i][0] = ++ct; for (i = 0; i < n; i += 2) ans[i][0] = ++ct; } else { for (i = 0; i < n; i++) { for (j = i % 2; j < m; j += 2) ans[i][j] = ++ct; } for (i = 0; i < n; i++) { for (j = 1 - (i % 2); j < m; j += 2) ans[i][j] = ++ct; } } bool solved = true; for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { if ((i < n - 1) && (abs(ans[i][j] - ans[i + 1][j]) == 1)) solved = false; if ((j < m - 1) && (abs(ans[i][j] - ans[i][j + 1]) == 1)) solved = false; } } if (!solved) cout << -1 n ; else { if (!swapped) { for (i = 0; i < n; i++) { for (j = 0; j < m; j++) cout << ans[i][j] << ; cout << n ; } } else { for (j = 0; j < m; j++) { for (i = 0; i < n; i++) cout << ans[i][j] << ; cout << n ; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t = 1; while (t--) { unsigned long long int a, b, c, d; cin >> a >> b >> c >> d; unordered_map<unsigned long long int, unsigned long long int> mp, mp1; for (int i = 0; i <= 100000; i++) { ++mp[b + (i * a)]; ++mp1[d + (i * c)]; } for (int i = 0; i <= 100000; i++) { if (mp[i] && mp1[i]) { cout << i; return 0; } } cout << -1; } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, x, y; cin >> n >> x >> y; int people = n - x; int wizards = x; people *= 100; wizards *= 100; int needed = max(0, n * y - wizards); cout << (needed + 99) / 100 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int a[400500], b[400500], n, tot; long long read() { long long x = 0, f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = -1; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } int main() { n = read(); tot = 0; for (int i = 1; i <= n; i++) { int x = read(); if (x) a[++tot] = x; } tot = 0; for (int i = 1; i <= n; i++) { int x = read(); if (x) b[++tot] = x; } for (int i = n; i <= 2 * n - 2; i++) b[i] = b[i - (n - 1)]; n--; int loc = 0; for (int i = 1; i <= n; i++) if (a[1] == b[i]) loc = i; int flag = 0; for (int i = loc, j = 1; j <= n; i++, j++) if (b[i] != a[j]) { flag = 1; break; } if (!flag) puts( YES ); else puts( NO ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<string> v; vector<int> vn; for (int i = 0; i < n; i++) { string a; cin >> a; bool cn = false; int y = 0; for (int j = 0; j < v.size(); j++) { if (a == v[j]) { y = j; cn = true; break; } } if (cn) { vn[y]++; } else { v.push_back(a); vn.push_back(1); } } int rpta = vn[0]; for (int i = 1; i < vn.size(); i++) { rpta = max(rpta, vn[i]); } cout << rpta << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; bool vowel(char c) { return (c == a || c == e || c == o || c == i || c == u ); } int cvowel(string& s) { int n = 0; for (char& c : s) { n += vowel(c); } return n; } int getlast(string& s) { for (int i = s.size() - 1;; i--) { if (vowel(s[i])) { return s[i]; } } } const int KEK = 1000001; vector<string> ss[KEK]; vector<pair<char, int>> vv[KEK]; int main() { ios::sync_with_stdio(0); int n; cin >> n; for (int i = 0; i < n; i++) { string s; cin >> s; int cnt = cvowel(s); ss[cnt].push_back(s); vv[cnt].push_back(make_pair(getlast(s), ss[cnt].size() - 1)); } vector<pair<string, string>> q1, q2; for (int i = 1; i < KEK; i++) { sort(vv[i].begin(), vv[i].end()); int m = vv[i].size(); vector<bool> inpair(m, false); for (int j = 1; j < m; j++) { if (vv[i][j - 1].first == vv[i][j].first) { inpair[j - 1] = inpair[j] = true; q2.push_back( make_pair(ss[i][vv[i][j - 1].second], ss[i][vv[i][j].second])); j++; } } int last = -1; for (int j = 0; j < m; j++) { if (inpair[j] == false) { if (last == -1) { last = j; } else { q1.push_back( make_pair(ss[i][vv[i][last].second], ss[i][vv[i][j].second])); last = -1; } } } } while (q2.size() > q1.size()) { q1.push_back(q2.back()); q2.pop_back(); } while (q1.size() > q2.size()) { q1.pop_back(); } cout << q1.size() << endl; for (int i = 0; i < q1.size(); i++) { cout << q1[i].first << << q2[i].first << n ; cout << q1[i].second << << q2[i].second << n ; } } |
#include <bits/stdc++.h> using namespace std; int n, c, a[2], r = 0; int main() { cin >> n >> c >> a[0]; for (int i = 1; i < n; i++) cin >> a[i % 2], r = max(r, a[i % 2 ^ 1] - a[i % 2] - c); cout << r; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> tab(n); for (int i = 0; i < n; i++) cin >> tab[i]; for (int i = 0; i < n; i++) { if (tab[i] % 2 == 0) continue; else { if (i == (n - 1) || tab[i + 1] == 0) { cout << NO ; return 0; } else tab[i + 1] -= 1; } } cout << YES ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, m, a, b, x, cnt, ans; deque<long long> V; map<long long, long long> mp; long long arr[1000001]; int main() { cin >> n >> a >> b; for (int i = 1; i <= n; i++) { cin >> arr[i]; } sort(arr + 1, arr + n + 1); ans = (n - a) + 1; x = arr[ans] - arr[b]; cout << x << endl; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1000000000; const int MAXN = 200001; int c[MAXN * 3 + 10]; int n; char s[MAXN + 10]; int sum[MAXN + 10]; int lowbit(int x) { return x & (-x); } void update(int pos, int delta) { while (pos <= n) { c[pos] = min(c[pos], delta); pos += lowbit(pos); } } int query(int end) { int res = INF; while (end > 0) { res = min(res, c[end]); end -= lowbit(end); } return res; } bool isvowel(char x) { if (x == a || x == e || x == i || x == o || x == u ) return true; if (x == A || x == E || x == I || x == O || x == U ) return true; return false; } int main() { scanf( %s , s); int len = strlen(s); n = 3 * len + 1; for (int i = 0; i <= n; i++) { c[i] = INF; } memset(sum, 0, sizeof(sum)); for (int i = 0; i < len; i++) { sum[i + 1] = sum[i] + (isvowel(s[i]) ? -1 : 2); } int ret = -1; update(sum[0] + len + 1, 0); for (int i = 1; i <= len; i++) { int p = query(sum[i] + len + 1); if (p != INF && i - p > ret) { ret = i - p; } update(sum[i] + len + 1, i); } if (ret == -1) { printf( No solution n ); } else { int count = 0; for (int i = 0; i <= len; i++) { if (i + ret > len) break; if (sum[i + ret] - sum[i] >= 0) { count++; } } printf( %d %d n , ret, count); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, n1, n2, limiter = 1, fight = 0, temp; cin >> n >> n1; queue<int> p1, p2; for (int i = 1; i <= n1; i++) { cin >> temp; p1.push(temp); limiter *= i; } cin >> n2; for (int i = 1; i <= n2; i++) { cin >> temp; p2.push(temp); limiter *= (n1 + i); } limiter *= (n + 1); while (1) { if (fight > limiter) { cout << -1; break; } else if (p1.empty()) { cout << fight << << 2; break; } else if (p2.empty()) { cout << fight << << 1; break; } else { if (p1.front() > p2.front()) { p1.push(p2.front()); p1.push(p1.front()); p1.pop(); p2.pop(); fight++; } else { p2.push(p1.front()); p2.push(p2.front()); p2.pop(); p1.pop(); fight++; } } } } |
#include <bits/stdc++.h> using namespace std; const int max_n = 200002, inf = 1111111111; const int max_p = 500005; int n, q, a[max_n], z[max_p], cnt[max_p], used[max_n]; long long ans; int get_cnt(int x) { int res = 0; for (int i = 1; i * i <= x; ++i) { if (x % i == 0) { int d = i; res += cnt[d] * z[d]; d = x / i; if (i < d) { res += cnt[d] * z[d]; } } } return res; } void add(int x, int f) { for (int i = 1; i * i <= x; ++i) { if (x % i == 0) { int d = i; cnt[d] += f; d = x / i; if (i < d) { cnt[d] += f; } } } } int main() { for (int i = 2; i < max_p; ++i) { int x = i; for (int j = 2; j * j <= x; ++j) { if (x % j == 0) { x /= j; ++z[i]; if (x % j == 0) { z[i] = 0; x = 0; break; } } } if (x == 0) { continue; } if (x > 1) { ++z[i]; } if (z[i] % 2 == 1) { z[i] = 1; } else { z[i] = -1; } } scanf( %d%d , &n, &q); for (int i = 0; i < n; ++i) { scanf( %d , &a[i]); } int sz = 0; while (q--) { int x; scanf( %d , &x); --x; int res; if (used[x]) { add(a[x], -1); used[x] = 0; --sz; ans -= (sz - get_cnt(a[x])); } else { used[x] = 1; ans += sz - get_cnt(a[x]); add(a[x], 1); ++sz; } printf( %I64d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; void aent(long long int *a, long long int n) { for (long long int i = 0; i < n; i++) cin >> a[i]; } string arrtostr(long long int *a, long long int n) { ostringstream os; for (long long int i = 0; i < n; i++) os << a[i]; string str(os.str()); return str; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ; long long int n; cin >> n; vector<long long int> v; for (long long int i = 0; i < n; i++) { long long int a; cin >> a; v.push_back(a); } long long int s = 0, e = n - 1; string ss = ; long long int mi = LLONG_MIN; while (s <= e) { if (s == e) { if (mi < v[s]) ss += L ; break; } long long int st = v[s]; long long int ed = v[e]; if (st < mi && ed < mi) break; if (st == ed) { string s1 = L , s2 = R ; int rs = s; if (st < mi) break; int chk = st; while (s + 1 < e) { if (v[s + 1] > chk) { s1 += L ; chk = v[s + 1]; s++; } else break; } chk = ed; while (e - 1 > rs) { if (v[e - 1] > chk) { s2 += R ; chk = v[e - 1]; e--; } else break; } if (s1.size() >= s2.size()) { ss += s1; } else ss += s2; cout << ss.size() << n ; cout << ss; return 0; } if (ed < st) { if (ed > mi) { ss += R ; e--; mi = ed; } else { if (st > mi) { ss += L ; s++; mi = st; } else break; } } else { if (st > mi) { ss += L ; s++; mi = st; } else { if (ed > mi) { ss += R ; e--; mi = ed; } else break; } } } cout << ss.size() << n ; cout << ss; } |
#include <bits/stdc++.h> using namespace std; inline char read() { static const int IN_LEN = 1000000; static char buf[IN_LEN], *s, *t; return (s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin), (s == t ? -1 : *s++) : *s++); } template <class T> inline void read(T &x) { static bool iosig; static char c; for (iosig = false, c = read(); !isdigit(c); c = read()) { if (c == - ) iosig = true; if (c == -1) return; } for (x = 0; isdigit(c); c = read()) x = ((x + (x << 2)) << 1) + (c ^ 0 ); if (iosig) x = -x; } const int OUT_LEN = 10000000; char obuf[OUT_LEN], *ooh = obuf; inline void print(char c) { if (ooh == obuf + OUT_LEN) fwrite(obuf, 1, OUT_LEN, stdout), ooh = obuf; *ooh++ = c; } template <class T> inline void print(T x) { static int buf[30], cnt; if (x == 0) print( 0 ); else { if (x < 0) print( - ), x = -x; for (cnt = 0; x; x /= 10) buf[++cnt] = x % 10 + 48; while (cnt) print((char)buf[cnt--]); } } inline void print(pair<int, int> x) { print(x.first), print( ), print(x.second), print( n ); } inline void flush() { fwrite(obuf, 1, ooh - obuf, stdout); } const int N = 100005, M = 52; const long long inf = 1e16; int n, m, q, x[N], y[N], xx[N], yy[N], X[N], Y[N], fa[N], fa1[N], f1[N], s[N << 2], f[N][M]; long long T[N], ga[N], g[N][M]; char opt[N], op[N]; vector<int> a[N], b[N], c[N]; void build(int l, int r, int t) { s[t] = 0; if (l == r) return; int mid = (l + r) >> 1, k = t << 1; build(l, mid, k), build(mid + 1, r, k | 1); } void change(int l, int r, int t, int L, int R, int x) { if (L <= l && r <= R) return (void)(s[t] = x); int mid = (l + r) >> 1, k = t << 1; if (s[t]) s[k] = s[k | 1] = s[t], s[t] = 0; if (L <= mid) change(l, mid, k, L, R, x); if (R > mid) change(mid + 1, r, k | 1, L, R, x); } int query(int l, int r, int t, int x) { if (l == r || s[t]) return s[t]; int mid = (l + r) >> 1, k = t << 1; return (x <= mid ? query(l, mid, k, x) : query(mid + 1, r, k | 1, x)); } inline pair<int, int> solve(pair<int, int> x, char o, long long t) { int a = x.first, b = x.second; if (o == L ) a = max(0ll, a - t); if (o == R ) a = min((long long)m, a + t); if (o == D ) b = max(0ll, b - t); if (o == U ) b = min((long long)m, b + t); return make_pair(a, b); } signed main() { read(n), read(m); for (int i = 1; i <= n; ++i) { read(x[i]), read(y[i]), read(xx[i]), read(yy[i]); if (x[i] == xx[i]) a[x[i]].push_back(i), op[i] = (y[i] > yy[i] ? D : U ); else b[x[i]].push_back(i), b[xx[i]].push_back(i), op[i] = (x[i] > xx[i] ? L : R ); } read(q); for (int i = 1; i <= q; ++i) { read(X[i]), read(Y[i]); while (isspace(opt[i] = read())) ; read(T[i]); } for (int i = 1; i <= q; ++i) if (opt[i] == R ) c[X[i]].push_back(i); build(0, m, 1); for (int i = m; ~i; --i) { for (int j : a[i]) change(0, m, 1, min(y[j], yy[j]), max(y[j], yy[j]), j); for (int j : b[i]) if (x[j] > xx[j]) change(0, m, 1, y[j], y[j], j); else f[j][0] = query(0, m, 1, y[j]), g[j][0] = (f1[j] = abs(xx[f[j][0]] - xx[j])) + abs(yy[f[j][0]] - y[j]); for (int j : c[i]) { fa[j] = query(0, m, 1, Y[j]), ga[j] = abs(xx[fa[j]] - X[j]) + abs(yy[fa[j]] - Y[j]); fa1[j] = (x[fa[j]] == xx[fa[j]] ? abs(xx[fa[j]] - X[j]) : max(xx[fa[j]] - X[j], 0)); } } for (int i = 0; i <= m; ++i) c[i].clear(); for (int i = 1; i <= q; ++i) if (opt[i] == L ) c[X[i]].push_back(i); build(0, m, 1); for (int i = 0; i <= m; ++i) { for (int j : a[i]) change(0, m, 1, min(y[j], yy[j]), max(y[j], yy[j]), j); for (int j : b[i]) if (x[j] < xx[j]) change(0, m, 1, y[j], y[j], j); else f[j][0] = query(0, m, 1, y[j]), g[j][0] = (f1[j] = abs(xx[j] - xx[f[j][0]])) + abs(yy[f[j][0]] - y[j]); for (int j : c[i]) { fa[j] = query(0, m, 1, Y[j]), ga[j] = abs(X[j] - xx[fa[j]]) + abs(yy[fa[j]] - Y[j]); fa1[j] = (x[fa[j]] == xx[fa[j]] ? abs(xx[fa[j]] - X[j]) : max(X[j] - xx[fa[j]], 0)); } } for (int i = 0; i <= m; ++i) c[i].clear(), a[i].clear(), b[i].clear(); for (int i = 1; i <= n; ++i) if (y[i] == yy[i]) a[y[i]].push_back(i); else b[y[i]].push_back(i), b[yy[i]].push_back(i); for (int i = 1; i <= q; ++i) if (opt[i] == U ) c[Y[i]].push_back(i); build(0, m, 1); for (int i = m; ~i; --i) { for (int j : a[i]) change(0, m, 1, min(x[j], xx[j]), max(x[j], xx[j]), j); for (int j : b[i]) if (y[j] > yy[j]) change(0, m, 1, x[j], x[j], j); else f[j][0] = query(0, m, 1, x[j]), g[j][0] = (f1[j] = abs(yy[f[j][0]] - yy[j])) + abs(xx[f[j][0]] - x[j]); for (int j : c[i]) { fa[j] = query(0, m, 1, X[j]), ga[j] = (fa1[j] = abs(yy[fa[j]] - Y[j])) + abs(xx[fa[j]] - X[j]); fa1[j] = (x[fa[j]] == xx[fa[j]] ? max(yy[fa[j]] - Y[j], 0) : abs(yy[fa[j]] - Y[j])); } } for (int i = 0; i <= m; ++i) c[i].clear(); for (int i = 1; i <= q; ++i) if (opt[i] == D ) c[Y[i]].push_back(i); build(0, m, 1); for (int i = 0; i <= m; ++i) { for (int j : a[i]) change(0, m, 1, min(x[j], xx[j]), max(x[j], xx[j]), j); for (int j : b[i]) if (y[j] < yy[j]) change(0, m, 1, x[j], x[j], j); else f[j][0] = query(0, m, 1, x[j]), g[j][0] = (f1[j] = abs(yy[j] - yy[f[j][0]])) + abs(xx[f[j][0]] - x[j]); for (int j : c[i]) { fa[j] = query(0, m, 1, X[j]), ga[j] = (fa1[j] = abs(Y[j] - yy[fa[j]])) + abs(xx[fa[j]] - X[j]); fa1[j] = (x[fa[j]] == xx[fa[j]] ? max(Y[j] - yy[fa[j]], 0) : abs(yy[fa[j]] - Y[j])); } } for (int j = 1; j <= 50; ++j) for (int i = 1; i <= n; ++i) f[i][j] = f[f[i][j - 1]][j - 1], g[i][j] = min(inf, g[i][j - 1] + g[f[i][j - 1]][j - 1]); for (int i = 1; i <= q; ++i) { if (!fa[i] || T[i] < fa1[i]) print(solve(make_pair(X[i], Y[i]), opt[i], T[i])); else if (T[i] < ga[i]) print(solve(solve(make_pair(X[i], Y[i]), opt[i], fa1[i]), op[fa[i]], T[i] - fa1[i])); else { T[i] -= ga[i]; int now = fa[i]; for (int j = 50; ~j; --j) if (f[now][j] && g[now][j] <= T[i]) T[i] -= g[now][j], now = f[now][j]; if (!f[now][0] || T[i] < f1[now]) print(solve(make_pair(xx[now], yy[now]), op[now], T[i])); else print(solve(solve(make_pair(xx[now], yy[now]), op[now], f1[now]), op[f[now][0]], T[i] - f1[now])); } } return flush(), 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, i; cin >> n; int a[n]; map<long int, int> mp; for (i = 0; i < n; i++) { cin >> a[i]; mp[a[i]]++; } cout << mp.size() << endl; } } |
#include <bits/stdc++.h> const int N = (int)1e3 + 5; int n; int a[N]; int b[N]; int u[N]; int gcd(int a, int b) { return !b ? a : gcd(b, a % b); } int main() { int ts; scanf( %d , &ts); while (ts--) { for (int i = 0; i < N; ++i) { u[i] = 0; } scanf( %d , &n); for (int i = 0; i < n; ++i) { scanf( %d , &a[i]); } int g = 0; for (int p = 1; p <= n; ++p) { int mx = -1; int ind = -1; for (int i = 0; i < n; ++i) { if (!u[i]) { if (mx < gcd(g, a[i])) { mx = gcd(g, a[i]); ind = i; } } } assert(ind != -1); u[ind] = 1; g = gcd(g, a[ind]); b[p] = a[ind]; } for (int i = 1; i <= n; ++i) { printf( %d , b[i]); } printf( n ); } } |
#include <bits/stdc++.h> using namespace std; void ng() { cout << -1 << n ; } void solve() { int N; cin >> N; map<int, int> M; vector<int> A(N); for (auto &x: A) { cin >> x; M[x]++; } for (auto &[key, val]: M) { if (val > (N + 1) / 2) return ng(); } int l = 0; vector<pair<int, int>> V; for (int i = 0; i < N-1; i++) { if (A[i] == A[i+1]) { V.emplace_back(A[l], A[i]); l = i+1; } } V.emplace_back(A[l], A[N-1]); M.clear(); int sum = V.size(); int sum2 = 0; map<int, int> P; for (auto &[c, d]: V) { if (c == d) P[c]++, sum2++; else M[c]++, M[d]++; } sum -= sum2; for (auto &[key, val]: P) { if (sum - M[key] + 1 + (sum2 - val) < val) { int a = val - (sum - M[key] + 1 + (sum2 - val)); cout << V.size() - 1 + a << n ; return; } } cout << V.size() - 1 << n ; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); int T; cin >> T; while (T--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; int a[100]; int sol[1000000]; void prueba(int ind) { sol[0] = ind; priority_queue<pair<int, int> > q; for (int i = 1; i <= m; i++) { if (ind == i) { if (a[i] > 1) q.push(pair<int, int>(a[i] - 1, i)); } else { q.push(pair<int, int>(a[i], i)); } } for (int i = 1; i < n; i++) { pair<int, int> p = q.top(); q.pop(); if (i < n - 1) { if (p.second != sol[i - 1]) { sol[i] = p.second; p.first--; if (p.first) q.push(p); } else if (int(q.size()) == 0) { return; } else { pair<int, int> pbis = q.top(); q.pop(); sol[i] = pbis.second; pbis.first--; if (pbis.first) q.push(pbis); q.push(p); } } else { if (p.second != sol[i - 1] and p.second != sol[0]) { sol[i] = p.second; p.first--; if (p.first) q.push(p); } else if (int(q.size()) == 0) { return; } else { pair<int, int> pbis = q.top(); q.pop(); if (pbis.second != sol[i - 1] and pbis.second != sol[0]) { sol[i] = pbis.second; pbis.first--; if (pbis.first) q.push(pbis); q.push(p); } else if (int(q.size()) == 0) { return; } else { pair<int, int> pbisbis = q.top(); q.pop(); sol[i] = pbisbis.second; pbisbis.first--; if (pbisbis.first) q.push(pbisbis); q.push(p); q.push(pbis); } } } } for (int i = 0; i < n; i++) { if (i > 0) cout << ; cout << sol[i]; } cout << endl; exit(0); } int main() { cin >> n >> m; int suma = 0; for (int i = 1; i <= m; i++) { cin >> a[i]; suma += a[i]; } if (suma < n) { cout << -1 << endl; exit(0); } for (int i = 1; i <= m; i++) prueba(i); cout << -1 << endl; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int nmax = 5e4 + 5; int l[nmax], r[nmax]; int main() { int n, x; scanf( %d %d , &n, &x); for (int i = 0; i < n; ++i) { scanf( %d %d , l + i, r + i); } long long res = 0; for (int i = 0; i < n;) { if (!(l[i] <= x && r[i] >= x)) { int lc = 0, rc = 0; int lc2 = 0, rc2 = 0; int j = i; while ((lc < 1 || rc < 1) && lc2 < 2 && rc2 < 2) { if (r[j] <= x) ++lc; if (l[j] >= x) ++rc; if (r[j] < x) ++lc2; if (l[j] > x) ++rc2; ++j; } if (lc && rc) { if (l[i] > x) { res += l[i] - x; } if (r[i] < x) { res += x - r[i]; } ++i; } else if (lc2 == 2) { int nxt = 0; for (int k = i; k < j; ++k) { nxt = max(nxt, l[k]); if (r[k] < x) { nxt = max(nxt, r[k]); } } res += x - nxt; x = nxt; } else if (rc2 == 2) { int nxt = mod; for (int k = i; k < j; ++k) { nxt = min(nxt, r[k]); if (l[k] > x) { nxt = min(nxt, l[k]); } } res += nxt - x; x = nxt; } } else { ++i; } } printf( %lld n , res); return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> inline void read(T &x) { x = 0; register char c = getchar(); bool f = 0; while (c != - && (c < 0 || c > 9 )) c = getchar(); if (c == - ) c = getchar(), f = 1; while (c >= 0 && c <= 9 ) x = x * 10 + c - 48, c = getchar(); x = f ? -x : x; return; } template <class T> inline void write(T x) { if (!x) { putchar(48); return; } if (x < 0) x = -x, putchar( - ); int len = -1, z[20]; while (x > 0) z[++len] = x % 10, x /= 10; for (register int i = len; i >= 0; i--) putchar(z[i] + 48); return; } const int N = 10010; struct node { int to, nxt, w; } g[N * 10]; int lst[N], gl; void add(int x, int y, int z) { g[++gl] = (node){y, lst[x], z}; lst[x] = gl; } vector<pair<int, int> > E[N]; vector<int> E2[N]; bool vis1[N], visn[N]; void dfs(int x) { vis1[x] = 1; for (int i = 0; i < E[x].size(); i++) { int v = E[x][i].first; if (!vis1[v]) dfs(v); } } void dfs2(int x) { visn[x] = 1; for (int i = 0; i < E2[x].size(); i++) { int v = E2[x][i]; if (!visn[v]) dfs2(v); } } int cnt[N], dis[N], n, m; queue<int> q; bool vis[N]; bool spfa() { q.push(1); memset(dis, 127 / 3, sizeof(dis)); dis[1] = 0; while (!q.empty()) { int u = q.front(); q.pop(); vis[u] = 0; for (int i = lst[u]; i; i = g[i].nxt) { int v = g[i].to; if (dis[v] > dis[u] + g[i].w) { dis[v] = dis[u] + g[i].w; if ((++cnt[v]) == n) return 0; if (!vis[v]) { vis[v] = 1; q.push(v); } } } } return 1; } int ans[N]; int main() { read(n), read(m); for (int i = 1, x, y; i <= m; i++) { read(x), read(y); E[x].push_back(make_pair(y, i)); E2[y].push_back(x); } dfs(1); dfs2(n); for (int u = 1; u <= n; u++) for (auto v : E[u]) if (vis1[u] && visn[v.first]) { add(v.first, u, 2); add(u, v.first, -1); } if (!spfa()) puts( No ); else { puts( Yes ); int flg = 0; for (int u = 1; u <= n; u++) for (auto v : E[u]) if (vis1[u] && visn[v.first]) ans[v.second] = dis[u] - dis[v.first]; else ans[v.second] = 1; for (int i = 1; i <= m; i++) printf( %d n , ans[i]); } return 0; } |
#include <bits/stdc++.h> template <typename T> inline T abs(T a) { return a < 0 ? -a : a; } template <typename T> inline T min(T a, T b) { return a < b ? a : b; } template <typename T> inline T max(T a, T b) { return a > b ? a : b; } template <typename T> inline void swap(T& a, T& b) { T t = a; a = b, b = t; } template <typename T> inline bool umin(T& mn, T u) { return u < mn ? mn = u, true : false; } template <typename T> inline bool umax(T& mx, T u) { return u > mx ? mx = u, true : false; } template <typename T> inline void read(T& r) { char c; r = 0; bool flag = false; do c = getchar(); while (c != - && (c < 0 || c > 9 )); if (c == - ) flag = true, c = getchar(); do r = r * 10 + c - 0 , c = getchar(); while (c >= 0 && c <= 9 ); if (flag) r *= -1; } template <typename T1, typename T2> inline void read(T1& r, T2& s) { read(r), read(s); } template <typename T1, typename T2, typename T3> inline void read(T1& r, T2& s, T3& t) { read(r), read(s), read(t); } template <typename T1, typename T2, typename T3, typename T4> inline void read(T1& r, T2& s, T3& t, T4& u) { read(r), read(s), read(t), read(u); } template <typename T> inline void write(T w, const char* c = ) { if (w == 0) putchar( 0 ); else { if (w < 0) putchar( - ), w *= -1; static int s[21], top; top = 0; while (w) s[top++] = w % 10, w /= 10; while (top--) putchar(s[top] + 0 ); } for (int i = 0; c[i]; i++) putchar(c[i]); } int n, k, qn, en; long long p[10000]; const long long P = 1e7 + 19, mod = 1e9 + 7; void init() { for (int i = p[0] = 1; i < k; i++) p[i] = p[i - 1] * P % mod; } struct knapsack { int dp[10001]; void add(std::pair<int, int> o) { int v = o.first, w = o.second; for (int i = k - w; i >= 0; i--) umax(dp[i + w], dp[i] + v); } int getans() { long long ans = 0; for (int i = 1; i <= k; i++) (ans += dp[i] * p[i - 1]) %= mod; return (int)ans; } } st[160]; struct perfect_binary_tree { struct ac { std::pair<int, int> to; int nx; } e[4500000]; int L, first[655360]; perfect_binary_tree() : L(1) {} inline void addedge(int u, std::pair<int, int> v) { e[L].to = v, e[L].nx = first[u], first[u] = L++; } void add(int L, int R, std::pair<int, int> c, int now = 1, int l = 1, int r = qn) { if (L <= l && r <= R) { addedge(now, c); return; } int m = (l + r) >> 1; if (L <= m) add(L, R, c, now << 1, l, m); if (m < R) add(L, R, c, now << 1 | 1, m + 1, r); } void getans(int depth = 1, int now = 1, int l = 1, int r = qn) { st[depth] = st[depth - 1]; for (int j = first[now]; j; j = e[j].nx) st[depth].add(e[j].to); if (l == r) { write(st[depth].getans(), n ); return; } int m = (l + r) >> 1; getans(depth + 1, now << 1, l, m); getans(depth + 1, now << 1 | 1, m + 1, r); } } T; std::pair<int, int> exhibit[150000], show[150000]; void solve() { init(); for (int i = 0; i < n; i++) if (show[i].first <= qn && show[i].second >= 1) T.add(show[i].first, show[i].second, exhibit[i]); T.getans(); } void input() { qn = 0, n = 0; int m, o; read(m, k); while (m--) read(exhibit[n].first, exhibit[n].second), show[n++] = std::pair<int, int>(0, -1); read(m); while (m--) { read(o); switch (o) { case 1: read(exhibit[n].first, exhibit[n].second), show[n++] = std::pair<int, int>(qn + 1, -1); break; case 2: read(o), show[--o].second = qn; break; case 3: ++qn; break; } } for (int i = 0; i < n; i++) if (show[i].second == -1) show[i].second = qn; } int main() { input(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; struct Upgrade { int id, i, val; Upgrade(int _id = 0, int _i = 0, int _val = 0) : id(_id), i(_i), val(_val) {} friend bool operator<(const Upgrade &a, const Upgrade &b) { return a.val < b.val; } }; struct Data { Upgrade upgrade; long long nume, deno; int id; Data(int _id = 0, long long _nume = 0, long long _deno = 0, Upgrade _upgrade = Upgrade()) : id(_id), nume(_nume), deno(_deno), upgrade(_upgrade) {} friend bool operator<(const Data &a, const Data &b) { return double(a.nume) / a.deno < double(b.nume) / b.deno; } }; int n, m, k; long long a[100010]; bool is_assg[100010]; Upgrade assg[100010]; vector<Upgrade> mult; vector<Upgrade> add; vector<Upgrade> add_list[100010]; priority_queue<Data> q; double sum_mult[100010], sum; bool cmp(const Upgrade &a, const Upgrade &b) { return b < a; } int main() { ios_base::sync_with_stdio(false); cin >> n >> m >> k; for (int i = 1; i <= n; i++) cin >> a[i]; memset(assg, -1, sizeof assg); for (int i = 1; i <= m; i++) { Upgrade upgrade(i); int type; cin >> type >> upgrade.i >> upgrade.val; if (type == 1) { is_assg[i] = 1; if (assg[upgrade.i] < upgrade) assg[upgrade.i] = upgrade; } else if (type == 2) add_list[upgrade.i].push_back(upgrade); else mult.push_back(upgrade); } for (int i = 1; i <= n; i++) { if (assg[i].id != -1) { assg[i].val -= a[i]; add_list[i].push_back(assg[i]); } sort(add_list[i].begin(), add_list[i].end()); if (!add_list[i].empty()) { q.push(Data(i, a[i] + add_list[i].back().val, a[i], add_list[i].back())); add_list[i].pop_back(); } } while (!q.empty()) { Data data = q.top(); q.pop(); add.push_back(data.upgrade); int i = data.id; if (!add_list[i].empty()) { q.push(Data(i, data.nume + add_list[i].back().val, data.deno + data.upgrade.val, add_list[i].back())); add_list[i].pop_back(); } } sort(mult.begin(), mult.end(), cmp); sum_mult[0] = 0; for (int i = 1; i <= mult.size(); i++) sum_mult[i] = sum_mult[i - 1] + log(mult[i - 1].val); sum = 0; for (int i = 1; i <= n; i++) sum += log(a[i]); double max_sum = sum + sum_mult[min((int)mult.size(), k)]; int optimal = 0; for (int i = 0; i < add.size() && i < k; i++) { sum -= log(a[add[i].i]); a[add[i].i] += add[i].val; sum += log(a[add[i].i]); double total = sum + sum_mult[min((int)mult.size(), k - i - 1)]; if (total > max_sum) { max_sum = total; optimal = i + 1; } } vector<int> trace; for (int i = 0; i < optimal; i++) if (is_assg[add[i].id]) trace.push_back(add[i].id); for (int i = 0; i < optimal; i++) if (!is_assg[add[i].id]) trace.push_back(add[i].id); for (int i = 0; i < min((int)mult.size(), k - optimal); i++) trace.push_back(mult[i].id); cout << trace.size() << n ; for (int i = 0; i < trace.size(); i++) cout << trace[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; bool prime[N]; int phi[N], deg[N]; void sieve(); int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); sieve(); int n, k; cin >> n >> k; priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q; for (int i = 3; i <= n; ++i) { if (deg[i] == 0) { q.push({phi[i], i}); } for (int j = 2 * i; j <= n; j += i) { ++deg[j]; } } long long ans = (k == 1 ? 1 : 2); while (k--) { auto cur = q.top(); q.pop(); int i = cur.second; ans += phi[i]; for (int j = 2 * i; j <= n; j += i) { --deg[j]; if (deg[j] == 0) { q.push({phi[j], j}); } } } cout << ans << n ; } void sieve() { for (int i = 2; i < N; ++i) { prime[i] = true; phi[i] = i; } for (int i = 2; i < N; ++i) { if (prime[i]) { for (int j = i; j < N; j += i) { prime[j] = false; phi[j] /= i; phi[j] *= (i - 1); } } } } |
#include <bits/stdc++.h> using namespace std; const int maxN = 100010; int n, m, k, q; vector<int> G[maxN]; int pre[maxN], s[maxN], e[maxN], cnt[maxN], t; bool nroot[maxN]; void dfs(int cur) { s[cur] = ++t; cnt[cur] = 1; for (int i = 0; i < (int)G[cur].size(); i++) { int nxt = G[cur][i]; dfs(nxt); cnt[cur] += cnt[nxt]; } e[cur] = t; } int main(int argc, char** argv) { cin >> n >> m >> k >> q; int a, b; for (int i = 0; i < k; i++) { cin >> a >> b; if (pre[b]) { G[pre[b]].push_back(a); nroot[a] = true; } pre[b] = a; } for (int i = 1; i <= n; i++) { if (!nroot[i]) dfs(i); } for (int i = 0; i < q; i++) { cin >> a >> b; cout << ((s[a] < s[pre[b]] && e[a] >= e[pre[b]]) ? cnt[a] : 0) << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, k; cin >> n >> m >> k; vector<string> tt(n); for (int i = 0; i < n; ++i) { cin >> tt[i]; } int const INF = 1000000000; vector<int> dp(k + 1, INF), ndp(k + 1, INF); dp[0] = 0; for (int day = 0; day < n; ++day) { vector<int> prefix(m + 1); for (int i = 0; i < m; ++i) { prefix[i + 1] = prefix[i] + (tt[day][i] == 1 ); } vector<int> update(m + 1, INF); for (int arr = 0; arr <= m; ++arr) { for (int dep = arr; dep <= m; ++dep) { int plus_time = dep - arr; int plus_sk = prefix[m] - (prefix[dep] - prefix[arr]); update[plus_sk] = min(update[plus_sk], plus_time); } } for (int sk = 0; sk <= k; ++sk) { for (int plus_sk = 0; plus_sk <= m && sk + plus_sk <= k; ++plus_sk) { ndp[sk + plus_sk] = min(ndp[sk + plus_sk], dp[sk] + update[plus_sk]); } } dp.assign(k + 1, INF); dp.swap(ndp); } int result = INF; for (int sk = 0; sk <= k; ++sk) { result = min(result, dp[sk]); } cout << result << endl; } |
#include <bits/stdc++.h> using namespace std; int n, id = 0; int Hash[333], L[333]; map<string, int> M; vector<int> v; int kmp(int Len) { int len = v.size(); int lps[len], I = 0, num = 0; lps[0] = 0; for (int i = 1; i < len; i++) { if (v[I] != v[i]) I = -1; lps[i] = ++I; } int i = 0, j = 0; while (i < n) { if (Hash[i] == v[j]) { i++; j++; } else { if (j == 0) i++; else { if (j == lps[j]) j = 0; else j = lps[j - 1]; } } if (j == len) { num++; j = 0; } } if (num == 1) num = 0; return (Len - 1) * num; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); string s; int Len = 0, res = 0, len; cin >> n; for (int i = 0; i < n; i++) { cin >> s; if (!M[s]) { M[s] = ++id; } Hash[i] = M[s]; L[i] = s.length(); Len += L[i]; } Len += (n - 1); for (int i = 0; i < n; i++) { v.clear(); len = 0; for (int j = i; j < n; j++) { v.push_back(Hash[j]); len += L[j]; res = max(res, kmp(len)); } } cout << Len - res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1010; int N; pair<int, int> point[MAXN]; int cntx[MAXN], cnty[MAXN], cnt1, cnt2; map<int, vector<pair<int, int> > > samex, samey; int fa[MAXN]; int find(int x) { return (x == fa[x]) ? x : fa[x] = find(fa[x]); } void merge(int u, int v) { u = find(u); v = find(v); if (u != v) fa[u] = v; } bool check(long long dis) { for (int i = 1; i <= N; i++) fa[i] = i; for (int i = 1; i <= cnt1; i++) { for (int j = 1; j < samex[cntx[i]].size(); j++) { int id1 = samex[cntx[i]][j - 1].second; int id2 = samex[cntx[i]][j].second; if (point[id2].second - point[id1].second <= dis) merge(id1, id2); } } for (int i = 1; i <= cnt2; i++) { for (int j = 1; j < samey[cnty[i]].size(); j++) { int id1 = samey[cnty[i]][j - 1].second; int id2 = samey[cnty[i]][j].second; if (point[id2].first - point[id1].first <= dis) merge(id1, id2); } } int num = 0; for (int i = 1; i <= N; i++) num += (i == find(i)); if (num > 4) return false; if (num == 1) return true; if (num == 2) { for (int i = 1; i <= N; i++) { for (int j = i + 1; j <= N; j++) if (fa[i] != fa[j]) { if (point[i].first == point[j].first && abs(point[i].second - point[j].second) <= dis * 2) return true; if (point[i].second == point[j].second && abs(point[i].first - point[j].first) <= dis * 2) return true; if (abs(point[i].first - point[j].first) <= dis && abs(point[i].second - point[j].second) <= dis) return true; } } } else if (num == 3) { vector<pair<int, int> > seg; for (int i = 1; i <= cnt1; i++) { for (int j = 1; j < (int)samex[cntx[i]].size(); j++) { int id1 = samex[cntx[i]][j - 1].second; int id2 = samex[cntx[i]][j].second; if (fa[id1] != fa[id2]) { seg.push_back(make_pair(id1, id2)); } } } for (int i = 1; i <= cnt2; i++) { for (int j = 1; j < (int)samey[cnty[i]].size(); j++) { int id1 = samey[cnty[i]][j - 1].second; int id2 = samey[cnty[i]][j].second; if (fa[id1] != fa[id2]) { seg.push_back(make_pair(id1, id2)); } } } for (int i = 0; i < (int)seg.size(); i++) { int id1 = seg[i].first; int id2 = seg[i].second; for (int j = 1; j <= N; j++) if (fa[id1] != fa[j] && fa[id2] != fa[j]) { if (point[id1].first == point[id2].first) { if (min(point[id1].second, point[id2].second) >= point[j].second || max(point[id1].second, point[id2].second) <= point[j].second) continue; if (abs(point[j].first - point[id1].first) <= dis && abs(point[id1].second - point[j].second) <= dis && abs(point[id2].second - point[j].second) <= dis) return true; } else { if (min(point[id1].first, point[id2].first) >= point[j].first || max(point[id1].first, point[id2].first) <= point[j].first) continue; if (abs(point[j].first - point[id1].first) <= dis && abs(point[id1].second - point[j].second) <= dis && abs(point[j].first - point[id2].first) <= dis) return true; } } } } else { vector<pair<int, int> > segx, segy; for (int i = 1; i <= cnt1; i++) { for (int j = 1; j < (int)samex[cntx[i]].size(); j++) { int id1 = samex[cntx[i]][j - 1].second; int id2 = samex[cntx[i]][j].second; if (fa[id1] != fa[id2]) segx.push_back(make_pair(id1, id2)); } } for (int i = 1; i <= cnt2; i++) { for (int j = 1; j < (int)samey[cnty[i]].size(); j++) { int id1 = samey[cnty[i]][j - 1].second; int id2 = samey[cnty[i]][j].second; if (fa[id1] != fa[id2]) segy.push_back(make_pair(id1, id2)); } } for (int i = 0; i < (int)segx.size(); i++) { for (int j = 0; j < (int)segy.size(); j++) { int x1 = segx[i].first; int y1 = segx[i].second; int x2 = segy[j].first; int y2 = segy[j].second; if (fa[x1] == fa[x2] || fa[x1] == fa[y2] || fa[y1] == fa[x2] || fa[y1] == fa[y2]) continue; if (min(point[x2].first, point[y2].first) >= point[x1].first || max(point[x2].first, point[y2].first) <= point[x1].first) continue; if (min(point[x1].second, point[y1].second) >= point[x2].second || max(point[x1].second, point[y1].second) <= point[x2].second) continue; if (abs(point[x2].first - point[x1].first) <= dis && abs(point[y2].first - point[x1].first) <= dis && abs(point[x1].second - point[x2].second) <= dis && abs(point[y1].second - point[x2].second) <= dis) return true; } } } return false; } int main() { scanf( %d , &N); cnt1 = cnt2 = 0; for (int i = 1, x, y; i <= N; i++) { scanf( %d%d , &x, &y); point[i] = make_pair(x, y); cntx[++cnt1] = x; cnty[++cnt2] = y; samex[x].push_back(make_pair(y, i)); samey[y].push_back(make_pair(x, i)); } sort(cntx + 1, cntx + 1 + cnt1); sort(cnty + 1, cnty + 1 + cnt2); cnt1 = unique(cntx + 1, cntx + 1 + cnt1) - (cntx + 1); cnt2 = unique(cnty + 1, cnty + 1 + cnt2) - (cnty + 1); for (int i = 1; i <= cnt1; i++) sort(samex[cntx[i]].begin(), samex[cntx[i]].end()); for (int i = 1; i <= cnt2; i++) sort(samey[cnty[i]].begin(), samey[cnty[i]].end()); long long l = 0; long long r = 2e9; long long ans = -1; while (l <= r) { long long mid = (l + r) >> 1; if (check(mid)) { ans = mid; r = mid - 1; } else l = mid + 1; } printf( %lld , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int E = 1e18 + 7; const long long int MOD = 1000000007; int main() { long long int n; cin >> n; while (n--) { string s; cin >> s; bool P = true; bool same = true; for (int i = 0; i < s.size(); i++) { if (s[i] != s[0]) { same = false; } if (s[i] != s[s.size() - 1 - i]) { P = false; } } if (!P) { cout << s << n ; } else if (same) { cout << -1 << n ; } else { for (int i = 1; i < s.size(); i++) { if (s[i] != s[i - 1]) { swap(s[i], s[i - 1]); } } cout << s << n ; } } return 0; } |
#include<bits/stdc++.h> using namespace std; #define fo(a,b,c) for(int a=b;a<=c;++a) #define fr(a,b,c) for(int a=b;a>=c;--a) #define ll long long #define pq priority_queue int t,n,a[30010]; int cnt[3]; bool check() { if(cnt[1]==cnt[2]&&cnt[1]==cnt[0]) return false; return true; } int main() { scanf( %d ,&t); while(t--) { memset(cnt,0,sizeof(cnt)); int ans=0; scanf( %d ,&n); fo(i,1,n) scanf( %d ,&a[i]); fo(i,1,n) { if(a[i]%3==0)cnt[0]++; else if(a[i]%3==1)cnt[1]++; else cnt[2]++; } int sum=n/3,i=0; while(check()) { int pre=(i+2)%3; if(cnt[i]<sum) { cnt[pre]-=abs(sum-cnt[i]); ans+=abs(sum-cnt[i]); cnt[i]=sum; } i=(i+1)%3; } printf( %d n ,ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int xa, ya, xb, yb, n, count = 0; cin >> xa >> ya >> xb >> yb; if (xa > xb) { int t = xa; xa = xb; xb = t; } if (ya > yb) { int t = ya; ya = yb; yb = t; } cin >> n; int x[n], y[n], r[n]; for (int i = 0; i < n; i++) { cin >> x[i] >> y[i] >> r[i]; } for (int i = xa; i <= xb; i++) { for (int h = 0; h < n; h++) { double diff = sqrt((x[h] - i) * (x[h] - i) + (y[h] - ya) * (y[h] - ya)); if (diff <= r[h]) { count++; break; } } for (int h = 0; h < n; h++) { double diff = sqrt((x[h] - i) * (x[h] - i) + (y[h] - yb) * (y[h] - yb)); if (diff <= r[h]) { count++; break; } } } for (int j = (ya + 1); j < yb; j++) { for (int h = 0; h < n; h++) { double diff = sqrt((x[h] - xa) * (x[h] - xa) + (y[h] - j) * (y[h] - j)); if (diff <= r[h]) { count++; break; } } for (int h = 0; h < n; h++) { double diff = sqrt((x[h] - xb) * (x[h] - xb) + (y[h] - j) * (y[h] - j)); if (diff <= r[h]) { count++; break; } } } int ans = (2 * (xb - xa + yb - ya)) - count; cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int n, a; cin >> n >> a; int arr[n + 1]; int cnt = 0; for (int i = 1; i <= n; i++) { cin >> arr[i]; } for (int i = 1; i <= n; i++) { if (arr[i]) { int temp = i - a; int d = a - temp; if (d > n || d < 1 || arr[d] == arr[i]) cnt++; } } cout << cnt; return 0; } |
#include <bits/stdc++.h> using namespace std; struct point { long long x, y; }; long long cross(point a, point b, point c) { return (b.x - a.x) * (c.y - a.y) - (c.x - a.x) * (b.y - a.y); } int main() { point a, b, c; cin >> a.x >> a.y >> b.x >> b.y >> c.x >> c.y; long long ans = cross(a, b, c); if (ans > 0) cout << LEFT n ; else if (ans < 0) cout << RIGHT n ; else cout << TOWARDS n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long mod = 1e9 + 7; long long po(long long x, long long y, long long p) { long long res = 1; x = x % p; if (x == 0) return 0; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } void dfs(vector<vector<long long> > &adj, long long s, long long e, vector<long long> &v, vector<bool> &vis) { if (s == e) return; vis[s] = true; for (auto vx : adj[s]) { if (!vis[vx]) { dfs(adj, vx, e, v, vis); } } v.push_back(s); } void solve() { long long n, m, a, b; cin >> n >> m >> a >> b; vector<vector<long long> > adj(n + 1); while (m--) { long long x, y; cin >> x >> y; adj[x].push_back(y); adj[y].push_back(x); } vector<long long> v1; vector<long long> v2; vector<bool> vis(n + 1, false); dfs(adj, a, b, v1, vis); for (int i = 0; i < n + 1; i++) vis[i] = false; dfs(adj, b, a, v2, vis); sort((v1).begin(), (v1).end()); sort((v2).begin(), (v2).end()); long long n1 = 0, n2 = 0; for (long long i = 0; i < v1.size(); i++) { if (!binary_search(v2.begin(), v2.end(), v1[i]) and v1[i] != a) { n1++; } } for (long long i = 0; i < v2.size(); i++) { if (!binary_search(v1.begin(), v1.end(), v2[i]) and v2[i] != b) n2++; } cout << n1 * n2 << n ; } int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int t = 1; cin >> t; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int dx[8] = {-1, -1, -1, 0, 0, 1, 1, 1}; const int dy[8] = {-1, 0, 1, -1, 1, 0, 1, -1}; const int mod[2] = {1000000007, 1000000009}; const int p[2] = {29, 31}; const int maxn = 3000; int add(int a, int b, int k) { return a + b >= mod[k] ? a + b - mod[k] : a + b; } int mul(int a, int b, int k) { return 1LL * a * b % mod[k]; } int sub(int a, int b, int k) { return a < b ? a - b + mod[k] : a - b; } int pwr(int a, int k, int i) { int res = 1; while (k) { if (k % 2) res = mul(res, a, i); a = mul(a, a, i); k /= 2; } return res; } int invmod(int a, int k) { return pwr(a, mod[k] - 2, k); } int H[2][maxn], pinv[2][maxn]; pair<int, int> hsb, hse; string t, sb, se; pair<int, int> h(string a) { for (int k = 0; k < 2; ++k) { int pp = 1; for (int i = 0; i < a.size(); ++i) { H[k][i] = mul(a[i] - a + 1, pp, k), pp = mul(pp, p[k], k); if (i) H[k][i] = add(H[k][i - 1], H[k][i], k); } } return {H[0][a.size() - 1], H[1][a.size() - 1]}; } pair<int, int> f(int i, int j) { return {mul(pinv[0][i], i ? sub(H[0][j], H[0][i - 1], 0) : H[0][j], 0), mul(pinv[1][i], i ? sub(H[1][j], H[1][i - 1], 1) : H[1][j], 1)}; } vector<int> x, y; vector<pair<int, int> > M; int main() { for (int k = 0; k < 2; ++k) { pinv[k][0] = 1; pinv[k][1] = invmod(p[k], k); for (int i = 2; i < maxn; ++i) pinv[k][i] = mul(pinv[k][i - 1], pinv[k][1], k); } cin >> t >> sb >> se; hsb = h(sb); hse = h(se); h(t); int cnt = 0, a = sb.size(), b = se.size(), c = t.size(); for (int i = 0; i + a - 1 < c; ++i) if (hsb == f(i, i + a - 1)) x.push_back(i); for (int i = 0; i + b - 1 < c; ++i) if (hse == f(i, i + b - 1)) y.push_back(i); for (int i : x) for (int j : y) if (i <= j && i + a <= j + b) M.push_back(f(i, j + b - 1)); sort(M.begin(), M.end()); int res = M.size() != 0; for (int i = 1; i < M.size(); ++i) res += (M[i] != M[i - 1]); cout << res << n ; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; int n; long long int dn[6010], dinamik2[6010]; int main() { string ar; string ar2; cin >> ar; cin >> ar2; n = ((int)(ar2.size())); long long res = 0; for (int k = 0; k < ((int)(ar.size())); k++) { for (int j = 0; j < ((int)(ar2.size())); j++) { if (ar2[j] == ar[k]) dinamik2[j] = (dinamik2[j] + dn[j - 1] + 1) % MOD; dinamik2[j + 1] = (dinamik2[j + 1] + dinamik2[j]) % MOD; } res = (res + dinamik2[n]) % MOD; for (int j = 0; j < ((int)(ar2.size())); j++) dn[j] = dinamik2[j]; memset(dinamik2, 0, sizeof dinamik2); } cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; set<string> l; int ans = 0; while (getline(cin, s)) { if (s == ) break; if (s[0] == + ) { l.insert(s.substr(1)); } else if (s[0] == - ) { l.erase(s.substr(1)); } else { int i = 0; while (s[i] != : ) i++; ans += ((int)s.size() - i - 1) * l.size(); } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int pb, mb, bb, m; cin >> pb >> mb >> bb >> m; int s1 = 2 * pb; int temp = 2 * m; if (2 * m >= s1) { cout << -1 << endl; return 0; } int s2 = 2 * mb; if (2 * m >= s2) { cout << -1 << endl; return 0; } int s3 = 2 * bb, c = 0; for (int i = bb; i <= s3; i++) { if (m <= i && temp >= i) { s3 = i; c = 1; break; } } if (c == 0) { cout << -1 << endl; return 0; } cout << s1 << endl; cout << s2 << endl; cout << s3 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; string a, b; struct node { int x, y; }; vector<node> ans; void rua() { ans.clear(); int n; scanf( %d , &n); cin >> a >> b; for (int i = 0; i < n; i++) if (a[i] != b[i]) for (int j = i + 1; j < n; j++) { if (a[i] == a[j]) { swap(a[j], b[i]); ans.push_back({j, i}); break; } if (a[i] == b[j]) { swap(a[j], b[j]); ans.push_back({j, j}); swap(a[j], b[i]); ans.push_back({j, i}); break; } } if (a != b) { printf( NO n ); return; } printf( YES n%d n , (int)ans.size()); for (auto i : ans) printf( %d %d n , i.x + 1, i.y + 1); } int main() { int t; scanf( %d , &t); while (t--) rua(); return 0; } |
#include <bits/stdc++.h> const int N = 100100; struct Edge { int weight, type; int x, y; int num; bool operator<(const Edge& other) const { return weight == other.weight ? type > other.type : weight < other.weight; } } edges[N]; int n, m; int x[N], y[N]; bool b[N]; int main() { scanf( %d%d , &n, &m); for (int i = 0; i < m; ++i) { scanf( %d%d , &edges[i].weight, &edges[i].type); edges[i].num = i; } std::sort(edges, edges + m); int k = 0; int ptrX = 0, ptrY = 2; for (int i = 0; i < m; ++i) { if (edges[i].type == 0) { if (b[ptrX] && b[ptrY]) { edges[i].x = ptrX; edges[i].y = ptrY; if (ptrX + 2 < ptrY) ++ptrX; else { ptrX = 0; ++ptrY; } } else { puts( -1 ); return 0; } } else { edges[i].x = k; edges[i].y = k + 1; b[k] = true; b[k + 1] = true; ++k; } } for (int i = 0; i < m; ++i) { int num = edges[i].num; x[num] = edges[i].x; y[num] = edges[i].y; } for (int i = 0; i < m; ++i) printf( %d %d n , x[i] + 1, y[i] + 1); return 0; } |
#include <bits/stdc++.h> using namespace std; bool fun(int n) { if (n == 1) return false; if (n == 2) return true; if (n % 2 == 0) return false; for (int i = 2; i * i <= n; i++) { if (n % i == 0) return false; } return true; } int main() { int n; scanf( %d , &n); if (fun(n)) printf( 1 n ); else if (n & 1) { if (fun(n - 2)) { printf( 2 n ); } else printf( 3 n ); } else printf( 2 n ); } |
#include <bits/stdc++.h> const int MAXN = 55; const int MAXS = 10105; const int MOD = 1000000007; int n; bool g[MAXN][MAXN]; std::vector<int> e[MAXN][MAXN]; std::vector<int> tr[MAXS]; int f[MAXS]; void input() { int m; scanf( %d%d , &n, &m); for (int i = 0; i < m; ++i) { int x, y, nv; scanf( %d%d%d , &x, &y, &nv); --x; --y; std::vector<int> ev(nv); for (int j = 0; j < nv; ++j) { int v; scanf( %d , &v); --v; ev[j] = v; } g[x][y] = true; e[x][y] = ev; } } int check_edge(const std::vector<int> &a, int x, int y) { if (a.empty()) return -1; for (std::vector<int>::const_iterator i = a.begin(); i + 1 != a.end(); ++i) if (*i == x && *(i + 1) == y) return i - a.begin(); return -1; } int walk(std::vector<int> &a, int now, bool reverse) { for (int k = 0; (int)a.size() < 2 * n && k < (int)a.size(); ++k) { if ((!reverse && !g[now][a[k]]) || (reverse && !g[a[k]][now])) return -1; if (!reverse) a.insert(a.end(), e[now][a[k]].begin(), e[now][a[k]].end()); else { a.insert(a.end(), e[a[k]][now].rbegin(), e[a[k]][now].rend()); } now = a[k]; } if ((int)a.size() >= 2 * n) return -1; return now; } void add_trans(int x, int y, int len) { for (int i = 0; i + len <= 2 * n; ++i) tr[i * (2 * n) + x].push_back((i + len) * (2 * n) + y); } void init() { for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) if (g[i][j]) { int pos; if ((pos = check_edge(e[i][j], i, j)) != -1) { std::vector<int> tmpl(e[i][j].begin(), e[i][j].begin() + pos); std::reverse(tmpl.begin(), tmpl.end()); int nowl = walk(tmpl, i, true); std::vector<int> tmpr(e[i][j].begin() + (pos + 2), e[i][j].end()); int nowr = walk(tmpr, j, false); if (nowl != -1 && nowr != -1) add_trans(nowl, nowr + n, tmpl.size() + tmpr.size() + 1); } if (e[i][j].empty()) { add_trans(i + n, j, 1); } if (!e[i][j].empty() && e[i][j].front() == j) { std::vector<int> tmp(e[i][j].begin() + 1, e[i][j].end()); int now = walk(tmp, j, false); if (now != -1) add_trans(i + n, now + n, tmp.size() + 1); } if (!e[i][j].empty() && e[i][j].back() == i) { std::vector<int> tmp(e[i][j].begin(), e[i][j].end() - 1); std::reverse(tmp.begin(), tmp.end()); int now = walk(tmp, i, true); if (now != -1) add_trans(now, j, tmp.size() + 1); } } } void solve() { int totstate = (2 * n + 1) * (2 * n); for (int i = 0; i < n; ++i) f[i] = 1; for (int i = 0; i < totstate; ++i) for (std::vector<int>::const_iterator j = tr[i].begin(); j != tr[i].end(); ++j) (f[*j] += f[i]) %= MOD; for (int i = 1; i <= 2 * n; ++i) { int sum = 0; for (int j = 0; j < n; ++j) (sum += f[i * (2 * n) + j + n]) %= MOD; printf( %d n , sum); } } int main() { input(); init(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; bool jolmetsz(long long a, long long b, long long c, long long x1, long long y1, long long x2, long long y2) { return -c - a * x1 < b * y1 && -c - a * x2 > b * y2; } int main() { long long x1, x2, y1, y2, n, db = 0; cin >> x1 >> y1 >> x2 >> y2 >> n; if (y2 < y1) { swap(y1, y2); swap(x1, x2); } int lep = 0; for (int i = 0; i < n; i++) { long long a, b, c; cin >> a >> b >> c; if (jolmetsz(a, b, c, x1, y1, x2, y2) || jolmetsz(a, b, c, x2, y2, x1, y1)) db++; } cout << db << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } string str; cin >> str; bool flag = 0; int start = 0; set<int> s; for (int i = 0; i < str.length(); i++) { if (!flag && str[i] == 0 && a[i] != i + 1) { cout << NO << endl; return 0; } if (flag && str[i] == 0 ) { s.insert(a[i]); for (int j = start; j <= i + 1; j++) { if (s.find(j) == s.end()) { cout << NO << endl; return 0; } } s.clear(); flag = 0; } if (str[i] == 1 ) { s.insert(a[i]); if (!flag) { start = i + 1; } flag = 1; } } cout << YES << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; set<int> s; int main() { int x; cin >> x; s.insert(x); for (;;) { x++; while (x % 10 == 0) x /= 10; int sz = s.size(); s.insert(x); if (sz == s.size()) { printf( %d , s.size()); return 0; } } } |
#include <bits/stdc++.h> using namespace std; const int max_n = 266, inf = 1011111111; const string ans[] = { !x&x , x&y&z , !z&x&y , x&y , !y&x&z , x&z , !y&x&z|!z&x&y , (y|z)&x , !y&!z&x , !y&!z&x|x&y&z , !z&x , !z&x|x&y , !y&x , !y&x|x&z , !(y&z)&x , x , !x&y&z , y&z , !x&y&z|!z&x&y , (x|z)&y , !x&y&z|!y&x&z , (x|y)&z , !x&y&z|!y&x&z|!z&x&y , (x|y)&z|x&y , !x&y&z|!y&!z&x , !y&!z&x|y&z , !x&y&z|!z&x , !z&x|y&z , !x&y&z|!y&x , !y&x|y&z , !(y&z)&x|!x&y&z , x|y&z , !x&!z&y , !x&!z&y|x&y&z , !z&y , !z&y|x&y , !x&!z&y|!y&x&z , !x&!z&y|x&z , !y&x&z|!z&y , !z&y|x&z , !(!x&!y|x&y|z) , !(!x&!y|x&y|z)|x&y&z , !z&(x|y) , !z&(x|y)|x&y , !x&!z&y|!y&x , !x&!z&y|!y&x|x&z , !y&x|!z&y , !z&y|x , !x&y , !x&y|y&z , !(x&z)&y , y , !x&y|!y&x&z , !x&y|x&z , !(x&z)&y|!y&x&z , x&z|y , !x&y|!y&!z&x , !x&y|!y&!z&x|y&z , !x&y|!z&x , !z&x|y , !x&y|!y&x , !x&y|!y&x|x&z , !(x&z)&y|!y&x , x|y , !x&!y&z , !x&!y&z|x&y&z , !x&!y&z|!z&x&y , !x&!y&z|x&y , !y&z , !y&z|x&z , !y&z|!z&x&y , !y&z|x&y , !(!x&!z|x&z|y) , !(!x&!z|x&z|y)|x&y&z , !x&!y&z|!z&x , !x&!y&z|!z&x|x&y , !y&(x|z) , !y&(x|z)|x&z , !y&z|!z&x , !y&z|x , !x&z , !x&z|y&z , !x&z|!z&x&y , !x&z|x&y , !(x&y)&z , z , !(x&y)&z|!z&x&y , x&y|z , !x&z|!y&!z&x , !x&z|!y&!z&x|y&z , !x&z|!z&x , !x&z|!z&x|x&y , !x&z|!y&x , !y&x|z , !(x&y)&z|!z&x , x|z , !(!y&!z|x|y&z) , !(!y&!z|x|y&z)|x&y&z , !x&!y&z|!z&y , !x&!y&z|!z&y|x&y , !x&!z&y|!y&z , !x&!z&y|!y&z|x&z , !y&z|!z&y , !y&z|!z&y|x&y , !(!x&!y|x&y|z)|!x&!y&z , !(!x&!y|x&y|z)|!x&!y&z|x&y&z , !x&!y&z|!z&(x|y) , !x&!y&z|!z&(x|y)|x&y , !x&!z&y|!y&(x|z) , !x&!z&y|!y&(x|z)|x&z , !y&(x|z)|!z&y , !y&z|!z&y|x , !x&(y|z) , !x&(y|z)|y&z , !x&z|!z&y , !x&z|y , !x&y|!y&z , !x&y|z , !(x&y)&z|!z&y , y|z , !x&(y|z)|!y&!z&x , !x&(y|z)|!y&!z&x|y&z , !x&(y|z)|!z&x , !x&z|!z&x|y , !x&(y|z)|!y&x , !x&y|!y&x|z , !x&y|!y&z|!z&x , x|y|z , !(x|y|z) , !(x|y|z)|x&y&z , !(!x&y|!y&x|z) , !(x|y|z)|x&y , !(!x&z|!z&x|y) , !(x|y|z)|x&z , !(!x&y|!y&x|z)|!y&x&z , !(x|y|z)|(y|z)&x , !y&!z , !y&!z|x&y&z , !(!x&y|z) , !y&!z|x&y , !(!x&z|y) , !y&!z|x&z , !(!x&y|z)|!y&x , !y&!z|x , !(!y&z|!z&y|x) , !(x|y|z)|y&z , !(!x&y|!y&x|z)|!x&y&z , !(x|y|z)|(x|z)&y , !(!x&z|!z&x|y)|!x&y&z , !(x|y|z)|(x|y)&z , !(!x&y|!y&x|z)|!x&y&z|!y&x&z , !(x|y|z)|(x|y)&z|x&y , !x&y&z|!y&!z , !y&!z|y&z , !(!x&y|z)|!x&y&z , !(!x&y|z)|y&z , !(!x&z|y)|!x&y&z , !(!x&z|y)|y&z , !(!x&y|z)|!x&y&z|!y&x , !y&!z|x|y&z , !x&!z , !x&!z|x&y&z , !(!y&x|z) , !x&!z|x&y , !x&!z|!y&x&z , !x&!z|x&z , !(!y&x|z)|!y&x&z , !(!y&x|z)|x&z , !(x&y|z) , !(x&y|z)|x&y&z , !z , !z|x&y , !x&!z|!y&x , !(x&y|z)|x&z , !y&x|!z , !z|x , !(!y&z|x) , !x&!z|y&z , !(!y&x|z)|!x&y , !x&!z|y , !(!y&z|x)|!y&x&z , !(!y&z|x)|x&z , !(!y&x|z)|!x&y|!y&x&z , !x&!z|x&z|y , !x&y|!y&!z , !(x&y|z)|y&z , !x&y|!z , !z|y , !(!x&!y&z|x&y) , !x&!z|!y&x|y&z , !x&y|!y&x|!z , !z|x|y , !x&!y , !x&!y|x&y&z , !x&!y|!z&x&y , !x&!y|x&y , !(!z&x|y) , !x&!y|x&z , !(!z&x|y)|!z&x&y , !(!z&x|y)|x&y , !(x&z|y) , !(x&z|y)|x&y&z , !x&!y|!z&x , !(x&z|y)|x&y , !y , !y|x&z , !y|!z&x , !y|x , !(!z&y|x) , !x&!y|y&z , !(!z&y|x)|!z&x&y , !(!z&y|x)|x&y , !(!z&x|y)|!x&z , !x&!y|z , !(!z&x|y)|!x&z|!z&x&y , !x&!y|x&y|z , !x&z|!y&!z , !(x&z|y)|y&z , !(!x&!z&y|x&z) , !x&!y|!z&x|y&z , !x&z|!y , !y|z , !x&z|!y|!z&x , !y|x|z , !(x|y&z) , !(x|y&z)|x&y&z , !x&!y|!z&y , !(x|y&z)|x&y , !x&!z|!y&z , !(x|y&z)|x&z , !(!y&!z&x|y&z) , !x&!y|!z&y|x&z , !((x|y)&z|x&y) , !((x|y)&z|x&y)|x&y&z , !x&!y|!z , !x&!y|!z|x&y , !x&!z|!y , !x&!z|!y|x&z , !y|!z , !y|!z|x , !x , !x|y&z , !x|!z&y , !x|y , !x|!y&z , !x|z , !x|!y&z|!z&y , !x|y|z , !x|!y&!z , !x|!y&!z|y&z , !x|!z , !x|!z|y , !x|!y , !x|!y|z , !(x&y&z) , !x|x }; int n; string s; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin >> n; while (n--) { cin >> s; int mask = 0; for (int i = 0; i < 8; ++i) { mask += (1 << i) * (s[7 - i] - 0 ); } cout << ans[mask] << n ; } return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.