oj.uz

Submission #234763

# Submission time Handle Problem Language Result Execution time Memory
234763 2020-05-25T13:47:34 Z super_j6 Maja (COCI18_maja) C++14
88 / 110
 154 ms 32768 KB 
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string.h>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define f first
#define s second

const int maxn = 101;
int n, m, sx, sy, k;
ll a[maxn][maxn];
ll dp[maxn][maxn][maxn << 2];

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

bool works(int x, int y){
    return x >= 0 && y >= 0 && x < n && y < m;
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> m >> sx >> sy >> k;
	sx--, sy--;
	
	for(int i = 0; i < n; i++)
	for(int j = 0; j < m; j++){
	    cin >> a[i][j];
	}
	
	memset(dp, -1, sizeof(dp));
	dp[sx][sy][0] = 0;
	for(int l = 0; l < 2 * (n + m); l++)
	for(int i = 0; i < n; i++)
	for(int j = 0; j < m; j++){
	    if(dp[i][j][l] == -1) continue;
    	for(int f = 0; f < 4; f++){
    	    int x = i + dx[f], y = j + dy[f];
    	    if(works(x, y)){
    	        dp[x][y][l + 1] = max(dp[x][y][l + 1], dp[i][j][l] + a[x][y]);
    	    }
    	}
	}
	
	ll ret = 0;
	for(int i  = 0; i < n; i++)
	for(int j = 0; j < m; j++)
	for(int l = 0; l <= 2 * (n + m); l++){
	    if(dp[i][j][l] == -1) continue;
	    for(int f = 0; f < 4; f++){
	        int x = i + dx[f], y = j + dy[f];
	        if(works(x, y)){
	            if(2 * l <= k){
	                ret = max(ret, 2 * dp[i][j][l] + 
	                    (k - 2 * l) / 2 * (a[i][j] + a[x][y]) - a[i][j]);
	            }
	            if(l + 1 <= 2 * (n + m) && 2 * l + 2 <= k && dp[x][y][l + 1] != -1){
	                ret = max(ret, dp[i][j][l] + dp[x][y][l + 1] +
	                    (k - 2 * l - 2) / 2 * (a[i][j] + a[x][y]));
	            }
	        }
	    }
	}
	
	cout << ret << endl;

	return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 32640 KB Output is correct
2 Correct 21 ms 32640 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 32640 KB Output is correct
2 Correct 21 ms 32640 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 32640 KB Output is correct
2 Correct 21 ms 32640 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 32640 KB Output is correct
2 Correct 21 ms 32640 KB Output is correct

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 32640 KB Output is correct
2 Correct 21 ms 32640 KB Output is correct
3 Incorrect 154 ms 32632 KB Output isn't correct

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 32660 KB Output is correct
2 Correct 73 ms 32640 KB Output is correct
3 Incorrect 149 ms 32640 KB Output isn't correct

Subtask #7
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 32760 KB Output is correct
2 Correct 85 ms 32640 KB Output is correct

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 32640 KB Output is correct
2 Correct 33 ms 32640 KB Output is correct

Subtask #9
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 32640 KB Output is correct
2 Correct 22 ms 32632 KB Output is correct

Subtask #10
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 32768 KB Output is correct
2 Correct 21 ms 32640 KB Output is correct