programming-challenges Bicoloring (110901) 题解

#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <assert.h>
#include <algorithm>
#include <math.h>
#include <ctime>
#include <functional>
#include <string.h>
#include <stdio.h>
#include <numeric>
#include <float.h>

using namespace std;

const int MX = 210; 

int G[MX][MX]; 
int color[MX]; 

bool dfs(int currentNode, int currentColor, int n) {
	color[currentNode] = currentColor; 
	for (int i = 0; i < n; i++) {
		if (G[currentNode][i] == 1) {
			if (color[i] == 0) {
				if (!dfs(i, currentColor * -1, n)) {
					return false; 
				}
			}
			else if (color[i] == currentColor * -1) {

			}
			else {
				return false; 
			}
		}
	}
	return true;
}

int main() {
	int n = 0; 

	while (cin >> n) {
		if (n == 0) break;
		memset(G, 0, sizeof(G)); 
		memset(color, 0, sizeof(color));

		int l = 0; cin >> l; 
		for (int i = 0; i < l; i++) {
			int node1, node2; cin >> node1 >> node2; 
			G[node1][node2] = G[node2][node1] = 1;
		}

		bool ok = true; 
		for (int i = 0; i < n; i++) {
			if (color[i] == 0) {
				if (!dfs(i, 1, n)) {
					ok = false;
					break;
				}
				
			}
		}

		if (ok) {
			cout << "BICOLORABLE." << endl;
		}
		else {
			cout << "NOT BICOLORABLE." << endl;
		}
	}

	return 0; 
}