oj.uz

Submission #96571

# Submission time Handle Problem Language Result Execution time Memory
96571 2019-02-10T10:40:58 Z rubenvd Towns (IOI15_towns) C++14
25 / 100
 25 ms 632 KB 
#include <bits/stdc++.h>
#include "towns.h"
using namespace std;
/*int dis[110][110];

int getDistance( int i, int j ){
	return dis[i][j];
}*/

int hubDistance( int n, int sub ){
	int m[n][n], s, t, maxd = -1;
	for( int i = 0; i < n; ++i )
		for( int j = 0; j < n; ++j )
			m[i][j] = -1;

	int maxi = -1;
	for( int i = 0; i < n; ++i ){
		int disI = getDistance(i, 0);
		m[0][i] = m[i][0] = disI;
		if( disI > maxi ){
			maxi = disI;
			s = i;
		}
	}

	for( int i = 0; i < n; ++i ){
		int disT = getDistance(s, i);
		m[s][i] = m[i][s] = disT;
		if( disT > maxd ){
			maxd = disT;
			t = i;
		}
	}

	int mini = 1e7+5;
	for( int i = 0; i < n; ++i ){
		if( i != s && i != t ){
			int z = (getDistance(i, t) - m[i][s] - maxd)/-2;
			int x = maxd - z, y = m[i][s] - z; 

			mini = min(mini, max(x, z));
		}
	}

	return mini;
}

/*int main(){
	int sb, tc, n;
	cin >> sb >> tc >> n;

	for( int i = 0; i < n; ++i ){
		for( int j = 0; j < n; ++j ){
			cin >> dis[i][j];
		}
	}
	cout << hubDistance(n, sb) << endl;
	return 0;
}*/

Compilation message

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:39:22: warning: unused variable 'y' [-Wunused-variable]
    int x = maxd - z, y = m[i][s] - z; 
                      ^
towns.cpp:10:29: warning: unused parameter 'sub' [-Wunused-parameter]
 int hubDistance( int n, int sub ){
                             ^~~
towns.cpp:37:19: warning: 't' may be used uninitialized in this function [-Wmaybe-uninitialized]
   if( i != s && i != t ){
                 ~~^~~~
towns.cpp:11:15: warning: 's' may be used uninitialized in this function [-Wmaybe-uninitialized]
  int m[n][n], s, t, maxd = -1;
               ^

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 376 KB Output is correct
2 Correct 17 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 17 ms 376 KB Output is correct
5 Correct 18 ms 380 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 376 KB Output is correct
2 Correct 14 ms 376 KB Output is correct
3 Correct 18 ms 380 KB Output is correct
4 Correct 18 ms 632 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 13.0

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

Subtask #6
0 / 39.0

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