PAT L2-010. 排座位

题目链接：https://www.patest.cn/contests/gplt/L2-010

题意：两个顶点有权值为1的边直接相连，是“真正的朋友”；两个顶点间存在一条权值全是1的链相连，说明有“朋友关系”，所以可以用并查集来处理。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>

using namespace std;

#define FOR(i,k,n) for(int i=k;i<n;i++)
#define FORR(i,k,n) for(int i=k;i<=n;i++)
#define scan(a) scanf("%d",&a)
#define scann(a,b) scanf("%d%d",&a,&b)
#define scannn(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define mst(a,n)  memset(a,n,sizeof(a))
#define ll long long
#define N 105
#define mod 1000000007
#define INF 0x3f3f3f3f

const double eps=1e-8;
const double pi=acos(-1.0);
int f[N];
int vis[N][N];
int Find(int x)
{
    return f[x]==x?x:f[x]=Find(f[x]);
}
void Union(int x,int y)
{
    f[Find(x)]=Find(y);
}
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);

    int n,m,q;
    while(~scanf("%d%d%d",&n,&m,&q))
    {
        mst(vis,0);
        FOR(i,0,N) f[i]=i;
        int u,v,val;
        FOR(i,0,m)
        {
            scann(u,v); scan(val);
            vis[u][v]=val;
            vis[v][u]=val;
            if(val==1) Union(u,v);
        }
        FOR(i,0,q)
        {
            scann(u,v);
            if(vis[u][v])
            {
                if(vis[u][v]==1) printf("No problem\n");
                else
                {
                    if(Find(u)==Find(v)) printf("OK but...\n");
                    else printf("No way\n");
                }
            }
            else
            {
                if(Find(u)==Find(v)) printf("No problem\n");
                else printf("OK\n");
            }
        }
    }
    return 0;
}