oj.uz

Submission #86107

# Submission time Handle Problem Language Result Execution time Memory
86107 2018-11-25T01:26:03 Z Shtef Maja (COCI18_maja) C++14
77 / 110
 2000 ms 1128 KB 
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>

using namespace std;

typedef long long ll;

int n, m, x1, y1, k;
ll dp[5][105][105], c[105][105], sol;
const ll inf = 1e18;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, 1, 0, -1};

int main ()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m >> x1 >> y1 >> k;
for(int i = 1 ; i <= n ; ++i){
	for(int j = 1 ; j <= m ; ++j){
		cin >> c[i][j];
	}
}
for(int i = 1 ; i <= n ; ++i){
	for(int j = 1 ; j <= m ; ++j){
		for(int v = 0 ; v < 5 ; ++v){
			dp[v][i][j] = -inf;
		}
	}
}
for(int i = 0 ; i < 5 ; ++i){
	dp[i][x1][y1] = 0;
}
ll maxi = 0;
for(int i = 1 ; i <= n ; ++i){
	for(int j = 1 ; j <= m ; ++j){
		for(int w = 0 ; w < 4 ; ++w){
			int nx = i + dx[w];
			int ny = j + dy[w];
			if(nx <= 0 || nx > n || ny < 0 || ny > m)
				continue;
			maxi = max(maxi, c[i][j] + c[nx][ny]);
		}
	}
}
for(int i = 1 ; i <= min(k, 3 * n * m) ; ++i){
	for(int j = 1 ; j <= n ; ++j){
		for(int v = 1 ; v <= m ; ++v){
			for(int w = 0 ; w < 4 ; ++w){
				int nx = j + dx[w];
				int ny = v + dy[w];
				if(nx <= 0 || nx > n || ny <= 0 || ny > m)
					continue;
				dp[i % 5][nx][ny] = max(dp[i % 5][nx][ny], dp[(i - 1 + 5) % 5][j][v] + c[nx][ny]);
				if(dp[i % 5][nx][ny] - dp[(i - 2 + 5) % 5][nx][ny] == dp[(i - 2 + 5) % 5][nx][ny] - dp[(i - 4 + 5) % 5][nx][ny]){
					if(dp[i % 5][nx][ny] - dp[(i - 2 + 5) % 5][nx][ny] > maxi)
						continue;
					sol = max(sol, 2 * dp[(i - 4 + 5) % 5][nx][ny] + ((k - 2 * (i - 4)) / 2) * (dp[i % 5][nx][ny] - dp[(i - 2 + 5) % 5][nx][ny]) - c[nx][ny]);
				}
			}
		}
	}
}
cout << (k <= 3 * n * m ? dp[k % 5][x1][y1] : sol) << endl;

return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 500 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 568 KB Output is correct
2 Correct 4 ms 596 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 596 KB Output is correct
2 Correct 6 ms 596 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 608 KB Output is correct
2 Correct 3 ms 620 KB Output is correct

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 401 ms 800 KB Output is correct
2 Correct 4 ms 800 KB Output is correct
3 Execution timed out 2060 ms 1128 KB Time limit exceeded

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 1128 KB Output is correct
2 Execution timed out 2053 ms 1128 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2058 ms 1128 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 305 ms 1128 KB Output is correct
2 Correct 248 ms 1128 KB Output is correct

Subtask #9
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 1128 KB Output is correct
2 Correct 12 ms 1128 KB Output is correct

Subtask #10
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 194 ms 1128 KB Output is correct
2 Correct 11 ms 1128 KB Output is correct