제출 #598541

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

perm

#include "perm.h"
#include<bits/stdc++.h>

using namespace std;

vector<int> compress(vector<int> a)
{
    vector<int> help=a;
    sort(help.begin(),help.end());

    for(auto &w:a)
        w=lower_bound(help.begin(),help.end(),w)-help.begin();

    return a;
}

std::vector<int> construct_permutation(long long k)
{
    int low=-100,high=100;

	vector<int> outp={};

	while(k>1)
    {
        if(k%2==0)
        {
            outp.push_back(high);
            high--;
            k=k/2;
        }
        else
        {
            outp.push_back(low);
            low++;
            k--;
        }
    }

    reverse(outp.begin(),outp.end());

    outp=compress(outp);

    return outp;
}
/*
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() {
	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;
}
*/

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