ACM ICPC 2017 Warmup Contest 7（CTU Open Contest 2016）

J Colorful Tribune

这是一道很水的签到题。。
做道题时，我感觉现在做题不太对，经常就是直接敲代码，甚至没有理清思路，所以记录下这题。
直接思路：先找到每行列该有的元素，存set，然后找出错误的行列，定位到元素，再次判断。

#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <sstream>
#include <utility>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cctype>
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define IN() freopen("in.txt", "r", stdin)
#define OUT() freopen("out.txt", "w", stdout)
#define LL long long
#define maxn 30
#define maxm 15
#define mod 1000000007
#define INF 1000000007
#define eps 1e-5
#define PI 3.1415926535898
using namespace std;
//-------------------------CHC------------------------------//
int n;
char s[maxn][maxn];
struct Node {
	int idx, cnt;
	bool operator<(Node r) const {
		return cnt > r.cnt;
	}
}a[26];
set<char> vis;
bool ok[26];

bool checkr(int x) {
	CLEAR(ok, 0);
	for (int i = 0; i < n; ++i) {
		ok[s[x][i] - 'A'] = true;
		if (!vis.count(s[x][i])) return false;
	}
	for (auto i : vis)
		if (ok[i - 'A'] == false) return false;
	return true;
}

bool checkc(int x) {
	CLEAR(ok, 0);
	for (int i = 0; i < n; ++i) {
		ok[s[i][x] - 'A'] = true;
		if (!vis.count(s[i][x])) return false;
	}
	for (auto i : vis)
		if (ok[i - 'A'] == false) return false;
	return true;
}

int main() {
	while (~scanf("%d", &n)) {
		vis.clear();
		CLEAR(a, 0);
		CLEAR(s, 0);
		for (int i = 0; i < n; ++i) {
			scanf("%s", s[i]);
			for (int j = 0; j < n; ++j)
				a[s[i][j] - 'A'].cnt++, a[s[i][j] - 'A'].idx = s[i][j] - 'A';
		}
		sort(a, a + 26);
		for (int i = 0; i < n; ++i) vis.insert(a[i].idx + 'A');
		int r, c;
		for (int i = 0; i < n; ++i) 
			if (!checkr(i)) {
				r = i;
				break;
			}
		for (int i = 0; i < n; ++i) {
			if (!checkc(i)) {
				c = i;
				break;
			}
		}
		CLEAR(ok, 0);
		for (int i = 0; i < n; ++i)
			ok[s[r][i] - 'A'] = true;
		for (auto i : vis)
			if (ok[i - 'A'] == false) {
				printf("%d %d %c\n", r + 1, c + 1, i);
				break;
			}
	}
	return 0;
}