#645465 (C++17) No.1345 Beautiful BINGO

• 問題: No.1345 Beautiful BINGO
• ユーザー: tanimani364
• 提出日時: 2021-04-08 21:45:50
• 言語: C++17 (gcc 13.2.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 797 ms / 2,000 ms
• コード長: 2,882 bytes
• コンパイル時間: 2,366 ms
• コンパイル使用メモリ: 213,196 KB
• 実行使用メモリ: 4,380 KB
• 最終ジャッジ日時: 2023-09-06 05:31:52
• 合計ジャッジ時間: 19,114 ms
• ジャッジサーバーID （参考情報）: judge12 / judge11

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,376 KB
testcase_01	AC	1 ms; 4,380 KB
testcase_02	AC	2 ms; 4,380 KB
testcase_03	AC	2 ms; 4,380 KB
testcase_04	AC	2 ms; 4,376 KB
testcase_05	AC	2 ms; 4,376 KB
testcase_06	AC	1 ms; 4,380 KB
testcase_07	AC	3 ms; 4,376 KB
testcase_08	AC	1 ms; 4,380 KB
testcase_09	AC	1 ms; 4,376 KB
testcase_10	AC	2 ms; 4,376 KB
testcase_11	AC	2 ms; 4,376 KB
testcase_12	AC	2 ms; 4,380 KB
testcase_13	AC	3 ms; 4,376 KB
testcase_14	AC	2 ms; 4,376 KB
testcase_15	AC	2 ms; 4,380 KB
testcase_16	AC	2 ms; 4,380 KB
testcase_17	AC	2 ms; 4,376 KB
testcase_18	AC	1 ms; 4,376 KB
testcase_19	AC	1 ms; 4,376 KB
testcase_20	AC	2 ms; 4,380 KB
testcase_21	AC	2 ms; 4,380 KB
testcase_22	AC	35 ms; 4,376 KB
testcase_23	AC	797 ms; 4,376 KB
testcase_24	AC	359 ms; 4,380 KB
testcase_25	AC	17 ms; 4,380 KB
testcase_26	AC	162 ms; 4,376 KB
testcase_27	AC	731 ms; 4,376 KB
testcase_28	AC	16 ms; 4,380 KB
testcase_29	AC	161 ms; 4,380 KB
testcase_30	AC	75 ms; 4,376 KB
testcase_31	AC	35 ms; 4,376 KB
testcase_32	AC	5 ms; 4,376 KB
testcase_33	AC	746 ms; 4,380 KB
testcase_34	AC	8 ms; 4,376 KB
testcase_35	AC	8 ms; 4,376 KB
testcase_36	AC	724 ms; 4,376 KB
testcase_37	AC	8 ms; 4,376 KB
testcase_38	AC	164 ms; 4,376 KB
testcase_39	AC	753 ms; 4,376 KB
testcase_40	AC	358 ms; 4,376 KB
testcase_41	AC	333 ms; 4,380 KB
testcase_42	AC	2 ms; 4,380 KB
testcase_43	AC	2 ms; 4,376 KB
testcase_44	AC	2 ms; 4,376 KB
testcase_45	AC	1 ms; 4,380 KB
testcase_46	AC	2 ms; 4,376 KB
testcase_47	AC	1 ms; 4,376 KB
testcase_48	AC	1 ms; 4,380 KB
testcase_49	AC	2 ms; 4,376 KB
testcase_50	AC	2 ms; 4,376 KB
testcase_51	AC	2 ms; 4,376 KB
testcase_52	AC	721 ms; 4,376 KB
testcase_53	AC	748 ms; 4,376 KB
testcase_54	AC	784 ms; 4,380 KB
testcase_55	AC	776 ms; 4,380 KB
testcase_56	AC	714 ms; 4,376 KB
testcase_57	AC	743 ms; 4,380 KB
testcase_58	AC	782 ms; 4,376 KB
testcase_59	AC	740 ms; 4,380 KB
testcase_60	AC	720 ms; 4,380 KB
testcase_61	AC	790 ms; 4,376 KB
testcase_62	AC	710 ms; 4,380 KB

ソースコード

#include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define repl(i, a) for (ll i = (ll)0; i < (ll)a; ++i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define fi first
#define se second
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll mod_998244353 = 998244353;
constexpr ll INF = 1LL << 60;

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

//using lll=boost::multiprecision::cpp_int;
//using Double=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<128>>;//仮数部が1024桁
template <class T>
inline bool chmin(T &a, T b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}

template <typename T>
T mypow(T x, T n, const T &p = -1)
{ //x^nをmodで割った余り

	if (p != -1)
	{
		x =(x%p+p)%p;
	}
	T ret = 1;
	while (n > 0)
	{
		if (n & 1)
		{
			if (p != -1)
				ret = (ret * x) % p;
			else
				ret *= x;
		}
		if (p != -1)
			x = (x * x) % p;
		else
			x *= x;
		n >>= 1;
	}
	return ret;
}

using namespace std;
//using namespace atcoder;

void solve()
{	
	int n,m;
	cin>>n>>m;
	vector<vector<int>>a(n,vector<int>(n));
	rep(i,n){
		rep(j,n){
			cin>>a[i][j];
		}
	}

	int ans=1e9;
	rep(cross,1<<2){
		int ori_res=0;
		int ori_rest=m;
		vector<vector<bool>>ori(n,vector<bool>(n));
		rep(i,2){
			if(cross&1<<i){

				--ori_rest;
				if(!i){
					rep(j,n){
						if(!ori[j][j])ori_res+=a[j][j];
						ori[j][j]=true;
					}
				}else{
					rep(j,n){
						if(!ori[j][n-1-j])ori_res+=a[j][n-1-j];
						ori[j][n-1-j]=true;
					}
				}
			}
		}

		rep(bit,1<<n){
			
			auto used=ori;
			int res=ori_res;
			int rest=ori_rest;
			rep(i,n){
				if(bit&1<<i){
					--rest;
					rep(j,n){
						if(!used[i][j]){
							res+=a[i][j];
							used[i][j]=true;
						}
					}
				}
			}
			if(bit==(1<<n)-1){
				chmin(ans,res);
				continue;
			}

			priority_queue<int,vector<int>,greater<>>pq;
			rep(j,n){
				int sum=0;
				rep(i,n){
					if(!used[i][j])sum+=a[i][j];
				}
				pq.emplace(sum);
			}
		

			while(!pq.empty()){
				if(rest<=0)break;
				int val=pq.top();pq.pop();
				res+=val;
				--rest;
			}
			if(rest<=0){
				chmin(ans,res);
			}
		}
	}
	cout<<ans<<"\n";
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}