- 话不多说,直接上代码,思路读一读代码就明白了,很简单。
- 需要注意的是,直接执行下段代码的话,只能测试本地的样例文本,所以在上传OJ前需要修改main函数和构造函数。
#include<iostream>
#include<fstream>
using namespace std;
class matrix {
int m[1000][20];
int judgeMap[20][20] = { 0 };
int temp[20] = { 0 };
int bestAns[20] = { 0 };
int bestSum = 0;
int sumA = 0;
int sumB = 0;
int diff = 0;
public:
matrix(ifstream &afile) {
for (int i = 0; i < 1000; i++) {
for (int j = 0; j < 20; j++) {
afile >> m[i][j];
}
}
}
void getAns() {
for (int i = 0; i < 20; i++) {
if (bestAns[i] == 1) cout << i << ' ';
}
cout << endl;
for (int i = 0; i < 20; i++) {
if (bestAns[i] == 2) cout << i << ' ';
}
cout << endl;
}
void buildJudgeMap() {
for (int i = 0; i < 20; i++) {
for (int j = i + 1; j < 20; j++) {
for (int k = 0; k < 1000; k++) {
if (m[k][i] == 1 && m[k][j] == 1) {
judgeMap[i][j] = 1;
judgeMap[j][i] = 1;
break;
}
}
}
}
}
int ifMutex(int j, int tag) {
if (tag == 1) {
for (int i = 0; i < 20; i++) {
if (temp[i] == 2) {
if (judgeMap[i][j] == 1) return 0;
}
}
return 1;
}
else {
for (int i = 0; i < 20; i++) {
if (temp[i] == 1) {
if (judgeMap[i][j] == 1) return 0;
}
}
return 1;
}
}
int ifOkayAndBest() {
if (sumA != 0 && sumB != 0 && sumA > sumB && sumA + sumB >= bestSum) {
if (sumA + sumB == bestSum) {
if (abs(sumA - sumB) < diff) return 1;
else return 0;
}
return 1;
}
return 0;
}
void copyAns() {
for (int j = 0; j < 20; j++) {
bestAns[j] = temp[j];
}
bestSum = sumA + sumB;
diff = sumA - sumB;
}
void solutionInDFS(int j) {
if (j == 20) {
if (ifOkayAndBest()) {
copyAns();
}
return;
}
else {
if (ifMutex(j, 1)) {
sumA++;
temp[j] = 1;
solutionInDFS(j + 1);
sumA--;
temp[j] = 0;
}
if (ifMutex(j, 2)) {
sumB++;
temp[j] = 2;
solutionInDFS(j + 1);
sumB--;
temp[j] = 0;
}
if (sumA + sumB + 19 - j >= bestSum) {
solutionInDFS(j + 1);
}
else return;
}
}
};
int main() {
ifstream afile;
afile.open("D:/exp4_data.txt", ios::in);
matrix m(afile);
m.buildJudgeMap();
m.solutionInDFS(0);
m.getAns();
return 0;
}