結果

問題 No.5013 セクスタプル (open)
ユーザー FplusFplusFFplusFplusF
提出日時 2022-12-29 18:04:56
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 6,282 bytes
コンパイル時間 2,429 ms
実行使用メモリ 6,952 KB
スコア 17,747
最終ジャッジ日時 2022-12-29 18:08:27
合計ジャッジ時間 209,935 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,997 ms
4,904 KB
testcase_01 AC 1,998 ms
4,900 KB
testcase_02 AC 1,998 ms
6,948 KB
testcase_03 AC 1,997 ms
4,900 KB
testcase_04 AC 1,998 ms
4,900 KB
testcase_05 AC 1,997 ms
4,904 KB
testcase_06 AC 1,997 ms
4,904 KB
testcase_07 AC 1,997 ms
6,952 KB
testcase_08 AC 1,998 ms
4,904 KB
testcase_09 AC 1,998 ms
6,952 KB
testcase_10 AC 1,997 ms
6,952 KB
testcase_11 AC 1,998 ms
4,900 KB
testcase_12 AC 1,998 ms
4,904 KB
testcase_13 AC 1,997 ms
6,948 KB
testcase_14 AC 1,998 ms
6,952 KB
testcase_15 AC 1,997 ms
4,904 KB
testcase_16 AC 1,998 ms
4,900 KB
testcase_17 AC 1,998 ms
4,900 KB
testcase_18 AC 1,997 ms
6,952 KB
testcase_19 AC 1,997 ms
4,904 KB
testcase_20 AC 1,996 ms
4,900 KB
testcase_21 AC 1,997 ms
6,952 KB
testcase_22 AC 1,998 ms
4,900 KB
testcase_23 AC 1,998 ms
4,904 KB
testcase_24 AC 1,998 ms
4,908 KB
testcase_25 AC 1,996 ms
6,948 KB
testcase_26 AC 1,998 ms
6,952 KB
testcase_27 AC 1,997 ms
6,952 KB
testcase_28 AC 1,997 ms
4,900 KB
testcase_29 AC 1,998 ms
6,948 KB
testcase_30 AC 1,998 ms
6,952 KB
testcase_31 AC 1,997 ms
4,900 KB
testcase_32 AC 1,997 ms
4,900 KB
testcase_33 AC 1,998 ms
4,904 KB
testcase_34 AC 1,997 ms
4,904 KB
testcase_35 AC 1,997 ms
6,948 KB
testcase_36 AC 1,997 ms
4,908 KB
testcase_37 AC 1,998 ms
4,904 KB
testcase_38 AC 1,998 ms
4,904 KB
testcase_39 AC 1,997 ms
6,952 KB
testcase_40 AC 1,997 ms
6,952 KB
testcase_41 AC 1,998 ms
4,904 KB
testcase_42 AC 1,998 ms
4,904 KB
testcase_43 AC 1,997 ms
4,904 KB
testcase_44 AC 1,996 ms
6,948 KB
testcase_45 AC 1,997 ms
4,908 KB
testcase_46 AC 1,997 ms
4,904 KB
testcase_47 AC 1,997 ms
4,904 KB
testcase_48 AC 1,997 ms
4,904 KB
testcase_49 AC 1,997 ms
6,948 KB
testcase_50 AC 1,998 ms
4,904 KB
testcase_51 AC 1,998 ms
6,948 KB
testcase_52 AC 1,998 ms
4,900 KB
testcase_53 AC 1,997 ms
6,948 KB
testcase_54 AC 1,997 ms
4,900 KB
testcase_55 AC 1,998 ms
4,904 KB
testcase_56 AC 1,998 ms
4,900 KB
testcase_57 AC 1,997 ms
6,948 KB
testcase_58 AC 1,997 ms
4,904 KB
testcase_59 AC 1,997 ms
4,904 KB
testcase_60 AC 1,998 ms
4,900 KB
testcase_61 AC 1,996 ms
4,904 KB
testcase_62 AC 1,997 ms
4,904 KB
testcase_63 AC 1,998 ms
4,904 KB
testcase_64 AC 1,997 ms
6,948 KB
testcase_65 AC 1,998 ms
6,948 KB
testcase_66 AC 1,998 ms
4,904 KB
testcase_67 AC 1,997 ms
4,904 KB
testcase_68 AC 1,996 ms
4,904 KB
testcase_69 TLE -
testcase_70 AC 1,997 ms
4,900 KB
testcase_71 AC 1,998 ms
6,948 KB
testcase_72 AC 1,997 ms
6,952 KB
testcase_73 AC 1,997 ms
4,904 KB
testcase_74 AC 1,997 ms
4,904 KB
testcase_75 AC 1,996 ms
4,904 KB
testcase_76 AC 1,998 ms
6,952 KB
testcase_77 AC 1,998 ms
6,952 KB
testcase_78 AC 1,997 ms
4,900 KB
testcase_79 AC 1,996 ms
4,904 KB
testcase_80 AC 1,998 ms
4,900 KB
testcase_81 AC 1,998 ms
4,900 KB
testcase_82 AC 1,997 ms
4,904 KB
testcase_83 AC 1,998 ms
4,904 KB
testcase_84 AC 1,997 ms
4,900 KB
testcase_85 AC 1,998 ms
4,904 KB
testcase_86 AC 1,997 ms
4,904 KB
testcase_87 AC 1,997 ms
6,948 KB
testcase_88 AC 1,997 ms
4,900 KB
testcase_89 AC 1,997 ms
4,904 KB
testcase_90 AC 1,998 ms
6,952 KB
testcase_91 AC 1,998 ms
6,952 KB
testcase_92 AC 1,998 ms
4,900 KB
testcase_93 AC 1,997 ms
4,904 KB
testcase_94 AC 1,998 ms
4,904 KB
testcase_95 AC 1,998 ms
4,904 KB
testcase_96 AC 1,997 ms
6,948 KB
testcase_97 AC 1,997 ms
4,904 KB
testcase_98 AC 1,997 ms
4,900 KB
testcase_99 AC 1,997 ms
6,948 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
using ll=long long;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll,ll>;
const ll INF=(1ll<<60);
template<class T> void chmin(T &a,T b){
    if(a>b){
        a=b;
    }
}
template<class T> void chmax(T &a,T b){
    if(a<b){
        a=b;
    }
}
int to(int i,int j){
    return i*6+j;
}
pair<int,int> back(int x){
    return {x/6,x%6};
}
int d[36][6];
int cell[36];
int dp[36][6];
int max_cell[36];
int diff(int x){
    int p=back(x).first,q=back(x).second;
    int ret=0;
    rep(k,6){
        int sum=0;
        bool t=true;
        rep(j,6){
            sum+=dp[to(p,j)][k];
            if(dp[to(p,j)][k]==0){
                t=false;
                break;
            }
        }
        if(t) ret+=3+(sum-6);
    }
    rep(k,6){
        int sum=0;
        bool t=true;
        rep(i,6){
            sum+=dp[to(i,q)][k];
            if(dp[to(i,q)][k]==0){
                t=false;
                break;
            }
        }
        if(t) ret+=3+(sum-6);
    }
    return ret;
}
void modify(int x,int y){
    rep(k,6){
        swap(dp[x][k],dp[y][k]);
    }
    swap(cell[x],cell[y]);
}
int main(){
    mt19937 mt;
    vector<vector<pair<int,int>>> cnt(6);
    rep(i,36){
        int x;
        rep(j,6){
            cin >> x;
            x--;
            d[i][x]++;
        }
        rep(j,6){
            cnt[j].emplace_back(d[i][j],i);
        }
    }
    int max_score=0;
    vector<int> per={0,1,2,3,4,5};
    do{
        set<int> selected;
        for(auto &i:per){
            sort(all(cnt[i]));
            reverse(all(cnt[i]));
            int p=0;
            for(auto &[a,b]:cnt[i]){
                if(selected.find(b)!=selected.end()) continue;
                cell[to(i,p)]=b;
                selected.insert(b);
                p++;
                if(6<=p) break;
            }
        }
        rep(i,36){
            rep(k,6){
                dp[i][k]=d[cell[i]][k];
            }
        }
        
        int now_score=0;
        rep(i,6){
            rep(k,6){
                int sum=0;
                bool t=true;
                rep(j,6){
                    sum+=dp[to(i,j)][k];
                    if(dp[to(i,j)][k]==0){
                        t=false;
                        break;
                    }
                }
                if(t) now_score+=3+(sum-6);
            }
        }
        rep(j,6){
            rep(k,6){
                int sum=0;
                bool t=true;
                rep(i,6){
                    sum+=dp[to(i,j)][k];
                    if(dp[to(i,j)][k]==0){
                        t=false;
                        break;
                    }
                }
                if(t) now_score+=3+(sum-6);
            }
        }
        if(max_score<now_score){
            max_score=now_score;
            rep(i,36){
                max_cell[i]=cell[i];
            }
        }
    }while(next_permutation(all(per)));
    int pre_score=max_score;
    rep(i,36){
        cell[i]=max_cell[i];
        rep(i,36){
            rep(k,6){
                dp[i][k]=d[cell[i]][k];
            }
        }
    }
    auto start=chrono::system_clock::now();
    while(true){
        auto now=chrono::system_clock::now();
        double msec=chrono::duration_cast<chrono::milliseconds>(now-start).count();
        if(1990<msec) break;
        int r=mt()%100;
        if(r<10){
            int x=mt()%36,y=mt()%36;
            int a=mt()%36,b=mt()%36;
            if(x==y||a==b) continue;
            int new_score=pre_score;
            new_score-=diff(x);
            new_score-=diff(y);
            modify(x,y);
            new_score+=diff(x);
            new_score+=diff(y);
            new_score-=diff(a);
            new_score-=diff(b);
            modify(a,b);
            new_score+=diff(a);
            new_score+=diff(b);
            double temp=2.2+(1.0-2.2)*msec/1990.0;
            double prob=exp((double)(new_score-pre_score)/temp);
            if(1.0*mt()/mt19937::max()<prob){
                if(max_score<new_score){
                    max_score=new_score;
                    rep(i,36){
                        max_cell[i]=cell[i];
                    }
                }
                pre_score=new_score;
            }else{
                modify(a,b);
                modify(x,y);
            }
        }else if(r<20){
            int x=mt()%36,y=mt()%36,z=mt()%36;
            if(x==y||x==z||y==z) continue;
            int new_score=pre_score;
            new_score-=diff(x);
            new_score-=diff(y);
            new_score-=diff(z);
            modify(x,y);
            modify(y,z);
            new_score+=diff(x);
            new_score+=diff(y);
            new_score-=diff(z);
            double temp=2.0+(1.0-2.2)*msec/1990.0;
            double prob=exp((double)(new_score-pre_score)/temp);
            if(1.0*mt()/mt19937::max()<prob){
                if(max_score<new_score){
                    max_score=new_score;
                    rep(i,36){
                        max_cell[i]=cell[i];
                    }
                }
                pre_score=new_score;
            }else{
                modify(y,z);
                modify(x,y);
            }
        }else{
            int x=mt()%36,y=mt()%36;
            if(x==y) continue;
            int new_score=pre_score;
            new_score-=diff(x);
            new_score-=diff(y);
            modify(x,y);
            new_score+=diff(x);
            new_score+=diff(y);
            double temp=2.2+(1.0-2.2)*msec/1990.0;
            double prob=exp((double)(new_score-pre_score)/temp);
            if(1.0*mt()/mt19937::max()<prob){
                if(max_score<new_score){
                    max_score=new_score;
                    rep(i,36){
                        max_cell[i]=cell[i];
                    }
                }
                pre_score=new_score;
            }else{
                modify(x,y);
            }
        }
        cerr << pre_score << endl;
    }
    vector<pair<int,int>> ans(36);
    rep(i,6){
        rep(j,6){
            ans[max_cell[to(i,j)]]={i,j};
        }
    }
    rep(i,36){
        cout << ans[i].first+1 << " " << ans[i].second+1 << endl;
    }
}
0