oj.uz

Submission #485205

# Submission time Handle Problem Language Result Execution time Memory
485205 2021-11-06T15:00:09 Z alexdumitru Odašiljači (COCI20_odasiljaci) C++14
0 / 70
 4 ms 288 KB 
#include <bits/stdc++.h>
using namespace std;
int i,n,j;
double max1;
pair<double,double> v[1005];
int main()
{
    cin>>n;
    for(i=1;i<=n;i++)
        cin>>v[i].first>>v[i].second;
    for(i=1;i<=n;i++)
        for(j=i+1;j<=n;j++)
            max1=max(max1,sqrt((v[i].first-v[j].first)*(v[i].first-v[j].first)+(v[i].second-v[j].second)*(v[i].second-v[j].second)));
    cout<<max1/2;
    return 0;
}

Subtask #1
0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Incorrect 1 ms 204 KB Output isn't correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Incorrect 1 ms 204 KB Output isn't correct
5 Incorrect 0 ms 204 KB Output isn't correct
6 Incorrect 1 ms 288 KB Output isn't correct
7 Incorrect 1 ms 204 KB Output isn't correct
8 Incorrect 2 ms 204 KB Output isn't correct
9 Incorrect 4 ms 204 KB Output isn't correct
10 Incorrect 4 ms 204 KB Output isn't correct