# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
98738 | 2019-02-25T13:47:38 Z | Alexa2001 | Crayfish scrivener (IOI12_scrivener) | C++17 | 1000 ms | 94504 KB |
#include <bits/stdc++.h> using namespace std; const int Nmax = 1e6 + 5, lg = 20; int nodes, t[lg+2][Nmax], up[Nmax], frst_up[Nmax]; char letter[Nmax]; void Init() { } void TypeLetter(char L) { letter[++nodes] = L; t[0][nodes] = frst_up[nodes - 1]; up[nodes] = up[nodes - 1] + 1; frst_up[nodes] = nodes; int i; for(i=1; i<=lg; ++i) t[i][nodes] = t[i-1][t[i-1][nodes]]; } void UndoCommands(int U) { int cursor = nodes - U, i; t[0][nodes + 1] = cursor; up[++nodes] = up[cursor]; frst_up[nodes] = frst_up[cursor]; } char GetLetter(int P) { int i, x = frst_up[nodes]; ++P; for(i=lg; i>=0; --i) if(up[t[i][x]] >= P) x = t[i][x]; return letter[x]; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 512 KB | Output is correct |
2 | Correct | 3 ms | 512 KB | Output is correct |
3 | Correct | 2 ms | 512 KB | Output is correct |
4 | Correct | 3 ms | 512 KB | Output is correct |
5 | Correct | 3 ms | 512 KB | Output is correct |
6 | Correct | 3 ms | 512 KB | Output is correct |
7 | Correct | 3 ms | 512 KB | Output is correct |
8 | Correct | 2 ms | 512 KB | Output is correct |
9 | Correct | 3 ms | 512 KB | Output is correct |
10 | Correct | 2 ms | 512 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 512 KB | Output is correct |
2 | Correct | 3 ms | 512 KB | Output is correct |
3 | Correct | 3 ms | 512 KB | Output is correct |
4 | Correct | 2 ms | 512 KB | Output is correct |
5 | Correct | 2 ms | 512 KB | Output is correct |
6 | Correct | 3 ms | 512 KB | Output is correct |
7 | Correct | 3 ms | 512 KB | Output is correct |
8 | Correct | 2 ms | 512 KB | Output is correct |
9 | Correct | 3 ms | 512 KB | Output is correct |
10 | Correct | 2 ms | 512 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 640 KB | Output is correct |
2 | Correct | 4 ms | 768 KB | Output is correct |
3 | Correct | 5 ms | 896 KB | Output is correct |
4 | Correct | 4 ms | 896 KB | Output is correct |
5 | Correct | 5 ms | 896 KB | Output is correct |
6 | Correct | 4 ms | 896 KB | Output is correct |
7 | Correct | 4 ms | 972 KB | Output is correct |
8 | Correct | 4 ms | 896 KB | Output is correct |
9 | Correct | 4 ms | 896 KB | Output is correct |
10 | Correct | 3 ms | 896 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 505 ms | 65708 KB | Output is correct |
2 | Correct | 498 ms | 79956 KB | Output is correct |
3 | Correct | 419 ms | 79480 KB | Output is correct |
4 | Correct | 449 ms | 83316 KB | Output is correct |
5 | Correct | 754 ms | 73592 KB | Output is correct |
6 | Correct | 446 ms | 86856 KB | Output is correct |
7 | Correct | 798 ms | 75548 KB | Output is correct |
8 | Correct | 571 ms | 89100 KB | Output is correct |
9 | Correct | 616 ms | 85112 KB | Output is correct |
10 | Correct | 291 ms | 94504 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1054 ms | 60300 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |