結果

問題 No.1345 Beautiful BINGO
ユーザー rniyarniya
提出日時 2021-01-16 13:45:07
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 562 ms / 2,000 ms
コード長 4,667 bytes
コンパイル時間 2,465 ms
コンパイル使用メモリ 211,460 KB
実行使用メモリ 4,384 KB
最終ジャッジ日時 2023-08-18 23:59:17
合計ジャッジ時間 15,202 ms
ジャッジサーバーID
（参考情報） 		judge10 / judge9
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 2 ms
4,384 KB
testcase_03 AC 1 ms
4,384 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 2 ms
4,380 KB
testcase_06 AC 2 ms
4,384 KB
testcase_07 AC 3 ms
4,384 KB
testcase_08 AC 2 ms
4,380 KB
testcase_09 AC 1 ms
4,384 KB
testcase_10 AC 2 ms
4,380 KB
testcase_11 AC 1 ms
4,384 KB
testcase_12 AC 2 ms
4,384 KB
testcase_13 AC 2 ms
4,380 KB
testcase_14 AC 1 ms
4,380 KB
testcase_15 AC 2 ms
4,380 KB
testcase_16 AC 2 ms
4,380 KB
testcase_17 AC 2 ms
4,380 KB
testcase_18 AC 2 ms
4,380 KB
testcase_19 AC 1 ms
4,380 KB
testcase_20 AC 2 ms
4,380 KB
testcase_21 AC 2 ms
4,380 KB
testcase_22 AC 25 ms
4,380 KB
testcase_23 AC 561 ms
4,384 KB
testcase_24 AC 257 ms
4,384 KB
testcase_25 AC 12 ms
4,380 KB
testcase_26 AC 116 ms
4,384 KB
testcase_27 AC 559 ms
4,380 KB
testcase_28 AC 12 ms
4,380 KB
testcase_29 AC 115 ms
4,380 KB
testcase_30 AC 53 ms
4,384 KB
testcase_31 AC 24 ms
4,384 KB
testcase_32 AC 4 ms
4,380 KB
testcase_33 AC 557 ms
4,380 KB
testcase_34 AC 6 ms
4,380 KB
testcase_35 AC 6 ms
4,380 KB
testcase_36 AC 562 ms
4,384 KB
testcase_37 AC 6 ms
4,384 KB
testcase_38 AC 117 ms
4,380 KB
testcase_39 AC 560 ms
4,380 KB
testcase_40 AC 260 ms
4,384 KB
testcase_41 AC 258 ms
4,384 KB
testcase_42 AC 2 ms
4,380 KB
testcase_43 AC 1 ms
4,380 KB
testcase_44 AC 2 ms
4,380 KB
testcase_45 AC 1 ms
4,380 KB
testcase_46 AC 2 ms
4,380 KB
testcase_47 AC 1 ms
4,380 KB
testcase_48 AC 1 ms
4,380 KB
testcase_49 AC 2 ms
4,384 KB
testcase_50 AC 2 ms
4,380 KB
testcase_51 AC 1 ms
4,380 KB
testcase_52 AC 556 ms
4,384 KB
testcase_53 AC 555 ms
4,380 KB
testcase_54 AC 558 ms
4,380 KB
testcase_55 AC 550 ms
4,380 KB
testcase_56 AC 553 ms
4,380 KB
testcase_57 AC 559 ms
4,380 KB
testcase_58 AC 560 ms
4,384 KB
testcase_59 AC 557 ms
4,380 KB
testcase_60 AC 558 ms
4,380 KB
testcase_61 AC 559 ms
4,380 KB
testcase_62 AC 562 ms
4,384 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
const long long MOD=1000000007;
// const long long MOD=998244353;
#define LOCAL
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(),(x).end()
const int INF=1e9;
const long long IINF=1e18;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
const char dir[4]={'D','R','U','L'};

template<typename T>
istream &operator>>(istream &is,vector<T> &v){
    for (T &x:v) is >> x;
    return is;
}
template<typename T>
ostream &operator<<(ostream &os,const vector<T> &v){
    for (int i=0;i<v.size();++i){
        os << v[i] << (i+1==v.size()?"": " ");
    }
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const pair<T,U> &p){
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template<typename T,typename U,typename V>
ostream&operator<<(ostream &os,const tuple<T,U,V> &t){
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template<typename T,typename U,typename V,typename W>
ostream&operator<<(ostream &os,const tuple<T,U,V,W> &t){
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const map<T,U> &m){
    os << '{';
    for (auto itr=m.begin();itr!=m.end();){
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr!=m.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const unordered_map<T,U> &m){
    os << '{';
    for (auto itr=m.begin();itr!=m.end();){
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr!=m.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const set<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();){
        os << *itr;
        if (++itr!=s.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const multiset<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();){
        os << *itr;
        if (++itr!=s.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const unordered_set<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();){
        os << *itr;
        if (++itr!=s.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const deque<T> &v){
    for (int i=0;i<v.size();++i){
        os << v[i] << (i+1==v.size()?"": " ");
    }
    return os;
}

void debug_out(){cerr << '\n';}
template<class Head,class... Tail>
void debug_out(Head&& head,Tail&&... tail){
    cerr << head;
    if (sizeof...(Tail)>0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...) cerr << " ";\
cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\
cerr << " ";\
debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;}
template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;}

template<class T1,class T2> inline bool chmin(T1 &a,T2 b){
    if (a>b){a=b; return true;} return false;
}
template<class T1,class T2> inline bool chmax(T1 &a,T2 b){
    if (a<b){a=b; return true;} return false;
}
#pragma endregion

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N,M; cin >> N >> M;
    vector<vector<int>> A(N,vector<int>(N)); cin >> A;

    int ans=INF;
    for (int mask=0;mask<(1<<N);++mask){
        for (int diag=0;diag<(1<<2);++diag){
            vector<vector<bool>> ok(N,vector<bool>(N,false));
            int cnt=0;
            for (int i=0;i<N;++i){
                if (mask&1<<i){
                    ++cnt;
                    for (int j=0;j<N;++j) ok[i][j]=true;
                }
            }
            if (diag&1){
                ++cnt;
                for (int j=0;j<N;++j) ok[j][j]=true;
            }
            if (diag&2){
                ++cnt;
                for (int j=0;j<N;++j) ok[N-1-j][j]=true;
            }
            int cur=0;
            vector<int> need(N,0);
            for (int j=0;j<N;++j){
                for (int i=0;i<N;++i){
                    if (!ok[i][j]){
                        need[j]+=A[i][j];
                    } else cur+=A[i][j];
                }
            }
            sort(ALL(need));
            for (int i=0;i<M-cnt;++i) cur+=need[i];
            chmin(ans,cur);
        }
    }

    cout << ans << '\n';
}
0