# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
950337 | vjudge1 | Datum (COCI20_datum) | C++17 | 2 ms | 604 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,d,sz[2001][3],all[2001],t=2,gs;
bool pd[2001];
int main()
{
scanf("%d%d",&n,&d);
for(int i=1;i<=n;i++)
scanf("%d%d",&sz[i][1],&sz[i][2]);
pd[1]=1;
gs++;
all[1]=1;
while(1)
{
int f=0;
for(int i=t;i<=n;i++)
{
if(pd[i]==0)
{
for(int j=1;j<=gs;j++)
{
int b=(sz[all[j]][1]-sz[i][1])*(sz[all[j]][1]-sz[i][1])+(sz[all[j]][2]-sz[i][2])*(sz[all[j]][2]-sz[i][2]);
if(d*d>=b)
{
pd[i]=1;
gs++;
all[gs]=i;
f=1;
while(pd[t]==1)
t++;
break;
}
}
}
}
if(f==0)
break;
}
for(int i=1;i<=n;i++)
{
if(pd[i]==1)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |