oj.uz

답안 #116112

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
116112 2019-06-10T15:46:17 Z faustaadp Dango Maker (JOI18_dango_maker) C++17
13 / 100
 214 ms 262144 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 x[9000010];
int b[3000010];
int mat[3000010];
vector<int> v[3000010];
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(mat[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++)
			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<=hai;i++)
	{
		has-=dfs(i);
	}
	cout<<has<<"\n";
}

Compilation message

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

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 82576 KB Output is correct
2 Correct 72 ms 82556 KB Output is correct
3 Correct 70 ms 82552 KB Output is correct
4 Correct 71 ms 82552 KB Output is correct
5 Correct 72 ms 82552 KB Output is correct
6 Correct 70 ms 82516 KB Output is correct
7 Correct 72 ms 82684 KB Output is correct
8 Correct 70 ms 82552 KB Output is correct
9 Correct 72 ms 82680 KB Output is correct
10 Correct 72 ms 82524 KB Output is correct
11 Correct 71 ms 82556 KB Output is correct
12 Correct 76 ms 82524 KB Output is correct
13 Correct 75 ms 82552 KB Output is correct
14 Correct 77 ms 82552 KB Output is correct
15 Correct 74 ms 82552 KB Output is correct
16 Correct 70 ms 82552 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 82576 KB Output is correct
2 Correct 72 ms 82556 KB Output is correct
3 Correct 70 ms 82552 KB Output is correct
4 Correct 71 ms 82552 KB Output is correct
5 Correct 72 ms 82552 KB Output is correct
6 Correct 70 ms 82516 KB Output is correct
7 Correct 72 ms 82684 KB Output is correct
8 Correct 70 ms 82552 KB Output is correct
9 Correct 72 ms 82680 KB Output is correct
10 Correct 72 ms 82524 KB Output is correct
11 Correct 71 ms 82556 KB Output is correct
12 Correct 76 ms 82524 KB Output is correct
13 Correct 75 ms 82552 KB Output is correct
14 Correct 77 ms 82552 KB Output is correct
15 Correct 74 ms 82552 KB Output is correct
16 Correct 70 ms 82552 KB Output is correct
17 Correct 72 ms 82552 KB Output is correct
18 Correct 71 ms 82552 KB Output is correct
19 Correct 71 ms 82524 KB Output is correct
20 Runtime error 214 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
21 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 82576 KB Output is correct
2 Correct 72 ms 82556 KB Output is correct
3 Correct 70 ms 82552 KB Output is correct
4 Correct 71 ms 82552 KB Output is correct
5 Correct 72 ms 82552 KB Output is correct
6 Correct 70 ms 82516 KB Output is correct
7 Correct 72 ms 82684 KB Output is correct
8 Correct 70 ms 82552 KB Output is correct
9 Correct 72 ms 82680 KB Output is correct
10 Correct 72 ms 82524 KB Output is correct
11 Correct 71 ms 82556 KB Output is correct
12 Correct 76 ms 82524 KB Output is correct
13 Correct 75 ms 82552 KB Output is correct
14 Correct 77 ms 82552 KB Output is correct
15 Correct 74 ms 82552 KB Output is correct
16 Correct 70 ms 82552 KB Output is correct
17 Correct 72 ms 82552 KB Output is correct
18 Correct 71 ms 82552 KB Output is correct
19 Correct 71 ms 82524 KB Output is correct
20 Runtime error 214 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
21 Halted 0 ms 0 KB -