제출 #704939

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
704939		1075508020060209tc	Vlak (COCI20_vlak)	C++14	70 / 70	26 ms	20052 KiB

Main

//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define X first
#define Y second
int n;int m;
int __id=1;
int nxt[30][500005];
int vis[2][500005];
int visb[500005];
void insa(string s){
int nw=1;
vis[0][nw]=1;
for(int i=0;i<s.size();i++){
    int v=s[i]-'a';
    if(nxt[v][nw]==0){
        nxt[v][nw]=++__id;
    }
    nw=nxt[v][nw];
    vis[0][nw]=1;
}
}
void insb(string s){
int nw=1;
vis[1][nw]=1;
for(int i=0;i<s.size();i++){
    int v=s[i]-'a';
    if(nxt[v][nw]==0){
        nxt[v][nw]=++__id;
    }
    nw=nxt[v][nw];
    vis[1][nw]=1;
}
}
int dp[500005];
void dfs(int nw,int plyr){
dp[nw]=1;
for(int i=0;i<=29;i++){
    if(nxt[i][nw]==0){continue;}
    int v=nxt[i][nw];
    if(vis[plyr^1][v]==0){continue;}
    dfs(v,plyr^1);
    if(dp[v]==1){
        dp[nw]=0;
    }
}
}


signed main(){
cin>>n;
for(int i=1;i<=n;i++){
    string s;
    cin>>s;
    insa(s);
}
cin>>m;
for(int i=1;i<=m;i++){
    string s;
    cin>>s;
    insb(s);
}
dfs(1,1);

/*
for(int i=1;i<=__id;i++){
    cout<<dp[i]<<" ";
}cout<<endl;
for(int i=1;i<=__id;i++){
    cout<<vis[0][i]<<" ";
}cout<<endl;
for(int i=1;i<=__id;i++){
    cout<<vis[1][i]<<" ";
}cout<<endl;*/

if(!dp[1]){
    cout<<"Nina\n";
}else{
    cout<<"Emilija";
}

}

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

Main.cpp: In function 'void insa(std::string)':
Main.cpp:15:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 | for(int i=0;i<s.size();i++){
      |             ~^~~~~~~~~
Main.cpp: In function 'void insb(std::string)':
Main.cpp:27:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 | for(int i=0;i<s.size();i++){
      |             ~^~~~~~~~~

• 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