oj.uz

Submission #696854

# Submission time Handle Problem Language Result Execution time Memory
696854 2023-02-07T12:01:42 Z puppy Fish (IOI08_fish) C++17
9 / 100
 355 ms 17444 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;
int F, K, M;
pair<int, int> fish[500005]; //(length, color)
struct mulseg
{
    vector<int> tree;
    mulseg(int n)
    {
        int sz = 1 << ((int)ceil(log2(n+1))+1);
        tree.resize(sz);
    }
    int init(int s, int e, int node, vector<int> &arr)
    {
        if (s == e) return tree[node] = arr[s] % M;
        return tree[node] = init(s, (s+e)/2, 2*node, arr) * init((s+e)/2+1, e, 2*node+1, arr) % M;
    }
    void upd(int s, int e, int node, int id, int diff)
    {
        if (e < id || id < s) return;
        if (s == e) {
            tree[node] = (tree[node] + diff + M) % M;
            return;
        }
        upd(s, (s+e)/2, 2*node, id, diff);
        upd((s+e)/2+1, e, 2*node+1, id, diff);
        tree[node] = tree[2*node] * tree[2*node+1] % M;
    }
    int query(int s, int e, int node, int l, int r)
    {
        if (l > r) return 1;
        if (e < l || r < s) return 1;
        if (l <= s && e <= r) return tree[node];
        return query(s, (s+e)/2, 2*node, l, r) * query((s+e)/2+1, e, 2*node+1, l, r) % M;
    }
};
bool visited[500005];
bool visited2[500005];
signed main()
{
    ios::sync_with_stdio(false); cin.tie(0);
    cin >> F >> K >> M;
    for (int i = 0; i < F; i++) {
        cin >> fish[i].first >> fish[i].second;
    }
    sort(fish, fish + F);
    vector<int> trans(1, 0);
    vector<bool> vis(K+1);
    for (int i = F - 1; i >= 0; i--) {
        if (!vis[fish[i].second]) {
            trans.push_back(fish[i].second);
            vis[fish[i].second] = true;
        }
    }
    vector<int> to(K+1);
    for (int i = 1; i <= K; i++) to[trans[i]] = i;
    for (int i = 0; i < F; i++) fish[i].second = to[fish[i].second];
    mulseg seg(K);
    vector<int> cnt(K+1);
    int fin = fish[F-1].first;
    int pos = 0;
    while (pos < F && fish[pos].first <= fin/2) pos++;
    for (int i = 0; i < pos; i++) cnt[fish[i].second]++;
    for (int i = 1; i <= K; i++) cnt[i]++;
    seg.init(1, K, 1, cnt);
    int ans = 0;
    for (int i = F - 1; i >= 0; i--) {
        while (pos > 0 && fish[pos-1].first > fish[i].first/2) {
            visited2[fish[pos-1].second] = true;
            seg.upd(1, K, 1, fish[pos-1].second, -1);
            pos--;
        }
        if (visited[fish[i].second]) continue;
        visited[fish[i].second] = true;
        ans += seg.query(1, K, 1, fish[i].second, K);
        if (!visited2[fish[i].second]) {
            ans += seg.query(1, K, 1, 1, fish[i].second-1) * seg.query(1, K, 1, fish[i].second+1, K) % M;
            ans -= seg.query(1, K, 1, fish[i].second+1, K);
        }
        ans = (ans % M + M) % M;
    }
    assert(0 <= ans && ans < M);
    cout << ans << '\n';
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 138 ms 8140 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 57 ms 3552 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Incorrect 3 ms 468 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #11
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 102 ms 5180 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 154 ms 8240 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #13
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 5096 KB Output is correct
2 Incorrect 198 ms 15372 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 179 ms 8028 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 187 ms 9288 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 208 ms 9036 KB Output is correct
2 Correct 267 ms 12792 KB Output is correct

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 317 ms 15404 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 264 ms 15372 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 355 ms 17444 KB Output isn't correct
2 Halted 0 ms 0 KB -