oj.uz

Submission #63337

# Submission time Handle Problem Language Result Execution time Memory
63337 2018-08-01T13:35:15 Z Vahan Crayfish scrivener (IOI12_scrivener) C++17
34 / 100
 1000 ms 105884 KB 
#include<cmath>
char last;

void Init() {}
int t=-1,er[2000000],a[1000005][23];
char v[2000000];
void TypeLetter(char L)
{
    t++;
    if(t==0)
        er[t]=1;
    else
        er[t]=er[t-1]+1;
    v[t]=L;
    for(int i=0;i<log2(er[t]);i++)
    {
        if(i==0)
            a[t][0]=t-1;
        else
            a[t][i]=a[a[t][i-1]][i-1];
    }
}

void UndoCommands(int U)
{
    t++;
    er[t]=er[t-U-1];
    v[t]=v[t-U-1];
    for(int i=0;i<log2(er[t]);i++)
        a[t][i]=a[t-U-1][i];
}

char GetLetter(int P)
{
    int p=er[t]-P-1;
    int e=t;
    while(p!=0)
    {
        e=a[e][int(log2(p))];
        p-=pow(2,int(log2(p)));
    }
    return v[e];
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 360 KB Output is correct
3 Correct 2 ms 568 KB Output is correct
4 Correct 2 ms 568 KB Output is correct
5 Correct 3 ms 568 KB Output is correct
6 Correct 3 ms 612 KB Output is correct
7 Correct 2 ms 640 KB Output is correct
8 Correct 2 ms 644 KB Output is correct
9 Correct 2 ms 656 KB Output is correct
10 Correct 3 ms 656 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 656 KB Output is correct
2 Correct 2 ms 656 KB Output is correct
3 Correct 2 ms 656 KB Output is correct
4 Correct 2 ms 672 KB Output is correct
5 Correct 2 ms 676 KB Output is correct
6 Correct 2 ms 696 KB Output is correct
7 Correct 2 ms 700 KB Output is correct
8 Correct 2 ms 708 KB Output is correct
9 Correct 2 ms 712 KB Output is correct
10 Correct 3 ms 712 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 844 KB Output is correct
2 Correct 4 ms 1060 KB Output is correct
3 Correct 4 ms 1128 KB Output is correct
4 Correct 4 ms 1240 KB Output is correct
5 Correct 4 ms 1240 KB Output is correct
6 Correct 4 ms 1240 KB Output is correct
7 Correct 4 ms 1240 KB Output is correct
8 Correct 4 ms 1240 KB Output is correct
9 Correct 5 ms 1304 KB Output is correct
10 Correct 4 ms 1456 KB Output is correct

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 864 ms 72620 KB Output is correct
2 Correct 985 ms 91560 KB Output is correct
3 Correct 709 ms 95760 KB Output is correct
4 Correct 811 ms 105884 KB Output is correct
5 Execution timed out 1018 ms 105884 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

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