oj.uz

Submission #650228

# Submission time Handle Problem Language Result Execution time Memory
650228 2022-10-13T02:20:56 Z truc12a2cvp Permutation (APIO22_perm) C++17
91.3333 / 100
 2 ms 344 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> II;
const int N = 1e5 + 5, logN = 20;
const int MOD = 1e9 + 7;
const ll INF = 1e9;

vector<int> construct_permutation(ll k){
       vector<int> ans;
       int m = 0;
       for(int i = 59; i >= 0; i --){
              if(k >> i & 1){
                     m = i;
                     break;
              }
       }
       for(int i = 0; i < m; i ++) ans.push_back(i);
       int cur = m - 1;
       for(int i = m - 1; i >= 0; i --){
              if(k >> i & 1){
                     ans.insert(ans.begin() + i, ++ cur);
              }
       }
       return ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct

Subtask #2
81.333333333 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Partially correct 2 ms 300 KB Partially correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 2 ms 296 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 2 ms 340 KB Partially correct
12 Partially correct 2 ms 296 KB Partially correct
13 Partially correct 2 ms 340 KB Partially correct