oj.uz

답안 #31046

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
31046 2017-08-06T02:42:02 Z 14kg 크레이피쉬 글쓰는 기계 (IOI12_scrivener) C++11
100 / 100
 943 ms 94868 KB 
struct TYPE{
	char num;
	int next_0, lev, next[21];
} d[1000001];
int n, p[21];

void Init(){
    p[0] = 1;
    for (int i = 1; i <= 20; i++) p[i] = p[i - 1] * 2;
}

void TypeLetter(char x){
    n++, d[n].next_0 = n, d[n].num = x, d[n].lev = d[n - 1].lev + 1;
	d[n].next[0] = d[n - 1].next_0;
	for (int i = 1; i <= 20; i++) d[n].next[i] = d[d[n].next[i - 1]].next[i - 1];
}

void UndoCommands(int x) {
    n++, d[n].next_0 = d[n - x - 1].next_0, d[n].lev = d[d[n].next_0].lev;
}

char GetLetter(int _in){
    int x = n, y = d[n].lev-_in-1;

    while(1){
        if(x!=d[x].next_0) x=d[x].next_0;
        else if(y==0) return d[x].num;

        for(int i=20; i>=0; i--)
        if(p[i]<=y){
            x=d[x].next[i], y-=p[i];
            break;
        }
    }
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
22.0 / 22.0

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

Subtask #4
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 679 ms 94868 KB Output is correct
2 Correct 713 ms 94868 KB Output is correct
3 Correct 426 ms 94868 KB Output is correct
4 Correct 489 ms 94868 KB Output is correct
5 Correct 609 ms 94868 KB Output is correct
6 Correct 493 ms 94868 KB Output is correct
7 Correct 663 ms 94868 KB Output is correct
8 Correct 706 ms 94868 KB Output is correct
9 Correct 769 ms 94868 KB Output is correct
10 Correct 226 ms 94868 KB Output is correct

Subtask #5
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 753 ms 94868 KB Output is correct
2 Correct 896 ms 94868 KB Output is correct
3 Correct 406 ms 94868 KB Output is correct
4 Correct 449 ms 94868 KB Output is correct
5 Correct 446 ms 94868 KB Output is correct
6 Correct 499 ms 94868 KB Output is correct
7 Correct 539 ms 94868 KB Output is correct
8 Correct 783 ms 94868 KB Output is correct
9 Correct 943 ms 94868 KB Output is correct
10 Correct 259 ms 94868 KB Output is correct