제출 #734022

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
734022		lorenzoferrari	Fish (IOI08_fish)	C++17	0 / 100	3062 ms	6028 KiB

fish

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

static constexpr int N = 5e5+5;

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<int> last(k);
    for (int i = 0; i < n; ++i) {
        last[a[i].g] = i;
    }

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

        rs.push_back(a[r].g);

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

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

• 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