제출 #96557

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
96557		janlivens	Towns (IOI15_towns)	C++14	0 / 100	25 ms	376 KiB

towns

// This  Program is made by Jan(Codezebra)
#include<bits/stdc++.h>
#include "towns.h"
using namespace std;

int table[111][111];

int get(int i,int j){
	if(table[i][j]==-1){
		table[i][j]=getDistance(i,j);
		table[j][i]=table[i][j];
	}
	return table[i][j];
}

int hubDistance(int n,int sub){
	
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			table[i][j]=-1;
		}
	}
	if(sub<3){
		int mx=0,my=0,ma=0;
	for(int i=0;i<n;i++){
	int d=get(i,0);
		if(d>ma){
			ma=d;
			mx=i;
		}
	}
	ma=0;
	for(int i=0;i<n;i++){
	int d=get(i,mx);
		if(d>ma){
			ma=d;
			my=i;
		}
	}
	cout<<mx<<" "<<my<<"\n";
	int ans=1e7;
	for(int i=0;i<n;i++){
		int a=get(i,mx),b=get(my,mx),c=get(i,my);
		ans=min(ans,max(a+b-c,max(a-b+c,-a+b+c)));
		cout<<ans<<"\n";
	}
	return ans/2;	
	}
}

컴파일 시 표준 에러 (stderr) 메시지

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:49:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

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