oj.uz

답안 #125715

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
125715 2019-07-06T09:17:32 Z youngyojun Dango Maker (JOI18_dango_maker) C++11
0 / 100
 2 ms 380 KB 
#include <bits/stdc++.h>
#define upmax(a,b) (a)=max((a),(b))
using namespace std;

char A[3005][3005];

int D[3005][3];

int H, W, Ans;

int main() {
	scanf("%d%d", &H, &W);
	for(int i = 1; i <= H; i++) scanf(" %s", A[i]+1);

	for(int sum = 3; sum < H+W; sum++) {
		int ret = 0;
		memset(D[0], 0, 3005*3*4);
		for(int y = 1, x = sum-1; y <= H; y++, x--) {
			if(x < 1) break; if(W < x) continue;
			D[y][0] = *max_element(D[y+1], D[y+1]+3);
			if('G' != A[y][x]) continue;
			if('R' == A[y][x-1] && 'W' == A[y][x+1])
				D[y][1] = max(D[y+1][0], D[y+1][1]) + 1;
			if('R' == A[y-1][x] && 'W' == A[y+1][x])
				D[y][2] = max(D[y+1][0], D[y+1][2]) + 1;
			upmax(ret, *max_element(D[y], D[y]+3));
		}
		Ans += ret;
	}

	cout << Ans << endl;
	return 0;
}

Compilation message

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:19:4: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
    if(x < 1) break; if(W < x) continue;
    ^~
dango_maker.cpp:19:21: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
    if(x < 1) break; if(W < x) continue;
                     ^~
dango_maker.cpp:12:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &H, &W);
  ~~~~~^~~~~~~~~~~~~~~~
dango_maker.cpp:13:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i = 1; i <= H; i++) scanf(" %s", A[i]+1);
                              ~~~~~^~~~~~~~~~~~~~~

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Incorrect 2 ms 376 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Incorrect 2 ms 376 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Incorrect 2 ms 376 KB Output isn't correct
7 Halted 0 ms 0 KB -