cf336D. Dima and Trap Graph

链接

点击跳转

题解

枚举答案区间的左端点$l$，把所有小于等于$l$的区间都考虑进来，按照右端点递减的顺序排序

然后依次加入，并查集维护连通性，直到起点终点联通，此时更新答案

代码

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 1000010
#define maxe 1000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(_,__) for(_=1;_<=(__);_++)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
    ll c, f(1);
    for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
    for(;isdigit(c);c=getchar())x=x*10+c-0x30;
    return f*x;
}
struct Lisan
{
    int tmp[maxn], tot;
    void clear(){tot=0;}
    void insert(int x){tmp[++tot]=x;}
    void run()
    {
        sort(tmp+1,tmp+tot+1);
        tot=unique(tmp+1,tmp+tot+1)-tmp-1;
    }
    void lisan(int *a, int len)
    {
        for(int i=1;i<=len;i++)a[i]=lower_bound(tmp+1,tmp+tot+1,a[i])-tmp;
    }
    int lisan(int x)
    {
        return lower_bound(tmp+1,tmp+tot+1,x)-tmp;
    }
}ls;
struct UnionFind
{
	int f[maxn];
	void init(int n)
	{
		for(auto i=1;i<=n;i++)f[i]=i;
	}
	int find(int x){return f[x]==x?x:f[x]=find(f[x]);}
	void merge(int x, int y){f[find(x)]=find(y);}
}uf;
ll n, m, ans, u[maxn], v[maxn], l[maxn], r[maxn], id[maxn];
ll calc(ll low)
{
    ll i;
    uf.init(n);
    rep(i,m)
    {
        if(l[id[i]]<=low)
            uf.merge(u[id[i]],v[id[i]]);
        if(uf.find(1)==uf.find(n))return r[id[i]]-low+1;
    }
    return 0;
}
int main()
{
    ll i, j;
    n=read(), m=read();
    rep(i,m)
    {
        u[i]=read(), v[i]=read(), l[i]=read(), r[i]=read();
        ls.insert(l[i]);
        id[i]=i;
    }
    sort(id+1,id+m+1,[](ll a, ll b){return r[a]>r[b];});
    ls.run();
    rep(i,ls.tot)
    {
        ans=max(ans,calc(ls.tmp[i]));
    }
    if(ans==0)cout<<"Nice work, Dima!";
    else cout<<ans;
    return 0;
}