Submission #105115

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
105115	2019-04-10T15:01:12 Z	eriksuenderhauf	Crayfish scrivener (IOI12_scrivener)	C++11	34 / 100	1000 ms	129188 KB

scrivener

//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
//#include "grader.h"
using namespace std;
typedef long long int ll;
const int MAXN = 1e6 + 5;

struct node
{
	node *par[20];
	char c;
	int len = 1;
};

node *arr[MAXN];
int cnt = -1;

node *add(char x, node *cur) {
	node *ret = new node;
	if (cur != NULL)
		ret->len = cur->len + 1;
	ret->c = x;
	ret->par[0] = cur;
	for (int i = 1; i < 20; i++) {
		if (ret->par[i-1] != NULL)
			ret->par[i] = ret->par[i - 1]->par[i - 1];
		else
			break;
	}
	return ret;
}

void Init() {
}

void TypeLetter(char c) {
	cnt++;
	if (cnt == 0)
		arr[cnt] = add(c, NULL);
	else
		arr[cnt] = add(c, arr[cnt-1]);
}

void UndoCommands(int u) {
	cnt++;
	arr[cnt] = arr[cnt - u - 1];
}

char GetLetter(int k) {
	node *tmp = arr[cnt];
	k = tmp->len - k - 1;
	for (int i = 0; k != 0 && i < 20; i++) {
		if (k & 1)
			tmp = tmp->par[i];
		k /= 2;
	}
	return tmp->c;
}

Subtask #1

5.0 / 5.0

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

Subtask #2

7.0 / 7.0

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

Subtask #3

22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	640 KB	Output is correct
2	Correct	5 ms	640 KB	Output is correct
3	Correct	4 ms	640 KB	Output is correct
4	Correct	2 ms	768 KB	Output is correct
5	Correct	2 ms	640 KB	Output is correct
6	Correct	4 ms	1024 KB	Output is correct
7	Correct	4 ms	1024 KB	Output is correct
8	Correct	4 ms	768 KB	Output is correct
9	Correct	4 ms	896 KB	Output is correct
10	Correct	3 ms	640 KB	Output is correct

Subtask #4

0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	895 ms	105840 KB	Output is correct
2	Correct	959 ms	116920 KB	Output is correct
3	Correct	582 ms	114680 KB	Output is correct
4	Correct	575 ms	91176 KB	Output is correct
5	Correct	748 ms	99576 KB	Output is correct
6	Correct	795 ms	126972 KB	Output is correct
7	Correct	820 ms	61176 KB	Output is correct
8	Correct	806 ms	93048 KB	Output is correct
9	Execution timed out	1087 ms	129188 KB	Time limit exceeded
10	Halted	0 ms	0 KB	-

Subtask #5

0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	906 ms	90008 KB	Output is correct
2	Correct	905 ms	79096 KB	Output is correct
3	Correct	568 ms	87472 KB	Output is correct
4	Correct	519 ms	64460 KB	Output is correct
5	Correct	679 ms	96104 KB	Output is correct
6	Correct	610 ms	90580 KB	Output is correct
7	Correct	653 ms	96664 KB	Output is correct
8	Correct	843 ms	45276 KB	Output is correct
9	Execution timed out	1022 ms	81536 KB	Time limit exceeded
10	Halted	0 ms	0 KB	-