oj.uz

Submission #169296

# Submission time Handle Problem Language Result Execution time Memory
169296 2019-12-19T16:00:08 Z AlexLuchianov Crayfish scrivener (IOI12_scrivener) C++14
34 / 100
 1000 ms 83600 KB 
#include <iostream>

int const nmax = 1000000;

using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))

char last;

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

void Init() {}

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

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

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

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
22.0 / 22.0

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

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 418 ms 63860 KB Output is correct
2 Correct 458 ms 77332 KB Output is correct
3 Correct 432 ms 77680 KB Output is correct
4 Correct 475 ms 82348 KB Output is correct
5 Correct 583 ms 72200 KB Output is correct
6 Correct 382 ms 83600 KB Output is correct
7 Execution timed out 1058 ms 73856 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 764 ms 59708 KB Output is correct
2 Correct 993 ms 53072 KB Output is correct
3 Correct 495 ms 66040 KB Output is correct
4 Correct 520 ms 59372 KB Output is correct
5 Correct 434 ms 75100 KB Output is correct
6 Correct 467 ms 77396 KB Output is correct
7 Correct 514 ms 77308 KB Output is correct
8 Execution timed out 1090 ms 63772 KB Time limit exceeded
9 Halted 0 ms 0 KB -