例题8-17(uva-1609)

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;

const int maxn = 1028;
char input[maxn][maxn];
int n;

int main()
{
	while (cin >> n) {
		for (int i = 1; i <= n; i++) cin >> (input[i] + 1);
		vector<int> win, lose;
		
		//1号对能赢的 和 干不过的
		for (int i = 2; i <= n; i++) {
			if (input[1][i] == '1') win.push_back(i);
			else lose.push_back(i);
		}

		int cnt = n;
		while (cnt > 1) {
			vector<int> winTmp, loseTmp, resTmp;

			//1号打不过的 叫别人收拾他
			for (int i = 0;i<lose.size();i++)
			{
				int loseId = lose[i];
				bool isko = false;
				for (int j = 0;j<win.size();j++)
				{
					int &winId = win[j];
					if (winId > 0 && input[winId][loseId] == '1') {
						//被干掉了
						cout << winId << " " << loseId << endl;
						winTmp.push_back(winId);
						isko = true;
						winId = 0;//当前工具人已配对
						break;
					}
				}
				//没有被干掉 因为他的天敌正在干其他1号的天敌
				if (!isko) resTmp.push_back(loseId);
			}

			//1号选个能打过的打 剩下的自由配对
			bool first = true;
			for (int i = 0; i < win.size(); i++) {
				if (win[i] > 0) {
					if (first) {
						cout << "1 " << win[i] << endl;
						first = false;
					}
					else resTmp.push_back(win[i]);
				}
			}

			//本轮剩下的
			for (int i = 0; i < resTmp.size(); i+=2) {
				int a = resTmp[i];
				int b = resTmp[i + 1];
				int remain = a;
				cout << a << " " << b << endl;
				if (input[b][a] == '1') remain = b;
				if (input[1][remain] == '1') winTmp.push_back(remain);
				else loseTmp.push_back(remain);
			}
			win = winTmp;
			lose = loseTmp;
			cnt >>= 1;
		}
	}
	return 0;
}