답안 #704489

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
704489	2023-03-02T07:51:56 Z	GrandTiger1729	Dango Maker (JOI18_dango_maker)	C++17	13 / 100	1 ms	324 KB

dango_maker

#include <iostream>
using namespace std;

int main(){
    cin.tie(0)->sync_with_stdio(0);
    int n, m; cin >> n >> m;
    string g[n];
    for (int i = 0; i < n; i++)
        cin >> g[i];
    bool vis[n][m]{};
    int ans = 0;
    for (int i = 0; i < n; i++){
        for (int j = 0; j < m; j++){
            if (g[i][j] != 'W' || vis[i][j]) continue;
            if (i - 1 >= 0 && !vis[i - 1][j] && g[i - 1][j] == 'G' && \
                    i - 2 >= 0 && !vis[i - 2][j] && g[i - 2][j] == 'R'){
                vis[i][j] = vis[i - 1][j] = vis[i - 2][j] = 1;
                ans++;
            }
        }
        for (int j = 0; j < m; j++){
            if (g[i][j] != 'W' || vis[i][j]) continue;
            if (j - 1 >= 0 && !vis[i][j - 1] && g[i][j - 1] == 'G' && \
                    j - 2 >= 0 && !vis[i][j - 2] && g[i][j - 2] == 'R'){
                vis[i][j] = vis[i][j - 1] = vis[i][j - 2] = 1;
                ans++;
            }
        }
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1

13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	320 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	324 KB	Output is correct

Subtask #2

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	320 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	324 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	320 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Incorrect	0 ms	320 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #3

0 / 67.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	320 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	324 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	320 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Incorrect	0 ms	320 KB	Output isn't correct
21	Halted	0 ms	0 KB	-