oj.uz

답안 #884240

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
884240 2023-12-06T22:17:22 Z Ahmed_Solyman Selotejp (COCI20_selotejp) C++14
110 / 110
 180 ms 81496 KB 
/*
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.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 80476 KB Output is correct
2 Correct 13 ms 81240 KB Output is correct
3 Correct 13 ms 81244 KB Output is correct
4 Correct 13 ms 81240 KB Output is correct
5 Correct 14 ms 81244 KB Output is correct
6 Correct 15 ms 81244 KB Output is correct
7 Correct 16 ms 81240 KB Output is correct
8 Correct 13 ms 81244 KB Output is correct
9 Correct 13 ms 81240 KB Output is correct
10 Correct 37 ms 81496 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 80476 KB Output is correct
2 Correct 10 ms 80476 KB Output is correct
3 Correct 10 ms 80596 KB Output is correct
4 Correct 11 ms 80548 KB Output is correct
5 Correct 10 ms 80476 KB Output is correct
6 Correct 10 ms 80476 KB Output is correct
7 Correct 10 ms 80412 KB Output is correct
8 Correct 12 ms 80476 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 80476 KB Output is correct
2 Correct 13 ms 81240 KB Output is correct
3 Correct 13 ms 81244 KB Output is correct
4 Correct 13 ms 81240 KB Output is correct
5 Correct 14 ms 81244 KB Output is correct
6 Correct 15 ms 81244 KB Output is correct
7 Correct 16 ms 81240 KB Output is correct
8 Correct 13 ms 81244 KB Output is correct
9 Correct 13 ms 81240 KB Output is correct
10 Correct 37 ms 81496 KB Output is correct
11 Correct 10 ms 80476 KB Output is correct
12 Correct 10 ms 80476 KB Output is correct
13 Correct 10 ms 80596 KB Output is correct
14 Correct 11 ms 80548 KB Output is correct
15 Correct 10 ms 80476 KB Output is correct
16 Correct 10 ms 80476 KB Output is correct
17 Correct 10 ms 80412 KB Output is correct
18 Correct 12 ms 80476 KB Output is correct
19 Correct 12 ms 80988 KB Output is correct
20 Correct 15 ms 81240 KB Output is correct
21 Correct 19 ms 81244 KB Output is correct
22 Correct 11 ms 81244 KB Output is correct
23 Correct 11 ms 81244 KB Output is correct
24 Correct 13 ms 81404 KB Output is correct
25 Correct 24 ms 81240 KB Output is correct
26 Correct 55 ms 81440 KB Output is correct
27 Correct 116 ms 81444 KB Output is correct
28 Correct 180 ms 81240 KB Output is correct