我测试了一下代码，样例过了

但是TLE了，这是为什么

还附带一个WA,哪位指点一下

qwq

数据点

#include<bits/stdc++.h>
using namespace std;
int n, m, u, v, a, cnt, ans[21][21], maxx = -1;;
bool vis[21];
void dfs(int now) {
	for (int i = 1; i <= n; i++) {
		if (!vis[i]) {
			vis[i] = 1;
			cnt += ans[now][i];
			dfs(i);
			cnt -= ans[now][i];
		}
	}
	maxx = max(maxx, cnt);
	vis[now] = 0;
	return ;
}
int main() {
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		cin >> u >> v >> a;
		ans[u][v] = a;
		ans[v][u] = a;
	}
	for (int i = 1; i <= n; i++) {
		vis[i] = 1;
		dfs(i);
		memset(vis, 0, sizeof(vis));
	}
	cout << maxx;
	return 0;
}