oj.uz

답안 #376279

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
376279 2021-03-11T07:07:33 Z errorgorn Selotejp (COCI20_selotejp) C++17
110 / 110
 209 ms 81772 KB 
//雪花飄飄北風嘯嘯
//天地一片蒼茫

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl

#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define up upper_bound

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

int n,m;
string grid[1005];

int memo[1005][10][1024][2];

int dp(int p1,int p2,int mask,int prev){
	if (p2==m) return dp(p1+1,0,mask,0);
	if (p1==n) return 0;
	if (memo[p1][p2][mask][prev]!=-1) return memo[p1][p2][mask][prev];
	
	int ans;
	
	if (grid[p1][p2]=='.'){
		if (mask&(1<<p2)) mask^=(1<<p2); //remove hori line
		ans=dp(p1,p2+1,mask,0); //also no vert line
	}
	else{
		if (prev==1 && mask&(1<<p2)){
			ans=min(dp(p1,p2+1,mask^(1<<p2),prev),
					dp(p1,p2+1,mask,0));
		}
		else if (prev==1 || mask&(1<<p2)){
			ans=dp(p1,p2+1,mask,prev);
		}
		else{
			ans=min(dp(p1,p2+1,mask|(1<<p2),0)+1,
					dp(p1,p2+1,mask,1)+1);
		}
	}
	
	return memo[p1][p2][mask][prev]=ans;
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	
	cin>>n>>m;
	rep(x,0,n) cin>>grid[x];
	
	memset(memo,-1,sizeof(memo));
	cout<<dp(0,0,0,0)<<endl;
}

Subtask #1
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 80876 KB Output is correct
2 Correct 47 ms 81644 KB Output is correct
3 Correct 48 ms 81516 KB Output is correct
4 Correct 49 ms 81644 KB Output is correct
5 Correct 49 ms 81644 KB Output is correct
6 Correct 51 ms 81644 KB Output is correct
7 Correct 51 ms 81644 KB Output is correct
8 Correct 47 ms 81644 KB Output is correct
9 Correct 48 ms 81644 KB Output is correct
10 Correct 48 ms 81772 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 80876 KB Output is correct
2 Correct 45 ms 80876 KB Output is correct
3 Correct 46 ms 81004 KB Output is correct
4 Correct 45 ms 80876 KB Output is correct
5 Correct 46 ms 80876 KB Output is correct
6 Correct 46 ms 80876 KB Output is correct
7 Correct 45 ms 80876 KB Output is correct
8 Correct 45 ms 80876 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 80876 KB Output is correct
2 Correct 47 ms 81644 KB Output is correct
3 Correct 48 ms 81516 KB Output is correct
4 Correct 49 ms 81644 KB Output is correct
5 Correct 49 ms 81644 KB Output is correct
6 Correct 51 ms 81644 KB Output is correct
7 Correct 51 ms 81644 KB Output is correct
8 Correct 47 ms 81644 KB Output is correct
9 Correct 48 ms 81644 KB Output is correct
10 Correct 48 ms 81772 KB Output is correct
11 Correct 46 ms 80876 KB Output is correct
12 Correct 45 ms 80876 KB Output is correct
13 Correct 46 ms 81004 KB Output is correct
14 Correct 45 ms 80876 KB Output is correct
15 Correct 46 ms 80876 KB Output is correct
16 Correct 46 ms 80876 KB Output is correct
17 Correct 45 ms 80876 KB Output is correct
18 Correct 45 ms 80876 KB Output is correct
19 Correct 47 ms 81260 KB Output is correct
20 Correct 49 ms 81516 KB Output is correct
21 Correct 50 ms 81644 KB Output is correct
22 Correct 48 ms 81644 KB Output is correct
23 Correct 46 ms 81644 KB Output is correct
24 Correct 50 ms 81772 KB Output is correct
25 Correct 55 ms 81644 KB Output is correct
26 Correct 74 ms 81644 KB Output is correct
27 Correct 123 ms 81664 KB Output is correct
28 Correct 209 ms 81648 KB Output is correct