답안 #970454

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
970454	2024-04-26T14:38:47 Z	steveonalex	순열 (APIO22_perm)	C++17	10 / 100	1000 ms	448 KB

perm

#include <bits/stdc++.h>
#include "perm.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define ALL(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
 
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return ((ull) rng()) % (r - l + 1) + l;}
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return mask & (-mask);}
ll pop_cnt(ll mask){return __builtin_popcountll(mask);}
ll ctz(ll mask){return __builtin_ctzll(mask);}
ll clz(ll mask){return __builtin_clzll(mask);}
ll logOf(ll mask){return 63 - clz(mask);}
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b){a = b; return true;}
        return false;
    }
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b){a = b; return true;}
        return false;
    }
template <class T>
    void printArr(T& a, string separator = " ", string finish = "\n", ostream& out = cout){
        for(auto i: a) out << i << separator;
        out << finish;
    }
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

ll count_i(vector<int> perm){
    int n = perm.size();
    perm.insert(perm.begin(), -1);
    vector<ll> dp(n+1); dp[0] = 1;
    ll sum = 1;
    for(int i = 1; i<=n; ++i){
        for(int j = 0; j<i; ++j) if (perm[j] < perm[i]) dp[i] += dp[j];
        sum += dp[i];
    }
    return sum;
}


vector<int> construct_permutation(ll k){
    int j = 0;
    for(; k >= MASK(j + 1); ++j) ;
    j--;     
    vector<int> ans;
    for(int i = 0; i<=j; ++i) ans.push_back(i);

    ll cur = MASK(j+1);
    while(cur < k){
        vector<int> best_config;

        for(int i = 0; i <= ans.size(); ++i) // inserted value
        for(int j = 0; j <= ans.size(); ++j) { // inserted position
            vector<int> bruh = ans;
            for(int &t: bruh) if (t >= i) t++;
            bruh.insert(bruh.begin() + j, i);

            ll cnt = count_i(bruh);
            if (cnt <= k && maximize(cur, cnt)) best_config = bruh;
        }
        ans = best_config;
    }

    return ans;
}

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

//     // for(int i = 2; i<=100; ++i){
//     //     vector<int> perm = construct_permutation(i);
//     //     if (count_i(perm) != i){
//     //         cout << i << " " << count_i(perm) << "\n";
//     //         printArr(perm);
//     //         break;
//     //     }
//     // }

//     vector<int> perm = construct_permutation(1e18);
//     cout << perm.size() << "\n";

//     return 0;
// }

Compilation message

perm.cpp: In function 'std::vector<int> construct_permutation(ll)':
perm.cpp:71:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |         for(int i = 0; i <= ans.size(); ++i) // inserted value
      |                        ~~^~~~~~~~~~~~~
perm.cpp:72:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |         for(int j = 0; j <= ans.size(); ++j) { // inserted position
      |                        ~~^~~~~~~~~~~~~

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	2 ms	348 KB	Output is correct

Subtask #2

0.0 / 90.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	2 ms	348 KB	Output is correct
3	Correct	56 ms	436 KB	Output is correct
4	Correct	175 ms	448 KB	Output is correct
5	Execution timed out	1058 ms	448 KB	Time limit exceeded
6	Halted	0 ms	0 KB	-