1741. Communication Fiend（ｄｐ）

刷个简单的ＤＰ缓缓心情

１Ａ

 #include <iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<stdlib.h>
 #include<vector>
 using namespace std;
 #define N 10010
 vector<int>q[N];
 #define LL __int64
 #define INF 1e10
 LL dp[N][];
 int o[N];
 struct node
 {
     int x,y,d;
     char s[];
 }p[N];
 int main()
 {
     int i,j,n,m;
     scanf("%d%d",&n,&m);
     for(i = ; i <= m ; i++)
     {
         scanf("%d%d%d%s",&p[i].x,&p[i].y,&p[i].d,p[i].s);
         q[p[i].y].push_back(i);
     }
     dp[i][] = ;
     dp[i][] = INF;
     dp[i][] = INF;
     for(i = ; i <= n ; i++)
     {
         dp[i][] = dp[i][] = dp[i][] = INF;
         for(j =  ; j < (int)q[i].size() ; j++)
         {
             int v = q[i][j],k,x = p[v].x,w = p[v].d;
             if(strcmp(p[v].s,"Licensed")==)
             k = ;
             else if(strcmp(p[v].s,"Cracked")==)
             k = ;
             else k = ;
             if(k==)
             {
                 dp[i][] = min(dp[i][],min(dp[x][]+w,dp[x][]+w));
             }
             else if(k==)
             {
                 dp[i][] = min(dp[i][],min(dp[x][]+w,dp[x][]+w));
                 dp[i][] = min(dp[i][],dp[x][]+w);
             }
             else
             {
                 dp[i][] = min(dp[i][],dp[x][]+w);
                 dp[i][] = min(dp[i][],dp[x][]+w);
                 dp[i][] = min(dp[i][],dp[x][]+w);
             }
         }
     }
     LL ans = INF;
     for(i = ; i <=  ; i++)
     ans = min(ans,dp[n][i]);
     if(ans==INF)
     puts("Offline");
     else
     {
         puts("Online");
         printf("%I64d\n",ans);
     }
     return ;
 }