Submission #403453

#	Time	Username	Problem	Language	Result	Execution time	Memory
403453		zaneyu	족보 (KOI18_family)	C++14	0 / 100	1 ms	460 KiB

family

/*input
7 8 4

7 7 6 6 0 5 5

6 7 7 8 0 5 5 5
*/
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define ll long long
#define pii pair<int,int> 
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define f first
#define s second
#define sz(x) (int)x.size()
const int maxn=2e3+5;
vector<int> v[maxn],v2[maxn];
vector<int> vv[maxn],vv2[maxn];
void dfs(int u){
    if(!sz(v[u])) vv[u].pb(u);
    for(int x:v[u]){
        dfs(x);
        for(auto z:vv[x]) vv[u].pb(z);
    }
}
void dfs2(int u){
    if(!sz(v2[u])) vv2[u].pb(u);
    for(int x:v2[u]){
        dfs2(x);
        for(auto z:vv2[x]) vv2[u].pb(z);
    }  
}
int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n,m,k;
    cin>>n>>m>>k;
    REP(i,n){
        int x;
        cin>>x;
        --x;
        if(x!=-1) v[x].pb(i);
    }
    REP(i,m){
        int x;
        cin>>x;
        --x;
        if(x!=-1) v2[x].pb(i);
    }
    dfs(0),dfs2(0);
    REP(i,n) sort(ALL(v[i]));
    REP(i,m) sort(ALL(v2[i]));
    REP(i,n){
        bool ok=0;
        REP(j,m){
            if(v[i]==v2[j]){
                ok=1;
            }
        }
        if(!ok){
            cout<<"NO";
            return 0;
        }
    }
    cout<<"YES";
}

• Subtask 1: 0 / 17
• Subtask 2: 0 / 27
• Subtask 3: 0 / 15
• Subtask 4: 0 / 41