#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("-O3")
// #pragma GCC optimize("no-stack-protector")
// #pragma GCC optimize("fast-math")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cout << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cout << endl; }
eni(!=) cout << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (ll)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)
//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
void binary(ll val,int to) {for(int i=0;i<to;i++) cerr<<(pw(i) & val ? 1 : 0); cerr<<endl;}
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={1,0,-1,0};
const ll ty[4]={0,1,0,-1};
const char rev_to[4]={'E','W','N','S'};
const char o[4]={'S','P','R'};
const int N=20+1;
const int M=1e9+7;
//typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st;
void bad(){
cout<<-1;
exit(0);
}
int n,t;
ll c[N][N];
vector<ll>dp(pw(N),1e18);
signed main()
{
fast_io;
ll ans=inf;
/// 1 -> если мы будем его сливать
/// dp[mask]-> сколько будет стоить, если мы будем сливать mask штук
cin>>n>>t;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cin>>c[i][j];
}
}
for(int i=0;i<n;i++){
//debug()<<imie(i)<<imie(dp[pw(i)]);
for(int j=0;j<n;j++){
if(i==j) continue;
dp[pw(i)]=min(dp[pw(i)],c[i][j]);
// debug()<<imie(i)<<imie(dp[pw(i)])<<imie(c[i][j]);
}
}
//dp[0]=0;
for(int i=0;i<pw(n);i++){
//if(__builtin_popcount(i)>k) continue;
ll f=0;
for(int j=0;j<n;j++){
if((pw(j) & i)) continue;
for(int k=0;k<n;k++){
if(j==k || pw(k)&i) continue;
dp[i+pw(j)]=min(dp[i+pw(j)],dp[i]+c[j][k]);
}
}
// ans=min(ans,dp[i]);
// cout<<' '<<f<<endl;
// ans=min(ans,f);
}
for(int i=0;i<pw(n);i++){
if(n-__builtin_popcount(i)>t) continue;
ll f=0;
ans=min(ans,dp[i]);
/// binary(i,n);
// debug()<<imie(i)<<imie(dp[i]);
// cout<<' '<<f<<endl;
// ans=min(ans,f);
}
if(n==t) ans=0;
// for(int i=0;i<pw(n);i++){
// }
cout<<ans;
return 0;
}
/*
4 4
1 2 a
3 2 a
1 4 a
3 4 b
0 2 3
*/
Compilation message
kronican.cpp: In function 'int main()':
kronican.cpp:41:11: warning: unused variable 'first' [-Wunused-variable]
#define f first
^
kronican.cpp:112:12: note: in expansion of macro 'f'
ll f=0;
^
kronican.cpp:41:11: warning: unused variable 'first' [-Wunused-variable]
#define f first
^
kronican.cpp:126:12: note: in expansion of macro 'f'
ll f=0;
^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
8 ms |
16768 KB |
Output is correct |
| 2 |
Correct |
8 ms |
16768 KB |
Output is correct |
| 3 |
Correct |
8 ms |
16768 KB |
Output is correct |
| 4 |
Correct |
8 ms |
16768 KB |
Output is correct |
| 5 |
Correct |
15 ms |
16768 KB |
Output is correct |
| 6 |
Correct |
23 ms |
16768 KB |
Output is correct |
| 7 |
Correct |
40 ms |
16768 KB |
Output is correct |
| 8 |
Correct |
79 ms |
16768 KB |
Output is correct |
| 9 |
Correct |
713 ms |
16768 KB |
Output is correct |
| 10 |
Correct |
713 ms |
16768 KB |
Output is correct |
