제출 #1011931

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1011931		thinknoexit	Fish (IOI08_fish)	C++17	0 / 100	325 ms	14384 KiB

fish

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 500500;
int MOD, n;
pair<int, int> a[N];
int tree[4 * N];
void build(int now = 1, int l = 1, int r = n) {
    tree[now] = 1;
    if (l == r) return;
    int mid = (l + r) / 2;
    build(2 * now, l, mid), build(2 * now + 1, mid + 1, r);
}
void update(int v, int now = 1, int l = 1, int r = n) {
    if (l == r) {
        tree[now] = (tree[now] + 1) % MOD;
        return;
    }
    int mid = (l + r) / 2;
    if (v <= mid) update(v, 2 * now, l, mid);
    else update(v, 2 * now + 1, mid + 1, r);
    tree[now] = tree[2 * now] * tree[2 * now + 1] % MOD;
}
int query(int ql, int qr, int now = 1, int l = 1, int r = n) {
    if (ql > qr) return 1;
    if (l > qr || r < ql) return 1;
    if (ql <= l && r <= qr) return tree[now];
    int mid = (l + r) / 2;
    return query(ql, qr, 2 * now, l, mid) * query(ql, qr, 2 * now + 1, mid + 1, r) % MOD;
}
int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int m;
    cin >> m >> n >> MOD;
    for (int i = 1;i <= m;i++) {
        cin >> a[i].first >> a[i].second;
    }
    sort(a + 1, a + 1 + n);
    build();
    int ans = n % MOD;
    int p = 0;
    for (int i = 1;i <= m;i++) {
        while (p < i && a[p + 1].first * 2 <= a[i].first) {
            p++;
            update(a[p].second);
        }
        if (p != 0) ans = (ans + query(1, a[i].second - 1) * query(a[i].second + 1, n)) % MOD;
    }
    cout << ans;
    return 0;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 4
• Subtask 3: 0 / 4
• Subtask 4: 0 / 4
• Subtask 5: 0 / 4
• Subtask 6: 0 / 5
• Subtask 7: 0 / 6
• Subtask 8: 0 / 6
• Subtask 9: 0 / 6
• Subtask 10: 0 / 6
• Subtask 11: 0 / 7
• Subtask 12: 0 / 7
• Subtask 13: 0 / 7
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5