oj.uz

답안 #667544

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
667544 2022-12-01T17:11:16 Z AmirAli_H1 Dango Maker (JOI18_dango_maker) C++17
33 / 100
 703 ms 262144 KB 
// In the name of Allah

#include <bits/stdc++.h>
using namespace std;

typedef long long int	ll;
typedef long double	ld;
typedef pair<int, int>	pii;
typedef pair<ll, ll>	pll;

#define all(x)		(x).begin(),(x).end()
#define len(x)		((ll) (x).size())
#define F		first
#define S		second
#define pb		push_back
#define sep             ' '
#define endl            '\n'
#define Mp		make_pair
#define debug(x)	cerr << #x << ": " <<  x << endl;
#define kill(x)		cout << x << '\n', exit(0);
#define set_dec(x)	cout << fixed << setprecision(x);
#define file_io(x,y)	freopen(x, "r", stdin); freopen(y, "w", stdout);

int n, m;
const int maxn = 3e3 + 5;
const int maxs = 9e6 + 5;
const int maxc = 6e6 + 5;
string s[maxn];
int cntv = 0;
int arr[maxs];
vector<pair<int, pii>> adj;
bitset<4> ind[maxc];
bitset<maxc> mark, c4;
int dp[maxc][8];

int GI(int i, int j) {
	return i * m + j;
}

void dfs(int v, int p = -1) {
	mark[v] = 1;
	vector<int> vc;
	for (int i = 0; i < 3 && ind[v][i]; i++) {
		int u;
		if (i == 0) u = adj[v].F;
		else if (i == 1) u = adj[v].S.F;
		else if (i == 2) u = adj[v].S.S;
		
		if (!mark[u]) {
			dfs(u, v);
			vc.pb(u);
		}
		else if (u != p) {
			c4[v] = 1;
		}
	}
	for (int i = 0; i < 8; i++) {
		int b1 = (bool) (i & 1), b2 = (bool) (i & 2), b3 = (bool) (i & 4);
		if ((b1 && b2) || (b2 && b3)) continue;
		dp[v][i] += b1;
		for (int u : vc) {
			int val0 = b1 * 2 + b2 * 4, val1 = 1 + b1 * 2 + b2 * 4;
			if (b1 || (c4[u] && b3)) {
				dp[v][i] += dp[u][val0];
			}
			else {
				dp[v][i] += max(dp[u][val0], dp[u][val1]);
			}
		}
	}
	vc.clear();
}

