洛谷P3139 [USACO16FEB]牛奶桶Milk Pails

Posted 2020-10-09 third2333

洛谷P3139 [USACO16FEB]牛奶桶Milk Pails

 

 1 #include <cstdio> 
 2 #include <algorithm>
 3 #define For(i,j,k) for(int i=j;i<=k;i++) 
 4 using namespace std ; 
 5 
 6 const int N = 211 ; 
 7 bool dp[2][N][N] ; 
 8 int x,y,K,m,mn ; 
 9 
10 inline int read() 
11 {
12     int x = 0 , f = 1 ; 
13     char ch = getchar() ; 
14     while(ch<‘0‘||ch>‘9‘) { if(ch==‘-‘) f = -1 ; ch = getchar(); } 
15     while(ch>=‘0‘&&ch<=‘9‘) { x = x * 10+ch-48 ; ch = getchar(); } 
16     return x * f ; 
17 }
18 
19 int main() 
20 {
21     x = read() ; y = read() ; K = read() ; m = read() ; 
22     dp[0][0][0] = 1 ; 
23     For(i,1,K) 
24      For(j,0,x) 
25       For(k,0,y) 
26         if(dp[i&1^1][j][k]) {
27           dp[i&1][0][k]=1 ; dp[i&1][j][0]=1 ; 
28           dp[i&1][x][k]=1 ; dp[i&1][j][y]=1 ; 
29           int a1=min(x-j,k),a2=min(j,y-k) ;  
30           dp[i&1][j+a1][k-a1]=1 ; 
31           dp[i&1][j-a2][k+a2]=1 ; 
32         }
33     mn = m ; 
34     For(j,0,x) For(k,0,y) 
35         if(dp[K&1][j][k]) 
36             if(abs(j+k-m)<=mn) 
37               mn = abs(j+k-m) ; 
38     printf("%d\n",mn) ; 
39     return 0 ; 
40 }