# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22723 | 코졸부 (#40) | Young Zebra (KRIII5_YZ) | C++14 | 103 ms | 181944 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
using namespace std;
const int MAXN = 409, MAXM = 409;
const int cx[] = {1, 0, -1 ,0}, cy[] = {0, 1, 0, -1};
char A[MAXN * 9][MAXN * 9];
int visited[MAXN * 9][MAXN * 9], visited2[MAXN * 9][MAXN * 9];
int ans[MAXN * 9][MAXN * 9];
int cnt, N, M;
int dfs1(int y, int x, char c){
if(y >= N * 3 || y < 0 || x >= M * 3 || x < 0) return 0;
if(visited[y][x] || A[y][x] != c) return 0;
int res = 1;
visited[y][x] = cnt;
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;
if(!visited[y][x]){
cnt++;
int v = dfs1(y, x, A[y][x]);
bool is = false;
for(int w = 0; w < 3 * M; w++){
if((visited[0][w] == cnt) && (visited[0][w] == visited[3 * N - 1][w])) is = true;
}
for(int w = 0; w < 3 * N; w++){
if((visited[w][0] == cnt) && (visited[w][0] == visited[w][3 * M - 1])) is = true;
}
dfs2(y, x, A[y][x], is ? -1 : v);
}
}
}
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)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |