oj.uz

Submission #88575

# Submission time Handle Problem Language Result Execution time Memory
88575 2018-12-06T17:43:02 Z jasony123123 Kronican (COCI16_kronican) C++11
0 / 100
 3 ms 932 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"
typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll PRIME = 105943LL;
const ll INF = 1e12;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }
void io() {
#ifdef LOCAL_PROJECT 
	freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else 
	/* online submission */
#endif 
	ios_base::sync_with_stdio(false); cin.tie(NULL);
}
/*************************COCI 16-17 R3 #3*************************/

int N, K;
ll cost[20][20];

int getNode(ll dist[], bool inSet[]) {
	pii best{ LLONG_MAX, -1 };
	FOR(i, 0, N) if (!inSet[i]) 
		minn(best, { dist[i], i });
	return best.second;
}

ll calc(int bitmask) {
	ll dist[20];
	bool inSet[20]; 
	int par[20];
    fill(inSet, inSet+N, false);
    fill(dist, dist+N, INF);
	fill(par, par+N, -1);

	FOR(i, 0, N) if (bitmask&(1 << i)) dist[i] = 0;
	FOR(c, 0, N) {
		int u = getNode(dist, inSet);
		assert(u >= 0);
		inSet[u] = 1;
		FOR(i, 0, N) if (!inSet[i] && dist[i] > cost[i][u]) {
			dist[i] = cost[i][u];
			par[i] = u;
		}
	}
	ll ans = 0;
	FOR(i, 0, N) if (par[i] != -1)
		ans += cost[i][par[i]];
	return ans;
}

int main() {
	io();
	cin >> N >> K;
	FOR(i, 0, N) FOR(j, 0, N)
		cin >> cost[i][j];
	ll ans = LLONG_MAX;
	FOR(s, 0, 1 << N) if (__builtin_popcount(s) == K) {
		minn(ans, calc(s));
	}
	cout << ans << "\n";
	return 0;
}
/*
...
*/

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Runtime error 3 ms 704 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Runtime error 3 ms 932 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Runtime error 3 ms 932 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Runtime error 2 ms 932 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Runtime error 3 ms 932 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Runtime error 2 ms 932 KB Execution killed with signal 11 (could be triggered by violating memory limits)
8 Runtime error 2 ms 932 KB Execution killed with signal 11 (could be triggered by violating memory limits)
9 Runtime error 3 ms 932 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Runtime error 3 ms 932 KB Execution killed with signal 11 (could be triggered by violating memory limits)