# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
420570 |
2021-06-08T12:46:24 Z |
LouayFarah |
Towns (IOI15_towns) |
C++14 |
|
1 ms |
336 KB |
#include "bits/stdc++.h"
#include "towns.h"
using namespace std;
vector<vector<int>> dist;
vector<int> em;
int getDistance(int i, int j);
int hubDistance(int n, int sub)
{
em.assign(0, n);
dist.assign(n, em);
for(int i = 0; i<n; i++)
{
for(int j = i+1; j<n; j++)
{
int d = getDistance(i, j);
dist[i][j] = d;
dist[j][i] = d;
}
}
int R = 1e9;
for(int i = 0; i<n; i++)
{
for(int j = i+1; j<n; j++)
{
int node = -1;
int maxi = -1;
for(int k = 0; k<n; k++)
{
if(k==i||k==j)
continue;
if(dist[i][k]+dist[j][k]>maxi)
{
maxi = dist[i][k] + dist[j][k];
node = k;
}
}
int temp = (dist[i][node] + dist[j][node] - dist[i][j])/2;
R = min(R, temp);
}
}
if(sub==2)
return R;
return R;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 11 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
336 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |