제출 #547679

#제출 시각아이디문제언어결과실행 시간메모리
547679nishkarshVlak (COCI20_vlak)C++14
70 / 70
16 ms10452 KiB
#include <bits/stdc++.h> #define ll long long #define ull unsigned long long #define pb push_back #define mp make_pair #define F first #define S second #define pii pair<int,int> #define pll pair<ll,ll> #define pcc pair<char,char> #define vi vector <int> #define vl vector <ll> #define sd(x) scanf("%d",&x) #define slld(x) scanf("%lld",&x) #define pd(x) printf("%d",x) #define plld(x) printf("%lld",x) #define pds(x) printf("%d ",x) #define pllds(x) printf("%lld ",x) #define pdn(x) printf("%d\n",x) #define plldn(x) printf("%lld\n",x) using namespace std; ll powmod(ll base,ll exponent,ll mod){ ll ans=1; if(base<0) base+=mod; while(exponent){ if(exponent&1)ans=(ans*base)%mod; base=(base*base)%mod; exponent/=2; } return ans; } ll gcd(ll a, ll b){ if(b==0) return a; else return gcd(b,a%b); } const int INF = 2e9; const ll INFLL = 4e18; const int upperlimit = 1e5+10; const int mod = 1e9+7; const int letters = 26; int to_int(char c){ int ans = (c-'a'); return ans; } int trie[upperlimit][letters]; int occ[upperlimit][2]; int node_cnt = 0; void addstring(string s,int player){ int node = 0; for(int i = 0; i < s.size(); i++){ if(! trie[node][to_int(s[i])]) trie[node][to_int(s[i])] = ++node_cnt; node = trie[node][to_int(s[i])]; occ[node][player]++; } } bool dfs(int node,int player){ bool ans=false; for(int i = 0; i < letters; i++) if(trie[node][i]) if(occ[trie[node][i]][player]) ans|=(1^dfs(trie[node][i],1^player)); return ans; } int main(){ int n,m; string s; cin >> n; for(int i = 1; i <= n; i++){ cin >> s; addstring(s,0); } cin >> m; for(int i = 1; i <= m; i++){ cin >> s; addstring(s,1); } if(dfs(0,0)) cout << "Nina"; else cout << "Emilija"; return 0; }

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

Main.cpp: In function 'void addstring(std::string, int)':
Main.cpp:50:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |  for(int i = 0; i < s.size(); i++){
      |                 ~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...