Submission #434046

---

Source Code Expand

#include<iostream>
#include <algorithm>
#include <cstdio>
#include<math.h>
#include<iomanip>
#include<map>
#include<set>
#include<deque>
#include<vector>
#include<stack>
#include<queue>
using namespace std;
#define ll long long
#define lli ll int
#define vi vector<int>
#define vvi vector<vector<int>>
#define vs vector<string>
#define fr(i,k,N) for(int i=k;i<N;i++)
#define rep(i,N) for(int i=0;i<N;i++)
template <class X> void pr(X test){cout<<test<<endl;}
template <class X> void prr(X test){for(auto it:test){cout<<it;}cout<<endl;}
lli combination(int n,int r){ lli temp=1; r=min(r,n-r); fr(i,1, r+1) temp=temp*(n-r+i)/i; return temp;}

int b[5][5];
int sum=0;

vector<pair<int, int>> ii;

vi fun(vi ss,vi sss){
    if (ss.size()==0) {
        
        
        for(auto it=ii.begin();it!=ii.end();it++){
            
            b[(*it).first][(*it).second]=*sss.begin();
            sss.erase(sss.begin());
        }
        
        int iii=0;
        rep(i, 3)rep(j, 5){
            if((b[i][j]-b[i+1][j])*(b[i+1][j]-b[i+2][j])>0)iii=1,i=10,j=10;
        }
        
        if(iii==0)rep(i, 5)rep(j, 3){
            if((b[i][j]-b[i][j+1])*(b[i][j+1]-b[i][j+2])>0)iii=1,i=10,j=10;
        }
        if(iii==0) sum++;
        
        
        for(auto it=ii.begin();it!=ii.end();it++){
            
            int t1,t2,v1;
            t1=(*it).first;
            t2=(*it).second;
            
            b[t1][t2]=0;
            
        }
        
        
        vi a;
        return  a;
    }else {
        for(auto it = ss.begin();it!=ss.end();it++){
            vi aaa;
            auto temp=*it;
            aaa.push_back(temp);
            ss.erase(it);
            vi g;
            vi ttemp=sss;
            for(auto iit:aaa)ttemp.push_back(iit);
            fun(ss,ttemp);
            ss.insert(it, temp);
        }
    }
    vi noo;
    return noo;
}

int main(){
    vi vv;
    rep(i, 25)vv.push_back(i+1);
    rep(i, 5)rep(j, 5) {
        cin>>b[i][j];
        
        if(b[i][j]==0){
            ii.push_back(make_pair(i, j));
        }else{
            auto it=find(vv.begin(), vv.end(), b[i][j]);
            vv.erase(it);
        }
    }
    //kansu(vv,ii);
    
    vi ss;
    ss=vv;
    vi aaa;
    fun(ss,aaa);
    
    pr(sum);
    return 0;
}

Submission Info

Judge Result