text stringlengths 49 983k |
|---|
#include <cstdio>
#include <bitset>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
const int maxn = 15;
const int inf = 0x3f3f3f3f;
int mmap[maxn][maxn];
LL in[1 << maxn];
LL dp[1 << maxn][maxn];
int n, m;
int main()
{
scanf("%d%d", &n, &m);
for (int i = 0, f, t, d; i < m; ++i)
{
scanf("%d%d%d", &f, &t, &d);
mmap[t - 1][f - 1] = mmap[f - 1][t - 1] = d;
}
for (int i = 0; i < (1 << n); ++i)
for (int j = 0; j < n; ++j)
if (i & (1 << j))
for (int k = j + 1; k < n; ++k)
if (i & (1 << k))
in[i] += mmap[j][k];
for (int i = 0; i < (1 << n); ++i)
for (int j = 0; j < n; ++j)
dp[i][j] = -inf;
for (int i = 0; i < (1 << n); ++i)
{
for (int j = 0; j < n; ++j)
{
if (i & (1 << j))
{
if (!j)
dp[i][j] = in[i];
else
{
for (int k = 0; k < n; ++k)
if (j != k && (i & (1 << k)) && mmap[k][j])
dp[i][j] = max(dp[i][j], dp[i ^ (1 << j)][k] + mmap[k][j]);
for (int tmp = (i ^ (1 << j)), k = tmp; k; k = (k - 1) & tmp)
dp[i][j] = max(dp[i][j], dp[i ^ k][j] + in[k | (1 << j)]);
}
}
}
}
// cout << in[(1 << n) - 1] << endl;
printf("%lld\n", in[(1 << n) - 1] - dp[(1 << n) - 1][n - 1]);
return 0;
}
|
#include <bits/stdc++.h>
#define maxn 20
using namespace std;
int n,m,dis[maxn][maxn],sum;
int dp[1<<maxn][maxn],s[1<<maxn];
int main() {
scanf("%d %d",&n,&m);
memset(dis,0,sizeof(dis));
sum=0;
for (int i=1;i<=m;i++) {
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
a--; b--;
dis[a][b]=c;
dis[b][a]=c;
sum+=c;
}
for (int i=0;i<(1<<n);i++) {
for (int j=0;j<n;j++)
for (int k=j+1;k<n;k++)
if ((i>>j)%2==1&&(i>>k)%2==1)
s[i]+=dis[j][k];
}
memset(dp,-1,sizeof(dp));
dp[1][0]=0;
for (int i=0;i<(1<<n);i++) {
for (int j=0;j<n;j++) {
if (dp[i][j]==-1)
continue;
for (int t=0;t<n;t++) {
if ((i>>t)%2==1||dis[j][t]==0)
continue;
dp[i|(1<<t)][t]=max(dp[i|(1<<t)][t],dp[i][j]+dis[j][t]);
}
int x=(1<<n)-1-i;
for (int y=x;y>=1;y=(y-1)&x)
dp[i|y][j]=max(dp[i|y][j],dp[i][j]+s[y|(1<<j)]);
}
}
printf("%d\n",sum-dp[(1<<n)-1][n-1]);
return 0;
} |
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
#define chmax(a,b) if(a<b)a=b
const int N=17;
int n,m;
int g[N][N];
int cost[1<<N];
int dp[N][1<<N],dp2[1<<N];
int main()
{
scanf("%d%d",&n,&m);
while(m--)
{
int u,v,w;
scanf("%d%d%d",&u,&v,&w);
u--; v--;
g[u][v]=g[v][u]=w;
}
for(int mask=0;mask<(1<<n);mask++)
for(int u=0;u<n;u++)
for(int v=u+1;v<n;v++)
if(mask&(1<<u) && mask&(1<<v)) cost[mask]+=g[u][v];
memset(dp,-1,sizeof(dp));
for(int mask=1;mask<(1<<n);mask+=2)
dp[0][mask]=cost[mask];
for(int mask=1;mask<(1<<(n-1));mask+=2)
for(int i=0;i<n-1;i++) if(dp[i][mask]!=-1)
for(int j=0;j<n;j++)
if(g[i][j] && !(mask&(1<<j))) chmax(dp[j][mask|(1<<j)],dp[i][mask]+g[i][j]);
memset(dp2,-1,sizeof(dp2));
for(int mask=1;mask<(1<<n);mask+=2)
dp2[mask]=dp[n-1][mask];
for(int mask=1+(1<<(n-1));mask<(1<<n);mask+=2) if(dp2[mask]!=-1)
for(int i=0;i<n;i++) if(mask&(1<<i))
{
int _=(1<<n)-1-mask;
for(int mask2=_;mask2>0;mask2=(mask2-1)&_)
chmax(dp2[mask|mask2],dp2[mask]+cost[mask2|(1<<i)]);
}
printf("%d\n",cost[(1<<n)-1]-dp2[(1<<n)-1]);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const int MAXN = 15;
int N;
int W[MAXN][MAXN];
int V[1<<MAXN];
int dp[1<<MAXN][MAXN];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int M;
cin >> N >> M;
int tot = 0;
for (int i = 0; i < M; i++) {
int a, b, c; cin >> a >> b >> c; a--, b--;
W[a][b] = W[b][a] = c;
tot += c;
}
for (int m = 0; m < (1<<N); m++) {
for (int i = 0; i < N; i++) {
for (int j = i+1; j < N; j++) {
if ((m & (1 << i)) && (m & (1 << j))) {
V[m] += W[i][j];
}
}
}
}
for (int m = 1; m < (1 << N); m += 2) {
dp[m][0] = V[m];
for (int i = 1; i < N; i++) {
dp[m][i] = -INF;
}
for (int v = (m-2) & m; true; v = (v-2) & m) {
assert(v & 1);
assert((m&v) == v);
for (int i = 1; i < N; i++) {
if (!((m^v) & (1 << i))) continue;
for (int j = 0; j < N; j++) {
if (!(v & (1 << j))) continue;
if (W[i][j] == 0) continue;
dp[m][i] = max(dp[m][i], dp[v][j] + V[m^v] + W[i][j]);
}
}
if (v == 1) break;
}
}
cout << tot - dp[(1<<N)-1][N-1] << '\n';
return 0;
}
|
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
const int N=17;
const int M=(1<<15)+2;
int dp[M][N],E[N][N],sum[M],all,n,m;
template <typename _Tp> inline void IN(_Tp&x) {
char ch;bool flag=0;x=0;
while(ch=getchar(),!isdigit(ch)) if(ch=='-') flag=1;
while(isdigit(ch)) x=x*10+ch-'0',ch=getchar();
if(flag) x=-x;
}
inline void addedge(int u=0,int v=0,int w=0)
{IN(u),IN(v),IN(w),--u,--v,all+=w,E[u][v]=E[v][u]=w;}
int main() {
IN(n),IN(m);
for(int i=1;i<=m;++i) addedge();
int lim=1<<n;
for(int S=1;S<lim;++S)
for(int i=0;i<n;++i) if(S&(1<<i))
for(int j=i+1;j<n;++j) if(S&(1<<j))
sum[S]+=E[i][j];
for(int S=0;S<lim;++S) for(int t=0;t<n;++t) dp[S][t]=-1e9;
dp[1][0]=0;
for(int S=1;S<lim;++S) for(int t=0;t<n;++t) if(S&(1<<t)) {
for(int u=0;u<n;++u) if(!(S&(1<<u))&&E[t][u])
dp[S|(1<<u)][u]=max(dp[S|(1<<u)][u],dp[S][t]+E[t][u]);
int P=(lim-1)^S;
for(int T=P;T;T=(T-1)&P)
dp[S|T][t]=max(dp[S|T][t],dp[S][t]+sum[T|(1<<t)]);
}
printf("%d\n",all-dp[lim-1][n-1]);
return 0;
} |
#include <bits/stdc++.h>
int n,m,x,y,z;
int a[20][20],sum,dp[1<<15][15],f[1<<15];
int main(){
scanf("%d%d",&n,&m);
for (int i=1;i<=m;i++){
scanf("%d%d%d",&x,&y,&z);
x--,y--;
a[x][y]=a[y][x]=z;
sum+=z;
}
for (int i=1;i<1<<n;i++)
for (int j=0;j<n;j++)
for (int k=j+1;k<n;k++)
if ((i&(1<<j))&&(i&(1<<k)))
f[i]+=a[j][k];
memset(dp,-1,sizeof(dp));
dp[1][0]=0;
int all=(1<<n)-1;
for (int i=1;i<1<<n;i+=2){
for (int j=0;j<n;j++)
if (i&(1<<j)){
int t=dp[i][j];
if (t==-1) continue;
for (int k=0;k<n;k++){
if (i&(1<<k)) continue;
if (a[j][k]) dp[i|(1<<k)][k]=std::max(dp[i|(1<<k)][k],t+a[j][k]);
}
int rest=all^i;
for (int k=rest;k;k=(k-1)&rest){
dp[i|k][j]=std::max(dp[i|k][j],t+f[k|(1<<j)]);
}
}
}
printf("%d\n",sum-dp[all][n-1]);
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 17;
const int inf = 1e9;
int n, m, a[N][N], f[1 << N][N], sum[1 << N];
int main()
{
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int u, v, z;
cin >> u >> v >> z;
u--; v--;
a[u][v] = a[v][u] = z;
}
for (int i = 1; i < (1 << n); i++)
for (int j = 0; j < n; j++)
if (i & (1 << j))
for (int k = j+1; k < n; k++)
if (i & (1 << k))
sum[i] += a[j][k];
for (int i = 1; i < (1 << n); i++)
for (int j = 0; j < n; j++)
f[i][j] = -inf;
for (int i = 1; i < (1 << n); i++)
if (i & 1) f[i][0] = sum[i];
for (int i = 1; i < (1 << n); i++)
for (int j = 0; j < n; j++)
if (i & (1 << j))
for (int k = (i - 1) & i; k > 0; k = (k - 1) & i)
if ((k & (1 << j)) == 0)
for (int l = 0; l < n; l++)
if ((k & (1 << l)) > 0 && a[j][l] > 0)
f[i][j] = max(f[i][j], f[k][l] + a[j][l] + sum[i ^ k]);
cout << sum[(1 << n) - 1] - f[(1 << n) - 1][n - 1] << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll read(){
ll a=0,b=getchar(),c=1;
while(!isdigit(b))c=b=='-'?-1:1,b=getchar();
while(isdigit(b))a=a*10+b-'0',b=getchar();
return a*c;
}
void gao(int &a,int b){
if(a<b)a=b;
}
int n,m,sum,a[15][15],g[1<<15],f[1<<15][15];
int main(){
n=read(),m=read();
memset(f,-1,sizeof(f));
f[1][0]=0;
for(int i=1;i<=m;i++){
int x=read()-1,y=read()-1,z=read();
sum+=z,a[x][y]=a[y][x]=z;
for(int j=0;j<(1<<n);j++)
if((j>>x)&(j>>y)&1)
g[j]+=z;
}
for(int i=1;i<(1<<n);i++)
for(int j=0;j<n;j++)
if(~f[i][j]){
for(int k=0;k<n;k++)
if(!(i>>k&1)and a[j][k])
gao(f[1<<k|i][k],f[i][j]+a[j][k]);
for(int U=((1<<n)-1)^i,k=U;k;k=(k-1)&U)
gao(f[i|k][j],f[i][j]+g[1<<j|k]);
}
printf("%d",sum-f[(1<<n)-1][n-1]);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 16, inf = 2e9;
int n, m;
int f[N][1 << N], g[N][1 << N], a[1 << N];
int G[N][N], ans;
int main()
{
scanf("%d %d", &n, &m);
for(int i = 1; i <= m; i++)
{
int x, y, t;
scanf("%d %d %d", &x, &y, &t);
G[x][y] = G[y][x] = t;
ans += t;
}
for(int s = 0; s < (1 << n); s++)
for(int i = 1; i <= n; i++)
if(s & (1 << i - 1))
for(int j = i + 1; j <= n; j++)
if(s & (1 << j - 1)) a[s] += G[i][j];
for(int s = 0; s < (1 << n); s++)
for(int i = 1; i <= n; i++) g[i][s] = f[i][s] = -inf;
for(int s = 1; s < (1 << n); s++)
if(s & 1) f[1][s] = a[s];
for(int s = 1; s < (1 << n); s++)
{
if(!(s & 1)) continue;
for(int i = 2; i <= n; i++)
if(s & (1 << i - 1))
for(int t = s; t; t = (t - 1) & s)
if((t & (1 << i - 1)) && !(t & 1))
f[i][s] = max(f[i][s], g[i][s ^ t] + a[t]);
for(int i = 1; i <= n; i++)
if(!(s & (1 << i - 1)))
for(int j = 1; j <= n; j++)
if(s & (1 << j - 1))
if(G[i][j]) g[i][s] = max(g[i][s], f[j][s] + G[i][j]);
}
printf("%d", ans - f[n][(1 << n) - 1]);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
template<typename T>bool chkmax(T &a,T b){
if(a<b){a=b;return 1;}
else return 0;
}
template<typename T>T read(){
T x=0,f=1;char c=getchar();
for(;!isdigit(c);c=getchar())if(c=='-')f=-1;
for(;isdigit(c);c=getchar())x=(x<<3)+(x<<1)+(c^48);
return x*f;
}
const int maxn=1<<15;
int n,m,S,sum,ans=2e9,c[15][15],p[maxn],dp[maxn][15];
void init(){
memset(dp,-1,sizeof dp);
S=1<<n;
for(int s=0;s<S;++s)
for(int i=0;i<n;++i){
if(((s>>i)&1)==0)continue;
for(int j=i+1;j<n;++j)
if((s>>j)&1)p[s]+=c[i][j];
}
dp[1][0]=0;
}
void solve(){
n=read<int>(),m=read<int>();
for(int u,v,w;m--;){
u=read<int>()-1;
v=read<int>()-1;
w=read<int>();
c[u][v]=c[v][u]=w;
sum+=w;
}
init();
for(int s=0;s<S;++s){
for(int i=0;i<n;++i){
if(!~dp[s][i])continue;
int x=((S-1)^s)|(1<<i);
for(int t=x;~t;--t)
t&=x,chkmax(dp[s|t][i],dp[s][i]+p[t]);
for(int j=0;j<n;++j)if((~(s>>j)&1)&&c[i][j]){
chkmax(dp[s|(1<<j)][j],dp[s][i]+c[i][j]);
}
}
}
for(int i=0;i<S;++i)
ans=min(ans,sum-dp[i][n-1]);
printf("%d\n",ans);
}
int main(){
solve();
return 0;
} |
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<queue>
#include<algorithm>
#define eps 1e-10
#define inf 1e9
#define For(i,j,k) for(int i=j;i<=k;++i)
#define Dow(i,j,k) for(int i=k;i>=j;--i)
#define ll long long
using namespace std;
inline ll read()
{
ll t=0,f=1;char c=getchar();
while(c<'0'||c>'9') {if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9') t=t*10+c-48,c=getchar();
return t*f;
}
const int N=(1<<20);
int n,m,e[30][30],in[N],to[N][30],dp[N][30];
int x,y,z;
int main()
{
n=read();m=read();
For(i,1,m)
{
x=read();y=read();z=read();
e[x][y]=e[y][x]=z;
}
int mx=(1<<(n+1))-1;
For(i,1,mx)
For(j,1,n)
if((i&(1<<j))) For(k,j+1,n) if((i&(1<<k))) in[i]+=e[j][k];
For(i,1,mx)
For(j,1,n)
{
For(k,1,n)
if(i&(1<<k))
to[i][j]+=e[j][k];
}
For(i,0,mx) For(j,0,n) dp[i][j]=-1;
dp[2][1]=0;
For(i,2,mx)
For(j,1,n)// dp[i][j] to update
if(dp[i][j]>=0)
if(i&(1<<j))
{
For(k,1,n)
if(i&(1<<k)) continue;
else
if(e[j][k]) dp[i|(1<<k)][k]=max(dp[i|(1<<k)][k],dp[i][j]+e[j][k]);
int Cu=mx-i;
for(int tmp=mx-i;tmp;tmp=(tmp-1)&Cu)
{
dp[i|tmp][j]=max(dp[i|tmp][j],dp[i][j]+to[tmp][j]+in[tmp]);
}
}
printf("%d\n",in[mx]-dp[mx][n]);
} |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<map>
#include<queue>
using namespace std;
typedef long long ll;
const int INF=~0u>>2;
int G[16][16],n,dp[1<<16][16],cost[1<<16],m,sum;
int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return f*x;
}
int main(){
// freopen("ex.in","r",stdin);
n=read();m=read();
for(int i=1;i<=m;++i){
int x=read(),y=read(),z=read();
x--;y--;
G[x][y]=G[y][x]=z;
sum+=z;
}
for(int i=1;i<(1<<n);++i){
for(int j=0;j<n;++j) if(i&(1<<j)){
for(int k=j+1;k<n;++k) if(i&(1<<k)) cost[i]+=G[j][k];
}
}
for(int i=1;i<(1<<n);++i) for(int j=0;j<n;++j) dp[i][j]=-INF;
for(int i=1;i<(1<<n);++i) if(i&1) dp[i][0]=cost[i];
for(int i=1;i<(1<<n);++i){
for(int j=0;j<n;++j){
if(dp[i][j]==-INF) continue;
for(int k=(~i)&((1<<n)-1);k>0;k=(k-1)&(~i)){
for(int l=0;l<n;++l) if((k&(1<<l))&&G[j][l]) dp[i|k][l]=max(dp[i|k][l],dp[i][j]+G[j][l]+cost[k]);
}
}
}
printf("%d",sum-dp[(1<<n)-1][n-1]);
return 0;
} |
#include "bits/stdc++.h"
using namespace std;
int main(){
int N,M;
cin>>N>>M;
vector<vector<int>>edge(N,vector<int>(N));
for(int i=0;i<M;i++){
int a,b,c;
cin>>a>>b>>c;
a--;
b--;
edge[a][b]=c;
edge[b][a]=c;
}
vector<int>box(1<<N);
for(int i=0;i<1<<N;i++){
for(int j=0;j<N;j++){
if((i>>j)&1){
for(int k=j+1;k<N;k++){
if((i>>k)&1)box[i]+=edge[j][k];
}
}
}
}
vector<vector<int>>dp(1<<N,vector<int>(N,-1e9));
for(int i=1;i<1<<N;i+=2)dp[i][0]=box[i];
for(int i=1;i<1<<N;i+=2){
for(int j=0;j<N;j++){
if(!((i>>j)&1))continue;
int bag=(1<<N)-1-i;
int c=bag;
while(c>0){
for(int k=1;k<N;k++){
if(!edge[j][k])continue;
if((c>>k)&1) dp[i|c][k]=max(dp[i|c][k],dp[i][j]+edge[j][k]+box[c]);
}
c--;
c&=bag;
}
}
}
int ans=0;
for(int i=0;i<N;i++){
for(int j=i+1;j<N;j++)ans+=edge[i][j];
}
cout<<ans-dp.back().back()<<endl;
}
|
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
const int maxn = 20;
const int maxs = (1 << 15) + 1;
const int inf = 0x3f3f3f3f;
int n, m;
int G[maxn][maxn];
int fs;
int f[maxs][maxn];
int g[maxs][maxn];
void checkmin(int &x,int y)
{
if(y < x) x = y;
}
int main()
{
scanf("%d%d", &n, &m);
for(int i = 1, a, b, c; i <= m; i++)
{
scanf("%d%d%d", &a, &b, &c);
--a, --b;
G[a][b] = G[b][a] = c;
}
fs = (1 << n) - 1;
for(int S = 1; S <= fs; S++)
for(int i = 0; i < n; i++)
{
if((S >> i) & 1) continue;
for(int j = 0; j < n; j++)
if((S >> j) & 1) g[S][i] += G[i][j];
}
memset(f, inf, sizeof(f));
f[1][0] = 0;
for(int S = 1; S <= fs; S++)
for(int i = 0; i < n; i++)
if((S >> i) & 1)
{
for(int s = (S - 1) & S; s; s = (s - 1) & S)
if((s >> i) & 1)
{
int val = 0;
for(int j = 0; j < n; j++)
if(i != j && ((s >> j) & 1))
val += g[S ^ s][j];
checkmin(f[S][i], f[s][i] + val);
}
for(int j = 0; j < n; j++)
if((S >> j) & 1)
{
if(!G[j][i]) continue;
int s = S ^ (1 << i);
checkmin(f[S][i], f[s][j] + g[s ^ (1 << j)][i]);
}
}
printf("%d\n", f[fs][n - 1]);
return 0;
} |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define LL long long
#define INF 0x3f3f3f3f
#define Inf 1000000000000000000LL
#define F first
#define S second
using namespace std;
typedef pair<int,int>pii;
int n,m;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n>>m;
vector<vector<int> >a(n,vector<int>(n,0));
LL total=0;
for(int i=0;i<m;i++){
int x,y,z;
cin>>x>>y>>z;
x--,y--;
a[x][y]=a[y][x]=z;
total+=z;
}
const int inf=(int)1e9;
vector<int>inside(1<<n);
for(int t=0;t<(1<<n);t++)
for(int i=0;i<n;i++)if(t&(1<<i))
for(int j=i+1;j<n;j++)if(t&(1<<j))
inside[t]+=a[i][j];
vector<vector<int> >dp(1<<n,vector<int>(n,-1));
for(int t=0;t<(1<<n);t++)if(t&1)dp[t][0]=inside[t];
for(int t=0;t<(1<<n);t++)
for(int ii=0;ii<n;ii++){
if(dp[t][ii]==-1)continue;
int u=(1<<n)-1-t;
while(u>0){
for(int j=0;j<n;j++)
if(u&(1<<j))if(a[ii][j]>0)
dp[t|u][j]=max(dp[t|u][j],dp[t][ii]+inside[u]+a[ii][j]);
u=(u-1)&((1<<n)-1-t);
}
}
cout<<total-dp[(1<<n)-1][n-1]<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int N,M;
int G[20][20],U[110],V[110],W[110];
int Sum[(1<<15)+5],F[(1<<15)+5][20];
int main()
{
int i,j,k,s;
scanf("%d%d",&N,&M);
for(i=1; i<=M; i++)
{
scanf("%d%d%d",&U[i],&V[i],&W[i]);
U[i]--,V[i]--;
G[U[i]][V[i]]=G[V[i]][U[i]]=W[i];
}
for(i=0; i<1<<N; i++)
for(j=1; j<=M; j++)
if(i>>U[j]&1&&i>>V[j]&1)
Sum[i]+=W[j];
memset(F,-0x3f,sizeof(F));
F[1][0]=0;
for(i=1; i<1<<N; i++)
for(j=0; j<N; j++)
if(F[i][j]>=0)
{
s=(1<<N)-1-i;
for(k=s; k; k=(k-1)&s)
F[i|k][j]=max(F[i|k][j],F[i][j]+Sum[k|1<<j]);
if(~i>>N-1&1)
for(k=0; k<N; k++)
if(~i>>k&1&&G[j][k])
F[i|1<<k][k]=max(F[i|1<<k][k],F[i][j]+G[j][k]);
}
printf("%d\n",Sum[(1<<N)-1]-F[(1<<N)-1][N-1]);
return 0;
}
|
//created by missever
#include<bits/stdc++.h>
#define MAX 1000000007
using namespace std;
typedef long long LL;
typedef pair<int,int> P;
int f[1 << 15][15],g[1 << 15];
int p[15][15];
void add(int &x,int y) {
x = max(x,y);
}
int main() {
int n,m,i,j,k,u,v,w,s = 0;
scanf("%d%d",&n,&m);
for(i = 0; i < m; i++) {
scanf("%d%d%d",&u,&v,&w);
u--;
v--;
p[u][v] = p[v][u] = w;
s += w;
}
memset(f,-1,sizeof(f));
for(i = 0; i < (1 << n); i++) {
for(j = 0; j < n; j++) {
if(!((i >> j) & 1)) continue;
for(k = j + 1; k < n; k++) {
if((i >> k) & 1) g[i] += p[j][k];
}
}
if(i & 1) f[i][0] = g[i];
}
for(i = 0; i < (1 << n); i++) {
for(j = 0; j < n; j++) {
if(f[i][j] != -1) {
for(k = 0; k < n; k++) {
if(((i >> k) & 1) || !p[j][k]) continue;
add(f[i | (1 << k)][k],f[i][j] + p[j][k]);
u = ((1 << n) - 1) ^ i ^ (1 << k);
for(v = u; v; v = (v - 1) & u) add(f[i | (1 << k) | v][k],f[i][j] + p[j][k] + g[v | (1 << k)]);
}
}
}
}
printf("%d\n",s - f[(1 << n) - 1][n - 1]);
return 0;
}
|
#include <cstdio>
#include <algorithm>
int N, M, g[15][15], f[32768][15];
int main()
{
scanf("%d%d", &N, &M);
for (int i = 0, u, v, w; i < M; i++)
{
scanf("%d%d%d", &u, &v, &w);
u--, v--;
g[u][v] = g[v][u] = w;
}
for (int i = 0; i < 1 << N; i++)
for (int j = 0; j < N; j++)
f[i][j] = 2000000000;
for (int i = 1; i < 1 << N; i += 2)
f[i][0] = 0;
for (int i = 1; i < 1 << N; i++)
for (int j = 0; j < N; j++)
if (f[i][j] < 2000000000)
{
static int s[15];
for (int k = 0; k < N; k++)
{
s[k] = 0;
for (int l = 0; l < N; l++)
if (i >> l & 1)
s[k] += g[k][l];
}
for (int k = i; k < 1 << N; k = k + 1 | i)
{
int S = 0;
for (int l = 0; l < N; l++)
if (k - i >> l & 1)
S += s[l];
for (int l = 0; l < N; l++)
if (k - i >> l & 1 && g[j][l])
f[k][l] = std::min(f[k][l], f[i][j] + S - g[j][l]);
}
}
printf("%d\n", f[(1 << N) - 1][N - 1]);
return 0;
}
|
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
using namespace std;
const int inf = 0x7fffffff;
int f[1<<15][15];
int w[1<<15][15];
int map[15][15];
int n, m;
void up(int &x, int y) { if(x < y) x = y; }
int main() {
int i, j, k;
scanf("%d%d", &n, &m);
int sum = 0;
for(i = 1; i <= m; i++){
int x, y, d;
scanf("%d%d%d", &x, &y, &d); x--; y--;
map[x][y] = map[y][x] = d;
sum += d;
}
for(i = 1; i < 1<<n; i++){
int res = 0;
for(j = 0; j < n; j++){
for(k = j+1; k < n; k++) if(i&(1<<j) && i&(1<<k)) res += map[j][k];
}
for(j = 0; j < n; j++){
if(i&(1<<j)) continue;
w[i][j] = res;
for(k = 0; k < n; k++){
if(i&(1<<k)) w[i][j] += map[j][k];
}
}
}
for(j = 0; j < 1<<n; j++) for(i = 0; i < n; i++) f[j][i] = -inf;
f[1][0] = 0;
for(i = 1; i < 1<<n; i += 2){
for(j = 0; j < n; j++){
if(!(i&(1<<j))) continue;
for(k = 0; k < n; k++){
if(i&(1<<k) && j != k && map[j][k] != 0) up(f[i][j], f[i^(1<<j)][k]+map[j][k]);
}
for(k = (i-1)&i; k; k = (k-1)&i) if(k&(1<<j)) up(f[i][j], f[k][j]+w[i^k][j]);
}
}
printf("%d\n", sum-f[(1<<n)-1][n-1]);
return 0;
} |
#include<bits/stdc++.h>
#define For(i,l,r) for(int i = (l),i##end = (r);i <= i##end;i++)
#define Fordown(i,r,l) for(int i = (r),i##end = (l);i >= i##end;i--)
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int N = 15;
int dp[1 << N][N + 1],Sum[1 << N],G[N + 1][N + 1];
inline int read(){
int x = 0,flag = 1;
char ch = getchar();
while(!isdigit(ch) && ch != '-')ch = getchar();
if(ch == '-')flag = -1,ch = getchar();
while(isdigit(ch))x = (x << 3) + (x << 1) + ch - '0',ch = getchar();
return x * flag;
}
int main(){
int n = read(),m = read(),tot = 0;
For(i,1,m){
int x = read(),y = read(),z = read();
G[x][y] = G[y][x] = z,tot += z;
}
For(i,1,(1 << n) - 1){
For(j,1,n)if(i & (1 << (j - 1)))
For(k,j + 1,n)if(i & (1 << (k - 1)))
Sum[i] += G[j][k];
}
memset(dp,-63,sizeof(dp));
dp[1][1] = 0;
For(i,1,(1 << n) - 1)For(j,1,n){
int res = dp[i][j];
if(res < 0)continue;
For(k,1,n)if(!(i & (1 << (k - 1))) && G[j][k])
dp[i | (1 << (k - 1))][k] = max(dp[i | (1 << (k - 1))][k],res + G[j][k]);
int S0 = (1 << n) - 1 - i;
for(int S = S0;S;S = (S - 1) & S0)
dp[i | S][j] = max(dp[i | S][j],res + Sum[S | (1 << (j - 1))]);
}
printf("%d\n",tot - dp[(1 << n) - 1][n]);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int N=15;
int n,m,x,y,z,g[1<<N],a[N][N],f[1<<N][N],ans;
int main(){
scanf("%d%d",&n,&m);
int sum=0;
while (m--){
scanf("%d%d%d",&x,&y,&z);
sum+=z;
x--;y--;
a[x][y]=a[y][x]=z;
}
for (int s=1;s<1<<n;s++)
for (int i=0;i<n;i++)
if (s&(1<<i)){
g[s]=g[s^(1<<i)];
for (int j=0;j<n;j++)
if ((s&(1<<j)))g[s]+=a[i][j];
break;
}
memset(f,172,sizeof f);
f[1][0]=0;
for (int s=1;s<1<<n;s++)
for (int j=0;j<n;j++)
if (f[s][j]>=0){
for (int i=0;i<n;i++)
if (!(s&(1<<i))&&a[j][i])
f[s|(1<<i)][i]=max(f[s|(1<<i)][i],f[s][j]+a[j][i]);
int sy=((1<<n)-1)^s;
for (int i=sy;i;i=(i-1)&sy)f[s|i][j]=max(f[s|i][j],f[s][j]+g[i|(1<<j)]);
}
int ans=0;
for (int i=1;i<1<<n;i++)ans=max(ans,f[i][n-1]);
printf("%d",sum-ans);
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
int N, M;
int g[17][17];
int lookup[1 << 17];
int dp[1 << 17][16];
vector< int > add[1 << 17];
int rec(int mask, int pre)
{
if(mask == 0) return (0);
if(~dp[mask][pre]) return (dp[mask][pre]);
int ret = -INF;
for(int i = mask; i > 0; i = (i - 1) & mask) {
for(auto &j : add[i]) {
if(pre != 15 && g[pre][j] == 0) continue;
ret = max(ret, rec(mask ^ i, j) + lookup[i] + g[pre][j]);
}
}
return (dp[mask][pre] = ret);
}
signed main()
{
memset(dp, -1, sizeof(dp));
cin >> N >> M;
int all = 0;
for(int i = 0; i < M; i++) {
int a, b, c;
cin >> a >> b >> c;
--a, --b;
g[a][b] = c;
g[b][a] = c;
all += c;
}
for(int i = 0; i < 1 << N; i++) {
if(i & 1 && (i >> (N - 1)) & 1) continue;
for(int j = 0; j < N; j++) {
if((i >> j) & 1) {
if(i & 1) {
if(j == 0) add[i].push_back(j);
} else if((i >> (N - 1)) & 1) {
if(j == N - 1) add[i].push_back(j);
} else {
add[i].push_back(j);
}
for(int k = j + 1; k < N; k++) {
if((i >> k) & 1) lookup[i] += g[j][k];
}
}
}
}
cout << all - rec((1 << N) - 1, 15) << endl;
} |
#include <cstdio>
#include <cctype>
#include <cstring>
#include <algorithm>
#define rep(i,x,y) for (int i=x; i<=y; ++i)
#define repd(i,x,y) for (int i=x; i>=y; --i)
int get()
{
char c;
while (!isdigit(c=getchar()) && c!='-');
int s=c=='-'? -1:1,k=~s? c-'0':0;
for (; isdigit(c=getchar()); k=k*10+c-'0');
return s*k;
}
using namespace std;
typedef long long ll;
const int N=15,S=1<<N|1;
int n,m,s,tot,w[N][N],f[S][N],g[S];
int main()
{
n=get(),m=get(),s=(1<<n)-1;
rep(i,1,m)
{
int u=get()-1,v=get()-1;
tot+=w[u][v]=w[v][u]=get();
}
rep(i,1,s)
{
int x=0;
for (; !((i>>x)&1); ++x);
g[i]=g[i^(1<<x)];
rep(j,x+1,n-1)
if ((i>>j)&1)
g[i]+=w[x][j];
}
memset(f,128,sizeof(f)),f[0][0]=0;
rep(k,1,s)
{
rep(i,0,n-1)
if ((k>>i)&1)
for (int _=k^(1<<i),j=_; ~j; ~--j? j&=_:0)
f[k][i]=max(f[k][i],f[j][i]+g[k^j]);
rep(i,0,n-1)
if (!((k>>i)&1))
rep(j,0,n-1)
if ((k>>j)&1 && w[j][i])
f[k][i]=max(f[k][i],f[k][j]+w[j][i]);
}
printf("%d",tot-f[s][n-1]);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int n,m;
int add[1<<15];
int dp[1<<15][15];
int i,j,k,p;
int x,y,z;
int mp[15][15];
int main()
{
cin>>n>>m;
while (m--)
{
cin>>x>>y>>z;
mp[x-1][y-1]=z;
mp[y-1][x-1]=z;
}
for (i=0;i<(1<<n);i++)
{
for (j=0;j<n;j++)
{
if ((1<<j)&i)
{
for (k=j+1;k<n;k++)
{
if ((1<<k)&i)
{
//cout<<j<<' '<<k<<endl;
add[i]+=mp[k][j];
}
}
}
}
}
memset(dp,-1,sizeof(dp));
dp[1][0]=0;
for (i=1;i<(1<<n);i++)
{
for (j=0;j<n;j++)
{
if ((1<<j)&i)
{
if (dp[i][j]!=-1)
{
for (k=0;k<n;k++)
{
if (!((1<<k)&i))
{
if (mp[j][k])
{
dp[i|(1<<k)][k]=max(dp[i|(1<<k)][k],dp[i][j]+mp[j][k]);
}
}
}
int bj=((((1<<n)-1)^i)|(1<<j));
for (k=bj;;k=((k-1)&bj))
{
dp[i|k][j]=max(dp[i|k][j],dp[i][j]+add[k]);
if (!k) break;
}
}
}
}
}
int ans=0;
for (i=1;i<(1<<n);i++) ans=max(ans,dp[i][n-1]);
//cout<<add[(1<<n)-1]<<endl;
cout<<add[(1<<n)-1]-ans<<endl;
return 0;
} |
#include<bits/stdc++.h>
#define rep(i, l, r) for(int i = (l), i##end = (r);i <= i##end;++i)
using std::cin; using std::cout;
const int maxn = 15;
int n, m;
int f[maxn][1 << maxn];
int edge[maxn][maxn];
int g[1 << maxn];
inline void up(int & x,int y) {
if(x < y) {
x = y;
}
}
int main() {
std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n >> m;
int sum = 0;
rep(i, 1, m) {
int a, b, c;
cin >> a >> b >> c;
-- a, -- b;
edge[a][b] = c;
edge[b][a] = c;
for(int j = 0;j < 1 << n;++j) if(j >> a & j >> b & 1) {
g[j] += c;
}
sum += c;
}
for(int i = 0;i < n;++i) {
for(int j = 0;j < 1 << n;++j) {
f[i][j] = -1e9;
}
}
for(int i = 1;i < 1 << n;i += 2)
f[0][i] = g[i];
for(int j = 0;j < 1 << n;++j) {
for(int i = 0;i < n;++i) if(f[i][j] >= 0) {
for(int l = 0;l < n;++l) if(edge[i][l] && !(j >> l & 1)) {
for(int s = ~(j | 1 << l) & (1 << n) - 1, k = s;k;k = k - 1 & s) {
up(f[l][k | j | 1 << l], f[i][j] + edge[i][l] + g[k | 1 << l]);
}
up(f[l][j | 1 << l], f[i][j] + edge[i][l]);
}
}
}
cout << sum - f[n - 1][(1 << n) - 1] << '\n';
}
|
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;
template <class T>
inline void relax(T &a, const T &b)
{
if (b > a)
a = b;
}
const int MaxN = 15;
const int INF = 0x3f3f3f3f;
int n, m;
int mat[MaxN][MaxN];
int sum[1 << MaxN];
int result = -INF;
int f[1 << MaxN][MaxN];
int main()
{
cin >> n >> m;
for (int i = 0; i < m; ++i)
{
int u, v, w;
cin >> u >> v >> w, --u, --v;
mat[u][v] = w;
mat[v][u] = w;
}
int all = 1 << n;
for (int s = 1; s < all; ++s)
{
int u = __builtin_ctz(s);
sum[s] = sum[s ^ (s & -s)];
for (int v = u + 1; v < n; ++v)
if (s >> v & 1)
sum[s] += mat[u][v];
}
for (int s = 0; s < all; ++s)
for (int u = 0; u < n; ++u)
f[s][u] = -INF;
f[1][0] = 0;
for (int s = 1; s < all; ++s)
{
for (int u = 0; u < n; ++u)
{
if (f[s][u] < 0)
continue;
int ex = (all - 1) ^ s;
for (int t = ex; t; --t &= ex)
relax(f[s | t][u], f[s][u] + sum[t | 1 << u]);
for (int v = 0; v < n; ++v)
if (mat[u][v] && ~s >> v & 1)
relax(f[s | 1 << v][v], f[s][u] + mat[u][v]);
}
relax(result, f[s][n - 1]);
}
cout << sum[all - 1] - result << endl;
return 0;
} |
#pragma GCC optimize(3)
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define P pair
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define V vector
#define RE return
#define ALL(a) a.begin(),a.end()
#define MP make_pair
#define PB push_back
#define PF push_front
#define FILL(a,b) memset(a,b,sizeof(a))
using namespace std;
int er[20],p[20][20],sum[40000],dp[20][40000],n;
V<int> v[40000];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int x,y,z,m;
cin>>n>>m;
FOR(i,1,m){
cin>>x>>y>>z;p[x][y]=p[y][x]=z;
}
er[0]=1;
FOR(i,1,n)er[i]=er[i-1]*2;
FOR(i,1,er[n]-1){
FOR(j,1,n)if(i&er[j-1])v[i].PB(j);
sum[i]=sum[i^er[v[i][0]-1]];
for(int j=1;j<v[i].size();j++){
sum[i]+=p[v[i][0]][v[i][j]];
}
}
FOR(i,0,er[n]-1)FOR(j,1,n)dp[j][i]=1000000000;
dp[1][1]=0;
FOR(mask,1,er[n]-1){
FOR(i,1,n){
if(!(mask&er[i-1])||dp[i][mask]>=1000000000)continue;
FOR(j,1,n){
if(mask&er[j-1]||!p[i][j])continue;
dp[j][mask^er[j-1]]=min(dp[j][mask^er[j-1]],dp[i][mask]+sum[mask^er[i-1]^er[j-1]]-sum[mask^er[i-1]]);
}
int s=(er[n]-1)^mask,t=s;
while(t){
dp[i][mask^t]=min(dp[i][mask^t],dp[i][mask]+sum[mask^er[i-1]^t]-sum[mask^er[i-1]]-sum[t]);
t=(t-1)&s;
}
}
}
cout<<dp[n][er[n]-1]<<'\n';
RE 0;
}
|
#include <bits/stdc++.h>
using namespace std;
constexpr int inf = 0x3f3f3f3f;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<vector<int>> g(n, vector<int>(n));
int sum_w = 0;
while (m--) {
int u, v, w;
cin >> u >> v >> w;
--u, --v;
g[u][v] = g[v][u] = w;
sum_w += w;
}
vector<int> sum(1 << n);
for (int bt = 1; bt < 1 << n; ++bt) {
int v = __builtin_ctz(bt);
sum[bt] = sum[bt ^ 1 << v];
for (int u = 0; u < n; ++u) {
if (bt >> u & 1) {
sum[bt] += g[v][u];
}
}
}
vector<vector<int>> dp(n, vector<int>(1 << n, -inf));
for (int bt = 1; bt < 1 << n; bt += 2) {
dp[0][bt] = sum[bt];
}
for (int bt = 0; bt < 1 << n; ++bt) {
for (int v = 0; v < n; ++v) {
if (dp[v][bt] == -inf) {
continue;
}
int cbt = bt ^ ~-(1 << n);
for (int nxt = cbt; nxt; nxt = (nxt - 1) & cbt) {
for (int nv = 0; nv < n; ++nv) {
if (nxt >> nv & 1 and g[v][nv]) {
dp[nv][bt | nxt] = max(dp[nv][bt | nxt], dp[v][bt] + g[v][nv] + sum[nxt]);
}
}
}
}
}
int res = sum_w - dp.back().back();
cout << res << '\n';
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll read(){
ll a=0,b=getchar(),c=1;
while(!isdigit(b))c=b=='-'?-1:1,b=getchar();
while(isdigit(b))a=a*10+b-'0',b=getchar();
return a*c;
}
ll n,m,g[15][15],a[1<<15],dp[15][1<<15];
int main(){
n=read(),m=read();
for(int i=0;i<m;i++){
int x=read()-1,y=read()-1,z=read();
g[x][y]=g[y][x]=z;
}
for(int i=0;i<1<<n;i++){
a[i]=0;
for(int j=0;j<n;j++)
for(int k=j+1;k<n;k++)
if(i&(1<<j) and i&(1<<k))
a[i]+=g[j][k];
}
memset(dp,-0x3f,sizeof(dp));
for(int i=1;i<1<<n;i+=2)
dp[0][i]=a[i];
for(int i=0;i<1<<n;i++)
for(int j=0;j<n;j++){
if(dp[j][i]<0)continue;
ll ab=(1<<n)-1-i;
for(int p=ab;p>0;p=(p-1)&ab)
for(int k=0;k<n;k++)
if(g[j][k] and(p&(1<<k)))
dp[k][i+p]=max(dp[k][i+p],dp[j][i]+a[p]+g[j][k]);
}
ll ans=0;
for(int i=0;i<n;i++)
for(int j=i+1;j<n;j++)
ans+=g[i][j];
printf("%lld",ans-dp[n-1][(1<<n)-1]);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int n,m,N,f[15][1<<15],s[1<<15],e[15][15],ans;
void upd(int &x,int y){if (x<y) x=y;}
void work()
{
scanf("%d %d",&n,&m),N=1<<n;
for (int i=1,u,v,w; i<=m; i++)
scanf("%d %d %d",&u,&v,&w),u--,v--,e[u][v]=e[v][u]=w;
for (int i=1; i<N; i++)
for (int j=0; j<n; j++)
for (int k=j; k<n; k++)
if ((i&(1<<j))&&(i&(1<<k)))
s[i]+=e[j][k];
memset(f,128,sizeof(f));
f[0][1]=0;
for (int i=1; i<N; i+=2)
for (int j=0; j<n; j++)
if (i&(1<<j))
{
int x=N-1-i;
for (int k=x; k; k-=x&-x,k&=x)
upd(f[j][i|k],f[j][i]+s[k|(1<<j)]);
for (int k=0; k<n; k++)
if ((x&(1<<k))&&(e[j][k]))
upd(f[k][i|(1<<k)],f[j][i]+e[j][k]);
if (j==n-1) upd(ans,f[j][i]);
}
printf("%d",s[N-1]-ans);
}
int main()
{
work();
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
#define N 20
#define oo 1e9
#define For(i,x,y) for(int i=x;i<=y;i++)
#define Rep(i,x,y) for(int i=x;i<y;i++)
#define mp make_pair
#define pa pair<ll,int>
using namespace std;
inline int read(){
int x=0,f=0;char ch=getchar();
for(;ch<'0'||ch>'9';ch=getchar()) if(ch=='-') f=1;
for(;ch>='0'&&ch<='9';ch=getchar()) x=(x<<1)+(x<<3)+ch-48;
return f?-x:x;
}
int n,m,G[N][N],f[1<<N][N],s[1<<N],sum;
int main(){
n=read();m=read();
For(i,1,m){int x=read()-1,y=read()-1;G[x][y]=G[y][x]=read();sum+=G[x][y];}
Rep(i,0,1<<n) Rep(j,0,n) if((i>>j)&1) Rep(k,j+1,n) if((i>>k)&1) s[i]+=G[j][k];
Rep(i,0,1<<n) Rep(j,0,n) f[i][j]=-oo;
Rep(i,0,1<<n) if(i&1) f[i][0]=s[i];
Rep(i,0,1<<n) Rep(j,0,n) if((i>>j)&1) for(int k=i;k;k=(k-1)&i) if(k&1) Rep(l,0,n) if(((k>>l)&1)&&((~k>>j)&1)&&G[l][j]) f[i][j]=max(f[i][j],f[k][l]+G[l][j]+s[i^k]);
printf("%d\n",sum-f[(1<<n)-1][n-1]);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int g[15][15],cr[15][32768],ins[32768],dp[32768][15];
int main (){
int i,j,k,t,u,v,c,l,n,m,s=0;
scanf ("%d%d",&n,&m);
for (i=1;i<=m;i++)
{scanf ("%d%d%d",&u,&v,&c);
u--;v--;g[u][v]=g[v][u]=c;s+=c;
}
for (i=0;i<n;i++)
{for (k=0;k<n;k++)
{for (j=0;j<(1<<n);j++)
{if ((1<<k)&j)
{cr[i][j]+=g[i][k];}
}
}
}
for (i=0;i<(1<<n);i++)
{for (j=0;j<n;j++)
{for (k=0;k<n;k++)
{if ((1<<j)&i)
{if ((1<<k)&i)
{ins[i]+=g[j][k];}
}
}
}
ins[i]/=2;
}
memset(dp,-1,sizeof(dp));
dp[1][0]=0;
for (i=1;i<(1<<n);i++)
{for (j=0;j<n;j++)
{if (dp[i][j]<0) {continue;}
int tar=i-(1<<j),b=(1<<n)-1-i;
for (k=0;k<n;k++)
{if (i&(1<<k)) {continue;}
if (g[j][k]<=0) {continue;}
dp[i+(1<<k)][k]=max(dp[i+(1<<k)][k],dp[i][j]+g[j][k]);
}
for (t=b;t;t=(t-1)&b)
{dp[t|i][j]=max(dp[t|i][j],dp[i][j]+cr[j][t]+ins[t]);}
}
}
int ans=0;
for (i=0;i<(1<<n);i++)
{ans=max(ans,dp[i][n-1]);}
printf ("%d",s-ans);
return 0;
}
|
#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
const int MOD=1e9+7;
const double eps=1e-8;
typedef long long ll;
//orz yht
using namespace std;
int n,m,edge[15][15],sco[32770];
int dp[15][32770];
int main(){
// freopen(".in","r",stdin);
// freopen(".out"，"w",stdout);
cin>>n>>m;
for(int i=0;i<m;i++){
int a,b,c;
cin>>a>>b>>c;
a--;
b--;
edge[a][b]=edge[b][a]=c;
}
for(int i=0;i<(1<<n);i++){
sco[i]=0;
for(int j=0;j<n;j++){
for(int k=j+1;k<n;k++){
if(i&(1<<j) && i&(1<<k))
sco[i]+=edge[j][k];
}
}
}
memset(dp,-INF,sizeof dp);
for(int i=1;i<(1<<n);i+=2)
dp[0][i]=sco[i];
for(int i=0;i<(1<<n);i++){
for(int j=0;j<n;j++){
if(dp[j][i]<0)
continue;
int msk=(1<<n)-1-i;
for(int sub=msk;sub>0;sub=(sub-1)&msk){
for(int k=0;k<n;k++){
if(edge[j][k] && (sub&(1<<k)))
dp[k][i+sub]=max(dp[k][i+sub],dp[j][i]+sco[sub]+edge[j][k]);
}
}
}
}
ll cnt=0;
for(int i=0;i<n;i++)
for(int j=i+1;j<n;j++)
cnt+=edge[i][j];
cout<<cnt-dp[n-1][(1<<n)-1];
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int I[40000],n,m,H[20],a[20][20],x,y,ans,f[20][35000],w[35000];
int main(){
scanf("%d%d",&n,&m);
I[1]=H[1]=1; for (int i=2;i<=n+1;++i) H[i]=H[i-1]<<1,I[H[i]]=i;
for (int i=1;i<=m;++i){
scanf("%d%d",&x,&y);
scanf("%d",&a[x][y]);
a[y][x]=a[x][y];
for (int j=1;j<H[n+1];++j)
if (j&H[x]&&j&H[y]) w[j]+=a[x][y];
}
for (int i=1;i<=n;++i)
for (int j=0;j<H[n+1];++j) f[i][j]=-1;
for (int s=1;s<H[n];s+=2) f[1][s]=w[s];
for (int s=1;s<H[n];s+=2){
for (int i=2;i<n;++i)
if (H[i]&s){
int S=s^H[i];
for (int o=S;o;o=o-1&S)
if (o&1){
for (int j=o;j;j-=j&-j)
if (a[i][I[j&-j]])
f[i][s]=max(f[i][s],a[i][I[j&-j]]+f[I[j&-j]][o]+w[s-o]);
}
}
}
for (int i=1;i<n;++i)
if (a[i][n])
for (int s=1;s<H[n];s+=2)
if (f[i][s]>-1)
ans=max(ans,f[i][s]+a[i][n]+w[H[n+1]-1-s]);
printf("%d\n",w[H[n+1]-1]-ans);
return 0;
} |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n,m,i,j,x,y,w,hd,s,xlh,g[100010],v[21][21],f[100010][21],sy,mx,ans,pr,sz;
int main(){
scanf("%d%d",&n,&m);
for(i=1;i<=m;i++){
scanf("%d%d%d",&x,&y,&w);
xlh+=w;
x--;y--;
v[x][y]=v[y][x]=w;
}
mx=1<<n;
for(s=1;s<mx;s++){
for(i=0;i<n;i++)if(s&(1<<i)){
pr=s^(1<<i);
sz=0;
for(j=0;j<n;j++)if((s&(1<<j))&&v[i][j])sz+=v[i][j];
g[s]=g[pr]+sz;break;
}
//printf("%d %d\n",s,g[s]);
}
memset(f,172,sizeof(f));
f[1][0]=0;
for(s=1;s<mx;s++)
for(hd=0;hd<n;hd++)if(f[s][hd]>=0){
for(i=0;i<n;i++)if(!(s&(1<<i))&&v[hd][i]){
f[s|(1<<i)][i]=max(f[s|(1<<i)][i],f[s][hd]+v[hd][i]);
}
sy=(mx-1)^s;
for(i=sy;i;i=(i-1)&sy)f[s|i][hd]=max(f[s|i][hd],f[s][hd]+g[i|(1<<hd)]);
}
for(i=1;i<mx;i++)ans=max(ans,f[i][n-1]);
printf("%d",xlh-ans);
} |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int INF = 1 << 30;
int mat[15][15];
int cost[1 << 15][15];
int dp[1 << 15][15];
int main() {
int N, M;
cin >> N >> M;
for (int i = 0; i < M; i++) {
int a, b, c;
cin >> a >> b >> c;
a--; b--;
mat[a][b] = mat[b][a] = c;
}
for (int mask = 0; mask < (1 << N); mask++) {
for (int i = 0; i < N; i++) {
dp[mask][i] = INF;
for (int j = 0; j < N; j++) {
if (mask&(1 << j)) cost[mask][i] += mat[i][j];
}
}
}
dp[1][0] = 0;
for (int mask = 0; mask < (1 << N); mask++) {
for (int i = 0; i < N; i++) {
if (mask&(1 << i) == 0 || dp[mask][i] == INF) continue;
for (int j = 0; j < N; j++) {
if (mask&(1 << j) || mat[i][j] == 0) continue;
int add = cost[mask][j] - mat[i][j];
dp[mask | (1 << j)][j] = min(dp[mask | (1 << j)][j], dp[mask][i] + add);
}
int nmask = mask ^ (1 << i);
int comp = ((1 << N) - 1) ^ mask;
for (int bit = comp; bit > 0; bit = (bit - 1)&comp) {
int add = 0;
for (int j = 0; j < N; j++) {
if (bit&(1 << j)) add += cost[nmask][j];
}
dp[mask | bit][i] = min(dp[mask | bit][i], dp[mask][i] + add);
}
}
}
cout << dp[(1 << N) - 1][N - 1] << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N=15;
int d[N][N],dp[1<<N][N],a[1<<N],n,m,ans,sum;
void chmax(int &a,int b){if(a==-1||a<b)a=b;}
int main()
{
scanf("%d%d",&n,&m);
for(int i=0;i<m;i++)
{
int u,v,w;
scanf("%d%d%d",&u,&v,&w);
u--;
v--;
d[u][v]=d[v][u]=w;
sum+=w;
}
memset(dp,-1,sizeof(dp));
for(int s=0;s<(1<<n);s++)
for(int i=0;i<n;i++)
if(s&(1<<i))
for(int j=i+1;j<n;j++)
if(s&(1<<j))
a[s]+=d[i][j];
dp[1][0]=0;
for(int s=1;s<(1<<n);s++)
{
for(int i=0;i<n;i++)
{
if(dp[s][i]==-1)
continue;
for(int j=0;j<n;j++)
{
if(s&(1<<j))
continue;
if(!d[i][j])
continue;
chmax(dp[s|(1<<j)][j],dp[s][i]+d[i][j]);
}
int k=(((1<<n)-1)^s)|(1<<i);
for(int t=k;t;t=(t-1)&k)
chmax(dp[s|t][i],dp[s][i]+a[t]);
}
}
for(int s=0;s<(1<<n);s++)
ans=max(ans,dp[s][n-1]);
printf("%d\n",sum-ans);
return 0;
} |
#include <bits/stdc++.h>
#define mov(x) (1<<(x))
using namespace std;
template <typename T> void cmin(T &x, const T &y)
{
if(y < x) x = y;
}
template <typename T> void cmax(T &x, const T &y)
{
if(y > x) x = y;
}
template <typename T> void read(T &x)
{
x = 0; char c = getchar(); bool f = 0;
while(!isdigit(c) && c!='-') c = getchar();
if(c == '-') f = 1, c = getchar();
while(isdigit(c)) x = x*10+c-'0', c = getchar();
if(f) x = -x;
}
int n, m, sum;
int grp[mov(15)];
int w[15][15];
int f[mov(15)][15];
int main()
{
read(n), read(m);
memset(w, 0x9f, sizeof(w));
for(int i=1; i<=m; i++)
{
int a, b, c;
read(a), read(b), read(c);
w[a-1][b-1] = c;
w[b-1][a-1] = c;
sum += c;
}
memset(f, 0x9f, sizeof(f));
for(int s=1; s<mov(n); s++)
for(int i=0; i<n; i++)
if(s & mov(i))
for(int j=i+1; j<n; j++)
if(s & mov(j))
if(w[i][j] > 0)
grp[s] += w[i][j];
for(int s=1; s<mov(n); s++)
if(s & 1)
f[s][0] = grp[s];
for(int s=1; s<mov(n); s++)
for(int i=0; i<n; i++)
if(mov(i) & s)
{
int u = ((~s)&(mov(n)-1));
for(int t=u; t; t=((t-1)&u))
for(int j=0; j<n; j++)
if(mov(j) & t)
if(w[i][j] > 0)
cmax(f[s|t][j], f[s][i] + w[i][j] + grp[t]);
}
printf("%d\n", sum-f[mov(n)-1][n-1]);
return 0;
}
|
#include<bits/stdc++.h>
#define N 19
#define M 35009
using namespace std;
int n,m,a[N][N],f[M],g[M][N],dp[M][N];
int main(){
scanf("%d%d",&n,&m);
int i,j,k,x,y,z;
for (i=1; i<=m; i++){
scanf("%d%d%d",&x,&y,&z);
a[x][y]=a[y][x]=z;
f[1<<x-1|1<<y-1]+=z;
}
int tot=1<<n;
for (i=1; i<=n; i++)
for (j=1; j<tot; j++) if (j>>i-1&1) f[j]+=f[j^1<<i-1];
memset(dp,195,sizeof(dp)); memset(g,195,sizeof(g));
int ans=-1000000000;
for (i=1; i<tot; i+=2){
if (!(i>>n-1&1)) dp[i][1]=f[i];
for (j=1; j<=n; j++) if (i>>j-1&1){
for (k=i-1&i; k; k=k-1&i) if (k&1)
dp[i][j]=max(dp[i][j],g[k][j]+f[i^k]);
if (i>>n-1&1){ if (j==n) ans=max(ans,dp[i][j]); continue; }
for (k=1; k<=n; k++) if (!(i>>k-1&1) && a[j][k]>0)
g[i][k]=max(g[i][k],dp[i][j]+a[j][k]);
}
}
printf("%d\n",f[tot-1]-ans);
return 0;
} |
/*********************
* Author: xuziyuan *
*********************/
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define LL long long
#define pii pair <int,int>
#define fi first
#define se second
#define pb push_back
#define mpr make_pair
using namespace std;
const LL MOD=1e9+7;
int n,m,x,y,z,a[20][20],val[40000],dp[40000][20],sum=0;
int main()
{
cin>>n>>m;
rep(i,m)
{
cin>>x>>y>>z;
x--;
y--;
sum+=z;
a[x][y]=a[y][x]=z;
}
rep(i,1<<n) rep(j,n) for(int k=j+1;k<n;k++) if((i&(1<<j))>0&&(i&(1<<k))>0) val[i]+=a[j][k];
rep(i,39995) rep(j,18) dp[i][j]=-1;
rep(i,1<<n) if((i&1)==1) dp[i][0]=val[i];
rep(i,1<<n)
{
rep(j,n)
{
if(dp[i][j]==-1) continue;
int rest=(1<<n)-1-i;
for(int k=rest;k>0;k=(k-1)&rest)
{
rep(p,n)
{
if((k&(1<<p))==0||a[j][p]==0) continue;
dp[i|k][p]=max(dp[i|k][p],dp[i][j]+val[k]+a[j][p]);
}
}
}
}
cout<<sum-dp[(1<<n)-1][n-1]<<endl;
return 0;
} |
#include <iostream>
#include<vector>
#include<cstring>
using namespace std;
int n, m;
vector <int> g[15], c[15];
void add_edge(int u, int v, int w) {
g[u].push_back(v);
c[u].push_back(w);
}
int dp[1 << 15][15];
int prep[1 << 15][15];
void upd(int &x, int y) {
if (y < x) x = y;
}
int main() {
scanf("%d %d", &n, &m);
for (int i = 0; i < m; ++ i) {
int u, v, w;
scanf("%d %d %d", &u, &v, &w);
-- u; -- v;
add_edge(u, v, w);
add_edge(v, u, w);
}
memset(dp, 0x3f, sizeof(dp));
int full = (1 << n) - 1;
for (int msk = 1; msk < (1 << n); ++ msk) {
for (int i = 0; i < n; ++ i) if (!(msk >> i & 1)) {
for (int e = 0; e < g[i].size(); ++ e) {
if (msk >> g[i][e] & 1) prep[msk][i] += c[i][e];
}
}
}
dp[1][0] = 0;
for (int msk = 1; msk < (1 << n); ++ msk) {
for (int u = 0; u < n; ++ u) if (msk >> u & 1) {
for (int e = 0; e < g[u].size(); ++ e) {
int v = g[u][e];
if (!(msk >> v & 1))
upd(dp[msk | 1 << v][v], dp[msk][u] + prep[msk ^ 1 << u][v]);
}
for (int s = full ^ msk; s; s = (s - 1) & (full ^ msk)) {
int cur = 0;
for (int i = 0; i < n; ++ i) if (s >> i & 1)
cur += prep[msk ^ 1 << u][i];
upd(dp[msk | s][u], dp[msk][u] + cur);
}
}
}
printf("%d\n", dp[full][n - 1]);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 16;
int dp[N][1 << N], sum[1 << N], G[N][N];
int main() {
int n, m, res = 0; scanf("%d%d", &n, &m);
for (int i = 1, a, b, c; i <= m; i++)
scanf("%d%d%d", &a, &b, &c), G[a][b] = G[b][a] = c, res += c;
for (int i = 1; i < 1 << n; i++)
for (int j = 1; j <= n; j++) if (i & (1 << j - 1))
for (int k = j + 1; k <= n; k++) if (i & (1 << k - 1))
sum[i] += G[j][k];
memset(dp, -0x3f, sizeof(dp));
for (int s = 1; s < 1 << n; s++) if (s & 1) dp[1][s] = sum[s];
for (int s = 1; s < 1 << n; s++)
for (int i = 1; i < n; i++) if (dp[i][s] >= 0) {
for (int j = 1; j <= n; j++) if (G[i][j] && !(s & (1 << j - 1))) {
int t = (1 << n) - 1; t ^= s, t ^= (1 << j - 1);
for (int t1 = t; ~t1; t1 = (t1 - 1) & t) {
dp[j][s | (1 << j - 1) | t1] = max(dp[j][s | (1 << j - 1) | t1],
dp[i][s] + G[i][j] + sum[t1 | (1 << j - 1)]);
if (!t1) break;
}
}
}
printf("%d\n", res - dp[n][(1 << n) - 1]);
} |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begin(),(c).end()
#define dump(x) cout << #x << " = " << (x) << endl
const int MN = 15;
const int MB = 1 << MN;
const ll inf = -1e9;
int e[MN][MN];
int ct[MB];
int dp[MN][MB];
int main() {
int N, M; cin >> N >> M;
int sum = 0;
rep(i, M) {
int a, b, c;
cin >> a >> b >> c;
--a; --b;
e[a][b] = e[b][a] = c;
sum += c;
}
rep(i, N) rep(j, 1 << N) {
dp[i][j] = inf;
}
rep(j, 1 << N) {
rep(u, N) rep(v, u) {
if (((j >> u) & 1) && ((j >> v) & 1)) {
ct[j] += e[u][v];
}
}
}
rep(j, 1 << N) {
if (j & 1) {
dp[0][j] = ct[j];
}
}
rep(j, 1 << N) {
for (int k = j; k > 0; k = (k - 1) & j) {
rep(i, N) if (((j ^ k) >> i) & 1) {
rep(p, N) if (((k >> p) & 1) && dp[p][k] != inf && e[p][i] > 0) {
dp[i][j] = max(dp[i][j], dp[p][k] + ct[j ^ k] + e[p][i]);
}
}
}
}
int ans = sum - dp[N-1][(1 << N) - 1];
cout << ans << endl;
return 0;
} |
#include<bits/stdc++.h>
#define ll long long
#define N 20
#define inf 1e9
#define rep(i,j,k) for(ll i=j;i<=k;++i)
using namespace std;
inline ll read(){
ll x=0,f=0;char ch=getchar();
for(;ch<'0'||ch>'9';ch=getchar()) if(ch=='-') f=1;
for(;ch>='0'&&ch<='9';ch=getchar()) x=(x<<1)+(x<<3)+ch-48;
return f?-x:x;
}
ll n,m,G[N][N],f[1<<N][N],s[1<<N],sum;
int main(){
n=read();m=read();
rep(i,1,m){
ll x=read()-1,y=read()-1;
G[x][y]=G[y][x]=read(); sum+=G[x][y];
}
rep(i,0,1<<n) rep(j,0,n) if((i>>j)&1)
rep(k,j+1,n) if((i>>k)&1) s[i]+=G[j][k];
rep(i,0,1<<n) rep(j,0,n) f[i][j]=-inf;
rep(i,0,1<<n) if(i&1) f[i][0]=s[i];
rep(i,0,1<<n) rep(j,0,n) if((i>>j)&1)
for(ll k=i;k;k=(k-1)&i) if(k&1)
rep(l,0,n) if(((k>>l)&1)&&((~k>>j)&1)&&G[l][j])
f[i][j]=max(f[i][j],f[k][l]+G[l][j]+s[i^k]);
printf("%d\n",sum-f[(1<<n)-1][n-1]);
return 0;
} |
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
int n, m, map[16][16];
ll in[1 << 16], f[1 << 16][16];
int main()
{
scanf("%d%d", &n, &m);
int x, y;
for (int i = 1; i <= m; i++)
{
scanf("%d%d", &x, &y);
x--, y--;
scanf("%d", &map[x][y]);
map[y][x] = map[x][y];
}
for (int i = 0; i < (1 << n); i++)
for (int j = 0; j < n; j++)
if (i & (1 << j))
for (int k = j + 1; k < n; k++)
if (i & (1 << k))
in[i] += map[j][k];
memset(f, -0x3f, sizeof(f));
f[1][0] = 0;
for (int i = 1; i < (1 << n); i++)
for (int j = 0; j < n; j++)
if (i & (1 << j))
{
int x = i ^ (1 << j);
for (int k = 0; k < n; k++)
if (i & (1 << k) && map[k][j])
f[i][j] = max(f[i][j], f[x][k] + map[k][j]);
for (int k = x; k; k = (k - 1) & x)
f[i][j] = max(f[i][j], f[i ^ k][j] + in[1 << j ^ k]);
}
printf("%lld\n", in[(1 << n) - 1] - f[(1 << n) - 1][n - 1]);
} |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<map>
#include<queue>
using namespace std;
typedef long long ll;
const int INF=~0u>>2;
int n,m,sum[1<<15],dp[1<<15][15],G[15][15];
int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return f*x;
}
int cost(int x,int y){return sum[x|y]-sum[x]-sum[y];}
int main(){
// freopen("ex.in","r",stdin);
n=read();m=read();
for(int i=1;i<=m;++i){
int x=read(),y=read(),z=read();
x--;y--;
G[x][y]=G[y][x]=z;
}
for(int i=1;i<(1<<n);++i){
for(int j=0;j<n;++j) if(i&(1<<j)){
for(int k=j+1;k<n;++k) if(i&(1<<k)) sum[i]+=G[j][k];
}
}
for(int i=1;i<(1<<n);++i) for(int j=0;j<n;++j) dp[i][j]=INF;
dp[1][0]=0;
for(int i=1;i<(1<<n);++i){
for(int j=0;j<n;++j) if(dp[i][j]!=INF){
for(int k=0;k<n;++k) if(!(i&(1<<k))&&G[j][k]) dp[i|(1<<k)][k]=min(dp[i|(1<<k)][k],dp[i][j]+cost(i^(1<<j),1<<k));
for(int k=((1<<n)-1)&(~i);k>0;k=(k-1)&(~i)) dp[i|k][j]=min(dp[i|k][j],dp[i][j]+cost(i^(1<<j),k));
}
}
printf("%d",dp[(1<<n)-1][n-1]);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int nth_bit(int64_t num, int n){
return (num >> n) & 1;
}
int N, M;
int edges[15][15];
int gain[1<<15];
int dp[15][1<<15];
bool visited[15][1<<15];
const int INF = 1e9;
int rec(int start, int bits){
if(bits == 0){
return start == N-1 ? 0 : -INF;
}
if(visited[start][bits]) return dp[start][bits];
int mx = -INF;
for(int i=0; i<N; i++){
if(nth_bit(bits, i) && edges[start][i]){
mx = max(mx, rec(i, bits - (1<<i)) + edges[start][i]);
}
}
for(int bits2=bits; bits2>0; bits2=(bits2-1)&bits){
mx = max(mx, rec(start, bits - bits2) + gain[bits2 + (1<<start)]);
}
dp[start][bits] = mx;
visited[start][bits] = true;
return mx;
}
int main(){
cin >> N >> M;
for(int i=0; i<M; i++){
int a, b, c;
cin >> a >> b >> c;
a--; b--;
edges[a][b] = c;
edges[b][a] = c;
for(int bits=0; bits<(1<<N); bits++){
if(nth_bit(bits, a) && nth_bit(bits, b)) gain[bits] += c;
}
}
cout << gain[(1<<N)-1] - rec(0, (1<<N)-2) << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int md=1e9+7;
int n,m,f[33005][20],c[33005][20],d[20][20];
vector<pair<int,int> >g[20];
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++)
{
int u,v,w;
scanf("%d%d%d",&u,&v,&w);u--;v--;
d[u][v]=d[v][u]=w;
}
for(int msk=0;msk<(1<<n);msk++)for(int i=0;i<n;i++)
{
f[msk][i]=1e9+7;
for(int j=0;j<n;j++)if(msk&(1<<j))c[msk][i]+=d[i][j];
}
f[1][0]=0;
for(int msk=0;msk<(1<<n);msk++)
{
for(int i=0;i<n;i++)if(msk&(1<<i)&&f[msk][i]!=1e9+7)
{
for(int j=0;j<n;j++)
{
if(!(msk&(1<<j))&&d[i][j])
{
f[msk|(1<<j)][j]=min(f[msk|(1<<j)][j],f[msk][i]+c[msk][j]-d[i][j]);
}
}
int nxt=msk^(1<<i),st=((1<<n)-1)^msk,s;
for(int j=st;j>0;j=(j-1)&st)
{
s=0;
for(int l=0;l<n;l++)if(j&(1<<l))s+=c[nxt][l];
f[msk|j][i]=min(f[msk|j][i],f[msk][i]+s);
}
}
}
printf("%d\n",f[(1<<n)-1][n-1]);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int maxn=100010,mod=998244353;
#define lson o<<1,l,mid
#define rson o<<1|1,mid+1,r
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define ROF(i,a,b) for(int i=(a);i>=(b);i--)
#define MEM(x,v) memset(x,v,sizeof(x))
inline int read(){
int x=0,f=0;char ch=getchar();
while(ch<'0' || ch>'9') f|=ch=='-',ch=getchar();
while(ch>='0' && ch<='9') x=x*10+ch-'0',ch=getchar();
return f?-x:x;
}
int n,m,lim,wsum,e[15][15],f[1<<15][15],tot[1<<15];
inline void chkmax(int &x,int y){if(x<y) x=y;}
int main(){
n=read();m=read();lim=1<<n;
FOR(i,1,m){
int u=read()-1,v=read()-1;
wsum+=e[u][v]=e[v][u]=read();
}
FOR(i,0,lim-1) FOR(j,0,n-1) if((i>>j)&1) FOR(k,j+1,n-1) if((i>>k)&1) tot[i]+=e[j][k];
MEM(f,~0x3f);
f[1][0]=0;
FOR(i,1,lim-1) FOR(j,0,n-1) if((i>>j)&1){
FOR(k,0,n-1) if(!((i>>k)&1) && e[j][k]) chkmax(f[i|(1<<k)][k],f[i][j]+e[j][k]);
int re=(lim-1)^i;
for(int k=re;k;k=((k-1)&re)) chkmax(f[i|k][j],f[i][j]+tot[k|(1<<j)]);
}
printf("%d\n",wsum-f[lim-1][n-1]);
} |
#include<bits/stdc++.h>
using namespace std;
int N,M;
int G[15][15];
int dp[15][(1<<15)];
int INF=2e9;
int calc(int bit,int nbit){
int sum=0;
for(int i=0;i<N;i++)
if(nbit>>i&1)
for(int j=0;j<N;j++)
if(~bit>>j&1)
if(~nbit>>j&1)
sum+=G[i][j];
return sum;
}
int rec(int pos,int bit){
static unordered_map< int , int > mem[15];
if( mem[pos].count(bit) )return mem[pos][bit];
if(pos==N-1)return 0;
int res=INF;
int sup=(1<<(N-1))-1-bit;
int nbit=sup;
while(1){
if(nbit>>pos&1){
int cost=calc(bit,nbit);
for(int to=0;to<N;to++){
if(bit>>to&1)continue;
if(nbit>>to&1)continue;
if(G[pos][to]==0)continue;
res=min(res, rec(to,bit|nbit) + cost - G[pos][to]);
}
}
nbit--;
nbit&=sup;
if(nbit==0)break;
}
return mem[pos][bit]=res;
}
int main(){
cin>>N>>M;
for(int i=0;i<M;i++){
int a,b,c;
cin>>a>>b>>c;
a--,b--;
G[a][b]=G[b][a]=c;
}
cout<< rec(0,0) <<endl;
return 0;
}
|
#include<bits/stdc++.h>
#define N 17
using namespace std;
int n,m;
int mp[N][N],sum[1<<15],f[1<<15][N];
int main()
{
scanf("%d%d",&n,&m);int t1,t2,t3;
for(int i=1;i<=m;i++)
{
scanf("%d%d%d",&t1,&t2,&t3);
mp[t1][t2]=mp[t2][t1]=t3;
}
for(int i=0;i<1<<n;i++)
{
for(int j=1;j<=n;j++)
{
if(i&(1<<(j-1)))
{
for(int k=j+1;k<=n;k++)
{
if(i&(1<<(k-1)))
{
sum[i]+=mp[j][k];
}
}
}
}
}
memset(f,0xcf,sizeof(f));
for(int i=1;i<1<<n;i++)if(i&1)f[i][1]=sum[i];
for(int i=1;i<1<<n;i++)
{
for(int k=1;k<=n;k++)
{
if(i&(1<<(k-1)))
{
for(int j=(i-1)&i;j;j=(j-1)&i)
{
if(j&(1<<(k-1)))continue;
for(int l=1;l<=n;l++)
{
if((j&(1<<(l-1)))&&mp[l][k])
{
f[i][k]=max(f[i][k],f[j][l]+mp[l][k]+sum[i^j]);
}
}
}
}
}
}
printf("%d\n",sum[(1<<n)-1]-f[(1<<n)-1][n]);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int n,m,u,v,w;
ll bismarck[(1<<15)][15],e[15][15],sum[(1<<15)];
int main()
{
cin>>n>>m;
while(m--)
{
cin>>u>>v>>w;
u--,v--;
e[u][v]=e[v][u]=w;
}
for(int i=0;i<1<<n;i++)
{
for(int j=0;j<n;j++){
if((i>>j)&1)
{
for(int k=j+1;k<n;k++)
if((i>>k)&1) sum[i]+=e[j][k];
}
bismarck[i][j]=-1e18;}
}
bismarck[1][0]=0;
for(int i=1;i<(1<<n);i++)
{
for(int j=0;j<n;j++)
if((i>>j)&1)
{
int l=i^(1<<j);
for(int k=0;k<n;k++)
if((i>>k)&1&&e[j][k]) bismarck[i][j]=max(bismarck[i][j],bismarck[l][k]+e[k][j]);
for(int k=l;k>0;k=(k-1)&l) bismarck[i][j]=max(bismarck[i][j],bismarck[i^k][j]+sum[k^(1<<j)]);
}
}
cout<<sum[(1<<n)-1]-bismarck[(1<<n)-1][n-1];
} |
#include <algorithm>
#include <cstdio>
int a[15][15],f[1<<15][15],g[1<<15];
int main(){
int n,m,sum=0;
scanf("%d%d\n",&n,&m);
for (int i=1;i<=m;i++){
int x,y,z;
scanf("%d%d%d\n",&x,&y,&z);
x--;y--;sum+=z;
a[x][y]=a[y][x]=z;
}
int L=1<<n;
for (int i=0;i<L;i++){
for (int j=0;j<n;j++) f[i][j]=-1e9;
for (int j=0;j<n;j++)
if ((i>>j)&1){
g[i]=g[1<<j^i];
for (int k=j+1;k<n;k++)
if ((i>>k)&1) g[i]+=a[j][k];
break;
}
}
f[1][0]=0;
for (int i=1;i<L;i++)
for (int j=0;j<n;j++)
if ((i>>j)&1){
int x=1<<j^i;
for (int k=0;k<n;k++)
if ((i>>k)&1 && a[k][j]) f[i][j]=std::max(f[i][j],f[x][k]+a[k][j]);
for (int k=x;k;k=(k-1)&x)
f[i][j]=std::max(f[i][j],f[i^k][j]+g[1<<j^k]);
}
printf("%d\n",sum-f[L-1][n-1]);
} |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
typedef long long LL;
LL e[25][25] = {0};
LL W[1 << 16] = {0};
LL dp[1 << 16][25] = {0};
LL n,m,tot = 0;
int main(){
cin >> n >> m;
for(LL i = 1;i <= m;i ++){
LL u,v,w;
cin >> u >> v >> w;
e[u][v] = w;
e[v][u] = w;
tot += w;
}
for(LL S = 0;S < (1LL << n);S ++){
for(LL i = 1;i <= n;i ++){
for(LL j = i + 1;j <= n;j ++){
if(((S >> (i - 1)) & 1) && ((S >> (j - 1)) & 1)) W[S] += e[i][j];
}
}
}
memset(dp,-0x3f,sizeof(dp));
dp[1][1] = 0;
for(LL S = 0;S < (1LL << n);S ++){
for(LL u = 1;u <= n;u ++){
if(!((S >> (u - 1)) & 1)) continue;
for(LL v = 1;v <= n;v ++){
if((S >> (v - 1)) & 1) continue;
if(!e[u][v]) continue;
dp[S | (1 << (v - 1))][v] = max(dp[S | (1 << (v - 1))][v],dp[S][u] + e[u][v]);
}
LL U = ((1LL << n) - 1) ^ S;
for(LL T = U;T;T = (U & (T - 1))){
dp[S | T][u] = max(dp[S | T][u],dp[S][u] + W[T | (1 << (u - 1))]);
}
}
}
cout << tot - dp[(1LL << n) - 1][n] << endl;
return 0;
} |
#include<bits/stdc++.h>
#define maxn 100005
#define ll long long
using namespace std;
int n,m;
int g[16][16];
int block[1<<15],f[1<<15][16];
int main()
{
scanf("%d%d",&n,&m);
int u,v,w,sum=0;
for(int i=1;i<=m;i++)
{
scanf("%d%d%d",&u,&v,&w);
sum+=w;g[u][v]=g[v][u]=w;
}
for(int s=0;s<(1<<n);s++)
{
for(int j=1;j<=n;j++)
{
if((!(s>>(j-1))&1)&&block[s|(1<<(j-1))]==0)
{
block[s|(1<<(j-1))]=block[s];
for(int k=1;k<=n;k++)
{
if((s>>(k-1))&1)
block[s|(1<<(j-1))]+=g[j][k];
}
}
}
}
memset(f,-1,sizeof(f));
f[1][1]=0;
for(int s=0;s<(1<<n);s++)
{
for(int j=1;j<=n;j++)
{
if(f[s][j]!=-1&&((s>>(j-1))&1))
{
for(int k=1;k<=n;k++)
{
if(!((s>>(k-1))&1)&&g[j][k])
f[s|(1<<(k-1))][k]=max(f[s|(1<<(k-1))][k],f[s][j]+g[j][k]);
}
int ss=(((1<<n)-1)^s)|(1<<(j-1));
for(int k=ss;k;k=(k-1)&ss)
{
if((k>>(j-1))&1)
f[s|k][j]=max(f[s|k][j],f[s][j]+block[k]);
}
}
}
}
printf("%d\n",sum-f[(1<<n)-1][n]);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int n,m,sum=0,f[40010][20],b[40010],dis[20][20];
int main()
{
scanf("%d%d",&n,&m);
for (int i=1;i<=m;i++)
{
int xx,yy,zz;
scanf("%d%d%d",&xx,&yy,&zz);
dis[xx][yy]=zz;
dis[yy][xx]=zz;
sum+=zz;
}
for (int i=1;i<(1<<n);i++)
for (int j=1;j<=n;j++)
if (i>>(j-1)&1)
for (int k=j+1;k<=n;k++)
if ((i>>(k-1))&1) b[i]+=dis[j][k];
memset(f,-10,sizeof(f));
f[1][1]=0;
int N=(1<<n)-1;
for (int i=1;i<=N;i++)
for (int j=1;j<=n;j++)
if ((i>>(j-1))&1)
{
for (int k=1;k<=n;k++)
if (!((i>>(k-1))&1)&&dis[j][k]) f[i|(1<<(k-1))][k]=max(f[i|(1<<(k-1))][k],f[i][j]+dis[j][k]);
for (int k=N^i;k;k=(k-1)&(N^i))
f[i|k][j]=max(f[i|k][j],f[i][j]+b[k|(1<<(j-1))]);
}
cout<<sum-f[N][n];
} |
#include <cstdio>
#define bin(x) (1<<(x))
#define b(x) (1<<(x)>>1)
inline void cmax(int&x, const int y) {x < y && (x = y);}
const int N = 17, M = 40100;
int f[N][M], g[M];
int mp[N][N];
int n, m;
int main() {
scanf("%d%d",&n,&m); int Ans = 0;
for(int i=1,x,y,z;i<=m;++i) {
scanf("%d%d%d",&x,&y,&z), Ans += z;
mp[x][y] = mp[y][x] = z;
}
for(int s=0;s<bin(n);++s) {
int&v = g[s];
for(int i=1;i<=n;++i) if(s & b(i))
for(int j=i+1;j<=n;++j) if(s & b(j)) v += mp[i][j];
}
for(int i=1;i<=n;++i)
for(int j=0;j<bin(n);++j)
f[i][j] = -1;
f[1][1] = 0;
for(int S=1;S<bin(n);++S)
for(int i=1;i<=n;++i) if((S & b(i)) and ~f[i][S]) {
for(int j=1;j<=n;++j) if((~S & b(j)) and mp[i][j]) cmax(f[j][S|b(j)], f[i][S] + mp[i][j]);
for(int iS=(bin(n)-1)^S, s = iS; s; s = (s-1) & iS)
cmax(f[i][S|s], f[i][S] + g[s|b(i)]);
}
printf("%d\n", Ans - f[n][bin(n)-1]);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=15;
const int maxa=1<<15;
const int inf=0x3f3f3f3f;
int n,m,f[maxn][maxa],g[maxa],e[maxn][maxn];
int main()
{
scanf("%d%d",&n,&m);
int x,y,w,sum=0;
for(int i=0;i<m;i++)
scanf("%d%d%d",&x,&y,&w),x--,y--,e[x][y]=e[y][x]=w,sum+=w;
memset(g,inf,sizeof(g));
g[0]=0;
for(int i=0;i<n;i++)
for(int j=0;j<(1<<n);j++)
if(g[j]!=inf && !(j&(1<<i)))
{
int val=0;
for(int k=0;k<n;k++)
if(j&(1<<k)) val+=e[i][k];
g[j|(1<<i)]=g[j]+val;
}
memset(f,-1,sizeof(f));
for(int i=0;i<(1<<n);i++)
if(i&1) f[0][i]=g[i];
for(int i=1;i<(1<<n);i++)
for(int j=0;j<n;j++)
if(i&(1<<j) && f[j][i]!=-1)
for(int k=i^((1<<n)-1),t=k;k>=0;k=k?(k-1)&t:-1)
for(int l=0;l<n;l++)
if(!(i&(1<<l)) && (k&(1<<l)) && e[j][l])
f[l][i|k]=max(f[l][i|k],f[j][i]+g[k]+e[j][l]);
printf("%d\n",sum-f[n-1][(1<<n)-1]);
return 0;
} |
#include<cstdio>
#include<algorithm>
using namespace std;
int D[1 << 15][15], S[1 << 15];
int w[15][15], n, m, sum;
int main() {
int i, a, b, c, j, k, l;
scanf("%d%d", &n, &m);
for (i = 0; i < m; i++) {
scanf("%d%d%d", &a, &b, &c);
a--, b--;
w[a][b] = w[b][a] = c;
sum += c;
for (j = 0; j < (1 << n); j++) {
if (((~j)&((1 << a) | (1 << b))) == 0)S[j] += c;
}
}
for (i = 0; i < (1 << n); i++) {
for (j = 0; j < n; j++)D[i][j] = -1e9;
if (i & 1) D[i][0] = S[i];
}
for (i = 0; i < (1 << n); i++) {
for (j = 0; j < n; j++) {
if (D[i][j] < 0)continue;
int b = (1 << n) - i - 1;
for (k = b;k; k = (k - 1)&b) {
for (l = 0; l < n; l++) {
if (w[j][l] && ((k >> l) & 1) ){
D[i | k][l] = max(D[i | k][l], D[i][j] + S[k] + w[j][l]);
}
}
}
}
}
printf("%d\n", sum - D[(1 << n) - 1][n - 1]);
} |
#include<bits/stdc++.h>
#define N 18
using namespace std;
int dis[N][N];
int n,m;
int tot[(1<<15)+3];
int dp[(1<<15)+3][N];
int main(){
scanf("%d%d",&n,&m);
for(int i=1,f,t,d;i<=m;i++){
scanf("%d%d%d",&f,&t,&d);
dis[f-1][t-1]=dis[t-1][f-1]=d;
}
for(int i=1;i<(1<<n);i++){
int pos=-1,aim=i-(i&(-i));
for(int j=0;j<n;j++)
if((i&(-i))>>j == 1){
pos=j;break;
}
if(pos!=-1){
tot[i]=tot[aim];
for(int j=0;j<n;j++)
if(aim&(1<<j)) tot[i]+=dis[pos][j];
}
}
memset(dp,0xc0,sizeof(dp));
for(int i=1;i<(1<<n);i+=2)
dp[i][0]=tot[i];
for(int i=1;i<(1<<n);i++)
for(int j=0;j<n;j++)
if(i&(1<<j)&&dp[i][j]!=dp[0][0]){
for(int k=0;k<n;k++)
if((i&(1<<k)) == 0&&dis[j][k] != 0){
for(int mask=((1<<n)-1)^(i|(1<<k)),v=mask;;v=(v-1)&mask){
dp[i|(1<<k)|v][k]=max(dp[i|(1<<k)|v][k],dp[i][j]+dis[j][k]+tot[v|(1<<k)]);
if(v==0) break;
}
}
}
int ans=-1e9;
for(int i=(1<<(n-1));i<(1<<n);i++) ans=max(ans,dp[i][n-1]);
cout<<tot[(1<<n)-1]-ans<<endl;
return 0;
} |
#define _GLIBCXX_IOSTREAM
#include<bits/stdc++.h>
#define inf 1000000007
using namespace std;
int f[1<<15],dp[1<<15][15],tot,c[15][15],n,m;
int main(){
scanf("%d%d",&n,&m);
for(int i=0;i<n;++i)
for(int j=0;j<n;++j)
c[i][j]=(i==j?0:-inf);
for(int i=1,u,v;i<=m;++i)
scanf("%d%d",&u,&v),scanf("%d",&c[--u][--v]),tot+=(c[v][u]=c[u][v]);
for(int i=0;i<(1<<n);++i)
for(int j=0;j<n;++j)if(i>>j&1)
for(int k=j;k<n;++k)if(i>>k&1)if(c[j][k]!=-inf)
f[i]=max(-inf,f[i]+c[j][k]);
for(int i=0;i<(1<<n);++i)
for(int j=0;j<n;++j)
dp[i][j]=-inf;
dp[1][0]=0;
for(int i=1;i<(1<<n);++i)
for(int j=0;j<n;++j)if(dp[i][j]!=-inf){
int nk=(((1<<n)-1)^i)|(1<<j);
for(int k=nk;k;k=(k-1)&nk)if(k>>j&1)
dp[i|k][j]=max(dp[i|k][j],dp[i][j]+f[k]);
for(int k=0;k<n;++k)if(~i>>k&1)
dp[i|(1<<k)][k]=max(dp[i|(1<<k)][k],dp[i][j]+c[j][k]);//,printf("{%d->%d}",j,k);
// printf("dp[%d][%d]=%d\n",i,j,dp[i][j]);
}
int ans=0;
for(int i=1;i<(1<<n);++i)ans=max(ans,dp[i][n-1]);
printf("%d",tot-ans);
} |
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<iostream>
#define N 20
#define M (1<<15)+10
#define lowbit(x) (x&(-x))
using namespace std;
int f[M][N],g[M][N],h[M],a[N][N],bit[M],n,m,tot,ans;
void upd(int &x,int y)
{
if(y>x) x=y;
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++)
{
int x,y,d;scanf("%d%d%d",&x,&y,&d);
tot+=d;
a[x][y]=a[y][x]=d;
}
for(int i=1;i<=n;i++) bit[1<<(i-1)]=i;
memset(f,-1,sizeof(f));
memset(g,-1,sizeof(g));
int ss=1<<n;
for(int i=1;i<ss;i++)
{
int j=bit[lowbit(i)];
h[i]=h[i-lowbit(i)];
for(int k=1;k<=n;k++) if(j!=k && (i&(1<<(k-1)))) h[i]+=a[j][k];
}
f[1][1]=0;
for(int i=0;i<ss;i++)
for(int j=1;j<=n;j++)
{
upd(g[i][j],f[i][j]);
if(f[i][j]!=-1)
{
int t=ss-1-i;
for(int k=t;k;k=(k-1)&t)
upd(g[i+k][j],f[i][j]+h[k+(1<<(j-1))]);
}
if(g[i][j]!=-1)
{
for(int k=1;k<=n;k++)
{
if((i&(1<<(k-1))) || a[j][k]==0) continue;
upd(f[i+(1<<(k-1))][k],g[i][j]+a[j][k]);
}
}
}
ans=max(f[ss-1][n],g[ss-1][n]);
printf("%d\n",tot-ans);
return 0;
} |
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
#define ll long long
inline int read()
{
int x;char c;
while((c=getchar())<'0'||c>'9');
for(x=c-'0';(c=getchar())>='0'&&c<='9';)x=x*10+c-'0';
return x;
}
#define MN 15
int g[MN+5][MN+5],F[1<<MN][MN+5];
ll f[1<<MN][MN+5];
vector<int> v[1<<MN];
inline void rw(ll&a,ll b){if(b>a)a=b;}
int main()
{
int n,m,i,j,k,x,y,s=0;
n=read();m=read();
while(m--)x=read(),y=read(),s+=g[x][y]=g[y][x]=read();
for(i=1;i<1<<n;++i)for(j=1;j<=n;++j)if(i&(1<<j-1))
{
v[i].push_back(j);
i^=1<<j-1;
for(x=0;x<v[i].size();++x)
{
F[i^(1<<j-1)][j]+=g[v[i][x]][j];
for(y=0;y<x;++y)F[i^(1<<j-1)][j]+=g[v[i][x]][v[i][y]];
}
i^=1<<j-1;
}
memset(f,200,sizeof(f));
for(i=1;i<1<<n;++i)if(i&1)f[i][1]=F[i][1];
for(i=1;i<1<<n;++i)for(j=0;j<v[i].size();++j)
for(x=i^(1<<v[i][j]-1);x&=i^(1<<v[i][j]-1);--x)
for(y=0;y<v[x].size();++y)if(g[v[i][j]][v[x][y]])
rw(f[i][v[i][j]],f[x][v[x][y]]+g[v[i][j]][v[x][y]]+F[i^x][v[i][j]]);
printf("%d",s-f[(1<<n)-1][n]);
} |
#include<bits/stdc++.h>
using namespace std;
int read()
{
int x=0,f=1; char ch=getchar();
while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=getchar();}
while(ch>='0'&&ch<='9') {x=(x<<3)+(x<<1)+(ch^48); ch=getchar();}
return x*f;
}
int n,m,x,y,z;
int dis[20][20];
int tag[100050],s[100050];
int f[100050][20],sum,ans;
int main()
{
n=read(); m=read(); tag[0]=-1;
memset(f,-1,sizeof(f)); f[1][0]=0;
while(m--)
{
x=read()-1; y=read()-1; z=read();
dis[x][y]=dis[y][x]=z; sum+=z;
}
for(int i=1;i<(1<<n);++i)
{
x=tag[i]=tag[i>>1]+1; s[i]=s[i^(1<<x)];
for(y=0;y<x;++y)
if(i&(1<<y)) s[i]+=dis[x][y];
}
for(int i=1;i<(1<<n);++i)
for(int j=0;j<n;++j)
{
if(f[i][j]==-1) continue;
for(int k=0;k<n;++k)
if(dis[j][k]&&!(i&(1<<k)))
f[i|(1<<k)][k]=max(f[i|(1<<k)][k],f[i][j]+dis[j][k]);
int t=((1<<n)-1)^i^(1<<j);
for(int k=t;k;k=(k-1)&t)
f[i|k][j]=max(f[i|k][j],f[i][j]+s[k]);
}
for(int i=0;i<(1<<n);++i)
ans=max(ans,f[i][n-1]);
printf("%d",sum-ans);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define N 15
int n,m,sum,d[N][1<<N],e[1<<N],f[1<<N][N];
void upd(int &x,int y){x=max(x,y);}
int read(){
int x=0,f=1;char ch=getchar();
for (;!isdigit(ch);ch=getchar()) if (ch=='-') f=-f;
for (;isdigit(ch);ch=getchar()) x=x*10+ch-'0';
return x*f;
}
int main(){
n=read();m=read();
for (int i=1;i<=m;i++){
int x=read()-1,y=read()-1;
d[x][1<<y]=d[y][1<<x]=read();
sum+=d[x][1<<y];
}
for (int i=0;i<n;i++)
for (int j=1;j<(1<<n);j++)
d[i][j]=d[i][j&-j]+d[i][j-(j&-j)];
for (int i=0;i<(1<<n);i++)
for (int j=0;j<n;j++)
if (i&(1<<j))
e[i]=e[i-(1<<j)]+d[j][i-(1<<j)];
memset(f,0x80,sizeof(f));f[1][0]=0;
for (int i=1;i<(1<<n);i++)
for (int j=0;j<n;j++)
if (f[i][j]!=-1){
for (int k=0;k<n;k++)
if ((i&(1<<k))==0&&d[j][1<<k])
upd(f[i+(1<<k)][k],f[i][j]+d[j][1<<k]);
for (int s=(1<<n)-1-i,k=s;k;k=(k-1)&s)
upd(f[i+k][j],f[i][j]+e[k+(1<<j)]);
}
printf("%d\n",sum-f[(1<<n)-1][n-1]);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int dp[1<<15][15];
int g[15][15];
int dis[1<<15];
int n,m,ans=0x3f3f3f3f,sum;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n>>m;
for(int i=0;i<m;i++){
int a,b,c;
cin>>a>>b>>c;a--;b--;
g[a][b]=g[b][a]=c;
sum+=c;
}
for(int s=0;s<1<<n;s++){
for(int i=0;i<n;i++)if(s>>i&1){
for(int j=i+1;j<n;j++)if(s>>j&1){
dis[s]+=g[i][j];
}
}
}
memset(dp,0x3f,sizeof(dp));
dp[1][0]=sum;
for(int s=0;s<1<<n;s++){
for(int i=0;i<n;i++){
for(int j=0;j<n;j++)if(!(s>>j&1)&&g[i][j]){
dp[s|(1<<j)][j]=min(dp[s|(1<<j)][j],dp[s][i]-g[i][j]);
}
int rs=(s^((1<<n)-1))|(1<<i);
for(int j=rs;j;j=rs&(j-1)){
dp[s|j][i]=min(dp[s|j][i],dp[s][i]-dis[j]);
}
}
}
for(int s=0;s<1<<n;s++){
ans=min(ans,dp[s][n-1]);
}
cout<<ans<<endl;
return 0;
} |
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <math.h>
#define rep(i,st,ed) for (int i=st;i<=ed;++i)
#define fill(x,t) memset(x,t,sizeof(x))
#define lb(x) (x&-x)
#define get(x) ((int)log2(x))
const int N=200005;
int r[25][N],f[25][N],sum[N];
int v[25][25];
int read() {
int x=0,v=1; char ch=getchar();
for (;ch<'0'||ch>'9';v=(ch=='-')?(-1):v,ch=getchar());
for (;ch<='9'&&ch>='0';x=x*10+ch-'0',ch=getchar());
return x*v;
}
void upd(int &x,int v) {
(x<v)?(x=v):0;
}
int main(void) {
int n=read(),m=read();
int prt=0;
rep(i,1,m) {
int x=read()-1,y=read()-1;
v[x][y]=v[y][x]=read(),prt+=v[x][y];
r[x][1<<y]=v[x][y];
r[y][1<<x]=v[x][y];
}
rep(i,0,n-1) {
for (int S=0;S<(1<<n);++S) {
r[i][S]=r[i][S-lb(S)]+r[i][lb(S)];
}
}
for (int S=1;S<(1<<n);++S) {
sum[S]=sum[S-lb(S)]+r[get(lb(S))][S-lb(S)];
}
fill(f,-63); f[0][1]=0;
int ans=0;
for (int S=1;S<(1<<n);++S) {
rep(i,0,n-1) {
// if (!((S>>i))&1) continue;
// if (!(S&1)) continue;
for (int T=S;T;T=(T-1)&S) {
if (T>>i&1) upd(f[i][S],f[i][S-T+(1<<i)]+sum[T]);
}
rep(j,0,n-1) if (!(S>>j&1)&&v[i][j]) {
upd(f[j][S+(1<<j)],f[i][S]+v[i][j]);
}
}
if ((S&1)&&(S>>(n-1)&1)) upd(ans,f[n-1][S]);
}
printf("%d\n", prt-ans);
return 0;
} |
#include <bits/stdc++.h>
const int dx[4]={-1,1,0,0},dy[4]={0,0,-1,1};
typedef long long ll;
const int N=20;
const ll inf=1ll<<60;
int n,m,g[N][N],ST;
int dp[40000][N],sum[40000];
using namespace std;
/*struct node
{
int t,next;
}adj[N<<1];
void add(int s,int t)
{
adj[++now]=(node){t,head[s]};
head[s]=now;
}*/
inline int read()
{
char c;int x;
while (c=getchar(),c<'0' || c>'9');x=c^'0';
while (c=getchar(),c>='0' && c<='9') x=(x<<1)+(x<<3)+(c^'0');
return x;
}
void write(int x)
{
if (x==0) return;
write(x/10);
putchar((x%10)+'0');
}
void upd(int& x,int y){if (x==-1) x=y;else x=max(x,y);}
int main()
{
#ifdef Kay
freopen ("code.in","r",stdin);
freopen ("code.out","w",stdout);
#endif
cin>>n>>m;
int i,s,t,w,j,k,l,tot=0;
for (i=1;i<=m;i++)
cin>>s>>t>>w,g[s][t]=g[t][s]=w,tot+=w;
ST=1<<n;
memset(dp,-1,sizeof(dp));
for (i=1;i<ST;i++)
for (s=1;s<=n;s++)
if ((i>>(s-1))&1)
for (t=s+1;t<=n;t++)
if ((i>>(t-1))&1) sum[i]+=g[s][t];
for (i=0;i<ST;i++)
if ((i&1)) dp[i][1]=sum[i];
for (i=1;i<ST;i++)
for (j=1;j<=n;j++)
if (dp[i][j]!=-1)
{
int x=(i^(ST-1));
for (k=x;k;k=(k-1)&x)
for (l=1;l<=n;l++)
if (((k>>(l-1))&1) && g[j][l]) upd(dp[k|i][l],dp[i][j]+sum[k]+g[j][l]);
}
printf ("%d",tot-dp[ST-1][n]);
return 0;
}
|
#include<bits/stdc++.h>
#define N 16
#define oo (1<<29)
using namespace std;
int n,m,G[N][N],f[1<<N][N],S[1<<N],sum;
int main()
{
int i,j,k,l,x,y,z;
scanf("%d %d",&n,&m);
for(i=1;i<=m;i++){
scanf("%d %d %d",&x,&y,&z);
x--,y--,G[x][y]=G[y][x]=z,sum+=z;
}
for(i=0;i<(1<<n);i++)
for(j=0;j<n;j++)
if((i>>j)&1)
for(k=j+1;k<n;k++)
if((i>>k)&1)
S[i]+=G[j][k];
for(i=0;i<(1<<n);i++)
for(j=0;j<n;j++) f[i][j]=-oo;
for(i=0;i<(1<<n);i++)
if(i&1) f[i][0]=S[i];
for(i=1;i<(1<<n);i++)
for(j=0;j<n;j++)
if((i>>j)&1)
for(k=i;k;k=(k-1)&i)
if(k&1)
for(l=0;l<n;l++)
if(((k>>l)&1)&&((~k>>j)&1)&&G[l][j])
f[i][j]=max(f[i][j],f[k][l]+G[l][j]+S[i^k]);
cout<<sum-f[(1<<n)-1][n-1];
return 0;
}
|
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <ctime>
#include <map>
#include <queue>
#include <cstdlib>
#include <string>
#include <climits>
#include <set>
#include <vector>
using namespace std;
inline int read(){
int k=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){k=k*10+ch-'0';ch=getchar();}
return k*f;
}
int n,m,a[110][110],f[1<<15][20],s[1<<15];
int main()
{
n=read();m=read();int sum=0;
for(int i=1;i<=m;i++){
int x=read()-1,y=read()-1,z=read();
a[x][y]=a[y][x]=z;sum+=z;
}
for(int i=0;i<(1<<n);i++)
for(int j=0;j<n;j++)f[i][j]=-1;
for(int i=1;i<(1<<n);i++)
for(int j=0;j<n;j++)if((1<<j)&i)
for(int k=j+1;k<n;k++)if((1<<k)&i)s[i]+=a[j][k];
f[1][0]=0;
for(int i=1;i<(1<<n);i++)
for(int j=0;j<n;j++)if(f[i][j]!=-1){
for(int k=0;k<n;k++)if(((1<<k)&i)==0&&a[j][k]>0)f[i|(1<<k)][k]=max(f[i|(1<<k)][k],f[i][j]+a[j][k]);
int x=(((1<<n)-1)^i)|(1<<j);
for(int y=x;y>=0;y--)y&=x,f[i|y][j]=max(f[i|y][j],f[i][j]+s[y]);
}
int ans=1e9;
for(int i=0;i<(1<<n);i++)ans=min(ans,sum-f[i][n-1]);
printf("%d",ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename _tp> inline void read(_tp&x){
char ch=getchar(),ob=0;x=0;
while(ch!='-'&&!isdigit(ch))ch=getchar();if(ch=='-')ob=1,ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();if(ob)x=-x;
}
#define bin(x) (1<<(x))
#define b(x) (1<<(x)>>1)
inline void cmax(int&x, const int y) {x < y && (x = y);}
const int N = 17, M = 40100;
int f[N][M], g[M];
int mp[N][N];
int n, m;
int main() {
read(n), read(m);
int Ans = 0;
for(int i=1,x,y,z;i<=m;++i) {
read(x), read(y), read(z);
Ans += z;
mp[x][y] = mp[y][x] = z;
}
for(int s=0;s<bin(n);++s) {
int&v = g[s];
for(int i=1;i<=n;++i) if(s & b(i))
for(int j=i+1;j<=n;++j) if(s & b(j)) v += mp[i][j];
}
for(int i=1;i<=n;++i)
for(int j=0;j<bin(n);++j)
f[i][j] = -1;
f[1][1] = 0;
for(int S=1;S<bin(n);++S)
for(int i=1;i<=n;++i) if((S & b(i)) and ~f[i][S]) {
for(int j=1;j<=n;++j) if((~S & b(j)) and mp[i][j]) cmax(f[j][S|b(j)], f[i][S] + mp[i][j]);
for(int iS=(bin(n)-1)^S, s = iS; s; s = (s-1) & iS)
cmax(f[i][S|s], f[i][S] + g[s|b(i)]);
}
printf("%d\n", Ans - f[n][bin(n)-1]);
return 0;
} |
#include<bits/stdc++.h>
#define update(a,b,c) if(dp[a][b]<c)dp[a][b]=c,q.push({a,b})
using namespace std;
struct edge{int v,w;};
int n,m,dp[70001][21],sum,cost[70001];
vector<edge> w[21];
int main()
{
scanf("%d%d",&n,&m);
while(m--)
{
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
x--;y--;
w[x].push_back({y,z});
w[y].push_back({x,z});
sum+=z;
}
for(int s=0;s<(1<<n);s++)
for(int i=0;i<n;i++)
if(s&(1<<i))
for(edge j:w[i])
if(s&(1<<j.v))cost[s]+=j.w;
for(int s=0;s<(1<<n);s++)cost[s]/=2;
memset(dp,-1,sizeof dp);
dp[1][0]=0;
queue<pair<int,int> > q;
q.push({1,0});
while(!q.empty())
{
int s=q.front().first,u=q.front().second,ss=((1<<n)-1)^s;q.pop();
for(edge j:w[u])
if(~s&(1<<j.v))update(s^(1<<j.v),j.v,j.w+dp[s][u]);
for(int t=ss;t;t=(t-1)&ss)
if(~t&(1<<u))update(s^t,u,cost[t^(1<<u)]+dp[s][u]);
}
int ans=1<<30;
for(int i=0;i<(1<<n);i++)ans=min(ans,sum-dp[i][n-1]);
printf("%d\n",ans);
return 0;
}
|
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define LL long long
#define INF 0x3f3f3f3f
#define Inf 1000000000000000000LL
#define F first
#define S second
using namespace std;
typedef pair<int,int>pii;
int n,m,sum;
int E[20][20],p[140010],f[140010][20];
void update(int&x,const int&y){x=max(x,y);}
int main(){
memset(f,-1,sizeof f);
cin>>n>>m;
for(int i=0,x,y,z;i<m;i++){
cin>>x>>y>>z;
x--,y--;
E[x][y]=E[y][x]=z;
sum+=z;
}
for(int i=0;i<(1<<n);i++){
for(int j=0;j<n;j++)if(i&(1<<j))
for(int k=0;k<n;k++)if(i&(1<<k))
p[i]+=E[j][k];
p[i]>>=1;
}
f[1][0]=0;
for(int i=1;i<(1<<n);i++){
for(int j=0;j<n;j++){
if (f[i][j]==-1)continue;
for(int k=0;k<n;k++){
if(i&(1<<k))continue;
if(E[j][k]==0)continue;
update(f[i|(1<<k)][k],f[i][j]+E[j][k]);
}
int revi=(((1<<n)-1)^i)|(1<<j);
for(int k=revi;k;k=(k-1)&revi)update(f[i|k][j],f[i][j]+p[k]);
}
}
int ans=0;
for(int i=0;i<(1<<n);i++)update(ans,f[i][n-1]);
cout<<(sum-ans)<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int gi(){
char ch=getchar();int x=0,q=0;
while(ch<'0' || ch>'9') ch=='-'?q=1:0,ch=getchar();
while(ch>='0' && ch<='9') x=x*10+ch-'0',ch=getchar();
return q?(-x):x;
}
int f[35000][17],w[35000],c[17][17];
void dp(int &x,int y){
if (x<y) x=y;
return;
}
int main(){
int n=gi(),m=gi(),z,a,b,p,S=(1<<n)-1,d=0;
for (int i=1; i<=m; ++i){
a=gi(),b=gi(),p=gi();
c[a][b]+=p,c[b][a]+=p;
z=(1<<(a-1))|(1<<(b-1));
for (int s=1; s<(1<<n); ++s)
if ((s&z)==z)
w[s]+=p;
d+=p;
}
memset(f,-100,sizeof(f));
f[1][1]=0;
for (int s=1; s<=S; ++s)
for (int i=1; i<=n; ++i)
if (s&(1<<(i-1))){
for (int j=1; j<=n; ++j)
if (!(s&(1<<(j-1)))&&c[i][j])
dp(f[s|(1<<(j-1))][j],f[s][i]+c[i][j]);
for (int t=S^s; t; t=(t-1)&(S^s))
dp(f[s|t][i],f[s][i]+w[t|1<<(i-1)]);
}
int ans=0;
for (int s=1; s<=S; ++s)
dp(ans,f[s][n]);
cout<<d-ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int g[15][15],cr[15][32768],ins[32768],dp[32768][15];
int main (){
int i,j,k,t,u,v,c,l,n,m,s=0;
scanf ("%d%d",&n,&m);
for (i=1;i<=m;i++)
{scanf ("%d%d%d",&u,&v,&c);
u--;v--;g[u][v]=g[v][u]=c;s+=c;
}
for (i=0;i<n;i++)
{for (k=0;k<n;k++)
{for (j=0;j<(1<<n);j++)
{if ((1<<k)&j)
{cr[i][j]+=g[i][k];}
}
}
}
for (i=0;i<(1<<n);i++)
{for (j=0;j<n;j++)
{for (k=0;k<n;k++)
{if ((1<<j)&i)
{if ((1<<k)&i)
{ins[i]+=g[j][k];}
}
}
}
ins[i]/=2;
}
memset(dp,-1,sizeof(dp));
dp[1][0]=0;
for (i=1;i<(1<<n);i++)
{for (j=0;j<n;j++)
{if (dp[i][j]<0) {continue;}
int tar=i-(1<<j),b=(1<<n)-1-tar;
for (k=0;k<n;k++)
{if (i&(1<<k)) {continue;}
if (g[j][k]<=0) {continue;}
dp[i+(1<<k)][k]=max(dp[i+(1<<k)][k],dp[i][j]+g[j][k]);
}
for (t=b;t;t=(t-1)&b)
{if (t&(1<<j)) {continue;}
dp[t|i][j]=max(dp[t|i][j],dp[i][j]+cr[j][t]+ins[t]);
}
}
}
int ans=0;
for (i=0;i<(1<<n);i++)
{ans=max(ans,dp[i][n-1]);}
printf ("%d",s-ans);
return 0;
} |
#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define INF 1000000007
using namespace std;
int n,m,dp[100010][20],val[100010];
int num[20][20];
vector<int> v;
signed main()
{
ios::sync_with_stdio(false);
cin>>n>>m;
for(int i=1;i<=m;i++){
int a,b,c;
cin>>a>>b>>c;
num[a][b]=num[b][a]=c;
}
val[0]=0;
for(int i=1;i<(1<<n);i++){
v.clear();
for(int j=1;j<=n;j++) if(i&(1<<(j-1))){
v.push_back(j);
}
val[i]=val[i^(1<<(v[0]-1))];
for(int j=1;j<v.size();j++){
val[i]+=num[v[0]][v[j]];
}
}
for(int i=0;i<(1<<n);i++) for(int j=1;j<=n;j++) dp[i][j]=-INF;
for(int i=0;i<(1<<n);i++) if(i&1) dp[i][1]=val[i];
for(int i=1;i<(1<<n);i++){
for(int j=1;j<=n;j++) if(i&(1<<(j-1))){
if(dp[i][j]==-INF) continue;
int xx=((1<<n)-1)^i;
for(int mask=xx;mask>0;mask=(mask-1)&xx){
for(int k=1;k<=n;k++) if(mask&(1<<(k-1))&&num[j][k]){
dp[i^mask][k]=max(dp[i^mask][k],dp[i][j]+num[j][k]+val[mask]);
}
}
}
}
cout<<val[(1<<n)-1]-dp[(1<<n)-1][n]<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const int maxn = 16;
const int maxs = 1 << maxn;
int a[maxn][maxn];
int f[maxs], g[maxn][maxs];
int tot, n, m, S;
void calc(int i, int s)
{
for(int j = 0; j < n; ++j)
if((s & (1 << j)) && a[i][j])
g[i][s] = max(g[i][s], g[j][s - (1 << i)] + a[i][j]);
int res = s - (1 << i);
for(int r = res; r; r = res & (r - 1))
g[i][s] = max(g[i][s], g[i][r | (1 << i)] + f[s - r]);
g[i][s] = max(g[i][s], g[i][1 << i] + f[s]);
//cout << i << ' ' << s << ' ' << g[i][s] << endl;
}
int main()
{
scanf("%d%d", &n, &m);
S = (1 << n) - 1;
for(int i = 1; i <= m; ++i)
{
int u, v, w;
scanf("%d%d%d", &u, &v, &w);
--u; --v;
a[u][v] = a[v][u] = w;
tot += w;
}
for(int j = 0; j < n; ++j)
{
int cur = 1 << j;
for(int s = 0; s < cur; ++s)
{
f[s | cur] = f[s];
for(int i = 0; i < j; ++i)
if(s & (1 << i))
f[s | cur] += a[i][j];
}
}
for(int s = 1; s <= S; ++s)
for(int i = 0; i < n; ++i)
g[i][s] = -INF;
g[0][1] = 0;
for(int s = 1; s <= S; ++s)
for(int i = 0; i < n; ++i)
if(s & (1 << i))
calc(i, s);
//cout << g[n - 1][S] << endl;
printf("%d\n", tot - g[n - 1][S]);
return 0;
}
/*
4 4
1 2 100
2 4 100
1 3 100
3 4 100
*/ |
#include <bits/stdc++.h>
using std::max;
const int N=15,Inf=1e9+10;
int n,m,map[N][N],f[N][1<<N],M[N][1<<N],sum[1<<N];
void Init() {
scanf("%d%d",&n,&m);
int a,b,c;
for (int i=1;i<=m;++i) {
scanf("%d%d%d",&a,&b,&c);
a--; b--;
map[a][b]=map[b][a]=c;
}
}
int summ;
bool vis[N];
void Dfs(int x,int s) {
if (vis[x]) return ;
vis[x]=1;
for (int i=0;i<n;++i) if ((1<<i)&s && map[x][i]) {
summ+=map[x][i];
Dfs(i,s);
}
}
void Solve() {
int Max=1<<n;
for (int s=0;s<Max;++s) {
summ=0;
for (int i=0;i<n;++i) vis[i]=0;
for (int i=0;i<n;++i) if ((1<<i)&s) Dfs(i,s);
sum[s]=summ>>1;
}
summ=0;
for (int i=0;i<n;++i)
for (int j=i;j<n;++j) summ+=map[i][j];
for (int i=0;i<n;++i)
for (int s=0;s<Max;++s) f[i][s]=-Inf,M[i][s]=-Inf;
M[0][1]=0;
for (int s=0;s<Max;++s) if (s&1) {
f[0][s]=sum[s];
for (int t=0;t<n;++t)
if (map[t][0]) M[t][s]=max(M[t][s],f[0][s]+map[t][0]);
}
for (int s=0;s<Max;++s) {
for (int i=0;i<n;++i) if ((1<<i)&s) {
for (int p=s;p;p=(p-1)&s) if (!((1<<i)&p)) {
f[i][s]=max(f[i][s],M[i][p]+sum[s^p]);
}
for (int t=0;t<n;++t) if (map[t][i]) M[t][s]=max(M[t][s],f[i][s]+map[t][i]);
}
}
printf("%d\n",summ-f[n-1][Max-1]);
}
int main() {
Init();
Solve();
return 0;
} |
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn=17, maxst=(1<<17)-1;
int n, m, sum, e[maxn][maxn], p[maxst], f[maxst][maxn];
inline int max(int x, int y){ return x<y?y:x; }
inline void up(int &x, int y){ x=max(x, y); }
int main(){
scanf("%d%d", &n, &m); int a, b, c, ans=0;
memset(f, -1, sizeof(f)); //还是那个，不能让不合法状态成功转移
for (int i=0; i<m; ++i){
scanf("%d%d%d", &a, &b, &c); --a; --b;
e[a][b]=e[b][a]=c; sum+=c; }
for (int i=0; i<1<<n; ++i){
for (int j=0; j<n; ++j) if (i&(1<<j))
for (int k=0; k<n; ++k) if (i&(1<<k))
p[i]+=e[j][k];
p[i]>>=1; }
f[1][0]=0;
for (int i=1; i<(1<<n); ++i){ //当前集合
for (int j=0; j<n; ++j){ //当前挂的点
if (f[i][j]==-1) continue;
for (int k=0; k<n; ++k){ //枚举新在j后加的点
if (i&(1<<k)) continue;
if (e[j][k]==0) continue; //绝壁想不到的东西！果然转移要想清楚，限制一定要先治好，不能让不合法状态成功转移
up(f[i|(1<<k)][k], f[i][j]+e[j][k]);
}
int revi=(((1<<n)-1)^i)|(1<<j); //枚举新挂在j上的集合（要加上j以统计连j的边）
for (int k=revi; k; k=(k-1)&revi)
up(f[i|k][j], f[i][j]+p[k]);
}
}
for (int i=0; i<(1<<n); ++i)
up(ans, f[i][n-1]);
printf("%d\n", sum-ans);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define chmax(a,b) a=max(a,b)
const int N=17;
int n,m;
int g[N][N];
int cost[1<<N];
int dp[N][1<<N];
int main()
{
cin>>n>>m;
while(m--)
{
int u,v,w;
cin>>u>>v>>w;
u--; v--;
g[u][v]=g[v][u]=w;
}
for(int mask=0;mask<(1<<n);mask++)
for(int u=0;u<n;u++)
for(int v=u+1;v<n;v++)
if(mask&(1<<u) && mask&(1<<v)) cost[mask]+=g[u][v];
memset(dp,-1,sizeof(dp));
for(int mask=1;mask<(1<<n);mask+=2)
dp[0][mask]=cost[mask];
for(int mask=0;mask<(1<<(n-1));mask++)
for(int i=0;i<n-1;i++)
{
if(dp[i][mask]<0) continue;
int _=(1<<n)-1-mask;
for(int mask2=_;mask2>0;mask2=(mask2-1)&_)
for(int j=0;j<n;j++)
{
if(!(mask2&(1<<j))) continue;
if(!g[i][j]) continue;
chmax(dp[j][mask|mask2],dp[i][mask]+g[i][j]+cost[mask2]);
}
}
cout<<cost[(1<<n)-1]-dp[n-1][(1<<n)-1]<<'\n';
return 0;
} |
#include<bits/stdc++.h>
#define rep(i,a,b) for (int i=(a); i<=(b); i++)
#define subset(i,S) for (int i=(S); i; i=(i-1)&(S))
using namespace std;
const int maxn = 16;
int f[1<<maxn][maxn], cost[1<<maxn], w[maxn][maxn];
int n, m, a, b, c, S, total;
void init() {
rep (i, 1, (1<<n)-1)
rep (x, 0, n-1) if (i>>x&1)
rep (y, x+1, n-1) if (i>>y&1)
cost[i] += w[x][y];
}
int main() {
scanf("%d%d", &n, &m);
rep (i, 1, m) {
scanf("%d%d%d", &a, &b, &c); a--; b--;
w[a][b] = w[b][a] = c; total += c;
}
init();
memset(f, -1, sizeof f);
f[1][0] = 0;
rep (i, 1, (1<<n)-1)
rep (j, 0, n-1) if ((i>>j&1) && ~f[i][j]) {
S = (((1<<n)-1)^i)|(1<<j);
subset (s, S) f[i|s][j] = max(f[i|s][j], f[i][j] + cost[s]);
rep (k, 0, n-1) if (!(i>>k&1) && w[j][k]) f[i|(1<<k)][k] = max(f[i|(1<<k)][k], f[i][j] + w[j][k]);
}
printf("%d\n", total - f[(1<<n)-1][n-1]);
return 0;
} |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,m,map[16][16],x,y,z,mmh[1<<15][15],o[1<<15][15];
inline int work(int a,int b){
int mmh=0;
for (int i=0;i<n;i++)
if ((a>>i)&1) mmh+=o[b][i];
return mmh;
}
int main(){
scanf("%d%d",&n,&m);
memset(map,0,sizeof(map));
memset(mmh,63,sizeof(mmh));
while(m--){
scanf("%d%d%d",&x,&y,&z);x--;y--;
map[x][y]=map[y][x]=z;
}
for (int i=0;i<(1<<n);i++)
for (int j=0;j<n;j++){
o[i][j]=0;
for (int k=0;k<n;k++)
if ((i>>k)&1) o[i][j]+=map[j][k];
}
mmh[1][0]=0;
for (int i=0;i<(1<<n);i++)
for (int j=0;j<n;j++)
if ((i>>j)&1){
for (int k=0;k<n;k++)
if (map[j][k])
if (!((i>>k)&1)) mmh[i|(1<<k)][k]=min(mmh[i|(1<<k)][k],mmh[i][j]+work(i,1<<k)-map[j][k]);
int u=(1<<n)-1-i;
for (int p=u;p;p=(p-1)&u) mmh[i|p][j]=min(mmh[i|p][j],mmh[i][j]+work(i^(1<<j),p));
}
printf("%d\n",mmh[(1<<n)-1][n-1]);
} |
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=16,M=N*N,K=1<<15,inf=1e9;
int n,m,nm,i,j,k,x,p[K],v[K],f[N][K],mx[N];
int et,he[N],sum;
struct edge{int l,to,v;}e[M];
void gmax(int &x,int k){if (k>x) x=k;}
int main(){
scanf("%d%d",&n,&m);nm=1<<n;
for (i=1;i<=m;i++){
int x,y,v;scanf("%d%d%d",&x,&y,&v);sum+=v;
e[++et].l=he[x];he[x]=et;e[et].to=y;e[et].v=v;
if (x==y) continue;
e[++et].l=he[y];he[y]=et;e[et].to=x;e[et].v=v;
}
for (i=1;i<=n;i++) p[1<<i-1]=i;
for (i=1;i<nm;i++){
int x=p[i&-i];v[i]=v[i-(i&-i)];
for (j=he[x];j;j=e[j].l)
if ((i>>e[j].to-1)&1) v[i]+=e[j].v;
}
for (x=1;x<=n;x++)
for (i=0;i<nm;i++) f[x][i]=-inf;
for (i=1;i<nm;i+=2) f[1][i]=v[i];
for (i=1;i<nm-1;i++) if (i&1){
for (x=1;x<=n;x++) mx[x]=-inf;
for (x=1;x<=n;x++){
if (f[x][i]==-inf) continue;
for (j=he[x];j;j=e[j].l)
gmax(mx[e[j].to],f[x][i]+e[j].v);
}
for (j=i;j<nm;j=(j+1)|i)
for (k=j^i;k;k-=k&-k){
int x=p[k&-k];
gmax(f[x][j],mx[x]+v[j^i]);
}
}
printf("%d",sum-f[n][nm-1]);
} |
#include<bits/stdc++.h>
#define cmax(a,b) a=max(a,b)
using namespace std;
typedef long long ll;
const ll N=20,V=(1ll<<15)+20,B=(ll)1e15;
ll n,m,sx,S=0,ans;
ll f[N][V],h[V],e[N][N];
int main()
{
ll i,j,ns,vs,hsx,u,v,w;
scanf("%lld%lld",&n,&m);
sx=1<<n;
for(i=1;i<=m;i++)
{
scanf("%lld%lld%lld",&u,&v,&w);u--;v--;
e[u][v]=e[v][u]=w;
for(ns=0;ns<sx;ns++)
{
if((ns&(1<<u))&&(ns&(1<<v))) h[ns]+=w;
}
S+=w;
}
memset(f,-0x3f,sizeof(f));
f[0][1]=0;
for(ns=1;ns<sx;ns++)
{
for(i=0;i<n;i++)
{
if((ns&(1<<i))==0) continue;
if(f[i][ns]<-B) continue;
//printf("#%lld %lld %lld\n",i,ns,f[i][ns]);
hsx=(sx-1)^ns;
if(hsx>0)
{
for(vs=hsx;vs;vs=(vs-1)&hsx)
{
cmax(f[i][ns|vs],f[i][ns]+h[vs|(1<<i)]);
}
}
for(j=0;j<n;j++)
{
if((ns&(1<<j))||e[i][j]==0) continue;
cmax(f[j][ns|(1<<j)],f[i][ns]+e[i][j]);
}
}
}
//printf("P%lld\n",f[n-1][sx-1]);
ans=S-f[n-1][sx-1];
printf("%lld",ans);
return 0;
} |
#include<iostream>
#include<algorithm>
#include<math.h>
#include<string.h>
#include<fstream>
#include<map>
#include<queue>
#include<stack>
using namespace std;
long long n,m,sum,c[20][20];
long long f[1<<15][15],p[1<<15];
int main(){
memset(f,-1,sizeof(f));
cin>>n>>m;
for(int i=1;i<=m;i++){
int u,v,w;
cin>>u>>v>>w;
u--,v--;
sum+=w;
c[u][v]=w,c[v][u]=w;
}
for(int i=0;i<=(1<<n)-1;i++){
for(int j=0;j<=n-1;j++){
if(i&(1<<j)){
for(int k=j+1;k<=n-1;k++){
if(i&(1<<k)){
p[i]=p[i]+c[j][k];
}
}
}
}
}
f[1][0]=0;
for(int i=0;i<=(1<<n)-1;i++){
for(int j=0;j<=n-1;j++){
if(f[i][j]==-1){
continue;
}
int x=(((1<<n)-1)^i)|(1<<j);
for(int k=x;k;k=(k-1)&x){
f[i|k][j]=max(f[i|k][j],f[i][j]+p[k]);
}
for(int k=1;k<=n-1;k++){
if((!(i&(1<<k)))&&c[j][k]){
f[i|(1<<k)][k]=max(f[i|(1<<k)][k],f[i][j]+c[j][k]);
}
}
}
}
long long ans=100000000000000;
for(int i=0;i<=(1<<n)-1;i++){
for(int j=0;j<=n-1;j++){
if(i&(1<<j)){
ans=min(ans,sum-f[i][n-1]);
}
}
}
cout<<ans<<endl;
return 0;
} |
#include<cstdio>
#include<algorithm>
#define fo(i,a,b) for(i=a;i<=b;i++)
#define two(i) (1<<(i-1))
using namespace std;
const int maxn=15+10,inf=1000000000;
int f[(1<<16)+10][maxn],p[(1<<16)+10],id[(1<<16)+10];
int dis[maxn][maxn];
int i,j,k,l,r,s,t,n,m,now,all,ans,sum;
int lowbit(int x){
return x&-x;
}
int main(){
scanf("%d%d",&n,&m);
fo(i,1,n) id[two(i)]=i;
all=(1<<n)-1;
fo(i,1,m){
scanf("%d%d%d",&j,&k,&t);
sum+=t;
dis[j][k]=dis[k][j]=t;
}
fo(i,1,all){
now=id[lowbit(i)];
p[i]=p[i-two(now)];
fo(j,now+1,n)
if ((i&two(j))) p[i]+=dis[now][j];
}
fo(i,0,n)
fo(j,0,all)
f[j][i]=-inf;
f[two(1)][1]=0;
ans=-inf;
fo(s,1,all){
fo(i,1,n){
r=s;
while (r){
if ((r&two(i))) f[s][i]=max(f[s][i],f[(s-r)|two(i)][i]+p[r]);
r=(r-1)&s;
}
fo(j,1,n)
if (!(s&two(j))&&dis[i][j]) f[s|two(j)][j]=max(f[s|two(j)][j],f[s][i]+dis[i][j]);
}
if ((s&two(n))) ans=max(ans,f[s][n]);
}
printf("%d\n",sum-ans);
} |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int e[15][15];
int n;
int dp1[1<<15];
int dp2[1<<15][15];
int tmp[15];
void upd(int&x,int y){
if(x==-1 || x<y)x=y;
}
int main(){
int m, tot = 0;
scanf("%d%d",&n,&m);
while(m--){
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
--x;--y;
e[x][y] = e[y][x] = z;
tot += z;
}
for(int mask=1; mask < (1<<n); mask ++){
int t;
for(t=0; (mask&(1<<t)) == 0; t++);
dp1[mask] = dp1[mask-(1<<t)];
for(int i=t+1; i<n; i++)if(mask&(1<<i))
dp1[mask] += e[t][i];
}
memset(dp2,-1,sizeof(dp2));
for(int mask=1; mask < (1<<n); mask++)if((mask&1)!=0&&(mask&(1<<(n-1)))==0)
dp2[mask][0] = dp1[mask];
for(int mask=1; mask < (1<<n); mask++){
memset(tmp,-1,sizeof(tmp));
for(int i=0; i<n; i++)if((mask&(1<<i))!=0 && dp2[mask][i] != -1)
for(int j=0; j<n; j++)if((mask&(1<<j)) == 0 && e[i][j] != 0)
upd(tmp[j], dp2[mask][i] + e[i][j]);
int comp = (1<<n) - 1 - mask, b = 0;
do{
for(int i=0; i<n; i++)if((b & (1<<i))!=0 && tmp[i]!=-1){
upd(dp2[mask + b][i], tmp[i] + dp1[b]);
}
}while(b=(b-comp)&comp);
}
printf("%d\n",tot - dp2[(1<<n)-1][n-1]);
return 0;
} |
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int n,m,g[101][101],w[1<<15],dp[1<<15][101];
int main()
{
scanf("%d%d",&n,&m);int sum=0;for(int i=1;i<=m;++i){int a,b,c;scanf("%d%d%d",&a,&b,&c);g[a][b]=g[b][a]=c;sum+=c;}
for(int i=0;i<(1<<n);++i)for(int j=1;j<=n;++j)if(i&(1<<j-1))for(int k=j+1;k<=n;++k)if(i&(1<<k-1))w[i]+=g[j][k];
memset(dp,-1,sizeof(dp));for(int i=1;i<(1<<n);i+=2)dp[i][1]=w[i];
for(int i=0;i<(1<<n);++i)
{
for(int j=1;j<=n;++j)if((i&(1<<j-1))&&~dp[i][j])
{
int tmp=(~i)&((1<<n)-1);
for(int k=tmp;k;k=(k-1)&tmp)
{
for(int l=1;l<=n;++l)if((k&(1<<l-1))&&g[l][j])dp[i|k][l]=max(dp[i|k][l],dp[i][j]+w[k]+g[l][j]);
}
}
}
printf("%d\n",sum-dp[(1<<n)-1][n]);return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int n,m,g[15][15],dp[1<<15][15],cost[1<<15],sum;
int main() {
memset(dp,-1,sizeof(dp));
memset(g,-1,sizeof(g));
scanf("%d%d",&n,&m);
while(m--) {
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
g[a-1][b-1]=g[b-1][a-1]=c;
sum+=c;
}
for(int i=1;i<(1<<n);i++)
for(int j=0;j<n;j++)
if((1<<j)&i)
for(int k=j+1;k<n;k++)
if((1<<k)&i&&g[j][k]>-1)
cost[i]+=g[j][k];
for(int i=1;i<1<<n;i+=2) dp[i][0]=cost[i];
for(int i=1;i<(1<<n);i+=2)
for(int j=0;j<n;j++)
if(dp[i][j]>-1)
for(int k=(1<<n)-1-i;k;k=(k-1)&(1<<n)-1-i)
for(int l=0;l<n;l++)
if(1<<l&k&&g[j][l]>-1)
dp[i|k][l]=max(dp[i|k][l],dp[i][j]+g[j][l]+cost[k]);
printf("%d\n",sum-dp[(1<<n)-1][n-1]);
return 0;
} |
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#define U ((1<<n)-1)
using namespace std;
const int N = 16;
int a[N+2][N+2];
int cost[(1<<N)+2];
int dp[(1<<N)+2][N+2];
int n,m;
void update(int &x,int y) {x = max(x,y);}
int main()
{
scanf("%d%d",&n,&m);
for(int i=1; i<=m; i++)
{
int x,y,z; scanf("%d%d%d",&x,&y,&z); x--; y--;
a[x][y] = a[y][x] = z;
}
for(int i=0; i<=U; i++)
{
cost[i] = 0;
for(int j=0; j<n; j++)
{
if((i&(1<<j))==0) continue;
for(int k=j+1; k<n; k++)
{
if((i&(1<<k))==0) continue;
cost[i] += a[j][k];
}
}
}
memset(dp,-1,sizeof(dp));
dp[1][0] = 0;
for(int i=1; i<=U; i+=2)
{
for(int j=0; j<n; j++)
{
if(dp[i][j]==-1) continue;
if((i&(1<<j))==0) continue;
for(int k=0; k<n; k++)
{
if(a[j][k]==0) continue;
if(i&(1<<k)) continue;
update(dp[i|(1<<k)][k],dp[i][j]+a[j][k]);
}
int c = (U-i)|(1<<j);
for(int k=c; k>=0; k=(k==0 ? -1 : (k-1)&c))
{
update(dp[i|k][j],dp[i][j]+cost[k]);
}
}
}
int ans = 0;
for(int i=(U>>1)+2; i<=U; i+=2) ans = max(ans,dp[i][n-1]);
printf("%d\n",cost[U]-ans);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
vector<pair<int,int> >v[15];
int n,m,ans,b[65536],dp[65536][15];
int main(){
cin>>n>>m;
for(int i=0;i<m;i++){
int x,y,len;cin>>x>>y>>len;x--;y--;
v[x].push_back(make_pair(y,len));v[y].push_back(make_pair(x,len));
ans+=len;
}
for(int i=0;i<(1<<n);i++)
{
for(int j=0;j<n;j++)
if(!(i&(1<<j))&&!b[i+(1<<j)])
{
b[i+(1<<j)]=b[i];
for(int k=0;k<v[j].size();k++)
if(i&(1<<v[j][k].first))
b[i+(1<<j)]+=v[j][k].second;
}
}
memset(dp,-1,sizeof(dp));
dp[1][0]=0;
for(int i=0;i<(1<<n);i++)
for(int j=0;j<n;j++)
if(dp[i][j]!=-1&&(i&1<<j)){
for(int k=0;k<v[j].size();k++)
if(!(i&(1<<v[j][k].first)))
dp[i|(1<<v[j][k].first)][v[j][k].first]=max(dp[i|(1<<v[j][k].first)][v[j][k].first],dp[i][j]+v[j][k].second);
for(int k=((1<<n)-1-i)|(1<<j);k;k=(k-1)&(((1<<n)-1-i)|(1<<j)))
if(k&(1<<j))
dp[i|k][j]=max(dp[i|k][j],dp[i][j]+b[k]);
}
cout<<ans-dp[(1<<n)-1][n-1];
} |
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <math.h>
#define rep(i,st,ed) for (int i=st;i<=ed;++i)
#define lb(x) (x&-x)
#define get(x) ((int)log2(x))
const int INF=0x3f3f3f3f;
const int N=66666;
int f[17][N],sum[N];
int v[17][17];
int read() {
int x=0,v=1; char ch=getchar();
for (;ch<'0'||ch>'9';v=(ch=='-')?(-1):v,ch=getchar());
for (;ch<='9'&&ch>='0';x=x*10+ch-'0',ch=getchar());
return x*v;
}
void upd(int &x,int v) {
(x<v)?(x=v):0;
}
int main(void) {
int n=read(),m=read();
int prt=0;
rep(i,1,m) {
int x=read()-1,y=read()-1;
v[x][y]=v[y][x]=read(),prt+=v[x][y];
}
for (int S=1;S<(1<<n);++S) {
int x=get(lb(S));
sum[S]=sum[S-(1<<x)];
rep(i,0,n-1) if (v[i][x]&&(S>>i&1)) {
sum[S]+=v[i][x];
}
}
rep(i,0,n-1) for (int S=0;S<(1<<n);++S) f[i][S]=-INF;
int ans=0; f[0][1]=0;
for (int S=1;S<(1<<n);++S) {
if (!(S&1)) continue;
rep(i,0,n-1) {
if (!((S>>i))&1) continue;
for (int T=S;T;T=(T-1)&S) {
if (T>>i&1) upd(f[i][S],f[i][S-T+(1<<i)]+sum[T]);
}
for (int T=(1<<n)-1-S,j;T;T-=lb(T)) {
j=get(lb(T));
if (v[i][j]) upd(f[j][S+(1<<j)],f[i][S]+v[i][j]);
}
}
if (S>>(n-1)&1) upd(ans,f[n-1][S]);
}
printf("%d\n", prt-ans);
return 0;
} |
#include <bits/stdc++.h>
#define rep(i, x, y) for (int i = x; i <= y; i++)
using namespace std;
const int N = 16;
int n, m, tot, sz, dp[N][1 << N], e[N][N], val[1 << N]; // val: 预处理每个联通块所有边的总值
void pre() {
rep(s, 0, sz)
rep(i, 1, n) if ((s >> (i - 1)) & 1)
rep(j, i + 1, n) if ((s >> (j - 1)) & 1)
val[s] += e[i][j];
}
void chkmax(int &x, int y) { x = max(x, y); }
int main() {
cin >> n >> m;
sz = (1 << n) - 1;
rep(i, 1, m) {
int x, y, z; scanf("%d%d%d", &x, &y, &z);
e[x][y] = e[y][x] = z; tot += z;
}
pre();
memset(dp, -1, sizeof(dp));
dp[1][1] = 0;
rep(s, 1, sz)
rep(i, 1, n)
if (((s >> (i - 1)) & 1) && dp[i][s] != -1) {
rep(j, 1, n)
if (!((s >> (j - 1)) & 1) && e[i][j])
chkmax(dp[j][s | (1 << (j - 1))], dp[i][s] + e[i][j]); // e[i][j] 作为桥边
int S = (sz ^ s) | (1 << (i - 1));
for (int j = S; j; j = (j - 1) & S)
if (j & (1 << (i - 1)))
chkmax(dp[i][s | j], dp[i][s] + val[j]);
}
printf("%d\n", tot - dp[n][sz]);
return 0;
}
|
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<set>
#include<bitset>
#include<map>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
typedef long long LL;
typedef double db;
int get(){
char ch;
while(ch=getchar(),(ch<'0'||ch>'9')&&ch!='-');
if (ch=='-'){
int s=0;
while(ch=getchar(),ch>='0'&&ch<='9')s=s*10+ch-'0';
return -s;
}
int s=ch-'0';
while(ch=getchar(),ch>='0'&&ch<='9')s=s*10+ch-'0';
return s;
}
const int N = 17;
const int L = 32775;
const int INF = 2e+9;
int f[L][N],val[L];
int n,m;
struct edge{
int x,y,l;
}e[N*N];
int d[N][N];
int main(){
n=get();m=get();
int sum=0;
fo(i,1,m){
e[i].x=get();e[i].y=get();e[i].l=get();
sum+=e[i].l;
d[e[i].x][e[i].y]=d[e[i].y][e[i].x]=e[i].l;
}
fo(t,1,(1<<n)-1){
fo(i,1,m)
if (((1<<(e[i].x-1))&t)>0&&((1<<(e[i].y-1))&t)>0)val[t]+=e[i].l;
}
fo(t,0,(1<<n)-1)fo(x,1,n)f[t][x]=-1;
fo(t,1,(1<<(n-1))-1)
if (t&1)f[t][1]=val[t];
fo(t,1,(1<<n)-1)
fo(x,1,n)
if (f[t][x]>-1){
int u=((1<<n)-1)^t;
int p=u;
for(;u;u=(u-1)&p){
fo(y,1,n)
if (((1<<(y-1))&u)>0&&d[x][y])f[t^u][y]=max(f[t^u][y],f[t][x]+d[x][y]+val[u]);
}
}
printf("%d\n",sum-f[(1<<n)-1][n]);
return 0;
} |
#pragma GCC optmize(3)
#include <cstdio>
#include <iostream>
#include <cstring>
#include <ctime>
#define rus register unsigned short
#define rs register short
using namespace std;
const int N = 15;
int G[N][N], dp[N][1 << N], cost[N][1 << N];
int n, m;
inline void upd(int &x, int y) {
if (x == -1) x = y;
else x = min(x, y);
}
inline int set_set(int x, int y) {
int ret = 0;
for (rs i = 0; i < n; i ++)
if (x & (1 << i)) ret += cost[i][y];
return ret;
}
int main() {
memset(dp, -1, sizeof dp);
scanf("%d%d", &n, &m);
for (int i = 1, x, y, z; i <= m; i ++) {
scanf("%d%d%d", &x, &y, &z);
x --; y --;
G[x][y] = G[y][x] = z;
}
int t = 1 << n;
for (rus s = 1; s < t; s ++)
for (rs i = 0; i < n; i ++)
if (s & (1 << i)) {
for (rs j = 0; j < n; j ++) cost[j][s] += G[i][j];
}
dp[0][1] = 0;
for (rus s = 1; s < t; s += 2) {
rus u = s ^ (t - 1);
for (rs i = 0; i < n; i ++)
if (s & (1 << i)) {
if (dp[i][s] == -1) continue;
for (rs j = 0; j < n; j ++)
if (!(s & (1 << j)) && G[i][j]) upd(dp[j][s | (1 << j)], dp[i][s] + cost[j][s ^ (1 << i)]);
for (rus v = u; v; v = (v - 1) & u)
upd(dp[i][v | s], dp[i][s] + set_set(v, s ^ (1 << i)));
}
}
printf("%d\n", dp[n - 1][t - 1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fo(i,s,t) for(int i = s; i <= t; ++ i)
const int maxn = 15;
int n, m, f[1<<maxn][maxn], cost[1<<maxn], dis[maxn][maxn];
int calc(int s,int t){return cost[s|t]-cost[s]-cost[t];}
void upd(int &a,int b){a = (a < b ? a : b);}
int main()
{
scanf("%d%d",&n,&m);
fo(i,1,m)
{
int x, y, z; scanf("%d%d%d",&x,&y,&z);
-- x; -- y; dis[x][y] = dis[y][x] = z;
}
fo(i,0,(1<<n)-1)
fo(j,0,n-1) if(i&(1<<j))
fo(k,j+1,n-1) if((i&(1<<k))&&dis[j][k])
cost[i] += dis[j][k];
memset(f,0x3f,sizeof(f));
f[1][0] = 0;
fo(s,0,(1<<n)-1) fo(i,0,n-1) if(f[s][i]!=0x3f3f3f3f&&(s&(1<<i)))
{
fo(j,0,n-1) if((!(s&(1<<j)))&&dis[i][j])
upd(f[s|(1<<j)][j], f[s][i] + calc(s-(1<<i),(1<<j)));
int t = (1<<n)-1-s;
for(int y = t; y >= 1; y = ((y-1)&t))
upd(f[s|y][i], f[s][i] + calc(s-(1<<i),y));
}
printf("%d\n",f[(1<<n)-1][n-1]);
return 0;
}
|
#include <cstdio>
#include <algorithm>
#define Rep(i, n) for (int i = 1; i <= n; i ++)
#define Rep0(i, n) for (int i = 0; i <= n; i ++)
#define RepG(i, x) for (int i = head[x]; i; i = edge[i].next)
using namespace std;
const int N = 21;
const int N0 = 33000;
int g[N][N], t0[N0], t1[N0][N], n, m;
int f[N][N0][2];
int cut(int s1, int s2){ return t0[s1 | s2] - t0[s1] - t0[s2];}
#define g(i) (1 << (i - 1))
int main()
{
scanf("%d%d", &n, &m);
Rep(i, m) {
int x, y, z;
scanf("%d%d%d", &x, &y, &z);
g[x][y] += z, g[y][x] += z;
}
Rep0(i, (1 << n) - 1) {
Rep(j, n) if (i & (1 << (j - 1))){
for (int k = j; k <= n; k ++)
if (i & (1 << (k - 1))) t0[i] += g[j][k];
Rep(k, n) t1[i][k] += g[k][j];
}
}
Rep(i, n) Rep0(s, (1 << n) - 1) f[i][s][0] = f[i][s][1] = ~0u>>2;
f[1][1][0] = 0;
Rep0(s, (1 << n) - 1) Rep(i, n) if (s & g(i)){
int tmp = s ^ g(i);
Rep(j, n) if ((tmp & g(j)) && g[i][j])
f[i][s][0] = min(f[i][s][0], f[j][tmp][1] - g[i][j] + t1[tmp][i]);
for (int s0 = tmp; ; s0 = tmp & (s0 - 1)) {
f[i][s][1] = min(f[i][s][1], f[i][s ^ s0][0] + cut(s0, tmp ^ s0));
if (!s0) break;
}
}
printf("%d\n", f[n][(1 << n) - 1][1]);
return 0;
}
/*
5 6
1 5 100
1 4 100
1 2 100
2 3 100
3 4 100
4 5 100
*/
|
/*********************
* Author: xuziyuan *
*********************/
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define LL long long
#define pii pair <int,int>
#define fi first
#define se second
#define pb push_back
#define mpr make_pair
using namespace std;
const LL MOD=1e9+7;
int n,m,x,y,z,a[20][20],val[40000],dp[40000][20],dp2[40000],sum=0;
int main()
{
cin>>n>>m;
rep(i,m)
{
cin>>x>>y>>z;
x--;
y--;
a[x][y]=a[y][x]=z;
sum+=z;
}
rep(i,1<<n) rep(j,n) for(int k=j+1;k<n;k++) if((i&(1<<j))>0&&(i&(1<<k))>0) val[i]+=a[j][k];
rep(i,39995) rep(j,18) dp[i][j]=-1;
rep(i,1<<n) if((i&1)>0) dp[i][0]=val[i];
rep(i,1<<n)
{
rep(j,n)
{
if(dp[i][j]==-1) continue;
rep(k,n)
{
if(a[j][k]==0||(i&(1<<k))>0) continue;
dp[i|(1<<k)][k]=max(dp[i|(1<<k)][k],dp[i][j]+a[j][k]);
}
}
}
rep(i,39995) dp2[i]=-1;
rep(i,1<<n) dp2[i]=dp[i][n-1];
rep(i,1<<n)
{
if(dp2[i]==-1) continue;
rep(j,n)
{
if((i&(1<<j))==0) continue;
int rest=(1<<n)-1-i;
for(int k=rest;k>0;k=(k-1)&rest) dp2[i|k]=max(dp2[i|k],dp2[i]+val[k|(1<<j)]);
}
}
cout<<sum-dp2[(1<<n)-1]<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int e[20][20];
int v[33333];
int f[33333][20];
int n,m,ans;
int main(){
scanf("%d%d",&n,&m);
for (int i=1;i<=m;i++){
int x,y,v;
scanf("%d%d%d",&x,&y,&v);
e[--x][--y]=v; e[y][x]=v;
ans+=v;
}
for (int i=0;i<1<<n;i++)
for (int j=0;j<n;j++)
if (i&(1<<j))
for (int k=j+1;k<n;k++)
if (i&(1<<k))
v[i]+=e[j][k];
memset(f,233,sizeof(f));
for (int i=0;i<1<<n;i++)
if (i&1) f[i][0]=v[i];
for (int i=0;i<1<<n;i++)
for (int j=0;j<n;j++)
if (f[i][j]>=0){
//printf("%d %d %d\n",i,j,f[i][j]);
int res=(1<<n)-1-i;
for (int ano=res;ano;ano=(ano-1)&res)
for (int k=0;k<n;k++)
if (e[j][k]&&!(i&(1<<k))&&(ano&(1<<k)))
f[i|ano][k]=max(f[i|ano][k],f[i][j]+v[ano]+e[j][k]);
}
printf("%d\n",ans-f[(1<<n)-1][n-1]);
} |
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
int n, m, map[16][16];
ll in[1 << 16], f[1 << 16][16];
int main()
{
scanf("%d%d", &n, &m);
int x, y;
for (int i = 1; i <= m; i++)
scanf("%d%d", &x, &y), x--, y--, scanf("%d", &map[x][y]), map[y][x] = map[x][y];
for (int i = 0; i < (1 << n); i++)
for (int j = 0; j < n; j++)
if (i & (1 << j))
for (int k = j + 1; k < n; k++)
if (i & (1 << k))
in[i] += map[j][k];
memset(f, -0x3f, sizeof(f));
f[1][0] = 0;
for (int i = 1; i < (1 << n); i++)
for (int j = 0; j < n; j++)
if (i & (1 << j))
{
int x = i ^ (1 << j);
for (int k = 0; k < n; k++)
if (i & (1 << k) && map[k][j])
f[i][j] = max(f[i][j], f[x][k] + map[k][j]);
for (int k = x; k; k = (k - 1) & x)
f[i][j] = max(f[i][j], f[i ^ k][j] + in[1 << j ^ k]);
}
printf("%lld\n", in[(1 << n) - 1] - f[(1 << n) - 1][n - 1]);
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.