oj.uz

답안 #1092191

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1092191 2024-09-23T13:41:14 Z TgX_2 Kronican (COCI16_kronican) C++17
100 / 100
 778 ms 16844 KB 
/*-----------------------------
        Author : TgX.2
       11Ti - K28 - CHV
-----------------------------*/

#include <bits/stdc++.h>

#define FOR(i, a, b)       for (int i = (a), _b = (b); i <= _b; i += 1)
#define FORD(i, a, b)      for (int i = (a), _b = (b); i >= _b; i -= 1)
#define FORC(i, a, b, c)   for (int i = (a), _b = (b), _c = (c); i <= _b; i += _c)

#define fi                 first
#define se                 second
#define pb                 push_back
#define len(x)             (int)((x).size())
#define all(x)             (x).begin(), (x).end()

#define _                  << " " <<
#define __                 << "\n"
#define ___                << " "

#define ______________TgX______________ main()
#define int                long long
#define intmax             1e9
#define intmin            -1e9
#define llongmax           1e18
#define llongmin          -1e18
#define memo(a, val)       memset((a), (val), sizeof((a)))

using   namespace std;

template<typename T1, typename T2> 
bool mini(T1 &a, T2 b)
    {if (a > b) a = b; else return 0; return 1;}

template<typename T1, typename T2> 
bool maxi(T1 &a, T2 b)
    {if (a < b) a = b; else return 0; return 1;}
/*-----------------------------*/

int n, k, a[25][25];
int f[(1 << 21)];

int dp(int mask) {
    if (__builtin_popcount(mask) == k) return 0;

    int &ans = f[mask];
    if (ans != -1) return ans;

    ans = intmax;
    FOR(i, 0, n - 1) if (mask & (1 << i))
        FOR(j, 0, n - 1) if (i != j and mask & (1 << j))
            mini(ans, dp(mask ^ (1 << i)) + a[i][j]);

    return ans;
}

void process() {
    cin >> n >> k;
    FOR(i, 0, n - 1) FOR(j, 0, n - 1) cin >> a[i][j];

    memo(f, -1);
    cout << dp((1 << n) - 1);
}



/*-----------------------------*/
______________TgX______________ {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);  
    if (fopen("temp.inp", "r")) {
        freopen("temp.inp", "r", stdin);
        freopen("temp.out", "w", stdout);
    }
    process();
    // cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC __ ;
}


/*==============================+
|INPUT                          |
--------------------------------|

================================+
|OUTPUT                         |
--------------------------------|

===============================*/

Compilation message

kronican.cpp:22:41: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   22 | #define ______________TgX______________ main()
      |                                         ^~~~
kronican.cpp:69:1: note: in expansion of macro '______________TgX______________'
   69 | ______________TgX______________ {
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
kronican.cpp: In function 'int main()':
kronican.cpp:73:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |         freopen("temp.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
kronican.cpp:74:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |         freopen("temp.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 16732 KB Output is correct
2 Correct 6 ms 16732 KB Output is correct
3 Correct 6 ms 16844 KB Output is correct
4 Correct 6 ms 16708 KB Output is correct
5 Correct 12 ms 16728 KB Output is correct
6 Correct 21 ms 16732 KB Output is correct
7 Correct 35 ms 16728 KB Output is correct
8 Correct 73 ms 16732 KB Output is correct
9 Correct 778 ms 16728 KB Output is correct
10 Correct 79 ms 16732 KB Output is correct