| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 116993 |
2019-06-14T11:28:09 Z |
JohnTitor |
Cake (CEOI14_cake) |
C++11 |
|
2000 ms |
25464 KB |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for(int i=(j); i<=(k); i++)
#define FFOR(i, j, k) for(int i=(j); i<(k); i++)
#define DFOR(i, j, k) for(int i=(j); i>=(k); i--)
#define bug(x) cerr<<#x<<" = "<<(x)<<'\n'
#define pb push_back
#define mp make_pair
#define bit(s, i) (((s)>>(i))&1LL)
#define mask(i) ((1LL<<(i)))
#define builtin_popcount __builtin_popcountll
#define __builtin_popcount __builtin_popcountll
using ll=long long; using ld=long double;
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); const ld pi=acos(0)*2;
template <typename T> inline void read(T &x){char c; bool nega=0; while((!isdigit(c=getchar()))&&(c!='-')); if(c=='-'){nega=1; c=getchar();} x=c-48; while(isdigit(c=getchar())) x=x*10+c-48; if(nega) x=-x;}
template <typename T> inline void writep(T x){if(x>9) writep(x/10); putchar(x%10+48);}
template <typename T> inline void write(T x){if(x<0){ putchar('-'); x=-x;} writep(x);}
template <typename T> inline void writeln(T x){write(x); putchar('\n');}
#define taskname "Cake"
int n, a;
int d[250001];
vector <int> highest;
class segment_tree{
public:
using pointer=segment_tree*;
pointer left, right;
int l, r, m;
int b;
segment_tree(int l, int r){
this->l=l;
this->r=r;
m=(l+r)/2;
if(l==r) b=l;
else{
left=new segment_tree(l, m);
right=new segment_tree(m+1, r);
if(d[left->b]>d[right->b]) b=left->b;
else b=right->b;
}
}
int get_max(int u, int v){
if(l>v||r<u) return 0;
if(u<=l&&v>=r) return d[b];
else return max(left->get_max(u, v), right->get_max(u, v));
}
int find_last_from_left(int maxd){
if(l==r) return (d[l]<=maxd)?l:(l-1);
if(d[left->b]>maxd) return left->find_last_from_left(maxd);
else return right->find_last_from_left(maxd);
}
int find_last_from_right(int maxd){
if(l==r) return (d[r]<=maxd)?r:(r+1);
if(d[right->b]>maxd) return right->find_last_from_right(maxd);
else return left->find_last_from_right(maxd);
}
void update(int u){
if(l==r) return;
else{
if(m>=u) left->update(u);
else right->update(u);
if(d[left->b]>d[right->b]) b=left->b;
else b=right->b;
}
}
};
segment_tree::pointer tl, tr;
int main(){
#ifdef Aria
if(fopen(taskname".in", "r"))
freopen(taskname".in", "r", stdin);
#endif // Aria
read(n);
read(a);
FOR(i, 1, n){
read(d[i]);
if(d[i]>n-10) highest.pb(i);
}
sort(highest.begin(), highest.end(), [](int a, int b){
return d[a]>d[b];
});
if(a!=1&&a!=n){
tl=new segment_tree(1, a-1);
tr=new segment_tree(a+1, n);
}
{
int q;
char c;
int i, e;
read(q);
while(q--){
while(!isalpha(c=getchar()));
if(c=='F'){
read(i);
if(i==a) writeln(0);
else if(a==1||a==n) writeln(abs(a-i));
else if(i>a) writeln(i-tl->find_last_from_right(tr->get_max(a+1, i)));
else writeln(tr->find_last_from_left(tl->get_max(i, a-1))-i);
}
else{
read(i);
read(e);
if(a==1||a==n) continue;
for(auto &x: highest) if(x==i){
swap(x, highest.back());
highest.pop_back();
break;
}
highest.pb(i);
FFOR(j, 1, e) d[highest[j-1]]++;
d[i]=d[highest[e-1]]+1;
sort(highest.begin(), highest.end(), [](int a, int b){
return d[a]>d[b];
});
if(i>a) tr->update(i);
if(i<a) tl->update(i);
// FOR(i, 1, n) cerr<<d[i]<<" \n"[i==n];
}
}
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
256 KB |
Output is correct |
| 2 |
Correct |
2 ms |
384 KB |
Output is correct |
| 3 |
Correct |
2 ms |
384 KB |
Output is correct |
| 4 |
Correct |
92 ms |
512 KB |
Output is correct |
| 5 |
Correct |
822 ms |
1744 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2031 ms |
1428 KB |
Time limit exceeded |
| 2 |
Execution timed out |
2060 ms |
1364 KB |
Time limit exceeded |
| 3 |
Execution timed out |
2019 ms |
1404 KB |
Time limit exceeded |
| 4 |
Correct |
94 ms |
1280 KB |
Output is correct |
| 5 |
Execution timed out |
2029 ms |
3180 KB |
Time limit exceeded |
| 6 |
Execution timed out |
2048 ms |
2964 KB |
Time limit exceeded |
| 7 |
Execution timed out |
2044 ms |
3072 KB |
Time limit exceeded |
| 8 |
Correct |
88 ms |
2816 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
94 ms |
10716 KB |
Output is correct |
| 2 |
Correct |
66 ms |
10588 KB |
Output is correct |
| 3 |
Correct |
47 ms |
10488 KB |
Output is correct |
| 4 |
Correct |
2 ms |
384 KB |
Output is correct |
| 5 |
Correct |
133 ms |
25464 KB |
Output is correct |
| 6 |
Correct |
115 ms |
25464 KB |
Output is correct |
| 7 |
Correct |
71 ms |
25208 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2045 ms |
936 KB |
Time limit exceeded |
| 2 |
Execution timed out |
2041 ms |
1284 KB |
Time limit exceeded |
| 3 |
Execution timed out |
2045 ms |
5504 KB |
Time limit exceeded |
| 4 |
Execution timed out |
2084 ms |
5548 KB |
Time limit exceeded |
| 5 |
Execution timed out |
2045 ms |
888 KB |
Time limit exceeded |
| 6 |
Execution timed out |
2036 ms |
7160 KB |
Time limit exceeded |
| 7 |
Execution timed out |
2055 ms |
1540 KB |
Time limit exceeded |
| 8 |
Execution timed out |
2035 ms |
10360 KB |
Time limit exceeded |
| 9 |
Execution timed out |
2045 ms |
25208 KB |
Time limit exceeded |
| 10 |
Execution timed out |
2029 ms |
900 KB |
Time limit exceeded |
| 11 |
Execution timed out |
2044 ms |
2596 KB |
Time limit exceeded |
| 12 |
Execution timed out |
2051 ms |
20120 KB |
Time limit exceeded |
| 13 |
Execution timed out |
2048 ms |
25316 KB |
Time limit exceeded |
