text stringlengths 49 983k |
|---|
#include<iostream>
#include<climits>
using namespace std;
int main(){
int n;
cin >> n;
int x;
int f[n][10];
int p[n][11];
for(int i = 0; i < n; i++){
for(int j = 0; j < 10; j++){
cin >> f[i][j];
}
}
for(int i = 0; i < n; i++){
for(int j = 0; j < 11; j++){
cin >> p[i][j];
}
}
int ans = INT_MIN;
for(int i = 1; i < (1<<10); i++){
int tmp = 0;
for(int j = 0; j < n; j++){
int cover = 0;
for(int k = 0; k < 10; k++){
if(((1<<k) & i) && f[j][k] == 1) cover++;
}
tmp += p[j][cover];
}
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
} |
#include <iostream>
#include <cstring>
using namespace std;
int main(int argc, char *argv[]) {
int f[100][15],p[100][15],temp[100];
int i,j,k,n,r,t;
cin >> n;
for(i=0;i<n;i++)
for(j=0;j<10;j++)
cin >> f[i][j];
for(i=0;i<n;i++)
for(j=0;j<=10;j++)
cin >> p[i][j];
r=-2147483647;
for(i=1;i<(1<<10);i++){
memset(temp,0,sizeof(temp));
for(j=0;j<n;j++)
for(k=0;k<10;k++)
if((f[j][k])&&((i>>k)&1))
temp[j]++;
t=0;
for(j=0;j<n;j++)
t+=p[j][temp[j]];
r=max(r,t);
}
cout << r;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
int N, ans=-1e9;
cin >> N;
int F[N][10], P[N][11];
for(int i=0; i<N; i++){
for(int j=0; j<10; j++){
cin >> F[i][j];
}
}
for(int i=0; i<N; i++){
for(int j=0; j<11; j++){
cin >> P[i][j];
}
}
for(int k=1; k<1024; k++){
int tmp3=0;
for(int i=0; i<N; i++){
int tmp=k;
int tmp2=0;
for(int j=0; j<10; j++){
if((tmp&1) && F[i][j]==1)
tmp2++;
tmp = tmp>>1;
}
tmp3+=P[i][tmp2];
}
ans = max(ans, tmp3);
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<vector<int>> f(n,vector<int>(10));
for(int i=0;i<n;i++){
for(int j=0;j<10;j++){
cin >> f[i][j];
}
}
vector<vector<int>> p(n,vector<int>(11));
for(int i=0;i<n;i++){
for(int j=0;j<11;j++){
cin >> p[i][j];
}
}
int ans=-(1<<30);
for(int bit=1;bit<(1<<10);bit++){
int cc=0;
for(int i=0;i<n;i++){
int c=0;
for(int j=0;j<10;j++){
if(bit>>j&1&&f[i][j]){
c++;
}
}
cc+=p[i][c];
}
ans=max(ans,cc);
}
cout << ans << endl;
} |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N, F[100][10], P[100][11], ans = -1000000000, c, cc;
cin >> N;
for (int i = 0; i < N; i++) {
for (int j = 0; j < 10; j++) {
cin >> F[i][j];
}
}
for (int i = 0; i < N; i++) {
for (int j = 0; j <= 10; j++) {
cin >> P[i][j];
}
}
for (int i = 1; i < 1024; i++) {
cc = 0;
for (int j = 0; j < N; j++) {
int X = i;
c = 0;
for (int k = 0; k < 10; k++) {
if (X % 2 == 1 && F[j][k] == 1) {
c++;
}
X /= 2;
}
cc += P[j][c];
}
ans = max(ans, cc);
}
cout << ans;
} |
#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=a;i<(b);i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
int N;
int F[111][22];
int P[111][13];
int main() {
cin >> N;
rep(i, N) rep(j, 10) {
cin >> F[i][j];
}
rep(i, N) rep(j, 11) {
cin >> P[i][j];
}
int64_t ans = -(1LL<<60);
REP(S, 1, 1<<10) {
int64_t cand = 0;
rep(i, N) {
int C = 0;
rep(k, 10) {
if ((S >> k & 1) && F[i][k]) { C++; }
}
cand += P[i][C];
}
ans = max(ans, cand);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int n, f[110][11], p[110][11], ans = -(1 << 30), cnt, c;
int main(){
cin >> n;
rep(i, n) {
rep(j, 10) {
cin >> f[i][j];
}
}
rep(i, n) {
rep(j, 11) {
cin >> p[i][j];
}
}
for (int i = 1;i < (1 << 10);i++) {
cnt = 0;
rep(j, n) {
c = 0;
rep(k, 10)if ((i >> k & 1) && f[j][k]) c++;
cnt += p[j][c];
}
ans = max(ans, cnt);
}
cout << ans << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int ans = -INT_MAX, n, p[100][11];
bool f[100][10];
int main(){
cin >> n;
for(int i = 0; i < n; ++i) for(int j = 0; j < 10; ++j) cin >> f[i][j];
for(int i = 0; i < n; ++i) for(int j = 0; j <= 10; ++j) cin >> p[i][j];
for(int b = 1; b < (1<<10); ++b){
bitset<10> bit = b;
int benefit = 0;
for(int i = 0; i < n; ++i){
int d = 0;
for(int j = 0; j < 10; ++j) if(bit[9-j]&&f[i][j]) d++;
benefit += p[i][d];
}
ans = max(ans, benefit);
}
cout << ans << endl;
} |
#include <iostream>
#include <climits>
#include <cmath>
using namespace std;
bool f[101][10];
int p[101][11];
int main(){
int n;
int max = INT_MIN;
cin >> n;
for(int i=0; i< n; i++){
for(int j=0; j< 10; j++){
cin >> f[i][j];
}
}
for(int i=0; i< n; i++){
for(int j=0; j< 11; j++){
cin >> p[i][j];
}
}
for(int i=1; i< 1 << 10; i++){
int tmp = 0;
for(int k=0; k< n; k++){
int count = 0;
for(int j=0; j< 10; j++){
if(i & 1 << j && f[k][j]){
count++;
}
}
tmp += p[k][count];
}
if(tmp > max) max = tmp;
}
cout << max;
return 0;
}
|
#include <stdio.h>
int main(void){
int n,i,j,l,o,ky,b,k,ans=-1000000000,md[100]={},my[100][11];
int w[10]={1,2,4,8,16,32,64,128,256,512};
scanf("%d",&n);
for (i=0;i<n;i++){
for (j=0;j<10;j++){
scanf("%d",&b);
md[i]+=w[j]*b;
}
}
for (i=0;i<n;i++){
for (j=0;j<11;j++){
scanf("%d",&my[i][j]);
}
}
for (i=1;i<1024;i++){
k=0;
for (j=0;j<n;j++){
o=i&md[j];
ky=0;
for (l=0;l<10;l++){
if (o&w[l]) ky++;
}
k+=my[j][ky];
}
if (ans<k) ans=k;
}
printf("%d\n",ans);
return 0;
} |
#include <stdio.h>
#include <algorithm>
int N, ans = -2147483648;
int F[100][10];
int P[100][11];
int main()
{
scanf("%d", &N);
for (int i = 0; i < N; i++)
{
for (int j = 0; j < 10; j++) scanf("%d", &F[i][j]);
}
for (int i = 0; i < N; i++)
{
for (int j = 0; j < 11; j++) scanf("%d", &P[i][j]);
}
for (int i = 1; i <= 1023; i++)
{
int sum = 0;
for (int j = 0; j < N; j++)
{
int cnt = 0;
for (int k = 0; k < 10; k++)
{
if (F[j][k] == 1 && (i&(1 << k)) > 0) cnt++;
}
sum += P[j][cnt];
}
ans = std::max(ans, sum);
}
printf("%d\n", ans);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int F[101][11],P[101][11];
int main(){
int N;
cin>>N;
for(int i=0;i<N;i++){
for(int j=0;j<10;j++){
cin>>F[i][j];
}
}
for(int i=0;i<N;i++){
for(int j=0;j<11;j++){
cin>>P[i][j];
}
}
long ans=LONG_MIN;
for(int i=1;i<1<<10;i++){
long cost=0;
for(int k=0;k<N;k++){
long cnt=0;
for(int j=0;j<10;j++)if((i&1<<j)&&F[k][j])cnt++;
cost+=P[k][cnt];
}
ans=max(ans,cost);
}
cout<<ans<<endl;
}
|
// C - Shopping Street
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
#define rp(i,s,e) for(int i=(int)(s);i<(int)(e);++i)
int c(int open_pattern, vi &fi){
int ret = 0;
rp(j, 0, 10) if(open_pattern>>j & 1 && fi[j]) ret++;
return ret;
}
int main(){
int n; cin>>n;
vvi F(n, vi(10));
rp(i, 0, n) rp(j, 0, 10) cin>>F[i][j];
vvi P(n, vi(10+1));
rp(i, 0, n) rp(j, 0, 10+1) cin>>P[i][j];
int64_t ans = -10000000*100;
rp(i, 1, 1<<10){
int64_t s = 0;
rp(j, 0, n) s += P[j][c(i, F[j])];
ans = max(ans, s);
}
cout<< ans <<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
bool open[105][15];
long long p[105][15];
long long cal(int x)
{
long long ret=0;
for(int i=1;i<=n;i++)
{
int sum=0;
for(int j=0;j<=9;j++)
if(open[i][j] && (x&(1<<j))) sum++;
ret+=p[i][sum];
}
return ret;
}
int main()
{
cin >> n;
for(int i=1;i<=n;i++)
for(int j=0;j<=9;j++)
cin >> open[i][j];
for(int i=1;i<=n;i++)
for(int j=0;j<=10;j++)
cin >> p[i][j];
long long res=-(1<<30);
for(int i=1;i<=1023;i++)
{
long long temp=cal(i);
res=max(res,temp);
}
cout << res;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
int F[100][10];
int P[100][11];
cin >> N;
for(int i=0; i<N; i++){
for(int j=0; j<10; j++){
cin >> F[i][j];
}
}
for(int i=0; i<N; i++){
for(int j=0; j<11; j++){
cin >> P[i][j];
}
}
int result=-1000000000;
for(int i=1; i<(1<<10); i++){
int temp=0;
for(int j=0; j<N; j++){
int c=0;
for(int k=0; k<10; k++){
if(((i&(1<<k))>0)&&(F[j][k]==1)) c++;
}
temp+=P[j][c];
}
result=max(result,temp);
}
cout << result << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)
#define maxch(res,x) res=max(res,x)
#define INF 1e9
bitset<10> f[100];
int p[100][11];
int main(void){
int n;
cin>>n;
rep(i,n){
rep(j,10) {
bool bit;
cin>>bit;
f[i][j] = bit;
}
}
rep(i,n)rep(j,11) cin>>p[i][j];
int res = -INF;
rep(mask,1<<10)if(mask){
int sum = 0;
rep(i,n){
sum += p[i][(bitset<10>(mask) & f[i]).count()];
}
maxch(res,sum);
}
cout<<res<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define FOR(i,l,r) for(i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define F first
#define S second
signed main(){
ll N,i,j,k,ans=-1000000000;
cin>>N;bool F[N][10];ll P[N][11];
REP(i,N)REP(j,10)cin>>F[i][j];
REP(i,N)REP(j,11)cin>>P[i][j];
FOR(i,1,1024){
bool X[10];ll c,rieki=0;
REP(j,10)X[j]=((1<<j)&i)>0;
REP(j,N){
c=0;
REP(k,10)if(X[k]&&F[j][k])c++;
rieki+=P[j][c];
}
ans=max(ans,rieki);
}
cout<<ans<<endl;
return 0;
} |
#include <algorithm>
#include <bitset>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, ans = INT_MIN;
cin >> N;
vector<vector<int>> F(N, vector<int>(10)), P(N, vector<int>(11));
for (vector<int>& i : F) {
for (int& j : i) cin >> j;
}
for (vector<int>& i : P) {
for (int& j : i) cin >> j;
}
for (int i = 1; i < 1024; i++) {
bitset<10> a = i;
int b = 0;
for (int j = 0; j < N; j++) {
int c = 0;
for (int k = 0; k < 10; k++) {
if (F[j][k] == 1 && a[k]) c++;
}
b += P[j][c];
}
ans = max(ans, b);
}
cout << ans;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,res;
cin>>n;
vector<vector<int>> f(n,vector<int>(10)),p(n,vector<int>(11));
for(auto& v:f)for(int& i:v)cin>>i;
for(auto& v:p)for(int& i:v)cin>>i;
for(int i=1;i<(1<<10);++i){
vector<int> c(n,0);
for(int j=0;(i>>j)>0;++j){
if((i>>j)&1)for(int s=0;s<n;++s){
if(f[s][j])++c[s];
}
}
int sum=0;
for(int j=0;j<n;++j)sum+=p[j][c[j]];
if(i>1)res=max(res,sum);
else res=sum;
}
cout<<res;
} |
#include <bits/stdc++.h>
using namespace std;
int N;
int A[100][14],B[100][15];
int main(){
cin >> N;
for(int i=0;i<N;i++){
for(int j=0;j<10;j++)
cin >> A[i][j];
}
for(int i=0;i<N;i++){
for(int j=0;j<11;j++)
cin >> B[i][j];
}
int res=INT_MIN;
for(int b=1;b<(1<<10);b++){
int cc=0;
for(int i=0;i<N;i++){
int c=0;
for(int j=0;j<10;j++){
if((b>>j&1) && A[i][j])
c++;
}
cc+=B[i][c];
}
res=max(res,cc);
}
printf ("%d\n",res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const ll M = 1e9 + 7;
int si[8] = {-1,0,1,-1,1,-1,0,1};
int sj[8] = {-1,-1,-1,0,0,1,1,1};
int main() {
int n;
cin >> n;
int f[n][10];
rep(i,n) rep(j,10) cin >> f[i][j];
vector<vector<ll>> p(n, vector<ll>(10));
rep(i,n) rep(j,11) cin >> p[i][j];
ll ans = -1 * M;
rep(b, (1 << 10) - 1){
ll x = 0;
rep(i, n) {
int c = 0;
rep(k, 10) if (((b+1) >> k) & 1 && f[i][k]) c++;
x += p[i][c];
}
ans = max(ans,x);
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
auto f = vector<vector<int>>(n, vector<int>(10));
auto p = vector<vector<int>>(n, vector<int>(11));
for(auto&& g : f) for(auto&& h : g) cin >> h;
for(auto&& q : p) for(auto&& r : q) cin >> r;
int ans = -1000000007;
for(auto i = 1; i < 1 << 10; ++i){
int sum = 0;
for(auto j = 0; j < n; ++j){
int cnt = 0;
for(auto k = 0, t = i; k < 10 && t > 0; ++k, t >>= 1){
if(t % 2 && f[j][k]) ++cnt;
}
sum += p[j][cnt];
}
ans = max(ans, sum);
}
cout << ans << endl;
return 0;
} |
#include <iostream>
#include <cstdio>
using namespace std;
int n, s, mx=-1e9, d, f[105][15], p[105][15];
int main() {
int i, j, k;
cin>>n;
for(i=1; i<=n; i++) for(j=1; j<=10; j++) cin>>f[i][j];
for(i=1; i<=n; i++) for(j=0; j<=10; j++) cin>>p[i][j];
for(k=1; k<1024; k++) {
for(j=0; j<10; j++) f[0][j+1] = k & (1<<j);
s = 0;
for(i=1; i<=n; i++) {
for(j=1, d=0; j<=10; j++) d += f[0][j] && f[i][j];
s += p[i][d];
}
mx = max(mx, s);
}
cout<<mx;
return 0;
} |
#include<iostream>
#include<algorithm>
typedef long long lint;
using namespace std;
int main()
{
int N;
int F[110][15]={};
int P[110][15]={};
int c;
lint tmp,ans=-9e18;
cin >> N;
for(int i=0;i<N;i++)
for(int j=0;j<10;j++)
cin >> F[i][j];
for(int i=0;i<N;i++)
for(int j=0;j<11;j++)
cin >> P[i][j];
for(int i=1;i<(1<<10);i++)
{
tmp=0;
for(int j=0;j<N;j++)
{
c=0;
for(int k=0;k<10;k++)
if(F[j][k]==1 && (i>>k)&1==1)c++;
tmp+=P[j][c];
}
ans=max(ans,tmp);
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll l1[10];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,sm=-(1<<30);
cin>>n;ll f[n+1][11],p[n+1][11];
for(int i=1;i<=n;i++){
for(int j=1;j<=10;j++)cin>>f[i][j];
}
for(int i=1;i<=n;i++){
for(int j=0;j<=10;j++)cin>>p[i][j];
}
ll b=(1<<10);
for(int i=1;i<b;i++){ll s=0;
for(int j=1;j<=n;j++){ll c=0;
for(int k=9;k>=0;k--)if(((i>>k)&1)&&f[j][10-k])c++;
s+=p[j][c];
}
//cout<<s<<endl;
sm=max(sm,s);
}
cout<<sm<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(void){
int n; cin >> n;
ll f[n][10], p[n][11];
for(int i=0;i<n;i++) for(int j=0;j<10;j++) cin >> f[i][j];
for(int i=0;i<n;i++) for(int j=0;j<11;j++) cin >> p[i][j];
ll ans=-1*pow(10,10);
for(int i=1;i<(1<<10);i++){
ll tmp=0;
for(int j=0;j<n;j++){
ll cnt=0;
for(int k=0;k<10;k++) if((i>>k&1)==1 && f[j][k]==1) cnt++;
tmp += p[j][cnt];
}
if(ans<tmp) ans = tmp;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin >> n;
int f[n][10], p[n][11];
for(int i = 0; i < n; i++)
for(int j = 0; j < 10; j++) cin >> f[i][j];
for(int i = 0; i < n; i++)
for(int j = 0; j < 11; j++) cin >> p[i][j];
int res = -(1 << 30);
for(int b = 1; b < (1 << 10); b++){
int cc = 0;
for(int i = 0; i < n; i++){
int c = 0;
for(int j = 0; j < 10; j++)
if((b >> j & 1) && f[i][j]) c++;
cc += p[i][c];
}
res = max(cc, res);
}
cout << res << endl;
return 0;
} |
#include<iostream>
using namespace std;
int main()
{
int n;
long long mon[110][11];
bool opened[110][10];
int ns;
int i,j,k,f;
long long hif=-(1<<30),rnf=0;
bool ft=false;
cin>>n;
for(i=0;i<n;i++)
{
for(j=0;j<10;j++)
{
cin>>opened[i][j];
}
}
for(i=0;i<n;i++)
{
for(j=0;j<11;j++)
{
cin>>mon[i][j];
}
}
for(ns=1;ns<(1<<10);ns++){
rnf=0;
for(i=0;i<n;i++)
{
f=0;
for(j=0;j<10;j++)
{
if(opened[i][j]&&((ns>>j)&1))
{
f++;
}
}
rnf+=mon[i][f];
}
if((rnf>hif)&&ft)
{
hif=rnf;
}
ft=true;
}
cout<<hif;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
#define pb push_back
#define fr(i,n) for(int i=0;i<n;i++)
#define Fr(i,n) for(int i=0;i++<n;)
#define ifr(i,n) for(int i=n-1;i>=0;i--)
#define iFr(i,n) for(int i=n;i>0;i--)
ll n,p[110][11],ans=-1e10,c,kari;
bool f[110][11];
int main(){
cin>>n;
fr(i,n) fr(j,10) cin>>f[i][j];
fr(i,n) fr(j,11) cin>>p[i][j];
fr(i,1<<10){
if(i==0) continue;
kari=0;
fr(j,n){
c=0;
fr(k,10) if((i>>k)&f[j][k]) c++;
kari+=p[j][c];
}
ans=max(ans,kari);
}
cout<<ans<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
int f[110][15];
int p[110][15];
rep(i,n){
rep(j,10){
cin >> f[i][j];
}
}
rep(i,n){
rep(j,11){
cin >> p[i][j];
}
}
ll ans=-1000000000000000;
for(int bit=0; bit<(1<<10); bit++){
ll cc=0;
if(bit==0) continue;
for(int i=0; i<n; i++){
int c=0;
for(int j=0; j<10; j++){
if(bit&1<<j && f[i][j]) c++;
}
cc+=p[i][c];
}
//cout << cc << endl;
ans=max(ans,cc);
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
typedef long long ll;
int main(){
ll n;cin>>n;
ll f[1000][10],p[1000][11];
rep(i,0,n)rep(j,0,10)cin>>f[i][j];
rep(i,0,n)rep(j,0,11)cin>>p[i][j];
ll MAX=-99999999999,cn,an;
for(int i=1;i<(1<<10);i++){
an=0;
rep(j,0,n){
cn=0;
rep(k,0,10){
if((i&(1<<k))&&f[j][k])cn++;
}
an+=p[j][cn];
}
MAX=max(MAX,an);
}
cout<<MAX<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int(i)=0;i<(n);i++)
int main(){
int n,ans=-1e9;cin>>n;
vector<vector<bool>> f(n,vector<bool>(10,0));
REP(i,n) REP(j,10){
bool t;cin>>t;
if(t) f.at(i).at(j)=1;
}
vector<vector<int>> p(n,vector<int>(11));
REP(i,n) REP(j,11) cin>>p.at(i).at(j);
for(int i=1;i<=1023;i++){
int profit=0;
REP(k,n){
int count=0;
REP(j,10){
if((i&(1<<j)) && f.at(k).at(9-j)) count++;
}
profit+=p.at(k).at(count);
}
ans=max(ans,profit);
}
cout<<ans;
} |
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int n;
cin >> n;
int f[110] = {};
for (int i = 0;i < n;i++) {
for (int j = 0;j < 10;j++) {
int a;
cin >> a;
f[i] += a << (9 - j);
}
}
int p[n][11];
for (int i = 0;i < n;i++) {
for (int j = 0;j <= 10;j++) {
cin >> p[i][j];
}
}
int ans = -1e9;
for (int i = 1;i < (1 << 10);i++) {
int cost = 0;
for (int j = 0;j < n;j++) {
cost += p[j][__builtin_popcount(f[j] & i)];
}
ans = max(ans, cost);
}
cout << ans << endl;
} |
//#pragma GCC diagnostic error "-std=c++11"
#include <bits/stdc++.h>
using namespace std;
#include<iostream>
#include<bitset>
using namespace std;
typedef bitset<12> bit;
const int N=107;
int n,i,j,m,mp[N][12],x,ans=-2e9,res;
bit s[N],tmp;
int main(){
ios::sync_with_stdio(false);cin.tie(0);
for(cin>>n,i=1;i<=n;++i)for(j=0;j<10;++j)cin>>x,s[i][j]=x;
for(i=1;i<=n;++i)for(j=0;j<=10;++j)cin>>mp[i][j];
for(m=(1<<10)-1,i=1;i<=m;++i){
tmp=bit(i);
for(res=0,j=1;j<=n;++j)res+=mp[j][(tmp&s[j]).count()];
ans=max(ans,res);
}
cout<<ans<<endl;
return 0;
} |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
int n;
int f[100][14];
int p[100][15];
cin >> n;
rep(i, n) rep(j, 10) cin >> f[i][j];
rep(i, n) rep(j, 11) cin >> p[i][j];
int ans = -1e9;
rep(bit, (1<<10)) {
if (bit == 0) continue;
int sum = 0;
rep(i, n) {
int c = 0;
rep(j, 10) if (bit & (1<<j)) if (f[i][j]) c++;
sum += p[i][c];
}
ans = max(ans, sum);
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;cin>>N;
vector<bitset<10>>F(N);
for(int i=0;i<N;i++)for(int j=0;j<10;j++){int t;cin>>t;if(t)F[i].set(j);}
vector<vector<int>>P(N,vector<int>(11));
for(int i=0;i<N;i++)for(int j=0;j<=10;j++)cin>>P[i][j];
int M=INT_MIN;
for(int b=1;b<(1<<10);b++){
bitset<10>B=b;
int p=0;
for(int i=0;i<N;i++)p+=P[i][(B&F[i]).count()];
M=max(M,p);
}
cout<<M<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<N;i++)
#define mod 1000000007
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long ll;
int main(){
int N; cin>>N;
vvi F(N,vi(10)), P(N,vi(11));
rep(i,N) rep(j,10) cin>>F[i][j];
rep(i,N) rep(j,11) cin>>P[i][j];
ll ans = -1e9;
for(int i=1;i<(1<<10);i++){
ll bene = 0;
rep(j,N){
int cnt = 0;
rep(k,10) if(i & (1<<k) && F[j][k]) cnt++;
bene += P[j][cnt];
}
ans = max(ans,bene);
}
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
ll n, f[110][11], p[110][11], ans = -1e15;
cin >> n;
for (int i = 0; i < n; i++) for (int j = 0; j < 10; j++)cin >> f[i][j];
for (int i = 0; i < n; i++)for (int j = 0; j <= 10; j++)cin >> p[i][j];
for (int i = 1; i < 1024; i++) {
ll num = 0;
for (int j = 0; j < n; j++) {
ll cnt = 0;
for (int k = 0; k < 10; k++) {
if ((i&(1 << k))&&f[j][k])cnt++;
}
num += p[j][cnt];
}
ans = max(num, ans);
}
cout << ans << endl;
return 0;
}
|
#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
int main()
{
long long n,a[111][21],b[111][22],i,j,s,x,y,h,k,c[111];
scanf("%lld",&n);
for(i=0;i<n;i++)
for(j=0;j<10;j++)
scanf("%lld",&a[i][j]);
for(i=0;i<n;i++)
for(j=0;j<11;j++)
scanf("%lld",&b[i][j]);
for(i=1;i<1024;i++)
{
memset(c,0,sizeof(c));
x=i;k=0;
while(x)
{
y=x%2;
x/=2;
if(y==1)
for(j=0;j<n;j++)
{
if(a[j][k])
c[j]++;
}
k++;
}
h=0;
for(j=0;j<n;j++)
{
h+=b[j][c[j]];
}
if(i==1)
s=h;
if(s<h)s=h;
}
printf("%lld\n",s);
} |
#include<stdio.h>
int main()
{
int i,j,n,m,t,p,max=-1000000001,day[101][10],money[101][11],bit[10];
scanf("%d",&n);
for(i=0;i<n;i++)
for(j=0;j<10;j++)
scanf("%d",&day[i][j]);
for(i=0;i<n;i++)
for(j=0;j<11;j++)
scanf("%d",&money[i][j]);
for(int i=1;i<1024;i++)
{
int t = i;
int len = 0;
for(int j=0;j<10;j++)
{
bit[len++] = t%2;
t= t/2;
}
int m = 0;
int sum = 0;
for(t=0;t<n;t++)
{
m=0;
for(p=0;p<10;p++)
if(bit[p]==1&&day[t][p]==1)
{
m++;
}
sum+= money[t][m];
}
if(sum>max)
max=sum;
}
printf("%d",max);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
inline int read() {
int res=0,fh=1;
char ch=getchar();
while((ch>'9'||ch<'0')&&ch!='-')ch=getchar();
if(ch=='-')fh=-1,ch=getchar();
while(ch>='0'&&ch<='9')res=res*10+ch-'0',ch=getchar();
return fh*res;
}
const int maxn=16;
int n,m,mxs,sum[(1<<16)+12],a[maxn][maxn];
int f[(1<<maxn)][maxn];
inline int Max(int a,int b){return a>b?a:b;}
int main(){
n=read(),m=read();
mxs=(1<<n)-1;
for(int i=1;i<=m;i++){
int x=read()-1,y=read()-1,z=read();
a[x][y]=a[y][x]=z;
}
for(int i=0;i<=mxs;i++){
sum[i]=0;
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];
}
memset(f,-1,sizeof f);
f[1][0]=0;
for(int i=1;i<=mxs;i+=2){
for(int j=0;j<n;j++){
if(f[i][j]==-1) continue;
if(!(i&(1<<j))) continue;
for(int k=0;k<n;k++)
if(a[j][k]&&(!(i&(1<<k))))
f[i|(1<<k)][k]=Max(f[i|(1<<k)][k],f[i][j]+a[j][k]);
int c=(mxs-i)|(1<<j);
for(int k=c;k>=0;k=(k==0?-1:(k-1)&c))
f[i|k][j]=Max(f[i][j]+sum[k],f[i|k][j]);
}
}
int ans=0;
for(int i=(mxs>>1)+2;i<=mxs;i+=2)
ans=Max(ans,f[i][n-1]);
printf("%d\n",sum[mxs]-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=1;i<(1<<n);i++){
if(i==1) dp[i][1]=0;
for(int j=1;j<=n;j++) if(i&(1<<(j-1))){
int xx=(1<<(j-1));
for(int k=1;k<=n;k++) if((!(i&(1<<(k-1))))&&(num[j][k]!=0)){
int yy=(1<<(k-1));
int sum=val[i^xx^yy]-val[i^xx];
dp[i^yy][k]=min(dp[i^yy][k],dp[i][j]+sum);
}
int zz=((1<<n)-1)^i;
for(int mask=zz;mask>0;mask=(mask-1)&zz){
int sum=val[i^xx^mask]-val[i^xx]-val[mask];
dp[i^mask][j]=min(dp[i^mask][j],dp[i][j]+sum);
}
}
}
cout<<dp[(1<<n)-1][n]<<endl;
return 0;
} |
#include<bits/stdc++.h>
#define Rint register int
using namespace std;
const int N = 15;
int n, m, lim, wsum, edge[N][N], sum[1 << N], dp[N][1 << N];
inline int cost(int S, int T){return sum[S | T] - sum[S] - sum[T];}
inline bool chkmax(int &a, int b){return (a < b) ? (a = b,1) : 0;}
int main(){
scanf("%d%d", &n, &m); lim = 1 << n;
for(Rint i = 1;i <= m;i ++){
int a, b, c;
scanf("%d%d%d", &a, &b, &c); -- a; -- b;
edge[a][b] = edge[b][a] = c; wsum += c;
}
for(Rint S = 1;S < lim;S ++)
for(Rint i = 0;i < n;i ++) if((S >> i) & 1)
for(Rint j = i + 1;j < n;j ++) if((S >> j) & 1)
sum[S] += edge[i][j];
memset(dp, 0x80, sizeof dp);
dp[0][1] = 0;
for(Rint S = 1;S < lim;S += 2)
for(Rint t = 0;t < n;t ++) if((S >> t) & 1){
for(Rint u = 0;u < n;u ++) if(!((S >> u) & 1) && edge[t][u])
chkmax(dp[u][S | (1 << u)], dp[t][S] + edge[t][u]);
int SS = (lim - 1) ^ S;
for(Rint T = SS;T;T = (T - 1) & SS)
chkmax(dp[t][S | T], dp[t][S] + sum[T | (1 << t)]);
}
printf("%d\n", wsum - dp[n - 1][lim - 1]);
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++)
#define pb push_back
typedef long long ll;
typedef pair<int, int> i_i;
const int MOD = 1e9 + 7;
const ll INF = LLONG_MAX / 2;
int main() {
int N, M; cin >> N >> M;
vector<int> a(M), b(M), c(M);
rep(i, M) cin >> a[i] >> b[i] >> c[i], a[i]--, b[i]--;
vector<vector<int> > adj(N, vector<int>(N));
rep(i, M) adj[a[i]][b[i]] = adj[b[i]][a[i]] = c[i];
vector<int> C(1<<N);
rep(S, 1<<N) rep(i, M) if ((S>>a[i] & 1) && (S>>b[i] & 1)) C[S] += c[i];
vector<vector<int> > dp(1<<N, vector<int>(N, -1));
dp[1][0] = 0;
rep(S, 1<<N) rep(u, N) if (dp[S][u] != -1) {
int _S = (1<<N) - 1 - S;
rep(v, N) if ((_S>>v & 1) && adj[u][v])
dp[S | 1 << v][v] = max(dp[S | 1 << v][v], dp[S][u] + adj[u][v]);
for (int T = _S; T; T = (T - 1) & _S)
dp[S | T][u] = max(dp[S | T][u], dp[S][u] + C[T | 1<<u]);
}
int ans = -dp.back()[N - 1];
rep(i, M) ans += c[i];
cout << ans << endl;
}
|
#include <cstdio>
#include <cstring>
inline void CMax(int &a,int b){a<b?a=b:0;}
int n,m,G[15][15],g[1<<15],f[1<<15][15],Sum;
int main()
{
scanf("%d%d",&n,&m),memset(f,-1,sizeof f),f[1][0]=0;
for(int i=1,x,y,z;i<=m;++i)
{
scanf("%d%d%d",&x,&y,&z),--x,--y,Sum+=z,G[x][y]=G[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)&&G[j][k])
CMax(f[1<<k|i][k],f[i][j]+G[j][k]);
for(int U=((1<<n)-1)^i,k=U;k;k=(k-1)&U)
CMax(f[i|k][j],f[i][j]+g[1<<j|k]);
}
return printf("%d\n",Sum-f[(1<<n)-1][n-1]),0;
} |
#include <bits/stdc++.h>
const int N = 15, inf = 0x3f3f3f3f;
int n, m, e[N][1 << N], dp[N][1 << N], sum[1 << N], mask;
#define ctz __builtin_ctz
#define for_bit(i, s) for (int _##i = s, i = ctz(_##i); _##i; i = ctz(_##i = _##i & _##i - 1))
void down(int &x, int y) { x = std::min(x, y); }
int main() {
std::ios::sync_with_stdio(0), std::cin.tie(0);
std::cin >> n >> m, mask = ~(-1 << n);
for (int i = 0, x, y, z; i < m; ++i)
std::cin >> x >> y >> z, --x, --y, e[x][1 << y] = e[y][1 << x] = z;
for (int i = 0; i < n; ++i)
for (int j = 1; j < 1 << n; ++j)
e[i][j] = e[i][j & -j] + e[i][j & j - 1];
std::memset(dp, 0x3f, sizeof dp), dp[0][1] = 0;
for (int s = 0; s <= mask; ++s)
for_bit(i, s) if (dp[i][s] != inf) {
int v = dp[i][s], c = mask ^ s;
if (i != n - 1) for_bit(j, c) if (e[i][1 << j]) down(dp[j][s | 1 << j], v + e[j][s ^ 1 << i]);
for (int p = c & c - 1; ; p = p - 1 & c) {
int q = c ^ p; sum[q] = sum[q & q - 1] + e[ctz(q)][s ^ 1 << i];
if (!p) break;
}
for (int p = c; p; p = p - 1 & c) down(dp[i][s | p], v + sum[p]);
}
std::cout << dp[n - 1][mask] << '\n';
return 0;
} |
#include <iostream>
#define llint long long
using namespace std;
llint n, m;
llint G[25][25];
llint sum[1<<15];
llint dp[1<<15][25];
int main(void)
{
cin >> n >> m;
llint u, v, w;
for(int i = 0; i < m; i++){
cin >> u >> v >> w;
u--, v--;
G[u][v] = G[v][u] = w;
}
int N = 1<<n;
for(int i = 0; i < N; i++){
for(int j = 0; j < n; j++){
for(int k = 0; k < n; k++){
if((i&(1<<j)) && (i&(1<<k))) sum[i] += G[j][k];
}
}
sum[i] /= 2;
}
for(int i = 0; i < N; i++){
for(int j = 0; j < n; j++) dp[i][j] = -1e18;
}
dp[1][0] = 0;
for(int i = 0; i < N; i++){
for(int j = 0; j < n; j++){
for(int k = 0; k < n; k++){
if(i&(1<<k)) continue;
if(G[j][k] > 0) dp[i|(1<<k)][k] = max(dp[i|(1<<k)][k], dp[i][j]+G[j][k]);
}
int S = (N-1)-i+(1<<j);
for(int k = S; k > 0; k = (k-1)&S){
if((k&(1<<j)) == 0) continue;
dp[i|k][j] = max(dp[i|k][j], dp[i][j]+sum[k]);
}
}
}
cout << sum[N-1] - dp[N-1][n-1] << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1<<15;
int n,m,c[15][15];
int p[N],dp[N][15];
void init()
{
memset(p,0,sizeof(p));
for(int i=0;i<(1<<n);i++)
for(int j=0;j<n;j++)
dp[i][j]=-1;
for(int i=0;i<(1<<n);i++)
{
for(int j=0;j<n;j++)
{
if(((i>>j)&1)==0)
continue;
for(int k=j+1;k<n;k++)
{
if(((i>>k)&1)==0)
continue;
p[i]+=c[j][k];
}
}
}
}
int main()
{
while(cin>>n>>m)
{
int sum=0;
int u,v,w;
memset(c,0,sizeof(c));
while(m--)
{
scanf("%d%d%d",&u,&v,&w);
u--,v--;
c[u][v]=c[v][u]=w;
sum+=w;
}
init();
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;
int x=(((1<<n)-1)^i)|(1<<j); //y is some subset of x
for(int y=x;y>=0;y--)
y&=x,dp[i|y][j]=max(dp[i|y][j],dp[i][j]+p[y]);
for(int k=0;k<n;k++)
{
if((i>>k)&1)
continue;
if(c[j][k]==0)
continue;
dp[i|(1<<k)][k]=max(dp[i|(1<<k)][k],dp[i][j]+c[j][k]);
}
}
}
int ans=1e9;
for(int i=0;i<(1<<n);i++)
ans=min(ans,sum-dp[i][n-1]);
cout<<ans<<endl;
}
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 l=1;l<=n;++l)if((tmp&(1<<l-1))&&g[l][j])dp[i|(1<<l-1)][l]=max(dp[i|(1<<l-1)][l],dp[i][j]+g[l][j]);
for(int k=tmp;k;k=(k-1)&tmp)dp[i|k][j]=max(dp[i|k][j],dp[i][j]+w[k|(1<<j-1)]);
}
}
printf("%d\n",sum-dp[(1<<n)-1][n]);return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define debug(...) fprintf(stderr, __VA_ARGS__)
const long long inf = 1e18;
int n, m, adj[15 + 5][15 + 5];
long long dp[(1 << 15) + 5][15 + 5];
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < m; ++i) {
int x, y, w;
scanf("%d%d%d", &x, &y, &w), --x, --y;
adj[x][y] = adj[y][x] = w;
}
// for (int i = 0; i < n; ++i) {
// for (int j = 0; j < n; ++j)
// debug("%d ", adj[i][j]);
// debug("\n");
// }
for (int i = 0; i < (1 << n); ++i)
for (int j = 0; j < n; ++j)
dp[i][j] = inf;
for (int i = 1; i < (1 << n); i += 2)
dp[i][0] = 0;
for (int i = 1; i < (1 << n); i += 2)
for (int j = i; j; (--j) &= i) {
if (j & 1) continue;
int t = i ^ j;
long long tot = 0;
for (int k = 0; k < n; ++k) {
if (~t & 1 << k) continue;
for (int p = 0; p < n; ++p)
if (j & 1 << p) tot += adj[k][p];
}
for (int l = 0; l < n; ++l) {
if (~t & 1 << l) continue;
for (int k = 0; k < n; ++k)
if (j & 1 << k && adj[l][k])
dp[i][k] = min(dp[i][k], dp[t][l] + tot - adj[l][k]);
}
}
printf("%lld\n", dp[(1 << n) - 1][n - 1]);
} |
#include<bits/stdc++.h>
#define MAXN 15
#define MAXM 505
#define LL long long
#define P int(1e9+7)
using namespace std;
int N,M;
int G[MAXN][MAXN];
int cost[1<<15];
int dp[MAXN][1<<15];
int main(){
cin>>N>>M;
int u,v,w;
int tot = 0;
for(int i=1;i<=M;i++){
cin>>u>>v>>w;
--u; --v;
G[u][v] = G[v][u] = w;
tot += w;
}
for(int s=1;s<(1<<N);s++){
for(u=0;u<N;u++){
if(((s>>u)&1)==0) continue;
for(int v=u+1;v<N;v++){
if(((s>>v)&1)==0) continue;
cost[s] += G[u][v];
}
}
//cout<<s<<" "<<cost[s]<<endl;
}
int ans = 0;
memset(dp, 0xf3, sizeof(dp));
dp[0][1] = 0;
int U = (1<<N) - 1;
for(int s=1;s<(1<<N);s++){
for(u=0;u<N;u++){
if(((s>>u)&1)==0 || dp[u][s]<0) continue;
//cout<<u<<" "<<s<<" "<<dp[u][s]<<endl;
if(u==N-1) ans = max(ans, dp[N-1][s]);
for(v=0;v<N;v++){
if(((s>>v)&1)==0 && G[u][v]){
dp[v][s|(1<<v)] = max(dp[v][s|(1<<v)], dp[u][s] + G[u][v]);
}
}
int s1 = (U^s)|(1<<u);
for(int s2=s1;s2>0;s2=(s2-1)&s1){
dp[u][s|s2] = max(dp[u][s|s2], dp[u][s] + cost[s2]);
}
}
}
cout<<tot - ans<<endl;
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;
int n,m,p[(1<<16)+2],ans,sum,f[(1<<16)+2][20],a[30][30];
int main()
{
scanf("%d%d",&n,&m);
int x,y,z;
memset(f,-1,sizeof(f));
for(int i=1;i<=m;i++)
{
scanf("%d%d%d",&x,&y,&z);
a[x][y]=z,a[y][x]=z;
sum+=z;
}
for(int i=1;i<(1<<n);i++)
{
for(int j=1;j<=n;j++)
{
if(1<<(j-1)&i)
{
for(int k=1;k<=n;k++)
{
if(1<<(k-1)&i)
{
p[i]+=a[j][k];
}
}
}
}
p[i]>>=1;
}
f[1][1]=0;
for(int i=1;i<(1<<n);i++)
{
for(int j=1;j<=n;j++)
{
if(f[i][j]==-1) continue;
for(int k=1;k<=n;k++)
{
if(i&(1<<(k-1))) continue;
if(!a[j][k]) continue;
f[i|(1<<(k-1))][k]=max(f[i|(1<<(k-1))][k],f[i][j]+a[j][k]);
}
int tmp=(((1<<n)-1)^i)|(1<<(j-1));
for(int k=tmp;k;k=(k-1)&tmp)
{
f[i|k][j]=max(f[i|k][j],f[i][j]+p[k]);
}
}
}
for(int i=1;i<(1<<n);i++)
{
ans=max(ans,f[i][n]);
}
cout<<sum-ans;
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int ha,n,m,i,j,x,y,w,k,mx,ans,sz[100010],f[50001][16],a[101][101];
int main(){
scanf("%d%d",&n,&m);
memset(f,-1,sizeof(f));
f[1][0]=0;
for(i=1;i<=m;i++){
scanf("%d%d%d",&x,&y,&w);
x--;y--;
a[x][y]=a[y][x]=w;
ans+=w;
}
mx=1<<n;
for(i=0;i<mx;i++){
for(j=0;j<n;j++)if(i&(1<<j))
for(k=j+1;k<n;k++)if(i&(1<<k))sz[i]+=a[j][k];
}
for(i=1;i<mx-1;i++)
for(j=0;j<n;j++)if(f[i][j]!=-1){
// printf("%d %d %d\n",i,j,f[i][j]);
for(k=0;k<n;k++)if((!(i&(1<<k)))&&a[j][k])f[i|1<<k][k]=max(f[i|1<<k][k],f[i][j]+a[j][k]);
for(k=(mx-1)^i;k;k=(k-1)&((mx-1)^i))if(!(k&(1<<n-1)))f[i|k][j]=max(f[i|k][j],f[i][j]+sz[k|1<<j]);
}
//printf("%d\n",mx);
for(i=1;i<mx;i++){
ha=max(ha,f[i][n-1]);
//printf("%d %d %d\n",i,n-1,f[i][n-1]);
}
printf("%d",ans-ha);
}
/*
一道挺好想的dp，
最后的路径一定是一条从s到t的链和在链上的点向外挂出去的一些联通分量。
那么就可以dp表示到了i与s联通的集合为j
*/ |
#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;
}
/*
for(int i=0;i<n;i++)
for(int j=0;j<(1<<n);j++)
if(!(i&(1<<j)))
for(int k=0;k<n;k++)
if(i&(1<<k))
h[i][j]=max(h[i][j],e[i][k]);
*/
memset(f,-1,sizeof(f));
for(int i=0;i<(1<<n);i++)
if(i&1) f[0][i]=g[i];
// cout<<f[0][7]<<endl;
for(int i=1;i<(1<<n);i++)
for(int j=0;j<n;j++)
// { cout<<i<<' '<<j<<' '<<f[i][j]<<endl;
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 <bits/stdc++.h>
#define in(x, S) (S & (1 << (x - 1)))
using namespace std;
const int MAXN = 15 + 10, MAXSTATUS = (1 << 15) + 10;
int n, m, e[MAXN][MAXN], g[MAXSTATUS], f[MAXN][MAXSTATUS], num;
int main() {
scanf("%d %d", &n, &m);
for (int i = 1, u, v, w; i <= m; ++i) {
scanf("%d %d %d", &u, &v, &w), num += w;
e[u][v] = e[v][u] = w;
}
int MAXS = 1 << n;
for (int S = 0; S < MAXS; ++S) {
for (int i = 1; i <= n; ++i) {
for (int j = i + 1; j <= n; ++j) {
if (in(i, S) && in(j, S) && e[i][j]) g[S] += e[i][j];
}
}
}
memset(f, -1, sizeof f);
f[1][1] = 0;
for (int S = 1; S < MAXS; ++S) {
for (int i = 1; i <= n; ++i) if (in(i, S) && f[i][S] != -1) {
for (int j = 1; j <= n; ++j) {
if (!in(j, S) && e[i][j]) {
f[j][S | (1 << (j - 1))] = max(f[j][S | (1 << (j - 1))], f[i][S] + e[i][j]);
}
}
for (int tmp = (MAXS - 1) ^ S, T = tmp; T; T = (T - 1) & tmp) {
f[i][S | T] = max(f[i][S | T], f[i][S] + g[T | (1 << (i - 1))]);
}
}
}
printf("%d\n", num - f[n][MAXS - 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::sync_with_stdio(0), cin.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 = 0; m < (1<<N); m++) {
for (int i = 0; i < N; i++) {
dp[m][i] = -INF;
}
}
dp[1][0] = 0;
for (int m = 1; m < (1<<N); m++) {
for (int i = 0; i < N; i++) {
if (dp[m][i] == -INF) continue;
for (int j = 0; j < N; j++) {
if (m & (1 << j)) continue;
if (W[i][j] == 0) continue;
dp[m | (1 << j)][j] = max(dp[m | (1 << j)][j], dp[m][i] + W[i][j]);
}
int c = (1 << N) - 1 - m;
for (int v = c; v; v = (v-1) & c) {
dp[m|v][i] = max(dp[m|v][i], dp[m][i] + V[v | (1 << i)]);
}
}
}
cout << tot - dp[(1<<N)-1][N-1] << '\n';
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define D isdigit(c=getchar())
inline int getint(){
int c,l=0,x;
for (;!D;l=c)if(c==EOF)return 1<<31;
for (x=c-'0';D;x=x*10+c-'0')if(c==EOF) break;
return l=='-'?-x:x;
}
int dist[16][16],f[1<<16],dp[16][1<<16],g[1<<16][16],n,m;
int main(){
n=getint();m=getint();
for(int i=1;i<=m;i++){
int x=getint(),y=getint();
dist[x][y]=dist[y][x]=getint();
}
for(int i=0;i<(1<<n);i++)
for(int j=1;j<=n;j++)
for(int k=1;k<=n;k++)
if((i&(1<<j-1))&&(!(i&(1<<k-1))))f[i]+=dist[j][k];
memset(dp,0x3f,sizeof(dp));
for(int i=0;i<(1<<n);i++)
if(i&1){
dp[1][i]=f[i];
for(int j=1;j<=n;j++)if(dist[1][j])g[i][j]=1;
}
for(int i=1;i<(1<<n);i++)if(i&1){
for(int k=2;k<=n;k++)if(i&(1<<k-1)){
for(int j=i-(1<<k-1);j;j=j-1&i-(1<<k-1))if(j&1){
int l=g[j][k];if(!l)continue;
dp[k][i]=min(dp[k][i],dp[l][j]-2*dist[l][k]+f[i-j]);
}
// printf("dp[%d][%d]=%d\n",k,i,dp[k][i]);
}
for(int k=1;k<=n;k++){
int mx=0x3f3f3f3f;g[i][k]=0;
for(int l=1;l<=n;l++)if(i&(1<<l-1)&&dist[l][k]&&dp[l][i]-2*dist[l][k]<mx){
mx=dp[l][i]-2*dist[l][k];g[i][k]=l;
}
}
}
printf("%d\n",dp[n][(1<<n)-1]/2);
return 0;
}
//MainFunction
|
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
typedef long long ll ;
#define rep(i, a, b) for (int i = a; i <= b; ++ i)
const int N = 15 + 5, inf = 1e9 + 7 ;
using namespace std ;
int n, m, g[N][N], f[N][(1 << 15) + 5], G[(1 << 15) + 5][N] ;
inline void upd(int &x, int y) { if (y < x) x = y ; }
int main() {
scanf("%d%d", &n, &m) ;
int x, y, z ;
rep(i, 1, m) {
scanf("%d%d%d", &x, &y, &z) ;
g[x][y] = g[y][x] = z ;
}
m = (1 << n) - 1 ;
rep(i, 1, m) rep(j, 1, n) if ((i >> (j - 1)) & 1) rep(k, 1, n) G[i][k] += g[j][k] ;
rep(i, 1, n) rep(j, 1, m) f[i][j] = inf ;
f[1][1] = 0 ;
rep(j, 1, m) {
rep(i, 1, n) if ((j >> (i - 1)) & 1) rep(x, 1, n) if (!((j >> (x - 1)) & 1) && g[x][i])
upd(f[x][j | (1 << (x - 1))], f[i][j] + G[j][x] - g[x][i]) ;
int st = m ^ j ;
for (int x = st ; x; x = (x - 1) & st) {
int cost = 0 ;
rep(i, 1, n) if ((x >> (i - 1)) & 1) cost += G[j][i] ;
rep(i, 1, n) upd(f[i][j ^ x], f[i][j] + cost - G[x][i]) ;
}
}
printf("%d\n", f[n][m]) ;
return 0 ;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
const int MAXN = 15;
struct edg{
int s, e, x;
};
vector<edg> v;
int cyc[1 << MAXN];
int dp[1 << MAXN][MAXN];
int adj[MAXN][MAXN];
int n, m;
int main(){
scanf("%d %d",&n,&m);
for(int i=0; i<MAXN; i++){
for(int j=0; j<MAXN; j++){
adj[i][j] = -1e9;
}
}
int ans = 0;
for(int i=0; i<m; i++){
int s, e, x;
scanf("%d %d %d",&s,&e,&x);
adj[s-1][e-1] = x;
adj[e-1][s-1] = x;
v.push_back({s-1, e-1, x});
}
for(int i=0; i<(1<<n); i++){
for(auto &j : v){
if((i >> j.s) % 2 == 1 & (i >> j.e) % 2 == 1){
cyc[i] += j.x;
}
}
}
for(int i=0; i<(1<<n); i++){
for(int j=0; j<n; j++){
dp[i][j] = -1e9;
if((i >> j) % 2 == 0){
continue;
}
if(j == 0){
dp[i][j] = cyc[i];
}
for(int k=i; k; k=(k-1)&i){
if((k >> j) % 2 == 0) continue;
for(int l=0; l<n; l++){
dp[i][j] = max(dp[i][j], dp[i^k][l] + adj[l][j] + cyc[k]);
}
}
}
}
int ret = dp[(1<<n)-1][n-1];
for(auto &i : v) ret -= i.x;
cout << -ret << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n,m,edge[20][20];
long long ans=0,sum[1<<16],dp[1<<16][20];
int main(){
scanf("%d %d",&n,&m);
for(int i=1,u,v,w;i<=m;i++){
scanf("%d %d %d",&u,&v,&w);
edge[u][v]=edge[v][u]=w;
ans+=w;
}
int tmp=(1<<n);
for(int S=0;S<tmp;S++){
for(int i=1;i<=n;i++){
dp[S][i]=-1;
if(!(S&(1<<(i-1)))&&!sum[S|(1<<(i-1))]){
sum[S|(1<<(i-1))]=sum[S];
for(int j=1;j<=n;j++){
if(S&(1<<(j-1))) sum[S|(1<<(i-1))]+=edge[i][j];
}
}
}
}
dp[1][1]=0;
for(int S=0;S<tmp;S++){
for(int i=1;i<=n;i++){
if(dp[S][i]<0) continue;
if(S&(1<<(i-1))){
for(int j=1;j<=n;j++){
if(!(S&(1<<(j-1)))&&edge[i][j]){
dp[S|(1<<(j-1))][j]=max(dp[S][i]+edge[i][j],dp[S|(1<<(j-1))][j]);
}
}
int now=((tmp-1)^S)|(1<<(i-1));
for(int M=now;M;M=(M-1)&now){
if(M&(1<<(i-1))) dp[S|M][i]=max(dp[S][i]+sum[M],dp[S|M][i]);
}
}
}
}
printf("%lld\n",ans-dp[tmp-1][n]);
} |
#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] = 1e9;
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
*/
|
#include<bits/stdc++.h>
using namespace std;
const int N=17;
int n,m,G[N][N],g[1<<N],f[1<<N][N],sum=0;
int main() {
cin>>n>>m;
for(int i=1,a,b,c;i<=m;i++) {
cin>>a>>b>>c;--a,--b;sum+=c;
G[a][b]=G[b][a]=c;
for(int j=0;j<(1<<n);j++)
if((j>>a&1)&&(j>>b&1)) g[j]+=c;
}
memset(f,-1,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]) {
for(int 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]);
for(int all=((1<<n)-1)^i,k=all;k;k=(k-1)&all)
f[i|k][j]=max(f[i|k][j],f[i][j]+g[k|(1<<j)]);
}
cout<<sum-f[(1<<n)-1][n-1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n,ma[18][18],m,tot[1<<16],dp[1<<16][16],tt;
void getmax(int &x,int y)
{
if(y>x)x=y;
}
int main()
{
memset(ma,-0x3f3f3f,sizeof(ma));
scanf("%d%d",&n,&m);tt=0;
for(int i=1;i<=m;++i)
{
int x,y,z;scanf("%d%d%d",&x,&y,&z);
ma[x][y]=ma[y][x]=z;tt+=z;
}
for(int i=1;i<(1<<n);++i)
{
for(int j=1;j<=n;++j)
{
if(i&(1<<(j-1)))
{
tot[i]=tot[i^(1<<(j-1))];
for(int k=j+1;k<=n;++k)
{
if((i&(1<<(k-1)))&&ma[j][k]>0)tot[i]+=ma[j][k];
}
break;
}
}
}
memset(dp,-0x3f3f3f,sizeof(dp));
dp[1][1]=0;
for(int i=1;i<(1<<n);++i)
{
for(int j=1;j<=n;++j)
{
if(i&(1<<(j-1)))
{
int r=i;
while(r)
{
if(r&(1<<(j-1)))
{
getmax(dp[i][j],dp[(i-r)|(1<<(j-1))][j]+tot[r]);
}
r=(r-1)&i;
}
for(int k=1;k<=n;++k)
{
if(!(i&(1<<(k-1))))
{
getmax(dp[i|(1<<(k-1))][k],dp[i][j]+ma[j][k]);
}
}
}
}
}
int res=0;
for(int i=0;i<(1<<n);++i)
{
if(i&(1<<(n-1)))
getmax(res,dp[i][n]);
}
cout<<tt-res<<endl;
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
#define For(i,a,b) for (int i=a;i<=b;i++)
#define Rep(i,a,b) for (int i=b;i>=a;i--)
using namespace std;
int n,m,mp[16][16],x,y,z,mmh[1<<15][15],o[1<<15][15];
inline ll read()
{
ll 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 x*f;
}
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()
{
n=read();m=read();
memset(mp,0,sizeof(mp));
memset(mmh,63,sizeof(mmh));
while(m--)
{
x=read();y=read();z=read();
x--;y--;
mp[x][y]=mp[y][x]=z;
}
For(i,0,(1<<n)-1)
For(j,0,n-1)
{
o[i][j]=0;
For(k,0,n-1)if ((i>>k)&1) o[i][j]+=mp[j][k];
}
mmh[1][0]=0;
For(i,0,(1<<n)-1)
For(j,0,n-1)
if ((i>>j)&1){
For(k,0,n-1)
if (mp[j][k])
if (!((i>>k)&1))
mmh[i|(1<<k)][k]=min(mmh[i|(1<<k)][k],mmh[i][j]+work(i,1<<k)-mp[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<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
int dp[1 << 15][15];
int cnt[1 << 15];
int m[15][15];
int main()
{
int num, way;
scanf("%d%d", &num, &way);
int sum = 0;
for (int i = 0; i < way; i++)
{
int za, zb, zc;
scanf("%d%d%d", &za, &zb, &zc);
za--, zb--;
m[za][zb] = m[zb][za] = zc;
sum += zc;
}
for (int p = 0; p < (1 << num); p++)
{
for (int i = 0; i < num; i++)
{
for (int j = i + 1; j < num; j++)
{
if ((p&(1 << i)) != 0 && (p&(1 << j)) != 0)cnt[p] += m[i][j];
}
}
}
for (int i = 0; i < (1 << num); i++)for (int j = 0; j < num; j++)dp[i][j] = -1000000000;
for (int p = 0; p < (1 << num); p++)if (p & 1)dp[p][0] = cnt[p];
for (int p = 0; p < (1 << num); p++)
{
for (int i = 0; i < num; i++)
{
if ((p&(1 << i)) == 0)continue;
for (int j = 0; j < num; j++)
{
if (p&(1 << j))continue;
if (m[i][j] == 0)continue;
int mask = (1 << num) - 1 - p - (1 << j);
int now = mask;
for (;;)
{
dp[p | now | (1 << j)][j] = max(dp[p | now | (1 << j)][j], dp[p][i] + m[i][j] + cnt[now | (1 << j)]);
if (now == 0)break;
now--;
now &= mask;
}
}
}
}
printf("%d\n", sum - dp[(1 << num) - 1][num - 1]);
} |
#include <bits/stdc++.h>
const int MAXN = 15;
int mat[15][15], n, m, tot;
int f[1 << 15], g[1 << 15][15];
void gmax(int & x, int y) { x < y ? x = y : 0; }
int main() {
std::ios_base::sync_with_stdio(false), std::cin.tie(0);
std::cin >> n >> m;
memset(mat, 0xcf, sizeof mat);
for (int i = 1, b, e, v; i <= m; ++i) {
std::cin >> b >> e >> v, --b, --e;
tot += mat[b][e] = mat[e][b] = v;
}
const int U = 1 << n;
memset(g, 0xcf, sizeof g);
const int NINF = **g;
for (int i = 0; i != U; ++i)
for (int j = 0; j != n; ++j) if (i >> j & 1)
for (int k = j + 1; k != n; ++k) if (i >> k & 1)
gmax(f[i], f[i] + mat[j][k]);
for (int i = 0; i != U; ++i) if (i >> n - 1 & 1) g[i][n - 1] = f[i];
for (int i = 0; i != U; ++i) {
for (int j = 0; j != n; ++j) if (g[i][j] != NINF) {
for (int k = 0; k != n; ++k) if ((~i >> k & 1) && mat[j][k] != NINF) {
int iu = U - 1 - i - (1 << k);
for (int l = iu; ; l = l - 1 & iu) {
gmax(g[i | 1 << k | l][k], g[i][j] + mat[j][k] + f[l | 1 << k]);
if (!l) break;
}
}
}
}
std::cout << tot - g[U - 1][0] << std::endl;
return 0;
}
|
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,m,x,y,z,a[20][20],kk,f[20][40000],p[40000],sum;
inline int min(int x,int y){return x<y?x:y;}
inline int max(int x,int y){return x>y?x:y;}
signed main(){
ios::sync_with_stdio(false);
cin>>n>>m;for (int i=1;i<=m;i++){
cin>>x>>y>>z;if (x>y)swap(x,y);a[x][y]+=z;sum+=z;
}kk=1<<n;for (int l=1;l<kk;l++)
for (int i=1;i<=n;i++)if (l&(1<<(i-1)))
for (int j=1;j<=n;j++)if (l&(1<<(j-1)))p[l]+=a[i][j];
memset(f,200,sizeof(f));
for (int i=1;i<kk;i++)if (i&1)f[1][i]=p[i];
for (int i=1;i<kk;i++)
for (int x1=1;x1<=n;x1++)if (i&(1<<(x1-1))){
int P=(kk-1)^i;
for (int x2=1;x2<=n;x2++)if (a[min(x1,x2)][max(x1,x2)])
for (int j=P;j;j=(j-1)&P)if (j&(1<<(x2-1)))
f[x2][i|j]=max(f[x2][i|j],f[x1][i]+a[min(x1,x2)][max(x1,x2)]+p[j]);
}cout<<sum-f[n][kk-1]<<endl;
} |
#include<bits/stdc++.h>
int f[17777][17],n,m;
int se[33333],e[16][16],tr[16],sum=0,ans=0;
void maxs(int&a,int b){if(a<b)a=b;}
int main(){
memset(e,-0x3f,sizeof(e));
scanf("%d%d",&n,&m);
for(int i=0,a,b,c;i<m;++i){
scanf("%d%d%d",&a,&b,&c);
--a,--b;sum+=c;
e[a][b]=e[b][a]=c;
int s=1<<a|1<<b;
for(int j=0;j<(1<<n);++j)if((j&s)==s)se[j]+=c;
}
--n;
int mx=1<<n;
memset(f,-0x3f,sizeof(f[0])*mx);
for(int i=1;i<mx;++i)if(i&1)f[i][0]=se[i];
for(int i=1;i<mx;++i)if(i&1){
memset(tr,-0x3f,sizeof(tr));
for(int j=0;j<n;++j)if(i>>j&1){
for(int k=0;k<n;++k)if(~i>>k&1){
maxs(tr[k],f[i][j]+e[j][k]);
}
}
int rv=mx-1-i;
for(int j=rv;j;j=j-1&rv){
int v=se[j];
for(int k=0;k<n;++k)if(j>>k&1)maxs(f[i|j][k],tr[k]+v);
}
for(int j=0;j<n;++j)maxs(ans,f[i][j]+e[n][j]+se[mx*2-1-i]);
}
printf("%d\n",sum-ans);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int n,m,x,y,z,ans,sum;
int dp[32800][16],p[32800],c[16][16];
int main(){
scanf("%d%d",&n,&m);
for (int i=1;i<=m;i++){
scanf("%d%d%d",&x,&y,&z);
x--; y--;
c[x][y]=c[y][x]=z;
sum+=z;
}
memset(dp,233,sizeof(dp));
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) p[i]+=c[j][k];
dp[1][0]=0;
for (int i=0;i<(1<<n);i++)
for (int j=0;j<n;j++)
if (((i>>j)&1)&&dp[i][j]>=0){
int x=(((1<<n)-1)^i)|(1<<j);
for (int y=x;;y=(y-1)&x){
dp[i|y][j]=max(dp[i|y][j],dp[i][j]+p[y]);
if (!y) break;
}
for (int k=0;k<n;k++){
if (((i>>k)&1)||c[j][k]==0) continue;
dp[i|(1<<k)][k]=max(dp[i|(1<<k)][k],dp[i][j]+c[j][k]);
}
}
ans=1e9;
for (int i=0;i<(1<<n);i++)
ans=min(ans,sum-dp[i][n-1]);
printf("%d",ans);
} |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 17, MAXS = 32775;
int n, m, N, g[MAXN][MAXN], val[MAXS], dp[MAXS][MAXN];
inline void update(int &a, int b){if(a < b) a = b;}
int main(){
int i, j, k, r, rest, u, v, w, sum = 0;
scanf("%d%d", &n, &m);
N = 1 << n;
for(i = 1; i <= m; ++ i){
scanf("%d%d%d", &u, &v, &w);
-- u, -- v;
g[u][v] = g[v][u] = w;
sum += w;
} memset(dp, -1, sizeof(dp));
for(i = 1; i < N; ++ i){
for(j = 0; j < n; ++ j)
if(i & (1 << j)) break;
val[i] = val[i ^ (1 << j)];
for(k = j + 1; k < n; ++ k)
if(i & (1 << k))
val[i] += g[j][k];
if(j == 0) dp[i][0] = val[i];
}
for(i = 1; i < N; ++ i)
for(j = 0; j < n; ++ j){
if((v = dp[i][j]) < 0) continue;
for(k = 0; k < n; ++ k){
if(i & (1 << k)) continue;
if(g[j][k] == 0) continue;
update(dp[i ^ (1 << k)][k], v + g[j][k]);
for(rest = r = (N - 1) ^ i ^ (1 << k); r; r = (r - 1) & rest)
update(dp[i ^ r ^ (1 << k)][k], v + val[r ^ (1 << k)] + g[j][k]);
}
}
cout << sum - dp[N - 1][n - 1] << endl;
return 0;
} |
#include <cstdio>
using namespace std;
const int INF=0x3f3f3f3f;
int a[15][15],val[1<<15];
int dp[1<<15][15];
void tense(int &x,int y){
if (x<y)
x=y;
}
int main(){
int n,m,sum=0;
scanf("%d%d",&n,&m);
while(m--){
int u,v,c;
scanf("%d%d%d",&u,&v,&c);
u--,v--;
for(int i=0;i<(1<<n);i++)
if ((i>>u&1) && (i>>v&1))
val[i]+=c;
a[u][v]=a[v][u]=c;
sum+=c;
}
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++)
if (i&1){
dp[i][0]=val[i];
//printf("val[%d]=%d\n",i,val[i]);
}
for(int i=0;i<(1<<n);i++)
for(int j=0;j<n;j++)
if (dp[i][j]>=0){
//puts("WTF");
int w=~i&((1<<n)-1);
for(int k=w;k;k=(k-1)&w){
int to=k|i;
for(int o=0;o<n;o++)
if ((k>>o&1) && a[j][o])
tense(dp[to][o],dp[i][j]+val[k]+a[j][o]);
}
}
printf("%d",sum-dp[(1<<n)-1][n-1]);
} |
#include<bits/stdc++.h>
using namespace std;
#define go(i,a,b) for(int i=a;i<=b;++i)
#define com(i,a,b) for(int i=a;i>=b;--i)
#define mem(a,b) memset(a,b,sizeof(a))
#define fo(i,a) for(int i=0;i<a;++i)
#define il inline
const int inf=0x3f3f3f3f,N=4e4;
int n,m,block[N],dp[N][20],g[20][20];
il void read(int &x){
x=0;char c=getchar(),f=1;
while(!isdigit(c)){ if(c=='-') f=-1; c=getchar(); }
while(isdigit(c)){ x=x*10+c-'0'; c=getchar(); }
x*=f;
}
il void gmax(int &x,const int &y){
x=x>y?x:y;
}
int main(){
//freopen("input.txt","r",stdin);
read(n),read(m);
int x,y,w;
go(i,1,m){
read(x),read(y),read(w);
--x,--y;
g[x][y]=g[y][x]=w;
}
int all=(1<<n)-1;
go(i,1,all)
fo(j,n){
if(i>>j&1){
block[i]=block[i^1<<j];
fo(k,n) if(i>>k&1) block[i]+=g[j][k];
break;
}
}
mem(dp,-1);
dp[1][0]=0;
go(i,1,all)
fo(j,n)
if(i>>j&1&&dp[i][j]!=-1){
fo(k,n)
if(!(i>>k&1)&&g[j][k])
gmax(dp[i|1<<k][k],dp[i][j]+g[j][k]);
int tmp=(all^i)|1<<j;
for(int k=tmp;k;k=(k-1)&tmp){
if(k>>j&1)
gmax(dp[i|k][j],dp[i][j]+block[k]);
}
}
cout<<block[all]-dp[all][n-1];
return 0;
} |
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 15;
int mat[N][N], inside[1 << N], cross[1 << N][N], f[1 << N][N];
int main()
{
int n, m;
cin >> n >> m;
while (m--)
{
int u, v, w;
cin >> u >> v >> w;
mat[u - 1][v - 1] = mat[v - 1][u - 1] = w;
}
for (int i = 0; i < 1 << n; i++)
for (int j = 0; j < n; j++)
if (i & (1 << j))
for (int k = 0; k < j; k++)
if (i & (1 << k))
inside[i] += mat[j][k];
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))
cross[i][j] += mat[j][k];
fill_n(&f[0][0], sizeof(f) / sizeof(int), -1);
f[1][0] = 0;
for (int i = 0; i < 1 << n; i++)
for (int j = 0; j < n; j++)
if (~f[i][j])
{
for (int k = 0; k < n; k++)
if (!(i & (1 << k)) && mat[j][k])
f[i | (1 << k)][k] = max(f[i | (1 << k)][k], f[i][j] + mat[j][k]);
int c = (1 << n) - i - 1;
for (int s = c; s; s = (s - 1) & c)
f[i | s][j] = max(f[i | s][j], f[i][j] + inside[s] + cross[s][j]);
}
cout << inside[(1 << n) - 1] - f[(1 << n) - 1][n - 1] << endl;
return 0;
} |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
using namespace std;
int n,m,dis[20][20],id[1<<16],sum=0,p[1<<16],f[1<<16][20],ans;
const int inf=1<<28;
int main()
{
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++) id[1<<(i-1)]=i;
for(int i=1;i<=m;i++)
{
int x,y,c;scanf("%d %d %d",&x,&y,&c);
dis[x][y]=c;dis[y][x]=c;sum+=c;
}
for(int i=1;i<1<<n;i++)
{
int x=id[i&(-i)];
p[i]=p[i^(1<<(x-1))];
for(int j=x+1;j<=n;j++) if(i&(1<<(j-1))) p[i]+=dis[x][j];
}
for(int i=0;i<=n;i++) for(int j=0;j<1<<n;j++) f[j][i]=-inf;
f[1][1]=0;ans=-inf;
for(int s=1;s<1<<n;s++)
{
for(int i=1;i<=n;i++)
{
int r=s;
while(r)
{
if((r&(1<<(i-1)))) f[s][i]=max(f[s][i],f[(s-r)|(1<<(i-1))][i]+p[r]);
r=(r-1)&s;
}
for(int j=1;j<=n;j++)
if (!(s&(1<<(j-1)))&&dis[i][j]) f[s|(1<<(j-1))][j]=max(f[s|(1<<(j-1))][j],f[s][i]+dis[i][j]);
}
if((s&(1<<(n-1)))) ans=max(ans,f[s][n]);
}
printf("%d",sum-ans);
} |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<queue>
#include<set>
#include<map>
#include<stack>
using namespace std;
typedef long long LL;
int gi() {
int w=0;bool q=1;char c=getchar();
while ((c<'0'||c>'9') && c!='-') c=getchar();
if (c=='-') q=0,c=getchar();
while (c>='0'&&c <= '9') w=w*10+c-'0',c=getchar();
return q? w:-w;
}
inline void upd(int &x,int y) { x<y?x=y:0; }
int f[1<<15][15];
int sum[1<<15];
int e[15][15];
int main()
{
int n=gi(),m=gi(),i,a,b,s,t,o,k;
const int all=(1<<n)-1;
while (m--) {
a=gi()-1,b=gi()-1;
e[a][b]=e[b][a]=gi();
sum[1<<a|1<<b]+=e[a][b];
}
for (i=0;i<n;i++)
for (s=0;s<(1<<n);s++)
if (!(s>>i&1))
sum[s|1<<i]+=sum[s];
memset(f,-0x3f,sizeof(f));
f[1][0]=0;
for (s=1;s<(1<<n);s+=2)
for (i=0;i<n;i++)
if (f[s][i]>=0) {
for (o=all^s,t=o;t;(--t)&=o)
upd(f[s|t][i],f[s][i]+sum[t|1<<i]);
for (k=0;k<n;k++)
if (!(s>>k&1)&&e[i][k])
upd(f[s|1<<k][k],f[s][i]+e[i][k]);
}
printf("%d\n",sum[all]-f[all][n-1]);
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],dp2[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=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]) continue;
if(mask&(1<<j)) continue;
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)]);
}
cout<<cost[(1<<n)-1]-dp2[(1<<n)-1]<<'\n';
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int n,m,i,j,k,l,mp[25][25],all[1<<16],dp[1<<16][25],x,y,z,sum,ans;
int main(){
cin>>n>>m;
for (i=1;i<=m;i++){
cin>>x>>y>>z;
x--;y--;
sum+=z;
mp[x][y]=mp[y][x]=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){
all[i]+=mp[j][k];
}
}
}
memset(dp,-1,sizeof(dp));
dp[1][0]=0;
for (i=1;i<(1<<n);i++){
for (j=0;j<n;j++) if ((i>>j)&1)if (dp[i][j]!=-1){
for (k=((((1<<n)-1)^i)|(1<<j));k;k=((k-1)&((((1<<n)-1)^i)|(1<<j)))){
dp[i|k][j]=max(dp[i|k][j],dp[i][j]+all[k]);
}
for (k=0;k<n;k++) if (!((i>>k)&1)) if (mp[j][k]){
dp[i|(1<<k)][k]=max(dp[i|(1<<k)][k],dp[i][j]+mp[j][k]);
}
}
/*if (i>32766){
system("pause");
}*/
if ((i>>(n-1))&1) ans=max(ans,dp[i][n-1]);
/*if (ans>1234567){
system("pause");
}*/
}
cout<<sum-ans<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 15, inf = 1e9;
int w[N][N], n, m, prep[N][1<<N], dp[N][1<<N];
int cost(int s, int t){
int res = 0, mask = 0;
for(int i = 0; i < n; ++i) mask += (1 << i) * ((s >> i) & 1);
for(int i = 0; i < n; ++i) res += prep[i][mask] * ((t >> i) & 1);
return res;
}
signed main(){
memset(dp, 0x3f, sizeof(dp));
cin >> n >> m;
for(int i = 0; i < m; ++i){
int u, v, c;
cin >> u >> v >> c, --u, --v;
w[u][v] = w[v][u] = c;
}
for(int i = 0; i < n; ++i){
for(int mask = 0; mask < (1<<n); ++mask){
for(int j = 0; j < n; ++j){
if(mask & (1<<j)) prep[i][mask] += w[i][j];
}
}
}
dp[0][1] = 0;
for(int mask = 1; mask < (1<<n); ++mask){
for(int i = 0; i < n; ++i){
if(!(mask & (1 << i))){
for(int j = 0; j < n; ++j){
if(mask & (1 << j) && w[j][i]){
dp[i][mask | (1 << i)] = min(dp[i][mask | (1 << i)], dp[j][mask] + cost(mask ^ (1 << j), (1 << i)));
}
}
}
}
int comp = (1<<n) - mask;
for(int sub = comp; sub > 0; sub = (sub - 1) & comp){
for(int i = 0; i < n; ++i){
if(mask & (1 << i)){
dp[i][mask | sub] = min(dp[i][mask | sub], dp[i][mask] + cost(mask ^ (1 << i), sub));
}
}
}
}
cout << dp[n-1][(1<<n) - 1];
} |
#include<set>
#include<map>
#include<deque>
#include<queue>
#include<stack>
#include<cmath>
#include<ctime>
#include<bitset>
#include<string>
#include<vector>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<complex>
#include<iostream>
#include<algorithm>
#define ll long long
#define inf 1e9
using namespace std;
inline void up(int &x,const int &y){if(x<y)x=y;}
const int maxn = 20;
const int maxm = 81000;
int n,m;
int a[maxn][maxn];
int ct[maxm],f[maxm][maxn];
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++)
{
int x,y,c; scanf("%d%d%d",&x,&y,&c);
a[x][y]=a[y][x]=c;
}
int al=1<<n;
for(int i=1;i<al;i++)
{
int j=1;for(;j<=n;j++) if(i>>j-1&1)break;
ct[i]=ct[i^1<<j-1];
for(int k=1;k<=n;k++) if(i>>k-1&1) ct[i]+=a[k][j];
}
for(int i=0;i<al;i++) for(int j=1;j<=n;j++) f[i][j]=-inf;
f[1][1]=0; int re=0;
for(int i=1;i<al;i+=2)
{
for(int j=1;j<=n;j++) if((i>>j-1&1)&&f[i][j]>=0)
{
if(j==n) up(re,f[i][j]);
for(int k=1;k<=n;k++) if(!(i>>k-1&1)&&a[j][k])
up(f[i|1<<k-1][k],f[i][j]+a[j][k]);
int now=al-1-i;
for(int k=now;k;k=k-1&now)
up(f[i|k][j],f[i][j]+ct[k^1<<j-1]);
}
}
printf("%d\n",ct[al-1]-re);
return 0;
}
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#define MN 16
using namespace std;
inline int in(){
int x=0;bool f=0; char c;
for (;(c=getchar())<'0'||c>'9';f=c=='-');
for (x=c-'0';(c=getchar())>='0'&&c<='9';x=(x<<3)+(x<<1)+c-'0');
return f?-x:x;
}
int f[1<<MN][MN],sum[1<<MN],mp[MN][MN];
int n,m,a,b,c;
int main()
{
n=in();m=in();
for (int i=1;i<=m;++i){
a=in()-1;b=in()-1;c=in();
mp[a][b]=mp[b][a]=c;
}memset(f,-0X3F,sizeof(f));f[1][0]=0;
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)) sum[s]+=mp[i][j];
for (int s=0;s<(1<<n);++s)
for (int i=0;i<n;++i) if (s&(1<<i)){
for (int j=0;j<n;++j)
if (!(s&(1<<j))&&mp[i][j])
f[s|(1<<j)][j]=max(f[s|(1<<j)][j],f[s][i]+mp[i][j]);
int r=((1<<n)-1)-s;
for (int t=r;t;t=((t-1)&r)) f[s|t][i]=max(f[s|t][i],f[s][i]+sum[t+(1<<i)]);
}
printf("%d",sum[(1<<n)-1]-f[(1<<n)-1][n-1]);return 0;
} |
#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 (f[i][j]>=0){
int x=(L-1)^i;
for (int k=0;k<n;k++)
if (!(i>>k&1) && a[j][k])
f[i|1<<k][k]=std::max(f[i|1<<k][k],f[i][j]+a[j][k]);
for (int k=x;k;k=(k-1)&x)
f[i|k][j]=std::max(f[i|k][j],f[i][j]+g[k|1<<j]);
}
printf("%d\n",sum-f[L-1][n-1]);
} |
#include <cstdio>
#include <cstring>
#define MAXN 20
#define MAXS 40000
int n,m,maxs;
int g[MAXS],f[MAXS][MAXN];
int e[MAXN][MAXN];
inline void update(int &x,int y){ x=x>y?x:y; }
int main(){
#ifdef DEBUG
freopen("F.in","r",stdin);
#endif
scanf("%d%d",&n,&m);
int totw=0;
for(int i=1;i<=m;i++){
int u,v,w;
scanf("%d%d%d",&u,&v,&w);
e[v][u]=e[u][v]=w;
totw+=w;
}
maxs=1<<n;
for(int i=0;i<maxs;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)))
g[i]+=e[j][k];
}
int maxs0=maxs;
maxs>>=2;
memset(f,0x88,sizeof f);
for(int i=0;i<maxs;i++) f[i][1]=g[i<<1|1];
for(int i=0;i<maxs;i++)
for(int x=1;x<n;x++){
if(x!=1 && !(i&(1<<(x-2)))) continue;
for(int y=2;y<n;y++){
if((i&(1<<(y-2))) || !e[x][y]) continue;
int by=1<<(y-2);
int lims=(maxs-1)^i^by;
for(int j=lims;;j=(j-1)&lims){
update(f[i|j|by][y],f[i][x]+e[x][y]+g[(j|by)<<1]);
if(!j) break;
}
}
}
int ans=-1;
for(int i=0;i<maxs;i++)
for(int j=1;j<n;j++)
if(j==1 || (i&(1<<(j-2)))){
if(e[j][n])
update(ans,f[i][j]+e[j][n]+g[(maxs0-1)^1^(i<<1)]);
}
ans=totw-ans;
if(ans<=totw) printf("%d\n",ans);
else puts("-233");
}
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define Rep(i,x) for(int i=head[x];i+1;i=nxt[i])
using namespace std;
int f[20][70005],g[70005];
int con[20][20];
inline int lowbit(int x){return x&(-x);}
int main()
{
int n,m;scanf("%d%d",&n,&m);int tot=0;
rep(i,1,m){int x,y,z;scanf("%d%d%d",&x,&y,&z);con[x][y]=con[y][x]=z;tot+=z;}
memset(f,-1,sizeof(f));
rep(i,1,(1<<n)-1)rep(j,1,n)if((1<<(j-1))&i)rep(k,j+1,n)if((1<<(k-1))&i)g[i]+=con[j][k];
rep(i,1,(1<<n)-1)if(i&1)f[1][i]=g[i];
// rep(i,1,(1<<n)-1)printf("%d ",g[i]);puts("");
rep(j,0,(1<<n)-1)
{
rep(i,1,n)if(f[i][j]>=0)
{
int k=((1<<n)-1)^j;
//printf("Case 0:%d %d\n",k,j);
for(int p=k;p;p=(p-1)&k)
{
//printf("Case 0:%d %d\n",k,p);
rep(nxt,1,n)if(((1<<(nxt-1))&p) && con[i][nxt])
{
f[nxt][j|p]=max(f[nxt][j|p],f[i][j]+con[i][nxt]+g[p]);
}
}
}
}
int ans=0;
rep(i,1,(1<<n)-1)ans=max(ans,f[n][i]);
printf("%d\n",tot-ans);
return 0;
} |
#include <bits/stdc++.h>
#define maxn 18
using namespace std;
int n, m;
int a[maxn][maxn];
int x, y, z;
int g[1 << maxn];
int f[1 << maxn][maxn];
int sum;
vector<int> v;
inline void Max(int &x, int y){
x = max(x, y);
}
int main(){
scanf("%d%d", &n, &m);
while(m--){
scanf("%d%d%d", &x, &y, &z);
--x, --y;
a[x][y] = a[y][x] = z;
sum += z;
}
for(int i = 0;i < (1 << n);i++){
v.clear();
for(int j = 0;j < n;j++){
if(i & (1 << j)) v.push_back(j);
}
for(int j = 1;j < v.size();j++){
for(int k = 0;k < j;k++){
g[i] += a[v[j]][v[k]];//debug:没写v 我弱智
}
}
}
memset(f, -0x3f, sizeof(f));
f[1][0] = 0;
for(int i = 0;i < (1 << n) - 1;i++){
for(int j = 0;j < n;j++){
if(!(i & (1 << j))) continue;
for(int k = 0;k < n;k++){
if(!(i & (1 << k)) && a[j][k]){
Max(f[i | (1 << k)][k], f[i][j] + a[j][k]);
}
}
int x = i ^ ((1 << n) - 1);
for(int k = x;k;k = (k - 1) & x){
Max(f[i | k][j], f[i][j] + g[(1 << j) | k]);
}
}
}
int ans = 0;
for(int i = 0;i < (1 << n);i++) ans = max(ans, f[i][n - 1]);
printf("%d", sum - ans);
} |
#include<iostream>
#include<cstdio>
using namespace std;
int n,m;
int dp[1<<16][16];
int sum[1<<16];
int dis[16][16];
int all;
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--;
dis[x][y]=dis[y][x]=z;
all+=z;
}
for(int i=1;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]+=dis[j][k];
}
}
}
}
}
for(int i=0;i<(1<<n);i++)
{
for(int j=0;j<n;j++)dp[i][j]=-1;
}
dp[1][0]=0;
for(int i=1;i<(1<<n);i++)
{
for(int j=0;j<n;j++)
{
if(dp[i][j]==-1)continue;
int st=((1<<n)-1)^i;
if(dis[j][n-1])
{
dp[(1<<n)-1][n-1]=max(dp[(1<<n)-1][n-1],dp[i][j]+sum[st]+dis[j][n-1]);
}
for(int k=(st-1)&st;k;k=(k-1)&st)
{
if(k>>(n-1)&1)continue;
dp[i|k][j]=max(dp[i|k][j],dp[i][j]+sum[(1<<j)|k]);
}
for(int k=0;k<n;k++)
{
if(k!=n-1 && !(i>>k&1) && dis[j][k])
{
dp[i|(1<<k)][k]=max(dp[i|(1<<k)][k],dp[i][j]+dis[j][k]);
}
}
}
}
printf("%d",all-dp[(1<<n)-1][n-1]);
return 0;
} |
#include<bits/stdc++.h>
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
#define two(x) (1<<(x-1))
using namespace std;
#define N 20
int n,m,w[N][N],f[(1<<16)+10][N],p[(1<<16)+10],ans;
int main(){
scanf("%d%d",&n,&m);int Max=(1<<n)-1;
rep (i,1,m){
int x,y,z;scanf("%d%d%d",&x,&y,&z);
ans+=z;w[x][y]=w[y][x]=z;
}
p[0]=0;
rep (i,1,Max){
int now;
rep (j,1,n) if (i>>j-1&1){now=j;break;}
p[i]=p[i^(1<<now-1)];
rep (j,1,n) if (i>>j-1&1) p[i]+=w[now][j];
}
memset(f,0xc0,sizeof(f));
f[1][1]=0;
int tmp=-1e9;
rep (s,1,Max) rep (i,1,n){
for (int t=s;t;t=(t-1)&s)
if (t>>i-1&1)
f[s][i]=max(f[s][i],f[(s-t)|(1<<i-1)][i]+p[t]);
rep (j,1,n)
if (!(s>>j-1&1)&&w[i][j])
f[s|(1<<j-1)][j]=max(f[s|(1<<j-1)][j],f[s][i]+w[i][j]);
}
ans-=f[Max][n];
printf("%d\n",ans);
return 0;
} |
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <memory.h>
#include <queue>
using namespace std;
typedef long long LL;
const int maxn = 20;
int e[maxn][maxn],n,m,bin[1<<15];
LL dp[1<<15][maxn];
LL cs[1<<15][maxn];
LL cst[1<<15],sum;
void upd(LL &x,LL y) {if (x<y) x=y;}
int main()
{
#ifdef LOCAL_JUDGE
freopen("mine.in","r",stdin);
freopen("mine.out","w",stdout);
#endif
scanf("%d %d",&n,&m);
for (int i=0;i<n;i++) bin[1<<i]=i;
for (int u,v,w,i=1;i<=m;i++)
scanf("%d %d %d",&u,&v,&w),
u--,v--,e[u][v]=e[v][u]=w,sum+=w;
for (int i=0;i<n;i++)
for (int j=1;j<(1<<n);j++)
cs[j][i]=cs[j^(j&-j)][i]+e[bin[j&-j]][i];
for (int i=1;i<(1<<n);i++)
cst[i]=cst[i^(i&-i)]+cs[i^(i&-i)][bin[i&-i]];
memset(dp,-1,sizeof dp);
dp[1][0]=0;
for (int s=0;s<(1<<n);s++)
for (int u=0;u<n;u++)
if ((s>>u&1)&&dp[s][u]!=-1) {
for (int t=0;t<n;t++)
if (!(s>>t&1)&&e[u][t])
upd(dp[s^(1<<t)][t],e[u][t]+dp[s][u]);
int o=((1<<n)-1)^s;
for (int t=o;t;t=t-1&o)
upd(dp[s^t][u],dp[s][u]+cst[t]+cs[t][u]);
}
printf("%lld",sum-dp[(1<<n)-1][n-1]);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int n,m,go[20][20],dp[N][20],bit[N],q1[20],q2[20];
int main()
{
scanf("%d%d",&n,&m);
for (int i=0;i<n;i++) bit[1<<i]=i;
for (int i=1;i<=m;i++){
int u,v,l;
scanf("%d%d%d",&u,&v,&l);u--;v--;
go[u][v]=go[v][u]=l;
}
int to=1<<(n-1);
for (int S=0;S<to;S++){
for (int i=0;i<n;i++) dp[S][i]=1e9;
for (int T=(S-1)&S;T<S;T=(T-1)&S){
int s1=0,s2=0,v=0;
for (int now=S^T;now;now-=now&-now) q2[++s2]=bit[now&-now];//可能的起点
for (int now=T|to;now;now-=now&-now) q1[++s1]=bit[now&-now];//可能的终点
for (int i=1;i<=s1;i++) for (int j=1;j<=s2;j++) v+=go[q1[i]][q2[j]];
for (int i=1;i<=s1;i++) for (int j=1;j<=s2;j++) if (go[q1[i]][q2[j]])
dp[S][q2[j]]=min(dp[S][q2[j]],dp[T][q1[i]]+v-go[q1[i]][q2[j]]);
}
dp[S][n-1]=0;
}
printf("%d\n",dp[to-1][0]);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int Max_N=15,Max_S=1<<15;
int N,M,Sum=0,A[Max_N+5][Max_N+5]={},f[Max_S+5][Max_N+5]={},P[Max_S+5]={};
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);
Sum+=v; A[x][y]=A[y][x]=v;
}
for(int i=0;i<1<<N;i++){
for(int j=1;j<=N;j++)
if((1<<(j-1))&i){
for(int k=j+1;k<=N;k++)
if((1<<(k-1))&i)
P[i]+=A[j][k];
}
}
for(int i=1;i<=N;i++)
for(int j=0;j<1<<N;j++)
f[j][i]=-(1<<30);
f[1][1]=0;
for(int i=0;i<1<<N;i++){
for(int j=1;j<=N;j++){
if((1<<(j-1))&i)
for(int k=1;k<=N;k++)
if(((1<<(k-1))&i)&&k!=j&&A[j][k]>0)
f[i][j]=max(f[i][j],f[i^(1<<(j-1))][k]+A[j][k]);
for(int k=i;k;k=(k-1)&i)
if(k&(1<<(j-1)))
f[i][j]=max(f[i][j],f[(i^k)|(1<<(j-1))][j]+P[k]);
}
}
printf("%d\n",Sum-f[(1<<N)-1][N]);
return 0;
} |
#include <bits/stdc++.h>
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>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<int,P> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<50;
const double pi=acos(-1);
const double eps=1e-8;
const ll mod=1e9+7;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
int n,m;
vvi g;
int main(){
cin>>n>>m;
g=vvi(n,vi(n));
int S=1<<n;
vi dp(S);
vvi DP(S,vi(n,-1));
DP[1][0]=0;
for(int i=0;i<m;i++){
int u,v,c;
cin>>u>>v>>c;
u--;v--;
g[u][v]=c;g[v][u]=c;
}
for(int i=1;i<S;i++) for(int j=0;j<n;j++) for(int k=j+1;k<n;k++) if(i&1<<j&&i&1<<k) dp[i]+=g[j][k];
for(int i=1;i<S;i++) for(int j=0;j<n;j++) if(DP[i][j]!=-1){
for(int k=0;k<n;k++) if(!(i&1<<k)&&g[j][k]) DP[i+(1<<k)][k]=max(DP[i+(1<<k)][k],DP[i][j]+g[j][k]);
int T=S-i-1,T_=T;
while(T){
DP[i+T][j]=max(DP[i+T][j],DP[i][j]+dp[T+(1<<j)]);
T=(T-1)&T_;
}
}
cout<<dp[S-1]-DP[S-1][n-1]<<endl;
} |
#include<cstdio>
#include<algorithm>
using namespace std;
#define N 17
int v[N][N],n,m,a,b,c,as;
int dp[67890][N],su[67890],s1;
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++)scanf("%d%d%d",&a,&b,&c),v[a][b]=v[b][a]=c,s1+=c;
for(int i=1;i<1<<n;i++)
for(int j=1;j<=n;j++)
for(int k=j+1;k<=n;k++)
if((i&(1<<j-1))&&(i&(1<<k-1)))su[i]+=v[j][k];
for(int i=0;i<1<<n;i++)for(int j=1;j<=n;j++)dp[i][j]=-1e9;
for(int i=1;i<1<<n;i+=2)dp[i][1]=su[i];
for(int i=1;i<1<<n;i++)
for(int j=1;j<=n;j++)
if(i&(1<<j-1))
for(int k=((1<<n)-1)^i;k;k=(k-1)&(((1<<n)-1)^i))
for(int l=1;l<=n;l++)
if(k&(1<<l-1))
if(v[j][l])
dp[i|k][l]=max(dp[i|k][l],dp[i][j]+su[k]+v[j][l]);
int as=0;
for(int i=1;i<1<<n;i++)as=max(as,dp[i][n]);
printf("%d\n",s1-as);
} |
#include<bits/stdc++.h>
using namespace std;
int f[20][70010],sum[70010];
int mp[20][20];
int main()
{
int n,m,all=0;scanf("%d%d",&n,&m);
for (int i=1;i<=m;i++)
{
int u,v,w;scanf("%d%d%d",&u,&v,&w);
mp[u][v]=mp[v][u]=w;all+=w;
}
memset(f,255,sizeof(f));
for (int i=1;i<(1<<n);i++)
for (int j=1;j<=n;j++) if((1<<(j-1))&i)
for (int k=j+1;k<=n;k++) if((1<<(k-1))&i) sum[i]+=mp[j][k];
for (int i=1;i<(1<<n);i++) if(i&1) f[1][i]=sum[i];
for (int j=1;j<(1<<n);j++)
{
for (int i=1;i<=n;i++) if(f[i][j]>=0)
{
int k=((1<<n)-1)^j;
for(int p=k;p;p=(p-1)&k)
for (int d=1;d<=n;d++)
if(((1<<(d-1))&p)&&(mp[i][d])) f[d][j|p]=max(f[d][j|p],f[i][j]+mp[i][d]+sum[p]);
}
}
int ans=0;
for (int i=1;i<(1<<n);i++) ans=max(ans,f[n][i]);
printf("%d\n",all-ans);
} |
#include <bits/stdc++.h>
using namespace std;
const int MaxN=15;
int n,m,ans,e[MaxN][MaxN],c[1<<MaxN],dp[1<<MaxN][MaxN];
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--;
e[u][v]=e[v][u]=w;
ans+=w;
}
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&(1<<j) && i&(1<<k)) c[i]+=e[j][k];
memset(dp,0xff,sizeof dp);dp[1][0]=0;
for (int S=0;S<(1<<n);++S) for (int i=0;i<n;++i) if (dp[S][i]!=-1) {
int SS=((1<<n)-1)^S;
for (int j=0;j<n;++j) if (SS&(1<<j) && e[i][j])
dp[S|(1<<j)][j]=max(dp[S|(1<<j)][j],dp[S][i]+e[i][j]);
for (int j=SS;j;j=(j-1)&SS)
dp[S|j][i]=max(dp[S|j][i],dp[S][i]+c[j|(1<<i)]);
}
ans-=dp[(1<<n)-1][n-1];
printf("%d\n",ans);
return 0;
} |
#include<iostream>
#include<cstdio>
using namespace std;
int n,m;
int dp[1<<16][16];
int sum[1<<16];
int dis[16][16];
int all;
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--;
dis[x][y]=dis[y][x]=z;
all+=z;
}
for(int i=1;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]+=dis[j][k];
}
}
}
}
}
for(int i=0;i<(1<<n);i++)
{
for(int j=0;j<n;j++)dp[i][j]=-1;
}
dp[1][0]=0;
for(int i=1;i+1<(1<<n);i++)
{
for(int j=0;j<n;j++)
{
if(dp[i][j]==-1)continue;
int st=((1<<n)-1)^i;
if(dis[j][n-1])
{
dp[(1<<n)-1][n-1]=max(dp[(1<<n)-1][n-1],dp[i][j]+sum[st]+dis[j][n-1]);
}
for(int k=(st-1)&st;k;k=(k-1)&st)
{
if(k>>(n-1)&1)continue;
dp[i|k][j]=max(dp[i|k][j],dp[i][j]+sum[(1<<j)|k]);
}
for(int k=0;k<n;k++)
{
if(k!=n-1 && !(i>>k&1) && dis[j][k])
{
dp[i|(1<<k)][k]=max(dp[i|(1<<k)][k],dp[i][j]+dis[j][k]);
}
}
}
}
printf("%d",all-dp[(1<<n)-1][n-1]);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,m;
int c[16][16];
int dp[1<<15][15];
int cost[1<<15];
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--;
c[u][v]=c[v][u]=w;
}
for(int s=0;s<(1<<n);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)==0)continue;
cost[s]+=c[i][j];
}
}
}
for(int s=0;s<(1<<n);s++){
for(int u=0;u<n;u++)dp[s][u]=-1;
}
for(int s=0;s<(1<<n);s++)if(s&1)dp[s][0]=cost[s];
for(int s=0;s<(1<<n);s++){
for(int u=0;u<n;u++){
if(dp[s][u]==-1)continue;
int mask=(1<<n)-1-s;
for(int ns=mask;ns;ns=(ns-1)&mask){
for(int v=0;v<n;v++){
if((ns>>v&1)&&c[u][v])dp[s|ns][v]=max(dp[s|ns][v],dp[s][u]+c[u][v]+cost[ns]);
}
}
}
}
printf("%d\n",cost[(1<<n)-1]-dp[(1<<n)-1][n-1]);
return 0;
} |
#include <cstdio>
#include <algorithm>
using namespace std;
const int MAXN = 20, INF = 1e9;
int n, m, x, y, c;
int G[MAXN][MAXN], sum[1 << MAXN];
int dp[1 << MAXN][MAXN];
int cost(int x, int y) {
return sum[x | y] - (sum[x] + sum[y]);
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < m; ++i) {
scanf("%d%d%d", &x, &y, &c); x--; y--;
G[x][y] = c;
G[y][x] = c;
}
for (int i = 0; i < 1 << n; ++i) {
for (int j = 0; j < n; ++j) {
if (((i >> j)&1) == 0) continue;
for (int k = j+1; k < n; ++k) {
if ((i >> k)&1) sum[i] += G[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 = 0; i < 1 << n; ++i) {
for (int j = 0; j < n; ++j) {
if (dp[i][j] == INF) continue;
for (int k = 0; k < n; ++k) {
if ((i >> k) & 1) continue;
if (G[j][k] == 0) continue;
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\n", dp[(1 << n)-1][n-1]);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N=20,M=200000;
int a[N][N],f[M][N],g[M][N],n,m,x,y,z;
inline void read(int &x)
{
char c=getchar();
x=0;
while (c>'9'||c<'0')
c=getchar();
while (c>='0'&&c<='9')
{
x=x*10+c-'0';
c=getchar();
}
}
inline int work(int x,int y)
{
int sum=0;
for (int i=0;i<n;++i)
if ((x>>i)&1)
sum+=f[y][i];
return sum;
}
int main()
{
read(n);
read(m);
memset(g,0x3f,sizeof(g));
for (int i=1;i<=m;++i)
{
read(x);
read(y);
read(z);
--x;
--y;
a[x][y]=a[y][x]=z;
}
for (int i=0;i<(1<<n);++i)
for (int j=0;j<n;++j)
for (int k=0;k<n;++k)
if ((i>>k)&1)
f[i][j]+=a[j][k];
g[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 (a[j][k]&&(!((i>>k)&1)))
g[i|(1<<k)][k]=min(g[i|(1<<k)][k],g[i][j]+work(i,1<<k)-a[j][k]);
int u=(1<<n)-1-i;
for (int k=u;k;k=(k-1)&u)
g[i|k][j]=min(g[i|k][j],g[i][j]+work(i^(1<<j),k));
}
printf("%d",g[(1<<n)-1][n-1]);
return 0;
} |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,m;
int f[1<<15][15];
int C[1<<15][15];
int c[15][15];
int cost(int S1,int S2){
int ans=0;
for(int i=0;i<n;++i){
if(S2>>i&1)ans+=C[S1][i];
}
return ans;
}
int main(){
scanf("%d%d",&n,&m);
memset(c,0xc2,sizeof(c));
for(int i=1,a,b,w;i<=m;++i){
scanf("%d%d%d",&a,&b,&w);
a--;b--;
c[a][b]=c[b][a]=w;
}
int lim=1<<n;
for(int i=0;i<lim;++i){
for(int j=0;j<n;++j){
for(int k=0;k<n;++k){
if((i>>j&1)&&(!(i>>k&1))&&c[j][k]!=0xc2c2c2c2){
C[i][k]+=c[j][k];
}
}
}
}
memset(f,0x3f,sizeof(f));
f[1][0]=0;
int ans=0x3f3f3f3f;
for(int i=1;i<lim;++i){
for(int j=0;j<n;++j){
if(f[i][j]==0x3f3f3f3f)continue;
for(int k=0;k<n;++k){
if((!(i>>k&1))&&c[j][k]!=0xc2c2c2c2){
f[i|(1<<k)][k]=min(f[i|(1<<k)][k],f[i][j]+cost(i^(1<<j),1<<k));
}
}
int S=(lim-1)^i;
for(int j2=S;j2;j2=(j2-1)&S){
f[i|j2][j]=min(f[i|j2][j],f[i][j]+cost(i^(1<<j),j2));
}
}
}
printf("%d\n",f[lim-1][n-1]);
return 0;
}
|
#include<cstdio>
#include<algorithm>
using namespace std;
int D[1 << 15][15], S[1 << 15], U[1<<15][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;
if (j&(1 << a)) U[j][b] += c;
if (j&(1 << b)) U[j][a] += c;
}
}
for (i = 0; i < (1 << n); i++) {
for (j = 0; j < n; j++)D[i][j] = -1e9;
}
D[1][0] = 0;
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) {
D[i | k][j] = max(D[i | k][j], D[i][j] + S[k] + U[k][j]);
}
for (k = 0; k < n; k++) {
if (i&(1 << k))continue;
if (!w[j][k])continue;
D[i | (1 << k)][k] = max(D[i | (1 << k)][k], D[i][j] + w[j][k]);
}
}
}
printf("%d\n", sum - D[(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.