POJ 2345 异或线性方程组 + 高斯消元

题意

传送门 POJ 2345

题解

设 $technicians$ 为 $x_j$，$valves$ 为 $b_i$，$x_j$ 是否管理 $b_i$ 对应系数为 $a_{i,j}$，则有

$$\{\begin{array}{l}{a}_{0,0}{x}_0\oplus a_{0,1}{x}_1\oplus \cdots \oplus a_{0,n-1}=b_0\\ \dots \\ a_{n-1,0}{x}_0\oplus a_{n-1,1}{x}_1\oplus \cdots \oplus a_{n-1,n-1}=b_{n-1}\end{array}$$

高斯消元时，考虑到 $valves$ 类似开关的性质，联立的方程间也使用异或运算。

#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define min(a, b) (((a) < (b)) ? (a) : (b))
#define max(a, b) (((a) > (b)) ? (a) : (b))
#define abs(x) ((x) < 0 ? -(x) : (x))
#define INF 0x3f3f3f3f3f3f3f3f
#define delta 0.85
using namespace std;

#define maxn 255
int N;
bool charge[maxn][maxn];

typedef vector<int> vec;
typedef vector<vec> mat;
// 列主高斯消元法, 求解 Ax = b
// 当方程组无解或有无穷多解时, 返回一个长度为 0 的数组
vec gauss_jordan(const mat &A, const vec &b)
{
    int n = A.size();
    mat B(n, vec(n + 1));
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            B[i][j] = A[i][j];
        }
    }
    for (int i = 0; i < n; i++)
    {
        B[i][n] = b[i];
    }
    for (int i = 0; i < n; i++)
    {
        int pivot = i;
        for (int j = i; j < n; j++)
        {
            if (B[j][i] == 1)
            {
                pivot = j;
                break;
            }
        }
        swap(B[i], B[pivot]);
        if (B[i][i] == 0)
            return vec();
        for (int j = 0; j < n; j++)
        {
            if (i != j)
            {
                for (int k = i + 1; k <= n; k++)
                    B[j][k] ^= B[j][i] * B[i][k];
            }
        }
    }
    vec x(n);
    for (int i = 0; i < n; i++)
        x[i] = B[i][n];
    return x;
}

void solve()
{
    mat A(N, vec(N, 0));
    vec b(N, 0);
    for (int i = 0; i < N; i++)
    {
        for (int j = 0; j < N; j++)
        {
            if (charge[i][j])
            {
                A[j][i] = 1;
            }
        }
    }
    for (int i = 0; i < N; i++)
    {
        b[i] = 1;
    }
    vec res = gauss_jordan(A, b);
    if (res.size() == 0)
    {
        puts("No solution\n");
        return;
    }
    for (int i = 0; i < N; i++)
    {
        if (res[i])
        {
            printf("%d ", i + 1);
        }
    }
    putchar('\n');
}

int main()
{
    while (~scanf("%d", &N))
    {
        memset(charge, 0, sizeof(charge));
        for (int i = 0; i < N; i++)
        {
            int v;
            while (~scanf("%d", &v) && v != -1)
            {
                charge[i][v - 1] = 1;
            }
        }
        solve();
    }
    return 0;
}