oj.uz

답안 #1115733

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1115733 2024-11-20T21:28:20 Z staszic_ojuz Dango Maker (JOI18_dango_maker) C++17
0 / 100
 1 ms 592 KB 
#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n, m;
    cin >> n >> m;
    char dum[n][m];
    for(int i = 0; i < n; ++i)
        for(int j = 0; j < m; ++j)
            cin >> dum[i][j];
    int odp = 0;
    for(int i = 0; i < n; ++i)
        for(int j = 0; j < m; ++j)
        {
            if(dum[i][j] == 'R' && dum[i][j+1] == 'G' && dum[i][j+2] == 'W')
            {
                if(dum[i-1][j+1] == 'R' && dum[i+1][j+1] == 'W')
                {
                    ++odp;
                    dum[i-1][j+1] = '.';
                    dum[i][j+1] = '.';
                    dum[i][j+2] = '.';
                }
                else
                {
                    ++odp;
                    dum[i][j] = '.';
                    dum[i][j+1] = '.';
                    dum[i][j+2] = '.';
                }
            }
            if(dum[i-1][j] == 'R' && dum[i][j] == 'G' && dum[i+1][j] == 'W')
            {
                ++odp;
                dum[i-1][j] = '.';
                dum[i][j] = '.';
                dum[i+1][j] = '.';
            }
        }
    cout << odp;
}

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Incorrect 1 ms 336 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Incorrect 1 ms 336 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Incorrect 1 ms 336 KB Output isn't correct
12 Halted 0 ms 0 KB -