oj.uz

Submission #1098276

# Submission time Handle Problem Language Result Execution time Memory
1098276 2024-10-09T08:16:18 Z anhthi Kronican (COCI16_kronican) C++14
100 / 100
 570 ms 16848 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
#define fi first
#define se second
#define ll long long
#define mp(x, y) make_pair(x, y)
#define sz(v) ((int) (v).size())
#define all(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define BIT(x, y) (((x) >> (y)) & 1)
#define pb push_back
#define heap priority_queue
#define max_rng *max_element
#define min_rng *min_element
#define rep(i, n) for(int i = 1, _n = (n); i <= _n; ++i)
#define forn(i, a, b) for(int i = (a), _b = (b); i <= _b; ++i)
#define ford(i, a, b) for(int i = (a), _b = (b); i >= _b; --i)

 
template <class X, class Y>
    inline bool maximize(X &x, Y y) {
        return (x < y ? x = y, true : false);
    }
 
template <class X, class Y>
    inline bool minimize(X &x, Y y) {
        return (x > y ? x = y, true : false);
    }
 
template <class X>
    inline void compress(vector<X> &a) {
        sort(all(a));
        a.resize(unique(all(a)) - a.begin());
    }
 
int ctz(ll x) { return __builtin_ctzll(x); }
int lg(ll x) { return 63 - __builtin_clzll(x); }
int popcount(ll x) { return __builtin_popcount(x); }
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) {
    return l + abs((ll) rng()) % (r - l + 1);
}
 
const ll oo = (ll) 1e18 + 5;
const int inf = (ll) 1e9 + 7, mod = (ll) 1e9 + 7;
 
const int N = 22, LOG = 21;
 
void add(int &x, int y) { x += y; if (x >= mod) x -= mod; }
void sub(int &x, int y) { x -= y; if (x < 0) x += mod; }

int n, k;
int a[N][N];

int f[MASK(N) + 5];

int main(void) {
 
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    cin >> n >> k;
    forn(i, 0, n - 1) forn(j, 0, n - 1) cin >> a[i][j];

    memset(f, 0x3f, sizeof f);

    f[MASK(n) - 1] = 0;
    ford(msk, MASK(n) - 1, 0) {
        forn(i, 0, n - 1) if (BIT(msk, i)) forn(j, 0, n - 1) if (i != j && BIT(msk, j)) {
            minimize(f[msk - MASK(i)], f[msk] + a[i][j]);
        }
    }
    int ans = inf;
    forn(msk, 0, MASK(n) - 1) if (popcount(msk) == k)
        minimize(ans, f[msk]);
    cout << ans;

    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 16728 KB Output is correct
2 Correct 6 ms 16732 KB Output is correct
3 Correct 7 ms 16636 KB Output is correct
4 Correct 6 ms 16732 KB Output is correct
5 Correct 12 ms 16732 KB Output is correct
6 Correct 18 ms 16732 KB Output is correct
7 Correct 32 ms 16732 KB Output is correct
8 Correct 63 ms 16732 KB Output is correct
9 Correct 567 ms 16728 KB Output is correct
10 Correct 570 ms 16848 KB Output is correct