| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 285999 |
2020-08-29T21:38:40 Z |
caoash |
Cake (CEOI14_cake) |
C++14 |
|
662 ms |
6136 KB |
#pragma GCC target ("avx,avx2")
#pragma GCC optimize ("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair
template<class T, int SZ> struct Seg{
T tree[4*SZ];
T merge(T a, T b){
return max(a, b);
}
void update(int v, int l, int r, int i, T x) {
if (i > r || i < l) {
return;
} else if (l == r) {
tree[v] = x;
} else {
int m = (l + r) / 2;
update(2 * v + 1, l, m, i, x);
update(2 * v + 2, m + 1, r, i, x);
tree[v] = merge(tree[2 * v + 1], tree[2 * v + 2]);
}
}
T query2(int v, int l, int r, int ql, int qr) {
if (ql > r || qr < l) {
return 0;
}
if (l >= ql && r <= qr) {
return tree[v];
}
else {
int m = (l + r) / 2;
T a = query2(2 * v + 1, l, m, ql, qr);
T b = query2(2 * v + 2, m + 1, r, ql, qr);
return merge(a, b);
}
}
T query(int v, int l, int r, int val, int dir) {
if (r < l || tree[v] <= val) {
return -1;
}
else if(l == r) {
// cout << "DONE: " << l << "\n";
return l;
}
else {
int m = (l + r) / 2;
// cout << "v, l, r, dir: " << tree[2 * v + 1] << " " << v << " " << l << " " << r << '\n';
if (dir) {
if (tree[2 * v + 2] > val) {
return query(2 * v + 2, m + 1, r, val, dir);
}
else {
return query(2 * v + 1, l, m, val, dir);
}
}
else {
if (tree[2 * v + 1] > val) {
return query(2 * v + 1, l, m, val, dir);
}
else {
return query(2 * v + 2, m + 1, r, val, dir);
}
}
}
}
};
const int MX = 250005;
int pos[MX];
Seg<int, MX> lft, rgt;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n, a; cin >> n >> a;
a--;
vi d(n);
for (int i = 0; i < n; i++) {
cin >> d[i];
pos[d[i]] = i;
if(i < a) lft.update(0, 0, n - 1, i, d[i]);
else if (i > a) rgt.update(0, 0, n - 1, i, d[i]);
}
/*
cout << "vals: " << '\n';
for (int i = 0; i < n; i++) {
cout << vals.query(0, 0, n - 1, i, i) << " ";
}
cout << '\n';
*/
int q; cin >> q;
vector<pi> top;
for (int i = max(1, n - 9); i <= n; i++) {
top.pb(mp(i, pos[i]));
}
vector<pi> order;
while(q--) {
char qt; cin >> qt;
if (qt == 'E') {
int i, e; cin >> i >> e;
i--;
for (int j = 0; j < e - 1; j++) {
if (top.back().s != i) {
int v = top.back().f; int p = top.back().s;
order.pb(mp(v + 1, p));
if(p < a) lft.update(0, 0, n - 1, p, v + 1);
else if(p > a) rgt.update(0, 0, n - 1, p, v + 1);
d[p] = v + 1;
}
else {
j--;
}
top.pop_back();
}
int prev = d[i];
d[i] = top.back().f + 1;
if(i < a) lft.update(0, 0, n - 1, i, top.back().f + 1);
else if(i > a) rgt.update(0, 0, n - 1, i, top.back().f + 1);
order.pb(mp(top.back().f + 1, i));
bool found = false;
while (!top.empty()) {
if(top.back().f != prev) {
order.pb(mp(top.back().f, top.back().s));
}
else {
found = true;
}
top.pop_back();
}
if (!found) order.pop_back();
reverse(all(order));
for (pi x : order) {
top.pb(x);
}
order.clear();
}
else {
int x; cin >> x;
x--;
if (x == a) {
cout << 0 << '\n';
continue;
}
int best = 0;
if (x < a) best = lft.query2(0, 0, n - 1, x, a - 1);
else if (x > a) best = rgt.query2(0, 0, n - 1, a + 1, x);
if (x < a) {
int ans = rgt.query(0, 0, n - 1, best, 0);
if (rgt.query2(0, 0, n - 1, a + 1, n - 1) <= best) {
ans = n;
}
cout << (ans - x - 1) << '\n';
}
else if(x > a) {
int ans = lft.query(0, 0, n - 1, best, 1);
if (lft.query2(0, 0, n - 1, 0, a - 1) <= best) {
ans = -1;
}
cout << (x - ans - 1) << '\n';
}
}
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
1 ms |
384 KB |
Output is correct |
| 3 |
Correct |
1 ms |
384 KB |
Output is correct |
| 4 |
Correct |
4 ms |
384 KB |
Output is correct |
| 5 |
Correct |
11 ms |
640 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
326 ms |
632 KB |
Output is correct |
| 2 |
Correct |
208 ms |
656 KB |
Output is correct |
| 3 |
Correct |
258 ms |
640 KB |
Output is correct |
| 4 |
Correct |
199 ms |
760 KB |
Output is correct |
| 5 |
Correct |
404 ms |
900 KB |
Output is correct |
| 6 |
Correct |
325 ms |
896 KB |
Output is correct |
| 7 |
Correct |
300 ms |
1016 KB |
Output is correct |
| 8 |
Correct |
208 ms |
900 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
95 ms |
2792 KB |
Output is correct |
| 2 |
Correct |
73 ms |
2680 KB |
Output is correct |
| 3 |
Correct |
67 ms |
2680 KB |
Output is correct |
| 4 |
Correct |
1 ms |
384 KB |
Output is correct |
| 5 |
Correct |
147 ms |
5084 KB |
Output is correct |
| 6 |
Correct |
149 ms |
5244 KB |
Output is correct |
| 7 |
Correct |
109 ms |
4984 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
36 ms |
512 KB |
Output is correct |
| 2 |
Correct |
33 ms |
636 KB |
Output is correct |
| 3 |
Correct |
68 ms |
1528 KB |
Output is correct |
| 4 |
Correct |
79 ms |
1528 KB |
Output is correct |
| 5 |
Correct |
101 ms |
760 KB |
Output is correct |
| 6 |
Correct |
118 ms |
1912 KB |
Output is correct |
| 7 |
Correct |
116 ms |
1144 KB |
Output is correct |
| 8 |
Correct |
185 ms |
2296 KB |
Output is correct |
| 9 |
Correct |
608 ms |
6136 KB |
Output is correct |
| 10 |
Correct |
360 ms |
1528 KB |
Output is correct |
| 11 |
Correct |
405 ms |
2256 KB |
Output is correct |
| 12 |
Correct |
662 ms |
5752 KB |
Output is correct |
| 13 |
Correct |
487 ms |
6136 KB |
Output is correct |
