oj.uz

Submission #8087

# Submission time Handle Problem Language Result Execution time Memory
8087 2014-08-28T14:14:51 Z dohyun0324 Crayfish scrivener (IOI12_scrivener) C++
100 / 100
 540 ms 111432 KB 
char last;
int p[1000010][25],a[1000010],pos[1000010],n,len[1000010];
char str[1000010];
void Init() {}

void TypeLetter(char L)
{
    int i;
    n++;
    p[n][0]=pos[n-1];
    for(i=1;i<=20;i++)
    {
        p[n][i]=p[p[n][i-1]][i-1];
    }
    pos[n]=n;
    len[n]=len[p[n][0]]+1;
    str[n]=L;
}

void UndoCommands(int U)
{
    int i;
    n++;
    pos[n]=pos[n-U-1];
    len[n]=len[pos[n]];
}

char GetLetter(int P)
{
    int i;
    int m,dir=pos[n];
    m=len[n]-P-1;
    for(i=0;i<=20;i++)
    {
        if(m&(1<<i))
        {
            m-=(1<<i);
            dir=p[dir][i];
        }
    }
    return str[dir];
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 111432 KB Output is correct
2 Correct 0 ms 111432 KB Output is correct
3 Correct 0 ms 111432 KB Output is correct
4 Correct 0 ms 111432 KB Output is correct
5 Correct 0 ms 111432 KB Output is correct
6 Correct 0 ms 111432 KB Output is correct
7 Correct 0 ms 111432 KB Output is correct
8 Correct 0 ms 111432 KB Output is correct
9 Correct 0 ms 111432 KB Output is correct
10 Correct 0 ms 111432 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 111432 KB Output is correct
2 Correct 0 ms 111432 KB Output is correct
3 Correct 0 ms 111432 KB Output is correct
4 Correct 0 ms 111432 KB Output is correct
5 Correct 0 ms 111432 KB Output is correct
6 Correct 0 ms 111432 KB Output is correct
7 Correct 0 ms 111432 KB Output is correct
8 Correct 0 ms 111432 KB Output is correct
9 Correct 0 ms 111432 KB Output is correct
10 Correct 0 ms 111432 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 111432 KB Output is correct
2 Correct 0 ms 111432 KB Output is correct
3 Correct 0 ms 111432 KB Output is correct
4 Correct 0 ms 111432 KB Output is correct
5 Correct 0 ms 111432 KB Output is correct
6 Correct 0 ms 111432 KB Output is correct
7 Correct 0 ms 111432 KB Output is correct
8 Correct 0 ms 111432 KB Output is correct
9 Correct 0 ms 111432 KB Output is correct
10 Correct 0 ms 111432 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 416 ms 111432 KB Output is correct
2 Correct 452 ms 111432 KB Output is correct
3 Correct 376 ms 111432 KB Output is correct
4 Correct 368 ms 111432 KB Output is correct
5 Correct 412 ms 111432 KB Output is correct
6 Correct 404 ms 111432 KB Output is correct
7 Correct 452 ms 111432 KB Output is correct
8 Correct 500 ms 111432 KB Output is correct
9 Correct 500 ms 111432 KB Output is correct
10 Correct 240 ms 111432 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 456 ms 111432 KB Output is correct
2 Correct 496 ms 111432 KB Output is correct
3 Correct 376 ms 111432 KB Output is correct
4 Correct 388 ms 111432 KB Output is correct
5 Correct 376 ms 111432 KB Output is correct
6 Correct 356 ms 111432 KB Output is correct
7 Correct 400 ms 111432 KB Output is correct
8 Correct 516 ms 111432 KB Output is correct
9 Correct 540 ms 111432 KB Output is correct
10 Correct 228 ms 111432 KB Output is correct