Submission #778384

#	Time	Username	Problem	Language	Result	Execution time	Memory
778384		loctildore	Fish (IOI08_fish)	C++14	9 / 100	1030 ms	63744 KiB

fish

#include <bits/stdc++.h>
using namespace std;
// trans rights
#define int long long
#define f first
#define s second
#define endl '\n'
#define all(x) begin(x), end(x)
int f, k, MOD;
struct node{
    int l, r;
    node *lft, *rht;
    int val;
    node(int tl, int tr): l(tl), r(tr), val(1) {
        if (l + 1 == r) {
            lft = rht = NULL;
            return;
        }
        lft = new node(l, (l + r) / 2);
        rht = new node((l + r) / 2, r);
    }

    void upd(int x, int tval) {
        if (x < l || x >= r) return;
        if (l + 1 == r) {
            val = tval % MOD;
            return;
        }
        lft->upd(x, tval);
        rht->upd(x, tval);
        val = (lft->val * rht->val) % MOD;
    }
} *root1, *root2;
int cnt[500069], ans;
bool done[500069], lwrd[500069];
priority_queue<pair<int,int>> pq, tp;
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    //freopen("fish.in", "r", stdin);
    //freopen("fish.out", "w", stdout);
    cin>>f>>k>>MOD;
    root1 = new node(0, k);
    root2 = new node(0, k);
    for (int i = 0; i < f; i++) {
        int a, b;
        cin>>a>>b; b--;
        cnt[b]++;
        pq.push({a, b});
        tp.push({a, b});
    }
    for (int i = 0; i < k; i++) {
        root1->upd(i, cnt[i] + 1);
        root2->upd(i, cnt[i] + 1);
    }
    bool frst = true;
    while (tp.size()) {
        auto t = tp.top(); tp.pop();
        if (done[t.s]) continue;

        while(pq.size()) {
            auto t2 = pq.top();
            if (t2.f * 2 <= t.f) break;
            pq.pop();
            int i = t2.s;
            cnt[i]--;
            root1->upd(i, cnt[i] + 1);
            if (!frst) lwrd[i] = true;
            if (!done[i]) root2->upd(i, cnt[i] + 1);
        }

        int i = t.s;
        if (frst) {
            ans = (ans + root1->val) % MOD;
            root2->upd(i, 1);
            done[i] = true;
            frst = false;
            //cout<<ans<<endl;
            continue;
        }

        if (lwrd[i]) {
            ans = (ans + root2->val) % MOD;
        }
        else {
            root1->upd(i, 1);
            ans = (ans + root1->val) % MOD;
            root1->upd(i, cnt[i] + 1);
            root2->upd(i, cnt[i]);
            ans = (ans + root2->val) % MOD;
        }

        root2->upd(i, 1);
        done[i] = true;
        //cout<<ans<<endl;
    }
    cout<<ans<<endl;
    return 0;
}

• Subtask 1: 4 / 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: 5 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5