# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
113294 | TadijaSebez | Towns (IOI15_towns) | C++11 | 28 ms | 1060 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 "towns.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int N=120;
int n,cen,den;
int a[N],b[N],len[N],pl[N];
int d[N][N],diam;
bool was[N][N];
int Ask(int i, int j)
{
if(i==j) return 0;
if(!was[i][j]) d[i][j]=d[j][i]=getDistance(i,j);
was[i][j]=was[j][i]=1;
return d[i][j];
}
bool Compare(int u, int v)
{
return len[u]+len[v]!=Ask(u,v);
}
bool Try(int d)
{
vector<int> work;
int lo=1,hi=0;
for(int i=0;i<n;i++) if(i!=cen)
{
int tmp=pl[i];
if(tmp<d) lo++;
if(tmp>d) hi++;
if(tmp==d) work.pb(i);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |