oj.uz

Submission #230126

# Submission time Handle Problem Language Result Execution time Memory
230126 2020-05-08T15:20:20 Z quocnguyen1012 Crayfish scrivener (IOI12_scrivener) C++14
100 / 100
 438 ms 67448 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 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 4 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 4 ms 512 KB Output is correct
8 Correct 4 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 #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 4 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 6 ms 512 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 5 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 768 KB Output is correct
6 Correct 6 ms 896 KB Output is correct
7 Correct 6 ms 896 KB Output is correct
8 Correct 6 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 276 ms 55288 KB Output is correct
2 Correct 298 ms 61048 KB Output is correct
3 Correct 286 ms 60536 KB Output is correct
4 Correct 312 ms 50808 KB Output is correct
5 Correct 333 ms 53368 KB Output is correct
6 Correct 240 ms 65912 KB Output is correct
7 Correct 316 ms 36072 KB Output is correct
8 Correct 279 ms 50800 KB Output is correct
9 Correct 309 ms 67448 KB Output is correct
10 Correct 210 ms 50296 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 364 ms 48612 KB Output is correct
2 Correct 437 ms 44100 KB Output is correct
3 Correct 335 ms 48392 KB Output is correct
4 Correct 374 ms 38520 KB Output is correct
5 Correct 250 ms 51832 KB Output is correct
6 Correct 272 ms 48760 KB Output is correct
7 Correct 265 ms 51704 KB Output is correct
8 Correct 434 ms 28408 KB Output is correct
9 Correct 438 ms 45816 KB Output is correct
10 Correct 205 ms 50000 KB Output is correct