fz-mirrors/MaaAssistantArknights
0
0
Fork 0
mirror of https://github.com/MaaAssistantArknights/MaaAssistantArknights.git synced 2026-07-18 02:10:21 +08:00
Code Issues Packages Projects Releases Wiki Activity

优化公招策略

Browse Source
This commit is contained in:
MistEO
2021-08-03 00:48:49 +08:00
parent ae00ff312e
commit 08da9fbdb5
2 changed files with 24 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
MeoAssistance/include/AsstDef.h
View File

@@ -190,6 +190,8 @@ namespace asst {
std::vector<OperInfo> opers;
int max_level = 0;
int min_level = 0;
bool has_level_1 = false; // 是否有一星干员
double avg_level = 0;
};
constexpr double DoubleDiff = 1e-12;
}

35
MeoAssistance/src/Assistance.cpp
View File

@@ -198,8 +198,8 @@ bool asst::Assistance::find_text_and_click(const std::string& text, bool block)
return m_pCtrl->click(result.value());
}
std::optional<std::vector<std::pair<std::vector<std::string>, OperCombs>>>
asst::Assistance::open_recruit(const std::vector<int>& required_level, bool set_time)
std::optional<std::vector<std::pair<std::vector<std::string>, OperCombs>>>
asst::Assistance::open_recruit(const std::vector<int>& required_level, bool set_time)
{
DebugTraceFunction;
@@ -287,22 +287,25 @@ std::optional<std::vector<std::pair<std::vector<std::string>, OperCombs>>>
OperCombs& oper_combs = result_map[comb];
oper_combs.opers.emplace_back(cur_oper);
static const std::string SupportMachine = GbkToUtf8("支援机械");
if (cur_oper.level == 1
&& std::find(comb.cbegin(), comb.cend(), SupportMachine) != comb.cend()) {
DebugTraceInfo("Has Level 1");
if (cur_oper.level == 1 || cur_oper.level == 2) {
if (oper_combs.min_level == 0) oper_combs.min_level = cur_oper.level;
if (oper_combs.max_level == 0) oper_combs.max_level = cur_oper.level;
// 一星、二星干员不计入最低等级，因为拉满9小时之后不可能出1、2星
continue;
}
// 一星小车不计入最低等级
if (cur_oper.level != 1 && (
oper_combs.min_level == 0 || oper_combs.min_level > cur_oper.level)) {
if (oper_combs.min_level == 0 || oper_combs.min_level > cur_oper.level) {
oper_combs.min_level = cur_oper.level;
}
if (oper_combs.max_level == 0 || oper_combs.max_level < cur_oper.level) {
oper_combs.max_level = cur_oper.level;
}
oper_combs.avg_level += cur_oper.level;
}
}
if (result_map.find(comb) != result_map.cend()) {
OperCombs& oper_combs = result_map[comb];
oper_combs.avg_level /= oper_combs.opers.size();
}
}
// map没法按值排序，转个vector再排
@@ -310,17 +313,21 @@ std::optional<std::vector<std::pair<std::vector<std::string>, OperCombs>>>
for (auto&& pair : result_map) {
result_vector.emplace_back(std::move(pair));
}
std::sort(result_vector.begin(), result_vector.end(), []( const auto& lhs, const auto& rhs)
std::sort(result_vector.begin(), result_vector.end(), [](const auto& lhs, const auto& rhs)
->bool {
// 1、最小等级小的，排最后
// 2、最小等级相同，最大等级小的，排后面
// 3、1 2都相同，标签多的，排后面
// 最小等级大的，排前面
if (lhs.second.min_level != rhs.second.min_level) {
return lhs.second.min_level > rhs.second.min_level;
}
// 最大等级大的，排前面
else if (lhs.second.max_level != rhs.second.max_level) {
return lhs.second.max_level > rhs.second.max_level;
}
// 平均等级高的，排前面
else if (std::fabs(lhs.second.avg_level - rhs.second.avg_level) < DoubleDiff) {
return lhs.second.avg_level > rhs.second.avg_level;
}
// Tag数量少的，排前面
else {
return lhs.first.size() < rhs.first.size();
}