gym101612 G Grand Test (dfs)

题意

给定一张无向图，求是否能在图中找到一对点，使得其有3条不重复（中间途径的点不相同）的简单路，并输出方案

题解

1. 首先对图创建成一颗dfs树。
2. 枚举图中不是树边的边，（其树边上对应的路径必定是一条链），将该链以及该边染色，若发现一条边重复染色则记录下这两种染色，退出枚举
3. 重新跑一遍这两种染色方案，可以在图中得到两个简单环，之后找到两个简单环中的任意三度结点作为起点和终点，暴力求简单边即可（由于将图缩成了两个简单环，所以无序考虑路径选择的问题）

代码

/**
 *     author:     TelmaZzzz
 *     create:     2019-09-07-20.09.47
**/
#include <map>
#include <set>
#include <ctime>
#include <cmath>
#include <queue>
#include <stack>
#include <ctime>
#include <string>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
//#include <random>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
void _R(int &x) { scanf("%d", &x); }
void _R(ll &x) { scanf("%lld", &x); }
void _R(db &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
void _W(const int &x) { printf("%d", x); }
void _W(const ll &x) { printf("%lld", x); }
void _W(const db &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
#define rep(x,y,z) for(int x=y;x<=z;x++)
#define erp(x,y,z) for(int x=y;x>=z;x--)
#define PB push_back
#define MP make_pair
#define INF 1073741824
#define inf 1152921504606846976
#define pi 3.14159265358979323846
//#pragma comment(linker,"/STACK:10240000,10240000")
//mt19937 rand_(time(0));
const int N=3e5+7,M=2e6+7;
const long long mod=1e9+7;
inline int read(){int ret=0;char ch=getchar();bool f=1;for(;!isdigit(ch);ch=getchar()) f^=!(ch^'-');for(;isdigit(ch);ch=getchar()) ret=(ret<<1)+(ret<<3)+ch-48;return f?ret:-ret;}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}//逆元
int head[N],NEXT[M],ver[M],tot;void link(int u,int v){ver[++tot]=v;NEXT[tot]=head[u];head[u]=tot;}
int indeg[N];

bool vis[N],mark[M],VIS[N];
int deep[N];
int col[M];
bool flag,flag2;
struct node{
    int u,v;
}que[M];
vector<int>res;
int ans[N];
int fa[N];
int pos[N];
void dfs(int x,int dep){
    deep[x]=dep;
    vis[x]=true;
    //cout<<x<<endl;
    for(int i=head[x];i;i=NEXT[i]){
        int y=ver[i];
        if(vis[y]) continue;
        mark[i]=true;
        mark[i^1]=true;
        dfs(y,dep+1);
        fa[y]=x;
        pos[y]=i/2;
    }
}
int A,B;
void dfs2(int x,int T,int id){
    while(x!=T){
        if(col[pos[x]]){
            A=col[pos[x]];
            B=id;
            flag=true;
            col[pos[x]]=id;
        }
        else {
            col[pos[x]]=id;
        }
        //cout<<x<<' '<<fa[x]<<' '<<pos[x]<<endl;
        x=fa[x];
    }
}
void dfs4(int x,int pre,int T){
    for(int i=head[x];i;i=NEXT[i]){
        if(!mark[i]) continue;
        int y=ver[i];
        if(y==pre) continue;
        //int tmp=col[i/2];
        if(y==T){
            col[i/2]++;
            flag2=true;
            return;
        }
        dfs4(y,x,T);
        if(flag2){
            col[i/2]++;
            return;
        }
    }
}

int S;
int Size;
void dfs3(int x,int T,int cc){
    ans[cc]=x;
    VIS[x]=true;
    for(int i=head[x];i;i=NEXT[i]){
        int y=ver[i];
        if(col[i/2]==0) continue;
        //if(y==pre) continue;
        if(y==T){
            if((S==x&&!flag2)||S!=x){
                ans[cc+1]=T;
                Size=cc+1;
                flag=true;
                if(S==x)
                    flag2=true;
                return;
            }
            else {
                continue;
            }
        }
        if(VIS[y]) continue;
        dfs3(y,T,cc+1);
        if(flag) return;
    }
}
int main(){
    freopen("grand.in","r",stdin);
    freopen("grand.out","w",stdout);
    //ios::sync_with_stdio(false);
    int t;
    R(t);
    int n,m;
    int u,v;
    rep(tt,1,t){
        R(n,m);
        vector<int>res_;
        swap(res_,res);
        rep(i,1,(m+1)*2) mark[i]=false,col[i]=0;
        rep(i,1,n) head[i]=0,VIS[i]=false,vis[i]=false,indeg[i]=0,deep[i]=0;
        tot=1;
        flag2=false;
        flag=false;
        rep(i,1,m){
            R(u,v);
            link(u,v);
            link(v,u);
            //indeg[v]++;
            //indeg[u]++;
            que[i].u=u;
            que[i].v=v;
        }
        for(int i=1;i<=n;i++){
            if(vis[i]) continue;
            dfs(i,1);
        }
        int num=0;
        for(int i=1;i<=m;i++){
            if(mark[i*2]) continue;
            u=que[i].u;
            v=que[i].v;
            num++;
            flag2=false;
            flag=false;
            //cout<<deep[u]<<' '<<deep[v]<<endl;
            if(deep[u]>deep[v]){
                //cout<<u<<' '
                dfs2(u,v,i);
            }
            else {
                dfs2(v,u,i);
            }
            col[i]=i;
            if(flag) break;
        }
//        rep(i,1,m) cout<<col[i]<<' ';
//        cout<<endl;
        //if(t==17654&&tt==7133) printf("now%d\n",num);
        if(!flag){
            puts("-1");
            continue;
        }
        rep(i,1,m) col[i]=0;
        u=que[A].u;
        v=que[A].v;
        col[A]++;
        flag2=false;
        if(deep[u]>deep[v]){
            dfs4(v,0,u);
        }
        else {
            dfs4(u,0,v);
        }
        //cout<<u<<' '<<v<<endl;
        u=que[B].u;
        v=que[B].v;
        col[B]++;
        //cout<<u<<' '<<v<<endl;
        flag2=false;
        if(deep[u]>deep[v]){
            dfs4(v,0,u);
        }
        else {
            dfs4(u,0,v);
        }
        //rep(i,1,m) cout<<col[i]<<' ';
        //cout<<endl;
        rep(i,1,m) if(col[i]) indeg[que[i].v]++,indeg[que[i].u]++;
        for(int i=1;i<=m;i++){
            if(col[i]>=2){
                if(indeg[que[i].u]>=3) res.PB(que[i].u);
                if(indeg[que[i].v]>=3)
                    res.PB(que[i].v);
            }
        }
        //cout<<res.size()<<endl;
        if(res.size()<=1){
            puts("-1");
            continue;
        }
        u=res[0],v=res[1];
        //cout<<"UES"<<endl;
        //bool ok=true;
        flag2=false;
        S=u;
        W(u,v);
        rep(i,1,3){
            flag=false;
            dfs3(u,v,1);
            if(!flag) puts("NO");
            printf("%d",Size);
            for(int j=1;j<=Size;j++) printf(" %d",ans[j]);
            puts("");
        }
        //cout<<u<<' '<<v<<endl;

    }
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}