Submission #20809

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
20809	2017-02-16T08:17:54 Z	jjwdi0	Crayfish scrivener (IOI12_scrivener)	C++11	34 / 100	1000 ms	92256 KB

scrivener

int par[1<<20][21], size[1<<20], kth, Q;
char a[1<<20];
void Init(){}
void TypeLetter(char x)
{
	if(kth) par[kth][0] = 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)
{
	par[kth][0] = kth - x - 1;
	for(int i = 1; par[kth][i-1]; i++)
	{
		par[kth][i] = par[par[kth][i-1]][i-1];
	}
	a[kth] = a[par[kth][0]], size[kth] = size[par[kth][0]], kth++;
}
char GetLetter(int x)
{
	int u = 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

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

Subtask #2

7.0 / 7.0

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

Subtask #3

22.0 / 22.0

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

Subtask #4

0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	693 ms	92256 KB	Output is correct
2	Correct	706 ms	92256 KB	Output is correct
3	Correct	466 ms	92256 KB	Output is correct
4	Correct	539 ms	92256 KB	Output is correct
5	Correct	546 ms	92256 KB	Output is correct
6	Correct	353 ms	92256 KB	Output is correct
7	Execution timed out	1000 ms	92256 KB	Execution timed out
8	Halted	0 ms	0 KB	-

Subtask #5

0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	943 ms	92256 KB	Output is correct
2	Correct	976 ms	92256 KB	Output is correct
3	Correct	523 ms	92256 KB	Output is correct
4	Correct	523 ms	92256 KB	Output is correct
5	Correct	596 ms	92256 KB	Output is correct
6	Correct	666 ms	92256 KB	Output is correct
7	Correct	669 ms	92256 KB	Output is correct
8	Execution timed out	1000 ms	92256 KB	Execution timed out
9	Halted	0 ms	0 KB	-