oj.uz

Submission #169303

# Submission time Handle Problem Language Result Execution time Memory
169303 2019-12-19T16:05:08 Z AlexLuchianov Crayfish scrivener (IOI12_scrivener) C++
34 / 100
 1000 ms 79712 KB 
int const nmax = 1000000;

char last;

int far[1 + nmax][20], 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 < 20; 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 < 20; 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 = 19; 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 256 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 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 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 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 488 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 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 552 KB Output is correct
3 Correct 4 ms 760 KB Output is correct
4 Correct 3 ms 760 KB Output is correct
5 Correct 3 ms 632 KB Output is correct
6 Correct 3 ms 760 KB Output is correct
7 Correct 3 ms 760 KB Output is correct
8 Correct 3 ms 760 KB Output is correct
9 Correct 4 ms 760 KB Output is correct
10 Correct 4 ms 760 KB Output is correct

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 656 ms 60676 KB Output is correct
2 Correct 676 ms 73720 KB Output is correct
3 Correct 515 ms 73208 KB Output is correct
4 Correct 587 ms 76792 KB Output is correct
5 Correct 549 ms 67804 KB Output is correct
6 Correct 389 ms 79712 KB Output is correct
7 Execution timed out 1077 ms 68088 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 792 ms 55392 KB Output is correct
2 Correct 882 ms 47968 KB Output is correct
3 Correct 504 ms 60920 KB Output is correct
4 Correct 552 ms 52856 KB Output is correct
5 Correct 592 ms 70896 KB Output is correct
6 Correct 643 ms 73208 KB Output is correct
7 Correct 606 ms 73116 KB Output is correct
8 Execution timed out 1076 ms 54796 KB Time limit exceeded
9 Halted 0 ms 0 KB -