제출 #346553

#제출 시각아이디문제언어결과실행 시간메모리
346553NursikOdašiljači (COCI20_odasiljaci)C++14
42 / 70
1099 ms3564 KiB
#include <bits/stdc++.h> #define f first #define s second #define ll long long #define pb push_back #define all(v) v.begin(),v.end() #define ld long double #define fi first #define se second using namespace std; void data() { #ifdef NURS freopen("main.in", "r", stdin); freopen("main.out", "w", stdout); #endif } void win() { ios_base::sync_with_stdio(0), cin.tie(0),cout.tie(0); } int block = 400; const ld eps = 1e-9; const int N = 1e6 + 500; const int mod = 1e9 + 7; const ll hh = 100010683; const ll hh2 = 150005819; int n, gw, x[2000], y[2000], was[2000]; vector<int> g[2000]; void dfs(int v) { if (was[v]) return; gw++; was[v] = 1; for (int i = 0; i < g[v].size(); i++) { int to = g[v][i]; dfs(to); } } bool check(ld xe) { for (int i = 1; i <= n; i++) { for (int j = i + 1; j <= n; j++) { if (sqrt((x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j])) <= xe + xe) { g[i].pb(j); g[j].pb(i); } } } dfs(1);; for (int i = 1; i <= n; i++) { if (!was[i]) return 0; } return 1; } main() { data(); win(); cin >> n; for (int i = 1; i <= n; i++) { cin >> x[i] >> y[i]; } ld l = 0, r = 1e12, ans; for (int i = 1; i <= 300; i++) { ld mid = (l + r) / 2.0; if (check(mid)) { r = mid - eps; ans = mid; } else { l = mid + eps; } for (int i = 1; i <= n; i++) { was[i] = 0; g[i].clear(); } } cout << fixed << setprecision(9) << ans; } /* Если я солью, то я обязательно затащю */

컴파일 시 표준 에러 (stderr) 메시지

odasiljaci.cpp: In function 'void dfs(int)':
odasiljaci.cpp:43:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |  for (int i = 0; i < g[v].size(); i++)
      |                  ~~^~~~~~~~~~~~~
odasiljaci.cpp: At global scope:
odasiljaci.cpp:70:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   70 | main()
      |      ^
#Verdict Execution timeMemoryGrader output
Fetching results...