oj.uz

답안 #63342

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
63342 2018-08-01T13:51:51 Z Vahan 크레이피쉬 글쓰는 기계 (IOI12_scrivener) C++17
100 / 100
 925 ms 118308 KB 
#include<cmath>
char last;

void Init() {}
int t=-1,er[2000000],a[1000005][23],x[25];
char v[2000000];
void TypeLetter(char L)
{
    if(x[0]==0)
    {
        x[0]=1;
        for(int i=1;i<=20;i++)
            x[i]=x[i-1]*2;
    }
    t++;
    if(t==0)
        er[t]=1;
    else
        er[t]=er[t-1]+1;
    v[t]=L;
    for(int i=0;x[i]<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;x[i]<er[t];i++)
        a[t][i]=a[t-U-1][i];
}

char GetLetter(int P)
{
    int p=er[t]-P-1;
    int e=t,b[25];
    int r=-1;
    while(p!=0)
    {
        r++;
        if(p%2==0)
            b[r]=0;
        else
            b[r]=1;
        p/=2;
    }
    for(int i=r;i>=0;i--)
        if(b[i]==1)
            e=a[e][i];
    return v[e];
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 564 KB Output is correct
6 Correct 2 ms 564 KB Output is correct
7 Correct 2 ms 564 KB Output is correct
8 Correct 2 ms 564 KB Output is correct
9 Correct 2 ms 564 KB Output is correct
10 Correct 2 ms 564 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 3 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 620 KB Output is correct
5 Correct 2 ms 620 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 620 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 764 KB Output is correct
2 Correct 3 ms 892 KB Output is correct
3 Correct 5 ms 1024 KB Output is correct
4 Correct 4 ms 1024 KB Output is correct
5 Correct 6 ms 1024 KB Output is correct
6 Correct 4 ms 1024 KB Output is correct
7 Correct 3 ms 1024 KB Output is correct
8 Correct 3 ms 1024 KB Output is correct
9 Correct 4 ms 1024 KB Output is correct
10 Correct 3 ms 1024 KB Output is correct

Subtask #4
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 508 ms 68476 KB Output is correct
2 Correct 632 ms 83776 KB Output is correct
3 Correct 548 ms 83776 KB Output is correct
4 Correct 572 ms 87032 KB Output is correct
5 Correct 652 ms 87032 KB Output is correct
6 Correct 611 ms 95020 KB Output is correct
7 Correct 745 ms 95020 KB Output is correct
8 Correct 692 ms 102816 KB Output is correct
9 Correct 874 ms 103852 KB Output is correct
10 Correct 250 ms 115668 KB Output is correct

Subtask #5
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 787 ms 115668 KB Output is correct
2 Correct 925 ms 115668 KB Output is correct
3 Correct 429 ms 115668 KB Output is correct
4 Correct 548 ms 115668 KB Output is correct
5 Correct 561 ms 115668 KB Output is correct
6 Correct 568 ms 115668 KB Output is correct
7 Correct 593 ms 115668 KB Output is correct
8 Correct 795 ms 115668 KB Output is correct
9 Correct 853 ms 115668 KB Output is correct
10 Correct 251 ms 118308 KB Output is correct