oj.uz

Submission #60188

# Submission time Handle Problem Language Result Execution time Memory
60188 2018-07-23T20:26:44 Z istlemin Towns (IOI15_towns) C++14
13 / 100
 41 ms 3272 KB 
#include "towns.h"
#include<bits/stdc++.h>

using namespace std;

#define rep(i,a,b) for(int i = a; i<int(b);++i)
#define all(v) v.begin(),v.end()
#define sz(v) v.size()
#define trav(a,c) for(auto a: c)

typedef int ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pii;

ll n;

vector<vi> distMem;

ll distance(ll a,ll b){
    //if(distMem[a][b]!=-1) return distMem[a][b];
    return getDistance(a,b);//distMem[a][b] = distMem[b][a] = getDistance(a,b);
}

pii getFurthest(ll v){
	ll furthest = 0;
    ll mx = 0;
    rep(i,0,n){
		ll dist = distance(v,i);
        if(dist>mx){
            mx = dist;
            furthest = i;
        }
    }
    return {furthest,mx};
}

int hubDistance(int N, int sub) {
	n = N;
	distMem.resize(n+1,vi(n+1,-1));
	ll diaA = getFurthest(0).first;
    pii tmp = getFurthest(diaA);
    ll diaB = tmp.first;
    ll diameter = tmp.second;

    map<ll,ll> pointsOnDiameter;

    rep(i,0,n){
        if(i==diaA||i==diaB) continue;

        ll distA = distance(i,diaA);
        ll distB = distance(i,diaB);

		ll distFromDiameter = (distA+distB-diameter)/2;

        pointsOnDiameter[distA-distFromDiameter]++;
    }

    ll minR = 1e9;
    ll center = 0;

    trav(x,pointsOnDiameter){
		ll currR = max(x.first,diameter-x.first);
		if(currR<minR){
            center = x.first;
            minR = currR;
		}
    }
    return minR;
    //if(pointsOnDiameter[center]<=n/2) return
}

Compilation message

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:59:8: warning: variable 'center' set but not used [-Wunused-but-set-variable]
     ll center = 0;
        ^~~~~~
towns.cpp:37:28: warning: unused parameter 'sub' [-Wunused-parameter]
 int hubDistance(int N, int sub) {
                            ^~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 956 KB Output is correct
2 Correct 25 ms 1456 KB Output is correct
3 Correct 3 ms 1584 KB Output is correct
4 Correct 41 ms 2156 KB Output is correct
5 Correct 34 ms 2764 KB Output is correct

Subtask #2
0 / 12.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 13.0

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

Subtask #6
0 / 39.0

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