Submission #32320

#TimeUsernameProblemLanguageResultExecution timeMemory
32320dqhungdlFile Paths (BOI15_fil)C++14
0 / 100
0 ms2040 KiB
#include <bits/stdc++.h>
using namespace std;

int n,m,k,s,p[3005],l[3005];

void Sub1()
{
    for(int i=n+1;i<=n+m;i++)
    {
        int u=i,len=0;
        bool check=false;
        while(u>0)
        {
            len+=l[u];
            if((k-len)%s==0)
            {
                cout<<"YES\n";
                check=true;
                break;
            }
            u=p[u];
        }
        if(check==false)
            cout<<"NO\n";
    }
}

int main()
{
    cin>>n>>m>>k>>s;
    s++;
    for(int i=1;i<=n+m;i++)
    {
        cin>>p[i]>>l[i];
        l[i]++;
    }
    if(n<=500&&m<=500)
        Sub1();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...