oj.uz

Submission #62917

# Submission time Handle Problem Language Result Execution time Memory
62917 2018-07-30T20:23:17 Z theknife2001 Crayfish scrivener (IOI12_scrivener) C++17
34 / 100
 938 ms 263168 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;

void Init()
{
    node=cnt++;
    memset(trie,-1,sizeof trie);
}

int c,temp,nd;
void TypeLetter(char L)
{
    c=L-'a';
    temp=node;
    if(trie[node][c]==-1)
        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];
    }
    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 164 ms 204028 KB Output is correct
2 Correct 154 ms 204028 KB Output is correct
3 Correct 155 ms 204028 KB Output is correct
4 Correct 179 ms 204148 KB Output is correct
5 Correct 185 ms 204148 KB Output is correct
6 Correct 188 ms 204148 KB Output is correct
7 Correct 158 ms 204148 KB Output is correct
8 Correct 159 ms 204148 KB Output is correct
9 Correct 163 ms 204148 KB Output is correct
10 Correct 199 ms 204184 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 152 ms 204184 KB Output is correct
2 Correct 165 ms 204184 KB Output is correct
3 Correct 174 ms 204256 KB Output is correct
4 Correct 163 ms 204256 KB Output is correct
5 Correct 170 ms 204256 KB Output is correct
6 Correct 154 ms 204256 KB Output is correct
7 Correct 173 ms 204256 KB Output is correct
8 Correct 186 ms 204360 KB Output is correct
9 Correct 172 ms 204360 KB Output is correct
10 Correct 172 ms 204360 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 164 ms 204384 KB Output is correct
2 Correct 187 ms 204384 KB Output is correct
3 Correct 155 ms 204516 KB Output is correct
4 Correct 166 ms 204672 KB Output is correct
5 Correct 184 ms 204672 KB Output is correct
6 Correct 187 ms 204720 KB Output is correct
7 Correct 201 ms 204816 KB Output is correct
8 Correct 173 ms 204816 KB Output is correct
9 Correct 164 ms 204816 KB Output is correct
10 Correct 175 ms 204816 KB Output is correct

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 932 ms 261216 KB Output is correct
2 Runtime error 938 ms 263168 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
3 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 921 ms 263168 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2 Halted 0 ms 0 KB -