제출 #661165

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
661165		as111	Type Printer (IOI08_printer)	C++14	0 / 100	25 ms	55048 KiB

printer

#include <iostream>
#include <vector>
#include <string>

#define MAXN 25000

using namespace std;

struct Trie {
	int nex[26]; // index of next trie for each letter
	int prev; // parent
	bool end; // end of a word
	Trie() {
		fill(nex, nex + 26, -1);
		prev = -1;
		end = false;
	}
};
Trie tries[MAXN * 20 + 5];
int N;
char letters[200]; // store letter for each ascii value
int index = 1;
int wc = 0; //word count
void traverse(int curr) {
	for (int c = 0; c < 26; c++) { // loop through each letter
		if (tries[curr].nex[c] != -1) {
			cout << letters[c] << endl;
			traverse(tries[curr].nex[c]);
			if (wc == N) return;
 			cout << "-" << endl;
		}
	}
	if (tries[curr].end) {
		cout << "P" << endl;
		wc++;
	}
	return;
}
int main() {
	
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10