# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22580 | dried chocochip on Daegu asphalt (#40) | Young Zebra (KRIII5_YZ) | C++11 | 243 ms | 52712 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<bits/stdc++.h>
using namespace std;
int n, m;
char mmap[2000][2000];
int cc[2000][2000], c_idx;
bool visited[2000][2000];
int cc_sz[2000*2000+2];
int di[4] = {-1, 0, 1, 0};
int dj[4] = {0, 1, 0, -1};
void dfs(int i, int j)
{
visited[i][j] = true;
cc[i][j] = c_idx;
cc_sz[c_idx]++;
for(int k = 0; k < 4; k++)
{
int ni = i+di[k], nj = j+dj[k];
if(ni < 0 || ni >= 5*n || nj < 0 || nj >= 5*m) continue;
if(!visited[ni][nj] && mmap[i][j] == mmap[ni][nj])
dfs(ni, nj);
}
}
int main()
{
scanf("%d %d", &n, &m);
for(int i = 0; i < n; i++)
for(int j = 0; j < m; j++)
scanf(" %c", &mmap[i][j]);
for(int i = 0; i < 5*n; i++)
for(int j = 0; j < 5*m; j++)
mmap[i][j] = mmap[i%n][j%m];
for(int i = 0; i < 5*n; i++)
for(int j = 0; j < 5*m; j++)
if(!visited[i][j])
{
c_idx++;
dfs(i, j);
}
for(int i = 0; i < n; i++)
{
for(int j = 0; j < m; j++)
{
bool check = false;
for(int ddi = 0; ddi < 5; ddi++)
for(int ddj = 0; ddj < 5; ddj++)
{
if(ddi == 2 && ddj == 2) continue;
if(cc[i+n*2][j+m*2] == cc[i+ddi*n][j+ddj*m])
check = true;
}
printf("%d ", cc_sz[cc[i+n*2][j+m*2]]);
}
printf("\n");
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |