# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102416 | CaroLinda | Towns (IOI15_towns) | C++14 | 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 "towns.h"
#include <bits/stdc++.h>
#define lp(i,a,b) for(int i = a ; i < b ; i++)
#define ff first
#define ss second
#define pii pair<int,int>
#define INF 1000010*110
const int MAXN = 120 ;
using namespace std;
int m[MAXN][MAXN] ;
int d[MAXN] ;
void ini()
{
lp(i,0,MAXN) lp(j, 0 , MAXN) m[i][j] = -1 ;
}
int query(int A ,int N)
{
pii p = pii(-1,-1) ;
lp(i,0,N)
{
if( i == A ) continue ;
m[A][i] = getDistance(A,i) ;