結果

問題 No.3158 Collect Stamps
ユーザー 👑 binap
提出日時 2025-05-23 19:32:38
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 49 ms / 2,000 ms
コード長 2,868 bytes
コンパイル時間 4,325 ms
コンパイル使用メモリ 252,320 KB
実行使用メモリ 9,856 KB
最終ジャッジ日時 2025-05-23 19:32:47
合計ジャッジ時間 5,295 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;

template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template <int m> istream& operator>>(istream& is, static_modint<m>& a) {long long x; is >> x; a = x; return is;}
template <int m> istream& operator>>(istream& is, dynamic_modint<m>& a) {long long x; is >> x; a = x; return is;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}
template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}
template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

int main(){
	int n, m, k;
	cin >> n >> m >> k;
	vector<int> a(n);
	rep(i, k){
		int x;
		cin >> x;
		a[x - 1] = 1;
	}
	vector<vector<int>> t(n, vector<int>(n));
	cin >> t;
	
	const int INF = 1001001001;
	
	vector<vector<int>> memo(1 << n, vector<int>(n, INF));
	rep(i, n){
		memo[1 << i][i] = 0;
	}
	rep(s, 1 << n){
		for(int from = 0; from < n; from++){
			if((s >> from) & 1){
				for(int to = 0; to < n; to++){
					if(((s >> to) & 1) == 0){
						chmin(memo[s | (1 << to)][to], memo[s][from] + t[from][to]);
					}
				}
			}
		}
	}
	int ans = INF;
	rep(s, 1 << n){
		for(int from = 0; from < n; from++){
			if(__builtin_popcount(s) >= m){
				if(a[from]){
					chmin(ans, memo[s][from]);
				}
			}
		}
	}
	cout << ans << "\n";
	return 0;
}
0