oj.uz

Submission #63034

# Submission time Handle Problem Language Result Execution time Memory
63034 2018-07-31T11:18:29 Z Bodo171 Crayfish scrivener (IOI12_scrivener) C++14
60 / 100
 1000 ms 69720 KB 
char last;

void Init() {}
const int nmax=1000005;
char st[nmax];
int lev[nmax],state[nmax],tt[nmax][20];
int curr,states,nr,i,lg=19;
void TypeLetter(char L) {

  curr=state[states];
  st[++nr]=L;state[++states]=nr;
  tt[nr][0]=curr;lev[nr]=lev[curr]+1;
  for(i=1;i<=lg;i++)
    tt[nr][i]=tt[tt[nr][i-1]][i-1];
}

void UndoCommands(int U) {
  states++;
  state[states]=state[states-U-1];
}

char GetLetter(int P) {
  curr=state[states];
  P=lev[curr]-P-1;
  for(i=lg;i>=0;i--)
       if(((1<<i)&P))
         curr=tt[curr][i];
  return st[curr];

}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
22.0 / 22.0

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

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 733 ms 55260 KB Output is correct
2 Correct 745 ms 63692 KB Output is correct
3 Correct 561 ms 63692 KB Output is correct
4 Correct 530 ms 63692 KB Output is correct
5 Correct 625 ms 63692 KB Output is correct
6 Correct 454 ms 68516 KB Output is correct
7 Correct 579 ms 68516 KB Output is correct
8 Correct 496 ms 68516 KB Output is correct
9 Correct 735 ms 69720 KB Output is correct
10 Correct 225 ms 69720 KB Output is correct

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 714 ms 69720 KB Output is correct
2 Correct 858 ms 69720 KB Output is correct
3 Correct 525 ms 69720 KB Output is correct
4 Correct 437 ms 69720 KB Output is correct
5 Correct 509 ms 69720 KB Output is correct
6 Correct 536 ms 69720 KB Output is correct
7 Correct 435 ms 69720 KB Output is correct
8 Correct 618 ms 69720 KB Output is correct
9 Execution timed out 1043 ms 69720 KB Time limit exceeded
10 Halted 0 ms 0 KB -