oj.uz

Submission #983155

# Submission time Handle Problem Language Result Execution time Memory
983155 2024-05-15T08:47:28 Z Kenjikrab Permutation (APIO22_perm) C++17
91.3333 / 100
 3 ms 604 KB 
#include "perm.h"
#include<bits/stdc++.h>
using namespace std;
deque<int> find_p(long long k,int shift)
{
	deque<int> ret;
	if(k==2)
	{
		ret.push_back(shift);
		return ret;
	}
	if(k==3)
	{
		ret.push_back(shift+1);
		ret.push_back(shift);
		return ret;
	}
	if(k%2==0)
	{
		ret=find_p(k/2,shift);
		ret.push_back(shift+ret.size());
		return ret;
	}
	else
	{
		ret=find_p(k-1,shift);
		ret.push_front(shift+ret.size());
		return ret;
	}
}
vector<int> construct_permutation(long long k)
{
	/*
	vector<int> a;
	vector<int> ret;
	while(k>0)
	{
		if(k%2==1)a.push_back(1);
		else a.push_back(0);
		k/=2;
	}
	int n=a.size();
	int idx=0;
	for(idx=0;idx<n-1;idx++)ret.push_back(idx);
	for(int i=n-2;i>=0;i--)
	{
		if(a[i]==0)continue;
		ret.insert(ret.begin()+i,idx++);
	}
	*/
	vector<int> ret;
	deque<int> temp=find_p(k,0);
	while(!temp.empty()){ret.push_back(temp.front());temp.pop_front();}
	return ret;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #2
81.333333333 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 440 KB Output is correct
5 Partially correct 2 ms 432 KB Partially correct
6 Correct 2 ms 436 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Partially correct 2 ms 604 KB Partially correct
9 Correct 2 ms 348 KB Output is correct
10 Partially correct 2 ms 348 KB Partially correct
11 Partially correct 2 ms 604 KB Partially correct
12 Partially correct 2 ms 348 KB Partially correct
13 Partially correct 3 ms 604 KB Partially correct