oj.uz

Submission #470065

# Submission time Handle Problem Language Result Execution time Memory
470065 2021-09-02T20:09:24 Z MohamedFaresNebili Cake (CEOI14_cake) C++14
35 / 100
 2000 ms 4816 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 0 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 15 ms 204 KB Output is correct
5 Correct 271 ms 572 KB Output is correct

Subtask #2
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2083 ms 332 KB Time limit exceeded
2 Execution timed out 2090 ms 460 KB Time limit exceeded
3 Execution timed out 2088 ms 460 KB Time limit exceeded
4 Execution timed out 2081 ms 332 KB Time limit exceeded
5 Execution timed out 2081 ms 588 KB Time limit exceeded
6 Execution timed out 2098 ms 588 KB Time limit exceeded
7 Execution timed out 2072 ms 588 KB Time limit exceeded
8 Execution timed out 2099 ms 588 KB Time limit exceeded

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 2372 KB Output is correct
2 Correct 55 ms 2324 KB Output is correct
3 Correct 54 ms 2256 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 141 ms 4812 KB Output is correct
6 Correct 141 ms 4816 KB Output is correct
7 Correct 107 ms 4560 KB Output is correct

Subtask #4
0.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 421 ms 448 KB Output is correct
2 Correct 693 ms 532 KB Output is correct
3 Execution timed out 2078 ms 1236 KB Time limit exceeded
4 Execution timed out 2092 ms 1224 KB Time limit exceeded
5 Correct 848 ms 580 KB Output is correct
6 Execution timed out 2082 ms 1360 KB Time limit exceeded
7 Execution timed out 2088 ms 740 KB Time limit exceeded
8 Execution timed out 2097 ms 1868 KB Time limit exceeded
9 Execution timed out 2088 ms 4360 KB Time limit exceeded
10 Execution timed out 2099 ms 1092 KB Time limit exceeded
11 Execution timed out 2082 ms 784 KB Time limit exceeded
12 Execution timed out 2079 ms 3456 KB Time limit exceeded
13 Execution timed out 2089 ms 4376 KB Time limit exceeded