oj.uz

Submission #229610

# Submission time Handle Problem Language Result Execution time Memory
229610 2020-05-05T10:16:13 Z maruii Crayfish scrivener (IOI12_scrivener) C++14
100 / 100
 479 ms 67320 KB 
int cnt, cnt2, par[20][1000001], A[1000001], dep[1000001];
char S[1000001];
void Init() {
}

void TypeLetter(char L) {
	++cnt2;
	S[cnt2] = L;
	dep[cnt2] = dep[A[cnt]] + 1;
	par[0][cnt2] = A[cnt];
	for (int i = 1; i < 20; ++i) par[i][cnt2] = par[i - 1][par[i - 1][cnt2]];
	++cnt;
	A[cnt] = cnt2;
}

void UndoCommands(int U) {
	int x = cnt - U;
	++cnt;
	A[cnt] = A[x];
}

char GetLetter(int P) {
	int x = A[cnt];
	for (int i = 0; i < 20; ++i) if (((dep[x] - P - 1) >> i) & 1) {
		x = par[i][x];
	}
	return S[x];
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
22.0 / 22.0

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

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 294 ms 55416 KB Output is correct
2 Correct 300 ms 61244 KB Output is correct
3 Correct 290 ms 60664 KB Output is correct
4 Correct 311 ms 50680 KB Output is correct
5 Correct 334 ms 53624 KB Output is correct
6 Correct 238 ms 66040 KB Output is correct
7 Correct 319 ms 36028 KB Output is correct
8 Correct 287 ms 50936 KB Output is correct
9 Correct 319 ms 67320 KB Output is correct
10 Correct 209 ms 50296 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 386 ms 48632 KB Output is correct
2 Correct 472 ms 44376 KB Output is correct
3 Correct 321 ms 48248 KB Output is correct
4 Correct 341 ms 38648 KB Output is correct
5 Correct 251 ms 51576 KB Output is correct
6 Correct 276 ms 48888 KB Output is correct
7 Correct 264 ms 51704 KB Output is correct
8 Correct 479 ms 28408 KB Output is correct
9 Correct 421 ms 45688 KB Output is correct
10 Correct 211 ms 50040 KB Output is correct