solution
stringlengths 53
181k
| difficulty
int64 0
13
|
|---|---|
#include <bits/stdc++.h>
const int N = 1000010;
int n, k;
int u[30];
char t[30], a[N], b[N], s[N];
int go(int i, int p) {
if (i == n) {
return 1;
}
if (t[s[i]] != -1) {
if (p == 1) {
if (t[s[i]] < a[i]) {
return 0;
} else if (t[s[i]] > a[i]) {
return 1;
} else {
return go(i + 1, p);
}
} else if (p == 2) {
if (t[s[i]] > b[i]) {
return 0;
} else if (t[s[i]] < b[i]) {
return 1;
} else {
return go(i + 1, p);
}
} else if (p == 3) {
if (t[s[i]] > b[i] || t[s[i]] < a[i]) {
return 0;
} else if (t[s[i]] > a[i] && t[s[i]] < b[i]) {
return 1;
} else {
int np = 0;
if (t[s[i]] == a[i]) np |= 1;
if (t[s[i]] == b[i]) np |= 2;
return go(i + 1, np);
}
}
} else {
if (p == 1) {
if (!u[a[i]]) {
t[s[i]] = a[i];
u[a[i]] = 1;
if (go(i + 1, p)) return 1;
t[s[i]] = -1;
u[a[i]] = 0;
}
int f = -1;
for (int j = a[i] + 1; j < k; j++) {
if (!u[j]) {
f = j;
break;
}
}
if (f == -1) return 0;
t[s[i]] = f;
u[f] = 1;
return 1;
} else if (p == 2) {
if (!u[b[i]]) {
t[s[i]] = b[i];
u[b[i]] = 1;
if (go(i + 1, p)) return 1;
t[s[i]] = -1;
u[b[i]] = 0;
}
int f = -1;
for (int j = b[i] - 1; j >= 0; j--) {
if (!u[j]) {
f = j;
break;
}
}
if (f == -1) return 0;
t[s[i]] = f;
u[f] = 1;
return 1;
} else {
if (!u[a[i]]) {
t[s[i]] = a[i];
u[a[i]] = 1;
int np = a[i] == b[i] ? 3 : 1;
if (go(i + 1, np)) return 1;
t[s[i]] = -1;
u[a[i]] = 0;
}
if (a[i] != b[i] && !u[b[i]]) {
t[s[i]] = b[i];
u[b[i]] = 1;
if (go(i + 1, 2)) return 1;
t[s[i]] = -1;
u[b[i]] = 0;
}
int f = -1;
for (int j = a[i] + 1; j < b[i]; j++) {
if (!u[j]) {
f = j;
break;
}
}
if (f == -1) return 0;
t[s[i]] = f;
u[f] = 1;
return 1;
}
}
}
int checkb() {
for (int i = 0; i < n; i++) {
if (s[i] < b[i]) return 1;
if (s[i] > b[i]) return 0;
}
return 1;
}
int checka() {
for (int i = 0; i < n; i++) {
if (s[i] > a[i]) return 1;
if (s[i] < a[i]) return 0;
}
return 1;
}
int main() {
int T;
scanf("%d", &T);
while (T--) {
scanf("%d%s%s%s", &k, s, a, b);
for (int i = 0; i < k; i++) {
t[i] = -1;
u[i] = 0;
}
for (n = 0; s[n]; n++)
;
for (int i = 0; i < n; i++) {
a[i] -= 'a';
b[i] -= 'a';
s[i] -= 'a';
}
if (!go(0, 3)) {
puts("NO");
continue;
}
for (int i = 0; i < k; i++) {
if (t[i] == -1) {
for (int j = 0; j < k; j++) {
if (!u[j]) {
t[i] = j;
u[j] = 1;
break;
}
}
}
}
for (int i = 0; i < n; i++) {
s[i] = t[s[i]];
}
if (checkb() && checka()) {
puts("YES");
for (int i = 0; i < k; i++) {
t[i] += 'a';
}
t[k] = 0;
puts(t);
} else {
puts("NO");
}
}
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
const int INF = -1e9 - 1;
int a[200005] = {0};
int main() {
int n;
scanf("%d", &n);
int cnt1 = 0, cnt = 0, cnt0 = 0;
int max1 = INF, id1 = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (a[i] == 0) {
cnt0++;
}
if (a[i] < 0) {
cnt1++;
if (a[i] > max1) {
max1 = a[i];
id1 = i;
}
}
}
if (cnt1 % 2 != 0 && cnt0 == 0) {
printf("2 %d\n", id1);
a[id1] = INF;
cnt++;
}
int id = -1;
if (cnt0 != 0 && cnt1 % 2 != 0) {
id = id1;
}
for (int i = 1; i <= n; i++) {
if (a[i] == 0) {
if (id != -1) {
printf("1 %d %d\n", id, i);
a[id] = INF;
id = i;
cnt++;
} else {
id = i;
}
}
}
if (id != -1 && cnt != n - 1) {
printf("2 %d\n", id);
a[id] = INF;
}
id = -1;
for (int i = 1; i <= n; i++) {
if (a[i] != INF) {
if (id != -1) {
printf("1 %d %d\n", id, i);
id = i;
} else {
id = i;
}
}
}
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353, inv2 = 499122177;
int R;
vector <int> from[310];
int dp[310][310][2][2];
long long tmp[310][2][2];
long long power(int a, int b) {
if (!b) return 1;
long long tmp = power(a, b >> 1);
return b & 1 ? tmp * tmp % mod * a % mod : tmp * tmp % mod;
}
void add(int &x, int y) {
x += y;
if (x >= mod) x -= mod;
}
void dfs(int x, int last) {
for (int j = 0; j <= R; j++) {
for (int pd = 0; pd < 2; pd++) {
for (int has = 0; has < 2; has++) {
if (pd != (j == R || j == 0) || has != (j == R)) dp[x][j][pd][has] = 0;
else dp[x][j][pd][has] = (j == R ? mod - inv2 : j == 0 ? 1 : inv2);
}
}
}
for (int i = 0; i < from[x].size(); i++) {
int v = from[x][i];
if (v == last) continue;
dfs(v, x);
for (int j = 0; j <= R; j++) {
tmp[j][0][0] = tmp[j][1][0] = tmp[j][0][1] = tmp[j][1][1] = 0;
}
for (int j = 0; j <= R; j++) {
for (int pd = 0; pd < 2; pd++) {
for (int has = 0; has < 2; has++) {
for (int k = j - 1; k <= j + 1; k++) {
if (k < 0 || k > R) continue;
for (int hhh = 0; hhh < 2; hhh++) {
long long val = dp[v][k][1][hhh] + (j == k + 1 ? dp[v][k][0][hhh] : 0);
// cerr << " j:" << j << " " << pd << " " << has << " " << k << " " << hhh << " -> " << j << " " << (pd | (k == j + 1)) << " " << (has | hhh) << " " << val << "*" << dp[x][j][pd][has] << endl;
tmp[j][pd | (k == j + 1)][has | hhh] += val * dp[x][j][pd][has];
}
}
}
}
}
for (int j = 0; j <= R; j++) {
for (int pd = 0; pd < 2; pd++) {
for (int has = 0; has < 2; has++) {
dp[x][j][pd][has] = tmp[j][pd][has] % mod;
}
}
}
}
}
int main() {
int n; cin >> n;
for (int i = 1; i < n; i++) {
int x, y; cin >> x >> y;
from[x].push_back(y);
from[y].push_back(x);
}
int ans = 0;
for (R = 1; R <= n; R++) {
dfs(1, 1);
int sum = 0;
for (int i = 0; i <= R; i++) {
add(ans, mod - dp[1][i][1][1]), add(sum, mod - dp[1][i][1][1]);
}
}
cout << (ans - 1 + power(inv2, n)) % mod << endl;
return 0;
}
| 12 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const int MOD = 1e9 + 7;
const int oo = 1e9;
const long long INF = 1e18;
const long double EPS = 1e-11;
const int N = 1e5 + 2;
struct estado {
int a, b, ant;
bool ok;
estado() : a(-1), b(-1), ant(-1), ok(false) {}
};
estado dp[201][201][33];
void setEstado(int x, int y, int z, int a, int b, int ant) {
dp[x][y][z].a = a;
dp[x][y][z].b = b;
dp[x][y][z].ant = ant;
dp[x][y][z].ok = true;
}
int check(int x, int y, int z) {
if (dp[x][y][z].a != -1)
return 1;
else
return -1;
}
vector<int> results;
void go() {
for (int(i) = (0); (i) < (201); ++(i)) {
for (int(j) = (0); (j) < (201); ++(j)) {
if ((i == 25 && i - j >= 2) || (i > 25 && i - j == 2))
setEstado(i, j, 10, i, j, -1);
}
}
for (int(i) = (0); (i) < (201); ++(i)) {
for (int(j) = (0); (j) < (201); ++(j)) {
for (int(a) = (0); (a) < (201); ++(a)) {
int scA, scB = i - a;
if (a <= 23) {
scA = j - 25;
if (scA < 0 || scB < 0) continue;
int ant = 10;
if (check(scA, scB, ant) != -1) setEstado(j, i, 20, 25, a, ant);
} else {
scA = j - (a + 2);
if (scA < 0 || scB < 0) continue;
int ant = 10;
if (check(scA, scB, ant) != -1) setEstado(j, i, 20, a + 2, a, ant);
}
}
}
}
for (int(i) = (0); (i) < (201); ++(i)) {
for (int(j) = (0); (j) < (201); ++(j)) {
for (int(a) = (0); (a) < (201); ++(a)) {
int scA, scB = i - a;
if (a <= 23) {
scA = j - 25;
if (scA < 0 || scB < 0) continue;
int ant = 20;
if (check(scA, scB, ant) != -1) setEstado(j, i, 30, 25, a, ant);
} else {
scA = j - (a + 2);
if (scA < 0 || scB < 0) continue;
int ant = 20;
if (check(scA, scB, ant) != -1) setEstado(j, i, 30, a + 2, a, ant);
}
}
}
}
results.push_back(11);
results.push_back(21);
results.push_back(31);
results.push_back(22);
for (auto res : results) {
if (res % 10 == 0) continue;
for (int(i) = (0); (i) < (201); ++(i)) {
for (int(j) = (0); (j) < (201); ++(j)) {
for (int(a) = (0); (a) < (201); ++(a)) {
int scA = i - a, scB;
if (a <= 23) {
scB = j - 25;
if (scA < 0 || scB < 0) continue;
int ant = res - 1;
if (check(scA, scB, ant) != -1) setEstado(i, j, res, a, 25, ant);
} else {
scB = j - (a + 2);
if (scA < 0 || scB < 0) continue;
int ant = res - 1;
if (check(scA, scB, ant) != -1) setEstado(i, j, res, a, a + 2, ant);
}
}
}
}
}
int res = 32;
for (int(i) = (0); (i) < (201); ++(i)) {
for (int(j) = (0); (j) < (201); ++(j)) {
for (int(a) = (0); (a) < (201); ++(a)) {
int scA, scB = i - a;
if (a <= 13) {
scA = j - 15;
if (scA < 0 || scB < 0) continue;
int ant = 22;
if (check(scA, scB, ant) != -1) setEstado(j, i, 32, 15, a, ant);
} else {
scA = j - (a + 2);
if (scA < 0 || scB < 0) continue;
int ant = 22;
if (check(scA, scB, ant) != -1) setEstado(j, i, 32, a + 2, a, ant);
}
}
}
}
}
int vis[33];
bool cmp(int a, int b) {
int r = a / 10, s = a % 10;
int p = b / 10, q = b % 10;
int y = r - s, z = p - q;
return (y < z || (y == z && a < b));
}
void solve(int match, int a, int b, int volt) {
int s1 = match / 10, s2 = match % 10;
if (volt) swap(s1, s2);
cout << s1 << ":" << s2 << endl;
vector<pair<long long, long long> > ands;
ands.clear();
int flag = 0;
pair<long long, long long> foo;
foo.first = -1;
foo.second = -1;
while (1) {
if (match == 32 && flag == 0) {
foo.first = dp[a][b][match].a;
foo.second = dp[a][b][match].b;
flag = 1;
} else
ands.push_back({dp[a][b][match].a, dp[a][b][match].b});
if (dp[a][b][match].ant == -1) break;
int ant = dp[a][b][match].ant;
int aa = a, bb = b;
a -= dp[aa][bb][match].a;
b -= dp[aa][bb][match].b;
match = ant;
}
if (foo.first != -1) ands.push_back(foo);
for (int(i) = (0); (i) < (((int)ands.size())); ++(i)) {
pair<long long, long long> x = ands[i];
if (volt) swap(x.first, x.second);
cout << x.first << ":" << x.second;
if (i == ((int)ands.size()) - 1)
cout << endl;
else
cout << " ";
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
;
go();
vis[10] = vis[20] = vis[30] = vis[21] = vis[31] = vis[32] = 1;
results.clear();
results.push_back(31);
results.push_back(32);
results.push_back(13);
results.push_back(23);
results.push_back(30);
results.push_back(3);
sort((results).begin(), (results).end(), cmp);
reverse((results).begin(), (results).end());
int t;
cin >> t;
while (t--) {
int a, b;
cin >> a >> b;
int bien = 0;
for (auto res : results) {
if (!vis[res]) {
int res2 = (res % 10) * 10 + (res / 10);
if (dp[b][a][res2].ok) {
solve(res2, b, a, 1);
bien++;
break;
}
} else {
if (dp[a][b][res].ok) {
solve(res, a, b, 0);
bien++;
break;
}
}
}
if (!bien) {
cout << "Impossible" << endl;
}
}
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
const long long INF = 1e18 + 1LL;
const double Pi = acos(-1.0);
const int N = 5e5 + 10, M = 1e3 + 20, mod = 1e9 + 7, inf = 2e9;
long long sum[N][11], H[N], a[N], sum2[12];
int lazy[N][11], vis[12];
void push_down(int i, int ll, int rr) {
if (ll == rr) return;
for (int j = 0; j < 10; ++j)
vis[j] = lazy[i << 1][j], sum2[j] = sum[i << 1][j];
for (int j = 0; j < 10; ++j) {
if (lazy[i][j] != j) {
for (int k = 0; k < 10; ++k) {
if (lazy[i << 1][k] == j) vis[k] = lazy[i][j];
}
sum2[lazy[i][j]] += sum[i << 1][j];
sum2[j] -= sum[i << 1][j];
}
}
for (int j = 0; j < 10; ++j)
lazy[i << 1][j] = vis[j], sum[i << 1][j] = sum2[j];
for (int j = 0; j < 10; ++j)
vis[j] = lazy[i << 1 | 1][j], sum2[j] = sum[i << 1 | 1][j];
for (int j = 0; j < 10; ++j) {
if (lazy[i][j] != j) {
for (int k = 0; k < 10; ++k) {
if (lazy[i << 1 | 1][k] == j) vis[k] = lazy[i][j];
}
sum2[lazy[i][j]] += sum[i << 1 | 1][j];
sum2[j] -= sum[i << 1 | 1][j];
}
}
for (int j = 0; j < 10; ++j)
lazy[i << 1 | 1][j] = vis[j], sum[i << 1 | 1][j] = sum2[j];
for (int j = 0; j < 10; ++j) lazy[i][j] = j;
}
void push_up(int i, int ll, int rr) {
for (int j = 0; j <= 9; ++j) {
sum[i][j] = sum[i << 1][j] + sum[i << 1 | 1][j];
}
}
void build(int i, int ll, int rr) {
for (int j = 0; j < 10; ++j) lazy[i][j] = j;
if (ll == rr) {
for (int j = 0; j < 10; ++j) sum[i][j] = 0;
long long tmp = a[ll];
for (int j = 1; j <= 12; ++j) {
sum[i][tmp % 10] += H[j - 1];
tmp /= 10;
if (tmp == 0) break;
}
return;
}
build(i << 1, ll, ((ll + rr) >> 1));
build(i << 1 | 1, ((ll + rr) >> 1) + 1, rr);
push_up(i, ll, rr);
}
void update(int i, int ll, int rr, int x, int y, int f, int s) {
push_down(i, ll, rr);
if (ll == x && rr == y) {
for (int j = 0; j <= 9; ++j)
if (lazy[i][j] == f) {
lazy[i][j] = s;
sum[i][s] += sum[i][f];
sum[i][f] = 0;
}
return;
}
if (y <= ((ll + rr) >> 1))
update(i << 1, ll, ((ll + rr) >> 1), x, y, f, s);
else if (x > ((ll + rr) >> 1))
update(i << 1 | 1, ((ll + rr) >> 1) + 1, rr, x, y, f, s);
else {
update(i << 1, ll, ((ll + rr) >> 1), x, ((ll + rr) >> 1), f, s);
update(i << 1 | 1, ((ll + rr) >> 1) + 1, rr, ((ll + rr) >> 1) + 1, y, f, s);
}
push_up(i, ll, rr);
}
long long query(int i, int ll, int rr, int x, int y) {
push_down(i, ll, rr);
if (ll == x && rr == y) {
long long ret = 0;
for (int j = 1; j <= 9; ++j) {
ret += 1LL * j * sum[i][j];
}
return ret;
}
if (y <= ((ll + rr) >> 1))
return query(i << 1, ll, ((ll + rr) >> 1), x, y);
else if (x > ((ll + rr) >> 1))
return query(i << 1 | 1, ((ll + rr) >> 1) + 1, rr, x, y);
else {
return query(i << 1, ll, ((ll + rr) >> 1), x, ((ll + rr) >> 1)) +
query(i << 1 | 1, ((ll + rr) >> 1) + 1, rr, ((ll + rr) >> 1) + 1, y);
}
push_up(i, ll, rr);
}
int n, q;
int main() {
scanf("%d%d", &n, &q);
for (int i = 1; i <= n; ++i) {
scanf("%I64d", &a[i]);
}
H[0] = 1;
for (int i = 1; i <= 13; ++i) H[i] = H[i - 1] * 10;
build(1, 1, n);
for (int i = 1; i <= q; ++i) {
int op, x, y, l, r;
scanf("%d", &op);
if (op == 1) {
scanf("%d%d%d%d", &l, &r, &x, &y);
if (x == y) continue;
update(1, 1, n, l, r, x, y);
} else {
scanf("%d%d", &l, &r);
printf("%I64d\n", query(1, 1, n, l, r));
}
}
return 0;
}
| 10 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:64000000")
using namespace std;
const int MAXN = -1;
const int MOD = 1;
const double PHI = (sqrt(5.0) - 1) / 2.0;
int main() {
int k, n, m;
while (cin >> k >> n >> m) {
if (k > n * m)
cout << -1 << endl;
else {
int need[2] = {k / 2, (k + 1) / 2};
int cnt[2] = {0, 0};
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
int x = ((i + j) % 2) ^ 1;
int y = 0;
if (cnt[x] != need[x]) y = 2 * ++cnt[x] - x;
cout << y << " \n"[j + 1 == m];
}
}
}
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
set<pair<long long, long long> > s;
vector<pair<long long, long long> > ans;
int color[200010];
vector<int> adj[200010];
bool bfs(int u) {
queue<int> q;
q.push(u);
color[u] = 0;
while (!q.empty()) {
int s = q.front();
q.pop();
for (int(i) = (0); (i) < (((int)adj[s].size())); (i)++) {
int v = adj[s][i];
if (color[v] == -1) {
color[v] = 1 - color[s];
q.push(v);
} else if (color[s] == color[v])
return false;
}
}
return true;
}
int main() {
int n;
cin >> n;
for (int(i) = (0); (i) < (n); (i)++) {
int x, y;
cin >> x >> y;
adj[x].push_back(y);
adj[y].push_back(x);
s.insert(make_pair((x), (y)));
ans.push_back(make_pair((x), (y)));
}
for (int i = 1; 2 * i + 1 <= 2 * n; i++) {
int u = 2 * i, v = 2 * i + 1;
pair<long long, long long> a = make_pair((u), (v)), b = make_pair((v), (u));
if (s.find(a) == s.end() && s.find(b) == s.end()) {
adj[u].push_back(v);
adj[v].push_back(u);
}
}
int flag = 1;
memset(color, -1, sizeof(color));
for (int(i) = (1); (i) < (2 * n + 1); (i)++) {
if (color[i] == -1) {
if (!bfs(i)) {
flag = 0;
break;
}
}
}
if (flag) {
for (int(i) = (0); (i) < (((int)ans.size())); (i)++) {
int u = color[ans[i].first], v = color[ans[i].second];
cout << u + 1 << " " << v + 1 << endl;
}
} else
cout << -1 << endl;
return 0;
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
vector<int> child[1000001];
int par[1000001][20];
int dep[1000001];
int up[1000001];
int mnc[1000001];
void dfs(int x) {
mnc[x] = 9 * n;
if (child[x].empty()) mnc[x] = dep[x];
for (int i : child[x]) {
par[i][0] = x;
dep[i] = dep[x] + 1;
dfs(i);
mnc[x] = min(mnc[x], mnc[i]);
}
}
int getPar(int x, int t) {
t = max(t, 0);
for (int i = 20; i--;) {
if ((t >> i) & 1) x = par[x][i];
}
return x;
}
void dfs2(int x) {
if (child[x].empty()) {
up[x] = 1;
} else {
up[x] = (mnc[x] - k < dep[x]);
}
for (int i : child[x]) {
dfs2(i);
}
}
int dp1[1000001];
int dp2[1000001];
void dfs3(int x) {
if (child[x].empty()) {
dp1[x] = 1;
dp2[x] = 1;
} else {
int sum = 0, mx = 0;
for (int i : child[x]) {
dfs3(i);
sum += dp1[i];
mx = max(mx, dp2[i] - dp1[i]);
}
dp1[x] = up[x] ? sum : 0;
dp2[x] = sum + mx;
}
}
int main() {
scanf("%d%d", &n, &k);
for (int i = 2; i <= n; ++i) {
int p;
scanf("%d", &p);
child[p].push_back(i);
}
dfs(1);
for (int i = 1; i < 20; ++i) {
for (int j = 1; j <= n; ++j) {
par[j][i] = par[par[j][i - 1]][i - 1];
}
}
dfs2(1);
dfs3(1);
printf("%d\n", dp2[1]);
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
int k, n, maxb, t, s, sum, a[100005], b[100005], f[100005], tree[100005];
int lowbit(int x) { return x & (-x); }
int find(int x) {
int s = 0;
for (; x; x -= lowbit(x)) s = max(tree[x], s);
return s;
}
void gg(int x, int y) {
for (; x <= maxb; x += lowbit(x)) tree[x] = max(tree[x], y);
}
int main() {
cin >> k >> n >> maxb >> t;
while (k--) {
s = sum = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (b[a[i]] != k + 1) sum++;
b[a[i]] = k + 1;
}
if (t >= sum) {
cout << sum << endl;
continue;
}
memset(tree, 0, sizeof(tree));
memset(f, 0, sizeof(f));
for (int i = 1; i <= t; i++)
for (int j = 1; j <= n; j++) {
int c = find(a[j] - 1) + 1;
if (c > f[j]) {
f[j] = c;
s = max(s, c);
gg(a[j], c);
}
if (s > sum) break;
}
printf("%d\n", s);
}
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
long long trie[6200000][2], mark[6200000][2], sz = 0;
vector<long long> bin;
void insrt(string s) {
long long v = 0;
for (long long i = 0; i < s.size(); ++i) {
long long c = s[i] - '0';
if (trie[v][c] == -1) trie[v][c] = ++sz;
mark[v][c]++;
v = trie[v][c];
}
}
void dlt(string s) {
long long v = 0;
for (long long i = 0; i < s.size(); ++i) {
long long c = s[i] - '0';
mark[v][c]--;
v = trie[v][c];
}
}
void srch(string s) {
long long v = 0;
for (long long i = 0; i < s.size(); ++i) {
long long c = s[i] - '0';
if (trie[v][c] == -1 || mark[v][c] < 1) c ^= 1;
bin.push_back(c);
v = trie[v][c];
}
}
long long dec() {
long long val = 1, sum = 0;
for (long long i = bin.size() - 1; i >= 0; --i) {
if (bin[i] == 1) sum += val;
val *= 2;
}
return sum;
}
void clr() {
memset(trie, -1, sizeof(trie));
memset(mark, 0, sizeof(mark));
sz = 0;
}
int main() {
long long q, n;
char ch;
cin >> q;
clr();
string s;
s = bitset<31>(0).to_string();
insrt(s);
while (q--) {
cin >> ch >> n;
s = bitset<31>(n).to_string();
if (ch == '+') insrt(s);
if (ch == '-') dlt(s);
if (ch == '?') {
long long xr = n ^ 1073741823;
string ss = bitset<31>(xr).to_string();
srch(ss);
long long val = dec();
bin.clear();
val ^= n;
cout << val << endl;
}
}
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto& x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int tt;
cin >> tt;
while (tt--) {
int n;
cin >> n;
string s(n, '?');
auto Ask = [&](string t) {
cout << "? " << t << endl;
int foo;
cin >> foo;
for (int i = 0; i < foo; i++) {
int bar;
cin >> bar;
--bar;
for (int j = 0; j < (int)t.size(); j++) {
s[bar + j] = t[j];
}
}
};
if (n <= 7) {
Ask("CH");
Ask("CO");
if (s == string(n, '?')) {
if (n == 4) {
Ask("HO");
if (s == string(n, '?')) {
Ask("OH");
if (s == string(n, '?')) {
Ask("CCC");
if (s == string(n, '?')) {
Ask("OOO");
if (s[0] == 'O') {
if (s[n - 1] == '?') s[n - 1] = 'C';
} else {
Ask("HHH");
if (s[0] == 'H') {
if (s[n - 1] == '?') s[n - 1] = 'C';
} else {
Ask("OOCC");
if (s == string(n, '?')) s = "HHCC";
}
}
} else {
Ask("HCCC");
Ask("OCCC");
}
} else {
for (int i = 0; i < n; i++) {
if (s[i] == '?') {
s[i] = 'O';
} else {
break;
}
}
goto haha;
}
} else {
goto haha;
}
} else {
Ask("CC");
if (s[1] != '?' && s[0] == '?') {
string q = s;
q[0] = 'H';
Ask(q);
if (s[0] == '?') {
s[0] = 'O';
}
} else {
Ask("OH");
Ask("HO");
if (s == string(n, '?')) {
Ask(string(n, 'H'));
Ask(string(n, 'O'));
if (s == string(n, '?')) {
string q(n, 'H');
q[n - 1] = 'C';
Ask(q);
if (s == string(n, '?')) {
s = string(n, 'O');
s[n - 1] = 'C';
}
}
} else {
if (s[n - 1] == 'C' && s.find("H") == string::npos &&
s.find("O") == string::npos) {
string q = s;
for (int i = 0; i < n; i++) {
if (q[i] == '?') {
q[i] = 'H';
}
}
Ask(q);
if (s[0] == '?') {
for (int i = 0; i < n; i++) {
if (s[i] == '?') {
s[i] = 'O';
}
}
}
} else {
int beg = 0;
while (beg < n) {
if (s[beg] != '?') {
++beg;
continue;
}
int end = beg;
while (end + 1 < n && s[end + 1] == '?') {
++end;
}
if (beg == 0) {
for (int i = beg; i <= end; i++) {
s[i] = s[end + 1];
}
} else {
for (int i = beg; i <= end; i++) {
s[i] = s[beg - 1];
}
}
beg = end + 1;
}
string q = s;
q[n - 1] = 'C';
Ask(q);
}
}
}
}
} else {
haha:
while (true) {
bool any = false;
for (int i = 0; i < n; i++) {
if (s[i] == '?') {
any = true;
break;
}
}
if (!any) {
break;
}
bool found = false;
for (int i = 0; i + 4 < n; i++) {
if (s[i] == '?' && s[i + 1] != '?' && s[i + 2] != '?' &&
s[i + 3] != '?' && s[i + 4] != '?') {
string q = "C";
q += s[i + 1];
q += s[i + 2];
q += s[i + 3];
q += s[i + 4];
Ask(q);
if (s[i] == '?') {
q[0] = 'O';
Ask(q);
if (s[i] == '?') {
s[i] = 'H';
}
}
found = true;
break;
}
}
if (found) continue;
for (int i = 0; i + 4 < n; i++) {
if (s[i] != '?' && s[i + 1] != '?' && s[i + 2] != '?' &&
s[i + 3] != '?' && s[i + 4] == '?') {
string q = "";
q += s[i];
q += s[i + 1];
q += s[i + 2];
q += s[i + 3];
q += "C";
Ask(q);
if (s[i + 4] == '?') {
q[4] = 'O';
Ask(q);
if (s[i + 4] == '?') {
s[i + 4] = 'H';
}
}
found = true;
break;
}
}
if (found) continue;
for (int i = 0; i + 3 < n; i++) {
if (s[i] == '?' && s[i + 1] != '?' && s[i + 2] != '?' &&
s[i + 3] != '?') {
string q = "C";
q += s[i + 1];
q += s[i + 2];
q += s[i + 3];
Ask(q);
if (s[i] == '?') {
q[0] = 'O';
Ask(q);
if (s[i] == '?') {
s[i] = 'H';
}
}
found = true;
break;
}
}
if (found) continue;
for (int i = 0; i + 3 < n; i++) {
if (s[i] != '?' && s[i + 1] != '?' && s[i + 2] != '?' &&
s[i + 3] == '?') {
string q = "";
q += s[i];
q += s[i + 1];
q += s[i + 2];
q += "C";
Ask(q);
if (s[i + 3] == '?') {
q[3] = 'O';
Ask(q);
if (s[i + 3] == '?') {
s[i + 3] = 'H';
}
}
found = true;
break;
}
}
if (found) continue;
for (int i = 0; i + 2 < n; i++) {
if (s[i] == '?' && s[i + 1] != '?' && s[i + 2] != '?') {
string q = "C";
q += s[i + 1];
q += s[i + 2];
Ask(q);
if (s[i] == '?') {
q[0] = 'O';
Ask(q);
if (s[i] == '?') {
s[i] = 'H';
}
}
found = true;
break;
}
}
if (found) continue;
for (int i = 0; i + 2 < n; i++) {
if (s[i] != '?' && s[i + 1] != '?' && s[i + 2] == '?') {
string q = "";
q += s[i];
q += s[i + 1];
q += "C";
Ask(q);
if (s[i + 2] == '?') {
q[2] = 'O';
Ask(q);
if (s[i + 2] == '?') {
s[i + 2] = 'H';
}
}
found = true;
break;
}
}
assert(found);
}
}
} else {
Ask("CH");
Ask("CO");
Ask("HC");
Ask("HO");
Ask("OC");
if (s == string(n, '?')) {
Ask(string(n, 'C'));
if (s == string(n, '?')) {
Ask("OHH");
if (s == string(n, '?')) {
Ask(string(n - 1, 'O'));
if (s == string(n, '?')) {
s = string(n, 'H');
} else {
if (s[n - 1] == '?') {
s[n - 1] = 'H';
}
}
} else {
for (int i = 0; i < n; i++) {
if (s[i] == '?') {
s[i] = 'O';
} else {
break;
}
}
for (int i = n - 1; i >= 0; i--) {
if (s[i] == '?') {
s[i] = 'H';
} else {
break;
}
}
}
}
} else {
Ask("OHH");
int pref = 0, suf = 0;
int beg = 0;
while (beg < n) {
if (s[beg] != '?') {
++beg;
continue;
}
int end = beg;
while (end + 1 < n && s[end + 1] == '?') {
++end;
}
if (beg == 0) {
if (s[end + 1] != 'H') {
for (int i = beg; i <= end; i++) {
s[i] = s[end + 1];
}
} else {
pref = end + 1;
}
} else {
if (end == n - 1) {
if (s[beg - 1] != 'O') {
for (int i = beg; i <= end; i++) {
s[i] = s[beg - 1];
}
} else {
for (int i = beg; i <= end - 1; i++) {
s[i] = 'O';
}
suf = 1;
}
} else {
if (s[beg - 1] == 'O' && s[end + 1] == 'H') {
for (int i = beg; i <= end; i++) {
s[i] = 'O';
}
} else {
assert(s[beg - 1] == s[end + 1]);
for (int i = beg; i <= end; i++) {
s[i] = s[beg - 1];
}
}
}
}
beg = end + 1;
}
if (pref > 0) {
string q = s;
if (suf > 0) {
q.pop_back();
}
for (int i = 0; i < pref; i++) {
q[i] = 'O';
}
Ask(q);
if (s[0] == '?') {
for (int i = 0; i < pref; i++) {
s[i] = 'H';
}
}
}
if (suf > 0) {
string q = s;
q[n - 1] = 'O';
Ask(q);
if (s[n - 1] == '?') {
s[n - 1] = 'H';
}
}
}
}
cout << "! " << s << endl;
int foo;
cin >> foo;
if (foo == 0) break;
}
return 0;
}
| 13 |
#include <bits/stdc++.h>
using namespace std;
long long n, ar[100004], ans;
long long mod = 1e9 + 7;
long long bucket[250];
vector<long long> d;
long long expo(long long v, long long e) {
if (e == 0) return 1;
if (e == 1) return v;
long long x = expo(v, e / 2);
x = (x * x) % mod;
if (e % 2 == 1) {
x = (x * v) % mod;
}
return x;
}
void divs(long long x) {
d.clear();
vector<long long> v;
for (int i = 1; i < sqrt(x + 1) + 1; i++) {
if (x / i < i) break;
;
if (x % i == 0) {
d.push_back(i);
if (x / i != i) v.push_back(x / i);
}
}
for (int i = v.size() - 1; i >= 0; i--) d.push_back(v[i]);
return;
}
long long solve(long long x) {
divs(x);
for (int i = 0; i < d.size(); i++) bucket[i] = 0;
long long start = 0;
for (int i = 1; i < d.size(); i++) {
long long low = start;
long long high = n - 1;
long long res = high;
while (low <= high) {
long long mid = (low + high) / 2;
if (ar[mid] >= d[i]) {
high = mid - 1;
res = min(res, mid);
} else {
low = mid + 1;
}
}
bucket[i - 1] = low - start;
start = low;
}
bucket[d.size() - 1] = n - start;
long long res = 1;
for (int i = 0; i < d.size() - 1; i++) {
res = (res * expo(i + 1, bucket[i])) % mod;
}
res = (res *
(expo(d.size(), bucket[d.size() - 1]) -
expo(d.size() - 1, bucket[d.size() - 1]) + mod) %
mod) %
mod;
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> ar[i];
}
sort(ar, ar + n);
ans = 1;
for (int i = 2; i < ar[n - 1] + 1; i++) {
ans = (ans + solve(i)) % mod;
}
cout << ans << endl;
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
int n, K;
int c[500 + 10];
bool dp[500 + 10][500 + 10];
int st[500 + 10], t = 0;
int main() {
scanf("%d%d", &n, &K);
for (int i = 1; i <= n; i++) scanf("%d", &c[i]);
dp[0][0] = 1;
for (int i = 1; i <= n; i++)
for (int j = K; j >= 0; j--)
for (int k = K; k >= 0; k--) {
if (!dp[j][k]) continue;
if (j + c[i] <= K) dp[j + c[i]][k] = true;
if (k + c[i] <= K) dp[j][k + c[i]] = true;
}
for (int i = 0; i <= K; i++) {
if (dp[i][K - i]) st[t++] = i;
}
printf("%d\n", t);
for (int i = 0; i < t; i++) {
if (i) printf(" ");
printf("%d", st[i]);
}
printf("\n");
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
queue<int> que;
int n, k;
int main() {
while (cin >> n >> k) {
if (k == 0) {
cout << 1;
for (int i = 2; i < 2 * n + 1; i++) cout << " " << i;
cout << endl;
continue;
}
cout << k + 1;
for (int i = 1; i < 2 * n + 1; i++)
if (i != k + 1) que.push(i);
while (!que.empty()) {
cout << " " << que.front();
que.pop();
}
cout << endl;
}
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 55;
template <class T>
inline void _read(T &x) {
x = 0;
char t = getchar();
while (!isdigit(t)) t = getchar();
while (isdigit(t)) {
x = x * 10 + t - '0';
t = getchar();
}
}
int n;
long double fac[MAXN], f[MAXN][MAXN], tmp[MAXN];
vector<int> G[MAXN];
int siz[MAXN];
inline long double C(int n, int m) { return fac[n] / fac[m] / fac[n - m]; }
inline void dfs(int u, int fa) {
siz[u] = 1;
f[u][0] = 1;
for (auto v : G[u]) {
if (v == fa) continue;
dfs(v, u);
fill(tmp, tmp + siz[u] + siz[v], 0);
int tot = siz[u] + siz[v] - 1;
for (int p = 0; p < siz[u]; ++p)
for (int q = 0; q <= siz[v]; ++q)
tmp[p + q] +=
f[u][p] * f[v][q] * C(p + q, p) * C(tot - p - q, siz[v] - q);
siz[u] += siz[v];
for (int j = 0; j < siz[u]; ++j) f[u][j] = tmp[j];
}
if (fa) {
for (int i = 0; i <= siz[u]; ++i) tmp[i] = 0;
for (int i = 0; i <= siz[u]; ++i) {
tmp[i] += (siz[u] - i) * f[u][i];
for (int j = i + 1; j <= siz[u]; ++j) tmp[j] += f[u][i] * 0.5;
}
for (int i = 0; i <= siz[u]; ++i) f[u][i] = tmp[i];
}
}
int main() {
fac[0] = 1;
for (int i = 1; i <= 50; ++i) fac[i] = fac[i - 1] * i;
_read(n);
for (int i = 1, u, v; i < n; ++i)
_read(u), _read(v), G[u].push_back(v), G[v].push_back(u);
for (int i = 1; i <= n; ++i) {
dfs(i, 0);
printf("%.10lf\n", (double)f[i][n - 1] / (double)fac[n - 1]);
}
return 0;
}
| 10 |
#include <bits/stdc++.h>
using namespace std;
int h1, h2;
int a, b;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> h1 >> h2;
cin >> a >> b;
if (h1 + a * 8 >= h2) {
cout << 0 << '\n';
return 0;
}
if (b >= a) {
cout << -1 << '\n';
return 0;
}
h1 += a * 8;
int res = 0;
while (h1 < h2) {
h1 -= b * 12;
res++;
h1 += a * 12;
}
cout << res << '\n';
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const long long inf = 3e18;
const int inf2 = 1e9 + 2;
const int mod = 1000000007;
inline int mf(int a, int b) {
int buf = 0;
if (a % b != 0) buf++;
if ((a >= 0 && b >= 0) || (a < 0 && b < 0)) return a / b + buf;
return a / b;
}
pair<int, int> ma[300003];
int cht[300003];
pair<int, int> cht_inf[300003];
int need_ans[300003];
pair<int, pair<int, int> > nnew[300003];
int nnew_pos = 0, need_ans_pos = 0, answ_pos, cht_pos, all_pos, all2_pos;
long long answ[300003];
int answ2[300003];
pair<int, pair<int, int> > all[300003];
pair<int, pair<int, int> > all2[300003];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int dop = 800;
vector<char> used(n);
vector<long long> answw;
int pos = 0;
for (int c = 0; c < n; c += dop) {
int r = min(n, c + dop);
need_ans_pos = 0;
nnew_pos = 0;
answ_pos = 0;
cht_pos = 0;
all2_pos = 0;
for (int k = c; k < r; k++) {
int t;
cin >> t;
if (t == 1) {
int a, b;
cin >> a >> b;
nnew[nnew_pos++] = {a, {b, k}};
ma[k] = {a, b};
}
if (t == 2) {
int a;
cin >> a;
used[a - 1] = true;
for (int i = 0; i < need_ans_pos; i++) {
if (answ2[i] < a) continue;
answ[i] = max(answ[i],
ma[a - 1].first * 1ll * need_ans[i] + ma[a - 1].second);
}
}
if (t == 3) {
int a;
cin >> a;
need_ans[need_ans_pos++] = a;
answ[answ_pos] = -inf;
answ2[answ_pos++] = k;
int y = answ_pos - 1;
for (int j = 0; j < nnew_pos; j++) {
if (!used[nnew[j].second.second]) {
answ[y] =
max(answ[y], a * 1ll * nnew[j].first + nnew[j].second.first);
}
}
}
}
for (int j = 0; j < all_pos; j++) {
auto i = all[j];
if (cht_pos && cht_inf[cht_pos - 1].first == i.first) {
cht_pos--;
}
if (used[i.second.second]) continue;
while (cht_pos > 1) {
pair<int, int> lt = {cht_inf[cht_pos - 1].first,
cht_inf[cht_pos - 1].second};
int xnew = mf(i.second.first - lt.second, lt.first - i.first);
if (xnew < cht[cht_pos - 1]) {
cht_pos--;
} else
break;
}
if (cht_pos == 0) {
cht[cht_pos] = -inf2;
cht_inf[cht_pos++] = {i.first, i.second.first};
continue;
}
pair<int, int> lt = {cht_inf[cht_pos - 1].first,
cht_inf[cht_pos - 1].second};
int xnew = mf(i.second.first - lt.second, lt.first - i.first);
cht[cht_pos] = xnew;
cht_inf[cht_pos++] = {i.first, i.second.first};
}
int u = 0;
for (int j = 0; j < need_ans_pos; j++) {
int i = need_ans[j];
if (!cht_pos) break;
int l = 0, r = cht_pos;
while (l + 1 < r) {
int mid = (l + r) / 2;
if (cht[mid] <= i)
l = mid;
else
r = mid;
}
answ[u] = max(answ[u],
need_ans[u] * 1ll * cht_inf[l].first + cht_inf[l].second);
u++;
}
for (int j = 0; j < answ_pos; j++) {
answw.push_back(answ[j]);
}
sort(nnew, nnew + nnew_pos);
int l1 = 0, l2 = 0;
while (l1 < all_pos && l2 < nnew_pos) {
if (all[l1] < nnew[l2]) {
all2[all2_pos++] = all[l1++];
} else
all2[all2_pos++] = nnew[l2++];
}
while (l1 < all_pos) all2[all2_pos++] = all[l1++];
while (l2 < nnew_pos) all2[all2_pos++] = nnew[l2++];
for (int c = 0; c < all2_pos; c++) all[c] = all2[c];
all_pos = all2_pos;
pos++;
}
for (auto i : answw) {
if (i == -inf)
cout << "EMPTY SET\n";
else
cout << i << "\n";
}
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e5 + 123;
const long long INF = (long long)1e18 + 123;
const int inf = (int)1e9 + 123;
long long n, a[2 * N], cnt;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (long long i = 1; i <= n;) {
cnt++;
long long i1 = i;
while (i1 <= n && a[i1] == -1) i1++;
if (i1 == n + 1) break;
long long i2 = i1 + 1;
while (i2 <= n && a[i2] == -1) i2++;
if (i2 == n + 1) break;
if ((a[i2] - a[i1]) % (i2 - i1) != 0) {
i = i2;
continue;
}
long long d = (a[i2] - a[i1]) / (i2 - i1);
if (d > 0 && a[i2] - (i2 - i) * d <= 0) {
i = i2;
continue;
}
long long i3 = i2 + 1;
while (i3 <= n) {
long long nneexxtt = a[i2] + (i3 - i2) * d;
if (nneexxtt != a[i3] && a[i3] != -1) break;
if (nneexxtt <= 0) break;
i3++;
}
i = i3;
}
cout << cnt;
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5, mod = 1e9 + 7;
int n, q, pre[N], fa[N];
long long a[N], bw[N], sum[N], psu[N], po2[N], ans[N];
struct qr {
int l, r, i;
bool operator<(const qr &o) const { return r == o.r ? l > o.l : r < o.r; }
} b[N];
int get(int x) { return fa[x] == x ? x : fa[x] = get(fa[x]); }
void merge(int x, int y) {
fa[x] = y, pre[y] = pre[x];
if (x - pre[x] > 30 || (psu[y] << (x - pre[x])) + psu[x] > mod) {
psu[y] = mod;
} else {
psu[y] = (psu[y] << (x - pre[x])) + psu[x];
}
}
long long querysum(int l, int r) {
return (bw[l] - bw[r + 1] * po2[r - l + 1] % mod + mod) % mod;
}
void insert(int i) {
for (; pre[i] && psu[i] > 0; merge(pre[i], i))
;
sum[i] = (sum[pre[i]] + (querysum(pre[i] + 1, i) << 1)) % mod;
}
long long query(int l, int r) {
int x = get(l);
return (sum[r] - sum[x] + querysum(l, x) + mod) % mod;
}
int main() {
scanf("%d%d", &n, &q);
for (int i = 1; i <= n; ++i) {
scanf("%lld", &a[i]);
psu[i] = a[i], pre[i] = i - 1, fa[i] = i;
}
po2[0] = 1;
for (int i = 1; i <= n; ++i) {
po2[i] = po2[i - 1] * 2 % mod;
}
bw[n] = a[n];
for (int i = n - 1; i; --i) {
bw[i] = (bw[i + 1] * 2 + a[i] + mod) % mod;
}
for (int i = 1; i <= q; ++i) {
scanf("%d%d", &b[i].l, &b[i].r);
b[i].i = i;
}
sort(b + 1, b + q + 1);
for (int i = 1, las = 0; i <= q; ++i) {
for (int j = las + 1; j <= b[i].r; ++j) {
insert(j);
}
las = b[i].r;
ans[b[i].i] = query(b[i].l, b[i].r);
}
for (int i = 1; i <= q; ++i) {
printf("%lld\n", ans[i]);
}
return 0;
}
| 12 |
#include <bits/stdc++.h>
int a[112];
double t[112];
int x, y;
int z_abs(int k) {
if (k < 0) k *= -1;
return (k);
}
double dis(int k) {
double t1, t2, t;
t1 = (double)k - (double)x;
t2 = (double)y;
t1 = t1 * t1;
t2 = t2 * t2;
t = sqrt(t1 + t2);
return (t);
}
int main() {
int i, o, p, j, k, l, n, m, vs, vb, tt;
scanf("%d %d %d", &n, &vb, &vs);
tt = 0;
for (i = 1; i <= n; ++i) scanf("%d", &a[i]);
scanf("%d %d", &x, &y);
for (i = 2; i <= n; ++i) {
tt += z_abs(a[i] - a[i - 1]);
t[i] = (double)tt * (double)vs + dis(a[i]) * (double)vb;
}
p = 2;
for (i = 3; i <= n; ++i) {
if (t[i] == t[p]) {
if (dis(a[i]) < dis(a[p])) p = i;
} else if (t[i] < t[p])
p = i;
}
printf("%d\n", p);
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 200;
struct po {
int cnt, t, num;
bool operator<(const po b) const {
return (cnt > b.cnt) || (cnt == b.cnt && t < b.t);
}
} b[N];
int sum[N];
int ans[N];
int main() {
int n, k, m, a;
scanf("%d%d%d%d", &n, &k, &m, &a);
for (int i = 1; i <= n; i++) b[i].num = i;
for (int i = 1; i <= a; i++) {
int x;
scanf("%d", &x);
b[x].cnt++;
b[x].t = i;
}
sort(b + 1, b + n + 1);
for (int i = n; i > 0; i--) sum[i] = b[i].cnt + sum[i + 1];
m -= a;
if (m == 0) {
for (int i = 1; i <= k; i++)
if (b[i].cnt)
ans[b[i].num] = 1;
else
ans[b[i].num] = 3;
for (int i = k + 1; i <= n; i++) ans[b[i].num] = 3;
} else {
int flag = 0;
for (int i = 1; i <= k; i++)
if (b[i].cnt) {
if ((b[i].cnt + 1) * (k - i + 1) - sum[i + 1] + sum[k + 2] <= m &&
k != n)
ans[b[i].num] = 2;
else
ans[b[i].num] = 1;
} else
ans[b[i].num] = 2, flag = 1;
if (flag)
for (int i = k + 1; i <= n; i++) ans[b[i].num] = 2;
else
for (int i = k + 1; i <= n; i++)
if (b[k].cnt + 1 - b[i].cnt <= m)
ans[b[i].num] = 2;
else
ans[b[i].num] = 3;
}
for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
return 0;
}
| 6 |
using namespace std;
#include<bits/stdc++.h>
#define int long long
#define all(x) x.begin(), x.end()
#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
const int N = 2e5+3;
signed main()
{
IOS;
int t; cin>>t; while(t--)
{
int n; cin>>n;
vector<int>temp(10);
for ( int i = 0; i<10; ++i )
temp[i] = i;
if (n==1)
{
cout<<9<<'\n';
continue;
}
if ( n == 2 )
{
cout<<98<<'\n';
continue;
}
cout<<"989";
n-=3;
for ( int i = 0; i<n; ++i )
cout<<temp[i%10];
cout<<'\n';
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int t;
cin >> t;
while (t--) {
long long int n, i;
cin >> n;
long long int a[n], b[n];
for (i = 0; i < n; i++) cin >> a[i];
for (i = 0; i < n; i++) cin >> b[i];
sort(a, a + n);
sort(b, b + n);
for (i = 0; i < n; i++) cout << a[i] << " ";
cout << endl;
for (i = 0; i < n; i++) cout << b[i] << " ";
cout << endl;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
const int MOD = 998244353;
const int N = 2e5 + 5;
int t, n, a[N], f[N];
vector<int> p;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> t;
while (t--) {
cin >> n;
for (int i = 0; i <= n; ++i) f[i] = 0;
p.clear();
for (int i = 1; i <= n; ++i) {
cin >> a[i];
f[a[i]]++;
}
long long res = 0;
int pos = n;
for (int i = 0; i <= n; ++i) {
int ans = f[i];
cout << ans + res << ' ';
if (f[i] == 0) {
if (p.empty()) {
pos = i;
break;
} else {
res += i - p.back();
p.pop_back();
}
}
for (int j = 1; j <= f[i] - 1; ++j) p.push_back(i);
}
for (int i = pos + 1; i <= n; ++i) cout << -1 << ' ';
cout << '\n';
}
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
vector<int> ans;
string R;
int n;
struct st {
string s;
inline void shift(int x) {
stack<char> _s;
int c = 0;
for (int i = int(n - x); i < int((int)s.size()); i++) _s.push(s[i]);
for (int i = int(n - 1); i >= int(0); i--)
if (i - x >= 0) s[i] = s[i - x];
while (!_s.empty()) s[c++] = _s.top(), _s.pop();
}
} wo;
inline void add(int k) {
int quiebre = n;
for (int i = int(0); i < int(n); i++)
if (R[n - 1 - k] == wo.s[i]) quiebre = i;
wo.shift(n);
wo.shift(quiebre);
wo.shift(1);
ans.push_back(n);
ans.push_back(quiebre);
ans.push_back(1);
}
int main() {
cin >> n;
string s1;
cin >> s1 >> R;
wo.s = s1;
int cnt[29];
memset(cnt, 0, sizeof(cnt));
for (int i = int(0); i < int(n); i++) cnt[s1[i] - 'a']++, cnt[R[i] - 'a']--;
for (int i = int(0); i < int(26); i++)
if (cnt[i] != 0) {
cout << "-1" << endl;
return 0;
}
for (int i = int(0); i < int(n); i++) add(i);
cout << (int)ans.size() << endl;
for (int i = int(0); i < int((int)ans.size()); i++) cout << ans[i] << " ";
cout << endl;
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > dp(3, vector<int>(5001, 1000000000));
vector<int> T(500000);
vector<int> D(500000);
int main() {
int K, N;
scanf("%d%d", &K, &N);
for (int n = 0; n < N; ++n) {
scanf("%d", &T[n]);
}
sort(T.begin(), T.begin() + N);
for (int n = 1; n < N; ++n) {
D[n - 1] = T[n] - T[n - 1];
}
if (N == 2) {
printf("%d", D[0]);
return 0;
}
vector<pair<int, int> > Di(N - 1);
for (int i = 0; i < N - 1; ++i) {
Di[i] = pair<int, int>(D[i], i);
}
sort(Di.begin(), Di.end());
vector<int> minv;
minv.reserve(15000);
for (int i = 0; i < min(3 * K, N - 1); ++i) {
minv.push_back(Di[i].second);
}
sort(minv.begin(), minv.end());
dp[0][0] = dp[1][0] = dp[2][0] = 0;
dp[0][1] = D[minv[0]];
dp[1][1] = min(D[minv[0]], D[minv[1]]);
if (minv[0] + 1 != minv[1]) {
dp[1][2] = D[minv[0]] + D[minv[1]];
}
for (unsigned at = 2; at < minv.size(); ++at) {
const int i = minv[at];
const int previ = minv[at - 1];
if (previ + 1 != i) {
for (int k = 1; k <= K; ++k) {
dp[at % 3][k] = min(dp[at % 3][k], dp[(at - 1) % 3][k - 1] + D[i]);
}
} else {
for (int k = 1; k <= K; ++k) {
dp[at % 3][k] = min(dp[at % 3][k], dp[(at - 2) % 3][k - 1] + D[i]);
}
}
for (int k = 1; k <= K; ++k) {
dp[at % 3][k] = min(dp[at % 3][k], dp[(at - 1) % 3][k]);
}
}
printf("%d", dp[(minv.size() - 1) % 3][K]);
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
template <ostream& out = cout, class... T>
void prints(T&&...) {}
template <ostream& out = cout, class... T>
void printe(T&&...) {}
template <ostream& out = cout, class... T>
void printw(T&&...) {}
template <ostream& out = cout, class... T>
void printew(T&&...) {}
template <ostream& out = cout, class... T>
void printb(T&&...) {}
template <ostream& out = cout, class... T>
void printd(T&&...) {}
template <ostream& out = cout, class... T>
void printde(T&&...){};
template <class T>
istream& operator>>(istream& in, vector<T>& v) {
for (auto& e : v) {
in >> e;
}
return in;
}
int main() {
int n;
cin >> n;
vector<char> s(n);
cin >> s;
int k = 0;
bool pr;
for (int i = 0; i < n; i++) {
if (s[i] == '1') {
k++;
pr = true;
} else {
break;
}
}
if (k == n) {
cout << "YES";
return 0;
}
int l = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '0') {
l++;
pr = false;
} else {
break;
}
}
if (l == n) {
cout << "YES";
return 0;
}
int m;
m = max(l, k);
for (int i = 0; i < n; i = i + m) {
if (s[i] == '1' && pr) {
for (int j = 0; j < m; j++) {
if (s[j + i] != '1') {
cout << "NO";
return 0;
}
}
pr = false;
continue;
}
if (s[i] == '0' && !pr) {
for (int j = 0; j < m; j++) {
if (s[j + i] != '0') {
cout << "NO";
return 0;
}
}
pr = true;
continue;
}
cout << "NO";
return 0;
}
cout << "YES";
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
char a[N][9];
int ty[N];
int n;
int e;
bool hav[N];
int m = 0;
int q1[N];
int q2[N];
int ans;
int fr[N], to[N];
int get(int x) {
int len = strlen(a[x] + 1);
if (a[x][1] == '0') return 0;
int w = 0;
for (int i = (int)1; i <= (int)len; i++) {
if (a[x][i] <= '9' && a[x][i] >= '0') {
w *= 10;
w += (a[x][i] - '0');
} else
return 0;
}
if (w > n) w = 0;
return w;
}
void move(int a, int b) {
if (a <= n && a >= 1) hav[a] = 0;
if (b <= n && b >= 1) hav[b] = 1;
++ans;
fr[ans] = a;
to[ans] = b;
}
int main() {
scanf("%d", &n);
for (int i = (int)1; i <= (int)n; i++) {
scanf("%s", a[i] + 1);
scanf("%d", &ty[i]);
e += ty[i];
}
int kg = 0;
for (int i = (int)1; i <= (int)n; i++) {
int w = get(i);
if (w && w <= n) {
if (w <= e && ty[i]) {
hav[w] = 1;
++m;
}
if (w > e && w <= n && (ty[i] == 0)) {
hav[w] = 1;
++m;
}
if (w <= e && ty[i] == 0) {
q1[++q1[0]] = i;
hav[w] = 1;
}
if (w > e && w <= n && ty[i] == 1) {
q2[++q2[0]] = i;
hav[w] = 1;
}
} else {
kg = i;
}
}
if (m == n) {
printf("0\n");
return 0;
}
if (!kg) {
assert(q1[0] == q2[0]);
move(get(q1[1]), n + 1);
move(get(q2[1]), get(q1[1]));
for (int i = (int)2; i <= (int)q1[0]; i++) {
move(get(q1[i]), get(q2[i - 1]));
move(get(q2[i]), get(q1[i]));
}
move(n + 1, get(q2[q2[0]]));
} else {
if ((q1[0] > q2[0]) || (q1[0] == q2[0] && e < n - e)) {
tt:;
kg = 0;
for (int i = (int)e + 1; i <= (int)n; i++)
if (!hav[i]) kg = i;
if (!kg) goto gg;
for (int i = (int)q2[0]; i >= (int)1; i--) {
move(get(q1[q1[0]]), kg);
move(get(q2[i]), get(q1[q1[0]]));
hav[kg] = 1;
q1[0]--;
kg = get(q2[i]);
}
if (q1[0]) {
move(get(q1[q1[0]--]), kg);
} else
hav[kg] = 0;
for (int i = (int)e + 1; i <= (int)n; i++)
if (!hav[i]) {
if (q1[0]) move(get(q1[q1[0]--]), i);
}
} else {
gg:;
int kg = 0;
for (int i = (int)1; i <= (int)e; i++)
if (!hav[i]) kg = i;
if (!kg) goto tt;
for (int i = (int)q1[0]; i >= (int)1; i--) {
move(get(q2[q2[0]]), kg);
move(get(q1[i]), get(q2[q2[0]]));
hav[kg] = 1;
q2[0]--;
kg = get(q1[i]);
}
if (q2[0]) {
move(get(q2[q2[0]--]), kg);
} else
hav[kg] = 0;
for (int i = (int)1; i <= (int)e; i++)
if (!hav[i]) {
if (q2[0]) move(get(q2[q2[0]--]), i);
}
}
int t = e + 1;
for (int i = (int)1; i <= (int)n; i++)
if (!ty[i])
if (!(get(i) && get(i) <= n)) {
while (hav[t]) ++t;
move(-i, t);
hav[t] = 1;
}
t = 1;
for (int i = (int)1; i <= (int)n; i++)
if (ty[i])
if (!(get(i) && get(i) <= n)) {
while (hav[t]) ++t;
move(-i, t);
hav[t] = 1;
}
}
printf("%d\n", ans);
for (int i = (int)1; i <= (int)ans; i++) {
printf("move ");
if (fr[i] > 0)
printf("%d ", fr[i]);
else
printf("%s ", a[-fr[i]] + 1);
if (to[i] > 0)
printf("%d\n", to[i]);
else
printf("%s\n", a[-to[i]] + 1);
}
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
int tfibo[1001];
void fibo(int n) {
tfibo[0] = 1;
tfibo[1] = 1;
for (int i = 2; i <= n; i++) {
tfibo[i] = tfibo[i - 1] + tfibo[i - 2];
}
}
int main() {
int n;
cin >> n;
fibo(n);
for (int i = 1; i <= n; i++) {
if (find(tfibo, tfibo + n + 1, i) != tfibo + n + 1)
cout << "O";
else
cout << "o";
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> col(n, 0);
vector<int> g[n];
vector<int> chg(n, 0);
for (int i = 0; i < m; i++) {
int q, w;
cin >> q >> w;
q--, w--;
g[q].push_back(w);
g[w].push_back(q);
}
for (;;) {
char any = true;
for (int i = 0; i < n; i++) {
int cnt = 0;
for (int j = 0; j < g[i].size(); j++) {
if (col[i] == col[g[i][j]]) cnt++;
}
if (cnt <= 1) continue;
col[i] ^= 1;
chg[i]++;
any = false;
}
if (any) break;
}
char any = true;
for (int i = 0; i < n; i++) {
if (chg[i] > m) {
any = false;
break;
}
}
if (!any) return cout << "-1\n", 0;
for (int i = 0; i < n; i++) {
cout << col[i];
}
cout << "\n";
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
long double get_dist(long double x1, long double y1, long double x2,
long double y2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(16);
long double a, b, c;
cin >> a >> b >> c;
long double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
long double mini = abs(x2 - x1) + abs(y2 - y1);
if (x1 == x2 || y1 == y2) {
cout << mini << endl;
return 0;
}
if (a == 0 || b == 0) {
cout << mini << endl;
return 0;
}
long double x3, x4, x5, x6, y3, y4, y5, y6;
x3 = x1;
y3 = (-c - a * x1) / b;
x4 = (-c - b * y2) / a;
y4 = y2;
x5 = x2;
y5 = (-c - a * x2) / b;
x6 = (-c - b * y1) / a;
y6 = y1;
mini = min(mini, get_dist(x1, y1, x3, y3) + get_dist(x3, y3, x4, y4) +
get_dist(x4, y4, x2, y2));
mini = min(mini, get_dist(x1, y1, x3, y3) + get_dist(x3, y3, x5, y5) +
get_dist(x5, y5, x2, y2));
mini = min(mini, get_dist(x1, y1, x6, y6) + get_dist(x6, y6, x5, y5) +
get_dist(x5, y5, x2, y2));
mini = min(mini, get_dist(x1, y1, x6, y6) + get_dist(x6, y6, x4, y4) +
get_dist(x4, y4, x2, y2));
cout << mini << endl;
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int N;
int B[200004];
int main(int argc, char* argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> N;
for (int i = 0; i < N; ++i) cin >> B[i];
long long added = 0;
long long res = 0;
for (int i = 0; i < N; ++i) {
long long cur = B[i] - added;
added += cur;
res += abs(cur);
}
cout << res << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int tam = 100010;
const int MOD = 1000000007;
const int MOD1 = 998244353;
const double EPS = 1e-9;
const double PI = acos(-1);
vector<int> g[200];
int cols[200];
bool chech(int n, int col) {
bool res = true;
cols[n] = abs(col - 1);
for (int i = 0; i < g[n].size(); i++) {
if (cols[g[n][i]] == -1)
res &= chech(g[n][i], cols[n]);
else if (cols[g[n][i]] != col)
return false;
}
return res;
}
pair<int, int> cra[200];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
pair<bool, bool> x, y;
int a, b;
for (long long i = 0; i < m; i++) {
cin >> a >> b;
a--;
b--;
if (a > b) swap(a, b);
for (long long j = 0; j < i; j++) {
if (a < cra[j].first) {
if (cra[j].first < b && cra[j].first > a && cra[j].second > b) {
g[i].push_back(j);
g[j].push_back(i);
}
} else {
if (cra[j].second > a && cra[j].first < a && cra[j].second < b) {
g[i].push_back(j);
g[j].push_back(i);
}
}
}
cra[i] = make_pair(a, b);
}
memset(cols, (-1), sizeof(cols));
bool res = true;
for (long long i = 0; i < m; i++) {
if (cols[i] == -1) res &= chech(i, 0);
}
if (res) {
for (long long i = 0; i < m; i++) cout << (cols[i] ? 'i' : 'o');
cout << '\n';
} else
cout << "Impossible\n";
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int k = 1, j = 1;
for (int i = 0; i < n - 1; i++) {
int s = (j + k) % n;
if (s == 0)
cout << n << " ";
else
cout << s << " ";
j = s;
k++;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int in[200005], out[200005];
int n, node, tut;
bool ok;
vector<int> v[200005], ans;
void fail() {
printf("NO");
exit(0);
}
void dfs(int node) {
while ((int)v[node].size()) {
int go = v[node].back();
v[node].pop_back();
dfs(go);
ans.push_back(go);
}
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
char s[5];
scanf("%s", s);
int x = s[0] * 270 + s[1];
int y = s[1] * 270 + s[2];
v[x].push_back(y);
out[x]++;
in[y]++;
tut = x;
}
for (int i = 0; i <= 270 * 270; i++) {
if (out[i] - in[i] == 1) {
if (node) fail();
node = i;
}
if (in[i] - out[i] == 1) {
if (ok) fail();
ok = true;
}
if (abs(in[i] - out[i]) > 1) {
fail();
}
}
if (!node) node = tut;
dfs(node);
ans.push_back(node);
if ((int)ans.size() != n + 1) fail();
reverse(ans.begin(), ans.end());
printf("YES\n");
for (int i = 0; i < (int)ans.size(); i++) {
printf("%c", ans[i] / 270);
}
printf("%c", ans.back() % 270);
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200100;
int n, x, y, cal, u, v;
vector<int> g[maxn];
bool dfs(int t, int fa) {
int ta = 0;
for (int i = 0; i < (int)g[t].size(); i++)
if (g[t][i] != fa) {
if (dfs(g[t][i], t))
ta++;
else
cal++;
}
if (ta >= 2) {
cal += ta - 2;
return 0;
} else
return 1;
}
int main() {
scanf("%d%d%d", &n, &x, &y);
for (int i = 1; i < n; i++) {
scanf("%d%d", &u, &v);
g[u].push_back(v);
g[v].push_back(u);
}
if (x == y) {
cout << (long long)x * (n - 1);
return 0;
}
if (x > y) {
bool ok = 0;
for (int i = 1; i <= n; i++)
if ((int)g[i].size() == n - 1) ok = 1;
if (ok)
cout << (long long)y * (n - 2) + x;
else
cout << (long long)y * (n - 1);
}
if (x < y) {
dfs(1, 0);
cout << (long long)x * (n - 1 - cal) + (long long)y * cal;
}
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int gi() {
int x = 0, o = 1;
char ch = getchar();
while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
if (ch == '-') o = -1, ch = getchar();
while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
return x * o;
}
vector<int> E[N];
int n, m, h[N], deg[N], vis[N], sg[N], sum[N], sq[N], tt = 0;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) h[i] = gi();
for (int i = 1, u, v; i <= m; i++)
u = gi(), ++deg[v = gi()], E[u].push_back(v);
queue<int> q;
for (int i = 1; i <= n; i++)
if (!deg[i]) q.push(i);
while (!q.empty()) {
int u = q.front();
q.pop();
sq[++tt] = u;
for (auto v : E[u])
if (!--deg[v]) q.push(v);
}
for (int i = tt, u; i; i--) {
u = sq[i];
for (auto v : E[u]) vis[sg[v]] = u;
for (int j = 0;; j++)
if (vis[j] ^ u) {
sum[sg[u] = j] ^= h[u];
break;
}
}
for (int i = n - 1; ~i; i--)
if (sum[i]) {
puts("WIN");
for (int u = 1; u <= n; u++)
if (sg[u] == i && (h[u] ^ sum[i]) < h[u]) {
h[u] ^= sum[i];
for (auto v : E[u]) h[v] ^= sum[sg[v]], sum[sg[v]] = 0;
for (int v = 1; v <= n; v++) cout << h[v] << ' ';
return 0;
}
}
puts("LOSE");
return 0;
}
| 12 |
#include <bits/stdc++.h>
using namespace std;
void dijk();
void build();
void dfs(int u);
long long getv(int u, int v);
bool add(int u, int v, long long w);
int n, m, k, dpth[100002], r[100002];
pair<int, long long> pr[17][100002];
long long d[100002];
vector<pair<int, long long> > ad[100002];
pair<long long, pair<int, int> > edge[100002 * 6];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int i, q;
cin >> n >> m >> k >> q;
for (i = 1; i <= m; ++i) {
int u, v, w;
cin >> u >> v >> w;
ad[u].push_back({v, w});
ad[v].push_back({u, w});
}
dijk();
build();
dfs(1);
for (i = 1; i <= q; ++i) {
int u, v;
cin >> u >> v;
cout << getv(u, v) << '\n';
}
return 0;
}
long long getv(int u, int v) {
if (dpth[u] < dpth[v]) swap(u, v);
int cv = dpth[u] - dpth[v], i;
long long rev = 0;
for (i = 0; i < 17; ++i)
if ((cv >> i) & 1) {
rev = max(rev, pr[i][u].second);
u = pr[i][u].first;
}
for (i = 16; i >= 0; --i)
if (pr[i][u].first != pr[i][v].first) {
rev = max(rev, max(pr[i][u].second, pr[i][v].second));
u = pr[i][u].first;
v = pr[i][v].first;
}
if (u == v) return rev;
return max(rev, max(pr[0][u].second, pr[0][v].second));
}
void dfs(int u) {
int i;
for (auto v : ad[u]) {
if (v.first == pr[0][u].first) continue;
pr[0][v.first] = {u, v.second};
dpth[v.first] = dpth[u] + 1;
for (i = 1; i < 17; ++i) {
pr[i][v.first].first = pr[i - 1][pr[i - 1][v.first].first].first;
pr[i][v.first].second = max(pr[i - 1][v.first].second,
pr[i - 1][pr[i - 1][v.first].first].second);
}
dfs(v.first);
}
}
int getr(int x) { return r[x] ? r[x] = getr(r[x]) : x; }
bool add(int u, int v, long long w) {
int ru = getr(u), rv = getr(v);
if (ru == rv) return 0;
r[ru] = rv;
ad[u].push_back({v, w});
ad[v].push_back({u, w});
return 1;
}
void build() {
int i;
m = 0;
for (i = 1; i <= n; ++i) {
for (auto j : ad[i])
edge[++m] = {d[i] + d[j.first] + j.second, {i, j.first}};
ad[i].clear();
}
sort(edge + 1, edge + m + 1);
for (i = 1; i <= m; ++i)
add(edge[i].second.first, edge[i].second.second, edge[i].first);
}
void dijk() {
int i, u;
long long cv;
priority_queue<pair<long long, int> > pq;
for (i = 1; i <= k; ++i) {
pq.push({0, i});
d[i] = 0;
}
for (; i <= n; ++i) d[i] = 1e18;
while (pq.size()) {
u = pq.top().second;
cv = -pq.top().first;
pq.pop();
if (cv > d[u]) continue;
for (auto v : ad[u])
if (d[v.first] > cv + v.second) {
d[v.first] = cv + v.second;
pq.push({-d[v.first], v.first});
}
}
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int *tree;
void buildTree(int node, int arr[], int start, int end) {
if (start == end) {
tree[node] = arr[start];
return;
}
int mid = (start + end) / 2;
buildTree(2 * node + 1, arr, start, mid);
buildTree(2 * node + 2, arr, mid + 1, end);
tree[node] = min(tree[2 * node + 1], tree[2 * node + 2]);
}
int query(int node, int start, int end, int L, int R) {
if (L <= start && R >= end)
return tree[node];
else if (L > end || R < start)
return INT32_MAX;
else {
int mid = (start + end) / 2;
int c1 = query(2 * node + 1, start, mid, L, R);
int c2 = query(2 * node + 2, mid + 1, end, L, R);
if (c1 == INT32_MAX) return c2;
if (c2 == INT32_MAX) return c1;
return min(c1, c2);
}
}
map<int, vector<int> > mp;
vector<string> ans;
int n;
void add(int l, int r, int cnt) {
for (int i = 0; i < cnt; i++) {
ans.push_back(to_string(l + 1) + " " + to_string(r + 1));
}
}
void rec(int l, int r, int last = 0) {
int mn = query(0, 0, n - 1, l, r);
if (mn - last) add(l, r, mn - last);
auto low = lower_bound(mp[mn].begin(), mp[mn].end(), l);
auto up = upper_bound(mp[mn].begin(), mp[mn].end(), r);
up--;
int ind = low - mp[mn].begin();
int bound = up - mp[mn].begin();
while (ind < bound) {
int nxtl = mp[mn][ind] + 1;
int nxtr = mp[mn][ind + 1] - 1;
if (nxtl <= nxtr && nxtl >= l && nxtr <= r) {
rec(nxtl, nxtr, mn);
}
ind++;
}
if (*low - 1 >= l) {
rec(l, *low - 1, mn);
}
if (*up + 1 <= r) {
rec(*up + 1, r, mn);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]].push_back(i);
}
tree = new int[4 * n];
buildTree(0, a, 0, n - 1);
rec(0, n - 1);
cout << ans.size() << endl;
for (auto s : ans) {
cout << s << endl;
}
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
long long getF(int numb) {
long long ans = 1;
for (int i = 2; i <= numb; i++) ans *= i;
return ans;
}
int main() {
string str;
cin >> str;
int cnt = 0;
set<char> st;
int pow10 = 0;
for (int i = 0; i < str.size(); i++) {
if (str[i] >= 'A' && str[i] <= 'J') st.insert(str[i]);
if (str[i] == '?') pow10++;
}
cnt = st.size();
long long ans = 1;
ans *= (getF(10) / getF(10 - cnt));
if (str[0] >= 'A' && str[0] <= 'J') ans -= ((getF(9) / getF(9 - cnt + 1)));
if (pow10) {
ans *= (str[0] == '?' ? 9 : 10);
pow10--;
}
cout << ans;
for (int i = 0; i < pow10; i++) cout << 0;
cout << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t, n, i, x, mini, maxi, k;
cin >> t;
while (t--) {
maxi = 0;
k = 1;
x = 0;
cin >> n;
vector<long long> v(n);
unordered_set<int> s;
bool flag = 1;
for (i = 0; i < n; i++) {
cin >> v[i];
s.insert(v[i]);
maxi = max(maxi, v[i]);
}
while (k <= 1023) {
int count = 0;
for (i = 0; i < n; i++) {
if (s.count(k ^ v[i])) {
count++;
}
}
if (count == n) {
break;
}
k++;
}
if (k == 1024) {
cout << -1 << endl;
continue;
}
cout << k << endl;
}
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
long long a, b, x, y;
cin >> a >> b >> x >> y;
long long tmp1 = x * b;
long long tmp2 = y * a;
long long tmp3 = (a - x - 1) * b;
long long tmp4 = (b - y - 1) * a;
cout << max(max(tmp1, tmp2), max(tmp3, tmp4)) << '\n';
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const double pi = 3.14159265358979323846;
const long long mxN = 2e5 + 1;
void _print(long long t) { cerr << t; }
void _print(string t) { cerr << t; }
void _print(char t) { cerr << t; }
void _print(double t) { cerr << t; }
template <class T, class V>
void _print(pair<T, V> p);
template <class T>
void _print(vector<T> v);
template <class T>
void _print(set<T> v);
template <class T, class V>
void _print(map<T, V> v);
template <class T>
void _print(multiset<T> v);
template <class T, class V>
void _print(pair<T, V> p) {
cerr << "{";
_print(p.first);
cerr << ",";
_print(p.second);
cerr << "}";
}
template <class T>
void _print(vector<T> v) {
cerr << "[ ";
for (T i : v) {
_print(i);
cerr << " ";
}
cerr << "]";
}
template <class T>
void _print(set<T> v) {
cerr << "[ ";
for (T i : v) {
_print(i);
cerr << " ";
}
cerr << "]";
}
template <class T>
void _print(multiset<T> v) {
cerr << "[ ";
for (T i : v) {
_print(i);
cerr << " ";
}
cerr << "]";
}
template <class T, class V>
void _print(map<T, V> v) {
cerr << "[ ";
for (auto i : v) {
_print(i);
cerr << " ";
}
cerr << "]";
}
void solve() {
bool odd = false, even = false;
long long n;
cin >> n;
vector<long long> a(n);
long long s = 0;
for (long long& x : a) {
cin >> x;
s += x;
if (x % 2)
odd = true;
else
even = true;
}
if (s % 2 == 1)
cout << "YES\n";
else if (odd && even)
cout << "YES\n";
else
cout << "NO\n";
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
long long T = 1;
cin >> T;
while (T--) {
solve();
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int N(100010);
int n, k;
long long b, sum;
int a[N];
priority_queue<int> q;
int main() {
cin >> n >> k >> b;
for (int i = int(0); i < int(n); ++i) cin >> a[i];
int ans = n;
--n;
for (int i = int(n - k + 1); i < int(n); ++i) {
if (i < 0) break;
sum += a[i];
q.push(-a[i]);
}
for (int i = n - k; i > -1; --i) {
sum += a[i];
q.push(-a[i]);
if (sum > b) ans = i + 1;
sum += q.top();
q.pop();
}
cout << ans << endl;
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, m;
typedef struct point {
int x, y, s;
};
point a[N];
struct point2 {
int v, id;
point p;
} b[N];
int cmp1(const point &a, const point &b) {
if (a.s == b.s) {
if (a.x == b.x) return a.y < b.y;
if (a.y == b.y) return a.x < b.x;
return a.x < b.x;
}
return a.s < b.s;
}
int cmp2(const point2 &a, const point2 &b) {
if (a.v == b.v) return a.id < b.id;
return a.v < b.v;
}
int cmp3(const point2 &a, const point2 &b) { return a.id < b.id; }
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d%d", &a[i].x, &a[i].y);
a[i].s = a[i].y - a[i].x;
}
sort(a, a + n, cmp1);
for (int i = 0; i < n; i++) {
scanf("%d", &b[i].v);
b[i].id = i;
}
sort(b, b + n, cmp2);
for (int i = 0; i < n; i++) {
if (a[i].s != b[i].v) {
printf("NO\n");
return 0;
}
b[i].p = a[i];
}
sort(b, b + n, cmp3);
point maxx, maxy;
maxx.x = maxy.x = b[0].p.x;
maxx.y = maxy.y = b[0].p.y;
for (int i = 1; i < n; i++) {
if (b[i].p.x <= maxx.x && b[i].p.y <= maxx.y ||
b[i].p.x <= maxy.x && b[i].p.y <= maxy.y) {
printf("NO\n");
return 0;
}
if (b[i].p.x > maxx.x) {
maxx.x = b[i].p.x, maxx.y = b[i].p.y;
}
if (b[i].p.y > maxy.y) {
maxy.y = b[i].p.y;
maxy.x = b[i].p.x;
}
}
printf("YES\n");
for (int i = 0; i < n; i++) {
printf("%d %d\n", b[i].p.x, b[i].p.y);
}
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int n, y;
int as(int k) {
for (int i = 2; i <= sqrt(k); i++) {
if (k % i == 0) {
return 0;
}
}
return 1;
}
int main() {
cin >> n;
as(n);
if (as(n)) {
cout << 1;
return 0;
} else if (n % 2 == 0 || as(n - 2)) {
cout << 2;
return 0;
} else {
cout << 3;
return 0;
}
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 2e5 + 1;
long long pow2[maxN];
long long fac[maxN];
long long facInv[maxN];
long long km2pow[maxN];
long long sCz[maxN];
long long xCxd2[maxN];
long long div2;
long long modInv(long long val) {
long long ret = 1;
long long mult = val;
long long k = 998244353 - 2;
while (k > 0) {
if ((k & 1) > 0) ret = (ret * mult) % 998244353;
mult = (mult * mult) % 998244353;
k >>= 1;
}
return ret;
}
void fillpow2(int maxVal) {
pow2[0] = 1;
for (int i = 1; i <= maxVal; i++) {
long long temp = pow2[i - 1] << 1;
if (temp >= 998244353) temp = temp % 998244353;
pow2[i] = temp;
}
}
void fillfac(int maxVal) {
fac[0] = 1;
facInv[0] = 1;
for (int i = 1; i <= maxVal; i++) {
long long temp = fac[i - 1] * i;
if (temp >= 998244353) temp = temp % 998244353;
fac[i] = temp;
facInv[i] = modInv(fac[i]);
}
}
void fillkm2pow(int maxVal, int k) {
km2pow[0] = 1;
if (k < 2) {
fill(km2pow, km2pow + maxVal, 0);
} else {
for (int i = 1; i <= maxVal; i++) {
long long temp = km2pow[i - 1] * (k - 2);
if (temp >= 998244353) temp = temp % 998244353;
km2pow[i] = temp;
}
}
}
void fillsCz(int maxVal, int s) {
long long a = fac[s];
for (int i = 0; i <= maxVal; i++) {
long long b = facInv[i];
long long c = facInv[s - i];
long long temp = a * b;
if (temp >= 998244353) temp = temp % 998244353;
temp *= c;
if (temp >= 998244353) temp = temp % 998244353;
sCz[i] = temp;
}
}
void fillxCxd2(int maxVal) {
for (int i = 0; i <= maxVal; i += 2) {
long long a = fac[i];
long long b = facInv[i / 2];
long long temp = a * b;
if (temp >= 998244353) temp = temp % 998244353;
temp *= b;
if (temp >= 998244353) temp = temp % 998244353;
xCxd2[i] = temp;
}
}
void fillAll(int S, int k) {
fillpow2(S);
fillfac(S);
fillkm2pow(S, k);
fillsCz(S, S);
fillxCxd2(S);
div2 = modInv(2);
}
int main() {
int n, k;
scanf("%d %d", &n, &k);
int h[n];
for (int i = 0; i < n; i++) {
scanf("%d", &h[i]);
}
int R = 0;
for (int i = 1; i < n; i++) {
if (h[i] == h[i - 1]) {
R++;
}
}
if (h[0] == h[n - 1]) R++;
long long kpowr = 1;
for (int i = 0; i < R; i++) {
kpowr *= k;
if (kpowr >= 998244353) kpowr = kpowr % 998244353;
}
int S = n - R;
fillAll(S, k);
long long ways = 0;
for (int z = 0; z < S; z++) {
long long a = sCz[z];
long long b = km2pow[z];
int x = S - z;
long long c;
if (x % 2 == 1) {
c = pow2[x - 1];
} else {
c = pow2[x - 1] - ((xCxd2[x] * div2) % 998244353);
if (c < 0) c = c + 998244353;
}
long long temp = a * b;
if (temp >= 998244353) temp = temp % 998244353;
temp *= c;
if (temp >= 998244353) temp = temp % 998244353;
ways += temp;
if (ways >= 998244353) ways = ways % 998244353;
}
long long output = kpowr * ways;
if (output >= 998244353) output = output % 998244353;
printf("%lld\n", output);
}
| 8 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 2e5+8, inf = 1e18+9, mod = 1e9+7;
char s[maxn];
int n, k;
void solve() {
int i, j, idx = 0;
cin >> n >> k; s[n + 1] = 0;
#define check() do { if (idx == n) return (void)(cout << (s + 1) << endl); } while (0)
while (idx <= n) {
for (i = 0; i < k; i++) {
s[++idx] = 'a' + i; check();
for (j = i + 1; j < k; j++) {
s[++idx] = 'a' + i; check();
s[++idx] = 'a' + j; check();
}
}
}
}
signed main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); cout << fixed << setprecision(15);
int t = 1; //cin >> t;
while (t--) solve();
return 0;
}
| 4 |
#include <bits/stdc++.h>
int main() {
long long n;
scanf("%d", &n);
if (n == 2)
printf("2");
else
printf("1");
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int a[200005];
int main() {
int n, t;
cin >> n >> t;
for (int i = 1; i <= n; i++) cin >> a[i];
priority_queue<int> q;
int ans = 0;
for (int i = 1; i <= n; i++) {
while (!q.empty() && q.top() >= t - i) q.pop();
if (a[i] < t && i < t) q.push(a[i] - i);
ans = max(ans, int(q.size()));
}
cout << ans;
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
const int X = 5001;
const int N = 5001;
long long segtree[N << 3];
void build(long long *arr, int node, int i, int j) {
if (i == j) {
segtree[node] = arr[i];
} else {
int mid = (i + j) >> 1;
int lf = node << 1;
int rg = lf | 1;
build(arr, lf, i, mid);
build(arr, rg, mid + 1, j);
segtree[node] = max(segtree[lf], segtree[rg]);
}
}
long long query(long long *segtree, int node, int i, int j, int l, int r) {
if (l <= i && j <= r) {
return segtree[node];
} else {
int mid = (i + j) >> 1;
if (mid >= r) {
return query(segtree, node << 1, i, mid, l, r);
} else if (mid < l) {
return query(segtree, (node << 1) | 1, mid + 1, j, l, r);
} else {
return max(query(segtree, node << 1, i, mid, l, r),
query(segtree, (node << 1) | 1, mid + 1, j, l, r));
}
}
}
void update(long long *segtree, int node, int i, int j, int pos, int val) {
if (i > pos || j < pos) {
return;
}
if (i == j && i == pos) {
segtree[node] = val;
} else {
int mid = (i + j) / 2;
int lf = node << 1;
int rg = lf + 1;
update(segtree, lf, i, mid, pos, val);
update(segtree, rg, mid + 1, j, pos, val);
segtree[node] = max(segtree[lf], segtree[rg]);
}
}
bool ok(int n, int k, int x) {
int last = 0;
for (int i = 1; i <= n; i++) {
int dis = i - last;
if (dis == k) {
if (x == 0) return false;
last = i;
x--;
}
}
return true;
}
long long a[N];
long long dp[N];
int main() {
int n, k, x;
scanf("%d %d %d", &n, &k, &x);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
}
for (int ex = 1; ex <= x; ex++) {
build(dp, 1, 1, n);
dp[1] = a[1];
for (int i = max(ex, 2); i <= n; i++) {
int l = max(1, i - k);
long long val = query(segtree, 1, 1, n, l, i - 1);
dp[i] = 0LL;
if (val == 0LL && (i - (k - 1)) > 1) {
continue;
}
dp[i] = val + a[i];
}
}
long long best = 0LL;
for (int i = n; i > n - k; i--) {
best = max(best, dp[i]);
}
if (best == 0LL) best = -1LL;
printf("%lld\n", best);
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char s[100];
bool flag;
int i, k;
while (cin >> s) {
flag = true;
k = strlen(s);
for (i = 0; i < k; i++) {
if (s[i] == 'H' || s[i] == 'Q' || s[i] == '9') {
cout << "YES" << endl;
flag = false;
break;
}
}
if (flag) cout << "NO" << endl;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
long long int lowBit(long long int n) {
for (long long int i = 0; i < 30; i++) {
long long int p = 1 << i;
if (n & p) return 1 << i;
}
}
int32_t main() {
long long int n, k;
cin >> n >> k;
long long int kk = k;
long long int y = k;
long long int half = n / 2;
long long int nn = n;
nn--;
long long int tmp = (nn * (nn + 1)) / 2;
if (n == 1) {
cout << 0 << endl;
return 0;
}
if (k >= half)
cout << tmp << endl;
else if (k < half) {
long long int sm = 0;
for (long long int i = n; i > y; i--) {
if (k) {
sm += (i - 1);
k--;
} else {
sm += kk;
}
}
for (long long int j = y; j >= 2; j--) sm += (j - 1);
cout << sm << endl;
}
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
long long count_number(long long n) {
long long res = 0;
while (n != 0) {
if (n % 10 == 1) res++;
n /= 10;
}
return res;
}
int main() {
int x, k;
cin >> x >> k;
bool total[x + 1];
for (int i = 0; i < x; i++) total[i] = false;
for (int i = 0; i < k; i++) {
int temp;
cin >> temp;
if (temp == 2) {
int temp1;
cin >> temp1;
total[temp1] = true;
} else {
int temp1, temp2;
cin >> temp1 >> temp2;
total[temp1] = true;
total[temp2] = true;
}
}
int min = 0, max = 0, min_count = 0;
for (int i = 1; i < x; i++) {
if (total[i] == true) {
if (min_count == 1) {
min++;
min_count = 0;
}
continue;
} else {
max++;
if (min_count == 0)
min_count++;
else {
min++;
min_count = 0;
}
}
}
if (min_count == 1) min++;
cout << min << " " << max << endl;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int i, consecutivo;
int arr[M];
for (i = 0; i < M; ++i) {
cin >> arr[i];
}
sort(arr, arr + M);
if (arr[0] == 1 || arr[M - 1] == N) {
cout << "NO" << endl;
} else {
consecutivo = 0;
for (i = 0; i < M - 1; ++i) {
if (arr[i + 1] - arr[i] == 1) {
consecutivo++;
} else {
consecutivo = 0;
}
if (consecutivo == 2) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
template <class T>
bool chmax(T &val, T nv) {
return val < nv ? (val = nv, true) : false;
}
template <class T>
bool chmin(T &val, T nv) {
return nv < val ? (val = nv, true) : false;
}
using namespace std;
using ll = long long;
const int MAX_N = 300010;
const double PI = 3.1415926535897;
ll n, k;
vector<pair<int, int>> dot;
struct lisan : vector<double> {
void done() { sort(begin(), end()); }
int operator()(double v) {
return lower_bound(begin(), end(), v) - begin() + 1;
}
};
struct bit {
vector<int> v;
int n;
bit(int _n) : n(_n) { v.resize(n + 1); }
void add(int i, int val) {
for (; i <= n; i += i & -i) v[i] += val;
}
int qry(int i) {
int res = 0;
for (; i; i ^= i & -i) res += v[i];
return res;
}
int qry(int l, int r) { return qry(r) - qry(l - 1); }
};
ll cntin(double R) {
ll in = 0;
vector<pair<int, int>> pt;
for (auto [x, y] : dot) {
if (hypot(x, y) <= R)
++in;
else
pt.emplace_back(x, y);
}
ll all = in * (in - 1) / 2 + in * (n - in);
if (all >= k) return all;
lisan lis;
vector<pair<double, double>> ap;
for (auto [x, y] : pt) {
0;
double alpha = acos(R / hypot(x, y)), a0 = atan2(y, x) - alpha;
if (a0 < 0) a0 += 2 * PI;
double L = a0, R = a0 + 2 * alpha;
0;
ap.emplace_back(L, R);
lis.emplace_back(L), lis.emplace_back(R);
lis.emplace_back(L += 2 * PI), lis.emplace_back(R += 2 * PI);
}
lis.done();
bit tree(lis.size());
ll m = ap.size();
sort(begin(ap), end(ap));
ll inter = 0;
for (int iter = 0; iter < 2; ++iter) {
for (int i = 0; i < m; ++i) {
auto &[l, r] = ap[i];
if (iter) inter += tree.qry(lis(l), lis(r));
tree.add(lis(r), 1);
l += 2 * PI, r += 2 * PI;
}
}
all += m * (m - 1) / 2 - inter;
return all;
}
int32_t main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> n >> k;
dot.resize(n);
for (auto &[a, b] : dot) cin >> a >> b;
double L = 0, R = 2e4, M;
int docnt = 40;
while (docnt--) {
M = (L + R) / 2;
if (cntin(M) < k)
L = M;
else
R = M;
}
cout << fixed << setprecision(10) << L << '\n';
}
| 12 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long x, y;
int main() {
scanf("%I64d%I64d", &x, &y);
if (gcd(x, y) != 1) {
puts("Impossible");
return 0;
}
while (x != y) {
if (x > y) {
long long t, r;
if (x % y == 0)
t = x / y - 1, r = y;
else
t = x / y, r = x % y;
printf("%I64d", t);
putchar('A');
x = r;
} else {
long long t, r;
if (y % x == 0)
t = y / x - 1, r = x;
else
t = y / x, r = y % x;
printf("%I64d", t);
putchar('B');
y = r;
}
}
puts("");
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
long long M, K, ans;
long long aa;
long long bb[7];
long long ii[10];
long long c[10][10];
long long cc[4];
long long inv(long long x) {
long long g[30];
long long cur = 1;
g[0] = x;
for (int i = 1; i < 30; i++) {
g[i] = g[i - 1] * g[i - 1] % 1000000007LL;
}
for (int i = 0; i < 30; i++) {
if ((1 << i) & (1000000007LL - 2)) {
cur = cur * g[i] % 1000000007LL;
}
}
return cur;
}
long long sum(long long a, long long b) {
long long cur = 0;
long long cur2 = 1;
for (int i = b; i >= 0; i--) {
cur2 = cur2 * a % 1000000007LL;
cur += ii[b + 1] * c[b + 1][i] % 1000000007LL * bb[i] % 1000000007LL * cur2;
cur %= 1000000007LL;
}
return cur;
}
int main() {
bb[0] = 1;
bb[1] = inv(2);
bb[2] = inv(6);
bb[4] = inv(1000000007LL - 30);
bb[6] = inv(42);
for (int i = 0; i < 10; i++) {
c[i][0] = 1;
for (int j = 1; j <= i; j++) {
c[i][j] = c[i - 1][j - 1] + c[i - 1][j];
}
if (i >= 1) ii[i] = inv(i);
}
cin >> M;
cc[1] = (M + 2) % 1000000007LL;
cc[2] = M % 1000000007LL * ((M - 1) % 1000000007LL) % 1000000007LL * ii[2] %
1000000007LL;
cc[3] = M % 1000000007LL * ((M + 1) % 1000000007LL) % 1000000007LL *
((M + 2) % 1000000007LL) % 1000000007LL * ii[6] % 1000000007LL;
for (long long i = 1; i <= sqrt(M); i++) {
K = i * i % 1000000007LL;
aa = sqrt(M - i * i);
ans += (cc[3] +
(1000000007LL - cc[1]) * K % 1000000007LL * (1000000007LL + K - 1) %
1000000007LL * ii[2] % 1000000007LL +
(K + 1) % 1000000007LL * K % 1000000007LL * (K + 1000000007LL - 1) %
1000000007LL * ii[3]) %
1000000007LL;
ans += (2 * ii[3] % 1000000007LL *
((K * K % 1000000007LL * K % 1000000007LL * aa % 1000000007LL +
3 * K * K % 1000000007LL * sum(aa, 2) % 1000000007LL +
3 * K * sum(aa, 4) % 1000000007LL + sum(aa, 6) % 1000000007LL +
((1000000007LL - K) % 1000000007LL) % 1000000007LL * aa +
(1000000007LL - sum(aa, 2)) % 1000000007LL) %
1000000007LL)) %
1000000007LL;
ans += (2 * aa * cc[3] % 1000000007LL);
ans += (1000000007LL - cc[1]) *
(aa * K % 1000000007LL * K % 1000000007LL +
(2 * sum(aa, 2) - aa + 1000000007LL) * K % 1000000007LL +
sum(aa, 4) + (1000000007LL - sum(aa, 2))) %
1000000007LL;
ans %= 1000000007LL;
}
ans *= 2;
int i = 0;
K = i * i % 1000000007LL;
aa = sqrt(M - i * i);
ans += (cc[3] +
(1000000007LL - cc[1]) * K % 1000000007LL * (1000000007LL + K - 1) %
1000000007LL * ii[2] % 1000000007LL +
(K + 1) % 1000000007LL * K % 1000000007LL * (K + 1000000007LL - 1) %
1000000007LL * ii[3]) %
1000000007LL;
ans += (2 * ii[3] % 1000000007LL *
((K * K % 1000000007LL * K % 1000000007LL * aa % 1000000007LL +
3 * K * K % 1000000007LL * sum(aa, 2) % 1000000007LL +
3 * K * sum(aa, 4) % 1000000007LL + sum(aa, 6) % 1000000007LL +
((1000000007LL - K) % 1000000007LL) % 1000000007LL * aa +
(1000000007LL - sum(aa, 2)) % 1000000007LL) %
1000000007LL)) %
1000000007LL;
ans += (2 * aa * cc[3] % 1000000007LL);
ans += (1000000007LL - cc[1]) *
(aa * K % 1000000007LL * K % 1000000007LL +
(2 * sum(aa, 2) - aa + 1000000007LL) * K % 1000000007LL + sum(aa, 4) +
(1000000007LL - sum(aa, 2))) %
1000000007LL;
ans %= 1000000007LL;
cout << ans << endl;
}
| 10 |
#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
const long long int MAXN = 1e5 + 5;
long long int fastexpo(long long int b, long long int exp) {
if (exp == 0) return 1;
if (exp == 1) return b;
long long int ans = (fastexpo(b, exp / 2) % MOD);
ans *= ans;
ans %= MOD;
if (exp % 2 == 1) {
ans *= b;
}
ans %= MOD;
return ans;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int n, m;
cin >> n >> m;
long long int xr = n ^ m;
long long int pos = 0;
while (xr > 0) {
pos++;
xr /= 2;
}
long long int ans = pow(2, pos) - 1;
cout << ans << endl;
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
long long ans = 1;
cin >> N;
for (long long i = 2; i * i <= N; i++) {
if (N % i) continue;
ans *= i;
while (N % i == 0) N /= i;
}
ans *= N;
cout << ans << endl;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
void read(T &x) {
x = 0;
char c = getchar();
long long f = 0;
while (c < '0' || c > '9') f |= (c == '-'), c = getchar();
while (c >= '0' && c <= '9')
x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
if (f) x = -x;
}
template <class T>
bool checkmax(T &a, T b) {
return b > a ? a = b, 1 : 0;
}
template <class T>
bool checkmin(T &a, T b) {
return b < a ? a = b, 1 : 0;
}
const long long mod = 1e9 + 7;
template <class T>
void my_add(T &a, T b) {
a = a + b > mod ? a + b - mod : a + b;
}
template <class T>
void my_sub(T &a, T b) {
a = a - b < 0 ? a - b + mod : a - b;
}
namespace moonpie {
const long long N = 1e5 + 5, mh = 998244353;
long long n, m, len, base, F[30], nxt[N];
string s, t, Fs[30], F1, F2;
long long get_num(string a) {
long long res = 0;
for (long long i = 0, j = 0; i < a.length(); ++i) {
while (j >= 0 && t[j + 1] != a[i]) j = nxt[j];
if (++j == len) ++res, j = nxt[j];
}
return res;
}
struct matrix_base {
long long ma[2][2];
} bm;
struct matrix_ans {
long long ma[2];
} ans;
inline void mul_base() {
matrix_base res;
memset(res.ma, 0, sizeof(res.ma));
for (long long i = 0; i < 2; ++i)
for (long long j = 0; j < 2; ++j)
for (long long k = 0; k < 2; ++k)
my_add(res.ma[i][j], bm.ma[i][k] * bm.ma[k][j] % mod);
bm = res;
}
inline void mul_ans() {
matrix_ans res;
memset(res.ma, 0, sizeof(res.ma));
for (long long i = 0; i < 2; ++i)
for (long long j = 0; j < 2; ++j)
my_add(res.ma[i], ans.ma[j] * bm.ma[j][i] % mod);
ans = res;
}
long long calc() {
len = s.length();
t = "%" + s;
nxt[0] = -1;
for (long long i = 2, j = 0; i <= len; ++i) {
while (j >= 0 && t[j + 1] != t[i]) j = nxt[j];
nxt[i] = ++j;
}
F[1] = F[2] = 1;
Fs[1] = "a";
Fs[2] = "b";
for (long long i = 3;; ++i) {
if (F[i - 2] > len) {
Fs[i] = Fs[i - 1] + Fs[i - 2];
base = i - 1;
break;
}
F[i] = F[i - 1] + F[i - 2];
Fs[i] = Fs[i - 1] + Fs[i - 2];
}
string a, b, c;
for (long long i = 0; i < len - 1; ++i) a += Fs[base - 1][i];
for (long long i = Fs[base - 1].length() - (len - 1);
i < Fs[base - 1].length(); ++i)
b += Fs[base - 1][i];
for (long long i = Fs[base].length() - (len - 1); i < Fs[base].length(); ++i)
c += Fs[base][i];
long long vc = get_num(c + a);
long long vb = get_num(b + a);
if (n - base <= 1) {
return get_num(Fs[n]);
}
ans.ma[0] = 0;
ans.ma[1] = 1;
memset(bm.ma, 0, sizeof(bm.ma));
bm.ma[0][1] = bm.ma[1][0] = bm.ma[1][1] = 1;
long long y = n - base;
for (long long i = 0; (1ll << i) <= y; ++i, mul_base())
if (y & (1ll << i)) mul_ans();
long long B = ans.ma[0] - (y % 2 == 1);
ans.ma[0] = 0;
ans.ma[1] = 1;
memset(bm.ma, 0, sizeof(bm.ma));
bm.ma[0][1] = bm.ma[1][0] = bm.ma[1][1] = 1;
for (long long i = 0; (1ll << i) <= y - 1; ++i, mul_base())
if ((y - 1) & (1ll << i)) mul_ans();
long long C = ans.ma[0] - ((y - 1) % 2 == 1);
ans.ma[0] = get_num(Fs[base]);
ans.ma[1] = get_num(Fs[base] + Fs[base - 1]);
memset(bm.ma, 0, sizeof(bm.ma));
bm.ma[0][1] = bm.ma[1][0] = bm.ma[1][1] = 1;
for (long long i = 0; (1ll << i) <= y; ++i, mul_base())
if (y & (1ll << i)) mul_ans();
return (ans.ma[0] + B * vb % mod + C * vc % mod) % mod;
}
void solve() {
cin >> n >> m;
for (long long i = 1; i <= m; ++i) {
cin >> s;
printf("%lld\n", calc());
}
}
} // namespace moonpie
signed main() {
moonpie::solve();
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
pair<pair<int, int>, int> pii[123456];
string s;
string solve(int p) {
if (p == 0) {
return "0";
}
int flag = 0;
if (p < 0) {
flag = 1;
p = -p;
}
string tmp;
while (p) {
tmp += (p % 10 + '0');
p /= 10;
}
if (flag) tmp += '-';
reverse(tmp.begin(), tmp.end());
return tmp;
}
int main() {
cin >> s;
int now = 0;
int num = 0;
int flag = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '+' || s[i] == '-') {
if (flag == 0) {
now += num;
} else {
now -= num;
}
if (s[i] == '+') {
flag = 0;
} else
flag = 1;
num = 0;
} else {
num = num * 10 + (s[i] - '0');
}
}
if (flag == 0) {
now += num;
} else {
now -= num;
}
string ss = solve(now);
for (int i = 0; i < ss.size(); i++) {
for (int j = 0; j < ss[i]; j++) {
cout << "+";
}
cout << ".";
cout << ">" << endl;
}
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void c_p_c() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
double pi = 3.141592653589;
inline void solve() {
double N, R;
cin >> N >> R;
double alpha = cos(2 * 3.14159265358979323846264338327950L / N);
double x = sqrt((1 - alpha) / 2);
double ans = R * x / (1 - x);
cout << fixed << setprecision(12) << ans;
}
int32_t main() {
solve();
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto& x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
string get_s(long long val) {
string s = "";
while (val) {
int tmp = val % 2;
if (tmp) {
s += "1";
} else {
s += "0";
}
val /= 2;
}
reverse(s.begin(), s.end());
return s;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long x, y;
cin >> x >> y;
string s1 = get_s(x);
string s2 = get_s(y);
queue<string> Q;
unordered_set<string> S;
Q.push(s1);
S.insert(s1);
while (!Q.empty()) {
string s = Q.front();
42;
Q.pop();
if (s.size() > s2.size()) {
if (s[0] == '1' && s[s.size() - 1] == '1') continue;
}
if (s.size() == s2.size()) {
if (s == s2) {
cout << "YES" << endl;
return 0;
}
}
string tmp = s + "0";
reverse(tmp.begin(), tmp.end());
int beg = 0;
while (beg < tmp.size() && tmp[beg] == '0') beg++;
tmp = tmp.substr(beg);
if (!S.count(tmp)) {
Q.push(tmp);
S.insert(tmp);
}
tmp = s + "1";
reverse(tmp.begin(), tmp.end());
if (!S.count(tmp)) {
Q.push(tmp);
S.insert(tmp);
}
}
cout << "NO" << endl;
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100 * 1000 + 20;
const int INF = 1e9;
int n, m, d;
vector<int> adj[N];
int dp1[N], dp2[N], K1[N], K2[N];
bool can[N];
void DFS(int v, int p = -1) {
for (auto u : adj[v])
if (u ^ p) {
DFS(u, v);
dp1[v] = max(dp1[v], dp1[u] + 1);
if (dp1[u] > K1[v])
K2[v] = K1[v], K1[v] = dp1[u];
else if (dp1[u] > K2[v])
K2[v] = dp1[u];
}
}
void DFS1(int v, int p = -1) {
if (p != -1) {
dp2[v] = max(dp2[v], dp2[p] + 1);
if (K1[p] != dp1[v])
dp2[v] = max(dp2[v], K1[p] + 2);
else
dp2[v] = max(dp2[v], K2[p] + 2);
}
for (auto u : adj[v])
if (u ^ p) DFS1(u, v);
}
int main() {
ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
cin >> n >> m >> d;
fill(dp1, dp1 + N - 1, -INF);
fill(dp2, dp2 + N - 1, -INF);
fill(K1, K1 + N - 1, -INF);
fill(K2, K2 + N - 1, -INF);
for (int i = 1, x; i <= m; i++) {
cin >> x;
can[x] = true;
dp1[x] = dp2[x] = 0;
}
for (int i = 1, v, u; i < n; i++) {
cin >> v >> u;
adj[v].push_back(u);
adj[u].push_back(v);
}
DFS(1), DFS1(1);
int ans = 0;
for (int i = 1; i <= n; i++)
if (max(dp1[i], dp2[i]) <= d) ans++;
cout << ans << '\n';
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
int c[510000];
void solve() {
scanf("%d %d", &n, &k);
for (int(i) = 0; (i) < (int)(n); (i)++) scanf("%d", &c[i]);
sort(c, c + n);
long long tot = 0;
for (int(i) = 0; (i) < (int)(n); (i)++) tot += c[i];
int rem = tot % n;
tot /= n;
long long av = 0;
long long nd = 0;
int ot = (tot + !(!rem));
for (int(i) = 0; (i) < (int)(n); (i)++) {
if (c[i] > ot) av += c[i] - ot;
if (c[i] < tot) nd += tot - c[i];
}
if (nd <= k && av <= k) {
printf("%d\n", rem ? 1 : 0);
return;
}
int st = 0, ed = 1000000000;
while (st < ed) {
int m = (st + ed) / 2;
nd = 0;
for (int(i) = 0; (i) < (int)(n); (i)++) {
if (c[i] > m) nd += c[i] - m;
}
if (nd <= k)
ed = m;
else
st = m + 1;
}
int ans = st;
st = 0, ed = 1000000000;
while (st < ed) {
int m = (st + ed + 1) / 2;
nd = 0;
for (int(i) = 0; (i) < (int)(n); (i)++) {
if (c[i] < m) nd += m - c[i];
}
if (nd <= k)
st = m;
else
ed = m - 1;
}
printf("%d\n", ans - st);
}
int main() { solve(); }
| 6 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000;
const int MAX = 1000;
const int inf = 999999999;
const int p1 = 104393321, p2 = 104393329;
string s, q;
void space(int w) {
for (int i = (0); i < int(w); ++i) cout << ' ';
}
void f(int a, int w) {
if (a >= q.size()) return;
if (q[a] == toupper(q[a])) {
w--;
space(2 * w);
cout << "</" << (char)tolower(q[a]) << ">" << endl;
f(a + 1, w);
} else {
space(2 * w);
cout << "<" << q[a] << ">" << endl;
f(a + 1, w + 1);
}
}
int main() {
ios::sync_with_stdio(0);
cin >> s;
for (int i = (0); i < int(s.size()); ++i) {
if (s[i] == '<' || s[i] == '>') continue;
if (s[i] == '/') {
i++;
q += toupper(s[i]);
} else
q += s[i];
}
f(0, 0);
return 0;
}
| 1 |
#include <bits/stdc++.h>
const int N = 2e5 + 3, Dx[4] = {0, 1, 0, -1}, Dy[4] = {1, 0, -1, 0};
int n, x[N], y[N], a, b, s[4], p;
int main() {
scanf("%d%d%d", &n, &a, &b);
for (int i = 1; i <= n; i++) scanf("%d%d", x + i, y + i);
for (int k = 0, aa, bb; k < 4; k++) {
aa = a + Dx[k], bb = b + Dy[k];
for (int i = 1; i <= n; i++)
if ((x[i] <= aa && aa <= a || x[i] >= aa && aa >= a) &&
(y[i] <= bb && bb <= b || y[i] >= bb && bb >= b))
s[k]++;
p = s[k] > s[p] ? k : p;
}
printf("%d\n%d %d", s[p], a + Dx[p], b + Dy[p]);
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int ar[10];
int pr[10];
int used[10];
int N, K;
int cnt[10];
int min_ = 0x7fffffff;
int bas[10][10], k, tmp;
void ctrl() {
for (int i = 1; i <= N; i++) {
k = 1;
tmp = cnt[i] = 0;
for (int j = 1; j <= K; j++, k *= 10) cnt[i] += bas[i][pr[j]] * k;
}
for (int i = 1; i <= N; i++)
for (int j = 1; j <= N; j++)
if (cnt[i] - cnt[j] > tmp) tmp = cnt[i] - cnt[j];
if (tmp < min_) min_ = tmp;
}
void perm(int k, int se) {
used[se] = 1;
pr[k] = se;
if (k == K) ctrl();
for (int i = 1; i <= K; i++)
if (!used[i]) perm(k + 1, i);
used[se] = 0;
}
int main() {
scanf(" %d %d", &N, &K);
for (int i = 1; i <= N; i++) scanf(" %d", &ar[i]);
for (int i = 1; i <= N; i++) {
tmp = ar[i];
for (int j = 1; j <= K; j++, tmp /= 10) bas[i][j] = tmp % 10;
}
for (int i = 1; i <= K; i++) perm(1, i);
cout << min_ << endl;
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long linf = (1ll << 62) - 1;
const int N = 1e3 + 7;
const int mod = 1e9 + 7;
const double eps = 1e-12;
template <typename T>
inline void rd(T &x) {
char c;
int sign = 1;
x = 0;
do {
c = getchar();
if (c == '-') sign = -1;
} while (c < '0' || c > '9');
do {
x = x * 10 + c - '0';
c = getchar();
} while (c >= '0' && c <= '9');
x *= sign;
}
int nx[N][500], f[N][N];
char s[N], t[N], s1[N], s2[N];
int T, lent, len;
void get() {
memset(nx, 0, sizeof(nx));
for (int i = 0; i <= 25; ++i) nx[len][i] = len + 1;
for (int i = len; i >= 1; --i) {
for (int j = 0; j <= 25; ++j) nx[i - 1][j] = nx[i][j];
nx[i - 1][s[i] - 'a'] = i;
}
}
void dp(int n1) {
for (int i = 0; i <= lent; ++i)
for (int j = 0; j <= lent; ++j) f[i][j] = inf;
f[0][0] = 0;
for (int i = 1; i <= n1; ++i) s1[i] = t[i];
for (int i = n1 + 1; i <= lent; ++i) s2[i - n1] = t[i];
for (int i = 0; i <= n1; ++i) {
for (int j = 0; j <= lent - n1; ++j) {
if (!i && !j) continue;
if (i && f[i - 1][j] != inf && nx[f[i - 1][j]][s1[i] - 'a'])
f[i][j] = min(f[i][j], nx[f[i - 1][j]][s1[i] - 'a']);
if (j && f[i][j - 1] != inf && nx[f[i][j - 1]][s2[j] - 'a'])
f[i][j] = min(f[i][j], nx[f[i][j - 1]][s2[j] - 'a']);
}
}
}
int main() {
scanf("%d", &T);
while (T--) {
int flag = 0;
scanf("%s%s", s + 1, t + 1);
lent = strlen(t + 1), len = strlen(s + 1);
get();
for (int i = 1; i <= lent; ++i) {
dp(i);
if (f[i][lent - i] <= len) {
flag = 1;
break;
}
}
puts(flag ? "YES" : "NO");
}
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
int readint() {
char c;
while (c = getchar(), (c < '0' || c > '9') && c != '-')
;
bool flag = (c == '-');
if (flag) c = getchar();
int x = 0;
while (c >= '0' && c <= '9') {
x = x * 10 + c - 48;
c = getchar();
}
return flag ? -x : x;
}
long long n, k;
int main() {
cin >> n >> k;
long long x = n / 2;
long long a = x / (k + 1), b = a * k, c = n - a - b;
cout << a << " " << b << " " << c << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
long long a, b;
cin >> a >> b;
long long a_plus_b = a + b;
vector<long long> div_a, div_b, div_ab;
for (long long i = 1; i * i <= a; i++) {
if (a % i == 0) {
div_a.push_back(i);
if (i * i != a) {
div_a.push_back(a / i);
}
}
}
for (long long i = 1; i * i <= b; i++) {
if (b % i == 0) {
div_b.push_back(i);
if (i * i != b) {
div_b.push_back(b / i);
}
}
}
for (long long i = 1; i * i <= a_plus_b; i++) {
if (a_plus_b % i == 0) {
div_ab.push_back(i);
if (i * i != a_plus_b) {
div_ab.push_back(a_plus_b / i);
}
}
}
long long ans = 1e18;
sort(div_a.begin(), div_a.end());
sort(div_b.begin(), div_b.end());
sort(div_ab.begin(), div_ab.end());
for (auto d1 : div_ab) {
vector<long long>::iterator it =
lower_bound(div_a.begin(), div_a.end(), d1);
if (it == div_a.end() || *it > d1) {
if (it == div_a.begin()) {
continue;
} else {
it--;
}
}
long long d2 = *it;
if (a_plus_b / d1 >= a / d2) {
ans = min(ans, 2ll * (d1 + (a + b) / d1));
}
}
swap(a, b);
swap(div_a, div_b);
for (auto d1 : div_ab) {
vector<long long>::iterator it =
lower_bound(div_a.begin(), div_a.end(), d1);
if (it == div_a.end() || *it > d1) {
if (it == div_a.begin()) {
continue;
} else {
it--;
}
}
long long d2 = *it;
if (a_plus_b / d1 >= a / d2) {
ans = min(ans, 2ll * (d1 + (a + b) / d1));
}
}
cout << ans;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
double sqr(double x) { return x * x; }
double getDis(long long x1, long long y1, long long x2, long long y2) {
return sqrt((double)sqr(x1 - x2) + sqr(y1 - y2));
}
int n, xp, yp;
int x[100005], y[100005];
double getC(double r) { return r * r * 3.14159265358979323846; }
struct point {
double x, y;
point() {
x = 0;
y = 0;
}
point(double a, double b) : x(a), y(b) {}
};
struct Line {
point p1, p2;
double A, B, C;
Line() {}
Line(double xx1, double yy1, double xx2, double yy2) {
p1 = point(xx1, yy1), p2 = point(xx2, yy2);
A = p1.y - p2.y, B = p2.x - p1.x, C = -(A * p1.x + B * p1.y);
}
Line(point t1, point t2) {
p1 = t1, p2 = t2;
A = p1.y - p2.y, B = p2.x - p1.x, C = -(A * p1.x + B * p1.y);
}
double getDis(double x, double y) {
return abs(A * x + B * y + C) / sqrt(A * A + B * B);
}
};
double dot(double v1x, double v1y, double v2x, double v2y) {
return v1x * v2x + v1y * v2y;
}
int main() {
scanf("%d%d%d", &n, &xp, &yp);
for (int i = 0; i < n; ++i) scanf("%d %d", x + i, y + i);
double mx = -1, mn = 1ll << 60;
for (int i = 0; i < n; ++i) {
double d = getDis(xp, yp, x[i], y[i]);
mx = max(mx, d);
mn = min(mn, d);
}
for (int i = 0; i < n; ++i) {
double x1 = x[i], y1 = y[i];
double x2 = x[(i + 1) % n], y2 = y[(i + 1) % n];
double v1 = dot(xp - x1, yp - y1, x2 - x1, y2 - y1);
double v2 = dot(x2 - x1, y2 - y1, x2 - x1, y2 - y1);
if (0.0 - 1e-9 < v1 && v1 < v2 + 1e-9) {
Line line(x[i], y[i], x[(i + 1) % n], y[(i + 1) % n]);
mn = min(mn, line.getDis(xp, yp));
}
}
printf("%.20lf", (mx * mx - mn * mn) * 3.14159265358979323846);
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
set<int> a;
map<int, queue<int>> in_a;
int ai;
for (int i = 1; i <= n; i++) {
cin >> ai;
a.insert(ai);
in_a[ai].push(i);
}
vector<vector<int>> ans(n + 1, vector<int>(n + 1, 0));
auto it = a.end();
--it;
set<pair<int, int>> cur;
for (int i = 1; i <= n; i++) {
cur.insert(pair<int, int>(in_a[*it].front(), *it));
in_a[*it].pop();
auto u = cur.begin();
int j = 1;
while (u != cur.end()) {
ans[i][j] = u->second;
j++;
++u;
}
if (in_a[*it].empty()) --it;
}
int q, k, pos;
cin >> q;
for (int i = 0; i < q; i++) {
cin >> k >> pos;
cout << ans[k][pos] << endl;
}
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1 << 18;
inline long long f(int k) { return 1ll * k * (k - 1) / 2; }
int n, q;
vector<int> t[2 * N];
int idxRange(int i, int d, int u) {
int resu = upper_bound(t[i].begin(), t[i].end(), u) - t[i].begin();
int resd = lower_bound(t[i].begin(), t[i].end(), d) - t[i].begin();
return resu - resd;
}
int query(int l, int r, int d, int u) {
if (d > u) return 0;
++r;
int res = 0;
for (l += N, r += N; l < r; l >>= 1, r >>= 1) {
if (l & 1) res += idxRange(l++, d, u);
if (r & 1) res += idxRange(--r, d, u);
}
return res;
}
int main() {
scanf("%d %d", &n, &q);
for (int i = 0, h; i < n; i++) {
scanf("%d", &h);
--h;
t[N + i].push_back(h);
}
for (int i = N - 1; i >= 1; i--) {
int jl = 0, jr = 0;
while (jl < t[i << 1].size() || jr < t[i << 1 | 1].size()) {
if (jr == t[i << 1 | 1].size() ||
(jl < t[i << 1].size() && t[i << 1][jl] < t[i << 1 | 1][jr]))
t[i].push_back(t[i << 1][jl++]);
else
t[i].push_back(t[i << 1 | 1][jr++]);
}
}
for (int i = 0, l, d, r, u; i < q; i++) {
scanf("%d %d %d %d", &l, &d, &r, &u);
--l;
--d;
--r;
--u;
long long ans = f(n) - (f(l) + f(d) + f(n - 1 - r) + f(n - 1 - u));
ans += f(query(0, l - 1, u + 1, n - 1));
ans += f(query(0, l - 1, 0, d - 1));
ans += f(query(r + 1, n - 1, u + 1, n - 1));
ans += f(query(r + 1, n - 1, 0, d - 1));
printf("%lld\n", ans);
}
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
map<long long int, long long int> mp, mk;
set<long long int> s1, s2;
vector<long long int> v, w;
long long int a[2000006], b[2000006];
string s = "", p = "", q = "";
char ch;
long long int m, n, c, d, i, j, k, l, r, x, t, y, u, e, f, g, h, mn, mx;
int main() {
cin >> t;
while (t--) {
cin >> n;
while (n % 2 == 0) {
n /= 2;
c++;
}
while (n % 3 == 0) {
n /= 3;
d++;
}
if (n == 1 && c <= d)
e = 2 * d - c;
else
e = -1;
cout << e << endl;
c = 0;
d = 0;
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int N, D, E;
cin >> N >> D >> E;
E *= 5;
int ans = N;
for (int i = 0; E * i <= N; i++) {
ans = min(ans, (N - E * i) % D);
}
cout << ans;
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
class sgt {
vector<long long int> arr;
vector<bool> inver;
public:
sgt() {
arr.resize(4e5, 0), arr.assign(4e5, 0);
inver.resize(4e5, false), inver.assign(4e5, false);
}
void build(long long int x, vector<long long int> &a, long long int l,
long long int r) {
if (l == r)
arr[x] = a[l];
else {
long long int mid = (l + r) / 2;
build(2 * x, a, l, mid);
build(2 * x + 1, a, mid + 1, r);
arr[x] = arr[2 * x] + arr[2 * x + 1];
}
}
void push(long long int x, long long int l, long long int r) {
inver[x] = false;
long long int mid = (l + r) / 2;
arr[2 * x] = mid - l + 1 - arr[2 * x];
arr[2 * x + 1] = r - mid - arr[2 * x + 1];
inver[2 * x] = 1 ^ inver[2 * x];
inver[2 * x + 1] = 1 ^ inver[2 * x + 1];
}
void update(long long int x, long long int l, long long int r,
long long int ql, long long int qr) {
if (ql > qr) return;
if (l == ql && r == qr) {
if (inver[x])
inver[x] = false;
else
inver[x] = true;
arr[x] = qr - ql + 1 - arr[x];
} else {
long long int mid = (l + r) / 2;
if (inver[x]) push(x, l, r);
update(2 * x, l, mid, ql, min(qr, mid));
update(2 * x + 1, mid + 1, r, max(ql, mid + 1), qr);
arr[x] = arr[2 * x] + arr[2 * x + 1];
}
}
long long int query(long long int x, long long int l, long long int r,
long long int ql, long long int qr, bool inv) {
if (ql > qr) return 0;
if (ql == l && qr == r) {
if (inv)
return (r - l + 1 - arr[x]);
else
return arr[x];
} else {
long long int mid = (l + r) / 2;
long long int val1 =
query(2 * x, l, mid, ql, min(mid, qr), (inv ^ inver[x]));
long long int val2 =
query(2 * x + 1, mid + 1, r, max(mid + 1, ql), qr, (inv ^ inver[x]));
return val1 + val2;
}
}
};
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long int n, m;
cin >> n;
vector<long long int> arr(n);
for (long long int i = 0; i < n; cin >> arr[i++])
;
cin >> m;
vector<sgt> trees(20);
for (long long int i = 0; i < 20; i++) {
vector<long long int> create(n);
for (long long int j = 0; j < n; j++) {
create[j] = (arr[j] & 1);
arr[j] = (arr[j] >> 1);
}
trees[i].build(1, create, 0, n - 1);
}
while (m--) {
long long int t, l, r, x;
cin >> t >> l >> r;
l--, r--;
if (t == 1) {
long long int ans = 0, mul = 1;
for (long long int i = 0; i < 20; i++) {
ans += trees[i].query(1, 0, n - 1, l, r, false) * mul;
mul *= 2;
}
cout << ans << endl;
} else {
cin >> x;
for (long long int i = 0; i < 20; i++) {
long long int val = (x & 1);
if (val == 1) trees[i].update(1, 0, n - 1, l, r);
x = (x >> 1);
}
}
}
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[110011];
for (int i = 0; i < m; i++) cin >> a[i];
sort(a, a + m);
int ans = 0x3f3f3f3f;
for (int i = 0; i + n - 1 < m; i++) ans = min(ans, a[i + n - 1] - a[i]);
cout << ans;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int n, a[5009], dp[5009][5009];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
dp[0][i] = a[i];
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i + j <= n) dp[i][j] = dp[i - 1][j] ^ dp[i - 1][j + 1];
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i + j <= n)
dp[i][j] = max(max(dp[i][j], dp[i - 1][j]), dp[i - 1][j + 1]);
}
}
int q;
cin >> q;
while (q--) {
int l, r;
cin >> l >> r;
int ans = dp[r - l][l];
cout << ans << "\n";
}
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
long long niha = 0, Tazwar = 0, niha_Tazwar, i, j;
for (i = 0; i < s.size(); i++) {
if (s[i] == '^') {
niha_Tazwar = i;
break;
}
}
for (i = 0; i < niha_Tazwar; i++) {
if (s[i] != '=') {
niha += (niha_Tazwar - i) * (s[i] - '0');
}
}
for (i = niha_Tazwar + 1; i < s.size(); i++) {
if (s[i] != '=' && s[i] != '^') {
Tazwar += (i - niha_Tazwar) * (s[i] - '0');
}
}
if (niha == Tazwar)
cout << "balance" << endl;
else if (niha > Tazwar)
cout << "left" << endl;
else
cout << "right" << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using LL = int64_t;
using LD = long double;
const LL INF = 0x3f3f3f3f;
const LL mod = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (auto& i : a) cin >> i;
for (int i = 1; i < n; i++) {
if (a[i] % a[0]) {
cout << "-1\n";
return 0;
}
}
cout << 2 * n << '\n';
for (int i = 0; i < n; i++) cout << a[0] << ' ' << a[i] << ' ';
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
const int N = 5050;
int n, m;
vector<int> ans1, ans2;
struct String {
int num1, num2, op;
int num[1050];
} p[N];
int tot, bit[N];
string s, var;
map<string, int> vis;
inline int cal(int now, int pos) {
int ret = 0;
bit[0] = now;
for (int i = 1; i <= n; ++i) {
int a = bit[p[i].num1], b = bit[p[i].num2];
switch (p[i].op) {
case 1: {
bit[i] = a & b;
break;
}
case 2: {
bit[i] = a | b;
break;
}
case 3: {
bit[i] = a ^ b;
break;
}
case 4: {
bit[i] = p[i].num[pos];
break;
}
}
ret += bit[i];
}
return ret;
}
int main() {
cin >> n >> m;
vis["?"] = 0;
for (int i = 1; i <= n; ++i) {
cin >> var;
cin >> s;
cin >> s;
vis[var] = ++tot;
if (s[0] == '0' || s[0] == '1') {
p[i].op = 4;
for (int j = 1; j <= m; ++j) p[i].num[j] = s[j - 1] - '0';
continue;
}
p[i].num1 = vis[s];
cin >> s;
if (s[0] == 'A')
p[i].op = 1;
else if (s[0] == 'O')
p[i].op = 2;
else if (s[0] == 'X')
p[i].op = 3;
cin >> s;
p[i].num2 = vis[s];
}
for (int i = 1; i <= m; ++i) {
int tmp1 = cal(0, i);
int tmp2 = cal(1, i);
if (tmp1 <= tmp2)
ans1.push_back(0);
else
ans1.push_back(1);
if (tmp1 >= tmp2)
ans2.push_back(0);
else
ans2.push_back(1);
}
for (auto i : ans1) cout << i;
cout << endl;
for (auto i : ans2) cout << i;
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1 << 30;
const long double eps = 1e-9;
int a, b;
void check(int a1, int b1, int a2, int b2) {
if ((max(a1, a2) <= a && b1 + b2 <= b) ||
(max(b1, b2) <= b && a1 + a2 <= a)) {
cout << "YES";
exit(0);
}
}
int main() {
int a1, a2, b1, b2;
cin >> a >> b >> a1 >> b1 >> a2 >> b2;
check(a1, b1, a2, b2);
check(b1, a1, a2, b2);
check(a1, b1, b2, a2);
check(b1, a1, b2, a2);
cout << "NO";
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
struct node {
long long ct, a, b, c;
};
long long n, m, k;
long long MMI(long long a, long long m = 998244353) {
long long m0 = m;
long long y = 0, x = 1;
if (m == 1) return 0;
while (a > 1) {
long long q = a / m, t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0) x += m0;
return x;
}
vector<long long> fact(500001), ifact(500001);
void precompute() {
fact[0] = 1;
for (long long i = 1; i < 500001; i++) {
fact[i] = fact[i - 1] * i;
fact[i] %= 998244353;
}
ifact[500001 - 1] = MMI(fact[500001 - 1]);
for (long long i = 500001 - 2; i >= 0; i--) {
ifact[i] = (i + 1) * ifact[i + 1];
ifact[i] %= 998244353;
}
}
long long ncrp(long long n, long long r) {
if (n < r)
return 0;
else
return (((fact[n] * ifact[r]) % 998244353) * ifact[n - r]) % 998244353;
}
void solve() {
long long i, j, x, y, z;
cin >> n >> k;
long long ans = 0;
for (i = 1; i < n + 1; i++) {
ans = ans + ncrp(n / i - 1, k - 1);
ans %= 998244353;
}
cout << ans << '\n';
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
long long t = 1;
precompute();
while (t--) solve();
}
| 6 |
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
const int KIND_CHAR = 6 + 1;
class ChildLink {
public:
ChildLink() {}
ChildLink(int V, char *S, int len) : V(V), S(S), len(len) {}
int V;
char *S;
int len;
};
typedef ChildLink &CR;
class SuffixTree;
class SuffixNode {
public:
typedef SuffixNode &SR;
SuffixNode() {}
int S, P;
char Pch;
ChildLink Ch[KIND_CHAR];
CR C(char a, bool readOnly = false);
SuffixTree *t;
};
typedef SuffixNode &SR;
const int NONE = 0;
class SuffixTree {
public:
SuffixTree(int node_size) {
szCLinks = node_size + 1;
szNodes = node_size + 1;
alloc_pool(CLinks, szCLinks);
alloc_pool(Nodes, szNodes);
root = allocNode();
}
virtual ~SuffixTree() {
for (char *s : S) {
delete s;
}
}
ChildLink *CLinks;
int szCLinks, CLinks_var = 1;
int allocChildLink() { return CLinks_var++; }
SuffixNode *Nodes;
int szNodes, Nodes_var = 1;
int allocNode() {
Nodes[Nodes_var].t = this;
return Nodes_var++;
}
int getArrayMemory() {
return sizeof(ChildLink) * szCLinks + sizeof(SuffixNode) * szNodes;
}
template <typename T>
void alloc_pool(T *&a, int sz) {
a = new T[sz];
memset(a, 0, sizeof(T) * sz);
}
void setChild(int p, int v, char *s, int len) {
SR pp = Nodes[p];
SR vv = Nodes[v];
char c = s[0];
CR cc = pp.C(c);
cc.S = s;
cc.V = v;
cc.len = len;
vv.P = p;
vv.Pch = c;
}
int createNodeOnEdge(int v, char c, int len) {
SR vv = Nodes[v];
CR cc = vv.C(c);
int x = cc.V;
int m = allocNode();
setChild(m, x, cc.S + len, cc.len - len);
setChild(v, m, cc.S, len);
return m;
}
void fastForward(int &v, char *&s, int &len) {
while (len > 0) {
char e = s[0];
SR vv = Nodes[v];
CR ce = vv.C(e);
int vlen = ce.len;
if (vlen <= len) {
s += vlen;
len -= vlen;
v = ce.V;
} else {
break;
}
}
}
int getNode(int v, char *s, int len) {
fastForward(v, s, len);
if (len > 0) {
v = createNodeOnEdge(v, s[0], len);
}
return v;
}
int getSL(int now) {
SR nn = Nodes[now];
if (nn.S == 0) {
char Pch = nn.Pch;
SR pp = Nodes[nn.P];
CR cc = pp.C(Pch);
if (nn.P == root) {
nn.S = getNode(root, cc.S + 1, cc.len - 1);
} else {
nn.S = getNode(pp.S, cc.S, cc.len);
}
}
return nn.S;
}
void addString(char *s, int len) {
char *ns = new char[len];
int now = root;
bool on_v = true;
char nch;
int nl;
for (int i = 0; i < len; i++) {
char c = ns[i] = s[i];
SR nn = Nodes[now];
if (on_v) {
if (nn.C(c, true).V == NONE) {
int x = allocNode();
setChild(now, x, ns + i, len - i);
if (now != root) {
now = getSL(now);
i--;
}
continue;
}
on_v = false;
nch = c;
nl = 0;
}
CR ncc = nn.C(nch);
if (ncc.S[nl] == c) {
nl++;
} else {
int ch = ncc.V;
now = createNodeOnEdge(now, nch, nl);
on_v = true;
i--;
continue;
}
if (ncc.len == nl) {
now = ncc.V;
on_v = true;
}
}
S.push_back(ns);
}
vector<char *> S;
int root;
bool find_modified(char *s, int len) {
int v = root;
for (int t = 0; t < len;) {
char e = s[t];
SR vv = Nodes[v];
int rlen = len - t;
CR ce = vv.C(e, true);
if (v != root && vv.C(5, true).V != NONE) {
return true;
}
if (ce.V == NONE) {
return false;
}
int vlen = ce.len;
int tlen = min(vlen, rlen);
for (int i = 0; i < tlen; i++) {
if (ce.S[i] != s[t]) {
if (ce.S[i] == 5) return true;
return false;
}
t++;
}
v = ce.V;
}
return true;
}
};
CR SuffixNode::C(char a, bool readOnly) { return Ch[a]; }
int convert(char *s) {
int i;
for (i = 0; s[i] != '\0'; i++) {
if (s[i] == 'E')
s[i] = 1;
else if (s[i] == 'N')
s[i] = 2;
else if (s[i] == 'S')
s[i] = 3;
else if (s[i] == 'W')
s[i] = 4;
else if (s[i] == '$')
s[i] = 5;
}
return i;
}
char *strrev_tmp(char *str) {
char *p1, *p2;
if (!str || !*str) return str;
for (p1 = str, p2 = str + strlen(str) - 1; p2 > p1; ++p1, --p2) {
*p1 ^= *p2;
*p2 ^= *p1;
*p1 ^= *p2;
}
return str;
}
using namespace std;
int n;
char A[1000011];
char B[1000011];
SuffixTree *tree;
int main() {
scanf("%d\n", &n);
n--;
fgets(A, 1000011, stdin);
fgets(B, 1000011, stdin);
B[n] = '\0';
strrev_tmp(B);
A[n] = '$';
B[n] = '$';
A[n + 1] = '\0';
B[n + 1] = '\0';
for (int i = 0; i < n; i++) {
if (A[i] == 'W') {
A[i] = 'E';
} else if (A[i] == 'S') {
A[i] = 'N';
} else if (A[i] == 'N') {
A[i] = 'S';
} else if (A[i] == 'E') {
A[i] = 'W';
}
}
int len = convert(A);
tree = new SuffixTree(2 * len);
tree->addString(A, len);
len = convert(B);
printf("%s\n", tree->find_modified(B, len) ? "NO" : "YES");
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long b = sqrt((9 + 8 * (n + k))), ans = (n - 0.5 * b + 1.5);
cout << ans;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int n, p;
string s;
int check(int x) {
for (char ch = s[x] + 1; ch <= 'a' + p - 1; ++ch) {
if (x == 0 || (x == 1 && ch != s[0]) ||
(x >= 2 && ch != s[x - 1] && ch != s[x - 2])) {
return ch;
}
}
return 0;
}
int main() {
cin >> n >> p;
cin >> s;
int i;
for (i = n - 1; i >= 0; --i) {
int tmpch = check(i);
if (tmpch != 0) {
s[i] = tmpch;
break;
}
}
if (i == -1) {
printf("NO\n");
return 0;
}
for (int j = i + 1; j < n; ++j) {
s[j] = 'a' - 1;
s[j] = check(j);
}
cout << s << endl;
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T& s) {
s = 0;
int f = 0;
char c = getchar();
while (!isdigit(c)) f |= (c == '-'), c = getchar();
while (isdigit(c)) s = s * 10 + (c ^ 48), c = getchar();
s = f ? -s : s;
}
const int _ = 5010;
const long long INF = 0x3f3f3f3f3f3f3f3fLL;
int n, s, e, nxt[_];
long long x[_], a[_], b[_], c[_], d[_];
inline long long calc(int i, int j) {
if (x[j] < x[i])
return labs(x[i] - x[j]) + c[i] + b[j];
else
return labs(x[i] - x[j]) + d[i] + a[j];
}
int main() {
read(n), read(s), read(e);
for (register int i = 1; i <= n; ++i) read(x[i]);
for (register int i = 1; i <= n; ++i) read(a[i]);
for (register int i = 1; i <= n; ++i) read(b[i]);
for (register int i = 1; i <= n; ++i) read(c[i]);
for (register int i = 1; i <= n; ++i) read(d[i]);
long long ans = calc(s, e);
nxt[s] = e;
for (register int i = 1; i <= n; ++i) {
if (i == s || i == e) continue;
long long tmp = INF;
int pos;
for (register int j = s; j != e; j = nxt[j]) {
long long now = calc(j, i) + calc(i, nxt[j]) - calc(j, nxt[j]);
if (now < tmp) tmp = now, pos = j;
}
ans += tmp, nxt[i] = nxt[pos], nxt[pos] = i;
}
printf("%lld\n", ans);
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
while (n--) {
int c;
cin >> c;
cout << c << "\n";
for (int i = 0; i < c; i++) cout << i + 1 << " ";
}
}
| 0 |
#include <bits/stdc++.h>
char s[1000020];
char c[1000020];
int l, r;
int main() {
scanf("%s %s", s, c);
for (r = 0; s[r] == c[r];) r++;
for (l = strlen(c); l >= 0 && s[l + 1] == c[l];) l--;
printf("%d\n", r > l ? r - l : 0);
for (int i = l + 1; i <= r; i++) printf("%d ", i + 1);
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int n, t;
string s, s1;
int main() {
cin >> n >> t;
cin >> s;
s1 = s;
for (int i = 0; i < t; i++) {
for (int i = 0; i < n - 1; i++) {
if (s[i] == 'B' && s[i + 1] == 'G') {
s1[i] = s[i + 1];
s1[i + 1] = s[i];
}
}
s = s1;
}
cout << s;
cout << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int pdp[512][512], qdp[512][512];
int v[512];
int main() {
int n, m, b, mod;
cin >> n >> m >> b >> mod;
for (int i = 1; i <= n; i++) cin >> v[i];
for (int i = 0; i <= n; i++) qdp[i][0] = 1;
for (int i = 0; i < m; i++) {
for (int j = 0; j <= n; j++)
for (int k = 0; k <= b; k++) pdp[j][k] = qdp[j][k];
for (int k = 0; k <= b; k++) qdp[0][k] = 0;
for (int j = 1; j <= n; j++)
for (int k = 0; k <= b; k++)
if (k >= v[j])
qdp[j][k] = (qdp[j - 1][k] + pdp[j][k - v[j]]) % mod;
else
qdp[j][k] = qdp[j - 1][k];
}
int res = 0;
for (int k = 0; k <= b; k++) res = (res + qdp[n][k]) % mod;
cout << res;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
long long p, q;
cin >> t;
int i, n;
while (t--) {
q = 0;
p = 0;
cin >> n;
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
if (a[i] % 2 == 0) {
q++;
} else
p++;
}
if (q == n || p == n) {
cout << "YES"
<< "\n";
} else
cout << "NO"
<< "\n";
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int n, k, c, a[400], sum;
int main() {
cin >> n >> k >> c;
for (int i = 1; i <= c; i++) cin >> a[i], sum += (a[i] - a[i - 1] - 1) / k;
sum += c + (n - a[c]) / k;
cout << sum;
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
long long cnd = (1ll << 32) - 1;
long long x = 0;
void check() {
if (x > cnd) {
cout << "OVERFLOW!!!\n";
exit(0);
}
}
int main() {
long long i, j, k, l, n, test_case, m, r;
test_case = 1;
cin >> test_case;
stack<long long> STA;
long long cur = 1;
string str;
int cnt = 0;
bool fl = 0;
while (test_case--) {
cin >> str;
if (str == "add") {
x += cur;
if (fl) {
cout << "OVERFLOW!!!";
exit(0);
}
check();
} else if (str == "for") {
cin >> j;
if (!fl) {
STA.push(j);
cur = cur * j;
} else {
cnt++;
}
if (cur > cnd) {
fl = 1;
}
} else {
if (cnt) {
cnt--;
} else {
cur = cur / (STA.top());
STA.pop();
}
if (cnt == 0) {
fl = 0;
}
}
}
cout << x << "\n";
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
long long sum(vector<long long> &a, int b);
long long sumsquare(vector<long long> &a, int b);
int main() {
vector<long long> vec;
long long n, x, y;
cin >> n >> x >> y;
int k(1);
bool b(0);
if (x >= 1000 && x <= 10000) {
k = 5;
b = 1;
} else if (x >= 100000 && x <= 1000000) {
k = 20;
b = 1;
} else if (x >= 10000000 && x <= 100000000) {
k = 50;
b = 1;
}
for (long long i = 0; i < n; i++) {
vec.push_back(1);
}
while (1) {
if (sum(vec, n) <= y && sumsquare(vec, n) >= x) {
copy(vec.begin(), vec.end(), ostream_iterator<long long>(cout, " "));
return 0;
} else if (sum(vec, n) > y) {
cout << -1;
return 0;
} else {
vec[0] += 1;
}
}
return 0;
}
long long sum(vector<long long> &a, int b) {
long long result(0);
result = result + a[0] + b - 1;
return result;
}
long long sumsquare(vector<long long> &a, int b) {
long long result(0);
result = result + a[0] * a[0] + b - 1;
return result;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
char s[100011];
int n;
int nxt[100011][26];
int prv[100011][26];
int lft[100011][26];
int rgt[100011][26];
int xo[100011][26];
inline int ch(char a) { return a - 'a'; }
vector<pair<int, int> > vp;
bool cmp(pair<int, int> u, pair<int, int> v) {
if (u.first == v.first) return u.second < v.second;
return u.first > v.first;
}
int vst[1111];
int runs;
inline int grundy(int l, int r) {
runs++;
for (int i = 0; i < 26; i++) {
int L = nxt[l][i];
int R = prv[r][i];
if (L > R) continue;
int tmp = rgt[l][i] ^ lft[r][i];
tmp ^= xo[L + 1][i] ^ xo[R + 1][i];
vst[tmp] = runs;
}
for (int i = 0;; i++)
if (vst[i] != runs) return i;
}
vector<int> vec[26];
void pre() {
n = strlen(s + 1);
for (int i = 1; i <= n; i++) {
for (int j = 0; j < 26; j++) {
prv[i][j] = prv[i - 1][j];
}
prv[i][ch(s[i])] = i;
}
for (int j = 0; j < 26; j++) nxt[n + 1][j] = n + 1;
for (int i = n; i >= 1; i--) {
for (int j = 0; j < 26; j++) {
nxt[i][j] = nxt[i + 1][j];
}
nxt[i][ch(s[i])] = i;
}
for (int i = 1; i <= n; i++) {
for (int j = 0; j < 26; j++) {
int ed = nxt[i][j];
if (ed == n + 1) continue;
if (ed == i) continue;
vp.push_back(pair<int, int>(i, ed - 1));
}
for (int j = 0; j < 26; j++) {
int st = prv[i][j];
if (st == 0 or st == i) continue;
vp.push_back(pair<int, int>(st + 1, i));
}
}
for (int i = 1; i <= n; i++) vec[ch(s[i])].push_back(i);
for (int i = 0; i < 26; i++) {
for (int j = 0; j + 1 < vec[i].size(); j++) {
int l = vec[i][j], r = vec[i][j + 1];
vp.push_back(pair<int, int>(l + 1, r - 1));
}
}
sort(vp.begin(), vp.end(), cmp);
vp.erase(unique(vp.begin(), vp.end()), vp.end());
for (auto p : vp) {
int l = p.first, r = p.second;
int g = grundy(l, r);
if (r < n and nxt[l][ch(s[r + 1])] == r + 1) {
rgt[l][ch(s[r + 1])] = g;
}
if (l > 1 and prv[r][ch(s[l - 1])] == l - 1) {
lft[r][ch(s[l - 1])] = g;
}
if (l > 1 and r < n and s[l - 1] == s[r + 1]) {
xo[l][ch(s[l - 1])] = g ^ xo[r + 2][ch(s[l - 1])];
}
}
}
void solve() {
scanf("%s", s + 1);
int q;
cin >> q;
pre();
while (q--) {
int l, r, g;
scanf("%d %d", &l, &r);
g = grundy(l, r);
if (g)
puts("Alice");
else
puts("Bob");
}
}
int main() {
solve();
return 0;
}
| 12 |
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
#include <unordered_map>
#include <unordered_set>
#include <ctime>
#include <iomanip>
#include <bitset>
#include <assert.h>
using namespace std;
#define int long long int
#define uint unsigned long long int
#define loop(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define rloop(i,a,b) for(int i=(int)a;i<=(int)b;++i)
#define loopl(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define loopr(i,a,b) for(int i=(int)a;i>=(int)b;--i)
#define count_1(n) __builtin_popcountint(n)
#define pb push_back
#define eb emplace_back
#define ab(a) (a<0)?(-1*a):a
#define pc putchar
#define gc getchar
#define mset(a,b,c) loop(i,0,b) a[i]=c
#define mp make_pair
#define itoc(c) ((char)(((int)'0')+c))
#define aint(p) p.begin(),p.end()
#define max(x,y) ((x>y)?x:y)
#define min(x,y) ((x<y)?x:y)
#define mid(s,e) (s+(e-s)/2)
#define vi vector<int>
#define vvi vector<vector<int>>
const int MOD = 998244353;
int modpow(int a, int b, int mod) { int res = 1; for (; b; b >>= 1) { if (b & 1)res = res * a; res %= mod; a = a * a; a %= mod; }return res; }
int p(int a, int b) { int res = 1; for (; b; b >>= 1) { if (b & 1)res = res * a; a = a * a; }return res; }
void testcases() {
string a,b; cin>>a>>b;
int n = a.size(); int m = b.size();
a = '$'+a; b = '$'+b;
vector<vvi> dp(n+1, vvi(m+1, vi(2)));
loop(i,1,n+1) { dp[i][0][0]++; dp[i][0][0]%=MOD; if(a[i]!=a[i-1]) { dp[i][0][0] += dp[i-1][0][0]; dp[i][0][0]%=MOD; } }
loop(j,1,m+1) { dp[0][j][1]++; dp[0][j][1]%=MOD; if(b[j]!=b[j-1]) { dp[0][j][1] += dp[0][j-1][1]; dp[0][j][1]%=MOD; } }
int ans = 0;
loop(i,1,n+1) {
loop(j,1,m+1) {
dp[i][j][0]++; dp[i][j][1]++;
if(a[i]!=a[i-1]) { dp[i][j][0] += dp[i-1][j][0]; dp[i][j][0]%=MOD; }
if(a[i]!=b[j]) { dp[i][j][0] += dp[i-1][j][1]; dp[i][j][0]%=MOD; }
if(b[j]!=a[i]) { dp[i][j][1] += dp[i][j-1][0]; dp[i][j][1]%=MOD; }
if(b[j]!=b[j-1]) { dp[i][j][1] += dp[i][j-1][1]; dp[i][j][1]%=MOD; }
ans += dp[i][j][0]; ans%=MOD;
ans += dp[i][j][1]; ans%=MOD;
}
}
int xans = 0; int yans = 0; int xpos = 1; int ypos = 1;
loop(i,2,n+1) if(a[i]==a[i-1]) { xans += (((i-xpos)*(i-xpos+1))%MOD * modpow(2,MOD-2,MOD))%MOD; xans%=MOD; xpos = i; } xans += (((n+1-xpos)*(n+1-xpos+1))%MOD * modpow(2,MOD-2,MOD))%MOD; xans%=MOD;
loop(i,2,m+1) if(b[i]==b[i-1]) { yans += (((i-ypos)*(i-ypos+1))%MOD * modpow(2,MOD-2,MOD))%MOD; ypos = i; } yans += (((m+1-ypos)*(m+1-ypos+1))%MOD * modpow(2,MOD-2,MOD))%MOD;
ans -= (xans*(m))%MOD; ans+=MOD; ans%=MOD;
ans -= (yans*(n))%MOD; ans+=MOD; ans%=MOD;
cout << ans << "\n";
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
/* code */
int t;
// cin >> t;
t = 1;
loop(i,0,t) testcases();
/* end code */
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
long long mult(long long a, long long b, long long p = 1000000007) {
long long ans = ((a % p) * (b % p)) % p;
return (ans + p) % p;
}
long long add(long long a, long long b, long long p = 1000000007) {
long long ans = (a % p + b % p) % p;
return (ans + p) % p;
}
long long fpow(long long n, long long k, long long p = 1000000007) {
long long r = 1;
for (; k; k >>= 1) {
if (k & 1) r = r * n % p;
n = n * n % p;
}
return r;
}
long long inv(long long a, long long p = 1000000007) {
return fpow(a, p - 2, p);
}
long long n, m, k;
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> m >> k;
vector<pair<long long, long long> > arr(n);
vector<long long> orig(n);
for (long long i = 0; i < n; i++) {
cin >> arr[i].first;
arr[i].second = i;
orig[i] = arr[i].first;
}
sort(arr.begin(), arr.end(), greater<pair<long long, long long> >());
vector<bool> has(n, 0);
long long s = 0;
for (long long i = 0; i < m * k; i++) {
s += arr[i].first;
has[arr[i].second] = 1;
}
cout << s << endl;
vector<long long> ans;
long long ov = 0;
for (long long i = 0; i < n;) {
long long cnt = 0, j = i;
while (cnt < m) {
if (has[j] == 1) {
cnt++;
}
j++;
}
ov++;
i = j;
if (ov == k) break;
cout << i << " ";
ans.push_back(i);
}
cout << endl;
return 0;
}
| 3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.