Submission #742249

#	Time	Username	Problem	Language	Result	Execution time	Memory
742249		fanwen	Permutation (APIO22_perm)	C++17	10 / 100	570 ms	49048 KiB

perm

#include <bits/stdc++.h>

using namespace std;

#define MASK(x) (1LL << (x))
#define BIT(x, i) (((x) >> (i)) & 1)
#define ALL(x) (x).begin(), (x).end()

#define REP(i, n) for (int i = 0, _n = n; i < _n; ++i)
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; --i)
#define FORE(it, s) for (__typeof(s.begin()) it = (s).begin(); it != (s).end(); ++it)


template <class U, class V> bool maximize(U &A, const V &B) { return (A < B) ? (A = B, true) : false; }
template <class U, class V> bool minimize(U &A, const V &B) { return (A > B) ? (A = B, true) : false; }

vector <int> construct_permutation(long long k) {
    // if(k > 90) return {}
    vector <int> ans(k - 1);
    iota(ALL(ans), 0); reverse(ALL(ans));
    return ans;
}

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