oj.uz

Submission #880862

# Submission time Handle Problem Language Result Execution time Memory
880862 2023-11-30T07:24:48 Z TAhmed33 Selotejp (COCI20_selotejp) C++
70 / 110
 1000 ms 5460 KB 
#include <bits/stdc++.h>
using namespace std;
int n, m;
bool arr[1001][11];
inline bool check (int &x, int y) {
	return (x >> y) & 1;
}
int ans (int pos, int mask);
int recurse (int pos, int mask, int newmask, int cur) {
	if (cur == m) {
		return ans(pos - 1, newmask);
	}
    int mn = 1e9;
	if (arr[pos][cur] == 0) {
		mn = min(mn, recurse(pos, mask, newmask, cur + 1));
	} else {
    	if (check(mask, cur)) {
    		mn = min(mn, recurse(pos, mask, newmask + (1 << cur), cur + 1));
    	} else {
    		mn = min(mn, 1 + recurse(pos, mask, newmask + (1 << cur), cur + 1));
    	}	
    	bool c = (cur != 0 && arr[pos][cur - 1] == 1 && check(newmask, cur - 1) == 0);
    	mn = min(mn, (c ^ 1) + recurse(pos, mask, newmask, cur + 1));
    }
    return mn;
}
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;
	return ret = recurse(pos, mask, 0, 0);
}
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 2 ms 4444 KB Output is correct
2 Correct 5 ms 5212 KB Output is correct
3 Correct 4 ms 4956 KB Output is correct
4 Correct 5 ms 5212 KB Output is correct
5 Correct 8 ms 5208 KB Output is correct
6 Correct 9 ms 5212 KB Output is correct
7 Correct 8 ms 5212 KB Output is correct
8 Correct 3 ms 5212 KB Output is correct
9 Correct 4 ms 5208 KB Output is correct
10 Correct 22 ms 5212 KB Output is correct

Subtask #2
35.0 / 35.0

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

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 5 ms 5212 KB Output is correct
3 Correct 4 ms 4956 KB Output is correct
4 Correct 5 ms 5212 KB Output is correct
5 Correct 8 ms 5208 KB Output is correct
6 Correct 9 ms 5212 KB Output is correct
7 Correct 8 ms 5212 KB Output is correct
8 Correct 3 ms 5212 KB Output is correct
9 Correct 4 ms 5208 KB Output is correct
10 Correct 22 ms 5212 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 5 ms 4444 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 10 ms 4440 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 2 ms 4440 KB Output is correct
17 Correct 3 ms 4444 KB Output is correct
18 Correct 4 ms 4444 KB Output is correct
19 Correct 3 ms 4700 KB Output is correct
20 Correct 9 ms 4956 KB Output is correct
21 Correct 16 ms 5212 KB Output is correct
22 Correct 2 ms 5212 KB Output is correct
23 Correct 2 ms 5060 KB Output is correct
24 Correct 4 ms 5208 KB Output is correct
25 Correct 37 ms 5132 KB Output is correct
26 Correct 625 ms 5460 KB Output is correct
27 Execution timed out 1034 ms 5212 KB Time limit exceeded
28 Halted 0 ms 0 KB -