oj.uz

Submission #116106

# Submission time Handle Problem Language Result Execution time Memory
116106 2019-06-10T15:37:44 Z faustaadp Dango Maker (JOI18_dango_maker) C++17
0 / 100
 275 ms 247032 KB 
#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 p[9000010];
int x[9000010];
int b[9000010];
int mat[9000010];
vector<ll> v[9000010];
ll dfs(ll aa)
{
	if(b[aa]==i)
		return 0;
	b[aa]=1;
	ll ii;
	for(ii=0;ii<v[aa].size();ii++)
		if(mat[v[aa][ii]]==-1||dfs(v[aa][ii]))
		{
			mat[v[aa][ii]]=aa;
			return 1;
		}
	return 0;
}
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++)
		{
			p[(i-1)*m+j]=(i-1)*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;
			}
		}
	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[te].pb(x[(i-1)*m+j]);
				}
				if(x[(i)*m+j]!=0)
				{
					v[te].pb(x[(i-1)*m+j]);
				}
				if(x[(i+1)*m+j]!=0)
				{
					v[te].pb(x[(i-1)*m+j]);
				}
			}				
		}
	memset(mat,-1,sizeof(mat));
	for(i=1;i<=te;i++)
	{
		has-=dfs(i);
	}
	cout<<has<<"\n";
}

Compilation message

dango_maker.cpp: In function 'll dfs(ll)':
dango_maker.cpp:21:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(ii=0;ii<v[aa].size();ii++)
           ~~^~~~~~~~~~~~~

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 275 ms 246908 KB Output is correct
2 Correct 208 ms 247032 KB Output is correct
3 Correct 215 ms 246908 KB Output is correct
4 Correct 209 ms 246904 KB Output is correct
5 Correct 216 ms 246916 KB Output is correct
6 Incorrect 222 ms 246876 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 275 ms 246908 KB Output is correct
2 Correct 208 ms 247032 KB Output is correct
3 Correct 215 ms 246908 KB Output is correct
4 Correct 209 ms 246904 KB Output is correct
5 Correct 216 ms 246916 KB Output is correct
6 Incorrect 222 ms 246876 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 275 ms 246908 KB Output is correct
2 Correct 208 ms 247032 KB Output is correct
3 Correct 215 ms 246908 KB Output is correct
4 Correct 209 ms 246904 KB Output is correct
5 Correct 216 ms 246916 KB Output is correct
6 Incorrect 222 ms 246876 KB Output isn't correct
7 Halted 0 ms 0 KB -