oj.uz

답안 #984150

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
984150 2024-05-16T10:46:02 Z vjudge1 순열 (APIO22_perm) C++17
71.2154 / 100
 16 ms 1368 KB 
//#include "perm.h"
#include<bits/stdc++.h>
#define sz size()
#define ll long long
using namespace std;
mt19937_64 rnd(990910211394901);
vector<int> construct_permutation(ll k)
{
    ll z = 1, sum = 0, d;
    vector<ll> x;

    for(ll j = 59; j > 0; --j)
    {
        if((z << j) > k) continue;
        d = j;
        x.push_back(j);
        k -= (z << j);
        break;
    }


    ll _k = k;
    for(ll t = 1; t <= 1000; ++t)
        for(ll j = 59; j > 0; --j)
        {
            if((z << j) - 1 > _k) continue;
            x.push_back(j);
            _k -= (z << j) - 1;
            sum += j;
        }

    for(ll i = 1; i <= 90; ++i)
    {
        ll t = k - i;
        if(t < 2) break;
        ll cnt = d;
        vector<ll> _x(1, d);
        for(ll j = 59; j > 0; --j)
        {
            if((z << j) > t) continue;
            _x.push_back(j);
            cnt += j;
            t -= (z << j);
        }
        if(cnt < sum && i == (ll)_x.sz)
            sum = cnt, x = _x;
    }

    ll cur = 0;
    vector<int> ans;
    for(ll t : x)
    {
        for(ll i = cur + t; i > cur; --i)
            ans.push_back(i - 1);
        cur += t;
    }
    reverse(ans.begin(), ans.end());
    return ans;
}

//signed main()
//{
//    ios_base::sync_with_stdio(0);
//    cin.tie(0), cout.tie(0);
//    ll n;
//    cin >> n;
//    for(auto i : construct_permutation(n))
//        cout << i << ' ';
//}

Compilation message

perm.cpp: In function 'std::vector<int> construct_permutation(long long int)':
perm.cpp:42:17: warning: 'd' may be used uninitialized in this function [-Wmaybe-uninitialized]
   42 |             cnt += j;
      |             ~~~~^~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 4 ms 348 KB Output is correct

Subtask #2
61.215384618 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 4 ms 348 KB Output is correct
3 Partially correct 8 ms 348 KB Partially correct
4 Partially correct 6 ms 348 KB Partially correct
5 Partially correct 11 ms 604 KB Partially correct
6 Partially correct 9 ms 604 KB Partially correct
7 Partially correct 12 ms 860 KB Partially correct
8 Partially correct 14 ms 1116 KB Partially correct
9 Correct 5 ms 348 KB Output is correct
10 Partially correct 15 ms 1368 KB Partially correct
11 Partially correct 13 ms 1148 KB Partially correct
12 Partially correct 16 ms 1060 KB Partially correct
13 Partially correct 14 ms 1116 KB Partially correct