oj.uz

Submission #314023

# Submission time Handle Problem Language Result Execution time Memory
314023 2020-10-17T22:12:32 Z joseacaz Crayfish scrivener (IOI12_scrivener) C++17
100 / 100
 787 ms 166776 KB 
#include <bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(), x.end()

using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;

const int LOG = 25;

struct Node
{
    Node* p[LOG];
    int len;
    char l;
};

const int MAXN = 1e6 + 5;
int curr = 0;
Node* last[MAXN];

void Init()
{
    last[0] = nullptr;
    curr = 1;
}

void TypeLetter(char L)
{
    last[curr] = new Node();
    last[curr] -> l = L;
    last[curr] -> len = (last[curr - 1] ? last[curr - 1] -> len : 0) + 1;
    last[curr] -> p[0] = last[curr - 1];
    

    for(int i = 1; i < LOG; i++)
        last[curr] -> p[i] = nullptr;
    for(int i = 1; i < LOG; i++)
        if(last[curr] -> p[i - 1] != nullptr)
            last[curr] -> p[i] = (last[curr] -> p[i - 1]) -> p[i - 1];

    curr++;
}

void UndoCommands(int U)
{
    last[curr] = last[curr - U - 1];
    curr++;
}

char GetLetter(int P)
{
    Node* aux = last[curr - 1];
    P = (aux -> len) - P - 1;
    
    for(int i = LOG - 1; i >= 0; i--)
        if(P & (1 << i))
            aux = (aux -> p[i]);
    return (aux -> l);
            
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 2 ms 640 KB Output is correct
3 Correct 2 ms 768 KB Output is correct
4 Correct 2 ms 1024 KB Output is correct
5 Correct 2 ms 768 KB Output is correct
6 Correct 3 ms 1152 KB Output is correct
7 Correct 3 ms 1152 KB Output is correct
8 Correct 2 ms 1024 KB Output is correct
9 Correct 2 ms 1024 KB Output is correct
10 Correct 2 ms 640 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 621 ms 136696 KB Output is correct
2 Correct 688 ms 150932 KB Output is correct
3 Correct 529 ms 148600 KB Output is correct
4 Correct 503 ms 120056 KB Output is correct
5 Correct 620 ms 129528 KB Output is correct
6 Correct 631 ms 163448 KB Output is correct
7 Correct 538 ms 81528 KB Output is correct
8 Correct 572 ms 121592 KB Output is correct
9 Correct 746 ms 166776 KB Output is correct
10 Correct 358 ms 122360 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 718 ms 117480 KB Output is correct
2 Correct 782 ms 104112 KB Output is correct
3 Correct 494 ms 114808 KB Output is correct
4 Correct 496 ms 86804 KB Output is correct
5 Correct 563 ms 124668 KB Output is correct
6 Correct 569 ms 117448 KB Output is correct
7 Correct 606 ms 125276 KB Output is correct
8 Correct 634 ms 61560 KB Output is correct
9 Correct 787 ms 107640 KB Output is correct
10 Correct 347 ms 121592 KB Output is correct