#include <bits/stdc++.h>
using namespace std;
#define fo(i,s,t) for(int i = s; i <= t; ++ i)
#define fd(i,s,t) for(int i = s; i >= t; -- i)
#define bf(i,s) for(int i = head[s]; i; i = e[i].next)
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
#define pb push_back
#define VI vector<int>
#define sf scanf
#define pf printf
#define fp freopen
#define SZ(x) ((int)(x).size())
#ifdef MPS
#define D(x...) printf(x)
#else
#define D(x...)
#endif
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
const int inf = 1<<30;
const ll INF = 1ll<<60;
const db Inf = 1e20;
const db eps = 1e-9;
void gmax(int &a,int b){a = (a > b ? a : b);}
void gmin(int &a,int b){a = (a < b ? a : b);}
const int maxn = 3005;
int n, m, p[maxn][maxn];
int b[maxn*maxn];
char a[maxn][maxn];
int T, vis[maxn*maxn];
VI adj[maxn*maxn];
void link(int u, int v)
{
adj[u].pb(v);
adj[v].pb(u);
}
int dfs(int u)
{
for(auto p : adj[u]) if(vis[p] != T)
{
vis[p] = T;
if(!b[p] || dfs(p))
{
b[p] = u;
return 1;
}
}
return 0;
}
int main()
{
#ifdef MPS
fp("1.in","r",stdin);
fp("1.out","w",stdout);
#endif
sf("%d%d",&n,&m);
fo(i,1,n) sf("%s",a[i]+1);
int tot = 0;
fo(i,1,n) fo(j,1,m) p[i][j] = ++ tot;
fo(i,1,n) fo(j,1,m) if(a[i][j] == 'R')
{
if(j+2 <= m && a[i][j+1] == 'G' && a[i][j+2] == 'W')
link(p[i][j], p[i][j+2]);
if(j-2 >= 1 && a[i][j-1] == 'G' && a[i][j-2] == 'W')
link(p[i][j], p[i][j-2]);
if(i+2 <= n && a[i+1][j] == 'G' && a[i+2][j] == 'W')
link(p[i][j], p[i+2][j]);
if(i-2 >= 1 && a[i-1][j] == 'G' && a[i-2][j] == 'W')
link(p[i][j], p[i-2][j]);
}
int ans = 0;
fo(i,1,n) fo(j,1,m) if(a[i][j] == 'R')
{
++ T;
ans += dfs(p[i][j]);
}
pf("%d\n",ans);
return 0;
}
Compilation message
dango_maker.cpp: In function 'int main()':
dango_maker.cpp:65:4: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
sf("%d%d",&n,&m);
^
dango_maker.cpp:66:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
fo(i,1,n) sf("%s",a[i]+1);
^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
229 ms |
212472 KB |
Output is correct |
2 |
Correct |
206 ms |
212504 KB |
Output is correct |
3 |
Correct |
203 ms |
212444 KB |
Output is correct |
4 |
Correct |
197 ms |
212472 KB |
Output is correct |
5 |
Correct |
201 ms |
212472 KB |
Output is correct |
6 |
Incorrect |
197 ms |
212472 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
229 ms |
212472 KB |
Output is correct |
2 |
Correct |
206 ms |
212504 KB |
Output is correct |
3 |
Correct |
203 ms |
212444 KB |
Output is correct |
4 |
Correct |
197 ms |
212472 KB |
Output is correct |
5 |
Correct |
201 ms |
212472 KB |
Output is correct |
6 |
Incorrect |
197 ms |
212472 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
229 ms |
212472 KB |
Output is correct |
2 |
Correct |
206 ms |
212504 KB |
Output is correct |
3 |
Correct |
203 ms |
212444 KB |
Output is correct |
4 |
Correct |
197 ms |
212472 KB |
Output is correct |
5 |
Correct |
201 ms |
212472 KB |
Output is correct |
6 |
Incorrect |
197 ms |
212472 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |