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

提出ソース

結果

問題	No.1345 Beautiful BINGO
ユーザー	haruki_K
提出日時	2021-01-16 13:23:23
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	490 ms / 2,000 ms
コード長	5,701 bytes
コンパイル時間	2,160 ms
コンパイル使用メモリ	211,084 KB
実行使用メモリ	4,384 KB
最終ジャッジ日時	2023-08-18 23:55:30
合計ジャッジ時間	11,400 ms
ジャッジサーバーID （参考情報）	judge11 / judge12

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 4,376 KB
testcase_01	AC	2 ms 4,384 KB
testcase_02	AC	1 ms 4,380 KB
testcase_03	AC	1 ms 4,380 KB
testcase_04	AC	1 ms 4,376 KB
testcase_05	AC	2 ms 4,380 KB
testcase_06	AC	1 ms 4,376 KB
testcase_07	AC	2 ms 4,376 KB
testcase_08	AC	2 ms 4,376 KB
testcase_09	AC	1 ms 4,376 KB
testcase_10	AC	2 ms 4,376 KB
testcase_11	AC	1 ms 4,380 KB
testcase_12	AC	2 ms 4,380 KB
testcase_13	AC	2 ms 4,376 KB
testcase_14	AC	2 ms 4,380 KB
testcase_15	AC	1 ms 4,380 KB
testcase_16	AC	2 ms 4,380 KB
testcase_17	AC	1 ms 4,376 KB
testcase_18	AC	1 ms 4,376 KB
testcase_19	AC	1 ms 4,380 KB
testcase_20	AC	1 ms 4,376 KB
testcase_21	AC	1 ms 4,380 KB
testcase_22	AC	21 ms 4,376 KB
testcase_23	AC	474 ms 4,380 KB
testcase_24	AC	217 ms 4,376 KB
testcase_25	AC	10 ms 4,380 KB
testcase_26	AC	104 ms 4,376 KB
testcase_27	AC	463 ms 4,376 KB
testcase_28	AC	11 ms 4,380 KB
testcase_29	AC	103 ms 4,380 KB
testcase_30	AC	45 ms 4,380 KB
testcase_31	AC	22 ms 4,376 KB
testcase_32	AC	3 ms 4,380 KB
testcase_33	AC	481 ms 4,376 KB
testcase_34	AC	5 ms 4,380 KB
testcase_35	AC	5 ms 4,376 KB
testcase_36	AC	260 ms 4,376 KB
testcase_37	AC	3 ms 4,376 KB
testcase_38	AC	102 ms 4,376 KB
testcase_39	AC	490 ms 4,376 KB
testcase_40	AC	218 ms 4,380 KB
testcase_41	AC	138 ms 4,380 KB
testcase_42	AC	1 ms 4,376 KB
testcase_43	AC	2 ms 4,380 KB
testcase_44	AC	2 ms 4,380 KB
testcase_45	AC	2 ms 4,380 KB
testcase_46	AC	2 ms 4,376 KB
testcase_47	AC	1 ms 4,380 KB
testcase_48	AC	1 ms 4,380 KB
testcase_49	AC	1 ms 4,376 KB
testcase_50	AC	1 ms 4,376 KB
testcase_51	AC	1 ms 4,376 KB
testcase_52	AC	237 ms 4,380 KB
testcase_53	AC	487 ms 4,380 KB
testcase_54	AC	489 ms 4,380 KB
testcase_55	AC	478 ms 4,380 KB
testcase_56	AC	234 ms 4,376 KB
testcase_57	AC	445 ms 4,384 KB
testcase_58	AC	472 ms 4,376 KB
testcase_59	AC	458 ms 4,376 KB
testcase_60	AC	287 ms 4,376 KB
testcase_61	AC	477 ms 4,376 KB
testcase_62	AC	228 ms 4,380 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define rng(x,l,r) begin(x) + (l), begin(x) + (r)
#define pb push_back
#define eb emplace_back
#define fst first
#define snd second
template <class A, class B> auto mp(A &&a, B &&b) { return make_pair(forward<A>(a), forward<B>(b)); }
template <class... T> auto mt(T&&... x) { return make_tuple(forward<T>(x)...); }
template <class Int> auto constexpr inf = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf<int32_t>;
auto constexpr INF64 = inf<int64_t>;
auto constexpr INF   = inf<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> {
    vector<T> &data() { return this->c; }
    void clear() { this->c.clear(); }
};
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T, S> const& p) { return os << p.first << " " << p.second; }
template <class T, class S> istream& operator>>(istream& is, pair<T, S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } };
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
const int dx[] = { 1,0,-1,0,1,-1,-1,1 };
const int dy[] = { 0,1,0,-1,1,1,-1,-1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
// [a,b]
template <class Int> Int rand(Int a, Int b) { static mt19937_64 mt{random_device{}()}; return uniform_int_distribution<Int>(a,b)(mt); }
i64 irand(i64 a, i64 b) { return rand<i64>(a,b); }
u64 urand(u64 a, u64 b) { return rand<u64>(a,b); }
template <class It> void shuffle(It l, It r) { shuffle(l, r, mt19937_64(random_device{}())); }
// <<<

int32_t main() {
    int n, m; cin >> n >> m;
    auto a = make_v<int, 2>(n, n); cin >> a;

    int mi = INF;
    rep (p, 2) rep (q, 2) rep (bit, 1LL<<n) {
        static auto used = make_v<int, 2>(n, n);
        rep (i, n) rep (j, n) used[i][j] = 0;

        int sum = 0;
        rep (i, n) rep (j, n) {
            if (p & (i == j)) used[i][j] = 1;
            if (q & (i+j == n-1)) used[i][j] = 1;
            if (bit>>i&1) used[i][j] = 1;

            if (used[i][j]) sum += a[i][j];
        }

        int rest = m - (popcnt(bit) + p + q);
        if (rest <= 0) {
            chmin(mi, sum);
            continue;
        }

        static vector<int> b;
        b.clear();
        rep (j, n) {
            int sum = 0;
            rep (i, n) if (not used[i][j]) {
                sum += a[i][j];
            }
            b.eb(sum);
        }
        sort(all(b));

        sum += sumof(b.begin(), b.begin() + rest);
        chmin(mi, sum);
    }

    cout << mi << "\n";

}

yukicoder

結果

テストケース

ソースコード