oj.uz

Submission #483935

# Submission time Handle Problem Language Result Execution time Memory
483935 2021-11-01T13:38:12 Z ymm Dango Maker (JOI18_dango_maker) C++17
33 / 100
 568 ms 262148 KB 
///
///   You fell for it, fool!
///   Thunder Cross Split Attack!
///

#include <bits/stdc++.h>
#define Loop(x,l,r) for(ll x = ll(l); x < ll(r); ++x)
typedef long long ll;
typedef std::pair<int,int> pii;
using namespace std;

const int N = 3009;
int ch, cv;
char a[N][N];
int n, m;
vector<int> A[N*N/3];
int mp[2][N][N];
int mch[N*N/3];
pii par[N*N/3];
bitset<N*N/3> vis;

bool gdh(int i, int j){return 0 <= i && i < n && 0 <= j && j+3 <= m && a[i][j] == 'R' && a[i][j+1] == 'G' && a[i][j+2] == 'W';}
bool gdv(int i, int j){return 0 <= i && i+2 <= n && 0 <= j && j < m && a[i][j] == 'R' && a[i+1][j] == 'G' && a[i+2][j] == 'W';}

bool bfs(int s)
{
	par[s] = {-1, -1};
	vector<int> q;
	q.push_back(s); vis[s] = 1;
	for(int i = 0; i < q.size(); ++i)
	{
		int v = q[i];
		for(int u : A[v])
		{
			if(mch[u] == 0){
				while(v != -1){
					mch[u] = v;
					u = par[v].second;
					v = par[v].first;
				}
				for(int z : q) vis[z] = 0;
				return 1;
			}
			if(vis[mch[u]]) continue;
			q.push_back(mch[u]);
			vis[mch[u]] = 1;
			par[mch[u]] = {v, u};
		}
	}
	return 0;
}

int main()
{
	ios::sync_with_stdio(false); cin.tie(0);
	cin >> n >> m;
	Loop(i,0,n) cin >> a[i];
	Loop(i,0,n) Loop(j,0,m) {
		if(gdh(i,j)) mp[0][i][j] = ++ch;
		if(gdv(i,j)) mp[1][i][j] = ++cv;
	}
	Loop(i,0,n) Loop(j,0,m) {
		if(gdh(i,j)){
			if(gdv(i,j)) A[mp[0][i][j]].push_back(mp[1][i][j]);
			if(gdv(i-1,j+1)) A[mp[0][i][j]].push_back(mp[1][i-1][j+1]);
			if(gdv(i-2,j+2)) A[mp[0][i][j]].push_back(mp[1][i-2][j+2]);
		}
	}
	int ans = ch + cv;
	Loop(v,1,ch+1)
	{
		ans -= bfs(v);
	}
	cout << ans << '\n';
}

Compilation message

dango_maker.cpp: In function 'bool bfs(int)':
dango_maker.cpp:30:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |  for(int i = 0; i < q.size(); ++i)
      |                 ~~^~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 71104 KB Output is correct
