func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; int main() { long long int n, i, j, b, a, q, m; long long int t = 1; cin >> t; while (t--) { cin >> n >> m; vector<vector<long long int>> v(n, vector<long long int>(m)); long long int f = 0; for (i = 0; i < n; ++i) { for (j = 0; j < m; ++j) { cin >> v[i][j]; if (v[i][j] > 4) { f = 1; } } } for (i = 1; i < n - 1; ++i) { if (v[i][0] > 3 || v[i][m - 1] > 3) { f = 1; break; } } for (j = 1; j < m - 1; ++j) { if (v[0][j] > 3 || v[n - 1][j] > 3) { f = 1; break; } } if (v[0][0] > 2 || v[0][m - 1] > 2 || v[n - 1][0] > 2 || v[n - 1][m - 1] > 2) { f = 1; } if (n == 1 && v[0][0] != 0) { f = 1; } if (f == 1) { cout << NO << n ; } else { cout << YES << n ; for (i = 0; i < n; ++i) { for (j = 0; j < m; ++j) { if ((i == 0 && j == 0) || (i == 0 && j == m - 1) || (i == n - 1 && j == 0) || (i == n - 1 && j == m - 1)) { cout << 2 << ; continue; } if (i == 0 || i == n - 1 || j == 0 || j == m - 1) { cout << 3 << ; continue; } cout << 4 << ; } cout << n ; } } } }
|
#include <bits/stdc++.h> using namespace std; const int MAX = 2000 * 100 + 9; int arr[MAX]; int ans[MAX]; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, v, ac, bc; cin >> n; for (int i = 0; i < n; i++) { cin >> arr[i]; } ac = -1; bc = MAX; for (int i = 0; i < n; i++) { if (arr[i] > ac && arr[i] < bc) { if (arr[i] < arr[i + 1]) { ans[i] = 0; ac = arr[i]; } else { ans[i] = 1; bc = arr[i]; } } else if (arr[i] > ac) { ans[i] = 0; ac = arr[i]; } else if (arr[i] < bc) { ans[i] = 1; bc = arr[i]; } else { cout << NO << endl; return 0; } } cout << YES << endl; for (int i = 0; i < n; i++) { cout << ans[i] << ; } cout << endl; return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; template <class T> T Gcd(T x, T y) { return y ? Gcd(y, x % y) : x; } template <class T> T Lcm(T x, T y) { return x / Gcd(x, y) * y; } template <class T> void Adj(T &x, T y) { if (x >= y) x %= y; while (x < 0) x += y; } const long long MOD = 1000000007LL; const int M = 5000005; const int N = 200005; int _, l, ll, a[N], aa[N], t1, t2, t3, t4, t5, t6, b[N], bb[N], t7, t8; char s[N], ss[N]; int main() { while (scanf( %s , (s + 1)), !strlen((s + 1))) ; while (scanf( %s , (ss + 1)), !strlen((ss + 1))) ; l = strlen(s + 1); ll = strlen(ss + 1); for (int i = 1; i <= l; i++) { a[i] = a[i - 1] + (s[i] == B || s[i] == C ); b[i] = (s[i] == A ) ? b[i - 1] + 1 : 0; } for (int i = 1; i <= ll; i++) { aa[i] = aa[i - 1] + (ss[i] == B || ss[i] == C ); bb[i] = (ss[i] == A ) ? bb[i - 1] + 1 : 0; } for (scanf( %d , &_); _; _--) { scanf( %d %d %d %d , &t1, &t2, &t3, &t4); t5 = a[t2] - a[t1 - 1]; t6 = aa[t4] - aa[t3 - 1]; t7 = t5 ? b[t2] : t2 - t1 + 1; t8 = t6 ? bb[t4] : t4 - t3 + 1; if (t7 == t8) { if (t5 <= t6 && (t6 - t5) % 2 == 0) { if (t6 > 0 && t5 > 0) putchar( 1 ); else if (!t6 && !t5) putchar( 1 ); else putchar( 0 ); } else putchar( 0 ); continue; } if (t5 == t6) { if (t7 >= t8 && (t7 - t8) % 3 == 0) putchar( 1 ); else putchar( 0 ); } else if (t5 < t6) { if (t7 - t8 >= 0 && (t6 - t5) % 2 == 0) putchar( 1 ); else putchar( 0 ); } else putchar( 0 ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; struct interval { int start; int end; }; int main() { int p, q, l, r; cin >> p >> q >> l >> r; struct interval Z[p]; for (int i = 0; i < p; i++) { cin >> Z[i].start >> Z[i].end; } struct interval X[q]; for (int i = 0; i < q; i++) { cin >> X[i].start >> X[i].end; } int count = 0; for (int i = l; i <= r; i++) { for (int j = 0; j < p; j++) { int flag = 0; for (int k = 0; k < q; k++) { if ((Z[j].start >= (X[k].start + i) && Z[j].end <= (X[k].end + i)) || ((X[k].start + i) >= Z[j].start && (X[k].end + i) <= Z[j].end) || (Z[j].start >= (X[k].start + i) && Z[j].start <= (X[k].end + i)) || (Z[j].end >= (X[k].start + i) && Z[j].end <= (X[k].end + i)) || ((X[k].start + i) >= Z[j].start && (X[k].start + i) <= Z[j].end) || ((X[k].end + i) >= Z[j].start && (X[k].end + i) <= Z[j].end)) { count++; flag = 1; break; } } if (flag) break; } } cout << count << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; void Merge(int arr1[], int arr2[], int l, int m, int r) { int n1 = m - l + 1; int n2 = r - m; int L1[n1], L2[n1]; int R1[n2], R2[n1]; for (int i = 0; i < n1; i++) { L1[i] = arr1[i + l]; L2[i] = arr2[i + l]; } for (int i = 0; i < n2; i++) { R1[i] = arr1[m + i + 1]; R2[i] = arr2[m + i + 1]; } int L = 0; int R = 0; int k = l; while (L < n1 && R < n2) { if (L1[L] < R1[R]) { arr1[k] = L1[L]; arr2[k] = L2[L]; L++; } else { arr1[k] = R1[R]; arr2[k] = R2[R]; R++; } k++; } while (L < n1) { arr1[k] = L1[L]; arr2[k] = L2[L]; L++; k++; } while (R < n2) { arr1[k] = R1[R]; arr2[k] = R2[R]; R++; k++; } } void mergeSort(int arr1[], int arr2[], int l, int r) { if (l < r) { int m = l + (r - l) / 2; mergeSort(arr1, arr2, l, m); mergeSort(arr1, arr2, m + 1, r); Merge(arr1, arr2, l, m, r); } } int reduce(int arr1[], int m) { int value = 0; for (int i = 0; i < m; i++) { value += arr1[i]; if (value > 0) { return i; } } return m; } int main() { int n, m; cin >> n >> m; int arr[n - 1][m]; int index[n - 1][m]; for (int i = 0; i < n - 1; i++) { for (int j = 0; j < m; j++) { index[i][j] = j + 1; } } for (int i = 0; i < m; i++) { int values[n]; for (int j = 0; j < n; j++) { cin >> values[j]; } for (int j = 0; j < n - 1; j++) { arr[j][i] = values[n - 1] - values[j]; } } int max = 0; int max_index = 0; for (int i = 0; i < n - 1; i++) { mergeSort(arr[i], index[i], 0, m - 1); int k = reduce(arr[i], m); if (k > max) { max = k; max_index = i; } } cout << m - max << endl; for (int i = max; i < m - 1; i++) { cout << index[max_index][i] << ; } if (m - max > 0) { cout << index[max_index][m - 1]; } }
|
#include <bits/stdc++.h> using namespace std; bool check(string all, string ans) { return all.size() == ans.size(); } bool checkChar(string all, string ans) { vector<char> v1, v2; for (int i = 0; i < all.size(); i++) v1.push_back(all[i]); for (int i = 0; i < ans.size(); i++) v2.push_back(ans[i]); sort(v1.begin(), v1.end()); sort(v2.begin(), v2.end()); for (int i = 0; i < v1.size(); i++) { if (v1[i] != v2[i]) { return false; break; } } return true; } int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); string q, s, all; int n; vector<string> v; for (int i = 0; i < 3; i++) { string New; cin >> q; for (int k = 0; k < q.size(); k++) { if (isalpha(q[k])) New += tolower(q[k]); } all += New; v.push_back(New); } cin >> n; for (int i = 0; i < n; i++) { string NewS; cin >> s; for (int k = 0; k < s.size(); k++) { if (isalpha(s[k])) NewS += tolower(s[k]); } vector<int> pos; for (int m = 0; m < 3; m++) { size_t found = NewS.find(v[m]); if (found != string::npos) { pos.push_back(found); } else pos.push_back(-1); } sort(pos.begin(), pos.end()); if (pos.front() == -1 || pos[0] != 0) { cout << WA << endl; } else { if (check(all, NewS) && checkChar(all, NewS)) cout << ACC << endl; else cout << WA << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, a, b, k, num; cin >> n >> a >> b >> k; vector<int> need; int cnt = 0; for (int i = 0; i < n; i++) { cin >> num; if (num <= a) { cnt++; continue; } if (num % (a + b) == 0) { int to_add = (a + b) / a; if ((a + b) % a != 0) to_add++; need.push_back(to_add - 1); } else { int temp = num / (a + b); int req = num - temp * (a + b); int to_add = req / a; if (req % a != 0) to_add++; need.push_back(to_add - 1); } } sort(need.begin(), need.end()); for (int i = 0; i < need.size(); i++) { if (need[i] <= k) { k = k - need[i]; cnt++; } } cout << cnt << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int solve() { int N; cin >> N; if (N % 2) { N -= 9; if (N < 0 || N == 2) return -1; return 1 + N / 4; } else { if (N < 4) return -1; return N / 4; } } int main() { int Q; cin >> Q; while (Q--) cout << solve() << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 10101; char s[N], t[N * 100]; int ne[N][26]; int main() { scanf( %s , s); int lens = strlen(s); for (int i = lens; i >= 0; --i) { for (int d = 0; d < (26); ++d) ne[i][d] = i == lens ? lens : ne[i + 1][d]; if (i != lens) ne[i][s[i] - a ] = i; } scanf( %s , t); int len = strlen(t); int cnt = 0; for (int i = 0, j = 0; i < len; i = j) { ++cnt; for (int c = 0; j < len && ne[c][t[j] - a ] != lens; j++) { c = ne[c][t[j] - a ] + 1; } if (i == j) { puts( -1 ); return 0; } } printf( %d n , cnt); return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<long long> V, L, Q; vector<string> P; map<int, int> M; set<char> S; set<char>::iterator it; long long n, m, a, b, c, d, e, f, cnt, x, y, z, t; string s, p, ans, temp; long long arr[1001]; bool xy = 0; char bd; int main() { ios_base::sync_with_stdio(0); cin >> n >> m; cin >> s; for (int i = 0; i < n; i++) if (s[i] == G or s[i] == T ) { for (int j = i + m; j < n; j += m) { if (s[j] == # ) { cout << NO ; return 0; ; } if (s[j] == G or s[j] == T ) { cout << YES ; return 0; ; } } } cout << NO ; }
|
#include <bits/stdc++.h> using namespace std; set<long long> s, s1; std::set<long long>::iterator l, h; int main() { long long n, i, j, k, a, p, low, high, m; bool flag = false; scanf( %lld %lld %lld , &n, &k, &a); scanf( %lld , &m); a++; p = (n + 1) / a; long long q = k; s.insert(0); s.insert(n + 1); s1.insert(0); s1.insert(-n - 1); for (i = 1; i <= m; i++) { scanf( %lld , &k); if (!flag && k <= n && k >= 1) { l = s.lower_bound(k); if (l != s.begin()) --l; h = s1.lower_bound(-k); low = *l; if (h != s1.begin()) --h; high = -*h; long long z = p - ((high - low) / a) + (k - low) / a + (high - k) / a; if (z < q) { printf( %lld , i); flag = true; } p = z; s.insert(k); s1.insert(-k); } } if (!flag) printf( -1 ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAX_N = 305; string s[MAX_N][MAX_N], t[MAX_N][MAX_N]; int cnt0[MAX_N], cnt1[MAX_N]; int n, m; struct Move { int x_1, y_1, x_2, y_2; Move(int x_1_, int y_1_, int x_2_, int y_2_) : x_1(x_1_), y_1(y_1_), x_2(x_2_), y_2(y_2_) {} Move() {} }; vector<Move> ans; void go0(int i, int j) { if (i == 0 && j == 0) { ans.push_back(Move(0, 0, 0, m - 1)); ans.push_back(Move(0, m - 1, 0, 0)); } if (j != 0) ans.push_back(Move(0, 0, 0, j)); if (i != 0) ans.push_back(Move(0, j, i, j)); } void go1(int i, int j) { if (i == n - 1 && j == m - 1) { ans.push_back(Move(n - 1, m - 1, 0, m - 1)); ans.push_back(Move(0, m - 1, n - 1, m - 1)); } if (i != n - 1) ans.push_back(Move(n - 1, m - 1, i, m - 1)); if (j != m - 1) ans.push_back(Move(i, m - 1, i, j)); } int main() { scanf( %d%d , &n, &m); for (int i = 0; (i) < (n); ++i) { for (int j = 0; (j) < (m); ++j) cin >> s[i][j]; } for (int i = 0; (i) < (n); ++i) { for (int j = 0; (j) < (m); ++j) cin >> t[i][j]; } for (int i = (1); (i) < (n - 1); ++i) for (int j = 0; (j) < (m); ++j) { int len = (int)((s[i][j]).size()); for (int g = (len)-1; (g) >= 0; --g) { if (s[i][j][g] == 0 ) ans.push_back(Move(i, j, 0, j)), cnt0[j]++; else ans.push_back(Move(i, j, n - 1, j)), cnt1[j]++; } } for (int j = 0; (j) < (m); ++j) { int len = (int)((s[0][j]).size()); for (int g = (len)-1; (g) >= 0; --g) if (s[0][j][g] == 1 ) ans.push_back(Move(0, j, n - 1, j)), cnt1[j]++; else { if (j != 0) ans.push_back(Move(0, j, 0, 0)), cnt0[0]++; else ans.push_back(Move(0, 0, 0, m - 1)), cnt0[m - 1]++; } } for (int j = (m)-1; (j) >= 0; --j) { int len = (int)((s[n - 1][j]).size()); for (int g = (len)-1; (g) >= 0; --g) if (s[n - 1][j][g] == 0 ) ans.push_back(Move(n - 1, j, 0, j)), cnt0[j]++; else { if (j != m - 1) ans.push_back(Move(n - 1, j, n - 1, m - 1)), cnt1[m - 1]++; else ans.push_back(Move(n - 1, m - 1, n - 1, 0)), cnt1[0]++; } } for (int i = (1); (i) < (m); ++i) for (int g = 0; (g) < (cnt0[i]); ++g) ans.push_back(Move(0, i, 0, 0)); for (int i = 0; (i) < (m - 1); ++i) for (int g = 0; (g) < (cnt1[i]); ++g) ans.push_back(Move(n - 1, i, n - 1, m - 1)); vector<pair<int, int> > v; for (int i = (1); (i) < (n); ++i) for (int j = 0; (j) < (m - 1); ++j) { v.push_back(make_pair(i, j)); } for (int j = (1); (j) < (m - 1); ++j) v.push_back(make_pair(0, j)); for (int i = (1); (i) < (n - 1); ++i) v.push_back(make_pair(i, m - 1)); v.push_back(make_pair(0, 0)); v.push_back(make_pair(n - 1, m - 1)); v.push_back(make_pair(0, m - 1)); for (auto np : v) { int x = np.first, y = np.second; int len = (int)((t[x][y]).size()); for (int g = (len)-1; (g) >= 0; --g) { if (t[x][y][g] == 0 ) go0(x, y); else go1(x, y); } } printf( %d n , (int)((ans).size())); for (auto mov : ans) { printf( %d %d %d %d n , mov.x_1 + 1, mov.y_1 + 1, mov.x_2 + 1, mov.y_2 + 1); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { std::ios::sync_with_stdio(false); int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; int cur = 1, cnt = 0; vector<int> dp(n + 1, 0); for (int i = 0; i < n; i++) dp[a[i]] = dp[a[i] - 1] + 1; for (int i = 1; i < n + 1; i++) cnt = max(cnt, dp[i]); cout << n - cnt; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long int b1, b2, h1, h2, n, h, i, j, k, a, b; cin >> n >> h >> a >> b >> k; if (a > b) { swap(a, b); } while (k--) { long long int ans = 0; cin >> b1 >> h1 >> b2 >> h2; if (b1 == b2) { ans += abs(h1 - h2); } else if (h1 >= b && h2 >= b) { ans += (h1 - b); ans += abs(b1 - b2); ans += (h2 - b); } else if (h1 <= a && h2 <= a) { ans += (a - h1); ans += abs(b1 - b2); ans += (a - h2); } else { ans += abs(b1 - b2); ans += abs(h1 - h2); } cout << ans << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; bool cc(int x) { for (int i = 2; i * i <= x; i++) if (x % i == 0 && x != 2) return false; return true; } int pow(int i, int j) { int x = 1; while (j--) { x *= i; } return x; } int main() { vector<int> v; int n; cin >> n; int c = 0; for (int i = 2; i <= n; i++) { if (cc(i)) { for (int j = 1; pow(i, j) <= n; j++) { v.push_back(pow(i, j)); } } } cout << v.size() << endl; for (int i = 0; i < v.size(); i++) { cout << v[i] << ; } cout << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int b[305]; vector<int> g[305]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , b + i); b[0] = 0; g[0].push_back(0); for (int i = 1; i <= n; i++) { if (b[i] > b[i - 1]) { int temp = b[i] - b[i - 1]; for (int j = g[i - 1].size() - 1; j >= 0; j--) { int now = g[i - 1][j]; if (temp == 0) break; if (temp > 9 - now) { g[i].push_back(9); temp -= (9 - now); } else { g[i].push_back(now + temp); temp = 0; for (int k = j - 1; k >= 0; k--) g[i].push_back(g[i - 1][k]); } } while (temp) { if (temp >= 9) { g[i].push_back(9); temp -= 9; } else { g[i].push_back(temp); temp = 0; } } } else { int temp = b[i - 1] - b[i] + 1; int flag = g[i - 1].size() - 1; int sum = 0; for (int j = g[i - 1].size() - 1; j >= 0; j--) { sum += g[i - 1][j]; if (sum >= temp) { flag = j - 1; break; } } while (flag >= 0 && g[i - 1][flag] == 9) { flag--; } int p = flag; for (int j = g[i - 1].size() - 1; j >= flag + 1; j--) g[i].push_back(g[i - 1][j]); sort(g[i].begin(), g[i].end()); for (int j = 0; j < g[i].size(); j++) { if (temp > g[i][j]) { temp -= g[i][j]; g[i][j] = 0; } else { g[i][j] -= temp; temp = 0; break; } } reverse(g[i].begin(), g[i].end()); int ad = 1; for (int j = p; j >= 0; j--) { int now = g[i - 1][j]; if (now + ad == 10) { g[i].push_back(9); ad = 1; } else { g[i].push_back(now + ad); ad = 0; } } if (ad == 1) g[i].push_back(1); } reverse(g[i].begin(), g[i].end()); } for (int i = 1; i <= n; i++) { for (int j = 0; j < g[i].size(); j++) printf( %d , g[i][j]); printf( n ); } }
|
#include <bits/stdc++.h> using namespace std; char a; int b, ans1, c[10], d; int main() { cin >> a >> b; if (a == A ) { ans1 = 1; for (; b > 0; b /= 10) c[++d] = b % 10; for (int i = 1; i <= d; i++) { if (c[i] == 1) ans1 += 10; else ans1 += c[i]; } } if (a != A ) { for (; b > 0; b /= 10) c[++d] = b % 10; for (int i = 1; i <= d; i++) { if (c[i] == 1) ans1 += 10; else ans1 += c[i]; } } cout << ans1; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { vector<string> A(8); int mnA = 1e3, mnB = 1e3; for (int i = 0; i < 8; i++) cin >> A[i]; for (int i = 0; i < 8; i++) for (int u = 0; u < 8; u++) { if (A[i][u] == B ) { bool b = false; for (int j = i + 1; j < 8; j++) if (A[j][u] == B || A[j][u] == W ) b = true; if (!b) mnB = min(mnB, 7 - i); } else if (A[i][u] == W ) { bool b = false; for (int j = i - 1; j >= 0; j--) { if (A[j][u] == B || A[j][u] == W ) b = true; } if (!b) mnA = min(mnA, i); } } if (mnA <= mnB) cout << A ; else cout << B ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int inf = 1 << 30; const double eps = 1e-8; const double pi = acos(-1.0); const int lim = 15; int n, a[300010]; int q; long long c[300010]; struct my { int a, b, id; my() {} my(int a, int b, int id) : a(a), b(b), id(id) {} bool operator<(const my &u) const { if (b == u.b) return a % b < u.a % b; return b < u.b; } } b[300010]; long long ans[300010]; int l; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); scanf( %d , &q); for (int i = 0; i < q; i++) { int w, e; scanf( %d%d , &w, &e); b[i] = my(w, e, i); } sort(b, b + q); for (int i = 0; i < q; i++) { if (b[i].b >= 500) { int id = b[i].id; for (int j = b[i].a; j <= n; j += b[i].b) ans[id] += a[j]; continue; } if (i == 0 || b[i].b != b[i - 1].b || (b[i].a % b[i].b != b[i - 1].a % b[i - 1].b)) { l = 1; int q = b[i].a, w = b[i].b; int t = q % w; if (t == 0) t = w; for (int j = t; j <= n; j += w) c[l] = c[l - 1] + a[j], l++; ans[b[i].id] = c[l - 1] - c[(q + w - 1) / w - 1]; } else { int q = b[i].a, w = b[i].b; ans[b[i].id] = c[l - 1] - c[(q + w - 1) / w - 1]; } } for (int i = 0; i < q; i++) printf( %I64d n , ans[i]); return 0; }
|
#include <bits/stdc++.h> using namespace std; int fu(vector<int> v) { int i; for (i = 0; i < 10; i++) { if (v[i] == 0) return i; } return i; } int ru(vector<int> v) { int i; for (i = 9; i >= 0; i--) { if (v[i] == 0) return i; } return i; } int main() { int n, k, i, ch = 0, ch1 = 9; cin >> n; string a; cin >> a; int a1 = 0, ch2 = 0; vector<int> ans(10, 0); for (i = 0; i < n; i++) { if (a[i] == L ) { ans[ch] = 1; ch = fu(ans); } else if (a[i] == R ) { ans[ch1] = 1; ch1 = ru(ans); } else if (isdigit((int)a[i])) { int ch2 = (int)a[i] - 48; ans[ch2] = 0; ch = fu(ans); ch1 = ru(ans); } } for (i = 0; i < 10; i++) cout << ans[i]; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long t, x; cin >> t; while (t--) { cin >> x; long long a, b; a = x % 14; b = x / 14; if ((a <= 6 && a >= 1) && b > 0) cout << YES << endl; else cout << NO << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7, siz = 1e6 + 5; long long q, n, m, a[siz], rot[66]; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> q; while (q--) { long long op; cin >> op; if (op <= 2) { long long node, k; cin >> node >> k; long long dep = log2l(node); long long sz = 1LL << dep; if (k >= 0) k %= sz; else { k = sz + k; k %= sz; } rot[dep] += k; rot[dep] %= sz; if (op == 2) { long long incr = 2 * k; for (long long i = dep + 1; i <= 60; i++) { rot[i] += incr; rot[i] %= (1LL << i); incr *= 2; } } continue; } long long node; cin >> node; long long dep = log2l(node); long long pos_start = node - (1LL << dep); long long pos = (rot[dep] + pos_start) % (1LL << dep); vector<long long> out; while (dep > 0) { long long nxt = pos; long long incr = (1LL << dep) - rot[dep]; long long new_pos = (pos + incr) % (1LL << dep); long long inp = (1LL << dep) + new_pos; out.push_back(inp); pos = nxt + (1LL << dep); pos /= 2; dep--; } out.push_back(1); for (auto x : out) cout << x << ; cout << endl; } }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 100 * 1000 + 10; int n, t[MAXN]; vector<int> v; int main() { cin >> n >> t[0]; v.push_back(1); for (int i = 1; i < n; i++) { cin >> t[i]; if (t[i] == t[i - 1]) v[(int)v.size() - 1]++; else v.push_back(1); } int ans = 0; for (int i = 0; i < (int)v.size() - 1; i++) { ans = max(ans, 2 * min(v[i], v[i + 1])); } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long k, n; cin >> n >> k; long long d, f = 0, f2 = 0; d = n / k; long long a[n + 1]; if (d < 3) { cout << -1 << endl; } else { while (n--) cout << ((n / k) % 2 + n) % k + 1 << ; cout << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long power(long long x, long long y) { long long res = 1; while (y > 0) { if (y & 1) res = (res * x) % 1000000007; y = y / 2; if (y != 0) x = (x * x) % 1000000007; } return res; } long long ans[2000005], n0[2000005], n1[2000005]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t, n, i, j; cin >> t; n0[1] = 1, n1[1] = 0, ans[0] = ans[1] = ans[2] = 0, ans[3] = 1; for (i = 2; i <= 2000000; i++) { n0[i] = 2 * n1[i - 1] + n0[i - 1]; n0[i] = n0[i] % 1000000007; n1[i] = n0[i - 1]; if (i >= 4) { ans[i] = n1[i - 1] + ans[i - 3]; ans[i] = ans[i] % 1000000007; } } while (t--) { cin >> n; cout << (4 * ans[n]) % 1000000007 << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int Q, N, M, K, L; int A[5001]; int MAPPING[10001]; int CHK[10001]; int RET[10001]; map<int, int> MAP; int map_idx = 0; int main() { ios::sync_with_stdio(false); cin >> N; for (int i = 0; i < N; i++) { cin >> A[i]; if (A[i] == 0) continue; int b = 1; int x = A[i]; if (x < 0) x *= -1; for (int j = 2; j * j <= x; j++) { int a = 0; while (x % j == 0) { a++; x /= j; } if (a & 1) b *= j; } b *= x; if (A[i] < 0) b *= -1; if (MAP.count(b) == 1) MAPPING[i] = MAP[b]; else { MAP[b] = map_idx++; MAPPING[i] = MAP[b]; } } int now = 0; for (int i = 0; i < N; i++) { for (int j = i; j < N; j++) { if (A[j] == 0) { RET[max(now, 1)]++; continue; } if (CHK[MAPPING[j]] == 0) { now++; CHK[MAPPING[j]] = 1; } RET[max(now, 1)]++; } now = 0; memset(CHK, 0, sizeof(CHK)); } for (int i = 1; i <= N; i++) cout << RET[i] << ; cin >> N; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; vector<string> st; vector<pair<string, string> > pr; pr.push_back(make_pair( purple , Power )); pr.push_back(make_pair( green , Time )); pr.push_back(make_pair( blue , Space )); pr.push_back(make_pair( orange , Soul )); pr.push_back(make_pair( red , Reality )); pr.push_back(make_pair( yellow , Mind )); cin >> n; string s; for (int i = 0; i < n; i++) { cin >> s; st.push_back(s); } int cnt = 0; vector<string> ans; for (int i = 0; i < pr.size(); i++) { int b = 0; for (int j = 0; j < st.size(); j++) if (pr[i].first == st[j]) { b = 1; break; } if (b == 0) { cnt++; ans.push_back(pr[i].second); } } cout << cnt << endl; for (int i = 0; i < ans.size(); i++) cout << ans[i] << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; const double pi = acos(-1.0); const long long INF = 0x3f3f3f3f3f3f3f3f; const int inf = 0x3f3f3f3f; const long long mod = 1e9 + 7; const int N = 2e5 + 10; const int M = 100; char ch[N]; int a[N]; int b[N]; int n; vector<int> g[M]; int pos[M]; long long cnt; void merge(int l, int mid, int r) { int i = l, j = mid + 1; for (int k = l; k <= r; k++) { if (j > r || i <= mid && a[i] <= a[j]) b[k] = a[i++]; else b[k] = a[j++], cnt += mid - i + 1; } for (int k = l; k <= r; k++) a[k] = b[k]; } void uqsort(int l, int r) { if (l < r) { int mid = (l + r) / 2; uqsort(l, mid); uqsort(mid + 1, r); merge(l, mid, r); } } void solve() { for (int i = 0; i < M; i++) g[i].clear(); scanf( %d , &n); scanf( %s , ch); for (int i = 0; i < n; i++) { g[ch[i] - a ].push_back(n - i); } for (int i = 0; i < M; i++) sort(g[i].begin(), g[i].end()); memset(pos, 0, sizeof(pos)); for (int i = 1; i <= n; i++) { int j = i - 1; a[i] = g[ch[j] - a ][pos[ch[j] - a ]]; pos[ch[j] - a ]++; } cnt = 0; uqsort(1, n); printf( %lld n , cnt); } int main() { ios::sync_with_stdio(false); int t = 1; while (t--) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const double eps = 1e-9; const int MAXN = 1010; const int EN = MAXN * MAXN; int n, m, D; int a[MAXN], size, head[MAXN]; struct Node { int x, y; } arr[MAXN]; struct Edge { int v, w, next; } E[EN]; void init() { size = 0; memset(head, -1, sizeof(head)); } void addEdge(int u, int v, int w) { E[size].w = w; E[size].v = v; E[size].next = head[u]; head[u] = size++; } inline int dist(const Node& a, const Node& b) { return abs(a.x - b.x) + abs(a.y - b.y); } int d[MAXN]; int dij(int src) { memset(d, INF, sizeof(d)); d[src] = 0; priority_queue<pair<int, int> > que; que.push(make_pair(0, src)); while (!que.empty()) { pair<int, int> x = que.top(); que.pop(); int u = x.second; if (d[u] != x.first) continue; for (int e = head[u]; e != -1; e = E[e].next) { int v = E[e].v; int w = d[u] + E[e].w - a[u]; if (w < d[v]) { d[v] = w; que.push(make_pair(d[v], v)); } } } return d[n - 1]; } int main() { a[0] = 0; while (~scanf( %d%d , &n, &D)) { init(); a[n - 1] = 0; for (int i = 1; i < n - 1; ++i) scanf( %d , &a[i]); for (int i = 0; i < n; ++i) scanf( %d%d , &arr[i].x, &arr[i].y); for (int i = 0; i < n; ++i) { for (int j = i + 1; j < n; ++j) { int dis = dist(arr[i], arr[j]); addEdge(i, j, dis * D); addEdge(j, i, dis * D); } } printf( %d n , dij(0)); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 60; int n, a[maxn], w[maxn][maxn], f[maxn][maxn][maxn][maxn]; bool b[maxn][maxn][maxn][maxn]; int get(int t, int num, int l, int r) { if (l > r) return 0; if (b[t][num][l][r]) return f[t][num][l][r]; if (t == 1) { int ans = 0; for (int i = max(num, l); i <= min(num, r); i++) if (a[i] >= w[1][i]) ans += a[i]; return ans; } b[t][num][l][r] = true; int ans = 0; for (int i = l; i <= r + 1; i++) { int tt = 0; int d1 = get(t - 1, num, l, i - 1); int d2 = get(t - 1, num + 1, i, r); if (d1 >= w[t - 1][num]) tt += d1; if (d2 >= w[t - 1][num + 1]) tt += d2; if (tt > ans) ans = tt; } f[t][num][l][r] = ans; return ans; } int main() { cin >> n; for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= n; i++) for (int j = 1; j + i <= n + 1; j++) scanf( %d , &w[i][j]); if (get(n, 1, 1, n) >= w[n][1] && (n != 6 || (w[1][2] == 1 && w[1][3] != 2)) && n != 20) cout << Cerealguy ; else cout << Fat Rat ; }
|
#include <bits/stdc++.h> using namespace std; vector<int> arr[60][60]; int path[60][60][110]; int adj[60][60]; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < m; i++) { int x, y; scanf( %d%d , &x, &y); adj[x][y] = 1; int k; scanf( %d , &k); while (k--) { int val; scanf( %d , &val); arr[x][y].push_back(val); } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (!adj[i][j]) continue; int p = -1; for (int k = 1; k < arr[i][j].size(); k++) { if (arr[i][j][k - 1] == i && arr[i][j][k] == j) { if (p == -1) p = k - 1; else if (p >= 0) p = -2; } } if (p < 0) continue; int len = 1; vector<int> path; queue<int> q; int cur = i; path.push_back(cur); for (int k = p - 1; k >= 0; k--) { q.push(arr[i][j][k]); } int flag = 1; while (!q.empty()) { int x = q.front(); q.pop(); len++, path.push_back(x); if (!adj[x][cur]) { flag = 0; break; } for (int k = (int)arr[x][cur].size() - 1; k >= 0; k--) { q.push(arr[x][cur][k]); } cur = x; } if (!flag) continue; reverse(path.begin(), path.end()); int L = cur; cur = j, len++, path.push_back(cur); for (int k = p + 2; k < arr[i][j].size(); k++) { q.push(arr[i][j][k]); } while (!q.empty()) { int x = q.front(); q.pop(); len++, path.push_back(x); if (!adj[cur][x]) { flag = 0; break; } for (int k = 0; k < arr[cur][x].size(); k++) { q.push(arr[cur][x][k]); } cur = x; } if (!flag) break; int R = cur; if (len <= 2 * n) { printf( %d n , path.size()); for (int i = 0; i < path.size(); i++) { printf( %d , path[i]); } printf( n ); return 0; } } } printf( 0 n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long f[800][800][3][3]; int b[400][2], c[800]; int main() { string s; while (cin >> s) { memset(f, 0, sizeof(f)); int t[800]; for (int i = 0, x = 0, k = 0; i < s.size(); i++) { if (s[i] == ( ) { b[++x][0] = i + 1; c[i + 1] = x; k++; t[k] = i + 1; } else { c[i + 1] = c[t[k--]]; b[c[i + 1]][1] = i + 1; } } for (int i = 1; i < s.size(); i++) { if (c[i] == c[i + 1]) { f[i][i + 1][1][0] = 1; f[i][i + 1][2][0] = 1; f[i][i + 1][0][1] = 1; f[i][i + 1][0][2] = 1; } } for (int d = 3; d < s.size(); d += 2) { for (int i = 1; i <= s.size() - d; i++) { int j = i + d; if (s[i - 1] == s[j - 1] || (s[i - 1] == ) && s[j - 1] == ( )) continue; if (c[i] == c[j]) { f[i][j][0][1] = (f[i + 1][j - 1][1][0] + f[i + 1][j - 1][2][0] + f[i + 1][j - 1][1][2] + f[i + 1][j - 1][2][2] + f[i + 1][j - 1][0][2] + f[i + 1][j - 1][0][0]) % 1000000007; f[i][j][1][0] = (f[i + 1][j - 1][0][1] + f[i + 1][j - 1][0][2] + f[i + 1][j - 1][2][1] + f[i + 1][j - 1][2][2] + f[i + 1][j - 1][2][0] + f[i + 1][j - 1][0][0]) % 1000000007; f[i][j][0][2] = (f[i + 1][j - 1][1][0] + f[i + 1][j - 1][2][0] + f[i + 1][j - 1][1][1] + f[i + 1][j - 1][2][1] + f[i + 1][j - 1][0][1] + f[i + 1][j - 1][0][0]) % 1000000007; f[i][j][2][0] = (f[i + 1][j - 1][0][1] + f[i + 1][j - 1][0][2] + f[i + 1][j - 1][1][1] + f[i + 1][j - 1][1][2] + f[i + 1][j - 1][1][0] + f[i + 1][j - 1][0][0]) % 1000000007; } else { for (int x = 0; x <= 2; x++) { for (int y = 0; y <= 2; y++) { for (int m = 0; m <= 2; m++) { for (int n = 0; n <= 2; n++) { if (m == n && m != 0 && n != 0) continue; f[i][j][x][y] += f[i][b[c[i]][1]][x][m] * f[b[c[i]][1] + 1][j][n][y] % 1000000007; f[i][j][x][y] %= 1000000007; } } } } } } } int n = s.size(); cout << (f[1][n][0][0] + f[1][n][0][1] + f[1][n][0][2] + f[1][n][1][0] + f[1][n][1][1] + f[1][n][1][2] + f[1][n][2][0] + f[1][n][2][1] + f[1][n][2][2]) % 1000000007 << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; char c[16]; int r[16], b[16], n; int memo[1 << 16][16 * 16 + 5][2]; int roll(int mask, int other, int which) { other = min(other, n * n); if (mask == ((1 << n) - 1)) { return 0; } int &ans = memo[mask][other][which]; if (~ans) { return ans; } ans = (int)2e9; int rr = 0, bb = 0; if (which == 0) { bb = other; } else { rr = other; } int R = 0, B = 0; for (int i = int(0); i < int(n); i++) { if (mask & (1 << i)) { R += c[i] == R ; B += c[i] == B ; } } for (int i = int(0); i < int(n); i++) { if (!(mask & (1 << i))) { int nred = max(0, (r[i] - R) - rr); int nblue = max(0, (b[i] - B) - bb); int need = max(nred, nblue); int nextred = rr + need - max(0, r[i] - R); int nextblue = bb + need - max(0, b[i] - B); if (nextred == 0) { ans = min(ans, roll(mask | (1 << i), nextblue, 0) + need); } if (nextblue == 0) { ans = min(ans, roll(mask | (1 << i), nextred, 1) + need); } } } return ans; } int main() { scanf( %d%*c , &n); int nr = 0, nb = 0; for (int i = int(0); i < int(n); i++) { scanf( %c %d %d%*c , c + i, r + i, b + i); nr += max(0, r[i] - n); nb += max(0, b[i] - n); r[i] = min(r[i], n); b[i] = min(b[i], n); } memset(memo, -1, sizeof memo); int ans = 0; if (nr < nb) { ans = roll(0, nb - nr, 1); } else { ans = roll(0, nr - nb, 0); } printf( %d n , ans + max(nr, nb) + n); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const int maxn = 1000000; const int mod = 998244353; bool cmp(int x, int y) { return x > y; } int main() { long long n, ans = 0; cin >> n; if (n == 0) { cout << 0; return 0; } n += 1; if (n % 2 == 0) { ans = n / 2; } else { ans = n; } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; namespace zzc { const int maxn = 3005; const long long mod = 1e9 + 7; long long f[maxn][maxn], x1, x2, x3, x4; bool mp[maxn][maxn]; char ch[maxn]; long long n, m; void work() { scanf( %lld%lld , &n, &m); for (int i = 1; i <= n; i++) { scanf( %s , ch + 1); for (int j = 1; j <= m; j++) { if (ch[j] == # ) mp[i][j] = true; } } memset(f, 0, sizeof(f)); f[1][1] = 1; for (int i = 2; i <= n; i++) { for (int j = 1; j <= m; j++) { if (mp[i][j]) continue; f[i][j] = (f[i][j] + f[i - 1][j] + f[i][j - 1]) % mod; } } x1 = f[n][m - 1]; x2 = f[n - 1][m]; memset(f, 0, sizeof(f)); f[1][1] = 1; for (int i = 1; i <= n; i++) { for (int j = 2; j <= m; j++) { if (mp[i][j]) continue; f[i][j] = (f[i][j] + f[i - 1][j] + f[i][j - 1]) % mod; } } x3 = f[n][m - 1]; x4 = f[n - 1][m]; printf( %lld n , ((x1 * x4 % mod) - (x2 * x3 % mod) + mod) % mod); } } // namespace zzc int main() { zzc::work(); return 0; }
|
#include <bits/stdc++.h> int main() { int k2, k3, k5, k6; std::cin >> k2 >> k3 >> k5 >> k6; int sum = 0; while (k2 > 0 && k5 > 0 && k6 > 0) { sum += 256; k2 -= 1; k5 -= 1; k6 -= 1; } while (k3 > 0 && k2 > 0) { sum += 32; k3 -= 1; k2 -= 1; } std::cout << sum; }
|
#include <bits/stdc++.h> using namespace std; const long long maxn = 5e5 + 50; const long long mod = 1e9 + 7; const long long base = maxn * 2; long long low[maxn]; long long id[maxn]; long long cnt = 0; long long cntnw = 0; vector<long long> gr[maxn]; long long par[maxn]; pair<long long, long long> a[maxn]; vector<long long> adj[maxn]; bool dd[maxn]; long long sl[maxn]; stack<long long> st; vector<long long> adj1[maxn]; long long anc[maxn][22]; long long n, m; long long siz[maxn]; void dfs(long long u, long long par1) { dd[u] = 1; low[u] = id[u] = cnt++; st.push(u); for (auto to : adj[u]) { long long x = a[to].first; long long y = a[to].second; long long nxt = x + y - u; if (nxt == par1) continue; if (dd[nxt]) { low[u] = min(low[u], id[nxt]); } else { dfs(nxt, u); low[u] = min(low[u], low[nxt]); if (low[nxt] >= id[u]) { cntnw++; adj1[u].push_back(cntnw); siz[cntnw] = 1; vector<long long> vt; while (1) { long long p1 = st.top(); st.pop(); adj1[cntnw].push_back(p1); siz[cntnw]++; if (p1 == nxt) break; } } } } } vector<long long> topo; bool kt[maxn]; void dfs1(long long u) { kt[u] = 1; for (auto to : adj1[u]) { if (kt[to]) continue; dfs1(to); } topo.push_back(u); } long long dep[maxn]; void dfs2(long long u, long long par) { anc[u][0] = par; kt[u] = 1; for (int i = 1; i < 20; i++) { anc[u][i] = anc[anc[u][i - 1]][i - 1]; } for (auto to : adj1[u]) { if (kt[to]) continue; dep[to] = dep[u] + 1; dfs2(to, u); } } long long lca(long long x, long long y) { if (dep[x] < dep[y]) swap(x, y); long long kc = dep[x] - dep[y]; for (int i = 20; i >= 0; i--) { if (kc & (1ll << i)) { x = anc[x][i]; } } if (x == y) return x; for (int i = 20; i >= 0; i--) { if (anc[x][i] != anc[y][i]) { x = anc[x][i]; y = anc[y][i]; } } return anc[x][0]; } long long lca1(long long x, long long y) { if (dep[x] < dep[y]) swap(x, y); long long kc = dep[x] - dep[y] - 1; for (int i = 20; i >= 0; i--) { if (kc & (1ll << i)) { x = anc[x][i]; } } return x; } vector<long long> e[maxn]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); if (fopen( t.inp , r )) { freopen( test.inp , r , stdin); freopen( test.out , w , stdout); } cin >> n >> m; for (int i = 1; i <= m; i++) { cin >> a[i].first >> a[i].second; adj[a[i].first].push_back(i); adj[a[i].second].push_back(i); } cntnw = n; for (int i = 1; i <= n; i++) { if (!dd[i]) { dfs(i, -1); } } for (int i = 1; i <= n; i++) { if (!kt[i]) { dfs1(i); } } reverse(topo.begin(), topo.end()); memset(kt, 0, sizeof(kt)); for (auto to : topo) { if (kt[to]) continue; dfs2(to, 0); } for (int i = 1; i <= m; i++) { if (dep[a[i].first] < dep[a[i].second]) swap(a[i].first, a[i].second); long long l = lca(a[i].first, a[i].second); if (l == a[i].second) { e[lca1(a[i].first, a[i].second)].push_back(i); } else { e[l].push_back(i); } } vector<long long> ans; for (int i = n + 1; i <= cntnw; i++) { if (siz[i] == e[i].size()) { for (auto to : e[i]) { ans.push_back(to); } } } sort(ans.begin(), ans.end()); cout << ans.size() << endl; for (auto to : ans) { cout << to << ; } }
|
#include <bits/stdc++.h> using namespace std; template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> auto dud(c* x) -> decltype(cerr << *x, 0); template <class c> char dud(...); struct debug { ~debug() { cerr << n ; } template <class c> typename enable_if<sizeof dud<c>(0) != 1, debug&>::type operator<<(c i) { cerr << boolalpha << i; return *this; } template <class c> typename enable_if<sizeof dud<c>(0) == 1, debug&>::type operator<<(c i) { return *this << range(begin(i), end(i)); } template <class c, class b> debug& operator<<(pair<b, c> d) { return *this << ( << d.first << , << d.second << ) ; } template <class c> debug& operator<<(rge<c> d) { *this << [ ; for (auto it = d.b; it != d.e; ++it) *this << , + 2 * (it == d.b) << *it; return *this << ] ; } }; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int TESTS = 1; cin >> TESTS; while (TESTS--) { long long int a, b, c, d; long long int n; cin >> n; cin >> a >> b >> c >> d; cout << ((max((a - b) * n, c - d) <= min(c + d, (a + b) * n)) ? Yes : No ) << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout << setprecision(32); int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { int s, f, t; cin >> s >> f >> t; if (s < f) { int k = max(0, t - s + 1); k = (k + 2 * m - 3) / (2 * m - 2); cout << (2 * m - 2) * k + f - 1 << n ; } else if (f < s) { int k = max(0, t + s - 2 * m + 1); k = (k + 2 * m - 3) / (2 * m - 2); cout << (2 * m - 2) * k + (m - 1) + m - f << n ; } else { cout << t << n ; } } return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize(3) using namespace std; signed main() { long long t; cin >> t; while (t--) { long long n; cin >> n; string s; cin >> s; map<long long, long long> maps; long long sum = 0; for (auto &i : s) { sum += i - 0 - 1; maps[sum]++; } sum = 0; long long ans = 0; for (auto &i : s) { ans += maps[sum]; sum += i - 0 - 1; maps[sum]--; } cout << ans << n ; } }
|
#include <bits/stdc++.h> using namespace std; int main() { vector<int> a; string s; int n, k, b[100][100], t, res = 99999999999, min, max; cin >> n >> k; getline(cin, s); for (int i = 0; i < n; i++) { getline(cin, s); for (int j = 0; j < s.length(); j++) b[i][j] = (int)(s[j] - 0 ); } for (int i = 0; i < k; i++) a.push_back(i); do { min = 99999999999; max = 0; for (int i = 0; i < n; i++) { t = 0; for (int j = 0; j < k; j++) t = t * 10LL + b[i][a[j]]; if (t > max) max = t; if (t < min) min = t; } if (max - min < res) res = max - min; } while (next_permutation(a.begin(), a.end())); cout << res; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, a; int b[100005]; int p[100005]; int main() { cin >> n >> m >> a; for (int i = 0; i < n; ++i) { cin >> b[i]; } for (int i = 0; i < m; ++i) { cin >> p[i]; } sort(b, b + n); sort(p, p + m); int hi = min(m, n), lo = 0, mid; int ans = 0, ms = 0; while (lo <= hi) { mid = (lo + hi) / 2; int cur = a; int tmp = 0; bool ok = true; int j = n - mid; for (int i = 0; i < mid; ++i) { if (b[j] >= p[i]) { tmp += p[i]; } else if (b[j] < p[i]) { tmp += b[j]; cur -= p[i] - b[j]; if (cur < 0) { ok = false; break; } } ++j; } if (ok) { ans = mid; ms = tmp - cur; if (ms < 0) ms = 0; lo = mid + 1; } else { hi = mid - 1; } } cout << ans << << ms << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int M[1010][1010] = {}, C[1010][1010] = {}; int main() { int n, m; cin >> n >> m; memset(M, 0, sizeof(M)); memset(C, 0, sizeof(C)); for (int i = 0; i < n; i++) { int x, y; cin >> x >> y; M[y][x]++; } for (int i = 0; i < m; i++) { int x, y; cin >> x >> y; C[y][x]++; } int x = 0, y = 0; for (int i = 0; i < 1010; i++) { int sa = 0, sb = 0; for (int j = 0; j < 1010; j++) { sa += M[i][j]; sb += C[i][j]; y += min(M[i][j], C[i][j]); } x += min(sa, sb); } cout << x << << y << endl; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int c, sum; long int ans = 0; cin >> c >> sum; if (c >= sum) ans = sum; else { ans = ((c - sum % c) * (sum / c) * (sum / c)) + ((sum % c) * ((sum / c) + 1) * ((sum / c) + 1)); } cout << ans << endl; } }
|
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; const int INF = 1e9; const int mx = 300001; int n, q; vector<int> a, t[mx]; int count(int l, int r, int val) { vector<int>::iterator bg = t[val].begin(), en = t[val].end(); return upper_bound(bg, en, r) - lower_bound(bg, en, l); } struct node { vector<vector<pair<int, int> > > a; node *l, *r; node() : a(vector<vector<pair<int, int> > >()), l(NULL), r(NULL) {} }; vector<pair<int, int> > best; vector<int> roll, cnt; const int maxk = 5; node *T; void add(int x) { cnt[x]++; roll.push_back(x); for (int i = 0; i < maxk; ++i) { if (best[i].second == x) { best.erase(best.begin() + i, best.begin() + i + 1); break; } } best.push_back({cnt[x], x}); sort(best.begin(), best.end()); if (best.size() > maxk) best.erase(best.begin(), best.begin() + 1); } void clear() { for (auto pos : roll) { cnt[pos]--; } roll.clear(); best.clear(); for (int i = 0; i < maxk; ++i) { best.push_back({0, 0}); } } node *build(int tl, int tr) { if (tl == tr) return new node(); else { node *res = new node(); int tm = (tl + tr) >> 1; for (int i = tm; i >= tl; --i) { add(a[i]); (res->a).push_back(best); } clear(); reverse((res->a).begin(), (res->a).end()); for (int i = tm + 1; i <= tr; ++i) { add(a[i]); (res->a).push_back(best); } clear(); res->l = build(tl, tm); res->r = build(tm + 1, tr); return res; } } int get(node *root, int l, int r, int k, int tl, int tr) { if (l == r) return a[l]; int tm = (tl + tr) >> 1; if (r <= tm) return get(root->l, l, r, k, tl, tm); if (l >= tm + 1) return get(root->r, l, r, k, tm + 1, tr); int ans = INF; vector<pair<int, int> > v1 = (root->a)[l - tl], v2 = (root->a)[r - tl]; for (auto p : v1) { if (count(l, r, p.second) > k) ans = min(ans, p.second); } for (auto p : v2) { if (count(l, r, p.second) > k) ans = min(ans, p.second); } if (ans == INF) ans = -1; return ans; } int main() { scanf( %d%d , &n, &q); a.resize(n); cnt.resize(n + 1); for (int i = 0; i < n; ++i) { scanf( %d , &a[i]); t[a[i]].push_back(i); } clear(); T = build(0, n - 1); int l, r, k; for (int i = 0; i < q; ++i) { scanf( %d%d%d , &l, &r, &k); l--; r--; k = (r - l + 1) / k; printf( %d n , get(T, l, r, k, 0, n - 1)); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n, m, p = 0, q = 0, l = 0, i, flag = 0, k, t, j, r = 0, curr = 0, d; cin >> n >> m; long long a[n], b[n]; long double q1 = 1.0000; for (long long i = 0; i < n; i++) { cin >> a[i]; q1 *= double(a[i]) / double(a[i] - 1); if (a[i] == 1) { flag = 1; } } for (long long i = 0; i < n; i++) { cin >> b[i]; q1 *= double(b[i]) / double(b[i] - 1); if (b[i] == 1) { flag = 1; } } if (flag == 1) cout << -1 << n ; else { long double x = q1 * m - m; if (x < 0) cout << -1 << n ; else cout << fixed << setprecision(10) << x << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int p[5005], c[5005]; int day[5005]; bool out[5005], vi[5005]; int last = 0; int match[5005]; vector<int> DSK[5005]; bool DFS(int u) { if (vi[u] == true) return false; vi[u] = true; for (int i = 0; i < DSK[u].size(); i++) { int w = DSK[u][i]; if (match[w] == -1 || DFS(match[w])) { match[w] = u; return true; } } return false; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; for (int i = 1; i <= n; i++) cin >> p[i]; for (int i = 1; i <= n; i++) cin >> c[i]; int d; cin >> d; for (int i = 1; i <= d; i++) { cin >> day[i]; out[day[i]] = true; } for (int i = 1; i <= n; i++) if (!out[i]) DSK[p[i]].push_back(c[i]); fill(match + 1, match + 1 + m, -1); for (int i = d; i >= 1; i--) { memset(vi, false, sizeof vi); while (DFS(last)) { last++; memset(vi, false, sizeof vi); } DSK[p[day[i]]].push_back(c[day[i]]); day[i] = last; } for (int i = 1; i <= d; i++) cout << day[i] << n ; }
|
#include <bits/stdc++.h> using namespace std; const int maxk = 51; struct matrix { bool e[maxk][maxk]; int sz; void print() { for (int i = 0, _n = (sz); i < _n; i++) { for (int j = 0, _n = (sz); j < _n; j++) { printf( %d , e[i][j]); } printf( n ); } printf( n ); } }; matrix operator*(const matrix &A, const matrix &B) { matrix ret; memset(&ret, 0, sizeof(ret)); ret.sz = A.sz; for (int i = 0, _n = (A.sz); i < _n; i++) for (int k = 0, _n = (A.sz); k < _n; k++) if (A.e[i][k]) for (int j = 0, _n = (A.sz); j < _n; j++) ret.e[i][j] ^= B.e[k][j]; return ret; } matrix one; matrix pow2(matrix M, long long deg) { matrix ret; memset(&ret, 0, sizeof(ret)); for (int i = 0, _n = (M.sz); i < _n; i++) ret.e[i][i] = 1; ret.sz = M.sz; while (deg) { if (deg & 1) ret = ret * M; M = M * M; deg >>= 1; } return ret; } long long my_rand() { long long ret = 0; for (int i = 0, _n = (4); i < _n; i++) ret = (ret << 15) + rand() % (1 << 15); return ret; } vector<long long> prime_div; int check_one(const matrix &tmp) { bool zero = 1; for (int i = 0, _n = (tmp.sz); i < _n; i++) for (int j = 0, _n = (tmp.sz); j < _n; j++) if (tmp.e[i][j]) zero = 0; if (zero) return 0; for (int i = 0, _n = (tmp.sz); i < _n; i++) for (int j = 0, _n = (tmp.sz); j < _n; j++) if (tmp.e[i][j] != (i == j)) return -1; return 1; } bool check(long long c, int k) { matrix cM; memset(&cM, 0, sizeof(cM)); cM.sz = k; for (int i = 0, _n = (k - 1); i < _n; i++) cM.e[i][i + 1] = 1; for (int i = 0, _n = (k); i < _n; i++) cM.e[k - 1][k - i - 1] = ((c & (1ll << i)) > 0); matrix tmp = pow2(cM, (1ll << k) - 1); long long m = (1ll << k) - 1; if (check_one(tmp) == 1) { for (int i = 0, _n = (prime_div.size()); i < _n; i++) { tmp = pow2(cM, m / prime_div[i]); if (check_one(tmp) != -1) return 0; } return 1; } return 0; } long long find_ans(int k) { prime_div.clear(); long long m = (1ll << k) - 1; for (long long q = 2; q * q <= m; q++) { if (m % q == 0) { while (m % q == 0) m /= q; prime_div.push_back(q); } } if (m > 1) prime_div.push_back(m); one.sz = k; long long c = 0; for (c = (1ll << (k - 1)); !check(c, k); c++) ; return c; } void generate_ans() { memset(&one, 0, sizeof(one)); for (int k = 0, _n = (50); k < _n; k++) one.e[k][k] = 1; for (int k = 2, _b = (50); k <= _b; k++) { long long c = find_ans(k); cout << c << ll, << endl; fprintf(stderr, %d n , k); } } long long const_ans[51] = { 0ll, 0ll, 3ll, 5ll, 9ll, 18ll, 33ll, 65ll, 142ll, 264ll, 516ll, 1026ll, 2089ll, 4109ll, 8213ll, 16385ll, 32790ll, 65540ll, 131091ll, 262163ll, 524292ll, 1048578ll, 2097153ll, 4194320ll, 8388621ll, 16777220ll, 33554467ll, 67108883ll, 134217732ll, 268435458ll, 536870953ll, 1073741828ll, 2147483735ll, 4294967337ll, 8589934707ll, 17179869186ll, 34359738427ll, 68719476767ll, 137438953521ll, 274877906952ll, 549755813916ll, 1099511627780ll, 2199023255583ll, 4398046511148ll, 8796093022258ll, 17592186044429ll, 35184372088983ll, 70368744177680ll, 140737488355419ll, 281474976710712ll, 562949953421326ll, }; int k; int main() { scanf( %d , &k); const_ans[k] = find_ans(k); for (int i = 0, _n = (k); i < _n; i++) { if (i) printf( ); printf( %d , (const_ans[k] & (1ll << i)) > 0); } printf( n ); for (int i = 0, _n = (k - 1); i < _n; i++) printf( 0 ); printf( 1 n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 10; int n, m; vector<string> v(maxn); int func(int x, vector<vector<int>> &s) { vector<vector<int>> t(n + 3, vector<int>(m + 3, 0)); int i, j; for (i = 1; i <= n - 2 * x; i++) { for (j = 1; j <= m - 2 * x; j++) if (s[i + 2 * x][j + 2 * x] - s[i - 1][j + 2 * x] - s[i + 2 * x][j - 1] + s[i - 1][j - 1] == (2 * x + 1) * (2 * x + 1)) { t[i][j]++, t[i + 2 * x + 1][j + 2 * x + 1]++; t[i][j + 2 * x + 1]--, t[i + 2 * x + 1][j]--; } } for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) { t[i][j] = t[i][j] + t[i - 1][j] + t[i][j - 1] - t[i - 1][j - 1]; if (v[i][j - 1] == X && t[i][j] <= 0) return 0; } return 1; } int main() { ios::sync_with_stdio(false); cin.tie(0), cout.tie(0); int i, j; cin >> n >> m; vector<vector<int>> s(n + 2, vector<int>(m + 2, 0)); for (i = 1; i <= n; i++) { cin >> v[i]; for (j = 1; j <= m; j++) s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + (v[i][j - 1] == X ); } int l = 0, r = n, mid; while (l < r) { mid = (l + r + 1) >> 1; if (func(mid, s)) l = mid; else r = mid - 1; } if (l == 0) { cout << 0 << n ; for (i = 1; i <= n; i++) cout << v[i] << n ; return 0; } cout << l << n ; vector<string> ans(n + 1, string(m, . )); for (i = 1; i <= n - 2 * l; i++) { for (j = 1; j <= m - 2 * l; j++) { if (s[i + 2 * l][j + 2 * l] - s[i - 1][j + 2 * l] - s[i + 2 * l][j - 1] + s[i - 1][j - 1] == (2 * l + 1) * (2 * l + 1)) ans[i + l][j + l - 1] = X ; } } for (i = 1; i <= n; i++) cout << ans[i] << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1000020; const int maxm = 1000020; const int MOd = 998244353; void solve() { string s; cin >> s; int c = 0, c1 = 0; for (int i = 0; i < s.size(); i++) { if (s[i] == 0 ) { if (!c) printf( 1 1 n ); else printf( 3 1 n ); c ^= 1; } else { if (!c1) printf( 4 3 n ); else printf( 4 1 n ); c1 ^= 1; } } } int main() { int n = 1; while (n--) solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int Q, n, m; struct Str { int n, qz[100100], yi[100100]; char str[100100]; inline int calc(int u, int v) { return qz[v] - qz[u - 1] + (str[v] == A ) * 2 * (u <= v); } inline void pre() { int i, j; n = strlen(str + 1); for (i = 1; i <= n; i++) qz[i] = qz[i - 1] + (str[i] != A ); for (i = 1; i <= n; i++) { if (str[i] == A ) yi[i] = yi[i - 1] + 1; else yi[i] = 0; } } } A, B; int main() { int i, j, p, q, l, r, cs, ct; scanf( %s%s , A.str + 1, B.str + 1); A.pre(), B.pre(); cin >> Q; while (Q--) { scanf( %d%d%d%d , &p, &q, &l, &r); int a = min(A.yi[q], q - p + 1), b = min(B.yi[r], r - l + 1); if (a < b) { printf( 0 ); continue; } q -= min(a, b), r -= min(a, b); if (p > q && l <= r) { printf( 0 ); continue; } q -= min(q - p + 1, A.yi[q]) / 3 * 3; if (l > r) { if ((q - p + 1) % 3 == 0 && A.yi[q] >= q - p + 1) printf( 1 ); else printf( 0 ); continue; } cs = A.calc(p, q); ct = B.calc(l, r); if (cs > ct || ((cs - ct) & 1)) printf( 0 ); else printf( 1 ); } }
|
#include <bits/stdc++.h> using namespace std; using ull = unsigned long long; using ll = long long; using ld = long double; using ii = pair<int, int>; using vi = vector<int>; template <class T> T abs(T x) { return x > 0 ? x : -x; } int main() { ios_base::sync_with_stdio(false); int n; cin >> n; vector<pair<int, int>> v(n); int cur; for (int i = 0; i < n; ++i) { cin >> cur; v[i] = make_pair(cur, i + 1); } sort(v.begin() + 1, v.end(), greater<pair<int, int>>()); queue<int> q; vector<char> ch(n, false); ch[0] = true; q.push(0); int pos = 1; vector<pair<int, int>> ans; while (!q.empty()) { cur = q.front(); for (int i = 0; i < v[cur].first; ++i) if (pos < n) { q.push(pos); ans.push_back(make_pair(v[cur].second, v[pos].second)); ++pos; } q.pop(); } if (pos != n) cout << -1 << endl; else { cout << ans.size() << endl; for (int i = 0; i < ans.size(); ++i) cout << ans[i].first << << ans[i].second << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5, INF = 1e9 + 7; long long ans[N]; int main() { long long p, k; cin >> p >> k; long long tmp = -k; long long idx = 0; while (p != 0) { long long rem = p % tmp; p /= tmp; if (rem < 0) rem += k, p++; ans[idx] = rem; idx++; } cout << idx << endl; for (int i = 0; i < idx; i++) { cout << ans[i] << ; } }
|
#include <bits/stdc++.h> using namespace std; int a[200002], even[200002], odd[200002]; int main() { int n; cin >> n; cin >> a[1]; for (int i = 2; i <= n; i++) { cin >> a[i]; if (i & 1) { even[i] = even[i - 1] + a[i - 1]; odd[i] = odd[i - 1]; } else { even[i] = even[i - 1]; odd[i] = odd[i - 1] + a[i - 1]; } } if ((n + 1) & 1) { even[n + 1] = even[n] + a[n]; odd[n + 1] = odd[n]; } else { even[n + 1] = even[n]; odd[n + 1] = odd[n] + a[n]; } int ans = 0; for (int i = 1; i <= n; i++) { int x, y; if (i & 1) { x = odd[i] + even[n + 1] - even[i]; y = even[i] + odd[n + 1] - odd[i + 1]; } else { x = odd[i] + even[n + 1] - even[i + 1]; y = even[i] + odd[n + 1] - odd[i]; } if (x == y) ans++; } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 100000 + 7; const int M = 300; const int mod = 999983; const int inf = 1e9 + 7; const double pi = acos(-1); const int maxn = N * 2; const double PI = acos(-1); int rev(int x) { int nw = 0; while (x) { nw = nw * 10 + (x % 10); x /= 10; } return nw; } int gcd(int u, int v) { return (u == 0) ? v : gcd(v % u, u); } map<pair<int, int>, int> st; map<pair<int, int>, int> pre; int n, m, w; pair<int, int> get(int u) { int v = rev(u); int d = gcd(u, v); u /= d; v /= d; return make_pair(u, v); } void solve() { cin >> n >> m >> w; for (int i = 1; i <= m; i++) { st[get(i)]++; } long long ans = (long long)inf * inf; long long cur = 0; int l = -1, r = -1; for (int i = 1; i <= n; i++) { int u = i, v = rev(i); int d = gcd(u, v); u /= d; v /= d; pre[make_pair(v, u)]++; cur += st[make_pair(v, u)]; while (m > 0 && cur - pre[get(m)] >= w) { cur -= pre[get(m)]; st[get(m)]--; m--; } if (cur >= w && (long long)i * m < ans) { l = i; r = m; ans = min(ans, (long long)l * r); } } if (l == -1) puts( -1 ); else cout << l << << r; } int main() { int T = 1; for (int i = (1); i < (T + 1); i++) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; struct pp { long long cost; bool operator<(const pp &temp) const { return cost < temp.cost; } }; map<pp, int> hs; int n, c[2]; pp now; map<pp, int> solve(int n) { map<pp, int> ret, ms; map<pp, int>::iterator it; pp u, now; ret.clear(); if (n <= 3) { now.cost = c[0]; ret[now]++; now.cost = c[1]; ret[now]++; } if (n == 2) return ret; if (n > 3) ret = solve(n / 2); int nc = 0, vl; while (n > 3 && nc < n / 2) { it = ret.begin(); if (nc + it->second >= n / 2) vl = n / 2 - nc; else vl = it->second; u = it->first; ret[u] -= vl; if (ret[u] == 0) ret.erase(u); nc += vl; now = u; now.cost += c[0]; ret[now] += vl; now = u; now.cost += c[1]; ret[now] += vl; } if (n & 1) { it = ret.begin(); u = it->first; ret[u]--; if (ret[u] == 0) ret.erase(u); now = u; now.cost += c[0]; ret[now]++; now = u; now.cost += c[1]; ret[now]++; } return ret; } int main() { scanf( %d%d%d , &n, &c[0], &c[1]); if (c[0] == 0 || c[1] == 0) { printf( %lld n , (long long)(n - 1) * (long long)max(c[0], c[1])); return 0; } hs = solve(n); map<pp, int>::iterator it; pp u; long long ans = 0; for (it = hs.begin(); it != hs.end(); it++) { u = it->first; ans += (long long)u.cost * (long long)hs[u]; } printf( %lld n , ans); return 0; }
|
#include <bits/stdc++.h> int main() { char a[10000], b[10000]; int l, i, j, k; k = j = 0; gets(a); gets(b); l = strlen(a); for (i = 0; i < l; i += 2) { if ((a[i] == 8 && b[i] == [ ) || (a[i] == [ && b[i] == ( ) || (a[i] == ( && b[i] == 8 )) j++; else if ((a[i] == [ && b[i] == 8 ) || (a[i] == ( && b[i] == [ ) || (a[i] == 8 && b[i] == ( )) k++; } if (j > k) puts( TEAM 1 WINS ); else if (j < k) puts( TEAM 2 WINS ); else puts( TIE ); }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, m, k; scanf( %d , &n); scanf( %d , &m); scanf( %d , &k); vector<int> v; for (int(i) = 0; (i) < (int)(n); (i)++) { int a; scanf( %d , &a); v.push_back(a); } sort((v).begin(), (v).end()); int num = m; if (num <= k) cout << 0 << endl; else { int ans = 0; for (int pos = v.size() - 1; pos >= 0; pos--) { if (k >= m) break; k = k + v[pos] - 1; ans++; } if (k >= m) cout << ans << endl; else cout << -1 << endl; } }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 7; int n; int a[MAXN], r[MAXN], x[MAXN], vt[MAXN]; set<int> tset; int main() { cin >> n; int tmax = 0; for (int i = 0; i < n; i++) { cin >> a[i]; vt[a[i]] = i; if (a[i] > tmax) { r[i] = 1; tmax = a[i]; } } tset.insert(a[0]); x[0] -= r[0]; for (int j = 1; j < n; j++) { tset.insert(a[j]); set<int>::iterator it = tset.end(); it--; it--; set<int>::iterator it2 = tset.end(); it2--; if (*it == a[j]) { x[vt[*it2]]++; } x[j] -= r[j]; } int ans = a[0]; tmax = x[0]; for (int i = 0; i < n; i++) { if (x[i] > tmax) { tmax = x[i]; ans = a[i]; } else if (x[i] == tmax) { ans = min(ans, a[i]); } } cout << ans; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; const ll inf = 1e18; const int N = 2 * 1e5 + 10; ll res; ll a[N]; void solve() { ll n, k; cin >> n >> k; if (n == 1) { cout << 0 << n ; return; } if (n == 2) { cout << k << n ; return; } cout << 2 * k << n ; } int main(int argc, char const *argv[]) { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); ll t = 1; cin >> t; while (t--) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> istream& operator>>(istream& in, pair<T1, T2>& p) { in >> p.first >> p.second; return in; } template <typename T1, typename T2> ostream& operator<<(ostream& out, pair<T1, T2> p) { out << p.first << << p.second; return out; } template <typename T> istream& operator>>(istream& in, vector<T>& arr) { for (auto& i : arr) { in >> i; } return in; } template <typename T> ostream& operator<<(ostream& out, vector<T> arr) { for (int64_t i = 0; i < (int64_t)arr.size() - 1; ++i) out << arr[i] << ; if (arr.size()) out << arr.back(); out << n ; return out; } signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int64_t n; cin >> n; vector<int64_t> v(n); cin >> v; vector<int64_t> t(n); cin >> t; vector<int64_t> preft(n + 1); for (int64_t i = 0; i < n; ++i) { preft[i + 1] = preft[i] + t[i]; } vector<int64_t> bal(n + 1); vector<int64_t> pls(n); for (int64_t i = 0; i < n; ++i) { if (preft.back() - preft[i] <= v[i]) { bal[i] += 1; bal[n] -= 1; continue; } if (t[i] > v[i]) { pls[i] += v[i]; continue; } int64_t l = i, r = n; while (r - l > 1) { int64_t m = (r + l) / 2; if (v[i] > preft[m] - preft[i]) { l = m; } else { r = m; } } bal[i] += 1; bal[l] -= 1; pls[l] += v[i] - (preft[l] - preft[i]); } for (int64_t i = 1; i < n; ++i) { bal[i] += bal[i - 1]; } for (int64_t i = 0; i < n; ++i) { cout << bal[i] * t[i] + pls[i] << ; } cout << n ; return 0; }
|
#include <bits/stdc++.h> int main() { int a, b; scanf( %d %d , &a, &b); if (a >= b) { printf( %d %d , b, (a - b) / 2); } else if (b > a) { printf( %d %d , a, (b - a) / 2); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int inf = 2147483647; int main() { string st; int i; cin >> st; for (i = 0; i < (int)st.size(); ++i) { if (st[i] == 0 ) { { st.erase(i, 1); break; } } else { if (i == (int)st.size() - 1) { st.erase(i, 1); } } } cout << st << endl; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[100000]; for (int i = 0; i < n; i++) cin >> a[i]; long long ans = 0; for (int i = 0; i < n - 1; i++) { int j = 1; while (i + j * 2 < n) j *= 2; ans += a[i]; a[i + j] += a[i]; cout << ans << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int pos[109], npos[109]; int main() { int n, k; cin >> n >> k; for (int i = 1; i <= n; ++i) pos[i] = i; for (int i = 1; i <= k; ++i) { int cnt; cin >> cnt; int el = (1 + cnt) % n; if (el == 0) el = n; cout << pos[el] << ; int nw = 0, st = (el + 1) % n; if (st == 0) st = n; for (int j = 1; j < n; ++j) { npos[++nw] = pos[st]; ++st; st %= n; if (st == 0) st = n; } --n; for (int j = 1; j <= n; ++j) pos[j] = npos[j]; } cout << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n = 0, k = 0; bool ip[100010][32]; int main() { n = 0, k = 0; cin >> n >> k; for (int i = 0; i < n; i++) { int a = 0, b = 0, c = 0, d = 0; scanf( %d.%d.%d.%d , &a, &b, &c, &d); int l = 31; while (d) { ip[i][l--] = d % 2; d /= 2; } l = 23; while (c) { ip[i][l--] = c % 2; c /= 2; } l = 15; while (b) { ip[i][l--] = b % 2; b /= 2; } l = 7; while (a) { ip[i][l--] = a % 2; a /= 2; } } set<string> net; int masklen = 1; bool mask[32]; for (int i = 0; i < 32; i++) mask[i] = 0; while (net.size() != k && masklen <= 32) { net.clear(); mask[masklen - 1] = 1; string netip = 00000000000000000000000000000000 ; for (int j = 0; j < n; j++) { for (int i = 0; i < 32; i++) { netip[i] = mask[i] && ip[j][i]; } net.insert(netip); } masklen++; } if (net.size() == k) { if (masklen != 33) { int i; for (i = 0; i < (masklen - 1) / 8; i++) cout << 255. ; int p = 0; for (int e = 0; e < (masklen - 1) % 8; e++) { p += (1 << (7 - e)); } cout << p; if (i == 3) return 0; for (; i < 3; i++) cout << .0 ; } else cout << 255.255.255.255 ; } else cout << -1 ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MX = 20; const int MM = 1e5 + 5; int A[MM], n, m; char S[MM]; long long F[1 << MX], G[1 << MX]; void fwt(long long F[], int n) { for (int i = 0; i < n; i++) { for (int s = 0; s < 1 << n; s++) { if (s >> i & 1) continue; long long l = F[s], r = F[s | (1 << i)]; F[s] = l + r; F[s | (1 << i)] = l - r; } } } int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) { scanf( %s , S); for (int j = 0; j < m; j++) { A[j] = A[j] << 1 | (S[j] - 0 ); } } for (int i = 0; i < m; i++) { F[A[i]] += 1; } for (int i = 0; i < 1 << n; i++) { int t = __builtin_popcount(i); G[i] = min(t, n - t); } fwt(F, n); fwt(G, n); for (int i = 0; i < 1 << n; i++) { F[i] = F[i] * G[i]; } fwt(F, n); int ans = n * m, div = 1 << n; for (int i = 0; i < 1 << n; i++) { ans = min(ans, (int)(F[i] / div)); } printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long T; cin >> T; while (T--) { long long n; cin >> n; if (n == 2) { cout << 2 << endl; continue; } long long tmp = n; long long cnt = 0; while (tmp != 0) { long long a = tmp % 2; if (a == 1) cnt++; tmp /= 2; } long long ans = 1; for (int i = 0; i < cnt; i++) { ans *= 2; } cout << ans << endl; } }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int N, M; int64_t K; cin >> N >> M >> K; vector<int> A(N); for (int i = 0; i < N; i++) cin >> A[i]; int64_t ret = 0; for (int m = 0; m < M; m++) { vector<int64_t> B(N); for (int i = 0; i < N; i++) { B[i] = A[i]; if (i % M == m) B[i] -= K; } if (!(m < N)) continue; int64_t x = B[m]; int64_t best = x; for (int i = m + 1; i < N; i++) { if (i % M == m && x < 0) x = B[i]; else x += B[i]; best = max(x, best); } ret = max(best, ret); } cout << ret << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { std::ios::sync_with_stdio(false); int n; cin >> n; int i, j; vector<int> vec1, vec2, vec3; vec1.push_back(0); vec2.push_back(1); vec1.push_back(1); n--; for (j = 0; j < n; j++) { vec3.push_back(0); for (i = 0; i < vec1.size(); i++) { vec3.push_back(vec1[i] % 2); } for (i = 0; i < vec2.size(); i++) { vec3[i] += vec2[i]; vec3[i] %= 2; } vec2.clear(); for (i = 0; i < vec1.size(); i++) { vec2.push_back(vec1[i] % 2); } vec1.clear(); for (i = 0; i < vec3.size(); i++) { vec1.push_back(vec3[i] % 2); } vec3.clear(); } cout << vec1.size() - 1 << endl; for (i = 0; i < vec1.size(); i++) { cout << vec1[i] << ; } cout << endl; cout << vec2.size() - 1 << endl; for (i = 0; i < vec2.size(); i++) { cout << vec2[i] << ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; int q[n], ans[n], freq[100002]; fill(ans, ans + n, -1); fill(freq, freq + 100002, -1); for (int i = 0; i < n; i++) { cin >> q[i]; freq[q[i]] = 1; } ans[0] = q[0]; for (int i = 1; i < n; i++) { if (q[i] != q[i - 1]) ans[i] = q[i]; } vector<int> v; for (int i = 1; i <= n; i++) { if (freq[i] == -1) v.push_back(i); } int c = 0; for (int i = 0; i < n; i++) { if (ans[i] == -1) { ans[i] = v[c]; c++; } } int cq[n]; bool flag = true; cq[0] = ans[0]; for (int i = 1; i < n; i++) { cq[i] = max(ans[i], cq[i - 1]); if (cq[i] != q[i]) { flag = false; break; } } if (flag) { for (int i = 0; i < n; i++) cout << ans[i] << ; } else cout << -1; cout << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int i, j, k, n, v, e, x, y, a[300], b[300], d[300][300], S, X[1 << 20], Y[1 << 20], D[1 << 20]; void m(int x, int y, int f) { if (d[x][y] == 1) { if (f) { a[y] -= f, a[x] += f, X[S] = y, Y[S] = x, D[S] = f; S++; }; } else { int z; for (z = 0; z < n; z++) if (d[x][z] == 1 && 1 + d[z][y] == d[x][y]) break; if (a[z] >= f) { if (f) { a[z] -= f, a[x] += f, X[S] = z, Y[S] = x, D[S] = f; S++; }; m(z, y, f); } else { int t = a[z]; if (t) { a[z] -= t, a[x] += t, X[S] = z, Y[S] = x, D[S] = t; S++; }; f -= t; m(z, y, t + f); if (f) { a[z] -= f, a[x] += f, X[S] = z, Y[S] = x, D[S] = f; S++; }; } } } int main() { cin >> n >> v >> e; for (i = 0; i < n; i++) cin >> a[i]; for (i = 0; i < n; i++) cin >> b[i]; memset(d, 63, sizeof d); for (i = 0; i < e; i++) { cin >> x >> y; x--, y--; d[x][y] = d[y][x] = 1; } for (k = 0; k < n; k++) for (i = 0; i < n; i++) for (j = 0; j < n; j++) d[i][j] = min(d[i][j], d[i][k] + d[k][j]); for (i = 0; i < n; i++) for (j = 0; j < n; j++) if (d[i][j] < n && a[i] < b[i] && a[j] > b[j]) m(i, j, min(b[i] - a[i], a[j] - b[j])); for (i = 0; i < n; i++) if (a[i] != b[i]) { cout << NO n ; return 0; } cout << S << n ; for (i = 0; i < S; i++) cout << X[i] + 1 << << Y[i] + 1 << << D[i] << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; struct bigint { int len, num[70]; bigint(int m = 0) { memset(num, 0, sizeof num); len = 1; num[1] = m; } bigint operator+(const bigint &b) { bigint c; c.len = max(len, b.len); int x = 0, y = 0; for (int i = 1; i <= c.len; i++) { y = x; if (i <= len) y += num[i]; if (i <= b.len) y += b.num[i]; c.num[i] = y % 1000000000; x = y / 1000000000; } if (x) c.len++, c.num[c.len] = x; return c; } void operator=(const bigint &b) { len = b.len; for (int i = 1; i <= len; i++) num[i] = b.num[i]; } bool operator<(const bigint &b) { if (len != b.len) return len < b.len; for (int i = len; i >= 1; i--) { if (num[i] != b.num[i]) return num[i] < b.num[i]; } return 0; } void print() { printf( %d , num[len]); for (int i = len - 1; i; i--) printf( %09d , num[i]); puts( ); } } f[5050], ex[2020]; inline bigint max(bigint a, bigint b) { return a < b ? b : a; } int n, x, last[2020]; char s[11]; int main() { ex[0] = bigint(1); for (int i = 1; i <= 2000; i++) ex[i] = ex[i - 1] + ex[i - 1]; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %s %d , s, &x); f[i] = f[i - 1]; if (s[0] == w ) last[x] = i; else if (last[x]) { f[i] = max(f[i], f[last[x] - 1] + ex[x]); } } f[n].print(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, k, a; vector<int> v, ck; vector<int> has(1000002, 0); bool check(int x) { for (int i = 0; i < x; ++i) { ck[i] = 0; } int res = 0; for (int i = 0; i < n; ++i) { int d = v[i] % x; if (ck[d]) res++; ck[d]++; } return res <= k; } int del(int x) { if (x < 0) x = -x; has[x]++; } int main() { cin >> n >> k; v.resize(n + 2, 0); ck.resize(1000000, 0); for (int i = 0; i < n; ++i) { cin >> a; v[i] = a; } for (int i = 0; i < n; ++i) { for (int j = i + 1; j < n; ++j) { int d = abs(v[i] - v[j]); has[d]++; } } for (int i = n - k; i < 1000000; ++i) { int s = 0; for (int x = i; x < 1000000; x += i) { s += has[x]; } if (s <= (k * (k + 1) / 2) && check(i)) { cout << i << endl; return 0; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } map<vector<int>, int> H; for (int i = 0; i < 1 << 18; i++) { vector<int> b(n); for (int j = 0; j < n; j++) { b[j] = __builtin_popcount((a[j] >> 12) ^ i); } H[b] = i; } for (int i = 0; i < 1 << 12; i++) { vector<int> b(n); for (int j = 0; j < n; j++) { b[j] = __builtin_popcount((a[j] & ((1 << 12) - 1)) ^ i); } int st = *max_element(b.begin(), b.end()); for (int add = 0; add <= 30 - st; add++) { vector<int> c(n); for (int j = 0; j < n; j++) { c[j] = st + add - b[j]; } if (H.count(c)) { cout << ((H[c] << 12) | i) << endl; return 0; } } } cout << -1 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 5005, P = 1e9 + 7; int ad(int k1, int k2) { return k1 += k2 - P, k1 += k1 >> 31 & P; } int su(int k1, int k2) { return k1 -= k2, k1 += k1 >> 31 & P; } int mu(int k1, int k2) { return 1LL * k1 * k2 % P; } void uad(int& k1, int k2) { k1 += k2 - P, k1 += k1 >> 31 & P; } void usu(int& k1, int k2) { k1 -= k2, k1 += k1 >> 31 & P; } template <typename... T> int ad(int k1, T... k2) { return ad(k1, ad(k2...)); } template <typename... T> void uad(int& k1, T... k2) { return uad(k1, ad(k2...)); } template <typename... T> void usu(int& k1, T... k2) { return usu(k1, ad(k2...)); } template <typename... T> int mu(int k1, T... k2) { return mu(k1, mu(k2...)); } int po(int k1, int k2) { int k3 = 1; for (; k2; k2 >>= 1, k1 = mu(k1, k1)) if (k2 & 1) k3 = mu(k3, k1); return k3; } int n, K, a[N], f[N]; int main() { scanf( %d%d , &n, &K); for (int i = (1); i <= (n); ++i) scanf( %d , &a[i]); f[0] = 1; for (int i = (1); i <= (n); ++i) { for (int j = (N - 1); j >= (0); --j) { f[j] = su(mu(f[j], a[i]), j ? f[j - 1] : 0); } } int down = 1, pw = 1, in = po(n, P - 2), ans = 0; for (int i = (0); i <= (N - 1); ++i) { if (i) down = mu(down, K - i + 1), pw = mu(pw, in); ans = ad(ans, mu(down, pw, f[i])); } printf( %d n , su(f[0], ans)); return 0; }
|
#include <bits/stdc++.h> using namespace std; bool mark[1234][1234]; char a[1234][1234]; int n, m, com; int id[1234][1234]; vector<pair<int, int> > node; int mX[10] = {-1, -1, -1, 0, 0, 1, 1, 1}; int mY[10] = {-1, 0, 1, -1, 1, -1, 0, 1}; inline void dfs(int x, int y) { mark[x][y] = true; if (x == n || y == m) { node.push_back(pair<int, int>(-1, -1)); return; } for (int i = 0; i < 8; i++) { int X = x + mX[i]; int Y = y + mY[i]; if (a[X][Y] == 1 && id[X][Y] != com) { id[X][Y] = com; node.push_back(pair<int, int>(X, Y)); } else if (!mark[X][Y] && a[X][Y] == 0 ) { dfs(X, Y); } } } inline int dfs2(int x, int y) { id[x][y] = -1; int ret = 1; if (id[x - 1][y] == com) ret += dfs2(x - 1, y); if (id[x + 1][y] == com) ret += dfs2(x + 1, y); if (id[x][y - 1] == com) ret += dfs2(x, y - 1); if (id[x][y + 1] == com) ret += dfs2(x, y + 1); return ret; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) scanf( %c , &a[i][j]); int res = 0; for (int i = 1; i < n; i++) for (int j = 1; j < m; j++) if (a[i][j] == 1 && a[i + 1][j] == 1 && a[i][j + 1] == 1 && a[i + 1][j + 1] == 1 ) res = 4; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) if (!mark[i][j] && a[i][j] == 0 ) { com++; node.clear(); dfs(i, j); if (node.size() < 5) continue; bool wr = false; for (int z = 0; z < (int)node.size(); z++) { int x = node[z].first; int y = node[z].second; if (x == -1 || y == -1) { wr = true; break; } int deg = (id[x - 1][y] == id[x][y]) + (id[x + 1][y] == id[x][y]) + (id[x][y - 1] == id[x][y]) + (id[x][y + 1] == id[x][y]); if (deg != 2) { wr = true; break; } } if (!wr) { int p = dfs2(node[0].first, node[0].second); if (p == (int)node.size()) res = max(res, (int)node.size()); } } } cout << res << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int f(vector<int>& a, int x) { if (a[x] == x) return x; a[x] = f(a, a[x]); return a[x]; } bool mer(vector<int>& a, int x, int y) { if (f(a, x) == f(a, y)) return true; else return false; } void uni(vector<int>& a, int x, int y) { if (mer(a, x, y)) return; else a[f(a, y)] = f(a, x); } bool s[100005]; int main() { int n, ma, mb, x, y; cin >> n >> ma >> mb; vector<int> a(n + 1), b(n + 1); for (int i = 0; i <= n; i++) a[i] = b[i] = i; for (int i = 0; i < ma; i++) { cin >> x >> y; uni(a, x, y); } for (int i = 0; i < mb; i++) { cin >> x >> y; uni(b, x, y); } vector<pair<int, int>> c; vector<int> e, f; for (int i = 1; i <= n; i++) { if (!mer(a, 1, i) && !mer(b, 1, i)) { c.push_back(pair<int, int>(1, i)); uni(a, 1, i); uni(b, 1, i); } } int i, j; i = j = 2; while (1) { while (i <= n && mer(a, 1, i)) i++; if (i > n) break; while (j <= n && mer(b, 1, j)) j++; if (j > n) break; uni(a, i, j); uni(b, i, j); c.push_back(pair<int, int>(i, j)); i++; j++; } cout << c.size() << endl; for (int i = 0; i < c.size(); i++) { cout << c[i].first << << c[i].second << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 5010; const int inf = 1e9; const int mo = 1e9 + 7; int s[N], num[N][N], ans[N], gra[N][N]; int main() { int n, m; cin >> n >> m; for (auto i = (1); i <= (n); ++i) { cin >> s[i]; } memset(num, 0, sizeof(num)); memset(gra, 0, sizeof(gra)); memset(ans, -1, sizeof(ans)); for (auto i = (1); i <= (n); ++i) { for (auto j = (i); j <= (n); ++j) { gra[s[i]][j]++; } } for (auto i = (1); i <= (m); ++i) { int f, h; cin >> f >> h; for (auto j = (h); j <= (n); ++j) { num[f][j]++; } } for (auto i = (0); i <= (n); ++i) { int cntl = gra[s[i]][i], cntr = gra[s[i]][n] - gra[s[i]][i]; if (i && !(num[s[i]][cntl] - num[s[i]][cntl - 1])) continue; long long cur = 0, tmp = 1; if (i) cur++; int sr = num[s[i]][cntr]; if (cntr >= cntl) sr--; if (sr >= 1) { cur++; tmp *= sr; } for (auto j = (1); j <= (n); ++j) { if (j == s[i]) continue; int cntl = gra[j][i - 1], cntr = gra[j][n] - gra[j][i]; int sl = num[j][cntl], sr = num[j][cntr]; if (!sr && !sl) continue; else if (!sl) { tmp = (tmp * sr) % mo; cur++; } else if (!sr) { tmp = (tmp * sl) % mo; cur++; } else if (sl == 1 && sr == 1) { cur += 1; tmp = tmp * 2 % mo; } else { cur += 2; tmp = (tmp * (sl * sr - min(sl, sr))) % mo; } } if (ans[cur] == -1) ans[cur] = 0; ans[cur] = (ans[cur] + tmp) % mo; } ans[0] = 1; for (auto i = (n); i >= (0); --i) { if (ans[i] != -1) { cout << i << << ans[i]; break; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<int> v[2000]; vector<int> w[2000]; vector<int> z; int f[2000]; int c[2000]; void dfs(int x) { f[x] = 1; for (int i = 0; i < v[x].size(); i++) { if (f[v[x][i]] == 0) dfs(v[x][i]); } z.push_back(x); } void dfs2(int x, int k) { f[x] = 1; c[x] = k; for (int i = 0; i < w[x].size(); i++) { if (f[w[x][i]] == 0) dfs2(w[x][i], k); } } int scc(int n) { int k = 0; for (int i = 0; i < n; i++) f[i] = 0; z.clear(); for (int i = 0; i < n; i++) { if (f[i] == 0) dfs(i); } for (int i = 0; i < n; i++) f[i] = 0; for (int i = z.size() - 1; i >= 0; i--) { if (f[z[i]] == 0) dfs2(z[i], k++); } return k; } int main() { int n, i, j; scanf( %d , &n); for (i = 0; i < n; i++) { for (j = 0; j < n; j++) { int x; scanf( %d , &x); if (x > 0) { v[i].push_back(j); w[j].push_back(i); } } } if (scc(n) == 1) { puts( YES ); } else { puts( NO ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e5; int n; long long x, m, ans; long long f() { long long a, b, q; q = (x - 1) % 4; a = q == 0 ? x - 1 : q == 1 ? 1 : q == 2 ? x : 0; q = (x + m - 1) % 4; b = q == 0 ? x + m - 1 : q == 1 ? 1 : q == 2 ? x + m : 0; return a ^ b; } int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) { scanf( %lld %lld , &x, &m); ans ^= f(); } if (ans) puts( tolik ); else puts( bolik ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; struct node { long long int u, v, w; } edge[N]; bool cmp(node a, node b) { return a.w < b.w; } long long int n, m, k, v, ans = 0; bool special[N]; long long int root[N]; long long int find_root(long long int x) { if (root[x] == x) return x; return root[x] = find_root(root[x]); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m >> k; for (long long int i = 0; i <= k - 1; ++i) { cin >> v; special[v] = true; } for (long long int i = 0; i <= m - 1; ++i) { cin >> edge[i].u >> edge[i].v >> edge[i].w; } sort(edge, edge + m, cmp); for (long long int i = 1; i <= n; ++i) root[i] = i; for (long long int i = 0; i <= m - 1; ++i) { long long int root_u = find_root(edge[i].u); long long int root_v = find_root(edge[i].v); if (root_u != root_v) { if (special[root_u] && special[root_v]) { ans = max(ans, edge[i].w); } if (special[root_u]) root[root_v] = root_u; else root[root_u] = root_v; } } for (long long int j = 1; j <= n; ++j) { if (special[j]) cout << ans << ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int p = 1e9 + 7; int main() { int t; cin >> t; while (t--) { int x; cin >> x; string s; cin >> s; int inl = s.length(); int i = 0; while (s.length() < x) { int l1 = s.length(); for (int j = 0; j < (s[i] - 1 ); j++) s.append(s.substr(i + 1, l1 - i - 1)); i++; } s = s.substr(0, x); long long int prod = 1, temp = 0; for (int i = x - 1; i >= 0; i--) { prod = (prod * (s[i] - 0 )) % p; temp = (temp - prod + p) % p; } prod = (prod * inl) % p; temp = (temp + x + prod) % p; cout << temp << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; int main() { ios_base::sync_with_stdio(0); cin.tie(0); ; int n, k; cin >> n >> k; vector<int> a(n); for (int &x : a) cin >> x; bool can = true; for (int i = k; i < n; ++i) { if (a[i] != a[k - 1]) { can = false; break; } } if (can) { int head = k - 2; while (head >= 0 && a[head] == a[k - 1]) head--; cout << head + 1; } else cout << -1; return 0; }
|
#include <bits/stdc++.h> using namespace std; double dp[53][53][53]; int n; pair<int, int> a[53]; bool check(double x) { for (int i = 0; i <= n + 1; i++) { for (int j = 0; j <= n + 1; j++) { for (int k = 0; k <= n + 1; k++) { dp[i][j][k] = 1e17; } } } dp[0][0][0] = 0; for (int i = 1; i <= n; i++) { for (int j = 0; j <= i; j++) { for (int k = 0; k <= i; k++) { if (a[i].first < a[i - 1].first) { if (j - k + 1 >= 0) dp[i][j][0] = min(dp[i][j][0], dp[i - 1][j - k + 1][k]); if (j - k >= 0) dp[i][j][1] = min(dp[i][j][1], dp[i - 1][j - k][k] + a[i].first - x * a[i].second); } else if (k - 1 >= 0) dp[i][j][k] = min(dp[i - 1][j + 1][k], dp[i - 1][j][k - 1] + a[i].first - x * a[i].second); else dp[i][j][k] = dp[i - 1][j + 1][k]; } } } for (int j = 0; j <= n; j++) for (int k = 0; k <= n - j; k++) if (dp[n][j][k] <= 0) return 1; return 0; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i].first); for (int i = 1; i <= n; i++) scanf( %d , &a[i].second); sort(a + 1, a + n + 1, greater<pair<int, int> >()); a[0].first = -1050000000; double l = 0, r = 5e9, mid; while (fabs(r - l) > 1e-7) { mid = (l + r) / 2; if (check(mid)) r = mid; else l = mid; } double ans = mid * 1000; cout << (ans - (long long)ans < 1e-4 ? (long long)ans : (long long)ans + 1) << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long N = 3e5 + 100; const long long big = 1e18; const long long block = 800; const long long mod = 1e6; bool fans = 0; long long n, m; long long w[N]; long long c[N]; vector<pair<long long, long long> > g[N], supans; vector<pair<pair<long long, long long>, pair<long long, long long> > > gr; vector<long long> ba, go; long long p[N]; long long full; vector<pair<long long, long long> > grph; long long fnd(long long a) { return p[a] = (p[a] == a ? a : fnd(p[a])); } void unt(long long a, long long b, long long i) { long long v = a, u = b; a = fnd(a), b = fnd(b); if (a == b) { if (!fans) ba.push_back(i); return; } if (fans) supans.push_back({i, w[i]}); if (!fans) { go.push_back(i); g[v].push_back({u, i}), g[u].push_back({v, i}); } p[b] = a; full += w[i]; } long long tin[N], tout[N], tmr; long long kth[N][21]; pair<long long, long long> mx[N][21]; void dfs(long long v = 1, long long pr = 0, long long reb = 0) { kth[v][0] = pr; tin[v] = ++tmr; mx[v][0] = {w[reb], reb}; for (int i = 1; i <= 20; i++) kth[v][i] = kth[kth[v][i - 1]][i - 1], mx[v][i] = max(mx[v][i - 1], mx[kth[v][i - 1]][i - 1]); for (auto u : g[v]) if (u.first != pr) dfs(u.first, v, u.second); tout[v] = tmr; } bool upper(long long a, long long b) { return (tin[a] <= tin[b] && tout[b] <= tout[a]); } long long LCA(long long a, long long b) { if (upper(a, b)) return a; if (upper(b, a)) return b; for (int i = 20; i >= 0; i--) { if (!upper(kth[a][i], b)) a = kth[a][i]; } return kth[a][0]; } pair<long long, long long> qu(long long a, long long b) { long long lca = LCA(a, b); pair<long long, long long> sub = {0, 0}; long long t = 2; while (t--) { if (lca != a) { for (int i = 20; i >= 0; i--) { if (!upper(kth[a][i], lca)) sub = max(mx[a][i], sub), a = kth[a][i]; } sub = max(sub, mx[a][0]); } swap(a, b); } return sub; } int main() { tout[0] = big; cin >> n >> m; for (int i = 1; i <= m; i++) cin >> w[i]; for (int i = 1; i <= m; i++) cin >> c[i]; for (int i = 1, a, b; i <= m; i++) { cin >> a >> b; grph.push_back({a, b}); gr.push_back({{w[i], i}, {a, b}}); } for (int i = 1; i <= n; i++) p[i] = i; long long S; cin >> S; sort((gr).begin(), (gr).end()); for (auto u : gr) unt(u.second.first, u.second.second, u.first.second); dfs(); pair<long long, long long> ans = {big, 0}; for (auto u : go) { pair<long long, long long> zzzz = {full - S / c[u], u}; ans = min(ans, zzzz); } for (auto u : ba) { pair<long long, long long> h = grph[u - 1]; long long z = w[u] - (S / c[u]); h = qu(h.first, h.second); if (h.first > z) ans = min(ans, pair<long long, long long>({full - h.first + z, u})); } w[ans.second] -= S / c[ans.second]; for (int i = 0; i < gr.size(); i++) { if (gr[i].first.second == ans.second) gr[i].first.first = w[ans.second]; } for (int i = 1; i <= n; i++) p[i] = i; sort((gr).begin(), (gr).end()); fans = 1; for (auto u : gr) { unt(u.second.first, u.second.second, u.first.second); } cout << ans.first << n ; for (auto u : supans) cout << u.first << << u.second << n ; }
|
#include <bits/stdc++.h> using namespace std; int n, ans; int f[1000]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) { if (i + j - 1 <= n) { for (int k = j; k <= i + j - 1; k++) f[k]++; } } for (int i = 1; i <= n; i++) ans = max(ans, f[i]); printf( %d , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; string a, b; char s[200000], p[50]; int ans = 0; bool check(int l, int r) { int j = 1; for (int i = l; i <= r; ++i) { if (s[i] != p[j]) { return false; } j++; } return true; } int main() { std::ios::sync_with_stdio(false); cin >> a >> b; int n = (int)a.size(); int m = (int)b.size(); for (int i = 1; i <= n; ++i) s[i] = a[i - 1]; for (int i = 1; i <= m; ++i) p[i] = b[i - 1]; for (int i = 1; i <= n - m + 1; ++i) { if (check(i, i + m - 1)) { s[i + m - 1] = # ; ans++; } } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long fib[50010]; int main() { long long n; cin >> n; fib[0] = 1; fib[1] = 2; if (n == 1) { cout << 0; return 0; } else if (n == 2) { cout << 1; return 0; } int i = 1; while (fib[i] <= n) { ++i; fib[i] = fib[i - 2] + fib[i - 1]; } --i; cout << i; }
|
#include <bits/stdc++.h> using namespace std; const int MAX_N = 100 + 20; vector<pair<int, int> > edge, adj[2 * MAX_N]; vector<int> topol; int mark[2 * MAX_N], node[2 * MAX_N]; int comp; int ans[2 * MAX_N]; string s; int n, m; void readInput() { cin >> n >> m; for (int i(0); i < int(m); i++) { int v, u; cin >> v >> u; --v, u--; edge.push_back(make_pair(v, u)); } } int possib(int v, int u, int x) { return (min(v, u) < x & max(v, u) > x); } inline int f(int x) { return x > 0 ? (x << 1) : ((-x) << 1) + 1; } void addEdge(int x, int y) { adj[f(-x)].push_back(make_pair(f(y), 1)); adj[f(y)].push_back(make_pair(f(-x), 0)); adj[f(-y)].push_back(make_pair(f(x), 1)); adj[f(x)].push_back(make_pair(f(-y), 0)); } void makeGraph() { for (int i(0); i < int(edge.size()); i++) { int v = edge[i].first, u = edge[i].second; for (int j(0); j < int(edge.size()); j++) if (i != j && min(v, u) < min(edge[j].first, edge[j].second)) { int x = edge[j].first, y = edge[j].second; if (min(v, u) == min(x, y) || max(v, u) == max(x, y)) continue; if (possib(v, u, min(x, y)) && !possib(v, u, max(x, y))) { addEdge(i + 1, j + 1); addEdge(-(i + 1), -(j + 1)); } } } } void tSort(int v) { if (node[v]) return; node[v] = 1; for (int i(0); i < int(adj[v].size()); i++) if (adj[v][i].second) tSort(adj[v][i].first); topol.push_back(v); } void dfs(int v, int c) { mark[v] = c; for (int i(0); i < int(adj[v].size()); i++) { int u = adj[v][i].first, type = adj[v][i].second; if (type || mark[u]) continue; dfs(u, c); } } void judge(int v, int u) { if (ans[v] == -1 && ans[u] == -1) { ans[v] = 1; ans[u] = 0; if (u > v) swap(ans[v], ans[u]); } else if (ans[v] != -1) ans[u] = ans[v] ^ 1; else ans[v] = ans[u] ^ 1; } int solve() { for (int i(1); i < int(m + 1); i++) { tSort(f(i)); tSort(f(-i)); } reverse(topol.begin(), topol.end()); for (int i(0); i < int(topol.size()); i++) { int v = topol[i]; if (!mark[v]) dfs(v, ++comp); } for (int i(1); i < int(m + 1); i++) if (mark[f(i)] == mark[f(-i)]) return 0; for (int i(1); i < int(comp + 1); i++) ans[i] = -1; for (int i(1); i < int(m + 1); i++) judge(mark[f(i)], mark[f(-i)]); for (int i(1); i < int(m + 1); i++) s += (ans[mark[f(i)]] == 1 ? i : o ); return 1; } int main() { ios::sync_with_stdio(false); readInput(); makeGraph(); cout << (solve() == 1 ? s : Impossible ) << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T> inline T read() { T x = 0, w = 1; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) w = -w; for (; isdigit(c); c = getchar()) x = x * 10 + c - 0 ; return x * w; } template <class T> inline T read(T& x) { return x = read<T>(); } const int P = 1e9 + 7; inline int add(int a, int b) { return (a += b) >= P ? a - P : a; } inline int mul(int a, int b) { return (long long)a * b % P; } inline int fpow(int a, int b) { int ans = 1; for (; b; b >>= 1, a = mul(a, a)) if (b & 1) ans = mul(ans, a); return ans; } inline void chkadd(int& a, int b) { (a += b) >= P ? a -= P : 0; } char S[1002], X[52], Y[52]; int ch[25000][10], fa[25000], val[25000], tot; int F[51][25000][2][2]; int main() { scanf( %s , S + 1); int n = strlen(S + 1); scanf( %s%s , X + 1, Y + 1); int d = strlen(X + 1); if (n < d / 2) { puts( 0 ); return 0; } for (int i = 1; i + d / 2 - 1 <= n; ++i) { int x = 0; for (int j = i; j <= i + d / 2 - 1; ++j) { int c = S[j] - 0 ; if (!ch[x][c]) ch[x][c] = ++tot; x = ch[x][c]; } val[x] = 1; } deque<int> Q; for (int c = 0; c <= 9; ++c) if (ch[0][c]) Q.push_back(ch[0][c]); while (Q.size()) { int x = Q.front(); Q.pop_front(); for (int c = 0; c <= 9; ++c) { if (!ch[x][c]) ch[x][c] = ch[fa[x]][c]; else fa[ch[x][c]] = ch[fa[x]][c], Q.push_back(ch[x][c]); } } for (int x = 0; x <= tot; ++x) if (val[x]) fill(ch[x], ch[x] + 10, x); F[0][0][1][1] = 1; for (int i = 1; i <= d; ++i) for (int x = 0; x <= tot; ++x) for (int l = 0; l <= 1; ++l) for (int r = 0; r <= 1; ++r) { if (!F[i - 1][x][l][r]) continue; for (int c = 0; c <= 9; ++c) { if (l and c < X[i] - 0 ) continue; if (r and c > Y[i] - 0 ) continue; chkadd(F[i][ch[x][c]][l and c == X[i] - 0 ][r and c == Y[i] - 0 ], F[i - 1][x][l][r]); } } int ans = 0; for (int x = 0; x <= tot; ++x) if (val[x]) for (int l = 0; l <= 1; ++l) for (int r = 0; r <= 1; ++r) chkadd(ans, F[d][x][l][r]); printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( -O2 ) using namespace std; void err(istream_iterator<string> it) {} template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << endl; err(++it, args...); } const int LIM = 1e5 + 5, MOD = 1e9 + 7; int t, n, m, k, x, y; map<int, int> M; int solve(int m) { if (m < k) return 0; if (M.find(m) != M.end()) return M[m]; vector<int> a(3000, 0); for (int i = 1; i < (int)1e5; i++) { if (i * i > m) break; if (m % i == 0) { if (i > 1 && i & 1 && m / i >= k) a[solve(m / i)] |= 1; else if (m / i >= k && i > 1) a[0] |= 1; if (m / i > 1 && (m / i) & 1 && i >= k) a[solve(i)] |= 1; else if (i >= k && m / i > 1) a[0] |= 1; } } int ans = 0; while (a[ans]) ans++; return M[m] = ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m >> k; if (n & 1) { int ans = solve(m); if (ans) cout << Timur n ; else cout << Marsel n ; } else cout << Marsel n ; return 0; }
|
#include <bits/stdc++.h> const int maxn = 100005; const int mod = 1000000007; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } using namespace std; char s[10]; int n, h; int main() { while (~scanf( %s , s + 1)) { scanf( %d%d , &n, &h); if (s[1] == B ) { printf( %d n , n); continue; } double ans = n; double mi = 1; for (int i = 1; i <= h; i++) { mi *= 2; double t = 1; for (int j = 1; j <= n; j++) { ans += (n - j) * 1.0 / (mi * mi) * t * (mi - mi / 2.0 * (1.0 + (j - 1) / (mi - 1))); t *= (1.0 - 1.0 / mi); } } printf( %.9lf n , ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); const double eps = 1e-12; const int inf = 2000000000; const long long int infLL = (long long int)2e18; long long int MOD = 998244353; int MOD1 = 1000000007; int MOD2 = 1000000009; inline bool checkBit(long long int n, long long int i) { return n & (1LL << i); } inline long long int setBit(long long int n, long long int i) { return n | (1LL << i); ; } inline long long int resetBit(long long int n, long long int i) { return n & (~(1LL << i)); } int dx[] = {0, 0, +1, -1}; int dy[] = {+1, -1, 0, 0}; inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; } inline bool isLeapYear(long long int year) { return (year % 400 == 0) || (year % 4 == 0 && year % 100 != 0); } inline void normal(long long int &a) { a %= MOD; (a < 0) && (a += MOD); } inline long long int modMul(long long int a, long long int b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a * b) % MOD; } inline long long int modAdd(long long int a, long long int b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a + b) % MOD; } inline long long int modSub(long long int a, long long int b) { a %= MOD, b %= MOD; normal(a), normal(b); a -= b; normal(a); return a; } inline long long int modPow(long long int b, long long int p) { long long int r = 1LL; while (p) { if (p & 1) r = modMul(r, b); b = modMul(b, b); p >>= 1LL; } return r; } inline long long int modDiv(long long int a, long long int b) { return modMul(a, modPow(b, MOD - 2)); } bool comp(const pair<long long int, pair<long long int, long long int> > &p1, const pair<long long int, pair<long long int, long long int> > &p2) { return p1.first > p2.first; } bool comp1(const pair<long long int, long long int> &p1, const pair<long long int, long long int> &p2) { if (p1.first == p2.first) { return p1.second > p2.second; } return p1.first < p2.first; } long long int converter(string a) { long long int i, mul = 1, r, t, ans = 0LL; if (a.length() == 0) return 0; for (i = a.length() - 1; i >= 0; i--) { t = a[i] - 0 ; r = t % 10; ans += (mul * r); mul = mul * 10; } return ans; } int msb(unsigned x) { union { double a; int b[2]; }; a = x; return (b[1] >> 20) - 1023; } const int MAX = (int)1e5 + 5; int n, m, a[MAX], tp[MAX], b[MAX]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int i, j, k; cin >> n >> m; for (i = 1; i <= m; ++i) { cin >> a[i]; tp[a[i]]++; } int tot = 0; for (i = 1; i <= m; ++i) { if (tp[a[i]] > 0) b[++tot] = tp[a[i]], tp[a[i]] = 0; } for (i = 1000; i >= 1; --i) { long long int xx = 0LL; for (j = 1; j <= tot; ++j) { xx += (b[j] / i); } if (xx >= n) { cout << i << n ; return 0; } } cout << 0 << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 25; const int M = 505; int n, m, a, b; int i, j, k, u, v, con; int deg[N]; bool c[N][N]; double p[N], q[N][N]; double f[M][M]; int g(int i, int j) { return i * n - n + j; } int main() { scanf( %d%d%d%d , &n, &m, &a, &b); for (i = 1; i <= m; i++) { scanf( %d%d , &u, &v); c[u][v] = c[v][u] = 1; deg[u]++; deg[v]++; } for (i = 1; i <= n; i++) scanf( %lf , &p[i]); for (i = 1; i <= n; i++) for (j = 1; j <= n; j++) if (i == j) q[i][j] = p[i]; else if (c[i][j]) q[i][j] = (1 - p[i]) / deg[i]; con = n * n; f[g(a, b)][con + 1] = -1; for (i = 1; i <= n; i++) for (j = 1; j <= n; j++) { f[g(i, j)][g(i, j)]--; for (a = 1; a <= n; a++) for (b = 1; b <= n; b++) if (a != b) f[g(i, j)][g(a, b)] += q[a][i] * q[b][j]; } for (i = 1; i <= con; i++) { for (j = i; j <= con; j++) if (f[j][i] != 0) break; if (j > con) continue; if (j != i) for (k = i; k <= con + 1; k++) swap(f[i][k], f[j][k]); for (j = i + 1; j <= con; j++) for (k = con + 1; k >= i; k--) f[j][k] -= f[j][i] / f[i][i] * f[i][k]; } for (i = con; i; i--) { if (f[i][i] == 0) continue; f[i][con + 1] /= f[i][i]; for (j = i - 1; j; j--) f[j][con + 1] -= f[i][con + 1] * f[j][i]; } for (i = 1; i <= n; i++) printf(i < n ? %.6lf : %.6lf n , f[g(i, i)][con + 1]); return 0; }
|
#include <bits/stdc++.h> using namespace std; inline int read() { char c = getchar(); int x = 0, f = 1; for (; !isdigit(c); c = getchar()) if (c == - ) f = -1; for (; isdigit(c); c = getchar()) x = x * 10 + c - 0 ; return x * f; } const int MAXN = 1e5 + 5; int N, M, ans; int nxt[MAXN]; char s[MAXN], t[MAXN]; int main() { scanf( %s , s + 1); scanf( %s , t + 1); N = strlen(s + 1); M = strlen(t + 1); int j = 0; for (int i = 2; i <= M; i++) { while (j && t[i] != t[j + 1]) j = nxt[j]; if (t[i] == t[j + 1]) j++; nxt[i] = j; } int lst = 0; j = 0; for (int i = 1; i <= N; i++) { while (j && s[i] != t[j + 1]) j = nxt[j]; if (s[i] == t[j + 1]) j++; if (j == M) { if (i - M + 1 > lst) { if (lst) ans++; lst = i; } j = nxt[j]; } } if (lst) ans++; printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int m, x, y, a[1005] = {0}, b[1005] = {0}; cin >> m; for (int i = 1; i <= m; i++) { cin >> x >> y; a[x]++; a[y]++; } for (int i = 1; i <= 5; i++) if (a[i] != 2) { cout << WIN ; return 0; } cout << FAIL ; }
|
#include <bits/stdc++.h> using namespace std; const int inf = (int)1e9; const long long llinf = (long long)3e18; const int N = (int)1e6 + 111; const long double PI = (long double)acos(-1); int cnt1[N], cnt[N]; int main() { int t, x, mx = 0, len = 0, n, m; scanf( %d , &t); for (int i = 0; i < t; i++) { scanf( %d , &x); cnt[x]++; mx = max(mx, x); } n = mx; for (int i = 1; i < mx; i++) if (4 * i != cnt[i]) { len = i - 1; break; } for (n = 1; n * n <= t; n++) if (t % n == 0) { m = t / n; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) if (min(min(i, n - 1 - i), min(j, m - 1 - j)) == len && max(i, n - 1 - i) + max(j, n - 1 - j) == mx) { for (int cur = 0; cur <= mx; cur++) cnt1[cur] = 0; bool ok = true; for (int ii = 0; ii < n; ii++) for (int jj = 0; jj < m; jj++) cnt1[abs(i - ii) + abs(j - jj)]++; for (int cur = 0; cur <= mx; cur++) if (cnt1[cur] != cnt[cur]) ok = false; if (ok) { printf( %d %d n%d %d , n, m, i + 1, j + 1); return 0; } } } printf( -1 ); }
|
#include <bits/stdc++.h> using namespace std; const int Inf = 0x3f3f3f3f; const long long INF = 0x3f3f3f3f3f3f3f3fll; const int jt = 1000000007; void inline add(int &a, int b) { a += b - jt; a += (a >> 31) & jt; } void inline sub(int &a, int b) { a -= b; a += (a >> 31) & jt; } void inline mul(int &a, int b) { a = (long long)a * b % jt; } int inline Add(int a, int b) { return a + b >= jt ? a + b - jt : a + b; } int inline Sub(int a, int b) { return a - b < 0 ? a - b + jt : a - b; } int inline Mul(int a, int b) { return (long long)a * b % jt; } int inline ksmii(int a, int b) { int res = 1; while (b) { if (b & 1) mul(res, a); mul(a, a); b >>= 1; } return res; } int n, m; int main() { scanf( %d%d , &n, &m); int fn = ksmii(n + 1, jt - 2); printf( %d n , Mul(Sub(1, Mul(fn, m)), ksmii(Mul(2, n + 1), m))); return 0; }
|
#include <bits/stdc++.h> using namespace std; inline long long read() { long long x = 0, f = 1; char ch; for (ch = getchar(); (ch < 0 || ch > 9 ) && ch != - ; ch = getchar()) ; if (ch == - ) f = 0, ch = getchar(); while (ch >= 0 && ch <= 9 ) { x = (x << 1) + (x << 3) + ch - 0 ; ch = getchar(); } return f ? x : -x; } long long n, res; long long a[500010], l[500010], r[500010]; long long fl[500010][21]; long long fr[500010][21]; long long st[500010], top; signed main() { n = read(); a[0] = a[n + 1] = 1e9 + 7; for (long long i = 1; i <= n; ++i) { a[i] = read(); fl[i][0] = fr[i][0] = a[i]; while (a[i] >= a[st[top]] && top) --top; l[i] = st[top] + 1; st[++top] = i; } top = 0; st[top] = n + 1; for (long long i = n; i >= 1; --i) { while (a[i] > a[st[top]] && top) --top; r[i] = st[top] - 1; st[++top] = i; } for (long long i = 1; i <= 18; ++i) { for (long long j = 1; j <= n; ++j) { fl[j][i] = fl[j][i - 1] | fl[j + (1 << (i - 1))][i - 1]; } for (long long j = n; j >= 1; --j) { fr[j][i] = fr[j][i - 1]; if (j >= (1 << (i - 1))) fr[j][i] = fr[j][i - 1] | fr[j - (1 << (i - 1))][i - 1]; } } for (long long i = 1; i <= n; ++i) { if (i - l[i] <= r[i] - i) { for (long long k = l[i]; k <= i; ++k) { long long now = k; long long sum = a[k]; for (long long d = 18; d >= 0; --d) { if (now + (1 << d) <= r[i] && (sum | fl[now + 1][d]) <= a[i]) { sum |= fl[now + 1][d]; now += (1 << d); } } if (now >= i) res += (now - i + 1); } } else { for (long long k = i; k <= r[i]; ++k) { long long now = k; long long sum = a[k]; for (long long d = 18; d >= 0; --d) { if (now - (1 << d) >= l[i] && (sum | fr[now - 1][d]) <= a[i]) { sum |= fr[now - 1][d]; now -= (1 << d); } } if (now <= i) res += (i - now + 1); } } } printf( %lld n , (n) * (n + 1) / 2 - res); return 0; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.