oj.uz

Submission #315027

# Submission time Handle Problem Language Result Execution time Memory
315027 2020-10-22T00:47:33 Z Ozy Crayfish scrivener (IOI12_scrivener) C++17
100 / 100
 434 ms 39544 KB 
#include <bits/stdc++.h>
using namespace std;
 
char last;
#define rep(i,a,b) for (int i = (a); i <= (b); i++)
#define lli long long int
#define debug(a) //cout << #a << " = " << a << endl
 
struct x{
    char letra;
    lli padre;
    lli nivel;
    lli jump;
};
 
 
lli p,act,cont = 1;
x instruccion[1000002];
lli salto[1000002];
 
void Init() {
    instruccion[0].nivel = 0;
    instruccion[0].padre = 0;
    instruccion[0].letra = 0;
 
//    rep(i, 0, 1000001) rep(j, 0, 21) binaryUp[i][j] = 0;
}
 
void TypeLetter(char L) {
 
    instruccion[cont].letra = L;
    instruccion[cont].padre = cont-1;
    instruccion[cont].nivel = instruccion[ instruccion[cont].padre ].nivel + 1;
  	p = cont - 1;
 
    if (instruccion[cont].nivel > 1) {
      if (instruccion[p].jump > 0 && instruccion[instruccion[cont].padre].jump == instruccion[salto[instruccion[cont].padre]].jump) {
          salto[cont] = salto[salto[instruccion[cont].padre]];
          instruccion[cont].jump = instruccion[instruccion[cont].padre].jump*2 + 1;
      }
      else {
          salto[cont] = instruccion[cont].padre;
          instruccion[cont].jump = 1;
      }
    }
 
    cont++;
}
 
void UndoCommands(int U) {
    instruccion[cont] = instruccion[cont - U - 1];
    act = 0;
    salto[cont] = salto[cont - U - 1];
 
    cont++;
}
 
char GetLetter(int P) {
 
    act = cont-1;
    p = instruccion[act].nivel;
    P++;
 
    while (P < p) {
        if (p - instruccion[act].jump >= P) {
            p -= instruccion[act].jump;
            act = salto[act];
        }
        else {
            p--;
            act = instruccion[act].padre;
        }
    }
 
    return instruccion[act].letra;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
22.0 / 22.0

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

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 28536 KB Output is correct
2 Correct 201 ms 34680 KB Output is correct
3 Correct 212 ms 34424 KB Output is correct
4 Correct 287 ms 36072 KB Output is correct
5 Correct 336 ms 31992 KB Output is correct
6 Correct 222 ms 38008 KB Output is correct
7 Correct 417 ms 32760 KB Output is correct
8 Correct 302 ms 36856 KB Output is correct
9 Correct 252 ms 35320 KB Output is correct
10 Correct 186 ms 39544 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 302 ms 26392 KB Output is correct
2 Correct 378 ms 23032 KB Output is correct
3 Correct 265 ms 29304 KB Output is correct
4 Correct 315 ms 25720 KB Output is correct
5 Correct 240 ms 33972 KB Output is correct
6 Correct 238 ms 35064 KB Output is correct
7 Correct 253 ms 35064 KB Output is correct
8 Correct 434 ms 29688 KB Output is correct
9 Correct 403 ms 28664 KB Output is correct
10 Correct 188 ms 39032 KB Output is correct