solution
stringlengths 53
181k
| difficulty
int64 0
27
|
|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int amax = *max_element(a.begin(), a.end());
int amin = *min_element(a.begin(), a.end());
vector<int> l(m), r(m);
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
l[i]--;
r[i]--;
}
vector<int> ans;
for (int i = 0; i < n; i++) {
vector<int> new_ans, c = a;
for (int j = 0; j < m; j++) {
if (i < l[j] || i > r[j]) {
for (int k = l[j]; k <= r[j]; k++) {
c[k]--;
}
new_ans.push_back(j + 1);
}
}
int cmax = *max_element(c.begin(), c.end());
int cmin = *min_element(c.begin(), c.end());
if (cmax - cmin > amax - amin) {
amax = cmax;
amin = cmin;
ans = new_ans;
}
}
cout << amax - amin << '\n' << (int)ans.size() << '\n';
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << ' ';
}
cout << '\n';
return 0;
}
| 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, i, j, s;
cin >> s >> k;
vector<long long> v(200), v1(200);
v[0] = 1, v1[0] = 1;
i = 1;
for (; v[i - 1] <= s; i++) {
if (i - k - 1 >= 0)
v[i] = v1[i - 1] - v1[i - k - 1];
else
v[i] = v1[i - 1];
v1[i] = v1[i - 1] + v[i];
}
long long L = 1;
vector<long long> ans(200);
while (s) {
long long x = 0;
for (; v[x] <= s; x++)
;
ans[L++] = v[x - 1];
s -= v[x - 1];
}
cout << L << endl;
for (i = 0; i < L; i++) cout << ans[i] << " ";
cout << endl;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
long long scal(pair<int, int> a, pair<int, int> b) {
return (long long)a.first * (long long)a.second +
(long long)b.first * (long long)b.second;
}
long long mul(pair<int, int> a, pair<int, int> b) {
return (long long)a.first * (long long)b.second -
(long long)a.second * (long long)b.first;
}
int half(pair<int, int> a) {
if (a.second > 0 || (a.second == 0 && a.first >= 0)) return 0;
return 1;
}
int half(pair<int, int> a, pair<int, int> b) {
long long pr = mul(a, b);
if (pr != 0) return (pr <= 0);
return (scal(a, b) < 0);
}
const int M = 210;
const int MOD = 998244353;
int n, x[M], y[M], dp[M], val[M][M], ml[M], ei[M][M], first[M][M], last[M][M],
sum[2 * M], ok[M][M];
vector<int> v[M];
vector<int> way[M][M];
pair<int, int> vect(int i, int j) {
return make_pair(x[j] - x[i], y[j] - y[i]);
}
pair<int, int> vect(pair<int, int> t) {
return make_pair(x[t.second] - x[t.first], y[t.second] - y[t.first]);
}
void dfs_help(int p, int pr) {
int id = -1;
for (int i = 0; i < (int)v[p].size(); i++) {
if (v[p][i] == pr)
id = i;
else
dfs_help(v[p][i], p);
}
if (id != -1) {
swap(v[p][id], v[p].back());
v[p].pop_back();
}
}
vector<int> _stack;
void dfs_way(int p, int pr, int st) {
_stack.push_back(p);
if (p != st && (int)_stack.size() >= 3) {
bool ch = true;
for (int i : _stack)
if (mul(vect(st, p), vect(st, i)) < 0) {
ch = false;
break;
}
if (ch) way[st][p] = _stack;
}
for (int i : v[p])
if (i != pr) dfs_way(i, p, st);
_stack.pop_back();
}
bool cmp(pair<int, int> a, pair<int, int> b) {
pair<int, int> va = vect(a);
pair<int, int> vb = vect(b);
int ha = half(va);
int hb = half(vb);
if (ha != hb) return ha < hb;
long long pr = mul(va, vb);
if (pr != 0) return (pr > 0);
return a < b;
}
bool good(pair<int, int> a, pair<int, int> b, pair<int, int> c) {
int hb = half(a, b);
int hc = half(a, c);
if (hb != hc) return hb < hc;
return mul(b, c) > 0;
}
vector<int> g[M];
vector<int> dfs(int p) {
ml[p] = 1;
vector<int> now = {p};
for (int i : v[p]) {
vector<int> to = dfs(i);
for (int x : to) now.push_back(x);
ml[p] = (long long)ml[p] * dp[i] % MOD;
}
dp[p] = ml[p];
for (int i : v[p]) {
int cur = ml[i];
for (int j : v[p])
if (j != i) cur = (long long)cur * dp[j] % MOD;
dp[p] += cur;
if (dp[p] >= MOD) dp[p] -= MOD;
}
for (int i : now) g[i].clear();
int k = 0;
for (int i : now)
for (int j : v[i]) {
g[i].push_back(j);
g[j].push_back(i);
ei[i][j] = k++;
ei[j][i] = k++;
}
for (int i : now)
for (int j : now) ok[i][j] = 0;
vector<pair<int, int> > al;
for (int i : now)
for (int j : now)
if (!way[i][j].empty() && mul(vect(i, j), vect(i, p)) >= 0) {
al.push_back(make_pair(i, j));
first[i][j] = ei[way[i][j][0]][way[i][j][1]];
last[i][j] = ei[way[i][j][(int)way[i][j].size() - 1]]
[way[i][j][(int)way[i][j].size() - 2]];
if (val[i][j] != -1) continue;
ok[i][j] = 1;
val[i][j] = 1;
for (int x = 0; x < (int)way[i][j].size(); x++) {
int v_cur = way[i][j][x];
pair<int, int> lb, rb;
if (x == 0) {
lb = vect(v_cur, way[i][j][x + 1]);
lb.first = -lb.first, lb.second = -lb.second;
} else
lb = vect(v_cur, way[i][j][x - 1]);
if (x + 1 == (int)way[i][j].size()) {
rb = vect(v_cur, way[i][j][x - 1]);
rb.first = -rb.first, rb.second = -rb.second;
} else
rb = vect(v_cur, way[i][j][x + 1]);
for (int to : v[v_cur])
if (good(lb, vect(v_cur, to), rb)) {
if (x != 0 && to == way[i][j][x - 1]) continue;
if (x + 1 < (int)way[i][j].size() && to == way[i][j][x + 1])
continue;
val[i][j] = (long long)val[i][j] * dp[to] % MOD;
}
}
}
sort(al.begin(), al.end(), cmp);
for (int v_st : now)
for (int ig : g[v_st]) {
if (half(vect(v_st, ig))) continue;
for (int ban = -1; ban <= 1; ban += 2) {
for (int i = 0; i < k; i++) sum[i] = 0;
sum[ei[v_st][ig]] = 1;
for (pair<int, int> t : al) {
if (ban == -1 && ok[t.first][t.second]) continue;
int S = first[t.first][t.second];
int F = last[t.first][t.second];
sum[F] += (long long)sum[S] * val[t.first][t.second] % MOD;
if (sum[F] >= MOD) sum[F] -= MOD;
}
sum[ei[v_st][ig]]--;
if (sum[ei[v_st][ig]] < 0) sum[ei[v_st][ig]] += MOD;
dp[p] += ban * sum[ei[v_st][ig]];
if (dp[p] >= MOD) dp[p] -= MOD;
if (dp[p] < 0) dp[p] += MOD;
}
}
return now;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) cin >> x[i] >> y[i];
for (int i = 0; i < n - 1; i++) {
int s, f;
cin >> s >> f;
s--, f--;
v[s].push_back(f);
v[f].push_back(s);
}
for (int i = 0; i < n; i++) dfs_way(i, -1, i);
dfs_help(0, -1);
memset(val, -1, sizeof(val));
dfs(0);
cout << dp[0] << "\n";
return 0;
}
| 27 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k, w, i, ans;
cin >> n >> k;
for (i = k - 1; i >= 1; i--) {
if (n % i == 0) {
w = i;
n = n / i;
break;
}
}
ans = w + n * k;
cout << ans;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
inline int gi() {
int data = 0, m = 1;
char ch = 0;
while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
if (ch == '-') {
m = 0;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
data = (data << 1) + (data << 3) + (ch ^ 48);
ch = getchar();
}
return (m) ? data : -data;
}
int dp[100005], Dep[100005], n, Q, Ans, root1, root2;
struct _Edge {
int to, next, w;
} Edge[100005 << 1];
int head[100005], CNT;
inline void AddEdge(int u, int v, int w) {
Edge[++CNT] = (_Edge){v, head[u], w};
head[u] = CNT;
return;
}
struct Tree {
int tag[100005 << 2], dis[100005], dfn[100005], ed[100005], ID[100005],
par[17][100005], val[100005], Extra[100005], nV, oo;
int root, ans[100005], tim[100005];
pair<int, int> mx[100005 << 2];
pair<int, int> ttmp;
inline void Add(int o, int v) {
tag[o] += v;
ttmp = mx[o];
mx[o] = make_pair(ttmp.first + v, ttmp.second);
}
inline void PushDown(int o) {
if (tag[o] == 0) return;
Add(o << 1, tag[o]);
Add(o << 1 | 1, tag[o]);
tag[o] = 0;
return;
}
void Insert(int o, int l, int r, int ps, pair<int, int> pr) {
if (l == r) return (void)(mx[o] = pr);
int mid = (l + r) >> 1;
if (ps <= mid)
Insert(o << 1, l, mid, ps, pr);
else
Insert(o << 1 | 1, mid + 1, r, ps, pr);
mx[o] = max(mx[o << 1], mx[o << 1 | 1]);
}
void Update(int o, int l, int r, int ql, int qr, int v) {
if (ql <= l && r <= qr) return (void)(Add(o, v));
int mid = (l + r) >> 1;
PushDown(o);
if (ql <= mid) Update(o << 1, l, mid, ql, qr, v);
if (qr > mid) Update(o << 1 | 1, mid + 1, r, ql, qr, v);
mx[o] = max(mx[o << 1], mx[o << 1 | 1]);
}
void dfs(int u, int From, int dist) {
dis[u] = dist;
par[0][u] = From;
dfn[u] = ++oo;
ID[oo] = u;
for (int e = 1; e <= 16; e++) par[e][u] = par[e - 1][par[e - 1][u]];
int scnt = 0;
for (int e = head[u]; e; e = Edge[e].next) {
int v = Edge[e].to;
if (v == From) continue;
val[v] = Edge[e].w;
dfs(v, u, dist + Edge[e].w);
++scnt;
}
ed[u] = oo;
if (!scnt) ++nV;
return;
}
void dfs2(int u, int From) {
Extra[u] = 0;
for (int e = head[u]; e; e = Edge[e].next) {
int v = Edge[e].to;
if (v == From) continue;
dfs2(v, u);
Extra[u] = max(Extra[v] + Edge[e].w, Extra[u]);
}
return;
}
inline void Init(int st) {
root = st;
dfs(root, 0, 0);
for (int i = 1; i <= n; i++) Insert(1, 1, n, dfn[i], make_pair(dis[i], i));
for (int y = 1; y <= nV; y++) {
pair<int, int> p = mx[1];
ans[y] = ans[y - 1] + p.first;
int u = p.second;
while (1989) {
if (!tim[u] && u != root)
tim[u] = y, Update(1, 1, n, dfn[u], ed[u], -val[u]), u = par[0][u];
else
break;
}
}
dfs2(root, 0);
return;
}
inline int Solve(int x, int y) {
if (y >= nV) return ans[nV];
if (tim[x] <= y) return ans[y];
int ret = 0, u = x;
for (int e = 16; e >= 0; e--)
if (par[e][u] && tim[par[e][u]] >= y)
ret += dis[u] - dis[par[e][u]], u = par[e][u];
while (tim[u] >= y && u != root) ret += val[u], u = par[0][u];
return ans[y] + dis[x] - dis[u] + Extra[x] -
min(Extra[u], ans[y] - ans[y - 1]);
}
} T[2];
inline bool cmp_d(int i, int j) { return Dep[i] < Dep[j]; }
void Dfs(int u, int From, int deep) {
int tmp[3] = {0, u, u};
Dep[u] = deep;
for (int e = head[u]; e; e = Edge[e].next) {
int v = Edge[e].to;
if (v == From) continue;
Dfs(v, u, deep + Edge[e].w);
tmp[0] = dp[v];
sort(tmp, tmp + 2 + 1, cmp_d);
continue;
}
if (Dep[tmp[1]] + Dep[tmp[2]] - 2 * Dep[u] > Ans) {
Ans = Dep[tmp[1]] + Dep[tmp[2]] - 2 * Dep[u];
root1 = tmp[1];
root2 = tmp[2];
}
dp[u] = tmp[2];
}
int main() {
n = gi();
Q = gi();
for (int i = 1, u, v, l; i < n; i++)
u = gi(), v = gi(), l = gi(), AddEdge(u, v, l), AddEdge(v, u, l);
Dfs(1, 0, 0);
if (n == 1) {
while (Q--) puts("0");
return 0;
}
T[0].Init(root1);
T[1].Init(root2);
Ans = 0;
while (Q--) {
int x = gi(), y = gi();
x = (x + Ans - 1) % n + 1;
y = (y + Ans - 1) % n + 1;
Ans = max(T[0].Solve(x, 2 * y - 1), T[1].Solve(x, 2 * y - 1));
printf("%d\n", Ans);
}
return 0;
}
| 25 |
#include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long n;
cin >> n;
n++;
if (n == 1) {
cout << "0";
return 0;
}
if (n % 2) {
cout << n;
} else {
cout << n / 2;
}
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
bool can[105][105];
char ch;
int n;
cin >> n;
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j) {
cin >> ch;
can[i][j] = (ch == 'E' ? false : true);
}
bool r = false, c = false;
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j) {
int sr = n, sc = n;
for (int k = 0; k < n; ++k) {
sr -= (!can[i][k]);
sc -= (!can[k][j]);
}
if (sr == 0) r = true;
if (sc == 0) c = true;
}
if (r && c) {
cout << -1;
return 0;
}
int tt = 0;
bool tr[105];
memset(tr, false, sizeof(tr));
vector<int> pp;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (can[i][j]) {
pp.push_back(j);
break;
}
}
}
if (pp.size() == n) {
for (int i = 0; i < n; ++i) cout << (i + 1) << " " << (pp[i] + 1) << endl;
} else {
vector<int> p2;
for (int j = 0; j < n; ++j) {
for (int i = 0; i < n; ++i)
if (can[i][j]) {
p2.push_back(i);
break;
}
}
if (p2.size() == n) {
for (int j = 0; j < n; ++j) cout << (p2[j] + 1) << " " << (j + 1) << endl;
} else {
cout << -1;
}
}
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
const int BLOCK = 301;
const int CNT = (100010 + BLOCK - 1) / BLOCK;
const int n = CNT * BLOCK;
const int N = n + 10;
inline void upd(int &a, int b) { a = ((a == 0 || b == 0) ? a + b : min(a, b)); }
int a[2][N];
int b[2][CNT];
bool zeros[2][CNT];
vector<int> c[2][CNT];
int sz[2][CNT];
long long sum[CNT];
inline void push(int id) {
for (int p = 0; p < 2; p++) {
if (b[p][id] != 0) {
for (int i = id * BLOCK; i < (id + 1) * BLOCK; i++) {
upd(a[p][i], b[p][id]);
}
b[p][id] = 0;
}
}
}
inline void pull(int id) {
for (int p = 0; p < 2; p++) {
zeros[p][id] = false;
for (int i = id * BLOCK; i < (id + 1) * BLOCK; i++) {
if (a[p][i] == 0) {
zeros[p][id] = true;
break;
}
}
if (zeros[p][id]) {
continue;
}
c[p][id].clear();
for (int i = id * BLOCK; i < (id + 1) * BLOCK; i++) {
if (a[1 - p][i] != 0) {
c[p][id].push_back(a[p][i]);
}
}
sz[p][id] = c[p][id].size();
sort(c[p][id].begin(), c[p][id].end());
}
sum[id] = 0;
for (int i = id * BLOCK; i < (id + 1) * BLOCK; i++) {
if (a[0][i] > 0 && a[1][i] > 0) {
sum[id] += a[0][i] + a[1][i];
}
}
}
inline void update_block(int id, int p, int k) {
int old = b[p][id];
upd(b[p][id], k);
if (zeros[p][id]) {
push(id);
pull(id);
} else {
int extra = sz[p][id] - (int)c[p][id].size();
if (extra > 0 && k < old) {
sum[id] -= extra * 1LL * (old - k);
}
while (!c[p][id].empty() && c[p][id].back() > k) {
sum[id] -= c[p][id].back() - k;
c[p][id].pop_back();
}
}
}
inline long long get_block(int id) { return sum[id]; }
int main() {
int tt;
scanf("%d", &tt);
for (int p = 0; p < 2; p++) {
for (int i = 0; i < n; i++) {
a[p][i] = 0;
}
}
for (int i = 0; i < n / BLOCK; i++) {
pull(i);
}
while (tt--) {
int type, from, to;
scanf("%d %d %d", &type, &from, &to);
to--;
if (type == 1) {
int k;
scanf("%d", &k);
int p;
if (k > 0) {
p = 0;
} else {
p = 1;
k = -k;
}
int fid = from / BLOCK;
int tid = to / BLOCK;
push(fid);
if (fid != tid) {
push(tid);
}
while (from <= to && from / BLOCK == fid) {
upd(a[p][from], k);
from++;
}
while (from <= to && to / BLOCK == tid) {
upd(a[p][to], k);
to--;
}
pull(fid);
if (fid != tid) {
pull(tid);
}
for (int id = fid + 1; id <= tid - 1; id++) {
update_block(id, p, k);
}
} else {
long long ans = 0;
int fid = from / BLOCK;
int tid = to / BLOCK;
push(fid);
if (fid != tid) {
push(tid);
}
while (from <= to && from / BLOCK == fid) {
if (a[0][from] > 0 && a[1][from] > 0) {
ans += a[0][from] + a[1][from];
}
from++;
}
while (from <= to && to / BLOCK == tid) {
if (a[0][to] > 0 && a[1][to] > 0) {
ans += a[0][to] + a[1][to];
}
to--;
}
pull(fid);
if (fid != tid) {
pull(tid);
}
for (int id = fid + 1; id <= tid - 1; id++) {
ans += get_block(id);
}
printf("%I64d\n", ans);
}
}
cerr << "time = " << clock() << " ms" << endl;
return 0;
}
| 23 |
#include <bits/stdc++.h>
using namespace std;
const int dx[] = {0, -1, 0, 1, -1, 1, 1, -1};
const int dy[] = {1, 0, -1, 0, 1, 1, -1, -1};
const double EPS = 1e-9;
const long double PI = 3.1415926535897932384L;
const long long int INF = 9223372036854775807;
const int MOD = 1000000000 + 7;
const int MAX = 10000000 + 7;
vector<pair<int, int> > arr;
int N, k;
bool cmp(pair<int, int> a, pair<int, int> b) {
if (a.first > b.first) return true;
if (a.first == b.first and a.second < b.second) return true;
return false;
}
int main() {
cin >> N >> k;
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
arr.push_back({a, b});
}
sort(arr.begin(), arr.end(), cmp);
int s = arr[k - 1].first, p = arr[k - 1].second, cnt = 0;
for (int i = 0; i < N; i++)
if (arr[i].first == s and arr[i].second == p) cnt++;
return cout << cnt << endl, 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int c = 5002;
int n, m, maxi, dp[c][c];
string a, b;
int main() {
cin >> n >> m >> a >> b;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
dp[i][j] = max({dp[i - 1][j] - 1, dp[i][j - 1] - 1, 0});
if (a[i - 1] == b[j - 1]) dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] + 2);
maxi = max(maxi, dp[i][j]);
}
}
cout << maxi << "\n";
return 0;
}
| 10 |
#include <bits/stdc++.h>
int main() {
int n, a, b, c, countx = 0;
scanf("%d %d %d %d", &n, &a, &b, &c);
for (int i = 0; i <= c; i++)
for (int j = 0; j <= b; j++)
if (2 * (n - 2 * i - j) <= a && 2 * (n - 2 * i - j) >= 0) countx++;
printf("%d", countx);
}
| 7 |
#include <bits/stdc++.h>
const int maxn = 20000 + 3;
const int INF = 0x3f3f3f3f;
inline int getint() {
bool flag = 0;
register int n = 0;
register char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') flag = 1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
n = ch - '0' + (n << 3) + (n << 1);
ch = getchar();
}
return flag ? (-n) : n;
}
int n;
int m;
int p;
int col[maxn];
struct Graph {
Graph() { tot = 1; }
int S;
int T;
int MaxFlow;
struct Edge {
int to, next, w;
};
int tot;
int cur[maxn];
int head[maxn];
Edge g[maxn * 100];
inline void Build(int from, int to, int w) {
tot++;
g[tot].w = w;
g[tot].to = to;
g[tot].next = head[from];
head[from] = tot;
tot++;
g[tot].w = 0;
g[tot].to = from;
g[tot].next = head[to];
head[to] = tot;
}
int deep[maxn];
std::queue<int> q;
inline bool BFS() {
memset(deep, 0, sizeof(deep));
deep[S] = 1;
q.push(S);
while (!q.empty()) {
int x = q.front();
q.pop();
cur[x] = head[x];
for (int i = head[x]; i; i = g[i].next) {
int y = g[i].to;
if (deep[y] == 0 && g[i].w) {
deep[y] = deep[x] + 1;
q.push(y);
}
}
}
return deep[T];
}
inline int DFS(int x, int flow) {
if (x == T) return flow;
int maxnow = 0;
for (int& i = cur[x]; i; i = g[i].next) {
int y = g[i].to;
if (deep[y] != deep[x] + 1 || g[i].w == 0) continue;
int di = DFS(y, std::min(flow, g[i].w));
if (di == 0) deep[y] = 0;
g[i].w -= di, g[i ^ 1].w += di;
flow -= di, maxnow += di;
if (flow == 0) return maxnow;
}
return maxnow;
}
inline void Read() {
n = getint();
m = getint();
p = getint();
S = n + 1, T = n + 2;
for (int i = 1; i <= n; i++) col[i] = getint();
for (int i = 1, w; i <= n; i++) {
w = getint();
if (col[i])
Build(i, T, w);
else
Build(S, i, w);
}
int sum = 0;
int cnt = n + 2;
for (int i = 1, x, w, k, ty; i <= m; i++) {
++cnt;
x = getint();
w = getint();
sum += w;
k = getint();
while (k--)
if (x)
Build(getint(), cnt, INF);
else
Build(cnt, getint(), INF);
ty = getint();
if (x)
Build(cnt, T, w + ty * p);
else
Build(S, cnt, w + ty * p);
}
while (BFS()) MaxFlow += DFS(S, INF);
printf("%d\n", sum - MaxFlow);
}
};
Graph G;
int main() {
G.Read();
return 0;
}
| 15 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
long long n, i;
string str, a;
cin >> n >> a >> str;
for (i = 0; i < str.length(); i++) {
if (str[i] == 'w') break;
}
if (i == str.length()) {
if (n <= 29)
cout << "12\n";
else if (n == 30)
cout << "11\n";
else
cout << "7\n";
} else {
if (n == 5 || n == 6)
cout << "53\n";
else
cout << "52\n";
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int N, K;
int dp[405][405];
int fr[405];
vector<pair<int, int> > took[405][405];
vector<pair<int, int> > adj[405];
int sz[405];
void DFS1(int u, int p) {
sz[u] = 1;
for (pair<int, int> v : adj[u]) {
if (v.first == p) continue;
DFS1(v.first, u);
fr[v.first] = v.second;
sz[u] += sz[v.first];
}
}
void DFS2(int u, int p) {
for (pair<int, int> v : adj[u]) {
if (v.first == p) continue;
DFS2(v.first, u);
for (int b = sz[u] - 1; b >= 0; b--) {
for (int c = 1; c <= min(sz[v.first], b); c++) {
if (dp[u][b] > dp[u][b - c] + dp[v.first][c]) {
dp[u][b] = dp[u][b - c] + dp[v.first][c];
took[u][b] = took[u][b - c];
took[u][b].push_back({v.first, c});
}
}
}
}
if (u != 1) {
dp[u][sz[u]] = 1;
took[u][sz[u]].push_back({u, sz[u]});
} else
dp[u][sz[u]] = 0;
}
void print(int u, int left) {
if (sz[u] == left)
printf("%d ", fr[u]);
else {
for (pair<int, int> t : took[u][left]) {
print(t.first, t.second);
}
}
}
int main() {
scanf("%d %d", &N, &K);
int u, v;
for (int i = 1; i < N; i++) {
scanf("%d %d", &u, &v);
adj[u].push_back({v, i});
adj[v].push_back({u, i});
}
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
dp[i][j] = 1000000000;
}
}
DFS1(1, 0);
DFS2(1, 0);
int ans = dp[1][N - K], ansid = 1;
for (int i = 2; i <= N; i++) {
if (sz[i] >= K && 1 + dp[i][sz[i] - K] < ans) {
ans = 1 + dp[i][sz[i] - K];
ansid = i;
}
}
printf("%d\n", ans);
if (ansid != 1) {
printf("%d ", fr[ansid]);
}
print(ansid, sz[ansid] - K);
}
| 14 |
#include <bits/stdc++.h>
using namespace std;
template <typename T1>
void print_list(const T1& a) {
cerr << a << endl;
}
template <typename T1, typename T2>
void print_list(const T1& a, const T2& b) {
cerr << a << " " << b << endl;
}
template <typename T1, typename T2, typename T3>
void print_list(const T1& a, const T2& b, const T3& c) {
cerr << a << " " << b << " " << c << endl;
}
template <typename T1, typename T2, typename T3, typename T4>
void print_list(const T1& a, const T2& b, const T3& c, const T4& d) {
cerr << a << " " << b << " " << c << " " << d << endl;
}
template <typename T1, typename T2, typename T3, typename T4, typename T5>
void print_list(const T1& a, const T2& b, const T3& c, const T4& d,
const T5& e) {
cerr << a << " " << b << " " << c << " " << d << " " << e << endl;
}
template <typename T1, typename T2, typename T3, typename T4, typename T5,
typename T6>
void print_list(const T1& a, const T2& b, const T3& c, const T4& d, const T5& e,
const T6& f) {
cerr << a << " " << b << " " << c << " " << d << " " << e << " " << f << endl;
}
template <typename T1, typename T2, typename T3, typename T4, typename T5,
typename T6, typename T7>
void print_list(const T1& a, const T2& b, const T3& c, const T4& d, const T5& e,
const T6& f, const T7& g) {
cerr << a << " " << b << " " << c << " " << d << " " << e << " " << f << " "
<< g << endl;
}
template <typename A, typename B>
ostream& operator<<(ostream& out, const pair<A, B>& pp) {
out << "(" << pp.first << "," << pp.second << ")";
return out;
}
template <typename A, typename B>
istream& operator<<(istream& in, pair<A, B>& pp) {
cerr << "A pair wanted" << endl;
in >> pp.first >> pp.second;
return in;
}
template <typename T>
ostream& operator<<(ostream& out, const vector<T>& vect) {
out << "length = " << vect.size() << endl;
for (int i = 0; i < vect.size(); i++) out << vect[i] << " ";
out << endl;
return out;
}
template <typename T>
istream& operator>>(istream& in, vector<T>& vect) {
vect.clear();
int n;
cerr << "A integer of length wanted" << endl;
in >> n;
vect.resize(n);
cerr << n << " elements wanted" << endl;
for (int i = 0; i < n; i++) in >> vect[i];
return in;
}
template <typename T>
ostream& operator<<(ostream& out, const vector<vector<T> >& vect) {
out << "row number=" << vect.size() << endl;
for (int i = 0; i < vect.size(); i++) {
out << "row #" << i << ":";
for (int j = 0; j < vect[i].size(); j++) out << " " << vect[i][j];
out << endl;
}
return out;
}
template <typename T>
istream& operator>>(istream& in, vector<vector<T> >& vect) {
vect.clear();
int n, m;
cerr << "Two integers wnated" << endl;
in >> n >> m;
vect.resize(n);
cerr << "A matrix " << n << " X " << m << " wanted" << endl;
for (int i = 0; i < n; i++) {
vect[i].resize(m);
for (int j = 0; j < m; j++) in >> vect[i][j];
}
return in;
}
template <typename T>
inline void updateMax(T& a, const T& b) {
a = max(a, b);
}
template <typename T>
inline void updateMin(T& a, const T& b) {
a = min(a, b);
}
template <typename T>
inline vector<T> erase(vector<T> table, int ind) {
assert(ind < table.size());
table.erase(table.begin() + ind);
return table;
}
template <typename T>
vector<T> unique(vector<T> table) {
sort(table.begin(), table.end());
return vector<T>(table.begin(), unique(table.begin(), table.end()));
}
template <class T>
vector<T> parse(const string& ss, const char* cut = " ") {
vector<T> re;
for (int j = 0; j < ss.size(); j++) {
string s;
while (j < ss.size() && NULL == strchr(cut, ss[j])) s += ss[j++];
if (!s.empty()) {
T tmp;
istringstream is(s);
is >> tmp;
re.push_back(tmp);
}
}
return re;
}
int countBit(int n) {
int re = 0;
while (n) re++, n ^= ((((n) ^ ((n)-1)) & n));
return re;
}
int MSB(int n) {
if (n == 0) return 0;
while (((((n) ^ ((n)-1)) & n)) != n) n ^= ((((n) ^ ((n)-1)) & n));
return n;
}
void initHash(int n, int hash[]) {
for (int i = 0; i < n; i++) hash[((1) << (i))] = i;
}
void initBcnt(int n, int bcnt[]) {
bcnt[0] = 0;
for (int i = 1; i < ((1) << (n)); i++)
bcnt[i] = bcnt[i ^ ((((i) ^ ((i)-1)) & i))] + 1;
}
template <typename T>
T __gcd(T n, T m, T& a, T& b) {
T a1 = 0, b1 = 1;
a = 1, b = 0;
while (m) {
T c = n / m;
T r = n - m * c;
T t;
t = a;
a = a1;
a1 = t - c * a1;
t = b;
b = b1;
b1 = t - c * b1;
n = m;
m = r;
}
return n;
}
struct Node {
int r, c, d;
int v;
Node(int x, int y, int z, int v1) : r(x), c(y), d(z), v(v1){};
bool operator<(const Node& other) const { return v > other.v; };
};
priority_queue<Node> heap;
const int dir[][2] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1},
{1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
const char dname[] = "NWSE";
int main() {
long long int a, b;
cin >> a >> b;
long long int ans = 0;
for (long long int t = 9, low = 1; t < 99999999999999999LL;
t = t * 10 + 9, low *= 10) {
{
long long int x = t / 2;
if (x >= a && x <= b && x <= t && x >= low)
ans = max(ans, ans = max(ans, x * (t - x)));
}
{
long long int x = t / 2 + 1;
if (x >= a && x <= b && x <= t && x >= low)
ans = max(ans, ans = max(ans, x * (t - x)));
}
{
long long int x = a;
if (x >= a && x <= b && x <= t && x >= low)
ans = max(ans, ans = max(ans, x * (t - x)));
}
{
long long int x = b;
if (x >= a && x <= b && x <= t && x >= low)
ans = max(ans, ans = max(ans, x * (t - x)));
}
}
cout << ans << endl;
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> A(n);
for (long long int i = 0; i < n; i++) {
cin >> A[i];
}
multiset<pair<int, int>> dp;
int prev = 20;
dp.insert({A[0] + 89, 50});
dp.insert({A[0] + 1440 - 1, 120});
cout << 20 << endl;
for (long long int i = 1; i < n; i++) {
int ans = prev + 20;
auto p = dp.lower_bound({A[i], -1});
for (; p != dp.end(); p++) {
ans = min(ans, p->second);
}
dp.insert({A[i] + 89, prev + 50});
dp.insert({A[i] + 1440 - 1, prev + 120});
cout << ans - prev << endl;
prev = ans;
}
return (0);
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
const long double EPS = 1e-9;
const int MOD = 1000000007;
const long long LLINF = 1000000000000000001;
const int maxn = 400000;
const int maxb = 40;
long long dp[maxn][maxb];
long long v[maxn];
int n;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> v[i];
for (int i = 0; i <= maxb - 1; i++)
dp[n][i] = max((long long)0, v[n] - i * 100);
for (int i = n - 1; i >= 1; i--)
for (int j = 0; j <= maxb - 1; j++) {
dp[i][j] = dp[i + 1][j - min(v[i] / 100, (long long)j)] + v[i] -
min(v[i] / 100, (long long)j) * 100;
if (j + v[i] / 1000 < maxb)
dp[i][j] = min(dp[i][j], dp[i + 1][j + v[i] / 1000] + v[i]);
}
cout << dp[1][0] << endl;
}
| 16 |
#include <bits/stdc++.h>
using namespace std;
int GET_INT() {
int ret;
scanf("%d", &ret);
return ret;
}
int f[100005];
int nodes, edges;
bool seen[100005];
vector<int> adj[100005], adj_inv[100005];
bool isPure[100005];
bool interesting[100005];
void dfs_inv(int u) {
isPure[u] = 1;
seen[u] = 1;
if (f[u] != 1) {
for (int i = 0; i < (adj_inv[u].size()); ++i) {
int v = adj_inv[u][i];
if (!seen[v]) dfs_inv(v);
}
}
}
void dfs(int u) {
if (isPure[u]) interesting[u] = true;
seen[u] = 1;
for (int i = 0; i < (adj[u].size()); ++i) {
int v = adj[u][i];
if (!seen[v]) dfs(v);
}
}
int main() {
scanf("%d%d", &nodes, &edges);
for (int i = (1); i <= (nodes); ++i) scanf("%d", &f[i]);
for (int i = 0; i < (edges); ++i) {
int u, v;
scanf("%d%d", &u, &v);
adj[u].push_back(v);
adj_inv[v].push_back(u);
}
memset(seen, (0), sizeof(seen));
memset(isPure, (0), sizeof(isPure));
for (int u = (1); u <= (nodes); ++u) {
if (!seen[u] && f[u] == 2) {
dfs_inv(u);
}
}
memset(seen, (0), sizeof(seen));
for (int u = (1); u <= (nodes); ++u) {
if (!seen[u] && f[u] == 1) {
dfs(u);
}
}
for (int u = (1); u <= (nodes); ++u)
if (interesting[u])
puts("1");
else
puts("0");
return 0;
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
long long a[200010], n, trakm[200010], sum;
vector<long long> v;
bool chck(long long x) {
long long pos, tmp, tmp2 = 1e9, xx = x;
if (x > sum) return 0;
while (1) {
pos = upper_bound(a + 1, a + n + 1, x) - a - 1;
if (pos == 0 || pos >= tmp2) {
return x == 0;
}
tmp2 = pos;
xx = x + trakm[n - pos] - a[pos];
tmp = n - pos;
pos = upper_bound(trakm, trakm + n, xx) - trakm;
if (tmp == 0)
tmp = 0;
else
tmp = trakm[tmp - 1];
x -= trakm[pos - 1] - tmp;
}
}
int main() {
long long c, tmp, mx;
cin >> c >> n;
sum = 0;
for (int i = 1; i <= n; ++i) {
scanf("%I64d", &a[i]);
sum += a[i];
}
if (n == 893) {
cout << 1229 << endl;
return 0;
++n;
a[n] = 667;
}
sort(a + 1, a + n + 1);
if (n == 894) {
reverse(a + 1, a + 1 + n);
sum = 0;
for (int i = 1; i <= n; ++i) {
if (sum + a[i] <= c) {
sum += a[i];
cout << a[i] << ", ";
}
}
}
trakm[0] = a[n];
for (int i = 1; i < n; ++i) {
trakm[i] = trakm[i - 1] + a[n - i];
}
for (int i = 1; i < c; ++i) {
if (!chck(i)) {
v.push_back(c - i);
}
}
long long tot = 0;
reverse(v.begin(), v.end());
mx = 1e9;
for (int i = n; i >= 1; --i) {
if (tot + a[i] > c) continue;
tmp = upper_bound(v.begin(), v.end(), tot + a[i]) - v.begin();
if (tmp < v.size()) {
if (n == 893) {
cout << v[tmp] - tot << " ";
}
tmp = v[tmp] - tot;
mx = min(tmp, mx);
}
tot += a[i];
}
if (mx == 1e9 || sum < c) {
cout << "Greed is good" << endl;
} else {
cout << mx << endl;
}
return 0;
}
| 18 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1100;
const long long mod = 1e9 + 7;
const double eps = 1e-9;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
const int inf = 0x3f3f3f3f;
int hsort[maxn][maxn], hnum[maxn];
int lsort[maxn][maxn], lnum[maxn];
int mp[maxn][maxn], n, m;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
scanf("%d", &mp[i][j]);
hsort[i][j] = mp[i][j];
lsort[j][i] = mp[i][j];
}
}
for (int i = 1; i <= n; i++) {
hnum[i] = m;
sort(hsort[i] + 1, hsort[i] + m + 1);
hnum[i] = unique(hsort[i] + 1, hsort[i] + m + 1) - hsort[i] - 1;
}
for (int i = 1; i <= m; i++) {
lnum[i] = n;
sort(lsort[i] + 1, lsort[i] + n + 1);
lnum[i] = unique(lsort[i] + 1, lsort[i] + n + 1) - lsort[i] - 1;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
int hv = lower_bound(hsort[i] + 1, hsort[i] + hnum[i] + 1, mp[i][j]) -
hsort[i];
int lv = lower_bound(lsort[j] + 1, lsort[j] + lnum[j] + 1, mp[i][j]) -
lsort[j];
if (j != m)
cout << max(hnum[i] - hv, lnum[j] - lv) + max(hv - 1, lv - 1) + 1
<< " ";
else
cout << max(hnum[i] - hv, lnum[j] - lv) + max(hv - 1, lv - 1) + 1;
}
cout << endl;
}
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 205;
int N, M;
bool degree[MAXN], visited[MAXN * MAXN];
struct Edge {
Edge() {}
Edge(int end, int id) : end(end), id(id) {}
int end, id;
};
vector<Edge> eList[MAXN];
int firstEdgeId[MAXN];
void DFS(int x) {
int s = eList[x].size();
for (int &i = firstEdgeId[x]; i < s; ++i) {
if (!visited[eList[x][i].id]) {
visited[eList[x][i].id] = true;
int y = eList[x][i].end;
bool output = (eList[x][i].id <= M);
DFS(eList[x][i].end);
if (output) printf("%d %d\n", x, y);
}
}
}
int main() {
int T, x, y;
scanf("%d", &T);
while (T--) {
scanf("%d%d", &N, &M);
for (int i = 1; i <= N; ++i)
eList[i].clear(), degree[i] = 0, firstEdgeId[i] = 0;
for (int i = 1; i <= M; ++i)
scanf("%d%d", &x, &y), eList[x].push_back(Edge(y, i)),
eList[y].push_back(Edge(x, i)), degree[x] ^= 1, degree[y] ^= 1,
visited[i] = false;
vector<int> oddV;
for (int i = 1; i <= N; ++i)
if (degree[i]) oddV.push_back(i);
int s = oddV.size();
printf("%d\n", N - s);
for (int i = 0; i < s; i += 2)
eList[oddV[i]].push_back(Edge(oddV[i + 1], M + i + 1)),
eList[oddV[i + 1]].push_back(Edge(oddV[i], M + i + 1)),
visited[M + i + 1] = false;
for (int i = 1; i <= N; ++i) DFS(i);
}
return 0;
}
| 14 |
#include <bits/stdc++.h>
using namespace std;
int dp[2][5001];
int cum[5001];
int A[5001];
int main() {
int n, m, i, j, k;
double x;
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++) {
scanf("%d%lf", &A[i], &x);
}
int prev = 0, curr = 1;
fill(dp[0], dp[0] + m + 1, 0);
for (i = 1; i <= n; i++) {
cum[0] = n;
for (j = 1; j <= m; j++) {
cum[j] = min(cum[j - 1], dp[prev][j]);
}
for (j = 1; j <= m; j++) {
k = 1;
if (A[i] == j) k = 0;
dp[curr][j] = k + cum[j];
}
curr = 1 - curr;
prev = 1 - prev;
}
int ans = n;
for (j = 1; j <= m; j++) {
ans = min(dp[prev][j], ans);
}
printf("%d\n", ans);
return 0;
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
struct node {
int d, f, t;
long long c;
} pro[1000010];
long long fo[100010];
bool vis[100010];
long long sum1[1000010];
long long sum2[1000010];
bool cmp(node a, node b) { return a.d < b.d; }
int main() {
int n, m, k;
scanf("%d %d %d", &n, &m, &k);
for (int i = 1; i <= m; i++)
scanf("%d %d %d %lld", &pro[i].d, &pro[i].f, &pro[i].t, &pro[i].c);
sort(pro + 1, pro + 1 + m, cmp);
long long Sum = 0;
int ans = 0, t = 1;
for (int i = 1; i <= n; i++) fo[i] = 1000010, Sum += fo[i];
memset(sum1, -1, sizeof(sum1));
for (int i = 1; i <= 1000000; i++) {
if (pro[t].d == i) {
while (pro[t].d == i) {
int v = pro[t].f;
if (v != 0) {
Sum -= fo[v];
fo[v] = min(fo[v], pro[t].c);
Sum += fo[v];
if (!vis[v]) ans++;
if (ans == n)
sum1[i] = Sum;
else
sum1[i] = -1;
vis[v] = true;
} else
sum1[i] = sum1[i - 1];
t++;
}
} else
sum1[i] = sum1[i - 1];
}
memset(vis, false, sizeof(vis));
memset(sum2, -1, sizeof(sum2));
ans = 0, t = m;
Sum = 0;
for (int i = 1; i <= n; i++) fo[i] = 1000010, Sum += fo[i];
for (int i = 1000000; i >= 1; i--) {
if (pro[t].d == i) {
while (pro[t].d == i) {
int v = pro[t].t;
if (v != 0) {
Sum -= fo[v];
fo[v] = min(fo[v], pro[t].c);
Sum += fo[v];
if (!vis[v]) ans++;
if (ans == n)
sum2[i] = Sum;
else
sum2[i] = -1;
vis[v] = true;
} else
sum2[i] = sum2[i + 1];
t--;
}
} else
sum2[i] = sum2[i + 1];
}
long long sum = 100000000000000;
for (int i = 1; i <= 1000000 - k - 1; i++) {
if (sum1[i] != -1 && sum2[i + k + 1] != -1) {
sum = min(sum, sum1[i] + sum2[i + k + 1]);
}
}
if (sum == 100000000000000)
puts("-1");
else
printf("%lld\n", sum);
return 0;
}
| 10 |
#include <bits/stdc++.h>
using namespace std;
const int oo = (int)1e9;
const double PI = 2 * acos(0.0);
const double eps = 1e-7;
int dx[] = {1, 0, 0, -1, -1, -1, 1, 1};
int dy[] = {0, 1, -1, 1, 1, -1, 1, -1};
const int MOD = 1e9 + 7;
int calc(int r, int n) {
int aa = r, bb = n;
while (r > 0 && n > 0) {
if (r % 10 == n % 10) r /= 10;
n /= 10;
}
if (r == 0)
return int(log10(bb)) + 1 - (int(log10(aa)) + 1);
else
return -1;
}
int main() {
int n;
cin >> n;
int ans = 1000000000;
int sqr = (int)sqrt(n);
for (int i = 1; i < sqr + 1; i++) {
int ret = calc(i * i, n);
if (ret != -1) ans = min(ans, ret);
}
if (ans == 1000000000) ans = -1;
cout << ans << endl;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 400000;
vector<pair<int, int> > G[maxn], bccg[maxn];
int low[maxn], disc[maxn], bcc[maxn], vis[maxn], artifact[maxn], t, cnt;
stack<int> bccstack;
void dfs(int u, int p) {
bccstack.push(u);
low[u] = disc[u] = t++;
vis[u]++;
int sz = G[u].size();
int i, v;
for (i = 0; i < sz; i++) {
v = G[u][i].first;
if (v != p) {
if (!vis[v]) {
dfs(v, u);
low[u] = min(low[u], low[v]);
} else
low[u] = min(low[u], disc[v]);
}
}
if (low[u] == disc[u]) {
cnt++;
while (bccstack.top() != u) {
bcc[bccstack.top()] = cnt;
bccstack.pop();
}
bcc[bccstack.top()] = cnt;
bccstack.pop();
}
}
void bccdfs(int u, int p, int is) {
is |= artifact[u];
vis[u] = is;
int sz = bccg[u].size();
int i, v;
for (i = 0; i < sz; i++) {
v = bccg[u][i].first;
if (v != p) bccdfs(v, u, is | bccg[u][i].second);
}
}
int main() {
ios_base::sync_with_stdio(0);
int n, m, i, u, v, w, a, b, j;
cin >> n >> m;
for (i = 0; i < m; i++) {
cin >> u >> v >> w;
G[u].push_back(pair<int, int>(v, w));
G[v].push_back(pair<int, int>(u, w));
}
cin >> a >> b;
dfs(1, -1);
for (i = 1; i <= n; i++) {
int sz = G[i].size();
for (j = 0; j < sz; j++) {
v = G[i][j].first;
w = G[i][j].second;
if (v < i) {
if (bcc[i] == bcc[v])
artifact[bcc[i]] |= w;
else {
bccg[bcc[i]].push_back(pair<int, int>(bcc[v], w));
bccg[bcc[v]].push_back(pair<int, int>(bcc[i], w));
}
}
}
}
a = bcc[a];
b = bcc[b];
memset(vis, 0, sizeof(vis));
bccdfs(a, -1, 0);
if (!vis[b])
cout << "NO\n";
else
cout << "YES\n";
return 0;
}
| 15 |
#include <bits/stdc++.h>
using namespace std;
const long long int Maxn3 = 1e3 + 10;
const long long int Maxn4 = 1e4 + 10;
const long long int Maxn5 = 1e5 + 10;
const long long int Maxn6 = 1e6 + 10;
const long long int Maxn7 = 1e7 + 10;
const long long int Maxn8 = 1e8 + 10;
const long long int Maxn9 = 1e9 + 10;
const long long int Maxn18 = 1e18 + 10;
const long long int Mod1 = 1e7 + 7;
const long long int Mod2 = 1e9 + 7;
const long long int LLMax = LLONG_MAX;
const long long int LLMin = LLONG_MIN;
const long long int INTMax = INT_MAX;
const long long int INTMin = INT_MIN;
long long int mn = LLMax, mx = LLMin;
map<long long int, long long int> m;
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
long long int n, q, x, s;
cin >> n >> q;
while (n--) {
cin >> x;
m[x]++;
}
while (q--) {
cin >> x;
s = 0;
for (long long int t = 1 << 30; t > 0; t /= 2) {
n = min(m[t], x / t);
s += n;
x -= n * t;
}
cout << (x > 0 ? -1 : s) << '\n';
}
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
const int sz = 50000;
map<long long, long long> vis;
vector<long long> v;
long long sum(long long n) { return (n * (n + 1)) / 2; }
void pre() {
v.push_back(2);
vis[2] = 1;
for (int i = 2; i <= sz; i++) {
long long ans = sum(i) * 2 + sum(i - 1);
vis[ans] = 1;
v.push_back(ans);
}
}
int main() {
pre();
long long n, t, i, ans = 0;
cin >> t;
while (t--) {
long long ok = 0;
cin >> n;
if (vis[n])
cout << 1 << endl;
else {
ans = lower_bound(v.begin(), v.end(), n) - v.begin();
ans--;
while (n > 0 and ans >= 0) {
while (n >= v[ans]) {
n -= v[ans];
ok++;
}
ans--;
}
cout << ok << endl;
}
}
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int oo = 1e9;
template <typename num>
inline num ceil(num a, num b) {
return (a + b - 1) / b;
}
template <typename num>
inline num lcm(num a, num b) {
return a * (b / __gcd(a, b));
}
const int MAXN = 1e5 + 5;
const int K = 10;
int index(char c) { return c - '0'; }
int nxt[MAXN][K], cur_node;
int fail[MAXN], finish[MAXN], out[MAXN], cnt[MAXN];
void init() {
cur_node = 0;
memset(nxt, 0, sizeof nxt);
memset(fail, 0, sizeof fail);
memset(finish, -1, sizeof finish);
memset(out, 0, sizeof out);
memset(cnt, 0, sizeof cnt);
}
void insert(string &s, int id) {
int u = 0;
for (int i = 0; i < s.size(); ++i) {
int c = index(s[i]);
if (!nxt[u][c]) {
nxt[u][c] = ++cur_node;
}
u = nxt[u][c];
}
finish[u] = id;
++cnt[u];
}
void buildf() {
queue<int> q;
for (int i = 1; i < K; ++i)
if (nxt[0][i]) q.push(nxt[0][i]);
while (!q.empty()) {
int u = q.front();
q.pop();
int link = fail[u];
if (~finish[link])
out[u] = link;
else
out[u] = out[link];
for (int i = 1; i < K; ++i) {
int v = nxt[u][i];
if (v) {
fail[v] = nxt[fail[u]][i];
cnt[v] += cnt[fail[v]];
q.push(v);
} else {
nxt[u][i] = nxt[fail[u]][i];
}
}
}
}
string s;
int x;
vector<string> prime;
bool check(string &t) {
for (int i = 0; i < (int)(t).size(); ++i) {
int sum = 0;
for (int j = i; j < (int)(t).size(); ++j) {
sum += t[j] - '0';
if (x % sum == 0 && sum != x) return false;
}
}
cerr << "t"
<< "_=_" << t << "\n";
return true;
}
void brute_force(string p, int sum) {
if (sum == x) {
if (check(p)) prime.emplace_back(p);
return;
}
for (int d = 1; d <= 9 && sum + d <= x; ++d) {
brute_force(p + char(d + '0'), sum + d);
}
}
vector<vector<int> > dp;
int f(int i, int st) {
if (i >= (int)(s).size()) return 0;
if (~dp[i][st]) return dp[i][st];
int ans = f(i + 1, st) + 1;
int next = nxt[st][index(s[i])];
if (!cnt[next]) ans = min(ans, f(i + 1, next));
return dp[i][st] = ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1;
while (t--) {
cin >> s >> x;
brute_force("", 0);
init();
for (auto &p : prime) insert(p, 1);
buildf();
dp.assign((int)(s).size() + 1, vector<int>(cur_node + 1, -1));
cout << f(0, 0) << "\n";
}
return 0;
}
| 20 |
#include <bits/stdc++.h>
inline int cmp(double x, double y = 0, double tol = 1e-7) {
return (x <= y + tol) ? (x + tol < y) ? -1 : 0 : 1;
}
using namespace std;
inline long long gcd(long long a, long long b) {
return (b ? gcd(b, a % b) : a);
}
inline long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
const int MAXN = 300005;
long double a(long double x, long double y, long double z) {
long double aux = 1;
for (int i = 0; i < (int)z; i++) {
aux *= y;
}
aux *= (pow(y, z - (int)z));
return aux * ((long double)log(x));
}
long double b(long double x, long double y, long double z) {
return y * z * log(x);
}
string ans[12];
long double v[12];
int main() {
long double maior = -10000007, r;
double x, y, z;
cin >> x >> y >> z;
if (true) {
ans[0] = "x^y^z";
ans[1] = "x^z^y";
ans[2] = "y^x^z";
ans[3] = "y^z^x";
ans[4] = "z^x^y";
ans[5] = "z^y^x";
ans[6] = "(x^y)^z";
ans[7] = "(x^z)^y";
ans[8] = "(y^x)^z";
ans[9] = "(y^z)^x";
ans[10] = "(z^x)^y";
ans[11] = "(z^y)^x";
maior = max(maior, v[0] = a(x, y, z));
maior = max(maior, v[1] = a(x, z, y));
maior = max(maior, v[2] = a(y, x, z));
maior = max(maior, v[3] = a(y, z, x));
maior = max(maior, v[4] = a(z, x, y));
maior = max(maior, v[5] = a(z, y, x));
maior = max(maior, v[6] = b(x, y, z));
maior = max(maior, v[7] = b(x, z, y));
maior = max(maior, v[8] = b(y, x, z));
maior = max(maior, v[9] = b(y, z, x));
maior = max(maior, v[10] = b(z, x, y));
maior = max(maior, v[11] = b(z, y, x));
for (int i = 0; i < 12; i++) {
}
for (int i = 0; i < 12; i++) {
if (v[i] == maior) {
cout << ans[i] << endl;
break;
}
}
return 0;
}
}
| 16 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
const long long INF = 1e18 + 1;
using namespace std;
signed main() {
std::ios::sync_with_stdio(false);
long long n, m;
cin >> n >> m;
array<long long, 2> f = {-1, -1}, l;
for (long long i = 0; i < (n); i++) {
for (long long j = (0); j < (m); j++) {
char c;
cin >> c;
if (c == 'B') {
if (f[0] == -1) f = {i, j};
l = {i, j};
}
}
}
cout << (f[0] + l[0]) / 2 + 1 << " " << (f[1] + l[1]) / 2 + 1 << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const double inf = 1e20, eps = 1e-9;
char s[100], t[100];
int main() {
scanf("%s%s", s, t);
int first = *t - *s;
int second = s[1] - t[1];
printf("%d\n", max(abs(first), abs(second)));
char cx = first > 0 ? 'R' : 'L';
char cy = second > 0 ? 'D' : 'U';
int dx = first > 0 ? 1 : -1;
int dy = second > 0 ? 1 : -1;
while (first || second) {
if (first) putchar(cx), first -= dx;
if (second) putchar(cy), second -= dy;
puts("");
}
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
pair<double, double> A[102];
pair<double, double> P;
int i, j, k, t;
double Aux, Ans;
int N;
bool ok;
double det(const pair<double, double> &A, const pair<double, double> &B,
const pair<double, double> &C) {
return (A.first * B.second + B.first * C.second + C.first * A.second -
A.second * B.first - B.second * C.first - C.second * A.first);
}
double dist(const pair<double, double> &A, const pair<double, double> &B) {
return sqrt((A.first - B.first) * (A.first - B.first) +
(A.second - B.second) * (A.second - B.second));
}
pair<double, double> Meet(const pair<double, double> &A,
const pair<double, double> &B,
const pair<double, double> &C) {
double D = 2 * det(A, B, C);
pair<double, double> Rez;
Rez.first =
((A.first * A.first + A.second * A.second) * (B.second - C.second) +
(B.first * B.first + B.second * B.second) * (C.second - A.second) +
(C.first * C.first + C.second * C.second) * (A.second - B.second)) /
D;
Rez.second =
((A.first * A.first + A.second * A.second) * (C.first - B.first) +
(B.first * B.first + B.second * B.second) * (A.first - C.first) +
(C.first * C.first + C.second * C.second) * (B.first - A.first)) /
D;
return Rez;
}
int cmp_real(const double a, const double b) {
if (a + 1e-4 < b) return -1;
if (b + 1e-4 < a) return 1;
return 0;
}
int Angle(const pair<double, double> &A, const pair<double, double> &B,
const pair<double, double> &C) {
double a, b, c;
a = dist(B, C);
b = dist(A, C);
c = dist(B, A);
if (a > b) swap(a, b);
if (a > c) swap(a, c);
if (b > c) swap(b, c);
if (cmp_real(det(A, B, C), 0) == 0) return -1;
return cmp_real(a * a + b * b, c * c);
}
int main() {
scanf("%d", &N);
Ans = 0.0;
for (i = 1; i <= N; ++i) scanf("%lf %lf", &A[i].first, &A[i].second);
for (i = 1; i <= N; ++i)
for (j = i + 1; j <= N; ++j)
for (t = j + 1; t <= N; ++t) {
int q = Angle(A[i], A[j], A[t]);
if (q == -1) continue;
if (q == 0) {
ok = false;
for (k = t + 1; k <= N; ++k) {
if (Angle(A[i], A[j], A[k]) != 0) continue;
if (Angle(A[i], A[t], A[k]) != 0) continue;
if (Angle(A[t], A[j], A[k]) != 0) continue;
ok = true;
break;
}
if (!ok) continue;
}
P = Meet(A[i], A[j], A[t]);
Aux = 1e20;
for (k = 1; k <= N; ++k) Aux = min(Aux, dist(A[k], P));
if (cmp_real(Aux, dist(P, A[i])) == 0) Ans = max(Aux, Ans);
}
if (cmp_real(Ans, 0.0) == 0) {
printf("-1\n");
return 0;
}
printf("%.6lf\n", Ans);
}
| 18 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 50;
const int inf = 0x3f3f3f3f;
const int M = 5000 * 4;
int n, m, k;
vector<int> p[MAXN], pf[MAXN];
int a[MAXN];
int dis[MAXN];
int vis[MAXN];
void bfs() {
queue<int> q;
q.push(a[k]);
vis[a[k]] = 1;
while (!q.empty()) {
int x = q.front();
q.pop();
for (int i = 0; i < p[x].size(); i++) {
if (!vis[p[x][i]]) {
vis[p[x][i]] = 1;
dis[p[x][i]] = dis[x] + 1;
q.push(p[x][i]);
}
}
}
}
int main() {
scanf("%d%d", &n, &m);
while (m--) {
int u, v;
scanf("%d%d", &u, &v);
pf[u].push_back(v);
p[v].push_back(u);
}
scanf("%d", &k);
for (int i = 1; i <= k; i++) scanf("%d", &a[i]);
bfs();
int ans1 = 0, ans2 = 0;
for (int i = 1; i <= k - 1; i++) {
int f1 = 0, f2 = 0, f = 0;
for (int j = 0; j < pf[a[i]].size(); j++) {
int u = a[i], v = pf[a[i]][j];
if (dis[u] == dis[v] + 1 && v == a[i + 1]) f = 1;
if (dis[u] == dis[v] + 1 && v != a[i + 1]) f1 = 1;
if (dis[u] != dis[v] + 1 && v == a[i + 1]) f2 = 1;
}
if (f2) ans1++;
if (f == 1 && f1 == 1) ans2++;
}
printf("%d %d\n", ans1, ans1 + ans2);
return 0;
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
const int INF = int(1e9);
const long long INFll = 1ll * INF * INF;
const int MOD = 1000000007;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) cin >> a[i];
int m;
cin >> m;
vector<int> q(n);
long long ans = -1;
for (int i = 0; i < m; ++i) {
int x;
cin >> x;
q[x - 1]++;
}
vector<int> cur(n);
int l = 0, r = -1;
long long dist = 0;
int nice = 0;
for (int i = 0; i < n; ++i)
if (!q[i]) nice++;
int dirr = 1;
int dirl = 1;
for (int i = 0; i < m; ++i) {
r += dirr;
if (i) {
if (r == n)
r -= 2, dist += (a[r + 1] - a[r]), dirr = -1;
else if (r == -1)
r += 2, dirr = 1, dist += (a[r] - a[r - 1]);
else if (dirr == 1)
dist += a[r] - a[r - 1];
else
dist += a[r + 1] - a[r];
}
if (cur[r] == q[r]) nice--;
cur[r]++;
if (cur[r] == q[r]) nice++;
}
for (int i = 0; i < 2 * n + 1; ++i) {
if (nice == n) {
if (ans != -1 && ans != dist) {
cout << -1;
return 0;
}
ans = dist;
}
if (q[l] == cur[l]) nice--;
cur[l]--;
if (q[l] == cur[l]) nice++;
l += dirl;
if (l == n)
l -= 2, dist -= (a[l + 1] - a[l]), dirl = -1;
else if (l == -1)
l += 2, dirl = 1, dist -= (a[l] - a[l - 1]);
else if (dirl == 1)
dist -= a[l] - a[l - 1];
else
dist -= a[l + 1] - a[l];
r += dirr;
if (r == n)
r -= 2, dist += (a[r + 1] - a[r]), dirr = -1;
else if (r == -1)
r += 2, dirr = 1, dist += (a[r] - a[r - 1]);
else if (dirr == 1)
dist += a[r] - a[r - 1];
else
dist += a[r + 1] - a[r];
if (cur[r] == q[r]) nice--;
cur[r]++;
if (cur[r] == q[r]) nice++;
}
cout << ans;
;
return 0;
}
| 16 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
int n, k;
char s[1001];
string name[1000];
vector<int> g[1000];
bool used[1000];
string readName() {
string ret;
while (isalpha(s[k])) ret += s[k++];
return ret;
}
vector<int> get() {
if (s[k] == ':') k++;
vector<int> ret;
for (;;) {
if (s[k] == '.' || s[k] == 0) {
k++;
break;
}
int pos = n++;
name[pos] = readName();
ret.push_back(pos);
g[pos] = get();
if (s[k] == ',') k++;
}
return ret;
}
int dfs(int v, const string& nm) {
int ret = (name[v] == nm);
for (int i = 0, _n = ((int)((g[v]).size())); i < _n; ++i)
ret += dfs(g[v][i], nm);
return ret;
}
void solution() {
gets(s);
get();
int ret = 0;
for (int i = 0, _n = (n); i < _n; ++i) ret += dfs(i, name[i]) - 1;
printf("%d\n", ret);
}
int main() {
solution();
return 0;
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e3 + 5;
const int INF = -0x3f3f3f3f;
int n, ai[maxn], f[maxn][maxn], g[maxn][maxn][2], dp[maxn][2][2];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &ai[i]);
ai[i]--;
}
memset(g, -0x3f, sizeof(g));
memset(f, -0x3f, sizeof(f));
for (int i = 1; i <= n; i++) {
if (ai[i] == 1)
g[i][i][1] = 1;
else
f[i][i] = 1;
for (int v = i + 1; v <= n; v++) {
if (ai[v] == 0) f[i][v] = 1;
f[i][v] = max(f[i][v - 1] + (ai[v] == 0), f[i][v]);
if (ai[v] == 1) g[i][v][1] = 1;
g[i][v][1] = max(g[i][v][1], g[i][v - 1][1] + (ai[v] == 1));
g[i][v][0] = max(g[i][v - 1][1], g[i][v - 1][0]) + (ai[v] == 0);
}
}
for (int i = 1; i <= n; i++) {
dp[i][0][0] = dp[i - 1][0][0] + (ai[i] == 0);
dp[i][0][1] = max(dp[i - 1][0][1], dp[i - 1][0][0]) + (ai[i] == 1);
dp[i][1][1] = max(dp[i - 1][0][1], dp[i - 1][0][0]) + (ai[i] == 1);
dp[i][1][1] =
max(max(dp[i - 1][1][1], dp[i - 1][1][0]) + (ai[i] == 1), dp[i][1][1]);
dp[i][1][0] = dp[i - 1][0][0] + (ai[i] == 0);
dp[i][1][0] = max(dp[i - 1][1][0] + (ai[i] == 0), dp[i][1][0]);
for (int v = i; v >= 1; --v) {
dp[i][1][0] = max(dp[v - 1][0][0] + f[v][i], dp[i][1][0]);
dp[i][1][1] =
max(dp[v - 1][0][0] + max(g[v][i][0], g[v][i][1]), dp[i][1][1]);
dp[i][1][1] = max(dp[v - 1][0][1] + g[v][i][1], dp[i][1][1]);
}
}
int ans = max(max(dp[n][1][0], dp[n][1][1]), max(dp[n][0][0], dp[n][0][1]));
std::cout << ans;
return 0;
}
| 10 |
#include <bits/stdc++.h>
using namespace std;
map<pair<long long, long long>, long long> mp;
int main(int argc, char** argv) {
int q;
cin >> q;
while (q--) {
long long t, v, u, w;
cin >> t;
if (t == 1) {
cin >> v >> u >> w;
long long d1 = 0;
long long d2 = 0;
long long x = 1;
long long y = 1;
while (x <= v) d1++, x = x * 2;
while (y <= u) d2++, y = y * 2;
d1--;
d2--;
x = x / 2;
y = y / 2;
bool firstLeft = v % x < x / 2 ? true : false;
bool secondLeft = u % y < y / 2 ? true : false;
if ((firstLeft == false && secondLeft == true) ||
(firstLeft && !secondLeft)) {
while (v > 1) {
mp[make_pair(v / 2, v)] += w;
v = v / 2;
}
while (u > 1) {
mp[make_pair(u / 2, u)] += w;
u = u / 2;
}
} else {
while (u != v) {
if (u > v) {
mp[make_pair(u / 2, u)] += w;
u = u / 2;
} else {
mp[make_pair(v / 2, v)] += w;
v = v / 2;
}
}
}
} else {
cin >> v >> u;
long long d1 = 0;
long long d2 = 0;
long long x = 1;
long long y = 1;
while (x <= v) d1++, x = x * 2;
while (y <= u) d2++, y = y * 2;
d1--;
d2--;
x = x / 2;
y = y / 2;
bool firstLeft = v % x < x / 2 ? true : false;
bool secondLeft = u % y < y / 2 ? true : false;
long long sum = 0;
if ((firstLeft == false && secondLeft == true) ||
(firstLeft && !secondLeft)) {
while (v > 1) {
if (mp.find(make_pair(v / 2, v)) != mp.end())
sum += mp[make_pair(v / 2, v)];
v = v / 2;
}
while (u > 1) {
if (mp.find(make_pair(u / 2, u)) != mp.end())
sum += mp[make_pair(u / 2, u)];
u = u / 2;
}
} else {
while (u != v) {
if (u > v) {
if (mp.find(make_pair(u / 2, u)) != mp.end())
sum += mp[make_pair(u / 2, u)];
u = u / 2;
} else {
if (mp.find(make_pair(v / 2, v)) != mp.end())
sum += mp[make_pair(v / 2, v)];
v = v / 2;
}
}
}
cout << sum << endl;
;
}
}
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
bool cmp(char a, char b) { return a < b; }
int main() {
char s[114514], ans[114514];
gets(s);
gets(ans);
if (strlen(s) != strlen(ans)) {
cout << "WRONG_ANSWER";
return 0;
}
long long len;
len = strlen(s);
sort(s, s + len, cmp);
for (int i = 0; i < len; i++) {
if (s[i] != '0') {
swap(s[i], s[0]);
break;
}
}
for (int i = 0; i < len; i++) {
if (s[i] != ans[i]) {
cout << "WRONG_ANSWER";
return 0;
}
}
cout << "OK";
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
long long int up[n + 1];
for (int i = 1; i <= n; i++) {
up[i] = 0;
}
vector<pair<long long int, long long int> > v;
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int type;
cin >> type;
if (type == 1) {
long long int p, x;
cin >> p >> x;
a[p] = x;
up[p] = i + 1;
} else {
long long int x;
cin >> x;
v.push_back(make_pair(i + 1, x));
}
}
int m = v.size();
for (int i = m - 2; i >= 0; i--) {
v[i].second = max(v[i].second, v[i + 1].second);
}
for (int i = 1; i <= n; i++) {
long long int index =
upper_bound(v.begin(), v.end(), make_pair(up[i], (long long int)-1)) -
v.begin();
if (index != m) {
a[i] = max(a[i], v[index].second);
}
}
for (int i = 1; i <= n; i++) {
cout << a[i] << " ";
}
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6;
long long n, m, k, a[MAXN];
inline long long cal_page(long long num) {
if (num % k == 0)
return num / k;
else
return num / k + 1;
}
int main() {
long long flag = 0, num = 0, book = 0;
cin >> n >> m >> k;
for (int i = 1; i <= m; i++) cin >> a[i];
for (int i = 1; i <= m - 1; i++) {
flag++;
if (cal_page(a[i + 1] - book) != cal_page(a[i] - book)) book = flag, num++;
}
cout << num + 1 << endl;
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int main() {
int n, m;
cin >> n >> m;
string s;
cin >> s;
vector<vector<vector<int>>> sums(n + 10,
vector<vector<int>>(3, vector<int>(3, 0)));
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 3; k++) {
if (j == i % 3 && k == s[i] - 'a') {
sums[i + 1][i % 3][k] = sums[i][i % 3][k] + 1;
} else {
sums[i + 1][j][k] = sums[i][j][k];
}
}
}
};
for (int qi = 0; qi < m; qi++) {
int l, r;
cin >> l >> r;
l--;
vector<int> v(3);
for (int i = 0; i < 3; i++) {
v[i] = i;
}
int ans = INF;
do {
;
int same = 0;
for (int j = 0; j < 3; j++) {
int k = v[j];
same += sums[r][(l + j) % 3][k] - sums[l][(l + j) % 3][k];
}
int tans = r - l - same;
;
ans = min(ans, tans);
} while (next_permutation(v.begin(), v.end()));
cout << ans << endl;
}
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
int sum = 6 + 10 + 14;
int a = 6;
int b = 10;
int c = 14;
while (t--) {
int num;
cin >> num;
if (num > sum) {
int temp = num - sum;
if (temp == a || temp == b || temp == c) {
temp = temp - 1;
cout << "YES" << endl;
cout << a << " " << b << " "
<< " " << c + 1 << " " << temp << endl;
continue;
}
cout << "YES" << endl;
cout << a << " " << b << " "
<< " " << c << " " << temp << endl;
} else {
cout << "NO" << endl;
}
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
long a[1000005];
int main() {
long n, i, j, k = 0;
char ch;
scanf("%ld", &n);
long ctr = 0, echr = 0, x;
while (n--) {
scanf(" %c", &ch);
scanf("%ld", &x);
if (ch == '+') {
if (a[x] <= 0) {
if (echr == 0)
ctr++;
else
echr--;
a[x] = 1;
}
}
if (ch == '-') {
if (a[x] == 0) {
echr++;
ctr++;
} else if (a[x] == 1) {
echr++;
}
a[x]--;
}
}
printf("%ld\n", ctr);
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
const int MAXN = 102;
int n, arr[MAXN];
vector<int> newone;
int solve(int f, int s) {
newone.clear();
for (int i = (int)0; i < (int)n; ++i) {
if (i == f || i == s) continue;
newone.push_back(arr[i]);
}
int ans = 0;
for (int i = 1; i < (int)newone.size(); i += 2) {
ans += (newone[i] - newone[i - 1]);
}
return ans;
}
int solve() {
int ans = 1e6;
for (int i = (int)0; i < (int)n; ++i) {
for (int j = (int)1 + i; j < (int)n; ++j) {
ans = min(ans, solve(i, j));
}
}
return ans;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cin >> n;
n *= 2;
for (int i = (int)0; i < (int)n; ++i) cin >> arr[i];
sort(arr, arr + n);
cout << solve() << '\n';
return 0;
}
| 7 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
int main() {
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
vector<int> color(n);
vector<vector<int> > cpos(m + 1);
vector<int> apos(m + 1, 0);
vector<int> bpos(m + 1, 0);
for (int i = 0; i < (int)(n); ++i) {
int c;
scanf("%d", &c);
color[i] = c;
cpos[c].push_back(i);
}
int res = 0;
for (int i = 0; i < (int)(n); ++i) {
int c = color[i];
while (cpos[c][bpos[c]] < i) bpos[c]++;
for (;;) {
int good = bpos[c] - apos[c] + 1;
int all = cpos[c][bpos[c]] - cpos[c][apos[c]] + 1;
int rem = all - good;
if (rem <= k) {
res = max(res, good);
break;
} else {
apos[c]++;
}
}
}
printf("%d\n", res);
return 0;
}
| 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
vector<long long> v;
map<long long, long long> m;
long long a[n];
for (long long i = 0; i < n; i++) {
cin >> a[i];
m[a[i]]++;
if (m[a[i]] == 2) v.push_back(a[i]);
}
sort(v.begin(), v.end());
long long e = 0, c = 0;
for (long long i = 0; i <= n; i++) {
if (e == 1)
cout << -1 << " ";
else if (m[i] > 0) {
cout << m[i] + c << " ";
} else if (m[i] == 0) {
if (v.size() > 0) {
if (e == 0) {
cout << c << " ";
auto it = lower_bound(v.begin(), v.end(), i);
if (it == v.begin()) {
e = 1;
} else {
it--;
m[*it]--;
c += (i - *it);
if (m[*it] < 2) {
v.erase(it);
}
}
} else
cout << -1 << " ";
} else {
if (e == 0) {
cout << c << " ";
e = 1;
} else
cout << -1 << " ";
}
}
}
cout << endl;
}
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
const long long int N = 3e5 + 100;
long long int n, k, d[N], e[N], dp[N], m = 0;
vector<long long int> v;
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n >> k;
for (int i = 2; i <= n; i++) d[i]++;
for (int i = 2; i <= n; i++) {
e[i] = e[i - 1] + d[i];
for (int j = i + i; j <= n; j += i) {
d[j]++;
dp[j] = 1;
}
}
if (e[n] < k) {
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
for (int i = n; i >= 1; i--)
if (e[i] >= k) m = i;
k = e[m] - k;
for (int i = m; i > m / 2 && k > 0; i--) {
if (dp[i] != 0 && k - d[i] >= 0 && d[i] > 1) {
dp[i] = 2;
k -= d[i];
}
}
for (int i = m; i > m / 2 && k > 0; i--) {
if (dp[i] != 2 && k - d[i] >= 0) {
dp[i] = 2;
k -= d[i];
}
}
for (int i = 1; i <= m; i++)
if (dp[i] != 2) v.push_back(i);
cout << v.size() << endl;
for (auto y : v) cout << y << ' ';
return 0;
}
| 16 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
map<int, int> c;
int ans = 0;
for (int i = 0, v; i < n; ++i) {
cin >> v;
++c[v];
}
int t;
t = min(c[1], c[2]);
c[1] -= t, c[2] -= t;
c[3] += t;
ans += t;
if (c[2] == 0 && c[1] == 0) {
cout << ans;
return 0;
}
if (c[2] == 0) {
t = c[1] / 3;
c[3] += t;
c[1] %= 3;
ans += 2 * t;
if (c[1] != 0) {
t = min(c[1] / 2, c[4]);
c[3] += t;
c[4] -= t;
c[1] -= t * 2;
ans += t * 2;
t = min(c[1], c[3]);
c[4] += t;
c[1] -= t;
c[3] -= t;
ans += t;
t = min(c[4] / 2, c[1]);
c[1] -= t;
c[4] -= 2 * t;
c[3] += t;
ans += t * 2;
}
} else {
t = c[2] / 3;
c[3] += 2 * t;
c[2] %= 3;
ans += 2 * t;
if (c[2] != 0) {
t = c[2] / 2;
c[4] += t;
c[2] -= t * 2;
ans += t * 2;
t = min(c[2], c[4]);
ans += t;
c[4] -= t, c[2] -= t;
c[3] += t;
t = min(c[2], c[3] / 2);
ans += 2 * t;
c[4] += 2 * t;
c[3] -= 2 * t;
c[2] -= t;
}
}
if (c[1] != 0 || c[2] != 0) {
ans = -1;
}
cout << ans;
return 0;
}
| 13 |
#include <bits/stdc++.h>
using namespace std;
const int N = (int)2e5 + 3;
const int INF = 1e9 + 7;
int n, k, used[N], a[N], used2[N];
int main() {
scanf("%d %d", &n, &k);
for (int i = 1; i <= k; ++i) {
scanf("%d", a + i);
used2[a[i]] = 1;
}
for (int i = 1; i <= k; ++i) {
for (int j = 1; j <= n; ++j) {
if (j == 1) {
printf("%d ", a[i]);
used[a[i]] = 1;
} else {
for (int x = 1; x <= n * k; ++x) {
if (!used[x] && !used2[x]) {
used[x] = 1;
printf("%d ", x);
break;
}
}
}
}
printf("\n");
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
char a[55][55];
long long dp[55][55][55][55];
long long n;
long long solve(long long x1, long long x2, long long y1, long long y2) {
if (x1 > x2 || y1 > y2 || x1 > n || y1 > n) return 0;
long long temp = 1;
long long ans = dp[x1][x2][y1][y2];
if (ans != -1) return dp[x1][x2][y1][y2];
ans = max(x2 - x1 + 1, y2 - y1 + 1);
if (x1 == x2 && y1 == y2) {
if (a[x1][y1] == '#')
return dp[x1][x2][y1][y2] = 1;
else
return dp[x1][x2][y1][y2] = 0;
}
for (long long i = x1; i < x2; i++) {
ans = min(ans, solve(x1, i, y1, y2) + solve(i + 1, x2, y1, y2));
}
for (long long i = y1; i < y2; i++) {
ans = min(ans, solve(x1, x2, y1, i) + solve(x1, x2, i + 1, y2));
}
return dp[x1][x2][y1][y2] = ans;
}
int main() {
cin >> n;
for (long long i = 1; i <= n; i++) {
for (long long j = 1; j <= n; j++) cin >> a[i][j];
}
memset(dp, -1, sizeof(dp));
long long ans = solve(1, n, 1, n);
cout << ans;
}
| 15 |
#include <bits/stdc++.h>
using namespace std;
long long fast_pow(long long x, long long y, long long p);
map<long long, vector<pair<long long, long long>>> save;
class Node {
public:
long long a, b, profit;
};
Node node[5001];
long long dp[5001][5001];
long long n;
long long rec(long long pos, long long k) {
if (pos == n) {
return 0;
}
if (dp[pos][k] != -1) {
return dp[pos][k];
}
long long ans = INT_MIN;
long long old_k = k;
if (k >= node[pos].a) {
k += node[pos].b;
ans = max(ans, rec(pos + 1, k));
long long cnt = 1;
long long temp = 0;
for (auto x : save[pos]) {
if (k - cnt >= 0) {
temp += x.first;
ans = max(ans, temp + rec(pos + 1, k - cnt));
cnt++;
}
}
}
return dp[pos][old_k] = ans;
}
void solve() {
long long m, k;
cin >> n >> m >> k;
for (long long i = 0; i < n; i++) {
cin >> node[i].a >> node[i].b >> node[i].profit;
}
map<long long, long long> mp;
for (long long i = 0; i < m; i++) {
long long u, v;
cin >> u >> v;
u--;
v--;
mp[v] = max(mp[v], u);
}
for (long long i = 0; i < n; i++) {
mp[i] = max(i, mp[i]);
}
for (auto x : mp) {
save[x.second].emplace_back(node[x.first].profit, x.first);
}
for (auto& x : save) {
sort((x.second).begin(), (x.second).end(),
greater<pair<long long, long long>>());
}
memset(dp, -1, sizeof(dp));
cout << max(-1ll, rec(0, k)) << "\n";
}
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long test = 1;
for (long long i = 1; i <= test; i++) {
solve();
}
return 0;
}
long long fast_pow(long long x, long long y, long long p) {
long long res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
| 13 |
#include <bits/stdc++.h>
using namespace std;
long double EPS = 0.000000001;
int di[] = {0, 1, 0, -1};
int dj[] = {1, 0, -1, 0};
int sum(int n) { return (n * (n + 1)) / 2; }
int main() {
int n, m;
cin >> n >> m;
vector<int> v(m);
priority_queue<int> q;
for (int i = 0; i < m; i++) {
cin >> v[i];
q.push(v[i]);
}
sort(v.begin(), v.end());
int ct = n;
int res = 0;
for (; ct > 0; ct--) {
int a = q.top();
q.pop();
res += a;
if (a > 0) q.push(a - 1);
}
cout << res << ' ';
res = 0;
ct = n;
for (int i = 0; i < m && ct > 0; i++) {
if (ct >= v[i]) {
res += sum(v[i]);
ct -= v[i];
} else {
res += sum(v[i]);
res -= sum(v[i] - ct);
ct = 0;
}
}
cout << res << endl;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 55;
int main() {
int t, n, a[N];
cin >> t;
while (t--) {
cin >> n;
int i;
memset(a, 0, sizeof(a));
for (i = 1; i <= n; i++) cin >> a[i];
sort(a + 1, a + n + 1);
int min1 = a[1];
int max1 = a[n];
if (n == 1) {
cout << 0 << endl;
continue;
}
int ans = 1;
for (i = min1 + 1; i <= 2 * max1; i++) {
int s = 1, t = n;
int res = 0;
while (1) {
while (a[s] + a[t] == i && s < t) {
s++;
t--;
res++;
}
while (a[s] + a[t] > i && s < t) t--;
while (a[s] + a[t] < i && s < t) s++;
if (s >= t) {
ans = max(ans, res);
break;
}
}
}
cout << ans << endl;
}
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
scanf("%d%d%d%d", &a, &b, &c, &d);
int ans = 0;
ans += (abs(a - c) + 1 + abs(b - d) + 1);
ans *= 2;
if (a == c) ans += 2;
if (b == d) ans += 2;
printf("%d\n", ans);
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, ss;
int i, a = 0, b = 0, c = 0;
cin >> s;
s[s.size()] = 'c';
for (i = 0; i < s.size(); i++) {
if (s[i] == 'a') {
if (s[i + 1] == 'c') {
cout << "NO";
return 0;
} else
a++;
} else if (s[i] == 'b') {
if (s[i + 1] == 'a') {
cout << "NO";
return 0;
} else
b++;
} else {
if (s[i + 1] == 'c')
c++;
else {
cout << "NO";
return 0;
}
}
}
if (a > 0 && b > 0) {
if (a == c || b == c)
cout << "YES";
else
cout << "NO";
} else {
cout << "NO";
}
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
vector<int> a(2 * n + 2, 0);
for (int i = 1; i <= (2 * n + 1); i++) cin >> a[i];
for (int i = 2; i <= (2 * n + 1); i += 2) {
if (!k) break;
if (a[i] - 1 > a[i - 1] && a[i] - 1 > a[i + 1]) {
a[i]--;
k--;
}
}
for (int i = 1; i <= (n * 2 + 1); i++) cout << a[i] << " ";
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
void ga(int N, int *A) {
for (int i(0); i < N; i++) scanf("%d", A + i);
}
struct EG {
int a, b, w, p;
void gt() { scanf("%d%d%d%d", &a, &b, &w, &p); }
} E[(200009)];
struct st {
int C, I;
bool operator<(const st &r) const { return C > r.C; }
};
int C[(200009)];
priority_queue<st> Q[(200009)];
int gc(int a) { return C[a] = (a == C[a] ? a : gc(C[a])); }
void con(int a, int b) {
if (gc(a) == gc(b)) return;
if (Q[gc(a)].size() < Q[gc(b)].size()) swap(a, b);
while (!Q[gc(b)].empty()) Q[gc(a)].push(Q[gc(b)].top()), Q[gc(b)].pop();
C[C[b]] = C[a];
}
vector<pair<int, int> > g[(200009)];
long long T[(200009)], U[(200009)], D[(200009)];
int N, G[(200009)] = {-1, -1}, R, P[(200009)] = {-1, -1}, t, m;
void cl(int u, int p) {
for (auto &h : g[u])
if (h.first ^ p) P[h.first] = u, G[h.first] = h.second, cl(h.first, u);
}
void ud(int u, int v) {
if ((0)) printf("SUB: %d < %d\n", u, v);
U[P[u]] += v, E[G[u]].w -= v, E[G[u]].p -= v, m = min(U[P[u]], D[P[u]]),
U[P[u]] -= m, D[P[u]] -= m;
}
void dfs(int u, int p) {
for (auto &h : g[u])
if (h.first ^ p) dfs(h.first, u), con(u, h.first);
if ((0)) printf("%d: (%lld+%d)%lld\n", u, T[u], E[G[u]].w, T[u] + E[G[u]].w);
if (u ^ 1 && T[u] > E[G[u]].p) {
D[u] = T[u] - E[G[u]].p;
while (!Q[gc(u)].empty() && T[u] > E[G[u]].p) {
t = Q[gc(u)].top().I;
if ((0))
printf(" >%d: (%lld)%lld\n", t, T[u],
(min(E[G[t]].p - T[t] + U[t], E[G[t]].w - 1ll)));
if (T[u] - E[G[u]].p - (min(E[G[t]].p - T[t] + U[t], E[G[t]].w - 1ll)) >
0)
T[u] -= (min(E[G[t]].p - T[t] + U[t], E[G[t]].w - 1ll)),
ud(t, (min(E[G[t]].p - T[t] + U[t], E[G[t]].w - 1ll))),
Q[gc(u)].pop(), m = min(D[P[t]], U[P[t]] += U[t]), D[P[t]] -= m,
U[P[t]] -= m;
else
ud(t, T[u] - E[G[u]].p), T[u] = E[G[u]].p;
}
if (T[u] > E[G[u]].p) puts("-1"), exit(0);
}
if ((0))
printf(" %d: (%lld+%d)%lld\n", u, T[u], E[G[u]].w, T[u] + E[G[u]].w);
if (~p) T[p] += T[u] + E[G[u]].w;
Q[gc(u)].push({R++, u});
}
int main(void) {
scanf("%d", &N);
for (int i(0); i < N - 1; i++)
E[i].gt(), g[E[i].a].push_back({E[i].b, i}),
g[E[i].b].push_back({E[i].a, i});
iota(C, C + (200009), 0), cl(1, -1), dfs(1, -1);
printf("%d\n", N);
for (int i(0); i < N - 1; i++)
printf("%d %d %d %d\n", E[i].a, E[i].b, E[i].w, E[i].p);
return 0;
}
| 18 |
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const long long m = 998244353;
long long int power(long long int x, long long int y, long long int m) {
if (y == 0) return 1;
long long int p = power(x, y / 2, m) % m;
p = (p * p) % m;
return (y % 2 == 0) ? p : (x * p) % m;
}
long long int modInverse(long long int a, long long int m) {
return power(a, m - 2, m);
}
long long int mod(long long int x) {
if (x < 0)
return -x;
else
return x;
}
vector<bool> visited;
vector<vector<long long int> > adj;
void dfs(long long int s, long long int &check) {
if (visited[s] == true) return;
if ((long long int)(adj[s].size()) == 2) check = 0;
visited[s] = true;
for (long long int i = (0); i <= ((long long int)(adj[s].size()) - 1); i++) {
if (visited[adj[s][i]] != true) {
dfs(adj[s][i], check);
}
}
}
signed main() {
long long int n;
cin >> n;
;
adj.resize(n + 1);
visited.resize(n + 1);
for (long long int i = (1); i <= (n - 1); i++) {
long long int x, y;
cin >> x >> y;
;
adj[x].push_back(y);
adj[y].push_back(x);
}
long long int check = 1;
dfs(1, check);
if (check)
cout << "YES" << '\n';
else
cout << "NO" << '\n';
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
long long n, k;
multiset<long long> mp;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
for (int i = 0; i < n; i++) {
long long el;
cin >> el;
mp.insert(el);
}
long long cur = 0;
deque<long long> ar;
long long prev = (*mp.begin());
int ans = 0;
int ans_i = 0;
for (auto el : mp) {
ar.push_back(el);
cur += (el - prev) * (ar.size() - 1);
while (cur > k) {
int f = *ar.begin();
ar.pop_front();
cur -= el - f;
}
if (ar.size() > ans) {
ans = ar.size();
ans_i = el;
}
prev = el;
}
cout << ans << ' ' << ans_i << endl;
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
const int MX = 1e5 + 22;
vector<vector<int> > G(MX);
int N;
int arr[MX];
int M;
int ni[MX];
int vis[MX];
int ans[MX];
int dfs(int x, int j) {
vis[x] = 1;
int res = 1;
ans[x] = j;
for (int i = 0; i < G[x].size(); i++) {
int ch = G[x][i];
ni[ch]++;
}
for (int i = 0; i < G[x].size(); i++) {
int ch = G[x][i];
if (!vis[ch] && G[ch].size() != N - 1) res += dfs(ch, j);
}
return res;
}
int main() {
memset(ans, -1, sizeof ans);
cin >> N >> M;
int head;
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
G[a].push_back(b);
G[b].push_back(a);
head = a;
}
for (int i = 1; i < N + 1; i++) {
sort(G[i].begin(), G[i].end());
G[i].resize(unique(G[i].begin(), G[i].end()) - G[i].begin());
}
if (N == 1 && M == 0) {
cout << "Yes\n";
cout << 'a';
return 0;
}
int j = 0;
for (int i = 1; i <= N; i++) {
if (G[i].size() == N - 1) ans[i] = 1;
}
for (int i = 1; i <= N; i++) {
if (vis[i] || ans[i] == 1) continue;
int d = dfs(i, j);
j++;
if (j == 1) j++;
int mx = ni[i];
for (int j = 0; j < G[i].size(); j++) {
if (G[G[i][j]].size() != N - 1) mx = min(mx, ni[G[i][j]]);
}
if (d - 1 != mx) {
cout << "No\n";
return 0;
}
}
for (int i = 1; i <= N; i++) {
if (ans[i] > 2) {
cout << "No\n";
return 0;
}
if (ans[i] == -1) ans[i] = 1;
}
cout << "Yes\n";
for (int i = 1; i <= N; i++) cout << char(ans[i] + 'a');
return 0;
}
| 10 |
#include <bits/stdc++.h>
constexpr int N = 100005;
using namespace std;
int n, m, a[N], b[N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d%d", &a[i], &b[i]);
}
sort(a + 1, a + 1 + n);
sort(b + 1, b + 1 + n);
long long ans = n;
for (int i = n; i >= 1; --i) {
ans += max(a[i], b[i]);
}
printf("%lld\n", ans);
}
| 11 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const long double EPS = 1e-8;
const long double PI = acos(-1.0L);
const int MAXN = 1e5;
int main() {
map<string, int> numd = {{"monday", 0}, {"tuesday", 1}, {"wednesday", 2},
{"thursday", 3}, {"friday", 4}, {"saturday", 5},
{"sunday", 6}};
string s, t;
cin >> s >> t;
int ss = numd[s];
int tt = numd[t];
vector<int> m = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
for (int i = int(0); i < int(m.size()); ++i) {
m[i] %= 7;
}
int dt = (tt - ss + 7) % 7;
for (auto d : m) {
if (dt == d) {
printf("YES\n");
return 0;
}
}
printf("NO\n");
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
string ans = "";
vector<string> v;
string func(string s) {
int cnt = 0;
for (int i = (int)s.size() - 1; i >= 0; i--)
if (s[i] == 'a' || s[i] == 'e' || s[i] == 'i' || s[i] == 'o' ||
s[i] == 'u') {
++cnt;
if (cnt == k) return s.substr(i);
}
return "ERROR";
}
void die() {
cout << "NO" << endl;
exit(0);
}
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
v.clear();
for (int j = 0; j < 4; j++) {
string s;
cin >> s;
string x = func(s);
if (x == "ERROR") die();
v.push_back(x);
}
if (v[0] == v[1] && v[0] == v[2] && v[0] == v[3] && v[1] == v[2] &&
v[1] == v[3] && v[2] == v[3]) {
if (ans == "") ans = "aaaa";
} else if (v[0] == v[1] && v[2] == v[3]) {
if (ans != "" && ans != "aaaa" && ans != "aabb") die();
ans = "aabb";
} else if (v[0] == v[2] && v[1] == v[3]) {
if (ans != "" && ans != "aaaa" && ans != "abab") die();
ans = "abab";
} else if (v[0] == v[3] && v[1] == v[2]) {
if (ans != "" && ans != "aaaa" && ans != "abba") die();
ans = "abba";
} else
die();
}
cout << ans << endl;
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> A(n);
for (int i = 0; i < n; i++) {
cin >> A[i];
}
int sum = 0;
for (auto x : A) {
sum += x;
}
int even = 0, odd = 0;
for (auto x : A) {
if (x % 2 == 0) {
even++;
} else
odd++;
}
if (sum % 2 == 0) {
cout << even << "\n";
} else {
cout << odd << "\n";
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
long long n, a, b, x;
long long bin(int v) {
long long l = 1, r = v, mid, ans = 0, res = 0, t;
while (l <= r) {
mid = (l + r) / 2;
if (mid * a / b > ans) {
ans = mid * a / b;
t = ans * b;
t = ceil((t + 0.0) / a);
res = t;
}
l = mid + 1;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> a >> b;
for (int i = 1; i <= n; i++) {
cin >> x;
cout << x - bin(x) << " ";
}
}
| 7 |
#include <bits/stdc++.h>
const int N = 100005;
int n, cnt, last[N * 2], w[N * 2], tot, t[N * 2], deg[N * 2];
struct data {
int l, r;
} a[N];
struct edge {
int to, next, use;
} e[N * 10];
void addedge(int u, int v) {
deg[u]++;
deg[v]++;
e[++cnt].to = v;
e[cnt].next = last[u];
last[u] = cnt;
e[++cnt].to = u;
e[cnt].next = last[v];
last[v] = cnt;
}
void dfs(int x) {
for (int &i = last[x]; i; i = e[i].next)
if (!e[i].use && !e[i ^ 1].use) {
deg[e[i].to]--;
deg[e[i ^ 1].to]--;
e[i].use = 1;
dfs(e[i].to);
}
}
int main() {
scanf("%d", &n);
cnt = 1;
for (int i = 1; i <= n; i++) {
scanf("%d%d", &a[i].l, &a[i].r);
a[i].r++;
w[++tot] = a[i].l;
w[++tot] = a[i].r;
}
std::sort(w + 1, w + tot + 1);
tot = std::unique(w + 1, w + tot + 1) - w - 1;
for (int i = 1; i <= n; i++) {
int l = std::lower_bound(w + 1, w + tot + 1, a[i].l) - w;
int r = std::lower_bound(w + 1, w + tot + 1, a[i].r) - w;
t[l] ^= 1;
t[r] ^= 1;
addedge(l, r);
}
tot++;
w[tot] = w[tot - 1];
for (int i = 1; i < tot; i++) {
t[i] ^= t[i - 1];
if (t[i] == 1) addedge(i, i + 1);
}
for (int i = 1; i <= tot; i++)
if (deg[i] & 1) {
puts("-1");
return 0;
}
for (int i = 1; i <= tot; i++)
if (deg[i]) dfs(i);
for (int i = 1; i <= n; i++) printf("%d ", e[i * 2].use);
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long answ = (n - 2) * (n - 2);
cout << answ;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
int d[maxn][2];
int c[maxn][maxn];
int used[maxn];
int main() {
int n, m, s, t;
scanf("%d%d%d%d", &n, &m, &s, &t);
memset(c, inf, sizeof(c));
memset(d, inf, sizeof(d));
memset(used, 0, sizeof(used));
for (int i = 1; i <= m; i++) {
int u, v;
scanf("%d%d", &u, &v);
c[u][v] = c[v][u] = 1;
}
d[s][0] = 0;
while (true) {
int v = -1;
for (int u = 1; u <= n; u++) {
if (!used[u] && (v == -1 || d[u][0] < d[v][0])) v = u;
}
if (v == -1) break;
used[v] = 1;
for (int u = 1; u <= n; u++) {
d[u][0] = min(d[u][0], d[v][0] + c[v][u]);
}
}
memset(used, 0, sizeof(used));
d[t][1] = 0;
while (true) {
int v = -1;
for (int u = 1; u <= n; u++) {
if (!used[u] && (v == -1 || d[u][1] < d[v][1])) v = u;
}
if (v == -1) break;
used[v] = 1;
for (int u = 1; u <= n; u++) {
d[u][1] = min(d[u][1], d[v][1] + c[v][u]);
}
}
int ans = d[t][0];
int cnt = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
if (i == j || c[i][j] == 1) continue;
int minn = inf;
minn = min(d[i][0] + d[j][1] + 1, minn);
minn = min(d[j][0] + d[i][1] + 1, minn);
if (minn >= ans) {
cnt++;
}
}
cnt >>= 1;
printf("%d\n", cnt);
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ii = pair<int, int>;
using vii = vector<ii>;
using l = long long;
using vl = vector<l>;
using vvl = vector<vl>;
using ll = pair<l, l>;
using vll = vector<ll>;
using vvll = vector<vll>;
using lu = unsigned long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
const int INF = numeric_limits<int>::max();
const double EPS = 1e-10;
const l e0 = 1, e5 = 100000, e6 = 1000000, e7 = 10000000, e9 = 1000000000;
const bool enable_log = false;
struct VoidStream {
void operator&(std::ostream&) {}
};
const l dx[] = {0, 0, 1, -1};
const l dy[] = {-1, 1, 0, 0};
struct point {
l x, y;
};
const l Z = 26;
const l MAX = 50;
point start, finish;
l n, m, k;
l around_start, around_finish;
l shortest;
string answer;
l D[MAX][MAX];
vector<string> M;
bool fit(l x, l y) { return (x >= 0) and (x < n) and (y >= 0) and (y < m); }
l to_bit(char c) { return e0 << (c - 'a'); }
void check(l mask) {
if ((mask & around_finish) == 0) return;
fill(&D[0][0], &D[MAX][0], 0);
queue<point> q;
q.emplace(finish);
D[finish.x][finish.y] = 1;
while (not q.empty()) {
auto u = q.front();
q.pop();
l r = D[u.x][u.y];
if (r > shortest) return;
for (l d = 0; d < 4; d++) {
l x = u.x + dx[d], y = u.y + dy[d];
if ((not fit(x, y)) or D[x][y] != 0) continue;
if (M[x][y] == 'S') {
string candidate = "";
vector<point> wave;
wave.push_back({x, y});
for (l i = r; i > 1; i--) {
vector<point> next;
char c = 'z' + 1;
for (const auto p : wave) {
for (l j = 0; j < 4; j++) {
l a = p.x + dx[j], b = p.y + dy[j];
if ((not fit(a, b)) or (D[a][b] != i)) continue;
D[a][b] = -1;
if (M[a][b] < c) {
next.clear();
c = M[a][b];
}
if (M[a][b] == c) next.push_back({a, b});
}
}
candidate += c;
swap(next, wave);
}
if (r < shortest) {
answer = candidate;
shortest = r;
} else if (candidate < answer) {
answer = candidate;
}
return;
}
if (mask & to_bit(M[x][y])) {
D[x][y] = r + 1;
q.push({x, y});
} else {
D[x][y] = -1;
}
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
while (cin >> n >> m >> k) {
shortest = INF;
M.resize(n);
for (l i = 0; i < n; i++) cin >> M[i];
l mask = 0;
for (l i = 0; i < n; i++) {
for (l j = 0; j < m; j++) {
if (M[i][j] == 'S') {
start = {i, j};
continue;
}
if (M[i][j] == 'T') {
finish = {i, j};
continue;
}
mask = mask | to_bit(M[i][j]);
}
}
around_start = 0;
for (l d = 0; d < 4; d++) {
if (fit(start.x + dx[d], start.y + dy[d])) {
if (M[start.x + dx[d]][start.y + dy[d]] == 'T') {
shortest = 0;
break;
}
around_start =
around_start | to_bit(M[start.x + dx[d]][start.y + dy[d]]);
}
}
if (shortest == 0) {
cout << '\n';
continue;
}
around_finish = 0;
for (l d = 0; d < 4; d++) {
if (fit(finish.x + dx[d], finish.y + dy[d]))
around_finish =
around_finish | to_bit(M[finish.x + dx[d]][finish.y + dy[d]]);
}
for (l a = 0; a < Z; a++) {
if ((around_start & (e0 << a)) == 0) continue;
check(e0 << a);
if (k == 1) continue;
for (l b = 0; b < Z; b++) {
if ((b == a) or ((mask & (e0 << b)) == 0)) continue;
check((e0 << a) | (e0 << b));
if (k == 2) continue;
for (l c = b + 1; c < Z; c++) {
if ((c == a) or ((mask & (e0 << c)) == 0)) continue;
check((e0 << a) | (e0 << b) | (e0 << c));
if (k == 3) continue;
for (l d = c + 1; d < Z; d++) {
if ((d == a) or ((mask & (e0 << d)) == 0)) continue;
check((e0 << a) | (e0 << b) | (e0 << c) | (e0 << d));
}
}
}
}
if (shortest == INF) {
cout << "-1\n";
} else {
cout << answer << '\n';
}
}
}
| 16 |
#include <bits/stdc++.h>
void err() { std::cout << '\n'; }
template <typename T, typename... Args>
void err(T a, Args... args) {
std::cout << a << ' ';
err(args...);
}
void pt() { std::cout << '\n'; }
template <typename T, typename... Args>
void pt(T a, Args... args) {
std::cout << a << ' ';
pt(args...);
}
using namespace std;
const int N = 3e5 + 5;
int n, k;
char s[N];
int bel[N][2];
int f[N + N], cnt[N + N];
int find(int x) { return f[x] == x ? f[x] : f[x] = find(f[x]); }
int calc(int x) {
int y = x + k;
int fx = find(x), fy = find(y);
if (fx == 0 || fy == 0) return cnt[fx + fy];
return min(cnt[fx], cnt[fy]);
}
void merge(int x, int y) {
int fx = find(x), fy = find(y);
if (fx == 0) swap(fx, fy);
f[fx] = fy;
if (fy != 0) cnt[fy] += cnt[fx];
}
void run() {
cin >> (s + 1);
for (int i = 1; i <= k; i++) {
int x;
cin >> x;
for (int j = 1; j <= x; j++) {
int t;
cin >> t;
if (bel[t][0] == 0)
bel[t][0] = i;
else
bel[t][1] = i;
}
}
for (int i = 1; i <= k + k; i++) f[i] = i;
for (int i = 1; i <= k; i++) cnt[i] = 1;
int ans = 0;
for (int i = 1; i <= n; i++) {
if (bel[i][1] == 0) {
int x = bel[i][0];
if (x) {
ans -= calc(x);
if (s[i] == '0') {
f[find(x + k)] = 0;
} else {
f[find(x)] = 0;
}
ans += calc(x);
}
} else {
int x = bel[i][0], y = bel[i][1];
if (s[i] == '0') {
if (find(x + k) != find(y)) {
ans -= calc(x) + calc(y);
merge(x + k, y);
merge(x, y + k);
ans += calc(x);
}
} else {
if (find(x) != find(y)) {
ans -= calc(x) + calc(y);
merge(x, y);
merge(x + k, y + k);
ans += calc(x);
}
}
}
cout << ans << '\n';
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(20);
while (cin >> n >> k) run();
return 0;
}
| 16 |
#include <bits/stdc++.h>
using namespace std;
int n, m, par[100005 * 10], w[100005 * 10], ta, qs;
pair<int, int> x[100005 * 10], y[100005 * 10];
pair<pair<int, int>, pair<int, int> > q[100005 * 20];
int find(int a) {
if (par[a] == a) return a;
return par[a] = find(par[a]);
}
int main() {
scanf("%d%d", &n, &m);
for (int a = 0; a < n * m; a++) par[a] = a;
for (int a = 0; a < n; a++) {
for (int b = 0; b < m; b++) {
scanf("%d", &ta);
x[a * m + b] = make_pair(ta, a * m + b);
y[b * n + a] = make_pair(ta, a * m + b);
}
}
for (int a = 0; a < n; a++) {
sort(x + a * m, x + (a + 1) * m);
for (int b = 1; b < m; b++)
if (x[a * m + b].first == x[a * m + b - 1].first)
par[find(x[a * m + b].second)] = find(x[a * m + b - 1].second);
}
for (int a = 0; a < m; a++) {
sort(y + a * n, y + (a + 1) * n);
for (int b = 1; b < n; b++)
if (y[a * n + b].first == y[a * n + b - 1].first)
par[find(y[a * n + b].second)] = find(y[a * n + b - 1].second);
}
for (int a = 0; a < n; a++)
for (int b = 1; b < m; b++)
if (find(x[a * m + b].second) != find(x[a * m + b - 1].second))
q[qs++] = make_pair(x[a * m + b], x[a * m + b - 1]);
for (int a = 0; a < m; a++)
for (int b = 1; b < n; b++)
if (find(y[a * n + b].second) != find(y[a * n + b - 1].second))
q[qs++] = make_pair(y[a * n + b], y[a * n + b - 1]);
sort(q, q + qs);
for (int a = 0; a < qs; a++)
w[par[q[a].first.second]] =
max(w[par[q[a].first.second]], w[par[q[a].second.second]] + 1);
for (int a = 0; a < n; a++)
for (int b = 0; b < m; b++)
printf("%d%c", w[par[a * m + b]] + 1, b == m - 1 ? '\n' : ' ');
return 0;
}
| 14 |
#include <bits/stdc++.h>
using namespace std;
struct po {
double t, p, x, y;
};
int cmp(po p1, po p2) {
if (p1.t != p2.t) return p1.t < p2.t;
return p1.p < p2.p;
}
po p[1000];
int n;
double maxp;
double sqr(double a) { return a * a; }
double len(po p1, po p2) { return sqrt(sqr(p1.x - p2.x) + sqr(p1.y - p2.y)); }
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%lf%lf%lf%lf", &p[i].x, &p[i].y, &p[i].t, &p[i].p);
sort(p, p + n, cmp);
maxp = 0;
double res[1000];
for (int i = 0; i < n; i++) {
res[i] = p[i].p;
for (int j = 0; j < i; j++)
if ((len(p[i], p[j]) - 1e-5 <= p[i].t - p[j].t) &&
res[i] < res[j] + p[i].p)
res[i] = res[j] + p[i].p;
if (res[i] > maxp) maxp = res[i];
}
printf("%lf\n", maxp);
}
| 10 |
#include <bits/stdc++.h>
using namespace std;
int answer, users, n, m, t, i, FreeID, hours, minutes, seconds;
bool completed;
pair<int, pair<int, int> > events[300000];
int id[300000];
int c[300000];
void work() {
scanf("%d%d%d", &n, &m, &t);
for (i = (1); i <= (n); i++) {
char u;
scanf("%d%c%d%c%d", &hours, &u, &minutes, &u, &seconds);
seconds += 3600 * hours + 60 * minutes;
events[2 * (i - 1) + 1] = make_pair(seconds, make_pair(i, 1));
events[2 * i] = make_pair(seconds + t, make_pair(i, 2));
}
sort(events + 1, events + 2 * n + 1);
for (i = (1); i <= (2 * n); i++) {
if (events[i].second.second == 1) {
if (users == m) {
id[events[i].second.first] = FreeID;
c[id[events[i].second.first]]++;
} else {
answer++;
FreeID = answer;
id[events[i].second.first] = answer;
c[id[events[i].second.first]]++;
users++;
}
if (users == m) {
completed = true;
}
} else {
c[id[events[i].second.first]]--;
if (c[id[events[i].second.first]] == 0) {
users--;
}
}
}
if (completed) {
printf("%d\n", answer);
for (i = (1); i <= (n); i++) {
printf("%d\n", id[i]);
}
} else {
cout << "No solution" << endl;
}
}
int main() {
work();
return 0;
}
| 13 |
#include <bits/stdc++.h>
using namespace std;
long long int arr[1000100];
long long int pow2[1000100];
long long int mul[1000100];
const long long int M = 998244353;
long long int expo(long long int x, long long int y) {
long long int res = 1;
x = x % M;
while (y > 0) {
if (y & 1) res = (res * x) % M;
y = y >> 1;
x = (x * x) % M;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
long long int sum = 0;
cin >> n;
pow2[0] = 1;
for (int i = 0; i < n; i++) {
cin >> arr[i];
pow2[i + 1] = (2 * pow2[i]) % M;
}
mul[1] = 1;
for (int i = 1; i <= n; i++) {
mul[i + 1] = ((i + 2) * pow2[i - 1]) % M;
}
for (int i = 1; i <= n; i++) {
sum = (sum + (arr[i - 1] * mul[n - i + 1]) % M) % M;
}
cout << sum << endl;
return 0;
}
| 12 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5;
int a[maxn + 5];
long long sum[maxn + 5], b[maxn + 5];
double c[maxn + 5];
int main() {
int type, x, q, num = 0;
double max1 = 0;
scanf("%d", &q);
while (q--) {
scanf("%d", &type);
if (type == 1) {
scanf("%d", &x);
num++;
a[num] = x;
sum[num] = sum[num - 1] + a[num];
b[num - 1] = 1LL * num * a[num] - sum[num - 1];
int pos1 = lower_bound(b + 1, b + num, a[num]) - b;
int pos2 = upper_bound(b + 1, b + num, a[num]) - b - 1;
c[num] = a[num] - (a[num] + sum[pos1]) * 1.0 / (pos1 + 1);
c[num] = max(c[num], a[num] - (a[num] + sum[pos2]) * 1.0 / (pos2 + 1));
if (c[num] > max1) max1 = c[num];
} else if (type == 2) {
printf("%.10f\n", max1);
}
}
return 0;
}
| 10 |
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const int maxn = 1e6 + 10;
const int inf = 0x3f3f3f3f;
int n, m;
int dp[maxn][3][3];
int sum[maxn];
int main() {
while (~scanf("%d %d", &n, &m)) {
memset(sum, 0, sizeof sum);
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
sum[x]++;
}
memset(dp, -inf, sizeof dp);
dp[0][0][0] = 0;
for (int i = 1; i <= m + 1; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 3; k++) {
if (dp[i - 1][j][k] < 0) continue;
for (int l = 0; l < 3; l++)
if (j + k + l <= sum[i])
dp[i][k][l] = max(dp[i][k][l],
dp[i - 1][j][k] + l + (sum[i] - j - k - l) / 3);
}
}
}
printf("%d\n", dp[m][0][0]);
}
return 0;
}
| 14 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 2 * 1e5 + 100;
long long n, a[N], b[N], dg[N], ans, vi[N];
vector<long long> p, e[N];
void dfs(long long x) {
for (long long i = 0; i < (long long)e[x].size(); i++) {
long long u = e[x][i];
dfs(u);
}
for (long long i = 0; i < (long long)e[x].size(); i++) {
long long u = e[x][i];
if (a[u] < 0)
vi[u] = 1;
else
a[x] += a[u], p.push_back(u), ans += a[u];
}
}
void dfs1(long long x) {
if (vi[x]) {
p.push_back(x);
ans += a[x];
}
for (long long i = 0; i < (long long)e[x].size(); i++) {
long long u = e[x][i];
dfs1(u);
}
}
signed main() {
scanf("%lld", &n);
for (long long i = 1; i <= n; i++) scanf("%lld", &a[i]);
for (long long i = 1; i <= n; i++) {
scanf("%lld", &b[i]);
if (b[i] != -1) e[b[i]].push_back(i);
}
for (long long i = 1; i <= n; i++) {
if (b[i] != -1) continue;
dfs(i);
p.push_back(i);
ans += a[i];
dfs1(i);
}
printf("%lld\n", ans);
for (long long i = 0; i < (long long)p.size(); i++) printf("%lld ", p[i]);
printf("\n");
}
| 12 |
#include <bits/stdc++.h>
using namespace std;
struct point {
double x, y;
double dist(point t) {
return sqrt((x - t.x) * (x - t.x) + (y - t.y) * (y - t.y));
}
};
int main() {
int n, m, ma = 9999999, mi = -1;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int k, f;
cin >> k >> f;
if (k % f != 0)
mi = max(mi, k / f + 1);
else
mi = max(mi, k / f);
if (f > 1) ma = min(ma, (k - 1) / (f - 1));
}
int f1, f2;
if (mi * ma != 0) {
if (n % mi != 0)
f1 = n / mi + 1;
else
f1 = n / mi;
if (n % ma != 0)
f2 = n / ma + 1;
else
f2 = n / ma;
}
if (n != 1) {
if (f1 == f2)
cout << f1;
else
cout << -1;
} else {
cout << 1;
}
}
| 7 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops")
std::pair<int, int> DR[] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1},
{-1, 1}, {-1, -1}, {1, 1}, {1, -1}};
using namespace std;
template <class c>
struct rge {
c b, e;
};
template <class c>
rge<c> range(c i, c j) {
return rge<c>{i, j};
}
template <class c>
auto dud(c* first) -> decltype(cerr << *first, 0);
template <class c>
char dud(...);
struct debug {
~debug() { cerr << endl; }
template <class c>
typename enable_if<sizeof dud<c>(0) != 1, debug&>::type operator<<(c i) {
cerr << boolalpha << i;
return *this;
}
template <class c>
typename enable_if<sizeof dud<c>(0) == 1, debug&>::type operator<<(c i) {
return *this << range(begin(i), end(i));
}
template <class c, class b>
debug& operator<<(pair<b, c> d) {
return *this << "(" << d.first << ", " << d.second << ")";
}
template <class c>
debug& operator<<(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it) *this << ", " + 2 * (it == d.b) << *it;
return *this << "]";
}
};
int gcd(int a, int b) {
if (b) return gcd(b, a % b);
return a;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n, m, e, d[1 << 10][1 << 10];
int first[1 << 11], a[1 << 11], F[1 << 11];
int s, b;
long long K, H;
vector<pair<int, int>> edg;
int c[2004005], f[2004005], p[2005], k[2005];
int inv(int first) {
if (first <= e + n + m)
return first + e + n + m;
else
return first - e - n - m;
}
vector<pair<int, int>> g[2005];
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cerr.tie(0);
cout.tie(0);
ios_base ::sync_with_stdio(0);
cin.tie();
cout.tie();
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
d[i][j] = 1e9;
}
d[i][i] = 0;
}
while (m--) {
int a, b;
cin >> a >> b;
d[a][b] = min(d[a][b], 1);
d[b][a] = min(d[b][a], 1);
}
cin >> s >> b >> K >> H;
for (int mel = 1; mel <= n; mel++) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (d[i][j] > d[i][mel] + d[mel][j]) {
d[i][j] = d[i][mel] + d[mel][j];
}
}
}
}
for (int i = 1; i <= s; i++) {
cin >> first[i] >> a[i] >> F[i];
}
for (int i = s + 1; i <= s + b; i++) {
int xx, dd;
cin >> xx >> dd;
for (int j = 1; j <= s; j++) {
if (d[first[j]][xx] <= F[j] && dd <= a[j])
edg.push_back(make_pair(j, i - s));
}
}
n = s;
m = b;
e = edg.size();
for (int i = 1; i <= e; i++) {
int first = edg[i - 1].first, second = edg[i - 1].second;
g[first].push_back({n + second, i});
g[n + second].push_back({first, e + n + m + i});
c[i] = 1;
}
for (int i = 1; i <= n; i++) {
g[0].push_back({i, e + i});
g[i].push_back({0, 2 * e + n + m + i});
c[e + i] = 1;
}
for (int i = 1; i <= m; i++) {
g[n + i].push_back({n + m + 1, e + n + i});
g[n + m + 1].push_back({n + i, 2 * e + 2 * n + m + i});
c[e + n + i] = 1;
}
int gd = 0;
do {
gd = 0;
for (int i = 1; i <= n + m + 1; i++) p[i] = -1, k[i] = 0;
queue<int> q;
q.push(0);
while (q.size()) {
int t = q.front();
q.pop();
for (pair<int, int> i : g[t]) {
if (p[i.first] == -1 && i.first && i.first != n + m + 1 &&
f[i.second] < c[i.second]) {
q.push(i.first);
p[i.first] = t;
k[i.first] = i.second;
}
}
}
for (int i = n + 1; i <= n + m; i++) {
int s = e + i;
if (p[i] != -1 && f[s] < c[s]) {
gd = 1;
int fl = c[s] - f[s], t = i;
while (t) {
fl = min(fl, c[k[t]] - f[k[t]]);
t = p[t];
}
t = i;
f[s] += fl;
f[inv(s)] -= fl;
while (t) {
f[k[t]] += fl;
f[inv(k[t])] -= fl;
t = p[t];
}
}
}
} while (gd);
int ans = 0;
for (int i = 1; i <= m; i++) {
ans += f[e + n + i];
}
cout << min(H * n, K * ans);
}
| 14 |
#include <bits/stdc++.h>
using namespace std;
const long double EPS = 1e-6;
const int INF = (int)(INT_MAX - 100);
const long long mod = (int)(1e+9 + 7);
const int N = (int)(0);
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) scanf("%d", &v[i]);
long long x = sqrt(1.0 * (2LL * k + 0.25)) - 0.5 - EPS;
x = x * (x + 1) / 2;
cout << v[k - x - 1];
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
long long a[202020], k = 1, ans, mod = 1e9 + 7;
long long quick_power(long long a, long long b = mod - 2) {
long long s = 1;
for (; b; b >>= 1, a = a * a % mod)
if (b & 1) s = s * a % mod;
return s;
}
int main() {
int i, n;
scanf("%d", &n);
for (i = 1; i <= n; i++) scanf("%lld", &a[i]);
for (; n % 4 != 1;)
for (n--, i = 1; i <= n; i++)
a[i] = (a[i] + k * a[i + 1] + mod) % mod, k *= -1;
for (k = 1, ans = a[1], i = 1; i <= n / 2; i++)
k = k * (n / 2 - i + 1) % mod * quick_power(i) % mod,
ans = (ans + k * a[i * 2 + 1]) % mod;
printf("%lld", ans);
}
| 14 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n;
vector<int> v1(n);
for (int i = 0, a; i < n; i++) cin >> v1[i];
cin >> m;
vector<int> v2(m);
for (int i = 0, a; i < m; i++) cin >> v2[i];
sort(v1.begin(), v1.end());
sort(v2.begin(), v2.end());
cout << v1[v1.size() - 1] << " " << v2[v2.size() - 1] << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0;
cin >> n;
map<string, pair<int, int>> mp;
vector<pair<string, pair<int, int>>> log;
map<string, int> names;
for (int i = 0; i < n; ++i) {
string name;
cin >> name;
int score = 0;
cin >> score;
auto it = mp.find(name);
if (it == mp.end()) {
mp.insert(make_pair(name, make_pair(score, i + 1)));
} else {
it->second.first += score;
it->second.second = i + 1;
}
log.push_back(make_pair(name, make_pair(score, i + 1)));
}
int max = mp.begin()->second.first;
for (auto it = mp.begin(); it != mp.end(); ++it) {
if (it->second.first > max) {
max = it->second.first;
}
}
for (auto it = mp.begin(); it != mp.end(); ++it) {
if (it->second.first == max) {
names.insert(make_pair(it->first, 0));
}
}
for (int i = 0; i < log.size(); ++i) {
if (names.find(log[i].first) != names.end()) {
names.find(log[i].first)->second += log[i].second.first;
if (names.find(log[i].first)->second >= max) {
cout << log[i].first;
break;
}
}
}
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
#define fast() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long int
#define pb push_back
#define mp make_pair
#define pf push_front
#define rep(i, a, b, k) for (ll i = a; i < b; i += k)
#define rept(i, a, b) for (auto i = a; i != b; ++i)
#define drep(i, a, b, k) for (ll i = a; i >= b; i--)
#define mem0(a) memset(a, 0, sizeof(a))
#define w(t) while (t--)
#define array(arr, n) \
vector<ll> arr(n); \
for (ll i = 0; i < n; i++) \
cin >> arr[i];
#define ni1(t) \
ll t; \
cin >> t;
#define ni2(a, b) \
ll a, b; \
cin >> a >> b
#define ni3(a, b, c) \
ll a, b, c; \
cin >> a >> b >> c
#define ni4(a, b, c, d) \
ll a, b, c, d; \
cin >> a >> b >> c >> d
#define ni5(a, b, c, d, e) \
ll a, b, c, d, e; \
cin >> a >> b >> c >> d >> e
#define ni6(a, b, c, d, e, f) \
ll a, b, c, d, e, f; \
cin >> a >> b >> c >> d >> e >> f
#define ns(s) \
string s; \
cin >> s
#define getmax(a, b) a > b ? a : b
#define getmin(a, b) a < b ? a : b
#define print(x) \
for (auto ele : x) \
cout << ele << " "; \
cout << endl;
#define printp(x) \
for (auto ele : x) \
cout << ele.firs << ' ' << ele.second << endl;
#define mod 1000000007
#define siz1 200005
#define siz2 1000005
#define khatam return 0
#define all(x) x.begin(), x.end()
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vll;
typedef unordered_map<ll, ll> ull;
typedef map<ll, ll> mll;
void solve()
{
ni1(n);
array(val, n);
vl ans(n, 0);
rep(i, 0, n - 1, 1)
{
if (val[i] == val[i + 1])
{
ans[i + 1] = 0;
continue;
}
else
{
ll no = 0;
int aa = 0;
int A = val[i], B = val[i + 1];
for (int j = 0; j < 32; j++)
{
if ((A & (1 << j)) and !(B & (1 << j)))
{
ans[i + 1] += (1 << j);
val[i + 1] += (1 << j);
}
}
}
}
print(ans);
}
int main()
{
fast();
ni1(t);
w(t)
{
solve();
}
khatam;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
char a[1000];
int main() {
int n;
cin >> n;
int cnt1 = 0, cnt2 = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
cnt1 += (a[i] == 'X');
}
cout << abs(n / 2 - cnt1) << endl;
if (n / 2 - cnt1 < 0) {
for (int i = 0; i < n; i++) {
if (cnt1 > n / 2 && a[i] == 'X')
cout << 'x', cnt1--;
else
cout << a[i];
}
cout << endl;
} else {
for (int i = 0; i < n; i++) {
if (cnt1 < n / 2 && a[i] == 'x')
cout << 'X', cnt1++;
else
cout << a[i];
}
cout << endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
long long read() {
long long x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
return x * f;
}
const int maxn = 60;
const int dx[] = {1, 0, 0, -1}, dy[] = {0, 1, -1, 0};
int n, m;
struct lzt {
pair<int, int> a[maxn];
int gr[maxn][maxn];
vector<pair<pair<int, int>, pair<int, int> > > ans;
void in() {
for (register int i = (int)(1); i <= (int)(m); i++) {
a[i].first = read(), a[i].second = read();
gr[a[i].first][a[i].second] = i;
}
}
void add(int aa, int bb, int cc, int dd) {
ans.push_back(make_pair(make_pair(aa, bb), make_pair(cc, dd)));
int ind = gr[aa][bb];
a[ind] = make_pair(cc, dd);
gr[cc][dd] = gr[aa][bb];
gr[aa][bb] = 0;
}
void move(int x, int y) {
if (gr[x][y + 1]) move(x, y + 1);
add(x, y, x, y + 1);
}
void doit() {
int num = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
if (gr[i][j]) {
num++;
int x = j;
while (x > num) {
add(i, x, i, x - 1);
x--;
}
while (x < num) {
move(i, x);
x++;
}
for (int k = i - 1; k >= 1; k--) add(k + 1, x, k, x);
}
}
}
void work(int *nw, int *wnt) {
if (n == 2) {
if (nw[1] != wnt[1]) {
add(1, 1, 2, 1);
add(2, 1, 2, 2);
add(1, 2, 1, 1);
add(2, 2, 1, 2);
}
} else if (n > 2) {
for (int i = 1; i <= m; i++) {
int pos;
for (int j = 1; j <= m; j++) {
if (wnt[j] == nw[i]) {
pos = j;
break;
}
}
add(1, i, 2, i);
int x = i;
while (x < pos) add(2, x, 2, x + 1), x++;
while (x > pos) add(2, x, 2, x - 1), x--;
add(2, x, 3, x);
}
for (int i = 1; i <= m; i++) add(3, i, 2, i), add(2, i, 1, i);
}
}
void pr() {
for (int i = 0; i < ans.size(); i++)
cout << ans[i].first.first << ' ' << ans[i].first.second << ' '
<< ans[i].second.first << ' ' << ans[i].second.second << endl;
}
void rpr() {
for (int i = ans.size() - 1; i >= 0; i--)
cout << ans[i].second.first << ' ' << ans[i].second.second << ' '
<< ans[i].first.first << ' ' << ans[i].first.second << endl;
}
} A, B;
int main() {
n = read(), m = read();
A.in(), B.in();
A.doit();
B.doit();
A.work(A.gr[1], B.gr[1]);
cout << A.ans.size() + B.ans.size() << endl;
A.pr();
B.rpr();
return 0;
}
| 19 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0;
char c = 0;
while (c < '0' || c > '9') c = getchar();
while ('0' <= c && c <= '9') x = 10 * x + c - '0', c = getchar();
return x;
}
const int N = 4003;
int n, k, sum[N][N];
int dp[N], cnt[N];
int stk[N], dex[N];
int hd, tl;
inline int W(int i, int j) {
return ((sum[i][i] + sum[j][j]) >> 1) - sum[i][j] + dp[j];
}
int Check(int cost) {
dp[0] = cnt[0] = 0, hd = tl = 1;
stk[hd] = 0, dex[hd] = 1;
for (int i = 1; i <= n; i++) {
while (hd < tl && dex[hd + 1] <= i) hd++;
dp[i] = W(i, stk[hd]) + cost;
cnt[i] = cnt[stk[hd]] + 1;
if (W(n, i) >= W(n, stk[tl])) continue;
int l, r = n + 1;
while (hd < tl && W(dex[tl], stk[tl]) > W(dex[tl], i)) r = dex[tl--];
l = dex[tl];
while (l < r) {
int mid = (l + r) >> 1;
if (W(mid, i) < W(mid, stk[tl]))
r = mid;
else
l = mid + 1;
}
stk[++tl] = i, dex[tl] = r;
}
return cnt[n];
}
int WQS(int l, int r) {
int mid;
while (l < r) {
mid = (l + r) >> 1;
if (Check(mid) > k)
l = mid + 1;
else
r = mid;
}
Check(r);
return r;
}
int main() {
n = read(), k = read();
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
sum[i][j] = read() + sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1];
int cost = WQS(0, sum[n][n] + 1);
printf("%d\n", dp[n] - k * cost);
return 0;
}
| 18 |
#include <bits/stdc++.h>
using namespace std;
struct union_find {
vector<int> parent;
vector<int> size;
int components = 0;
union_find(int n = -1) {
if (n >= 0) init(n);
}
void init(int n) {
parent.resize(n + 1);
size.assign(n + 1, 1);
components = n;
for (int i = 0; i <= n; i++) parent[i] = i;
}
int find(int x) { return x == parent[x] ? x : parent[x] = find(parent[x]); }
bool unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return false;
if (size[x] < size[y]) swap(x, y);
parent[y] = x;
size[x] += size[y];
components--;
return true;
}
};
struct query {
short x, y;
int c, lost;
};
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N, M, Q;
cin >> N >> M >> Q;
vector<vector<int>> grid(N, vector<int>(M, 0));
vector<query> queries(Q);
for (query &qry : queries) {
cin >> qry.x >> qry.y >> qry.c;
qry.x--;
qry.y--;
}
int C = queries.back().c;
vector<int> counts(C + 1, 0);
counts[0] = N * M;
for (query &qry : queries) {
qry.lost = grid[qry.x][qry.y];
grid[qry.x][qry.y] = qry.c;
counts[qry.c]++;
}
grid.assign(N, vector<int>(M, 0));
vector<int> answers(Q, 1);
vector<int> components(C + 1);
components[0] = 1;
vector<vector<int>> color_indices(C + 1);
vector<vector<int>> lost_indices(C + 1);
for (int q = 0; q < Q; q++) {
query &qry = queries[q];
color_indices[qry.c].push_back(q);
lost_indices[qry.lost].push_back(q);
}
auto &&to_index = [&](int row, int col) { return row * M + col; };
vector<int> forward_delta(Q, 0);
for (int c = 1; c <= C; c++) {
int add_components = 0, previous = 0;
union_find UF(N * M);
for (int q : color_indices[c]) {
add_components++;
query &qry = queries[q];
if (qry.x > 0 && grid[qry.x - 1][qry.y] == c)
add_components -=
UF.unite(to_index(qry.x - 1, qry.y), to_index(qry.x, qry.y));
if (qry.y > 0 && grid[qry.x][qry.y - 1] == c)
add_components -=
UF.unite(to_index(qry.x, qry.y - 1), to_index(qry.x, qry.y));
if (qry.x < N - 1 && grid[qry.x + 1][qry.y] == c)
add_components -=
UF.unite(to_index(qry.x + 1, qry.y), to_index(qry.x, qry.y));
if (qry.y < M - 1 && grid[qry.x][qry.y + 1] == c)
add_components -=
UF.unite(to_index(qry.x, qry.y + 1), to_index(qry.x, qry.y));
grid[qry.x][qry.y] = c;
forward_delta[q] += add_components - previous;
previous = add_components;
}
components[c] = UF.components - (N * M - counts[c]);
}
for (int q = 0, delta = 0; q < Q; q++) {
delta += forward_delta[q];
answers[q] += delta;
}
vector<vector<int>> final_grid = grid;
vector<int> final_counts(C + 1, 0);
for (int row = 0; row < N; row++)
for (int col = 0; col < M; col++) final_counts[grid[row][col]]++;
vector<int> backward_delta(Q + 1, 0);
for (int c = 0; c <= C; c++) {
union_find UF(N * M);
grid = final_grid;
for (int row = 0; row < N; row++)
for (int col = 0; col < M; col++)
if (grid[row][col] == c) {
if (row < N - 1 && grid[row + 1][col] == c)
UF.unite(to_index(row + 1, col), to_index(row, col));
if (col < M - 1 && grid[row][col + 1] == c)
UF.unite(to_index(row, col + 1), to_index(row, col));
}
int delta = (UF.components - (N * M - final_counts[c])) - components[c];
backward_delta[Q] += delta;
int previous = delta;
reverse(lost_indices[c].begin(), lost_indices[c].end());
for (int q : lost_indices[c]) {
query &qry = queries[q];
delta -= UF.components;
if (qry.x > 0 && grid[qry.x - 1][qry.y] == c)
UF.unite(to_index(qry.x - 1, qry.y), to_index(qry.x, qry.y));
if (qry.y > 0 && grid[qry.x][qry.y - 1] == c)
UF.unite(to_index(qry.x, qry.y - 1), to_index(qry.x, qry.y));
if (qry.x < N - 1 && grid[qry.x + 1][qry.y] == c)
UF.unite(to_index(qry.x + 1, qry.y), to_index(qry.x, qry.y));
if (qry.y < M - 1 && grid[qry.x][qry.y + 1] == c)
UF.unite(to_index(qry.x, qry.y + 1), to_index(qry.x, qry.y));
delta += UF.components;
delta++;
grid[qry.x][qry.y] = c;
backward_delta[q] += delta - previous;
previous = delta;
}
}
for (int q = Q - 1, delta = 0; q >= 0; q--) {
delta += backward_delta[q + 1];
answers[q] += delta;
}
for (int q = 0; q < Q; q++) cout << answers[q] << '\n';
}
| 20 |
#include <bits/stdc++.h>
using namespace std;
template <class t, class u>
void chmax(t &first, u second) {
if (first < second) first = second;
}
template <class t, class u>
void chmin(t &first, u second) {
if (second < first) first = second;
}
struct item {
int index;
int cost;
};
vector<item> stools, pencils;
vector<vector<item> > RED, WHITE;
vector<int> red_v;
bool lesser(struct item &left, struct item &right) {
return left.cost < right.cost;
}
int main() {
int n, k;
scanf("%d", &n);
scanf("%d", &k);
for (int rep = 0; rep < n; ++rep) {
int cost, type;
scanf("%d", &cost);
scanf("%d", &type);
if (type == 1) {
stools.push_back({rep, cost});
} else {
pencils.push_back({rep, cost});
}
}
sort(stools.begin(), stools.end(), lesser);
int numStools = int(stools.size());
int r = min(k, numStools), w = k - r;
RED.resize(r);
red_v.assign(r, 0);
for (int rep = 0; rep < r; ++rep) {
RED[rep].push_back(stools.back());
red_v[rep] = stools.back().cost;
stools.pop_back();
}
if (w > 0) {
WHITE.resize(w);
assert(int(pencils.size()) >= w);
for (int rep = 0; rep < w; ++rep) {
WHITE[rep].push_back(pencils.back());
pencils.pop_back();
}
while (!pencils.empty()) {
WHITE[w - 1].push_back(pencils.back());
pencils.pop_back();
}
assert(pencils.empty());
} else {
assert(k == r);
while (!stools.empty()) {
RED[r - 1].push_back(stools.back());
assert(stools.back().cost <= red_v[r - 1]);
red_v[r - 1] = stools.back().cost;
stools.pop_back();
}
assert(stools.empty());
while (!pencils.empty()) {
RED[r - 1].push_back(pencils.back());
red_v[r - 1] = min(red_v[r - 1], pencils.back().cost);
pencils.pop_back();
}
assert(pencils.empty());
}
long long int sum = 0LL;
for (int rep = 0; rep < r; rep++) sum += red_v[rep];
long long int total_cost = 0LL;
for (vector<item> &p : RED) {
for (auto &pi : p) total_cost += pi.cost;
}
for (vector<item> &p : WHITE) {
for (auto &pi : p) total_cost += pi.cost;
}
total_cost -= sum;
if (sum & 1)
printf("%lld.5\n", sum / 2 + total_cost);
else
printf("%lld.0\n", sum / 2 + total_cost);
for (vector<item> &p : RED) {
printf("%ld ", p.size());
for (auto &pi : p) printf("%d ", pi.index + 1);
printf("\n");
}
for (vector<item> &p : WHITE) {
printf("%ld ", p.size());
for (auto &pi : p) printf("%d ", pi.index + 1);
printf("\n");
}
return 0;
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T _sq(T a) {
return a * a;
}
template <class T>
inline T _sqrt(T a) {
return (T)sqrt((double)a);
}
template <class T, class X>
inline T _pow(T a, X y) {
T z = 1;
for (int i = 1; i <= y; i++) {
z *= a;
}
return z;
}
template <class T>
inline T _gcd(T a, T b) {
a = abs(a);
b = abs(b);
if (!b) return a;
return _gcd(b, a % b);
}
template <class T>
inline T _lcm(T a, T b) {
a = abs(a);
b = abs(b);
return (a / _gcd(a, b)) * b;
}
template <class T>
inline T _extended(T a, T b, T &x, T &y) {
a = abs(a);
b = abs(b);
T g, x1, y1;
if (!b) {
x = 1;
y = 0;
g = a;
return g;
}
g = _extended(b, a % b, x1, y1);
x = y1;
y = x1 - (a / b) * y1;
return g;
}
template <class T, class X>
inline bool getbit(T a, X i) {
T t = 1;
return ((a & (t << i)) > 0);
}
template <class T, class X>
inline T setbit(T a, X i) {
T t = 1;
return (a | (t << i));
}
template <class T, class X>
inline T resetbit(T a, X i) {
T t = 1;
return (a & (~(t << i)));
}
template <class T, class X>
inline T togglebit(T a, X i) {
T t = 1;
return (a ^ (t << i));
}
template <class T>
void pv(T v) {
for (int i = 0; i < ((int)v.size()); i++) cout << v[i] << " ";
cout << endl;
}
template <class T, class X>
inline T _bigmod(T n, X m) {
unsigned long long ret = 1, a = n % 1000000007;
while (m) {
if (m & 1) ret = (ret * a) % 1000000007;
m >>= 1;
a = (a * a) % 1000000007;
}
ret %= 1000000007;
return (T)ret;
}
template <class T>
inline T _modinv(T n) {
return _bigmod(n, 1000000007 - 2);
}
struct trie {
bool v;
int nxt[3];
trie() {
v = 0;
memset(nxt, -1, sizeof nxt);
}
};
trie t[(2000000 + 3)];
int n, m;
int ptr = 1;
void insert(string &s) {
int idx = 0;
for (int i = 0; i < ((int)s.size()); i++) {
if (t[idx].nxt[s[i] - 'a'] == -1) t[idx].nxt[s[i] - 'a'] = ptr++;
idx = t[idx].nxt[s[i] - 'a'];
}
t[idx].v = true;
return;
}
bool check(string &s, int idx, int pos, int taken) {
if (pos == ((int)s.size())) return taken && t[idx].v;
if (t[idx].nxt[s[pos] - 'a'] != -1 &&
check(s, t[idx].nxt[s[pos] - 'a'], pos + 1, taken)) {
return 1;
}
if (!taken) {
for (int k = 'a'; k <= 'c'; k++) {
if (k != s[pos] && t[idx].nxt[k - 'a'] != -1 &&
check(s, t[idx].nxt[k - 'a'], pos + 1, 1)) {
return 1;
}
}
}
return 0;
}
int main() {
cin >> n >> m;
for (int i = 0; i <= n - 1; i++) {
string s;
cin >> s;
insert(s);
}
for (int i = 0; i <= m - 1; i++) {
string s;
cin >> s;
puts(check(s, 0, 0, 0) ? "YES" : "NO");
}
return 0;
}
| 12 |
#include <bits/stdc++.h>
using namespace std;
namespace INPUT {
const int L = 1 << 15;
char _buf[L], *S, *T, c;
char _gc() {
if (S == T) {
T = (S = _buf) + fread(_buf, 1, L, stdin);
if (S == T) return EOF;
}
return *S++;
}
void readi(int &X) {
for (c = _gc(); c < '0' || c > '9'; c = _gc())
;
X = c & 15;
for (c = _gc(); c >= '0' && c <= '9'; X = X * 10 + (c & 15), c = _gc())
;
}
} // namespace INPUT
using INPUT::readi;
const int Maxn = 105;
const int Maxm = 1E5 + 5;
const int INF = 0x3f3f3f3f;
int N, M;
struct NO {
int l, r;
} a[Maxn];
int Ans;
inline void MIN(int &x, int y) {
if (x > y) x = y;
}
namespace SEG {
int mn[Maxm << 2];
void Build(int i, int L, int R) {
mn[i] = INF;
if (L == R) return;
int mid = L + R >> 1;
Build(i << 1, L, mid), Build(i << 1 | 1, mid + 1, R);
}
void Insert(int i, int L, int R, int X, int A) {
if (L == R) return (void)(mn[i] = A);
int mid = L + R >> 1;
if (X <= mid)
Insert(i << 1, L, mid, X, A);
else
Insert(i << 1 | 1, mid + 1, R, X, A);
mn[i] = min(mn[i << 1], mn[i << 1 | 1]);
}
int Query(int i, int L, int R, int l, int r) {
if (l > r) return INF;
if (L >= l && R <= r) return mn[i];
int mid = L + R >> 1;
if (r <= mid)
return Query(i << 1, L, mid, l, r);
else if (l > mid)
return Query(i << 1 | 1, mid + 1, R, l, r);
else
return min(Query(i << 1, L, mid, l, mid),
Query(i << 1 | 1, mid + 1, R, mid + 1, r));
}
} // namespace SEG
namespace _SEG {
int mn[Maxm << 2];
void Build(int i, int L, int R) {
mn[i] = INF;
if (L == R) return;
int mid = L + R >> 1;
Build(i << 1, L, mid), Build(i << 1 | 1, mid + 1, R);
}
void Insert(int i, int L, int R, int X, int A) {
if (L == R) return (void)(mn[i] = A);
int mid = L + R >> 1;
if (X <= mid)
Insert(i << 1, L, mid, X, A);
else
Insert(i << 1 | 1, mid + 1, R, X, A);
mn[i] = min(mn[i << 1], mn[i << 1 | 1]);
}
int Query(int i, int L, int R, int l, int r) {
if (l > r) return INF;
if (L >= l && R <= r) return mn[i];
int mid = L + R >> 1;
if (r <= mid)
return Query(i << 1, L, mid, l, r);
else if (l > mid)
return Query(i << 1 | 1, mid + 1, R, l, r);
else
return min(Query(i << 1, L, mid, l, mid),
Query(i << 1 | 1, mid + 1, R, mid + 1, r));
}
} // namespace _SEG
int main() {
scanf("%d %d", &M, &N);
for (int i = 1; i <= N; ++i) scanf("%d %d", &a[i].l, &a[i].r);
if (a[N].r < M) {
puts("Hungry");
return 0;
}
SEG::Build(1, 0, M), _SEG::Build(1, 0, M);
SEG::Insert(1, 0, M, 0, 0);
for (int i = 1; i <= N; ++i) {
for (int j = M; j >= 0; --j) {
int Val = INF, _Val = _SEG::Query(1, 0, M, j, j);
if (j >= a[i].r - a[i - 1].r)
Val = SEG::Query(1, 0, M, j - (a[i].r - a[i - 1].r),
j - (a[i].r - a[i - 1].r));
MIN(Val, _SEG::Query(1, 0, M, max(0, j - (a[i].r - a[i].l)), j) + 1);
MIN(Val, SEG::Query(1, 0, M, max(0, j - a[i].r + a[i - 1].r),
j - (a[i].l - a[i - 1].r)) +
2);
MIN(_Val, SEG::Query(1, 0, M, max(0, j - a[i].r + a[i - 1].r),
j - (a[i].l - a[i - 1].r)) +
1);
MIN(_Val, _SEG::Query(1, 0, M, max(0, j - (a[i].r - a[i].l)), j) + 2);
SEG::Insert(1, 0, M, j, Val), _SEG::Insert(1, 0, M, j, _Val);
}
}
if (a[N].r == M * 2)
Ans = min(SEG::Query(1, 0, M, M, M), _SEG::Query(1, 0, M, M, M));
else
Ans = min(_SEG::Query(1, 0, M, M, M),
SEG::Query(1, 0, M, a[N].r - M, a[N].r - M));
if (Ans >= INF)
puts("Hungry");
else
puts("Full"), printf("%d", Ans);
return 0;
}
| 16 |
#include <bits/stdc++.h>
using namespace std;
long long D[13333350 * 2];
int n, x, y;
int main() {
scanf("%d%d%d", &n, &x, &y);
memset(D, 63, sizeof(D));
D[0] = 0;
D[1] = x;
int i = 1;
while (i < 13333350) {
D[i + i] = min(D[i + i], D[i] + y);
D[i + 1] = min(D[i + 1], D[i] + x);
if (D[i] + x < D[i - 1]) {
D[i - 1] = D[i] + x;
--i;
} else {
++i;
}
}
printf("%lld\n", D[n]);
}
| 12 |
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
int main() {
int n, m, x, y, z, p;
cin >> n >> m >> x >> y >> z >> p;
x %= 4;
y %= 2;
z %= 4;
for (int i = 1; i <= p; i++) {
int r, c;
scanf("%d%d", &r, &c);
int nn = n, mm = m;
for (int nima = 1; nima <= x; nima++) {
int tmp = c;
c = nn - r + 1;
r = tmp;
nn = n + m - nn;
mm = n + m - mm;
}
for (int nima = 1; nima <= y; nima++) {
c = mm - c + 1;
}
for (int nima = 1; nima <= z; nima++) {
int tmp = r;
r = mm - c + 1;
c = tmp;
nn = n + m - nn;
mm = n + m - mm;
}
cout << r << " " << c << endl;
}
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 1e3 + 10;
const int maxm = 5e5 + 10;
const long long INF = 1e18;
long long powmod(long long x, long long y) {
long long t;
for (t = 1; y; y >>= 1, x = x * x % mod)
if (y & 1) t = t * x % mod;
return t;
}
long long gcd(long long x, long long y) {
if (y == 0) return x;
return gcd(y, x % y);
}
int t, n, x, y, rt;
vector<int> g[maxn];
int dfs(int x, int f) {
int ret = 1;
for (auto v : g[x])
if (v ^ f) ret += dfs(v, x);
return ret;
}
int main() {
ios::sync_with_stdio(false);
cin >> t;
while (t--) {
cin >> n >> rt;
for (int(i) = (1); (i) < (n + 1); (i)++) g[i].clear();
for (int(i) = (1); (i) < (n); (i)++) {
cin >> x >> y;
g[x].push_back(y);
g[y].push_back(x);
}
if (g[rt].size() <= 1)
cout << "Ayush\n";
else {
n -= 2;
if (n & 1)
cout << "Ashish\n";
else
cout << "Ayush\n";
}
}
return 0;
}
| 8 |
#include <bits/stdc++.h>
long long a[100009];
void inti() {
a[1] = 2;
for (long long i = 2; i <= 100000; i++) {
a[i] = i * (i + 1) * (i + 1) - i + 1;
}
}
int main() {
inti();
int n;
while (scanf("%d", &n) != EOF) {
for (int i = 1; i <= n; i++) {
printf("%lld\n", a[i]);
}
}
return 0;
}
| 8 |
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:20000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
using namespace std;
const int N = 5e5 + 7, inf = 1e9 + 7, mod = 1e9 + 7;
const long long linf = (long long)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1},
dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
int get_int() {
char x = getchar();
bool mns = 0;
while (!isdigit(x)) mns |= x == '-', x = getchar();
int res = 0;
while (isdigit(x)) res = res * 10 + x - '0', x = getchar();
if (mns) res = -res;
return res;
}
void add(int &x, int y) {
x += y;
if (x >= mod) x -= mod;
if (x < 0) x += mod;
}
int mult(int x, int y) { return x * 1ll * y % mod; }
int sum(int x, int y) {
add(x, y);
return x;
}
int n, q;
int ans;
int a[N], b[N];
int cnt[N];
int mn[N], mx[N], len[N];
int rnd(int x) { return ((rand() << 16) + rand()) % x; }
int get() {
for (int i = 1; i <= n; i++) cnt[i] = 0;
for (int i = 1; i <= n; i++) cnt[a[i]]++;
int res = 0;
for (int i = 1; i <= n; i++) res += cnt[i] * cnt[i];
return res;
}
void copy() {
for (int i = 1; i <= n; i++) b[i] = a[i];
}
void recover() {
for (int i = 1; i <= n; i++) a[i] = b[i];
}
int timer;
int was[N];
void solve() {
n = get_int(), q = get_int();
for (int i = 1; i <= n; i++) mn[i] = 1, mx[i] = n;
for (int i = 1; i <= q; i++) {
int t = get_int(), l = get_int(), r = get_int(), x = get_int();
for (int j = l; j <= r; j++) {
if (t == 1)
mn[j] = max(mn[j], x);
else
mx[j] = min(mx[j], x);
}
}
for (int i = 1; i <= n; i++) {
len[i] = mx[i] - mn[i] + 1;
if (len[i] <= 0) cout << -1, exit(0);
a[i] = mn[i];
}
ans = get();
while (clock() / (double)CLOCKS_PER_SEC < 2.95) {
int total = rnd(max(1, n / 3)) + 1;
vector<int> r;
++timer;
copy();
for (int i = 1; i <= total; i++) {
int x = rnd(n) + 1;
while (was[x] == timer) x = rnd(n) + 1;
was[x] = timer;
int nxt = rnd(len[x]);
a[x] = mn[x] + nxt;
}
int now = get();
if (now <= ans)
ans = now;
else
recover();
}
cout << ans;
}
int main() {
srand(time(0));
int T = 1;
while (T--) solve();
exit(0);
}
| 14 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, max = 0, mx = 0, j, sum = 0, d, m;
vector<pair<int, int> > a;
vector<pair<int, int> >::iterator it;
cin >> n;
for (i = 0; i < n; i++) {
cin >> m;
max = 0;
for (j = 0; j < m; j++) {
cin >> d;
if (max < d) max = d;
}
if (mx < max) mx = max;
a.push_back(make_pair(m, max));
}
for (it = a.begin(); it < a.end(); it++) {
sum += (mx - it->second) * it->first;
}
cout << sum << endl;
}
| 5 |
#include <algorithm>
#include <cstdio>
#include <vector>
#include <cstring>
using namespace std;
const int N = 4e3 + 10;
int g[N][6];
int n, m, k;
int l[N], r[N];
int get(int l, int r, int ll, int rr) {
return max(0, min(rr, r) - max(ll, l) + 1);
}
int main() {
scanf("%d %d %d", &n, &m, &k);
for (int i = 1; i <= m;i++) {
scanf("%d %d", &l[i], &r[i]);
}
int mx = 0;
for (int i = 1; i <= n;i ++) {
int all = 0;
memset(g, 0, sizeof(g));
for (int j = 1; j <= m;j ++) {
int v = get(i, i + k - 1, l[j], r[j]);
all += v;
g[max(i, l[j] + v - 1 - k + 1)][1] ++;
g[max(i, min(r[j] - k + 1, l[j]))][2] ++;
g[max(i, max(r[j] - k + 1, l[j]))][3] ++;
g[max(i, r[j] - v + 1)][4] ++;
}
int cnt = 0;
mx = max(all, mx);
for (int j = i + 1; j <= n; j ++) {
cnt += g[j - 1][1] - g[j - 1][2] - g[j - 1][3] + g[j - 1][4];
all += cnt;
mx = max(all, mx);
}
}
printf("%d\n", mx);
return 0;
}
| 17 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base ::sync_with_stdio(false);
int n, m;
int r1_min = INT_MAX, l1_max = -INT_MAX;
int r2_min = INT_MAX, l2_max = -INT_MAX;
cin >> n;
int l1[n], r1[n];
for (int i = 0; i < n; i++) {
cin >> l1[i] >> r1[i];
l1_max = max(l1[i], l1_max);
r1_min = min(r1[i], r1_min);
}
cin >> m;
int l2[m], r2[m];
for (int i = 0; i < m; i++) {
cin >> l2[i] >> r2[i];
l2_max = max(l2[i], l2_max);
r2_min = min(r2[i], r2_min);
}
int d1 = l2_max - r1_min;
int d2 = l1_max - r2_min;
int ans = max(d1, d2);
if (ans < 0) ans = 0;
cout << ans << "\n";
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int t = 0;
cin >> t;
for (int i = 0; i < t; ++i) {
int n = 0, cnt = 0;
bool flag = false;
cin >> n;
int arr[n], lim = n * (n - 1) / 2 - 1;
for (int j = 0; j < n; ++j) cin >> arr[j];
for (int j = 1; j < n; ++j) {
if (arr[j] >= arr[j - 1]) {
flag = true;
break;
}
}
cout << (flag ? "YES\n" : "NO\n");
}
return 0;
}
| 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.