This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int n,m,k,s,p[6005],l[6005];
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(len>k)
break;
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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |