oj.uz

답안 #28810

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
28810 2017-07-17T08:44:27 Z Nikefor 경주 (Race) (IOI11_race) C++
0 / 100
 3 ms 376 KB 
#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][0]][H[i][1]][0] = L[i];
        dis[H[i][0]][H[i][1]][1] = dis[H[i][0]][H[i][1]][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[i][k][0]) {
                    dis[i][k][0] = dis[k][i][0] = dis[i][j][0]+dis[i][k][0];
                    dis[i][k][1] = dis[k][i][1] = dis[i][j][1]+dis[i][k][1];
                }
            }
    int opt = inf;
    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) opt = dis[i][j][1];
        }
  return opt==inf?-1:opt;
}

Compilation message

race.cpp: In function 'int best_path(int, int, int (*)[2], int*)':
race.cpp:11:34: warning: operation on 'dis[(*(H + ((sizetype)(((long unsigned int)i) * 8))))[0]][(*(H + ((sizetype)(((long unsigned int)i) * 8))))[1]][0]' may be undefined [-Wsequence-point]
         dis[H[i][0]][H[i][1]][0] = dis[H[i][0]][H[i][1]][0] = L[i];
         ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
race.cpp:12:34: warning: operation on 'dis[(*(H + ((sizetype)(((long unsigned int)i) * 8))))[0]][(*(H + ((sizetype)(((long unsigned int)i) * 8))))[1]][1]' may be undefined [-Wsequence-point]
         dis[H[i][0]][H[i][1]][1] = dis[H[i][0]][H[i][1]][1] = 1;
         ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -