象棋: 随便模拟几个,发现如果大于2的都能压缩到2
void solve()
{
cin >> n >> m;
if(n>2) n = 2;
if(m>2) m = 2;
cout << n * m << endl;
}
皇城:没有被打败过的有资质成为冠军
const int N=1e5+100;
int n, m;
bool vis[N];
void solve()
{
cin >> n >> m;
rep(i,1,m)
{
int a, b;
cin >> a >> b;
vis[b] = true;
}
int cnt = 0;
rep(i,1,n)
{
if(vis[i]) cnt++;
}
cout << n - cnt << endl;
}