# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
32324 | dqhungdl | File Paths (BOI15_fil) | C++14 | 0 ms | 2220 KiB |
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 Sub2()
{
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(len==k||len+s==k)
{
printf("YES\n");
check=true;
break;
}
u=p[u];
}
if(check==false)
printf("NO\n");
}
}
int main()
{
ios_base::sync_with_stdio(false);
//freopen("FIL.INP","r",stdin);
scanf("%d%d%d%d",&n,&m,&k,&s);
s++;
for(int i=1;i<=n+m;i++)
{
scanf("%d%d",&p[i],&l[i]);
l[i]++;
}
if(n<=3000&&m<=3000)
Sub2();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |