Submission #1847262

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#include <bitset>
#include <string>
#include <cmath>
#include <set>
#include <map>
#define Rep(i, x, y) for (int i = x; i <= y; i ++)
#define Dwn(i, x, y) for (int i = x; i >= y; i --)
#define RepE(i, x) for (int i = pos[x]; i; i = g[i].nex)
#define ev g[i].y
#define eps 1e-10
#define d(x) (1 << x - 1)
using namespace std;
typedef long long ll;
typedef double db;
const int N = 16, M = 1 << N, mod = 1000000007;
int n, m, sn, a[N][N], g[M], f[N][M], sum;
int main()
{
	scanf ("%d%d", &n, &m);
	Rep(i, 1, m) {
		int x, y, z;
		scanf ("%d%d%d", &x, &y, &z);
		a[x][y] = a[y][x] = z;
		sum += z;
	}
	sn = (1 << n) - 1;
	Rep(p, 1, sn) {
		Rep(j, 1, n) if (d(j) & p) {
			Rep(k, j + 1, n) if (d(k) & p) {
				g[p] += a[j][k];
			}
		}
		if (!(d(1) & p)) continue ;
		f[1][p] = g[p];
		Rep(j, 1, n) if (d(j) & p) {
			for(int q = p & (p - 1); q; q = (q - 1) & p) if ((d(1) & q) && !(d(j) & q)) {
				Rep(k, 1, n) if ((d(k) & q) && a[j][k] && (k == 1 || f[k][q])) {
					f[j][p] = max(f[j][p], f[k][q] + a[j][k] + g[p - q]);
				}
			}
		}
	}
//	cout << f[n][sn]<<endl;
	printf("%d\n", sum - f[n][sn]);

	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:25:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf ("%d%d", &n, &m);
                        ^
./Main.cpp:28:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf ("%d%d%d", &x, &y, &z);
                               ^

Judge Result