oj.uz

Submission #76860

# Submission time Handle Problem Language Result Execution time Memory
76860 2018-09-18T18:21:48 Z FiloSanza Crayfish scrivener (IOI12_scrivener) C++14
34 / 100
 1000 ms 189720 KB 
#include <bits/stdc++.h>

using namespace std;

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

	Node(char val, int depth) : val(val), depth(depth), father(nullptr){
		figli.resize(MAX_SIZE, nullptr);
	}
	Node(char val, int depth, Node* N) : val(val), depth(depth), father(N){
		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);
	}
	//Devo aggiungere nell'ultima versione il carattere(New Node se non esiste) e aggiungere una versione
	void insert(char c){
		int val = c - 'a';
		//Non esiste, lo creo
		if(version[curr]->figli[val] == nullptr){
			version[curr]->figli[val] = new Node(c, version[curr]->depth+1, version[curr]);
		}
		//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++;
	}

	char getKth(int k){
		Node* node = version[curr];
		while(node->depth != k){
			node = node->father;
		}
		return node->val;
	}
};

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);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 496 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 608 KB Output is correct
7 Correct 2 ms 628 KB Output is correct
8 Correct 2 ms 652 KB Output is correct
9 Correct 2 ms 768 KB Output is correct
10 Correct 2 ms 768 KB Output is correct

Subtask #2
7.0 / 7.0

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

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1264 KB Output is correct
2 Correct 4 ms 1280 KB Output is correct
3 Correct 14 ms 1320 KB Output is correct
4 Correct 4 ms 1732 KB Output is correct
5 Correct 4 ms 1732 KB Output is correct
6 Correct 4 ms 2004 KB Output is correct
7 Correct 4 ms 2004 KB Output is correct
8 Correct 5 ms 2004 KB Output is correct
9 Correct 9 ms 2004 KB Output is correct
10 Correct 3 ms 2004 KB Output is correct

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1077 ms 189720 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 1055 ms 189720 KB Time limit exceeded
2 Halted 0 ms 0 KB -