# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
725198 | 2023-04-17T03:15:51 Z | Batorgil952 | 순열 (APIO22_perm) | C++17 | 2 ms | 340 KB |
#include<bits/stdc++.h> #include "perm.h" using namespace std; std::vector<int> construct_permutation(long long k) { vector< int > v; int a[62]={0}, b[62]={0}; long long m=k, f=-1, r; for(int i=0; i<=60; i++){ if(m%2==1){ a[i]=1; } m/=2; } for(int i=60; i>=0; i--){ if(a[i]>0){ if(f==-1){ f=i; r=f; } else{ b[i]=f; f++; } } } for(int i=0; i<=60; i++){ if(b[i]>0) v.push_back(b[i]); if(i<r) v.push_back(i); } return v; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Partially correct | 2 ms | 340 KB | Partially correct |
6 | Correct | 1 ms | 340 KB | Output is correct |
7 | Correct | 1 ms | 340 KB | Output is correct |
8 | Partially correct | 2 ms | 340 KB | Partially correct |
9 | Correct | 1 ms | 340 KB | Output is correct |
10 | Partially correct | 2 ms | 340 KB | Partially correct |
11 | Partially correct | 1 ms | 340 KB | Partially correct |
12 | Partially correct | 1 ms | 340 KB | Partially correct |
13 | Partially correct | 2 ms | 340 KB | Partially correct |