#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <fstream>
using namespace std;
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define x first
#define y second
#define Time (double)clock()/CLOCKS_PER_SEC
#define debug(x) std::cerr << #x << ": " << x << '\n';
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORN(i, n) for (int i = 1; i <= n; ++i)
#define pb push_back
#define trav(a, x) for (auto& a : x)
using vi = vector<int>;
template <typename T>
std::istream& operator >>(std::istream& input, std::vector<T>& data)
{
for (T& x : data)
input >> x;
return input;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const pair <T, T> & data)
{
output << "(" << data.x << "," << data.y << ")";
return output;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const std::vector<T>& data)
{
for (const T& x : data)
output << x << " ";
return output;
}
ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
ll math_mod(ll a, ll b) { return a - b * div_down(a, b); }
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>;
tcT> void re(V<T>& x) {
trav(a, x)
cin >> a;
}
tcT> bool ckmin(T& a, const T& b) {
return b < a ? a = b, 1 : 0;
} // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
return a < b ? a = b, 1 : 0;
}
ll gcd(ll a, ll b) {
while (b) {
tie(a, b) = mp(b, a % b);
}
return a;
}
const int N = 5e5+7;
int n, k, MOD;
int tree[N << 2];
void setpoint(int v, int l, int r, int i, int x) {
if (l == r) {
tree[v] = x;
return;
}
int m = (l + r) / 2;
if (i <= m) {
setpoint(v * 2 + 1, l, m, i, x);
}
else {
setpoint(v * 2 + 2, m + 1, r, i, x);
}
tree[v] = tree[v * 2 + 1] * tree[v * 2 + 2] % MOD;
}
vi who[N];
int f[N];
void add(int i, int x) {
assert(x > 0);
for (; i < N; i |= i + 1) {
f[i] *= x;
f[i] %= MOD;
}
}
int get(int i) {
int ans = 1;
for (; i >= 0; i &= i + 1, --i) {
ans *= f[i];
ans %= MOD;
}
return ans;
}
int fp(int a, int p) {
int ans = 1, cur = a;
FOR (i, 20) {
if ((p >> i) & 1) {
ans = ans * cur % MOD;
}
cur = cur * cur % MOD;
}
return ans;
}
int pos[N];
int inv[N];
void setpoint(int c, int x) {
x %= MOD;
setpoint(0, 0, k - 1, pos[c], x);
debug(pos[c]);
debug(x);
if (x > 1) {
add(pos[c], inv[x - 1]);
}
add(pos[c], x);
}
signed main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#else
#define endl '\n'
ios_base::sync_with_stdio(0); cin.tie(0);
#endif
cin >> n >> k >> MOD;
FOR (i, (N << 2)) {
tree[i] = 1;
}
FOR (i, N) {
inv[i] = fp(i, MOD - 2);
}
const int INF = 2e9;
vi r(k + 1, -INF);
V <vi> sc;
FOR (i, n) {
int sz, c;
cin >> sz >> c;
sc.app({2 * sz, 0, c});
ckmax(r[c], sz);
who[c].app(sz);
}
FORN (i, k) {
sc.app({r[i], 1, i});
}
sort(all(sc));
V <ii> ord;
vi rs;
FORN (c, k) {
ord.app(mp(r[c], c));
rs.app(r[c]);
}
sort(all(ord)); sort(all(rs));
FOR (i, ord.size()) {
pos[ord[i].y] = i;
}
vi used(k + 1), cur(k + 1);
int ans = 0;
FOR (i, N) {
f[i] = 1;
}
FORN (c, k) {
sort(all(who[c]));
}
trav (e, sc) {
int col = e[2];
if (e[1] == 0) {
cur[col]++;
if (used[col]) {
setpoint(col, cur[col] + 1);
}
}
else {
int eat = 0;
while (2 * who[col][eat] <= r[col]) {
eat++;
}
int alive = who[col][eat];
used[col] = 1;
setpoint(col, cur[col] + 1);
ans += tree[0];
ans %= MOD;
int right = lower_bound(all(rs), alive * 2) - rs.begin() - 1;
ll L = get(pos[col] - 1);
ll R = get(right);
debug(right);
debug(R);
R *= inv[L]; R %= MOD;
R *= inv[cur[col] + 1]; R %= MOD;
/*
debug(col);
debug(L);
debug(R);
*/
ans += L * (R + MOD - 1);
ans %= MOD;
}
}
cout << ans << endl;
}
Compilation message
fish.cpp: In function 'int main()':
fish.cpp:32:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
32 | #define FOR(i, n) for (int i = 0; i < n; ++i)
......
183 | FOR (i, ord.size()) {
| ~~~~~~~~~~~~~
fish.cpp:183:5: note: in expansion of macro 'FOR'
183 | FOR (i, ord.size()) {
| ^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
124 ms |
23748 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
125 ms |
23708 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
118 ms |
23744 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
129 ms |
23800 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
132 ms |
23748 KB |
Output is correct |
| 2 |
Incorrect |
131 ms |
23876 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
120 ms |
23812 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
131 ms |
23876 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
149 ms |
24016 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1736 ms |
38144 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
174 ms |
24260 KB |
Output is correct |
| 2 |
Runtime error |
108 ms |
49016 KB |
Execution killed with signal 6 |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
2156 ms |
65536 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1154 ms |
55152 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
3067 ms |
46776 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
3065 ms |
56164 KB |
Time limit exceeded |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
3057 ms |
59948 KB |
Time limit exceeded |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
3040 ms |
56052 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
370 ms |
65540 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
338 ms |
65540 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
386 ms |
65540 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
