oj.uz

답안 #984109

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
984109 2024-05-16T10:12:39 Z vjudge1 순열 (APIO22_perm) C++17
65.2769 / 100
 11 ms 1372 KB 
#include "perm.h"
#include<bits/stdc++.h>
#define sz size()
#define ll long long
using namespace std;
mt19937_64 rnd(2983101);
vector<int> construct_permutation(ll k)
{
    ll z = 1, sum = 0;
    --k;
    vector<ll> x;
    for(ll t = 1; t <= 100; ++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 st = 0; st <= 1000; ++st)
    {
        vector<ll> _x;
        ll _k = k;
        ll cnt = 0;
        for(ll t = 1; t <= 500 && _k > 0; ++t)
        {
            ll mx = (1l << (63ll - __builtin_clzll(_k)));
            ll m = rnd() % mx;
            ++m;
            _k -= (1ll << m);
            _x.push_back(m);
            cnt += m;
        }
        if(cnt > 0 && cnt < sum)
            sum = cnt, x = _x;
    }

    reverse(x.begin(), x.end());
    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 << ' ';
//}

Subtask #1
10.0 / 10.0

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

Subtask #2
55.276923078 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Partially correct 2 ms 348 KB Partially correct
4 Partially correct 2 ms 348 KB Partially correct
5 Partially correct 6 ms 860 KB Partially correct
6 Partially correct 5 ms 604 KB Partially correct
7 Partially correct 7 ms 856 KB Partially correct
8 Partially correct 9 ms 1116 KB Partially correct
9 Correct 2 ms 348 KB Output is correct
10 Partially correct 11 ms 1372 KB Partially correct
11 Partially correct 10 ms 1172 KB Partially correct
12 Partially correct 8 ms 860 KB Partially correct
13 Partially correct 9 ms 1116 KB Partially correct