L2-010 排座位 (25 分)

原题链接

#include <bits/stdc++.h>
using namespace std;
int f[1111];
int c[111][111];
void init()
{
    for (int i = 0; i < 111; i++)
    {
        f[i] = i;
    }
}
int find(int x)
{
    return f[x] == x ? x : f[x] = find(f[x]);
}
void merge(int x, int y)
{
    int nx = find(x);
    int ny = find(y);
    if (nx != ny)
    {
        f[nx] = ny;
    }
}
int main()
{
    init();
    int n, m, k, a, b, x;
    cin >> n >> m >> k;
    for (int i = 0; i < m; i++)
    {
        cin >> a >> b >> x;
        c[a][b] = x;
        c[b][a] = x;
        if (x == 1)
        {
            merge(a, b);
        }
    }
    for (int i = 0; i < k; i++)
    {
        cin >> a >> b;
        if (c[a][b] == 0)
            cout << "OK" << endl;
        else if (c[a][b] == 1)
            cout << "No problem" << endl;
        else
        {
            if (find(a) == find(b))
                cout << "OK but..." << endl;
            else
                cout << "No way" << endl;
        }
    }
}