题意:给你n个二元组求排列方式中两维都不严格递增的方案数。
思路:考虑容斥,求不严格递增的方案数然后用总的去减。首先将第一位和第二位不严格递增的方案数求出来。这时考虑重复减去的。如果对于已经排好的一维,另外一维出现逆序则没有重复,否则就是相同二元组的排列。
/*keep on going and never give up*/
#include<cstdio>
#include<iostream>
#include<queue>
#include<algorithm>
#include<map>
using namespace std;
typedef pair<int, int> pii;
#define int long long
#define lowbit(x) x&(-x)
#define endl '\n'
#define wk is zqx ta die
const int mod = 998244353;
pii pl[300005];
map<int, int> mp;
map<int, int> mp1;
map<int, int>::iterator it;
map<pii, int>::iterator it1;
map<pii, int> ml;
int fact[300005];
void ini() {
fact[0] = 1;
for (int i = 1; i <= 300000; i++) {
fact[i] = fact[i - 1] * i % mod;
}
}
signed main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
ini();
for (int i = 1; i <= n; i++) {
cin >> pl[i].first >> pl[i].second;
mp[pl[i].first]++;
mp1[pl[i].second]++;
ml[pl[i]]++;
}
int ans = 1;
for (int i = n; i >= 1; i--) {
ans = ans * i % mod;
}
int res = 1;
int res1 = 1;
int res2 = 1;
for (it = mp.begin(); it != mp.end(); it++) {
if (it->second >= 2) {
res *= fact[it->second];
res %= mod;
}
}
for (it = mp1.begin(); it != mp1.end(); it++) {
if (it->second >= 2) {
res1 *= fact[it->second];
res1 %= mod;
}
}
for (it1 = ml.begin(); it1 != ml.end(); it1++) {
if (it1->second >= 2) {
res2 *= fact[it1->second];
res2 %= mod;
}
}
// cout << res << " " << res1 << " " << endl;
sort(pl + 1, pl + n + 1);
for (int i = 1; i < n; i++) {
if (pl[i].second > pl[i + 1].second) {
res2 = 0;
}
}
ans = (ans - res - res1 + res2 + 2 * mod) % mod;
cout << ans << endl;
return 0;
}