oj.uz

Submission #86290

# Submission time Handle Problem Language Result Execution time Memory
86290 2018-11-26T00:56:44 Z kraljlavova1 Maja (COCI18_maja) C++11
44 / 110
 2000 ms 744 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
const int MAXN=110;
int n,m,a,b,k;
int P[MAXN][MAXN];
int dx[]={-1,0,1,0};
int dy[]={0,1,0,-1};
ll dp[MAXN][MAXN][2];
bool valid(int x,int y){
	if(x<0||x>=n) return false;
	if(y<0||y>=m) return false;
	return true;
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);cout.tie(NULL);
	cin>>n>>m>>a>>b>>k;
	a--;b--;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			cin>>P[i][j];
		}
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			dp[i][j][0]=-1;
			dp[i][j][1]=-1;
		}
	}
	dp[a][b][0]++;
	while(k--){
		for(int i=0;i<n;i++){
			for(int j=0;j<m;j++){
				if(dp[i][j][0]!=-1){
					int x,y;
					for(int d=0;d<4;d++){
						x=i+dx[d];
						y=j+dy[d];
						if(valid(x,y)){
							dp[x][y][1]=max(dp[x][y][1],dp[i][j][0]+P[x][y]);
						}
					}
				}
			}
		}
		for(int i=0;i<n;i++){
			for(int j=0;j<m;j++){
				dp[i][j][0]=dp[i][j][1];
				dp[i][j][1]=-1;
			}
		}
	}
	cout<<dp[a][b][0]<<"\n";
	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 456 KB Output is correct

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
11.0 / 11.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 11.0

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

Subtask #7
0 / 11.0

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

Subtask #8
0 / 11.0

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

Subtask #9
0 / 11.0

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

Subtask #10
0 / 11.0

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