# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
982754 | 2024-05-14T17:17:11 Z | vjudge1 | 순열 (APIO22_perm) | C++17 | 2 ms | 348 KB |
#include "perm.h" #include<bits/stdc++.h> using namespace std; vector<int>construct_permutation(long long k){ vector<int>b,r,sol(150,0); for(int i=0;k;i++){ if(k&1)b.push_back(i); k/=2; } for(int i=0;i<b.back();i++){ r.push_back(i*2+1); sol[i*2+1]=1; } b.pop_back(); while(!b.empty()){ r.push_back(b.back()*2); sol[b.back()*2]=1; b.pop_back(); } for(int i=0,p=0;i<150;i++) if(sol[i]==1)sol[i]=p,p++; for(int i=0;i<r.size();i++){ r[i]=sol[r[i]]; } return r; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 348 KB | Output is correct |
5 | Partially correct | 1 ms | 348 KB | Partially correct |
6 | Correct | 1 ms | 348 KB | Output is correct |
7 | Correct | 1 ms | 348 KB | Output is correct |
8 | Partially correct | 1 ms | 348 KB | Partially correct |
9 | Correct | 1 ms | 348 KB | Output is correct |
10 | Partially correct | 2 ms | 348 KB | Partially correct |
11 | Partially correct | 1 ms | 348 KB | Partially correct |
12 | Partially correct | 1 ms | 344 KB | Partially correct |
13 | Partially correct | 1 ms | 348 KB | Partially correct |