1218. Episode N-th: The Jedi Tournament（ｂｆｓ）

１２１８

简答题

对于当前点　判断每个点是否可达

 #include <iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<stdlib.h>
 #include<vector>
 #include<queue>
 #include<string>
 using namespace std;
 vector<int>ed[];
 int w[][],vis[];
 struct node
 {
     char s[];
     int a,b,c;
 }p[];
 int judge(int x,int y)
 {
     int a1 = p[x].a,a2 = p[x].b,a3 = p[x].c;
     int a4 = p[y].a,a5 = p[y].b,a6 = p[y].c;
     int o=;
     if(a1>a4)
     o++;
     if(a2>a5)
     o++;
     if(a3>a6)
     o++;
     if(o>=)
     return ;
     return ;
 }
 int spfa(int e,int s)
 {
     int i;
     memset(vis,,sizeof(vis));
     queue<int>q;
     q.push(s);
     vis[s] = ;
     while(!q.empty())
     {
         int u = q.front();
         w[u][s] = ;
         q.pop();
         for(i =  ;i < (int)ed[u].size() ; i++)
         {
             int v = ed[u][i];
             if(!vis[v])
             {
                 vis[v] = ;
                 q.push(v);
             }
         }
     }
     if(w[e][s])
     return ;
     return ;
 }
 int main()
 {
     int i,j,n;
     scanf("%d",&n);
     for(i = ; i <= n ; i++)
     {
         cin>>p[i].s>>p[i].a>>p[i].b>>p[i].c;
     }
     for(i = ; i <= n ;i++)
     {
         for(j = ; j <= n ; j++)
         {
             if(i==j)
             continue;
             if(judge(i,j))
             {
                 w[i][j] = ;
                 ed[j].push_back(i);
             }
         }
     }
     for(i = ; i <= n ;i++)
     {
         int flag = ;
         for(j =  ; j <= n ;j++)
         {
             if(i==j)
             continue;
             if(!w[i][j]&&!spfa(i,j))
             {
                 flag = ;
                 break;
             }
         }
         if(flag)
         printf("%s\n",p[i].s);
     }
     return ;
 }