oj.uz

Submission #118542

# Submission time Handle Problem Language Result Execution time Memory
118542 2019-06-19T07:55:18 Z Plurm Crayfish scrivener (IOI12_scrivener) C++11
34 / 100
 499 ms 116160 KB 
#include <bits/stdc++.h>
using namespace std;
const int MXN = 1 << 20;
const int COEFF = 12;
char mem[COEFF*MXN];
int llink[COEFF*MXN];
int rlink[COEFF*MXN];
int root;
int nodesz;
vector<int> rootlist;
vector<int> lens;
inline int newnode(int o = -1){
    int c = ++nodesz;
    if(o != -1){
        llink[c] = llink[o];
        rlink[c] = rlink[o];
        mem[c] = mem[o];
    }
    return c;
}
inline int build(int l, int r){
    int c = newnode();
    if(l == r) return c;
    int k = (l+r)/2;
    llink[c] = build(l,k);
    rlink[c] = build(k+1,r);
    return c;
}
inline int update(int o, int& idx, char& upd, int lb, int rb){
    int nr = newnode(o);
    int b = nr;
    while(lb != rb){
        int k = (lb + rb)/2;
        if(idx <= k){
            rb = k;
            llink[nr] = newnode(llink[nr]);
            nr = llink[nr];
        }else{
            lb = k+1;
            rlink[nr] = newnode(rlink[nr]);
            nr = rlink[nr];
        }
    }
    mem[nr] = upd;
    return b;
}
inline char query(int c, int& idx, int lb, int rb){
    while(lb != rb){
        int k = (lb + rb)/2;
        if(idx <= k){
            rb = k;
            c = llink[c];
        }else{
            lb = k+1;
            c = rlink[c];
        }
    }
    return mem[c];
}
void Init() {
    root = build(0, MXN-1);
    rootlist.push_back(root);
    lens.push_back(0);
}
void TypeLetter(char L) {
    int l = lens.back();
    int o = rootlist.back();
    int c = update(o, l, L, 0, MXN-1);
    rootlist.push_back(c);
    lens.push_back(l+1);
}
void UndoCommands(int U) {
    int vn = rootlist.size() - 1 - U;
    lens.push_back(lens[vn]);
    rootlist.push_back(rootlist[vn]);
}
char GetLetter(int P) {
    return query(rootlist.back(), P, 0, MXN-1);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 16768 KB Output is correct
2 Correct 18 ms 16768 KB Output is correct
3 Correct 19 ms 16768 KB Output is correct
4 Correct 20 ms 16804 KB Output is correct
5 Correct 29 ms 16840 KB Output is correct
6 Correct 19 ms 16768 KB Output is correct
7 Correct 19 ms 16768 KB Output is correct
8 Correct 18 ms 16760 KB Output is correct
9 Correct 19 ms 16760 KB Output is correct
10 Correct 19 ms 16768 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 16768 KB Output is correct
2 Correct 19 ms 16768 KB Output is correct
3 Correct 19 ms 16768 KB Output is correct
4 Correct 19 ms 16768 KB Output is correct
5 Correct 19 ms 16768 KB Output is correct
6 Correct 18 ms 16768 KB Output is correct
7 Correct 21 ms 16760 KB Output is correct
8 Correct 18 ms 16768 KB Output is correct
9 Correct 19 ms 16768 KB Output is correct
10 Correct 19 ms 16740 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 17016 KB Output is correct
2 Correct 21 ms 17152 KB Output is correct
3 Correct 20 ms 17152 KB Output is correct
4 Correct 20 ms 17404 KB Output is correct
5 Correct 19 ms 17152 KB Output is correct
6 Correct 20 ms 17528 KB Output is correct
7 Correct 21 ms 17536 KB Output is correct
8 Correct 20 ms 17280 KB Output is correct
9 Correct 20 ms 17356 KB Output is correct
10 Correct 22 ms 17152 KB Output is correct

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Execution timed out 219 ms 114212 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 397 ms 112848 KB Output is correct
2 Correct 499 ms 101172 KB Output is correct
3 Correct 386 ms 109900 KB Output is correct
4 Correct 426 ms 85292 KB Output is correct
5 Execution timed out 279 ms 116160 KB Time limit exceeded (wall clock)
6 Halted 0 ms 0 KB -