# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
950337 | 2024-03-20T08:35:16 Z | vjudge1 | Datum (COCI20_datum) | C++17 | 2 ms | 604 KB |
#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
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Runtime error | 1 ms | 604 KB | Execution killed with signal 11 |
3 | Incorrect | 1 ms | 348 KB | Output isn't correct |
4 | Incorrect | 1 ms | 444 KB | Output isn't correct |
5 | Incorrect | 1 ms | 348 KB | Output isn't correct |
6 | Incorrect | 0 ms | 348 KB | Output isn't correct |
7 | Incorrect | 0 ms | 348 KB | Output isn't correct |
8 | Incorrect | 1 ms | 348 KB | Output isn't correct |
9 | Incorrect | 1 ms | 348 KB | Output isn't correct |
10 | Runtime error | 2 ms | 600 KB | Execution killed with signal 11 |