# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
331774 | daniel920712 | Dango Maker (JOI18_dango_maker) | C++14 | 35 ms | 47468 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 <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
using namespace std;
char all[3005][3005];
vector < int > Next[2][1000005];
bool have[2][1000005]={0};
bool is[2][1000005]={0};
int ans=0,a,b;
void F(int x,int y)
{
if(have[x][y]) return ;
have[x][y]=1;
if(x==0) a++;
if(x==1) b++;
for(auto i:Next[x][y]) F(1-x,i);
}
int main()
{
int N,M,i,j;
scanf("%d %d",&N,&M);
for(i=0;i<N;i++) scanf("%s",all[i]);
for(i=0;i<N;i++) for(j=0;j<M-2;j++) if(all[i][j]=='R'&&all[i][j+1]=='G'&&all[i][j+2]=='W') is[0][i*M+j]=1;
for(i=0;i<N-2;i++) for(j=0;j<M;j++) if(all[i][j]=='R'&&all[i+1][j]=='G'&&all[i+2][j]=='W') is[1][i*M+j]=1;
for(i=0;i<N;i++)
{
for(j=0;j<M;j++)
{
if(is[0][i*M+j]&&is[1][i*M+j])
{
Next[0][i*M+j].push_back(i*M+j);
Next[1][i*M+j].push_back(i*M+j);
}
if(is[0][i*M+j]&&i>=1&&j+1<M&&is[1][(i-1)*M+j+1])
{
Next[0][i*M+j].push_back((i-1)*M+j+1);
Next[1][(i-1)*M+j+1].push_back(i*M+j);
}
if(is[0][i*M+j]&&i>=2&&j+2<M&&is[1][(i-2)*M+j+2])
{
Next[0][i*M+j].push_back((i-2)*M+j+2);
Next[1][(i-2)*M+j+2].push_back(i*M+j);
}
}
}
for(i=0;i<N*M;i++)
{
if(is[0][i]&&!have[0][i])
{
a=b=0;
F(0,i);
ans+=max(a,b);
}
if(is[1][i]&&!have[1][i])
{
a=b=0;
F(1,i);
ans+=max(a,b);
}
}
printf("%d\n",ans);
//printf("aa\n");
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |