oj.uz

답안 #609427

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
609427 2022-07-27T15:29:21 Z duality 순열 (APIO22_perm) C++17
100 / 100
 2 ms 396 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#include "perm.h"

vector<int> construct_permutation(long long int k) {
    if (k == 1) return {};
    else if (k == 2) return {0};
    else if (k == 3) return {1,0};
    else if (!(k & 1)) {
        vi ans = construct_permutation(k/2);
        ans.pb(ans.size());
        return ans;
    }
    else if ((k % 4) == 1) {
        vi ans = construct_permutation((k-1)/4);
        ans.pb(ans.size()),ans.pb(ans.size());
        for (int &p: ans) p++;
        ans.pb(0);
        return ans;
    }
    else {
        vi ans = construct_permutation((k-3)/4);
        if ((ans.size() >= 2) && (find(ans.begin(),ans.end(),1) < find(ans.begin(),ans.end(),0))) {
            ans.pb(ans.size()),ans.pb(ans.size());
            for (int &p: ans) {
                if (p >= 2) p++;
            }
            ans.pb(2);
            return ans;
        }
        else {
            ans.pb(ans.size());
            for (int &p: ans) p++;
            ans.pb(0),ans.pb(ans.size());
            for (int &p: ans) p++;
            ans.pb(0);
            return ans;
        }
    }
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct

Subtask #2
90.0 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 396 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct