oj.uz

Submission #127577

# Submission time Handle Problem Language Result Execution time Memory
127577 2019-07-09T15:24:22 Z Vlatko Maja (COCI18_maja) C++14
88 / 110
 2000 ms 760 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const ll inf = 1e18;
const int maxn = 100;

int di[4] = {-1, 0, 1, 0};
int dj[4] = {0, 1, 0, -1};

int N, M, A, B;
ll K, T;
array<array<ll, maxn>, maxn> C, cur, nxt;
// dp[k][i][j] = max sum for path to here after k steps

void dp_step() {
	for (int i = 0; i < N; ++i) {
		for (int j = 0; j < M; ++j) {
			nxt[i][j] = -inf;
			for (int d = 0; d < 4; ++d) {
				int i1 = i + di[d], j1 = j + dj[d];
				if (i1 >= 0 && i1 < N && j1 >= 0 && j1 < M) {
					nxt[i][j] = max(nxt[i][j], cur[i1][j1] + C[i][j]);
				}
			}
		}
	}
	swap(cur, nxt);
}

void simulate() {
	for (int i = 0; i < N; ++i) {
		for (int j = 0; j < M; ++j) {
			ll gains = 0;
			for (int d = 0; d < 4; ++d) {
				int i1 = i + di[d], j1 = j + dj[d];
				if (i1 >= 0 && i1 < N && j1 >= 0 && j1 < M) {
					gains = max(gains, C[i1][j1] + C[i][j]);
				}
			}
			cur[i][j] += gains * (K - 2*T) / 2;
		}
	}
}

int main() {
	ios::sync_with_stdio(false); cin.tie(0);
	cin >> N >> M >> A >> B >> K;
	--A, --B;
	T = N * M * 2;
	for (int i = 0; i < N; ++i) {
		for (int j = 0; j < M; ++j) {
			cin >> C[i][j];
			cur[i][j] = -inf;
		}
	}
	cur[A][B] = 0;
	if (2*T >= K) {
		for (int i = 0; i < K; ++i) {
			dp_step();
		}
	} else {
		// T steps, simulate going back and forth, T steps again
		for (int i = 0; i < T; ++i) {
			dp_step();
		}
		simulate();
		for (int i = 0; i < T; ++i) {
			dp_step();
		}
	}
	cout << cur[A][B] << '\n';
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 504 KB Output is correct
2 Correct 7 ms 508 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 504 KB Output is correct
2 Correct 15 ms 504 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 504 KB Output is correct
2 Correct 5 ms 504 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 350 ms 604 KB Output is correct
2 Correct 11 ms 504 KB Output is correct
3 Correct 1637 ms 760 KB Output is correct

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 504 KB Output is correct
2 Execution timed out 2043 ms 632 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1642 ms 660 KB Output is correct
2 Execution timed out 2051 ms 632 KB Time limit exceeded

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 259 ms 504 KB Output is correct
2 Correct 239 ms 644 KB Output is correct

Subtask #9
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 600 KB Output is correct
2 Correct 23 ms 504 KB Output is correct

Subtask #10
11.0 / 11.0

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