Submission #718993

#	Time	Username	Problem	Language	Result	Execution time	Memory
718993		Karuk	Towns (IOI15_towns)	C++14	25 / 100	19 ms	888 KiB

towns

#include "towns.h"
#include<bits/stdc++.h>
using namespace std;
map<pair<int,int>,int>m;
int getmindist(int d1,int d2,int d3) {
    int dd=(d1+d2-d3)/2;
    int d=(d1+d3-d2)/2;
    int ddd=(d2+d3-d1)/2;
    return max(max(d,dd),ddd);
}
int hubDistance(int n,int sub) {
    int maxd=0,maxind=0;
    int md=0;
    for(int i=1;i<n;i++) {
        int p=getDistance(0,i);
        m[{0,i}]=m[{i,0}]=p;
        if(maxd<p) {
            maxd=p;
            maxind=i;
        }
    }
    md=maxind;
    maxd=0;
    maxind=0;
    for(int i=0;i<n;i++) {
        if(i==md)continue;
        int p=getDistance(md,i);
        m[{md,i}]=m[{i,md}]=p;
        if(maxd<p) {
            maxd=p;
            maxind=i;
        }
    }
    int minr=INT_MAX;
    for(int i=0;i<n;i++) {
        if(i==md || i==maxind)continue;
        minr=min(minr,getmindist(maxd,m[{i,md}],getDistance(i,maxind)));
    }
    return minr;
}

Compilation message (stderr)

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:11:27: warning: unused parameter 'sub' [-Wunused-parameter]
   11 | int hubDistance(int n,int sub) {
      |                       ~~~~^~~

• Subtask 1: 13 / 13
• Subtask 2: 12 / 12
• Subtask 3: 0 / 13
• Subtask 4: 0 / 10
• Subtask 5: 0 / 13
• Subtask 6: 0 / 39