2 Correct 34 ms 71196 KB Output is correct
3 Correct 33 ms 71156 KB Output is correct
4 Correct 34 ms 71112 KB Output is correct
5 Correct 35 ms 71208 KB Output is correct
6 Correct 35 ms 71248 KB Output is correct
7 Correct 35 ms 71228 KB Output is correct
8 Correct 35 ms 71216 KB Output is correct
9 Correct 34 ms 71204 KB Output is correct
10 Correct 34 ms 71116 KB Output is correct
11 Correct 34 ms 71104 KB Output is correct
12 Correct 35 ms 71264 KB Output is correct
13 Correct 34 ms 71132 KB Output is correct
14 Correct 35 ms 71164 KB Output is correct
15 Correct 35 ms 71140 KB Output is correct
16 Correct 35 ms 71124 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 71104 KB Output is correct
2 Correct 34 ms 71196 KB Output is correct
3 Correct 33 ms 71156 KB Output is correct
4 Correct 34 ms 71112 KB Output is correct
5 Correct 35 ms 71208 KB Output is correct
6 Correct 35 ms 71248 KB Output is correct
7 Correct 35 ms 71228 KB Output is correct
8 Correct 35 ms 71216 KB Output is correct
9 Correct 34 ms 71204 KB Output is correct
10 Correct 34 ms 71116 KB Output is correct
11 Correct 34 ms 71104 KB Output is correct
12 Correct 35 ms 71264 KB Output is correct
13 Correct 34 ms 71132 KB Output is correct
14 Correct 35 ms 71164 KB Output is correct
15 Correct 35 ms 71140 KB Output is correct
16 Correct 35 ms 71124 KB Output is correct
17 Correct 34 ms 71180 KB Output is correct
18 Correct 35 ms 71136 KB Output is correct
19 Correct 35 ms 71232 KB Output is correct
20 Correct 35 ms 71240 KB Output is correct
21 Correct 37 ms 71244 KB Output is correct
22 Correct 35 ms 71236 KB Output is correct
23 Correct 35 ms 71200 KB Output is correct
24 Correct 35 ms 71168 KB Output is correct
25 Correct 34 ms 71132 KB Output is correct
26 Correct 35 ms 71196 KB Output is correct
27 Correct 36 ms 71260 KB Output is correct
28 Correct 35 ms 71260 KB Output is correct
29 Correct 35 ms 71224 KB Output is correct
30 Correct 36 ms 71108 KB Output is correct
31 Correct 37 ms 71188 KB Output is correct
32 Correct 35 ms 71112 KB Output is correct
33 Correct 35 ms 71236 KB Output is correct
34 Correct 35 ms 71244 KB Output is correct
35 Correct 35 ms 71292 KB Output is correct
36 Correct 38 ms 71188 KB Output is correct
37 Correct 35 ms 71236 KB Output is correct
38 Correct 37 ms 71244 KB Output is correct
39 Correct 34 ms 71228 KB Output is correct
40 Correct 34 ms 71304 KB Output is correct
41 Correct 35 ms 71200 KB Output is correct
42 Correct 36 ms 71272 KB Output is correct
43 Correct 36 ms 71272 KB Output is correct
44 Correct 36 ms 71240 KB Output is correct
45 Correct 38 ms 71308 KB Output is correct
46 Correct 37 ms 71304 KB Output is correct
47 Correct 35 ms 71236 KB Output is correct
48 Correct 36 ms 71220 KB Output is correct
49 Correct 39 ms 71244 KB Output is correct
50 Correct 35 ms 71244 KB Output is correct
51 Correct 34 ms 71236 KB Output is correct
52 Correct 38 ms 71244 KB Output is correct
53 Correct 37 ms 71296 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 71104 KB Output is correct
2 Correct 34 ms 71196 KB Output is correct
3 Correct 33 ms 71156 KB Output is correct
4 Correct 34 ms 71112 KB Output is correct
5 Correct 35 ms 71208 KB Output is correct
6 Correct 35 ms 71248 KB Output is correct
7 Correct 35 ms 71228 KB Output is correct
8 Correct 35 ms 71216 KB Output is correct
9 Correct 34 ms 71204 KB Output is correct
10 Correct 34 ms 71116 KB Output is correct
11 Correct 34 ms 71104 KB Output is correct
12 Correct 35 ms 71264 KB Output is correct
13 Correct 34 ms 71132 KB Output is correct
14 Correct 35 ms 71164 KB Output is correct
15 Correct 35 ms 71140 KB Output is correct
16 Correct 35 ms 71124 KB Output is correct
17 Correct 34 ms 71180 KB Output is correct
18 Correct 35 ms 71136 KB Output is correct
19 Correct 35 ms 71232 KB Output is correct
20 Correct 35 ms 71240 KB Output is correct
21 Correct 37 ms 71244 KB Output is correct
22 Correct 35 ms 71236 KB Output is correct
23 Correct 35 ms 71200 KB Output is correct
24 Correct 35 ms 71168 KB Output is correct
25 Correct 34 ms 71132 KB Output is correct
26 Correct 35 ms 71196 KB Output is correct
27 Correct 36 ms 71260 KB Output is correct
28 Correct 35 ms 71260 KB Output is correct
29 Correct 35 ms 71224 KB Output is correct
30 Correct 36 ms 71108 KB Output is correct
31 Correct 37 ms 71188 KB Output is correct
32 Correct 35 ms 71112 KB Output is correct
33 Correct 35 ms 71236 KB Output is correct
34 Correct 35 ms 71244 KB Output is correct
35 Correct 35 ms 71292 KB Output is correct
36 Correct 38 ms 71188 KB Output is correct
37 Correct 35 ms 71236 KB Output is correct
38 Correct 37 ms 71244 KB Output is correct
39 Correct 34 ms 71228 KB Output is correct
40 Correct 34 ms 71304 KB Output is correct
41 Correct 35 ms 71200 KB Output is correct
42 Correct 36 ms 71272 KB Output is correct
43 Correct 36 ms 71272 KB Output is correct
44 Correct 36 ms 71240 KB Output is correct
45 Correct 38 ms 71308 KB Output is correct
46 Correct 37 ms 71304 KB Output is correct
47 Correct 35 ms 71236 KB Output is correct
48 Correct 36 ms 71220 KB Output is correct
49 Correct 39 ms 71244 KB Output is correct
50 Correct 35 ms 71244 KB Output is correct
51 Correct 34 ms 71236 KB Output is correct
52 Correct 38 ms 71244 KB Output is correct
53 Correct 37 ms 71296 KB Output is correct
54 Correct 35 ms 71128 KB Output is correct
55 Correct 37 ms 80460 KB Output is correct
56 Correct 35 ms 71360 KB Output is correct
57 Correct 42 ms 87116 KB Output is correct
58 Correct 73 ms 91400 KB Output is correct
59 Correct 297 ms 166584 KB Output is correct
60 Correct 292 ms 166580 KB Output is correct
61 Correct 290 ms 166508 KB Output is correct
62 Correct 38 ms 71244 KB Output is correct
63 Correct 286 ms 166048 KB Output is correct
64 Runtime error 568 ms 262148 KB Execution killed with signal 9
65 Halted 0 ms 0 KB -