Datasets:
malteklaes
/
cpp-code-code_search_net-style

Dataset card Data Studio Files
xet
Community
1
func_code_string
stringlengths
59
71.4k
#include <bits/stdc++.h> using namespace std; const int maxn = 1e4 + 5; int a[maxn]; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); } while (m--) { int l, r, x; scanf( %d%d%d , &l, &r, &x); int cnt1 = 0, cnt2 = 0; for (int i = l; i <= r; i++) { if (a[i] < a[x]) cnt1++; if (a[i] == a[x]) cnt2++; } if (cnt1 + l - 1 < x && cnt2 + cnt1 + l - 1 >= x) puts( Yes ); else puts( No ); } return 0; }
#include <bits/stdc++.h> using namespace std; map<long long, int> getFactors(long long n) { long long num = n; long long sqrn = sqrt(n); map<long long, int> ret; for (long long i = 2; i <= sqrn; i++) while (num % i == 0) { ret[i]++; num /= i; } if (num > 1 && num != n) ret[num]++; return ret; } void solve(long long n) { map<long long, int> factors = getFactors(n); if (factors.size() == 0) { cout << 1 << n << 0 << n ; return; } vector<long long> keys; for (auto &p : factors) keys.push_back(p.first); if (keys.size() > 2 || (keys.size() == 2 && (factors[keys[0]] > 1 || factors[keys[1]] > 1))) { cout << 1 << n ; cout << keys[0] * keys[1] << n ; return; } if (keys.size() == 1 && factors[keys[0]] > 2) { cout << 1 << n ; cout << keys[0] * keys[0] << n ; return; } cout << 2 << n ; } int main() { std::ios_base::sync_with_stdio(false); cin.tie(0); long long n; cin >> n; solve(n); return 0; }
#include <bits/stdc++.h> using namespace std; int v[100005], u[100005], w[100005], dist[100005]; vector<pair<int, int> > edges[100005]; priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > pq; int main() { int n, m, s, l; while (cin >> n >> m >> s) { for (int i = 0; i < m; ++i) { cin >> v[i] >> u[i] >> w[i]; edges[v[i]].push_back(make_pair(u[i], w[i])); edges[u[i]].push_back(make_pair(v[i], w[i])); } cin >> l; pq.push(make_pair(0, s)); memset(dist, 0x3f, sizeof(dist)); dist[s] = 0; int c, d, nxt; while (pq.size()) { c = pq.top().second; pq.pop(); for (int i = 0; i < edges[c].size(); ++i) { nxt = edges[c][i].first; if (dist[nxt] > dist[c] + edges[c][i].second) { dist[nxt] = dist[c] + edges[c][i].second; pq.push(make_pair(dist[nxt], nxt)); } } } int tmp; int cnt = 0; for (int i = 1; i <= n; ++i) if (dist[i] == l) ++cnt; for (int i = 0; i < m; ++i) { if (dist[u[i]] < l && dist[u[i]] + w[i] > l) { tmp = dist[u[i]] + w[i]; if (dist[v[i]] + tmp - l >= l) ++cnt; } if (dist[v[i]] < l && dist[v[i]] + w[i] > l) { tmp = dist[v[i]] + w[i]; if (dist[u[i]] + tmp - l > l) ++cnt; } } cout << cnt << n ; for (int i = 1; i <= n; ++i) edges[i].clear(); while (pq.size()) pq.pop(); } return 0; }
#include <bits/stdc++.h> using namespace std; const int MAX = 1000000 + 10; const int Mod = 998244353; const int alp = 3; int n, S; int C[MAX]; int dp[MAX]; namespace opt { int N; int a[MAX], b[MAX], w[MAX], tmp[MAX]; int Pow(int a, int b) { int k = 1; for (; b; b /= 2, a = (long long)a * a % Mod) if (b % 2 == 1) k = (long long)k * a % Mod; return k; } void FFT(int *a, int S, int d) { if (d == N) return; FFT(a, S, d << 1); FFT(a, S + d, d << 1); for (int i = S, j = S, p = 0; i < N / 2; i += d, j += d << 1, p += d) { int G = a[j], K = a[j + d]; tmp[i] = ((long long)G + (long long)w[p] * K) % Mod; tmp[i + N / 2] = ((long long)G + (long long)w[p + N / 2] * K) % Mod; } for (int i = S; i < N; i += d) a[i] = tmp[i]; } void conv(int *aa, int *bb, int *c, int n) { for (int i = 0; i < n; ++i) a[i] = aa[i], b[i] = bb[i]; if (n <= 500) { for (int i = 0; i < n * 2; ++i) c[i] = 0; for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) c[i + j] = (c[i + j] + (long long)a[i] * b[j]) % Mod; for (int i = 0; i < n; ++i) a[i] = b[i] = 0; return; } N = 1; for (; N < n; N <<= 1) ; N <<= 1; w[0] = 1; w[1] = Pow(alp, (Mod - 1) / N); for (int i = 2; i <= N; ++i) w[i] = (long long)w[i - 1] * w[1] % Mod; FFT(a, 0, 1); FFT(b, 0, 1); for (int i = 0; i < N; ++i) a[i] = (long long)a[i] * b[i] % Mod; for (int i = 0; i < N; ++i) b[i] = a[i ? (N - i) : 0]; FFT(b, 0, 1); int InvN = Pow(N, Mod - 2); for (int i = 0; i < N; ++i) { c[i] = (long long)b[i] * InvN % Mod; a[i] = b[i] = 0; } } } // namespace opt int a[MAX], b[MAX], c[MAX]; void solve(int l, int r) { if (r == l + 1) return; int mid = (l + r) / 2; solve(l, mid); int i; int need = r - l; for (long long i = 0; i < need; i++) a[i] = b[i] = 0; if (l > 0) { for (long long i = 0; i < mid - l; i++) a[i] = dp[i + l]; for (long long i = 0; i < need; i++) b[i] = dp[i]; opt::conv(a, b, c, need); for (long long i = 0; i < need; i++) { c[i] *= 2; if (c[i] >= Mod) c[i] -= Mod; } } else { for (long long i = 0; i < mid - l; i++) a[i] = b[i] = dp[i + l]; opt::conv(a, b, c, need); } for (long long i = 0; i < need; i++) { a[i] = c[i]; b[i] = C[i]; } opt::conv(a, b, c, need); for (long long i = mid; i < r; i++) { dp[i] += c[i - l]; if (dp[i] >= Mod) dp[i] -= Mod; } solve(mid, r); } int main() { int i; scanf( %d%d , &n, &S); for (long long i = 1; i <= n; i++) { int a; scanf( %d , &a); C[a] = 1; } int N = 1; for (; N <= S; N *= 2) ; dp[0] = 1; solve(0, N); for (long long i = 1; i <= S; i++) printf( %d n , dp[i]); return 0; }
#include <bits/stdc++.h> using namespace std; long long aX[100001]; long long aY[100001]; int main() { long long n, k; cin >> n >> k; long long x, y; cin >> x >> y; long long mod = n * 2; for (int i = 0; i < n; i++) cin >> aX[i] >> aY[i]; k = k % mod; long long cx = 0, cy = 0; for (int i = 1; i <= k; i++) { cx = 2 * aX[(i - 1) % n] - cx; cy = 2 * aY[(i - 1) % n] - cy; } if (k % 2 == 1) cx -= x, cy -= y; else cx += x, cy += y; cout << cx << << cy << endl; return 0; }
#include <bits/stdc++.h> using namespace std; long long int arr[100005]; long long int l1[100005]; long long int l2[100005]; long long int d[100005]; long long int e[100005]; long long int tree[100005]; long long int tree2[100005]; void update(long long int idx, long long int val, long long int n) { while (idx <= n) { tree[idx] += val; idx += (idx & -idx); } } long long int read(long long int idx) { long long int sum = 0; while (idx > 0) { sum += tree[idx]; idx -= (idx & -idx); } return sum; } void update2(long long int idx, long long int val, long long int n) { while (idx <= n) { tree2[idx] += val; idx += (idx & -idx); } } long long int read2(long long int idx) { long long int sum = 0; while (idx > 0) { sum += tree2[idx]; idx -= (idx & -idx); } return sum; } int corona(int x, int y) { long long int s = 0, s1, s2; for (int i = x + 1; i <= y; i++) { if (l1[i] < l1[i - 1]) { s++; break; } } if (s == 0) return abs(y - x) + 1; else { s1 = corona(x, (x + y) / 2); s2 = corona(((x + y) / 2) + 1, y); return max(s1, s2); } } int main() { long long int n, a, q, b, t, c, m, k, x, y, x3 = 0, x4 = 0, x5 = 0; string s3, s4; cin >> t; while (t--) { cin >> n >> a >> b >> c; cin >> s3; for (int i = 0; i < s3.size(); i++) { if (s3[i] == R ) { if (b > 0) { b--; x3++; l1[i] = P ; } } else if (s3[i] == P ) { if (c > 0) { c--; x3++; l1[i] = S ; } } else if (s3[i] == S ) { if (a > 0) { a--; x3++; l1[i] = R ; } } } if (x3 >= ceil(n / 2.0)) { cout << YES n ; for (int i = 0; i < s3.size(); i++) { if (l1[i] == 0 && a > 0) { l1[i] = R ; a--; } else if (l1[i] == 0 && b > 0) { l1[i] = P ; b--; } else if (l1[i] == 0 && c > 0) { l1[i] = S ; c--; } s4 += (char)l1[i]; } cout << s4 << endl; } else cout << NO n ; x3 = 0; s4 = ; memset(l1, 0, sizeof l1); } return 0; }
#include <bits/stdc++.h> int main() { int i, A[30], k = 0, B[7]; for (i = 1; i <= 24; i++) { scanf( %d , &A[i]); } for (i = 1; i <= 6; i++) { if (A[4 * i] == A[4 * i - 1] && A[4 * i - 2] == A[4 * i - 3] && A[4 * i] == A[4 * i - 2]) { B[i] = 1; } else B[i] = 0; } if (B[1] == 1 && B[2] == 0 && B[3] == 1 && B[4] == 0 && B[5] == 0 && B[6] == 0) { if (A[13] == A[14] && A[13] == A[7] && A[8] == A[7] && A[5] == A[6] && A[5] == A[19] && A[19] == A[20] && A[17] == A[18] && A[23] == A[24] && A[18] == A[24]) k = 1; else if (A[13] == A[14] && A[13] == A[23] && A[23] == A[24] && A[5] == A[6] && A[5] == A[15] && A[15] == A[16] && A[17] == A[18] && A[18] == A[7] && A[7] == A[8]) k = 1; } if (1 == B[5] && B[4] == 1 && B[1] == 0 && B[2] == 0 && B[3] == 0 && B[6] == 0) { if (A[1] == A[3] && A[3] == A[6] && A[8] == A[6] && A[5] == A[7] && A[7] == A[10] && A[10] == A[12] && A[9] == A[11] && A[9] == A[21] && A[23] == A[21]) k = 1; else if (A[2] == A[4] && A[2] == A[5] && A[5] == A[7] && A[8] == A[6] && A[6] == A[9] && A[9] == A[11] && A[10] == A[12] && A[12] == A[22] && A[22] == A[24]) k = 1; } if (B[1] == 0 && B[2] == 1 && B[3] == 0 && B[4] == 0 && B[5] == 0 && B[6] == 1) { if (A[1] == A[2] && A[1] == A[14] && A[14] == A[16] && A[13] == A[15] && A[15] == A[9] && A[9] == A[10] && A[11] == A[12] && A[12] == A[19] && A[17] == A[19]) k = 1; else if (A[3] == A[4] && A[3] == A[13] && A[13] == A[15] && A[14] == A[16] && A[14] == A[11] && A[11] == A[12] && A[17] == A[19] && A[19] == A[1] && A[1] == A[2]) k = 1; } if (k == 1) printf( YES ); else printf( NO ); return 0; }
#include <bits/stdc++.h> double pi = 3.1415926535897931159979635; using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long cf = 0, cs = 0, c47 = 0, c74 = 0; string a; cin >> a; long long s = a.size(); for (int i = 0; i < s; i++) { if (a[i] == 4 ) { cf++; if (a[i - 1] == 7 && i > 0) c74++; } else if (a[i] == 7 ) { cs++; if (a[i - 1] == 4 && i > 0) c47++; } } if (cf == 0 && cs == 0) cout << -1 n ; else s = max(c47, max(c74, max(cf, cs))); if (s == cf) cout << 4 n ; else if (s == cs) cout << 7 n ; else if (s == c47) cout << 47 n ; else if (s == c74) cout << 74 n ; return 0; }
#include <bits/stdc++.h> using namespace std; int heights(long long int n) { long long int count = 0, m, k; for (long long int x = 1; x <= n; x++) { m = 3 * x * x + x; if (m > 2 * n) break; else { k = x + n; if (k % 3 == 0) count++; } } return count; } int main() { long long int n; cin >> n; cout << heights(n); cout << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int w; string ch(string s, char x, string b) { int n = s.size(); bool cx = 0; char mina = z ; for (int i = 0; i < n; i++) { if (s[i] == x && b[i] > s[i]) { cx = 1; mina = min(mina, b[i]); } } if (!cx) { return s; } w++; for (int i = 0; i < n; i++) { if (s[i] == x) s[i] = mina; } return s; } void solve() { w = 0; int n; cin >> n; string a, b; cin >> a >> b; for (int i = 0; i < n; i++) { if (b[i] < a[i]) { cout << -1 n ; return; } } for (int i = 0; i < 20; i++) { a = ch(a, ((char)i + 97), b); } cout << w << n ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t) { t--; solve(); } }
#include <bits/stdc++.h> using namespace std; const int SIZE = 84; const int VERTS = SIZE * SIZE; int n, m; int v, s, t; int pict[SIZE][SIZE]; const int dir[4][2] = {{1, 0}, {-1, 0}, {0, -1}, {0, 1}}; inline bool good(int x, int y) { return x >= 0 && y >= 0 && x < n && y < m; } struct Edge { int a, b; int flow; int cap, cost; int anti; }; vector<Edge> edges; vector<int> nbr[VERTS]; void AddEdge(int a, int b, int cap, int cost) { Edge e1; e1.a = a; e1.b = b; e1.flow = 0; e1.cap = cap; e1.cost = cost; e1.anti = edges.size() + 1; Edge e2; e2.a = b; e2.b = a; e2.flow = 0; e2.cap = 0; e2.cost = -cost; e2.anti = edges.size(); nbr[a].push_back(edges.size()); nbr[b].push_back(edges.size() + 1); edges.push_back(e1); edges.push_back(e2); } bool used[VERTS]; int dist[VERTS]; int father[VERTS]; int deq[VERTS]; bool Dijkstra(int &allFlow, int &allCost) { memset(dist, 63, sizeof(dist)); memset(father, -1, sizeof(father)); memset(used, false, sizeof(used)); dist[s] = 0; int l = 0, r = 1; deq[0] = s; while (l < r) { int best = deq[l++]; used[best] = true; for (int i = 0; i < nbr[best].size(); i++) { int eidx = nbr[best][i]; const Edge &e = edges[eidx]; if (e.flow == e.cap) continue; int newd = dist[best] + e.cost; if (dist[e.b] > newd) { bool first = dist[e.b] > 1000000000; dist[e.b] = newd; father[e.b] = eidx; if (used[e.b]) { used[e.b] = false; deq[--l] = e.b; } if (first) deq[r++] = e.b; } } } if (!used[t]) return false; allFlow++; int curr = t; while (curr != s) { int eidx = father[curr]; Edge &e = edges[eidx]; int pp = e.a; e.flow++; edges[e.anti].flow--; allCost += e.cost; curr = pp; } return true; } int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) scanf( %d , &pict[i][j]); s = n * m; t = n * m + 1; v = n * m + 2; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) { if ((i + j) & 1) { AddEdge(s, i * m + j, 1, 0); for (int d = 0; d < 4; d++) { int ni = i + dir[d][0]; int nj = j + dir[d][1]; if (!good(ni, nj)) continue; AddEdge(i * m + j, ni * m + nj, 1, pict[i][j] != pict[ni][nj]); } } else AddEdge(i * m + j, t, 1, 0); } int tflow = 0, tcost = 0; while (Dijkstra(tflow, tcost)) ; printf( %d n , tcost); return 0; }
#include <bits/stdc++.h> using namespace std; const long long MOD = 998244353; const double oula = 0.57721566490153286060651209; using namespace std; map<long long, string> mp; int main() { std::ios::sync_with_stdio(false); long long n; cin >> n; long long nn = sqrt(n); string tmp; for (long long i = 2; i <= nn; i++) { long long num = i * i; int co = 2; while (num <= n) { tmp = to_string(i) + ^ + to_string(co); if (!mp.count(num)) mp[num] = to_string(num); if (mp[num].size() > tmp.size()) mp[num] = tmp; co++; num *= i; } } string ans = to_string(n); map<long long, string>::iterator it; for (it = mp.begin(); it != mp.end(); it++) { tmp = ; long long a = n / it->first, b = n % it->first; if (a > 1) { if (mp.count(a)) tmp = mp[a]; else tmp = to_string(a); tmp += * ; } tmp += it->second; if (b) tmp = tmp + + + (mp.count(b) ? mp[b] : to_string(b)); if (ans.size() > tmp.size()) ans = tmp; } cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; int N; int axor[1 << 16]; int degree[1 << 16], s[1 << 16]; vector<pair<int, int>> edge; set<pair<int, int>> q; int main() { scanf( %d , &N); for (int i = 0; i < N; i++) { scanf( %d %d , &degree[i], &s[i]); q.insert({degree[i], i}); } for (int i = 0; i < N; i++) { int x, y; x = (*q.begin()).second; if (degree[x] == 0) { q.erase({degree[x], x}); continue; } if (degree[x] > 1) while (true) ; y = s[x] ^ axor[x]; axor[x] ^= y; if (axor[x] != s[x]) while (true) ; axor[y] ^= x; q.erase({degree[y], y}); q.erase({degree[x], x}); degree[x]--; degree[y]--; q.insert({degree[y], y}); if (x == y) while (true) ; edge.push_back({x, y}); } for (int i = 0; i < N; i++) if (axor[i] != s[i]) while (true) ; printf( %d n , edge.size()); for (auto i : edge) { printf( %d %d n , i.first, i.second); } return 0; }
#include <bits/stdc++.h> using namespace std; unsigned long long int gcd(unsigned long long int a, unsigned long long int b) { unsigned long long int max = a > b ? a : b; unsigned long long int min = a < b ? a : b; if (max % min == 0) return min; if (max % min == 1) return 1; return gcd(min, max % min); } int main() { int flag = 0; unsigned long long int l, r; cin >> l >> r; if (l - r < 2) { cout << -1 ; return 0; } unsigned long long int i, j, k; for (i = l; i <= r - 2; i++) { for (j = i + 1; j <= r - 1; j++) { if (gcd(i, j) == 1) { for (k = j + 1; k <= r; k++) { if (gcd(j, k) == 1 && gcd(i, k) != 1) { flag = 1; cout << i << << j << << k; break; } } } if (flag == 1) break; } if (flag == 1) break; } if (flag == 0) cout << -1 ; return 0; }
#include <bits/stdc++.h> using namespace std; long long a, b, c, n, m, k = 0, T, maxx = -0x3f3f3f3f; int main() { scanf( %lld , &T); while (T--) { scanf( %lld%lld , &n, &k); long long t = 0, tmp = 0; if (n == 2 && k == 3) { cout << No << endl; continue; } while (t < k) { t = t * 4 + 1; if (t > k) break; tmp++; } if (tmp > n || (tmp == n && k != t)) cout << NO n ; else { if (t > k) t = (t - 1) / 4; cout << YES ; long long s = ((1ll) << tmp); tmp = n - tmp; t = k - t; if (t >= 2 * s - 1) cout << tmp - 1 << endl; else cout << tmp << endl; } } }
#include <bits/stdc++.h> using namespace std; map<vector<long long>, long long> mp; int main() { long long n; cin >> n; long long a[] = {2, 3, 5, 7}; vector<long long> t; for (long long mask = 1; mask < (1 << 4); mask++) { t.clear(); for (long long j = 0; j < 4; j++) { if (mask & (1 << j)) t.push_back(a[j]); } sort(t.begin(), t.end()); long long y = 1; for (auto v : t) y *= v; mp[t] += n / y; } for (auto x : mp) { if (x.first.size() % 2) { n -= x.second; continue; } n += x.second; } cout << n << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int maxN = 2005; const int dx[10] = {0, 0, 0, 1, -1, 1, 1, -1, -1}; const int dy[10] = {0, 1, -1, 0, 0, -1, 1, -1, 1}; int n, area, sx, sy; bool p[maxN][maxN], vis[maxN][maxN]; void init() { scanf( %d , &n); for (int i = 1; i <= n; ++i) for (int j = 1; j <= n; ++j) scanf( %d , &p[i][j]); } void fixNoise() { int cnt; for (int tme = 1; tme <= 5; ++tme) for (int i = 1; i <= n; ++i) for (int j = 1; j <= n; ++j) { cnt = 0; for (int k = 0; k <= 8; ++k) cnt += p[i + dx[k]][j + dy[k]]; if (cnt < 5) p[i][j] = 0; else p[i][j] = 1; } } void dfs(int x, int y) { int xx, yy; vis[x][y] = 1; ++area; sx += x; sy += y; for (int i = 1; i <= 4; ++i) { xx = x + dx[i]; yy = y + dy[i]; if (xx < 1 || yy < 1 || xx > n || yy > n || !p[xx][yy] || vis[xx][yy]) continue; dfs(xx, yy); } } void work() { double ox, oy, r; int circle = 0, rectangle = 0; fixNoise(); for (int i = 1; i <= n; ++i) for (int j = 1; j <= n; ++j) if (p[i][j] && !vis[i][j]) { area = 0; sx = 0; sy = 0; dfs(i, j); if (area >= 158) { ox = double(sx) / area; oy = double(sy) / area; r = ((i - ox) * (i - ox)) + ((j - oy) * (j - oy)); if (area / r > 2.9) ++circle; else ++rectangle; } } printf( %d %d n , circle, rectangle); } int main() { init(); work(); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, k; cin >> n >> k; int sum = n - n % k; sum += min(n % k, k / 2); cout << sum << endl; } }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, m; cin >> n >> m; int floor[n][2 * m]; for (int i = 0; i < n; i++) { for (int j = 0; j < 2 * m; j++) { cin >> floor[i][j]; } } int count = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < 2 * m - 1; j += 2) { if (floor[i][j] == 1 || floor[i][j + 1] == 1) { count++; } } } cout << count << n ; }
#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; map<int, int> mx, my; map<pair<int, int>, int> mp; for (int i = 0; i < n; i++) { int first, second; cin >> first >> second; mx[first]++; my[second]++; mp[{first, second}]++; }; long long ans = 0; for (auto it : mx) { ans += (long long)it.second * (it.second - 1) / 2; } for (auto it : my) { ans += (long long)it.second * (it.second - 1) / 2; } for (auto it : mp) { ans -= (long long)it.second * (it.second - 1) / 2; } cout << ans << n ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int up[200005]; int down[200005]; vector<int> answer; bool done = true; ; int main() { int n; cin >> n; for (int i = 1; i < n; i++) { cin >> up[i]; } for (int i = 1; i < n; i++) { cin >> down[i]; } answer.push_back(0); int previous = 0; for (int i = 1; i < n; i++) { if (!done) { break; } done = false; for (int j = 0; j < 4; j++) { int x = previous & j; int z = previous | j; if ((x == down[i]) && (z == up[i])) { previous = j; done = true; answer.push_back(previous); break; } } } if (done) { cout << YES << endl; for (int i = 0; i < answer.size(); i++) { cout << answer[i] << ; } } else { answer.clear(); previous = 1; answer.push_back(1); done = true; for (int i = 1; i < n; i++) { if (!done) { break; } done = false; for (int j = 0; j < 4; j++) { int x = previous & j; int z = previous | j; if ((x == down[i]) && (z == up[i])) { previous = j; done = true; answer.push_back(previous); break; } } } if (done) { cout << YES << endl; for (int i = 0; i < answer.size(); i++) { cout << answer[i] << ; } } else { answer.clear(); previous = 2; answer.push_back(2); done = true; for (int i = 1; i < n; i++) { if (!done) { break; } done = false; for (int j = 0; j < 4; j++) { int x = previous & j; int z = previous | j; if ((x == down[i]) && (z == up[i])) { previous = j; done = true; answer.push_back(previous); break; } } } if (done) { cout << YES << endl; for (int i = 0; i < answer.size(); i++) { cout << answer[i] << ; } } else { answer.clear(); previous = 3; answer.push_back(3); done = true; for (int i = 1; i < n; i++) { if (!done) { break; } done = false; for (int j = 0; j < 4; j++) { int x = previous & j; int z = previous | j; if ((x == down[i]) && (z == up[i])) { previous = j; done = true; answer.push_back(previous); break; } } } if (done) { cout << YES << endl; for (int i = 0; i < answer.size(); i++) { cout << answer[i] << ; } } else { cout << NO << endl; } } } } return 0; }
#include <bits/stdc++.h> using namespace std; long long int modexpo(long long int x, long long int y) { if (y == 0) return 1; if (y % 2) { long long int viky = modexpo(x, y / 2); return (((x * viky) % 1000000000) * viky) % 1000000000; } else { long long int viky = modexpo(x, y / 2); return (viky * viky) % 1000000000; } } long long int a[1111]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int t, i, j, l, m, n, r, q, k, c, x; cin >> n; for (i = 1; i < n; i++) { cin >> l >> r; a[r]++; a[l]++; } c = 0; for (i = 1; i <= n; i++) { if (a[i] == 1) c++; } cout << c; return 0; }
#include <bits/stdc++.h> using namespace std; long long int ax, ay, bx, by, cx, cy; double k1, k2, k3; int main() { long long int dis_ab, dis_ac, dis_bc, max_dis = -1; cin >> ax >> ay >> bx >> by >> cx >> cy; dis_ab = (ax - bx) * (ax - bx) + (ay - by) * (ay - by); k1 = (double)(ax - bx) / (ay - by); dis_ac = (ax - cx) * (ax - cx) + (ay - cy) * (ay - cy); k2 = (double)(ax - cx) / (ay - cy); dis_bc = (bx - cx) * (bx - cx) + (by - cy) * (by - cy); k3 = (double)(bx - cx) / (by - cy); if (k1 == k2 && k2 == k3) cout << No ; else { if (dis_ab == dis_bc) cout << Yes ; else cout << No ; } return 0; }
#include <bits/stdc++.h> int main() { int n; std::scanf( %d , &n); for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { std::printf( %d , j * n + (j % 2 == 0 ? i : n - i - 1) + 1); } std::printf( n ); } return 0; }
#include <bits/stdc++.h> using namespace std; const int INF = 1000000001; const double EPS = 10e-9; const int MAXN = 100005; pair<int, int> t[MAXN << 1]; int MOD; void rob() { int n; scanf( %d , &n); int tmp; for (typeof(0) i = (0); i < (n); ++i) { scanf( %d , &tmp); t[i] = make_pair(tmp, i); } for (typeof(0) i = (0); i < (n); ++i) { scanf( %d , &tmp); t[n + i] = make_pair(tmp, i); } scanf( %d , &MOD); n <<= 1; sort(t, t + n); long long res = 1; int i = 0; int pow; int fac; while (i < n) { fac = 1; pow = 0; for (++i; i < n; ++i) { if (t[i].first != t[i - 1].first) break; if (t[i].second == t[i - 1].second) ++pow; ++fac; } for (typeof(1) j = (1); j <= (fac); ++j) { if (pow && !(j & 1)) { res = (res * (j >> 1)) % MOD; --pow; } else { res = (res * j) % MOD; } } } printf( %I64d n , res); } int main() { int test = 1; while (test--) rob(); return 0; }
#include <bits/stdc++.h> using namespace std; const int MAX = 1e5 + 10; int arr[MAX]; int n; int query(int x, int y, int z) { cout << ? << x << << y << << z << endl; int a; cin >> a; return a; } array<int, 3> col[2]; int ans[MAX]; vector<int> v; int main() { int t; cin >> t; while (t--) { v.clear(); col[0] = col[1] = {-1, -1, -1}; cin >> n; for (int i = 1; i <= n; i += 3) { arr[i] = query(i, i + 1, i + 2); col[arr[i]] = {i, i + 1, i + 2}; } int x = -1, y = -1; for (int i = 0; i < 3; ++i) { if (query(col[0][0], col[0][1], col[1][i])) { y = col[1][i]; break; } } if (y == -1) { x = col[0][0]; if (query(col[1][0], col[1][1], x)) y = col[1][0]; else if (query(col[1][0], col[1][2], x)) y = col[1][0]; else y = col[1][1]; } else x = col[0][2]; ans[x] = 0, ans[y] = 1; for (int i = 1; i <= n; i += 3) { if (i == col[arr[i]][0]) { for (int j = i; j <= i + 2; ++j) { if (j == x || j == y) continue; ans[j] = query(x, y, j); } continue; } int c = x; if (!arr[i]) c = y; int a = query(i, i + 1, c); int b = query(i, i + 2, c); int idx = -1; if (a != arr[i] && b != arr[i]) idx = i; else if (a != arr[i]) idx = i + 1; else if (b != arr[i]) idx = i + 2; for (int j = i; j <= i + 2; ++j) { if (idx == j) ans[j] = !arr[i]; else ans[j] = arr[i]; } } for (int i = 1; i <= n; ++i) { if (!ans[i]) v.push_back(i); } cout << ! << v.size() << ; for (auto &i : v) cout << i << ; cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1010; struct node { double x; double y; double t; double p; bool operator<(const node& W) const { return t < W.t; } } q[N]; double dp[N]; bool check(node a, node b) { double dx = a.x - b.x; double dy = a.y - b.y; return sqrt(dx * dx + dy * dy) <= b.t - a.t; } int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> q[i].x >> q[i].y >> q[i].t >> q[i].p; } sort(q + 1, q + n + 1); dp[1] = q[1].p; for (int i = 2; i <= n; i++) { dp[i] = q[i].p; for (int j = 1; j <= i - 1; j++) if (check(q[j], q[i])) dp[i] = max(dp[i], dp[j] + q[i].p); } double res = 0; for (int i = 1; i <= n; i++) res = max(res, dp[i]); printf( %.6lf n , res); return 0; }
#include <bits/stdc++.h> using namespace std; int n, m, k; int x[505], y[505]; int x_koord[1005], y_koord[1005], kk, kkx, kky; int z[1055][1055]; bool popuni(int sz) { kk = 0; for (int i = 1; i <= k; i++) { int xl = x[i] - sz; if (xl < 1) { xl = 1; } int xr = x[i] + sz + 1; if (xr > n + 1) { xr = n + 1; } int yl = y[i] - sz; if (yl < 1) { yl = 1; } int yr = y[i] + sz + 1; if (yr > m + 1) { yr = m + 1; } kk++; x_koord[kk] = xl; y_koord[kk] = yl; kk++; x_koord[kk] = xr; y_koord[kk] = yr; } kk++; x_koord[kk] = 1; y_koord[kk] = 1; kk++; x_koord[kk] = n + 1; y_koord[kk] = m + 1; sort(x_koord + 1, x_koord + kk + 1); kkx = unique(x_koord + 1, x_koord + kk + 1) - x_koord - 1; sort(y_koord + 1, y_koord + kk + 1); kky = unique(y_koord + 1, y_koord + kk + 1) - y_koord - 1; memset(z, 0, sizeof(z)); for (int i = 1; i <= k; i++) { int xl = x[i] - sz; if (xl < 1) { xl = 1; } int xr = x[i] + sz + 1; if (xr > n + 1) { xr = n + 1; } int yl = y[i] - sz; if (yl < 1) { yl = 1; } int yr = y[i] + sz + 1; if (yr > m + 1) { yr = m + 1; } xl = lower_bound(x_koord + 1, x_koord + kkx + 1, xl) - x_koord; xr = lower_bound(x_koord + 1, x_koord + kkx + 1, xr) - x_koord; yl = lower_bound(y_koord + 1, y_koord + kky + 1, yl) - y_koord; yr = lower_bound(y_koord + 1, y_koord + kky + 1, yr) - y_koord; z[xl][yl]++; z[xl][yr]--; z[xr][yl]--; z[xr][yr]++; } int loy = 2e9, hiy = -2e9, lox = 2e9, hix = -2e9; int any = 0; for (int i = 1; i < kkx; i++) { for (int j = 1; j < kky; j++) { z[i][j] += z[i - 1][j] + z[i][j - 1] - z[i - 1][j - 1]; if (z[i][j] == 0) { any = 1; lox = min(lox, x_koord[i]); hix = max(hix, x_koord[i + 1]); loy = min(loy, y_koord[j]); hiy = max(hiy, y_koord[j + 1]); } } } if (!any) { return true; } cerr << sz << << lox << << hix << << loy << << hiy << n ; return max(hiy - loy, hix - lox) / 2 <= sz; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cerr.tie(nullptr); cin >> n >> m >> k; for (int i = 1; i <= k; i++) { cin >> x[i] >> y[i]; } int l = 0, r = 1e9, o = 1e9; while (l <= r) { int m = (l + r) / 2; if (popuni(m)) { o = m; r = m - 1; } else { l = m + 1; } } cout << o; }
#include <bits/stdc++.h> using namespace std; char s[1000010]; int n, p[1000010]; int main() { scanf( %s , s), n = strlen(s); for (int i = 0; i < n; i++) if (s[i] == 1 ) p[n - 1 - i] = 1; for (int i = 0, j; i < n + 2;) if (!p[i]) i++; else { j = i; while (p[j]) j++; if (j - i >= 2) { p[i] = -1; for (int k = i + 1; k < j; k++) p[k] = 0; p[j] = 1; } i = j; } int S = 0; for (int i = 0; i < n + 2; i++) if (p[i] != 0) S++; printf( %d n , S); for (int i = 0; i < n + 2; i++) if (p[i] != 0) if (p[i] > 0) printf( +2^%d n , i); else printf( -2^%d n , i); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int i, j, k; int n; cin >> n; int x = n / 4; string s = abcd ; string ans = ; if (n % 4 == 0) for (i = 0; i < x; i++) ans += s; else { if (n % 4 == 1) { for (i = 0; i < x; i++) ans += s; ans += a ; } if (n % 4 == 2) { for (i = 0; i < x; i++) ans += s; ans += ab ; } if (n % 4 == 3) { for (i = 0; i < x; i++) ans += s; ans += abc ; } } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << << H; debug_out(T...); } const int INF = 1e9; const long long MOD = 1e9 + 7; const int N = 1e5 + 5, MO = 350, SQ = 650; int n, q, A[N], QL[N], QR[N], P[N], T[N], C[N], K[N], Q[N]; vector<int> B, X, Y; bool CMP(int i, int j) { if (QL[i] / MO != QL[j] / MO) return QL[i] < QL[j]; return (QL[i] / MO) % 2 ? QR[i] > QR[j] : QR[i] < QR[j]; } void Update(int x, int y) { T[C[x]]--, C[x] += y, T[C[x]]++; } void Insert(int x, int y) { if (x >= SQ && !K[x]) Y.push_back(x); K[x] += y; } int Huf() { X.clear(), Y.clear(); for (int i : B) if (C[i] >= SQ) X.push_back(C[i]), K[C[i]]++; sort(X.begin(), X.end()); int huf = 0, c = 0, x = 0, y = 0; for (int i = 1; i < SQ; i++) if (K[i] + T[i]) { K[i] += T[i]; if (c) huf += i + c, K[i]--, Insert(i + c, 1), c = 0; if (K[i] & 1) c = i, K[i]--; if (K[i]) huf += i * K[i], Insert(i + i, K[i] >> 1), K[i] = 0; } while (x < (int)(X.size()) || y < (int)(Y.size())) { while (x + 1 < (int)(X.size()) && X[x + 1] == X[x]) x++; while (y + 1 < (int)(Y.size()) && Y[y + 1] == Y[y]) y++; int i = 0; if (x == (int)(X.size())) i = Y[y++]; else if (y == (int)(Y.size())) i = X[x++]; else if (X[x] < Y[y]) i = X[x++]; else i = Y[y++]; if (c) huf += i + c, K[i]--, Insert(i + c, 1), c = 0; if (K[i] & 1) c = i, K[i]--; if (K[i]) huf += i * K[i], Insert(i + i, K[i] >> 1), K[i] = 0; } return huf; } int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); mt19937 Rnd(time(0)); cin >> n; for (int i = 0; i < n; i++) cin >> A[i], C[A[i]]++; for (int i = 0; i < N; i++) if (C[i] >= SQ) B.push_back(i); for (int i = 0; i < n; i++) C[A[i]]--; cin >> q; for (int i = 0; i < q; i++) cin >> QL[i] >> QR[i], QL[i]--, P[i] = i; sort(P, P + q, CMP); int L = 0, R = 0; for (int i = 0; i < q; i++) { int l = QL[P[i]], r = QR[P[i]]; while (l < L) Update(A[--L], +1); while (R < r) Update(A[R++], +1); while (L < l) Update(A[L++], -1); while (r < R) Update(A[--R], -1); Q[P[i]] = Huf(); } for (int i = 0; i < q; i++) cout << Q[i] << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); long long t, n, i, j, flag = 0, temp, nodes, a, b, m, k, sz, sm, res; long long mn, mx; long long l, r; long long x, y, z; long long c, d; t = 1; vector<pair<int, int>> v; string s; char ch; while (t--) { flag = 0; v.clear(); cin >> n; int A = INT_MAX, B = INT_MIN; for (i = 0; i < n; i++) { cin >> a >> b; v.push_back({a, b}); if (a < A) A = a; if (B < b) B = b; } for (i = 0; i < v.size(); i++) { if (v[i].first == A && v[i].second == B) { flag = 1; break; } } if (flag == 1) { cout << i + 1 << endl; continue; } else { cout << -1 ; continue; } } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; char a[N], b[N]; int s[N][26]; void init() { int n = strlen(a + 1); memset(s, 0, sizeof(s)); for (int i = n; i >= 1; i--) { for (int j = 0; j < 26; j++) { s[i - 1][j] = s[i][j]; } s[i - 1][a[i] - a ] = i; } } int main() { int T; cin >> T; while (T--) { scanf( %s %s , a + 1, b + 1); init(); int flg = 0; int p = 0; int ans = 1; for (int i = 1; i <= strlen(b + 1); i++) { int t = b[i] - a ; int tt = s[p][t]; if (tt == 0 && p == 0) { flg = 1; break; } if (tt == 0) { i--; ans++; p = 0; } else { p = tt; } } if (flg == 1) { printf( -1 n ); continue; } printf( %d n , ans); } return 0; }
#include <bits/stdc++.h> using namespace std; const long long int N = 500009; const long long int mod = 1000000007; long long int n, k; string s; string see; vector<long long int> v; void pre() { see = s; for (auto i : s) see += i; for (auto i : s) see += i; } int32_t main() { cin >> n >> k >> s; pre(); for (long long int i = 0; i < 3 * n;) { long long int j = i; long long int pahla = i; long long int doosra = i - 1; long long int idharhi = 0; while (doosra < (3 * n - 1)) { if (see[i] == see[doosra + 1]) doosra++; else break; } if (doosra == pahla) { i++; continue; } for (long long int k = i; k <= doosra; k++) { v.push_back(k); } i = doosra + 1; } if (v.size() == 0) { if (k % 2 == 0) { cout << s << n ; return 0; } else { for (auto i : s) { if (i == W ) cout << B ; else cout << W ; } cout << n ; return 0; } } string ans = ; for (long long int i = n; i < 2 * n; i++) { auto it = lower_bound(v.begin(), v.end(), i); long long int is = it - v.begin(); if (v[is] == i) { ans += see[i]; continue; } is--; long long int dis1 = i - v[is]; is++; long long int dis2 = v[is] - i; assert(dis1 > 0 and dis2 > 0); if (dis1 > k && dis2 > k) { if (k % 2 == 0) { ans += see[i]; } else { if (see[i] == W ) ans += B ; else ans += W ; } continue; } else if (dis1 <= k && dis1 < dis2) { ans += see[v[is - 1]]; } else if (dis2 <= k && dis2 < dis1) { ans += see[v[is]]; } else { ans += see[v[is]]; } } assert((long long int)ans.length() == n); cout << ans << n ; }
#include <bits/stdc++.h> using namespace std; int nod(int a, int b) { int c; if (a > b) swap(a, b); for (;;) { c = b % a; b = a; a = c; if (a == 0) return b; } } int main() { int x, y, a, b; cin >> x >> y >> a >> b; int d = x * y / nod(x, y); int c = b / d - (a - 1) / d; if (c < 0) c = 0; cout << c; return 0; }
#include <bits/stdc++.h> using namespace std; int n = 0, a, tc; int p[100005]; vector<int> cho[6][100005]; int sum[6]; int ret = 0; void doit(int x, int cur) { if (x == n - 1) { ret += cho[x + 5 - n][cur].size(); return; } for (int i = 0; i < cho[x + 5 - n][cur].size(); i++) { int ti = cho[x + 5 - n][cur][i]; for (int j = 0; j < n - x - 1; j++) { sum[n - 1 - j] = sum[n - 1 - j] * 10 + ti % 10; ti /= 10; } doit(x + 1, sum[x + 1]); for (int j = 0; j < n - x - 1; j++) { sum[n - 1 - j] /= 10; } } } int main() { scanf( %d , &tc); for (int i = 0; i <= 100000; i++) p[i] = 1; p[0] = p[1] = 0; for (int i = 2; i <= 100000; i++) if (p[i] == 1) { int ti = i; for (int j = 0; j < 5; j++) { cho[5 - j][ti].push_back(i); ti /= 10; } for (int j = i + i; j <= 100000; j += i) p[j] = 0; } while (tc--) { scanf( %d , &a); int ti = a; ret = 0; n = 0; while (ti > 0) { sum[n] = ti % 10; ti /= 10; n++; } for (int i = 0; i < n / 2; i++) swap(sum[i], sum[n - 1 - i]); doit(1, sum[1]); printf( %d n , ret); } }
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 10; int n, q, k; vector<pair<int, int> > tree[N << 2]; int ask[N], ans[N]; struct que { int x, y, times, l; }; queue<que> Q; int fa[N], h[N], siz[N]; int find(int o) { if (o != fa[o]) { return find(fa[o]); } return o; } struct gu { int first, second, val; }; gu merge(int x, int y) { x = find(x); y = find(y); gu re; re.val = -1; if (x == y) return re; if (h[x] > h[y]) swap(x, y); fa[x] = y; siz[y] += siz[x]; re.val = h[x] == h[y]; h[y] += h[x] == h[y]; re.first = x; re.second = y; return re; } void del(int x, int y, int val) { h[y] -= val; siz[y] -= siz[x]; fa[x] = x; } void add(int o, int l, int r, int L, int R, pair<int, int> x) { if (l >= L && r <= R) { tree[o].push_back(x); return; } int mid = (l + r) >> 1; if (mid >= L) add(o << 1, l, mid, L, R, x); if (mid < R) add(o << 1 | 1, mid + 1, r, L, R, x); } int tp; gu s[1000100]; void qu(int o, int l, int r) { int now = tp, sf = 0; for (int i = 0; i < tree[o].size(); ++i) { pair<int, int> now = tree[o][i]; s[++tp] = merge(now.first, now.second); } if (l == r) { ans[l] = siz[find(ask[l])]; } else { int mid = (l + r) >> 1; qu(o << 1, l, mid); qu(o << 1 | 1, mid + 1, r); } while (tp != now) { if (s[tp].val != -1) del(s[tp].first, s[tp].second, s[tp].val); --tp; } } int main() { scanf( %d%d%d , &n, &q, &k); for (int i = 1; i <= n; ++i) fa[i] = i, siz[i] = 1, h[i] = 1; int days = 1; for (int i = 1; i <= q; ++i) { int op; scanf( %d , &op); if (op == 1) { int x, y; scanf( %d%d , &x, &y); Q.push((que){x, y, days, i}); } if (op == 2) { int o; scanf( %d , &o); ask[i] = o; } if (op == 3) { ++days; while (!Q.empty() && Q.front().times <= days - k) { add(1, 1, q, Q.front().l, i - 1, make_pair(Q.front().x, Q.front().y)); Q.pop(); } } } while (!Q.empty()) { add(1, 1, q, Q.front().l, q, make_pair(Q.front().x, Q.front().y)); Q.pop(); } qu(1, 1, q); for (int i = 1; i <= q; ++i) { if (ask[i]) printf( %d n , ans[i]); } }
#include <bits/stdc++.h> using namespace std; const int s_size = 1e5 + 5; const int mod = 1e9 + 7; int f[(s_size + 1) >> 1] = {1}, t[(s_size + 1) >> 1], g[(s_size + 1) >> 1]; int fac[s_size] = {1}, inv[s_size], ans[s_size]; int num(char c); void fac_inv(void); int qpow(int a, int b); int main(void) { int q, x, y, cnt[55] = {0}, plan[55][55]; string s; cin >> s >> q; s = 0 + s; int length = s.size() - 1, upper = (length >> 1); for (int i = 1; i <= length; i++) cnt[num(s[i])]++; fac_inv(); int coe = (static_cast<long long>(fac[upper]) * fac[upper]) % mod; for (int i = 1; i <= 52; i++) if (cnt[i] > 0) { coe = (static_cast<long long>(coe) * inv[cnt[i]]) % mod; for (int j = upper; j >= cnt[i]; j--) f[j] = (f[j] + f[j - cnt[i]]) % mod; } for (int i = 1; i <= 52; i++) if (cnt[i] > 0) { plan[i][i] = f[upper]; for (int j = 0; j <= upper; j++) if (j >= cnt[i]) t[j] = (static_cast<long long>(f[j]) - t[j - cnt[i]] + mod) % mod; else t[j] = f[j]; for (int j = i + 1; j <= 52; j++) if (cnt[j] > 0) { for (int k = 0; k <= upper; k++) { if (k >= cnt[j]) g[k] = (static_cast<long long>(t[k]) - g[k - cnt[j]] + mod) % mod; else g[k] = t[k]; plan[i][j] = (static_cast<long long>(2) * g[upper]) % mod; plan[j][i] = plan[i][j]; } } } for (int i = 1; i <= q; i++) { cin >> x >> y; ans[i] = (static_cast<long long>(coe) * plan[num(s[x])][num(s[y])]) % mod; } for (int i = 1; i <= q; i++) cout << ans[i] << endl; return 0; } inline int num(char c) { return islower(c) ? c - a + 1 : c - A + 27; } void fac_inv(void) { for (int i = 1; i <= s_size - 5; i++) fac[i] = (static_cast<long long>(fac[i - 1]) * i) % mod; inv[s_size - 5] = qpow(fac[s_size - 5], mod - 2); for (int i = s_size - 6; i >= 0; i--) inv[i] = (static_cast<long long>(inv[i + 1]) * (i + 1)) % mod; } int qpow(int a, int b) { int ret = 1; while (b > 0) { if ((b & 1) == 1) ret = (static_cast<long long>(ret) * a) % mod; a = (static_cast<long long>(a) * a) % mod; b >>= 1; } return ret; }
#include <bits/stdc++.h> using namespace std; long long int INF = (long long int)1e16; int n, m, r; vector<int> s, b; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); s.clear(); b.clear(); cin >> n >> m >> r; int x, y; int bax = INT_MAX; int bay = INT_MIN; for (int i = 0; i < n; i++) { cin >> x; bax = min(bax, x); } for (int i = 0; i < m; i++) { cin >> y; bay = max(bay, y); } int bht = r / bax; int cost = bht * bay + r % bax; cout << max(cost, r) << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int cont[1003], sum[1003]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int ans = 0; string s1, s2; cin >> s1 >> s2; int n = s1.size(); int m = s2.size(); for (int i = 0; i < n; i++) cont[s1[i] - a ]++; for (int i = 0; i < m; i++) sum[s2[i] - a ]++; for (int i = 0; i < 26; i++) { if (sum[i] > 0 && cont[i] == 0) { cout << -1 << n ; return 0; } if (sum[i] > cont[i]) ans += cont[i]; else ans += sum[i]; } cout << ans << n ; return 0; }
#include <bits/stdc++.h> using namespace std; inline long long getint() { long long num = 0, flag = 1; char c; while ((c = getchar()) < 0 || c > 9 ) if (c == - ) flag = -1; while (c >= 0 && c <= 9 ) num = num * 10 + c - 48, c = getchar(); return num * flag; } int n, m, q, R; int fir[600005], nxt[600005], to[600005], cnt; int sz[600005], tp[600005], fa[600005], son[600005], dpt[600005], pos[600005], cur; map<pair<int, int>, int> M; int p[600005], V[600005]; int P_stk[600005], P_Tp; inline int rotate(int x) { x = (x + R) % n; return x ? x : x + n; } inline bool cmp(int x, int y) { return pos[x] < pos[y]; } inline void newnode(int u, int v) { to[++cnt] = v, nxt[cnt] = fir[u], fir[u] = cnt; } inline void dfs1(int u) { sz[u] = 1; pos[u] = ++cur; for (int i = fir[u]; i; i = nxt[i]) if (to[i] != fa[u]) { fa[to[i]] = u, dpt[to[i]] = dpt[u] + 1; dfs1(to[i]), sz[u] += sz[to[i]]; if (sz[to[i]] > sz[son[u]]) son[u] = to[i]; } } inline void dfs2(int u, int ac) { tp[u] = ac; if (son[u]) dfs2(son[u], ac); for (int i = fir[u]; i; i = nxt[i]) if (to[i] != fa[u] && to[i] != son[u]) dfs2(to[i], to[i]); } inline int LCA(int u, int v) { for (; tp[u] != tp[v] && u && v; u = fa[tp[u]]) if (dpt[tp[u]] < dpt[tp[v]]) swap(u, v); if (!u || !v) return 0; return dpt[u] < dpt[v] ? u : v; } struct node { vector<int> G[600005], Id[600005]; int dfn[600005], low[600005], tim, vis[600005], sccno[600005], scccnt; int stk[600005], Tp; inline void tarjan(int u) { dfn[u] = low[u] = ++tim; stk[++Tp] = u; for (int i = 0, v; i < G[u].size(); i++) if (!vis[Id[u][i]]) { vis[Id[u][i]] = 1; if (!dfn[v = G[u][i]]) tarjan(v), low[u] = min(low[u], low[v]); else if (!sccno[v]) low[u] = min(low[u], dfn[v]); } if (dfn[u] == low[u]) { scccnt++; while (1) { sccno[stk[Tp]] = scccnt; if (stk[Tp--] == u) break; } } } inline void init() { for (int i = 1; i <= m; i++) { int u = getint(), v = getint(); G[u].push_back(v), G[v].push_back(u); Id[u].push_back(i), Id[v].push_back(i); } for (int i = 1; i <= n; i++) if (!dfn[i]) tarjan(i); for (int u = 1; u <= n; u++) for (int i = 0; i < G[u].size(); i++) if (sccno[G[u][i]] != sccno[u]) { int x = min(sccno[u], sccno[G[u][i]]), y = max(sccno[u], sccno[G[u][i]]); if (!M[make_pair(x, y)]) newnode(x, y), newnode(y, x), M[make_pair(x, y)] = 1; } } } G, H; int main() { n = getint(), m = getint(), q = getint(); G.init(); for (int i = 1; i <= G.scccnt; i++) if (!sz[i]) dfs1(i), dfs2(i, i); for (int t = 1; t <= q; t++) { int N = getint(), M = getint(), K = 0, tmp = 0; P_Tp = 0; for (int i = 1; i <= N; i++) { int x = G.sccno[rotate(getint())]; p[++K] = x, V[x] = 1; } for (int i = 1; i <= M; i++) { int x = G.sccno[rotate(getint())], y = G.sccno[rotate(getint())]; if (x == y) continue; p[++K] = x, p[++K] = y, tmp++; H.G[x].push_back(y), H.G[y].push_back(x); H.Id[x].push_back(tmp), H.Id[y].push_back(tmp); } sort(p + 1, p + K + 1, cmp), K = unique(p + 1, p + K + 1) - p - 1; for (int i = K - 1; i; i--) { int x = LCA(p[i], p[i + 1]); if (x) p[++K] = x; } sort(p + 1, p + K + 1, cmp), K = unique(p + 1, p + K + 1) - p - 1; for (int i = 1; i <= K; i++) { while (P_Tp && pos[P_stk[P_Tp]] + sz[P_stk[P_Tp]] <= pos[p[i]]) P_Tp--; if (P_Tp) { int x = P_stk[P_Tp], y = p[i]; tmp++; H.G[x].push_back(y), H.G[y].push_back(x); H.Id[x].push_back(tmp), H.Id[y].push_back(tmp); } P_stk[++P_Tp] = p[i]; } for (int i = 1; i <= K; i++) if (!H.dfn[p[i]]) H.tarjan(p[i]); int pp = 0; bool flg = 1; for (int i = 1; i <= K; i++) if (V[p[i]]) { if (!pp) pp = H.sccno[p[i]]; else if (pp != H.sccno[p[i]]) { flg = 0; break; } } for (int i = 1; i <= K; i++) { H.G[p[i]].clear(), H.Id[p[i]].clear(); H.dfn[p[i]] = H.low[p[i]] = H.sccno[p[i]] = V[p[i]] = 0; } for (int i = 1; i <= tmp; i++) H.vis[i] = 0; H.scccnt = H.tim = H.Tp = 0; R = (R + t * flg) % n; puts(flg ? YES : NO ); } }
#include <bits/stdc++.h> using namespace std; int n; long long m; int soln[51]; long long mr = 0; int main() { cin >> n >> m; --m; for (int k = 1; k < n; ++k) { mr = mr * 2 + (m & 1); m >>= 1; } int i = 1, j = n; for (int k = 1; k <= n; ++k) { if (mr & 1) soln[j--] = k; else soln[i++] = k; mr >>= 1; } for (int k = 1; k <= n; ++k) cout << soln[k] << ; cout << endl; }
#include <bits/stdc++.h> using namespace std; long long n, k, x; long long m[200010]; long long answer; struct node { long long pre; long long next; } p[200010]; int main() { long long a; while (~scanf( %I64d %I64d %I64d , &n, &k, &x)) { answer = p[1].pre = p[n].next = 0; a = x; for (long long i = k - 1; i > 0; i--) a *= x; for (long long i = 1; i <= n; i++) { scanf( %d , &m[i]); p[i].pre = (m[i - 1] | p[i - 1].pre); } for (long long i = n; i >= 1; i--) { if (i < n) p[i].next = (p[i + 1].next | m[i + 1]); answer = max(answer, (p[i].pre | p[i].next | m[i] * a)); } printf( %I64d n , answer); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int x, y, z; cin >> x >> y >> z; if (z == 0) { if (x > y) cout << + ; else if (x < y) cout << - ; else cout << 0 ; } else { if (x > y + z) cout << + ; else if (y > x + z) cout << - ; else cout << ? ; } return 0; }
#include <bits/stdc++.h> int main() { char name[100], winner[100]; int sh, uh, a, b, v, c, d, e; int n, i; int sum; int total = sum; scanf( %d , &n); scanf( %s %d %d %d %d %d %d %d , name, &sh, &uh, &a, &b, &c, &d, &e); sum = sh * 100 - uh * 50 + a + b + c + d + e; total = sum; strcpy(winner, name); for (i = 0; i < n - 1; i++) { scanf( %s %d %d %d %d %d %d %d , name, &sh, &uh, &a, &b, &c, &d, &e); sum = sh * 100 - uh * 50 + a + b + c + d + e; if (sum > total) { total = sum; strcpy(winner, name); } } printf( %s , winner); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, i, j = 0; char d; cin >> n; string s; cin >> s; char a[n][n + 1]; for (i = 0; i < n; i++) { s.copy(a[i], n - i, i), s.copy(a[i] + (n - i), i), a[i][n] = 0; d = ( 9 - a[i][0] + 1) % 10; for (j = 0; j < n; j++) a[i][j] = (((a[i][j] + d) > 9 ) ? (a[i][j] - 10) : a[i][j]) + d; } for (i = 1, j = 0; i < n; i++) j = ((strcmp(a[i], a[j]) < 0) ? i : j); puts(a[j]); return 0; }
#include <bits/stdc++.h> using namespace std; template <class T1> void deb(T1 e) { cout << e << endl; } template <class T1, class T2> void deb(T1 e1, T2 e2) { cout << e1 << << e2 << endl; } template <class T1, class T2, class T3> void deb(T1 e1, T2 e2, T3 e3) { cout << e1 << << e2 << << e3 << endl; } template <class T1, class T2, class T3, class T4> void deb(T1 e1, T2 e2, T3 e3, T4 e4) { cout << e1 << << e2 << << e3 << << e4 << endl; } template <class T1, class T2, class T3, class T4, class T5> void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) { cout << e1 << << e2 << << e3 << << e4 << << e5 << endl; } template <class T1, class T2, class T3, class T4, class T5, class T6> void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5, T6 e6) { cout << e1 << << e2 << << e3 << << e4 << << e5 << << e6 << endl; } template <class T> T Abs(T x) { return x > 0 ? x : -x; } template <class T> inline T sqr(T x) { return x * x; } long long Pow(long long B, long long P) { long long R = 1; while (P > 0) { if (P % 2 == 1) R = (R * B); P /= 2; B = (B * B); } return R; } int BigMod(long long B, long long P, long long M) { long long R = 1; while (P > 0) { if (P % 2 == 1) { R = (R * B) % M; } P /= 2; B = (B * B) % M; } return (int)R; } int n, l, k; vector<int> prize; vector<double> prb; double dp[202][202][202]; double rec(int pos, int need_2_win, int bags) { if (pos >= n) { if (need_2_win >= l && bags + k >= need_2_win) return 1.00; else return 0.0; } double &ret = dp[pos][need_2_win][bags]; if (ret > -.5) return ret; ret = 0.0; ret += (prb[pos] / 100.0) * rec(pos + 1, need_2_win + 1, min(200, bags + prize[pos])); ret += (max(100.0 - prb[pos], 0.0) / 100.0) * rec(pos + 1, need_2_win, bags); return ret; } int main(void) { double val; int a; scanf( %d %d %d , &n, &l, &k); for (int i = 0; i < n; i++) { scanf( %lf , &val); prb.push_back(val); } for (int i = 0; i < n; i++) { scanf( %d , &a); prize.push_back(a + 1); } memset(dp, -1, sizeof dp); double ans = rec(0, 0, 0); printf( %.12lf n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; const int inf = 2000000000; static inline int Rint() { struct X { int dig[256]; X() { for (int i = 0 ; i <= 9 ; ++i) dig[i] = 1; dig[ - ] = 1; } }; static X fuck; int s = 1, v = 0, c; for (; !fuck.dig[c = getchar()];) ; if (c == - ) s = 0; else if (fuck.dig[c]) v = c ^ 48; for (; fuck.dig[c = getchar()]; v = v * 10 + (c ^ 48)) ; return s ? v : -v; } template <typename T> static inline void cmax(T& a, const T& b) { if (b > a) a = b; } template <typename T> static inline void cmin(T& a, const T& b) { if (b < a) a = b; } char buff[1024][1024]; char temp[1024][1024]; int n, m; int sol_row(int u, int v, int a, int b) { for (int j = 0; j < m; ++j) { int match1 = 1, match2 = 1; int p[2]; if (j % 2 == 0) p[0] = u, p[1] = v; else p[0] = a, p[1] = b; for (int i = 0; i < n; ++i) if (buff[i][j] != 0 ) { if (buff[i][j] != p[i % 2]) match1 = 0; if (buff[i][j] != p[1 - i % 2]) match2 = 0; } if (!match1 && !match2) return 0; for (int i = 0; i < n; ++i) { if (match1) temp[i][j] = p[i % 2]; else temp[i][j] = p[1 - i % 2]; } } return 1; } int sol_col(int u, int v, int a, int b) { for (int i = 0; i < n; ++i) { int match1 = 1, match2 = 1; int p[2]; if (i % 2 == 0) p[0] = u, p[1] = v; else p[0] = a, p[1] = b; for (int j = 0; j < m; ++j) if (buff[i][j] != 0 ) { if (buff[i][j] != p[j % 2]) match1 = 0; if (buff[i][j] != p[1 - j % 2]) match2 = 0; } if (!match1 && !match2) return 0; for (int j = 0; j < m; ++j) { if (match1) temp[i][j] = p[j % 2]; else temp[i][j] = p[1 - j % 2]; } } return 1; } int main() { n = Rint(), m = Rint(); for (int i = (0); i < (n); ++i) scanf( %s , buff[i]); int pattern[4] = { 1 , 2 , 3 , 4 }; int solved = 0; do { if (sol_row(pattern[0], pattern[1], pattern[2], pattern[3])) { solved = 1; break; } if (sol_col(pattern[0], pattern[1], pattern[2], pattern[3])) { solved = 1; break; } } while (next_permutation(pattern, pattern + 4)); if (solved) for (int i = 0; i < n; ++i) puts(temp[i]); else puts( 0 ); return 0; }
#include <bits/stdc++.h> int main() { int n, p, q, i, j; int cnt = 0; char s[1000]; scanf( %d %d %d n , &n, &p, &q); gets(s); while (n % q != 0 && n >= p) { ++cnt; n -= p; } if (n % q != 0) puts( -1 ); else { printf( %d n , cnt + n / q); for (i = 0; i < cnt; i++) { for (j = 0; j < p; j++) putchar(s[i * p + j]); printf( n ); } for (i = 0; i < n / q; i++) { for (j = 0; j < q; j++) putchar(s[cnt * p + i * q + j]); printf( n ); } } }
#include <bits/stdc++.h> using namespace std; char a[4][100][100]; int c[6]; int check(int le, int s, char st) { int ct = 0; for (int i = 0; i < s; i++) { for (int j = 0; j < s; j++) { if ((i - (s - 1) / 2 + j - (s - 1) / 2) % 2 == 0 && a[le][i][j] != st) { ct++; } else if ((i - (s - 1) / 2 + j - (s - 1) / 2) % 2 != 0 && a[le][i][j] == st) { ct++; } } } return ct; } int main() { int si; scanf( %d , &si); getchar(); for (int k = 0; k < 4; k++) { for (int i = 0; i < si; i++) { char s[101]; scanf( %s , &s); for (int r = 0; r < si; r++) a[k][i][r] = s[r]; getchar(); } if (k != 3) getchar(); } c[0] = check(0, si, 1 ) + check(1, si, 1 ) + check(2, si, 0 ) + check(3, si, 0 ); c[1] = check(0, si, 1 ) + check(1, si, 0 ) + check(2, si, 1 ) + check(3, si, 0 ); c[2] = check(0, si, 1 ) + check(1, si, 0 ) + check(2, si, 0 ) + check(3, si, 1 ); c[3] = check(0, si, 0 ) + check(1, si, 1 ) + check(2, si, 1 ) + check(3, si, 0 ); c[4] = check(0, si, 0 ) + check(1, si, 1 ) + check(2, si, 0 ) + check(3, si, 1 ); c[5] = check(0, si, 0 ) + check(1, si, 0 ) + check(2, si, 1 ) + check(3, si, 1 ); int ans = 40000; for (int i = 0; i < 6; i++) { ans = min(c[i], ans); } printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int N, M, cnt, maxi; char c; int star[105][105]; int lefted[105][105]; int righted[105][105]; int up[105][105]; int down[105][105]; int chk[105][105]; struct ryunha { int x, y, r; } ans; vector<ryunha> res; int main(void) { cin >> N >> M; for (int i = 1; i <= N; i++) { for (int j = 1; j <= M; j++) { cin >> c; while (c != . && c != * ) cin >> c; star[i][j] = (c == . ? 0 : 1); if (c == * ) chk[i][j] = 1; } } for (int i = 1; i <= N; i++) { cnt = 0; for (int j = 1; j <= M; j++) { if (star[i][j]) cnt++; else cnt = 0; lefted[i][j] = cnt; } } for (int i = 1; i <= N; i++) { cnt = 0; for (int j = M; j >= 1; j--) { if (star[i][j]) cnt++; else cnt = 0; righted[i][j] = cnt; } } for (int j = 1; j <= M; j++) { cnt = 0; for (int i = 1; i <= N; i++) { if (star[i][j]) cnt++; else cnt = 0; up[i][j] = cnt; } } for (int j = 1; j <= M; j++) { cnt = 0; for (int i = N; i >= 1; i--) { if (star[i][j]) cnt++; else cnt = 0; down[i][j] = cnt; } } for (int i = 1; i <= N; i++) { for (int j = 1; j <= M; j++) { if (star[i][j]) { maxi = min({lefted[i][j], righted[i][j], up[i][j], down[i][j]}); int change = 0; if (maxi >= 2) { if (chk[i][j]) chk[i][j] = 0, change = 1; for (int k = 1; k <= maxi - 1; k++) { if (chk[i + k][j]) chk[i + k][j] = 0, change = 1; if (chk[i - k][j]) chk[i - k][j] = 0, change = 1; if (chk[i][j - k]) chk[i][j - k] = 0, change = 1; if (chk[i][j + k]) chk[i][j + k] = 0, change = 1; } } if (change) { ans.x = i; ans.y = j; ans.r = maxi - 1; res.push_back(ans); } } } } for (int i = 1; i <= N; i++) { for (int j = 1; j <= M; j++) { if (chk[i][j]) return !printf( -1 ); } } printf( %d n , res.size()); for (int i = 0; i < res.size(); i++) printf( %d %d %d n , res[i].x, res[i].y, res[i].r); }
#include <bits/stdc++.h> using namespace std; const int inf = 1000000007; const long long linf = 1LL << 62; const unsigned long long ulinf = 1ULL << 63; const double eps = 0.000001; const double pi = 3.14159265358979323846; template <class T> T abs(T a) { return a >= 0 ? a : -a; } template <class T> T sqr(T a) { return a * a; } template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; } template <class T> T mod(T a, T b) { return (a % b + b) % b; } template <class T> T addmod(T a, T b, T c) { return (T)mod((long long)a + b, (long long)c); } template <class T> T mulmod(T a, T b, T c) { return (T)mod((long long)a * b, (long long)c); } template <class T> T powmod(T a, T b, T c) { return (T)mod( b ? mulmod(mod(sqr((long long)powmod(a, b >> 1, c)), (long long)c), (b & 1LL) ? a : 1LL, (long long)c) : 1LL, (long long)c); } template <class T> void maxe(T &a, T b) { a = max(a, b); } template <class T> void mine(T &a, T b) { a = min(a, b); } template <class T> void mode(T &a, T b) { a = mod(a, b); } template <class T> void addmode(T &a, T b, T c) { a = addmod(a, b, c); } template <class T> void mulmode(T &a, T b, T c) { a = mulmod(a, b, c); } template <class T> void powmode(T &a, T b, T c) { a = powmod(a, b, c); } int iszero(double a) { return abs(a) <= eps; } template <class T> void geti(T &a) { a = 0; long long b = 1; char c = getchar(); if (c == - ) b = -1; else a = c - 48; while ((c = getchar()) != && c != n ) a = a * 10 + c - 48; a *= b; } void fileio_in_out() { freopen( .in , r , stdin); freopen( .out , w , stdout); } void fileio_txt() { freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); } const int N = 1111111; const int M = 1111111; int test; long long n, m, k, ans; long long dp[N]; long long s[N], sinv[N]; const long long md = inf; long long c(long long a, long long b) { return s[a] * (sinv[b] * sinv[a - b] % md) % md; } long long inv(long long a, long long p) { return powmod(a, p - 2, p); } long long getans() { if (n == 0) return k ^ (m > 1); if (m == 0) return k ^ (n & 1); s[0] = sinv[0] = 1; for (long long i = 1; i <= n + m; i++) { s[i] = s[i - 1] * i % md; sinv[i] = sinv[i - 1] * inv(i, md) % md; } if (k) n--; dp[0] = (m > 1); for (long long i = 1; i <= n; i++) dp[i] = (c(i + m, i) - dp[i - 1] + md) % md; return dp[n]; } int main() { scanf( %I64d%I64d%I64d , &n, &m, &k); ans = getans(); printf( %I64d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; const int MAX = 200500; int inp[MAX]; int out[MAX]; bool flag[MAX]; map<long long, int> ID; map<long long, int> hasInp; namespace hopcroftKarp { int ptr[100011], next[200011], zu[200011]; int n, m, match[100011], D[100011], q[100011]; void init(int _n) { n = _n; m = 0; memset(ptr, ~0, sizeof(int) * (n + 1)); } void add_edge(int u, int v) { next[m] = ptr[u]; ptr[u] = m; zu[m] = v; ++m; } bool bfs() { int u, v; register int i; int qh = 0, qt = 0; for (i = 1; i <= n; i++) { if (!match[i]) { D[i] = 0; q[qt++] = i; } else D[i] = (1 << 28); } D[0] = (1 << 28); while (qh < qt) { u = q[qh++]; if (u != 0) { for (i = ptr[u]; ~i; i = next[i]) { v = zu[i]; if (D[match[v]] == (1 << 28)) { D[match[v]] = D[u] + 1; q[qt++] = match[v]; } } } } return D[0] != (1 << 28); } bool dfs(int u) { int v; register int i; if (u) { for (i = ptr[u]; ~i; i = next[i]) { v = zu[i]; if (D[match[v]] == D[u] + 1) { if (dfs(match[v])) { match[v] = u; match[u] = v; return true; } } } D[u] = (1 << 28); return false; } return true; } int run() { int matching = 0; register int i; while (bfs()) for (i = 1; i <= n; i++) if (!match[i] && dfs(i)) matching++; return matching; } void call(int N, long long a, long long b) { int x, y; long long vx, vy; for (int i = 1; i <= N; i++) { if (flag[i]) continue; x = i; y = match[x]; vx = inp[i]; vy = inp[y]; if (vx + vy == a) { out[x] = out[y] = 0; } else out[x] = out[y] = 1; flag[x] = flag[y] = true; } for (int i = 1; i <= N; i++) { if (i != 1) cout << ; cout << out[i]; } cout << n ; return; } }; // namespace hopcroftKarp int main() { long long a, b; int n; std::ios_base::sync_with_stdio(false); cin >> n >> a >> b; for (int i = 1; i <= n; i++) { cin >> inp[i]; hasInp[inp[i]] = i; } long long x, rx, tx; int p = 0; hopcroftKarp::init(n); for (int i = 1; i <= n; i++) { x = inp[i]; rx = a - x; tx = b - x; if (hasInp.find(rx) != hasInp.end()) { hopcroftKarp::add_edge(i, hasInp[rx]); } if (hasInp.find(tx) != hasInp.end()) { hopcroftKarp::add_edge(i, hasInp[tx]); } } int cnt = hopcroftKarp::run(); if (2 * cnt >= (n)) { cout << YES n ; hopcroftKarp::call(n, a, b); } else cout << NO n ; return 0; }
#include <bits/stdc++.h> using namespace std; int dp[2][505][505]; char mp[505][505]; const int mod = 1000000007; int dis(int a, int b, int c, int d) { return abs(a - c) + abs(b - d) <= 1; } int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) scanf( %s , mp[i]); if (mp[0][0] != mp[n - 1][m - 1]) { printf( 0 n ); return 0; } memset(dp, 0, sizeof(dp)); dp[0][0][n - 1] = 1; int t = n + m; t /= 2; int ans = 0; for (int i = 1; i < t; i++) { for (int j = 0; j < n; j++) { for (int k = n - 1; k >= j; k--) dp[i & 1][j][k] = 0; } for (int j = 0; j < n; j++) { for (int k = n - 1; k >= j; k--) { int m1 = i - j; int m2 = (n + m - 2 - k - i); if (m1 > m - 1) continue; if (m2 > m - 1) continue; if (mp[j][m1] != mp[k][m2]) continue; if (j > 0 && k < n - 1) dp[i & 1][j][k] += dp[!(i & 1)][j - 1][k + 1]; if (j > 0 && m2 < m - 1) dp[i & 1][j][k] += dp[!(i & 1)][j - 1][k]; if (dp[i & 1][j][k] >= mod) dp[i & 1][j][k] -= mod; if (m1 > 0 && k < n - 1) dp[i & 1][j][k] += dp[!(i & 1)][j][k + 1]; if (dp[i & 1][j][k] >= mod) dp[i & 1][j][k] -= mod; if (m1 > 0 && m2 < m - 1) dp[i & 1][j][k] += dp[!(i & 1)][j][k]; if (dp[i & 1][j][k] >= mod) dp[i & 1][j][k] -= mod; if (i == t - 1 && dis(j, m1, k, m2)) ans += dp[i & 1][j][k]; if (ans >= mod) ans -= mod; } } } printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3f; const int MOD = 1e9 + 7; int dir[8][2] = {-1, 0, 1, 0, 0, -1, 0, 1, -1, -1, -1, 1, 1, -1, 1, 1}; template <typename S, typename T> ostream &operator<<(ostream &os, const pair<S, T> x) { os << ( << x.first << , << x.second << ) ; return os; } template <typename S, typename T> inline bool Min(S &a, const T &b) { return a > b ? a = b, true : false; } template <typename S, typename T> inline bool Max(S &a, const T &b) { return a < b ? a = b, true : false; } template <typename S, typename T> inline void Adm(S &a, const T &b) { a = (a + b) % MOD; if (a < 0) a += MOD; } template <typename T> inline bool IsPri(T x) { if (x < 2) return false; for (T i = 2; i * i <= x; ++i) if (x % i == 0) return false; return true; } template <typename T> inline T _Gcd(T a, T b) { while (b) { T t = b; b = a % b; a = t; } return a; } template <typename T> inline int _BitCnt(T x) { int cnt = 0; while (x) ++cnt, x &= x - 1; return cnt; } inline long long Pow(long long a, long long n) { long long t = 1; a %= MOD; while (n > 0) { if (n & 1) t = t * a % MOD; a = a * a % MOD, n >>= 1; } return t % MOD; } inline int read() { static char buf[1000000], *p1 = buf, *p2 = buf; register int x = false; register char ch = p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2) ? EOF : *p1++; ; register bool sgn = false; while (ch != - && (ch < 0 || ch > 9 )) ch = p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2) ? EOF : *p1++; ; if (ch == - ) sgn = true, ch = p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2) ? EOF : *p1++; ; while (ch >= 0 && ch <= 9 ) x = (x << 1) + (x << 3) + (ch ^ 48), ch = p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2) ? EOF : *p1++; ; return sgn ? -x : x; } const int N = 1e5 + 100; char s[N]; int main() { scanf( %s , s); int n = strlen(s); string str, ss; vector<int> pos; stack<pair<int, string>> stk; for (int i = n - 1; i >= 0; --i) { char c = s[i]; if (str.empty() || str.back() != c || pos.back() - i > 1) { str.push_back(c), pos.push_back(i); if (ss.empty() || ss.back() != c) ss.push_back(c); } else { if (((int)(ss).size()) == 1 || ss[((int)(ss).size()) - 2] < c) { str.pop_back(), pos.pop_back(); if (str.empty() || str.back() != ss.back()) ss.pop_back(); } else { str.push_back(c), pos.push_back(i); if (ss.empty() || ss.back() != c) ss.push_back(c); } } pair<int, string> now = {((int)(str).size()), }; if (((int)(str).size()) <= 10) now.second = str; else now.second = str.substr(0, 2) + ... + str.substr(((int)(str).size()) - 5, 5); reverse((now.second).begin(), (now.second).end()); stk.push(now); } while (!stk.empty()) printf( %d %s n , stk.top().first, stk.top().second.c_str()), stk.pop(); return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 3333; int cnt[maxn][maxn][2], fuck[maxn], dep[maxn][maxn], dis[maxn][maxn]; struct Edge { int t, next, v; } edge[maxn << 1]; int head[maxn], tot, n; void new_edge(int a, int b, int t) { edge[tot].t = b; edge[tot].next = head[a]; edge[tot].v = t; head[a] = tot++; } void dfs(int u, int fa, int rt) { int i; for (i = head[u]; i != -1; i = edge[i].next) { int e = edge[i].t; if (e == fa) continue; dep[rt][e] = dep[rt][u] + 1; int add = edge[i].v; cnt[rt][e][1] = min(cnt[rt][u][0], cnt[rt][u][1]) + !add; cnt[rt][e][0] = cnt[rt][u][0] + add; dis[rt][e] = dis[rt][u] + add; fuck[rt] += add; dfs(e, u, rt); } } int main() { tot = 0; int i, j, k; memset(head, -1, sizeof(head)); scanf( %d , &n); for (i = 1; i < n; i++) { int a, b; scanf( %d%d , &a, &b); new_edge(a, b, 0); new_edge(b, a, 1); } for (i = 1; i <= n; i++) dfs(i, 0, i); int ans = 111111111; for (i = 1; i <= n; i++) for (j = 1; j <= n; j++) { ans = min(ans, fuck[i] - dis[i][j] + min(cnt[i][j][0], cnt[i][j][1])); ans = min(ans, fuck[i]); } printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; bool besarDulu(const int &a, const int &b) { return a > b; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { int h, m; cin >> h >> m; int minutes = (24 - h - 1) * 60 + (60 - m); cout << minutes << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; bool cur1; int n, m, K; int L[100005 * 120], R[100005 * 120], res[100005 * 120], tt, rt[100005 * 3]; int update(int p, int l, int r, int x, int v) { int c = ++tt; L[c] = L[p], R[c] = R[p]; if (l == r) { res[c] = min((p ? res[p] : 0x3f3f3f3f), v); return c; } int mid = (l + r) >> 1; if (x <= mid) L[c] = update(L[p], l, mid, x, v); else R[c] = update(R[p], mid + 1, r, x, v); res[c] = max(res[L[c]], res[R[c]]); return c; } int query(int p, int u, int v, int l, int r) { if (u <= l && r <= v) { return res[p]; } int mid = (l + r) >> 1; int ans = 0; if (u <= mid) ans = max(ans, query(L[p], u, v, l, mid)); if (v > mid) ans = max(ans, query(R[p], u, v, mid + 1, r)); return ans; } struct seg { int a, b, c; bool operator<(const seg &_) const { if (a != _.a) return a < _.a; if (c != _.c) return c < _.c; if (b != _.b) return b > _.b; } } Sg[100005 * 3]; int B[100005 * 3]; void solve() { tt = 0; int tot = 0; scanf( %d %d %d , &n, &m, &K); for (int a, b, c, i = 1; i <= K; i++) { scanf( %d %d %d , &a, &b, &c); B[i] = a; Sg[i] = (seg){a, b, c}; } sort(B + 1, B + K + 1); sort(Sg + 1, Sg + K + 1); tot = unique(B + 1, B + 1 + K) - B - 1; for (int i = 1; i <= n; i++) rt[tot + 1] = update(rt[tot + 1], 1, n, i, 0x3f3f3f3f); Sg[K + 1].a = 0x3f3f3f3f; for (int i = K; i >= 1; i--) { int t = lower_bound(B + 1, B + 1 + tot, Sg[i].a) - B; if (Sg[i].a != Sg[i + 1].a) { rt[t] = update(rt[t + 1], 1, n, Sg[i].c, Sg[i].b); } else rt[t] = update(rt[t], 1, n, Sg[i].c, Sg[i].b); } while (m--) { int a, b, c, d; scanf( %d %d %d %d , &a, &b, &c, &d); if (c > B[tot]) { puts( no ); fflush(stdout); continue; } else { int t = lower_bound(B + 1, B + 1 + tot, c) - B; if (query(rt[t], a, b, 1, n) <= d) puts( yes ); else puts( no ); } fflush(stdout); } } bool cur2; int main() { solve(); return 0; }
#include <bits/stdc++.h> using namespace std; long long MOD = 1e9 + 7; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; int t; cin >> t; while (t != 0) { t--; int n, k, l = -1, r = -1; cin >> n >> k; int c = k + 1, z, res = 0; string x; cin >> x; for (int i = 0; i < n; i++) { if (x[i] == 1 ) { r = i; if (l == -1) z = r - l - 1 - k; else z = r - l - 1 - (2 * k); if (z > 0) { c = k + 1; for (int j = 0; j < z; j++) { if (c > k) { res++; c = 0; } c++; } } l = i; z = 0; } } r = n; if (l == -1) z = r - l - 1; else z = r - l - 1 - k; if (z > 0) { c = k + 1; for (int j = 0; j < z; j++) { if (c > k) { res++; c = 0; } c++; } } cout << res << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; long long b[n]; pair<long long, long long> arr[n]; for (long long i = 0; i < n; i++) { cin >> b[i]; arr[i].first = b[i] - i + 200000; arr[i].second = b[i]; } sort(arr, arr + n); long long maxi = 0; long long i = -1; while (i < (n - 1)) { i++; long long c = 0; c += arr[i].second; while (arr[i].first == arr[i + 1].first) { c += arr[i + 1].second; i++; } maxi = max(c, maxi); } if (n == 1) { cout << b[0]; } else { cout << maxi; } }
#include <bits/stdc++.h> using namespace std; mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count()); mt19937_64 rnd64( chrono::high_resolution_clock::now().time_since_epoch().count()); long long power(long long a, long long m, long long mod) { long long ans = 1; while (m) { if (m % 2) { ans *= a; ans %= (mod); } a = (a * a) % (mod); m >>= 1; } return ans; } void init(long long* a, long long n, long long val) { for (long long i = 0; i < n; i++) a[i] = val; } void solve() { long long i, j, _, n; cin >> n; long long a[n], pre[n]; for (i = 0; i < n; i++) cin >> a[i]; vector<long long> ans; sort(a, a + n); j = 0; for (i = 0; i < n; i++) cin >> j, j += a[i], j %= 998244353, pre[i] = j; for (i = 1; i < n; i++) { long long k = 0; for (j = n - i - 1; j > -1; j -= i) k += pre[j], k %= 998244353; ans.push_back(k); } ans.push_back(0); n = power(n, 998244353 - 2, 998244353); for (auto& i : ans) i *= n, i %= 998244353, cout << i << ; cout << endl; } int main() { ios::sync_with_stdio(0); cin.tie(0); long long T = 1; while (T--) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; long long mod = 1e9 + 7; long long power(long long x, long long y) { if (y == 0) return 1; long long a = power(x, y / 2); if (y % 2) { return (a * ((a * x) % mod)) % mod; } else { return (a * a) % mod; } } int main() { long long i, j, k, m, n; cin >> n >> k; long long ans = 0; long long arr[n]; vector<vector<long long> > ind(11); for (i = 0; i < n; i++) cin >> arr[i]; for (i = 0; i < n; i++) { j = arr[i] % 10; ind[j].push_back(i); } for (j = 9; j >= 1 && k > 0; j--) { for (i = 0; i < ind[j].size(); i++) { m = ind[j][i]; if (k >= (10 - j)) { k -= 10 - j; arr[m] += 10 - j; } } } sort(arr, arr + n); for (i = 0; i < n; i++) { if (k >= 100 - arr[i]) { k -= 100 - arr[i]; arr[i] = 100; } else { long long flag = 1; while (flag) { if (k >= 10 && 1) { k -= 10; arr[i] += 10; } else flag = 0; } } } for (i = 0; i < n; i++) { ans += arr[i] / 10; } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; string b[51]; bool check(pair<int, int> f, pair<int, int> s) { bool r1 = true, r2 = true, c1 = true, c2 = true; for (int i = f.first; i <= s.first; i++) { if (b[i][f.second] == W ) c1 = false; if (b[i][s.second] == W ) c2 = false; } for (int i = s.first; i <= f.first; i++) { if (b[i][f.second] == W ) c1 = false; if (b[i][s.second] == W ) c2 = false; } for (int i = f.second; i <= s.second; i++) { if (b[f.first][i] == W ) r1 = false; if (b[s.first][i] == W ) r2 = false; } for (int i = s.second; i <= f.second; i++) { if (b[f.first][i] == W ) r1 = false; if (b[s.first][i] == W ) r2 = false; } return (c1 && r2) || (c2 && r1); } vector<pair<int, int> > v; int main() { int r, c; cin.tie(0); cin >> r >> c; for (int i = 0; i < r; i++) { cin >> b[i]; for (int j = 0; j < c; j++) if (b[i][j] == B ) v.push_back({i, j}); } int sz = v.size(); for (int i = 0; i < sz; i++) for (int j = i + 1; j < sz; j++) { if (!check(v[i], v[j])) { cout << NO ; return 0; }; } cout << YES ; return 0; }
#include <bits/stdc++.h> enum var_type { TYPE_DOUBLE, TYPE_STRING, TYPE_INT, TYPE_T, }; using namespace std; struct proc { string name; vector<var_type> types; }; vector<proc> procedures; map<string, var_type> vars; vector<int> results; var_type get_type(string type_name) { if (type_name == double ) return TYPE_DOUBLE; if (type_name == int ) return TYPE_INT; if (type_name == string ) return TYPE_STRING; if (type_name == T ) return TYPE_T; } void proc_procedures() { int n; cin >> n; cin.ignore(1, n ); for (int i = 0; i < n; ++i) { char buf[200]; gets(buf); string str(buf); int j = 0; while (str[j] == ) ++j; j += 4; while (str[j] == ) ++j; string name; while (str[j] != && str[j] != ( ) { name += str[j]; ++j; } while (str[j] != ( ) ++j; ++j; vector<var_type> var_types; while (str[j] != ) ) { if (str[j] == ) { ++j; continue; } string cur_type; while (str[j] != && str[j] != ) && str[j] != , ) { cur_type += str[j]; ++j; } var_types.push_back(get_type(cur_type)); while (str[j] != ) && str[j] != , ) ++j; if (str[j] == , ) ++j; } proc temp; temp.name = name; temp.types = var_types; procedures.push_back(temp); } } void proc_variables() { int n; cin >> n; cin.ignore(1, n ); for (int i = 0; i < n; ++i) { char buf[200]; gets(buf); string str(buf); int j = 0; while (str[j] == ) ++j; string cur_type; while (str[j] != ) { cur_type += str[j]; ++j; } while (str[j] == ) ++j; string name; while (j < str.size() && str[j] != ) { name += str[j]; ++j; } vars.insert(pair<string, var_type>(name, get_type(cur_type))); } } void proc_calls() { int n; cin >> n; cin.ignore(1, n ); for (int i = 0; i < n; ++i) { char buf[200]; gets(buf); string str(buf); int j = 0; while (str[j] == ) ++j; string name; while (str[j] != && str[j] != ( ) { name += str[j]; ++j; } while (str[j] != ( ) ++j; ++j; vector<var_type> var_types; while (str[j] != ) ) { if (str[j] == ) { ++j; continue; } string cur_type; while (str[j] != && str[j] != ) && str[j] != , ) { cur_type += str[j]; ++j; } var_types.push_back(vars[cur_type]); while (str[j] != ) && str[j] != , ) ++j; if (str[j] == , ) ++j; } int res = 0; for (int j = 0; j < procedures.size(); ++j) { if (procedures[j].name != name) continue; if (var_types.size() != procedures[j].types.size()) continue; bool is_ok = true; for (int k = 0; k < var_types.size(); ++k) { if (procedures[j].types[k] == TYPE_T) continue; if (procedures[j].types[k] != var_types[k]) is_ok = false; } if (is_ok) ++res; } results.push_back(res); } } int main() { proc_procedures(); proc_variables(); proc_calls(); for (int i = 0; i < results.size(); ++i) cout << results[i] << endl; return 0; }
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) const int inf = 0x3f3f3f3f; const long long LL_INF = 0x3f3f3f3f3f3f3f3f; template <typename T> T gcd(T a, T b) { if (a == 0) return b; return gcd(b % a, a); } long long power(long long a, long long b, long long m = 1000000007) { long long answer = 1; while (b) { if (b & 1) answer = (answer * a) % m; b /= 2; a = (a * a) % m; } return answer; } using namespace std; bool chk[1048576]; int main() { set<int> st; int n; cin >> n; for (int i = 0; i < n; i++) { int x; cin >> x; set<int>::iterator it; set<int> st2; for (it = st.begin(); it != st.end(); it++) { int y = *it; st2.insert(y | x); } st2.insert(x); st = st2; st2.clear(); for (it = st.begin(); it != st.end(); it++) { chk[*it] = 1; } } int cnt = 0; for (int i = 0; i < 1048576; i++) { if (chk[i]) cnt++; } cout << cnt; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1 << 20; long long fac[20]; vector<long long> lst; vector<long long> lucky; void prepare(int cnt, int all, long long now) { if (cnt == all) { lucky.push_back(now); return; } prepare(cnt + 1, all, now * 10 + 4); prepare(cnt + 1, all, now * 10 + 7); } inline bool chk(long long x) { while (x) { if (x % 10 != 4 && x % 10 != 7) return false; x /= 10; } return true; } int main() { ios::sync_with_stdio(false); for (int i = 0; i <= 10; i++) prepare(0, i, 0); fac[0] = 1; for (int i = 1; i < 20; i++) fac[i] = fac[i - 1] * i; long long n, k; cin >> n >> k; long long p = 1; while (fac[p] < k) p++; if (p > n) return cout << -1 << n , 0; k--; for (long long i = n - p + 1; i <= n; i++) lst.push_back(i); while (k) { int i; for (i = p; ~i; i--) if (fac[i] <= k) break; int w = k / fac[i]; k -= fac[i] * w; for (int s = 0; s < w; s++) swap(lst[p - 1 - i], lst[p - i + s]); } long long res = upper_bound(lucky.begin(), lucky.end(), n - p) - lucky.begin() - 1; for (int i = 0; i < lst.size(); i++) if (chk(n - p + i + 1) && chk(lst[i])) res++; cout << res << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int block(long int x) { vector<long int> v; while (x > 0) { v.push_back(x % 2); x = x / 2; } int ret = 0; for (int i = 0; i < v.size(); i++) { if (v[i] == 1) { ret++; } } return ret; } void pprint(long int x) { vector<long int> v; while (x > 0) { v.push_back(x % 2); x = x / 2; } cout << YES n ; int ret = 0; for (int i = 0; i < v.size(); i++) { if (v[i] == 1) { ret++; int A = 1 << i; cout << A << ; } } cout << endl; } void solve(long int x, long long k, long long mini) { vector<long int> v; long long rem = k - mini; while (x > 0) { v.push_back(x % 2); x = x / 2; } int ret = 0; cout << YES n ; int i = v.size() - 1; while (rem > 0) { v[i]--; v[i - 1] += 2; if (v[i] == 0) { i--; } rem--; } for (int i = 0; i < v.size(); i++) { while (v[i] > 0) { ret++; int A = 1 << i; cout << A << ; v[i]--; } } cout << endl; } int main() { long long x; long long n, k; cin >> n >> k; if (k > n) { cout << NO n ; return 0; } if (k == n) { cout << YES n ; for (int i = 0; i < n; i++) { cout << 1 << ; } return 0; } int mini = block(n); if (k < mini) { cout << NO n ; return 0; } if (k == mini) { pprint(n); } else { solve(n, k, mini); } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 5001; long long a[N], mem[N][2], b[N]; int n, m; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; b[i] = a[i]; } sort(b, b + n); m = unique(b, b + n) - b; for (int i = n - 1; i >= 0; i--) mem[i][1 - m & 1] = abs(a[i] - b[m - 1]) + ((i + 1 < n) ? mem[i + 1][1 - m & 1] : 0ll); for (int j = m - 2; j >= 0; j--) for (int i = n - 1; i >= 0; i--) mem[i][j & 1] = min(mem[i][1 - j & 1], abs(a[i] - b[j]) + ((i + 1 < n) ? mem[i + 1][j & 1] : 0ll)); long long ans = 1ll << 50; ans = min(mem[0][0], mem[0][1]); cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; template <class T, class V> T power(T t, V v) { T second = 1; while (v--) second *= t; return second; } void _print(long long t) { cerr << t; } void _print(int t) { cerr << t; } void _print(string t) { cerr << t; } void _print(char t) { cerr << t; } void _print(long double t) { cerr << t; } void _print(double t) { cerr << t; } void _print(unsigned long long t) { cerr << t; } template <class T, class V> void _print(pair<T, V> p); template <class T> void _print(vector<T> v); template <class T> void _print(set<T> v); template <class T, class V> void _print(map<T, V> v); template <class T> void _print(multiset<T> v); template <class T, class V> void _print(pair<T, V> p) { cerr << { ; _print(p.first); cerr << ; _print(p.second); cerr << } ; } template <class T> void _print(vector<T> v) { int n = v.size(); cerr << [ ; for (T i : v) { _print(i); n--; cerr << (n ? , : ); } cerr << ] ; } template <class T> void _print(set<T> v) { cerr << [ ; for (T i : v) { _print(i); cerr << ; } cerr << ] ; } template <class T> void _print(multiset<T> v) { cerr << [ ; for (T i : v) { _print(i); cerr << ; } cerr << ] ; } template <class T, class V> void _print(map<T, V> v) { int n = v.size(); cerr << { ; for (auto p : v) { cerr << [ ; _print(p.first); cerr << ]= ; _print(p.second); n--; cerr << (n ? , : ); } cerr << } ; } void go() { int n; cin >> n; string a; string b; cin >> a >> b; int sz = 0, so = 0, nsz = 0, nso = 0; for (int i = 0; i < n; i++) { if (a[i] == b[i]) { if (a[i] == 0 ) sz++; else so++; } else if (a[i] == 0 ) nsz++; else nso++; } int N = 100000000; int ans = N; if (so - sz == 1) ans = min(ans, so + sz); if (nsz == nso) ans = min(ans, nsz + nso); if (ans == N) cout << -1 n ; else cout << ans << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t = 1; cin >> t; while (t--) { go(); } return 0; }
#include <bits/stdc++.h> using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << : << arg1 << n ; } 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 inf = 0x3f3f3f3f; long long infl = 0x3f3f3f3f3f3f3f3fLL; long double infd = 1.0 / 0.0; const long long MOD = 1e9 + 7; const double pi = 2 * acos(0.0); long long modi(long long a, long long n) { long long x = 1; while (n) { if (n & 1) x = (x * a) % MOD; n >>= 1; a = (a * a) % MOD; } return x; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int tt = 1; while (tt--) { long long a, b, n, x; cin >> a >> b >> n >> x; long long as = (((a * x) % MOD) + b) % MOD; long long le = (x * modi(a, n)) % MOD; long long ri = a == 1ll ? ((b * (n % MOD)) % MOD) : ((b * (((((modi(a, n) - 1 + MOD) % MOD)) * (modi(a - 1, MOD - 2))) % MOD)) % MOD); cout << ((((le + ri) % (MOD)) + (MOD)) % (MOD)) << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int s1, s2, s3, a, b, c; cin >> s1 >> s2 >> s3; a = (s1 * s2) / s3; a = pow(a, 0.5); b = (s2 * s3) / s1; b = pow(b, 0.5); c = (s1 * s3) / s2; c = pow(c, 0.5); cout << 4 * (a + b + c) << endl; return 0; }
#include <bits/stdc++.h> using namespace std; void solve() { long long n, ans = 0; cin >> n; for (;; ans++) { if (n == 1) break; if (n % 6 == 0) n /= 6; else if (n % 3 == 0) { if ((n * 2) % 3 != 0) { cout << -1 n ; return; } n *= 2; } else { cout << -1 n ; return; } } cout << ans << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) solve(); return 0; }
#include <bits/stdc++.h> using namespace std; using ll = long long; void debug() { cerr << ] n ; } template <class H, class... T> void debug(H h, T... t) { cerr << h; if (sizeof...(t)) { cerr << , ; } debug(t...); } void solve() { int n; cin >> n; string s; cin >> s; int o, e; o = e = 0; int f1, f2; f1 = f2 = 0; for (int i = 0; i < n; i++) { if (i & 1) { if ((int)(s[i] - 0 ) & 1) { } else f2 = 1; } else { if ((int)(s[i] - 0 ) & 1) { f1 = 1; } } } if (n == 1) { cout << (((s[0] - 0 ) & 1) ? 1 : 2 ) << n ; return; } if (n & 1) { cout << (f1 ? 1 : 2 ) << n ; } else { cout << (f2 ? 2 : 1 ) << n ; } } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int _; cin >> _; for (int i = 1; i <= _; i++) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; double g[110][110], x[110]; int n, m, ues[110]; pair<pair<int, int>, int> p[5010]; bool vis[110]; void read(int &x) { char ch = getchar(); int mark = 1; for (; ch != - && (ch < 0 || ch > 9 ); ch = getchar()) ; if (ch == - ) mark = -1, ch = getchar(); for (x = 0; ch >= 0 && ch <= 9 ; ch = getchar()) x = x * 10 + ch - 48; x *= mark; } double Abs(double x) { if (x < 0) return -x; return x; } int main() { read(n); read(m); g[1][1] = 1; g[n][n] = 1; g[n][n + 1] = 1; for (int i = 1; i <= m; i++) { read(p[i].first.first); read(p[i].first.second); read(p[i].second); g[p[i].first.first][p[i].first.first]++; g[p[i].first.first][p[i].first.second]--; g[p[i].first.second][p[i].first.second]++; g[p[i].first.second][p[i].first.first]--; } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) if (Abs(g[i][j]) && !vis[j]) { vis[j] = 1; ues[i] = j; break; } for (int j = 1; j <= n; j++) if (ues[i] != j && Abs(g[j][i])) { double tmp = -g[j][i] / g[ues[i]][i]; for (int k = 1; k <= n + 1; k++) g[j][k] += g[ues[i]][k] * tmp; } } for (int i = 1; i <= n; i++) x[i] = g[ues[i]][n + 1] / g[ues[i]][i]; double Min = 1e20; for (int i = 1; i <= m; i++) { if (Abs(x[p[i].first.first] - x[p[i].first.second]) > 1e-6) Min = min(Min, p[i].second / Abs(x[p[i].first.first] - x[p[i].first.second])); } double ans = 0; for (int i = 1; i <= m; i++) if (p[i].first.first == 1) ans += Min * (x[p[i].first.second] - x[p[i].first.first]); else if (p[i].first.second == 1) ans -= Min * (x[p[i].first.second] - x[p[i].first.first]); printf( %.5lf n , ans); if (Abs(ans) < 1e-6) memset(x, 0, sizeof(x)); for (int i = 1; i <= m; i++) printf( %.5lf n , Min * (x[p[i].first.second] - x[p[i].first.first])); return 0; }
#include <bits/stdc++.h> using namespace std; struct node { int k, a; bool operator<(const node &X) const { return a > X.a; } }; int n, fa[5010], limi[5010], ans[5010]; int order[5010], co; vector<int> edge[5010]; vector<int> val[5010]; priority_queue<node> train[5010]; void dfs(int u, int father, int weight) { order[++co] = u; fa[u] = father; limi[u] = weight; for (int i = 0; i < edge[u].size(); i++) { int v = edge[u][i]; int w = val[u][i]; if (v == father) continue; dfs(v, u, w); } } int main() { cin >> n; node tt; for (int i = 1; i <= n; i++) { cin >> tt.a; tt.k = i; train[i].push(tt); } int x, y, z; for (int i = 1; i <= n - 1; i++) { cin >> x >> y >> z; edge[x].push_back(y); val[x].push_back(z); edge[y].push_back(x); val[y].push_back(z); } co = 0; dfs(1, 0, 0); int cnt = 0; for (int i = 0; i <= n - 1; i++) { while (!train[1].empty()) { tt = train[1].top(); train[1].pop(); ans[tt.k] = i; cnt += 1; } if (cnt == n) break; for (int i = 2; i <= n; i++) { int u = order[i]; int v = fa[u]; int w = limi[u]; for (int i = 1; i <= w; i++) { if (train[u].empty()) break; tt = train[u].top(); train[u].pop(); train[v].push(tt); } } } for (int i = 1; i <= n; i++) cout << ans[i] << ; cout << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int read() { int f = 1; int res = 0; char ch; do { ch = getchar(); if (ch == - ) f = -f; } while (ch < 0 || ch > 9 ); do { res = res * 10 + ch - 0 ; ch = getchar(); } while (ch >= 0 && ch <= 9 ); return f == 1 ? res : -res; } const int MAXN = 100010; const int MAXP = MAXN * 51; const long long INF = 2000000000000LL; int n, m, D; int mod = 1000000007; int X[MAXN], Y[MAXN]; char open[MAXN][52]; int stck[MAXP], in[MAXP], dfsn[MAXP], low[MAXP], idx, top; int li[MAXN], bak; bool hv[MAXN]; int head[MAXP], nxt[MAXP], to[MAXP], tot; int nid[MAXP], dag[MAXP], sz[MAXP]; std::queue<int> q; int dp[MAXP]; void addEdge(int x, int y) { tot++; nxt[tot] = head[x]; head[x] = tot; to[tot] = y; } int getIndex(int x, int d) { return x + (d % D) * n; } void append(int x) { --x; int c = x % n + 1; int d = x / n; if (c <= 0 || d >= D) cout << x: << x << endl; if (!hv[c] && (c > 0 && d < D && open[c][d] == 1 )) { li[++bak] = c; hv[c] = true; } } void clr() { for (int i = 1; i <= bak; i++) hv[li[i]] = false; bak = 0; } void tarjan(int u) { dfsn[u] = low[u] = ++idx; in[stck[++top] = u] = true; for (int i = head[u]; i; i = nxt[i]) if (!dfsn[to[i]]) { tarjan(to[i]); low[u] = std::min(low[u], low[to[i]]); } else if (in[to[i]]) low[u] = std::min(low[u], dfsn[to[i]]); if (low[u] == dfsn[u]) { int v; do in[v = stck[top--]] = false, append(v), nid[v] = u; while (u != v); sz[u] = bak; clr(); } } int main() { scanf( %d%d%d , &n, &m, &D); for (int i = 0; i < m; i++) { int u = read(); int v = read(); X[i] = u; Y[i] = v; for (int j = 0; j < D; j++) addEdge(getIndex(X[i], j), getIndex(Y[i], j + 1)); } for (int i = 1; i <= n; i++) { scanf( %s , open[i]); } tarjan(getIndex(1, 0)); memset(head, 0, sizeof(head)); tot = 0; for (int i = 0; i < m; i++) { for (int j = 0; j < D; j++) { int u = getIndex(X[i], j); int v = getIndex(Y[i], j + 1); if (!nid[u] || !nid[v]) continue; if (nid[u] == nid[v]) continue; addEdge(nid[u], nid[v]); dag[nid[v]]++; } } q.push(getIndex(1, 0)); int ans = 0; while (!q.empty()) { int t = q.front(); q.pop(); ans = std::max(ans, dp[t] += sz[t]); for (int i = head[t]; i; i = nxt[i]) { dp[to[i]] = std::max(dp[to[i]], dp[t]); if (!--dag[to[i]]) q.push(to[i]); } } printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int ans[1000005]; int main() { int n; cin >> n; int a[n], b[n]; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) cin >> b[i]; int l = 0; for (int i = 0; i < n; i++) { for (int j = i; j < n; j++) { if (b[j] == a[i]) { for (int k = j; k > i; k--) { ans[l++] = k; swap(b[k - 1], b[k]); } break; } } } cout << l << endl; for (int i = 0; i < l; i++) { cout << ans[i] << << ans[i] + 1 << endl; } }
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int n = s.size(); string s1 = hello ; int n1 = s1.size(); int i = 0, j = 0; int count = 0; while (j < n1 && i < n) { if (s1[j] == s[i]) { j++; count++; } i++; } if (count == n1) { cout << YES << endl; } else { cout << NO << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; long long i, j = 0, k, sum = 0, ctr = 0, c = 0, ok = 0; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long a, b, c; cin >> a >> b >> c; for (i = a; i >= 0; i--) { if (c >= i * 4 && b >= i * 2) { ok = i; break; } } cout << ok * 7; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int cen, feet = 0, inch; cin >> cen; inch = cen / 3; if (cen % 3 == 2) inch++; if (inch >= 12) { feet = inch / 12; inch = inch % 12; } cout << feet << << inch << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int nmin, nmax = 1; int n, m, a, b; scanf( %d%d , &n, &m); nmin = n; for (int i = 0; i < m; i++) { scanf( %d%d , &a, &b); if (b < a) swap(a, b); nmin = min(nmin, b); nmax = max(nmax, a); } if (nmax < nmin) printf( %d n , nmin - nmax); else printf( 0 n ); return 0; }
#include <bits/stdc++.h> using namespace std; int infinity = 10000000; int railway[401][401]; int calculatedistance(int start, int end, bool bus) { bool visitedtown[401]; int distance[401]; queue<int> myQueue; for (int i = 1; i <= 400; i++) visitedtown[i] = false; for (int i = 1; i <= 400; i++) distance[i] = infinity; distance[start] = 0; visitedtown[start] = true; myQueue.push(start); while (!myQueue.empty()) { int town = myQueue.front(); myQueue.pop(); for (int i = 1; i <= end; i++) if (i != town) { if (bus) { if (!railway[town][i]) if (!visitedtown[i]) if (distance[town] + 1 < distance[i]) { distance[i] = distance[town] + 1; visitedtown[i] = true; myQueue.push(i); } } else { if (railway[town][i]) if (!visitedtown[i]) if (distance[town] + 1 < distance[i]) { distance[i] = distance[town] + 1; visitedtown[i] = true; myQueue.push(i); } } } } return distance[end]; } int main() { int n, m, u, v; cin >> n >> m; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) railway[i][j] = 0; for (int i = 0; i < m; i++) { cin >> u >> v; railway[u][v] = 1; railway[v][u] = 1; } int bdis = calculatedistance(1, n, true); int tdis = calculatedistance(1, n, false); if (bdis == infinity || tdis == infinity) { cout << -1 ; return 0; } if (bdis != tdis) { cout << max(bdis, tdis); return 0; } int disb = infinity; for (int i = 2; i < n; i++) disb = min(disb, calculatedistance(1, i, false) + calculatedistance(i, n, false)); int dist; for (int i = 2; i < n; i++) dist = min(dist, calculatedistance(1, i, true) + calculatedistance(i, n, true)); cout << min(disb, dist); return 0; }
#include <bits/stdc++.h> using namespace std; int limit[100005] = {0}; int main() { ios::sync_with_stdio(false); memset(limit, 0, sizeof(limit)); int n; cin >> n; for (int i = 0; i < n; i++) { int x, k; cin >> x >> k; if (x == limit[k]) limit[k]++; else if (x > limit[k]) { cout << NO << endl; return 0; } } cout << YES << endl; }
#include <bits/stdc++.h> using namespace std; int main() { int i, j, w, h; string temp; vector<string> img; cin >> w >> h; for (i = 0; i < h; i++) { cin >> temp; img.push_back(temp); } for (j = 0; j < w; j++) { for (i = 0; i < h; i++) cout << img[i][j] << img[i][j]; cout << endl; for (i = 0; i < h; i++) cout << img[i][j] << img[i][j]; cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; int a[1005][1005]; int main() { int h, w; cin >> h >> w; vector<int> r(h), c(w); for (int i = 0; i < h; i++) { cin >> r[i]; } for (int i = 0; i < w; i++) { cin >> c[i]; } memset(a, -1, sizeof(a)); for (int i = 0; i < h; i++) { for (int j = 0; j < r[i]; j++) { a[i][j] = 1; } a[i][r[i]] = 0; } for (int i = 0; i < w; i++) { for (int j = 0; j < c[i]; j++) { if (a[j][i] == 0) { cout << 0 << endl; return 0; } a[j][i] = 1; } if (a[c[i]][i] == 1) { cout << 0 << endl; return 0; } a[c[i]][i] = 0; } int ans = 1; for (int i = 0; i < h; i++) { for (int j = 0; j < w; j++) { if (a[i][j] == -1) { ans = (1ll * 2 * ans) % mod; } } } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; template <typename T> void pv(T a, T b) { for (T i = a; i != b; ++i) cout << *i << ; cout << endl; } template <typename T> void chmin(T &t, const T &f) { if (t > f) t = f; } template <typename T> void chmax(T &t, const T &f) { if (t < f) t = f; } int in() { int x; scanf( %d , &x); return x; } const long long MO = 1000000007; namespace SA { int n; char t[300010]; int ki[300010], ik[300010], is[300010], hh; bool cmp(const int &a, const int &b) { return (a == b) ? 0 : (ik[a] != ik[b]) ? (ik[a] < ik[b]) : (ik[a + hh] < ik[b + hh]); } void makeSA() { n = strlen(t); int i; for (i = 0; i <= n; ++i) ik[ki[i] = i] = t[i]; is[0] = is[n] = hh = 0; sort(ki, ki + n + 1, cmp); for (hh = 1; is[n] != n; hh <<= 1) { sort(ki, ki + n + 1, cmp); for (i = 0; i < n; ++i) is[i + 1] = is[i] + (cmp(ki[i], ki[i + 1]) ? 1 : 0); for (i = 0; i <= n; ++i) ik[ki[i]] = is[i]; } } int lcp[300010]; void makeHA() { int h = 0, i, j; for (i = 0; i < n; ++i) { for (j = ki[ik[i] - 1]; t[j + h] == t[i + h]; ++h) ; lcp[ik[i] - 1] = h; if (h) --h; } } } // namespace SA int LA, LB, LC; long long ans[300010]; int eventsLen; pair<int, int> events[300010]; int uf[300010]; long long cnt[300010][3]; long long prodSum; int root(int u) { return (uf[u] < 0) ? u : (uf[u] = root(uf[u])); } void conn(int u, int v) { u = root(u); v = root(v); if (u == v) return; if (uf[u] > uf[v]) swap(u, v); uf[u] += uf[v]; uf[v] = u; prodSum -= cnt[u][0] * cnt[u][1] * cnt[u][2]; prodSum -= cnt[v][0] * cnt[v][1] * cnt[v][2]; cnt[u][0] += cnt[v][0]; cnt[u][1] += cnt[v][1]; cnt[u][2] += cnt[v][2]; prodSum += cnt[u][0] * cnt[u][1] * cnt[u][2]; } int main() { using namespace SA; for (; ~scanf( %s , t);) { LA = strlen(t); t[LA] = 0 ; scanf( %s , t + LA + 1); LB = strlen(t + LA + 1); t[LA + 1 + LB] = 1 ; scanf( %s , t + LA + 1 + LB + 1); LC = strlen(t + LA + 1 + LB + 1); t[LA + 1 + LB + 1 + LC] = 2 ; t[LA + 1 + LB + 1 + LC + 1] = 0; makeSA(); makeHA(); eventsLen = 0; for (int i = 0; i < n; ++i) { events[eventsLen++] = make_pair(lcp[i], i); } sort(events, events + eventsLen); reverse(events, events + eventsLen); fill(uf, uf + n + 1, -1); for (int i = 0; i <= n; ++i) { cnt[i][0] = 0; cnt[i][1] = 0; cnt[i][2] = 0; if (0 <= ki[i] && ki[i] < LA) { cnt[i][0] = 1; } else if (LA + 1 <= ki[i] && ki[i] < LA + 1 + LB) { cnt[i][1] = 1; } else if (LA + 1 + LB + 1 <= ki[i] && ki[i] < LA + 1 + LB + 1 + LC) { cnt[i][2] = 1; } } prodSum = 0; for (int h = 0, k = n; k >= 0; --k) { for (; h < eventsLen && events[h].first == k; ++h) { const int i = events[h].second; conn(i, i + 1); } ans[k] = prodSum; } const int ansLen = min({LA, LB, LC}); for (int k = 1; k <= ansLen; ++k) { if (k > 1) printf( ); printf( %d , (int)(ans[k] % MO)); } puts( ); } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1000005; int l[N], r[N], n, i, ans, a[N], w, j; char c[N]; bool bb[N]; set<int> s; set<int>::iterator it; inline void maintain(int i) { if ((l[i] && c[i] != c[l[i]]) || (r[i] <= n && c[r[i]] != c[i])) s.insert(i); else if (s.count(i)) s.erase(i); } int main() { scanf( %s , c + 1); n = strlen(c + 1); for (i = 1; i <= n; ++i) { l[i] = i - 1, r[i] = i + 1; r[0] = 1, l[n + 1] = n; if ((i > 1 && c[i] != c[i - 1]) || (i < n && c[i] != c[i + 1])) a[++w] = i; } ans = bool(w); for (;;) { for (i = 1; i <= w; ++i) bb[a[i]] = 1; s.clear(); for (i = 1; i <= w; ++i) { j = a[i]; l[r[j]] = l[j]; r[l[j]] = r[j]; if (!bb[l[j]] && l[j]) maintain(l[j]); if (!bb[r[j]] && r[j] <= n) maintain(r[j]); } for (i = 1; i <= w; ++i) bb[a[i]] = 0; if (s.empty()) break; ++ans; for (it = s.begin(), w = 0; it != s.end(); ++it) a[++w] = *it; s.clear(); } return printf( %d n , ans), 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; string s; cin >> s; vector<int> A(91, 0); for (int i = 0; s[i]; i++) { A[(int)s[i]]++; } for (int i = 65; i < 65 + k; i++) if (A[i] == 0) { cout << 0 ; return 0; } cout << k * (*min_element(A.begin() + 65, A.begin() + 65 + k)); return 0; }
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; struct Matrix { long long coef[105][105]; Matrix() { for (int i = (0); i <= (101); ++i) for (int j = (0); j <= (101); ++j) coef[i][j] = 0; } Matrix operator*(Matrix a) { Matrix res; for (int i = (0); i <= (101); ++i) { for (int j = (0); j <= (101); ++j) { for (int k = (0); k <= (101); ++k) { res.coef[i][j] = (res.coef[i][j] + coef[i][k] * a.coef[k][j] % mod) % mod; } } } return res; } }; Matrix expo(Matrix A, long long n) { if (n == 1) return A; Matrix Q = expo(A, n / 2); if (n % 2 == 0) return Q * Q; return Q * Q * A; } int a[50001]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, b, k, x; cin >> n >> b >> k >> x; Matrix A; for (int i = 1; i <= int(n); i++) cin >> a[i]; for (int i = 1; i <= int(n); i++) { for (int m = 0; m < int(x); m++) { int newm = (m * 10 + a[i]) % x; A.coef[m][newm]++; } } Matrix B = expo(A, b); cout << B.coef[0][k] << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const long long int INF = 1e18 + 2; bool compareBysecond(pair<long long int, long long int> a, pair<long long int, long long int> b) { return a.second > b.second; } int log(long long int x) { int cnt = 0; while (x > 0) { cnt++; x = x >> 1; } return cnt; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) { int n, x, y; cin >> n >> x >> y; int k = n; while (((y - x) % (k - 1)) != 0) k--; int d = (y - x) / (k - 1); vector<int> ans; for (int i = 0; x + i * d <= y; ++i) { ans.push_back(x + i * d); } if (ans.size() != n) { int temp = x - d; while (temp > 0 && ans.size() != n) { ans.push_back(temp); temp -= d; } } if (ans.size() != n) { int temp = y + d; while (ans.size() != n) { ans.push_back(temp); temp += d; } } for (auto it : ans) cout << it << ; cout << n ; ; } return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000 + 10; const int MAXM = 10000 + 10; const int INF = 1000 * 1000 * 1000; int n, m, a[MAXM], b[MAXM], c[MAXM], q[MAXN], d[MAXN][MAXN], s, minimum[MAXN]; int main() { int check = 0; int sum = 0; int pt = 0; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; minimum[i] = INF; } cin >> m; for (int i = 0; i < m; i++) { cin >> a[i] >> b[i] >> c[i]; d[a[i]][b[i]] = c[i]; minimum[b[i]] = min(c[i], minimum[b[i]]); } for (int i = 1; i <= n; i++) { if (minimum[i] != INF) { sum += minimum[i]; check++; } } if (check == n - 1) cout << sum; else cout << -1; cin >> s; return 0; }
#include <bits/stdc++.h> using namespace std; char arr[2][100010]; int vis[2][100010]; int k, n, curj1, curj2; bool valid(int i, int j) { if (i >= 0 && i < 2 && j >= 0 && j >= n) return true; if (i >= 0 && i < 2 && j >= 0 && j < n && arr[i][j] != X && vis[i][j] == 0) return true; return false; } void bfs(int i, int j) { queue<pair<int, int> > q; q.push(make_pair(i, j)); vis[i][j] = 1; while (!q.empty()) { int toi = q.front().first; int toj = q.front().second; q.pop(); if (toj >= n) { cout << YES << endl; return; } if (valid(toi + 1, toj + k)) { q.push(make_pair(toi + 1, toj + k)); vis[toi + 1][toj + k] = vis[toi][toj] + 1; } if (valid(toi - 1, toj + k)) { q.push(make_pair(toi - 1, toj + k)); vis[toi - 1][toj + k] = vis[toi][toj] + 1; } if (valid(toi, toj + 1)) { q.push(make_pair(toi, toj + 1)); vis[toi][toj + 1] = vis[toi][toj] + 1; } if (valid(toi, toj - 1) && toj - 1 > vis[toi][toj] - 1) { q.push(make_pair(toi, toj - 1)); vis[toi][toj - 1] = vis[toi][toj] + 1; } } cout << NO << endl; } int main() { int i, j; cin >> n >> k; for (i = 0; i < 2; i++) { for (j = 0; j < n; j++) cin >> arr[i][j]; } bfs(0, 0); return 0; }
#include <bits/stdc++.h> using namespace std; int Res[2][7010], N[2][7010], Loss[2][7010]; int n, m, k, OpN[2]; queue<pair<int, int> > Q; int main() { srand((unsigned)time(0)); ios::sync_with_stdio(false); cin.tie(0); cin >> n; cin.get(); for (int i = 0; i < 2; i++) { cin >> m; OpN[i] = m; for (int j = 0; j < m; j++) { cin >> k; N[i][j] = k; Res[i][n + 1 - k] = 1; Q.push({i, n + 1 - k}); } } pair<int, int>* P; while (!Q.empty()) { P = &Q.front(); int k = !P->first, i = P->second; Q.pop(); for (int j = 0; j < OpN[k]; j++) { int h = N[k][j], l = ((i - h < 1) ? (i - h + n) : (i - h)); if (Res[k][l] == 0) { Loss[k][l]++; } } for (int i = 2; i < n + 1; i++) { if (Res[k][i] == 0) { if (Loss[k][i] == OpN[k]) { Res[k][i] = 2; for (int t = 0; t < OpN[!k]; t++) { int h = N[!k][t], l = ((i - h < 1) ? (i - h + n) : (i - h)); if (Res[!k][l] == 0) { Res[!k][l] = 1; Q.push({!k, l}); } } } } } } string Out[3] = { Loop , Win , Lose }; for (int k = 0; k < 2; k++) { for (int i = 2; i < n + 1; i++) { cout << Out[Res[k][i]].c_str() << ; } cout << n ; } }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long long a, b, c, d; cin >> a >> b >> c >> d; bool prob[5]; for (bool& i : prob) { i = true; } if ((a == 0 && b == 0) || (a + b) % 2 == 0) { prob[1] = prob[2] = false; if (a == 0 && d == 0) { prob[4] = false; } else if (b == 0 && c == 0) { prob[3] = false; } } else { prob[3] = prob[4] = false; if (a == 0 && d == 0) { prob[1] = false; } else if (b == 0 && c == 0) { prob[2] = false; } } for (int i = 1; i <= 4; i++) { cout << (prob[i] ? Ya : Tidak ); } cout << endl; } }
#include <bits/stdc++.h> using namespace std; vector<int> p[3030]; long long dist[3030][3030]; pair<long long, long long> out[3030][5]; pair<long long, long long> in[3030][5]; void bfs(int x) { dist[x][x] = 0; queue<pair<long long, long long> > q; q.push(make_pair(0, x)); pair<long long, long long> t; while (!q.empty()) { t = q.front(); q.pop(); for (int i = 0; i < p[t.second].size(); i++) { if (dist[x][p[t.second][i]] > 1 + t.first) { dist[x][p[t.second][i]] = 1 + t.first; out[x][0] = make_pair(dist[x][p[t.second][i]], p[t.second][i]); sort(out[x], out[x] + 5); in[p[t.second][i]][0] = make_pair(dist[x][p[t.second][i]], x); sort(in[p[t.second][i]], in[p[t.second][i]] + 5); q.push(make_pair(dist[x][p[t.second][i]], p[t.second][i])); } } } } int main() { int n, m, x, y; cin >> n >> m; for (int i = 0; i < m; i++) { scanf( %d%d , &x, &y); p[x].push_back(y); } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { dist[i][j] = 1e18; } for (int j = 0; j <= 4; j++) { out[i][j] = make_pair(-1, -1); in[i][j] = make_pair(-1, -1); } } for (int i = 1; i <= n; i++) bfs(i); long long l1, l2; int res[5]; long long maxx = -1; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (i == j) continue; l2 = dist[i][j]; if (l2 == 1e18) continue; for (int k = 4; k >= 0; k--) { for (int k1 = 4; k1 >= 0; k1--) { l1 = l2; x = in[i][k].second; y = out[j][k1].second; if (x == y) continue; if (x == i || x == j) continue; if (y == i || y == j) continue; if (x == -1 || y == -1) continue; l1 += in[i][k].first; l1 += out[j][k1].first; if (maxx < l1) { maxx = l1; res[0] = x; res[1] = i; res[2] = j; res[3] = y; } } } } } for (int i = 0; i < 4; i++) printf( %d , res[i]); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10, mod = 1e9 + 7; void solve() { int n; cin >> n; int a[n]; for (int i = 0; i < n; ++i) { cin >> a[i]; } int ans = 0; for (int i = 1; i < n; ++i) { if (a[i] == 3 && a[i - 1] == 1) { ans += 4; } else if (a[i] == 1 && a[i - 1] == 3) { ans += 4; } else if (a[i] == 2 && a[i - 1] == 1) { if (i > 1 && a[i - 2] == 3) { ans += 2; } else { ans += 3; } } else if (a[i] == 1 && a[i - 1] == 2) { ans += 3; } else if (a[i] == 3 && a[i - 1] == 2) { cout << Infinite << endl; return; } else if (a[i] == 2 && a[i - 1] == 3) { cout << Infinite << endl; return; } } cout << Finite << endl; cout << ans << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t = 1; while (t--) solve(); return 0; }
#include <bits/stdc++.h> using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << : << arg1 << std::endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cerr.write(names, comma - names) << : << arg1 << | ; __f(comma + 1, args...); } const int M = 100; int cal(int t) { return (t >= 0 ? t : -t); } int n, d, a[M + 5], x[M + 5], y[M + 5], dist[M + 5][M + 5]; int main() { scanf( %d %d , &n, &d); for (int i = 2; i < n; i++) scanf( %d , &a[i]); 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++) dist[i][j] = (i == j ? 0 : cal(x[i] - x[j]) * d + cal(y[i] - y[j]) * d - a[j]); for (int k = 1; k <= n; k++) for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]); printf( %d , dist[1][n]); }
#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, k; cin >> n >> k; vector<string> s(n); for (long long i = 0; i < n; i++) cin >> s[i]; vector<long long> g[n * n]; for (long long i = 0; i < n; i++) for (long long j = 0; j < n; j++) { if (i + 1 < n) g[i * n + j].push_back((i + 1) * n + j); if (j + 1 < n) g[i * n + j].push_back(i * n + (j + 1)); } vector<long long> kval(n * n); vector<char> cval(n * n); vector<char> cval2(n * n); for (long long i = 0; i < n; i++) for (long long j = 0; j < n; j++) { cval[i * n + j] = s[i][j]; cval2[i * n + j] = s[i][j]; } kval[0] = k; if (cval[0] != a && kval[0]) { cval[0] = a ; kval[0] -= 1; } string ans; queue<long long> q; ans += cval[0]; q.push(0); while (q.size()) { set<long long> tq; long long maxkval = 0; char mincval = z ; while (q.size()) { long long x = q.front(); q.pop(); for (auto y : g[x]) { tq.insert(y); if (kval[x]) { kval[y] = max(kval[y], kval[x] - (cval[y] != a )); cval2[y] = a ; } maxkval = max(maxkval, kval[y]); mincval = min(mincval, cval2[y]); } } ans += mincval; for (auto v : tq) if (cval2[v] == mincval) q.push(v); } cout << ans.substr(0, 2 * n - 1) << n ; }
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using std::abs; using std::cerr; using std::cin; using std::cout; using std::map; using std::max; using std::min; using std::pair; using std::set; using std::string; using std::swap; using std::vector; using ll = long long; using uint = unsigned int; using pii = pair<int, int>; using pll = pair<ll, ll>; template <typename T> void err(vector<string>::iterator it, T a) { cerr << it->substr((*it)[0] == ) << = << a << n ; } template <typename T, typename... Ts> void err(vector<string>::iterator it, T a, Ts... as) { cerr << it->substr((*it)[0] == ) << = << a << , ; err(++it, as...); } struct init { init() { cin.tie(0); std::iostream::sync_with_stdio(0); cout << std::fixed << std::setprecision(10); cerr << std::fixed << std::setprecision(10); srand(228); } ~init() { cerr << Time elapsed: << 1.0 * (double)clock() / CLOCKS_PER_SEC << s. n ; } } init; const int MAXN = 1e5 + 15; const ll INF = 1e16; ll a[MAXN][3]; ll dp[MAXN][3][2]; int main() { int n; cin >> n; for (int i = 0; i <= n; ++i) for (int j = 0; j < 3; ++j) for (int k = 0; k < 2; ++k) dp[i][j][k] = -INF; for (int i = 0; i < 3; ++i) for (int j = 1; j <= n; ++j) cin >> a[j][i]; a[0][1] = a[0][2] = -INF; dp[0][0][0] = 0; for (int i = 1; i <= n; ++i) { dp[i][0][0] = max({dp[i - 1][0][0] + a[i][0], dp[i - 1][1][0] + a[i - 1][0] + a[i][0], dp[i - 1][2][0] + a[i - 1][1] + a[i - 1][0] + a[i][0], i > 1 ? dp[i - 1][2][1] + a[i - 1][1] + a[i - 2][1] + a[i - 2][0] + a[i - 1][0] + a[i][0] : -INF}); dp[i][0][1] = dp[i - 1][0][0] + a[i][0]; dp[i][1][0] = max({dp[i - 1][0][0] + a[i - 1][1] + a[i][1], dp[i - 1][1][0] + a[i][1], dp[i - 1][2][0] + a[i - 1][1] + a[i][1]}); dp[i][1][1] = -INF; dp[i][2][0] = max({dp[i - 1][0][0] + a[i - 1][1] + a[i - 1][2] + a[i][2], dp[i - 1][1][0] + a[i - 1][2] + a[i][2], dp[i - 1][2][0] + a[i][2], i > 1 ? dp[i - 1][0][1] + a[i - 1][1] + a[i - 2][1] + a[i - 2][2] + a[i - 1][2] + a[i][2] : -INF}); dp[i][2][1] = dp[i - 1][2][0] + a[i][2]; for (int j = 0; j < 3; ++j) ; } ll ans = max({dp[n][0][0] + a[n][1] + a[n][2], dp[n][1][0] + a[n][2], dp[n][2][0], dp[n][0][1] + a[n][1] + a[n - 1][1] + a[n - 1][2] + a[n][2]}); cout << ans << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const long double EPS = 1e-9; const long double PI = atan(1) * 4; const long long M = 1000000007; struct PT { double x, y; PT() {} PT(double x, double y) : x(x), y(y) {} PT(const PT &p) : x(p.x), y(p.y) {} PT operator+(const PT &p) const { return PT(x + p.x, y + p.y); } PT operator-(const PT &p) const { return PT(x - p.x, y - p.y); } PT operator*(double c) const { return PT(x * c, y * c); } PT operator/(double c) const { return PT(x / c, y / c); } }; double dot(PT p, PT q) { return p.x * q.x + p.y * q.y; } double dist2(PT p, PT q) { return dot(p - q, p - q); } double cross(PT p, PT q) { return p.x * q.y - p.y * q.x; } double cos_u2v(const PT &u, const PT &v) { return dot(u, v) / sqrt(dot(u, u) * dot(v, v)); } double sin_u2v(const PT &u, const PT &v) { return cross(u, v) / sqrt(dot(u, u) * dot(v, v)); } ostream &operator<<(ostream &os, const PT &p) { os << ( << p.x << , << p.y << ) ; } double vector2angle(const PT &v) { return atan2(v.y, v.x); } struct UnionFind { vector<long long> C; UnionFind(long long n) : C(n) { for (int i = 0; i < n; i++) C[i] = i; } long long find(long long x) { return (C[x] == x) ? x : C[x] = find(C[x]); } void merge(long long x, long long y) { C[find(x)] = find(y); } }; long long mod(long long x, long long m) { return ((x % m) + m) % m; } long long gcd(long long a, long long b) { for (; b > 0; swap(a, b)) a %= b; return a; } long long extended_euclid(long long a, long long b, long long &x, long long &y) { long long xx = y = 0; long long yy = x = 1; while (b) { long long q = a / b; long long t = b; b = a % b; a = t; t = xx; xx = x - q * xx; x = t; t = yy; yy = y - q * yy; y = t; } return a; } long long mod_inverse(long long a, long long n) { long long x, y; long long d = extended_euclid(a, n, x, y); if (d > 1) return -1; return mod(x, n); } long long discretize(vector<long long> &x) { set<long long> avset(x.begin(), x.end()); map<long long, long long> vmap; long long dn = 0; for (auto it = avset.begin(); it != avset.end(); it++) vmap[*it] = dn++; for (long long i = 0, n = x.size(); i < n; i++) x[i] = vmap[x[i]]; return dn; } struct LPSolver { int m, n; vector<long long> B, N; vector<vector<long double>> D; LPSolver(const vector<vector<long double>> &A, const vector<long double> &b, const vector<long double> &c) : m(b.size()), n(c.size()), N(n + 1), B(m), D(m + 2, vector<long double>(n + 2)) { for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) D[i][j] = A[i][j]; for (int i = 0; i < m; i++) { B[i] = n + i; D[i][n] = -1; D[i][n + 1] = b[i]; } for (int j = 0; j < n; j++) { N[j] = j; D[m][j] = -c[j]; } N[n] = -1; D[m + 1][n] = 1; } void Pivot(int r, int s) { for (int i = 0; i < m + 2; i++) if (i != r) for (int j = 0; j < n + 2; j++) if (j != s) D[i][j] -= D[r][j] * D[i][s] / D[r][s]; for (int j = 0; j < n + 2; j++) if (j != s) D[r][j] /= D[r][s]; for (int i = 0; i < m + 2; i++) if (i != r) D[i][s] /= -D[r][s]; D[r][s] = 1.0 / D[r][s]; swap(B[r], N[s]); } bool Simplex(int phase) { int x = phase == 1 ? m + 1 : m; while (true) { int s = -1; for (int j = 0; j <= n; j++) { if (phase == 2 && N[j] == -1) continue; if (s == -1 || D[x][j] < D[x][s] || D[x][j] == D[x][s] && N[j] < N[s]) s = j; } if (D[x][s] > -EPS) return true; int r = -1; for (int i = 0; i < m; i++) { if (D[i][s] < EPS) continue; if (r == -1 || D[i][n + 1] / D[i][s] < D[r][n + 1] / D[r][s] || (D[i][n + 1] / D[i][s]) == (D[r][n + 1] / D[r][s]) && B[i] < B[r]) r = i; } if (r == -1) return false; Pivot(r, s); } } long double solve(vector<long double> &x) { int r = 0; for (int i = 1; i < m; i++) if (D[i][n + 1] < D[r][n + 1]) r = i; if (D[r][n + 1] < -EPS) { Pivot(r, n); if (!Simplex(1) || D[m + 1][n + 1] < -EPS) return -numeric_limits<long double>::infinity(); for (int i = 0; i < m; i++) if (B[i] == -1) { int s = -1; for (int j = 0; j <= n; j++) if (s == -1 || D[i][j] < D[i][s] || D[i][j] == D[i][s] && N[j] < N[s]) s = j; Pivot(i, s); } } if (!Simplex(2)) return numeric_limits<long double>::infinity(); x = vector<long double>(n); for (int i = 0; i < m; i++) if (B[i] < n) x[B[i]] = D[i][n + 1]; return D[m][n + 1]; } }; void buildadjlist(long long n, const vector<long long> &froms, const vector<long long> &tos, vector<long long> &v2e0, vector<long long> &e2n) { v2e0.resize(n); v2e0.assign(n, -1); long long en = froms.size(); e2n.resize(en); for (int i = 0; i < en; i++) { long long f = froms[i]; long long t = tos[i]; e2n[i] = v2e0[f]; v2e0[f] = i; } } void dijkstra(const vector<long long> &v2e0, const vector<long long> &e2t, const vector<long long> &e2c, const vector<long long> &e2n, long long src, vector<long long> &dist, vector<long long> &prec) { long long n = v2e0.size(); dist.resize(n); dist.assign(n, INT_MAX); prec.resize(n); prec.assign(n, -1); vector<bool> arr(n); long long sel = src; dist[sel] = 0; while (sel >= 0) { arr[sel] = true; for (long long i = v2e0[sel]; i >= 0; i = e2n[i]) { long long to = e2t[i]; long long cost = e2c[i]; if (!arr[to] && dist[to] > dist[sel] + cost) { dist[to] = dist[sel] + cost; prec[to] = sel; } } sel = -1; for (long long i = 0; i < n; i++) if (!arr[i] && (sel == -1 || dist[i] < dist[sel])) sel = i; } } void tarjan_dfs(long long v, long long &timer, long long &cn, vector<long long> &vtime, vector<long long> &rtime, const vector<long long> &v2e0, const vector<long long> &e2t, const vector<long long> &e2n, vector<long long> &v2c, stack<long long> &stk) { stk.push(v); rtime[v] = vtime[v] = timer++; for (long long i = v2e0[v]; i >= 0; i = e2n[i]) { long long w = e2t[i]; if (vtime[w] == -1) { tarjan_dfs(w, timer, cn, vtime, rtime, v2e0, e2t, e2n, v2c, stk); rtime[v] = min(rtime[v], rtime[w]); } else if (v2c[w] == -1) rtime[v] = min(rtime[v], vtime[w]); } if (vtime[v] == rtime[v]) { while (true) { long long pv = stk.top(); v2c[pv] = cn; stk.pop(); if (pv == v) break; } cn++; } } void tarjan_strong(long long n, const vector<long long> &v2e0, const vector<long long> &e2t, const vector<long long> &e2n, vector<long long> &v2c) { v2c.assign(n, -1); vector<long long> vtime(n, -1); vector<long long> rtime(n, -1); stack<long long> stk; long long timer = 0, cn = 0; for (long long i = 0; i < n; i++) { if (vtime[i] >= 0) continue; tarjan_dfs(i, timer, cn, vtime, rtime, v2e0, e2t, e2n, v2c, stk); } } struct FordFulk { const vector<long long> &v2e0; const vector<long long> &e2f; const vector<long long> &e2t; const vector<long long> &e2c; const vector<long long> &e2n; long long s, t; FordFulk(const vector<long long> &_v2e0, const vector<long long> &_e2f, const vector<long long> &_e2t, const vector<long long> &_e2c, const vector<long long> &_e2n, long long _s, long long _t) : s(_s), t(_t), v2e0(_v2e0), e2f(_e2f), e2t(_e2t), e2c(_e2c), e2n(_e2n) {} long long _find_aug_path(const vector<long long> &v2e0, const vector<long long> &e2f, const vector<long long> &e2t, const vector<long long> &e2c, const vector<long long> &e2n, long long s, long long t, vector<long long> &epath) { vector<long long> q2v; vector<long long> q2p; vector<long long> q2e; vector<long long> q2f; vector<bool> inq(v2e0.size(), false); q2v.push_back(s); q2p.push_back(-1); q2e.push_back(-1); q2f.push_back(INT_MAX); inq[s] = true; for (long long i = 0; i < q2v.size(); i++) { long long crt = q2v[i]; long long f = q2f[i]; for (long long j = v2e0[crt]; j != -1; j = e2n[j]) { long long to = e2t[j]; long long rem = e2c[j]; if (inq[to]) continue; if (rem <= 0) continue; q2v.push_back(to); q2p.push_back(i); q2e.push_back(j); q2f.push_back(min(f, rem)); inq[to] = true; } } for (long long i = 0; i < q2v.size(); i++) { if (q2v[i] != t) continue; stack<long long> stk; for (long long j = i; j > 0; j = q2p[j]) { stk.push(q2e[j]); } while (!stk.empty()) { epath.push_back(stk.top()); stk.pop(); } return q2f[i]; } return 0; } long long eval() { long long en = e2f.size(); map<pair<long long, long long>, long long> rsd; for (long long i = 0; i < en; i++) { long long f = e2f[i]; long long t = e2t[i]; rsd[make_pair(f, t)] += e2c[i]; rsd[make_pair(t, f)] += 0; } map<pair<long long, long long>, long long> nei; long long ren = 0; for (auto er : rsd) { nei[er.first] = ren++; } long long rvn = v2e0.size(); vector<long long> rv2e0(rvn, -1); vector<long long> re2f(ren); vector<long long> re2t(ren); vector<long long> re2c(ren); vector<long long> re2n(ren); vector<long long> re2p(ren); long long rei = 0; for (auto er : rsd) { long long f = er.first.first; long long t = er.first.second; long long c = er.second; re2f[rei] = f; re2t[rei] = t; re2c[rei] = c; re2p[rei] = nei[make_pair(t, f)]; re2n[rei] = rv2e0[f]; rv2e0[f] = rei; ++rei; } long long sol = 0; vector<long long> epath; while (true) { epath.clear(); long long res = _find_aug_path(rv2e0, re2f, re2t, re2c, re2n, s, t, epath); if (res == 0) break; for (auto ei : epath) { re2c[ei] -= res; re2c[re2p[ei]] += res; } sol += res; } return sol; } }; template <typename T> struct BIT1D { long long n; vector<T> v; T (*fnx)(long long, T); T (*fab)(T, T); long long rg(long long k) { return ((k ^ (k + 1)) + 1) / 2; } BIT1D(long long _n, T v0, T (*_fnx)(long long, T), T (*_fab)(T, T)) : n(_n), v(_n), fnx(_fnx), fab(_fab) { for (long long i = 0; i < n; i++) v[i] = fnx(rg(i), v0); } void update(long long i, T v1) { for (; i < n; i += rg(i)) v[i] = fab(v[i], v1); } T query(long long i) { long long j = i - rg(i); return (j < 0) ? v[i] : (query(j) + v[i]); } }; template <typename T> struct LazySegTree1D { vector<T> v; vector<long long> opr; vector<T> opd; vector<long long> nxt; long long LEFT; long long RGHT; T (*fnx)(long long, T); T (*fab)(T, T); LazySegTree1D(long long _l, long long _r, T _v, T (*_fnx)(long long, T), T (*_fab)(T, T)) : v(1), opr(1), opd(1), nxt(1), LEFT(_l), RGHT(_r), fnx(_fnx), fab(_fab) { v[0] = fnx(RGHT - LEFT + 1, _v); opr[0] = 0; opd[0] = _v; nxt[0] = -1; } void _split(long long i, long long l0, long long r0) { assert(nxt[i] == -1); assert(opr[i] == 0); assert(l0 < r0); long long n = v.size(); nxt[i] = n; long long m0 = (l0 + r0) / 2; v.push_back(fnx(m0 - l0 + 1, opd[i])); v.push_back(fnx(r0 - m0, opd[i])); opr.push_back(0); opr.push_back(0); opd.push_back(opd[i]); opd.push_back(opd[i]); nxt.push_back(-1); nxt.push_back(-1); } void _pushdown(long long i, long long l0, long long r0) { if (opr[i] == -1) return; long long m0 = (l0 + r0) / 2; if (nxt[i] == -1) _split(i, l0, r0); else if (opr[i] >= 0) { _set(nxt[i], l0, m0, l0, m0, opr[i], opd[i]); _set(nxt[i] + 1, m0 + 1, r0, m0 + 1, r0, opr[i], opd[i]); } opr[i] = -1; } void _set(long long i, long long l0, long long r0, long long l1, long long r1, long long o1, T v1) { assert(l1 >= l0 && r1 <= r0); if (l0 == l1 && r0 == r1) { if (o1 == 0) { v[i] = fnx(r0 - l0 + 1, v1); opr[i] = 0; opd[i] = v1; } else if (o1 == 1) { v[i] = fab(v[i], fnx(r0 - l0 + 1, v1)); if (opr[i] == -1) { opr[i] = 1; opd[i] = v1; } else if (opr[i] == 0) { opr[i] = 0; opd[i] = fab(opd[i], v1); } else if (opr[i] == 1) { opr[i] = 1; opd[i] = fab(opd[i], v1); } } return; } long long m0 = (l0 + r0) / 2; _pushdown(i, l0, r0); if (l1 <= m0) _set(nxt[i], l0, m0, l1, min(r1, m0), o1, v1); if (r1 > m0) _set(nxt[i] + 1, m0 + 1, r0, max(l1, m0 + 1), r1, o1, v1); v[i] = fab(v[nxt[i]], v[nxt[i] + 1]); } T _get(long long i, long long l0, long long r0, long long l1, long long r1) { assert(l0 <= l1 && r1 <= r0); if (l0 == l1 && r1 == r0) return v[i]; _pushdown(i, l0, r0); long long m0 = (l0 + r0) / 2; if (r1 <= m0) return _get(nxt[i], l0, m0, l1, r1); if (m0 + 1 <= l1) return _get(nxt[i] + 1, m0 + 1, r0, l1, r1); T lv = _get(nxt[i], l0, m0, l1, m0); T rv = _get(nxt[i] + 1, m0 + 1, r0, m0 + 1, r1); return fab(lv, rv); } void updres(long long l1, long long r1, T v1) { _set(0, LEFT, RGHT, l1, r1, 1, v1); } void setval(long long l1, long long r1, T v1) { _set(0, LEFT, RGHT, l1, r1, 0, v1); } T get(long long l1, long long r1) { return _get(0, LEFT, RGHT, l1, r1); } }; void suffix_array(const string &s, vector<long long> &sa, vector<long long> &rank) { long long n = s.size(); long long ri = 0; vector<vector<long long>> tmprank(2, vector<long long>(n)); vector<pair<pair<long long, long long>, long long>> kni(n); for (long long g = 1; g / 2 <= n - 1; g *= 2, ri = 1 - ri) { for (long long i = 0; i < n; i++) { long long key1 = (g == 1) ? s[i] : tmprank[ri][i]; long long key2 = (g == 1) ? 0 : (i + g / 2 < n) ? (tmprank[ri][i + g / 2]) : -1; kni[i] = make_pair(make_pair(key1, key2), i); } sort(kni.begin(), kni.end()); for (long long i = 0, last_rank = -1; i < n; i++) { long long this_rank = (i > 0 && kni[i].first == kni[i - 1].first) ? last_rank : i; last_rank = tmprank[1 - ri][kni[i].second] = this_rank; } } rank.resize(n); rank.assign(tmprank[ri].begin(), tmprank[ri].end()); sa.resize(n); for (long long i = 0; i < n; i++) sa[rank[i]] = i; } struct SuffixTree { string str; vector<unordered_map<long long, long long>> sta; vector<unordered_map<long long, long long>> end; vector<unordered_map<long long, long long>> nxt; vector<long long> suflink; long long capacity; long long node_count; long long act_node; long long act_br; long long act_len; long long todo_count; bool _nodehasbr(long long node, long long br) { auto m = nxt[node]; return m.find(br) != m.end(); } long long _newnode() { if (node_count < capacity) { long long newi = node_count++; suflink[newi] = -1; sta[newi].clear(); end[newi].clear(); nxt[newi].clear(); return newi; } sta.emplace_back(); end.emplace_back(); nxt.emplace_back(); suflink.push_back(-1); ++node_count; ++capacity; return node_count - 1; } long long _edgerealend(long long node, long long br) { long long tmp = end[node][br]; return (tmp == -1) ? (str.size() - 1) : tmp; } long long _edgelen(long long node, long long br) { return (br == -1) ? 0 : (!_nodehasbr(node, br)) ? 0 : (_edgerealend(node, br) - sta[node][br] + 1); } void clear() { node_count = 0; act_node = 0; act_br = -1; act_len = 0; todo_count = 0; _newnode(); } SuffixTree(long long est_strlen) { capacity = 0; if (est_strlen > 0) { long long est_nodecnt = est_strlen * 2; capacity = est_nodecnt; sta = vector<unordered_map<long long, long long>>(est_nodecnt); end = vector<unordered_map<long long, long long>>(est_nodecnt); nxt = vector<unordered_map<long long, long long>>(est_nodecnt); suflink = vector<long long>(est_nodecnt, -1); } clear(); } bool _tryextend(long long chr) { if (act_len == 0) { if (!_nodehasbr(act_node, chr)) return false; act_br = chr; ++act_len; return true; } if (act_len == _edgelen(act_node, act_br)) { long long nxtnode = nxt[act_node][act_br]; if (!_nodehasbr(nxtnode, chr)) return false; act_node = nxtnode; act_br = chr; act_len = 1; return true; } long long start = sta[act_node][act_br]; if (chr != str[start + act_len]) return false; ++act_len; return true; } void _branch(long long node, long long chr) { long long newnode = _newnode(); sta[node][chr] = str.size() - 1; end[node][chr] = -1; nxt[node][chr] = newnode; } long long _actsplit(long long chr) { long long new0 = _newnode(); long long new1 = _newnode(); long long start = sta[act_node][act_br]; sta[new0][str[start + act_len]] = start + act_len; end[new0][str[start + act_len]] = end[act_node][act_br]; nxt[new0][str[start + act_len]] = nxt[act_node][act_br]; sta[new0][chr] = str.size() - 1; end[new0][chr] = -1; nxt[new0][chr] = new1; sta[act_node][act_br] = start; end[act_node][act_br] = start + act_len - 1; nxt[act_node][act_br] = new0; return new0; } long long _splitorbranch(long long chr) { if (act_br >= 0 && act_len < _edgelen(act_node, act_br)) return _actsplit(chr); long long target_node = (act_len == 0) ? 0 : nxt[act_node][act_br]; _branch(target_node, chr); return target_node; } string _edgestr(long long node, long long br) { long long start = sta[node][br]; long long end = _edgerealend(node, br); return str.substr(start, end - start + 1); } void _actsupdate(long long node, long long br, long long len) { act_node = node, act_br = br, act_len = len; } void _actfastfwd(long long start, long long slen) { if (act_br == -1) return; while (true) { long long elen = _edgelen(act_node, act_br); if (slen <= elen) return; long long new_act_node = nxt[act_node][act_br]; long long new_act_br = str[start + elen]; long long new_act_len = act_len - elen; _actsupdate(new_act_node, new_act_br, new_act_len); start += elen; slen -= elen; } } bool _actsgotonextsuf() { if (act_len == 0) return false; long long estart = sta[act_node][act_br]; if (act_node == 0) { act_br = (act_len == 1) ? (-1) : str[estart + 1]; --act_len; _actfastfwd(estart + 1, act_len); } else { act_node = (suflink[act_node] >= 0) ? suflink[act_node] : 0; _actfastfwd(estart, act_len); } } void insert(long long chr) { str.push_back(chr); ++todo_count; long long prev_created = -1; for (long long waitlink = -1; todo_count > 0; --todo_count) { bool suffix_exists = _tryextend(chr); if (suffix_exists) { waitlink = act_node; } else { waitlink = _splitorbranch(chr); } if (prev_created >= 0) suflink[prev_created] = waitlink; prev_created = waitlink; if (suffix_exists) break; _actsgotonextsuf(); } } }; const int N = 100; int l0[N] = {}; int l1[N] = {}; int r0[N] = {}; int r1[N] = {}; int main() { srand(time(NULL)); int n, m; cin >> n >> m; int p = 1; for (int i = 0; i < n; ++i) { if (p > m) break; l0[i] = p++; if (p > m) break; r0[i] = p++; if (p > m) break; } for (int i = 0; i < n; ++i) { if (p > m) break; l1[i] = p++; if (p > m) break; r1[i] = p++; if (p > m) break; } for (int i = 0; i < n; ++i) { if (l1[i] > 0) printf( %d , l1[i]); if (l0[i] > 0) printf( %d , l0[i]); if (r1[i] > 0) printf( %d , r1[i]); if (r0[i] > 0) printf( %d , r0[i]); } printf( n ); return 0; }