oj.uz

답안 #440619

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
440619 2021-07-02T14:38:29 Z codebuster_10 Vlak (COCI20_vlak) C++17
70 / 70
 38 ms 30132 KB 
#include <bits/stdc++.h>
using namespace std;

#define int int64_t //be careful about this 
#define endl "\n"
#define f(i,a,b) for(int i=int(a);i<int(b);++i)

#define pr pair
#define ar array
#define fr first
#define sc second
#define vt vector
#define pb push_back
#define eb emplace_back

#define SZ(x) ((int)(x).size())
#define all(a) (a).begin(),(a).end()
#define allr(a) (a).rbegin(),(a).rend()
#define mem(a,b) memset(a, b, sizeof(a))

template<class A> void rd(vt<A>& v);
template<class T> void rd(T& x){ cin >> x;}
template<class H, class... T> void rd(H& h, T&... t) { rd(h); rd(t...);}
template<class A> void rd(vt<A>& x) { for(auto& a : x) rd(a);}

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0;}
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0;}

template<typename T>
void __p(T a) {
  cout<<a; 
}
template<typename T, typename F>
void __p(pair<T, F> a) {
  cout<<"{";
  __p(a.first);
  cout<<",";
  __p(a.second);
  cout<<"}\n"; 
}
template<typename T>
void __p(std::vector<T> a) {
  cout<<"{";
  for(auto it=a.begin(); it<a.end(); it++)
    __p(*it),cout<<",}\n"[it+1==a.end()]; 
}
template<typename T, typename ...Arg>
void __p(T a1, Arg ...a) {
  __p(a1);
  __p(a...);
}
template<typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
  cout<<name<<" : ";
  __p(arg1);
  cout<<endl;
}
template<typename Arg1, typename ... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args) {
  int bracket=0,i=0;
  for(;; i++)
    if(names[i]==','&&bracket==0)
      break;
    else if(names[i]=='(')
      bracket++;
    else if(names[i]==')')
      bracket--;
  const char *comma=names+i;
  cout.write(names,comma-names)<<" : ";
  __p(arg1);
  cout<<" | ";
  __f(comma+1,args...);
}


void setIO(string s = "") {
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); 
  // remove this when size of input is not fixed.
  cin.exceptions(cin.failbit); 
	cout.precision(15);	cout << fixed;
  if(SZ(s)){
  	freopen((s+".in").c_str(),"r",stdin);
  	freopen((s+".out").c_str(),"w",stdout);
  }
}


/*********************************************Look Below******************************************************************/






































// 0 -> Nina, 1 -> Emilija

template<const int ALPHABET>
struct prefix_tree {
	
	struct trie_node {
  	int link[ALPHABET];
    int what;
    bool has[2];
 
    trie_node() {
      memset(link, -1, sizeof(link));
      memset(has,false,sizeof(has));
    }
	};
	
	vector<trie_node> trie;
	
	prefix_tree(){
		trie.emplace_back();
		trie[0].has[0] = trie[0].has[1] = true;
	}
	
	void create_node(int parent, int c) {
    trie.emplace_back();
    trie.back().what = c;
	}
	
	int get_or_create_node(int current, int c) {
    if (trie[current].link[c] < 0) {
      trie[current].link[c] = trie.size();
      create_node(current, c);
    }
    return trie[current].link[c];
	}
 
	int insert_str(const string &str,int whose) {
		int current = 0;
    for(char c : str){
      current = get_or_create_node(current, c - 'a');
      trie[current].has[whose] = true;
 		}
    return current;
	}
	
	int fun(){
		
		int N = SZ(trie);
		vt<array<bool,2>> dp(N);
		
		function<void(int)> dfs = [&](int i){
			for(int j = 0; j < ALPHABET; ++j) if(trie[i].link[j] > 0){
				dfs(trie[i].link[j]);
			}
			// calculate dp[i][0].
			if(trie[i].has[0]){
				bool done = false;
				for(int j = 0; j < ALPHABET; ++j) if(trie[i].link[j] > 0){
					int x = trie[i].link[j];
					if(trie[x].has[0] == true && dp[x][1] == false){
						done = true;
						dp[i][0] = true;
						break;
					}
				}
				if(!done){
					dp[i][0] = false;
				}
			}else{
				dp[i][0] = false;
			}
			
			// calculate dp[i][1].
			if(trie[i].has[1]){
				bool done = false;
				for(int j = 0; j < ALPHABET; ++j) if(trie[i].link[j] > 0){
					int x = trie[i].link[j];
					if(trie[x].has[1] == true && dp[x][0] == false){
						done = true;
						dp[i][1] = true;
						break;
					}
				}
				if(!done){
					dp[i][1] = false;
				}
			}else{
				dp[i][1] = false;
			}
			return;
		};
		
		dfs(0);
		
		return dp[0][0];
		
	}
};



 

prefix_tree<26> trie;

 

 

 

 

signed main(){
  setIO();
 	int n; rd(n);
 	vt<string> a(n);
 	rd(a);
 	
 	int m; rd(m);
 	vt<string> b(m);
 	rd(b);
 	
 	for(auto s : a){
 		trie.insert_str(s,0);
 	}
 	
 	for(auto s : b){
 		trie.insert_str(s,1);
 	}
 	
 	cout << (trie.fun() ? "Nina" : "Emilija");
}

Compilation message

Main.cpp: In function 'void setIO(std::string)':
Main.cpp:82:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |    freopen((s+".in").c_str(),"r",stdin);
      |    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:83:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |    freopen((s+".out").c_str(),"w",stdout);
      |    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 880 KB Output is correct
2 Correct 1 ms 876 KB Output is correct
3 Correct 1 ms 876 KB Output is correct
4 Correct 1 ms 876 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 880 KB Output is correct
2 Correct 1 ms 876 KB Output is correct
3 Correct 1 ms 828 KB Output is correct
4 Correct 1 ms 880 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 620 KB Output is correct
2 Correct 1 ms 876 KB Output is correct
3 Correct 1 ms 620 KB Output is correct
4 Correct 1 ms 876 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 620 KB Output is correct
2 Correct 1 ms 876 KB Output is correct
3 Correct 1 ms 876 KB Output is correct
4 Correct 1 ms 620 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 30132 KB Output is correct
2 Correct 36 ms 30056 KB Output is correct
3 Correct 37 ms 30004 KB Output is correct
4 Correct 37 ms 30008 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 29752 KB Output is correct
2 Correct 37 ms 29748 KB Output is correct
3 Correct 38 ms 29700 KB Output is correct
4 Correct 34 ms 29752 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 29932 KB Output is correct
2 Correct 34 ms 29816 KB Output is correct
3 Correct 38 ms 29888 KB Output is correct
4 Correct 37 ms 29884 KB Output is correct