L2-010

转自点击打开链接

#include<cstdio>
#include<vector>
using namespace std;
vector<int>fri;
int enemy[101][101];
int findfri(int x){
   while(x!=fri[x])
     x=fri[x];
   return x;
}
void Union(int a,int b){
   int fria=findfri(a);
   int frib=findfri(b);
   if(fria!=frib)
      fri[fria]=frib;
}
int main()
{
  int n,m,k,a,b,c;
  scanf("%d %d %d",&n,&m,&k);
  fri.resize(n+1);
   for(int i=1;i<=n;i++)
       fri[i]=i;
   for(int i=0;i<m;i++){
    scanf("%d%d%d",&a,&b,&c);
    if(c==1)
        Union(a,b);
    else{
        enemy[a][b]=enemy[b][a]=1;
    }
   }
   for(int i=0;i<k;i++){
    scanf("%d %d",&a,&b);
    if(findfri(a)==findfri(b)&&enemy[a][b]==0)
        printf("No problem\n");
    else if(findfri(a)!=findfri(b)&&enemy[a][b]==0)
        printf("OK\n");
    else if(findfri(a)==findfri(b)&&enemy[a][b]==1)
        printf("OK but...\n");
    else if(enemy[a][b]==1)
        printf("No way\n");
   }
    return 0;
}