Submission #22869

#TimeUsernameProblemLanguageResultExecution timeMemory
22869코졸부 (#40)Young Zebra (KRIII5_YZ)C++14
0 / 7
79 ms20220 KiB
#include <cstdio> #include <algorithm> using namespace std; const int MAXN = 409, MAXM = 409; const int cx[] = {1, 0, -1 ,0}, cy[] = {0, 1, 0, -1}; char A[MAXN * 3][MAXN * 3]; bool visited[MAXN * 3][MAXN * 3], visited2[MAXN * 3][MAXN * 3], check[4]; int ans[MAXN * 3][MAXN * 3]; int N, M; int dfs1(int y, int x, char c){ if(y >= N * 3 || y < 0 || x >= M * 3 || x < 0){ if(y >= N * 3 && A[0][x] == c) check[0] = true; if(y < 0 && A[N - 1][x] == c) check[1] = true; if(x >= M * 3 && A[y][0] == c) check[2] = true; if(x < 0 && A[M - 1][0] == c) check[3] = true; return 0; } if(visited[y][x] || A[y][x] != c) return 0; int res = 1; visited[y][x] = true; for(int i = 0; i < 4; i++) res += dfs1(y + cy[i], x + cx[i], c); return res; } void dfs2(int y, int x, char c, int v){ if(y >= N * 3 || y < 0 || x >= M * 3 || x < 0) return; if(visited2[y][x] || A[y][x] != c) return; visited2[y][x] = true; for(int i = 0; i < 4; i++) dfs2(y + cy[i], x + cx[i], c, v); ans[y][x] = v; } int main(){ scanf("%d%d%*c", &N, &M); for(int i = 0; i < N; i++){ scanf("%s", A[i]); for(int j = 0; j < M; j++){ for(int v = 0; v < 3; v++){ for(int w = 0; w < 3; w++) A[v * N + i][w * M + j] = A[i][j]; } } } for(int i = 0; i < N; i++){ for(int j = 0; j < M; j++){ int y = i + N, x = j + M; int cnt = 0; if(!visited[y][x]){ fill(check, check + 4, false); int v = dfs1(y, x, A[y][x]); for(int i = 0; i < 4; i++){ if(check[i]) cnt++; } dfs2(y, x, A[y][x], cnt < 2 ? v : -1); } } } for(int i = 0; i < N; i++){ for(int j = 0; j < M; j++) printf("%d ", ans[i + N][j + M]); printf("\n"); } }

Compilation message (stderr)

YZ.cpp: In function 'int main()':
YZ.cpp:37:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%*c", &N, &M);
                             ^
YZ.cpp:39:26: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s", A[i]);
                          ^
#Verdict Execution timeMemoryGrader output
Fetching results...