제출 #206752

#제출 시각아이디문제언어결과실행 시간메모리
206752pavementDango Maker (JOI18_dango_maker)C++17
13 / 100
5 ms376 KiB
#include <bits/stdc++.h> using namespace std; #define int long long int N, M, C; char F[3005][3005]; main() { ios::sync_with_stdio(0); cin.tie(0); cin >> N >> M; for (int i = 1; i <= N; i++) for (int j = 1; j <= M; j++) cin >> F[i][j]; for (int i = 1; i <= N; i++) for (int j = 1; j <= M - 2; j++) if (F[i][j] == 'R' && F[i][j + 1] == 'G' && F[i][j + 2] == 'W') { C++; F[i][j] = F[i][j + 1] = F[i][j + 2] = 0; } for (int j = 1; j <= M; j++) for (int i = 1; i <= N - 2; i++) if (F[i][j] == 'R' && F[i + 1][j] == 'G' && F[i + 2][j] == 'W') { F[i][j] = F[i + 1][j] = F[i + 2][j] = 0; C++; } cout << C << '\n'; }

컴파일 시 표준 에러 (stderr) 메시지

dango_maker.cpp:8:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...