제출 #1196962

#제출 시각아이디문제언어결과실행 시간메모리
1196962ackhava순열 (APIO22_perm)C++20
91.33 / 100
1 ms328 KiB
#include "perm.h" #include <bits/stdc++.h> #define fi first #define se second #define pb push_back #define REP(i,o,n) for(auto i=o;i<n;i++) using namespace std; std::vector<int> construct_permutation(long long k) { vector<int> vec; // k++; REP(i,0,60){ if(k&(1LL<<i))vec.pb(1); vec.pb(0); } while(vec.back()==0)vec.pop_back(); // cerr<<"DATA: "; // for(auto i:vec)cerr<<i<<" "; // cerr<<endl; vec.pop_back(); reverse(vec.begin(),vec.end()); int mn=0,mx=-1; for(auto&i:vec){ if(i==0)i=++mx; else i=--mn; } // cerr<<"DATA: "; // for(auto i:vec)cerr<<i<<" "; // cerr<<endl; for(auto &i:vec)i-=mn; // cerr<<"DATA: "; // for(auto i:vec)cerr<<i<<" "; // cerr<<endl; return vec; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...