Submission #5942582

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;

const int N = 10;
bool visited[N];
vector<ll> vals;
ll cost[N][N];
int n, j;

void dfs(int i, ll s) {
	visited[i] = true;
	int outs = 0;
	for (int t = 0; t < n; ++t) {
		if (! visited[t]) {
			++outs;
			dfs(t, s + cost[i][t]);
		}
	}
	if (outs == 0 && i >= j) vals.push_back(s);
	visited[i] = false;
}

ll works() {
	for (j = 0; j < n; ++j) dfs(j, 0);
	sort(vals.begin(), vals.end());
	ll ans = vals.back();

	for (int i = 0; i+1 < vals.size(); ++i) {
		if (vals[i] == vals[i+1]) return -1;
	}
	vals.clear();
	return ans;
}

int main() {
        vector<vector<int>> xr = {
        {1},
        {1,2},
        {1,2,4},
        {1,2,4,7},
        {1,2,4,7,12},
        {1,2,4,8,13,18},
        {1,2,4,8,14,19,24},
        {1,2,4,8,15,24,29,34},
        {1,2,4,8,15,24,29,34,46}
	};

	int m;
	cin >> m;
	for (int i = 1; i < m; ++i) {
		n = i;
		ll b = works() + 1;
		if (b == -1) return 1;

		for (j = 0; j < n; ++j) {
			cost[i][j] = b * xr[i-1][j];
			cost[j][i] = cost[i][j];
		}
	}

	n = m;
	ll res = works();
	if (res == -1) return 1;
	cerr << res << '\n';

	for (int i = 0; i < n; ++i) {
		for (j = 0; j < n; ++j) {
			cout << cost[i][j] << ' ';
		}
		cout << '\n';
	}
}

Submission Info

Judge Result