| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1361222 | FZ_Laabidi | Carnival (EGOI23_carnival) | C++20 | 1095 ms | 2848 KiB |
#include <bits/stdc++.h>
using namespace std;
signed main(){
int n; cin >> n;
vector<vector<int>> p(n);
for(int i=1; i<n; i++){
for(int j=0; j<i; j++){
int x; cin >> x;
p[i].push_back(x);
}
}
vector<int> perm(n);
for(int i=0; i<n; i++)perm[i]= i;
while (next_permutation(perm.begin(), perm.end())){
bool flag= true;
for(int i=1; i<n; i++){
int v = max(perm[i], perm[i-1]);
int u = min(perm[i], perm[i-1]);
int x = 0;
for(int j=0; j<v; j++){
if(p[v][j]==u)x = j;
}
if((v+1)/2 <=x)flag = false;
}
if(flag)break;
}
for(auto it: perm)cout << it << " ";
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
