Submission #2118138
Source Code Expand
#include<iostream> #include<cstdio> #include<cstdlib> #include<cstring> #include<algorithm> #define inf 0x3f3f3f3f #define MAX(x,y) x=max(x,y) using namespace std; const int N=18; const int M=32775; int n,m,bin[N],num[M],ma[N][M],sum[M],f[N][M],g[M]; 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 x*f; } int lowbit(int x) { return x&(-x); } int main() { n=read();m=read(); bin[0]=1; for (int i=1;i<=n;i++) bin[i]=bin[i-1]*2,num[bin[i]]=i; int tot=0; for (int i=1;i<=m;i++) { int x=read()-1,y=read()-1,z=read();tot+=z; ma[x][bin[y]]=ma[y][bin[x]]=z; } for (int i=0;i<n;i++) for (int j=1;j<bin[n];j++) ma[i][j]=ma[i][j-lowbit(j)]+ma[i][lowbit(j)]; for (int i=1;i<bin[n];i++) sum[i]=sum[i-lowbit(i)]+ma[num[lowbit(i)]][i-lowbit(i)]; for (int i=0;i<n;i++) for (int j=0;j<bin[n];j++) f[i][j]=-inf; f[0][1]=0; for (int j=0;j<bin[n];j++) for (int i=0;i<n-1;i++) { if (f[i][j]<0) continue; for (int k=0;k<n;k++) if (!(j&bin[k])&&ma[i][bin[k]]) MAX(f[k][j+bin[k]],f[i][j]+ma[i][bin[k]]); } for (int i=0;i<bin[n];i++) g[i]=f[n-1][i]; for (int i=1;i<bin[n];i++) { if (g[i]<0) continue; int r=i^(bin[n]-1); for (int s=r;s;s=(s-1)&r) { int mxv=0; for (int j=i;j;j-=lowbit(j)) mxv=max(mxv,sum[s+lowbit(j)]); MAX(g[i+s],g[i]+mxv); } } printf("%d",tot-g[bin[n]-1]); return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Mole and Abandoned Mine |
User | beginend |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 1523 Byte |
Status | AC |
Exec Time | 23 ms |
Memory | 4736 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 900 / 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 | 9 ms | 4736 KB |
01.txt | AC | 22 ms | 4736 KB |
02.txt | AC | 2 ms | 2432 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 | 2 ms | 2304 KB |
07.txt | AC | 2 ms | 2304 KB |
08.txt | AC | 6 ms | 3456 KB |
09.txt | AC | 1 ms | 2304 KB |
10.txt | AC | 1 ms | 2304 KB |
11.txt | AC | 22 ms | 4736 KB |
12.txt | AC | 9 ms | 4736 KB |
13.txt | AC | 22 ms | 4736 KB |
14.txt | AC | 20 ms | 4736 KB |
15.txt | AC | 22 ms | 4736 KB |
16.txt | AC | 23 ms | 4736 KB |
17.txt | AC | 22 ms | 4736 KB |
18.txt | AC | 8 ms | 4736 KB |
19.txt | AC | 20 ms | 4736 KB |
20.txt | AC | 22 ms | 4736 KB |
21.txt | AC | 22 ms | 4736 KB |
22.txt | AC | 22 ms | 4736 KB |
23.txt | AC | 22 ms | 4736 KB |
24.txt | AC | 22 ms | 4736 KB |
25.txt | AC | 22 ms | 4736 KB |