oj.uz

Submission #169305

# Submission time Handle Problem Language Result Execution time Memory
169305 2019-12-19T16:06:35 Z AlexLuchianov Crayfish scrivener (IOI12_scrivener) C++14
34 / 100
 896 ms 79352 KB 
int const nmax = 1000000;

char last;

int const lgmax = 19;

int far[1 + nmax][1 + lgmax], ptr = 0;
int level[1 + nmax];
char chr[1 + nmax];

void Init() {}

void TypeLetter(char L) {
  ++ptr;
  far[ptr][0] = ptr - 1;
  for(int h = 1; h < lgmax; h++)
    far[ptr][h] = far[far[ptr][h - 1]][h - 1];
  level[ptr] = level[far[ptr][0]] + 1;
  chr[ptr] = L;
}

void UndoCommands(int U) {
  ++ptr;
  far[ptr][0] = ptr - 1 - U;
  for(int h = 1; h < lgmax; h++)
    far[ptr][h] = far[far[ptr][h - 1]][h - 1];
  level[ptr] = level[far[ptr][0]];
}

char GetLetter(int P) {
  int pos = ptr;
  P++;
  for(int h = lgmax - 1; 0 <= h; h--)
    if(P <= level[far[pos][h]] )
      pos = far[pos][h];
  return chr[pos];
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
22.0 / 22.0

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

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 591 ms 59964 KB Output is correct
2 Correct 649 ms 73220 KB Output is correct
3 Correct 502 ms 72484 KB Output is correct
4 Correct 570 ms 76024 KB Output is correct
5 Correct 542 ms 67320 KB Output is correct
6 Incorrect 369 ms 79352 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 888 ms 55200 KB Output is correct
2 Correct 896 ms 47748 KB Output is correct
3 Correct 509 ms 60440 KB Output is correct
4 Correct 556 ms 52600 KB Output is correct
5 Correct 571 ms 70476 KB Output is correct
6 Correct 616 ms 72948 KB Output is correct
7 Incorrect 614 ms 72796 KB Output isn't correct
8 Halted 0 ms 0 KB -