oj.uz

답안 #884567

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
884567 2023-12-07T16:54:03 Z vjudge1 Kronican (COCI16_kronican) C++17
100 / 100
 1349 ms 8800 KB 
    #include <bits/stdc++.h>
    using namespace std;
    #define int long long
    const int mod = 1e9 + 7;
    const int maxn = 21;
    const int infinito = 1e9;
    int n,k;
    int v[maxn][maxn];
    int dp[1<<maxn];
    int contaum(int g){
    	int x =0;
    	while(g > 0){
    		x++;
    		g = g - (g&(-g));
    	}
    	return x;
    }
    signed main(){
    	cin >> n >> k;
    	for(int i = 0; i < n; i++){
    		for(int y = 0; y < n; y++){
    			cin >> v[i][y];
    		}
    	}
    	dp[0] = 0;
    	for(int i = 1; i < (1<<n); i++){
    		int uns = contaum(i);
    		if(uns <= k){
    			dp[i] = 0;
     
    		}
    		else{
    			//cout << i << " ";
    			dp[i] = infinito;
    			for(int y = 0; y < n; y++){
    				for(int j = 0; j < n; j++){
    					if(j != y){
    						//cout << y << " " << j <<  " " << (i&(1<<j)) << " " <<  (i&(1<<y)) << endl;
    						if(((i&(1<<j)) >= 1) && ((i&(1<<y)) >= 1)){
    							//cout << "oi" << endl;
    							dp[i] = min(dp[i],  dp[i^(1<<y)] + v[y][j]);
    						}
    					}
    				}
    			}
    		}
    	}
    	cout << dp[(1<<n) - 1] << endl;
    	return 0;
    }

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 10 ms 348 KB Output is correct
6 Correct 27 ms 2676 KB Output is correct
7 Correct 54 ms 2656 KB Output is correct
8 Correct 112 ms 2652 KB Output is correct
9 Correct 1349 ms 8800 KB Output is correct
10 Correct 80 ms 8784 KB Output is correct