oj.uz

Submission #202082

# Submission time Handle Problem Language Result Execution time Memory
202082 2020-02-13T15:28:39 Z DavidDamian Crayfish scrivener (IOI12_scrivener) C++11
34 / 100
 1000 ms 11512 KB 
#include<bits/stdc++.h>
using namespace std;
int node[1000006];
int NEXT_FREE_INDEX=1;
int n=1;
int id[1000006];
char letter[1000006];
int p[1000006];
int len;
void Init() {
    len=-1;
    id[0]=-1;
}
void TypeLetter(char L) {
    node[n]=NEXT_FREE_INDEX;
    id[NEXT_FREE_INDEX]=id[ node[n-1] ]+1;
    letter[NEXT_FREE_INDEX]=L;
    p[NEXT_FREE_INDEX]=node[n-1];
    NEXT_FREE_INDEX++;
    n++;
}
void UndoCommands(int U) {
    node[n]=node[n-U-1];
    n++;
}
char GetLetter(int P) {
    int k=node[n-1];
    while(id[k]>P){
        k=p[k];
    }
    return letter[k];
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
22.0 / 22.0

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

Subtask #4
0 / 26.0

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

Subtask #5
0 / 40.0

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