oj.uz

Submission #910036

# Submission time Handle Problem Language Result Execution time Memory
910036 2024-01-17T18:37:57 Z Macker Crayfish scrivener (IOI12_scrivener) C++17
34 / 100
 1000 ms 13868 KB 
#include <bits/stdc++.h>
 
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(v) v.begin(), v.end()

//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")

struct node {
    char c;
    node* par;
    int len;
    vector<pair<node*, int>> undo;
};
typedef node* pnode;

pnode root;
pnode cur;

void Init() {
    root = new node();
    root->len = -1;
    cur = root;
}

void TypeLetter(char L) {
    pnode tmp = new node();
    tmp->par = cur;
    tmp->undo.push_back({cur, cur->undo.size() - 1});
    tmp->c = L;
    tmp->len = cur->len + 1;
    cur = tmp;
}

void UndoCommands(int U) {
    pnode tmp = cur;
    int b = tmp->undo.size() - 1;
    while(U--){
        int tb = tmp->undo[b].second;
        tmp = tmp->undo[b].first;
        b = tb;
    }
    tmp->undo.push_back({cur, cur->undo.size() - 1});
    cur = tmp;
}

char GetLetter(int P) {
    pnode tmp = cur;
    while(tmp->len > P){
        tmp = tmp->par;
    }
    return tmp->c;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 3 ms 604 KB Output is correct
3 Correct 13 ms 624 KB Output is correct
4 Correct 8 ms 604 KB Output is correct
5 Correct 9 ms 604 KB Output is correct
6 Correct 6 ms 604 KB Output is correct
7 Correct 4 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 6 ms 604 KB Output is correct
10 Correct 5 ms 620 KB Output is correct

Subtask #4
0 / 26.0

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

Subtask #5
0 / 40.0

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