oj.uz

Submission #241831

# Submission time Handle Problem Language Result Execution time Memory
241831 2020-06-25T18:23:15 Z dung11112003 Kronican (COCI16_kronican) C++11
100 / 100
 624 ms 4600 KB 
#include <bits/stdc++.h>

#define taskname ""
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define for0(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)

using namespace std;

typedef long long ll;
typedef long double ld;
typedef complex <ld> cd;
typedef vector <cd> vcd;
typedef vector <int> vi;

template<class T> using v2d = vector <vector <T> >;
template<class T> bool uin(T &a, T b)
{
    return a > b ? (a = b, true) : false;
}
template<class T> bool uax(T &a, T b)
{
    return a < b ? (a = b, true) : false;
}

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

const int maxN = 20;

int n, k, c[maxN][maxN], g[1 << maxN];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n >> k;
    for0(i, n)
    {
        for0(j, n)
        {
            cin >> c[i][j];
        }
    }
    for (int mask = (1 << n) - 2; mask > 0; mask--)
    {
        g[mask] = 1e9;
        for0(i, n)
        {
            if (!(mask >> i & 1))
            {
                for0(j, n)
                {
                    if (mask >> j & 1)
                    {
                        uin(g[mask], g[mask | (1 << i)] + c[i][j]);
                    }
                }
            }
        }
    }
    int ans = 1e9;
    for0(mask, 1 << n)
    {
        if (__builtin_popcount(mask) == k)
        {
            uin(ans, g[mask]);
        }
    }
    cout << ans;
    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 11 ms 384 KB Output is correct
6 Correct 17 ms 512 KB Output is correct
7 Correct 30 ms 632 KB Output is correct
8 Correct 62 ms 888 KB Output is correct
9 Correct 600 ms 4448 KB Output is correct
10 Correct 624 ms 4600 KB Output is correct