cf501D. Misha and Permutations Summation

链接

点击跳转

题解

$ord(p)=a_1(n-1)!+a_2(n-2)!+...a_n$

其中$a_i$表示后面有几个数比他小

那我把两个排列都表示成这个，然后相加，再还原不就行了

代码

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 1000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(_,__) for(_=1;_<=(__);_++)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
    ll c, f(1);
    for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
    for(;isdigit(c);c=getchar())x=x*10+c-0x30;
    return f*x;
}
struct BIT
{
    ll bit[maxn], n;
    void init(int N){n=N;for(int i=1;i<=n;i++)bit[i]=0;}
    ll lowbit(ll x){return x&(-x);}
    void add(ll pos, ll v)
    {
        for(;pos<=n;pos+=lowbit(pos))bit[pos]+=v;
    }
    ll sum(ll pos)
    {
        ll ans(0);
        for(;pos;pos-=lowbit(pos))ans+=bit[pos];
        return ans;
    }
}bit;
ll n, a[maxn], b[maxn], c[maxn];
int main()
{
    ll i, x;
    
    n=read();
    
    bit.init(n);
    rep(i,n)
    {
        a[i]=read();
        bit.add(a[i]+1,+1);
    }
    rep(i,n)
    {
        c[i]+=bit.sum(a[i]);
        bit.add(a[i]+1,-1);
    }

    bit.init(n);
    rep(i,n)
    {
        b[i]=read();
        bit.add(b[i]+1,+1);
    }
    rep(i,n)
    {
        c[i]+=bit.sum(b[i]);
        bit.add(b[i]+1,-1);
    }

    for(i=n;i;i--)
    {
        c[i-1]+=c[i]/(n-i+1);
        c[i]%=n-i+1;
    }

    tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> tr;
    rep(i,n)tr.insert(i-1);

    rep(i,n)
    {
        auto it=tr.find_by_order(c[i]);
        printf("%lld ",*it);
        tr.erase(it);
    }
    return 0;
}