oj.uz

Submission #16527

# Submission time Handle Problem Language Result Execution time Memory
16527 2015-08-27T07:27:49 Z gs13068 Towns (IOI15_towns) C++
0 / 100
 21 ms 1180 KB 
#include "towns.h"
#include <algorithm>

int d[111][111];

int getDist(int i,int j)
{
	if(i==j)return 0;
	if(i>j)std::swap(i,j);
	if(!d[i][j])d[i][j]=getDistance(i,j);
	return d[i][j];
}

int hubDistance(int n, int s)
{
	int m1,m2;
    int i;
    for(i=m1=0;i<n;i++)if(getDist(0,i)>getDist(0,m1))m1=i;
    for(i=m2=0;i<n;i++)if(getDist(m1,i)>getDist(m1,m2))m2=i;
    return(getDist(0,m1)+getDist(m1,m2)-getDist(0,m2))/2;
}

Subtask #1
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 1180 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Halted 0 ms 0 KB -

Subtask #3
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Halted 0 ms 0 KB -

Subtask #4
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 1180 KB Output isn't correct

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1180 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 39.0

# Verdict Execution time Memory Grader output
1 Halted 0 ms 0 KB -