oj.uz

Submission #874811

# Submission time Handle Problem Language Result Execution time Memory
874811 2023-11-17T20:33:37 Z vjudge1 Job Scheduling (CEOI12_jobs) C++14
100 / 100
 196 ms 24180 KB 
// Parsa Jokar 2023 https://github.com/phictus/ioi

#pragma GCC optimize("Ofast")

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdint>

using namespace std;
using Pair = pair<int64_t, int64_t>;

constexpr int64_t maxn = 1000000;
int64_t n, d, m;
Pair a[maxn];

bool Check(int64_t k)
{
    int64_t current = 0;
    for (int64_t i = 1; i <= n; i++)
    {
        if (current >= m)
            return true;

        if (a[current].first + d < i)
            return false;

        for (int64_t j = 0; j < k && a[current].first <= i; j++)
            current++;
    }

    return true;
}

int main()
{
    ios_base::sync_with_stdio(false);

    cin >> n >> d >> m;
    for (int64_t i = 0; i < m; i++)
    {
        cin >> a[i].first;
        a[i].second = i + 1;
    }
    sort(a, a + m);

    int64_t l = 1, r = m;
    while (l < r)
    {
        int64_t k = (l + r) / 2;
        if (Check(k))
            r = k;
        else
            l = k + 1;
    }

    cout << l << '\n';
    for (int64_t i = 0; i < n; i++)
    {
        for (int64_t j = i * l; j < min(m, (i + 1) * l); j++)
            cout << a[j].second << ' ';
        cout << "0\n";
    }

    return (0 ^ 0);
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 3164 KB Output is correct
2 Correct 13 ms 3164 KB Output is correct
3 Correct 13 ms 3164 KB Output is correct
4 Correct 13 ms 3300 KB Output is correct
5 Correct 13 ms 3164 KB Output is correct
6 Correct 13 ms 3204 KB Output is correct
7 Correct 13 ms 3196 KB Output is correct
8 Correct 13 ms 3420 KB Output is correct
9 Correct 22 ms 3420 KB Output is correct
10 Correct 21 ms 3420 KB Output is correct
11 Correct 20 ms 3164 KB Output is correct
12 Correct 41 ms 5972 KB Output is correct
13 Correct 70 ms 8572 KB Output is correct
14 Correct 88 ms 11092 KB Output is correct
15 Correct 105 ms 12112 KB Output is correct
16 Correct 133 ms 17492 KB Output is correct
17 Correct 153 ms 20560 KB Output is correct
18 Correct 175 ms 22868 KB Output is correct
19 Correct 196 ms 24180 KB Output is correct
20 Correct 153 ms 20564 KB Output is correct