oj.uz

Submission #202085

# Submission time Handle Problem Language Result Execution time Memory
202085 2020-02-13T16:53:17 Z DavidDamian Crayfish scrivener (IOI12_scrivener) C++11
100 / 100
 536 ms 65784 KB 
#include<bits/stdc++.h>
using namespace std;
int node[1000006];
int NEXT_FREE_INDEX=1;
int n=1;
int lv[1000006];
char letter[1000006];
int ancestor[21][1000006];
int len;
int cont=0;
void Init() {
    len=-1;
    lv[0]=-1;
}
void TypeLetter(char L) {
    int u=NEXT_FREE_INDEX++; //Last created node
    node[n]=u;
    lv[u]=lv[ node[n-1] ]+1;
    letter[u]=L;
    ancestor[0][u]=node[n-1];
    for(int i=1;i<=20;i++){
        ancestor[i][u]=ancestor[i-1][ ancestor[i-1][u] ];
    }
    n++;
}
void UndoCommands(int U) {
    node[n]=node[n-U-1];
    n++;
}
char GetLetter(int P) {
    int u=node[n-1];
    int d=lv[u]-P;
    for(int i=20;i>=0;i--){
        if(d & (1<<i)){
            u=ancestor[i][u];
        }
    }
    return letter[u];
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 508 KB Output is correct
5 Correct 6 ms 504 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 504 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 508 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 504 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 632 KB Output is correct
2 Correct 6 ms 632 KB Output is correct
3 Correct 6 ms 760 KB Output is correct
4 Correct 6 ms 760 KB Output is correct
5 Correct 6 ms 632 KB Output is correct
6 Correct 6 ms 888 KB Output is correct
7 Correct 6 ms 888 KB Output is correct
8 Correct 6 ms 760 KB Output is correct
9 Correct 6 ms 760 KB Output is correct
10 Correct 6 ms 632 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 316 ms 54264 KB Output is correct
2 Correct 329 ms 59748 KB Output is correct
3 Correct 314 ms 58488 KB Output is correct
4 Correct 366 ms 46584 KB Output is correct
5 Correct 368 ms 51248 KB Output is correct
6 Correct 270 ms 64632 KB Output is correct
7 Correct 358 ms 31608 KB Output is correct
8 Correct 318 ms 47676 KB Output is correct
9 Correct 352 ms 65784 KB Output is correct
10 Correct 239 ms 48436 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 453 ms 46456 KB Output is correct
2 Correct 536 ms 45956 KB Output is correct
3 Correct 334 ms 50040 KB Output is correct
4 Correct 361 ms 39928 KB Output is correct
5 Correct 282 ms 53624 KB Output is correct
6 Correct 309 ms 50812 KB Output is correct
7 Correct 303 ms 53752 KB Output is correct
8 Correct 432 ms 29304 KB Output is correct
9 Correct 488 ms 47352 KB Output is correct
10 Correct 231 ms 51832 KB Output is correct