竞赛图

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod=1e9+7;
const int inf=0x3f3f3f3f;
const int maxn=1e5+7;
list<int> List;
int Matrix[505][505];
int main(){
    int t;
    scanf("%d",&t);
    while(t--){
        int N;
        List.clear();
        for(int i=1;i<=N;++i)
            for(int j=1;j<=N;++j)
                scanf("%d",&Matrix[i][j]);
        List.push_back(1);
        for(int i=2;i<=N;++i){
            int CountIn=0,CountOut=0;
            for(auto it:List){
                if(Matrix[i][it]) ++CountOut;
                else ++CountIn;
            }
            if(CountOut==i-1) List.push_front(i);//加入列头 
            else if(CountIn==i-1) List.push_back(i);//加入列尾 
            else{//找到(u,v)(v,w) 
                auto it=List.begin();
                for(;it!=List.end();++it){
                    auto Next=it;++Next;
                    if(Next==List.end()) break;
                    if(Matrix[*it][i] && Matrix[i][*Next]) break;
                }
                List.insert(++it,i);
            }
        }
        int Count=0;
        for(auto it:List){
            ++Count;
            printf("%d",it);
            if(Count<N) printf(" ");
        }
        printf("\n");
    }
    return 0;
}