제출 #167166

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
167166		Atill83	Kronican (COCI16_kronican)	C++14	100 / 100	836 ms	8604 KiB

kronican

#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n, k;

int c[25][25];

ll dp[(1<<21) + 10];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("../IO/int.txt","r",stdin);
        freopen("../IO/out.txt","w",stdout);
    #endif

    cin>>n>>k;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            cin>>c[i][j];
        }
    }
    int mx = (1<<n);
    ll ans = INF;
    for(int i = 1; i < mx; i++) dp[i] = INF;
    for(int i = 0; i < mx; i++){
        int mask = i;
        for(int j = 0; j < n; j++){
            if((1<<j) & mask) continue;
            for(int k = 0; k < n; k++){
                if(j == k) continue;
                if(((1<<k) & mask)) continue;
                dp[mask | (1<<j)] =  min(dp[mask | (1<<j)], dp[mask] + c[j][k]);
            }
        }

        if(__builtin_popcount(i) >= n - k){
            ans = min(ans, dp[i]);
        }
    }
    cout<<ans<<endl;
    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

• Subtask 1: 100 / 100