#include "race.h"
#define inf 1<<20
int best_path(int N, int K, int H[][2], int L[])
{
int dis[N][N][2];
for(int i=0; i<N; i++)
for(int j=0; j<N; j++) {
dis[i][j][0] = dis[i][j][1] = (i==j)?0:inf;
}
for(int i=0; i<N; i++) {
dis[H[i][0]][H[i][1]][0] = dis[H[i][1]][H[i][0]][0] = L[i];
dis[H[i][0]][H[i][1]][1] = dis[H[i][1]][H[i][0]][1] = 1;
}
for(int i=0; i<N; i++)
for(int j=0; j<N; j++)
for(int k=0; k<N; k++) {
if(dis[i][k][0] > dis[i][j][0]+dis[j][k][0]) {
dis[i][k][0] = dis[k][i][0] = dis[i][j][0]+dis[j][k][0];
dis[i][k][1] = dis[k][i][1] = dis[i][j][1]+dis[j][k][1];
}
}
int opt = -1;
for(int i=0; i<N; i++)
for(int j=0; j<N; j++) {
if(dis[i][j][0] == K and (dis[i][j][1] < opt or opt==-1) ) opt = dis[i][j][1];
}
return opt;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
380 KB |
Output is correct |
2 |
Correct |
3 ms |
380 KB |
Output is correct |
3 |
Correct |
4 ms |
408 KB |
Output is correct |
4 |
Correct |
4 ms |
408 KB |
Output is correct |
5 |
Correct |
4 ms |
584 KB |
Output is correct |
6 |
Correct |
4 ms |
584 KB |
Output is correct |
7 |
Correct |
4 ms |
584 KB |
Output is correct |
8 |
Correct |
3 ms |
584 KB |
Output is correct |
9 |
Correct |
3 ms |
592 KB |
Output is correct |
10 |
Correct |
3 ms |
596 KB |
Output is correct |
11 |
Correct |
3 ms |
596 KB |
Output is correct |
12 |
Correct |
3 ms |
596 KB |
Output is correct |
13 |
Correct |
3 ms |
612 KB |
Output is correct |
14 |
Correct |
3 ms |
612 KB |
Output is correct |
15 |
Correct |
3 ms |
612 KB |
Output is correct |
16 |
Correct |
3 ms |
612 KB |
Output is correct |
17 |
Incorrect |
4 ms |
744 KB |
Output isn't correct |
18 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
380 KB |
Output is correct |
2 |
Correct |
3 ms |
380 KB |
Output is correct |
3 |
Correct |
4 ms |
408 KB |
Output is correct |
4 |
Correct |
4 ms |
408 KB |
Output is correct |
5 |
Correct |
4 ms |
584 KB |
Output is correct |
6 |
Correct |
4 ms |
584 KB |
Output is correct |
7 |
Correct |
4 ms |
584 KB |
Output is correct |
8 |
Correct |
3 ms |
584 KB |
Output is correct |
9 |
Correct |
3 ms |
592 KB |
Output is correct |
10 |
Correct |
3 ms |
596 KB |
Output is correct |
11 |
Correct |
3 ms |
596 KB |
Output is correct |
12 |
Correct |
3 ms |
596 KB |
Output is correct |
13 |
Correct |
3 ms |
612 KB |
Output is correct |
14 |
Correct |
3 ms |
612 KB |
Output is correct |
15 |
Correct |
3 ms |
612 KB |
Output is correct |
16 |
Correct |
3 ms |
612 KB |
Output is correct |
17 |
Incorrect |
4 ms |
744 KB |
Output isn't correct |
18 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
380 KB |
Output is correct |
2 |
Correct |
3 ms |
380 KB |
Output is correct |
3 |
Correct |
4 ms |
408 KB |
Output is correct |
4 |
Correct |
4 ms |
408 KB |
Output is correct |
5 |
Correct |
4 ms |
584 KB |
Output is correct |
6 |
Correct |
4 ms |
584 KB |
Output is correct |
7 |
Correct |
4 ms |
584 KB |
Output is correct |
8 |
Correct |
3 ms |
584 KB |
Output is correct |
9 |
Correct |
3 ms |
592 KB |
Output is correct |
10 |
Correct |
3 ms |
596 KB |
Output is correct |
11 |
Correct |
3 ms |
596 KB |
Output is correct |
12 |
Correct |
3 ms |
596 KB |
Output is correct |
13 |
Correct |
3 ms |
612 KB |
Output is correct |
14 |
Correct |
3 ms |
612 KB |
Output is correct |
15 |
Correct |
3 ms |
612 KB |
Output is correct |
16 |
Correct |
3 ms |
612 KB |
Output is correct |
17 |
Incorrect |
4 ms |
744 KB |
Output isn't correct |
18 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
380 KB |
Output is correct |
2 |
Correct |
3 ms |
380 KB |
Output is correct |
3 |
Correct |
4 ms |
408 KB |
Output is correct |
4 |
Correct |
4 ms |
408 KB |
Output is correct |
5 |
Correct |
4 ms |
584 KB |
Output is correct |
6 |
Correct |
4 ms |
584 KB |
Output is correct |
7 |
Correct |
4 ms |
584 KB |
Output is correct |
8 |
Correct |
3 ms |
584 KB |
Output is correct |
9 |
Correct |
3 ms |
592 KB |
Output is correct |
10 |
Correct |
3 ms |
596 KB |
Output is correct |
11 |
Correct |
3 ms |
596 KB |
Output is correct |
12 |
Correct |
3 ms |
596 KB |
Output is correct |
13 |
Correct |
3 ms |
612 KB |
Output is correct |
14 |
Correct |
3 ms |
612 KB |
Output is correct |
15 |
Correct |
3 ms |
612 KB |
Output is correct |
16 |
Correct |
3 ms |
612 KB |
Output is correct |
17 |
Incorrect |
4 ms |
744 KB |
Output isn't correct |
18 |
Halted |
0 ms |
0 KB |
- |