oj.uz

Submission #637395

# Submission time Handle Problem Language Result Execution time Memory
637395 2022-09-01T15:54:14 Z IWTIM Selotejp (COCI20_selotejp) C++17
110 / 110
 272 ms 12184 KB 
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python! 
 
// pairs
using pii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
 
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>; 
tcT, size_t SZ> using AR = array<T,SZ>; 
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pii>;
using vpl = V<pl>;
using vpd = V<pd>;
 
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
 
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
const int MOD = 998244353;
const int MX = 2e5+5;
const ll BIG = 1e18; // not too close to LLONG_MAX
const db PI = acos((db)-1);
const int dx[4]{1,0,-1,0}, dy[4]{0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
struct DSU {
	vi e; void init(int N) { e = vi(N,-1); }
	int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); } 
	bool sameSet(int a, int b) { return get(a) == get(b); }
	int size(int x) { return -e[get(x)]; }
	bool unite(int x, int y) { // union by size
		x = get(x), y = get(y); if (x == y) return 0;
		if (e[x] > e[y]) swap(x,y);
		e[x] += e[y]; e[y] = x; return 1;
	}
};
/*
inline namespace Helpers {
	//////////// is_iterable
	// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
	// this gets used only when we can call begin() and end() on that type
	tcT, class = void> struct is_iterable : false_type {};
	tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
	                                  decltype(end(declval<T>()))
	                                 >
	                       > : true_type {};
	tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
 
	//////////// is_readable
	tcT, class = void> struct is_readable : false_type {};
	tcT> struct is_readable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cin >> declval<T&>()), istream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_readable_v = is_readable<T>::value;
 
	//////////// is_printable
	// // https://nafe.es/posts/2020-02-29-is-printable/
	tcT, class = void> struct is_printable : false_type {};
	tcT> struct is_printable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cout << declval<T>()), ostream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_printable_v = is_printable<T>::value;
}*/
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python! 
 
// pairs
using pii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
 
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>; 
tcT, size_t SZ> using AR = array<T,SZ>; 
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pii>;
using vpl = V<pl>;
using vpd = V<pd>;
 
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
 
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
 
/*
inline namespace Helpers {
	//////////// is_iterable
	// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
	// this gets used only when we can call begin() and end() on that type
	tcT, class = void> struct is_iterable : false_type {};
	tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
	                                  decltype(end(declval<T>()))
	                                 >
	                       > : true_type {};
	tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
 
	//////////// is_readable
	tcT, class = void> struct is_readable : false_type {};
	tcT> struct is_readable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cin >> declval<T&>()), istream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_readable_v = is_readable<T>::value;
 
	//////////// is_printable
	// // https://nafe.es/posts/2020-02-29-is-printable/
	tcT, class = void> struct is_printable : false_type {};
	tcT> struct is_printable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cout << declval<T>()), ostream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_printable_v = is_printable<T>::value;
}*/
const int N = 2000, inf = 1e9;
int t,n,m, dp[N][N],a[N][N], dphor[N],toadd[N];
main() {
    std::ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>n>>m;
    for (int i = 1; i <= n; i++) {
    	for (int j = 0; j < m; j++) {
    		char ch;
    		cin>>ch;
    		a[i][j] = (ch == '#');
		}
	}
	for (int i = 0; i <= n; i++) {
		for (int j = 0; j < (1<<m); j++) {
			dp[i][j] = inf;
		}
	}
	dp[0][0] = 0;
	for (int i = 1; i <= n; i++) {
		int all = 0;
		for (int x = 0; x < m; x++) {
			if (a[i][x]) all |= (1<<x);
		}
		for (int mask = 0; mask < (1<<m); mask++) {
			// Using only horizontal chains
			dphor[mask] = 0;
			if ((mask|all) != all) continue;
			for (int x = 0; x < m; x++) {
				if (mask&(1<<x)) {
					if (x == 0) {
						dphor[mask]++; continue;
					}
					if (mask&(1<<(x - 1))) continue;
					else  dphor[mask]++; 
				}
			}
		}
		for (int mask = 0; mask < (1<<m); mask++) toadd[mask] = inf;
		for (int mask = 0; mask < (1<<m); mask++) {
			// at least mask is used in the previous row
			for (int x = mask; x >= 0; x = (x - 1)&mask) {
				toadd[x] = min(toadd[x], dp[i - 1][mask]);
				if (x == 0) break;
			}
		}
		for (int mask = 0; mask < (1<<m); mask++) {
			dp[i][mask] = inf;
			// If a square is covered by a vertical chain ----- > mask[j] == 1
			// else mask[j] = 0;
			if ((mask | all) != all) continue;
			for (int x = mask; x >= 0; x = (x - 1) & mask) {
				dp[i][mask] = min(dp[i][mask], toadd[x] + __builtin_popcount(x ^ mask) + dphor[all ^ mask]);
				if (x == 0) break;
			}
		}
	}
	
	int ans = inf;
	for (int mask = 0; mask < (1<<m); mask++) ans = min(ans, dp[n][mask]);
	cout<<ans<<"\n";
}

Compilation message

Main.cpp:183:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  183 | main() {
      | ^~~~

Subtask #1
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 80 ms 11248 KB Output is correct
3 Correct 14 ms 8608 KB Output is correct
4 Correct 31 ms 10004 KB Output is correct
5 Correct 81 ms 11988 KB Output is correct
6 Correct 84 ms 11988 KB Output is correct
7 Correct 84 ms 11752 KB Output is correct
8 Correct 76 ms 11220 KB Output is correct
9 Correct 78 ms 11316 KB Output is correct
10 Correct 190 ms 12184 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 472 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 80 ms 11248 KB Output is correct
3 Correct 14 ms 8608 KB Output is correct
4 Correct 31 ms 10004 KB Output is correct
5 Correct 81 ms 11988 KB Output is correct
6 Correct 84 ms 11988 KB Output is correct
7 Correct 84 ms 11752 KB Output is correct
8 Correct 76 ms 11220 KB Output is correct
9 Correct 78 ms 11316 KB Output is correct
10 Correct 190 ms 12184 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 472 KB Output is correct
19 Correct 5 ms 8148 KB Output is correct
20 Correct 17 ms 9220 KB Output is correct
21 Correct 33 ms 10196 KB Output is correct
22 Correct 79 ms 11720 KB Output is correct
23 Correct 79 ms 11740 KB Output is correct
24 Correct 78 ms 11664 KB Output is correct
25 Correct 89 ms 11968 KB Output is correct
26 Correct 115 ms 11472 KB Output is correct
27 Correct 188 ms 11488 KB Output is correct
28 Correct 272 ms 11872 KB Output is correct