1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
| #include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#define MAX_N 505
#define INF 987654321
#define ll long long
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vall3 vector<array<ll,3>>
#define all5 array<ll,5>
#define vall5 vector<all5>
#define vll vector<ll>
#define vs vector<string>
#define usll unordered_set<ll>
#define vvs vector<vs>
#define vvll vector<vll>
#define all(a) begin(a), end(a)
using namespace std;
struct Seg {
ll mi, ma, count;
Seg *l, *r;
Seg(vll& A, ll left, ll right): count(0), l(nullptr), r(nullptr) {
mi = A[left], ma = A[right];
if(left == right) return;
ll m = left + ((right - left) >> 1);
l = new Seg(A, left, m);
r = new Seg(A, m + 1, right);
}
ll query(ll from, ll to) {
if(mi > to or ma < from) return 0ll;
if(from <= mi and ma <= to) return count;
return (l ? l->query(from, to) : 0) + (r ? r->query(from, to) : 0);
}
void update(ll n, ll v) {
if(mi <= n and n <= ma) {
count += v;
if(l) l->update(n, v);
if(r) r->update(n, v);
}
}
};
struct Point {
ll x, y;
};
vector<Point> p;
ll n;
ll solve() {
sort(all(p), [](const Point& a, const Point& b) {
if(a.x == b.x) return a.y > b.y;
return a.x < b.x;
});
usll yus;
for(auto po : p) yus.insert(po.y);
vll y(all(yus));
sort(all(y));
Seg* seg = new Seg(y, 0, y.size() - 1);
ll res = 0;
for(auto& po : p) {
res += seg->query(po.y, y.back());
seg->update(po.y, 1);
}
return res;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.setf(ios::fixed);
cout.precision(8);
ll tc;
cin>>tc;
while(tc--) {
p.clear();
cin>>n;
for(ll i = 0, x, y; i < n; i++) {
cin>>x>>y;
p.push_back({x,y});
}
cout<<solve()<<'\n';
}
return 0;
}
|
