Submission #1216629

#	Time	Username	Problem	Language	Result	Execution time	Memory
1216629		JooDdae	Towns (IOI15_towns)	C++20	0 / 100	9 ms	512 KiB

towns

#include "towns.h"
#include <bits/stdc++.h>
using namespace std;

int hubDistance(int N, int sub) {
    vector<vector<int>> D(N, vector<int>(N, 0));
    for(int i=1;i<N;i++) D[0][i] = D[0][i] = getDistance(0, i);
    int E = max_element(D[0].begin(), D[0].end()) - D[0].begin();
    for(int i=0;i<N;i++) if(i != E) D[E][i] = D[i][E] = getDistance(E, i);
    int X = max_element(D[E].begin(), D[E].end()) - D[E].begin();

    vector<int> C(N, 0);
    for(int i=1;i<N;i++) if(i != E) C[i] = (D[E][i]+D[0][E] - D[0][i])/2;

    int R = 0;
    for(int i=1;i<N;i++) if(i != E) R = max(R, max(C[i], D[E][X]-C[i]));
	return R;
}

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