Submission #72956

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
72956	2018-08-27T09:51:00 Z	Hoget157	Crayfish scrivener (IOI12_scrivener)	C++14	34 / 100	1000 ms	183928 KB

scrivener

struct Node{
	public:
	int num;
	char c;
	Node* par[22] = {};
};

int cnt;
Node *root,*p[1000010];

void Init() {
	cnt = 0;
	root = new Node;
	root->num = -1;
	p[cnt++] = root;
}

void TypeLetter(char L) {
	Node *tmp = p[cnt - 1];
	p[cnt] = new Node;
	p[cnt]->c = L;
	p[cnt]->par[0] = tmp;
	p[cnt]->num = tmp->num + 1;
	for(int i = 1;i < 22;i++){
		if(p[cnt]->par[i - 1]) p[cnt]->par[i] = p[cnt]->par[i - 1]->par[i - 1];
	}
	cnt++;
}

void UndoCommands(int U) {
	p[cnt] = p[cnt - U - 1];
	cnt++;
}

char GetLetter(int P) {
	int n = p[cnt - 1]->num;
	Node *tmp = p[cnt - 1];
	for(int i = 0;i < 22;i++){
		if(((n - P) >> i) & 1) tmp = tmp->par[i];
	}
	return tmp->c;
}

Subtask #1

5.0 / 5.0

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

Subtask #2

7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	712 KB	Output is correct
2	Correct	2 ms	712 KB	Output is correct
3	Correct	3 ms	780 KB	Output is correct
4	Correct	3 ms	780 KB	Output is correct
5	Correct	2 ms	780 KB	Output is correct
6	Correct	3 ms	836 KB	Output is correct
7	Correct	2 ms	836 KB	Output is correct
8	Correct	2 ms	836 KB	Output is correct
9	Correct	2 ms	848 KB	Output is correct
10	Correct	3 ms	848 KB	Output is correct

Subtask #3

22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	1112 KB	Output is correct
2	Correct	5 ms	1124 KB	Output is correct
3	Correct	4 ms	1292 KB	Output is correct
4	Correct	4 ms	1464 KB	Output is correct
5	Correct	4 ms	1464 KB	Output is correct
6	Correct	5 ms	1660 KB	Output is correct
7	Correct	5 ms	1700 KB	Output is correct
8	Correct	4 ms	1700 KB	Output is correct
9	Correct	5 ms	1748 KB	Output is correct
10	Correct	4 ms	1748 KB	Output is correct

Subtask #4

0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	877 ms	119392 KB	Output is correct
2	Correct	944 ms	135632 KB	Output is correct
3	Correct	608 ms	137632 KB	Output is correct
4	Correct	532 ms	137632 KB	Output is correct
5	Correct	746 ms	137632 KB	Output is correct
6	Correct	779 ms	166044 KB	Output is correct
7	Correct	756 ms	166044 KB	Output is correct
8	Correct	959 ms	166044 KB	Output is correct
9	Execution timed out	1010 ms	183928 KB	Time limit exceeded
10	Halted	0 ms	0 KB	-

Subtask #5

0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	924 ms	183928 KB	Output is correct
2	Correct	905 ms	183928 KB	Output is correct
3	Correct	568 ms	183928 KB	Output is correct
4	Correct	579 ms	183928 KB	Output is correct
5	Correct	702 ms	183928 KB	Output is correct
6	Correct	629 ms	183928 KB	Output is correct
7	Correct	680 ms	183928 KB	Output is correct
8	Correct	876 ms	183928 KB	Output is correct
9	Execution timed out	1048 ms	183928 KB	Time limit exceeded
10	Halted	0 ms	0 KB	-