oj.uz

Submission #143569

# Submission time Handle Problem Language Result Execution time Memory
143569 2019-08-14T16:00:42 Z popovicirobert Fish (IOI08_fish) C++14
12 / 100
 3000 ms 17132 KB 
#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);
    vector <int> fr(k + 1);
    for(i = 0; i < n; i++) {
        cin >> arr[i].first >> arr[i].second;
        fr[arr[i].second]++;
    }
    sort(arr.begin(), arr.end());

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

    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> sol;
    vector <bool> used(k + 1), vis(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;
        }

        if(mx[arr[i].second] == fr[arr[i].second] + 1) {

            auto check = [&](int x) {
                int res = -1, sz = pos[arr[i].second].size();
                for(int step = 1 << 18; step; step >>= 1) {
                    if(res + step < sz && arr[pos[arr[i].second][res + step]].first * 2 <= x) {
                        res += step;
                    }
                }
                return res + 1;
            };

            int res = -1;
            for(int step = 1 << 18; step; step >>= 1) {
                if(res + step < sol.size() && check(arr[sol[res + step]].first) == mx[arr[i].second]) {
                    res += step;
                }
            }

            for(j = 0; j <= res; j++) {
                vis[arr[sol[j]].second] = 1;
            }

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

            for(j = 0; j <= res; j++) {
                vis[arr[sol[j]].second] = 0;
            }
        }

        used[arr[i].second] = 1;
        sol.push_back(i);
    }

    cout << ans;

    return 0;
}

Compilation message

fish.cpp: In function 'int main()':
fish.cpp:140:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if(res + step < sol.size() && check(arr[sol[res + step]].first) == mx[arr[i].second]) {
                    ~~~~~~~~~~~^~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 376 KB Output is correct

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct

Subtask #5
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 178 ms 6748 KB Output isn't correct

Subtask #7
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 376 KB Output isn't correct

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 376 KB Output isn't correct

Subtask #9
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 72 ms 3108 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 540 KB Output is correct
2 Incorrect 35 ms 504 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #11
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 190 ms 4788 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 297 ms 7128 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #13
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 488 ms 4940 KB Output is correct
2 Incorrect 1802 ms 7532 KB Output isn't correct

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3018 ms 7324 KB Time limit exceeded

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3091 ms 8332 KB Time limit exceeded

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3032 ms 7468 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3021 ms 13912 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3095 ms 14756 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3082 ms 17132 KB Time limit exceeded
2 Halted 0 ms 0 KB -