Submission #884240

#	Time	Username	Problem	Language	Result	Execution time	Memory
884240		Ahmed_Solyman	Selotejp (COCI20_selotejp)	C++14	110 / 110	180 ms	81496 KiB

Main

/*
In the name of Allah
made by: Ahmed_Solyman
*/
#include <bits/stdc++.h>
#include <ext/rope>
 
using namespace std;
using namespace __gnu_cxx;
#pragma GCC optimize("-Ofast")
#pragma GCC optimize("-O1")
//-------------------------------------------------------------//
typedef long long ll;
typedef unsigned long long ull;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define PI acos(-1)
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define sum_to(n) (n*(n+1))/2
#define pb push_back
#define pf push_front
#define fil(arr,x) memset(arr,x,sizeof(arr))
const ll mod=1e9+7;
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,1,-1,-1,1};
//-------------------------------------------------------------//
ll lcm(ll a,ll b)
{
    return (max(a,b)/__gcd(a,b))*min(a,b);
}
void person_bool(bool x)
{
    cout<<(x?"YES":"NO")<<endl;
}
const int N=1000,M=10;
int dp[N][M][1<<M][2];
vector<string>arr(N);
int n,m;
int solve(int i,int j,int mask,bool b){
    if(i==n)return 0;
    if(j==m)return solve(i+1,0,mask,0);
    int &ret=dp[i][j][mask][b];
    if(~ret)return ret;
    if(arr[i][j]=='.')return ret=solve(i,j+1,mask-((1<<j)&mask),0);
    ret=min(solve(i,j+1,mask-((1<<j)&mask),1),solve(i,j+1,mask|(1<<j),0))+1;
    if(mask&(1<<j))ret=min(ret,solve(i,j+1,mask,0));
    if(b)ret=min(ret,solve(i,j+1,mask-((1<<j)&mask),1));
    return ret;
}
int main()
{
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    #ifndef ONLINE_JUDGE
    //freopen("input.in", "r", stdin);
    //freopen("output.out", "w", stdout);
    #endif
    fast
    cin>>n>>m;
    for(int i=0;i<n;i++){
        cin>>arr[i];
    }
    fil(dp,-1);
    cout<<solve(0,0,0,0)<<endl;
    return 0;
}

• Subtask 1: 35 / 35
• Subtask 2: 35 / 35
• Subtask 3: 40 / 40