oj.uz

답안 #314999

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
314999 2020-10-21T22:31:12 Z Ozy 크레이피쉬 글쓰는 기계 (IOI12_scrivener) C++17
100 / 100
 709 ms 198264 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 p,act,cont = 1;
x instruccion[1000002];
lli binaryUp[1000002][22];

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 = 0;
    binaryUp[cont][0] = instruccion[cont].padre;
    while (binaryUp [ binaryUp[cont][p] ][p] > 0) {
        binaryUp[cont][p+1] = binaryUp [ binaryUp[cont][p] ][p];
        p++;
    }

    cont++;
}

void UndoCommands(int U) {
    instruccion[cont] = instruccion[cont - U - 1];
    act = 0;
    rep(i,0,20) binaryUp[cont][i] = binaryUp[cont - U - 1][i];

    cont++;
}

char GetLetter(int P) {

    p = 0;
    act = cont - 1;
    P = instruccion[cont-1].nivel - P - 1;

    while (P > 0) {
        if ((P & 1) == 1) act = binaryUp[act][p];
        P /= 2;
        p++;
    }

    return instruccion[act].letra;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 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 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 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 1 ms 384 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 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 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 2 ms 896 KB Output is correct
3 Correct 2 ms 1152 KB Output is correct
4 Correct 2 ms 1152 KB Output is correct
5 Correct 3 ms 1024 KB Output is correct
6 Correct 2 ms 1280 KB Output is correct
7 Correct 3 ms 1152 KB Output is correct
8 Correct 2 ms 1280 KB Output is correct
9 Correct 3 ms 1280 KB Output is correct
10 Correct 2 ms 1280 KB Output is correct

Subtask #4
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 511 ms 140728 KB Output is correct
2 Correct 585 ms 175324 KB Output is correct
3 Correct 444 ms 174840 KB Output is correct
4 Correct 499 ms 184312 KB Output is correct
5 Correct 572 ms 161784 KB Output is correct
6 Correct 578 ms 189812 KB Output is correct
7 Correct 628 ms 164344 KB Output is correct
8 Correct 626 ms 184312 KB Output is correct
9 Correct 613 ms 176508 KB Output is correct
10 Correct 329 ms 198264 KB Output is correct

Subtask #5
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 584 ms 129016 KB Output is correct
2 Correct 642 ms 115704 KB Output is correct
3 Correct 461 ms 146556 KB Output is correct
4 Correct 471 ms 128432 KB Output is correct
5 Correct 535 ms 169336 KB Output is correct
6 Correct 510 ms 174796 KB Output is correct
7 Correct 520 ms 174588 KB Output is correct
8 Correct 709 ms 148220 KB Output is correct
9 Correct 697 ms 142548 KB Output is correct
10 Correct 326 ms 195704 KB Output is correct