oj.uz

답안 #116107

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
116107 2019-06-10T15:38:30 Z faustaadp Dango Maker (JOI18_dango_maker) C++17
33 / 100
 323 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 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)*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
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 205 ms 247024 KB Output is correct
2 Correct 201 ms 246904 KB Output is correct
3 Correct 220 ms 246892 KB Output is correct
4 Correct 212 ms 247100 KB Output is correct
5 Correct 209 ms 246904 KB Output is correct
6 Correct 217 ms 246976 KB Output is correct
7 Correct 218 ms 246904 KB Output is correct
8 Correct 215 ms 246904 KB Output is correct
9 Correct 213 ms 247004 KB Output is correct
10 Correct 202 ms 246904 KB Output is correct
11 Correct 209 ms 246904 KB Output is correct
12 Correct 208 ms 247076 KB Output is correct
13 Correct 214 ms 246904 KB Output is correct
14 Correct 212 ms 246904 KB Output is correct
15 Correct 212 ms 246904 KB Output is correct
16 Correct 204 ms 246948 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 205 ms 247024 KB Output is correct
2 Correct 201 ms 246904 KB Output is correct
3 Correct 220 ms 246892 KB Output is correct
4 Correct 212 ms 247100 KB Output is correct
5 Correct 209 ms 246904 KB Output is correct
6 Correct 217 ms 246976 KB Output is correct
7 Correct 218 ms 246904 KB Output is correct
8 Correct 215 ms 246904 KB Output is correct
9 Correct 213 ms 247004 KB Output is correct
10 Correct 202 ms 246904 KB Output is correct
11 Correct 209 ms 246904 KB Output is correct
12 Correct 208 ms 247076 KB Output is correct
13 Correct 214 ms 246904 KB Output is correct
14 Correct 212 ms 246904 KB Output is correct
15 Correct 212 ms 246904 KB Output is correct
16 Correct 204 ms 246948 KB Output is correct
17 Correct 207 ms 247000 KB Output is correct
18 Correct 202 ms 246904 KB Output is correct
19 Correct 204 ms 247032 KB Output is correct
20 Correct 202 ms 246904 KB Output is correct
21 Correct 215 ms 246904 KB Output is correct
22 Correct 208 ms 247032 KB Output is correct
23 Correct 211 ms 246904 KB Output is correct
24 Correct 210 ms 246956 KB Output is correct
25 Correct 212 ms 247104 KB Output is correct
26 Correct 230 ms 246904 KB Output is correct
27 Correct 202 ms 246908 KB Output is correct
28 Correct 208 ms 247032 KB Output is correct
29 Correct 216 ms 247136 KB Output is correct
30 Correct 215 ms 247100 KB Output is correct
31 Correct 217 ms 247032 KB Output is correct
32 Correct 213 ms 247136 KB Output is correct
33 Correct 210 ms 247032 KB Output is correct
34 Correct 210 ms 247032 KB Output is correct
35 Correct 214 ms 246904 KB Output is correct
36 Correct 212 ms 246996 KB Output is correct
37 Correct 210 ms 247036 KB Output is correct
38 Correct 210 ms 246940 KB Output is correct
39 Correct 211 ms 246904 KB Output is correct
40 Correct 208 ms 246904 KB Output is correct
41 Correct 212 ms 246968 KB Output is correct
42 Correct 221 ms 247032 KB Output is correct
43 Correct 209 ms 246904 KB Output is correct
44 Correct 203 ms 247008 KB Output is correct
45 Correct 204 ms 247032 KB Output is correct
46 Correct 205 ms 247028 KB Output is correct
47 Correct 215 ms 247312 KB Output is correct
48 Correct 239 ms 246904 KB Output is correct
49 Correct 210 ms 247032 KB Output is correct
50 Correct 201 ms 247036 KB Output is correct
51 Correct 214 ms 246904 KB Output is correct
52 Correct 211 ms 247032 KB Output is correct
53 Correct 212 ms 247032 KB Output is correct

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 205 ms 247024 KB Output is correct
2 Correct 201 ms 246904 KB Output is correct
3 Correct 220 ms 246892 KB Output is correct
4 Correct 212 ms 247100 KB Output is correct
5 Correct 209 ms 246904 KB Output is correct
6 Correct 217 ms 246976 KB Output is correct
7 Correct 218 ms 246904 KB Output is correct
8 Correct 215 ms 246904 KB Output is correct
9 Correct 213 ms 247004 KB Output is correct
10 Correct 202 ms 246904 KB Output is correct
11 Correct 209 ms 246904 KB Output is correct
12 Correct 208 ms 247076 KB Output is correct
13 Correct 214 ms 246904 KB Output is correct
14 Correct 212 ms 246904 KB Output is correct
15 Correct 212 ms 246904 KB Output is correct
16 Correct 204 ms 246948 KB Output is correct
17 Correct 207 ms 247000 KB Output is correct
18 Correct 202 ms 246904 KB Output is correct
19 Correct 204 ms 247032 KB Output is correct
20 Correct 202 ms 246904 KB Output is correct
21 Correct 215 ms 246904 KB Output is correct
22 Correct 208 ms 247032 KB Output is correct
23 Correct 211 ms 246904 KB Output is correct
24 Correct 210 ms 246956 KB Output is correct
25 Correct 212 ms 247104 KB Output is correct
26 Correct 230 ms 246904 KB Output is correct
27 Correct 202 ms 246908 KB Output is correct
28 Correct 208 ms 247032 KB Output is correct
29 Correct 216 ms 247136 KB Output is correct
30 Correct 215 ms 247100 KB Output is correct
31 Correct 217 ms 247032 KB Output is correct
32 Correct 213 ms 247136 KB Output is correct
33 Correct 210 ms 247032 KB Output is correct
34 Correct 210 ms 247032 KB Output is correct
35 Correct 214 ms 246904 KB Output is correct
36 Correct 212 ms 246996 KB Output is correct
37 Correct 210 ms 247036 KB Output is correct
38 Correct 210 ms 246940 KB Output is correct
39 Correct 211 ms 246904 KB Output is correct
40 Correct 208 ms 246904 KB Output is correct
41 Correct 212 ms 246968 KB Output is correct
42 Correct 221 ms 247032 KB Output is correct
43 Correct 209 ms 246904 KB Output is correct
44 Correct 203 ms 247008 KB Output is correct
45 Correct 204 ms 247032 KB Output is correct
46 Correct 205 ms 247028 KB Output is correct
47 Correct 215 ms 247312 KB Output is correct
48 Correct 239 ms 246904 KB Output is correct
49 Correct 210 ms 247032 KB Output is correct
50 Correct 201 ms 247036 KB Output is correct
51 Correct 214 ms 246904 KB Output is correct
52 Correct 211 ms 247032 KB Output is correct
53 Correct 212 ms 247032 KB Output is correct
54 Correct 211 ms 247056 KB Output is correct
55 Correct 217 ms 255884 KB Output is correct
56 Correct 203 ms 247160 KB Output is correct
57 Correct 207 ms 253048 KB Output is correct
58 Correct 238 ms 259576 KB Output is correct
59 Runtime error 323 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
60 Halted 0 ms 0 KB -