提出 #57763767

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
#define ll long long

ll mod = 1000000007ll;

ll g[9][9];
vector<ll> perms(0);

ll h[9][9];
ll arr[9][9];

ll n;

ll get_vert(ll a)
{
	a--;
	return perms[a];
}

ll find_cost()
{
	ll i,j;

	ll tot = 0;

	for(i=1;i<=n;i++)
	{
		for(j=i+1;j<=n;j++)
		{
			ll x = get_vert(i);
			ll y = get_vert(j);

			if(g[i][j] != h[x][y])
			{
				tot += arr[x][y];
			}
		}
	}
	return tot;


}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);


	ll t;
	t=1;
	//cin >> t;
	while(t--)
	{
		ll m;
		for(ll i=0;i<9;i++)
		{
			for(ll j =0;j<9;j++)
			{
				g[i][j] = 0;
				h[i][j] = 0;
			}
		}


		cin >> n;


		cin >> m;

		ll i;

		for(i=1;i<=n;i++)
		{
			perms.push_back(i);

		}

		for(i=0;i<m;i++)
		{
			ll u,v;
			cin >> u >> v;
			g[u][v] = 1;
			g[v][u] = 1;
		}

		ll mh;
		cin  >> mh;
		for(i=0;i<mh;i++)
		{
			ll u,v;
			cin >> u >> v;
			h[u][v] = 1;
			h[v][u] = 1;
		}

		ll j;
		ll ans = 0;
		for(i=1;i<=n;i++)
		{
			for(j=i+1;j<=n;j++)
			{
				ll x;
				cin >> x;
				arr[i][j] = x;
				arr[j][i] = x;
				ans += x;
			}
		}

		
		do {
			ans = min(ans,find_cost());
		} while(next_permutation(perms.begin(),perms.end()));

		cout << ans  << endl;

	}
	return 0;
}

提出情報

ジャッジ結果