제출 #420582

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
420582		LouayFarah	도시들 (IOI15_towns)	C++14	0 / 100	43 ms	844 KiB

towns

#include "bits/stdc++.h"
#include "towns.h"
using namespace std;
 
vector<vector<int>> dist;
vector<int> em;
 
int getDistance(int i, int j);
 
int hubDistance(int n, int sub)
{
    em.assign(n, 0);
    dist.assign(n, em);
 
    for(int i = 0; i<n; i++)
    {
        for(int j = i+1; j<n; j++)
        {
            int d = getDistance(i, j);
            dist[i][j] = d;
            dist[j][i] = d;
        }
    }
 
    int R = 1e9;
 
    for(int i = 0; i<n; i++)
    {
        for(int j = i+1; j<n; j++)
        {
            int node = -1;
            int maxi = -1;
            for(int k = 0; k<n; k++)
            {
                if(k==i||k==j)
                    continue;
 
                if(dist[i][k]+dist[j][k]>maxi)
                {
                    maxi = dist[i][k] + dist[j][k];
                    node = k;
                }
            }
 
            int temp = (dist[i][node] + dist[j][node] - dist[i][j])/2;
            R = min(R, temp);
        }
    }
 	
  	if(sub==2)
    	return R;
  	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