제출 #114967

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
114967		zoooma13	크레이피쉬 글쓰는 기계 (IOI12_scrivener)	C++14	34 / 100	1092 ms	182356 KiB

scrivener

#include <bits/stdc++.h>
using namespace std;

//#include "grader.cpp"

#define MAX_COMM 1000006
#define LOG_COMM 22

int curr_comm;
char edg_char[MAX_COMM];
int par[LOG_COMM][MAX_COMM] ,dist[LOG_COMM][MAX_COMM];
int dist_root[MAX_COMM];

void bld_anc(int u ,int p ,int v){
    par[0][u] = p;
    dist[0][u] = (bool)v;
    dist_root[u] = dist_root[p]+(bool)v;
    edg_char[u] = (v ? v : edg_char[p]);
    for(int i=1; i<LOG_COMM; i++)
        if(~par[i-1][u]){
            par[i][u] = par[i-1][par[i-1][u]];
            dist[i][u] = dist[i-1][u] + dist[i-1][par[i-1][u]];
        }
}

void Init(){
    curr_comm = 0;
    memset(par ,-1 ,sizeof par);
    memset(dist ,0 ,sizeof dist);
    memset(dist_root ,0 ,sizeof dist_root);
}
void TypeLetter(char L){++curr_comm;
    bld_anc(curr_comm ,curr_comm-1 ,L);
}
void UndoCommands(int U){++curr_comm;
    bld_anc(curr_comm ,curr_comm-U-1 ,0);
}

char GetLetter(int P){
    int u = curr_comm;
    P = dist_root[u]-P-1;
    while(P > 0){
        for(int i=LOG_COMM-1; ~i; i--)
            if(~par[i][u] && dist[i][u] <= P){
                P -= dist[i][u];
                u = par[i][u];
                break;
            }
    }
    return edg_char[u];
}

• Subtask 1: 5 / 5
• Subtask 2: 7 / 7
• Subtask 3: 22 / 22
• Subtask 4: 0 / 26
• Subtask 5: 0 / 40