solution
stringlengths 53
181k
| difficulty
int64 0
13
|
|---|---|
#include <bits/stdc++.h>
using namespace std;
vector<int> pos[100060];
int c[100060], a[100060], zd[100060], cnt[100060], res[100060];
struct edge {
int l, r, id;
} pre[100060];
struct edge1 {
int st, ed, id;
} q[100060];
struct node {
int l, r, num, cnt;
} b[4 * 100060];
bool cmp(edge1 a, edge1 b) { return a.ed < b.ed; }
bool cmp1(edge1 a, edge1 b) { return a.id < b.id; }
void build(int l, int r, int i) {
int mid;
b[i].l = l;
b[i].r = r;
b[i].cnt = 0;
if (l == r) {
b[i].num = 0;
return;
}
mid = (l + r) / 2;
build(l, mid, i * 2);
build(mid + 1, r, i * 2 + 1);
}
void update(int l, int r, int num, int i) {
int mid;
if (b[i].l == l && b[i].r == r) {
b[i].cnt += num;
return;
}
if (b[i].cnt) {
b[i * 2].cnt += b[i].cnt;
b[i * 2 + 1].cnt += b[i].cnt;
b[i].cnt = 0;
}
mid = (b[i].l + b[i].r) / 2;
if (r <= mid)
update(l, r, num, i * 2);
else if (l > mid)
update(l, r, num, i * 2 + 1);
else {
update(l, mid, num, i * 2);
update(mid + 1, r, num, i * 2 + 1);
}
}
int question(int id, int i) {
int mid;
if (b[i].l == id && b[i].r == id) {
b[i].num += b[i].cnt;
b[i].cnt = 0;
return b[i].num;
}
if (b[i].cnt) {
b[i * 2].cnt += b[i].cnt;
b[i * 2 + 1].cnt += b[i].cnt;
b[i].cnt = 0;
}
mid = (b[i].l + b[i].r) / 2;
if (id <= mid)
return question(id, i * 2);
else
return question(id, i * 2 + 1);
}
int main() {
int n, m, i, j, t, l, r, ind, value;
while (scanf("%d%d", &n, &m) != EOF) {
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (i = 1; i <= m; i++) {
scanf("%d%d", &q[i].st, &q[i].ed);
q[i].id = i;
}
sort(q + 1, q + 1 + m, cmp);
memset(cnt, 0, sizeof(cnt));
for (i = 1; i <= n; i++) {
pos[i].clear();
}
build(1, n, 1);
ind = 1;
for (i = 1; i <= n; i++) {
value = a[i];
if (value <= n) {
cnt[value]++;
pos[value].push_back(i);
if (cnt[value] == value) {
pre[value].l = 1;
pre[value].r = pos[value][0];
pre[value].id = 0;
update(pre[value].l, pre[value].r, 1, 1);
} else if (cnt[value] > value) {
update(pre[value].l, pre[value].r, -1, 1);
pre[value].id++;
pre[value].l = pos[value][pre[value].id - 1] + 1;
pre[value].r = pos[value][pre[value].id];
update(pre[value].l, pre[value].r, 1, 1);
}
while (q[ind].ed == i && ind <= m) {
res[q[ind].id] = question(q[ind].st, 1);
ind++;
}
}
}
sort(q + 1, q + 1 + m, cmp1);
for (i = 1; i <= m; i++) {
if (i == m)
printf("%d\n", res[i]);
else
printf("%d ", res[i]);
}
}
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const int inf = 2000000000;
const long long infLL = 9000000000000000000;
template <typename first, typename second>
ostream &operator<<(ostream &os, const pair<first, second> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin()) os << ", ";
os << *it;
}
return os << "}";
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &v) {
os << "[";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin()) os << ", ";
os << *it;
}
return os << "]";
}
template <typename T>
ostream &operator<<(ostream &os, const multiset<T> &v) {
os << "[";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin()) os << ", ";
os << *it;
}
return os << "]";
}
template <typename first, typename second>
ostream &operator<<(ostream &os, const map<first, second> &v) {
os << "[";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin()) os << ", ";
os << it->first << " = " << it->second;
}
return os << "]";
}
clock_t tStart = clock();
void faltu() { cerr << '\n'; }
template <typename T>
void faltu(T a[], int n) {
for (int i = 0; i < n; ++i) cerr << a[i] << ' ';
cerr << '\n';
}
template <typename T, typename... hello>
void faltu(T arg, const hello &...rest) {
cerr << arg << ' ';
faltu(rest...);
}
const int mx = 2e5 + 5;
int n, k;
int a[mx];
map<int, int> mp[11];
int func(int num) {
int cnt = 0;
while (num) {
num /= 10;
++cnt;
}
return cnt;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> a[i];
++mp[func(a[i])][a[i] % k];
}
long long cnt = 0;
for (int i = 0; i < n; ++i) {
int p = a[i], q = 0;
int Size = func(p);
for (int j = 1; j <= 10; ++j) {
p = (p * 10LL) % k;
if (p)
q = k - p;
else
q = 0;
if (mp[j].count(q)) cnt += mp[j][q];
if (j == Size && q == (a[i] % k)) --cnt;
}
}
cout << cnt;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, temp;
vector<int> P;
vector<int> N;
vector<int> Z;
cin >> n;
while (n--) {
cin >> temp;
if (temp > 0)
P.push_back(temp);
else if (temp < 0)
N.push_back(temp);
else
Z.push_back(temp);
}
if (P.size() == 0) {
P.push_back(N[0]);
P.push_back(N[1]);
N.erase(N.begin() + 0);
N.erase(N.begin() + 0);
}
if (N.size() % 2 == 0) {
Z.push_back(N[0]);
N.erase(N.begin() + 0);
}
cout << N.size();
for (int i = 0; i < N.size(); i++) {
cout << " " << N[i];
}
cout << '\n' << P.size();
for (int i = 0; i < P.size(); i++) {
cout << " " << P[i];
}
cout << '\n' << Z.size();
for (int i = 0; i < Z.size(); i++) {
cout << " " << Z[i];
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
void tow() {
cout << " 0" << endl;
cout << " 0 1 0" << endl;
cout << "0 1 2 1 0" << endl;
cout << " 0 1 0" << endl;
cout << " 0" << endl;
}
void three() {
cout << " 0" << endl;
cout << " 0 1 0" << endl;
cout << " 0 1 2 1 0" << endl;
cout << "0 1 2 3 2 1 0" << endl;
cout << " 0 1 2 1 0" << endl;
cout << " 0 1 0" << endl;
cout << " 0" << endl;
}
void four() {
cout << " 0" << endl;
cout << " 0 1 0" << endl;
cout << " 0 1 2 1 0" << endl;
cout << " 0 1 2 3 2 1 0" << endl;
cout << "0 1 2 3 4 3 2 1 0" << endl;
cout << " 0 1 2 3 2 1 0" << endl;
cout << " 0 1 2 1 0" << endl;
cout << " 0 1 0" << endl;
cout << " 0" << endl;
}
void five() {
cout << " 0" << endl;
cout << " 0 1 0" << endl;
cout << " 0 1 2 1 0" << endl;
cout << " 0 1 2 3 2 1 0" << endl;
cout << " 0 1 2 3 4 3 2 1 0" << endl;
cout << "0 1 2 3 4 5 4 3 2 1 0" << endl;
cout << " 0 1 2 3 4 3 2 1 0" << endl;
cout << " 0 1 2 3 2 1 0" << endl;
cout << " 0 1 2 1 0" << endl;
cout << " 0 1 0" << endl;
cout << " 0" << endl;
}
void six() {
cout << " 0" << endl;
cout << " 0 1 0" << endl;
cout << " 0 1 2 1 0" << endl;
cout << " 0 1 2 3 2 1 0" << endl;
cout << " 0 1 2 3 4 3 2 1 0" << endl;
cout << " 0 1 2 3 4 5 4 3 2 1 0" << endl;
cout << "0 1 2 3 4 5 6 5 4 3 2 1 0" << endl;
cout << " 0 1 2 3 4 5 4 3 2 1 0" << endl;
cout << " 0 1 2 3 4 3 2 1 0" << endl;
cout << " 0 1 2 3 2 1 0" << endl;
cout << " 0 1 2 1 0" << endl;
cout << " 0 1 0" << endl;
cout << " 0" << endl;
}
void seven() {
cout << " 0" << endl;
cout << " 0 1 0" << endl;
cout << " 0 1 2 1 0" << endl;
cout << " 0 1 2 3 2 1 0" << endl;
cout << " 0 1 2 3 4 3 2 1 0" << endl;
cout << " 0 1 2 3 4 5 4 3 2 1 0" << endl;
cout << " 0 1 2 3 4 5 6 5 4 3 2 1 0" << endl;
cout << "0 1 2 3 4 5 6 7 6 5 4 3 2 1 0" << endl;
cout << " 0 1 2 3 4 5 6 5 4 3 2 1 0" << endl;
cout << " 0 1 2 3 4 5 4 3 2 1 0" << endl;
cout << " 0 1 2 3 4 3 2 1 0" << endl;
cout << " 0 1 2 3 2 1 0" << endl;
cout << " 0 1 2 1 0" << endl;
cout << " 0 1 0" << endl;
cout << " 0" << endl;
}
void eight() {
cout << " 0" << endl;
cout << " 0 1 0" << endl;
cout << " 0 1 2 1 0" << endl;
cout << " 0 1 2 3 2 1 0" << endl;
cout << " 0 1 2 3 4 3 2 1 0" << endl;
cout << " 0 1 2 3 4 5 4 3 2 1 0" << endl;
cout << " 0 1 2 3 4 5 6 5 4 3 2 1 0" << endl;
cout << " 0 1 2 3 4 5 6 7 6 5 4 3 2 1 0" << endl;
cout << "0 1 2 3 4 5 6 7 8 7 6 5 4 3 2 1 0" << endl;
cout << " 0 1 2 3 4 5 6 7 6 5 4 3 2 1 0" << endl;
cout << " 0 1 2 3 4 5 6 5 4 3 2 1 0" << endl;
cout << " 0 1 2 3 4 5 4 3 2 1 0" << endl;
cout << " 0 1 2 3 4 3 2 1 0" << endl;
cout << " 0 1 2 3 2 1 0" << endl;
cout << " 0 1 2 1 0" << endl;
cout << " 0 1 0" << endl;
cout << " 0" << endl;
}
void nine() {
cout << " 0" << endl;
cout << " 0 1 0" << endl;
cout << " 0 1 2 1 0" << endl;
cout << " 0 1 2 3 2 1 0" << endl;
cout << " 0 1 2 3 4 3 2 1 0" << endl;
cout << " 0 1 2 3 4 5 4 3 2 1 0" << endl;
cout << " 0 1 2 3 4 5 6 5 4 3 2 1 0" << endl;
cout << " 0 1 2 3 4 5 6 7 6 5 4 3 2 1 0" << endl;
cout << " 0 1 2 3 4 5 6 7 8 7 6 5 4 3 2 1 0" << endl;
cout << "0 1 2 3 4 5 6 7 8 9 8 7 6 5 4 3 2 1 0" << endl;
cout << " 0 1 2 3 4 5 6 7 8 7 6 5 4 3 2 1 0" << endl;
cout << " 0 1 2 3 4 5 6 7 6 5 4 3 2 1 0" << endl;
cout << " 0 1 2 3 4 5 6 5 4 3 2 1 0" << endl;
cout << " 0 1 2 3 4 5 4 3 2 1 0" << endl;
cout << " 0 1 2 3 4 3 2 1 0" << endl;
cout << " 0 1 2 3 2 1 0" << endl;
cout << " 0 1 2 1 0" << endl;
cout << " 0 1 0" << endl;
cout << " 0" << endl;
}
int main() {
int n;
cin >> n;
switch (n) {
case 2: {
tow();
break;
}
case 3: {
three();
break;
}
case 4: {
four();
break;
}
case 5: {
five();
break;
}
case 6: {
six();
break;
}
case 7: {
seven();
break;
}
case 8: {
eight();
break;
}
case 9: {
nine();
break;
}
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int n;
int32_t main() {
ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
cerr << "HELLO WORLD\n";
cin >> n;
if (n == 2) return cout << "2\n", false;
return cout << "1\n", false;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int m = 1000000007;
int a[100001];
long long b[100001];
long long inv[100001];
long long fact[100001];
long long invfact[100001];
long long comb(int x, int y) {
return fact[x] * invfact[y] % m * invfact[x - y] % m;
}
int main() {
int n, l, r, p, i;
long long ans = 1;
vector<pair<int, int> > v;
b[0] = 1;
for (i = 1; i <= 100000; i++) b[i] = b[i - 1] * 2 % m;
inv[1] = 1;
for (i = 2; i <= 100000; i++) inv[i] = inv[m % i] * (m - m / i) % m;
fact[0] = invfact[0] = 1;
for (i = 1; i <= 100000; i++) fact[i] = fact[i - 1] * i % m;
for (i = 1; i <= 100000; i++) invfact[i] = invfact[i - 1] * inv[i] % m;
scanf("%d", &n);
for (i = 0; i < n; i++) {
int x;
scanf("%d", &x);
if (x > 0) {
a[i + 1]++;
v.push_back(make_pair(x, i));
}
}
for (i = 1; i <= n; i++) a[i] += a[i - 1];
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
if (v.size() == 0) {
printf("%d\n", (int)b[n - 1]);
return 0;
}
l = 0, r = n, p = n + 1;
for (i = 0; i < v.size(); i++) {
int x = v[i].second - l + 1;
int y = r - v[i].second;
int z = p - v[i].first;
if (x > z && y > z) {
ans = 0;
break;
}
if (i + 1 == v.size()) {
if (v[i].first == 1) {
ans = ans * comb(z - 1, x - 1) % m;
} else {
long long sum = 0;
if (x <= z) sum = (sum + ans * comb(z - 1, x - 1) % m) % m;
if (y <= z) sum = (sum + ans * comb(z - 1, y - 1) % m) % m;
ans = sum * b[v[i].first - 2] % m;
}
} else {
if (a[v[i].second] - a[l] > 0 && a[r] - a[v[i].second + 1] > 0) {
ans = 0;
break;
}
if (a[v[i].second] - a[l] == 0 && x <= z && a[r] - a[r - z + x] == 0) {
ans = ans * comb(z - 1, x - 1) % m;
l += x;
r -= z - x;
} else if (a[r] - a[v[i].second + 1] == 0 && y <= z &&
a[l + z - y] - a[l] == 0) {
ans = ans * comb(z - 1, y - 1) % m;
l += z - y;
r -= y;
} else {
ans = 0;
break;
}
}
p = v[i].first;
}
printf("%d\n", (int)ans);
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n) {
string s, s1;
cin >> s;
s1 = s;
string ans = s1, tmp;
while (true) {
tmp = s;
tmp += s;
for (int i = 0; i < s.size(); i++)
ans = min(ans, tmp.substr(i, s.size()));
for (int i = 0; i < s.size(); i++) {
s[i]++;
if (s[i] == '9' + 1) s[i] = '0';
}
ans = min(ans, s);
if (s == s1) break;
}
cout << ans << endl;
}
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const long long Nfact = 200005;
const long long mod = 1000000007;
const long long Nsieve = 1000005;
vector<bool> is_prime(Nsieve, true);
vector<long long> spf(Nsieve + 1);
void sieve() {
for (long long i = 1; i < Nsieve + 1; i++) {
spf[i] = i;
}
is_prime[0] = is_prime[1] = false;
for (long long i = 2; i * i <= Nsieve; i++) {
if (is_prime[i]) {
for (long long j = i * i; j <= Nsieve; j += i) {
if (is_prime[j]) spf[j] = i;
is_prime[j] = false;
}
}
}
}
void divisors(vector<long long> &divs, long long x) {
map<long long, long long> mappy;
while (x != 1) {
mappy[spf[x]]++;
x /= spf[x];
}
divs.clear();
divs.push_back(1);
for (auto p : mappy) {
long long len = divs.size();
for (long long q = 0; q < len * p.second; q++) {
divs.push_back(divs[q] * p.first);
}
}
sort(divs.begin(), divs.end());
}
long long bSearch(long long l, long long r, long long x,
vector<long long> arr) {
while (l <= r) {
long long m = l + (r - l) / 2;
if (arr[m] == x) return m;
if (arr[m] < x)
l = m + 1;
else
r = m - 1;
}
return -1;
}
void primeFactors(long long n) {
while (n % 2 == 0) {
n = n / 2;
}
for (long long i = 3; i <= sqrt(n); i += 2) {
while (n % i == 0) {
n = n / i;
}
}
if (n > 2) cout << n << " ";
}
long long power(long long x, long long y, long long p) {
long long res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
long long modulo(long long a, long long b) {
long long c = a % b;
return (c < 0) ? c + b : c;
}
long long mul(long long x, long long y) { return (x * y) % mod; }
long long inv(long long x) { return power(x, mod - 2, mod); }
long long divide(long long x, long long y) { return mul(x, inv(y)); }
long long fact[Nfact];
void precalc() {
fact[0] = 1;
for (long long i = 1; i < Nfact; i++) fact[i] = mul(fact[i - 1], i);
}
long long nCr(long long n, long long k) {
if (n < k) return 0;
return divide(fact[n], mul(fact[k], fact[n - k]));
}
void solve() {
long long n, I;
cin >> n >> I;
vector<long long> vec(n);
for (auto &it : vec) cin >> it;
long long val = (I * 8) / n;
long long K;
if (val <= 19) {
K = 1LL << val;
} else {
cout << 0 << "\n";
return;
}
map<long long, long long> hash;
for (long long i = 0; i < n; i++) {
hash[vec[i]]++;
}
if ((long long)hash.size() <= K) {
cout << 0 << "\n";
return;
}
vector<pair<long long, long long> > res;
for (auto i : hash) {
res.push_back({i.first, i.second});
}
vector<long long> pre((long long)res.size());
pre[0] = res[0].second;
for (long long i = 1; i < (long long)pre.size(); i++) {
pre[i] += pre[i - 1] + res[i].second;
}
long long mini = n;
for (long long i = 0; i < (long long)res.size() - K + 1; i++) {
if (i == 0) {
mini = min(mini, n - pre[i + K - 1]);
} else {
mini = min(mini, n - (pre[i + K - 1] - pre[i - 1]));
}
}
cout << mini << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long t = 1;
while (t--) {
solve();
}
cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs"
<< "\n";
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000 * 1000 * 1000 + 7;
bool sortinrev(long long x, long long y) { return x > y; }
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
long long count = 0;
for (long long i = 0; i < s.length(); i++) {
if (s[i] >= 65 && s[i] <= 90) count++;
}
if (count == s.length()) {
for (long long i = 0; i < s.length(); i++) {
if (s[i] >= 65 && s[i] <= 90) s[i] = s[i] + 32;
}
} else if ((s[0] >= 97 && s[0] <= 122 && count == s.length() - 1)) {
if (s[0] >= 97 && s[0] <= 122) s[0] = s[0] - 32;
for (long long i = 1; i < s.length(); i++) {
if (s[i] >= 65 && s[i] <= 90) s[i] = s[i] + 32;
}
}
cout << s;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int n, sum = 0, sum1 = 0, ans = 0, flag = 1, k = 0, l = 0, in;
cin >> n;
long long int a[n], b[n];
for (long long int i = 0; i < n; i++) {
cin >> a[i];
}
for (long long int i = 0; i < n; i++) {
cin >> b[i];
}
for (long long int i = 0; i < n; i++) {
if (a[i] == 1 && b[i] == 0) {
flag = 0;
break;
}
}
if (flag == 1) {
cout << -1 << endl;
return 0;
}
for (long long int i = 1; i >= 0; i++) {
flag = 1;
sum = 0;
sum1 = 0;
for (long long int j = 0; j < n; j++) {
if (a[j] == 1 && b[j] == 0) sum += i;
if (a[j] == 1 && b[j] == 1) sum += 1;
}
for (long long int j = 0; j < n; j++) {
if (b[j] == 1) sum1 += 1;
}
if (sum > sum1) {
flag = 0;
in = i;
break;
}
}
cout << in << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int count = 2, c = 2, i, a[100005], n;
cin >> n;
cin >> a[0] >> a[1];
for (i = 2; i < n; i++) {
cin >> a[i];
if (a[i] == (a[i - 1] + a[i - 2])) {
c++;
} else {
if (count < c) count = c;
c = 2;
}
}
if (count < c) count = c;
if (n == 1)
cout << "1";
else {
cout << count << endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
const long long INF = 2e18;
using namespace std;
struct item {
long long l, r, type, id;
};
bool comp(item a, item b) {
if (a.l != b.l) return a.l < b.l;
if (a.type == b.type) return a.r < b.r;
return a.type < b.type;
}
int main() {
long long n, m;
cin >> n;
vector<item> v(n);
vector<long long> ans(n, -1);
for (long long i = 0; i < n; i++) {
long long l, r;
cin >> l >> r;
v[i].l = l, v[i].r = r;
v[i].type = 2, v[i].id = i;
}
cin >> m;
v.resize(n + m);
vector<long long> k(m);
for (long long i = 0; i < m; i++) {
long long l, r, kk;
cin >> l >> r >> kk;
v[i + n].l = l, v[i + n].r = r;
k[i] = kk;
v[i + n].type = 1, v[i + n].id = i;
}
sort(v.begin(), v.end(), comp);
set<pair<long long, long long> > st;
for (long long i = 0; i < n + m; i++) {
if (v[i].type == 1)
st.insert({v[i].r, v[i].id});
else {
long long isp = -1;
auto it = st.lower_bound({v[i].r, 0});
if (it != st.end()) {
isp = (*it).second;
k[isp]--;
if (k[isp] == 0) st.erase(it);
}
if (isp == -1) {
cout << "NO\n";
return 0;
}
ans[v[i].id] = isp;
}
}
cout << "YES\n";
for (long long i = 0; i < ans.size(); i++) cout << ans[i] + 1 << ' ';
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
const int N = 103;
int t, n, k, a[N], cnt[N];
vector<int> v;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> t;
while (t--) {
cin >> n >> k;
v.clear();
for (int i = 1; i <= n; ++i) cnt[i] = 0;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
if (cnt[a[i]] == 0) v.push_back(a[i]);
++cnt[a[i]];
}
if ((int)v.size() > k) {
cout << "-1\n";
continue;
}
vector<int> res;
for (int _ = 0; _ < n; ++_) {
for (int i = 0; i < k; ++i)
if (i < (int)v.size())
res.push_back(v[i]);
else
res.push_back(1);
}
cout << res.size() << "\n";
for (int x : res) cout << x << " ";
cout << "\n";
}
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
int circles[90000][6], cnt;
inline void Add(int a, int b, int c, int d) {
++cnt;
circles[cnt][0] = d == 0 ? 3 : 4;
circles[cnt][1] = a;
circles[cnt][2] = b;
circles[cnt][3] = c;
circles[cnt][4] = d;
}
inline void solve(int x) {
if (x <= 2) {
puts("-1");
exit(0);
}
if (x == 4) {
Add(1, 2, 3, 0);
Add(2, 3, 4, 0);
Add(3, 4, 1, 0);
Add(4, 1, 2, 0);
return;
}
if (x == 3) {
Add(1, 2, 3, 0);
Add(1, 2, 3, 0);
return;
}
solve(x - 2);
for (int i = 1; i <= x - 3; i++) Add(x, i, x - 1, i + 1);
Add(x, x - 2, x - 1, 0);
Add(x, 1, x - 1, 0);
}
int main() {
solve(read());
printf("%d\n", cnt);
for (int k = 1; k <= cnt; k++, puts(""))
for (int i = 0; i <= circles[k][0]; i++) printf("%d ", circles[k][i]);
return 0;
}
| 10 |
#include <bits/stdc++.h>
using namespace std;
long long n, a1, a2, sa, M = 3e5, ak, s1[300005], s2[300005];
void f1(long long p, long long q) {
while (p <= M) {
s1[p] += q;
p += (p & -p);
}
}
void f2(long long p, long long q) {
while (p <= M) {
s2[p] += q;
p += (p & -p);
}
}
long long g1(long long p) {
long long re = 0;
while (p >= 1) {
re += s1[p];
p -= (p & -p);
}
return re;
}
long long g2(long long p) {
long long re = 0;
while (p >= 1) {
re += s2[p];
p -= (p & -p);
}
return re;
}
int main() {
long long i, j, k, t, st, la;
cin >> n;
for (k = 1; k <= n; k++) {
scanf("%lld", &ak);
a1 += (k - 1) * ak;
a1 -= g1(ak);
a2 += sa;
st = 0;
for (i = 0;; i++) {
la = min((i + 1) * ak - 1, M);
t = g2(la);
a2 -= (t - st) * ak * i;
st = t;
if ((i + 1) * ak - 1 >= M) break;
}
sa += ak;
for (i = 1; i * ak <= M; i++) {
f1(i * ak, ak);
}
f2(ak, 1);
printf("%lld ", a1 + a2);
}
return 0;
}
| 7 |
#include <bits/stdc++.h>
const int N = 2e6, inf = 1e9 + 7;
using namespace std;
int n, m, a[N], b[N];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
for (int i = 1; i <= m; ++i) scanf("%d", &b[i]);
sort(a + 1, a + n + 1);
sort(b + 1, b + m + 1);
if (a[n] > b[1]) {
puts("-1");
return 0;
}
long long ans = 0;
if (a[n] == b[1]) {
for (int i = 1; i <= m; ++i) ans += b[i];
for (int i = 1; i <= n - 1; ++i) ans += (long long)a[i] * m;
} else {
if (n == 1) {
puts("-1");
return 0;
}
for (int i = 1; i <= m; ++i) ans += b[i];
for (int i = 1; i <= n - 1; ++i) ans += (long long)a[i] * m;
ans += a[n] - a[n - 1];
}
printf("%lld\n", ans);
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 5;
int n, m;
int color[maxn];
int red, blue;
int ans;
vector<int> G[maxn];
pair<int, int> dfs(int pre, int now) {
int bl = 0, re = 0;
if (color[now] == 1) ++re;
if (color[now] == 2) ++bl;
for (int i = 0; i < G[now].size(); ++i) {
int to = G[now][i];
if (to == pre) continue;
pair<int, int> t = dfs(now, to);
ans += (t.first == red && t.second == 0);
ans += (t.first == 0 && t.second == blue);
bl += t.second;
re += t.first;
}
return make_pair(re, bl);
}
int main() {
ios::sync_with_stdio(0);
cin >> n;
m = n - 1;
for (int i = 1; i <= n; ++i) {
cin >> color[i];
if (color[i] == 1) ++red;
if (color[i] == 2) ++blue;
}
for (int i = 1; i <= m; ++i) {
int a, b;
cin >> a >> b;
G[a].push_back(b);
G[b].push_back(a);
}
dfs(0, 1);
cout << ans << endl;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
cin >> t;
while (t--) {
string s;
long long n;
cin >> n >> s;
long long cnt = 0;
long long mn = 2 * n, mx = -1;
for (long long i = 0; i < n; i++) {
if (s[i] == '1') {
cnt++;
mn = min(mn, i);
mx = max(mx, i);
}
}
if (!cnt) {
cout << n << "\n";
} else if (cnt == 1) {
long long a = n + 1;
long long b = 2 * (mx + 1);
long long c = 2 * (n - mx);
long long ans = max(a, b);
cout << max(ans, c);
cout << "\n";
} else {
long long a = 2 * (mx + 1);
long long b = 2 * (n - mn);
cout << max(a, b);
cout << "\n";
}
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
bool isPrime(long long n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (long long i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
long long nextPrime(long long N) {
if (N <= 1) return 2;
long long prime = N;
bool found = false;
while (!found) {
prime++;
if (isPrime(prime)) found = true;
}
return prime;
}
long long fact(long long n) {
if (n == 1) return 1;
return n * fact(n - 1);
}
long long cl(long long n, long long d) { return (n + d - 1) / d; }
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a * b) / (gcd(a, b)); }
long long Pow(long long x, long long n, long long p) {
long long ans = 1;
while (n) {
if (n & 1) ans = (ans * x) % p;
x = (x * x) % p;
n >>= 1;
}
return ans;
}
void solve() {
long long cur, x;
cin >> cur >> x;
if (cur == 0) {
cout << 0;
return;
}
if (x == 0) {
cout << ((2ll) * cur) % 1000000007;
return;
}
long long y = Pow(2, x, 1000000007);
y = ((2ll) * y) % 1000000007;
y = ((y % 1000000007) * (cur % 1000000007)) % 1000000007;
long long xx = Pow(2, x, 1000000007);
xx = (xx - 1 + 1000000007) % 1000000007;
cout << (y - xx + 1000000007) % 1000000007;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long t;
t = 1;
while (t--) {
solve();
}
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace ::std;
int main() {
int n, m, p;
scanf("%d", &n);
scanf("%d", &m);
scanf("%d", &p);
vector<int> a(n, 0);
vector<int> b(n, 0);
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
a[i] = x;
}
map<int, int> mp = map<int, int>();
for (int i = 0; i < m; i++) {
int x;
scanf("%d", &x);
mp[x]++;
}
vector<int> ans = vector<int>();
for (int i = 0; i < p; i++) {
if (i >= n) break;
uint64_t idx = (uint64_t)i + (uint64_t)(m - 1) * (uint64_t)p;
if (idx >= (uint64_t)n) break;
map<int, int> np = map<int, int>();
int cnt = 0;
int j = i;
for (; j <= idx; j += p) {
int x = a[j];
if (mp[x] == 0) continue;
np[x]++;
if (np[x] <= mp[x]) cnt++;
}
if (cnt == m) ans.push_back(j - m * p);
while (j < n) {
int x = a[j];
int y = a[j - m * p];
if (mp[x] > 0) {
np[x]++;
if (np[x] <= mp[x]) cnt++;
}
if (mp[y] > 0) {
np[y]--;
if (np[y] < mp[y]) cnt--;
}
j += p;
if (cnt == m) ans.push_back(j - m * p);
}
}
printf("%d\n", (int)ans.size());
std::sort(ans.begin(), ans.end());
for (int i = 0; i < ans.size(); i++) printf("%d ", 1 + ans[i]);
printf("\n");
}
| 5 |
#include <bits/stdc++.h>
template <typename sp>
inline void qread(sp &x) {
char ch = getchar(), lst = ' ';
while (ch < '0' || ch > '9') lst = ch, ch = getchar();
while (ch >= '0' && ch <= '9')
x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
if (lst == '-') x = -x;
}
int t, x;
int main() {
qread(t);
while (t--) {
x = 0;
qread(x);
int e = ((x - 1) / 4) + 1;
for (register int i = 1; i <= x - e; i++) printf("9");
for (register int i = 1; i <= e; i++) printf("8");
puts("");
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
template <class T>
int getbit(T s, int i) {
return (s >> i) & 1;
}
template <class T>
T onbit(T s, int i) {
return s | (T(1) << i);
}
template <class T>
T offbit(T s, int i) {
return s & (~(T(1) << i));
}
template <class T>
int cntbit(T s) {
return __builtin_popcount(s);
}
template <class T>
T gcd(T a, T b) {
T r;
while (b != 0) {
r = a % b;
a = b;
b = r;
}
return a;
}
template <class T>
T lcm(T a, T b) {
return a / gcd(a, b) * b;
}
using namespace std;
const int MAXN = 1e5 + 100;
const int MOD = 1e9 + 7;
const double eps = 1e-12;
const long long INF = 1e16;
inline string toStr(long long x) {
string tmp = "";
do tmp = char(x % 10 + '0') + tmp;
while (x /= 10);
return tmp;
}
inline long long toInt(string s) {
long long res = 0;
for (auto x : s) res = res * 10 + x - '0';
return res;
}
vector<int> a, b, ans[MAXN];
bool done[MAXN];
int n;
unordered_map<int, int> Rank, pos;
set<int> S;
int main() {
scanf("%d", &n);
a.resize(n), b.resize(n);
for (int i = 0, _a = (n); i < _a; ++i) {
scanf("%d", &a[i]);
S.insert(a[i]);
b[i] = a[i], pos[a[i]] = i;
}
int res = 0;
sort(begin(a), end(a));
for (int i = 0, _a = (n); i < _a; ++i) Rank[a[i]] = i;
while (!S.empty()) {
int x = *S.begin();
if (done[pos[x]]) {
S.erase(x);
continue;
}
++res;
done[pos[x]] = true;
ans[res].push_back(pos[x] + 1);
while (!S.empty()) {
S.erase(x);
if (done[Rank[x]]) {
break;
}
done[Rank[x]] = true;
ans[res].push_back(pos[b[Rank[x]]] + 1);
x = b[Rank[x]];
}
}
printf("%d\n", res);
for (int i = 0, _a = (res); i < _a; ++i) {
printf("%d ", ans[i + 1].size());
for (auto x : ans[i + 1]) printf("%d ", x);
puts("");
}
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int a[5001];
char aa[] = "abcdefghijklmnopqrstuvwxyz";
int main() {
int n;
cin >> n;
string s;
vector<string> a;
for (int i = 0; i < n; i++) {
cin >> s;
a.push_back(s);
}
int count = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
count = 0;
for (int j = i + 1; j < n; j++) {
if (a[i] == a[j]) count++;
}
count++;
ans = max(ans, count);
}
cout << ans << endl;
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
string s[3];
int l[3];
int a[101][101][101];
int go(int x, int y, int z) {
if (a[x][y][z] != -1) return a[x][y][z];
if (z == l[2]) return -1e9;
if (x == l[0] || y == l[1]) return 0;
int &r = a[x][y][z];
r = 0;
r = max(r, go(x + 1, y, z));
r = max(r, go(x, y + 1, z));
if (s[0][x] == s[1][y]) {
string b = s[2].substr(0, z) + s[0].substr(x, 1);
int c = 0;
for (int i = 1; i <= b.length(); i++) {
if (b.substr(b.length() - i, i) == s[2].substr(0, i)) c = i;
}
r = max(r, go(x + 1, y + 1, c) + 1);
}
return r;
}
void go1(int x, int y, int z) {
if (x == l[0] || y == l[1] || z == l[2] || a[x][y][z] == -1) return;
if (a[x][y][z] == a[x + 1][y][z])
go1(x + 1, y, z);
else if (a[x][y][z] == a[x][y + 1][z])
go1(x, y + 1, z);
else if (a[x][y][z] > 0) {
string b = s[2].substr(0, z) + s[0].substr(x, 1);
int c = 0;
for (int i = 1; i <= b.length(); i++) {
if (b.substr(b.length() - i, i) == s[2].substr(0, i)) c = i;
}
printf("%c", s[0][x]);
go1(x + 1, y + 1, c);
}
}
int main() {
for (int i = 0; i < 3; i++) {
getline(cin, s[i]);
l[i] = s[i].length();
}
memset(a, -1, sizeof(a));
go(0, 0, 0);
if (a[0][0][0] == 0) {
printf("0\n");
return 0;
}
go1(0, 0, 0);
printf("\n");
return 0;
}
| 6 |
#include <bits/stdc++.h>
#define forr(i,a,b) for(int i=(a);i<(b);i++)
#define forn(i,n) forr(i,0,n)
#define dforn(i,n) for(int i=n-1;i>=0;i--)
#define forall(it,v) for(auto it=v.begin();it!=v.end();it++)
#define sz(c) ((int)c.size())
#define rsz resize
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define fst first
#define snd second
#ifdef ANARAP
#define MAXN 4005
#else
#define MAXN 400005
#endif
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
int n,m;
vector<int> dist, cant;
int d[MAXN];
vector<int> G[MAXN],gt[MAXN]; //Limpiar si se corre mas de una vez
set<int> g[MAXN];
//nodos 0...N-1 ; componentes 0...cantcomp-1
int comp[MAXN],N,cantcomp,used[MAXN];
stack<int> pila;
int cont = 0;
void add(int a, int b){ G[a].pb(b);gt[b].pb(a);}
void dfs1(int nodo)
{
used[nodo]=1;
forall(it,G[nodo]) if(!used[*it]) dfs1(*it);
pila.push(nodo);
}
void dfs2(int nodo)
{
used[nodo]=2;
comp[nodo]=cantcomp-1;
forall(it,gt[nodo]) if(used[*it]!=2) dfs2(*it);
}
void kosaraju()
{
cantcomp=0;
memset(used,0,sizeof(used));
forn(i,N) if(!used[i]) dfs1(i);
while(!pila.empty())
{
if(used[pila.top()]!=2)
{
cantcomp++;
dfs2(pila.top());
}
pila.pop();
}
}
void bfs(int node){
forn(i,n) used[i] = 0;
used[node] = 1;
queue<int> q;
q.push(node);
while(!q.empty()){
int aux = q.front();
q.pop();
forall(it, G[aux]){
if(used[*it] == 0){
used[*it] = 1;
q.push(*it);
}
}
}
}
void topsort(int node){
queue<int> q;
q.push(node);
while(!q.empty()){
int aux = q.front();
q.pop();
if(cant[aux] >= 2) dist[aux] = INT_MAX;
else if(dist[aux] == -1) dist[aux] = 1;
forall(it, g[aux]){
d[*it]--;
if(dist[*it] != INT_MAX){
if(dist[aux] == INT_MAX) dist[*it] = INT_MAX;
else dist[*it] = max(0, dist[*it])+ dist[aux];
}
if(d[*it] == 0)q.push(*it);
}
}
}
int main()
{
#ifdef ANARAP
freopen("input.in", "r", stdin);
//freopen("output.out", "w", stdout);
unsigned t0, t1; t0=clock();
#endif
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t; cin >> t;
forn(T,t){
cin >> n >> m;
N=n;
dist.clear();dist.resize(n);
cant.clear(); cant.resize(n);
forn(i,n) dist[i] = -1;
vector<int> setInf;
forn(i,m){
int a,b; cin >> a >> b;
a--; b--;
if(a!=b) add(a,b);
else setInf.pb(a);
}
kosaraju();
bfs(0);
forn(i,n) d[i] = 0;
forall(it, setInf) if(used[*it]) dist[comp[*it]] = INT_MAX;
forn(i,n){
if(used[i]){
cant[comp[i]]++;
forall(it, G[i]) if(comp[*it] != comp[i])
{
if(g[comp[i]].count(comp[*it])) continue;
g[comp[i]].insert(comp[*it]);
d[comp[*it]]++;
}
}
}
topsort(comp[0]);
forn(i,n) assert(d[comp[i]] == 0);
forn(i,n){
cont++;
if(dist[comp[i]] == -1) cout << 0 << " ";
else if(dist[comp[i]] == 1) cout << 1 << " ";
else if(dist[comp[i]] == INT_MAX) cout << -1 << " ";
else cout << 2 << " ";
}
cout << '\n';
forn(i,n) G[i].clear(), gt[i].clear(), g[i].clear();
}
#ifdef ANARAP
t1 = clock();double time = (double(t1-t0)/CLOCKS_PER_SEC); cout << "Execution Time: " << time << endl;
#endif
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 5;
const int MOD = 1e9 + 7;
const int MAX = 1e5 + 5;
bool comp1(string s) {
if (s.size() == 3) {
return true;
}
return false;
}
bool comp(string a, string b) {
if (a[0] == '.' && a[1] == '.' && a.size() == 2) {
return true;
}
return false;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
stack<string> a;
while (t--) {
string s;
cin >> s;
if (comp1(s)) {
vector<string> ans;
while (!a.empty()) {
ans.push_back(a.top());
a.pop();
}
reverse(ans.begin(), ans.end());
cout << "/";
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << "/";
}
cout << '\n';
for (int i = 0; i < ans.size(); ++i) {
a.push(ans[i]);
}
} else {
cin >> s;
string h;
int i = (s[0] == '/') ? 1 : 0;
if (s[0] == '/') {
while (!a.empty()) {
a.pop();
}
}
while (s[i] != '\0') {
if (s[i] == '/') {
if (comp(h, "..")) {
a.pop();
} else {
a.push(h);
}
h.clear();
} else {
h.push_back(s[i]);
}
++i;
}
if (!h.empty()) {
if (!comp(h, ".."))
a.push(h);
else {
a.pop();
}
h.clear();
}
}
}
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long ans = 0;
for (int i = (0); i < (n); ++i) {
long long t, T, x, cost;
cin >> t >> T >> x >> cost;
if (t >= T) {
ans += cost + m * x;
continue;
}
long long aux1 = cost;
if (m > (T - t)) aux1 += m * x;
long long aux2 = (long long)ceil((double)(m - (T - t)) / (T - t)) + 1;
aux2 *= cost;
ans += min(aux1, aux2);
}
cout << ans << endl;
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
using ll = long long;
int a[N], n;
ll m;
bool check(int k) {
ll sum = 0;
for (int i = 1, cnt = 0, d = 0; i <= n; ++i) {
sum += max(0, a[i] - d);
cnt++;
if (cnt % k == 0) d++;
}
return sum >= m;
}
int main() {
scanf("%d%lld", &n, &m);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
sort(a + 1, a + 1 + n);
reverse(a + 1, a + 1 + n);
int l = 1, r = n + 1, mid, ans = -1;
while (l < r) {
if (check(mid = (l + r) / 2))
ans = mid, r = mid;
else
l = mid + 1;
}
printf("%d\n", ans);
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 3e5 + 5;
int n, f[N];
string s, res;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> s;
s = ' ' + s;
long long cnt = 0;
queue<int> q;
for (int i = 1; i <= n; i++) {
if (s[i] == '(')
cnt++;
else if (s[i] == ')') {
cnt--;
if (cnt < 0 && q.empty()) return cout << ":(", 0;
if (cnt < 0) s[q.front()] = '(', cnt++, q.pop();
} else
q.push(i);
}
for (int i = n; i >= 1; i--) {
if (cnt > 0 && s[i] == '?') cnt--, s[i] = ')';
}
s.erase(s.begin(), s.begin() + 1);
long long xx = 0;
for (char x : s) xx += (x == '?');
int x = xx;
cnt = 0;
int i = 0;
for (char &ch : s) {
i++;
if (ch == '?') {
if (x > xx / 2)
ch = '(', x--;
else
ch = ')';
}
if (ch == '(')
cnt++;
else
cnt--;
if (cnt < 0 || (cnt == 0 && i < n)) return cout << ":(", 0;
}
if (cnt != 0)
cout << ":(";
else
cout << s;
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T& a) {
a = 0;
char c;
bool _MINUS_ = false;
while (!isdigit(c = getchar())) _MINUS_ |= c == '-';
do a = a * 10 + (c - '0');
while (isdigit(c = getchar()));
if (_MINUS_) a *= -1;
}
string world[8] = {"U", "D", "R", "L", "UL", "UR", "DR", "DL"};
const int rx[8] = {-1, 1, 0, 0, -1, -1, 1, 1};
const int ry[8] = {0, 0, 1, -1, -1, 1, 1, -1};
const long long mod = 1000000007;
int main() {
ios_base::sync_with_stdio(0);
int n, p;
cin >> n >> p;
int a[3] = {0, 0, 0};
a[p] = 1;
if (n & 1) {
swap(a[0], a[1]);
n--;
}
if (n == 0) {
for (int i = 0; i < 3; i++) {
if (a[i] == 1) {
cout << i << endl;
break;
}
}
return 0;
}
n %= 6;
while (n > 0) {
if (n & 1) {
swap(a[0], a[1]);
} else {
swap(a[1], a[2]);
}
n--;
}
if (n == 0) {
for (int i = 0; i < 3; i++) {
if (a[i] == 1) {
cout << i << endl;
break;
}
}
return 0;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
set<int> let;
int main() {
iostream::sync_with_stdio();
cin.tie(0);
string s;
cin >> s;
int n;
cin >> n;
for (int i = 0; i < (int)(s.size()); ++i) {
let.insert(s[i]);
}
if (s.size() < n)
cout << "impossible";
else {
cout << max(0, (int)n - (int)let.size());
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e6 + 10;
const int inf = 0x7fffffff;
int n;
vector<pair<int, int> > quy[maxn];
int val[maxn];
int tep[maxn], pre[maxn], last[maxn];
int ans[maxn];
void update(int v, int l, int r, int pos) {
if (l == r) {
tep[v] = l;
return;
}
int mid = (l + r) / 2;
if (pos <= mid) {
update(2 * v, l, mid, pos);
} else
update(2 * v + 1, mid + 1, r, pos);
if (pre[tep[2 * v]] < pre[tep[2 * v + 1]])
tep[v] = tep[2 * v];
else
tep[v] = tep[2 * v + 1];
return;
}
int query(int v, int l1, int r1, int l, int r) {
if (l <= l1 && r1 <= r) return tep[v];
int mid = (l1 + r1) / 2;
int a = -1, b = -1, ans = inf;
if (l <= mid) a = query(2 * v, l1, mid, l, r);
if (mid < r) b = query(2 * v + 1, mid + 1, r1, l, r);
if (a == -1)
return b;
else if (b == -1 || pre[a] < pre[b])
return a;
else
ans = b;
return ans;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &val[i]);
pre[i] = last[val[i]];
last[val[i]] = i;
}
int q;
scanf("%d", &q);
for (int i = 1; i <= q; i++) {
int l, r;
scanf("%d %d", &l, &r);
quy[r].push_back(make_pair(l, i));
}
for (int i = 1; i <= n; i++) {
if (pre[i] > 0) {
pre[pre[i]] = inf;
update(1, 1, n, pre[i]);
}
update(1, 1, n, i);
vector<pair<int, int> >::iterator iter;
for (iter = quy[i].begin(); iter != quy[i].end(); iter++) {
int tem = query(1, 1, n, iter->first, i);
if (pre[tem] < iter->first) ans[iter->second] = val[tem];
}
}
for (int i = 1; i <= q; i++) printf("%d\n", ans[i]);
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 150 + 6.66;
int dp[MAXN][MAXN][MAXN];
int rm[MAXN][MAXN];
int ans[MAXN][MAXN];
int C[MAXN];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
for (int i = 1; i <= n; i++) cin >> C[i];
string str;
cin >> str;
int mx = 0;
for (int r = 0; r < n; r++) {
for (int l = 0; l < n; l++) {
for (int len = 0; len <= n; len++) dp[l][r][len] = -1;
if (l <= r) rm[l][r] = -1;
}
}
for (int r = 0; r < n; r++)
for (int l = r; l >= 0; l--) {
if (r == l)
dp[l][r][1] = 0;
else {
dp[l][r][1] = max({dp[l][r][1], rm[l + 1][r], rm[l][r - 1]});
for (int i = l + 1; i < r; i++)
dp[l][r][1] = max(dp[l][r][1], rm[l][i - 1] >= 0 && rm[i + 1][r] >= 0
? rm[l][i - 1] + rm[i + 1][r]
: -1);
}
rm[l][r] = max(rm[l][r],
dp[l][r][1] >= 0 && C[1] >= 0 ? dp[l][r][1] + C[1] : -1);
for (int len = 2; len <= r - l + 1; len++) {
if (str[r] == str[l])
dp[l][r][len] = (r - l + 1 > 2 ? dp[l + 1][r - 1][len - 2] : 0);
for (int mid = l; mid < r; mid++)
dp[l][r][len] = max(
{dp[l][r][len],
dp[l][mid][len] >= 0 && rm[mid + 1][r] >= 0 && mid - l + 1 >= len
? dp[l][mid][len] + rm[mid + 1][r]
: -1,
dp[mid + 1][r][len] >= 0 && rm[l][mid] >= 0 && r - mid >= len
? dp[mid + 1][r][len] + rm[l][mid]
: -1});
if (C[len] >= 0) {
rm[l][r] =
max(rm[l][r], dp[l][r][len] >= 0 ? C[len] + dp[l][r][len] : -1);
}
}
dp[l][r][0] = rm[l][r];
ans[l][r] = max(rm[l][r], 0);
for (int i = l; i < r; i++)
ans[l][r] = max(ans[l][r], ans[l][i] + ans[i + 1][r]);
}
cout << ans[0][n - 1] << endl;
return 0;
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
long long mod(long long a, long long b) { return (a % b + b) % b; }
long long power(long long base, long long exp) {
long long res = 1;
while (exp > 0) {
if (exp % 2 == 1) res = (res * base);
base = (base * base);
exp /= 2;
}
return res;
}
int main() {
std::ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
long long t, n, x;
cin >> t;
while (t--) {
cin >> n;
vector<long long> v;
for (long long i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
long long a[n];
for (long long i = n - 1; i >= 0; i--) {
long long back_up = 0;
for (long long j = i; j < n; j++) {
if (j == i)
a[j] = 1;
else if (v[i] == v[j]) {
long long temp = a[j];
a[j] = back_up + 2;
back_up = temp;
} else {
back_up = a[j];
a[j] = max(a[j - 1], a[j]);
}
}
}
long long ans = a[n - 1];
if (ans >= 3)
cout << "YES" << '\n';
else
cout << "NO" << '\n';
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
char s1[2000000], s2[2000000];
int error, l, r, len, cur, pos;
int main() {
gets(s1);
gets(s2);
len = strlen(s1);
for (int i = 0; i < len; ++i)
if (s1[i] == s2[cur])
cur++;
else {
if (error > 0) {
putchar('0');
return 0;
}
error++;
pos = i;
}
if (error == 0) pos = len - 1;
l = pos;
while (l >= 0 && s1[l] == s1[pos]) l--;
l++;
r = pos;
while (r < len && s1[r] == s1[pos]) r++;
r--;
l++;
r++;
printf("%d\n", r - l + 1);
for (int i = l; i <= r; ++i) printf("%d ", i);
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int S = 13;
const int Full = (1 << S) - 1;
int prime[50] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41,
43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97},
tot = 25;
char block[800][1 << S][25];
int mm[10010][26], to[100000];
unsigned long long all[15][15][16][200];
unsigned long long tmp[200];
int tmp2[25];
int ans[25];
int key(char c) {
if (c >= '0' && c <= '9') return c - '0';
return c - 'A' + 10;
}
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
long long x;
scanf("%lld", &x);
for (int j = 0; j < tot; j++) {
mm[i][j] = x % prime[j];
}
}
for (int i = 0; i < S; i++) {
to[1 << i] = i;
}
for (int i = 0; i < n; i += S) {
int s = min(S, n - i);
for (int j = 0; j < 25; j++) {
block[i / S][0][j] = 1;
}
for (int mask = 1; mask < (1 << s); mask++) {
int lowbit = mask & -mask;
for (int j = 0; j < 25; j++) {
block[i / S][mask][j] =
block[i / S][mask - lowbit][j] * mm[i + to[lowbit]][j] % prime[j];
}
}
}
for (int d = 2; d <= 16; d++) {
int pw = 1;
for (int j = 0; pw < n; j++, pw *= d) {
for (int i = 0; i < n; i++) {
int val = 0, len = 0, x = i, cnt = 0;
while (x) {
if (j == cnt) val = x % d;
x /= d, len++, cnt++;
}
all[d - 2][j][val][i / (4 * S)] |= 1ull << (i % (4 * S));
}
}
}
int q;
scanf("%d", &q);
while (q--) {
int d;
char s[50];
long long a;
scanf("%d", &d);
scanf("%s", s), scanf("%lld", &a);
int m = strlen(s);
for (int j = 0; j < tot; j++) {
ans[j] = a % prime[j];
}
for (int j = 0; j <= ((n - 1) / (4 * S)); j++) {
tmp[j] = (1ull << 4 * S) - 1;
}
long long pw = 1;
for (int i = m - 1; i >= 0; i--) {
if (pw >= n) {
if (s[i] != '?' && s[i] != '0') {
for (int j = 0; j <= ((n - 1) / (4 * S)); j++) {
tmp[j] = 0;
}
}
continue;
}
pw *= d;
if (s[i] == '?') continue;
int val = key(s[i]);
for (int j = 0; j <= ((n - 1) / (4 * S)); j++) {
tmp[j] &= all[d - 2][m - i - 1][val][j];
}
}
int nn = m;
while (pw < n) {
for (int j = 0; j <= ((n - 1) / (4 * S)); j++) {
tmp[j] &= all[d - 2][nn][0][j];
}
pw *= d, nn++;
}
for (int k = 0; k < 25; k++) {
tmp2[k] = 1;
}
for (int j = 0; j <= ((n - 1) / (4 * S)); j++) {
int be = j * 4 * S, pp = be / S;
for (int k = 0; k < 25; k++) {
if (n - be > 0)
tmp2[k] =
tmp2[k] * block[pp][tmp[j] & ((1 << min(S, n - be)) - 1)][k];
if (n - be - S > 0)
tmp2[k] =
tmp2[k] *
block[pp + 1][tmp[j] >> S & ((1 << min(S, n - be - S)) - 1)][k];
tmp2[k] -= tmp2[k] / prime[k] * prime[k];
if (n - be - 2 * S > 0)
tmp2[k] =
tmp2[k] * block[pp + 2][tmp[j] >> 2 * S &
((1 << min(S, n - be - 2 * S)) - 1)][k];
if (n - be - 3 * S > 0)
tmp2[k] =
tmp2[k] * block[pp + 3][tmp[j] >> 3 * S &
((1 << min(S, n - be - 3 * S)) - 1)][k];
tmp2[k] -= tmp2[k] / prime[k] * prime[k];
}
}
int pos = 0;
while (pos < tot && (ans[pos] + tmp2[pos]) % prime[pos] != 0) pos++;
if (pos == tot)
printf("-1\n");
else
printf("%d\n", prime[pos]);
}
return 0;
}
| 11 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,fma,tune=native")
namespace mem {
namespace stdval {
using i32 = int;
using i64 = long long;
using u32 = unsigned int;
using u64 = unsigned long long;
using f32 = float;
using f64 = double;
using i128 = __int128_t;
using u128 = __uint128_t;
} // namespace stdval
namespace utils {
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
using std::function;
using std::swap;
using std::tie;
} // namespace utils
namespace io {
namespace fastio {
const int BUFFER = 1 << 21;
char ibuf[BUFFER], *iS, *iT;
inline int getc() {
if (iS == iT) {
iT = (iS = ibuf) + fread(ibuf, 1, BUFFER, stdin);
return iS == iT ? EOF : *iS++;
} else {
return *iS++;
}
}
char obuf[BUFFER], *oS = obuf, *oT = oS + BUFFER - 1;
inline void flush() {
fwrite(obuf, 1, oS - obuf, stdout);
oS = obuf;
}
inline void putc(int x) {
*oS++ = x;
if (oS == oT) flush();
}
struct Flusher {
~Flusher() { flush(); }
} flusher;
} // namespace fastio
using fastio::getc;
using fastio::putc;
template <class T>
inline void readDigit(T &x) {
x = getc();
while (!isdigit(x)) x = getc();
}
inline int readDigit() {
int x;
readDigit(x);
return x;
}
template <class T>
inline void readAlpha(T &x) {
x = getc();
while (!isalpha(x)) x = getc();
}
inline int readAlpha() {
int x;
readAlpha(x);
return x;
}
template <class T>
inline void readInt(T &x) {
x = 0;
bool f = 0;
char c = getc();
while (!isdigit(c)) f ^= c == '-', c = getc();
while (isdigit(c)) x = x * 10 + c - '0', c = getc();
if (f) x = -x;
}
inline void read(int &x) {
x = 0;
char c = getc();
while (!isdigit(c)) c = getc();
while (isdigit(c)) x = x * 10 + c - '0', c = getc();
}
inline void read(unsigned int &x) {
x = 0;
char c = getc();
while (!isdigit(c)) c = getc();
while (isdigit(c)) x = x * 10 + c - '0', c = getc();
}
inline void read(long long &x) {
x = 0;
char c = getc();
while (!isdigit(c)) c = getc();
while (isdigit(c)) x = x * 10 + c - '0', c = getc();
}
inline void read(unsigned long long &x) {
x = 0;
char c = getc();
while (!isdigit(c)) c = getc();
while (isdigit(c)) x = x * 10 + c - '0', c = getc();
}
inline void read(char &x) { x = getc(); }
template <class T>
inline T read() {
T x;
read(x);
return x;
}
template <class T, class... Args>
inline void read(T &x, Args &...args) {
read(x), read(args...);
}
inline void print(int x) {
if (x < 0) putc('-'), x = -x;
if (x > 9) print(x / 10);
putc('0' + x % 10);
}
inline void print(unsigned int x) {
if (x < 0) putc('-'), x = -x;
if (x > 9) print(x / 10);
putc('0' + x % 10);
}
inline void print(long long x) {
if (x < 0) putc('-'), x = -x;
if (x > 9) print(x / 10);
putc('0' + x % 10);
}
inline void print(unsigned long long x) {
if (x < 0) putc('-'), x = -x;
if (x > 9) print(x / 10);
putc('0' + x % 10);
}
inline void print(char x) { putc(x); }
inline void print(const char *s) {
int len = strlen(s);
for (int i = 0; i < len; i++) putc(s[i]);
}
inline void print(const std::string &s) {
for (int i = 0; i < s.length(); i++) putc(s[i]);
}
template <class T, class... Args>
inline void print(const T &x, Args... args) {
print(x), print(args...);
}
template <class... Args>
inline void println(Args... args) {
print(args...), putchar('\n');
}
} // namespace io
namespace random {
const int LuckyNumber = 20040725;
std::mt19937 rng(LuckyNumber ^
std::chrono::steady_clock::now().time_since_epoch().count());
std::mt19937_64 rng64(
LuckyNumber ^ std::chrono::steady_clock::now().time_since_epoch().count());
template <class T>
inline T rand(T l, T r) {
return std::uniform_int_distribution<T>(l, r)(rng);
}
template <class T>
inline T rand64(T l, T r) {
return std::uniform_int_distribution<T>(l, r)(rng);
}
} // namespace random
namespace modint {
template <const int mod>
struct Z {
int x;
inline Z() { x = 0; }
inline Z(int t) { x = t; }
inline void operator-=(Z a) { (x -= a.x) < 0 && (x += mod); }
inline void operator+=(Z a) { (x += a.x) >= mod && (x -= mod); }
inline void operator*=(Z a) { x = (long long)x * a.x % mod; }
friend inline Z operator*(Z a, Z b) { return (long long)a.x * b.x % mod; }
friend inline Z operator-(Z a, Z b) {
return ((a.x -= b.x) < 0 && (a.x += mod)), a;
}
friend inline Z operator+(Z a, Z b) {
return ((a.x += b.x) >= mod && (a.x -= mod)), a;
}
};
template <const int mod>
inline Z<mod> finv(Z<mod> x) {
if (x.x < 2) return x;
return (mod - mod / x.x) * finv(mod % x.x);
}
template <const int mod>
inline Z<mod> fpow(Z<mod> a, int b) {
Z<mod> s = 1;
for (; b; b >>= 1, a = a * a)
if (b & 1) s = s * a;
return s;
}
template <const int mod>
inline void init_inverse(int n, Z<mod> *inv) {
inv[0] = inv[1] = 1;
for (int i = 2; i < n; i++) inv[i] = (mod - mod / i) * inv[mod % i];
}
template <const int mod>
inline void init_factorial(int n, Z<mod> *fac, Z<mod> *ifac) {
fac[0] = 1, init_inverse(n, ifac);
for (int i = 1; i < n; i++)
fac[i] = fac[i - 1] * i, ifac[i] = ifac[i - 1] * ifac[i];
}
} // namespace modint
namespace math {
using namespace stdval;
using std::max;
using std::min;
template <class T>
inline T abs(T x) {
return x < 0 ? -x : x;
}
template <class T>
inline T gcd(T n, T m) {
return m ? gcd(m, n % m) : n;
}
template <class T>
inline T lcm(T n, T m) {
return n / gcd(n, m) * m;
}
template <const u64 p>
struct FastDiv {
u64 t, i;
inline FastDiv() : t(u64(-1) / p), i(mul_inv(p)) {}
inline bool divide(u64 n) { return n * i <= t; }
inline bool divide(i64 n) { return u64(n < 0 ? -n : n) * i <= t; }
inline u64 mul_inv(u64 n) {
u64 x = n;
for (int i = 0; i < 5; ++i) x *= 2 - n * x;
return x;
}
};
template <const u64 b>
struct FastMod {
u64 m;
inline FastMod() : m(u64((u128(1) << 64) / b)) {}
inline u64 reduce(u64 a) {
u64 q = (u64)((u128(m) * a) >> 64);
u64 r = a - q * b;
return r >= b ? r - b : r;
}
};
} // namespace math
namespace stl {
using std::pair;
template <class T>
struct vector : std::vector<T> {
using std::vector<T>::vector;
vector() : std::vector<T>() {}
vector(const std::vector<T> &plain) : std::vector<T>(plain) {}
inline void read(int s = -1) {
if (~s) this->resize(s);
for (size_t i = 0; i < this->size(); i++) {
io::read(this->operator[](i));
}
}
inline void print(char pt0 = ' ', char pt1 = '\n') {
for (size_t i = 0; i < this->size(); i++) {
io::print(this->operator[](i));
if (i + 1 < this->size()) io::putc(pt0);
}
io::putc(pt1);
}
inline void sort() { std::sort(this->begin(), this->end()); }
inline void concat(const vector &rhs) {
this->insert(this->end(), rhs.begin(), rhs.end());
}
inline bool includes(const T &x) const {
return std::find(this->begin(), this->end(), x) != this->end();
}
inline vector slice(int l, int r) const {
if (l > r) return {};
if (r < this->size()) return vector(this->begin() + l, this->begin() + r);
vector<int> rsp = (this->begin() + l, this->end());
return rsp.resize(r - l), rsp;
}
inline void from(const std::set<T> &src) {
this->resize(src.size());
auto it = this->begin();
for (const T e : src) *it++ = e;
}
template <class Function>
inline void forEach(Function func) {
for (const auto &it : *this) func(it);
}
template <class R, class Function>
inline vector<R> _map(Function func) const {
vector<R> res(this->size());
for (size_t i = 0; i < this->size(); i++)
res[i] = func(this->operator[](i));
return res;
}
template <class R>
inline vector<R> map(R func(T)) const {
return this->_map<R>(func);
}
template <class R>
inline vector<R> map(const std::function<R(T)> &func) const {
return this->_map<R>(func);
}
};
struct string : std::string {
using std::string::string;
string() : std::string("") {}
string(const std::string &plain) : std::string(plain) {}
inline string join(const vector<string> &) const;
inline string join(const std::vector<string> &) const;
template <class T>
inline string join(const vector<T> &) const;
template <class T>
inline string join(const std::vector<T> &) const;
vector<string> split(const string &delim) const {
if (this->empty()) return {};
char *src = new char[this->length() + 1];
strcpy(src, this->c_str());
char *tar = new char[delim.length() + 1];
strcpy(tar, delim.c_str());
vector<string> rsp;
for (char *pos = strtok(src, tar); pos; pos = strtok(nullptr, tar))
rsp.push_back(string(pos));
delete[] src;
delete[] tar;
return rsp;
}
template <class... Args>
static inline string format(const char *fm, Args... args) {
int len = snprintf(nullptr, 0, fm, args...);
char *buf = new char[len + 1];
snprintf(buf, len + 1, fm, args...);
string str(buf);
delete[] buf;
return str;
}
template <class... Args>
static inline string format(const string &fm, Args... args) {
return format(fm.c_str(), args...);
}
};
inline string to_string(const float &x) { return std::to_string(x); }
inline string to_string(const double &x) { return std::to_string(x); }
inline string to_string(const int &x) { return std::to_string(x); }
inline string to_string(const unsigned int &x) { return std::to_string(x); }
inline string to_string(const long long &x) { return std::to_string(x); }
inline string to_string(const unsigned long long &x) {
return std::to_string(x);
}
template <class T>
inline string to_string(const vector<T> &vet) {
return "{" + string(",").join(vet) + "}";
}
template <class T>
inline string to_string(const std::vector<T> &vet) {
return to_string(vector<T>(vet.begin(), vet.end()));
}
template <const int mod>
inline string to_string(const mem::modint::Z<mod> &zval) {
return std::to_string(zval.x);
}
inline string string::join(const vector<string> &vet) const {
if (!vet.size()) return "";
string res = string(vet[0]);
for (size_t i = 1; i < vet.size(); i++) {
res += *this;
res += string(vet[i]);
}
return res;
}
inline string string::join(const std::vector<string> &vet) const {
if (!vet.size()) return "";
string res = string(vet[0]);
for (size_t i = 1; i < vet.size(); i++) {
res += *this;
res += string(vet[i]);
}
return res;
}
template <class T>
inline string string::join(const vector<T> &vet) const {
if (!vet.size()) return "";
string res = to_string(vet[0]);
for (size_t i = 1; i < vet.size(); i++) {
res += *this;
res += to_string(vet[i]);
}
return res;
}
template <class T>
inline string string::join(const std::vector<T> &vet) const {
if (!vet.size()) return "";
string res = to_string(vet[0]);
for (size_t i = 1; i < vet.size(); i++) {
res += *this;
res += to_string(vet[i]);
}
return res;
}
inline void print(const stl::string &s) {
for (size_t i = 0; i < s.length(); i++) mem::io::putc(s[i]);
}
template <class... Args>
inline void printfm(const char *fm, Args... args) {
print(stl::string().format(fm, args...));
}
template <class... Args>
inline void printfm(const string &fm, Args... args) {
print(stl::string().format(fm, args...));
}
template <class... Args>
inline void printfm(const std::string &fm, Args... args) {
print(stl::string().format(fm, args...));
}
} // namespace stl
using namespace io;
using namespace stl;
using namespace math;
using namespace utils;
using namespace modint;
using namespace random;
using namespace stdval;
} // namespace mem
const int N = 5e4 + 10, M = 20;
using namespace mem::io;
int n, q;
int a[N], _a[N], dfn[N], rev[N], pos, val[N], siz[N], _dep[N], dep[N];
int m[M], id[M][N], v[M][N], tim[M][N];
struct Edge {
int v, nxt;
} c[N];
int front[N], edge_cnt;
inline void addedge(int u, int v) {
c[++edge_cnt] = (Edge){v, front[u]};
front[u] = edge_cnt;
}
void dfs(int x) {
dfn[x] = ++pos, rev[pos] = x;
a[pos] = _a[x], siz[x] = 1;
dep[pos] = _dep[x];
for (int i = front[x]; i; i = c[i].nxt) {
int v = c[i].v;
_dep[v] = _dep[x] + 1;
dfs(v);
siz[x] += siz[v];
}
}
int main() {
read(n, q);
for (int i = 1; i <= n; ++i) read(_a[i]);
for (int x, i = 2; i <= n; ++i) read(x), addedge(x, i);
dfs(1);
for (int i = 1; i <= n; i++) {
int u = dep[i];
++m[u];
id[u][m[u]] = i;
tim[u][m[u]] = a[i];
}
for (int x, t = 1; t <= q; ++t) {
read(x);
int L = dfn[x], R = L + siz[x] - 1, l, r;
int a1 = 0, a2 = 0;
l = std::lower_bound(id[0] + 1, id[0] + m[0] + 1, L) - id[0] - 0;
r = std::upper_bound(id[0] + 1, id[0] + m[0] + 1, R) - id[0] - 1;
if (l <= r) {
int cnt = 0;
for (int i = l; i <= r; i++)
if (v[0][i] <= t) {
v[0][i] = t + tim[0][i];
cnt++;
}
a1 += cnt * 0;
a2 += cnt;
};
l = std::lower_bound(id[1] + 1, id[1] + m[1] + 1, L) - id[1] - 0;
r = std::upper_bound(id[1] + 1, id[1] + m[1] + 1, R) - id[1] - 1;
if (l <= r) {
int cnt = 0;
for (int i = l; i <= r; i++)
if (v[1][i] <= t) {
v[1][i] = t + tim[1][i];
cnt++;
}
a1 += cnt * 1;
a2 += cnt;
};
l = std::lower_bound(id[2] + 1, id[2] + m[2] + 1, L) - id[2] - 0;
r = std::upper_bound(id[2] + 1, id[2] + m[2] + 1, R) - id[2] - 1;
if (l <= r) {
int cnt = 0;
for (int i = l; i <= r; i++)
if (v[2][i] <= t) {
v[2][i] = t + tim[2][i];
cnt++;
}
a1 += cnt * 2;
a2 += cnt;
};
l = std::lower_bound(id[3] + 1, id[3] + m[3] + 1, L) - id[3] - 0;
r = std::upper_bound(id[3] + 1, id[3] + m[3] + 1, R) - id[3] - 1;
if (l <= r) {
int cnt = 0;
for (int i = l; i <= r; i++)
if (v[3][i] <= t) {
v[3][i] = t + tim[3][i];
cnt++;
}
a1 += cnt * 3;
a2 += cnt;
};
l = std::lower_bound(id[4] + 1, id[4] + m[4] + 1, L) - id[4] - 0;
r = std::upper_bound(id[4] + 1, id[4] + m[4] + 1, R) - id[4] - 1;
if (l <= r) {
int cnt = 0;
for (int i = l; i <= r; i++)
if (v[4][i] <= t) {
v[4][i] = t + tim[4][i];
cnt++;
}
a1 += cnt * 4;
a2 += cnt;
};
l = std::lower_bound(id[5] + 1, id[5] + m[5] + 1, L) - id[5] - 0;
r = std::upper_bound(id[5] + 1, id[5] + m[5] + 1, R) - id[5] - 1;
if (l <= r) {
int cnt = 0;
for (int i = l; i <= r; i++)
if (v[5][i] <= t) {
v[5][i] = t + tim[5][i];
cnt++;
}
a1 += cnt * 5;
a2 += cnt;
};
l = std::lower_bound(id[6] + 1, id[6] + m[6] + 1, L) - id[6] - 0;
r = std::upper_bound(id[6] + 1, id[6] + m[6] + 1, R) - id[6] - 1;
if (l <= r) {
int cnt = 0;
for (int i = l; i <= r; i++)
if (v[6][i] <= t) {
v[6][i] = t + tim[6][i];
cnt++;
}
a1 += cnt * 6;
a2 += cnt;
};
l = std::lower_bound(id[7] + 1, id[7] + m[7] + 1, L) - id[7] - 0;
r = std::upper_bound(id[7] + 1, id[7] + m[7] + 1, R) - id[7] - 1;
if (l <= r) {
int cnt = 0;
for (int i = l; i <= r; i++)
if (v[7][i] <= t) {
v[7][i] = t + tim[7][i];
cnt++;
}
a1 += cnt * 7;
a2 += cnt;
};
l = std::lower_bound(id[8] + 1, id[8] + m[8] + 1, L) - id[8] - 0;
r = std::upper_bound(id[8] + 1, id[8] + m[8] + 1, R) - id[8] - 1;
if (l <= r) {
int cnt = 0;
for (int i = l; i <= r; i++)
if (v[8][i] <= t) {
v[8][i] = t + tim[8][i];
cnt++;
}
a1 += cnt * 8;
a2 += cnt;
};
l = std::lower_bound(id[9] + 1, id[9] + m[9] + 1, L) - id[9] - 0;
r = std::upper_bound(id[9] + 1, id[9] + m[9] + 1, R) - id[9] - 1;
if (l <= r) {
int cnt = 0;
for (int i = l; i <= r; i++)
if (v[9][i] <= t) {
v[9][i] = t + tim[9][i];
cnt++;
}
a1 += cnt * 9;
a2 += cnt;
};
l = std::lower_bound(id[10] + 1, id[10] + m[10] + 1, L) - id[10] - 0;
r = std::upper_bound(id[10] + 1, id[10] + m[10] + 1, R) - id[10] - 1;
if (l <= r) {
int cnt = 0;
for (int i = l; i <= r; i++)
if (v[10][i] <= t) {
v[10][i] = t + tim[10][i];
cnt++;
}
a1 += cnt * 10;
a2 += cnt;
};
print(a1 - a2 * _dep[x], ' ', a2, '\n');
}
return 0;
}
| 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, c = 0, a, b;
cin >> n;
vector<long long> v[n];
for (long long i = 0; i < n; i++) {
cin >> a >> b;
v[i].push_back(a);
v[i].push_back(b);
}
for (long long i = 0; i < n; i++) {
if (v[i][0] != v[i][1]) {
cout << "rated" << endl;
return 0;
}
}
for (long long i = 1; i < n; i++) {
if (v[i][0] <= v[i - 1][0]) c++;
}
if (c == n - 1)
cout << "maybe" << endl;
else
cout << "unrated" << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, n2, m2, m;
cin >> n >> m;
if (m > (2 * n) + 2 || n >= m + 2) {
cout << -1 << endl;
} else {
string out = "";
if (m >= n) {
m2 = 0;
int x = m - n - 1;
for (int i = 1; i <= n; i++) {
if (x > 0) {
out += "110";
x--;
m2 += 2;
} else {
out += "10";
m2 += 1;
}
}
for (int i = 1; i <= m - m2; i++) out += "1";
} else {
n2 = 0;
int x = n - m - 1;
for (int i = 1; i <= m; i++) {
if (x > 0) {
out += "110";
x--;
n2 += 2;
} else {
out += "01";
n2 += 1;
}
}
for (int i = 1; i <= n - n2; i++) out += "0";
}
cout << out << endl;
}
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int X[2] = {0, 1};
const int Y[2] = {1, 0};
int n, m, finish;
long long res;
char L[500 + 9][500 + 9];
int Dis[2][500 + 9][500 + 9];
int Num[2][500 + 9][500 + 9];
long long DP[2][500 + 9][500 + 9];
vector<pair<int, int> > V[2][500 + 9 + 500 + 9];
bool Inside(int, int);
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
scanf(" %c", &L[i][j]);
Dis[0][i][j] = i + j - 2;
Dis[1][i][j] = n - i + m - j;
Num[0][i][j] = (int)(V[0][Dis[0][i][j]]).size();
Num[1][i][j] = (int)(V[1][Dis[1][i][j]]).size();
V[0][Dis[0][i][j]].push_back(make_pair(i, j));
V[1][Dis[1][i][j]].push_back(make_pair(i, j));
}
}
finish = (n + m - 2) / 2;
DP[0][0][0] = (L[1][1] == L[n][m]);
for (int f = 1; f <= finish; f++) {
for (int i = 0; i < (int)(V[0][f]).size(); i++) {
for (int j = 0; j < (int)(V[1][f]).size(); j++) {
DP[f & 1][i][j] = 0;
int x1 = V[0][f][i].first;
int y1 = V[0][f][i].second;
int x2 = V[1][f][j].first;
int y2 = V[1][f][j].second;
if (L[x1][y1] == L[x2][y2]) {
for (int p = 0; p < 2; p++) {
for (int l = 0; l < 2; l++) {
int x3 = x1 - X[p];
int y3 = y1 - Y[p];
int x4 = x2 + X[l];
int y4 = y2 + Y[l];
if (Inside(x3, y3) && Inside(x4, y4)) {
DP[f & 1][i][j] +=
DP[(f - 1) & 1][Num[0][x3][y3]][Num[1][x4][y4]];
}
}
}
DP[f & 1][i][j] %= MOD;
}
}
}
}
if ((n + m) & 1) {
for (int i = 0; i < (int)(V[0][finish]).size(); i++) {
for (int j = 0; j < (int)(V[1][finish]).size(); j++) {
if (V[0][finish][i].first == V[1][finish][j].first &&
V[1][finish][j].second - V[0][finish][i].second == 1) {
res += DP[finish & 1][i][j];
} else if (V[0][finish][i].second == V[1][finish][j].second &&
V[1][finish][j].first - V[0][finish][i].first == 1) {
res += DP[finish & 1][i][j];
}
}
}
} else {
for (int i = 0; i < (int)(V[0][finish]).size(); i++) {
for (int j = 0; j < (int)(V[1][finish]).size(); j++) {
if (V[0][finish][i] == V[1][finish][j]) {
res += DP[finish & 1][i][j];
}
}
}
}
printf("%lld\n", res % MOD);
}
bool Inside(int a, int b) { return (1 <= a && a <= n && 1 <= b && b <= m); }
| 7 |
#include <bits/stdc++.h>
using namespace std;
char G[1000][1001];
vector<int> adj[1000];
int cnt = 2;
void init(int lg, int c = 0) {
int l = 0, r = 0;
for (int i = (1); i <= (lg); i++) {
adj[l].push_back(cnt);
adj[l].push_back(cnt + 1);
if (r) {
adj[r].push_back(cnt);
adj[r].push_back(cnt + 1);
}
l = cnt;
r = cnt + 1;
cnt += 2;
}
if (c) {
adj[l].push_back(cnt);
adj[r].push_back(cnt + 1);
l = cnt;
r = cnt + 1;
cnt += 2;
}
adj[l].push_back(1);
adj[r].push_back(1);
}
void append(int lg, int L) {
int l = 2 * lg + 2;
while (lg < L - 1) {
adj[l].push_back(cnt);
l = cnt++;
lg++;
}
adj[l].push_back(1);
}
int main() {
int k;
cin >> k;
if (k == 1) {
puts("2\nNY\nYN");
return 0;
}
int L;
for (L = 31; L >= 0; L--)
if (k & (1 << L)) break;
init(L);
for (int lg = L - 1; lg >= 0; lg--)
if (k & (1 << lg)) {
if (lg == L - 1)
init(lg, 1);
else
append(lg, L);
}
printf("%d\n", cnt);
for (int i = 0; i < (cnt); i++)
for (int j = 0; j < (cnt); j++) G[i][j] = 'N';
for (int u = 0; u < (cnt); u++)
for (int v : adj[u]) G[u][v] = G[v][u] = 'Y';
for (int u = 0; u < (cnt); u++) puts(G[u]);
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 2e5 + 7;
const long long mod = 998244353;
inline long long read() {
long long x = 0;
bool f = 0;
char ch = getchar();
while (ch < '0' || '9' < ch) f |= ch == '-', ch = getchar();
while ('0' <= ch && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
return f ? -x : x;
}
void out(long long x) {
int stackk[20];
if (x < 0) {
putchar('-');
x = -x;
}
if (!x) {
putchar('0');
return;
}
int top = 0;
while (x) stackk[++top] = x % 10, x /= 10;
while (top) putchar(stackk[top--] + '0');
}
int n, vis[maxn], a[maxn];
string s;
int main() {
int toto = read();
while (toto--) {
n = read();
for (int i = (1); i <= (n); ++i) scanf("%1d", &a[i]);
memset(vis, 0, sizeof(vis));
queue<int> q1, q0;
int ans = 1;
while (q1.size()) q1.pop();
while (q0.size()) q0.pop();
for (int i = 1; i <= n; i++) {
if (a[i]) {
if (q0.size() == 0)
vis[i] = ans++;
else
vis[i] = vis[q0.front()], q0.pop();
q1.push(i);
} else {
if (q1.size() == 0)
vis[i] = ans++;
else
vis[i] = vis[q1.front()], q1.pop();
q0.push(i);
}
}
cout << ans - 1 << endl;
for (int i = 1; i <= n; i++) cout << vis[i] << " ";
puts("");
}
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
const int inf = 1 << 30;
const int INF = 0x3f3f3f3f;
long long h, w;
long long ah, aw;
long long high, wide;
int main() {
cin >> high >> wide;
int flag = 1;
for (int i = 0; 1 << i <= wide; ++i) {
w = 1 << i;
h = 1.25 * w;
if (h <= high) {
ah = h;
aw = w;
} else {
if (high * 4 <= 5 * w && 5 * high >= 4 * w) {
ah = high;
aw = w;
}
}
}
int nw, nh;
for (int i = 0; 1 << i <= high; ++i) {
h = 1 << i;
w = 1.25 * h;
if (w <= wide) {
nw = w;
nh = h;
} else {
if (4 * h <= 5 * wide && 5 * h >= 4 * wide) {
nw = wide;
nh = h;
}
}
}
if (1LL * nh * nw > 1LL * ah * aw)
cout << nh << ' ' << nw << endl;
else
cout << ah << ' ' << aw << endl;
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, d;
cin >> k >> d;
if (d == 9) {
cout << 9;
for (int i = 1; i < k; i++) cout << 0;
} else if (d == 0 && k > 1) {
cout << "No solution";
} else {
cout << d;
for (int i = 1; i < k; i++) cout << 9;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int h, i, j, k, m, n, z, l, x, r;
int a[100010];
void f(int first, int last, int index, int sum) {
if (sum > r) return;
if (last - first >= x && sum >= l) {
z++;
}
for (int i = index + 1; i <= n; i++) {
sum += a[i];
f(first, a[i], i, sum);
sum -= a[i];
}
}
int main() {
cin >> n >> l >> r >> x;
for (i = 1; i <= n; i++) cin >> a[i];
sort(a + 1, a + n + 1);
for (i = 1; i <= n; i++) {
f(a[i], 0, i, a[i]);
}
cout << z << endl;
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000010;
int a[MAXN], parent[MAXN], rnk[MAXN];
vector<int> arr[MAXN];
vector<int> ans;
void make_set(int v) {
parent[v] = v;
rnk[v] = 0;
}
int find_set(int v) {
if (v == parent[v]) return v;
return parent[v] = find_set(parent[v]);
}
void union_sets(int a, int b) {
a = find_set(a);
b = find_set(b);
if (a != b) {
if (rnk[a] < rnk[b]) swap(a, b);
parent[b] = a;
if (rnk[a] == rnk[b]) rnk[a]++;
}
}
int main() {
int n, m;
cin >> n >> m;
ans.clear();
ans.resize(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
make_set(i);
}
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
u--, v--;
union_sets(u, v);
}
for (int i = 0; i < n; i++) {
int st = find_set(i);
arr[st].push_back(a[i]);
}
for (int i = 0; i < n; i++) {
sort(arr[i].begin(), arr[i].end());
}
for (int i = 0; i < n; i++) {
int st = find_set(i);
int x = arr[st].back();
arr[st].pop_back();
ans[i] = x;
}
for (int i = 0; i < n; i++) {
cout << ans[i] << " ";
}
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
std::istream& operator>>(std::istream& i, pair<T, U>& p) {
i >> p.first >> p.second;
return i;
}
template <typename T>
std::istream& operator>>(std::istream& i, vector<T>& t) {
for (auto& v : t) {
i >> v;
}
return i;
}
template <typename T, typename U>
std::ostream& operator<<(std::ostream& o, const pair<T, U>& p) {
o << p.first << ' ' << p.second;
return o;
}
template <typename T>
std::ostream& operator<<(std::ostream& o, const vector<T>& t) {
if (t.empty()) o << '\n';
for (size_t i = 0; i < t.size(); ++i) {
o << t[i] << " \n"[i == t.size() - 1];
}
return o;
}
template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using maxheap = priority_queue<T, vector<T>, less<T>>;
template <typename T>
bool in(T a, T b, T c) {
return a <= b && b < c;
}
unsigned int logceil(long long first) {
return first ? 8 * sizeof(long long) - __builtin_clzll(first) : 0;
}
namespace std {
template <typename T, typename U>
struct hash<pair<T, U>> {
hash<T> t;
hash<U> u;
size_t operator()(const pair<T, U>& p) const {
return t(p.first) ^ (u(p.second) << 7);
}
};
} // namespace std
template <typename T, typename F>
T bsh(T l, T h, const F& f) {
T r = -1, m;
while (l <= h) {
m = (l + h) / 2;
if (f(m)) {
l = m + 1;
r = m;
} else {
h = m - 1;
}
}
return r;
}
template <typename F>
double bshd(double l, double h, const F& f, double p = 1e-9) {
unsigned int r = 3 + (unsigned int)log2((h - l) / p);
while (r--) {
double m = (l + h) / 2;
if (f(m)) {
l = m;
} else {
h = m;
}
}
return (l + h) / 2;
}
template <typename T, typename F>
T bsl(T l, T h, const F& f) {
T r = -1, m;
while (l <= h) {
m = (l + h) / 2;
if (f(m)) {
h = m - 1;
r = m;
} else {
l = m + 1;
}
}
return r;
}
template <typename F>
double bsld(double l, double h, const F& f, double p = 1e-9) {
unsigned int r = 3 + (unsigned int)log2((h - l) / p);
while (r--) {
double m = (l + h) / 2;
if (f(m)) {
h = m;
} else {
l = m;
}
}
return (l + h) / 2;
}
template <typename T>
T gcd(T a, T b) {
if (a < b) swap(a, b);
return b ? gcd(b, a % b) : a;
}
template <typename T>
class vector2 : public vector<vector<T>> {
public:
vector2() {}
vector2(size_t a, size_t b, T t = T())
: vector<vector<T>>(a, vector<T>(b, t)) {}
};
template <typename T>
class vector3 : public vector<vector2<T>> {
public:
vector3() {}
vector3(size_t a, size_t b, size_t c, T t = T())
: vector<vector2<T>>(a, vector2<T>(b, c, t)) {}
};
template <typename T>
class vector4 : public vector<vector3<T>> {
public:
vector4() {}
vector4(size_t a, size_t b, size_t c, size_t d, T t = T())
: vector<vector3<T>>(a, vector3<T>(b, c, d, t)) {}
};
template <typename T>
class vector5 : public vector<vector4<T>> {
public:
vector5() {}
vector5(size_t a, size_t b, size_t c, size_t d, size_t e, T t = T())
: vector<vector4<T>>(a, vector4<T>(b, c, d, e, t)) {}
};
class AConnectThree {
public:
void solve(istream& cin, ostream& cout) {
vector<std::pair<int, int>> P(3);
cin >> P;
vector2<int> D(1001, 1001, 0);
pair<int, std::pair<int, int>> best = {1e4, {0, 0}};
for (int i = 0; i <= 1000; ++i) {
for (int j = 0; j <= 1000; ++j) {
for (int k = 0; k < 3; ++k) {
D[i][j] += abs(P[k].first - i) + abs(P[k].second - j);
}
best = min(best, {D[i][j], {i, j}});
}
}
set<std::pair<int, int>> G;
for (int k = 0; k < 3; ++k) {
for (int i = min(best.second.first, P[k].first);
i <= max(best.second.first, P[k].first); ++i) {
G.insert({i, P[k].second});
}
for (int i = min(best.second.second, P[k].second);
i <= max(best.second.second, P[k].second); ++i) {
G.insert({best.second.first, i});
}
}
cout << G.size() << '\n';
for (std::pair<int, int> g : G) cout << g << '\n';
}
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
AConnectThree solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 200000 + 10;
const int Maxm = Maxn * 2;
struct Node {
int ls, rs, lcs, rcs, val, sum, size, slcs, srcs, sval;
} node[Maxm];
int tree[Maxm][2], lazy[Maxm], root, tot, n, m, T, A[Maxn], b, f;
Node mergy(Node a, Node b) {
Node ret;
ret.ls = a.ls;
ret.rs = b.rs;
ret.lcs = a.lcs;
ret.rcs = b.rcs;
ret.sum = a.sum + b.sum;
ret.size = a.size + b.size;
ret.val = max(a.val, b.val);
ret.slcs = a.slcs;
ret.srcs = b.srcs;
ret.sval = max(a.sval, b.sval);
if (a.rs == 0 && b.ls == 0) {
if (a.lcs == a.size) ret.lcs = a.lcs + b.lcs;
if (b.rcs == b.size) ret.rcs = a.rcs + b.rcs;
ret.val = max(a.rcs + b.lcs, ret.val);
}
if (a.rs == 1 && b.ls == 1) {
if (a.slcs == a.size) ret.slcs = a.slcs + b.slcs;
if (b.srcs == b.size) ret.srcs = a.srcs + b.srcs;
ret.sval = max(a.srcs + b.slcs, ret.sval);
}
return ret;
}
void update(int t) {
if (!tree[t][0] && !tree[t][1]) return;
node[t] = mergy(node[tree[t][0]], node[tree[t][1]]);
}
void setlazy(int t, int w) {
if (w == 2) {
swap(node[t].lcs, node[t].slcs);
swap(node[t].rcs, node[t].srcs);
swap(node[t].val, node[t].sval);
node[t].sum = node[t].size - node[t].sum;
node[t].ls ^= 1;
node[t].rs ^= 1;
if (lazy[t] == 2)
lazy[t] = -1;
else if (lazy[t] == 0 || lazy[t] == 1)
lazy[t] ^= 1;
else
lazy[t] = 2;
return;
}
node[t].ls = node[t].rs = w;
node[t].lcs = node[t].rcs = node[t].val = node[t].size * (w ^ 1);
node[t].slcs = node[t].srcs = node[t].sval = node[t].size * w;
node[t].sum = node[t].size * w;
lazy[t] = w;
}
void lazydown(int t) {
if (!tree[t][0] && !tree[t][1]) return;
if (lazy[t] == -1) return;
setlazy(tree[t][0], lazy[t]);
setlazy(tree[t][1], lazy[t]);
lazy[t] = -1;
}
void build(int &t, int l, int r) {
t = ++tot;
lazy[t] = -1;
if (l == r) {
node[t].ls = node[t].rs = node[t].sum = A[l];
node[t].size = 1;
node[t].lcs = node[t].rcs = node[t].val = A[l] ^ 1;
node[t].slcs = node[t].srcs = node[t].sval = A[l];
return;
}
int mid = (l + r) >> 1;
build(tree[t][0], l, mid);
build(tree[t][1], mid + 1, r);
update(t);
}
int ql, qr, qw;
void change(int t, int l, int r) {
if (ql <= l && r <= qr) {
setlazy(t, qw);
return;
}
lazydown(t);
int mid = (l + r) >> 1;
if (ql <= mid) change(tree[t][0], l, mid);
if (qr > mid) change(tree[t][1], mid + 1, r);
update(t);
}
void Clear() {
memset(tree, 0, sizeof(tree));
memset(lazy, 0, sizeof(lazy));
memset(node, 0, sizeof(node));
tot = root = 0;
}
void query(int t, int l, int r, int &dl, int &dr) {
if (node[t].val < qw) {
dl = dr = -1;
return;
}
int mid = (l + r) >> 1;
if (node[tree[t][0]].val >= qw) {
query(tree[t][0], l, mid, dl, dr);
return;
}
if (node[tree[t][0]].rcs + node[tree[t][1]].lcs >= qw &&
node[tree[t][0]].rs == 0 && node[tree[t][1]].ls == 0) {
dl = mid - node[tree[t][0]].rcs + 1;
dr = dl + qw - 1;
return;
}
query(tree[t][1], mid + 1, r, dl, dr);
}
int Ansl[Maxn], Ansr[Maxn], Ans0;
void solve() {
Clear();
scanf("%d%d%d%d", &n, &b, &f, &m);
build(root, 1, n + b + f);
int a, type;
for (int i = 1; i <= m; i++) {
scanf("%d%d", &type, &a);
if (type == 1) {
qw = a + b + f;
query(root, 1, n + b + f, Ansl[i], Ansr[i]);
if (Ansl[i] == -1) {
printf("-1\n");
continue;
}
Ansl[i] += b;
Ansr[i] -= f;
printf("%d\n", Ansl[i] - b - 1);
ql = Ansl[i];
qr = Ansr[i];
qw = 1;
change(root, 1, n + b + f);
continue;
}
ql = Ansl[a], qr = Ansr[a];
qw = 0;
change(root, 1, n + b + f);
}
}
int main() {
solve();
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
char st[100010], ch[1010];
int n, m;
int pre[1010], succ[1010], p[1010];
bool work() {
memset(pre, 0, sizeof(pre));
memset(succ, 0, sizeof(succ));
int l = strlen(ch);
int now = 0, j = 0;
for (int i = 0; i < l; ++i) {
if (i == 0)
p[i] = 0;
else {
p[i] = p[i - 1];
while (ch[i] != ch[p[i]] && p[i] > 0) p[i] = p[p[i] - 1];
if (ch[i] == ch[p[i]]) p[i]++;
}
for (; now < n && j <= i; ++now) {
while (st[now] != ch[j] && j > 0) j = p[j - 1];
if (st[now] == ch[j]) j++;
}
if (j > i)
pre[i] = now - 1;
else
pre[i] = n;
}
now = n - 1;
j = l - 1;
for (int i = l - 1; i >= 0; --i) {
if (i == l - 1)
p[i] = 0;
else {
p[i] = p[i + 1];
while (ch[i] != ch[l - p[i] - 1] && p[i] > 0) p[i] = p[l - p[i]];
if (ch[i] == ch[l - p[i] - 1]) p[i]++;
}
for (; now >= 0 && j >= i; --now) {
while (st[now] != ch[j] && j < l - 1) j = l - p[j + 1] - 1;
if (st[now] == ch[j]) j--;
}
if (j < i)
succ[i] = now + 1;
else
succ[i] = -1;
}
for (int i = 0; i < l - 1; ++i)
if (pre[i] < succ[i + 1]) return true;
return false;
}
int main() {
scanf("%s", st);
n = strlen(st);
scanf("%d", &m);
int ans = 0;
for (int i = 1; i <= m; ++i) {
scanf("%s", ch);
if (work()) ++ans;
}
printf("%d\n", ans);
return 0;
}
| 7 |
#include <bits/stdc++.h>
int n, s, t, a[50001], i;
int main() {
int n;
scanf("%d", &n);
int a = n / 2, b = n - a;
printf("%d\n", a * b);
int i, j;
for (i = 1; i <= a; i++) {
for (j = a + 1; j <= n; j++) {
printf("%d %d\n", i, j);
}
}
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int N, a[200005], b[200005], ans[200005];
int main() {
int n, m, p;
scanf("%d%d%d", &n, &m, &p);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (int i = 1; i <= m; i++) scanf("%d", &b[i]);
if (n <= p) {
if (m != 1)
printf("0\n");
else {
N = 0;
for (int i = 1; i <= n; i++) {
if (b[1] == a[i]) {
ans[N++] = i;
}
}
printf("%d\n", N);
for (int i = 0; i < N; i++) printf("%d ", ans[i]);
printf("\n");
}
} else {
N = 0;
int k = 0;
map<int, int> mp;
mp.clear();
for (int i = 1; i <= m; i++) {
if (mp.count(b[i]) == 0) k++;
mp[b[i]] = 0;
}
for (int i = 1; i <= m; i++) mp[b[i]]++;
map<int, int> mt;
for (int i = 1; i <= p; i++) {
mt.clear();
int t = (n - i) / p;
if (t + 1 < m) continue;
int ok = 0;
for (int j = 0; j <= m - 1; j++) {
int v = a[i + j * p];
if (mp.count(v) == 0) continue;
if (mt[v] == mp[v] - 1)
ok++;
else if (mt[v] == mp[v])
ok--;
mt[v]++;
}
if (ok == k) ans[N++] = i;
for (int j = m; j <= t; j++) {
int u = a[i + (j - m) * p], v = a[i + j * p];
if (u != v) {
if (mp.count(u) != 0) {
if (mt[u] == mp[u] + 1)
ok++;
else if (mt[u] == mp[u])
ok--;
mt[u]--;
}
if (mp.count(v) != 0) {
if (mt[v] == mp[v] - 1)
ok++;
else if (mt[v] == mp[v])
ok--;
mt[v]++;
}
}
if (ok == k) {
ans[N++] = i + (j - m + 1) * p;
}
}
}
sort(ans, ans + N);
printf("%d\n", N);
for (int i = 0; i < N; i++) printf("%d ", ans[i]);
printf("\n");
}
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
string dict[100];
string names[60];
int main() {
int n, k;
cin >> n >> k;
string c = "abcde";
for (int i = 0; i < 100; i++) {
dict[i] = 'A' + c;
next_permutation(c.begin(), c.end());
}
string s;
cin >> s;
int t = 0;
if (s == "YES") {
for (int i = 0; i < k; i++) names[i] = dict[t], t++;
} else {
for (int i = 0; i < k - 1; i++) names[i] = dict[t], t++;
names[k - 1] = dict[0];
}
int pos = k;
for (int i = 0; i < n - k; i++) {
cin >> s;
if (s == "YES") {
names[pos] = dict[t], t++, pos++;
} else {
names[pos] = names[pos - k + 1], pos++;
}
}
for (int i = 0; i < n; i++) {
cout << names[i] << ' ';
}
cout << endl;
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (!b) return a;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
bool isprime(long long n) {
if (n == 0 || n == 1) return 0;
for (long long i = 2; i * i <= n; i++) {
if (n % i == 0) {
return 0;
}
}
return 1;
}
int main() {
int a, b, n;
cin >> a >> b;
set<int> s1, s2, s;
for (int i = 1; i * i <= a; i++)
if (a % i == 0) s1.insert(i), s1.insert(a / i);
for (int i = 1; i * i <= b; i++)
if (b % i == 0) s2.insert(i), s2.insert(b / i);
set_intersection(s1.begin(), s1.end(), s2.begin(), s2.end(),
inserter(s, s.begin()));
cin >> n;
while (n--) {
int k = -1, l, r;
cin >> l >> r;
for (auto it : s) {
if (it <= r) {
if (it >= l) k = it;
} else
break;
}
cout << k << '\n';
}
return 0;
}
| 4 |
using namespace std;
#include <cstdio>
#include <cstring>
#include <algorithm>
#define N 57
#define ll long long
#define INF 0x3f3f3f3f3f3f3f3f
int n,k;
ll lim[N][2];
int lg(ll x){
ll c=0;
for (;x;x>>=1)
++c;
return c;
}
int kb[N];
ll c[N];
ll f[N][N][N][4][4];//(0/1,0/1) keybit , if equal to i
void tran(ll &x,ll y){x>y?x=y:0;}
bool judge(int l,int r,int i){
for (int md=l+1;md<=r-1;++md)
if (i>=kb[md]-1)
return 0;
return 1;
}
int main(){
// printf("%lld\n",sizeof(f));
// return 0;
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
scanf("%d%d",&n,&k);
for (int i=1;i<=n;++i){
scanf("%lld%lld",&lim[i][0],&lim[i][1]);
lim[i][0]+=1ll<<k,lim[i][1]+=1ll<<k;
lim[i][0]--,lim[i][1]++;
kb[i]=lg(lim[i][0]^lim[i][1])-1;
}
lim[0][0]=lim[1][0],lim[0][1]=lim[1][1],kb[0]=kb[1];
lim[n+1][0]=lim[n][0],lim[n+1][1]=lim[n][1],kb[n+1]=kb[n];
for (int i=0;i<k;++i)
scanf("%lld",&c[i]);
k+=2;
// kb[0]=kb[n+1]=k-1;
// lim[0][0]=0,lim[0][1]=(1ll<<k)-1;
// lim[n+1][0]=0,lim[n+1][1]=(1ll<<k)-1;
memset(f,63,sizeof f);
for (int l=0,r;l<=n+1;++l){
r=l+1;
for (int sl=0;sl<2;++sl)
for (int sr=0;sr<2;++sr)
f[k][l][r][sl][sr]=0;
}
for (int i=k-1;i>=0;--i){
for (int l=n+1;l>=0;--l)
for (int r=l+1;r<=n+1;++r){
for (int sl=0;sl<4;++sl)
for (int sr=0;sr<4;++sr){
if (sl>>1 && !(i<kb[l] && (lim[l][sl&1]>>i&1)==(sl&1)))
continue;
if (sr>>1 && !(i<kb[r] && (lim[r][sr&1]>>i&1)==(sr&1)))
continue;
if (judge(l,r,i))
tran(f[i][l][r][sl][sr],f[i+1][l][r][sl&1][sr&1]+(1<=l && r<=n?((lim[l][sl&1]>>i&1^sl>>1)^(lim[r][sr&1]>>i&1^sr>>1))*c[i]:0));
for (int md=l+1;md<=r-1;++md){
tran(f[i][l][r][sl][sr],f[i][l][md][sl][2]+f[i][md][r][2][sr]);
tran(f[i][l][r][sl][sr],f[i][l][md][sl][3]+f[i][md][r][3][sr]);
}
}
}
}
ll ans=INF;
for (int sl=0;sl<4;++sl)
for (int sr=0;sr<4;++sr)
ans=min(ans,f[0][0][n+1][sl][sr]);
printf("%lld\n",ans);
return 0;
}
| 13 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10, Max = 1e7 + 10;
template <typename A, typename B>
ostream& operator<<(ostream& out, pair<A, B> p) {
out << "{ " << p.first << ", " << p.second << " }";
return out;
}
template <typename T>
ostream& operator<<(ostream& out, vector<T> v) {
out << "[ ";
for (int i = 0; i < int((v).size()); i++) {
out << v[i];
if (i != int((v).size()) - 1) out << " ,";
}
out << " ]";
return out;
}
int a[maxn], b[maxn], c[maxn], L[maxn], R[maxn];
vector<int> dv[maxn], v[maxn];
int bigp[Max], val[Max];
int zr[maxn];
void add(vector<int>& vec) {
zr[0] = 1;
val[1]++;
for (int msk = 1; msk < (1 << int((vec).size())); msk++)
zr[msk] = zr[msk ^ (msk & -msk)] * vec[__builtin_ctz(msk)], val[zr[msk]]++;
}
int ask(vector<int>& vec) {
zr[0] = 1;
int ans = val[1];
for (int msk = 1; msk < (1 << int((vec).size())); msk++)
zr[msk] = zr[msk ^ (msk & -msk)] * vec[__builtin_ctz(msk)],
ans += (__builtin_popcount(msk) & 1 ? -1 : 1) * val[zr[msk]];
return ans;
}
void go(int N) {
for (int i = 0; i < N; i++) {
L[i] = 0, R[i] = N + 1;
dv[i].clear();
int tmp = b[i];
while (tmp > 1) {
dv[i].push_back(bigp[tmp]);
tmp /= bigp[tmp];
}
}
while (true) {
vector<pair<int, int> > vec;
for (int i = 0; i < N; i++) {
if (R[i] - L[i] > 1) vec.push_back({(R[i] + L[i]) >> 1, i});
}
if (int((vec).size()) == 0) break;
memset(val, 0, sizeof val);
sort(vec.begin(), vec.end());
int pt = 0;
for (int i = 0; i < N; i++) {
if (pt == int((vec).size())) break;
add(dv[i]);
while (pt < int((vec).size()) && vec[pt].first == i + 1) {
if (ask(dv[vec[pt].second]) == 0)
L[vec[pt].second] = (L[vec[pt].second] + R[vec[pt].second]) >> 1;
else
R[vec[pt].second] = (L[vec[pt].second] + R[vec[pt].second]) >> 1;
pt++;
}
}
}
for (int i = 0; i < N; i++) {
if (L[i] < N) v[c[i]].push_back(c[L[i]]), v[c[L[i]]].push_back(c[i]);
}
}
bool mark[maxn];
int SZ[maxn];
vector<int> ids[maxn];
map<int, vector<int> > poses;
void dfs(int u) {
mark[u] = 1;
SZ[u] = 1;
for (int y : v[u])
if (mark[y] == 0) dfs(y), SZ[u] += SZ[y];
}
void dfs2(int u, int& k, vector<int>& vans) {
while (k > 0 && int((ids[u]).size())) {
--k;
vans.push_back(ids[u].back());
ids[u].pop_back();
}
if (k == 0) return;
mark[u] = 1;
for (int y : v[u])
if (mark[y] == 0) dfs2(y, k, vans);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie();
for (int i = 2; i < Max; i++) {
if (bigp[i] == 0)
for (int j = i; j < Max; j += i) bigp[j] = i;
}
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
int tmp = a[i];
a[i] = 1;
while (tmp > 1) {
int P = bigp[tmp];
a[i] *= P;
while (tmp % P == 0) tmp /= P;
}
poses[a[i]].push_back(i);
}
sort(a, a + n);
n = unique(a, a + n) - a;
for (int i = 0; i < n; i++) {
ids[i] = poses[a[i]];
}
for (int i = 0; i < n; i++) {
b[i] = a[i];
c[i] = i;
}
int ID = -1;
for (int i = 0; i < n; i++) {
if (b[i] == 1) ID = i;
}
if (ID != -1) {
vector<int> ans;
for (int x : ids[ID]) ans.push_back(x);
for (int i = 0; i < n; i++)
if (i != ID)
for (int x : ids[i]) ans.push_back(x);
for (int i = 0; i < k; i++) cout << ans[i] + 1 << " ";
return cout << endl, 0;
}
go(n);
vector<int> vec;
for (int i = 0; i < n; i++) {
if (mark[i] == 0 &&
(int((v[i]).size()) == 0 ||
int((ids[v[i].back()]).size()) <= int((ids[i]).size())))
dfs(i), vec.push_back(i);
}
sort(vec.begin(), vec.end(), [&](int i, int j) { return SZ[i] < SZ[j]; });
int num = 0, num2 = 0;
while (num < int((vec).size()) && SZ[vec[num]] == 1)
num2 += int((ids[vec[num]]).size()), num++;
if (num2 >= k) {
vector<int> ans;
for (int i = 0; i < num; i++)
for (int x : ids[vec[i]]) ans.push_back(x);
for (int i = 0; i < k; i++) cout << ans[i] + 1 << " ";
return cout << endl, 0;
}
for (int i = num; i < int((vec).size()); i++) {
b[i - num] = a[vec[i]];
c[i - num] = vec[i];
}
if (SZ[vec.back()] == 2) {
go(int((vec).size()) - num);
memset(mark, 0, sizeof mark);
vec.clear();
for (int i = 0; i < n; i++) {
if (mark[i] == 0) dfs(i), vec.push_back(i);
}
sort(vec.begin(), vec.end(), [&](int i, int j) { return SZ[i] < SZ[j]; });
}
if (SZ[vec.back()] == 2) {
vector<int> ans;
for (int i = 0; i < int((vec).size()); i++)
for (int x : ids[vec[i]]) ans.push_back(x);
for (int i = 0; i < k; i++) cout << ans[i] + 1 << " ";
return cout << endl, 0;
}
memset(mark, 0, sizeof mark);
int lst = -1;
vector<int> vans;
dfs2(vec.back(), k, vans);
lst = vans.back();
for (int i = int((vec).size()) - 2; i >= 0; i--) {
if (k == 1) {
vans.erase(find(vans.begin(), vans.end(), lst));
vans.push_back(ids[vec[i]][0]);
vans.push_back(ids[v[vec[i]].back()][0]);
k = 0;
}
dfs2(vec[i], k, vans);
}
for (int x : vans) cout << x + 1 << " ";
return cout << endl, 0;
}
| 12 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long s, xo;
cin >> s >> xo;
if ((s - xo) % 2 != 0 || (s < xo)) {
cout << 0 << endl;
return 0;
}
if ((((s - xo) / 2) & xo) != 0) {
cout << 0 << endl;
return 0;
}
if (xo == 0) {
cout << 1 << endl;
return 0;
}
long long f = 1;
long long ans = 0;
long long nx = xo;
while (xo != 0) {
if ((f & xo) != 0) {
xo -= f;
ans++;
}
f = f * 2;
}
ans = pow(2, ans);
if (s == nx) ans -= 2;
cout << ans << endl;
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.length();
for (int i = 0; i < n; i++) {
if (s[i] >= 'A' && s[i] <= 'Z') {
s[i] += 32;
}
}
for (int i = 0; i < n; i++) {
if ((s[i] != 'a') && (s[i] != 'e') && (s[i] != 'i') && (s[i] != 'o') &&
(s[i] != 'u') && (s[i] != 'y')) {
cout << '.' << s[i];
}
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
long long x = 0, f = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-') f = -f;
for (; isdigit(ch); ch = getchar()) x = 10 * x + ch - '0';
return x * f;
}
const int maxn = 100010;
int n, l;
long long s;
int anc[maxn][27], fa[maxn], depth[maxn], vis[maxn];
long long val[maxn], dis[maxn];
int len[maxn], f[maxn], g[maxn];
vector<int> G[maxn];
inline void predfs(int x, int ff) {
dis[x] = dis[ff] + val[x];
depth[x] = depth[ff] + 1;
anc[x][0] = ff;
for (int i = 1; i <= 20; i++) anc[x][i] = anc[anc[x][i - 1]][i - 1];
for (auto to : G[x]) predfs(to, x);
fa[x] = ff;
}
inline void dpdfs(int x) {
f[x] = -1;
g[x] = 0;
int flag = 0;
for (auto to : G[x]) {
flag = 1;
dpdfs(to);
g[x] += g[to];
f[x] = max(f[x], f[to] - 1);
}
if (!flag) {
f[x] = len[x] - 1;
g[x] = 1;
return;
}
if (f[x] == -1) {
f[x] = len[x] - 1;
g[x]++;
}
}
int main() {
n = read();
l = read();
s = read();
if (!l) {
puts("-1");
return 0;
}
for (int i = 1; i <= n; i++) {
val[i] = read();
if (val[i] > s) {
puts("-1");
return 0;
}
}
for (int i = 2; i <= n; i++) {
int fi = read();
G[fi].push_back(i);
}
predfs(1, 0);
for (int i = 1; i <= n; i++) {
int xx = i;
for (int j = 20; j >= 0; j--)
if (anc[xx][j] != 0 && dis[i] - dis[fa[anc[xx][j]]] <= s &&
depth[i] - depth[fa[anc[xx][j]]] <= l)
xx = anc[xx][j];
len[i] = depth[i] - depth[xx] + 1;
}
dpdfs(1);
printf("%d\n", g[1]);
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
string solve(string a) {
if (a.size() % 2 == 1) return a;
string halfA(a.begin(), a.begin() + (a.size() / 2));
string halfB(a.begin() + (a.size() / 2), a.end());
string A = solve(halfA);
string B = solve(halfB);
return A < B ? A + B : B + A;
}
int main() {
ios_base::sync_with_stdio(false);
string a, b;
cin >> a >> b;
a = solve(a);
b = solve(b);
cout << (a == b ? "YES" : "NO") << endl;
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, x, y, z;
cin >> a >> b >> x >> y >> z;
a = a - x * 2 - y;
b = b - z * 3 - y;
long long ans = 0;
if (a < 0) {
ans += (0 - a);
}
if (b < 0) {
ans += (0 - b);
}
cout << ans;
return 0;
}
| 0 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define pb push_back
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define mem(a) memset(a, 0, sizeof(a))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
typedef __int128_t int128;
const int maxn = 4 * 1e5 + 10, P = 998244353, G = 3, Gi = 332748118;
const ll mod = P;
//Gi是原根的逆元
int limit = 1, L, rev[maxn];
vector<ll> a, b;
ll fac[maxn], inv[maxn];
int n;
ll in[maxn], de[maxn];
vector<ll> tmp;
inline ll qp(ll a, ll k, ll mod = P)
{
ll base = 1;
while (k)
{
if (k & 1)
base = (base * a) % mod;
a = (a * a) % mod;
k >>= 1;
}
return base % mod;
}
int cnt = 0;
inline void NTT(vector<ll> &A, int type)
{
//cout << "SSSSS" << cnt++ << endl;
for (int i = 0; i < limit; i++)
if (i < rev[i])
swap(A[i], A[rev[i]]);
for (int mid = 1; mid < limit; mid <<= 1)
{
ll Wn = qp(type == 1 ? G : Gi, (P - 1) / (mid << 1));
for (int j = 0; j < limit; j += (mid << 1))
{
ll w = 1;
for (int k = 0; k < mid; k++, w = (w * Wn) % P)
{
//cout << mid << " " << j << " " << k << endl;
int x = A[j + k], y = w * A[j + k + mid] % P;
A[j + k] = (x + y) % P, A[j + k + mid] = (x - y + P) % P;
}
}
}
if (type == -1)
{
ll inv = qp(limit, P - 2);
for (int i = 0; i < limit; i++)
A[i] = A[i] * inv % P;
}
}
void init(int N, int M)
{
limit = 1;
L = 0;
while (limit <= N + M)
limit <<= 1, L++;
for (int i = 0; i < limit; i++)
{
rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (L - 1));
}
}
void I()
{
fac[0] = 1, inv[0] = 1;
for (int i = 1; i < maxn; i++)
fac[i] = fac[i - 1] * i % P, inv[i] = qp(fac[i], mod - 2);
}
ll C(int n, int k)
{
if (k < 0 || k > n)
return 0;
return 1ll * fac[n] * inv[k] % mod * inv[n - k] % mod;
}
void mul(vector<ll> &a, vector<ll> &b)
{
int n = a.size(), m = b.size();
init(n, m);
a.resize(limit), b.resize(limit);
//cout << limit << endl;
NTT(a, 1), NTT(b, 1);
for (int i = 0; i < limit; i++)
a[i] = a[i] * b[i] % mod;
NTT(a, -1);
}
int main()
{
I();
//cout << C(6, 3) << " " << C(6, 2) << endl;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> in[i] >> de[i];
a.pb(1);
int len = 1;
for (int i = 1; i <= n; i++)
{
//cout << "I= " << i << endl;
len += in[i] - de[i];
tmp.clear();
int prev = a.size();
for (int j = de[i] - prev + 1; j <= prev + in[i] - 1; j++)
{
tmp.pb(C(in[i] + de[i], j));
}
mul(tmp, a);
vector<ll> tmp2(len,0);
for (int i = 0; i < len; i++)
tmp2[i]=(tmp[i + prev - 1]);
a.clear();
a = tmp2;
}
ll ans = 0;
for (auto c : a)
{
//cout << c << endl;
ans = (ans + c) % mod;
}
cout << ans << endl;
return 0;
} | 10 |
#include <bits/stdc++.h>
using namespace std;
long long int em(long long int x, long long int Mod, long long int n) {
if (n == 0)
return 1ll;
else if (n % 2 == 0)
return em((x % Mod * x % Mod) % Mod, Mod, n / 2) % Mod;
else
return (x % Mod * em((x % Mod * x % Mod) % Mod, Mod, (n - 1) / 2)) % Mod;
}
pair<long long int, pair<long long int, long long int>> dp[5009][509];
long long int d, s;
void fun() {
long long int i, j, k;
queue<pair<long long int, pair<long long int, long long int>>> q;
q.push({0, {0, 0}});
while (!q.empty()) {
pair<long long int, pair<long long int, long long int>> y = q.front();
q.pop();
long long int mo = y.first;
long long int pos = y.second.first;
long long int len = y.second.second;
for (long long int i = (long long int)0; i < (long long int)10; i++) {
long long int npos = pos + i;
if (npos > s) continue;
long long int nmod = (mo * 10 + i) % d;
if (dp[npos][nmod].first == -1) {
dp[npos][nmod] = {mo, {len + 1, i}};
q.push({nmod, {npos, len + 1}});
}
if (nmod == 0 && npos == s) break;
}
}
}
int32_t main() {
std::ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int i, j, k, l;
cin >> d >> s;
memset(dp, -1, sizeof(dp));
fun();
if (dp[s][0].first == -1) {
cout << "-1";
return 0;
}
long long int now = s, mo = 0;
vector<long long int> ans;
while (now) {
ans.push_back(dp[now][mo].second.second);
long long int nmodu = dp[now][mo].first;
now -= dp[now][mo].second.second;
mo = nmodu;
}
long long int sz = ans.size();
for (i = sz - 1; i >= 0; i--) cout << ans[i];
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
void sol(long long int Cmax, long long int Hmax, long long int Ct,
long long int Ht, long long int t) {
long long int C, H;
double ans_t = 1000010.0;
long long int ans_total = 0;
double tmp_t;
long long int ans_C, ans_H;
ans_C = ans_H = 0;
int Hbit;
for (C = Cmax; C >= 0; C--) {
H = (t - Ct) * C / (Ht - t);
if (((t - Ct) * C) % (Ht - t)) H++;
if (H > Hmax) H = Hmax;
tmp_t = (double)(Ct * C + Ht * H) / (double)(C + H);
if (tmp_t < t) continue;
if (tmp_t - t < ans_t) {
ans_C = C;
ans_H = H;
ans_t = tmp_t - t;
} else if (((tmp_t - t) < 0 ? (-(tmp_t - t)) : (tmp_t - t)) <= ans_t &&
C + H > ans_C + ans_H) {
ans_C = C;
ans_H = H;
}
}
if (ans_C == 0) {
ans_H = Hmax;
}
printf("%I64d %I64d\n", ans_C, ans_H);
}
int main(void) {
long long int Ct, Ht, Cmax, Hmax;
long long int target;
while (~scanf("%I64d%I64d%I64d%I64d%I64d", &Ct, &Ht, &Cmax, &Hmax, &target)) {
if (Ct == Ht) {
printf("%I64d %I64d\n", Cmax, Hmax);
} else if (Ct == target && Ht != target) {
printf("%I64d 0\n", Cmax);
} else if (Ht == target) {
printf("0 %I64d", Hmax);
} else {
sol(Cmax, Hmax, Ct, Ht, target);
}
}
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
const long long maxn = 1e5 + 10;
const long long inf = 2e18;
int main() {
ios_base::sync_with_stdio(0);
long long n, a[maxn], b[maxn];
bool tf = 1;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i] >> b[i];
}
long long pr = max(a[0], b[0]);
for (int i = 1; i < n; ++i) {
if (max(a[i], b[i]) > pr) {
if (min(a[i], b[i]) > pr) {
tf = 0;
break;
} else {
pr = min(a[i], b[i]);
}
} else {
pr = max(a[i], b[i]);
}
}
if (tf)
cout << "YES";
else
cout << "NO";
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
bool chkmax(T &x, T y) {
return x < y ? x = y, true : false;
}
template <typename T>
bool chkmin(T &x, T y) {
return x > y ? x = y, true : false;
}
int readint() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
long long n, tot;
int mu[10000005], cnt[10000005], p0[10000005], prm[1000005];
bool fl[10000005];
void getprime() {
fl[1] = mu[1] = 1;
for (int i = 2; i <= n; i++) {
if (!fl[i]) prm[++tot] = i, p0[i] = i, mu[i] = -1;
for (int j = 1; j <= tot && i * prm[j] <= n; j++) {
fl[i * prm[j]] = 1, p0[i * prm[j]] = prm[j];
if (i % prm[j] == 0) {
mu[i * prm[j]] = 0;
break;
}
mu[i * prm[j]] = -mu[i];
}
}
}
int main() {
n = readint();
getprime();
long long a1 = 0, ans = 0;
for (int i = 1; i <= n; i++) a1 += mu[i] * (n / i) * (n / i);
ans += n * (n - 1) / 2 - (a1 - 1) / 2;
a1 -= n + n - 1, a1 /= 2;
long long tmp = n - 1;
for (int i = 1; i <= tot; i++)
if (prm[i] * 2 > n) a1 -= tmp - 1, tmp--;
long long a2 = 0;
for (int i = 2; i <= n; i++) cnt[p0[i]]++;
for (int i = 2; i <= n; i++) cnt[i] += cnt[i - 1];
for (int i = 1; i <= tot; i++)
if (1ll * prm[i] * prm[i] > n && prm[i] * 2 <= n)
a2 += cnt[prm[i] - 1] - cnt[n / prm[i]];
ans += a2 * 3 + (a1 - a2) * 2;
printf("%lld\n", ans);
return 0;
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > out;
vector<pair<int, int> >::iterator iter;
long long int a[3][200005];
int main() {
long long int x[3], y[3], m[3];
int k[3], i, j, bad = 0, prev = 0, n, u = 1, v = 1;
bool A, B;
scanf("%d", &n);
for (i = 1; i <= 2; i++) {
scanf("%d%I64d%I64d%I64d%I64d", &k[i], &a[i][1], &x[i], &y[i], &m[i]);
for (j = 2; j <= k[i]; j++) a[i][j] = (a[i][j - 1] * x[i] + y[i]) % m[i];
}
for (i = 1; i <= k[1] + k[2]; i++) {
A = B = false;
if (((u <= k[1] && a[1][u] < prev) && (v <= k[2] && a[2][v] < prev)) ||
(v > k[2] && a[1][u] < prev) || (u > k[1] && a[2][v] < prev)) {
bad++;
if ((u <= k[1] && a[1][u] < a[2][v]) || v > k[2])
A = true;
else
B = true;
}
if (u <= k[1] && !B &&
(((a[2][v] < prev) || A) ||
((v > k[2]) || (a[1][u] >= prev && a[1][u] < a[2][v])))) {
if (k[1] + k[2] <= 200000) out.push_back(make_pair(a[1][u], 1));
prev = a[1][u];
u++;
} else {
if (k[1] + k[2] <= 200000) out.push_back(make_pair(a[2][v], 2));
prev = a[2][v];
v++;
}
}
printf("%d\n", bad);
if (k[1] + k[2] <= 200000) {
for (iter = out.begin(); iter != out.end(); iter++)
printf("%d %d\n", iter->first, iter->second);
}
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
string str;
vector<long long> x;
vector<long long> y;
int main() {
long long n, temp, k, r, avg, t2, temp2, j, ans, t, m, a, b, i;
cin >> n >> m;
cout << min(n, m) + 1 << endl;
for (i = 0; i <= min(n, m); i++) {
cout << i << " " << min(n, m) - i << endl;
}
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const int GH = 200001;
int n, a[5011][5011], sz[5011], cur[5011], need;
set<pair<int, int> > s;
vector<pair<int, int> > save;
int main() {
scanf("%d", &n);
for (int i = (1), _b = (n); i <= _b; i++) {
scanf("%d%d", &sz[i], &a[i][1]);
need += sz[i];
int x, y, m;
scanf("%d%d%d", &x, &y, &m);
for (int j = (2), _b = (sz[i]); j <= _b; j++) {
a[i][j] = (a[i][j - 1] * (long long)x + y) % m;
}
}
for (int i = (1), _b = (n); i <= _b; i++) {
cur[i] = 1;
s.insert(make_pair(a[i][1], i));
}
int last = -1, res = 0;
if (need < GH) {
for (int turn = (1), _b = (need); turn <= _b; turn++) {
set<pair<int, int> >::iterator it = s.lower_bound(make_pair(last, 0));
if (it == s.end()) it = s.begin(), ++res;
int u = it->second;
s.erase(it);
if (need < GH) {
save.push_back(make_pair(a[u][cur[u]], u));
}
last = a[u][cur[u]];
++cur[u];
if (cur[u] <= sz[u]) s.insert(make_pair(a[u][cur[u]], u));
}
} else {
for (int i = (1), _b = (n); i <= _b; i++) {
int cnt = 0;
for (int j = (1), _b = (sz[i] - 1); j <= _b; j++)
if (a[i][j] > a[i][j + 1]) ++cnt;
res = max(res, cnt);
}
}
printf("%d\n", res);
for (int i = 0, _a = (save.size()); i < _a; i++)
printf("%d %d\n", save[i].first, save[i].second);
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
bool have[15] = {0};
char all[100005];
int main() {
int N, i, j;
scanf("%d", &N);
scanf("%s", all);
for (i = 0; i < N; i++) {
if (all[i] == 'L') {
for (j = 0; j <= 9; j++) {
if (have[j] == 0) {
have[j] = 1;
break;
}
}
} else if (all[i] == 'R') {
for (j = 9; j >= 0; j--) {
if (have[j] == 0) {
have[j] = 1;
break;
}
}
} else {
have[all[i] - '0'] = 0;
}
}
for (i = 0; i <= 9; i++) printf("%d", have[i]);
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7, INF = 0x3f3f3f3f;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long qpow(long long a, long long n) {
long long r = 1 % P;
for (a %= P; n; a = a * a % P, n >>= 1)
if (n & 1) r = r * a % P;
return r;
}
long long inv(long long first) {
return first <= 1 ? 1 : inv(P % first) * (P - P / first) % P;
}
inline int rd() {
int first = 0;
char p = getchar();
while (p < '0' || p > '9') p = getchar();
while (p >= '0' && p <= '9') first = first * 10 + p - '0', p = getchar();
return first;
}
const int N = 3050;
int g, first, second, z;
int n, m, a, b;
int q[N][N], w[N][N], c[N];
int f[20][N], Log[N];
void init(int *a, int n) {
Log[0] = -1;
for (int i = 1; i <= n; ++i) f[0][i] = a[i], Log[i] = Log[i >> 1] + 1;
for (int j = 1; j <= 19; ++j)
for (int i = 0; i + (1 << j - 1) - 1 <= n; ++i) {
f[j][i] = min(f[j - 1][i], f[j - 1][i + (1 << j - 1)]);
}
}
int RMQ(int l, int r) {
if (l > r) return INF;
int t = Log[r - l + 1];
return min(f[t][l], f[t][r - (1 << t) + 1]);
}
int main() {
cin >> n >> m >> a >> b;
cin >> g >> first >> second >> z;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j) {
q[i][j] = g;
g = ((long long)g * first + second) % z;
}
for (int i = 1; i <= n; ++i) {
init(q[i], m);
for (int j = 1; j <= m - b + 1; ++j) w[i][j] = RMQ(j, j + b - 1);
}
long long ans = 0;
for (int j = 1; j <= m; ++j) {
for (int i = 1; i <= n; ++i) c[i] = w[i][j];
init(c, n);
for (int i = 1; i <= n - a + 1; ++i) ans += RMQ(i, i + a - 1);
}
cout << ans << '\n';
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
int flag;
int main() {
int T;
cin >> T;
for (; T--;) {
int n, x;
string s;
cin >> s >> x;
n = s.size();
vector<int> pd(n, -1);
flag = 1;
for (int i = 0; i < n; i++) {
if (s[i] == '0') {
if (i - x >= 0) pd[i - x] = 0;
if (i + x < n) pd[i + x] = 0;
}
}
for (int i = 0; i < n; i++)
if (pd[i] < 0) pd[i] = 1;
string ans;
for (int i = 0; i < n; i++) {
int w = 0;
if (i - x >= 0 && pd[i - x]) w = 1;
if (i + x < n && pd[i + x]) w = 1;
if (w != s[i] - '0') flag = 0;
ans += (pd[i] + '0');
}
if (flag)
cout << ans << endl;
else
cout << -1 << endl;
}
return 0;
}
| 3 |
#include <bits/stdc++.h>
int main() {
char a[105][105], x;
int i, j, n, c;
scanf("%d", &n);
scanf("%c", &x);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
scanf("%c", &a[i][j]);
}
scanf("%c", &x);
}
for (i = 1; i < n - 1; i++) {
for (j = 1; j < n - 1; j++) {
if (a[i][j] == '#' && a[i - 1][j] == '#' && a[i + 1][j] == '#' &&
a[i][j - 1] == '#' && a[i][j + 1] == '#') {
a[i][j] = a[i - 1][j] = a[i + 1][j] = a[i][j - 1] = a[i][j + 1] = '.';
}
}
}
c = 1;
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (a[i][j] == '#') c = 0;
}
}
if (c == 0)
printf("NO\n");
else
printf("YES\n");
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int a[100001], i, j, k, n;
int main() {
cin >> n;
for (i = 2; i <= n; i++) {
if (a[i] == 0)
for (j = i; j <= n; j += i) a[j]++;
if (a[i] == 2) k++;
}
cout << k;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const int nag = 2e5 + 5;
template <typename T>
void add(T& a, T b) {
a += b;
while (a >= mod) a -= mod;
while (a < 0) a += mod;
}
template <typename T>
void mul(T& a, T b) {
a = a * b % mod;
}
template <typename T>
void up_self(T& a, T b) {
a = max(a, b);
}
template <typename T>
void min_self(T& a, T b) {
a = min(a, b);
}
string find_largest_pref_palindrome(const string& a) {
string second = a;
reverse(second.begin(), second.end());
second = a + "%" + second;
int c = 0;
vector<int> pref(2 * ((int)a.size()) + 2);
for (int i = 1; i < second.size(); i++) {
while (c != 0 && second[i] != second[c]) c = pref[c - 1];
if (second[i] == second[c]) c++;
pref[i] = c;
}
return second.substr(0, c);
}
long long int binexpomodulo(long long int x, long long int y) {
long long int res = 1;
x %= mod;
if (!x) return 0;
while (y) {
if (y & 1) {
mul(res, x);
}
mul(x, x);
y >>= 1;
}
return res;
}
long long int nCrInOr(long long int n, long long int r) {
long long int res = 1;
if (r > n - r) r = n - r;
long long int rin = 1;
for (long long int i = 1; i <= r; i++) rin = (rin * i) % mod;
rin = binexpomodulo(rin, mod - 2);
for (long long int i = 1; i <= r; i++) res = (res * (n - i + 1)) % mod;
res = (res * rin) % mod;
return res;
}
int msb(long long int n) {
int ans;
for (int i = 0; i < 64; i++)
if (n & (1LL << i)) ans = i + 1;
return ans;
}
long long int get_(vector<long long int>& a, int pos) {
long long int res = 0;
for (; pos >= 0; pos = (pos & (pos + 1)) - 1) {
res += a[pos];
}
return res;
}
void upd(vector<long long int>& a, int pos, int val) {
for (; pos < a.size(); pos = (pos | (pos + 1))) a[pos] += val;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<int> b(n), a(2 * n);
for (int i = 0; i < n; i++) cin >> b[i];
;
set<int> in_b;
for (int i : b) {
in_b.insert(i);
}
vector<bool> available(2 * n + 1, true);
bool cant = false;
for (int i = 0; i < n; i++) {
int c = 0;
for (int j = b[i]; j <= 2 * n; j++) {
if ((c == 1 && available[j] && (in_b.find(j) == in_b.end())) || (!c)) {
available[j] = false;
a[2 * i + c] = j;
c++;
}
if (c == 2) break;
}
if (c < 2) {
cant = true;
break;
}
}
if (cant)
cout << -1 << "\n";
else {
for (int i = 0; i < a.size(); i++) cout << a[i] << " ";
cout << "\n";
;
}
}
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const int N = 2 * 1e5 + 10;
ll res;
ll a[N];
std::set<pair<ll, ll>> s;
std::vector<pair<ll, ll>> v;
void solve() {
ll x, y, xx, yy, n, rr;
cin >> x >> y >> xx >> yy >> n;
for (int i = min(x, xx); i <= max(x, xx); ++i) {
s.insert({i, min(y, yy)});
s.insert({i, max(y, yy)});
}
for (int i = min(y, yy); i <= max(y, yy); ++i) {
s.insert({min(x, xx), i});
s.insert({max(x, xx), i});
}
for (int i = 0; i < n; ++i) {
cin >> xx >> yy >> rr;
for (auto j : s) {
x = j.first, y = j.second;
if ((x - xx) * (x - xx) + (y - yy) * (y - yy) <= rr * rr) {
v.push_back({x, y});
}
}
for (auto j : v) {
s.erase({j.first, j.second});
}
}
cout << s.size();
}
int main(int argc, char const *argv[]) {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
ll t = 1;
while (t--) {
solve();
}
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n % 2 == 0) {
cout << -1;
return 0;
}
for (int i = 0; i < n; i++) cout << i << ' ';
cout << endl;
for (int i = 1; i <= n; i++) cout << i % n << ' ';
cout << endl;
for (int i = 0; i < n; i++) cout << (i + (i + 1) % n) % n << ' ';
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, ans = 0;
cin >> n;
double a[n], sum = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
if (sum / n >= 4.5)
cout << 0;
else {
sort(a, a + n);
for (i = 0; i < n; i++) {
if (a[i] != 5) {
sum = sum + 5 - a[i];
a[i] = 5;
ans++;
if (sum / n >= 4.5) {
cout << ans;
return 0;
}
}
}
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int a[100005], ans[100005];
int main(void) {
int n;
stack<int> s;
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (int i = n; i >= 1; i--) {
if (s.empty()) {
s.push(a[i]);
ans[i] = 0;
continue;
}
if (a[i] < s.top()) {
s.push(a[i]);
ans[a[i]] = 0;
} else if (a[i] > s.top()) {
int temp = max(1, ans[s.top()]);
s.pop();
while (!s.empty() && a[i] > s.top()) {
temp = max(temp + 1, ans[s.top()]);
s.pop();
}
ans[a[i]] = temp;
s.push(a[i]);
}
}
int k = 0;
for (int i = 1; i <= n; i++) k = max(k, ans[i]);
printf("%d\n", k);
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
long long n;
long long arr[123456];
long long dp[123456];
long long rec(long long id) {
if (dp[id] != -1) return !dp[id];
if (arr[id] == n) {
dp[id] = 0;
return 1;
}
long long x = arr[id];
long long pos = id;
int win = 0;
for (int i = 1; (x * i) <= n; i++) {
long long movR = pos + x * i;
long long movL = pos - x * i;
if (movL >= 1 && arr[movL] > x) {
win |= rec(movL);
}
if (movR <= n && arr[movR] > x) {
win |= rec(movR);
}
}
dp[id] = win;
return !win;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
long long pos[123456];
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
for (int i = 1; i <= n; i++) dp[i] = -1;
for (int i = 1; i <= n; i++) {
rec(i);
}
for (int i = 1; i <= n; i++) {
if (dp[i])
cout << "A";
else
cout << "B";
}
cout << endl;
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long testcases;
cin >> testcases;
for (int tcc = 0; tcc < testcases; tcc++) {
long long sum = 0, flag = 0, ans = 0;
long long i, j, k, w, x, y, z;
long long n, m, l, r, p, t, q;
cin >> x;
string s;
cin >> s;
set<int> s1 = {1, 4, 6, 8, 9},
s2 = {22, 33, 55, 77, 27, 25, 35, 32, 75, 72, 52, 57};
for (i = 0; i < x; i++) {
if (s1.find(s[i] - '0') != s1.end()) {
ans = s[i] - '0';
flag = 1;
break;
}
for (j = i + 1; j < x; j++) {
y = (s[i] - '0') * 10 + (s[j] - '0');
if (s2.find(y) != s2.end()) {
ans = y;
flag = 2;
break;
}
}
}
cout << flag << "\n" << ans;
cout << "\n";
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
;
solve();
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
pair<int, int> x[N];
int n, l = 1, ans;
int main() {
cin >> n;
for (int(i) = 0; (i) < (int)(n); (i)++) {
cin >> x[i].first;
x[x[i].first - 1].second = (i + 1);
}
if (n == 1) {
cout << "0";
return 0;
}
for (int i = 1; i < n; i++) {
if (x[i].second > x[i - 1].second)
l++;
else
l = 1;
ans = max(ans, l);
}
cout << n - ans;
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
cin.tie(0)->sync_with_stdio(false);
int n;
cin >> n;
ll arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
ll ans = 0;
;
for (int i = 1; i < n; i++) {
ans += arr[i] - arr[i - 1] - 1;
}
cout << ans << '\n';
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
long long read() {
long long x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x << 3) + (x << 1) + (ch ^ 48);
ch = getchar();
}
return x * f;
}
long long n, w, b, x, c[1005], cost[1005], f[1005][10005], C, a[10005], tot;
long long cmp(long long x, long long y) { return x > y; }
signed main() {
n = read();
w = read();
b = read();
x = read();
for (long long i = 1; i <= n; i++) c[i] = read(), C += c[i];
for (long long i = 1; i <= n; i++) cost[i] = read();
memset(f, -0x3f, sizeof(f));
f[0][0] = w;
for (long long i = 1; i <= n; i++) {
if (i != 1)
for (long long j = 0; j <= C; j++)
f[i][j] = min(f[i - 1][j] + x, w + b * j);
else
for (long long j = 0; j <= C; j++) f[i][j] = f[i - 1][j];
tot = 0;
for (long long k = 1; k <= c[i]; k *= 2) {
a[++tot] = k;
c[i] -= k;
}
if (c[i]) a[++tot] = c[i];
sort(a + 1, a + tot + 1, cmp);
for (long long k = 1; k <= tot; k++) {
for (long long j = C; j >= a[k]; j--) {
if (f[i][j - a[k]] >= cost[i] * a[k])
f[i][j] = max(f[i][j], f[i][j - a[k]] - cost[i] * a[k]);
}
}
}
long long ans = 0;
for (long long i = C; i >= 0; i--) {
if (f[n][i] >= 0) {
ans = i;
break;
}
}
cout << ans << endl;
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long>> G[1010];
vector<pair<long long, long long>> first[1010];
long long n, p;
long long from;
bool flg;
bool vis[1010];
bool loopvis[1010];
long long beg, End, mn;
bool _isloop(long long x, long long from) {
if (flg)
flg = 0;
else if (x == from)
return 1;
for (auto v : G[x])
if (!loopvis[v.first]) {
loopvis[v.first] = 1;
if (_isloop(v.first, from)) return 1;
}
return 0;
}
bool isloop(long long x) {
memset(loopvis, 0, sizeof(loopvis));
flg = 1;
return _isloop(x, x);
}
void findend(long long x) {
vis[x] = 1;
if (G[x].empty())
End = x;
else
mn = min(mn, G[x][0].second), findend(G[x][0].first);
}
void findbegin(long long x) {
vis[x] = 1;
if (first[x].empty())
beg = x;
else
mn = min(mn, first[x][0].second), findbegin(first[x][0].first);
}
vector<pair<pair<long long, long long>, long long>> ans;
signed main() {
cin >> n >> p;
for (long long i = 1, x, y, z; i <= p; i++) {
cin >> x >> y >> z;
G[x].push_back(make_pair(y, z));
first[y].push_back(make_pair(x, z));
}
for (long long i = 1; i <= n; i++)
if (!vis[i]) {
if (isloop(i)) continue;
beg = End = 0;
mn = 0x3f3f3f3f;
vis[i] = 1;
findend(i);
findbegin(i);
if (beg == End) continue;
ans.push_back(make_pair(make_pair(beg, End), mn));
}
sort(ans.begin(), ans.end());
cout << ans.size() << endl;
for (auto p : ans)
printf("%lld %lld %lld\n", p.first.first, p.first.second, p.second);
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T abs(T t) {
return t < 0 ? -t : t;
}
const long long modn = 1000000007;
inline long long mod(long long x) { return x % modn; }
const int N = 100005;
int n, u, v, tot;
int cnt[N], cl[N];
vector<int> adj[N];
int main() {
int i;
scanf("%d", &n);
for (i = 0; i < n - 1; i++) {
scanf("%d %d", &u, &v);
u--;
v--;
adj[u].push_back(v);
adj[v].push_back(u);
}
for (i = 0; i < n; i++) scanf("%d", &cl[i]);
for (i = 0; i < n; i++)
for (int ng : adj[i])
if (cl[i] != cl[ng]) {
cnt[i]++;
cnt[ng]++;
tot++;
}
for (i = 0; i < n; i++)
if (cnt[i] == tot) {
printf("YES\n%d\n", i + 1);
return 0;
}
printf("NO\n");
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
long long int power(long long int n, long long int b) {
long long int ans;
if (n == 0)
return 1;
else if (n % 2 == 0) {
ans = power(n / 2, b) % b;
return (ans % b * ans % b) % b;
} else
return 10 * (power(n - 1, b) % b);
}
int prefix[1000010], suffix[1000010];
string str;
int main() {
long long int a, b, i, j, l;
cin >> str;
scanf("%lld%lld", &a, &b);
l = str.length();
suffix[l] = 0;
long long int temp = 1;
for (i = l - 1; i >= 0; i--) {
suffix[i] = ((((str[i] - '0') * temp) % b) + suffix[i + 1]) % b;
temp = (temp * 10) % b;
}
int f = 0;
prefix[0] = 0;
for (i = 1; i < l; i++) {
prefix[i] = (prefix[i - 1] * 10 + str[i - 1] - '0') % a;
if (prefix[i] == 0 && suffix[i] == 0 && str[i] != '0') {
f = 1;
break;
}
}
if (f) {
cout << "YES" << endl;
cout << str.substr(0, i) << endl;
cout << str.substr(i);
} else
cout << "NO";
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
struct pawn {
long long int r;
long long int c;
};
struct pawn b[100], w[100];
int main() {
ios::sync_with_stdio(false);
char a;
long long int l = 0, h = 0;
for (int i = 1; i <= 8; i++) {
for (int j = 1; j <= 8; j++) {
cin >> a;
if (a == 'B') {
b[l].r = i;
b[l].c = j;
l++;
} else if (a == 'W') {
w[h].r = i;
w[h].c = j;
h++;
}
}
}
long long int w_r, w_c;
for (int i = 0; i < h; i++) {
int f = 0;
for (int j = 0; j < l; j++) {
if (b[j].r < w[i].r && b[j].c == w[i].c) {
f = 1;
break;
}
}
if (f == 0) {
w_r = w[i].r;
w_c = w[i].c;
break;
}
}
long long int b_r, b_c;
for (int i = l - 1; i >= 0; i--) {
int f = 0;
for (int j = h - 1; j >= 0; j--) {
if (w[j].r > b[i].r && w[j].c == b[i].c) {
f = 1;
break;
}
}
if (f == 0) {
b_r = b[i].r;
b_c = b[i].c;
break;
}
}
long long int diff_w = w_r - 1;
long long int diff_b = 8 - b_r;
if (diff_w == diff_b)
cout << "A" << endl;
else if (diff_w < diff_b)
cout << "A" << endl;
else
cout << "B" << endl;
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
long long int fun(long long int n, long long int m) {
if (m == 0) return 1;
if (m % 2 == 0) {
long long int an = (fun(n, m / 2)) % 1000000007;
return (an * an) % 1000000007;
} else {
long long int an = fun(n, m / 2);
long long h =
((an % 1000000007) * (an % 1000000007) % 1000000007) % 1000000007;
return (h * n) % 1000000007;
}
}
int main() {
long long int n, m, ans = 0;
cin >> n >> m;
ans = (fun(2, m) - 1) % 1000000007;
ans = fun(ans, n);
cout << ans << endl;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int mx[4] = {1, -1, 0, 0};
const int my[4] = {0, 0, 1, -1};
const int Nmax = 3;
int main() {
ios_base::sync_with_stdio(0);
int c1, c2, c3, c4;
cin >> c1 >> c2 >> c3 >> c4;
int n, m;
cin >> n >> m;
vector<int> a(n + 1), b(m + 1);
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= m; i++) cin >> b[i];
int Answer = c4;
Answer = min(c4, 2 * c3);
int f1 = 0, f2 = 0;
for (int i = 1; i <= n; i++)
if (c1 * a[i] < c2)
f1 += c1 * a[i];
else
f1 += c2;
for (int i = 1; i <= m; i++)
if (c1 * b[i] < c2)
f2 += c1 * b[i];
else
f2 += c2;
Answer = min(Answer, f1 + f2);
Answer = min(Answer, min(f1 + c3, c3 + f2));
cout << Answer << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int n, k, a[1000005], d[1000005], vd[1000005], v;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
for (int i = 1; i <= k; ++i) cin >> a[i];
v = 1;
for (int i = 1; i <= k; ++i) {
d[a[i]]++;
vd[d[a[i]]]++;
if (vd[v] == n) {
v++;
cout << 1;
} else
cout << 0;
}
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int64_t q;
cin >> q;
int64_t t, x, y;
vector<vector<int64_t> > ans(q);
for (int64_t i = 0; i < q; i++) {
cin >> t;
if (t == 1) {
cin >> x;
ans[i].push_back(x);
} else {
cin >> x >> y;
ans[i].push_back(x);
ans[i].push_back(y);
}
}
ans.shrink_to_fit();
map<int64_t, int64_t> m;
stack<int64_t> s;
for (int64_t i = q - 1; i >= 0; i--) {
if (ans[i].size() == 2) {
if (ans[i][0] != ans[i][1]) {
if (m.count(ans[i][1])) {
m[ans[i][0]] = m[ans[i][1]];
} else {
m[ans[i][0]] = ans[i][1];
}
}
} else {
int64_t p = ans[i][0];
if (m.count(p)) {
p = m[p];
}
s.push(p);
}
}
while (!s.empty()) {
cout << s.top() << " ";
s.pop();
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int64_t test = 1;
while (test--) {
solve();
}
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const double eps = 1e-9;
inline int read() {
int ret = 0, sgn = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') sgn = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
ret = ret * 10 + ch - '0';
ch = getchar();
}
return ret * sgn;
}
inline void Out(int a) {
if (a > 9) Out(a / 10);
putchar(a % 10 + '0');
}
long long __gcd(long long a, long long b) {
return b == 0 ? a : __gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a * b / __gcd(a, b); }
long long qpow(long long x, long long n, long long mod) {
if (n == 0) return 1;
long long res = qpow((x * x) % mod, n / 2, mod) % mod;
if (n & 1) res = (res * x) % mod;
return res % mod;
}
int Fermat(int a, int p) { return qpow(a, p - 2, p); }
long long exgcd(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long g = exgcd(b, a % b, x, y);
long long t = x;
x = y;
y = t - a / b * y;
return g;
}
const int N = 4e5 + 10;
const int inf = 0x7ffffff;
int n, m;
int res, tmp;
map<int, long long> mp;
int b[N];
int main() {
scanf("%d", &n);
mp.clear();
long long ans = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &b[i]);
mp[b[i] - i] += b[i];
ans = max(ans, mp[b[i] - i]);
}
printf("%lld\n", ans);
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e6 + 10;
const int M = 1e9 + 7;
long long ans[maxn], f[maxn];
int main() {
ans[1] = ans[2] = 0;
for (long long i = (3); i < (maxn); (i)++) {
ans[i] = (ans[i - 1] + 2 * ans[i - 2]) % M;
if (!f[i - 1] && !f[i - 2]) {
ans[i] = (ans[i] + 1) % M;
f[i] = 1;
}
}
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
cout << ans[n] * 4 % M << endl;
}
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
bool isPrime(int n) {
int k = 0;
for (int j = 2; j < sqrt(n); j++) {
if (j > n / 2) break;
if (n % j == 0) k++;
if (k > 0) {
return false;
break;
}
}
if (k == 0) return true;
}
bool isOnSameLine(int x1, int y1, int x2, int y2, int x3, int y3) {
return (y1 - y2) * (x1 - x3) == (y1 - y3) * (x1 - x2);
}
bool visited[200001], recStack[200001];
vector<vector<int> > G;
int N;
void BFS(int Start) {
queue<int> queue;
queue.push(Start);
vector<int>::iterator i;
while (!queue.empty()) {
Start = queue.front();
visited[Start] = true;
queue.pop();
for (i = G[Start].begin(); i != G[Start].end(); i++) {
if (!visited[*i]) queue.push(*i);
if (visited[*i]) {
N = *i;
return;
}
}
}
}
void bfs(int Start) {
queue<int> queue;
queue.push(Start);
vector<int>::iterator i;
while (!queue.empty()) {
Start = queue.front();
visited[Start] = true;
queue.pop();
for (i = G[Start].begin(); i != G[Start].end(); i++) {
if (!visited[*i]) queue.push(*i);
}
}
}
int main() {
int n;
cin >> n;
cout << 25;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100010;
int N, M;
multiset<int> adj[MAXN];
vector<int> odds, tour;
vector<pair<int, int> > add;
void dfs(int x) {
while (!adj[x].empty()) {
int t = *adj[x].begin();
adj[x].erase(adj[x].begin());
adj[t].erase(adj[t].find(x));
dfs(t);
}
tour.push_back(x);
}
void addedge(int x, int y) {
adj[x].insert(y);
adj[y].insert(x);
add.push_back(pair<int, int>(x, y));
}
int main() {
if (fopen("input.txt", "r")) {
freopen("input.txt", "r", stdin);
}
ios::sync_with_stdio(false);
cin >> N >> M;
for (int i = 0, a, b; i < M; i++) {
cin >> a >> b;
adj[a].insert(b);
adj[b].insert(a);
}
for (int i = 1; i <= N; i++) {
if (adj[i].size() & 1) {
odds.push_back(i);
}
}
for (int i = 0, sz = odds.size(); i < sz; i += 2) {
addedge(odds[i], odds[i + 1]);
}
if ((M + add.size()) & 1) {
addedge(1, 1);
}
dfs(1);
reverse((tour).begin(), (tour).end());
cout << M + add.size() << '\n';
for (int i = 0, sz = int(tour.size()) - 1; i < sz; i++) {
int u = tour[i], v = tour[i + 1];
if (i & 1) {
swap(u, v);
}
cout << u << ' ' << v << '\n';
}
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
int n, ans;
vector<int> g[200010];
int main() {
int i, j;
scanf("%d", &n);
if (n & 1) {
for (i = 2; i <= n; i += 2)
for (j = i + 2; j <= n; j += 2) {
ans++;
g[ans].push_back(i);
g[ans].push_back(j);
g[ans].push_back(i + 1);
g[ans].push_back(j + 1);
ans++;
g[ans].push_back(i);
g[ans].push_back(j);
g[ans].push_back(i + 1);
g[ans].push_back(j + 1);
}
for (i = 2; i <= n; i += 2) {
ans++;
g[ans].push_back(1);
g[ans].push_back(i);
g[ans].push_back(i + 1);
ans++;
g[ans].push_back(1);
g[ans].push_back(i);
g[ans].push_back(i + 1);
}
} else {
for (i = 1; i <= n; i += 2)
for (j = i + 2; j <= n; j += 2) {
if (i != 1 || j != 3) {
ans++;
g[ans].push_back(i);
g[ans].push_back(j);
g[ans].push_back(i + 1);
g[ans].push_back(j + 1);
}
if (i != 1) {
ans++;
g[ans].push_back(i);
g[ans].push_back(j);
g[ans].push_back(i + 1);
g[ans].push_back(j + 1);
}
}
for (i = 5; i <= n; i += 2) {
ans++;
g[ans].push_back(1);
g[ans].push_back(i);
g[ans].push_back(i + 1);
ans++;
g[ans].push_back(2);
g[ans].push_back(i);
g[ans].push_back(i + 1);
}
ans++;
g[ans].push_back(1);
g[ans].push_back(2);
g[ans].push_back(3);
ans++;
g[ans].push_back(1);
g[ans].push_back(2);
g[ans].push_back(4);
ans++;
g[ans].push_back(2);
g[ans].push_back(3);
g[ans].push_back(4);
ans++;
g[ans].push_back(1);
g[ans].push_back(3);
g[ans].push_back(4);
}
printf("%d\n", ans);
for (i = 1; i <= ans; i++) {
printf("%d", g[i].size());
for (j = 0; j < g[i].size(); j++) printf(" %d", g[i][j]);
printf("\n");
}
return 0;
}
| 10 |
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > range, tmp;
string mat[2000];
int check(int c, pair<int, int> R) {
int l, r;
l = R.first;
r = R.second;
for (int i = l + 1; i <= r; i++) {
if (mat[i][c] < mat[i - 1][c]) return 0;
}
int a, b;
a = b = l;
while (b <= r) {
while (mat[a][c] == mat[b][c] && b <= r) {
b++;
}
if (a != b - 1) tmp.push_back(make_pair(a, b - 1));
a = b;
}
return 1;
}
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
cin >> mat[i];
}
range.push_back(make_pair(1, n));
int res = 0;
for (int i = 0; i < m; i++) {
int flag = 0;
tmp.clear();
for (int k = 0; k < range.size(); k++) {
pair<int, int> R = range[k];
if (!check(i, R)) {
res++;
flag = 1;
break;
}
}
if (!flag) {
range = tmp;
}
}
cout << res << endl;
}
| 3 |
#include <bits/stdc++.h>
int main() {
char s[105], t[105];
int i, l, l2, j, c = 0;
scanf("%s %s", &s, &t);
l = strlen(s);
l2 = strlen(t);
for (i = 0, j = l2 - 1; i < l, j >= 0; i++, j--) {
if (s[i] == t[j]) {
c++;
}
}
if (c == l)
printf("YES");
else
printf("NO");
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 20010;
int n, m, p, arr[N], brr[N];
int f[N], g[N];
string ans;
inline int add(int x, int y) { return (x + y) % p; }
inline int val(int x, int y) { return (arr[x] + brr[y]) % p; }
inline int work(int sx, int sy, int ex, int ey) {
if (sx == ex) {
int ret = val(sx, sy);
for (int i = sy + 1; i <= ey; i++) ans.push_back('S'), ret += val(sx, i);
return ret;
}
int mid = (sx + ex) / 2;
memset(f, 0, sizeof(f));
memset(g, 0, sizeof(g));
for (int i = ex; i >= mid + 1; i--)
for (int j = ey; j >= sy; j--) f[j] = max(f[j], f[j + 1]) + val(i, j);
for (int i = sx; i <= mid; i++)
for (int j = sy; j <= ey; j++) g[j] = max(g[j], g[j - 1]) + val(i, j);
int pos = 0;
for (int i = sy; i <= ey; i++)
if (pos == 0 || (f[i] + g[i] > f[pos] + g[pos])) pos = i;
int ret = 0;
ret += work(sx, sy, mid, pos);
ans.push_back('C');
ret += work(mid + 1, pos, ex, ey);
return ret;
}
inline void solve() {
int answer = work(1, 1, n, m);
cout << answer << "\n" << ans << "\n";
}
int main() {
scanf("%d%d%d", &n, &m, &p);
for (int i = 1; i <= n; i++) scanf("%d", &arr[i]);
for (int i = 1; i <= m; i++) scanf("%d", &brr[i]);
solve();
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
long long lldmax = 1LL << 60;
const int N = 110000;
int a[N];
long long sum[N];
long long n, k;
map<long long, int> mp;
struct BIT {
void init(int n) {
memset(a, 0, sizeof(a));
this->n = n;
}
void update(int i, int b) {
while (i <= n) {
a[i] += b;
i += i & (-i);
}
}
int get(int i) {
int ans = 0;
while (i) {
ans += a[i];
i &= i - 1;
}
return ans;
}
void update(long long n) { update(mp[n], 1); }
int count(long long n) {
map<long long, int>::iterator it = mp.upper_bound(n);
int id;
if (it == mp.end())
id = N - 1;
else
id = (--it)->second;
return get(id);
}
int a[N], n;
} bit;
long long cal(long long num) {
bit.init(N - 1);
long long ans = 0;
for (int i = 1; i <= n; ++i) {
bit.update(sum[i - 1]);
ans += bit.count(sum[i] - num);
}
return ans;
}
int main() {
cin >> n >> k;
sum[0] = 0;
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
sum[i] = sum[i - 1] + a[i];
mp[sum[i]] = 0;
}
mp[0] = 0;
mp[-lldmax] = 0;
map<long long, int>::iterator it = mp.begin();
for (int i = 0; it != mp.end(); ++i, ++it) it->second = i;
long long l, r, m, ans;
l = -lldmax, r = lldmax;
while (l <= r) {
m = (l + r) / 2;
if (cal(m) >= k) {
ans = m;
l = m + 1;
} else {
r = m - 1;
}
}
cout << ans << endl;
return 0;
}
| 7 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.