oj.uz

Submission #120478

# Submission time Handle Problem Language Result Execution time Memory
120478 2019-06-24T15:56:40 Z KieranHorgan Crayfish scrivener (IOI12_scrivener) C++17
100 / 100
 827 ms 86620 KB 
#include <bits/stdc++.h>
using namespace std;

char charOfStep[1000005];
int depth[1000005];
int kthAncestor[1000005][21];
int curStep = 0;

void Init() {}

void TypeLetter(char L) {
	curStep++;
	charOfStep[curStep] = L;
	depth[curStep] = depth[curStep-1]+1;
	kthAncestor[curStep][0] = curStep-1;
	for(int i = 1; 1<<i <= depth[curStep]; i++)
		kthAncestor[curStep][i] = kthAncestor[kthAncestor[curStep][i-1]][i-1];
}

void UndoCommands(int U) {
	curStep++;
	charOfStep[curStep] = charOfStep[curStep-1-U];
	depth[curStep] = depth[curStep-1-U];
	copy(kthAncestor[curStep-1-U], kthAncestor[curStep-1-U]+21, kthAncestor[curStep]);
}

char GetLetter(int P) {
  int node = curStep;
  for(int i = 21; i >= 0; i--)
  	if(depth[node] - (1<<i) >= P+1)
  		node = kthAncestor[node][i];
  return charOfStep[node];
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 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 384 KB Output is correct
8 Correct 2 ms 384 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 2 ms 384 KB Output is correct
2 Correct 2 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 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 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 2 ms 512 KB Output is correct
2 Correct 3 ms 640 KB Output is correct
3 Correct 3 ms 768 KB Output is correct
4 Correct 3 ms 768 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 3 ms 768 KB Output is correct
7 Correct 3 ms 640 KB Output is correct
8 Correct 3 ms 768 KB Output is correct
9 Correct 3 ms 768 KB Output is correct
10 Correct 3 ms 768 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 530 ms 62776 KB Output is correct
2 Correct 550 ms 76544 KB Output is correct
3 Correct 380 ms 75964 KB Output is correct
4 Correct 401 ms 79648 KB Output is correct
5 Correct 485 ms 70300 KB Output is correct
6 Correct 395 ms 82860 KB Output is correct
7 Correct 550 ms 71000 KB Output is correct
8 Correct 570 ms 80208 KB Output is correct
9 Correct 657 ms 76928 KB Output is correct
10 Correct 227 ms 86620 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 710 ms 57508 KB Output is correct
2 Correct 726 ms 49644 KB Output is correct
3 Correct 399 ms 63352 KB Output is correct
4 Correct 402 ms 54852 KB Output is correct
5 Correct 469 ms 73764 KB Output is correct
6 Correct 438 ms 76176 KB Output is correct
7 Correct 476 ms 76136 KB Output is correct
8 Correct 671 ms 64004 KB Output is correct
9 Correct 827 ms 61456 KB Output is correct
10 Correct 213 ms 85560 KB Output is correct