#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
// 定义点的结构体
struct Point {
double x;
double y;
};
// 计算两点之间的距离
double distance
(const Point& p
1, const Point& p2
) {
return std::sqrt
((p
1.x
- p2.x
) *
(p
1.x
- p2.x
) + (p
1.y
- p2.y
) *
(p
1.y
- p2.y
));
}
// 计算小狗能打到小猫的所有组合
std::vector<std::vector<int>> calculateCombinations
(const std::vector<Point>& dogs, const std::vector<double>& dogRanges, const std::vector<Point>& cats
) {
std::vector<std::vector<int>> combinations
(dogs.size
());
for
(size_t i = 0; i < dogs.size
();
++i
) {
for
(size_t j = 0; j < cats.size
();
++j
) {
if
(distance
(dogs[i], cats[j]
) <= dogRanges[i]
) {
combinations[i].push_back
(j
);
}
}
}
return combinations;
}
// 生成所有可能的小狗攻击小猫的组合
void generateAllCombinations
(const std::vector<std::vector<int>>& dogCombinations, int dogIndex, std::vector<int>& currentCombination, std::vector<std::vector<int>>& allCombinations
) {
if
(dogIndex == dogCombinations.size
()) {
allCombinations.push_back
(currentCombination
);
return;
}
if
(dogCombinations[dogIndex].empty
()) {
currentCombination.push_back
(-1);
generateAllCombinations
(dogCombinations, dogIndex
+ 1, currentCombination, allCombinations
);
currentCombination.pop_back
();
} else {
for
(int catIndex : dogCombinations[dogIndex]
) {
currentCombination.push_back
(catIndex
);
generateAllCombinations
(dogCombinations, dogIndex
+ 1, currentCombination, allCombinations
);
currentCombination.pop_back
();
}
}
}
// 计算组合的价值
double calculateValue
(const std::vector<int>& combination, const std::vector<double>& catValues
) {
std::vector<bool> catUsed
(catValues.size
(), false
);
double totalValue = 0;
for
(int catIndex : combination
) {
if
(catIndex !=
-1 && !catUsed[catIndex]
) {
totalValue
+= catValues[catIndex];
catUsed[catIndex] = true;
}
}
return totalValue;
}
// 找到价值最大的所有组合
std::pair<int, std::vector<std::vector<int>>> findMaxValueCombinations
(const std::vector<std::vector<int>>& allCombinations, const std::vector<double>& catValues
) {
double maxValue = 0;
std::vector<std::vector<int>> maxCombinations;
for
(const auto& combination : allCombinations
) {
double value = calculateValue
(combination, catValues
);
if
(value > maxValue
) {
maxValue = value;
maxCombinations.clear
();
maxCombinations.push_back
(combination
);
} else if
(value == maxValue
) {
maxCombinations.push_back
(combination
);
}
}
return {maxValue, maxCombinations};
}
int main
() {
// 初始化 20 只小狗的坐标
std::vector<Point> dogs
(20
);
for
(int i = 0; i < 20;
++i
) {
dogs[i] = {i *
1.0, i *
1.0};
}
// 初始化 20 只小狗能跑的最远距离
std::vector<double> dogRanges
(20
);
for
(int i = 0; i < 20;
++i
) {
dogRanges[i] = 5.0;
}
// 初始化 30 只小猫的坐标
std::vector<Point> cats
(30
);
for
(int i = 0; i < 30;
++i
) {
cats[i] = {i * 0.5, i * 0.5};
}
// 初始化 30 只小猫的价值
std::vector<double> catValues
(30
);
for
(int i = 0; i < 30;
++i
) {
catValues[i] = i
+ 1;
}
// 计算小狗能打到小猫的所有组合
std::vector<std::vector<int>> dogCombinations = calculateCombinations
(dogs, dogRanges, cats
);
// 生成所有可能的小狗攻击小猫的组合
std::vector<std::vector<int>> allCombinations;
std::vector<int> currentCombination;
generateAllCombinations
(dogCombinations, 0, currentCombination, allCombinations
);
// 找到价值最大的所有组合
auto [maxValue, maxCombinations] = findMaxValueCombinations
(allCombinations, catValues
);
// 输出小狗能打到小猫的所有组合
std::cout << "小狗能打到小猫的所有组合:" << std::endl;
for
(const auto& combination : dogCombinations
) {
for
(int catIndex : combination
) {
std::cout << catIndex << " ";
}
std::cout << std::endl;
}
// 输出最大价值
std::cout << "最大价值: " << maxValue << std::endl;
// 输出价值最大的所有组合
std::cout << "价值最大的所有组合:" << std::endl;
for
(const auto& combination : maxCombinations
) {
for
(int catIndex : combination
) {
std::cout << catIndex << " ";
}
std::cout << std::endl;
}
return 0;
}
运行存在bad_alloc问题，如何优化代码
位运算求平均值
本文介绍了一种使用位运算求两个整数平均值的方法。通过分析位运算符&和^的特点，结合二进制位的三种可能组合，推导出位运算求平均值的通用公式，最终简化为直接计算两数之和除以二。
扫一扫
546
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
