oj.uz

Submission #987487

# Submission time Handle Problem Language Result Execution time Memory
987487 2024-05-22T20:30:42 Z Essa2006 Fish (IOI08_fish) C++17
100 / 100
 475 ms 49812 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define FF first
#define SS second
#define all(a) a.begin(), a.end()

const int N = 1 << 19;
int n, o, mod;

vector<int> S(2 * N, 1);

void update(int id, int c) {
    id += N;
    S[id] += c;
    while (id /= 2) {
        S[id] = (ll) S[id * 2] * S[id * 2 + 1] % mod;
    }
}

int get(int id, int u, int v, int l, int r) {
    if (l > v || r < u) {
        return 1;
    }

    if (l >= u && r <= v) {
        return S[id];
    }

    int md = (l + r) / 2;
    return (ll) get(id * 2, u, v, l, md) * get(id * 2 + 1, u, v, md + 1, r) % mod;
}

int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);

    cin >> n >> o >> mod;

    vector<array<int, 2>> A(n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < 2; j++) {
            cin >> A[i][j];
        }
    }


    sort(all(A));

    int mp[n + 1];
    vector<bool> Done(n + 1);
    int cnt = 0;
    for (int i = n - 1; i >= 0; i--) {
        if (!Done[A[i][1]]) {
            Done[A[i][1]] = 1;
            mp[A[i][1]] = o - cnt++;
        }
        A[i][1] = mp[A[i][1]];
    }

    vector<int> Cut(n + 1, -1);
    int j = -1;
    vector<vector<int>> Ind (n + 1);
    for (int i = 0; i < n; i++) {
        Ind[A[i][1]].push_back(i);
        while (j + 1 < i && 2 * A[j + 1][0] <= A[i][0]) {
            j++;
        }
        Cut[A[i][1]] = j;
    }

    int r = -1;
    while (r + 1 < n && ((2 * A[r + 1][0]) <= A.back()[0])) {
        r++;
        update(A[r][1], 1);
    }


    Done.clear(), Done.resize(n + 1);
    int ans = 0;
    vector<int> Imp;
    Imp.reserve(o);
    for (int i = n - 1; i >= 0; i--) {
        int k = A[i][1];
        if (!Done[k]) {
            Done[k] = 1
                    ;
            while (r >= 0 && ((2 * A[r][0]) > A[i][0])) {
                update(A[r][1], -1);
                r--;
            }

            int c = S[k + N];
            update(k, -(c - 1));
            for (int f = c; f > 0; f--) {
                int l = 0, r = Imp.size() - 1, last_zero = n;
                while (l <= r) {
                    int md = (l + r) / 2;
                    int num = upper_bound(all(Ind[k]), Cut[Imp[md]]) - Ind[k].begin();
                    if (num > f - 1) {
                        last_zero = Imp[md], l = md + 1;
                    }
                    else {
                        r = md - 1;
                    }
                }


                ans = (ans + get(1, 0, last_zero - 1, 0, N - 1)) % mod;

            }
            update(k, (c - 1));
            Imp.push_back(k);
        }
    }

    cout << ans;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4444 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 4 ms 4508 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4584 KB Output is correct
2 Correct 200 ms 29848 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4444 KB Output is correct

Subtask #8
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4700 KB Output is correct

Subtask #9
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 15340 KB Output is correct
2 Correct 147 ms 17908 KB Output is correct

Subtask #10
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4700 KB Output is correct
2 Correct 5 ms 4728 KB Output is correct
3 Correct 5 ms 4700 KB Output is correct

Subtask #11
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 20664 KB Output is correct
2 Correct 288 ms 30436 KB Output is correct
3 Correct 247 ms 30808 KB Output is correct

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 329 ms 30188 KB Output is correct
2 Correct 219 ms 31056 KB Output is correct

Subtask #13
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 21064 KB Output is correct
2 Correct 231 ms 30796 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 226 ms 28612 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 236 ms 31676 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 26300 KB Output is correct
2 Correct 185 ms 33592 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 332 ms 31796 KB Output is correct
2 Correct 255 ms 24584 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 349 ms 31844 KB Output is correct
2 Correct 349 ms 33596 KB Output is correct
3 Correct 379 ms 36036 KB Output is correct
4 Correct 374 ms 33852 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 474 ms 35744 KB Output is correct
2 Correct 435 ms 48936 KB Output is correct
3 Correct 323 ms 49812 KB Output is correct
4 Correct 475 ms 46160 KB Output is correct