题目描述
blablabla
样例
blablabla
算法1
(暴力枚举) $O(n^2)$
blablabla
时间复杂度
参考文献
C++ 代码
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<functional>
#include<sstream>
#include<cstring>
#include<algorithm>
#include<deque>
#include<unordered_map>
#include<unordered_set>
#include<map>
#include<set>
#include<cmath>
using namespace std;
typedef pair<char, char> PCC;
const int N = 3;
char g[3][3];
set<char> res1;
set<PCC> res2;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
for (int i = 0; i < N; i++)
cin >> g[i];
for (int i = 0; i < N; i++)
{
set<char> s1, s2;
for (int j = 0; j < N; j++)
{
s1.insert(g[i][j]);
s2.insert(g[j][i]);
}
if (s1.size() == 1)
{
for (auto it : s1) res1.insert(it);
}
if (s1.size() == 2)
{
PCC x;
for (set<char>::iterator it = s1.begin(); it != s1.end(); it++)
{
if (it == s1.begin()) x.first = (*it);
else x.second = (*it);
}
res2.insert(x);
}
if (s2.size() == 1)
{
for (auto it : s2) res1.insert(it);
}
if (s2.size() == 2)
{
PCC x;
for (set<char>::iterator it = s2.begin(); it != s2.end(); it++)
{
if (it == s2.begin()) x.first = (*it);
else x.second = (*it);
}
res2.insert(x);
}
}
set<char> s1, s2;
for (int i = 0, j = 0; i < N; i++, j++) s1.insert(g[i][j]);
for (int i = 0, j = N - 1; i < N; i++, j--) s2.insert(g[i][j]);
if (s1.size() == 1)
{
for (auto it : s1) res1.insert(it);
}
if (s1.size() == 2)
{
PCC x;
for (set<char>::iterator it = s1.begin(); it != s1.end(); it++)
{
if (it == s1.begin()) x.first = (*it);
else x.second = (*it);
}
res2.insert(x);
}
if (s2.size() == 1)
{
for (auto it : s2) res1.insert(it);
}
if (s2.size() == 2)
{
PCC x;
for (set<char>::iterator it = s2.begin(); it != s2.end(); it++)
{
if (it == s2.begin()) x.first = (*it);
else x.second = (*it);
}
res2.insert(x);
}
cout << res1.size() << endl << res2.size() << endl;
return 0;
}