제출 #984094

#제출 시각아이디문제언어결과실행 시간메모리
984094Izaz순열 (APIO22_perm)C++17
0 / 100
1084 ms412 KiB
#include <bits/stdc++.h> using namespace std; #define f first #define s second #define mn(a,b) min(a,b) #define mx(a,b) max(a,b) #define ll long long vector<int> construct_permutation(long long k) { int K = k; vector<int>AL; for(int i = 0 ; i < 9;i ++ ){ AL.push_back(i); vector<int>Z = AL; int yes = 0; do{ int N = AL.size(); int Cnt = 1 ; for(int i = 1 ; i < (1<< N); i ++){ bool P = 1; int last = - 1; for(int j = 0 ; j < N;j++){ if((1<<j)&i){ if(last > Z[j]){ P =0; break; } last = Z[j]; } } if(P)Cnt++; } if(Cnt == K){ yes = 1; break; } }while(next_permutation(Z.begin(),Z.end())); if(yes){ return Z; } } return {0}; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...