結果

問題 No.1311 Reverse Permutation Index
コンテスト
ユーザー ningenMe
提出日時 2020-12-08 01:30:54
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 1,500 ms
コード長 3,731 bytes
コンパイル時間 2,556 ms
コンパイル使用メモリ 205,908 KB
最終ジャッジ日時 2025-01-16 19:26:16
ジャッジサーバーID
（参考情報） 		judge5 / judge6
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 6
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define ALL(obj) (obj).begin(),(obj).end()
template<class T> using priority_queue_reverse = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = 1'000'000'000LL + 7; //'
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433L;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
vector<string> split(const string &str, const char delemiter) {vector<string> res;stringstream ss(str);string buffer; while( getline(ss, buffer, delemiter) ) res.push_back(buffer); return res;}
int msb(int x) {return x?31-__builtin_clz(x):-1;}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

vector<int> NtoPermutation(int S,long long N) {
    vector<ll> c(S+1,1);
    for(ll i=1;i<=S;++i) c[i]=c[i-1]*i;
    vector<int> v;
    for(int i=1;i<=S;++i) v.push_back(i);
    vector<int> p;
    ll sum = 0;
    int n=S;
    while(p.size()<S) {
        --n;
        int m=0;
        for(int i=0;i<v.size();++i) {
            if(sum + i*c[n]<=N) m=i;
        }
        sum += m*c[n];
        int x=v[m];
        p.push_back(x);
        v.erase(find(v.begin(),v.end(),x));
    }
    return p;
}

vector<int> invPermutation(vector<int> p) {
    vector<int> q(p.size());
    for(int i=0;i<p.size();++i) {
        q[p[i]-1]=i+1;
    }
    return q;
}

long long PermutationtoN(vector<int> p) {
    int S = p.size();
    vector<ll> c(S+1,1);
    for(ll i=1;i<=S;++i) c[i]=c[i-1]*i;
    vector<int> v;
    for(int i=1;i<=S;++i) v.push_back(i);
    long long sum=0;
    int n=S;
    for(int i=0;i<S;++i) {
        --n;
        int m=0;
        for(int j=0;j<v.size();++j)if(v[j]==p[i]) m=j;
        int x=v[m];
        v.erase(find(v.begin(),v.end(),x));
        sum += m*c[n];
    }
    return sum;
}

/**
 * @url 
 * @est
 */ 
int main() {
    cin.tie(0);ios::sync_with_stdio(false);
    ll N,S; cin >> N >> S;
    cout << PermutationtoN(invPermutation(NtoPermutation(S,N))) << endl;
    return 0;
}
0