oj.uz

Submission #202086

# Submission time Handle Problem Language Result Execution time Memory
202086 2020-02-13T16:57:05 Z DavidDamian Crayfish scrivener (IOI12_scrivener) C++11
100 / 100
 516 ms 65784 KB 
#include<bits/stdc++.h>
using namespace std;
///Tree
///Ancestor to travel in O(log n)
///Persistent Array
///Determine the letter in position P
///You can add new letters or go back in time
int node[1000006];
int NEXT_FREE_INDEX=1;
int n=1;
int lv[1000006];
char letter[1000006];
int ancestor[21][1000006];
int len;
int cont=0;
void Init() {
    len=-1;
    lv[0]=-1;
}
void TypeLetter(char L) {
    int u=NEXT_FREE_INDEX++; //Last created node
    node[n]=u;
    lv[u]=lv[ node[n-1] ]+1;
    letter[u]=L;
    ancestor[0][u]=node[n-1];
    for(int i=1;i<=20;i++){ //We set the ancestors of the new node
        ancestor[i][u]=ancestor[i-1][ ancestor[i-1][u] ];
    }
    n++;
}
void UndoCommands(int U) { //The actual node changes to a past one
    node[n]=node[n-U-1];
    n++;
}
char GetLetter(int P) {
    int u=node[n-1];
    int d=lv[u]-P;
    for(int i=20;i>=0;i--){ //We travel the path to the root in jumps of 2^i
        if(d & (1<<i)){
            u=ancestor[i][u];
        }
    }
    return letter[u];
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
22.0 / 22.0

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

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 300 ms 54008 KB Output is correct
2 Correct 321 ms 59588 KB Output is correct
3 Correct 304 ms 58232 KB Output is correct
4 Correct 334 ms 46416 KB Output is correct
5 Correct 353 ms 50808 KB Output is correct
6 Correct 257 ms 64504 KB Output is correct
7 Correct 355 ms 31480 KB Output is correct
8 Correct 321 ms 47480 KB Output is correct
9 Correct 339 ms 65784 KB Output is correct
10 Correct 228 ms 48248 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 448 ms 46304 KB Output is correct
2 Correct 516 ms 40572 KB Output is correct
3 Correct 330 ms 44792 KB Output is correct
4 Correct 373 ms 33400 KB Output is correct
5 Correct 277 ms 49144 KB Output is correct
6 Correct 288 ms 46200 KB Output is correct
7 Correct 300 ms 49272 KB Output is correct
8 Correct 473 ms 23544 KB Output is correct
9 Correct 478 ms 41824 KB Output is correct
10 Correct 235 ms 47868 KB Output is correct