/*
Templete by norman/KNN-07
Who tf even love CP :sob:
*/
#include <bits/stdc++.h>
// Wish you can debug? YesYes
#ifndef LOCAL
#define cerr \
if (0) \
cerr
#endif
// Policy based DS?
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// Who tf deal with overflow
// #define int long long
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("arch=skylake")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
using namespace std;
#define el '\n'
#define mpp make_pair
#define pb push_back
#define ppb pop_back
#define pf push_front
#define emp emplace_back
#define fi first
#define nd second
#define forinc(i, a, b) for (int i = (a); i <= (b); i++)
#define fordec(i, a, b) for (int i = (a); i >= (b); i--)
#define alle(x) (x).begin(), (x).end()
#define ralle(x) (x).rbegin(), (x).rend()
#define mms(a, v) memset(a, v, sizeof(a))
#define lwb(a, v) lower_bound((a).begin(), (a).end(), v)
#define upb(a, v) upper_bound((a).begin(), (a).end(), v)
#define bit(i, a) (((a) >> (i)) & 1)
#define BIT_SET(a, b) ((a) |= (1ULL << (b)))
#define BIT_CLEAR(a, b) ((a) &= ~(1ULL << (b)))
#define BIT_FLIP(a, b) ((a) ^= (1ULL << (b)))
#define BIT_CHECK(a, b) (!!((a) & (1ULL << (b))))
#define BITMASK_SET(x, mask) ((x) |= (mask))
#define BITMASK_CLEAR(x, mask) ((x) &= (~(mask)))
#define BITMASK_FLIP(x, mask) ((x) ^= (mask))
#define BITMASK_CHECK_ALL(x, mask) (!(~(x) & (mask)))
#define BITMASK_CHECK_ANY(x, mask) ((x) & (mask))
#define POPCNT(mask) __builtin_popcount(mask)
#define POPCNTLL(mask) __builtin_popcountll(mask)
#define CTZ(mask) __builtin_ctz(mask)
#define CTZLL(mask) __builtin_ctzll(mask)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef map<int, int> mii;
typedef map<ll, ll> mll;
typedef vector<bool> vb;
template <typename T, typename U>
inline void maximize(T &x, U y)
{
if (y < x)
x = y;
}
template <typename T, typename U>
inline void minimize(T &x, U y)
{
if (x < y)
x = y;
}
inline int add_m(int a, int b, int mod)
{
int res = a + b;
return (res >= mod ? res - mod : res);
}
inline int mod_neg(int a, int b, int mod)
{
int res;
if (abs(a - b) < mod)
res = a - b;
else
res = (a - b) % mod;
return (res < 0 ? res + mod : res);
}
inline int mul_wmod(int a, int b, int c)
{
ll res = (ll)a * b;
return (res >= c ? res % c : res);
}
inline int mul_wnmod(int a, int b, int c)
{
ll res = (ll)a * b;
return ((res % c) + c) % c;
}
// Debugger Utils
template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template <size_t i, class T>
ostream &print_tuple_utils(ostream &out, const T &tup)
{
if constexpr (i == tuple_size<T>::value)
return out << ")";
else
return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup);
}
template <class... U>
ostream &operator<<(ostream &out, const tuple<U...> &t)
{
return print_tuple_utils<0, tuple<U...>>(out, t);
}
#define db(val) "[" #val " = " << (val) << "] "
// End if debugger utils
namespace Hasher
{
struct custom_hash
{
static uint32_t splitmix64(uint32_t x)
{
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const
{
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
struct hash_pair
{
template <class T1, class T2>
size_t operator()(const pair<T1, T2> &p) const
{
auto hash1 = custom_hash{}(p.first);
auto hash2 = custom_hash{}(p.second);
if (hash1 != hash2)
return hash1 ^ hash2;
return hash1;
}
};
struct hash_pair_pair
{
template <class T1, class T2>
size_t operator()(const pair<T1, T2> &p) const
{
auto hash1 = custom_hash{}(p.first);
auto hash2 = hash_pair{}(p.second);
if (hash1 != hash2)
return hash1 ^ hash2;
return hash1;
}
};
}
using namespace Hasher;
const string taskname = "";
const bool tc = false;
const int oo = 1e9, mod = 1e9 + 7;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ll ool = 1e18;
const ldb eps = 1e-6;
const int MAXN = 1e6;
/*
Author: normankr07
Problem: COCI 2016/2017 - Contest 3 - Kronican
Submission links:
- https://oj.vnoi.info/problem/coci1617_r3_kronican
- https://oj.uz/problem/view/COCI16_kronican
- https://dmoj.ca/problem/coci16c3p3
Editorial links:
- https://dmoj.ca/problem/coci16c3p3/editorial (ncct)
Algorithm:
- dp[mask] be the mincost of mergeing mask stores??
*/
int c[30][30];
ll dp[(1 << 21)];
void solve()
{
int n, k;
cin >> n >> k;
forinc(i, 0, n - 1) forinc(j, 0, n - 1) cin >> c[i][j];
for (int mask = 0; mask < (1 << n); mask++)
{
if (POPCNT(mask) <= k)
continue;
dp[mask] = oo;
forinc(i, 0, n - 1)
{
if (!BIT_CHECK(mask, i))
continue;
forinc(j, 0, n - 1)
{
if (i == j || (!BIT_CHECK(mask, j)))
continue;
int newmask = mask;
BIT_FLIP(newmask, i);
dp[mask] = min(dp[mask], dp[newmask] + c[i][j]);
}
}
}
cout << dp[(1 << n) - 1];
}
int32_t main()
{
if (fopen((taskname + ".inp").c_str(), "r"))
{
freopen((taskname + ".inp").c_str(), "r", stdin);
freopen((taskname + ".out").c_str(), "w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int tsc = 1;
if (tc)
{
cin >> tsc;
}
while (tsc--)
{
solve();
cout << el;
}
#ifdef LOCAL
cerr << "\n"
<< "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
}
Compilation message
kronican.cpp: In function 'int32_t main()':
kronican.cpp:239:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
239 | freopen((taskname + ".inp").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
kronican.cpp:240:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
240 | freopen((taskname + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
324 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
6 ms |
424 KB |
Output is correct |
| 6 |
Correct |
13 ms |
584 KB |
Output is correct |
| 7 |
Correct |
26 ms |
836 KB |
Output is correct |
| 8 |
Correct |
54 ms |
1300 KB |
Output is correct |
| 9 |
Correct |
623 ms |
8404 KB |
Output is correct |
| 10 |
Correct |
47 ms |
6204 KB |
Output is correct |
