oj.uz

Submission #940853

# Submission time Handle Problem Language Result Execution time Memory
940853 2024-03-07T18:55:15 Z lovrot Dango Maker (JOI18_dango_maker) C++17
0 / 100
 1 ms 2396 KB 
#include <cstdio> 
#include <algorithm> 
#include <vector>

using namespace std; 

const int N = 3010; 

int n, m;
char C[N][N]; 

bool stick(int x, int y, int d) {
	if(d == 1) return y > 0 && y < m - 1 && C[x][y] == 'G' && C[x][y - 1] == 'R' && C[x][y + 1] == 'W';
	return x > 0 && x < n - 1 && C[x][y] == 'G' && C[x - 1][y] == 'R' && C[x + 1][y] == 'W';
}

int DP[N][N][2];

int main() {
	scanf("%d%d", &n, &m);
	for(int i = 0; i < n; ++i) 
		for(int j = 0; j < m; ++j) scanf(" %c", &C[i][j]);
	
	int ans = 0;

	for(int i = 0; i < n; ++i) 
		for(int j = 0; j < m; ++j) {
			int *u = DP[i][j];
			u[0] = 0;
			u[1] = stick(i, j, 1);
			u[2] = stick(i, j, 2); 
			if(i > 0 && j < m - 1) {
				int *v = DP[i - 1][j + 1]; 
				u[0] = max(u[0], max({v[0], v[1], v[2]}));
				u[1] = max(u[1], stick(i, j, 1) + max(v[0], v[1]));
				u[2] = max(u[2], stick(i, j, 2) + max(v[0], v[2]));
			}
			if(i == n - 1 || j == 0) ans += max({u[0], u[1], u[2]});
//			printf("{%d %d %d}%c", u[0], u[1], u[2], " \n"[j == m - 1]);
		}

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

Compilation message

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:20:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |  scanf("%d%d", &n, &m);
      |  ~~~~~^~~~~~~~~~~~~~~~
dango_maker.cpp:22:35: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |   for(int j = 0; j < m; ++j) scanf(" %c", &C[i][j]);
      |                              ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Incorrect 1 ms 2396 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Incorrect 1 ms 2396 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Incorrect 1 ms 2396 KB Output isn't correct
7 Halted 0 ms 0 KB -