oj.uz

답안 #1050011

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1050011 2024-08-09T06:51:03 Z vjudge1 Dango Maker (JOI18_dango_maker) C++17
0 / 100
 0 ms 348 KB 
#include <iostream>
#include <vector>
#include <string>

using namespace std;

int countDangoSticks(const vector<string>& grid) {
    int rows = grid.size();
    int cols = grid[0].size();
    int count = 0;
    for (int i = 0; i < rows; ++i) {
        for (int j = 0; j < cols - 2; ++j) {
            if (grid[i][j] == 'R' && grid[i][j + 1] == 'G' && grid[i][j + 2] == 'W') {
                count++;
            }
        }
    }

    for (int i = 0; i < rows - 2; ++i) {
        for (int j = 0; j < cols; ++j) {
            if (grid[i][j] == 'R' && grid[i + 1][j] == 'G' && grid[i + 2][j] == 'W') {
                count++;
            }
        }
    }

    return count;
}

int main() {
    int n,m;
    cin>>n>>m;
    vector<string> grid(n);
    for(int i = 0;i<n;i++){
        cin>>grid[i];
    }
    int result = countDangoSticks(grid);
    cout << result << endl;

    return 0;
}

Subtask #1
0 / 13.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 67.0

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