oj.uz

Submission #470064

# Submission time Handle Problem Language Result Execution time Memory
470064 2021-09-02T20:07:41 Z MohamedFaresNebili Cake (CEOI14_cake) C++14
15 / 100
 2000 ms 4372 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; vector<bool> edge(n+2, false); edge[m]=true;
    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 17 ms 332 KB Output is correct
5 Correct 322 ms 464 KB Output is correct

Subtask #2
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2090 ms 332 KB Time limit exceeded
2 Execution timed out 2093 ms 332 KB Time limit exceeded
3 Execution timed out 2095 ms 460 KB Time limit exceeded
4 Execution timed out 2098 ms 460 KB Time limit exceeded
5 Execution timed out 2095 ms 588 KB Time limit exceeded
6 Execution timed out 2079 ms 588 KB Time limit exceeded
7 Execution timed out 2087 ms 588 KB Time limit exceeded
8 Execution timed out 2087 ms 588 KB Time limit exceeded

Subtask #3
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2061 ms 2144 KB Time limit exceeded
2 Execution timed out 2081 ms 1896 KB Time limit exceeded
3 Execution timed out 2086 ms 2024 KB Time limit exceeded
4 Correct 1 ms 204 KB Output is correct
5 Execution timed out 2095 ms 4236 KB Time limit exceeded
6 Execution timed out 2095 ms 4360 KB Time limit exceeded
7 Execution timed out 2083 ms 4372 KB Time limit exceeded

Subtask #4
0.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 471 ms 436 KB Output is correct
2 Correct 754 ms 540 KB Output is correct
3 Execution timed out 2099 ms 1096 KB Time limit exceeded
4 Execution timed out 2089 ms 1132 KB Time limit exceeded
5 Correct 947 ms 644 KB Output is correct
6 Execution timed out 2098 ms 1348 KB Time limit exceeded
7 Execution timed out 2087 ms 628 KB Time limit exceeded
8 Execution timed out 2086 ms 1868 KB Time limit exceeded
9 Execution timed out 2098 ms 4292 KB Time limit exceeded
10 Execution timed out 2093 ms 1092 KB Time limit exceeded
11 Execution timed out 2087 ms 808 KB Time limit exceeded
12 Execution timed out 2051 ms 3444 KB Time limit exceeded
13 Execution timed out 2098 ms 4232 KB Time limit exceeded