oj.uz

Submission #79065

# Submission time Handle Problem Language Result Execution time Memory
79065 2018-10-11T02:45:42 Z TAMREF Crayfish scrivener (IOI12_scrivener) C++11
34 / 100
 1000 ms 80604 KB 
#include <bits/stdc++.h>
using namespace std;
const int mx = 1e6 + 5;
const int lg = 20;
int C[mx], I[mx];
char X[mx];
int p[lg][mx];
int n;

void show(int i){
    printf("C : %d I : %d X : %c\n",C[i],I[i],X[C[i]]);
}

void Init() {
}

void TypeLetter(char L) {
    ++n;
    I[n] = I[n-1] + 1;
    C[n] = n;
    X[n] = L;
    p[0][n] = n - 1;
    for(int j = 1; j < lg; j++){
        if(!p[j-1][n]) break;
        else{
            p[j][n] = p[j-1][p[j-1][n]];
        }
    }
}

void UndoCommands(int U) {
    ++n;
    if(U == n){
        I[n] = 0;
        C[n] = 0;
        X[n] = 'U';
        return;
    }
    I[n] = I[n - 1 - U];
    C[n] = C[n - 1 - U];
    p[0][n] = n - 1 - U;
    for(int j = 1; j < lg; j++){
        if(!p[j-1][n]) break;
        else{
            p[j][n] = p[j-1][p[j-1][n]];
        }
    }
}

char GetLetter(int P) {
    ++P;
    int b = n;
    for(int j = lg-1; j >= 0; j--){
        if(I[b] == P) return X[C[b]];
        if(I[p[j][b]] >= P) b = p[j][b];
    }
    return I[b] == P ? X[C[b]] : X[C[p[0][b]]];
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 724 KB Output is correct
2 Correct 4 ms 848 KB Output is correct
3 Correct 3 ms 864 KB Output is correct
4 Correct 3 ms 864 KB Output is correct
5 Correct 4 ms 864 KB Output is correct
6 Correct 3 ms 864 KB Output is correct
7 Correct 3 ms 992 KB Output is correct
8 Correct 3 ms 1004 KB Output is correct
9 Correct 3 ms 1004 KB Output is correct
10 Correct 3 ms 1132 KB Output is correct

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 502 ms 58992 KB Output is correct
2 Correct 500 ms 73040 KB Output is correct
3 Correct 405 ms 73040 KB Output is correct
4 Correct 465 ms 73040 KB Output is correct
5 Correct 603 ms 73040 KB Output is correct
6 Correct 438 ms 80604 KB Output is correct
7 Execution timed out 1088 ms 80604 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 851 ms 80604 KB Output is correct
2 Execution timed out 1022 ms 80604 KB Time limit exceeded
3 Halted 0 ms 0 KB -