제출 #1080197

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1080197		Trumling	도시들 (IOI15_towns)	C++14	13 / 100	10 ms	556 KiB

towns

    #include "towns.h"
    #include<bits/stdc++.h>
    using namespace std;
     
    #define F first
    #define S second
    #define pb push_back
    #define all(x) x.begin(),x.end()
    #define INF 9999999999999
    typedef long long ll;
     
    int hubDistance(int N, int sub) {
    	ll n=N;
    	vector<vector<ll>>g(N,vector<ll>(N));
     
    	ll maxi=-1;
    	pair<ll,ll>curr;
    	for(int i=0;i<n;i++)
    		for(int j=i+1;j<n;j++)
    		{
    			ll R=getDistance(i,j);
    			g[i][j]=R;
    			g[j][i]=R;
     
    			if(maxi<R)
    				{
    					maxi=g[i][j];
    					curr={i,j};
    				}
    		}
     
    	ll ans=INF;
    	for(int i=0;i<n;i++)
    		if(i!=curr.F && i!=curr.S)
    		{
    			ll f=(g[i][curr.F] + g[i][curr.S] - maxi)/2;
    			ans=min(ans,max(g[i][curr.F]-f,g[i][curr.S]-f));
    		}
		int tf=1;
		vector<bool>vis(n,0);
		for(int i=0;i<n;i++)
    		if(i!=curr.F && i!=curr.S && !vis[i])
			{
				vis[i]=1;
				ll count=0;
				for(int j=0;j<n;j++)
					if(j!=i)
    				{
    				ll f1=(g[i][curr.F] + g[i][curr.S] - maxi)/2;
					ll f2=(g[j][curr.F] + g[j][curr.S] - maxi)/2;
					
					if(g[i][j]<max(f1,f2))
						{
							vis[j]=1;
							count++;
						}
					}
				if(count>n/2)
				tf=-1;
    		}	
		
    	return ans*tf;
    }

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

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:33:6: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   33 |      for(int i=0;i<n;i++)
      |      ^~~
towns.cpp:39:3: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   39 |   int tf=1;
      |   ^~~
towns.cpp:62:16: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   62 |      return ans*tf;
      |             ~~~^~~
towns.cpp:12:32: warning: unused parameter 'sub' [-Wunused-parameter]
   12 |     int hubDistance(int N, int sub) {
      |                            ~~~~^~~

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