oj.uz

Submission #67004

# Submission time Handle Problem Language Result Execution time Memory
67004 2018-08-13T08:03:53 Z ekrem Maxcomp (info1cup18_maxcomp) C++
15 / 100
 28 ms 32136 KB 
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define inf 2000000007
#define N 1005
using namespace std;

int n, m, ans, a[N][N], dp[N][N][4][2];
int o[] = {-1, 0, 1, 0};
int p[] = {0, 1, 0, -1};

int f(int i, int j, int yon, int dur){
	int &r = dp[i][j][yon][dur];
	if(r != -1)
		return r;
	if(i < 1 or j < 1 or i > n or j > m)
		return -inf;
	if(dur == 0){
		if(a[i][j] > f(i + o[yon], j + p[yon], yon, dur) - 1)
			r = a[i][j];
		else
			r = f(i + o[yon], j + p[yon], yon, dur) - 1;
	}
	if(dur == 1){
		if(-a[i][j] > f(i + o[yon], j + p[yon], yon, dur) - 1)
			r = -a[i][j];
		else
			r = f(i + o[yon], j + p[yon], yon, dur) - 1;
	}
	return r;
}

int main() {
	// freopen("in.txt", "r", stdin);
	// freopen("out.txt", "w", stdout);
	memset(dp, -1, sizeof dp);
	scanf("%d %d",&n ,&m);
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= m; j++)
			scanf("%d",&a[i][j]);
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= m; j++)
			for(int l = 0; l <= 3; l++)
				for(int k = 0; k <= 3; k++)
					if(l != k){
						ans = max(ans, f(i, j, l, 0) + f(i, j, k, 1) - 1 );
					}

	printf("%d\n",ans);
	return 0;
}

Compilation message

maxcomp.cpp: In function 'int main()':
maxcomp.cpp:39:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n ,&m);
  ~~~~~^~~~~~~~~~~~~~~~
maxcomp.cpp:42:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d",&a[i][j]);
    ~~~~~^~~~~~~~~~~~~~~

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 31992 KB Output is correct
2 Correct 27 ms 32104 KB Output is correct
3 Incorrect 27 ms 32104 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 32104 KB Output is correct
2 Correct 27 ms 32104 KB Output is correct
3 Correct 27 ms 32136 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 31992 KB Output is correct
2 Correct 27 ms 32104 KB Output is correct
3 Incorrect 27 ms 32104 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 31992 KB Output is correct
2 Correct 27 ms 32104 KB Output is correct
3 Incorrect 27 ms 32104 KB Output isn't correct
4 Halted 0 ms 0 KB -