Submission #143555

#	Time	Username	Problem	Language	Result	Execution time	Memory
143555		popovicirobert	Fish (IOI08_fish)	C++14	4 / 100	3087 ms	13788 KiB

fish

#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long



/*const int MOD = ;

inline int lgput(int a, int b) {
    int ans = 1;
    while(b > 0) {
        if(b & 1) ans = (1LL * ans * a) % MOD;
        b >>= 1;
        a = (1LL * a * a) % MOD;
    }
    return ans;
}

inline void mod(int &x) {
    if(x >= MOD)
        x -= MOD;
}

inline void add(int &x, int y) {
    x += y;
    mod(x);
}

inline void sub(int &x, int y) {
    x += MOD - y;
    mod(x);
}

inline void mul(int &x, int y) {
    x = (1LL * x * y) % MOD;
}

inline int inv(int x) {
    return lgput(x, MOD - 2);
}*/

/*int fact[], invfact[];

inline void prec(int n) {
    fact[0] = 1;
    for(int i = 1; i <= n; i++) {
        fact[i] = (1LL * fact[i - 1] * i) % MOD;
    }
    invfact[n] = lgput(fact[n], MOD - 2);
    for(int i = n - 1; i >= 0; i--) {
        invfact[i] = (1LL * invfact[i + 1] * (i + 1)) % MOD;
    }
}

inline int comb(int n, int k) {
    if(n < k) return 0;
    return (1LL * fact[n] * (1LL * invfact[k] * invfact[n - k] % MOD)) % MOD;
}*/

using namespace std;



int main() {
#if 0
    ifstream cin("A.in");
    ofstream cout("A.out");
#endif
    int i, j, n, k, md;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    cin >> n >> k >> md;
    vector < pair <int, int> > arr(n);
    for(i = 0; i < n; i++) {
        cin >> arr[i].first >> arr[i].second;
    }
    sort(arr.begin(), arr.end());

    vector <int> mx(k + 1);
    i = 0;
    while(i < n && 2 * arr[i].first <= arr[n - 1].first) {
        mx[arr[i].second]++;
        i++;
    }

    vector <int> fr(k + 1);
    for(i = 0; i < n; i++) {
        fr[arr[i].second]++;
    }

    vector <bool> used(k + 1);
    int ans = 0, p = n - 1;
    for(i = n - 1; i >= 0; i--) {
        if(used[arr[i].second]) continue;

        while(p >= 0 && arr[i].first < 2 * arr[p].first) {
            fr[arr[p].second]--;
            p--;
        }

        int cur = 1;
        for(j = 1; j <= k; j++) {
            if(used[j] == 0) {
                cur = (1LL * cur * (fr[j] + 1)) % md;
            }
        }
        ans = (ans + cur) % md;

        if(mx[arr[i].second] == fr[arr[i].second]) {
            int num = 1;
            cur = 1;
            for(j = 1; j <= k; j++) {
                if(j != arr[i].second)
                    cur = (1LL * cur * (fr[j] + 1)) % md;
                if(j != arr[i].second && used[j] == 0)
                    num = (1LL * num * (fr[j] + 1)) % md;
            }
            ans = (ans + cur - num + md) % md;
        }

        used[arr[i].second] = 1;
    }

    cout << ans;

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