oj.uz

Submission #114967

# Submission time Handle Problem Language Result Execution time Memory
114967 2019-06-04T08:18:17 Z zoooma13 Crayfish scrivener (IOI12_scrivener) C++14
34 / 100
 1000 ms 182356 KB 
#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.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 176408 KB Output is correct
2 Correct 129 ms 176504 KB Output is correct
3 Correct 128 ms 176588 KB Output is correct
4 Correct 131 ms 176504 KB Output is correct
5 Correct 125 ms 176432 KB Output is correct
6 Correct 131 ms 176456 KB Output is correct
7 Correct 126 ms 176544 KB Output is correct
8 Correct 126 ms 176488 KB Output is correct
9 Correct 126 ms 176524 KB Output is correct
10 Correct 128 ms 176468 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 176376 KB Output is correct
2 Correct 128 ms 176480 KB Output is correct
3 Correct 126 ms 176476 KB Output is correct
4 Correct 127 ms 176392 KB Output is correct
5 Correct 135 ms 176436 KB Output is correct
6 Correct 127 ms 176376 KB Output is correct
7 Correct 127 ms 176376 KB Output is correct
8 Correct 125 ms 176376 KB Output is correct
9 Correct 126 ms 176476 KB Output is correct
10 Correct 127 ms 176380 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 176444 KB Output is correct
2 Correct 128 ms 176492 KB Output is correct
3 Correct 128 ms 176504 KB Output is correct
4 Correct 127 ms 176476 KB Output is correct
5 Correct 134 ms 176556 KB Output is correct
6 Correct 129 ms 176488 KB Output is correct
7 Correct 128 ms 176428 KB Output is correct
8 Correct 132 ms 176632 KB Output is correct
9 Correct 137 ms 176632 KB Output is correct
10 Correct 134 ms 176504 KB Output is correct

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 714 ms 178068 KB Output is correct
2 Correct 693 ms 181496 KB Output is correct
3 Correct 585 ms 182136 KB Output is correct
4 Correct 720 ms 182164 KB Output is correct
5 Correct 958 ms 182356 KB Output is correct
6 Correct 640 ms 181880 KB Output is correct
7 Execution timed out 1092 ms 182008 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1032 ms 181584 KB Time limit exceeded
2 Halted 0 ms 0 KB -