제출 #961966

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
961966		rnazymxan	Vlak (COCI20_vlak)	C++17	70 / 70	16 ms	22620 KiB

Main

	#include<iostream>
	#include<unordered_map>
	#include<vector>
	using namespace std;

	#define ll long long

	void init_code(){
		#ifndef ONLINE_JUDGE
		freopen("input.txt", "r", stdin);
		freopen("output.txt", "w", stdout);
		#endif
	}

	const int N = 1e5 + 11;

	struct Node {
		Node* node[26];

		Node(){
			for(int i = 0; i < 26; i++){
				node[i] = NULL;
			}
		}

	};


	void add(Node* root, string s){
		int ptr = 0;
		int n = s.size();
		while(ptr < n){
			if(root->node[s[ptr] - 'a'] != NULL){
				root = root->node[s[ptr] - 'a'];
			}else{
				root->node[s[ptr] - 'a'] = new Node();
				root = root->node[s[ptr] - 'a'];
			}
			ptr++;
		}
	}

	bool win(Node* trie1, Node* trie2){
		for(int i = 0; i < 26; i++){
			if(trie1->node[i] != NULL && trie2->node[i] == NULL){
				return true;
			}
		}

		bool hehe = false;

		for(int i = 0; i < 26; i++){
			if(trie1->node[i] != NULL){
				hehe |= !win(trie2 -> node[i], trie1 -> node[i]);
			}
		}


		return hehe;
	}

	int main(){
		ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);		
		// init_code();
	
		int n;
		string s;
		cin >> n;
		Node *trie1 = new Node();
		Node *trie2 = new Node();
		while(n--){
			cin >> s;
			add(trie1, s);
		}

		cin >> n;

		while(n--){
			cin >> s;
			add(trie2, s);
		}

		if(win(trie1, trie2)){
			cout << "Nina";
		}else{
			cout << "Emilija";
		}


	}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In function 'void init_code()':
Main.cpp:10:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |   freopen("input.txt", "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:11:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |   freopen("output.txt", "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

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