oj.uz

Submission #76870

# Submission time Handle Problem Language Result Execution time Memory
76870 2018-09-18T19:22:52 Z FiloSanza Crayfish scrivener (IOI12_scrivener) C++14
34 / 100
 838 ms 263168 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_LOG = 20;
const int MAX_SIZE = 26;
struct Node{
	char val;
	int depth;
	vector<Node*> figli;
	Node* father[MAX_LOG];

	Node(char val, int depth) : val(val), depth(depth){
		figli.resize(MAX_SIZE, nullptr);
		for(int i=0; i<MAX_LOG; i++)
			father[i] = nullptr;
	}
	Node(char val, int depth, Node* N) : val(val), depth(depth){
		figli.resize(MAX_SIZE, nullptr);
		father[0] = N;
		for(int i=1; i<MAX_LOG; i++)
			if(father[i-1] != nullptr)
				father[i] = father[i-1]->father[i-1];
			else
				father[i] == nullptr;
	}
};

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

	char getKth(int k){
		Node* node = version[curr];
		int L = node->depth - k;
		for(int i=0; (1<<i)<=L; i++)if(L&(1<<i)){
			node = node->father[i];
		}

		return node->val;
	}
	//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){
			version[curr]->figli[val] = new Node(c, h, 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++;
	}

};

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

Compilation message

scrivener.cpp: In constructor 'Node::Node(char, int, Node*)':
scrivener.cpp:25:15: warning: statement has no effect [-Wunused-value]
     father[i] == nullptr;
     ~~~~~~~~~~^~~~~~~~~~

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 500 KB Output is correct
4 Correct 2 ms 500 KB Output is correct
5 Correct 2 ms 500 KB Output is correct
6 Correct 2 ms 516 KB Output is correct
7 Correct 2 ms 576 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 620 KB Output is correct

Subtask #2
7.0 / 7.0

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

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1152 KB Output is correct
2 Correct 4 ms 1280 KB Output is correct
3 Correct 4 ms 1304 KB Output is correct
4 Correct 4 ms 1844 KB Output is correct
5 Correct 4 ms 1844 KB Output is correct
6 Correct 4 ms 2280 KB Output is correct
7 Correct 4 ms 2280 KB Output is correct
8 Correct 4 ms 2280 KB Output is correct
9 Correct 4 ms 2280 KB Output is correct
10 Correct 3 ms 2280 KB Output is correct

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 825 ms 251264 KB Output is correct
2 Runtime error 838 ms 263168 KB Execution killed with signal 9 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 749 ms 263168 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2 Halted 0 ms 0 KB -