제출 #489670

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
489670	2021-11-23 18:19:10	fuad27	Odašiljači (COCI20_odasiljaci)	C++17	70 / 70	103 ms	392 KiB

odasiljaci

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<bits/stdc++.h>
using namespace std;
const long double eps = 1e-7;
int n, cnt;
const int maxn = 1010;
pair<int, int> v[maxn];
bool visited[maxn];
long double dist(pair<int, int> x, pair<int, int> y) {
  return sqrt((long double)(x.first - y.first) * (x.first - y.first) +
         (long double)(x.second - y.second) * (x.second - y.second));
}
void dfs(int x, long double r) {
  cnt++;
  visited[x] = 1;
  for (int i = 0; i < n; i++) {
    if (i != x and visited[i] == 0 and dist(v[x], v[i]) < 2 * r) {
      dfs(i, r);
    }
  }
}
bool check(long double r) {
  memset(visited, 0, sizeof visited);
  cnt = 0;  
  dfs(0, r);
  return cnt == n;
}
int main () {
  cin >> n;
  for(int i = 0;i<n;i++) {
    cin >> v[i].first >> v[i].second;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 70 / 70