oj.uz

Submission #169298

# Submission time Handle Problem Language Result Execution time Memory
169298 2019-12-19T16:03:44 Z AlexLuchianov Crayfish scrivener (IOI12_scrivener) C++14
34 / 100
 1000 ms 79368 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[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 376 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 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 376 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 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 504 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 3 ms 504 KB Output is correct
2 Correct 3 ms 632 KB Output is correct
3 Correct 4 ms 760 KB Output is correct
4 Correct 4 ms 760 KB Output is correct
5 Correct 4 ms 760 KB Output is correct
6 Correct 3 ms 764 KB Output is correct
7 Correct 3 ms 760 KB Output is correct
8 Correct 4 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 599 ms 60204 KB Output is correct
2 Correct 684 ms 73424 KB Output is correct
3 Correct 488 ms 72956 KB Output is correct
4 Correct 577 ms 76536 KB Output is correct
5 Correct 580 ms 67704 KB Output is correct
6 Correct 404 ms 79368 KB Output is correct
7 Execution timed out 1077 ms 67728 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 814 ms 55268 KB Output is correct
2 Correct 892 ms 47580 KB Output is correct
3 Correct 506 ms 60408 KB Output is correct
4 Correct 550 ms 52504 KB Output is correct
5 Correct 603 ms 70520 KB Output is correct
6 Correct 685 ms 72824 KB Output is correct
7 Correct 689 ms 72712 KB Output is correct
8 Execution timed out 1087 ms 54880 KB Time limit exceeded
9 Halted 0 ms 0 KB -