Submission #688374

# Submission time Handle Problem Language Result Execution time Memory
688374 2023-01-27T11:21:23 Z finn__ Fish (IOI08_fish) C++17
21 / 100
321 ms 65536 KB
#include <bits/stdc++.h>
using namespace std;

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

    uint64_t n, k, m;
    cin >> n >> k >> m;

    vector<pair<unsigned, unsigned>> fish(n);
    vector<pair<unsigned, unsigned>> largest(k, {0, 0});
    vector<unsigned> F(k, 0);

    for (auto &[l, g] : fish)
    {
        cin >> l >> g;
        g--;
        largest[g] = max(largest[g], {l, g});
        F[g] = max(F[g], l);
    }

    sort(fish.begin(), fish.end());
    sort(largest.begin(), largest.end());
    vector<unsigned> c(k, 0);
    vector<vector<unsigned>> e(k, vector<unsigned>(k));
    size_t p = 0;

    for (size_t i = 0; i < k; i++)
    {
        while (p < n && 2 * fish[p].first <= largest[i].first)
        {
            c[fish[p].second]++;
            p++;
        }

        for (size_t j = 0; j < k; j++)
        {
            e[largest[i].second][j] = c[j] % m;
        }
    }

    uint64_t ans = 0;

    for (size_t i = 0; i < k; i++)
    {
        uint64_t x = 1, y = 1; // Partial and full count.
        for (size_t j = 0; j < k; j++)
        {
            if (i == j)
                continue;

            if (e[j][i] <= e[i][i] && F[j] >= F[i])
                y = (y * (e[i][j] + 1)) % m;
            else if (F[i] > F[j])
                x = (x * (e[i][j] + 1)) % m, y = (y * (e[i][j] + 1)) % m;
        }
        ans = (ans + x * e[i][i]) % m;
        ans = (ans + y) % m;
    }

    cout << ans << '\n';
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 113 ms 4220 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 46 ms 2020 KB Output is correct
2 Incorrect 60 ms 2508 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 64 ms 16860 KB Output is correct
2 Incorrect 16 ms 4340 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 118 ms 13060 KB Output is correct
2 Incorrect 232 ms 25072 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 172 ms 20004 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 321 ms 65536 KB Output is correct
2 Runtime error 159 ms 65536 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 148 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 152 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 145 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 164 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 156 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 193 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -