oj.uz

Submission #63011

# Submission time Handle Problem Language Result Execution time Memory
63011 2018-07-31T09:38:06 Z theknife2001 Crayfish scrivener (IOI12_scrivener) C++17
60 / 100
 1000 ms 185772 KB 
#include <bits/stdc++.h>


using namespace std;
const int N=1e6+55;
int trie[N*2][26];
char letter[N];
int p[N][22];
int a[N];
int l[N];
int node;
int cnt=1;
int k=1;

void Init()
{
    node=cnt++;
}

int c,temp,nd;
void TypeLetter(char L)
{
    c=L-'a';
    temp=node;
    if(trie[node][c]==0)
        trie[node][c]=cnt++;
    node=trie[node][c];
    letter[node]=L;
    a[k]=node;
    l[k]=l[k-1]+1;
    if(p[node][0]==0)
    {
        p[node][0]=temp;
        for(int i=1;i<21;i++)
        {
            p[node][i]=p[p[node][i-1]][i-1];
            if(p[node][i]==0)
                break;
        }
    }
    k++;
}

void UndoCommands(int U)
{
    node=a[k-U-1];
    l[k]=l[k-U-1];
    a[k]=node;
    k++;
}
char GetLetter(int P)
{
    P=l[k-1]-P-1;
    nd=node;
    for(int i=20;i>=0;i--)
    {
        if((P&(1<<i)))
            nd=p[nd][i];
    }
    return letter[nd];
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 636 KB Output is correct
2 Correct 2 ms 636 KB Output is correct
3 Correct 5 ms 636 KB Output is correct
4 Correct 3 ms 636 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 3 ms 680 KB Output is correct
7 Correct 2 ms 684 KB Output is correct
8 Correct 3 ms 688 KB Output is correct
9 Correct 3 ms 692 KB Output is correct
10 Correct 3 ms 696 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 956 KB Output is correct
2 Correct 5 ms 968 KB Output is correct
3 Correct 6 ms 1128 KB Output is correct
4 Correct 7 ms 1400 KB Output is correct
5 Correct 5 ms 1400 KB Output is correct
6 Correct 7 ms 1584 KB Output is correct
7 Correct 5 ms 1584 KB Output is correct
8 Correct 4 ms 1584 KB Output is correct
9 Correct 5 ms 1584 KB Output is correct
10 Correct 6 ms 1584 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 980 ms 119024 KB Output is correct
2 Correct 980 ms 134552 KB Output is correct
3 Correct 635 ms 135932 KB Output is correct
4 Correct 530 ms 135932 KB Output is correct
5 Correct 639 ms 135932 KB Output is correct
6 Correct 560 ms 164592 KB Output is correct
7 Correct 632 ms 164592 KB Output is correct
8 Correct 738 ms 164592 KB Output is correct
9 Correct 962 ms 183068 KB Output is correct
10 Correct 321 ms 183068 KB Output is correct

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 871 ms 183068 KB Output is correct
2 Correct 957 ms 183068 KB Output is correct
3 Correct 710 ms 183068 KB Output is correct
4 Correct 482 ms 183068 KB Output is correct
5 Correct 599 ms 183068 KB Output is correct
6 Correct 583 ms 183068 KB Output is correct
7 Correct 657 ms 185772 KB Output is correct
8 Correct 771 ms 185772 KB Output is correct
9 Execution timed out 1088 ms 185772 KB Time limit exceeded
10 Halted 0 ms 0 KB -