제출 #452053

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
452053		Apiram	Vlak (COCI20_vlak)	C++14	0 / 70	67 ms	14104 KiB

Main

#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;cin>>n;
vector<string>arr(n);
int maxxy=0,minny=0;
for (int i =0;i<n;++i){cin>>arr[i];minny=max(minny,(int)arr[i].length());}
int m;cin>>m;
vector<string>brr(m);
for (int j = 0;j<m;++j){
	cin>>brr[j];
	maxxy=max(maxxy,(int)brr[j].length());
}
vector<set<string>>first(min(maxxy,minny)+1),second(min(maxxy,minny)+1);
for (int i = 0;i<n;++i){
	string s;
	for (int j = 0;j<min((int)arr[i].length(),min(minny,maxxy)+1);++j){
		s+=arr[i][j];
		first[j].insert(s);
	}
}
for (int i = 0;i<m;++i){
	string s;
	for (int j = 0;j<min((int)brr[i].length(),min(minny,maxxy)+1);++j){
		s+=brr[i][j];
		second[j].insert(s);
	}
}
int ok=0;
for (int i = 0;i<min(minny,maxxy)+1;++i){
	if (i%2==0){
		for (auto x:first[i]){
			if (second[i].find(x)==second[i].end()){
				ok=1;
				break;
			}
		}
	}
	else{
		for (auto x:second[i]){
			if (first[i].find(x)==first[i].end()){
				ok=2;
				break;
			}
		}
	}
	if (ok)break;
}
if (ok%2==1){
	cout<<"Nina\n";
}
else {
	cout<<"Emilija\n";
}

return 0;}

• 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