답안 #20810

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
20810	2017-02-16T08:18:41 Z	jjwdi0	크레이피쉬 글쓰는 기계 (IOI12_scrivener)	C++11	60 / 100	1000 ms	96352 KB

scrivener

int par[1<<20][21], size[1<<20], for_undo[1<<20],  kth, Q;
char a[1<<20];
void Init(){}
void TypeLetter(char x)
{
	for_undo[kth] = kth; if(kth) par[kth][0] = for_undo[kth - 1]; 
	for(int i = 1; par[kth][i-1]; i++)
	{
		par[kth][i] = par[par[kth][i-1]][i-1];
	}
	a[kth] = x, size[kth] = size[par[kth][0]] + 1, kth++;
}
void UndoCommands(int x)
{
	for_undo[kth] = for_undo[kth - x - 1]; kth++;
}
char GetLetter(int x)
{
	int u = for_undo[kth - 1];
	for(int i = 19; i + 1; i--)
	{
		if(size[par[u][i]] > x) u = par[u][i];
	}
	return a[u];
}

Subtask #1

5.0 / 5.0

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

Subtask #2

7.0 / 7.0

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

Subtask #3

22.0 / 22.0

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

Subtask #4

26.0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	609 ms	96352 KB	Output is correct
2	Correct	569 ms	96352 KB	Output is correct
3	Correct	383 ms	96352 KB	Output is correct
4	Correct	386 ms	96352 KB	Output is correct
5	Correct	586 ms	96352 KB	Output is correct
6	Correct	413 ms	96352 KB	Output is correct
7	Correct	629 ms	96352 KB	Output is correct
8	Correct	546 ms	96352 KB	Output is correct
9	Correct	659 ms	96352 KB	Output is correct
10	Correct	179 ms	96352 KB	Output is correct

Subtask #5

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	793 ms	96352 KB	Output is correct
2	Execution timed out	1000 ms	96352 KB	Execution timed out
3	Halted	0 ms	0 KB	-