oj.uz

Submission #114976

# Submission time Handle Problem Language Result Execution time Memory
114976 2019-06-04T08:27:03 Z zoooma13 Crayfish scrivener (IOI12_scrivener) C++14
34 / 100
 1000 ms 162296 KB 
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("unroll-loops")
//#include "grader.cpp"

#define MAX_COMM 1000006
#define LOG_COMM 20

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;
    for(int i=LOG_COMM-1; ~i; i--)
        if(~par[i][u] && dist[i][u] <= P){
            P -= dist[i][u];
            u = par[i][u];
        }
    return edg_char[u];
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 160888 KB Output is correct
2 Correct 117 ms 160832 KB Output is correct
3 Correct 115 ms 160904 KB Output is correct
4 Correct 116 ms 160764 KB Output is correct
5 Correct 115 ms 160924 KB Output is correct
6 Correct 115 ms 161016 KB Output is correct
7 Correct 116 ms 160764 KB Output is correct
8 Correct 115 ms 160812 KB Output is correct
9 Correct 115 ms 160760 KB Output is correct
10 Correct 117 ms 160792 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 160944 KB Output is correct
2 Correct 117 ms 160816 KB Output is correct
3 Correct 117 ms 160760 KB Output is correct
4 Correct 116 ms 160736 KB Output is correct
5 Correct 117 ms 160776 KB Output is correct
6 Correct 129 ms 160756 KB Output is correct
7 Correct 123 ms 160772 KB Output is correct
8 Correct 123 ms 160760 KB Output is correct
9 Correct 121 ms 160820 KB Output is correct
10 Correct 121 ms 160760 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 160812 KB Output is correct
2 Correct 123 ms 160816 KB Output is correct
3 Correct 116 ms 160888 KB Output is correct
4 Correct 119 ms 160760 KB Output is correct
5 Correct 118 ms 160888 KB Output is correct
6 Correct 119 ms 160756 KB Output is correct
7 Correct 117 ms 160832 KB Output is correct
8 Correct 120 ms 160800 KB Output is correct
9 Correct 117 ms 160760 KB Output is correct
10 Correct 124 ms 160952 KB Output is correct

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 558 ms 162056 KB Output is correct
2 Correct 672 ms 161912 KB Output is correct
3 Correct 556 ms 161864 KB Output is correct
4 Correct 679 ms 162004 KB Output is correct
5 Correct 669 ms 162268 KB Output is correct
6 Correct 508 ms 162168 KB Output is correct
7 Execution timed out 1084 ms 161812 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 797 ms 162160 KB Output is correct
2 Correct 935 ms 162204 KB Output is correct
3 Correct 593 ms 162040 KB Output is correct
4 Correct 594 ms 162296 KB Output is correct
5 Correct 513 ms 162136 KB Output is correct
6 Correct 537 ms 162204 KB Output is correct
7 Correct 546 ms 162144 KB Output is correct
8 Execution timed out 1090 ms 162104 KB Time limit exceeded
9 Halted 0 ms 0 KB -