Problem A. Go Sightseeing Google Kickstart Round D 2017

题意：从city 1到city N，相邻两个city只能作bus，bus定点开出，到达每个city可以选择花费一定的时间去sightseeing，要求在deadline前必须到达city N。问最多可以go sightseeing多少city。

看起来就很像dp，开始的想法是把时间作为状态，dp[i[t]表示t时间之前到达city i, go sightseeing了多少city。状态转移就和背包问题一样，是否go sightseeing city i。但是问题中Time=1e9，large input就挂了。后来发现city N的deadline只是一个constraint不是optimization goal，只要以visited city为状态，dp的值对应花费时间。因为city数目只有2000，最后只要找到go sightseeing最多的city且花费时间<deadline的dp值即可。dp[i][j]表示city 0,1,...,i-1中go sightseeing j个花费的最少时间。状态转移也是是否go sightseeing city i

#include<iostream>
#include<stdio.h>
#include<cstdio>
#include<string>
#include<cmath>
#include<stdlib.h>
#include<algorithm>
#include<string.h>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<windows.h>
using namespace std;

//Kcikstart 2017 Round D Problem A. Go Sightseeing
const int maxn=2010;
int T;
int N;
int Ts;
int Tf;
int S[maxn];
int F[maxn];
int D[maxn];
int dp[maxn][maxn];//dp[i][j] means minimum time used to visit j cities in first 0,...,i-1 cities
int ans;
int main()
{
    freopen("input.txt","r",stdin);

    freopen("A-large-practice.in","r",stdin);
    freopen("A.txt","w",stdout);
    cin>>T;
    for(int ca=1;ca<=T;ca++)
    {
        memset(dp,0x3f,sizeof(dp));
        ans=0;
        memset(S,0,sizeof(S));
        memset(F,0,sizeof(F));
        memset(D,0,sizeof(D));
        scanf("%d %d %d",&N,&Ts,&Tf);
        for(int i=0;i<N-1;i++)
        {
            scanf("%d %d %d",&S[i],&F[i],&D[i]);
        }
        dp[0][0]=0;
//        dp[0][1]=Ts;
        for(int i=1;i<N;i++)
        {
            //cout<<i<<endl;
            for(int j=0;j<N;j++)//at most visit N-1 cities
            {
                int extra_time=0;
                if(dp[i-1][j]<S[i-1])//not visit city j
                {
                    extra_time=S[i-1]+D[i-1];
                }
                else
                {
                    if((dp[i-1][j]-S[i-1])%F[i-1]==0)//no waiting time
                        extra_time=dp[i-1][j]+D[i-1];
                    else
                        extra_time=dp[i-1][j]+F[i-1]-(dp[i-1][j]-S[i-1])%F[i-1]+D[i-1];
                }
                if(j==0)
                {
                    dp[i][j]=extra_time;
                    //cout<<j<<" "<<extra_time<<endl;
                    continue;
                }
                int extra_time_visit=0;
                if(dp[i-1][j-1]+Ts<S[i-1])//visit city j
                {
                    extra_time_visit=S[i-1]+D[i-1];
                }
                else
                {
                    if((dp[i-1][j-1]+Ts-S[i-1])%F[i-1]==0)
                    {
                        extra_time_visit=dp[i-1][j-1]+Ts+D[i-1];
                    }
                    else
                    {
                        extra_time_visit=dp[i-1][j-1]+Ts+F[i-1]-(dp[i-1][j-1]+Ts-S[i-1])%F[i-1]+D[i-1];
                    }

                }
                //cout<<j<<" "<<extra_time<<" "<<extra_time_visit<<endl;
                dp[i][j]=min(extra_time,extra_time_visit);
            }
        }
//        for(int i=0;i<N;i++)
//        {
            cout<<i<<endl;
//            for(int t=0;t<=Tf;t++)
//            {
//                cout<<t<<":"<<dp[i][t]<<" ";
//
//            }
//            cout<<endl;
//        }
        bool flg=false;
        for(int j=N-1;j>=0;j--)
        {
            if(dp[N-1][j]<=Tf)
            {
                ans=j;
                flg=true;
                break;
            }
        }
        if(flg==false)
        {
            printf("Case #%d: IMPOSSIBLE\n",ca);
        }
        else
        {
            printf("Case #%d: %d\n",ca,ans);
        }


    }
    return 0;
}

附上small input

#include<iostream>
#include<stdio.h>
#include<cstdio>
#include<string>
#include<cmath>
#include<stdlib.h>
#include<algorithm>
#include<string.h>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<windows.h>
using namespace std;

//Kcikstart 2017 Round D Problem A. Go Sightseeing
const int maxn=5010;
int T;
int N;
int Ts;
int Tf;
int S[maxn];
int F[maxn];
int D[maxn];
int dp[17][maxn];//dp[i][t] means maximum number of visited cities by time t
int ans;
int main()
{
//    freopen("input.txt","r",stdin);

    freopen("A-small-practice.in","r",stdin);
    freopen("A.txt","w",stdout);
    cin>>T;
    for(int ca=1;ca<=T;ca++)
    {
        memset(dp,0x3f,sizeof(dp));
        ans=0;
        memset(S,0,sizeof(S));
        memset(F,0,sizeof(F));
        memset(D,0,sizeof(D));
        scanf("%d %d %d",&N,&Ts,&Tf);
        for(int i=0;i<N-1;i++)
        {
            scanf("%d %d %d",&S[i],&F[i],&D[i]);
        }
        for(int t=0;t<Ts;t++)
        {
            dp[0][t]=0;
        }
        for(int t=Ts;t<=Tf;t++)
        {
            dp[0][t]=1;
        }
        for(int i=1;i<N;i++)
        {
            for(int t=S[i-1]+D[i-1];t<=Tf;t++)
            {
                int time_on_road=(t-D[i-1]-S[i-1])%F[i-1]+D[i-1]; //no sightseeing in city i
                int time_one_road_plus=(t-Ts-D[i-1]-S[i-1])%F[i-1]+D[i-1]+Ts; //if sightseeing in city i
                if(t<S[i-1]+D[i-1]+Ts)
                {
                    time_one_road_plus=maxn;
                }
//                cout<<i<<" "<<t<<" time on road "<<time_on_road<<endl;
                if(t-time_on_road>=0&&t-time_one_road_plus>=0)
                {
                    if(i==N-1)//no need to sightseeing the last city
                    {
                        dp[i][t]=dp[i-1][t-time_on_road];
//                        cout<<i<<" three "<<t<<" "<<dp[i][t]<<endl;
                        continue;
                    }
                    if(dp[i-1][t-time_one_road_plus]==0x3f3f3f3f)
                    {
                        dp[i][t]=dp[i-1][t-time_on_road];
                    }
                    else if(dp[i-1][t-time_on_road]==0x3f3f3f3f)
                    {
                        dp[i][t]=1+dp[i-1][t-time_one_road_plus];
                    }
                    else
                    {
                        dp[i][t]=max(dp[i-1][t-time_on_road],1+dp[i-1][t-time_one_road_plus]);
                    }

//                    cout<<i<<" one "<<t<<" "<<dp[i][t]<<endl;
                }

                else if(t-time_on_road>=0&&t-time_one_road_plus<0)
                {
                    dp[i][t]=dp[i-1][t-time_on_road];
//                    cout<<i<<" two "<<t<<" "<<dp[i][t]<<endl;
                }

                else
                    continue;
            }
        }
//        for(int i=0;i<N;i++)
//        {
            cout<<i<<endl;
//            for(int t=0;t<=Tf;t++)
//            {
//                cout<<t<<":"<<dp[i][t]<<" ";
//
//            }
//            cout<<endl;
//        }
        bool flg=false;
        for(int t=0;t<=Tf;t++)
        {
            if(dp[N-1][t]==0x3f3f3f3f) continue;
            ans=max(ans,dp[N-1][t]);
            flg=true;
        }
        if(flg==false)
        {
            printf("Case #%d: IMPOSSIBLE\n",ca);
        }
        else
        {
            printf("Case #%d: %d\n",ca,ans);
        }


    }
    return 0;
}