# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
935551 | 2024-02-29T09:06:08 Z | Faissel | Odašiljači (COCI20_odasiljaci) | C++17 | 12 ms | 488 KB |
#include<bits/stdc++.h> using namespace std; #define ll long long #define endl '\n' int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n;cin >> n; vector<pair<int,int>>v; for(int i=0;i<n;i++){ int x,y;cin >> x >> y; v.push_back({x,y}); } sort(v.begin(),v.end()); double maxx = -1e9; for(int i=0;i<v.size();i++){ double minx = 1e9; for(int j=0;j<v.size();j++){ int x = abs(v[i].first - v[j].first) * abs(v[i].first - v[j].first); int y = abs(v[i].second - v[j].second) * abs(v[i].second - v[j].second); if(sqrt(x + y) > 0) minx = min(minx,sqrt(x+y)); } maxx = max(maxx,minx); } cout << fixed << setprecision(7) << (maxx/2) << endl; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 1 ms | 344 KB | Output isn't correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Incorrect | 1 ms | 392 KB | Output isn't correct |
5 | Incorrect | 0 ms | 456 KB | Output isn't correct |
6 | Correct | 1 ms | 344 KB | Output is correct |
7 | Correct | 1 ms | 348 KB | Output is correct |
8 | Incorrect | 2 ms | 348 KB | Output isn't correct |
9 | Incorrect | 12 ms | 348 KB | Output isn't correct |
10 | Incorrect | 12 ms | 488 KB | Output isn't correct |