CF——Codeforces 891 C Envy

Codeforces 891 C Envy

题解:

1.kruskal + dsu
2.提前将query 中 e.cost = w 的存下减小复杂度
3.每次利用kruskal贪心边时，若贪心的边的权重变大，则先判断Q[w]中的各个询问是否满足
即无环形成，通过w前的dsu判断，记得复原dsu（reload）
原因：因为w前的最小生成森林虽然不唯一，但是点集唯一，若qi中所有wi的边都可以在wi时放入，则证明存在一个MST包含qi中所有边。

注意：
wrong 可能是 该调用find_()函数是调用了find();
t 可能是没有将query根据w离线来查询;

AC code

#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<algorithm>
#include<ctime>
#include<cctype>
#include<cmath>
#include<string>
#include<cstring>
#include<stack>
#include<queue>
#include<list>
#include<vector>
#include<map>
#include<set>
#include<complex>
#include<iomanip>
#define sqr(x) ((x)*(x))
#define MOD 1e9+7
#define INF 0x3f3f3f3f
const double PI = acos(-1.0);
const double eps = 1e-6;
const int maxm =  5e5 + 100;
const int maxn =  5e5 + 100;
typedef long long LL;
using namespace std;

int n,m,q;
vector<pair <int,int> > Q[maxn];
bool vis[maxn];

int f[maxn];

void init()
{
    for(int i = 1; i <= n; i++)
        f[i] = i;
}

int find(int x)
{
    return  f[x] == x? x :f[x] =  find(f[x]);
}

bool same(int x, int y)
{
    return find(x) == find(y);
}

void unit(int x, int y)
{
    x = find(x);
    y = find(y);
    if(x != y)
        f[x] = y;
}

struct edge{
    int u,v,cost;
};

bool cmp(const edge& e1, const edge& e2)
{
    return e1.cost < e2.cost;
}
edge es[maxm],et[maxm];
int top = 0,val[maxn];
int *s[maxn]; //be used to reload 

int find_(int x){
    if(x==f[x]) return x;
    s[++top]=f+x;
    val[top]=f[x];
    f[x]=find_(f[x]);
    return f[x];
}

void reload()
{
    while(top){
        (*s[top])=val[top];--top;
    }
}

void solve(int& w)
{

    int ed = Q[w].size();
    int r = -1;
    for(int j = 0; j < ed; j++)
    {
        pair<int,int> l;
        l = Q[w][j];
        int y = l.first;
        if(!vis[y]) continue;
        int x = l.second;
        if(y > r){reload();r = y;};
        int p1=find_(et[x].u);
        int p2=find_(et[x].v);
        if(p1!=p2){
            s[++top]=f+p1;
            val[top]=f[p1];
            f[p1]=p2;
        }
        else vis[y] = false;
    }
    reload();//don't forget it
}
int main()
{
    scanf("%d%d",&n,&m);
    init();
    for(int i = 1; i <= m; i++)
    {scanf("%d%d%d",&es[i].u,&es[i].v,&es[i].cost);et[i] = es[i];}
    sort(es+1,es+m+1,cmp);
    scanf("%d",&q);
    memset(vis,true,sizeof(vis));
    for(int i = 0; i < q; i++)
    {
        int len;
        scanf("%d",&len);
        for(int j = 0; j < len; j++)
        {
            scanf("%d",&t);
            pair<int,int> pt;
            int w = et[t].cost;
            pt.first = i;
            pt.second = t;
            Q[w].push_back(pt);
        }

    }

    int value = -1;
    for(int i = 1; i <= m; i++)
    {
        edge e = es[i];
        if(e.cost > value)
        {
            value = e.cost;
            solve(value);
        }

        if(!same(e.u,e.v))
            unit(e.u,e.v);
    }

    for(int i = 0; i < q; i++)
        if(vis[i])  printf("YES\n");
        else printf("NO\n");
    return 0;
}

TLE code

#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<algorithm>
#include<ctime>
#include<cctype>
#include<cmath>
#include<string>
#include<cstring>
#include<stack>
#include<queue>
#include<list>
#include<vector>
#include<map>
#include<set>
#include<complex>
#include<iomanip>
#define sqr(x) ((x)*(x))
#define MOD 1e9+7
#define INF 0x3f3f3f3f
const double PI = acos(-1.0);
const double eps = 1e-6;
const int maxm =  5e5 + 100;
const int maxn =  5e5 + 100;
typedef long long LL;
using namespace std;



int n,m,q;
int t;
vector<pair <int,int> > Q[maxn];
bool vis[maxn];
int idx[maxn];

int f[maxn];

void init()
{
    for(int i = 1; i <= n; i++)
        f[i] = i;
    memset(idx,0,sizeof(idx));
}

int find(int x)
{
    return  f[x] == x? x :f[x] =  find(f[x]);
}

bool same(int x, int y)
{
    return find(x) == find(y);
}

void unit(int x, int y)
{
    x = find(x);
    y = find(y);
    if(x != y)
        f[x] = y;
}



struct edge{
    int u,v,cost;
};

bool cmp(const edge& e1, const edge& e2)
{
    return e1.cost < e2.cost;
}
edge es[maxm],et[maxm];
vector < pair <int,int> > P;


int find_(int x)
{
    return f[x] == x ? x : find_(f[x]);
}

bool same_(int x, int y)
{
    return find_(x) == find_(y);
}




void reload()
{
    for(int i = 0; i < P.size(); i++)
        f[P[i].first] = P[i].second;
}

void solve(int& value)
{
    for(int j = 0; j < q; j++)//TLE的原因
    {
        if(!vis[j]) continue;
        P.clear();
        int k  = idx[j];
        for(; k < Q[j].size(); k++)
        {
            int x = Q[j][k].second-1;
            if(et[x].cost == value)
            {
                int fx = find_(et[x].u);
                int fy = find_(et[x].v);
                if(fx == fy)
                {vis[j] = false;break;}
                pair <int ,int > p;
                p.first = fx;
                p.second = f[fx];
                P.push_back(p);
                f[fx] = fy;
            }
            else break;
        }
        idx[j] = k;
        reload();
    }
}
int main()
{
    scanf("%d%d",&n,&m);
    init();
    for(int i = 0; i < m; i++)
    {scanf("%d%d%d",&es[i].u,&es[i].v,&es[i].cost);et[i] = es[i];}
    sort(es,es+m,cmp);
    scanf("%d",&q);
    memset(vis,true,sizeof(vis));
    for(int i = 0; i < q; i++)
    {
        int len;
        scanf("%d",&len);
        for(int j = 0; j < len; j++)
        {scanf("%d",&t);pair<int,int> pt;pt.first = et[t-1].cost;pt.second = t;Q[i].push_back(pt);}
        sort(Q[i].begin(),Q[i].end());
    }

    int value = -1;
    for(int i = 0; i < m; i++)
    {
        edge e = es[i];
        if(e.cost > value)
        {
            value = e.cost;
            solve(value);
        }

        if(!same(e.u,e.v))
            unit(e.u,e.v);
    }

    for(int i = 0; i < q; i++)
        if(vis[i])  printf("YES\n");
        else printf("NO\n");
    return 0;
}