#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
ll n,m,i,j,has,te;
char a[3030][3030];
int x[9000010];
int b[3000010];
int mat[3000010];
vector<int> v[3000010];
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
cin>>a[i][j];
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
if(j+2<=m&&a[i][j]=='R'&&a[i][j+1]=='G'&&a[i][j+2]=='W')
{
te++;
has++;
x[(i-1)*m+j]=te;
x[(i-1)*m+j+1]=te;
x[(i-1)*m+j+2]=te;
}
}
ll hai=te;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
if(i+2<=n&&a[i][j]=='R'&&a[i+1][j]=='G'&&a[i+2][j]=='W')
{
te++;
has++;
if(x[(i-1)*m+j]!=0)
{
v[x[(i-1)*m+j]].pb(te);
}
if(x[(i)*m+j]!=0)
{
v[x[(i)*m+j]].pb(te);
}
if(x[(i+1)*m+j]!=0)
{
v[x[(i+1)*m+j]].pb(te);
}
}
}
memset(mat,-1,sizeof(mat));
for(i=1;i<=te;i++)
{
for(j=0;j<v[i].size();j++)
if(mat[v[i][j]]==-1)
{
mat[v[i][j]]=i;
has--;
}
}
cout<<has<<"\n";
}
Compilation message
dango_maker.cpp: In function 'int main()':
dango_maker.cpp:58:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(j=0;j<v[i].size();j++)
~^~~~~~~~~~~~
dango_maker.cpp:33:5: warning: unused variable 'hai' [-Wunused-variable]
ll hai=te;
^~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
71 ms |
82552 KB |
Output is correct |
2 |
Correct |
72 ms |
82552 KB |
Output is correct |
3 |
Correct |
71 ms |
82552 KB |
Output is correct |
4 |
Correct |
71 ms |
82680 KB |
Output is correct |
5 |
Correct |
71 ms |
82552 KB |
Output is correct |
6 |
Correct |
70 ms |
82552 KB |
Output is correct |
7 |
Correct |
71 ms |
82556 KB |
Output is correct |
8 |
Correct |
71 ms |
82524 KB |
Output is correct |
9 |
Correct |
71 ms |
82552 KB |
Output is correct |
10 |
Correct |
72 ms |
82512 KB |
Output is correct |
11 |
Correct |
71 ms |
82552 KB |
Output is correct |
12 |
Correct |
71 ms |
82548 KB |
Output is correct |
13 |
Correct |
71 ms |
82524 KB |
Output is correct |
14 |
Correct |
71 ms |
82552 KB |
Output is correct |
15 |
Correct |
71 ms |
82552 KB |
Output is correct |
16 |
Correct |
71 ms |
82552 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
71 ms |
82552 KB |
Output is correct |
2 |
Correct |
72 ms |
82552 KB |
Output is correct |
3 |
Correct |
71 ms |
82552 KB |
Output is correct |
4 |
Correct |
71 ms |
82680 KB |
Output is correct |
5 |
Correct |
71 ms |
82552 KB |
Output is correct |
6 |
Correct |
70 ms |
82552 KB |
Output is correct |
7 |
Correct |
71 ms |
82556 KB |
Output is correct |
8 |
Correct |
71 ms |
82524 KB |
Output is correct |
9 |
Correct |
71 ms |
82552 KB |
Output is correct |
10 |
Correct |
72 ms |
82512 KB |
Output is correct |
11 |
Correct |
71 ms |
82552 KB |
Output is correct |
12 |
Correct |
71 ms |
82548 KB |
Output is correct |
13 |
Correct |
71 ms |
82524 KB |
Output is correct |
14 |
Correct |
71 ms |
82552 KB |
Output is correct |
15 |
Correct |
71 ms |
82552 KB |
Output is correct |
16 |
Correct |
71 ms |
82552 KB |
Output is correct |
17 |
Correct |
75 ms |
82524 KB |
Output is correct |
18 |
Correct |
71 ms |
82568 KB |
Output is correct |
19 |
Incorrect |
70 ms |
82552 KB |
Output isn't correct |
20 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
71 ms |
82552 KB |
Output is correct |
2 |
Correct |
72 ms |
82552 KB |
Output is correct |
3 |
Correct |
71 ms |
82552 KB |
Output is correct |
4 |
Correct |
71 ms |
82680 KB |
Output is correct |
5 |
Correct |
71 ms |
82552 KB |
Output is correct |
6 |
Correct |
70 ms |
82552 KB |
Output is correct |
7 |
Correct |
71 ms |
82556 KB |
Output is correct |
8 |
Correct |
71 ms |
82524 KB |
Output is correct |
9 |
Correct |
71 ms |
82552 KB |
Output is correct |
10 |
Correct |
72 ms |
82512 KB |
Output is correct |
11 |
Correct |
71 ms |
82552 KB |
Output is correct |
12 |
Correct |
71 ms |
82548 KB |
Output is correct |
13 |
Correct |
71 ms |
82524 KB |
Output is correct |
14 |
Correct |
71 ms |
82552 KB |
Output is correct |
15 |
Correct |
71 ms |
82552 KB |
Output is correct |
16 |
Correct |
71 ms |
82552 KB |
Output is correct |
17 |
Correct |
75 ms |
82524 KB |
Output is correct |
18 |
Correct |
71 ms |
82568 KB |
Output is correct |
19 |
Incorrect |
70 ms |
82552 KB |
Output isn't correct |
20 |
Halted |
0 ms |
0 KB |
- |