제출 #972756

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
972756		12345678	Vlak (COCI20_vlak)	C++17	70 / 70	14 ms	22696 KiB

Main

#include <bits/stdc++.h>

using namespace std;

int n, m;
string s;

struct node
{
    int w;
    node* p[26];
    node() {
        w=0;
        for (int i=0; i<26; i++) p[i]=0;
    }
};
typedef node* pnode;
pnode rt1=new node(), rt2=new node();

void build(pnode &k, int idx, int sz)
{
    if (idx==sz) return;
    if (!(k->p[s[idx]-'a'])) k->p[s[idx]-'a']=new node();
    build(k->p[s[idx]-'a'], idx+1, sz);
}

void solve(pnode l, pnode r)
{
    for (int i=0; i<26; i++) if (l->p[i]&&!(r->p[i])) return l->w=1, void();
    for (int i=0; i<26; i++) if (l->p[i]) solve(r->p[i], l->p[i]), l->w|=!(r->p[i]->w);
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=0; i<n; i++) cin>>s, build(rt1, 0, s.size());
    cin>>m;
    for (int i=0; i<m; i++) cin>>s, build(rt2, 0, s.size());
    solve(rt1, rt2);
    if (rt1->w) cout<<"Nina";
    else cout<<"Emilija";
}

• 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