oj.uz

Submission #676567

# Submission time Handle Problem Language Result Execution time Memory
676567 2022-12-31T09:52:34 Z vjudge1 Cake (CEOI14_cake) C++17
0 / 100
 2000 ms 9476 KB 
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define endl "\n"
const int mod = (int) 1e9+7;
const int N=2e5+5;

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n,a; cin>>n>>a;
    int d[n+5],opd[n+5];
    for (int i=1;i<=n;i++) {
      cin>>d[i];
      opd[d[i]]=i;
    }

    int when[n+5];
    when[a]=0;
    int l=a-1,r=a+1,time=1;
    while (l>=1 || r<=n) {
      if (l>=1  && ((r>n) || (r<=n && d[l]<d[r]))) {
        when[l]=time; time++; l--;
      }
      if (r<=n && ((l<1) || (l>=1 && d[r]<d[l]))) {
        when[r]=time; time++; r++;
      }
    }

    int q; cin>>q;
    while (q--) {
      char c; cin>>c;
      if (c=='F') {
        int x; cin>>x;
        cout<<when[x]<<endl;
      }
      else {
        int x,nw; cin>>x>>nw;
        nw=n-(nw-1);
        for (int i=min(d[x],nw);i<max(d[x],nw);i++) {
          if (nw>d[x]) d[opd[i]]--;
          else d[opd[i]]++;
          opd[d[opd[i]]]=opd[i];
        }
        d[x]=nw;
        opd[d[x]]=x;

        //for (int i=1;i<=n;i++) cout<<d[i]<<' '; cout<<endl;

        int l=a-1,r=a+1,time=1;
        while (l>=1 || r<=n) {
          if (l>=1  && ((r>n) || (r<=n && d[l]<d[r]))) {
            when[l]=time; time++; l--;
          }
          if (r<=n && ((l<1) || (l>=1 && d[r]<d[l]))) {
            when[r]=time; time++; r++;
          }
        }
      }
    }
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2029 ms 212 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2068 ms 468 KB Time limit exceeded
2 Execution timed out 2075 ms 468 KB Time limit exceeded
3 Execution timed out 2075 ms 468 KB Time limit exceeded
4 Execution timed out 2044 ms 468 KB Time limit exceeded
5 Execution timed out 2067 ms 852 KB Time limit exceeded
6 Execution timed out 2093 ms 852 KB Time limit exceeded
7 Execution timed out 2067 ms 852 KB Time limit exceeded
8 Execution timed out 2074 ms 852 KB Time limit exceeded

Subtask #3
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2047 ms 2636 KB Time limit exceeded
2 Execution timed out 2052 ms 2644 KB Time limit exceeded
3 Execution timed out 2083 ms 2644 KB Time limit exceeded
4 Execution timed out 2071 ms 212 KB Time limit exceeded
5 Execution timed out 2079 ms 9476 KB Time limit exceeded
6 Execution timed out 2069 ms 6152 KB Time limit exceeded
7 Execution timed out 2031 ms 6148 KB Time limit exceeded

Subtask #4
0.0 / 50.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2090 ms 340 KB Time limit exceeded
2 Execution timed out 2089 ms 340 KB Time limit exceeded
3 Execution timed out 2085 ms 1500 KB Time limit exceeded
4 Execution timed out 2085 ms 1364 KB Time limit exceeded
5 Execution timed out 2037 ms 340 KB Time limit exceeded
6 Execution timed out 2093 ms 2900 KB Time limit exceeded
7 Execution timed out 2094 ms 468 KB Time limit exceeded
8 Execution timed out 2087 ms 2668 KB Time limit exceeded
9 Execution timed out 2087 ms 6092 KB Time limit exceeded
10 Execution timed out 2085 ms 340 KB Time limit exceeded
11 Execution timed out 2081 ms 724 KB Time limit exceeded
12 Execution timed out 2078 ms 4948 KB Time limit exceeded
13 Execution timed out 2029 ms 6100 KB Time limit exceeded