UVa 1025 - A Spy in the Metro (White Book)

题目地址：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=245&page=show_problem&problem=3466

思路：I wrote the form filling method,The book is written on the brush table method,Just started calling because of an arraytime,re了好几发

AC代码：

登录后复制

      
      

       
       #include <iostream>
       
       

       
       #include <cstdio>
       
       

       
       #include <cstdlib>
       
       

       
       #include <algorithm>
       
       

       
       #include <queue>
       
       

       
       #include <stack>
       
       

       
       #include <map>
       
       

       
       #include <cstring>
       
       

       
       #include <climits>
       
       

       
       #include <cmath>
       
       

       
       #include <cctype>
       
       

       
       const 
       
       int 
       
       inf 
       
       = 
       
       0x3f3f3f3f;
       
       //1061109567
       
       

       
       typedef 
       
       long 
       
       long 
       
       LL;
       
       

       
       #define lson l,m,rt<<1
       
       

       
       #define rson m+1,r,rt<<1|1
       
       

       
       using 
       
       namespace 
       
       std;
       
       

       
       int 
       
       time1[
       
       55];
       
       

       
       int 
       
       train[
       
       210][
       
       55][
       
       2];
       
       //0Indicates that there is a car driving to the right,1Indicates that there is a car to the left
       
       

       
       int 
       
       dp[
       
       210][
       
       55];
       
       //表示在时刻i,The train is at the stationjthe minimum time taken
       
       

       
       int 
       
       main()
       
       
{
       
       
    
       
       int 
       
       n,
       
       t;
       
       
    
       
       int 
       
       cas 
       
       = 
       
       1;
       
       
    
       
       while(
       
       scanf(
       
       "%d",
       
       &
       
       n) 
       
       && 
       
       n)
       
       
    {
       
       
        
       
       memset(
       
       train,
       
       0,
       
       sizeof(
       
       train));
       
       
        
       
       memset(
       
       dp,
       
       inf,
       
       sizeof(
       
       dp));
       
       
        
       
       scanf(
       
       "%d",
       
       &
       
       t);
       
       
        
       
       for(
       
       int 
       
       i
       
       =
       
       1; 
       
       i
       
       <
       
       n; 
       
       i
       
       ++)
       
       
            
       
       scanf(
       
       "%d",
       
       &
       
       time1[
       
       i]);
       
       
        
       
       int 
       
       d,
       
       m1,
       
       m2;
       
       
        
       
       scanf(
       
       "%d",
       
       &
       
       m1);
       
       
        
       
       while(
       
       m1
       
       --)
       
       //drive right
       
       
        {
       
       
            
       
       scanf(
       
       "%d",
       
       &
       
       d);
       
       
            
       
       for(
       
       int 
       
       j
       
       =
       
       1; 
       
       j
       
       <
       
       n; 
       
       j
       
       ++)
       
       
            {
       
       
                
       
       if(
       
       d 
       
       <= 
       
       t)
       
       
                    
       
       train[
       
       d][
       
       j][
       
       0] 
       
       = 
       
       1;
       
       
                
       
       d 
       
       += 
       
       time1[
       
       j];
       
       
            }
       
       
        }
       
       
        
       
       scanf(
       
       "%d",
       
       &
       
       m2);
       
       
        
       
       while(
       
       m2
       
       --)
       
       
        {
       
       
            
       
       scanf(
       
       "%d",
       
       &
       
       d);
       
       
            
       
       for(
       
       int 
       
       j
       
       =
       
       n; 
       
       j
       
       >=
       
       2; 
       
       j
       
       --)
       
       
            {
       
       
                
       
       if(
       
       d 
       
       <= 
       
       t)
       
       
                    
       
       train[
       
       d][
       
       j][
       
       1] 
       
       = 
       
       1;
       
       
                
       
       d 
       
       += 
       
       time1[
       
       j
       
       -
       
       1];
       
       
            }
       
       
        }
       
       
        
       
       dp[
       
       0][
       
       1] 
       
       = 
       
       0;
       
       
        
       
       for(
       
       int 
       
       i
       
       =
       
       0; 
       
       i
       
       <=
       
       t; 
       
       i
       
       ++)
       
       
        {
       
       
            
       
       for(
       
       int 
       
       j
       
       =
       
       1; 
       
       j
       
       <=
       
       n; 
       
       j
       
       ++)
       
       
            {
       
       
                
       
       dp[
       
       i
       
       +
       
       1][
       
       j] 
       
       = 
       
       min(
       
       dp[
       
       i
       
       +
       
       1][
       
       j],
       
       dp[
       
       i][
       
       j]
       
       +
       
       1);
       
       //等待一秒
       
       
                
       
       if(
       
       train[
       
       i][
       
       j][
       
       0] 
       
       && 
       
       j 
       
       < 
       
       n 
       
       && 
       
       i 
       
       + 
       
       time1[
       
       j] 
       
       <= 
       
       t)
       
       //往右走
       
       
                    
       
       dp[
       
       i
       
       +
       
       time1[
       
       j]][
       
       j
       
       +
       
       1] 
       
       = 
       
       min(
       
       dp[
       
       i
       
       +
       
       time1[
       
       j]][
       
       j
       
       +
       
       1],
       
       dp[
       
       i][
       
       j]);
       
       
                
       
       if(
       
       train[
       
       i][
       
       j][
       
       1] 
       
       && 
       
       j 
       
       > 
       
       1 
       
       && 
       
       i 
       
       + 
       
       time1[
       
       j
       
       -
       
       1] 
       
       <= 
       
       t)
       
       //往左走
       
       
                    
       
       dp[
       
       i
       
       +
       
       time1[
       
       j
       
       -
       
       1]][
       
       j
       
       -
       
       1] 
       
       = 
       
       min(
       
       dp[
       
       i
       
       +
       
       time1[
       
       j
       
       -
       
       1]][
       
       j
       
       -
       
       1],
       
       dp[
       
       i][
       
       j]);
       
       
            }
       
       
        }
       
       
        
       
       if(
       
       dp[
       
       t][
       
       n] 
       
       == 
       
       inf)
       
       
            
       
       printf(
       
       "Case Number %d: impossible\n",
       
       cas
       
       ++);
       
       
        
       
       else
       
       
            
       
       printf(
       
       "Case Number %d: %d\n",
       
       cas
       
       ++,
       
       dp[
       
       t][
       
       n]);
       
       
    }
       
       
    
       
       return 
       
       0;
       
       
}
      
      
      
      

       
       
1.
       
       
2.
       
       
3.
       
       
4.
       
       
5.
       
       
6.
       
       
7.
       
       
8.
       
       
9.
       
       
10.
       
       
11.
       
       
12.
       
       
13.
       
       
14.
       
       
15.
       
       
16.
       
       
17.
       
       
18.
       
       
19.
       
       
20.
       
       
21.
       
       
22.
       
       
23.
       
       
24.
       
       
25.
       
       
26.
       
       
27.
       
       
28.
       
       
29.
       
       
30.
       
       
31.
       
       
32.
       
       
33.
       
       
34.
       
       
35.
       
       
36.
       
       
37.
       
       
38.
       
       
39.
       
       
40.
       
       
41.
       
       
42.
       
       
43.
       
       
44.
       
       
45.
       
       
46.
       
       
47.
       
       
48.
       
       
49.
       
       
50.
       
       
51.
       
       
52.
       
       
53.
       
       
54.
       
       
55.
       
       
56.
       
       
57.
       
       
58.
       
       
59.
       
       
60.
       
       
61.
       
       
62.
       
       
63.
       
       
64.
       
       
65.
       
       
66.
       
       
67.
       
       
68.
       
       
69.
       
       
70.
       
       
71.
       
       
72.