oj.uz

Submission #980529

# Submission time Handle Problem Language Result Execution time Memory
980529 2024-05-12T08:23:35 Z Nexus Permutation (APIO22_perm) C++17
0 / 100
 1 ms 344 KB 
#include <bits/stdc++.h>
#define ll long long

using namespace std;

const ll N=1e6+9,M=2e18+9,mod=1e9+7;

ll a[66],q,k,x,y,z;
vector<int>v;

vector<int>construct_permutation(ll k)
{
    x=log2(k);
    v.clear();
    y=x-1;
    k-=pow(2,x);
    for(ll i=62;i>=0;--i)
    {
        if(k>=pow(2,i))k-=pow(2,i),a[i]=1,++y;else a[i]=0;
    }
    for(ll i=0;i<x;++i)
    {
        v.push_back(i);
        if(a[i])v.push_back(y),--y;
    }
    return v;
}

/*
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);

    cin>>q;
    while(q--)
    {
        cin>>k;
        vector<int>g=construct_permutation(k);
        for(auto i:g)cout<<i<<' ';
        cout<<'\n';
    }
}
*/

Subtask #1
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 90.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -