oj.uz

Submission #76863

# Submission time Handle Problem Language Result Execution time Memory
76863 2018-09-18T18:53:19 Z FiloSanza Crayfish scrivener (IOI12_scrivener) C++14
60 / 100
 1000 ms 246680 KB 
#include <bits/stdc++.h>

using namespace std;

struct Node{
	const int MAX_SIZE = 30;
	char val;
	int depth;
	Node* father;
	Node* kth;
	vector<Node*> figli;

	Node(char val, int depth) : val(val), depth(depth), father(nullptr), kth(nullptr){
		figli.resize(MAX_SIZE, nullptr);
	}
	Node(char val, int depth, Node* N, Node* kth) : val(val), depth(depth), father(N), kth(kth){
		figli.resize(MAX_SIZE, nullptr);
	}
};

struct Trie{
	Node *root = nullptr;
	vector<Node *> version;
	int curr = 0;
	//costruttore
	Trie(){
		root = new Node('\0', -1);
		version.push_back(root);
	}

	Node* getKth(int k){
		Node* node = version[curr];
		while(node->depth != k){
			node = (node->kth->depth >= k) ? node->kth : node->father;
		}
		return node;
	}
	//Devo aggiungere nell'ultima versione il carattere(New Node se non esiste) e aggiungere una versione
	void insert(char c){
		int val = c - 'a';
		int h = version[curr]->depth+1;
		//Non esiste, lo creo
		if(version[curr]->figli[val] == nullptr){
			Node* ancestor = (h-(h&(-h)) == 0) ? version[0] : getKth(h-(h&(-h)));
			version[curr]->figli[val] = new Node(c, h, version[curr], ancestor);
		}
		//aggiungo la nuova versione
		version.push_back(version[curr]->figli[val]);
		curr ++;
	}
	//Per tornare indietro di N versioni mi basta andare all'indice curr - k del vettore
	void goBack(int k){
		version.push_back(version[curr-k]);
		curr++;
	}

};

Trie t;

void Init() {}

void TypeLetter(char L) {
	t.insert(L);
}

void UndoCommands(int U) {
	t.goBack(U);
}

char GetLetter(int P) {
	return t.getKth(P)->val;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 564 KB Output is correct
10 Correct 2 ms 592 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 592 KB Output is correct
2 Correct 2 ms 620 KB Output is correct
3 Correct 2 ms 628 KB Output is correct
4 Correct 2 ms 628 KB Output is correct
5 Correct 2 ms 636 KB Output is correct
6 Correct 2 ms 636 KB Output is correct
7 Correct 2 ms 636 KB Output is correct
8 Correct 2 ms 636 KB Output is correct
9 Correct 2 ms 636 KB Output is correct
10 Correct 2 ms 636 KB Output is correct

Subtask #3
22.0 / 22.0

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

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 536 ms 186540 KB Output is correct
2 Correct 478 ms 205296 KB Output is correct
3 Correct 446 ms 205296 KB Output is correct
4 Correct 445 ms 205296 KB Output is correct
5 Correct 793 ms 205296 KB Output is correct
6 Correct 541 ms 225744 KB Output is correct
7 Correct 942 ms 225744 KB Output is correct
8 Correct 689 ms 225744 KB Output is correct
9 Correct 653 ms 246680 KB Output is correct
10 Correct 326 ms 246680 KB Output is correct

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 714 ms 246680 KB Output is correct
2 Correct 921 ms 246680 KB Output is correct
3 Correct 478 ms 246680 KB Output is correct
4 Correct 492 ms 246680 KB Output is correct
5 Correct 468 ms 246680 KB Output is correct
6 Correct 443 ms 246680 KB Output is correct
7 Correct 499 ms 246680 KB Output is correct
8 Correct 885 ms 246680 KB Output is correct
9 Execution timed out 1089 ms 246680 KB Time limit exceeded
10 Halted 0 ms 0 KB -