# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
784277 | Lyrically | Towns (IOI15_towns) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.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)
{
map<int,int> vis;
rep1(i,n)
{
for(int j=i+1;j<=n;j++)
{
int d=getDistance(i,j);
vis[d]++;
}
}
int mx=0,freq=0;
for(auto v:vis)
{
if(v.second>freq){mx=v.first,freq=v.second;}
else if(v.second==freq)
{
mx=min(mx,v.first);
}
}
return mx;
}
return 0;
throw("hamood?hamood!");
}