Submission #688367

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

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

    size_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;
        }
    }

    unsigned ans = 0;

    for (size_t i = 0; i < k; i++)
    {
        unsigned 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] + 1) && 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 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 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 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 328 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 122 ms 5016 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 332 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 45 ms 2440 KB Output is correct
2 Incorrect 67 ms 3152 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 67 ms 16884 KB Output is correct
2 Incorrect 15 ms 4308 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 114 ms 13836 KB Output is correct
2 Incorrect 215 ms 25728 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 169 ms 20764 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 312 ms 65536 KB Output is correct
2 Runtime error 154 ms 65536 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 140 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 151 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 139 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 160 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 158 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 178 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -