L2-010 排座位

并查+无向图
一遍过

#include
#include
using namespace std;
const int N = 110;
int f[N];
vector graph[N];
int n;
void init(){
    for(int i=0; i>n>>m>>k;
    init();
    for(int i=0; i>x>>y>>z;
        if( z == 1){
            merge(x,y);
        }else{
            graph[x].push_back(y);
            graph[y].push_back(x);
        }
    }
    for(int i=0; i>x>>y;
        int fx= find(x);
        int fy = find(y);
        int flag = 0;
        for(int j=0; j