http://codeforces.com/contest/1076/problem/D
题意:给一个图;删除一些边使得边数不超过k且good点数最多;good点定义是删除边后1到点i的最短路不变;
思路:让剩下边数为k可以最多good点是k+1,即变成一颗树; 迪杰斯特拉最短路每次更新是最短的边,记录边数,一共k条;
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
const int maxn=1e6+9;
const int mod=998244353;
inline ll read()
{
ll f=1,x=0;
char ss=getchar();
while(ss<'0'||ss>'9')
{
if(ss=='-')f=-1;ss=getchar();
}
while(ss>='0'&&ss<='9')
{
x=x*10+ss-'0';ss=getchar();
} return f*x;
}
ll power(ll x,ll n)
{
ll ans=1;
while(n)
{
if(n&1) ans=ans*x%mod;
x=x*x%mod;
n>>=1;
}
return ans;
}
int n,m,k;
struct node
{
int id;
int v;
ll w;
node(int _v,ll _w,int _id)
{
v=_v;
w=_w;
id=_id;
}
bool operator<(const node &b)const
{
return w>b.w;
}
};
vector<node>g[maxn];
vector<int>ans;
priority_queue<node >q;
ll d[maxn];
bool vis[maxn];
int main()
{
//FAST_IO;
//freopen("input.txt","r",stdin);
cin>>n>>m>>k;
for(int i=1;i<=m;i++)
{
int u,v;
ll w;
cin>>u>>v>>w;
g[u].pb(node(v,w,i));
g[v].pb(node(u,w,i));
}
vis[1]=1;
for(int i=0;i<g[1].size();i++)q.push(g[1][i]);
while(!q.empty()&&k)
{
node tmp=q.top();
q.pop();
int u=tmp.v;
//cout<<u<<endl;
if(vis[u]) continue;
vis[u]=1;
k--;
ans.push_back(tmp.id);
for(int i=0;i<g[u].size();i++)
{
int v=g[u][i].v;
if(!vis[v])
{
g[u][i].w+=tmp.w;
q.push(g[u][i]);
}
}
}
cout<<ans.size()<<endl;
for(int i=0;i<ans.size();i++)
{
cout<<ans[i]<<" ";
}
return 0;
}