| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1346483 | Warinchai | 순열 (APIO22_perm) | C++20 | 0 ms | 344 KiB |
#include "perm.h"
#include<bits/stdc++.h>
using namespace std;
std::vector<int> construct_permutation(long long k)
{
vector<int>v;
vector<int>ans;
for(int i=0;i<64;i++){
if((k>>i)&1)v.push_back(i);
}
int cur=v.back()-1;
//cerr<<"cur:"<<cur<<"\n";
for(int i=0;i<v.back();i++){
if((k>>i)&1)ans.push_back(++cur);
ans.push_back(i);
}
//for(auto x:ans)cerr<<x<<" ";
//cerr<<"\n";
return ans;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
