oj.uz

Submission #360149

# Submission time Handle Problem Language Result Execution time Memory
360149 2021-01-27T14:33:46 Z beksultan04 Towns (IOI15_towns) C++14
25 / 100
 20 ms 492 KB 
#include "towns.h"
#ifndef EVAL
#include "grader.cpp"
#endif // EVAL
#include <bits/stdc++.h>
using namespace std;
#define lol long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scanl(a) scanf("%lld",&a);
#define scanll(a,b) scanf("%lld %lld",&a, &b);
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-12
int dist[1000],distv[1000],distu[1000],a[1000],b[1000],c[1000];
int hubDistance(int N, int sub) {
	int i,mx=0,j,v,u=0,len=2e9+7;
	for( i=0;i<N;++i){
        dist[i] = getDistance(0,i);
        if (dist[i] > mx){
            mx = dist[i];
            v = i;
        }
	}
	mx = 0;
	for (i=0;i<N;++i){
        if (i == v)continue;
        distv[i] = getDistance(v,i);
        if (mx < distv[i]){
            mx = distv[i];
            u = i;
        }
	}
	mx = 0;
	for (i=0;i<N;++i){
        if (i == v || i == u)continue;
        distu[i] = getDistance(u,i);
	}
	for (i=0;i<N;++i){
        if (i == v || i == u)continue;
        a[i] = (distv[i]+distu[i]-distv[u])/2;
        b[i] = (distv[i]+distv[u]-distu[i])/2;
        c[i] = (distu[i]+distv[u]-distv[i])/2;
    
        len = min(len,max(max(a[i],b[i]),c[i]));
	}
	int r=0,l=0,m=0;
	for (i=0;i<N;++i){
        if (c[i] > len)r++;
        else if (b[i] < len)l++;
        else m++;
	}
	if (r <= N/2 && l <= N/2 && m <= N/2)ret len;
	{
	    
	    
        r=0,l=0,m=0;
        for (i=0;i<N;++i){
            if (b[i] > len)r++;
            else if (c[i] < len)l++;
            else m++;
        }
        if (r <= N/2 && l <= N/2 && m <= N/2)ret len;
	}
	
	
	
	ret -len;
}

Compilation message

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:29:13: warning: unused variable 'j' [-Wunused-variable]
   29 |  int i,mx=0,j,v,u=0,len=2e9+7;
      |             ^
towns.cpp:28:28: warning: unused parameter 'sub' [-Wunused-parameter]
   28 | int hubDistance(int N, int sub) {
      |                        ~~~~^~~
towns.cpp:52:15: warning: 'v' may be used uninitialized in this function [-Wmaybe-uninitialized]
   52 |         if (i == v || i == u)continue;
      |             ~~^~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 492 KB Output is correct
2 Correct 15 ms 492 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 20 ms 364 KB Output is correct
5 Correct 20 ms 364 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 364 KB Output is correct
2 Correct 15 ms 364 KB Output is correct
3 Correct 20 ms 396 KB Output is correct
4 Correct 20 ms 364 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 364 KB Output isn't correct

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -