Submission #880862

#	Time	Username	Problem	Language	Result	Execution time	Memory
880862		TAhmed33	Selotejp (COCI20_selotejp)	C++98	70 / 110	1034 ms	5460 KiB

Main

#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 / 35
• Subtask 2: 35 / 35
• Subtask 3: 0 / 40