题目链接


#include
using namespace std;
int e[210][210];
int main()
{
int n,m,a[210],book[210];
cin>>n>>m;
while(m--)
{
int x,y,z;
cin>>x>>y>>z;
e[x][y]=z;
e[y][x]=z;
}
int t,minn=0x3f3f3f3f,num,tot=0;
cin>>t;
for(int i=1; i<=t; i++)
{
int k,j,flag=1;
memset(book,0,sizeof(book));
cin>>k;
for(j=1; j<=k; j++)
{
cin>>a[j];
book[a[j]]++;
}
a[0]=a[k+1]=0;
for(j=1; j<=n; j++)
if(book[j]!=1)
{
flag=0;
break;
}
if(flag)
{
for(j=0; j<=k; j++)
if(e[a[j]][a[j+1]]==0)
{
flag=0;
break;
}
}
if(flag==1)
tot++;
else
continue;
int sum=0;
for(j=0; j<=k; j++)
sum+=e[a[j]][a[j+1]];
if(sum<minn)
{
minn=sum;
num=i;
}
}
printf("%d\n",tot);
printf("%d %d\n",num,minn);
return 0;
}