int main() {
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	
	cin >> n >> m;
	for (int i = 0; i < n; i++) cin >> s[i];
	
	fill(arr, arr + maxs, -1);
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m - 2; j++) {
			if (s[i][j] == 'R' && s[i][j + 1] == 'G' && s[i][j + 2] == 'W') {
				adj.pb(Mp(0, Mp(0, 0)));
				for (int j1 : {j, j + 1, j + 2}) {
					if (arr[GI(i, j1)] != -1) {
						int v1 = arr[GI(i, j1)], v2 = cntv;
						
						if (!ind[v1][0]) adj[v1].F = v2;
						else if (!ind[v1][1]) adj[v1].S.F = v2;
						else if (!ind[v1][2]) adj[v1].S.S = v2;
						ind[v1] <<= 1; ind[v1][0] = 1;
						
						if (!ind[v2][0]) adj[v2].F = v1;
						else if (!ind[v2][1]) adj[v2].S.F = v1;
						else if (!ind[v2][2]) adj[v2].S.S = v1;
						ind[v2] <<= 1; ind[v2][0] = 1;
					}
					else arr[GI(i, j1)] = cntv;
				}
				cntv++;
			}
		}
	}
	
	for (int i = 0; i < n - 2; i++) {
		for (int j = 0; j < m; j++) {
			if (s[i][j] == 'R' && s[i + 1][j] == 'G' && s[i + 2][j] == 'W') {
				adj.pb(Mp(0, Mp(0, 0)));
				for (int i1 : {i, i + 1, i + 2}) {
					if (arr[GI(i1, j)] != -1) {
						int v1 = arr[GI(i1, j)], v2 = cntv;
						
						if (!ind[v1][0]) adj[v1].F = v2;
						else if (!ind[v1][1]) adj[v1].S.F = v2;
						else if (!ind[v1][2]) adj[v1].S.S = v2;
						ind[v1] <<= 1; ind[v1][0] = 1;
						
						if (!ind[v2][0]) adj[v2].F = v1;
						else if (!ind[v2][1]) adj[v2].S.F = v1;
						else if (!ind[v2][2]) adj[v2].S.S = v1;
						ind[v2] <<= 1; ind[v2][0] = 1;
					}
					else arr[GI(i1, j)] = cntv;
				}
				cntv++;
			}
		}
	}
	
	int output = 0;
	for (int i = 0; i < cntv; i++) {
		if (!mark[i]) {
			dfs(i);
			output += max(dp[i][0], dp[i][1]);
		}
	}
	
	cout << output << endl;
	
	return 0;
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 35540 KB Output is correct
2 Correct 14 ms 35596 KB Output is correct
3 Correct 15 ms 35600 KB Output is correct
4 Correct 14 ms 35576 KB Output is correct
5 Correct 15 ms 35540 KB Output is correct
6 Correct 13 ms 35568 KB Output is correct
7 Correct 15 ms 35628 KB Output is correct
8 Correct 14 ms 35540 KB Output is correct
9 Correct 15 ms 35540 KB Output is correct
10 Correct 14 ms 35540 KB Output is correct
11 Correct 18 ms 35632 KB Output is correct
12 Correct 13 ms 35612 KB Output is correct
13 Correct 13 ms 35588 KB Output is correct
14 Correct 14 ms 35572 KB Output is correct
15 Correct 13 ms 35568 KB Output is correct
16 Correct 13 ms 35540 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 35540 KB Output is correct
2 Correct 14 ms 35596 KB Output is correct
3 Correct 15 ms 35600 KB Output is correct
4 Correct 14 ms 35576 KB Output is correct
5 Correct 15 ms 35540 KB Output is correct
6 Correct 13 ms 35568 KB Output is correct
7 Correct 15 ms 35628 KB Output is correct
8 Correct 14 ms 35540 KB Output is correct
9 Correct 15 ms 35540 KB Output is correct
10 Correct 14 ms 35540 KB Output is correct
11 Correct 18 ms 35632 KB Output is correct
12 Correct 13 ms 35612 KB Output is correct
13 Correct 13 ms 35588 KB Output is correct
14 Correct 14 ms 35572 KB Output is correct
15 Correct 13 ms 35568 KB Output is correct
16 Correct 13 ms 35540 KB Output is correct
17 Correct 13 ms 35540 KB Output is correct
18 Correct 16 ms 35576 KB Output is correct
19 Correct 14 ms 35540 KB Output is correct
20 Correct 13 ms 35540 KB Output is correct
21 Correct 14 ms 35652 KB Output is correct
22 Correct 14 ms 35540 KB Output is correct
23 Correct 13 ms 35584 KB Output is correct
24 Correct 14 ms 35540 KB Output is correct
25 Correct 14 ms 35540 KB Output is correct
26 Correct 13 ms 35540 KB Output is correct
27 Correct 14 ms 35540 KB Output is correct
28 Correct 14 ms 35572 KB Output is correct
29 Correct 13 ms 35576 KB Output is correct
30 Correct 13 ms 35540 KB Output is correct
31 Correct 13 ms 35540 KB Output is correct
32 Correct 14 ms 35540 KB Output is correct
33 Correct 15 ms 35668 KB Output is correct
34 Correct 16 ms 35544 KB Output is correct
35 Correct 14 ms 35540 KB Output is correct
36 Correct 16 ms 35524 KB Output is correct
37 Correct 13 ms 35540 KB Output is correct
38 Correct 15 ms 35540 KB Output is correct
39 Correct 14 ms 35588 KB Output is correct
40 Correct 14 ms 35540 KB Output is correct
41 Correct 14 ms 35668 KB Output is correct
42 Correct 14 ms 35540 KB Output is correct
43 Correct 14 ms 35636 KB Output is correct
44 Correct 14 ms 35592 KB Output is correct
45 Correct 12 ms 35540 KB Output is correct
46 Correct 13 ms 35540 KB Output is correct
47 Correct 14 ms 35644 KB Output is correct
48 Correct 14 ms 35620 KB Output is correct
49 Correct 13 ms 35540 KB Output is correct
50 Correct 14 ms 35628 KB Output is correct
51 Correct 14 ms 35640 KB Output is correct
52 Correct 14 ms 35596 KB Output is correct
53 Correct 13 ms 35540 KB Output is correct

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 35540 KB Output is correct
2 Correct 14 ms 35596 KB Output is correct
3 Correct 15 ms 35600 KB Output is correct
4 Correct 14 ms 35576 KB Output is correct
5 Correct 15 ms 35540 KB Output is correct
6 Correct 13 ms 35568 KB Output is correct
7 Correct 15 ms 35628 KB Output is correct
8 Correct 14 ms 35540 KB Output is correct
9 Correct 15 ms 35540 KB Output is correct
10 Correct 14 ms 35540 KB Output is correct
11 Correct 18 ms 35632 KB Output is correct
12 Correct 13 ms 35612 KB Output is correct
13 Correct 13 ms 35588 KB Output is correct
14 Correct 14 ms 35572 KB Output is correct
15 Correct 13 ms 35568 KB Output is correct
16 Correct 13 ms 35540 KB Output is correct
17 Correct 13 ms 35540 KB Output is correct
18 Correct 16 ms 35576 KB Output is correct
19 Correct 14 ms 35540 KB Output is correct
20 Correct 13 ms 35540 KB Output is correct
21 Correct 14 ms 35652 KB Output is correct
22 Correct 14 ms 35540 KB Output is correct
23 Correct 13 ms 35584 KB Output is correct
24 Correct 14 ms 35540 KB Output is correct
25 Correct 14 ms 35540 KB Output is correct
26 Correct 13 ms 35540 KB Output is correct
27 Correct 14 ms 35540 KB Output is correct
28 Correct 14 ms 35572 KB Output is correct
29 Correct 13 ms 35576 KB Output is correct
30 Correct 13 ms 35540 KB Output is correct
31 Correct 13 ms 35540 KB Output is correct
32 Correct 14 ms 35540 KB Output is correct
33 Correct 15 ms 35668 KB Output is correct
34 Correct 16 ms 35544 KB Output is correct
35 Correct 14 ms 35540 KB Output is correct
36 Correct 16 ms 35524 KB Output is correct
37 Correct 13 ms 35540 KB Output is correct
38 Correct 15 ms 35540 KB Output is correct
39 Correct 14 ms 35588 KB Output is correct
40 Correct 14 ms 35540 KB Output is correct
41 Correct 14 ms 35668 KB Output is correct
42 Correct 14 ms 35540 KB Output is correct
43 Correct 14 ms 35636 KB Output is correct
44 Correct 14 ms 35592 KB Output is correct
45 Correct 12 ms 35540 KB Output is correct
46 Correct 13 ms 35540 KB Output is correct
47 Correct 14 ms 35644 KB Output is correct
48 Correct 14 ms 35620 KB Output is correct
49 Correct 13 ms 35540 KB Output is correct
50 Correct 14 ms 35628 KB Output is correct
51 Correct 14 ms 35640 KB Output is correct
52 Correct 14 ms 35596 KB Output is correct
53 Correct 13 ms 35540 KB Output is correct
54 Correct 17 ms 35664 KB Output is correct
55 Correct 14 ms 35596 KB Output is correct
56 Correct 14 ms 35796 KB Output is correct
57 Correct 15 ms 35872 KB Output is correct
58 Correct 35 ms 40988 KB Output is correct
59 Correct 192 ms 79904 KB Output is correct
60 Correct 192 ms 79904 KB Output is correct
61 Correct 198 ms 79984 KB Output is correct
62 Correct 14 ms 35668 KB Output is correct
63 Correct 193 ms 78396 KB Output is correct
64 Runtime error 703 ms 262144 KB Execution killed with signal 9
65 Halted 0 ms 0 KB -