제출 #447306

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
447306		XBoRickie	Kronican (COCI16_kronican)	C++17	100 / 100	757 ms	4448 KiB

kronican

#include <bits/stdc++.h>
using namespace std;
// Typedef
typedef long double                ld;
typedef long long int              int64;
typedef unsigned long long int     uint64;
typedef std::pair<int, int>        PII;
typedef std::pair<int64, int64>    PLL;
typedef std::vector<int>           VI;
typedef std::vector<long long>     VLL;
// Define For-loop
#define FOR(i, j, k, in)           for (int i = (j); i < (k) ; i += (in))
#define FORW(i, j, k, in)          for (int i = (j); i <= (k); i += (in))
#define RFOR(i, j, k, in)          for (int i = (j); i >= (k); i -= (in))
// Define Data structure func
#define all(cont)                  cont.begin(), cont.end()
#define rall(cont)                 cont.rbegin(), cont.rend()
#define sz(cont)                   int((cont).size())
#define pb                         push_back
#define mp                         make_pair
#define fi                         first
#define se                         second
// Define number
#define IINF                       0x3f3f3f3f
#define LLINF                      1000111000111000111LL
#define PI                         3.1415926535897932384626433832795
// Other
#define lend                       '\n'
#define hardio(name)               freopen(name".inp","r",stdin), freopen(name".out","w",stdout);
void FastIO() { std::ios_base::sync_with_stdio(false); std::cin.tie(NULL); cin.exceptions(cin.failbit); srand(time(NULL)); }

const int MOD = 1e9 + 7, MOD2 = 1e9 + 9;
// ======================================================================

int n, k;
int a[30][30] = {};
int dp[1 << 20] = {};

int recur(int mask = 0) {
    if (__builtin_popcount(mask) == k) return 0;
    int &ans = dp[mask];
    if (ans != -1) return ans;

    ans = IINF;
    FOR(i, 0, n, 1) {
        int mn = IINF;
        if (!(mask & (1 << i))) continue;
        FOR(j, 0, n, 1) {
            if (i == j) continue;
            if (!(mask & (1 << j))) continue;
            mn = min(mn, a[i][j]);
        }
        ans = min(ans, recur(mask ^ (1 << i)) + mn);
    }
    return ans;
}

namespace io {
    const int SIZE = (1 << 20) + 1;
    char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55]; int f, qr;
    #define gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS ++)) : *iS ++)
    inline void flush() { fwrite (obuf, 1, oS - obuf, stdout); oS = obuf; } // print the remaining part
    inline void putc(char x) { *oS++ = x; if (oS == oT) flush (); } // putchar
    template<typename A> inline bool read (A &x) {
        for (f = 1, c = gc(); c < '0' | c > '9'; c = gc()) if (c == '-') f = -1; else if (c == EOF) return 0;
        for (x = 0; c <= '9' && c >= '0'; c = gc()) x = x * 10 + (c & 15); x *= f;
        return 1;
    }
    inline bool read(char &x) {
        while((x = gc()) == ' ' || x == '\n' || x == '\r'); return x != EOF;
    }
    inline bool read(string& x) {
        while ((c = gc()) == '\n' || c == ' '|| c == '\r'); if (c == EOF) return 0; x.clear();
        while (!(c == '\n' || c == ' ' || c == '\r' || c == EOF)) x.push_back(c), c = gc(); return 1;
    }
    template<typename A,typename ...B>
    inline bool read(A &x, B &...y){ return read(x) + read(y...); }
    template<typename A> inline bool write(A x) {
        if (!x) putc('0'); if (x < 0) putc ('-'), x = -x;
        while (x) qu[++qr] = x % 10 + '0', x /= 10;
        while (qr) putc(qu[qr--]);
        return 0;
    }
    inline bool write(char x) { putc(x); return 0; }
    inline bool write(const char *x){ while (*x){ putc(*x); ++x; } return 0; }
    inline bool write(char *x){ while (*x){ putc(*x); ++x; } return 0; }
    template<typename A,typename ...B>
    inline bool write(A x,B ...y){ return write(x) || write(y...); }
    //no need to call flush at the end manually!
    struct Flusher_ {~Flusher_(){ flush(); }} io_flusher_;
} using io::read; using io::putc; using io::write;

int main(int argc, char* argv[]) {
    FastIO();

    memset(dp, -1, sizeof dp);
    read(n, k);
    FOR(i, 0, n, 1) FOR(j, 0, n, 1) read(a[i][j]);
    cout << recur((1 << n) - 1) << endl;

    return 0; }

컴파일 시 표준 에러 (stderr) 메시지

kronican.cpp: In function 'bool io::read(A&)':
kronican.cpp:66:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   66 |         for (x = 0; c <= '9' && c >= '0'; c = gc()) x = x * 10 + (c & 15); x *= f;
      |         ^~~
kronican.cpp:66:76: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   66 |         for (x = 0; c <= '9' && c >= '0'; c = gc()) x = x * 10 + (c & 15); x *= f;
      |                                                                            ^
kronican.cpp: In function 'bool io::read(char&)':
kronican.cpp:70:9: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   70 |         while((x = gc()) == ' ' || x == '\n' || x == '\r'); return x != EOF;
      |         ^~~~~
kronican.cpp:70:61: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   70 |         while((x = gc()) == ' ' || x == '\n' || x == '\r'); return x != EOF;
      |                                                             ^~~~~~
kronican.cpp: In function 'bool io::read(std::string&)':
kronican.cpp:73:9: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   73 |         while ((c = gc()) == '\n' || c == ' '|| c == '\r'); if (c == EOF) return 0; x.clear();
      |         ^~~~~
kronican.cpp:73:61: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   73 |         while ((c = gc()) == '\n' || c == ' '|| c == '\r'); if (c == EOF) return 0; x.clear();
      |                                                             ^~
kronican.cpp:74:9: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   74 |         while (!(c == '\n' || c == ' ' || c == '\r' || c == EOF)) x.push_back(c), c = gc(); return 1;
      |         ^~~~~
kronican.cpp:74:93: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   74 |         while (!(c == '\n' || c == ' ' || c == '\r' || c == EOF)) x.push_back(c), c = gc(); return 1;
      |                                                                                             ^~~~~~
kronican.cpp: In function 'bool io::write(A)':
kronican.cpp:79:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   79 |         if (!x) putc('0'); if (x < 0) putc ('-'), x = -x;
      |         ^~
kronican.cpp:79:28: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   79 |         if (!x) putc('0'); if (x < 0) putc ('-'), x = -x;
      |                            ^~
kronican.cpp: In instantiation of 'bool io::read(A&) [with A = int]':
kronican.cpp:98:49:   required from here
kronican.cpp:65:33: warning: suggest parentheses around comparison in operand of '|' [-Wparentheses]
   65 |         for (f = 1, c = gc(); c < '0' | c > '9'; c = gc()) if (c == '-') f = -1; else if (c == EOF) return 0;
      |                               ~~^~~~~

• Subtask 1: 100 / 100