Submission #2835037
Source Code Expand
#include<bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int MAX=16;
const int INF=0x3f3f3f3f;
int n,m,conn[MAX][MAX],dist[MAX][MAX],dp[MAX][1<<MAX],visit[MAX][1<<MAX],calc[1<<MAX],trk[MAX],ans;
void calc_build(int x,int v,int idx){
//printf("%d %d %d\n",x,v,idx);
if(idx>=n) {
calc[x]=v;
return;
}
calc_build(x,v,idx+1);
trk[idx]=1;
for(int i=0;i<idx;i++) if(trk[i]) v+=dist[i][idx];
calc_build(x+(1<<idx),v,idx+1);
trk[idx]=0;
}
int dp_build(int x,int bit){
if(x==n-1) return dp[x][bit]=calc[bit];
if(visit[x][bit]==0){
int cmp[MAX],cmp_cnt=0;
visit[x][bit]=1; dp[x][bit]=0;
for(int i=0;i<n;i++) if(((1<<i)&bit)&&conn[i][x]){
int cmp[MAX],cmp_cnt=0;
for(int j=0;j<n-1;j++) if(((1<<j)&bit)&&i!=j&&x!=j) cmp[cmp_cnt++]=j;
for(int j=0;j<(1<<(cmp_cnt));j++){
int g1=1<<x,g2;
for(int k=0;k<cmp_cnt;k++) if((1<<k)&j) g1+=(1<<cmp[k]);
g2=bit-g1;
dp[x][bit]=max(dp[x][bit],calc[g1]+dp_build(i,g2)+dist[x][i]);
}
}
//printf("%d\t%x\t%d\n",x,bit,dp[x][bit]);
}
return dp[x][bit];
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=0;i<m;i++){
int t1,t2,t;
scanf("%d%d%d",&t1,&t2,&t);
t1--,t2--;
conn[t1][t2]=1,dist[t1][t2]=t;
conn[t2][t1]=1,dist[t2][t1]=t;
ans+=t;
}
calc_build(0,0,0);
//for(int i=0;i<(1<<n);i++) printf("%d ",calc[i]);
printf("%d\n",ans-dp_build(0,(1<<n)-1));
}
Submission Info
Submission Time
2018-07-13 21:07:43+0900
Task
F - Mole and Abandoned Mine
User
x0000ai
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
1712 Byte
Status
WA
Exec Time
1081 ms
Memory
6912 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:44:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&m);
^
./Main.cpp:47:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d",&t1,&t2,&t);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
0 / 900
Status
Set Name
Test Cases
Sample
00_example_01.txt, 00_example_02.txt, 00_example_03.txt
All
00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt
Case Name
Status
Exec Time
Memory
00_example_01.txt
AC
2 ms
2304 KB
00_example_02.txt
AC
2 ms
2304 KB
00_example_03.txt
AC
82 ms
6912 KB
01.txt
AC
795 ms
6912 KB
02.txt
AC
5 ms
6400 KB
03.txt
AC
2 ms
2304 KB
04.txt
AC
2 ms
2304 KB
05.txt
AC
2 ms
2304 KB
06.txt
AC
3 ms
6400 KB
07.txt
AC
3 ms
6400 KB
08.txt
AC
84 ms
6656 KB
09.txt
AC
3 ms
6400 KB
10.txt
AC
2 ms
2304 KB
11.txt
AC
804 ms
6912 KB
12.txt
AC
82 ms
6912 KB
13.txt
AC
787 ms
6912 KB
14.txt
AC
450 ms
6912 KB
15.txt
AC
799 ms
6912 KB
16.txt
AC
761 ms
6912 KB
17.txt
AC
652 ms
6912 KB
18.txt
WA
90 ms
6912 KB
19.txt
AC
318 ms
6912 KB
20.txt
AC
953 ms
6912 KB
21.txt
AC
1075 ms
6912 KB
22.txt
AC
1076 ms
6912 KB
23.txt
AC
1079 ms
6912 KB
24.txt
AC
1076 ms
6912 KB
25.txt
AC
1081 ms
6912 KB