oj.uz

답안 #459563

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
459563 2021-08-08T16:23:06 Z TeaTime Dango Maker (JOI18_dango_maker) C++17
0 / 100
 1 ms 332 KB 
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <unordered_map>

using namespace std;

#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);

typedef long long ll;
typedef long double ld;

const ll SZ = 3050;

char grid[SZ][SZ];

int main() {
    fastInp;

    ll n, m;
    cin >> n >> m;

    for (int i = 0; i < n; i++) {
        string s;
        cin >> s;
        for (int j = 0; j < m; j++) grid[i][j] = s[j];
    }

    ll ans = 0;
    map<ll, ll> cnt;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (grid[i][j] == 'R') {
                if (grid[i][j + 1] == 'G' && grid[i][j + 2] == 'W') {
                    cnt['R']++;
                    continue;
                }
                if (grid[i + 1][j] == 'G' && grid[i + 2][j] == 'W') {
                    cnt['R']++;
                    continue;
                }
            } else if (grid[i][j] == 'G') {
                if (j > 0 && grid[i][j - 1] == 'R' && grid[i][j + 1] == 'W') {
                    cnt['G']++;
                    continue;
                }
                if (i > 0 && grid[i - 1][j] == 'R' && grid[i + 1][j] == 'W') {
                    cnt['G']++;
                    continue;
                }
            } else {
                if (j > 1 && grid[i][j - 2] == 'R' && grid[i][j - 1] == 'G') {
                    cnt['W']++;
                    continue;
                }
                if (i > 1 && grid[i - 2][j] == 'R' && grid[i - 1][j] == 'G') {
                    cnt['W']++;
                    continue;
                }
            }
        }
    }

    cout << min(min(cnt['R'], cnt['G']), cnt['W']);

    return 0;
}

Compilation message

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:35:8: warning: unused variable 'ans' [-Wunused-variable]
   35 |     ll ans = 0;
      |        ^~~

Subtask #1
0 / 13.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 67.0

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