# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
575240 | 2022-06-10T03:43:26 Z | AJ00 | 순열 (APIO22_perm) | C++17 | 2 ms | 340 KB |
#include <bits/stdc++.h> using namespace std; int n; const int MOD = 1000000007; vector<int> construct_permutation(long long int k){ vector<int> ans,op; ans.push_back(0); if (k == 2){ return ans; } // cerr << dp[k] << "\n"; long long int cur = k; while (cur != 2){ if (cur%2==0){ op.push_back(2); cur = (cur/2); } else { op.push_back(1); cur--; } } reverse(op.begin(),op.end()); int maxm = 0,minm=0; for (int e: op){ if (e == 2){ ++maxm; ans.push_back(maxm); } else { --minm; ans.push_back(minm); } } for (int i = 0; i < ans.size(); i++){ ans[i] += abs(minm); } return ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 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 | 1 ms | 340 KB | Partially correct |
6 | Correct | 1 ms | 340 KB | Output is correct |
7 | Correct | 2 ms | 340 KB | Output is correct |
8 | Partially correct | 1 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 |