Submission #921161

#	Time	Username	Problem	Language	Result	Execution time	Memory
921161		gs18103	Fish (IOI08_fish)	C++17	9 / 100	212 ms	17748 KiB

fish

#include  <bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define em emplace
#define all(v) v.begin(), v.end()

using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

const int MAX = 202020;
const int INF = 1e9;
const ll LINF = 1e18;

struct SEG {
    vector <int> tree;
    int sz, mod;
    bool base;
    SEG(int n, int _mod, int x = 0, bool _base = true) : mod(_mod), base(_base) {
        for(sz = 1; sz < n; sz <<= 1) ;
        tree.resize(sz<<1);
        for(int &i : tree) i = x;
    }

    void update(int x, int val) {
        int node = x + sz - base;
        tree[node] += val;
        tree[node] %= mod;
        while(node >>= 1) {
            tree[node] = (tree[node<<1] * tree[node<<1|1]) % mod;
        }
    }

    int cal(int l, int r) {
        int ret = 1;
        for(l += sz - base, r += sz - base; l <= r; l >>= 1, r >>= 1) {
            if(l & 1) ret = (ret * tree[l++]) % mod;
            if(~r & 1) ret = (ret * tree[r--]) % mod;
        }
        return ret;
    }
};

int main() {
    ios::sync_with_stdio(false); cin.tie(0);

    int n, k, mod;
    cin >> n >> k >> mod;
    vector <pii> F(n), C(k);
    for(int i = 0; i < n; i++) {
        cin >> F[i].fi >> F[i].se;
        C[F[i].se-1].fi = max(C[F[i].se-1].fi, F[i].fi);
    }
    for(int i = 0; i < k; i++) {
        C[i].se = i + 1;
    }
    sort(all(F));
    sort(all(C));
    vector <int> num(k+1);
    for(int i = 0; i < k; i++) {
        num[C[i].se] = i;
    }

    vector <int> mx(k);
    for(int i = 0; i < n; i++) {
        if(F[i].fi * 2 > F[n-1].fi) break;
        mx[num[F[i].se]]++;
    }

    SEG ST(k, mod, 1, false);
    int ans = 0, idx = 0;
    for(int i = 0; i < n; i++) {
        while(idx < n && F[idx].fi * 2 <= F[i].fi) {
            ST.update(F[idx].se, 1);
            idx++;
        }
        F[i].se = num[F[i].se];
        if(C[F[i].se].fi == F[i].fi) {
            ans += ST.cal(0, F[i].se);
            ans %= mod;
            if(i + 1 < n && mx[F[i].se] + 1 == ST.cal(F[i].se, F[i].se)) {
                ans += ST.cal(0, F[i].se-1) * (ST.cal(F[i].se+1, k-1) - 1);
                ans %= mod;
                ans += mod;
                ans %= mod;
            }
        }
    }
    cout << ans << endl;
}

• 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