oj.uz

Submission #470246

# Submission time Handle Problem Language Result Execution time Memory
470246 2021-09-03T10:26:55 Z MohamedFaresNebili Cake (CEOI14_cake) C++14
35 / 100
 2000 ms 7236 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
using ll  = long long;
using ld  = long double;
using vl  = vector<long long>;
 
#define pb push_back
#define pp pop_back
#define ff first
#define ss second
#define lb lower_bound
#define ub upper_bound
#define all(x) (x).begin() , (x).end()
 
const ll MOD = 998244353;
const long double EPS = 0.000000001;
const double PI = 3.14159265358979323846;
 
int32_t main()
{
    ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
    ll n, m, q; cin>>n>>m; ll arr[n+2]; arr[0]=INT_MAX, arr[n+1]=INT_MAX;
    for(int l=1;l<=n;l++) cin>>arr[l];
    cin>>q; ll l=m-1, r=m+1, next=m; ll ans[n+2]{0}, res=0;
    while(l>=1||r<=n) {
        if(arr[l]<arr[r]) next=l--;
        else next=r++;
        ans[next]=++res;
    }
    while(q--) {
        char ch; cin>>ch;
        if(ch=='F') {
            ll a; cin>>a;
            cout<<ans[a]<<'\n';
        }
        else if(ch=='E') {
            ll a, b; cin>>a>>b;
            for(int l=1;l<=n;l++) {
                if(l==a) continue;
                if(n-arr[l]+1>=b&&n-arr[l]+1<n-arr[a]+1) arr[l]--;
            }
            arr[a]=n-b+1;
            l=m-1, r=m+1, next=m; ll res=0;
            while(l>=1||r<=n) {
                if(arr[l]<arr[r]) next=l--;
                else next=r++;
                ans[next]=++res;
            }
        }
    }
    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 18 ms 364 KB Output is correct
5 Correct 275 ms 584 KB Output is correct

Subtask #2
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2078 ms 1176 KB Time limit exceeded
2 Execution timed out 2085 ms 1196 KB Time limit exceeded
3 Execution timed out 2075 ms 1064 KB Time limit exceeded
4 Execution timed out 2081 ms 1072 KB Time limit exceeded
5 Execution timed out 2082 ms 1040 KB Time limit exceeded
6 Execution timed out 2086 ms 1172 KB Time limit exceeded
7 Execution timed out 2084 ms 1176 KB Time limit exceeded
8 Execution timed out 2073 ms 1180 KB Time limit exceeded

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 3780 KB Output is correct
2 Correct 56 ms 3600 KB Output is correct
3 Correct 56 ms 3628 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 141 ms 7236 KB Output is correct
6 Correct 139 ms 7228 KB Output is correct
7 Correct 106 ms 7096 KB Output is correct

Subtask #4
0.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 391 ms 880 KB Output is correct
2 Correct 701 ms 892 KB Output is correct
3 Execution timed out 2086 ms 1832 KB Time limit exceeded
4 Execution timed out 2087 ms 1896 KB Time limit exceeded
5 Correct 822 ms 1708 KB Output is correct
6 Execution timed out 2083 ms 2020 KB Time limit exceeded
7 Execution timed out 2093 ms 1524 KB Time limit exceeded
8 Execution timed out 2087 ms 2616 KB Time limit exceeded
9 Execution timed out 2090 ms 6076 KB Time limit exceeded
10 Execution timed out 2080 ms 4284 KB Time limit exceeded
11 Execution timed out 2088 ms 1380 KB Time limit exceeded
12 Execution timed out 2090 ms 4932 KB Time limit exceeded
13 Execution timed out 2078 ms 6088 KB Time limit exceeded