oj.uz

Submission #880848

# Submission time Handle Problem Language Result Execution time Memory
880848 2023-11-30T07:08:48 Z TAhmed33 Selotejp (COCI20_selotejp) C++
70 / 110
 1000 ms 8584 KB 
#include <bits/stdc++.h>
using namespace std;
int n, m;
bool arr[1001][11];
vector <pair <int, int>> q;
inline bool check (int &x, int y) {
	return (x >> y) & 1;
}
void recurse (int pos, int mask, int newmask, int cur, int sum) {
	if (cur == m) {
		q.push_back({sum, newmask});
		return;
	}
	if (arr[pos][cur] == 0) {
		recurse(pos, mask, newmask, cur + 1, sum);
		return;
	}
	if (check(mask, cur)) {
		recurse(pos, mask, newmask + (1 << cur), cur + 1, sum);
	} else {
		recurse(pos, mask, newmask + (1 << cur), cur + 1, sum + 1);
	}	
	bool c = (cur != 0 && arr[pos][cur - 1] == 1 && check(newmask, cur - 1) == 0);
	recurse(pos, mask, newmask, cur + 1, sum + (c ^ 1));
}
string get2 (int x);
int dp[1001][1 << 10];
int ans (int pos, int mask) {
	if (pos == 0) return 0;
	int &ret = dp[pos][mask];
	if (ret != -1) return ret;
	recurse(pos, mask, 0, 0, 0);
	int mn = 1e9;
	vector <pair <int, int>> t = q; q.clear();
	for (auto i : t) mn = min(mn, i.first + ans(pos - 1, i.second));
	return ret = mn;
}
string get2 (int x) {	
	string s;
	for (int i = 0; i < m; i++) s += (char)(check(x, i) + '0');
	return s;
}
int main () {
	memset(dp, -1, sizeof(dp));
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j < m; j++) {
			char x; cin >> x; arr[i][j] = x == '#';
		}
	}
	cout << ans(n, 0);
}

Subtask #1
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 6 ms 4444 KB Output is correct
3 Correct 4 ms 4444 KB Output is correct
4 Correct 5 ms 4444 KB Output is correct
5 Correct 8 ms 4700 KB Output is correct
6 Correct 10 ms 4700 KB Output is correct
7 Correct 9 ms 4720 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 4 ms 4444 KB Output is correct
10 Correct 23 ms 8584 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 7 ms 4444 KB Output is correct
3 Correct 2 ms 4440 KB Output is correct
4 Correct 16 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 5 ms 4460 KB Output is correct
8 Correct 6 ms 4440 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 6 ms 4444 KB Output is correct
3 Correct 4 ms 4444 KB Output is correct
4 Correct 5 ms 4444 KB Output is correct
5 Correct 8 ms 4700 KB Output is correct
6 Correct 10 ms 4700 KB Output is correct
7 Correct 9 ms 4720 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 4 ms 4444 KB Output is correct
10 Correct 23 ms 8584 KB Output is correct
11 Correct 1 ms 4440 KB Output is correct
12 Correct 7 ms 4444 KB Output is correct
13 Correct 2 ms 4440 KB Output is correct
14 Correct 16 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 5 ms 4460 KB Output is correct
18 Correct 6 ms 4440 KB Output is correct
19 Correct 4 ms 4444 KB Output is correct
20 Correct 10 ms 4700 KB Output is correct
21 Correct 21 ms 4744 KB Output is correct
22 Correct 2 ms 4440 KB Output is correct
23 Correct 2 ms 4444 KB Output is correct
24 Correct 3 ms 4444 KB Output is correct
25 Correct 51 ms 4952 KB Output is correct
26 Execution timed out 1056 ms 6740 KB Time limit exceeded
27 Halted 0 ms 0 KB -