oj.uz

답안 #100541

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
100541 2019-03-12T06:54:27 Z TAISA_ Solitaire (JOI16_solitaire) C++14
10 / 100
 32 ms 1024 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define all(vec) vec.begin(),vec.end()
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
const ll INF=1LL<<30;
const ll LINF=1LL<<60;
const double eps=1e-9;
const ll MOD=1000000007LL;
template<typename T>void chmin(T &a,T b){a=min(a,b);};
template<typename T>void chmax(T &a,T b){a=max(a,b);};
template<typename T>vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}
template<typename T,typename V>typename enable_if<is_class<T>::value==0>::type fill_v(T& t,const V& v){t=v;}
template<typename T,typename V>typename enable_if<is_class<T>::value!=0>::type fill_v(T& t,const V& v){for(auto &e:t)fill_v(e,v);};
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int main(){
    int n;cin>>n;
    vector<string> s(3);
    ll co=0;
    vector<P> v;
    for(int i=0;i<3;i++){
        cin>>s[i];
        for(int j=0;j<n;j++){
            if(s[i][j]=='x'){
                v.push_back(P(i,j));
                co++;
            }
        }
    }
    if(co<=16){
        vector<ll> dp((1<<co)+10);
        dp[0]=1;
        for(int i=0;i<(1<<co);i++){
            for(int j=0;j<co;j++){
                if((i>>j)&1)continue;
                int y=v[j].first,x=v[j].second;
                bool f=false;
                if(x>0&&x<n-1){
                    bool f1=false,f2=false;
                    for(int k=0;k<co;k++){
                        if(v[k].first==y&&v[k].second==x-1){
                            if((i>>k)&1)f1=true;
                        }
                        if(v[k].first==y&&v[k].second==x+1){
                            if((i>>k)&1)f2=true;
                        }
                    }
                    if(s[y][x-1]=='o'||f1){
                        if(s[y][x+1]=='o'||f2){
                            f=true;
                        }
                    }
                }
                if(y==1){
                    bool f1=false,f2=false;
                    for(int k=0;k<co;k++){
                        if(v[k].second==x&&((i>>k)&1)){
                            if(v[k].first==y-1){
                                f1=true;
                            }
                            if(v[k].first==y+1){
                                f2=true;
                            }
                        }
                    }
                    if(s[y-1][x]=='o'||f1){
                        if(s[y+1][x]=='o'||f2){
                            f=true;
                        }
                    }
                }
                if(f){
                    dp[i|(1<<j)]+=dp[i];
                    dp[i|(1<<j)]%=MOD;
                }
            }
        }
        cout<<dp[(1<<co)-1]<<endl;
    }else{
        vector<ll> f(3*n+10);
        f[0]=1;
        for(ll i=1;i<=3*n;i++){
            f[i]=f[i-1]*i;
            f[i]%=MOD;
        }
        cout<<f[co]<<endl;
    }
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 11 ms 640 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 32 ms 888 KB Output is correct
5 Correct 25 ms 1024 KB Output is correct
6 Correct 26 ms 896 KB Output is correct
7 Correct 22 ms 896 KB Output is correct
8 Correct 23 ms 896 KB Output is correct
9 Correct 22 ms 896 KB Output is correct
10 Correct 26 ms 888 KB Output is correct
11 Correct 23 ms 888 KB Output is correct
12 Correct 22 ms 924 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 11 ms 640 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 32 ms 888 KB Output is correct
5 Correct 25 ms 1024 KB Output is correct
6 Correct 26 ms 896 KB Output is correct
7 Correct 22 ms 896 KB Output is correct
8 Correct 23 ms 896 KB Output is correct
9 Correct 22 ms 896 KB Output is correct
10 Correct 26 ms 888 KB Output is correct
11 Correct 23 ms 888 KB Output is correct
12 Correct 22 ms 924 KB Output is correct
13 Incorrect 2 ms 384 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 11 ms 640 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 32 ms 888 KB Output is correct
5 Correct 25 ms 1024 KB Output is correct
6 Correct 26 ms 896 KB Output is correct
7 Correct 22 ms 896 KB Output is correct
8 Correct 23 ms 896 KB Output is correct
9 Correct 22 ms 896 KB Output is correct
10 Correct 26 ms 888 KB Output is correct
11 Correct 23 ms 888 KB Output is correct
12 Correct 22 ms 924 KB Output is correct
13 Incorrect 3 ms 384 KB Output isn't correct
14 Halted 0 ms 0 KB -