oj.uz

Submission #136398

# Submission time Handle Problem Language Result Execution time Memory
136398 2019-07-25T08:33:00 Z 임유진(#3261) Connect (CEOI06_connect) C++14
76 / 100
 500 ms 1400 KB 
#include <bits/stdc++.h>
using namespace std;

const int INF = 1 << 30;

string m[30];
int dp[40][1 << 12];
vector<int> open[40];

int main() {
	int N, M;

	cin >> N >> M;
	getline(cin, m[0]);
	for(int i = 0; i < N; i++) getline(cin, m[i]);

	//for(int i = 0; i < N; i++) cout << m[i] << "\n";
	for(int i = 0; i <= M / 2; i++) {
		open[i].push_back(0);
		for(int j = 0; j < N / 2; j++) if(m[2 * j + 1][2 * i] == ' ') open[i][0] += (1 << j);
		for(int k = open[i][0]; k; k = open[i][0] & (k - 1)) open[i].push_back(open[i][0] & (k - 1));
		//cout << "open[i][0] = " << open[i][0] << "\n";
		//cout << "open[i].size = " << open[i].size() << "\n";
	}

	for(int i = 0; i <= M / 2; i++) for(int j = 0; j < (1 << (N / 2)); j++) dp[i][j] = INF;
	dp[0][0] = 0;
	for(int i = 1; i <= M / 2; i++) for(auto a : open[i]) for(auto b : open[i - 1]) {
		int t = -1, s = 0;
		bool c = true;
		for(int j = 0; j < N / 2; j++) {
			if(t != -1 && m[2 * j][2 * i - 1] == '-') {
				c = false;
				break;
			}
			if(m[2 * j + 1][2 * i - 1] == 'X') {
				if(t == -1) t = j;
				else if((a & (1 << j)) != 0 || (b & (1 << j)) != 0) {
					c = false;
					break;
				}
				else {
					s += 2 * (j - t) + 1;
					t = -1;
				}
			}
			if((a & (1 << j)) != 0 && (b & (1 << j)) != 0) {
				if(t == -1) s += 2;
				else {
					c = false;
					break;
				}
			}
			else if(a & (1 << j)) {
				if(t == -1) {
					t = j;
					s++;
				}
				else {
					s += 2 * (j - t + 1);
					t = -1;
				}
			}
			else if(b & (1 << j)) {
				if(t == -1) t = j;
				else {
					s += 2 * (j - t) + 1;
					t = -1;
				}
			}
		}
		if(c && t == -1) {
			//if(i == 1) printf("i = %d, a = %d, b = %d, t = %d, s = %d\n", i, a, b, t, s);
			//if(dp[i - 1][b] + s < dp[i][a] && i == 6 && a == 32) printf("dp[%d][%d] = %d\n", i - 1, b, dp[i - 1][b]);
			dp[i][a] = min(dp[i][a], dp[i - 1][b] + s);
		}
	}

	int cnt = 0;
	for(int i = 0; i < N; i++) for(int j = 0; j < M; j++) if(m[i][j] == 'X') cnt++;

	cout << dp[M / 2][0] - cnt / 2;
	return 0;
}

Subtask #1
76.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 376 KB Partially correct (80% score). Wrong board
2 Partially correct 2 ms 376 KB Partially correct (80% score). Wrong board
3 Partially correct 3 ms 376 KB Partially correct (80% score). Wrong board
4 Partially correct 2 ms 376 KB Partially correct (80% score). Wrong board
5 Partially correct 329 ms 632 KB Partially correct (80% score). Wrong board
6 Partially correct 2 ms 504 KB Partially correct (80% score). Wrong board
7 Partially correct 3 ms 376 KB Partially correct (80% score). Wrong board
8 Partially correct 4 ms 376 KB Partially correct (80% score). Wrong board
9 Partially correct 7 ms 480 KB Partially correct (80% score). Wrong board
10 Partially correct 20 ms 548 KB Partially correct (80% score). Wrong board
11 Partially correct 21 ms 380 KB Partially correct (80% score). Wrong board
12 Partially correct 61 ms 504 KB Partially correct (80% score). Wrong board
13 Partially correct 85 ms 632 KB Partially correct (80% score). Wrong board
14 Partially correct 18 ms 700 KB Partially correct (80% score). Wrong board
15 Partially correct 37 ms 632 KB Partially correct (80% score). Wrong board
16 Partially correct 2 ms 760 KB Partially correct (80% score). Wrong board
17 Partially correct 79 ms 760 KB Partially correct (80% score). Wrong board
18 Partially correct 5 ms 888 KB Partially correct (80% score). Wrong board
19 Execution timed out 1076 ms 1400 KB Time limit exceeded
20 Partially correct 459 ms 1272 KB Partially correct (80% score). Wrong board