【HDOJ】1474 Always On the Run

普通DP。基本和floyd一个思路。

/* 1474 */
#include <cstdio>
#include <cstring>
#include <cstdlib>

#define MAXN 15
#define MAXK 1005
#define MAXD 35
#define INF    999999

int dp[MAXN][MAXK];
int day[MAXN][MAXD];
int price[MAXN][MAXN][MAXD];

int min(int a, int b) {
    return a<b ? a:b;
}

int main() {
    int i, j, k, p;
    int n, m, d;
    int t = 0;
    
    #ifndef ONLINE_JUDGE
        freopen("data.in", "r", stdin);
    #endif
    
    while (scanf("%d %d", &n, &m)!=EOF && (n||m)) {
        for (i=1; i<=n; ++i) {
            for (j=1; j<=n; ++j) {
                if (i == j)
                    continue;
                scanf("%d", &day[i][j]);
                for (k=1; k<=day[i][j]; ++k)
                    scanf("%d", &price[i][j][k]);
            }
        }
        
        for (i=1; i<=n; ++i)
            for (j=0; j<=m; ++j)
                dp[i][j] = INF;
        
        dp[1][0] = 0;
        for (k=1; k<=m; ++k) {
            for (i=1; i<=n; ++i) {
                for (j=1; j<=n; ++j) {
                    if (i == j)
                        continue;
                    d = (k-1)%day[j][i] + 1;
                    if (price[j][i][d] && dp[j][k-1]!=INF)
                        dp[i][k] = min(dp[i][k], dp[j][k-1]+price[j][i][d]);
                }
            }
        }
        
        printf("Scenario #%d
", ++t);
        if (dp[n][m] == INF)
            printf("No flight possible.

");
        else
            printf("The best flight costs %d.

", dp[n][m]);
    }
    
    return 0;
}