oj.uz

Submission #703519

# Submission time Handle Problem Language Result Execution time Memory
703519 2023-02-27T14:57:06 Z khanhhdz191 Permutation (APIO22_perm) C++17
100 / 100
 6 ms 360 KB 
#include <bits/stdc++.h>
#include <perm.h>

using namespace std;
#define ll long long
#define pll pair<ll,ll>
#define ff first
#define ss second
#define pb push_back
#define endl "\n"
/// ko dc giai nhat chat me tay di
/// khanhdzvcl

const ll inf=2e18;
ll C(vector<int> v)
{
    ll m=(int)v.size();
    vector<ll> f(m);
    ll sum=1;
    for (int i=0; i<m; i++)
    {
        f[i]=1;
        for (int j=0; j<i; j++)
        {
            if (v[j]<v[i]) 
                f[i]+=f[j];
            f[i]=min(f[i],inf);
        }
        sum+=f[i];
        sum=min(sum,inf);
    }
    return sum;
}

vector<int> construct_permutation(ll k)
{
    if (k==1) 
        return {};
    if (k==2) 
        return {0};
    if (k==3) 
        return {1,0};
    // if (k==4)
        // return {0,1};
    auto ans=construct_permutation(k/4);
    int n=(int)ans.size();
    if (k%4==0)
    {
        ans.pb(n);
      //  ans.pb(0);
        ans.pb(n+1);
      //  for (auto &p:ans) p++;
        return ans;
    }
    if (k%4==1)
    {
        ans.pb(n);
        ans.pb(n+1);
        ans.pb(-1);
        for (auto &p:ans) p++;
        return ans;
    }
    if (k%4==2)
    {
        ans.pb(n);
        ans.pb(-1);
        ans.pb(n+1);
        for (auto &p:ans) p++;
        return ans;
    }
    auto man=ans;
    ans.pb(n);
    ans.pb(n+1);
    for (int i=0; i<(ll)ans.size(); i++)
    {
        if (ans[i]>1) 
            ans[i]++;
    }
    ans.pb(2);
    if (C(ans)==k)
        return ans;
    for (auto &p:man) p+=2;
    man.pb(n+2);
    man.pb(1);
    man.pb(n+3);
    man.pb(0);
    return man;
}


























/*
void tc()
{
    ll k;
    cin>> k;
    auto v=construct_permutation(k);
    for (auto &p:v) 
        cout<< p<<' ';
}

int main()
{
   // freopen("bi.txt","r",stdin); 
   // freopen("out.txt","w",stdout);
   
    ios_base::sync_with_stdio(0); cin.tie(nullptr);
     ll t=1;
   cin>> t;
    while (t--) 
    {
        tc();
        cout<< endl;
    }

}

*/

Subtask #1
10.0 / 10.0

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

Subtask #2
90.0 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 Correct 3 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 6 ms 360 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 2 ms 296 KB Output is correct
13 Correct 5 ms 340 KB Output is correct