#include using namespace std; #define X first #define Y second // pair에서 first, second를 줄여서 쓰기 위해서 사용 int n, m; char arr[10][10]; void printarr() { //cout << "\n"; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cout << arr[i][j] << " "; } cout << "\n"; } } int up(int x, int y) { //cout << "up\n"; int cnt = 0; for (int i = x - 1; i >= 0; i--) { if (arr[i][y] != '6') { //벽이 아닌 if (arr[i][y] == '#') continue; else if (arr[i][y] == '0') cnt++; else continue; } else break; } return cnt; } int down(int x, int y) { //cout << "down\n"; int cnt = 0; for (int i = x + 1; i < n; i++) { if (arr[i][y] != '6') { //벽이 아닌 if (arr[i][y] == '#') continue; else if (arr[i][y] == '0') cnt++; else continue; } else break; } return cnt; } int right(int x, int y) { //cout << "right\n"; int cnt = 0; for (int i = y + 1; i < m; i++) { if (arr[x][i] != '6') { if (arr[x][i] == '#') continue; else if (arr[x][i] == '0') cnt++; else continue; } else break; } return cnt; } int left(int x, int y) { //cout << "left\n"; int cnt = 0; for (int i = y - 1; i >= 0; i--) { if (arr[x][i] != '6') { if (arr[x][i] == '#') continue; else if (arr[x][i] == '0') cnt++; else continue; } else break; } return cnt; } void fillup(int x, int y) { //cout << "fill up\n"; for (int i = x - 1; i >= 0; i--) { if (arr[i][y] != '6') { //벽이 아닌 if (arr[i][y] == '#') { continue; } else if (arr[i][y] == '0') { arr[i][y] = '#'; } else { continue; } } else { //벽 break; } } return; } void filldown(int x, int y) { //cout << "fill down\n"; for (int i = x + 1; i < n; i++) { if (arr[i][y] != '6') { //벽이 아닌 if (arr[i][y] == '#') { continue; } else if (arr[i][y] == '0') { arr[i][y] = '#'; } else { continue; } } else { break; } } return; } void fillright(int x, int y) { //cout << "fill right\n"; for (int i = y + 1; i < m; i++) { if (arr[x][i] != '6') { if (arr[x][i] == '#') continue; else if (arr[x][i] == '0') { arr[x][i] = '#'; } else continue; } else break; } return; } void fillleft(int x, int y) { //cout << "fill left\n"; for (int i = y - 1; i >= 0; i--) { if (arr[x][i] != '6') { if (arr[x][i] == '#') continue; else if (arr[x][i] == '0') { arr[x][i] = '#'; } else continue; } else break; } return; } void cctv1(int x, int y) { //cout << "cctv1\n"; //0, 1, 2, 3 //up, down, right, left int max = 0; int cnt = 0; int state = -1; //up cnt = up(x, y); if (cnt > max) { max = cnt; state = 0; //up } cnt = 0; //down cnt = down(x, y); if (cnt > max) { max = cnt; state = 1; } cnt = 0; //right cnt = right(x, y); if (cnt > max) { max = cnt; state = 2; } cnt = 0; //left cnt = left(x, y); if (cnt > max) { max = cnt; state = 3; //up } if (max == 0) return; if (state == 0) { fillup(x, y); } else if (state == 1) { filldown(x, y); } else if (state == 2) { fillright(x, y); } else { fillleft(x, y); } return; } void cctv2(int x, int y) { //cout << "cctv2\n"; // 0, 1 // left right, up down int max = 0; int cnt = 0; int state = -1; //left right cnt = left(x, y); cnt += right(x, y); if (cnt > max) { max = cnt; state = 0; //up } cnt = 0; //up down cnt = up(x, y); cnt += down(x, y); if (cnt > max) { max = cnt; state = 1; } if (max == 0) return; if (state == 0) { fillleft(x, y); fillright(x, y); } else { fillup(x, y); filldown(x, y); } return; } void cctv3(int x, int y) { //cout << "cctv3\n"; // 0, 1, 2, 3 //up right, right down, down left, left up int max = 0; int cnt = 0; int state = -1; //up right cnt = up(x, y); cnt += right(x, y); if (cnt > max) { max = cnt; state = 0; //up } cnt = 0; //right down cnt = right(x, y); cnt += down(x, y); if (cnt > max) { max = cnt; state = 1; //up } cnt = 0; //down left cnt = down(x, y); cnt += left(x, y); if (cnt > max) { max = cnt; state = 2; //up } cnt = 0; //left up cnt = left(x, y); cnt += up(x, y); if (cnt > max) { max = cnt; state = 3; //up } if (max == 0) return; if (state == 0) { fillup(x, y); fillright(x, y); } else if (state == 1){ fillright(x, y); filldown(x, y); } else if (state == 1) { filldown(x, y); fillleft(x, y); } else { fillleft(x, y); fillup(x, y); } return; } void cctv4(int x, int y) { //cout << "cctv4\n"; //0, 1, 2, 3 //left up right, up right down, right down left, down left up int max = 0; int cnt = 0; int state = -1; cnt = left(x, y); cnt += up(x, y); cnt += right(x, y); if (cnt > max) { max = cnt; state = 0; //up } cnt = 0; cnt = up(x, y); cnt += right(x, y); cnt += down(x, y); if (cnt > max) { max = cnt; state = 1; //up } cnt = 0; cnt = right(x, y); cnt += down(x, y); cnt += left(x, y); if (cnt > max) { max = cnt; state = 2; //up } cnt = 0; cnt = down(x, y); cnt += left(x, y); cnt += up(x, y); if (cnt > max) { max = cnt; state = 3; //up } if (state == 0) { fillleft(x, y); fillup(x, y); fillright(x, y); } else if (state == 1) { fillup(x, y); fillright(x, y); filldown(x, y); } else if (state == 2) { fillright(x, y); filldown(x, y); fillleft(x, y); } else { filldown(x, y); fillleft(x, y); fillup(x, y); } return; } void cctv5(int x, int y) { cout << "cctv5\n"; fillup(x, y); filldown(x, y); fillleft(x, y); fillright(x, y); return; } struct cmp { bool operator()(tuple& a, tuple& b) { return get<0>(a) < get<0>(b); } }; int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> m; priority_queue, vector>, cmp> pq; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> arr[i][j]; if (arr[i][j] != '6' && arr[i][j] != '0') { pq.push({ arr[i][j] - '0', i, j }); } } } while(!pq.empty()) { int cctv, i, j; tie(cctv, i, j) = pq.top(); //cout << cctv << ", " << i << ", " << j << "-> "; pq.pop(); if (cctv == 1) cctv1(i, j); else if (cctv == 2) cctv2(i, j); else if (cctv == 3) cctv3(i, j); else if (cctv == 4) cctv4(i, j); else cctv5(i, j); } //cout << "\n"; //for (int i = 0; i < n; i++) { // for (int j = 0; j < m; j++) { // cout << arr[i][j] << " "; // } // cout << "\n"; //} int ans = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (arr[i][j] == '0') ans++; } } cout << ans; }

제출 #11781

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: