Submission #734055

#	Time	Username	Problem	Language	Result	Execution time	Memory
734055		lorenzoferrari	Fish (IOI08_fish)	C++17	68 / 100	3059 ms	17684 KiB

fish

#include "bits/stdc++.h"
using namespace std;

struct fish {
    int l;
    int g;
    bool operator<(const fish& oth) {
        return l < oth.l;
    }
};

signed main() {
    int n; cin >> n;
    int k; cin >> k;
    int m; cin >> m;
    vector<fish> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i].l >> a[i].g; --a[i].g;
    }
    sort(begin(a), end(a));
    vector<vector<int>> o(k);
    vector<int> last(k);
    for (int i = 0; i < n; ++i) {
        o[a[i].g].emplace_back(a[i].l);
        last[a[i].g] = i;
    }

    int ans = 0;
    vector<int> rs;
    vector<int> frq(k);
    for (int r = 0, l = 0; r < n; ++r) {
        int c = a[r].g;
        if (last[c] != r) continue;
        while (2*a[l].l <= a[r].l) {
            ++frq[a[l].g];
            ++l;
        }

        int cur = 1;
        for (int i : rs) {
            cur = (cur * (frq[i] % m + 1)) % m;
        }
        rs.push_back(c);
        cur = cur * (frq[c] % m) % m;

        int oth = 1;
        for (int i = 0; i < k; ++i) {
            if (i == c) continue;
            if (2*o[c][frq[c]] <= o[i].back()) continue;
            oth = oth * (frq[i] + 1) % m;
        }

        ans = (ans + cur + oth) % m;
    }
    
    cout << ans << "\n";
}

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