oj.uz

Submission #62915

# Submission time Handle Problem Language Result Execution time Memory
62915 2018-07-30T20:16:26 Z theknife2001 Crayfish scrivener (IOI12_scrivener) C++17
34 / 100
 958 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);
}


void TypeLetter(char L)
{
    int c=L-'a';
    int 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;
    p[node][0]=temp;
    for(int i=1;i<=21;i++)
        p[node][i]=p[p[node][i-1]][i-1];
//    cout<<node<<' '<<l[k]<<' '<<L<<endl;
    k++;
}

void UndoCommands(int U)
{
    node=a[k-U-1];
    l[k]=l[k-U-1];
    a[k]=node;
//    cout<<a[k]<<' '<<l[k]<<endl;
    k++;
}
char GetLetter(int P)
{
    P=l[k-1]-P-1;
//    cout<<P<<endl;
    int nd=node;
    for(int i=21;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 176 ms 203984 KB Output is correct
2 Correct 171 ms 204012 KB Output is correct
3 Correct 179 ms 204012 KB Output is correct
4 Correct 191 ms 204100 KB Output is correct
5 Correct 160 ms 204100 KB Output is correct
6 Correct 154 ms 204100 KB Output is correct
7 Correct 149 ms 204204 KB Output is correct
8 Correct 172 ms 204204 KB Output is correct
9 Correct 154 ms 204212 KB Output is correct
10 Correct 154 ms 204232 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 204232 KB Output is correct
2 Correct 153 ms 204276 KB Output is correct
3 Correct 149 ms 204336 KB Output is correct
4 Correct 174 ms 204388 KB Output is correct
5 Correct 173 ms 204428 KB Output is correct
6 Correct 169 ms 204428 KB Output is correct
7 Correct 170 ms 204428 KB Output is correct
8 Correct 171 ms 204428 KB Output is correct
9 Correct 170 ms 204532 KB Output is correct
10 Correct 165 ms 204540 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 204540 KB Output is correct
2 Correct 170 ms 204732 KB Output is correct
3 Correct 188 ms 204816 KB Output is correct
4 Correct 177 ms 204816 KB Output is correct
5 Correct 175 ms 204816 KB Output is correct
6 Correct 154 ms 204940 KB Output is correct
7 Correct 164 ms 205084 KB Output is correct
8 Correct 156 ms 205112 KB Output is correct
9 Correct 163 ms 205112 KB Output is correct
10 Correct 159 ms 205112 KB Output is correct

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Runtime error 922 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 -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 958 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 -