Submission #1354375

#	Time	Username	Problem	Language	Result	Execution time	Memory
1354375		hsuan._.0528	Carnival (EGOI23_carnival)	C++20	40 / 100	1095 ms	3588 KiB

Main

#include<bits/stdc++.h>
using namespace std;
#define LL long long
const int maxn = 1000 + 10;

int n;
vector<int> v[maxn];
int order[maxn];
int vis[maxn];

void dfs(int x, int num){
 // cout<<x<<"\n";
    if(num==n){
        for(int i=1; i<=n; i++)  cout<<order[i]<<" ";
        exit(0);
    }
    for(int y: v[x]){
        if(vis[y])  continue;
        order[num+1] = y;
        vis[y]=1;
        dfs(y, num+1);
        vis[y]=0;
    }
}

signed main(){
    ios_base::sync_with_stdio(0);  cin.tie(0);

    cin>>n;
    for(int i=0; i<n; i++)
        for(int j=0; j<i; j++){
            int a;  cin>>a;
         //   cout<<i<<" "<<a<<" / "<<(j+1)<<" "<<(i+1)/2<<"\n";
            if((j+1) <= (i+1)/2){
                v[a].push_back(i);
                v[i].push_back(a);
            }
        }
    order[1] = n-1;
    vis[n-1]=1;
    dfs(n-1, 1);
}

• Subtask 0: 0 / 0
• Subtask 1: 11 / 11
• Subtask 2: 0 / 23
• Subtask 3: 29 / 29
• Subtask 4: 0 / 37