Submission #784287

#	Time	Username	Problem	Language	Result	Execution time	Memory
784287		Lyrically	Towns (IOI15_towns)	C++17	13 / 100	14 ms	884 KiB

towns

#include<bits/stdc++.h>
#include "towns.h"
using namespace std;
#define pii pair<int,int>
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
int read(){int x;scanf("%d",&x);return x;}
void print(int x){printf("%d\n",x);}
void file(string s)
{
	freopen((s+".in").c_str(),"r",stdin);
	freopen((s+".out").c_str(),"w",stdout);
}
const int mod=998244353;
int hubDistance(int n,int subtsk)
{
	if(subtsk==1)
	{
		int dis[115][115];
		rep(i,n)
		{
			for(int j=i+1;j<n;j++)
			{
				int d=getDistance(i,j);
				dis[i][j]=dis[j][i]=d;
			}
		}
		int mx=0,l=0,r=0;
		rep(i,n)
		{
			for(int j=i+1;j<n;j++)
			{
				if(dis[i][j]>mx)
				{
					mx=dis[i][j];
					l=i;
					r=j;
				}
			}
		}
		//cout<<l<<" "<<r<<" "<<mx<<endl;
		int res=(1<<30);
		rep(i,n)
		{
			if(i==l||i==r){continue;}
			int fi=dis[i][l],se=dis[i][r];
			if((fi+se-mx)&1){continue;}
			int inter=(fi+se-mx)/2;
			int L=fi-inter,R=se-inter;
			res=min(res,max(L,R));
		}
		return res;
	}
	return 0;
}

Compilation message (stderr)

towns.cpp: In function 'int read()':
towns.cpp:8:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 | int read(){int x;scanf("%d",&x);return x;}
      |                  ~~~~~^~~~~~~~~
towns.cpp: In function 'void file(std::string)':
towns.cpp:12:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |  freopen((s+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
towns.cpp:13:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |  freopen((s+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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