Submission #1361258

#TimeUsernameProblemLanguageResultExecution timeMemory
1361258FZ_LaabidiCarnival (EGOI23_carnival)C++20
34 / 100
76 ms6968 KiB
#include <bits/stdc++.h>
using namespace std;

signed main(){
    int n; cin >> n;
    vector<vector<int>> p(n);
    vector<vector<int>> posi(n-1, vector<int>(n, -1));
    for(int i=1; i<n; i++){
        for(int j=0; j<i; j++){
            int x; cin >> x;
            p[i].push_back(x);
            posi[x][i]= j;
        }
    }
   
    vector<int> perm(1);
    perm[0]= n-1;
    vector<int>visited(n, 0);
    visited[n-1]= 1;
    for(int i=1; i<n; i++){
        int x = perm[i-1];
        int ma = 0;

        for(int j=0; j<n; j++){
            if(j>=ma && visited[j]==0){
                if(j<x&& posi[j][x] < (x+1)/2)ma = j;
                else if(j>x && posi[x][j]<(j+1)/2)ma = j;
            }
        }
        visited[ma]= 1;
        perm.push_back(ma);
    }
    for(auto it: perm)cout << it << " ";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...