oj.uz

Submission #702352

# Submission time Handle Problem Language Result Execution time Memory
702352 2023-02-23T16:08:15 Z Ronin13 Crayfish scrivener (IOI12_scrivener) C++14
100 / 100
 433 ms 67180 KB 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>

using namespace std;

int cnt = 1;
const int nmax = 1000001;
int a[nmax][20];
char c[nmax];
int depth[nmax];
int last[nmax];
int cur = 0;

void Init() {

}

void TypeLetter(char L) {
    a[cnt][0] = last[cur];
    depth[cnt] = depth[last[cur]] + 1;
    for(int j = 1; j < 20; j++)
        a[cnt][j] = a[a[cnt][j - 1]][j - 1];
    last[cur + 1] = cnt;
    c[cnt] = L;
    cnt++;
    cur++;
}

void UndoCommands(int U) {
    cur++;
    last[cur] = last[cur - U - 1];
   // cout << depth[last[cur]];
}

char GetLetter(int P) {
    int x = depth[last[cur]];
   // cout << x << ' ';
    int o = x - P - 1;
    int cc = last[cur];
    while(o){
        int t = log2(o);
        cc = a[cc][t];
        o -= (1 << t);
    }
    return c[cc];
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 320 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 320 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 472 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 2 ms 520 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 468 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 321 ms 51460 KB Output is correct
2 Correct 328 ms 60928 KB Output is correct
3 Correct 304 ms 60388 KB Output is correct
4 Correct 314 ms 50528 KB Output is correct
5 Correct 314 ms 53252 KB Output is correct
6 Correct 248 ms 65756 KB Output is correct
7 Correct 290 ms 35772 KB Output is correct
8 Correct 271 ms 50604 KB Output is correct
9 Correct 356 ms 67180 KB Output is correct
10 Correct 206 ms 50024 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 375 ms 43964 KB Output is correct
2 Correct 433 ms 44008 KB Output is correct
3 Correct 301 ms 48100 KB Output is correct
4 Correct 335 ms 38272 KB Output is correct
5 Correct 244 ms 51416 KB Output is correct
6 Correct 269 ms 48472 KB Output is correct
7 Correct 286 ms 51472 KB Output is correct
8 Correct 385 ms 28256 KB Output is correct
9 Correct 403 ms 45420 KB Output is correct
10 Correct 242 ms 49740 KB Output is correct