挑战用 UU 的码风写一篇代码
本文运用了 UU 最新发布的UU命名空间完成，代码内容为今日模拟赛 T3。
代码示例
#include <bits/stdc++.h>
namespace User_Unauthorized {
/**
* @brief This is a header file for competitive programming.
* @author User-Unauthorized
* @version 1.0.0
* @date 2023-10-5
*/
typedef long long valueType;
typedef std::vector<valueType> ValueVector;
typedef std::vector<ValueVector> ValueMatrix;
typedef std::vector<ValueMatrix> ValueCube;
typedef std::map<valueType, valueType> ValueMap;
typedef std::set<valueType> ValueSet;
typedef std::pair<valueType, valueType> ValuePair;
typedef std::vector<ValuePair> PairVector;
typedef std::vector<PairVector> PairMatrix;
typedef std::vector<PairMatrix> PairCube;
typedef std::map<ValuePair, valueType> PairMap;
typedef std::set<ValuePair> PairSet;
typedef std::vector<bool> bitset;
typedef std::vector<bitset> BitMatrix;
typedef std::vector<BitMatrix> BitCube;
typedef long double realType;
typedef std::vector<realType> RealVector;
typedef std::vector<RealVector> RealMatrix;
typedef std::vector<RealMatrix> RealCube;
typedef std::pair<realType, realType> RealPair;
typedef std::vector<RealPair> RealPairVector;
typedef std::vector<RealPairVector> RealPairMatrix;
typedef std::vector<RealPairMatrix> RealPairCube;
typedef std::mt19937 Engine;
typedef std::uniform_int_distribution<valueType> Distribution;
typedef unsigned long long hashType;
typedef std::vector<hashType> HashVector;
typedef std::vector<HashVector> HashMatrix;
typedef std::vector<HashMatrix> HashCube;
typedef std::map<hashType, valueType> HashMap;
typedef std::set<hashType> HashSet;
namespace ModOper {
/**
* @brief This is a set of functions for fast processing of operations under the meaning of taking modulus in competitive programming.
* @author User-Unauthorized
* @version 1.0.0
* @warning Please note that the parameter types of these functions must be integer types, otherwise a compilation error will occur.
* */
valueType MOD; // mod value
/**
* @brief This is a macro for whether to ensure that the parameters passed in are integers in the range [0, MOD), if it cannot be guaranteed, the value of this macro should be true, otherwise unexpected results may occur.
*/
#define ModOperSafeModOption false
/**
* @brief This function can increase the value of a by b.
* @tparam T1
* @tparam T2
* @tparam T3
* @param a
* @param b
* @param mod
*/
template <typename T1, typename T2, typename T3 = valueType>
void Inc(T1 &a, T2 b, const T3 &mod = MOD) {
#if ModOperSafeModOption
a %= mod;
b %= mod;
if (a < 0)
a += mod;
if (b < 0)
b += mod;
#endif // ModOperSafeModOption
a = a + b;
if (a >= mod)
a -= mod;
}
/**
* @brief This function can decrease the value of a by b.
* @tparam T1
* @tparam T2
* @tparam T3
* @param a
* @param b
* @param mod
*/
template <typename T1, typename T2, typename T3 = valueType>
void Dec(T1 &a, T2 b, const T3 &mod = MOD) {
#if ModOperSafeModOption
a %= mod;
b %= mod;
if (a < 0)
a += mod;
if (b < 0)
b += mod;
#endif // ModOperSafeModOption
a = a - b;
if (a < 0)
a += mod;
}
/**
* @brief This function can calculate the sum of a and b.
* @tparam T1
* @tparam T2
* @tparam T3
* @param a
* @param b
* @param mod
* @return T1
*/
template <typename T1, typename T2, typename T3 = valueType>
T1 sum(T1 a, T2 b, const T3 &mod = MOD) {
#if ModOperSafeModOption
a %= mod;
b %= mod;
if (a < 0)
a += mod;
if (b < 0)
b += mod;
#endif // ModOperSafeModOption
return a + b >= mod ? a + b - mod : a + b;
}
/**
* @brief This function can calculate the difference of a and b.
* @tparam T1
* @tparam T2
* @tparam T3
* @param a
* @param b
* @param mod
* @return T1
*/
template <typename T1, typename T2, typename T3 = valueType>
T1 sub(T1 a, T2 b, const T3 &mod = MOD) {
#if ModOperSafeModOption
a %= mod;
b %= mod;
if (a < 0)
a += mod;
if (b < 0)
b += mod;
#endif // ModOperSafeModOption
return a - b < 0 ? a - b + mod : a - b;
}
/**
* @brief This function can calculate the product of a and b.
* @tparam T1
* @tparam T2
* @tparam T3
* @param a
* @param b
* @param mod
* @return T1
*/
template <typename T1, typename T2, typename T3 = valueType>
T1 mul(T1 a, T2 b, const T3 &mod = MOD) {
#if ModOperSafeModOption
a %= mod;
b %= mod;
if (a < 0)
a += mod;
if (b < 0)
b += mod;
#endif // ModOperSafeModOption
return (long long)a * b % mod;
}
/**
* @brief This function can make the value of a multiply b.
* @tparam T1
* @tparam T2
* @tparam T3
* @param a
* @param b
* @param mod
* @return T1
*/
template <typename T1, typename T2, typename T3 = valueType>
void Mul(T1 &a, T2 b, const T3 &mod = MOD) {
#if ModOperSafeModOption
a %= mod;
b %= mod;
if (a < 0)
a += mod;
if (b < 0)
b += mod;
#endif // ModOperSafeModOption
a = (long long)a * b % mod;
}
/**
* @brief This function can calculate the b-th power of a, and the time complexity is log b.
* @tparam T1
* @tparam T2
* @tparam T3
* @param a
* @param b
* @param mod
* @return T1
*/
template <typename T1, typename T2, typename T3 = valueType>
T1 pow(T1 a, T2 b, const T3 &mod = MOD) {
#if ModOperSafeModOption
a %= mod;
b %= mod - 1;
if (a < 0)
a += mod;
if (b < 0)
b += mod - 1;
#endif // ModOperSafeModOption
T1 result = 1;
while (b > 0) {
if (b & 1)
Mul(result, a, mod);
Mul(a, a, mod);
b = b >> 1;
}
return result;
}
} // namespace ModOper
} // namespace User_Unauthorized
using namespace User_Unauthorized;
int main(int argv, char *argc[]) {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
valueType N, M, K;
std::cin >> N >> M >> K;
ValueVector ans(N + 1, 0), B(N + 1, 0);
valueType tot(0);
for (valueType i = 1; i <= N; i++) {
valueType x;
std::cin >> x;
if (B[tot] > x)
ans[i + M - 1] = x;
else
B[++tot] = x;
}
valueType position(std::max(0ll, tot - 20)), len = tot - position;
ValueVector Ans(N + 1, 0), num(N + 1, 0);
for (valueType i = 1; i <= position; i++)
Ans[i] = i;
for (valueType i = 1; i <= len; i++)
num[i] = std::min(i + position + M - 1, tot) - position;
for (valueType i = 1; i <= len; i++) {
for (valueType j = 1; j <= len; j++)
num[j]--;
for (valueType j = 1; j <= len; j++) {
if (num[j] < 0)
continue;
valueType sum = 0, now = 1;
for (valueType k = 1; k <= len; k++) {
if (num[k] < 0 || k == j)
continue;
now *= num[k] - sum;
sum++;
if (now >= K)
break;
}
if (now >= K) {
Ans[i + position] = j + position;
num[j] = -1;
break;
}
K -= now;
}
}
tot = 0;
for (valueType i = 1; i <= N; i++) {
if (ans[i])
std::cout << ans[i] << " ";
else
std::cout << B[Ans[++tot]] << " ";
}
return 0;
}
