제출 #603054

#제출 시각아이디문제언어결과실행 시간메모리
603054tutis순열 (APIO22_perm)C++17
0 / 100
113 ms262144 KiB
#include "perm.h" using namespace std; #include <iostream> #include <random> #include <functional> #include <cassert> #include <map> using ll = long long; std::vector<int> construct_permutation(long long k, bool v) { if (k == 1) return {}; if (v) { if (k == 3) return {1, 0}; if (k == 4) return {2, 1, 0}; } if (k % 2 == 0) { vector<int>a = construct_permutation(k / 2, v); a.push_back((int)a.size()); return a; } if (k % 4 == 3) { vector<int>a = construct_permutation(k - 3, true); for (int &i : a) if (i >= 2) i++; a.push_back(2); return a; } if (k % 2 == 1) { vector<int>a = construct_permutation(k - 1, v); a.insert(a.begin(), (int)a.size()); return a; } } vector<int> construct_permutation(long long k) { return construct_permutation(k, false); }

컴파일 시 표준 에러 (stderr) 메시지

perm.cpp: In function 'std::vector<int> construct_permutation(long long int, bool)':
perm.cpp:41:1: warning: control reaches end of non-void function [-Wreturn-type]
   41 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...