제출 #1051377

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1051377		12345678	File Paths (BOI15_fil)	C++17	33 / 100	325 ms	1000 KiB

fil

#include <bits/stdc++.h>

using namespace std;

const int nx=6e3+5;

int n, m, k, sz, pa[nx], dist[nx], w, res[nx];
vector<pair<int, int>> d[nx];

void dfs(int u)
{
    //cout<<"dist "<<u<<' '<<dist[u]<<'\n';
    for (auto [v, w]:d[u]) dist[v]=dist[u]+w, dfs(v);
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m>>k>>sz;
    for (int i=1; i<=n; i++) cin>>pa[i]>>w, d[pa[i]].push_back({i, w+1});
    for (int i=n+1; i<=n+m; i++) cin>>pa[i]>>w, d[pa[i]].push_back({i, w+1});
    dfs(0);
    for (int i=n+1; i<=n+m; i++)
    {
        if (dist[i]==k) res[i]=1;
        set<int> s;
        s.insert(0);
        int tmp=i;
        while (tmp!=0) s.insert(dist[i]-dist[pa[tmp]]), tmp=pa[tmp];
        for (int j=0; j<=n; j++) if (s.find(k-dist[j]-sz-1)!=s.end()) res[i]=1;
        if (res[i]) cout<<"YES\n";
        else cout<<"NO\n"; 
    }
}

• Subtask 1: 0 / 33
• Subtask 2: 33 / 33
• Subtask 3: 0 / 34