제출 #983996

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

perm

#include <time.h>
#include <cstdlib>
#include <stack>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <map>
#include <set>
#include <iterator>
#include <deque>
#include <queue>
#include <sstream>
#include <array>
#include <string>
#include <tuple>
#include <chrono>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <list>
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <bitset>

#include "perm.h"
#define ll long long
using namespace std;
std::vector<int> construct_permutation(long long k){
	vector<int> ans, v;
	deque<vector<int>> d;
	for(ll i = 62; i >= 0; i--){
		if(k >= (1ll << i)){
			k -= (1ll << i);
			v.push_back(i);
		}
	}
	for(int i = 0; i < v[0]; i++) ans.push_back(i);
	v.erase(v.begin());
	reverse(v.begin(), v.end());
	while(!v.empty()){
		int num = v.back();
		vector<int> dop = ans, neww;
		while(num > 0){
			num--;
			neww.push_back(dop.back() + 1);
			dop.pop_back();
		}
		reverse(neww.begin(), neww.end());
		for(int i = 0; i < dop.size(); i++)
			dop[i]++;
		ans = dop;
		ans.push_back(0);
		for(int to : neww)
			ans.push_back(to);
		v.pop_back();
	}
	return ans;
}

// int main(){
// 	ll n;
// 	cin >> n;
// 	vector<int> res = construct_permutation(n);
// 	for(int to : res)
// 		cout << to << " ";
	
// }

컴파일 시 표준 에러 (stderr) 메시지

perm.cpp: In function 'std::vector<int> construct_permutation(long long int)':
perm.cpp:52:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |   for(int i = 0; i < dop.size(); i++)
      |                  ~~^~~~~~~~~~~~

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