제출 #1275360

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1275360		pvpro	순열 (APIO22_perm)	C++20	91.33 / 100	2 ms	580 KiB

perm

#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <cmath>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <chrono>
#include <random>
#include <complex>
#include <numeric>
#include <assert.h>
#include <functional>
#include <climits>
#include <cstring>
#include <iterator>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

using ll = long long;
using ld = long double;
using ushort = unsigned short;

#ifndef LOCAL
#define endl "\n"
#endif
#define f first
#define s second
#define vec vector
#define pii pair<int, int>
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
template<typename T1, typename T2>
istream& operator>> (istream &in, pair<T1, T2> &p) { in >> p.f >> p.s; return in; }
template<typename T1, typename T2>
ostream& operator<< (ostream &out, pair<T1, T2> p) { out << "(" << p.f << " " << p.s << ")"; return out; }
#define printv(v) cerr << #v << " "; for (auto &x : v) { cerr << x << " "; } cerr << endl;
#define printvv(v) cerr << #v << " "; for (auto &x : v) { for (auto &y : x) { cerr << y << " "; } cerr << endl; }
#define debug(x) cerr << #x << " " << x << endl;

template<typename T>
istream& operator>> (istream &in, vector<T> &v) {
    for (auto &x : v) {
        in >> x;
    }
    return in;
}
template<typename T>
ostream& operator<< (ostream &out, vector<T> v) {
    for (auto &x : v) {
        out << x << " ";
    }
    return out;
}
template<typename T>
void operator-=(vector<T> &v, int delta) {
    for (auto &x : v) {
        x -= delta;
    }
}
template<typename T>
void operator+=(vector<T> &v, int delta) {
    for (auto &x : v) {
        x += delta;
    }
}

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

vector<int> construct_permutation(ll k) {
    int l = 0;
    while ((1ll<<l) <= k) {
        ++l;
    }
    --l;
    int cnt = l;
    for (int i = 0; i < l; ++i) {
        if (k&(1ll<<i)) {
            ++cnt;
        }
    }
    vector<int> ans;
    for (int i = 0; i < l; ++i) {
        if (k&(1ll<<i)) {
            ans.pb(--cnt);
        }
        ans.pb(i);
    }
    return ans;
}

#ifdef LOCAL
static long long MX=1e18;

static bool check_permutation(vector<int> v)
{
    sort(v.begin(),v.end());
    for(int i=0;i<v.size();i++)
        if(v[i]!=i) return 0;
    return 1;
}

long long count_increasing(const vector<int>& v) {
    vector<long long> dp(v.size() + 1, 0);
    dp[0] = 1;
    for (int x : v)
    {
        for (int i = 0; i <= x; i++)
        {
            dp[x+1] += dp[i];
            dp[x+1] = min(dp[x+1],MX+1);
        }
    }
    long long result = 0;
    for (int i = 0; i <= (int)v.size(); i++){
        result += dp[i];
        result = min(result,MX+1);
    }
    return result;
}

int main() {
    freopen("in.txt", "r", stdin);
    int t;
    assert(1 == scanf("%d", &t));
    while(t--)
    {
        long long k;
        assert(1 == scanf("%lld",&k));
        vector<int> ret=construct_permutation(k);
        if(!check_permutation(ret))
        {
            printf("WA: Returned array is not a permutation\n");
            exit(0);
        }
        long long inc=count_increasing(ret);
        if(inc!=k)
        {
            if(inc==MX+1)
                printf("WA: Expected %lld increasing subsequences, found more than %lld\n",k, MX);
            else
                printf("WA: Expected %lld increasing subsequences, found %lld\n",k,inc);
            exit(0);
        }
        printf("%d\n",(int)ret.size());
        for(int i=0;i<ret.size();i++)
        {
            printf("%d",ret[i]);
            if(i+1==ret.size())
                printf("\n");
            else
                printf(" ");
        }
    }
    return 0;
}
#endif

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