oj.uz

Submission #72959

# Submission time Handle Problem Language Result Execution time Memory
72959 2018-08-27T09:53:11 Z Hoget157 Crayfish scrivener (IOI12_scrivener) C++14
34 / 100
 1000 ms 127232 KB 
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];
		else break;
	}
	cnt++;
}

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

char GetLetter(int P) {
	Node *tmp = p[cnt - 1];
	for(int i = 0;i < 22;i++){
		if(tmp->num == P) break;
		if(((tmp->num - 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 376 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 2 ms 540 KB Output is correct
4 Correct 2 ms 540 KB Output is correct
5 Correct 2 ms 540 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 2 ms 560 KB Output is correct
8 Correct 2 ms 560 KB Output is correct
9 Correct 2 ms 720 KB Output is correct
10 Correct 3 ms 720 KB Output is correct

Subtask #2
7.0 / 7.0

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

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 872 KB Output is correct
2 Correct 3 ms 876 KB Output is correct
3 Correct 5 ms 1004 KB Output is correct
4 Correct 4 ms 1148 KB Output is correct
5 Correct 5 ms 1148 KB Output is correct
6 Correct 4 ms 1276 KB Output is correct
7 Correct 4 ms 1324 KB Output is correct
8 Correct 4 ms 1324 KB Output is correct
9 Correct 4 ms 1324 KB Output is correct
10 Correct 5 ms 1324 KB Output is correct

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 867 ms 115068 KB Output is correct
2 Execution timed out 1006 ms 127232 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 891 ms 127232 KB Output is correct
2 Execution timed out 1020 ms 127232 KB Time limit exceeded
3 Halted 0 ms 0 KB -