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

提出ソース

結果

問題	No.1345 Beautiful BINGO
ユーザー	hitonanode
提出日時	2021-05-13 19:53:02
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	112 ms / 2,000 ms
コード長	6,182 bytes
コンパイル時間	1,582 ms
コンパイル使用メモリ	146,432 KB
実行使用メモリ	6,948 KB
最終ジャッジ日時	2024-09-25 08:05:31
合計ジャッジ時間	5,258 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,940 KB
testcase_08	AC	2 ms 6,940 KB
testcase_09	AC	2 ms 6,944 KB
testcase_10	AC	2 ms 6,944 KB
testcase_11	AC	2 ms 6,940 KB
testcase_12	AC	2 ms 6,944 KB
testcase_13	AC	2 ms 6,944 KB
testcase_14	AC	2 ms 6,944 KB
testcase_15	AC	2 ms 6,940 KB
testcase_16	AC	2 ms 6,940 KB
testcase_17	AC	1 ms 6,944 KB
testcase_18	AC	1 ms 6,940 KB
testcase_19	AC	1 ms 6,944 KB
testcase_20	AC	2 ms 6,940 KB
testcase_21	AC	2 ms 6,940 KB
testcase_22	AC	7 ms 6,940 KB
testcase_23	AC	109 ms 6,940 KB
testcase_24	AC	51 ms 6,944 KB
testcase_25	AC	4 ms 6,944 KB
testcase_26	AC	25 ms 6,940 KB
testcase_27	AC	104 ms 6,944 KB
testcase_28	AC	4 ms 6,944 KB
testcase_29	AC	25 ms 6,940 KB
testcase_30	AC	11 ms 6,940 KB
testcase_31	AC	8 ms 6,944 KB
testcase_32	AC	2 ms 6,940 KB
testcase_33	AC	110 ms 6,944 KB
testcase_34	AC	3 ms 6,940 KB
testcase_35	AC	3 ms 6,944 KB
testcase_36	AC	106 ms 6,940 KB
testcase_37	AC	3 ms 6,940 KB
testcase_38	AC	25 ms 6,944 KB
testcase_39	AC	112 ms 6,944 KB
testcase_40	AC	52 ms 6,940 KB
testcase_41	AC	51 ms 6,940 KB
testcase_42	AC	2 ms 6,940 KB
testcase_43	AC	1 ms 6,944 KB
testcase_44	AC	2 ms 6,944 KB
testcase_45	AC	2 ms 6,940 KB
testcase_46	AC	2 ms 6,944 KB
testcase_47	AC	2 ms 6,944 KB
testcase_48	AC	2 ms 6,948 KB
testcase_49	AC	1 ms 6,940 KB
testcase_50	AC	2 ms 6,940 KB
testcase_51	AC	2 ms 6,940 KB
testcase_52	AC	107 ms 6,944 KB
testcase_53	AC	104 ms 6,940 KB
testcase_54	AC	104 ms 6,940 KB
testcase_55	AC	101 ms 6,940 KB
testcase_56	AC	102 ms 6,940 KB
testcase_57	AC	109 ms 6,944 KB
testcase_58	AC	107 ms 6,940 KB
testcase_59	AC	108 ms 6,944 KB
testcase_60	AC	108 ms 6,940 KB
testcase_61	AC	107 ms 6,940 KB
testcase_62	AC	105 ms 6,940 KB

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

ソースコード

raw source code

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <typename T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl
#else
#define dbg(x) (x)
#endif

int solve(const vector<vector<int>> &A, int M) {
    const int N = A.size();
    vector<int> atot;
    for (auto v : A) atot.push_back(accumulate(ALL(v), 0));
    int ret = 1 << 29;
    REP(S, 1 << N) {
        int tmp = 0;
        vector<int> v(N);
        REP(i, N) {
            if ((S >> i) & 1) {
                tmp += atot[i];
            } else {
                REP(j, N) v[j] += A[i][j];
            }
        }
        sort(ALL(v));
        int req = max(0, M - __builtin_popcount(S));
        if (req <= int(v.size())) {
            chmin(ret, tmp + accumulate(v.begin(), v.begin() + req, 0));
        }
    }
    return ret;
}

int main() {
    int N, M;
    cin >> N >> M;
    vector A(N, vector<int>(N));
    cin >> A;

    int ret = solve(A, M);
    int btmp = 0, ctmp = 0, dtmp = 0;
    auto B = A, C = A, D = A;
    REP(i, N) {
        btmp += B[i][i];
        B[i][i] = 0;
        ctmp += C[i][N - 1 - i];
        C[i][N - 1 - i] = 0;
        dtmp += D[i][i];
        D[i][i] = 0;
        dtmp += D[i][N - 1 - i];
        D[i][N - 1 - i] = 0;
    }
    chmin(ret, btmp + solve(B, M - 1));
    chmin(ret, ctmp + solve(C, M - 1));
    chmin(ret, dtmp + solve(D, M - 2));
    cout << ret << '\n';
}

yukicoder

結果

テストケース

ソースコード