题目链接:https://codeforces.com/contest/1100/problem/E
题目大意:给一张有向图,每条边都有权值,反转一些边使得有向图无环,并使被反转的边中的最大权值最小,输出最小的最大权值,需要翻转的边数以及编号
题目思路:二分最小的最大权值,对大于mid的边进行建边,然后拓扑排序判环,并保留拓扑序。然后对小于等于mid的边用邻接表建立双向边,要求用拓扑序小的点指向大的点。则按照拓扑序从小到大遍历,如果边的编号是偶数,说明是题目给出的边,不用反转,如果是奇数就说明是反边
以下是代码:
#include<bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
#define ll long long
const int MAXN = 1e5+5;
#define PI acos(-1)
queue<int>q;
vector<int>p,t;
int n,m,u,v,c;
struct Edge{
int to,w,next;
}edge[MAXN<<1];
struct node{
int u,v,w;
}a[MAXN];
int head[MAXN],tot,du[MAXN],vis[MAXN<<1];
void addedge(int u,int v,int w){
edge[tot].to=v,edge[tot].w=w,edge[tot].next=head[u],head[u]=tot++;
}
bool check(int x){
while(!q.empty())q.pop();
p.clear();
memset(head,-1,sizeof(head));
memset(du,0,sizeof(du));
memset(vis,0,sizeof(vis));
tot=0;
rep(i,1,m){
if(a[i].w>x){
addedge(a[i].u,a[i].v,a[i].w);
du[a[i].v]++;
vis[a[i].u]=1;
vis[a[i].v]=1;
}
}
rep(i,1,n){
if(!du[i])q.push(i);
}
while(!q.empty()){
int temp=q.front();
p.push_back(temp);
q.pop();
vis[temp]=0;
for(int i=head[temp];i!=-1;i=edge[i].next){
int v=edge[i].to;
du[v]--;
if(!du[v]){
q.push(v);
}
}
}
rep(i,1,n){
if(vis[i])return 0;
}
return 1;
}
int solve(int x){
memset(head,-1,sizeof(head));
memset(vis,0,sizeof(vis));
t.clear();
tot=0;
rep(i,1,m){
addedge(a[i].u,a[i].v,a[i].w);
addedge(a[i].v,a[i].u,a[i].w);
}
int len=p.size();
rep(j,0,len-1){
int u=p[j];
for(int i=head[u];i!=-1;i=edge[i].next){
int v=edge[i].to;
if(edge[i].w<=x&&!vis[i/2]){
vis[i/2]=1;
if(i%2==1)t.push_back(i/2+1);
}
}
}
len=t.size();
printf("%d %d\n",x,len);
rep(i,0,len-1){
printf("%d%c",t[i],i==len-1?'\n':' ');
}
}
int main()
{
while(~scanf("%d%d",&n,&m)){
rep(i,1,m){
scanf("%d%d%d",&a[i].u,&a[i].v,&a[i].w);
}
int l=0,r=1e9,ans;
while(l<=r){
int mid=(l+r)>>1;
if(check(mid))r=mid-1,ans=mid;
else l=mid+1;
}
check(ans);
solve(ans);
}
return 0;
}