From Evernote:

uva 590

感覺像Floyd的變形

[sourcecode language="cpp"]
//============================================================================
// Name : Always on the run.cpp
// Date : 2013 2013/2/4 上午10:57:33
// Author : GCA
//============================================================================
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
printf("%d ",dp[htx][hty]);}Pln();}
#define M 25
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX-1000000
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int n,k;
int cost[M][M][35];
int dp[M][1005];
int allday[M][M];
int main() {
ios_base::sync_with_stdio(0);
int ff=0;
while(~scanf("%d%d",&n,&k)&&n+k){
int tmp;
fill(&dp[0][0],&dp[M-1][1005-1],oo);
Set(allday,0);
dp[1][0]=0;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(i!=j){
scanf("%d",&tmp);
allday[i][j]=tmp;
for(int k=0;k<tmp;k++)scanf("%d",&cost[i][j][k]);
}
}
}
for(int d=1;d<=k;d++){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(i==j)continue;
int t=(d-1+allday[j][i])%allday[j][i];
if(cost[j][i][t])
dp[i][d]=min(dp[i][d],dp[j][d-1]+cost[j][i][t]);
}
}
}
printf("Scenario #%d\n",++ff);
if(dp[n][k]!=oo)printf("The best flight costs %d.\n",dp[n][k]);
else printf("No flight possible.\n");
Pln();
}

}

[/sourcecode]