제출 #726726

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
726726		vjudge1	순열 (APIO22_perm)	C++17	91.33 / 100	877 ms	596 KiB

perm

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma,popcnt")
#include<bits/stdc++.h>
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
#define lastbit(i) __builtin_ctz(i)
const long long inf=(long long)1e18+9;
long long cal(const vector<int>&vl){
if (vl.empty())return 1;
vector<long long>dp;
dp.resize(sz(vl));
long long ans=1;
for1(j,0,sz(vl)-1){
dp[j]=1;
for1(k,0,j-1){
if (vl[k]<vl[j]){
    dp[j]=min(dp[j]+dp[k],inf);
}
}
ans=min(inf,ans+min(dp[j],inf));
}
return ans;
}
vector<int> construct_permutation2(long long k){
   int num=0;
   vector<int>vcl;
   k--;
   while (k){
   //cerr<<k<<'\n';
   for2(i,60,1){
   if ((1ll<<i)-1<=k){
   k-=(1ll<<i)-1;
   vcl.pb(i);
   num+=i;
   //cerr<<i<<" "<<k<<'\n';
   break;
   }
   }
   }
   vector<int>ans;
   for (auto v:vcl){
   vector<int>hjhj;
   int dd=v;
   while (dd){
    hjhj.pb(num--);
    dd--;
   }
   reverse(all(hjhj));
   for (auto u:hjhj){
    ans.pb(u-1);
   }
   }
   return ans;
}
vector<int> construct_permutation(long long k){
   vector<int>ans;
   long long nw=1;
    for2(i,60,1){
    if ((1ll<<i)<=k){
        nw=(1ll<<i);
        for1(j,0,i-1){
        ans.pb(j);
        }
        break;
    }
    }
    while (k>nw){
    for (auto &v:ans){
        v++;
    }
    //cerr<<k<<'\n';
    /*cerr<<nw<<'\n';
    for (auto v:ans){
        cerr<<v<<" ";
    }
    cerr<<'\n';*/
    int szz=sz(ans);
    //cerr<<k<<" "<<szz<<'\n';
    for1(j,0,szz){
    //cerr<<j<<" "<<szz<<'\n';
    vector<int>newans;
    for1(k1,0,j-1){
    newans.pb(ans[k1]);
    //cerr<<k1<<'\n';
    }
    newans.pb(0);
    for1(k1,j,sz(ans)-1){
    newans.pb(ans[k1]);
    //cerr<<k1<<'\n';
    }
    long long value=cal(newans);
    if (value<=k){
        nw=value;
        ans=newans;
        //cerr<<sz(newans)<<" "<<j<<" "<<value<<'\n';
        break;
    }
    }
    if (nw==k)break;
   }
   vector<int>vcc=construct_permutation2(k);
   if (vcc.size()<ans.size()){
    swap(ans,vcc);
   }
   return ans;
}
/*signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen(".INP","r",stdin);
    //freopen(".OUT","w",stdout);
    for1(i,2,100000){
    vector<int>vl=construct_permutation(i);
    vector<int>dp;
    dp.resize(sz(vl));
    long long ans=1;
    for1(j,0,sz(vl)-1){
    dp[j]=1;
    for1(k,0,j-1){
    if (vl[k]<vl[j]){
        dp[j]+=dp[k];
    }
    }
    ans+=dp[j];
    }
    if (ans!=i){
        cout<<"vcl "<<i<<" "<<ans<<'\n';
        for1(j,0,sz(vl)-1){
        cout<<vl[j]<<" ";
        }
        return 0;
    }
    }
}*/

• Subtask 1: 10 / 10
• Subtask 2: 81.333333333 / 90