func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; template <typename T> void read(T &n) { n = 0; T f = 1; char c = getchar(); while (!isdigit(c) && c != - ) c = getchar(); if (c == - ) f = -1, c = getchar(); while (isdigit(c)) n = n * 10 + c - 0 , c = getchar(); n *= f; } template <typename T> void write(T n) { if (n < 0) putchar( - ), n = -n; if (n > 9) write(n / 10); putchar(n % 10 + 0 ); } struct Matrix { int n, m; long long a[3][3]; Matrix(int x = 0, int y = 0) : n(x), m(y) { memset(a, 0, sizeof(a)); } friend Matrix operator*(Matrix a, Matrix b) { Matrix c(a.n, b.m); for (int i = 1; i <= a.n; i++) { for (int j = 1; j <= b.m; j++) { for (int k = 1; k <= a.m; k++) { (c.a[i][j] += a.a[i][k] * b.a[k][j] % 998244353) %= 998244353; } } } return c; } } s[500005 * 4], mat, ans; int a[500005 * 4]; void build(int p, int l, int r) { if (l == r) { s[p].n = s[p].m = 2; s[p].a[1][1] = a[l] + 1; s[p].a[2][1] = 1, s[p].a[2][2] = 0; if (l > 1 && a[l - 1] == 1) s[p].a[1][2] = 9 - a[l]; return; } build((p << 1), l, ((l + r) >> 1)), build((p << 1 | 1), ((l + r) >> 1) + 1, r); s[p] = s[(p << 1 | 1)] * s[(p << 1)]; } void update(int p, int l, int r, int u, int k) { if (l == r) { s[p].a[1][1] = k + 1; if (u > 1 && a[u - 1] == 1) s[p].a[1][2] = 9 - k; else s[p].a[1][2] = 0; a[u] = k; return; } if (((l + r) >> 1) >= u) update((p << 1), l, ((l + r) >> 1), u, k); else update((p << 1 | 1), ((l + r) >> 1) + 1, r, u, k); s[p] = s[(p << 1 | 1)] * s[(p << 1)]; } int n, m; int main() { mat.n = 2, mat.m = 1; mat.a[1][1] = mat.a[2][1] = 1; cin >> n >> m; for (int i = 1; i <= n; i++) scanf( %1d , &a[i]); build(1, 1, n); int x, y; for (int i = 1; i <= m; i++) { read(x), read(y); update(1, 1, n, x, y); if (x < n) update(1, 1, n, x + 1, a[x + 1]); ans = s[1] * mat; write(ans.a[1][1]); puts( ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int long long n, i, k = 0; cin >> n; double a[n + 5], s = 0, b[n + 5]; for (i = 0; i < n; i++) { cin >> a[i]; s += a[i]; } for (i = 0; i < n; i++) { double r = (s - a[i]) / (n - 1); if (r == a[i]) { b[k] = i + 1; k++; } } cout << k << endl; for (i = 0; i < k; i++) { cout << b[i] << ; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { long long a, b, d, i, j, k = 0, h, c, p1, p2, q1, q2, A, B, c1, c2, l, m = 0, n, t = 1, q = 0, r, e, x = 0, y = 0, o, s, mx1, mx2 = 0, mx = 0, p = 0, v, mn = 0, z, w; string s1, s2, s3, s4; cin >> n; int arr[n]; for (i = 0; i < n; i++) cin >> arr[i]; sort(arr, arr + n); x = arr[0]; t = n / 2; i = 1; while (t--) { cout << arr[i] << << x << endl; i++; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t = 1; cin >> t; while (t--) solve(); } |
#include <bits/stdc++.h> using namespace std; int nvertices, nedges; vector<vector<pair<int, int>>> adjList(110); vector<bool> visited; void dfs(int u, int c) { visited[u] = true; for (auto e : adjList[u]) { if (!visited[e.first] && (e.second == c)) { dfs(e.first, c); } } } int main() { cin >> nvertices >> nedges; for (int i = 0; i < nedges; i++) { int u, v, c; cin >> u >> v >> c; adjList[u].push_back({v, c}); adjList[v].push_back({u, c}); } int m; cin >> m; while (m--) { int u, v; cin >> u >> v; set<int> ans; for (auto e : adjList[u]) { visited.assign(110, false); visited[u] = true; dfs(e.first, e.second); if (visited[v] == true) ans.insert(e.second); } cout << ans.size() << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int readint() { char c; while (c = getchar(), (c < 0 || c > 9 ) && c != - ) ; bool flag = (c == - ); if (flag) c = getchar(); int x = 0; while (c >= 0 && c <= 9 ) { x = x * 10 + c - 48; c = getchar(); } return flag ? -x : x; } char readchar() { char c; while (c = getchar(), c != A && c != C && c != < && c != > && c != ^ ) ; return c; } const int maxn = 100005; const int maxm = 15; const int block = 300; int n, m, q, x, y; pair<int, int> pos; char t[maxn][maxm]; pair<int, int> nxt[maxn][maxm], go[maxn][maxm]; inline bool on(pair<int, int> pos) { return pos.first >= 1 && pos.first <= n && pos.second >= 1 && pos.second <= m; } void calc(int x, int y) { if (!on(make_pair(x, y))) { nxt[x][y] = make_pair(x, y); return; } if (nxt[x][y].first != -2) return; if (t[x][y] == < ) { if (t[x][y - 1] == > ) nxt[x][y] = make_pair(-1, -1); else calc(x, y - 1), nxt[x][y] = nxt[x][y - 1]; } else if (t[x][y] == > ) { if (t[x][y + 1] == < ) nxt[x][y] = make_pair(-1, -1); else calc(x, y + 1), nxt[x][y] = nxt[x][y + 1]; } else nxt[x][y] = make_pair(x - 1, y); } void jump(int start, int finish) { for (int i = start; i <= finish && i <= n; i++) { if (i % block == 1) { for (int j = 1; j <= m; j++) go[i][j] = nxt[i][j]; } else { for (int j = 1; j <= m; j++) { if (!on(nxt[i][j])) go[i][j] = nxt[i][j]; else go[i][j] = go[nxt[i][j].first][nxt[i][j].second]; } } } } int main() { n = readint(); m = readint(); q = readint(); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) t[i][j] = readchar(), nxt[i][j] = make_pair(-2, -2); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) calc(i, j); jump(1, n); while (q--) { char type = readchar(); if (type == A ) { pos.first = readint(); pos.second = readint(); while (on(pos)) { pos = go[pos.first][pos.second]; } printf( %d %d n , pos.first, pos.second); } else { x = readint(); y = readint(); char op = readchar(); t[x][y] = op; for (int j = 1; j <= m; j++) nxt[x][j] = make_pair(-2, -2); for (int j = 1; j <= m; j++) calc(x, j); jump(x, x); jump(x + 1, (x / block + (x % block == 0 ? 0 : 1)) * block); } } return 0; } |
#include <bits/stdc++.h> using std::cerr; using std::cin; using std::cout; using std::deque; using std::endl; using std::fixed; using std::ios_base; using std::list; using std::make_pair; using std::make_tuple; using std::map; using std::nth_element; using std::pair; using std::queue; using std::reverse; using std::set; using std::sort; using std::stack; using std::string; using std::tuple; using std::unordered_map; using std::unordered_set; using std::vector; const int MAXN = 100000; const int INF = 1e9; const int MOD = 1e9 + 7; const int64_t L_INF = 4e18; int n; vector<int64_t> numbers[64]; list<int64_t> ans; int get_top(int64_t num) { for (int i = 62; i >= 0; i--) { if (num & (1ll << i)) { return i; } } return -1; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.precision(10); cout << fixed; cin >> n; for (int i = 0; i < n; i++) { int64_t b; cin >> b; numbers[get_top(b)].push_back(b); } for (int i = 62; i >= 0; i--) { if (numbers[i].empty()) { continue; } if (numbers[i].size() > ans.size() + 1) { cout << No n ; exit(0); } auto iter = ans.begin(); iter = ans.insert(iter, numbers[i][0]); iter++; int j = 1; int64_t sum = numbers[i][0]; while (j < (int)numbers[i].size() && iter != ans.end()) { sum ^= *iter; iter++; if ((sum ^ numbers[i][j]) > sum) { iter = ans.insert(iter, numbers[i][j]); sum ^= *iter; iter++; j++; } } if (j != (int)numbers[i].size()) { cout << No n ; exit(0); } } cout << Yes n ; for (int64_t b : ans) { cout << b << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[101][101]; long long b[101]; int main() { int m, n; cin >> m >> n; for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) cin >> a[i][j]; for (int i = 0; i < m; i++) { long long minn = 100000000000000; for (int j = 0; j < n; j++) { if (a[i][j] < minn) minn = a[i][j]; } b[i] = minn; } long long maxx = 0; for (int i = 0; i < m; i++) { if (b[i] > maxx) maxx = b[i]; } cout << maxx; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; scanf( %d , &(n)); scanf( %d , &(k)); int A[101]; for (int(i) = 0; (i) < (n); (i)++) { scanf( %d , &(A[i])); } int x, y, ans = 0; for (int(i) = 0; (i) < (k); (i)++) { x = 0; y = 0; for (int(j) = 0; (j) < (n / k); (j)++) { if (A[j * k + i] == 2) y++; else x++; } ans += min(x, y); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> const int MAX_VAL = 1000000; struct AInt { int sum; int minSum; }; AInt aInt[1 << 21]; void update(int index, int left, int right, int addIndex, int addValue) { if (left == right) { aInt[index].sum += addValue; aInt[index].minSum += addValue; } else { int avg = (left + right) / 2; if (addIndex <= avg) { update(2 * index + 0, left, avg, addIndex, addValue); } else { update(2 * index + 1, avg + 1, right, addIndex, addValue); } aInt[index].sum = aInt[2 * index].sum + aInt[2 * index + 1].sum; aInt[index].minSum = std::min(aInt[2 * index].minSum + aInt[2 * index + 1].sum, aInt[2 * index + 1].minSum); } } int query(int index, int suffSum, int left, int right) { if (aInt[index].minSum + suffSum >= 0) { return -1; } else if (left == right) { return left; } else { int avg = (left + right) / 2; int q2 = query(2 * index + 1, suffSum, avg + 1, right); if (q2 == -1) { int q1 = query(2 * index + 0, aInt[2 * index + 1].sum + suffSum, left, avg); return q1; } else { return q2; } } } void update(int value, int sign) { update(1, 1, MAX_VAL, value, sign); } int query() { return query(1, 0, 1, MAX_VAL); } int main() { int n, m; scanf( %d%d , &n, &m); int a[n]; int b[m]; for (int i = 0; i < n; i++) { scanf( %d , &a[i]); update(a[i], -1); } for (int i = 0; i < m; i++) { scanf( %d , &b[i]); update(b[i], +1); } int q; scanf( %d , &q); for (int z = 0; z < q; z++) { int t, i, x; scanf( %d%d%d , &t, &i, &x); i--; if (t == 1) { update(a[i], +1); a[i] = x; update(a[i], -1); } else { update(b[i], -1); b[i] = x; update(b[i], +1); } printf( %d n , query()); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; for (int i = 0; i <= t / (1234567); i++) { for (int j = 0; j <= t / 123456; j++) { if (t - (i * 1234567) - (j * 123456) >= 0 && ((t - (i * 1234567) - (j * 123456)) % 1234 == 0)) { cout << YES ; return 0; } } } cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long findGCD(long long a, long long b) { return ((b == 0) ? a : findGCD(b, a % b)); } map<long long, long long> width; long long wit = 0; vector<pair<long long, long long> > rect[200005]; int main() { long long n; scanf( %lld , &n); for (long long i = (1); i <= (n); i += (1)) { long long w, h, f; scanf( %lld %lld %lld , &h, &w, &f); if (width.find(w) == width.end()) { width[w] = ++wit; } rect[width[w]].push_back({h, f}); } sort(rect[1].begin(), rect[1].end()); for (long long i = (2); i <= (wit); i += (1)) { if (rect[i - 1].size() != rect[i].size()) { printf( 0 n ); return 0; } sort(rect[i].begin(), rect[i].end()); for (long long j = (0); j <= ((long long)rect[i].size() - 1); j += (1)) { if (rect[i - 1][j].first != rect[i][j].first) { printf( 0 n ); return 0; } } long long gcd = findGCD(rect[i - 1][0].second, rect[i][0].second); long long n = rect[i - 1][0].second / gcd, dn = rect[i][0].second / gcd; for (long long j = (1); j <= ((long long)rect[i].size() - 1); j += (1)) { gcd = findGCD(rect[i - 1][j].second, rect[i][j].second); if (rect[i - 1][j].second / gcd != n || rect[i][j].second / dn != gcd) { printf( 0 n ); return 0; } } } long long tgcd = -1; for (long long j = (0); j <= ((long long)rect[1].size() - 1); j += (1)) { long long gcd = rect[1][j].second; for (long long i = (2); i <= (wit); i += (1)) { gcd = findGCD(gcd, rect[i][j].second); } if (tgcd == -1) tgcd = gcd; else tgcd = findGCD(tgcd, gcd); } long long ans = 0; for (long long i = (1); i <= (sqrt(tgcd)); i += (1)) { if (tgcd % i == 0) { if (tgcd == i * i) ans++; else ans += 2; } } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 2e5 + 11; const int MAXN = 5e7 + 1; const int BITMAX = 18; const int INF = 2e9 + 88; const long long LLINF = 1e17 + 3; const int MOD = 1e9 + 7; const long double Pi = acos(-1); int a[MAX]; int main() { int n, m; scanf( %d , &n); scanf( %d , &m); for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); if (n == 1) return puts( 0 ), 0; sort(a + 1, a + n + 1); long long res = 0; int mx = 0; for (int i = 1; i < n; ++i) { res += a[i] - 1; if (a[i] > mx) mx++; } if (a[n] > mx) res += mx; else res += a[n] - 1; printf( %lld n , res); return 0; } |
#include <bits/stdc++.h> using namespace std; void init() { cin.tie(0); cin.sync_with_stdio(0); } int main() { init(); int n, z; cin >> n >> z; for (int i = 0; i < z; i++) { (n % 10 == 0) ? n /= 10 : n -= 1; } cout << n << endl; } |
#include <bits/stdc++.h> using namespace std; const int N = 1000010; const int mod = 998244353; char str[N]; char s[2][N]; int nxt[2][N]; int extend[2][N]; void get_nxt(char *s, int *nxt) { int n = strlen(s), r = 0, pos = 1; nxt[0] = n; while (r + 1 < n && s[r] == s[r + 1]) ++r; nxt[1] = r; for (int i = 2; i < n; ++i) { nxt[i] = max(0, min(nxt[i - pos], r - i + 1)); while (i + nxt[i] < n && s[i + nxt[i]] == s[nxt[i]]) ++nxt[i]; if (i + nxt[i] - 1 > r) { r = i + nxt[i] - 1; pos = i; } } } void get_extend(char *s, char *t, int *nxt, int *extend) { int n = strlen(s), m = strlen(t), pos = 0, r; while (s[extend[0]] == t[extend[0]]) ++extend[0]; r = extend[0] - 1; for (int i = 1; i < n; ++i) { extend[i] = max(0, min(nxt[i - pos], r - i + 1)); while (i + extend[i] < n && extend[i] < m && s[i + extend[i]] == t[extend[i]]) ++extend[i]; if (i + extend[i] - 1 > r) { r = i + extend[i] - 1; pos = i; } } } int a[N << 2]; int tag[N << 2]; void pushdown(int x) { a[(x << 1)] = (a[(x << 1)] + tag[x]) % mod; tag[(x << 1)] = (tag[(x << 1)] + tag[x]) % mod; a[(x << 1 | 1)] = (a[(x << 1 | 1)] + tag[x]) % mod; tag[(x << 1 | 1)] = (tag[(x << 1 | 1)] + tag[x]) % mod; tag[x] = 0; } void add(int x, int l, int r, int ll, int rr, int p) { if (ll > rr) return; if (l >= ll && r <= rr) { a[x] = (a[x] + p) % mod; tag[x] = (tag[x] + p) % mod; } else { if (tag[x]) pushdown(x); if (((l + r) >> 1) >= ll) add((x << 1), l, ((l + r) >> 1), ll, rr, p); if (((l + r) >> 1) < rr) add((x << 1 | 1), ((l + r) >> 1) + 1, r, ll, rr, p); } } int query(int x, int l, int r, int pos) { if (pos == -1) return 1; if (l == r) return a[x]; else { if (tag[x]) pushdown(x); if (pos <= ((l + r) >> 1)) return query((x << 1), l, ((l + r) >> 1), pos); else return query((x << 1 | 1), ((l + r) >> 1) + 1, r, pos); } } int sum[N]; int now; int main() { scanf( %s %s %s , str, s[0], s[1]); int len = strlen(str); int lenl = strlen(s[0]); int lenr = strlen(s[1]); int f = (lenl == 1 && s[0][0] == 0 ); get_nxt(s[0], nxt[0]); get_nxt(s[1], nxt[1]); get_extend(str, s[0], nxt[0], extend[0]); get_extend(str, s[1], nxt[1], extend[1]); int now = 1; sum[0] = mod - 1; for (int i = 0; i < len; ++i) { int l, r; if (str[i] == 0 ) { if (f) l = r = i; else { now = (now + sum[i]) % mod; continue; } } else { l = i + lenl - 1; if (extend[0][i] != lenl && s[0][extend[0][i]] > str[i + extend[0][i]]) ++l; r = i + lenr - 1; if (extend[1][i] != lenr && (s[1][extend[1][i]] < str[i + extend[1][i]])) --r; } sum[l] = (sum[l] + now) % mod; sum[r + 1] = (sum[r + 1] - now + mod) % mod; now = (now + sum[i]) % mod; } printf( %d n , now); return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, t; std::vector<pair<long long, long long> > v; long long dp[(1 << 15) + 5][226][4]; long long solve(long long x, long long y, long long z) { if (x == 0) return 1; if (x < 0) return 0; if (dp[y][x][z] != -1) return dp[y][x][z]; long long ans = 0; for (long long i = 0; i < n; i++) { if (v[i].second != z and (y & (1 << i))) { ans = (ans + (solve(x - v[i].first, y - (1 << i), v[i].second)) % 1000000007) % 1000000007; } } dp[y][x][z] = ans; return dp[y][x][z] % 1000000007; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> t; long long t1, t2; for (long long i = 0; i < (1 << 15) + 5; i++) for (long long j = 0; j < 226; j++) for (long long k = 0; k < 4; k++) dp[i][j][k] = -1; for (long long i = 0; i < n; i++) { cin >> t1 >> t2; v.push_back(make_pair(t1, t2)); } cout << solve(t, (1 << n) - 1, 0); return 0; } |
#include <bits/stdc++.h> using namespace std; map<pair<int, int>, pair<int, int> > p; int res[100 + 10][100 + 10]; int main() { int n, m, q, k, d, t, tem1, tem2, tem3, tem4, y = 1, sum = 0, ans = 0; string s, c; scanf( %d%d%d , &n, &m, &q); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { p[{i, j}] = {i, j}; } } for (int i = 0; i < q; i++) { scanf( %d%d , &tem1, &tem2); tem2--; if (tem1 != 3) { if (tem1 == 1) { pair<int, int> here = p[{tem2, 0}]; for (int j = 0; j < m - 1; j++) { p[{tem2, j}] = p[{tem2, j + 1}]; } p[{tem2, m - 1}] = here; } else { pair<int, int> here = p[{0, tem2}]; for (int j = 0; j < n - 1; j++) { p[{j, tem2}] = p[{j + 1, tem2}]; } p[{n - 1, tem2}] = here; } } else { scanf( %d%d , &tem3, &tem4); tem3--; pair<int, int> here = p[{tem2, tem3}]; res[here.first][here.second] = tem4; } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { printf( %d , res[i][j]); } printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int d[1000], q[1000], l[1000], r[1000], p[1000]; vector<int> dd[1000]; int main() { int n; cin >> n; int i, j; fill(d, d + n, -1); d[0] = 0, dd[0].push_back(0); int x = 0, z; while ((1 << x) < n) x++; for (i = 1; i < n; i++) l[i] = 1, r[i] = (1 << x) - 1; for (; x >= 1; x--) { for (z = 0; z < 2; z++) { for (i = 0; i < n; i++) q[i] = 0; for (i = (z << x); i < n; i += (1 << (x + 1))) { for (j = 0; j < dd[i].size(); j++) q[dd[i][j]] = (1 << (x - 1)); } string s, s2; cout << ? ; for (i = 0; i < n; i++) cout << << q[i]; cout << endl; cin >> s; cout << ? ; for (i = 0; i < n; i++) { if (q[i] > 0) q[i]--; cout << << q[i]; } cout << endl; cin >> s2; for (i = 0; i < n; i++) { if ((d[i] != -1) || (((l[i] >> x) & 1) != z)) continue; if (s[i] != s2[i]) d[i] = (l[i] + r[i]) / 2, dd[d[i]].push_back(i); else if (s[i] == 1 ) r[i] = (l[i] + r[i]) / 2 - 1; else l[i] = (l[i] + r[i]) / 2 + 1; } } } for (z = 0; z < 3; z++) { vector<int> v; for (i = 0; i < n; i++) { if ((d[i] % 3) == z) v.push_back(i); } for (i = 0; (1 << i) < v.size(); i++) { for (j = 0; j < n; j++) q[j] = 0; for (j = 0; j < v.size(); j++) { if (j & (1 << i)) q[v[j]] = 1; } string s; cout << ? ; for (j = 0; j < n; j++) cout << << q[j]; cout << endl; cin >> s; for (j = 0; j < n; j++) { if (((d[j] % 3) == ((z + 1) % 3)) && (s[j] == 1 )) p[j] |= (1 << i); } } for (i = 0; i < n; i++) { if ((i > 0) && ((d[i] % 3) == ((z + 1) % 3))) p[i] = v[p[i]]; } } cout << ! << endl; for (i = 1; i < n; i++) cout << p[i] + 1 << << i + 1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; struct square { int r1, c1, r2, c2; square(int R1, int C1, int R2, int C2) { r1 = R1; c1 = C1; r2 = R2; c2 = C2; } bool same(int R1, int C1, int R2, int C2) { if (R1 != r1) return false; if (C1 != c1) return false; if (R2 != r2) return false; if (C2 != c2) return false; return true; } bool in(int x, int y) { if (r1 <= x && x <= r2 && c1 <= y && y <= c2) return true; return false; } }; vector<square *> S; int main(void) { int n, m, q; scanf( %d %d %d , &n, &m, &q); while (q--) { int op; scanf( %d , &op); int r1, c1, r2, c2; scanf( %d %d %d %d , &r1, &c1, &r2, &c2); if (op == 1) { square *s = new square(r1, c1, r2, c2); S.push_back(s); } else if (op == 2) { int size = S.size(); for (int i = 0; i < size; i++) { square *s = S[i]; if (s->same(r1, c1, r2, c2)) { S.erase(S.begin() + i); break; } } } else if (op == 3) { bool find = false; for (square *s : S) if (s->in(r1, c1) != s->in(r2, c2)) { printf( No n ); find = true; break; } if (!find) printf( Yes n ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 333333; int ans[maxn]; int fa[maxn]; int nx[maxn]; int visit[maxn]; int n, m; inline int query(int a) { return a == fa[a] ? a : fa[a] = query(fa[a]); } inline void conbine(int a, int b) { a = query(a), b = query(b); if (a != b) fa[a] = b; } inline void paint(int l, int r, int x) { int i = l; while (i <= r) { int a = query(i); int j = nx[a]; if (j > r) return; if (ans[j] == 0) ans[j] = x; int b = query(j + 1); int _nx = nx[b]; conbine(a, b); nx[query(a)] = _nx; i = _nx; } } int main() { int n, m; while (scanf( %d%d , &n, &m) != EOF) { for (int i = 0; i <= n + 1; ++i) fa[i] = nx[i] = i, ans[i] = 0; for (int i = 0; i < m; ++i) { int l, r, x; scanf( %d%d%d , &l, &r, &x); paint(l, x - 1, x); paint(x + 1, r, x); } for (int i = 1; i <= n; ++i) { int tmp = ans[i]; printf( %d , tmp); if (i == n) printf( n ); else printf( ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int M = 1000000007; const int MM = 998244353; const long double PI = acos(-1); const long long INF = 2e18; template <typename T, typename T1> void amax(T &a, T1 b) { if (b > a) a = b; } template <typename T, typename T1> void amin(T &a, T1 b) { if (b < a) a = b; } long long power(long long b, long long e) { if (e == 0) return 1; if (e & 1) return b * power(b * b, e / 2); return power(b * b, e / 2); } long long power(long long b, long long e, long long m) { if (e == 0) return 1; if (e & 1) return b * power(b * b % m, e / 2, m) % m; return power(b * b % m, e / 2, m); } long long modinv(long long a, long long m) { return power(a, m - 2, m); } int TLE_TERROR() { long long n, ans = 0; cin >> n; long long a[n], c[n + 1]; memset(c, 0, sizeof(c)); for (long long i = 0; i < n; i++) { cin >> a[i]; ans ^= a[i]; } for (long long i = 2; i <= n; i++) { long long z = n / i; c[i - 1] += z; z *= i; long long zz = n - z; c[zz]++; } for (long long i = n - 1; i >= 0; i--) c[i] += c[i + 1]; for (long long i = 1; i <= n; i++) { if (c[i] % 2 != 0) ans ^= i; } cout << ans; return 0; } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); long long int TESTS = 1; while (TESTS--) TLE_TERROR(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, m; int s, p, i, j, k, z; string s1, s2; int const md = 1000000; stack<char> st; int a[5]; int main() { int k1 = 0, k2 = 0, k3 = 0; cin >> k1 >> k2; for (i = 1; i <= k1; i++) { cin >> k3; n = n * k2 + k3; } cin >> k1 >> k2; for (i = 1; i <= k1; i++) { cin >> k3; m = m * k2 + k3; } if (n > m) cout << > ; else if (n < m) cout << < ; else cout << = ; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; inline long long read() { long long k = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { k = k * 10 + ch - 0 ; ch = getchar(); } return k * f; } long long n, h, w, minx = 0, maxx = 0, miny = 0, maxy = 0, ans; long long a[500010], b[500010]; char s[500010]; inline void shuchu() { printf( %lld , ans); exit(0); } signed main() { n = read(); h = read(); w = read(); scanf( %s , s + 1); long long cnt = 0, x = 0, y = 0, cc = 0; for (long long i = 1; i <= n; i++) { cnt++; if (s[i] == U ) x--; if (s[i] == D ) x++; if (s[i] == L ) y--; if (s[i] == R ) y++; if (x < minx) minx = x, ans = (ans + cnt * w) % MOD, h--; if (x > maxx) maxx = x, ans = (ans + cnt * w) % MOD, h--; if (y < miny) miny = y, ans = (ans + cnt * h) % MOD, w--; if (y > maxy) maxy = y, ans = (ans + cnt * h) % MOD, w--; if (h == 0 || w == 0) shuchu(); } if (x == 0 && y == 0) return puts( -1 ) & 0; for (long long i = 1; i <= n; i++) { cnt++; if (s[i] == U ) x--; if (s[i] == D ) x++; if (s[i] == L ) y--; if (s[i] == R ) y++; if (x < minx) minx = x, ans = (ans + cnt * w) % MOD, h--, a[++cc] = 1, b[cc] = cnt % n; if (x > maxx) maxx = x, ans = (ans + cnt * w) % MOD, h--, a[++cc] = 2, b[cc] = cnt % n; if (y < miny) miny = y, ans = (ans + cnt * h) % MOD, w--, a[++cc] = 3, b[cc] = cnt % n; if (y > maxy) maxy = y, ans = (ans + cnt * h) % MOD, w--, a[++cc] = 4, b[cc] = cnt % n; if (h == 0 || w == 0) shuchu(); if (cc && b[cc] == 0) b[cc] = n; } long long p = 2, i = 1; while (h != 0 && w != 0) { if (a[i] == 1 || a[i] == 2) ans = (ans + (p * n % MOD + b[i]) * w) % MOD, h--; if (a[i] == 3 || a[i] == 4) ans = (ans + (p * n % MOD + b[i]) * h) % MOD, w--; if (i == cc) i = 1, p++; else i++; } shuchu(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MN = 1e4 + 20; vector<int> adj[MN], topo; vector<pair<int, int>> edge; int scc, st, s[MN], h[MN], t[MN]; bool os[MN]; stack<int> ms; int n, m; void add(int u, int v) { adj[u + m].push_back(v); adj[v + m].push_back(u); adj[u].push_back(v + m); adj[v].push_back(u + m); } void dfs(int v) { os[v] = 1; s[v] = h[v] = ++st; ms.push(v); for (int i : adj[v]) { if (!s[i]) dfs(i); if (os[i]) h[v] = min(h[v], h[i]); } if (h[v] == s[v]) { for (int i = ms.top();; i = ms.top()) { ms.pop(); os[i] = 0; h[i] = h[v]; t[i] = topo.size(); if (i == v) break; } scc++; topo.push_back(h[v]); } } int main() { cin >> n >> m; for (int i = 0; i < m; i++) { int u, v; cin >> u >> v; u--; v--; if (v > u) swap(u, v); for (int j = 0; j < i; j++) { if (u == edge[j].first || u == edge[j].second || v == edge[j].first || v == edge[j].second) continue; if ((u < edge[j].first && u > edge[j].second) ^ (v < edge[j].first && v > edge[j].second)) add(i, j); } edge.push_back({u, v}); } for (int i = 0; i < 2 * m; i++) if (!s[i]) dfs(i); reverse(topo.begin(), topo.end()); for (int i = 0; i < m; i++) { if (h[i] == h[i + m]) return cout << Impossible , 0; } for (int i = 0; i < m; i++) { t[i] < t[i + m] ? cout << i : cout << o ; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct Edge { int u, v, cap, cost, next; } edge[555 * 1111]; int head[555]; int NV, NE, vs, vt; void addEdge(int u, int v, int cap, int cost) { edge[NE].u = u; edge[NE].v = v; edge[NE].cap = cap; edge[NE].cost = cost; edge[NE].next = head[u]; head[u] = NE++; edge[NE].u = v; edge[NE].v = u; edge[NE].cap = 0; edge[NE].cost = -cost; edge[NE].next = head[v]; head[v] = NE++; } bool vis[555]; int d[555], pre[555]; bool SPFA() { for (int i = 0; i < NV; ++i) { vis[i] = 0; d[i] = (1 << 30); } vis[vs] = 1; d[vs] = 0; queue<int> que; que.push(vs); while (!que.empty()) { int u = que.front(); que.pop(); for (int i = head[u]; i != -1; i = edge[i].next) { int v = edge[i].v; if (edge[i].cap && d[v] > d[u] + edge[i].cost) { d[v] = d[u] + edge[i].cost; pre[v] = i; if (!vis[v]) { vis[v] = 1; que.push(v); } } } vis[u] = 0; } return d[vt] != (1 << 30); } int MCMF() { int res = 0; while (SPFA()) { int flow = (1 << 30), cost = 0; for (int u = vt; u != vs; u = edge[pre[u]].u) { flow = min(flow, edge[pre[u]].cap); } for (int u = vt; u != vs; u = edge[pre[u]].u) { edge[pre[u]].cap -= flow; edge[pre[u] ^ 1].cap += flow; cost += flow * edge[pre[u]].cost; } res += cost; } return res; } int tn, ch[55500][26], fail[55500]; vector<int> vec[55500]; void insert(char *s, int k) { int x = 0; for (int i = 0; s[i]; ++i) { int y = s[i] - a ; if (ch[x][y] == 0) ch[x][y] = ++tn; x = ch[x][y]; } vec[x].push_back(k); } void getfail() { queue<int> que; for (int i = 0; i < 26; ++i) { if (ch[0][i]) que.push(ch[0][i]); } while (!que.empty()) { int x = que.front(); que.pop(); for (int i = 0; i < 26; ++i) { if (ch[x][i]) { fail[ch[x][i]] = ch[fail[x]][i]; que.push(ch[x][i]); } else ch[x][i] = ch[fail[x]][i]; } } } int val[111], len[111]; void ac(char *s) { int x = 0; for (int i = 0; s[i]; ++i) { int y = s[i] - a ; x = ch[x][y]; for (int tmp = x; tmp; tmp = fail[tmp]) { for (int j = 0; j < vec[tmp].size(); ++j) { int k = vec[tmp][j]; addEdge(i - len[k] + 1, i + 1, 1, -val[k]); } } } } char S[555], T[555]; int main() { int n, m, x; scanf( %d%s%d , &n, S, &m); for (int i = 1; i <= m; ++i) { scanf( %s%d , T, val + i); len[i] = strlen(T); insert(T, i); } scanf( %d , &x); vs = n + 1; vt = vs + 1; NV = vt + 1; NE = 0; memset(head, -1, sizeof(head)); addEdge(vs, 0, x, 0); addEdge(n, vt, x, 0); for (int i = 1; i <= n; ++i) { addEdge(i - 1, i, (1 << 30), 0); } getfail(); ac(S); printf( %d , -MCMF()); return 0; } |
#include <bits/stdc++.h> using namespace std; int x; int f(int a, int b) { return (a * b + 1) / 2; } bool ok(int n) { if (x == 3 && n == 3) return false; if (n % 2 == 0 && x % 4) return false; if (n % 2 == 0) { if (x / 4 <= f(n / 2 - 1, n / 2 - 1)) return true; return false; } int z = f(n, n); if (x > z) return false; return true; } int main() { cin >> x; for (int i = (int)(1), _n = (int)(100000); i < _n; i++) if (ok(i)) { cout << i << endl; break; } { int _; cin >> _; } } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long cdiff, d, diff, rem, c, n, m, i, k = 0, j, flag = 0, x, minstep = 10000000000; cin >> n; long long b[n]; for (i = 0; i < n; i++) cin >> b[i]; if (n < 3) cout << 0 ; else { cdiff = b[0] - b[n - 1]; diff = abs(b[0] - b[n - 1]); rem = diff % (n - 1); d = cdiff / (n - 1); if (rem > 2 && rem < n - 3) cout << -1 << endl; else { if (rem == 2 || rem == 0 || rem == 1) { c = 0; flag = 0; for (i = 0; i < n; i++) { if (b[i] - (b[0] - (i * d)) > 1 || b[i] - (b[0] - (i * d)) < -1) { flag = 1; break; } else if (b[i] - (b[0] - (i * d)) != 0) { c++; } } if (flag == 0) minstep = min(c, minstep); } if (rem == 2 || rem == 0 || rem == 1) { c = 0; flag = 0; for (i = 0; i < n; i++) { if (b[i] - (b[0] + 1 - (i * d)) > 1 || b[i] - (b[0] + 1 - (i * d)) < -1) { flag = 1; break; } else if (b[i] - (b[0] + 1 - (i * d)) != 0) { c++; } } if (flag == 0) minstep = min(c, minstep); } if (rem == 2 || rem == 0 || rem == 1) { c = 0; flag = 0; for (i = 0; i < n; i++) { if (b[i] - (b[0] - 1 - (i * d)) > 1 || b[i] - (b[0] - 1 - (i * d)) < -1) { flag = 1; break; } else if (b[i] - (b[0] - 1 - (i * d)) != 0) { c++; } } if (flag == 0) minstep = min(c, minstep); } if (cdiff > 0) x = 1; else if (cdiff < 0) x = -1; else x = 0; d = (cdiff / (n - 1)) + x; if (rem == n - 2 || rem == n - 3) { c = 0; flag = 0; for (i = 0; i < n; i++) { if (b[i] - (b[0] - (i * d)) > 1 || b[i] - (b[0] - (i * d)) < -1) { flag = 1; break; } else if (b[i] - (b[0] - (i * d)) != 0) { c++; } } if (flag == 0) minstep = min(c, minstep); } if (rem == n - 3 || rem == n - 2) { c = 0; flag = 0; for (i = 0; i < n; i++) { if (b[i] - (b[0] + 1 - (i * d)) > 1 || b[i] - (b[0] + 1 - (i * d)) < -1) { flag = 1; break; } else if (b[i] - (b[0] + 1 - (i * d)) != 0) { c++; } } if (flag == 0) minstep = min(c, minstep); } if (rem == n - 3 || rem == n - 2) { c = 0; flag = 0; for (i = 0; i < n; i++) { if (b[i] - (b[0] - 1 - (i * d)) > 1 || b[i] - (b[0] - 1 - (i * d)) < -1) { flag = 1; break; } else if (b[i] - (b[0] - 1 - (i * d)) != 0) { c++; } } if (flag == 0) minstep = min(c, minstep); } if (minstep == 10000000000) cout << -1 << endl; else cout << minstep << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; inline int get_power(int a, int n) { int res = 1; while (n > 0) { res = n & 1 ? 1ll * res * a % mod : res; a = 1ll * a * a % mod; n >>= 1; } return res; } inline int get_inv(int x) { return get_power(x, mod - 2); } inline int C2(int x) { return (x * (x - 1ll) >> 1) % mod; } const int max_n = 2e3 + 5; int power_p[max_n], power_q[max_n]; int f[max_n], g[max_n], h[max_n][max_n]; int main() { int n, a, b; scanf( %d%d%d , &n, &a, &b); int p = 1ll * a * get_inv(b) % mod; power_p[0] = power_q[0] = 1; for (int i = 1; i <= n; ++i) { power_p[i] = 1ll * power_p[i - 1] * p % mod; power_q[i] = power_q[i - 1] * (mod + 1ll - p) % mod; } h[1][0] = h[1][1] = 1; for (int i = 2; i <= n; ++i) for (int j = 0; j <= i; ++j) h[i][j] = (1ll * h[i - 1][j] * power_p[j] + (j > 0 ? 1ll * h[i - 1][j - 1] * power_q[i - j] : 0)) % mod; for (int i = 1; i <= n; ++i) { g[i] = 1; for (int j = 1; j <= i - 1; ++j) { g[i] -= 1ll * g[j] * h[i][j] % mod; g[i] += g[i] < 0 ? mod : 0; } } for (int i = 1; i <= n; ++i) { f[i] = 1ll * g[i] * h[i][i] % mod * C2(i) % mod; for (int j = 1; j <= i - 1; ++j) f[i] = (f[i] + 1ll * g[j] * h[i][j] % mod * (1ll * f[j] + f[i - j] + C2(i) - C2(i - j) + mod)) % mod; f[i] = 1ll * f[i] * get_inv(mod + 1 - 1ll * g[i] * h[i][i] % mod) % mod; } printf( %d n , f[n]); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << : << arg1 << endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cerr.write(names, comma - names) << : << arg1 << | ; __f(comma + 1, args...); } int main() { int n, m; cin >> n >> m; vector<vector<char> > table(n + 1, vector<char>(m + 1)); int row = 0, col = 0, count = 0; for (int i = 1; i <= n; i++) { string tmp; cin >> tmp; for (int j = 0; j < tmp.length(); j++) { table[i][j + 1] = tmp[j]; } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (table[i][j] == B ) { count++; row += i; col += j; } } } row /= count; col /= count; cout << row << << col << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> T gcd(T a, T b) { if (a < b) { swap(a, b); } T t; while (b > 0) { t = a % b; a = b; b = t; } return a; } template <class T> T gcdL(vector<T>& v) { int l = v.size(); if (l == 1) return v[0]; T g = gcd(v[0], v[1]); for (int i = 2; i < l; i++) { g = gcd(g, v[i]); } return g; } long long foo(long long x) { while (x % 2 == 0) x /= 2; while (x % 3 == 0) x /= 3; return x; } bool ok(vector<long long>& v) { for (int i = 0; i < (int)v.size(); i++) { v[i] = foo(v[i]); } for (int i = 0; i < (int)v.size(); i++) { if (v[i] == 1) continue; else return 0; } return 1; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout << setprecision(10); long long n, x; vector<long long> v; cin >> n; for (int i = 0; i < n; i++) { cin >> x; v.push_back(x); } long long g = gcdL(v); for (int i = 0; i < n; i++) { v[i] /= g; } if (ok(v)) cout << Yes ; else cout << No ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n = 0, input = 0, temp = 0, sum = 0, c = 0; cin >> n; for (int i = 0; i < 2 * n; i++) { cin >> temp; } if (sum % 2 == 0) { cout << Karen ; } else cout << Koyomi ; } |
#include <bits/stdc++.h> using namespace std; int main() { int K; vector<int> a(5, 0); for (int i = 0; i < 5; i++) cin >> a[i]; cin >> K; vector<int> b(K); for (int i = 0; i < K; i++) { string temp; cin >> temp; if (temp == XXL ) b[i] = 4; else if (temp == XL ) b[i] = 3; else if (temp == L ) b[i] = 2; else if (temp == M ) b[i] = 1; else b[i] = 0; } for (int i = 0; i < K; i++) { if (a[b[i]] > 0) { a[b[i]]--; } else { if (b[i] + 1 < 5 && a[b[i] + 1] > 0) { b[i]++; a[b[i]] -= 1; } else if (b[i] - 1 >= 0 && a[b[i] - 1] > 0) { b[i]--; a[b[i]] -= 1; } else if (b[i] + 2 < 5 && a[b[i] + 2] > 0) { b[i] += 2; a[b[i]] -= 1; } else if (b[i] - 2 >= 0 && a[b[i] - 2] > 0) { b[i] -= 2; a[b[i]] -= 1; } else if (b[i] + 3 < 5 && a[b[i] + 3] > 0) { b[i] += 3; a[b[i]] -= 1; } else if (b[i] - 3 >= 0 && a[b[i] - 3] > 0) { b[i] -= 3; a[b[i]] -= 1; } else if (b[i] + 4 < 5 && a[b[i] + 4] > 0) { b[i] += 4; a[b[i]] -= 1; } else if (b[i] - 4 >= 0 && a[b[i] - 4] > 0) { b[i] -= 4; a[b[i]] -= 1; } } } for (int i = 0; i < K; i++) { if (b[i] == 4) cout << XXL << endl; else if (b[i] == 3) cout << XL << endl; else if (b[i] == 2) cout << L << endl; else if (b[i]) cout << M << endl; else cout << S << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int output(int n) { int sum = 0; while (n != 1) { int i; for (i = 2; i * i <= n; i++) if (n % i == 0) { sum += n; n /= i; break; } if (i * i > n) { sum += n; break; } } return ++sum; } int main() { int t; t = 1; while (t--) { int n; cin >> n; cout << output(n) << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const double EPS = 1e-9; long long a, b, c, s; long long gao(long long a, long long b, long long xl, long long xr) { if (xl > xr) return 0; if (a * xl + b < 0 && a * xr + b < 0) return 0; double key = -b * 1.0 / a; long long keyx; if (a > 0) { keyx = (key - EPS); keyx++; } else { keyx = (key + EPS); } if (a * xl + b < 0) { xl = keyx; } if (a * xr + b < 0) { xr = keyx; } long long ans = b * (xr - xl + 1); long long tmp = (xr + xl) * (xr - xl + 1) / 2; ans += tmp * a; return ans; } long long first_old(long long a, long long b, long long c) { long long ans = 0; long long i1, i2; long long jl, jr; long long tmp, oldAns; for (long long x = 0; x <= s; x++) { tmp = 0; oldAns = ans; long long keyi = min(a + x - b, s - x); if (keyi < 0) continue; i1 = a + x + 1 - b - c; i2 = s - 2 * x - a + c; i1 = min(keyi, i1); i2 = min(keyi, i2); if (i1 < 0 && i2 < 0) { jl = 0; jr = keyi; ans += gao(-1, s - x + 1, jl, jr); } else if (i1 < 0) { jl = 0; jr = i2; ans += gao(0, a + x - c + 1, jl, jr); jl = i2 + 1; jr = keyi; ans += gao(-1, s - x + 1, jl, jr); } else if (i2 < 0) { jl = 0; jr = i1; ans += gao(0, s - 2 * x - a - 1 + b + c + 1, jl, jr); jl = i1 + 1; jr = keyi; ans += gao(-1, s - x + 1, jl, jr); } else { if (i1 == i2) { jl = 0; jr = i1; ans += gao(1, b - 1 + 1, jl, jr); jl = i1 + 1; jr = keyi; ans += gao(-1, s - x + 1, jl, jr); } else if (i1 < i2) { jl = 0; jr = i1; ans += gao(1, b - 1 + 1, jl, jr); jl = i1 + 1; jr = i2; ans += gao(0, a + x - c + 1, jl, jr); jl = i2 + 1; jr = keyi; ans += gao(-1, s - x + 1, jl, jr); } else { jl = 0; jr = i2; ans += gao(1, b - 1 + 1, jl, jr); jl = i2 + 1; jr = i1; ans += gao(0, s - 2 * x - a - 1 + b + c + 1, jl, jr); jl = i1 + 1; jr = keyi; ans += gao(-1, s - x + 1, jl, jr); } } } return ans; } long long first(long long a, long long b, long long c) { long long ans = 0; for (long long x = 0; x <= s; x++) { if (b > a + x || c > a + x) continue; long long tmp = (s - x + 2) * (s - x + 1) / 2; if (s - x - (a + x + 1 - b) >= 0) tmp -= (s - x - (a + x + 1 - b) + 2) * (s - x - (a + x + 1 - b) + 1) / 2; if (s - x - (a + x + 1 - c) >= 0) tmp -= (s - x - (a + x + 1 - c) + 2) * (s - x - (a + x + 1 - c) + 1) / 2; if (s - x - (a + x + 1 - b) - (a + x + 1 - c) >= 0) { tmp += (s - x - (a + x + 1 - b) - (a + x + 1 - c) + 2) * (s - x - (a + x + 1 - b) - (a + x + 1 - c) + 1) / 2; } long long sum = a + x - b - c; if (sum >= 0) { sum = min(sum, s - x); tmp -= (sum + 2) * (sum + 1) / 2; } ans += tmp; } return ans; } long long second(long long a, long long b, long long c) { long long ans = 0; for (long long i = max(a, b);; i++) { if (i < c) continue; long long t = i - a + i - b; t = s - t; if (t < 0) break; if (c + t > i) { ans += i - c + 1; } else { ans += t + 1; } } return ans; } long long third(long long a, long long b, long long c) { long long ans = 0; long long t = max(a, b); t = max(t, c); for (long long i = t;; i++) { long long used = 3 * i - a - b - c; if (used > s) break; ans++; } return ans; } void solve_old() { long long ans = 0; ans += first(a, b, c); ans += first(b, a, c); ans += first(c, a, b); ans -= second(a, b, c); ans -= second(b, c, a); ans -= second(a, c, b); ans += third(a, b, c); printf( %I64d n , ans); } long long new_first(long long a, long long b, long long c) { long long ans = 0; for (long long x = 0; x <= s; x++) { if (a + x - b - c < 0) continue; long long tmp = min(a + x - b - c, s - x); ans += (tmp + 2) * (tmp + 1) / 2; } return ans; } long long new_second(long long a, long long b, long long c) { long long ans = 0; for (long long x = max(a, b);; x++) { if (x - a + x - b > s) break; long long tmp = s - (x - a + x - b); if (2 * x - c > 0) tmp -= (2 * x - c); if (tmp >= 0) ans += tmp + 1; } return ans; } void solve() { long long ans = (s + 3) * (s + 2) * (s + 1) / 6; ans -= new_first(a, b, c); ans -= new_first(b, a, c); ans -= new_first(c, a, b); printf( %I64d n , ans); } int main() { while (scanf( %I64d%I64d%I64d%I64d , &a, &b, &c, &s) != EOF) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; struct node { long long l, r; int now; vector<pair<int, int> > v; } st[250005 * 4]; int pi, ri, n, N; int p[250005], m[250005]; long long r, sp[250005]; pair<long long, int> d[250005]; queue<int> q; vector<long long> rr; bool vis[250005]; void init(int id, int l, int r) { if (l == r) { st[id].l = rr[l - 1] + 1; st[id].r = rr[l]; int L = lower_bound(d + 2, d + n + 2, make_pair(rr[l - 1] + 1, 0)) - d; int R = upper_bound(d + 2, d + n + 2, make_pair(rr[l], 1000000000)) - d; for (int i = L; i < R; i++) { st[id].v.push_back(make_pair(m[d[i].second], d[i].second)); } sort(st[id].v.begin(), st[id].v.end()); return; } int mid = l + r >> 1; init(id * 2, l, mid); init(id * 2 + 1, mid + 1, r); st[id].l = st[id * 2].l; st[id].r = st[id * 2 + 1].r; st[id].v.insert(st[id].v.begin(), st[id * 2].v.begin(), st[id * 2].v.end()); st[id].v.insert(st[id].v.end(), st[id * 2 + 1].v.begin(), st[id * 2 + 1].v.end()); sort(st[id].v.begin(), st[id].v.end()); } void query(int id, int l, int r, long long L, long long R, int p) { if (R < st[id].l || st[id].r < L) return; if (L <= st[id].l && st[id].r <= R) { int len = st[id].v.size(); while (st[id].now < len && st[id].v[st[id].now].first <= p) { if (!vis[st[id].v[st[id].now].second]) q.push(st[id].v[st[id].now].second); vis[st[id].v[st[id].now].second] = 1; st[id].now++; } return; } int mid = l + r >> 1; query(id * 2, l, mid, L, R, p); query(id * 2 + 1, mid + 1, r, L, R, p); } int main() { long long x, y, xi, yi; scanf( %I64d%I64d%d%I64d%d , &xi, &yi, &p[1], &r, &n); r *= r; sp[1] = r; rr.push_back(r); for (int i = 2; i <= n + 1; i++) { scanf( %I64d%I64d%d%d%I64d , &x, &y, &m[i], &p[i], &r); x -= xi; y -= yi; d[i].first = x * x + y * y; d[i].second = i; r *= r; sp[i] = r; rr.push_back(r); } rr.push_back(0); sort(rr.begin(), rr.end()); rr.resize(unique(rr.begin(), rr.end()) - rr.begin()); N = rr.size() - 1; sort(d + 2, d + n + 2); init(1, 1, N); q.push(1); while (!q.empty()) { int now = q.front(); q.pop(); query(1, 1, N, 1, sp[now], p[now]); } int cnt = 0; for (int i = 2; i <= n + 1; i++) { if (vis[i]) { cnt++; } } printf( %d n , cnt); } |
#include <bits/stdc++.h> using namespace std; int main() { string str; cin >> str; for (int i = 1; i < str.size() - 1; i++) { if (str[i + 1] != . && str[i - 1] != . && str[i] != . ) { if (str[i + 1] != str[i - 1] && str[i - 1] != str[i] && str[i + 1] != str[i]) { cout << Yes << endl; return 0; } } } cout << No << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 100; int mem[MAXN + 10]; int main() { int N; cin >> N; mem[0] = 0, mem[1] = 1, mem[2] = 2, mem[3] = 4; for (int i = 4; i <= N; ++i) { mem[i] = i + mem[i - 2]; } cout << mem[N] << n ; } |
#include <bits/stdc++.h> using namespace std; long long modexp(long long base, long long exp) { if (exp == 1) return base; else if (exp == 0) return 1; else { if (exp % 2 == 0) { long long base1 = pow(modexp(base, exp / 2), 2); if (base1 >= 1000000007) return base1 % 1000000007; else return base1; } else { long long ans = (base * pow(modexp(base, (exp - 1) / 2), 2)); if (ans >= 1000000007) return ans % 1000000007; else return ans; } } } long long gcd(long long a, long long b) { if (!a) return b; return gcd(b % a, a); } map<int, int> d; set<int> s; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; int a[n]; for (long long i = 0; i < n; ++i) cin >> a[i]; for (long long i = 0; i < n; ++i) d[a[i]]++; long long ans = 0; for (long long i = 0; i < n; ++i) { d[a[i]]--; if (!d[a[i]]) { d.erase(a[i]); } if (s.find(a[i]) == s.end()) { ans += d.size(); s.insert(a[i]); } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 100000 + 10; bool valid; int n, p[maxn], a[maxn], head, tail; int main() { int T; scanf( %d , &T); while (T--) { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d , &p[i]); a[p[i]] = i; } head = a[1], tail = n; valid = true; for (int i = 1; i <= n; ++i) { if (a[i] != a[i - 1] + 1 && a[i] != head) { valid = false; break; } if (a[i] == tail) { tail = head - 1; head = a[i + 1]; } } if (valid) puts( Yes ); else puts( No ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N=2e5+10; int a[N],tt; int cnt[N]; int pre[N]; int main(){ int t; scanf( %d ,&t); while(t--){ int n; tt=0; scanf( %d ,&n); for(int i=1;i<=n;i++) scanf( %d ,&a[i]); sort(a+1,a+n+1); for(int i=1;i<=n;i++){ if(a[i]==a[i-1]) cnt[tt]++; else{ tt++; cnt[tt]++; } } priority_queue<int>s; for(int i=1;i<=tt;i++) { s.push(cnt[i]); cnt[i]=0; } int sh=0; int ans; while(1){ if(s.size()==1) { ans = s.top(); break; } if(s.empty()){ ans=0; break; } int a=s.top(); s.pop(); int b=s.top(); s.pop(); a--; b--; if(a!=0) s.push(a); if(b!=0) s.push(b); } printf( %d n ,ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; while (cin >> t) { string a; cin >> a; int s = 0; for (int i = 0; i < t - 1;) { if (a.at(i) == a.at(i + 1)) { if (a.at(i) == a ) a.at(i) = b ; else a.at(i) = a ; s++; } i += 2; if (i >= a.size()) break; } cout << s << endl << a << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { vector<pair<long long, short> > mass; long n, k; scanf( %li %li , &n, &k); long long a, b; for (long i = 0; i < n; i++) { scanf( %I64d %I64d , &a, &b); mass.push_back(make_pair(a, -1)); mass.push_back(make_pair(b, 1)); } sort(mass.begin(), mass.end()); vector<pair<long long, long long> > ans(n); long long x = 0, balance = 0; for (long i = 0; i < n * 2; i++) { if (mass[i].second == -1 && balance == k - 1) ans[x].first = mass[i].first; if (balance == k && mass[i].second == 1) ans[x++].second = mass[i].first; balance -= mass[i].second; } printf( %I64d n , x); for (long i = 0; i < x; i++) printf( %I64d %I64d n , ans[i].first, ans[i].second); } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3fffffff; const long long _INF = 0x7ffffffffffffffll; const double EPS = 1e-9; const double PI = acos(-1.0); template <class T, class INT> inline T pow(T x, INT y) { T res(1); for (T tt(x); y; y /= 2) { if (y & 1) res *= tt; tt *= tt; } return res; } template <class T, class INT> inline T pow(T x, INT y, T p) { T res(1); for (T tt(x); y; y /= 2) { if (y & 1) res = res * tt % p; tt = tt * tt % p; } return res; } int toInt(string s) { int x = 0; istringstream sin(s); sin >> x; return x; } template <class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); } template <class INT> inline INT gcd(INT x, INT y) { return y ? gcd(y, x % y) : x; } template <class INT> inline int calc_bits(INT x) { return x ? (x & 1) + calc_bits(x >> 1) : 0; } int n, x, xx, y, yy, ans; int main(int argc, char* argv[]) { cin >> n >> x >> y >> xx >> yy; ans = abs(x - xx) + abs(y - yy); if (x == 0 && xx == n || x == n && xx == 0) ans += min(n - max(y, yy), min(y, yy)) * 2; if (y == 0 && yy == n || y == n && yy == 0) ans += min(n - max(x, xx), min(x, xx)) * 2; cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int n, m, a[1001][1001]; set<int> r[1001], c[1001]; map<int, int> r_m[1001], c_m[1001]; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { scanf( %d , &a[i][j]); r[i].insert(a[i][j]); c[j].insert(a[i][j]); } } for (int i = 1; i <= n; i++) { int w = 1; for (int x : r[i]) { r_m[i][x] = w; w++; } } for (int i = 1; i <= m; i++) { int w = 1; for (int x : c[i]) { c_m[i][x] = w; w++; } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { int x = r_m[i][a[i][j]]; int y = c_m[j][a[i][j]]; if (x > y) { printf( %d , max((int)r[i].size(), (int)c[j].size() + x - y)); } else { printf( %d , max((int)r[i].size() + y - x, (int)c[j].size())); } } printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = (int)(2e9); const long long linf = (long long)(2e18); void solve(); signed main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); cout << fixed << setprecision(20); solve(); return 0; } void solve() { int n = 8; unordered_map<char, int> w, W; w[ q ] = 9; w[ r ] = 5; w[ b ] = 3; w[ n ] = 3; w[ p ] = 1; w[ k ] = 0; w[ . ] = 0; w[ Q ] = 0; w[ R ] = 0; w[ B ] = 0; w[ N ] = 0; w[ P ] = 0; w[ K ] = 0; W[ q ] = 0; W[ r ] = 0; W[ b ] = 0; W[ n ] = 0; W[ p ] = 0; W[ k ] = 0; W[ . ] = 0; W[ Q ] = -9; W[ R ] = -5; W[ B ] = -3; W[ N ] = -3; W[ P ] = -1; W[ K ] = 0; int ans = 0; for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { char x; cin >> x; ans += (w[x] + W[x]); } } if (!ans) cout << Draw n ; else if (ans < 0) cout << White n ; else cout << Black n ; } |
#include <bits/stdc++.h> using namespace std; vector<int> v; int extgcd(int a, int b, long long &x, long long &y) { int d = a; if (b != 0) { d = extgcd(b, a % b, y, x); y -= (a / b) * x; } else { x = 1; y = 0; } return d; } int main() { int n; scanf( %d , &n); int i = 2; int t = n; while (t > 1 && i <= sqrt(n)) { if (t % i == 0) { while (t % i == 0) t /= i; v.push_back(i); } i++; } if (t > 1) v.push_back(t); if (v.size() == 1) { printf( NO n ); return 0; } int j; bool f = true; for (i = 0; i < v.size() && f; i++) for (j = i + 1; j < v.size(); j++) { long long p, q; extgcd(v[i], v[j], p, q); p *= n - 1; q *= n - 1; int a = v[i], b = v[j]; if (q < 0) { swap(a, b); swap(p, q); } long long t = (-p) / b + 1; p += b * t; q -= a * t; if (q > 0) { printf( YES n2 n ); printf( %d %d n%d %d n , (int)p, (int)n / a, (int)q, (int)n / b); f = false; break; } } if (f) printf( NO n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int a[5050]; int solve(int l, int r, int h) { int m, i; if (l > r) return 0; else if (l == r) return (a[l] > h); else for (i = m = l; i <= r; i++) if (a[m] > a[i]) m = i; return min(r - l + 1, a[m] - h + solve(l, m - 1, a[m]) + solve(m + 1, r, a[m])); } int main() { int i, j; int n; cin >> n; for (i = 0; i < n; i++) cin >> a[i]; cout << solve(0, n - 1, 0) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, m; cin >> n >> m; tuple<long long, long long, long long> arr[n - 1]; long long s1, e1; cin >> s1 >> e1; for (long long i = 0; i < n - 1; ++i) { long long s2, e2; cin >> s2 >> e2; arr[i] = make_tuple(e2 - s1 + 1, s2 - e1 - 1, i); s1 = s2, e1 = e2; } pair<long long, long long> blen1[m]; long long blen2[m]; for (long long i = 0; i < m; ++i) { long long b; cin >> b; blen1[i] = make_pair(b, i); blen2[i] = b; } sort(arr, arr + n - 1); sort(blen1, blen1 + m); sort(blen2, blen2 + m); pair<long long, long long> num_b[n - 1]; for (long long i = 0; i < n - 1; ++i) { long long end, start, idx, u = 0, l = 0; tie(end, start, idx) = arr[i]; l = upper_bound(blen2, blen2 + m, start) - blen2; u = lower_bound(blen2, blen2 + m, end) - blen2; if (u - l == 0) { cout << No << endl; return 0; } else { num_b[i] = make_pair(l, u); } } set<pair<long long, long long> > bg; for (long long i = 0; i < m; ++i) { bg.insert(blen1[i]); } long long ans[n - 1]; for (long long i = 0; i < n - 1; ++i) { long long u = num_b[i].second, l = num_b[i].first; set<pair<long long, long long> >::iterator itr = bg.upper_bound({blen2[l], -1}); if (itr == bg.end() || (u != m && (*itr).first >= blen2[u])) { cout << No << endl; return 0; } ans[get<2>(arr[i])] = (*itr).second + 1; bg.erase(itr); } cout << Yes << endl; for (long long i = 0; i < n - 1; ++i) { cout << ans[i] << ; } cout << endl; } |
#include <bits/stdc++.h> const long double pi = 3.141592654; using namespace std; int n, k; int dx[] = {0, 0, 1, -1, 1, -1, -1, 1}; int dy[] = {-1, 1, 0, 0, 1, 1, -1, -1}; bool valid(int r, int c) { return r >= 0 && c >= 0 && r < n && c < n; } char grid[120][120]; bool vis[100074]; vector<int> initial; vector<vector<int>> graph; int parent[100074]; void topological_sort(int student) { vis[student] = 1; for (auto child : graph[student]) { if (!vis[child]) topological_sort(child); } initial.push_back(student); } int main() { long long n; cin >> n; if (n == 2) { cout << 2; } else { if (n % 2 == 0) cout << 2; else cout << 1; } } |
#include <bits/stdc++.h> using namespace std; string s[9], v[35], k[35]; bool in[9]; int len, a[9], l[9], ans; char c[35][35]; bool check2() { if (ans == 0) return 1; for (int i = 1; i <= min(len, ans); i++) if (v[i] < k[i]) return 1; else if (v[i] > k[i]) return 0; if (len > ans) return 0; return 1; } void check() { if (l[a[1]] + l[a[3]] - 1 != l[a[2]]) return; if (l[a[4]] + l[a[6]] - 1 != l[a[5]]) return; if (s[a[1]][0] != s[a[4]][0]) return; if (s[a[4]][l[a[4]] - 1] != s[a[2]][0]) return; if (s[a[6]][0] != s[a[2]][l[a[2]] - 1]) return; if (s[a[6]][l[a[6]] - 1] != s[a[3]][l[a[3]] - 1]) return; if (s[a[5]][0] != s[a[1]][l[a[1]] - 1]) return; if (s[a[5]][l[a[5]] - 1] != s[a[3]][0]) return; if (s[a[5]][l[a[4]] - 1] != s[a[2]][l[a[1]] - 1]) return; for (int i = 1; i <= l[a[5]]; i++) for (int j = 1; j <= l[a[2]]; j++) c[i][j] = . ; for (int i = 0; i < l[a[1]]; i++) c[1][i + 1] = s[a[1]][i]; for (int i = 0; i < l[a[2]]; i++) c[l[a[4]]][i + 1] = s[a[2]][i]; for (int i = 0; i < l[a[3]]; i++) c[l[a[5]]][i + l[a[1]]] = s[a[3]][i]; for (int i = 0; i < l[a[4]]; i++) c[i + 1][1] = s[a[4]][i]; for (int i = 0; i < l[a[5]]; i++) c[i + 1][l[a[1]]] = s[a[5]][i]; for (int i = 0; i < l[a[6]]; i++) c[i + l[a[4]]][l[a[2]]] = s[a[6]][i]; len = l[a[5]]; for (int i = 1; i <= len; i++) { v[i] = ; for (int j = 1; j <= l[a[2]]; j++) v[i] += c[i][j]; } if (check2()) { ans = len; for (int i = 1; i <= len; i++) k[i] = v[i]; } } int main() { for (int i = 1; i <= 6; i++) cin >> s[i], l[i] = s[i].length(); for (a[1] = 1; a[1] <= 6; a[1]++) for (a[2] = 1; a[2] <= 6; a[2]++) for (a[3] = 1; a[3] <= 6; a[3]++) for (a[4] = 1; a[4] <= 6; a[4]++) for (a[5] = 1; a[5] <= 6; a[5]++) for (a[6] = 1; a[6] <= 6; a[6]++) { set<int> s1; s1.insert(a[1]); s1.insert(a[2]); s1.insert(a[3]); s1.insert(a[4]); s1.insert(a[5]); s1.insert(a[6]); if (s1.size() != 6) continue; check(); } if (ans == 0) printf( Impossible ); else for (int i = 1; i <= ans; i++) cout << k[i] << endl; } |
#include <bits/stdc++.h> using namespace std; template <class T1, class T2> inline istream& operator>>(istream& fin, pair<T1, T2>& pr) { fin >> pr.first >> pr.second; return fin; } template <class T0, class T1, class T2> inline istream& operator>>(istream& fin, tuple<T0, T1, T2>& t) { fin >> get<0>(t) >> get<1>(t) >> get<2>(t); return fin; } template <class T> inline istream& operator>>(istream& fin, vector<T>& a) { for (auto& u : a) fin >> u; return fin; } template <class T, size_t n> inline istream& operator>>(istream& fin, array<T, n>& a) { for (auto& u : a) fin >> u; return fin; } template <class FwdIter> inline auto dump(FwdIter first, FwdIter last, const char* dlm) -> void { copy(first, last, ostream_iterator<typename iterator_traits<FwdIter>::value_type>(cout, dlm)); } inline int64_t powmod(int64_t a, int64_t n, const int64_t mod) { if (a == 1 || !n) return mod != 1 ? 1 : 0; int64_t out = 1; for (; n; n >>= 1) { if (n & 1) out = out * a % mod; a = a * a % mod; } return out; } int64_t probB() { const int64_t mod = 1000000007; int64_t p, k; cin >> p >> k; if (k == 0) { return powmod(p, p - 1, mod); } vector<bool> tag(p, false); int64_t out = k == 1 ? p : 1; for (int64_t i = 1; i < p; ++i) if (!tag[i]) { out = (out * p) % mod; for (auto j = i; !tag[j]; j = (j * k) % p) tag[j] = true; } return out; } int main(const int argc, char* argv[]) { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout << probB(); return EXIT_SUCCESS; } |
#include <bits/stdc++.h> using namespace std; struct node { int left, right, size; } t[600000]; int n; int a[200005], b[200005], sa[200005], sb[200005], s[200005], ans[200005]; int readint() { 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; } void build(int id, int l, int r, int x) { t[id].left = l, t[id].right = r; if (l == r) return (void)(t[id].size = x); int mid = (l + r) / 2; build(id << 1, l, mid, x); build(id << 1 | 1, mid + 1, r, x); t[id].size = t[id << 1].size + t[id << 1 | 1].size; } int query(int id, int x) { if (t[id].left == t[id].right) return t[id].size; if (x <= t[id << 1].right) return query(id << 1, x); else return query(id << 1 | 1, x) + t[id << 1].size; } void change(int id, int x, int c) { if (t[id].left == t[id].right) return (void)(t[id].size = c); if (x <= t[id << 1].right) change(id << 1, x, c); else change(id << 1 | 1, x, c); t[id].size = t[id << 1].size + t[id << 1 | 1].size; } int find(int id, int x) { if (t[id].left == t[id].right) return t[id].left; if (x <= t[id << 1].size) return find(id << 1, x); else return find(id << 1 | 1, x - t[id << 1].size); } int main() { n = readint(); for (int i = 1; i <= n; i++) a[i] = readint() + 1; for (int i = 1; i <= n; i++) b[i] = readint() + 1; build(1, 1, n, 0); for (int i = n; i >= 1; i--) { sa[i] = query(1, a[i]); change(1, a[i], 1); } build(1, 1, n, 0); for (int i = n; i >= 1; i--) { sb[i] = query(1, b[i]); change(1, b[i], 1); } for (int i = n; i >= 1; i--) { s[i] += sa[i] + sb[i]; if (s[i] >= n - i + 1) s[i] -= n - i + 1, s[i - 1]++; } build(1, 1, n, 1); for (int i = 1; i <= n; i++) { ans[i] = find(1, s[i] + 1); change(1, ans[i], 0); } for (int i = 1; i <= n; i++) printf( %d , ans[i] - 1); printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int a[1000100], g[1000100]; int main() { for (int i = 1; i < 20; i++) { int msk = (1 << i) - 1; for (int j = (1 << i - 1); j < (1 << i); j++) { g[j] = (1 << i - 1) | g[j ^ msk]; } } int n, x; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); } for (int i = 19; i >= 0; i--) { vector<int> v, piv; for (int j = 0; j < n; j++) { if (a[j] >= (1 << i)) continue; int x = a[j]; for (int k = 0; k < v.size(); k++) { if (x & (piv[k] & -piv[k])) x ^= piv[k]; } if (x > 0) { v.push_back(a[j]); piv.push_back(x); } } if (v.size() == i) { printf( %d n , i); for (int j = 0; j < (1 << i); j++) { int x = 0; for (int k = 0; k < i; k++) { if (g[j] & (1 << k)) x ^= v[k]; } printf( %d , x); } puts( ); break; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 4e5 + 10; int n, a[MAX]; int f(int x) { vector<int> v(n); for (int i = 0; i < n; ++i) { v[i] = (a[i] == -1 ? x : a[i]); } int ret = 0; for (int i = 0; i < n - 1; ++i) { ret = max(ret, abs(v[i] - v[i + 1])); } return ret; } void solve() { cin >> n; for (int i = 0; i < n; ++i) cin >> a[i]; long long beg = 0, end = 1e9; while (end - beg > 3) { long long mid1 = (2 * beg + end) / 3; long long mid2 = (beg + 2 * end) / 3; int f1 = f(mid1); int f2 = f(mid2); if (f1 > f2) { beg = mid1 + 1; } else if (f1 <= f2) { end = mid2 - 1; } } int ans = 1e9, ind; for (int i = beg; i <= end; ++i) { int t = f(i); if (t < ans) { ans = t; ind = i; } } cout << ans << << ind << n ; } int main() { int q; cin >> q; while (q--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; inline void read(int &x) { int v = 0, f = 1; char c = getchar(); while (!isdigit(c) && c != - ) c = getchar(); if (c == - ) f = -1; else v = (c & 15); while (isdigit(c = getchar())) v = (v << 1) + (v << 3) + (c & 15); x = v * f; } inline void read(long long &x) { long long v = 0ll, f = 1ll; char c = getchar(); while (!isdigit(c) && c != - ) c = getchar(); if (c == - ) f = -1; else v = (c & 15); while (isdigit(c = getchar())) v = (v << 1) + (v << 3) + (c & 15); x = v * f; } inline void readc(char &x) { char c; while (((c = getchar()) == ) || c == n ) ; x = c; } int t, n, m, i, j, k, l, px[5], py[5], c[5], res, sx[5], sy[5], tx[5], ty[5], tt[5]; void check(int d, int x, int y) { tx[1] = tx[2] = x; tx[3] = tx[4] = x + d; ty[1] = ty[3] = y; ty[2] = ty[4] = y + d; int i, j; for (((i)) = (1); ((i)) <= ((4)); ((i))++) c[i] = i; do { int s = 0; for (((i)) = (1); ((i)) <= ((4)); ((i))++) { if (px[i] == tx[c[i]]) { s = max(s, abs(py[i] - ty[c[i]])); continue; } if (py[i] == ty[c[i]]) { s = max(s, abs(px[i] - tx[c[i]])); continue; } s = 0x3bbbbbbb; break; } if (s < res) { res = s; for (((i)) = (1); ((i)) <= ((4)); ((i))++) { sx[i] = tx[c[i]]; sy[i] = ty[c[i]]; } } } while (next_permutation(c + 1, c + 5)); } int main() { read(t); while (t--) { for (((i)) = (1); ((i)) <= ((4)); ((i))++) { read(px[i]); read(py[i]); } res = 0x3bbbbbbb; for (((i)) = (1); ((i)) <= ((4)); ((i))++) for ((j) = (i + 1); (j) <= (4); (j)++) { for (((k)) = (1); ((k)) <= ((4)); ((k))++) for (((l)) = (1); ((l)) <= ((4)); ((l))++) { int d = abs(px[i] - px[j]); check(d, px[k], py[l]); check(d, px[k], py[l] - d); check(d, px[k] - d, py[l]); check(d, px[k] - d, py[l] - d); d = abs(py[i] - py[j]); check(d, px[k], py[l]); check(d, px[k], py[l] - d); check(d, px[k] - d, py[l]); check(d, px[k] - d, py[l] - d); } } for (((i)) = (1); ((i)) <= ((4)); ((i))++) for ((j) = (i + 1); (j) <= (4); (j)++) { k = 1; while (k == i || k == j) k++; l = 4 ^ i ^ j ^ k; if (px[i] == px[j] && px[k] == px[l]) { int d = abs(px[i] - px[k]); int t1 = min(py[i], py[j]), t2 = max(py[i], py[j]) - d; int t3 = min(py[k], py[l]), t4 = max(py[k], py[l]) - d; tt[1] = t1; tt[2] = t2; tt[3] = t3; tt[4] = t4; sort(tt + 1, tt + 5); check(d, min(px[i], px[k]), (tt[1] + tt[4]) / 2); } if (py[i] == py[j] && py[k] == py[l]) { int d = abs(py[i] - py[k]); int t1 = min(px[i], px[j]), t2 = max(px[i], px[j]) - d; int t3 = min(px[k], px[l]), t4 = max(px[k], px[l]) - d; tt[1] = t1; tt[2] = t2; tt[3] = t3; tt[4] = t4; sort(tt + 1, tt + 5); check(d, (tt[1] + tt[4]) / 2, min(py[i], py[k])); } } if (res >= 0x3bbbbbbb) { puts( -1 ); } else { printf( %d n , res); for (((i)) = (1); ((i)) <= ((4)); ((i))++) { printf( %d %d n , sx[i], sy[i]); } } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, k; while (scanf( %d%d%d , &n, &m, &k) != EOF) { if (n == m) { if (n == 2 && k == 1) { printf( 4 n ); printf( 1 2 3 4 n ); } else { printf( %d n , 2 * k + 1); printf( 1 ); for (int i = 1; i < k; i++) { printf( 1 ); } printf( %d , n); for (int i = 1; i < k; i++) { printf( %d , n + 1); } if (k == 1) printf( %d n , 2 * n - 1); else printf( %d n , 2 * n); } } else if (m == n - 1) { if (k > 1) { printf( %d n , 2 * k); printf( 1 ); for (int i = 1; i < k; i++) { printf( 1 ); } printf( %d , n); for (int i = 1; i < k; i++) { printf( %d , n + 1); } printf( n ); } else { printf( %d n , 2 * k + 1); printf( 1 ); for (int i = 1; i < k; i++) { printf( 1 ); } printf( %d , n); for (int i = 1; i < k; i++) { printf( %d , n + 1); } printf( %d n , n + m); } } else { printf( %d n , 2 * k); printf( 1 ); for (int i = 1; i < k; i++) { printf( 1 ); } printf( %d , n); for (int i = 1; i < k; i++) { printf( %d , n + 1); } printf( n ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; struct EDGE { int u, v, l, next; bool train; EDGE() {} EDGE(int a, int b, int c, int d, bool bo) { u = a; v = b; l = c; next = d; train = bo; } } edge[1000000]; int n, m, k; int edgenumber, head[200100], visit[200100], fr[200100]; long long d[200100]; void addedge(int u, int v, int l, bool bo) { edge[edgenumber] = EDGE(u, v, l, head[u], bo); head[u] = edgenumber++; } void spfa(int rt) { memset(d, 0x3f3f3f3f, sizeof(d)); priority_queue<pair<int, long long> > q; q.push(make_pair(1, 0)); visit[rt] = 1; d[rt] = 0; while (!q.empty()) { int u = q.top().first; q.pop(); for (int i = head[u]; i != -1; i = edge[i].next) { int v = edge[i].v; int l = edge[i].l; if (d[u] + l < d[v]) { d[v] = d[u] + l; fr[v] = i; if (!visit[v]) { visit[v] = 1; q.push(make_pair(v, -d[v])); } } else if (d[v] == d[u] + l && edge[fr[v]].train) { fr[v] = i; } } visit[u] = 0; } for (int i = 2; i <= n; i++) if (edge[fr[i]].train) k--; } int main() { scanf( %d%d%d , &n, &m, &k); edgenumber = 0; memset(head, -1, sizeof(head)); vector<pair<int, int> > kn; for (int i = 0; i < m; i++) { int u, v, l; scanf( %d%d%d , &u, &v, &l); addedge(u, v, l, false); addedge(v, u, l, false); } for (int i = 0; i < k; i++) { int v, l; scanf( %d%d , &v, &l); kn.push_back(make_pair(v, l)); addedge(1, v, l, true); } spfa(1); printf( %d n , k); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int s; cin >> s; while (s--) { string t; cin >> t; int f = 0; for (int i = 1; i < t.length(); i++) { if (t[i] != t[i - 1]) { f = 1; break; } } if ((f == 0) || (t.length() == 2)) { cout << t << endl; } else { cout << t[0]; for (int i = 1; i < t.length(); i++) { if (t[i] == t[i - 1]) { if (t[i] == 0 ) { cout << 1 << t[i]; } else if (t[i] == 1 ) { cout << 0 << t[i]; } } else { cout << t[i]; } } cout << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { int t; cin >> t; while(t--) { string s; cin >> s; char c = a ; int n = s.size(); if(n&1) { for(int i=0;i<=n/2;i++) { if(s[n-i-1]!= a ) { s = s.substr(0,i)+c+s.substr(i); break; } } if(s.size()==n+1) { cout << YES << endl; cout << s << endl; } else{ bool p = true; for(int i=0;i<n/2;i++) { if(s[n-i-1]!=s[i]) { p = false; break; } } if(!p) { cout << YES << endl; cout << s+c << endl; } else { cout << NO << endl; } } } else{ for(int i=0;i<n/2;i++) { if(s[n-i-1]!= a ) { s = s.substr(0,i)+c+s.substr(i); break; } } if(s.size()==n+1) { cout << YES << endl; cout << s << endl; } else{ bool p = true; for(int i=0;i<n/2;i++) { if(s[n-i-1]!=s[i]) { p = false; break; } } if(!p) { cout << YES << endl; cout << s+c << endl; } else { cout << NO << endl; } } } } } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx2,tune=native ) #pragma GCC optimize( unroll-loops ) using namespace std; using ll = long long; using ld = long double; using vi = vector<int>; using vvi = vector<vi>; using pi = pair<ll, ll>; const int mod = 1e9 + 7; const ll inf = 1e18; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); ll n, k, mn[40][100100], sm[40][100100], p[40][100100]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> k; for (int i = 0; i < n; i++) cin >> p[0][i]; for (int i = 0; i < n; i++) cin >> mn[0][i], sm[0][i] = mn[0][i]; for (int i = 1; i < 34; i++) { for (int j = 0; j < n; j++) { p[i][j] = p[i - 1][p[i - 1][j]]; sm[i][j] = sm[i - 1][j] + sm[i - 1][p[i - 1][j]]; mn[i][j] = min(mn[i - 1][j], mn[i - 1][p[i - 1][j]]); } } for (int i = 0; i < n; i++) { ll u = i, m = LLONG_MAX, s = 0; for (int j = 34; j--;) { if (k & (1ll << j)) { m = min(m, mn[j][u]); s = s + sm[j][u]; u = p[j][u]; } } cout << s << << m << n ; } } |
#include <bits/stdc++.h> using namespace std; int __gcd(int x, int y) { if (!y) return x; return __gcd(y, x % y); } const long long linf = 1e18 + 5; int mod = (int)1e9; const int logN = 18; const int inf = 1e9 + 9; const int N = 1e5 + 5; int ff, h[N], n, a[N], x, y, z, p; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); h[a[i]]++; } int ff = 0; for (int i = 1; i <= 100000; i++) if (h[i] & 1) ff = 1; if (ff) { cout << Conan ; } else cout << Agasa ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 1e9; int dp[55][8], d1[55], d2[55], d3[55], n, m; 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 >> s; d1[i] = inf; d2[i] = inf; d3[i] = inf; for (int j = 0; j < s.size(); ++j) { if (s[j] >= a && s[j] <= z ) { d1[i] = min(d1[i], min(j, (int)s.size() - j)); } else if (s[j] >= 0 && s[j] <= 9 ) { d2[i] = min(d2[i], min(j, (int)s.size() - j)); } else { d3[i] = min(d3[i], min(j, (int)s.size() - j)); } } } for (int i = 0; i < 8; ++i) { dp[0][i] = inf; } dp[0][0] = 0; for (int i = 1; i <= n; ++i) { dp[i][0] = dp[i - 1][0]; dp[i][1] = min(dp[i - 1][1], dp[i - 1][0] + d1[i]); dp[i][2] = min(dp[i - 1][2], dp[i - 1][0] + d2[i]); dp[i][4] = min(dp[i - 1][4], dp[i - 1][0] + d3[i]); dp[i][3] = min(dp[i - 1][3], min(dp[i - 1][1] + d2[i], dp[i - 1][2] + d1[i])); dp[i][5] = min(dp[i - 1][5], min(dp[i - 1][1] + d3[i], dp[i - 1][4] + d1[i])); dp[i][6] = min(dp[i - 1][6], min(dp[i - 1][2] + d3[i], dp[i - 1][4] + d2[i])); dp[i][7] = min(min(dp[i - 1][7], dp[i - 1][6] + d1[i]), min(dp[i - 1][5] + d2[i], dp[i - 1][3] + d3[i])); } cout << dp[n][7]; } |
#include <bits/stdc++.h> using namespace std; const int N = 5007; const int MX = 1e9 + 7; const long long int INF = 1e18 + 9LL; int n, m; int in[N]; vector<int> cows[N]; int Left[N], Right[N]; int take[N], poss[N], New[N]; void update(int t) { int canTake = 0; if (cows[t][0] <= Left[t] || cows[t][0] <= Right[t]) canTake = 1; if (cows[t].size() >= 2) { int mn = min(Left[t], Right[t]); int mx = max(Left[t], Right[t]); if (cows[t][0] <= mn && cows[t][1] <= mx) canTake = 2; } if (canTake == 0) { if (take[t] == 0) return; take[t] = 0, poss[t] = 1, New[t] = 1; return; } if (canTake == 1) { int xd = 0; for (auto v : cows[t]) { if (v <= Left[t]) ++xd; if (v <= Right[t]) ++xd; } if (take[t] != canTake) { take[t] = 1; poss[t] = New[t] = xd; } else { poss[t] = xd; for (auto v : cows[t]) if (v == Left[t]) New[t] = 1; } return; } int prawo = 0; poss[t] = 0; for (auto v : cows[t]) if (v <= Right[t]) ++prawo; for (int i = 0; i < (int)cows[t].size(); ++i) if (cows[t][i] <= Left[t]) { poss[t] += prawo; if (cows[t][i] <= Right[t]) --poss[t]; } if (canTake != take[t]) { take[t] = 2; New[t] = poss[t]; return; } for (int i = 0; i < (int)cows[t].size(); ++i) if (cows[t][i] == Left[t]) { New[t] = prawo; if (cows[t][i] <= Right[t]) --New[t]; } } int main() { scanf( %d %d , &n, &m); for (int i = 1; i <= n; ++i) scanf( %d , &in[i]); for (int i = 1; i <= m; ++i) { int f, h; scanf( %d %d , &f, &h); cows[f].push_back(h); } for (int i = 1; i <= n; ++i) sort(cows[i].begin(), cows[i].end()); for (int i = 1; i <= n; ++i) { Right[in[i]]++; poss[i] = 1; } int ans = 0, ans2 = 1; for (int i = 1; i <= n; ++i) { if (cows[i].size() == 0) continue; update(i); ans += take[i]; ans2 = (1LL * ans2 * poss[i]) % MX; } for (int i = 1; i <= n; ++i) { Right[in[i]]--; Left[in[i]]++; for (int j = 1; j <= n; ++j) New[j] = 0; if (cows[in[i]].size()) update(in[i]); int now = 0; for (int j = 1; j <= n; ++j) now += take[j]; if (now < ans) continue; if (now > ans) { ans = now; ans2 = 0; } int tmp1 = 1, tmp2 = 1; for (int j = 1; j <= n; ++j) { tmp1 = (1LL * tmp1 * poss[j]) % MX; tmp2 = (1LL * tmp2 * (poss[j] - New[j])) % MX; } ans2 = (1LL * ans2 + tmp1 + MX - tmp2) % MX; } printf( %d %d n , ans, ans2); return 0; } |
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); const int inf = 0x3fffffff; const int maxn = 200005; int n; unsigned long long m; struct P { int x, y; } p[maxn]; bool cmp(P a, P b) { if (a.x == b.x) return a.y < b.y; return a.x < b.x; } int main() { scanf( %d , &n); int y = 1; for (int i = 1; i <= 2 * n; i++) { int x; scanf( %d , &x); p[i].x = x, p[i].y = y; y++; if (y > n) y = 1; } scanf( %I64u , &m); sort(p + 1, p + 2 * n + 1, cmp); unsigned long long ans = 1, tmpans = 1, cnt = 0; int now = -1; for (int i = 1; i <= 2 * n; i++) { if (now != p[i].x) { now = p[i].x; ans *= tmpans; tmpans = 1LL; ans %= m; cnt = 0LL; } if (i < 2 * n) { if (p[i + 1].x != p[i].x) { tmpans *= (cnt + 1LL); tmpans %= m; } else { if (p[i + 1].y != p[i].y) { tmpans *= (cnt + 1LL); tmpans %= m; cnt++; } else { unsigned long long tmp1 = cnt + 1LL, tmp2 = cnt + 2LL; if (tmp1 % 2LL == 0LL) tmp1 /= 2LL; else tmp2 /= 2LL; tmpans *= tmp1; tmpans %= m; tmpans *= tmp2; tmpans %= m; cnt += 2LL; i++; if (i == 2 * n) { ans *= tmpans; ans %= m; break; } } } } else { tmpans *= (cnt + 1LL); tmpans %= m; ans *= tmpans; ans %= m; break; } } printf( %I64u n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> void show(const vector<T> &a) { for (T x : a) cout << x << ; cout << n ; } const long long N = 1e5 + 10, oo = 1e18 + 500; const long long mod = 1e9 + 7; const long double eps = 1e-9, PI = 2 * acos(0.0); long long n, m, k; long long cnt = 0; vector<long long> g[N]; vector<long long> rg[N]; vector<long long> visit(N, 0); vector<vector<long long> > dp(N, vector<long long>(150, -oo)); signed main() { ios::sync_with_stdio(0); cout.tie(0); cin.tie(0); cin >> n >> m >> k; vector<vector<long long> > a(n, vector<long long>(m + 1)); for (long long i = 0; i < n; i++) { cin >> a[i][0]; } for (long long i = 0; i < n; i++) { for (long long j = 0; j < m; j++) cin >> a[i][j + 1]; } sort(a.rbegin(), a.rend()); dp[0][0] = a[0][0]; for (long long j = 0; j < m; j++) { dp[0][(1 << j)] = a[0][j + 1]; } for (long long i = 1; i < n; i++) { for (long long mask = 0; mask < (1 << m); mask++) { long long ex = 0; for (long long j = 0; j < m; j++) { if (mask & (1 << j)) { ex++; } } long long add = 0; if (i < k + ex) add = a[i][0]; if (dp[i][mask] < dp[i - 1][mask] + add) { dp[i][mask] = dp[i - 1][mask] + add; } for (long long j = 0; j < m; j++) { if (!(mask & (1 << j))) { if (dp[i][mask | (1 << j)] < dp[i - 1][mask] + a[i][j + 1]) { dp[i][mask | (1 << j)] = dp[i - 1][mask] + a[i][j + 1]; } } } } } long long ans = dp[n - 1][(1 << m) - 1]; cout << ans; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 5000 + 100; int x[maxn][maxn], p[maxn], tx[maxn]; int n; int ask(int i, int j) { cout << ? << i << << j << endl; int r; cin >> r; return r; } void answer(int k) { cout << ! << endl; cout << k << endl; for (int i = 0; i < n; ++i) cout << p[i] << ; cout << endl; exit(0); } int main() { cin >> n; for (int i = 0; i < n; ++i) { int xo = ask(0, i); x[0][i] = xo; } for (int i = 1; i < n; ++i) { int xo = ask(i, i); for (int j = 0; j < n; ++j) { x[i][j] = xo ^ x[0][i] ^ x[0][j]; } } int xn = 0; for (int i = 0; i < n; ++i) xn ^= i; if (n & 1) { for (int i = 0; i < n; ++i) { int xnow = 0; for (int j = 0; j < n; ++j) xnow ^= x[i][j]; xnow ^= xn; p[i] = xnow; } answer(1); return 0; } for (int i = 0; i < n; ++i) tx[i] = (x[0][0] ^ x[i][0]); int ans = 0; for (int i = 0; i < n; ++i) { vector<int> tp(maxn); tp[0] = i; for (int j = 1; j < n; ++j) tp[j] = (tx[j] ^ tp[0]); bitset<maxn> v; bool good = true; vector<int> tb(maxn); for (int j = 0; j < n && good; ++j) { if (tp[j] >= n || tp[j] < 0) { good = false; break; } tb[tp[j]] = j; } for (int j = 0; j < n; ++j) { if ((tb[j] ^ tp[j]) != x[j][j]) good = false; } for (int j = 0; j < n && good; ++j) { if (tp[j] >= n || tp[j] < 0) { good = false; break; } if (v[tp[j]]) good = false; v[tp[j]] = true; } if (good) { ++ans; for (int j = 0; j < n; ++j) p[j] = tp[j]; } } answer(ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long sz = 1e5 + 5; vector<long long> A(sz, 0), Lazy(4 * sz, 0), Tree(4 * sz, 0); long long n, m; void Built(long long Node, long long I, long long F) { if (I == F) { Tree[Node] = A[I]; return; } long long M = (I + F) / 2; Built(2 * Node + 1, I, M); Built(2 * Node + 2, M + 1, F); Tree[Node] = max(Tree[2 * Node + 1], Tree[2 * Node + 2]); return; } void Update(long long Node, long long I, long long F, long long L, long long R, long long Value) { if (Lazy[Node] != 0) { Tree[Node] += (Lazy[Node]); Lazy[2 * Node + 1] += Lazy[Node]; Lazy[2 * Node + 2] += Lazy[Node]; Lazy[Node] = 0; } if (L > F || R < I) { return; } if (I >= L && F <= R) { Tree[Node] += Value; Lazy[2 * Node + 1] += Value; Lazy[2 * Node + 2] += Value; return; } long long M = (I + F) / 2; Update(2 * Node + 1, I, M, L, R, Value); Update(2 * Node + 2, M + 1, F, L, R, Value); Tree[Node] = max(Tree[2 * Node + 1], Tree[2 * Node + 2]); return; } long long Query(long long Node, long long I, long long F, long long L, long long R) { if (Lazy[Node] != 0) { Tree[Node] += (Lazy[Node]); Lazy[2 * Node + 1] += Lazy[Node]; Lazy[2 * Node + 2] += Lazy[Node]; Lazy[Node] = 0; } if (L > F || R < I) return INT_MIN; if (I >= L && F <= R) { return Tree[Node]; } long long M = (I + F) / 2; return max(Query(2 * Node + 1, I, M, L, R), Query(2 * Node + 2, M + 1, F, L, R)); } int main() { cin >> n >> m; long long Min = INT_MAX; long long Max = INT_MIN; long long ansIn = -1; for (long long i = 0; i < n; i++) { cin >> A[i]; Min = min(Min, A[i]); Max = max(Max, A[i]); } long long ans = Max - Min; Built(0, 0, n - 1); vector<pair<long long, long long> > tmp(m); map<pair<long long, long long>, vector<long long> > mp; for (long long i = 0; i < m; i++) { cin >> tmp[i].first >> tmp[i].second; tmp[i].first = tmp[i].first - 1; tmp[i].second = tmp[i].second - 1; mp[{tmp[i].first, tmp[i].second}].push_back(i + 1); } sort(tmp.begin(), tmp.end()); long long i = 0, j = 0; multiset<pair<long long, long long> > Set; for (long long k = 0; k < n; k++) { while (!Set.empty()) { auto it = Set.begin(); auto p = *it; if (p.first < k) { Update(0, 0, n - 1, p.second, p.first, 1); Set.erase(it); } else break; } while (j < m && tmp[j].first <= k && tmp[j].second >= k) { Update(0, 0, n - 1, tmp[j].first, tmp[j].second, -1); Set.insert({tmp[j].second, tmp[j].first}); j++; } long long sze = Set.size(); long long x = Query(0, 0, n - 1, 0, n - 1); long long y = A[k] - sze; if (ans < x - y) { ans = x - y; ansIn = k; } } cout << ans << endl; if (ansIn == -1) { cout << 0; return 0; } vector<long long> Ans; for (long long i = 0; i < m; i++) { if (tmp[i].first <= ansIn && tmp[i].second >= ansIn) { Ans.push_back(mp[{tmp[i].first, tmp[i].second}] [mp[{tmp[i].first, tmp[i].second}].size() - 1]); mp[{tmp[i].first, tmp[i].second}].pop_back(); } } cout << Ans.size() << endl; for (auto i : Ans) cout << i << ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int N = 2222; int n, K; long long sum[N][N], tail[N], f[N][N]; char s[N]; long long work() { long long ret = 0; tail[n + 1] = 1; for (int i = n; i >= 1; i--) tail[i] = tail[i + 1] * (s[i] - a + 1) % MOD; if (K == 0) return tail[1]; f[0][0] = 1; sum[0][0] = 1; for (int i = 1; i <= n; i++) { int dt = n - i + 1; for (int j = 0; j <= K; j++) { for (int k = i - 1; k >= 0 && (i - k) * dt <= j; k--) { f[i][j] = (f[i][j] + f[k][j - (i - k) * dt]) % MOD; } f[i][j] = f[i][j] * ( z - s[i]) % MOD; } for (int j = 0; j <= K; j++) { f[i][j] = (f[i][j] + sum[i - 1][j] * (s[i] - a ) % MOD) % MOD; sum[i][j] = (sum[i - 1][j] + f[i][j]) % MOD; } } ret = sum[n][K]; return ret; } int main() { scanf( %d%d%s , &n, &K, s + 1); printf( %I64d n , work()); return 0; } |
#include <bits/stdc++.h> using namespace std; const int kd[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; int n, i, j; char s[666666]; int cnt[42][42][42]; int mx, ad, am, ay; int main() { scanf( %s , s); int n = strlen(s); memset(cnt, 0, sizeof(cnt)); for (i = 0; i + 9 < n; i++) { if (s[i + 2] != - || s[i + 5] != - ) continue; int ok = 1; for (j = 0; j < 10; j++) if (j != 2 && j != 5 && s[i + j] == - ) ok = 0; if (!ok) continue; int dd = (s[i] - 48) * 10 + (s[i + 1] - 48); int mm = (s[i + 3] - 48) * 10 + (s[i + 4] - 48); if (s[i + 6] != 2 || s[i + 7] != 0 || s[i + 8] != 1 ) continue; int yy = s[i + 9] - 48; if (yy < 3 || yy > 5) continue; if (mm < 1 || mm > 12) continue; if (dd < 1 || dd > kd[mm]) continue; cnt[dd][mm][yy]++; if (cnt[dd][mm][yy] > mx) { mx = cnt[dd][mm][yy]; ad = dd; am = mm; ay = yy; } } printf( %d%d-%d%d-%d n , ad / 10, ad % 10, am / 10, am % 10, 2010 + ay); return 0; } |
#include <bits/stdc++.h> using namespace std; int a[1000100], b[1000100], cnt[32]; int solve(int n, int m) { int i, j, k, ret = 0; memset(cnt, 0, sizeof(cnt)); for (i = 0; i < n; ++i) { for (j = 0; (1 << j) <= a[i]; ++j) { if (a[i] & (1 << j)) ++cnt[j]; } } sort(b, b + m); for (i = 0; i < m; ++i) { for (j = b[i]; j < 32 && !cnt[j]; ++j) ; if (j == 32) break; ++ret; --cnt[j]; for (k = b[i]; k < j; ++k) ++cnt[k]; } return ret; } int main() { int n, m, i; while (~scanf( %d %d , &n, &m)) { for (i = 0; i < n; ++i) scanf( %d , &a[i]); for (i = 0; i < m; ++i) scanf( %d , &b[i]); printf( %d n , solve(n, m)); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1e9 + 10; const long long BINF = 1e18 + 10; long long get(long long l, long long r) { if (l > r) { swap(l, r); } return r * (r + 1) / 2 - l * (l - 1) / 2; } long long solve(long long a, long long b, long long lim) { long long res = 0; if (a > lim) { if (b >= lim) { res += lim * (a - b + 1); } else { res += get(b, lim) + lim * (a - lim); } } else { res += get(a, b); } return res; } void source() { long long n, x, y, need; cin >> n >> x >> y >> need; if (need <= 1) { cout << 0; exit(0); } long long l = 0, r = 2 * n + 10; long long mx_up = n - y + 1, mx_down = y; while (r - l > 1) { long long mid = (l + r) / 2, sum = 0; long long left = max(x - mid, 1ll), right = min(x + mid, n); long long a = mid + 1, vl = a - (x - left), vr = a - (right - x); sum = solve(a, vl, mx_up) + solve(a, vr, mx_up) - min(mx_up, a); sum += solve(a, vl, mx_down) + solve(a, vr, mx_down) - min(mx_down, a); sum -= right - left + 1; if (sum >= need) { r = mid; } else { l = mid; } } cout << r; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); source(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int num; int arr[110]; cin >> num; for (int i = 0; i < num; i++) { cin >> arr[i]; } for (int i = 1; i <= num; i++) { for (int j = 0; j < num; j++) { if (arr[j] == i) { cout << j + 1 << ; } } } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; string we, ns, sol = ; void fast() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int main() { fast(); cin >> n >> m; cin >> we; cin >> ns; sol += we[0]; sol += we.back(); sol += ns[0]; sol += ns.back(); if (sol == <>v^ || sol == ><^v ) { cout << YES ; } else { cout << NO ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long logN = 20; const long long M = 1000000007; const long long INF = 1e12; const long long N = 100005; void solve() { long long n, k; cin >> n >> k; set<long long> s; while (s.size() < 30 and s.size() < (n - 1)) { long long i = rand() % n + 1; if (i != 1 and s.find(i) == s.end()) { s.insert(i); cout << ? 1 1 << endl; cout << 1 << endl; cout << i << endl; string gt; cin >> gt; if (gt == SECOND ) { cout << ! 1 << endl; return; } } } long long l = 2, r = 2; for (long long i = 0; i < 10; i++) { long long dif = (r - l + 1); cout << ? << dif << << dif << endl; for (long long i = 1; i < dif + 1; i++) cout << i << ; cout << endl; for (long long i = l; i < l + dif; i++) cout << i << ; cout << endl; string s; cin >> s; if (s == FIRST ) break; l = r + 1; r = 2 * r; r = min(r, n); } while (r > l) { long long m = (l + r) / 2; long long dif = (m - l + 1); cout << ? << dif << << dif << endl; for (long long i = 1; i < dif + 1; i++) cout << i << ; cout << endl; for (long long i = l; i < l + dif; i++) cout << i << ; cout << endl; string s; cin >> s; if (s == EQUAL ) l = m + 1; else r = m; } cout << ! << l << endl; return; } int main() { long long no; cin >> no; while (no--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long int sum[100010], bsum[100010], arr2[100010]; pair<long long int, long long int> arr[100010]; void scanStr(char *str) { long long int i = 1; char ch; for (ch = getchar(); ch != n && ch != ; ch = getchar()) str[i++] = ch; str[i] = 0 ; return; } inline void fastOut(long long int n) { if (n < 10) { putchar(n + 0 ); return; } fastOut(n / 10); putchar(n % 10 + 0 ); return; } long long int powerFast(long long int a, long long int b) { long long int i = a, j = 1, k = 1; while (b) { if (b & 1) { k = ((k * i) < 1000000007 ? (k * i) : (k * i) % 1000000007); } i = ((i * i) < 1000000007 ? (i * i) : (i * i) % 1000000007); b = b >> 1; } return k; } inline long long int scan() { long long int n = 0; char c; for (c = getchar(); c == || c == n || c == t ; c = getchar()) ; for (; c > 0x2f && c < 0x3a; c = getchar()) n = (n * 10) + (c & 0x0f); return n; } bool comp(pair<long long int, long long int> a, pair<long long int, long long int> b) { if (a.first < b.first) return false; return true; } int main() { long long int N, A, cf, cm, M, i, j, K, t, tmin, tnA, maxx; N = scan(); A = scan(); cf = scan(); cm = scan(); M = scan(); for (i = 1; i <= N; i++) { arr[i].first = scan(); arr[i].second = i; } sort(arr + 1, arr + N + 1, std::greater<pair<long long int, long long int> >()); for (i = 1; i <= N; i++) { sum[i] = sum[i - 1] + arr[i].first; } long long int loc1, loc2, val; maxx = LONG_MIN; j = 1; for (i = 0; i <= N; i++) { K = M - (A * i - sum[i]); if (K < 0) { break; } tnA = i; tmin = A; for (j = max(i + 1, j); j <= N; j++) { t = arr[j].first * (N - j + 1); t = t - (sum[N] - sum[j - 1]); if (t <= K) { t = K - t; tmin = min(arr[j].first + t / (N - j + 1), A); break; } } if ((cf * tnA + cm * tmin) >= maxx) { maxx = cf * tnA + cm * tmin; loc1 = i; loc2 = j; val = tmin; } } cout << maxx << n ; for (i = 1; i <= loc1; i++) { arr2[arr[i].second] = A; } for (i = loc1 + 1; i < loc2; i++) { arr2[arr[i].second] = arr[i].first; } for (i = loc2; i <= N; i++) { arr2[arr[i].second] = val; } for (i = 1; i <= N; i++) { fastOut(arr2[i]); putchar( ); } return 0; } |
#include <bits/stdc++.h> using namespace std; void readi(int &x) { int v = 0, f = 1; char c = getchar(); while (!isdigit(c) && c != - ) c = getchar(); if (c == - ) f = -1; else v = v * 10 + c - 0 ; while (isdigit(c = getchar())) v = v * 10 + c - 0 ; x = v * f; } void readll(long long &x) { long long v = 0ll, f = 1ll; char c = getchar(); while (!isdigit(c) && c != - ) c = getchar(); if (c == - ) f = -1; else v = v * 10 + c - 0 ; while (isdigit(c = getchar())) v = v * 10 + c - 0 ; x = v * f; } void readc(char &x) { char c; while ((c = getchar()) == ) ; x = c; } void writes(string s) { puts(s.c_str()); } void writeln() { writes( ); } void writei(int x) { if (!x) putchar( 0 ); char a[25]; int top = 0; while (x) { a[++top] = (x % 10) + 0 ; x /= 10; } while (top) { putchar(a[top]); top--; } } void writell(long long x) { if (!x) putchar( 0 ); char a[25]; int top = 0; while (x) { a[++top] = (x % 10) + 0 ; x /= 10; } while (top) { putchar(a[top]); top--; } } long long n, m, li, ns, i, j, k, l, mod = 1e9 + 7, x, y, dp[123456][12][3], vis[123456]; vector<long long> e[123456]; void dfs(int x, int fa) { long long i; if (vis[x]) return; vis[x] = 1; dp[x][0][2] = ns - 1; dp[x][1][1] = 1; dp[x][0][0] = m - ns; for (i = 0; i < e[x].size(); i++) { if (e[x][i] == fa) continue; dfs(e[x][i], x); for (j = li; ~j; j--) { long long mem[3] = {0, 0, 0}; for (k = 0; k <= j; k++) { (mem[0] += (dp[x][j - k][0] * (dp[e[x][i]][k][0] + dp[e[x][i]][k][2]))) %= mod; (mem[1] += (dp[x][j - k][1] * (dp[e[x][i]][k][2]))) %= mod; (mem[2] += (dp[x][j - k][2] * (dp[e[x][i]][k][0] + dp[e[x][i]][k][1] + dp[e[x][i]][k][2]))) %= mod; } for (k = 0; k < 3; k++) dp[x][j][k] = mem[k]; } } } int main() { readll(n); readll(m); for (i = 1; i < n; i++) { readll(x); readll(y); e[x].push_back(y); e[y].push_back(x); } readll(ns); readll(li); dfs(1, 0); long long res = 0; for (i = 0; i <= li; i++) (res += dp[1][i][0] + dp[1][i][1] + dp[1][i][2]) %= mod; writell(res); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int T = 1; while (T--) { int n, m; cin >> n >> m; map<int, int> mp; vector<pair<int, int> > pp; for (int i = 0; i < m; i++) { int a, b; cin >> a >> b; pp.push_back({a, b}); if (a != b) { mp[a]++; mp[b]++; } else mp[a]++; } vector<pair<int, int> > maxi; for (auto x : mp) { maxi.push_back({x.second, x.first}); } sort(maxi.rbegin(), maxi.rend()); int mm = min(4, int((maxi).size())); for (int q = 0; q < mm; q++) { vector<int> v(m, 0); int cnt = 0; for (int i = 0; i < m; i++) { if (pp[i].first == maxi[q].second || pp[i].second == maxi[q].second) { v[i] = 1; cnt++; } } cnt = m - cnt; if (cnt == 0) { cout << YES ; exit(0); } mp.clear(); for (int i = 0; i < m; i++) { if (v[i] == 0) { if (pp[i].first != pp[i].second) { mp[pp[i].first]++; mp[pp[i].second]++; } else mp[pp[i].first]++; } } for (auto x : mp) { if (x.second == cnt) { cout << YES ; exit(0); } } } cout << NO ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 7; map<int, int> l, r; int a[maxn << 1]; int sum[maxn << 1]; int main() { int t; cin >> t; while (t--) { l.clear(); r.clear(); int n; cin >> n; for (int i = 1; i <= 2 * n; i++) cin >> a[i]; for (int i = 1; i <= 2 * n; i++) { a[i] = (a[i] == 2 ? 1 : -1); } for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i]; sum[2 * n + 1] = 0; for (int i = 2 * n; i >= n + 1; i--) sum[i] = sum[i + 1] + a[i]; r[0] = 2 * n + 1; l[0] = 0; for (int i = 1; i <= n; i++) l[sum[i]] = max(l[sum[i]], i); for (int i = 2 * n; i >= n + 1; i--) r[sum[i]] ? r[sum[i]] = min(r[sum[i]], i) : r[sum[i]] = i; int ans = 2 * n; for (int i = 0; i <= n; i++) { if (!r[-sum[i]]) continue; ans = min(r[-sum[i]] - l[sum[i]] - 1, ans); } for (int i = 2 * n + 1; i >= n + 1; i--) { if (!l[-sum[i]] && sum[i]) continue; ans = min(ans, r[sum[i]] - l[-sum[i]] - 1); } cout << ans << endl; } return 0; ; } |
#include <bits/stdc++.h> using namespace std; int m[10000000]; int func(int v) { int r = 1; while (v != 1) { if (v % 2 == 0) { v /= 2; } else { v--; r++; } } return r; } int main() { int n, a; long long r = 0; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &a); m[func(a)]++; } for (int i = 0; i < 10000000; i++) { r += (long long)(((long long)m[i] * (long long)(m[i] - 1)) / 2); } cout << r; return 0; } |
#include <bits/stdc++.h> using namespace std; long long solve(long long A, long long B, long long C) { if (B == 0) { return 0; } long long N = A % B; long long X = solve(B, N, C); long long Y = (-C - A * X) / B; if (A != 0) { Y %= A; } return Y; } int abs(int a) { return a > 0 ? a : -a; } int _gcd(int a, int b) { if (b == 0) return a; return _gcd(b, a % b); } int A, B, C; int main() { scanf( %d %d %d , &A, &B, &C); int gcd = _gcd(abs(A), abs(B)); if (C % gcd == 0) { long long Y = solve(A, B, C); long long X = 0; if (A != 0) { X = (-B * Y - C) / A; } printf( %I64d %I64d n , X, Y); } else { printf( -1 n ); } return 0; } |
#include <bits/stdc++.h> int dx[] = {-1, 0, 1, 0}; int dy[] = {0, 1, 0, -1}; using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; bool flag = false; for (int i = 1; i < n - 1; i++) { if ((1ll * (a[i] - a[0]) * (a[i] - a[i + 1])) > 0) { cout << 3 << n ; cout << 1 << << (i + 1) << << (i + 2) << n ; flag = true; break; } } if (!flag) cout << 0 << n ; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 1; vector<int> adj[N]; int numDiv[N]; int a[N]; bool cand[N]; int sz[N], dsu[N]; int f(int x) { if (x == dsu[x]) { return x; } return dsu[x] = f(dsu[x]); } void merge(int x, int y) { x = f(x), y = f(y); if (x != y) { dsu[x] = y; sz[y] += sz[x]; } } int val[N]; int numPrime[N]; long long all[N]; vector<int> in[N]; int lastColor[N]; int isGood[N]; int curColorList[N]; int go[N]; int bfs(int root, int curColor) { int sz = 0; queue<int> q; q.push(root); lastColor[root] = curColor; while (!q.empty()) { int node = q.front(); q.pop(); ++sz; for (int i = 0; i < (int)adj[node].size(); ++i) { int nextNode = adj[node][i]; if (isGood[nextNode] == curColor && lastColor[nextNode] < curColor) { lastColor[nextNode] = curColor; q.push(nextNode); } } } return sz; } void solve() { int n; scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d , &a[i]); in[a[i]].push_back(i); } for (int i = 0; i < n - 1; ++i) { int x, y; scanf( %d %d , &x, &y); adj[x].push_back(y); adj[y].push_back(x); } int g = N; for (int i = 1; i < N; ++i) { val[i] = 1; } int maxi = 0; for (int i = 2; i < N; ++i) { if (val[i] == 1) { for (int j = i; j < N; j += i) { val[j] *= i; numPrime[j] ^= 1; } } } int curColor = 1; int lim = (int)2e5; int pos; for (int num = lim; num >= 1; --num) { ++curColor; pos = 0; for (int j = num; j <= lim; j += num) { for (auto node : in[j]) { if (isGood[node] != curColor) { isGood[node] = curColor; curColorList[pos++] = node; } } } long long tmp = 0; for (int i = 0; i < pos; ++i) { int node = curColorList[i]; if (lastColor[node] < curColor) { int sz = bfs(node, curColor); tmp += (long long)sz * (sz + 1); } } tmp /= 2; all[num] = tmp; } for (int num = 1; num <= lim; ++num) { int g = 1; long long ret = 0; for (int j = num; j <= lim; j += num, ++g) { if (val[g] == g) { if (numPrime[g]) { ret -= all[j]; } else { ret += all[j]; } } } if (ret > 0) { printf( %d %lld n , num, ret); } } } int main() { solve(); } |
#include <bits/stdc++.h> using namespace std; const int N = 220; int n, m; pair<int, double> a[N]; double Dp[N][N][N]; double Rec(int i, int j, int k) { k = min(k, n); if (k < 0) return 0.0; if (i == n) return j >= m; if (Dp[i][j][k] == Dp[i][j][k]) return Dp[i][j][k]; return Dp[i][j][k] = a[i].second * Rec(i + 1, j + 1, k + a[i].first) + (1.0 - a[i].second) * Rec(i + 1, j, k); } int main() { memset(Dp, -1, sizeof(Dp)); int k; cin >> n >> m >> k; for (int i = 0; i < n; i++) cin >> a[i].second, a[i].second /= 100.0; for (int i = 0; i < n; i++) cin >> a[i].first; sort(a, a + n); reverse(a, a + n); printf( %.9f , Rec(0, 0, k)); } |
#include <bits/stdc++.h> using namespace std; int main() { std::ios_base::sync_with_stdio(0); long long n, i, k, m, a[4005], v[4005], d[4005], p[4005], j; cin >> n; for (i = 0; i <= n - 1; i++) { cin >> v[i] >> d[i] >> p[i]; } long long cnt = 0; for (i = 0; i <= n - 1; i++) { if (p[i] == 100000000000007) continue; m = v[i]; a[cnt++] = i + 1; for (k = i + 1; k <= n - 1; k++) { if (m == 0) break; if (p[k] == 100000000000007) continue; p[k] -= m; m--; } m = 0; for (k = i + 1; k <= n - 1; k++) { if (p[k] != 100000000000007) { p[k] -= m; if (p[k] < 0) { m += d[k]; p[k] = 100000000000007; } } } } cout << cnt << n ; for (i = 0; i <= cnt - 1; i++) cout << a[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, c = getchar(), f = 0; for (; c > 9 || c < 0 ; f = c == - , c = getchar()) ; for (; c >= 0 && c <= 9 ; x = (x << 1) + (x << 3) + c - 0 , c = getchar()) ; return f ? -x : x; } inline void write(int x) { if (x < 0) putchar( - ), x = -x; if (x >= 10) write(x / 10); putchar(x % 10 + 48); } const int N = 100000 + 10; int n, m, cnt = 1, head[N], du[N], layer[N], leader[N], q[N]; bool vis1[N], vis2[N], vis3[N * 2]; vector<vector<int> > ans; vector<int> tmp, _; vector<pair<int, int> > comp; struct edge { int to, nxt; } e[N * 4]; void addedge(int u, int v) { e[++cnt] = (edge){v, head[u]}; head[u] = cnt; e[++cnt] = (edge){u, head[v]}; head[v] = cnt; du[u]++; du[v]++; } void dfs(int u, int fa, int lineid) { vis1[u] = 1; vis2[layer[u]] = 1; tmp.push_back(u); for (int i = head[u], v; i; i = e[i].nxt) if ((i >> 1) != lineid) { if (!vis1[v = e[i].to]) { dfs(v, u, i >> 1); tmp.push_back(u); for (; cnt >= 0 && vis2[comp[cnt].second]; cnt--) ; if (cnt >= 0) { vis3[i >> 1] = 1; v = leader[comp[cnt].second]; ans.push_back(tmp); tmp.clear(); _.clear(); _.push_back(i >> 1); _.push_back(u); _.push_back(v); ans.push_back(_); dfs(v, u, i >> 1); tmp.push_back(u); } } else { if (vis3[i >> 1]) continue; for (; cnt >= 0 && vis2[comp[cnt].second]; cnt--) ; if (cnt >= 0) { vis3[i >> 1] = 1; v = leader[comp[cnt].second]; ans.push_back(tmp); tmp.clear(); _.clear(); _.push_back(i >> 1); _.push_back(u); _.push_back(v); ans.push_back(_); dfs(v, u, i >> 1); tmp.push_back(u); } } } } void print() { puts( YES ); write(ans.size() / 2); puts( ); for (int i = (int)0; i <= (int)ans.size() - 1; i++) { if (i & 1) write(ans[i][0]), putchar( ), write(ans[i][1]), putchar( ), write(ans[i][2]), puts( ); else { write(ans[i].size()); for (int j = (int)0; j <= (int)ans[i].size() - 1; j++) putchar( ), write(ans[i][j]); puts( ); } } } int findbridge() { for (int i = (int)2; i <= (int)n; i++) vis1[i] = 0; for (int i = (int)1; i <= (int)m; i++) vis3[i] = 0; for (int i = (int)2; i <= (int)n; i++) if (!vis1[i]) { q[*q = 1] = i; vis1[i] = 1; for (int j = (int)1; j <= (int)*q; j++) { int u = q[j]; for (int k = head[u], v; k; k = e[k].nxt) if (!vis3[k >> 1]) { vis3[k >> 1] = 1; if (vis1[v = e[k].to]) return k >> 1; else vis1[v] = 1, q[++*q] = v; } } } return 0; } int getblo(int l, int r) { for (int i = (int)l; i <= (int)r; i++) vis1[i] = 0; int blo = 0; comp.clear(); for (int i = (int)l; i <= (int)r; i++) if (!vis1[i]) { ++blo; q[*q = 1] = i; vis1[i] = 1; for (int j = (int)1; j <= (int)*q; j++) { int u = q[j]; for (int k = head[u], v; k; k = e[k].nxt) if (!vis1[v = e[k].to]) vis1[v] = 1, q[++*q] = v; } for (int j = (int)1; j <= (int)*q; j++) layer[q[j]] = blo; leader[blo] = q[1]; comp.push_back(make_pair(*q, blo)); } sort(comp.begin(), comp.end()); return blo; } void go(int id) { int u = 1; for (int i = (int)2; i <= (int)n; i++) { for (int j = head[i], pre; j; pre = j, j = e[j].nxt) if ((j >> 1) == id) { if (du[i] > 1) u = i; du[i]--; if (j == head[i]) head[i] = e[j].nxt; else e[pre].nxt = e[j].nxt; break; } } getblo(2, n); cnt = comp.size() - 1; for (int i = (int)1; i <= (int)n; i++) vis1[i] = vis2[i] = 0; for (int i = (int)1; i <= (int)m; i++) vis3[i] = 0; vis1[1] = 1; _.clear(); _.push_back(1); ans.push_back(_); _.clear(); _.push_back(id); _.push_back(1); _.push_back(u); ans.push_back(_); dfs(u, 1, 0); if (tmp.size()) ans.push_back(tmp), tmp.clear(); print(); } int main() { n = read(), m = read(); for (int i = (int)1; i <= (int)m; i++) addedge(read(), read()); if (n == 1) return puts( YES n0 n1 1 n ), 0; int blo = getblo(1, n); if (m < blo - 1) return puts( NO ), 0; if (du[1]) { for (int i = (int)1; i <= (int)n; i++) vis1[i] = vis2[i] = 0; for (int i = (int)1; i <= (int)m; i++) vis3[i] = 0; cnt = comp.size() - 1; dfs(1, 0, 0); if (tmp.size()) ans.push_back(tmp), tmp.clear(); print(); } else { int id = findbridge(); if (id) go(id); else { if (m < blo) puts( NO ); else { for (int i = (int)2; i <= (int)n; i++) if (du[i] > 1) { id = head[i] / 2; break; } if (id) go(id); else puts( NO ); } } } } |
#include <bits/stdc++.h> using namespace std; const int oo = (int)1e9; const double eps = 1e-9; long long gcd(long long a, long long b); int main() { int n; long long maxi = 0, num, g; cin >> n; for (int i = 0; i < n; i++) { cin >> num; maxi = max(maxi, num); g = gcd(g, num); } if ((maxi / g - n) % 2) cout << Alice << endl; else cout << Bob << endl; } long long gcd(long long a, long long b) { if (b == 0) return a; else return gcd(b, a % b); } |
#include <bits/stdc++.h> const int maxn = 0x3f3f3f3f; const double EI = 2.71828182845904523536028747135266249775724709369995957496696762772407663035354594571382178525166427; const double PI = 3.141592653589793238462643383279; using namespace std; struct node { int l, r; double x, y, a; } tree[300010 * 4]; int n; void pushup(int p) { double dis = sqrt(tree[2 * p + 1].x * tree[2 * p + 1].x + tree[2 * p + 1].y * tree[2 * p + 1].y); double a = atan2(tree[2 * p + 1].y, tree[2 * p + 1].x); tree[p].x = tree[2 * p].x + dis * cos(tree[2 * p].a + a); tree[p].y = tree[2 * p].y + dis * sin(tree[2 * p].a + a); tree[p].a = tree[2 * p].a + tree[2 * p + 1].a; return; } void build(int l, int r, int p) { tree[p].l = l; tree[p].r = r; if (l + 1 == r) { tree[p].x = 1.0; tree[p].y = 0.0; tree[p].a = 0.0; return; } int k = ((l + r) >> 1); build(l, k, p << 1); build(k, r, (p << 1) + 1); pushup(p); return; } void update(int pos, double len, double aa, int p) { if (tree[p].l + 1 == tree[p].r) { double dis = sqrt(tree[p].x * tree[p].x + tree[p].y * tree[p].y); double a = atan2(tree[p].y, tree[p].x); dis += len, a += aa; tree[p].x = dis * cos(a); tree[p].y = dis * sin(a); tree[p].a = a; return; } if (pos <= tree[p << 1].r) { update(pos, len, aa, p << 1); } else { update(pos, len, aa, (p << 1) + 1); } pushup(p); return; } int main() { double val; int q, op, pos; while (~scanf( %d %d , &n, &q)) { build(0, n, 1); while (q--) { scanf( %d %d %lf , &op, &pos, &val); if (op == 1) { update(pos, val, 0, 1); } else { update(pos, 0, (1 - val / 360) * 2 * PI, 1); } printf( %.10f %.10f n , tree[1].x, tree[1].y); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int t; cin >> t; while (t--) { long long int n; cin >> n; string s; cin >> s; long long int oc = 0, zc = 0, fpos = -1, lpos; for (int i = 0; i < (int)n; i++) { if (s[i] == 0 ) zc++; else { oc++; if (fpos == -1) { fpos = i; } lpos = i; } } if (oc == 0) cout << n << n ; else if (zc == 0) cout << 2 * n << n ; else { if (s[0] == 1 ) { cout << 2 * n << n ; } else { cout << 2 * max((n - fpos), (lpos + 1)) << n ; } } } } |
#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 a[n + 1]; long long diff[n]; long long max_count = INT_MIN; for (long long i = 1; i <= n; i++) cin >> a[i]; multiset<long long> eles; eles.insert(a[1]); long long i = 2, j = 1; while (i <= n && j <= n) { eles.insert(a[i]); long long mini = *eles.begin(); long long maxi = *eles.rbegin(); while (maxi - mini > 1) { eles.erase(eles.find(a[j])); j++; maxi = *eles.rbegin(); mini = *eles.begin(); } long long sz = eles.size(); max_count = max(max_count, sz); i++; } cout << max_count; return 0; } |
#include <bits/stdc++.h> int main() { int n, i, j, count = 0; scanf( %d , &n); int ara[n]; for (i = 0; i < n; i++) { scanf( %d , &ara[i]); } for (i = 0; i < n - 1; i++) { for (j = i + 1; j < n; j++) { if (ara[i] == 0) { continue; } if (ara[i] == ara[j]) { ara[i] = 0; } } if (ara[i] != 0) { count++; } } if (ara[n - 1] != 0) { count++; } printf( %d n , count); for (i = 0; i < n; i++) { if (ara[i] == 0) { continue; } printf( %d , ara[i]); } printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; char s[450000]; int main() { scanf( %s , &s); vector<string> list; char cur, last = ! ; string word = ; int len = strlen(s); for (int i = 0; i < len; i++) { cur = s[i]; if (last == ! ) { if (cur != . ) { word += cur; } else { printf( NO ); return 0; } } else { if (cur == . ) { if (last != . ) { if (((word.length() > 11))) { printf( NO ); return 0; } else { list.push_back(word); word = ; } } else { printf( NO ); return 0; } } else { word += cur; } } last = cur; } if (last == . ) { printf( NO ); return 0; } if (word != ) { if (word.length() < 4) { list.push_back(word); } else { printf( NO ); return 0; } } if (list.size() == 2) { if (!(list[0].length() > 0 && list[0].length() < 9 && list[1].length() > 0 && list[1].length() < 4)) { printf( NO ); return 0; } } else { if (list.size() == 1) { printf( NO ); return 0; } } for (int i = 1; i < list.size() - 1; i++) { if (list[i].length() == 1) { printf( NO ); return 0; } } len = list.size(); bool was = false; for (int i = 0; i < len; i++) { if (!was) { was = true; if (list[i].length() > 8) { printf( NO ); return 0; } else { cout << YES n ; cout << list[i] << . ; } } else { if (i != len - 1) { if (list[i].length() > 3) { cout << list[i].substr(0, 3) << n ; cout << list[i].substr(3, list[i].length() - 3) << . ; } else { cout << list[i].substr(0, 1) << n ; cout << list[i].substr(1, list[i].length() - 1) << . ; } } else { cout << list[i] << n ; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; const double EPS = 1.0e-8; struct Point { double x, y; Point(double _x = 0, double _y = 0) { x = _x; y = _y; } friend Point operator+(const Point &a, const Point &b) { return Point(a.x + b.x, a.y + b.y); } friend Point operator-(const Point &a, const Point &b) { return Point(a.x - b.x, a.y - b.y); } friend double operator^(const Point &a, const Point &b) { return a.x * b.y - a.y * b.x; } }; Point Basic; set<Point> Set; double Distance(Point a, Point b) { return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y)); } bool operator<(Point a, Point b) { a = a - Basic; b = b - Basic; double Ang1 = atan2(a.y, a.x), Ang2 = atan2(b.y, b.x); double Len1 = Distance(a, Point(0.0, 0.0)), Len2 = Distance(b, Point(0.0, 0.0)); if (fabs(Ang1 - Ang2) < EPS) return Len1 < Len2; return Ang1 < Ang2; } set<Point>::iterator Pre(set<Point>::iterator it) { if (it == Set.begin()) it = Set.end(); return --it; } set<Point>::iterator Nxt(set<Point>::iterator it) { ++it; return it == Set.end() ? Set.begin() : it; } int Query(Point p) { set<Point>::iterator it = Set.lower_bound(p); if (it == Set.end()) it = Set.begin(); return ((p - *(Pre(it))) ^ (*(it) - *(Pre(it)))) < EPS; } void Insert(Point p) { if (Query(p)) return; Set.insert(p); set<Point>::iterator it = Nxt(Set.find(p)); while (Set.size() > 3 && ((p - *(Nxt(it))) ^ (*(it) - *(Nxt(it)))) < EPS) { Set.erase(it); it = Nxt(Set.find(p)); } it = Pre(Set.find(p)); while (Set.size() > 3 && ((p - *(it)) ^ (*(it) - *(Pre(it)))) > -EPS) { Set.erase(it); it = Pre(Set.find(p)); } } int main() { int q; scanf( %d , &q); Basic = Point(0, 0); int oper; Point a, str[5]; for (int i = 1; i <= 3; ++i) { scanf( %d%lf%lf , &oper, &str[i].x, &str[i].y); Basic = Basic + str[i]; } Basic.x /= 3.0; Basic.y /= 3.0; q -= 3; for (int i = 1; i <= 3; ++i) { Set.insert(str[i]); } while (q--) { scanf( %d%lf%lf , &oper, &a.x, &a.y); if (oper == 1) { Insert(a); } else { if (Query(a)) printf( YES n ); else printf( NO n ); } } } |
#include <bits/stdc++.h> using namespace std; #define fast_io ios::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); #define lli long long #define loop(i, l, r) for (lli i = l; l < r ? i < r : i > r; l < r ? i += 1 : i -= 1) #define itr(it, a) for (auto it = a.begin(); it != a.end(); it++) #define it(i, a) for (auto i : a) #define endl n #define inputarray(arr, start, size) loop(i, start, size) { cin >> arr[i]; } #define printarray(arr, start, size) loop(i, start, size) { cout << arr[i] << ; } cout << endl; #define mod 1000000007 #define inf 1e18 #define sp(x, y) fixed << setprecision(y) << x << endl; #define pii pair<lli, lli> #define mp make_pair #define pb push_back #define fi first #define se second #define all(x) x.begin(), x.end() #define clr(x) memset(x, 0, sizeof(x)) #define sortall(x) sort(all(x)) #define debug(x) cout << #x << = << x << endl int main() { #ifndef ONLINE_JUDGE freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); #endif fast_io lli t = 1; cin >> t; while (t--) { lli n; cin >> n; vector<lli> v(n); inputarray(v, 0, n); bool flag = 0; lli diff = INT_MAX, md = INT_MIN; loop(i, 0, n) { if (v[i] < 0) { flag = 1; break; } } if (flag) { cout << NO << endl; continue; } cout << YES << endl; cout << 101 << endl; vector<lli> b; loop(i, 0, 101) { b.push_back(i); } printarray(b, 0, b.size()); } return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; vector<vector<int>> selfloops; vector<vector<pair<int, int>>> adjlist; vector<vector<int>> otherIdx; vector<int> cycle, validIdx; void swapEdges(int n, int a, int b) { int neighA = adjlist[n][a].first, neighB = adjlist[n][b].first; int idxNeighA = otherIdx[n][a], idxNeighB = otherIdx[n][b]; swap(adjlist[n][a], adjlist[n][b]); swap(otherIdx[n][a], otherIdx[n][b]); otherIdx[neighA][idxNeighA] = b; otherIdx[neighB][idxNeighB] = a; } void removeEdge(int n, int i) { int other = adjlist[n][i].first; validIdx[n]++; int otherIndex = otherIdx[n][i]; if (otherIndex != validIdx[other]) { swapEdges(other, otherIndex, validIdx[other]); } validIdx[other]++; } void addEdge(int a, int b, int id) { otherIdx[a].push_back((ll)(adjlist[b]).size() + (a == b)); otherIdx[b].push_back((ll)(adjlist[a]).size()); adjlist[a].push_back({b, id}); adjlist[b].push_back({a, -id}); } void euler(int n) { while (validIdx[n] < (ll)(adjlist[n]).size()) { ll edge = adjlist[n][validIdx[n]].second; int nn = adjlist[n][validIdx[n]].first; removeEdge(n, validIdx[n]); euler(nn); cycle.push_back(edge); } } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); ll n; cin >> n; vector<pair<ll, ll>> in(n); for (ll i = 0; i < n; i++) { ll a, b; cin >> a >> b; in[i] = {a, b}; } auto ok = [&](ll res) { selfloops.assign(1ll << res, {}); adjlist.assign(1ll << res, {}); otherIdx.assign(1ll << res, {}); validIdx.assign(1ll << res, 0); cycle.clear(); ll mask = (1ll << res) - 1; for (ll i = 0; i < n; i++) { addEdge(in[i].first & mask, in[i].second & mask, i + 1); } bool ok = true; ll start = 0; for (ll i = 0; i < (1ll << res); i++) { ok &= ((ll)(adjlist[i]).size() % 2) == 0; if (!adjlist[i].empty()) start = i; } if (ok) euler(start); return (ll)(cycle).size() == n; }; ll l = 0; ll r = 21; while (l + 1 < r) { ll m = (l + r) / 2; if (ok(m)) { l = m; } else { r = m; } } ok(l); reverse(begin(cycle), end(cycle)); cout << l << endl; for (ll x : cycle) { ll a = 2 * abs(x) - 1; ll b = 2 * abs(x); ll c = in[abs(x) - 1].first; ll d = in[abs(x) - 1].second; if (x < 0) swap(a, b); if (x < 0) swap(c, d); cout << a << << b << ; } cout << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { long long x1, x2, y1, y2; cin >> x1 >> y1 >> x2 >> y2; cout << ((y2 - y1 + 1) >= 0 ? (y2 - y1 + 1) : 0) * (((x2 - x1 + 2) / 2) >= 0 ? ((x2 - x1 + 2) / 2) : 0) - ((y2 + 1 - y1) / 2 >= 0 ? (y2 + 1 - y1) / 2 : 0); } |
#include <bits/stdc++.h> using namespace std; int main() { string word, type; int n; cin >> n; int j; int cur = 0, real = 0, sreal = 0; bool t = false, b = false; getline(cin, word); for (int i = 0; i < n; ++i) { getline(cin, word); for (j = 0; j < (int)word.size() && word[j] == ; ++j) ; if (j != word.size()) { if (word[j] == c ) { if (t) { if (cur <= real) { for (; j < (int)word.size() && word[j] != ( ; ++j) ; for (; j < (int)word.size() && word[j] == ( || word[j] == ; ++j) ; if (type == word.substr(j, type.size())) { for (; j < (int)word.size() && word[j] != ; ++j) ; ++j; for (; j < (int)word.size() && word[j] != ; ++j) { cout << word[j]; } return 0; } } --cur; if (b) { if (sreal) { --sreal; } else { --real; } } } } if (word[j] == t && word[j + 1] == r ) { ++cur; if (b) { ++sreal; } } if (word[j] == t && word[j + 1] == h ) { t = true; b = true; for (; j < word.size() && word[j] != ( ; ++j) ; for (; j < word.size() && word[j] == ( || word[j] == ; ++j) ; for (; j < word.size() && word[j] != && word[j] != ) ; ++j) { type.push_back(word[j]); } real = cur; } } } cout << Unhandled Exception ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, L, m, head[1000005], cnt, root, sz[1000005], sum, mx; long long t[1000005], ans; struct edge { int to, next, cost; } e[1000005 << 1]; struct dist { int len, dis; bool operator<(const dist &p) const { return dis < p.dis; } } dis[1000005], q[1000005]; bool vis[1000005]; inline int read() { int x = 0, w = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) w = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { x = x * 10 + c - 0 ; c = getchar(); } return x * w; } int lowbit(int x) { return x & (-x); } void add(int x, int y) { if (x == 0) return; for (int i = x; i <= n + 1; i += lowbit(i)) t[i] += y; } long long query(int x) { if (x <= 0) return 0; long long res = 0; for (int i = x; i; i -= lowbit(i)) res += t[i]; return res; } inline void add(int u, int v, int w) { e[++cnt] = (edge){v, head[u], w}; head[u] = cnt; } void fdrt(int u, int fa) { sz[u] = 1; int num = 0; for (int i = head[u]; i; i = e[i].next) { int v = e[i].to; if (v == fa || vis[v]) continue; fdrt(v, u); sz[u] += sz[v]; num = max(num, sz[v]); } num = max(num, sum - sz[u]); if (mx > num) mx = num, root = u; } void gtds(int u, int fa) { q[++cnt] = dis[u]; for (int i = head[u]; i; i = e[i].next) { int v = e[i].to; if (v == fa || vis[v]) continue; dis[v].len = dis[u].len + 1; dis[v].dis = dis[u].dis + e[i].cost; gtds(v, u); } } long long calc(int u, int len, int d) { cnt = 0; dis[u].len = len, dis[u].dis = d; gtds(u, 0); sort(q + 1, q + cnt + 1); for (int i = 1; i <= cnt; i++) add(q[i].len + 1, 1); int l = 1, r = cnt; long long res = 0; while (l < r) { if (q[l].dis + q[r].dis <= m) { add(q[l].len + 1, -1); res += query(L - q[l].len + 1); l++; } else add(q[r].len + 1, -1), r--; } add(q[l].len + 1, -1); return res; } void solve(int u) { ans += calc(u, 0, 0); vis[u] = 1; for (int i = head[u]; i; i = e[i].next) { int v = e[i].to; if (vis[v]) continue; ans -= calc(v, 1, e[i].cost); sum = mx = sz[v]; fdrt(v, 0); solve(root); } } int main() { n = read(); L = read(); m = read(); for (int i = 2; i <= n; i++) { int u = read(), w = read(); add(u, i, w); add(i, u, w); } sum = mx = n; fdrt(1, 0); solve(root); printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int sum = 0, n, a[120], x, y, i; cin >> n; for (i = 0; i < n - 1; ++i) { cin >> a[i]; } cin >> x >> y; for (i = x - 1; i < y - 1; ++i) { sum += a[i]; } cout << sum << n ; } |
#include <bits/stdc++.h> using namespace std; const int N = 1100, M = 2 * 1e5 + 10, INF = 1e9 + 10; pair<int, int> e[M]; int dp[N][N]; vector<pair<pair<int, int>, pair<int, int> > > que[M]; bool ans[M]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m, q; cin >> n >> m >> q; for (int i = 0; i < m; i++) cin >> e[i].first >> e[i].second; for (int i = 0; i < q; i++) { int l, r, s, t; cin >> l >> r >> s >> t; l--; que[l].push_back({{s, t}, {r, i}}); } for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) if (i != j) dp[i][j] = INF; for (int i = m - 1; i >= 0; i--) { int u = e[i].first, v = e[i].second; dp[u][v] = dp[v][u] = i; for (int j = 1; j <= n; j++) { if (j == u || j == v) continue; if (dp[u][j] > dp[v][j]) dp[u][j] = dp[v][j]; else dp[v][j] = dp[u][j]; } for (auto X : que[i]) { int s = X.first.first, t = X.first.second, r = X.second.first, id = X.second.second; if (dp[s][t] < r) ans[id] = true; else ans[id] = false; } } for (int i = 0; i < q; i++) { if (ans[i]) cout << Yes n ; else cout << No n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int col[5001], mid, n, dis[5001][5001], ans; bool v[5001]; long long mod = 1e9 + 7; bool dfs(int x) { v[x] = 1; for (int i = 1; i <= n; ++i) if (i != x && dis[x][i] > mid) if (!v[i]) { col[i] = col[x] ^ 1; if (dfs(i)) return 1; } else if (col[x] == col[i]) return 1; return 0; } bool check() { memset(v, 0, sizeof(v)); for (int i = 1; i <= n; ++i) if (!v[i]) if (dfs(i)) return 0; return 1; } void dfss(int x) { v[x] = 1; for (int i = 1; i <= n; ++i) if (!v[i] && dis[x][i] > ans) dfss(i); } long long mult(long long x, long long y) { long long res = x * 1ll; y--; while (y) { if (y & 1) res = res * x % mod; x = x * x % mod; y >>= 1; } return res; } int cnt, x[5001], y[5001]; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d%d , &x[i], &y[i]); for (int i = 1; i <= n; ++i) for (int j = 1; j <= n; ++j) dis[i][j] = abs(x[i] - x[j]) + abs(y[i] - y[j]); int l = 0, r = 10000; while (l <= r) { mid = l + r >> 1; if (check()) { ans = mid; r = mid - 1; } else l = mid + 1; } memset(v, 0, sizeof(v)); printf( %d n , ans); for (int i = 1; i <= n; ++i) if (!v[i]) { ++cnt; dfss(i); } printf( %I64d , mult(2ll, (long long)cnt)); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 200 * 1000 + 13; const long long INF64 = 1e18; int n, m; long long a[N]; vector<pair<int, long long>> g[N]; long long dist[N]; void Dijkstra() { set<pair<long long, int>> q; for (int i = 0; i < int(n); i++) { dist[i] = a[i]; q.insert({dist[i], i}); } while (!q.empty()) { int v = q.begin()->second; q.erase(q.begin()); for (auto it : g[v]) { int u = it.first; long long w = it.second; if (dist[u] > dist[v] + w) { q.erase({dist[u], u}); dist[u] = dist[v] + w; q.insert({dist[u], u}); } } } } int main() { scanf( %d%d , &n, &m); for (int _ = 0; _ < int(m); _++) { int f, t; long long w; scanf( %d%d%lld , &f, &t, &w); --f, --t; w *= 2; g[f].push_back({t, w}); g[t].push_back({f, w}); } for (int i = 0; i < int(n); i++) { scanf( %lld , &a[i]); } Dijkstra(); for (int i = 0; i < int(n); i++) printf( %lld , dist[i]); puts( ); return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.