結果
問題 | No.1345 Beautiful BINGO |
ユーザー |
![]() |
提出日時 | 2021-01-16 13:17:51 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 553 ms / 2,000 ms |
コード長 | 3,838 bytes |
コンパイル時間 | 2,066 ms |
コンパイル使用メモリ | 148,584 KB |
最終ジャッジ日時 | 2025-01-17 21:51:11 |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 61 |
コンパイルメッセージ
main.cpp: In function ‘void solve()’: main.cpp:123:47: warning: ‘void* __builtin_memset(void*, int, long unsigned int)’ writing between 17 and 2147483647 bytes into a region of size 0 overflows the destination [-Wstringop-overflow=] 123 | rep(y, n)opened[j][y] = true; | ~~~~~~~~~~~~~^~~~~~ main.cpp:114:6: note: at offset 256 into destination object ‘opened’ of size 256 114 | bool opened[16][16]; | ^~~~~~
ソースコード
#pragma GCC optimize("Ofast")//#pragma GCC target ("sse4")#include<iostream>#include<string>#include<cstdio>#include<vector>#include<cmath>#include<algorithm>#include<functional>#include<iomanip>#include<queue>#include<ciso646>#include<random>#include<map>#include<set>#include<bitset>#include<stack>#include<unordered_map>#include<unordered_set>#include<utility>#include<cassert>#include<complex>#include<numeric>#include<array>using namespace std;//#define int long longtypedef long long ll;typedef unsigned long long ul;typedef unsigned int ui;constexpr ll mod = 1000000007;const ll INF = mod * mod;typedef pair<int, int>P;#define stop char nyaa;cin>>nyaa;#define rep(i,n) for(int i=0;i<n;i++)#define per(i,n) for(int i=n-1;i>=0;i--)#define Rep(i,sta,n) for(int i=sta;i<n;i++)#define rep1(i,n) for(int i=1;i<=n;i++)#define per1(i,n) for(int i=n;i>=1;i--)#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)#define all(v) (v).begin(),(v).end()typedef pair<ll, ll> LP;typedef double ld;typedef pair<ld, ld> LDP;const ld eps = 1e-12;const ld pi = acosl(-1.0);ll mod_pow(ll x, ll n, ll m = mod) {if (n < 0) {ll res = mod_pow(x, -n, m);return mod_pow(res, m - 2, m);}if (abs(x) >= m)x %= m;if (x < 0)x += m;ll res = 1;while (n) {if (n & 1)res = res * x % m;x = x * x % m; n >>= 1;}return res;}struct modint {ll n;modint() :n(0) { ; }modint(ll m) :n(m) {if (n >= mod)n %= mod;else if (n < 0)n = (n % mod + mod) % mod;}operator int() { return n; }};bool operator==(modint a, modint b) { return a.n == b.n; }modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }modint operator+(modint a, modint b) { return a += b; }modint operator-(modint a, modint b) { return a -= b; }modint operator*(modint a, modint b) { return a *= b; }modint operator^(modint a, ll n) {if (n == 0)return modint(1);modint res = (a * a) ^ (n / 2);if (n % 2)res = res * a;return res;}ll inv(ll a, ll p) {return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);}modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }modint operator/=(modint& a, modint b) { a = a / b; return a; }const int max_n = 1 << 18;modint fact[max_n], factinv[max_n];void init_f() {fact[0] = modint(1);for (int i = 0; i < max_n - 1; i++) {fact[i + 1] = fact[i] * modint(i + 1);}factinv[max_n - 1] = modint(1) / fact[max_n - 1];for (int i = max_n - 2; i >= 0; i--) {factinv[i] = factinv[i + 1] * modint(i + 1);}}modint comb(int a, int b) {if (a < 0 || b < 0 || a < b)return 0;return fact[a] * factinv[b] * factinv[a - b];}modint combP(int a, int b) {if (a < 0 || b < 0 || a < b)return 0;return fact[a] * factinv[a - b];}ll a[16][16];bool opened[16][16];void solve() {int n, m; cin >> n >> m;rep(i, n)rep(j, n)cin >> a[i][j];ll ans = INF;rep(i, (1 << n + 2)) {int rest = m;rep(x, n)rep(y, n)opened[x][y] = false;rep(j, n)if (i & (1 << j)) {rep(y, n)opened[j][y] = true;rest--;}if (i & (1 << n)) {rest--;rep(x, n)opened[x][x] = true;}if (i & (1 << n + 1)) {rest--;rep(x, n)opened[x][n - 1 - x] = true;}ll sum = 0;rep(x, n)rep(y, n)if (opened[x][y])sum += a[x][y];vector<ll> ads;rep(y, n) {ll csum = 0;rep(x, n)if (!opened[x][y])csum += a[x][y];ads.push_back(csum);}sort(all(ads));rep(j, rest)sum += ads[j];ans = min(ans, sum);}cout << ans << "\n";}signed main() {ios::sync_with_stdio(false);cin.tie(0);//cout << fixed << setprecision(15);//init_f();//init();//expr();//int t; cin >> t; rep(i,t)solve();return 0;}