oj.uz

Submission #483933

# Submission time Handle Problem Language Result Execution time Memory
483933 2021-11-01T13:15:45 Z ymm Dango Maker (JOI18_dango_maker) C++17
13 / 100
 4 ms 4900 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 = 309;
int ch, cv;
char a[N][N];
int n, m;
vector<int> A[2*N*N];
bitset<2*N*N> 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';}

pii dfs(int v)
{
	int a = 1, b = 0;
	vis[v] = 1;
	for(int u : A[v]){
		if(vis[u]) continue;
		auto [x, y] = dfs(u);
		a += y; b += x;
	}
	return {a, b};
}

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)){
			if(gdv(i,j)) A[m*i+j].push_back(n*m + m*i+j);
			if(gdv(i-1,j+1)) A[m*i+j].push_back(n*m + m*i+j-m+1);
			if(gdv(i-2,j+2)) A[m*i+j].push_back(n*m + m*i+j-2*m+2);
		} else vis[m*i+j] = 1;
		if(gdv(i,j)){
			if(gdh(i,j)) A[n*m + m*i+j].push_back(m*i+j);
			if(gdh(i+1,j-1)) A[n*m + m*i+j].push_back(m*i+j+m-1);
			if(gdh(i+2,j-2)) A[n*m + m*i+j].push_back(m*i+j+2*m-2);
		} else vis[n*m + m*i+j] = 1;
	}
	int ans = 0;
	Loop(v,0,2*n*m)
	{
		if(vis[v]) continue;
		auto [x, y] = dfs(v);
		ans += max(x, y);
	}
	cout << ans << '\n';
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4684 KB Output is correct
2 Correct 3 ms 4684 KB Output is correct
3 Correct 4 ms 4812 KB Output is correct
4 Correct 3 ms 4684 KB Output is correct
5 Correct 3 ms 4684 KB Output is correct
6 Correct 3 ms 4684 KB Output is correct
7 Correct 4 ms 4900 KB Output is correct
8 Correct 3 ms 4684 KB Output is correct
9 Correct 2 ms 4684 KB Output is correct
10 Correct 3 ms 4684 KB Output is correct
11 Correct 2 ms 4684 KB Output is correct
12 Correct 3 ms 4684 KB Output is correct
13 Correct 2 ms 4804 KB Output is correct
14 Correct 3 ms 4808 KB Output is correct
15 Correct 2 ms 4808 KB Output is correct
16 Correct 3 ms 4684 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4684 KB Output is correct
2 Correct 3 ms 4684 KB Output is correct
3 Correct 4 ms 4812 KB Output is correct
4 Correct 3 ms 4684 KB Output is correct
5 Correct 3 ms 4684 KB Output is correct
6 Correct 3 ms 4684 KB Output is correct
7 Correct 4 ms 4900 KB Output is correct
8 Correct 3 ms 4684 KB Output is correct
9 Correct 2 ms 4684 KB Output is correct
10 Correct 3 ms 4684 KB Output is correct
11 Correct 2 ms 4684 KB Output is correct
12 Correct 3 ms 4684 KB Output is correct
13 Correct 2 ms 4804 KB Output is correct
14 Correct 3 ms 4808 KB Output is correct
15 Correct 2 ms 4808 KB Output is correct
16 Correct 3 ms 4684 KB Output is correct
17 Correct 2 ms 4684 KB Output is correct
18 Correct 3 ms 4684 KB Output is correct
19 Correct 2 ms 4808 KB Output is correct
20 Correct 3 ms 4808 KB Output is correct
21 Correct 2 ms 4808 KB Output is correct
22 Correct 3 ms 4684 KB Output is correct
23 Correct 3 ms 4684 KB Output is correct
24 Correct 2 ms 4684 KB Output is correct
25 Correct 3 ms 4684 KB Output is correct
26 Correct 3 ms 4812 KB Output is correct
27 Correct 4 ms 4684 KB Output is correct
28 Correct 3 ms 4684 KB Output is correct
29 Correct 3 ms 4808 KB Output is correct
30 Correct 4 ms 4808 KB Output is correct
31 Correct 3 ms 4808 KB Output is correct
32 Correct 2 ms 4684 KB Output is correct
33 Correct 3 ms 4684 KB Output is correct
34 Incorrect 2 ms 4812 KB Output isn't correct
35 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4684 KB Output is correct
2 Correct 3 ms 4684 KB Output is correct
3 Correct 4 ms 4812 KB Output is correct
4 Correct 3 ms 4684 KB Output is correct
5 Correct 3 ms 4684 KB Output is correct
6 Correct 3 ms 4684 KB Output is correct
7 Correct 4 ms 4900 KB Output is correct
8 Correct 3 ms 4684 KB Output is correct
9 Correct 2 ms 4684 KB Output is correct
10 Correct 3 ms 4684 KB Output is correct
11 Correct 2 ms 4684 KB Output is correct
12 Correct 3 ms 4684 KB Output is correct
13 Correct 2 ms 4804 KB Output is correct
14 Correct 3 ms 4808 KB Output is correct
15 Correct 2 ms 4808 KB Output is correct
16 Correct 3 ms 4684 KB Output is correct
17 Correct 2 ms 4684 KB Output is correct
18 Correct 3 ms 4684 KB Output is correct
19 Correct 2 ms 4808 KB Output is correct
20 Correct 3 ms 4808 KB Output is correct
21 Correct 2 ms 4808 KB Output is correct
22 Correct 3 ms 4684 KB Output is correct
23 Correct 3 ms 4684 KB Output is correct
24 Correct 2 ms 4684 KB Output is correct
25 Correct 3 ms 4684 KB Output is correct
26 Correct 3 ms 4812 KB Output is correct
27 Correct 4 ms 4684 KB Output is correct
28 Correct 3 ms 4684 KB Output is correct
29 Correct 3 ms 4808 KB Output is correct
30 Correct 4 ms 4808 KB Output is correct
31 Correct 3 ms 4808 KB Output is correct
32 Correct 2 ms 4684 KB Output is correct
33 Correct 3 ms 4684 KB Output is correct
34 Incorrect 2 ms 4812 KB Output isn't correct
35 Halted 0 ms 0 KB -