#include <bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef unsigned int ui;
#define ii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vii vector<ii>
#define vll vector<ll>
#define vpll vector<pll>
#define matrix vector<vi>
#define matrixLL vector<vll>
#define vs vector<string>
#define vui vector<ui>
#define msi multiset<int>
#define mss multiset<string>
#define si set<int>
#define ss set<string>
#define PB push_back
#define PF push_front
#define PPB pop_back
#define PPF pop_front
#define X first
#define Y second
#define MP make_pair
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const int dxx[] = {-1, 1, 0, 0, 1, 1, -1, -1};
const int dyy[] = {0, 0, -1, 1, -1, 1, -1, 1};
const string abc="abcdefghijklmnopqrstuvwxyz";
const string ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const ld pi = 3.14159265;
int mod = 1e9 + 7;
const int MOD = 1e9 + 7;
const int MAXN = 1e6 + 7;
const int inf = mod;
const ll INF = 1e18;
const ll zero = ll(0);
const int logo = 20;
const int off = 1 << logo;
const int trsz = off << 1;
vii arr;
int gdid[MAXN];
int seg[trsz];
void update(int x, int val){
x += off;
seg[x] = (seg[x] + val + mod) % mod;
x /= 2;
for(; x; x /= 2) seg[x] = ((ll)seg[x * 2] * (ll)seg[x * 2 + 1]) % mod;
}
ll query(int x, int lo, int hi, int a, int b){
if(lo >= b or hi <= a) return 1;
if(lo >= a and hi <= b) return seg[x];
int mid = (lo + hi) / 2;
return ((ll)query(x * 2, lo, mid, a, b) * (ll)query(x * 2 + 1, mid, hi, a, b)) % mod;
}
vi c;
vpll boje;
int pos[MAXN];
void solve(){
fill(seg, seg + trsz, 1);
fill(gdid, gdid + MAXN - 1, -1);
int n, k, m;
cin >> n >> k >> mod;
arr.resize(n);
REP(i, n) cin >> arr[i].X >> arr[i].Y;
sort(all(arr));
for(int i = n - 1; i >= 0; i--){
if(gdid[arr[i].Y] == -1) gdid[arr[i].Y] = i, c.PB(arr[i].Y), boje.PB({arr[i].X, i});
}
reverse(all(c));
for(int i=0; i<c.size(); i++) pos[c[i]] = i;
for(int i=0; i<n; i++) update(pos[arr[i].Y], 1);
sort(all(boje));
boje.PB({INF, inf});
//cout << "\nSORT\n";
//for(auto &x : arr) cout << x.X << " " << x.Y << "\n";
int ans = 0;
int R = n - 1;
for(int i = n - 1; i >= 0; i--){
while(R >= 0 and arr[R].X * 2 > arr[i].X) update(pos[arr[R].Y], -1), R--;
if(gdid[arr[i].Y] != i) continue;
//cout << i << " " << R << " " << arr[i].X << " " << arr[i].Y << " " << ans << " -> ";
ans = (ans + query(1, 0, off, 0, pos[arr[i].Y] + 1)) % mod;
//cout << ans << " -> ";
int poz = lower_bound(all(boje), MP((ll)arr[i].X * 2, (ll)-inf)) - boje.begin();
if(i != n - 1 and pos[arr[i].Y] + 1 < poz){
int val = ((ll)query(1, 0, off, 0, pos[arr[i].Y]) * (ll)(((ll)query(1, 0, off, pos[arr[i].Y] + 1, poz) - 1 + mod) % mod)) % mod;
ans = (ans + val) % mod;
}
//cout << ans << "\n";
}
cout << ans << "\n";
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t=1;
//cin >> t;
while(t--)solve();
return 0;
}
Compilation message
fish.cpp: In function 'void solve()':
fish.cpp:91:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
91 | for(int i=0; i<c.size(); i++) pos[c[i]] = i;
| ~^~~~~~~~~
fish.cpp:81:12: warning: unused variable 'm' [-Wunused-variable]
81 | int n, k, m;
| ^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
12372 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
5 ms |
12372 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
6 ms |
12372 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
12376 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
12352 KB |
Output is correct |
2 |
Incorrect |
6 ms |
12372 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
12372 KB |
Output is correct |
2 |
Incorrect |
275 ms |
16320 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
6 ms |
12372 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
7 ms |
12372 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
103 ms |
14008 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
12468 KB |
Output is correct |
2 |
Incorrect |
9 ms |
12500 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
158 ms |
14804 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
222 ms |
16368 KB |
Output is correct |
2 |
Incorrect |
294 ms |
17752 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
151 ms |
14936 KB |
Output is correct |
2 |
Incorrect |
263 ms |
16612 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
266 ms |
16460 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
282 ms |
17132 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
251 ms |
16980 KB |
Output is correct |
2 |
Correct |
368 ms |
19676 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
381 ms |
21588 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
372 ms |
21588 KB |
Output is correct |
2 |
Incorrect |
373 ms |
20332 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
485 ms |
21976 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |