oj.uz

Submission #118705

# Submission time Handle Problem Language Result Execution time Memory
118705 2019-06-19T12:43:33 Z sofhiasouza Maja (COCI18_maja) C++14
44 / 110
 404 ms 860 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;

const int maxn = 110, maxs = 1e4+10;

int n, m, a, b, mat[maxn][maxn], k;

struct pt
{
	ll f;
	int sf, ss;

	bool operator > (const pt &k) const{
		if(f != k.f) return f > k.f;
		else if(sf != k.sf) return sf > k.sf;
		else return ss >= k.ss; 
	}

}dp[maxn][maxn][2];

pt solve()
{
	int mod = 0;
	for(int t = 1 ; t <= min(k, 10000) ; t++)
	{	
		mod ^= 1;
		for(int i = 1 ; i <= n ; i++)
		{
			for(int j = 1 ; j <= m ; j++)
			{
				if(dp[i-1][j][mod^1] > dp[i+1][j][mod^1] and dp[i-1][j][mod^1] > dp[i][j-1][mod^1] and dp[i-1][j][mod^1] > dp[i][j+1][mod^1])
				{
					dp[i][j][mod] = dp[i-1][j][mod^1];
					if(mat[i][j] > dp[i-1][j][mod^1].sf)
					{
						dp[i][j][mod].ss = dp[i-1][j][mod^1].sf;
						dp[i][j][mod].sf = mat[i][j];
					}
					else if(mat[i][j] > dp[i-1][j][mod^1].ss) dp[i][j][mod].ss = mat[i][j];
				}
				else if(dp[i+1][j][mod^1] > dp[i-1][j][mod^1] and dp[i+1][j][mod^1] > dp[i][j-1][mod^1] and dp[i+1][j][mod^1] > dp[i][j+1][mod^1])
				{
					dp[i][j][mod] = dp[i+1][j][mod^1];
					if(mat[i][j] > dp[i+1][j][mod^1].sf)
					{
						dp[i][j][mod].ss = dp[i+1][j][mod^1].sf;
						dp[i][j][mod].sf = mat[i][j];
					}
					else if(mat[i][j] > dp[i+1][j][mod^1].ss) dp[i][j][mod].ss = mat[i][j];
				}
				else if(dp[i][j-1][mod^1] > dp[i-1][j][mod^1] and dp[i][j-1][mod^1] > dp[i+1][j][mod^1] and dp[i][j-1][mod^1] > dp[i][j+1][mod^1])
				{
					dp[i][j][mod] = dp[i][j-1][mod^1];
					if(mat[i][j] > dp[i][j-1][mod^1].sf)
					{
						dp[i][j][mod].ss = dp[i][j-1][mod^1].sf;
						dp[i][j][mod].sf = mat[i][j];
					}
					else if(mat[i][j] > dp[i][j-1][mod^1].ss) dp[i][j][mod].ss = mat[i][j];
				}
				else
				{
					dp[i][j][mod] = dp[i][j+1][mod^1];
					if(mat[i][j] > dp[i][j+1][mod^1].sf)
					{
						dp[i][j][mod].ss = dp[i][j+1][mod^1].sf;
						dp[i][j][mod].sf = mat[i][j];
					}
					else if(mat[i][j] > dp[i][j+1][mod^1].ss) dp[i][j][mod].ss = mat[i][j];
				}

				if(dp[i][j][mod].f != -1) dp[i][j][mod].f += mat[i][j];
				if(dp[i][j][mod].sf < dp[i][j][mod].ss) swap(dp[i][j][mod].sf, dp[i][j][mod].ss);
			}
		}
	}
	return dp[a][b][mod];
}

int main()
{
	cin >> n >> m >> a >> b >> k;

	for(int i = 1 ; i <= n ; i++)
	{
		for(int j = 1 ; j <= m ; j++)
		{
			cin >> mat[i][j];
		}
	}

	memset(dp, -1, sizeof dp);
	dp[a][b][0].f = 0;

	pt resp = solve();
	
	if(k < 10000) cout << resp.f << endl;
	else cout << resp.f + (resp.sf+resp.ss)*(k-10000)/2 << endl;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 640 KB Output is correct
2 Correct 8 ms 768 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 640 KB Output is correct
2 Correct 10 ms 768 KB Output is correct

Subtask #4
11.0 / 11.0

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

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 163 ms 760 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 33 ms 640 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 404 ms 860 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 135 ms 752 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 47 ms 640 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 111 ms 768 KB Output isn't correct
2 Halted 0 ms 0 KB -