oj.uz

Submission #1000139

# Submission time Handle Problem Language Result Execution time Memory
1000139 2024-06-16T17:35:17 Z codexistent Job Scheduling (CEOI12_jobs) C++14
40 / 100
 360 ms 17484 KB 
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = a; i <= b; i++)
#define MAXN 100005
#define MAXM 1000000

int n, d, m, arr[MAXN], res = 0;
pair<int, int> req[MAXM];

int main(){
    cin >> n >> d >> m;
    FOR(i, 1, n) arr[i] = 0;
    FOR(i, 1, m){
        int x; cin >> x;
        arr[x]++;
        req[i - 1] = {x, i};
    }
    sort(req,  req + m - 1);

    multiset<int> s; 
    FOR(i, 1, 1 + d) s.insert(0);

    FOR(i, 1, n){
        res = max(res, *s.rbegin());
        s.erase(s.find(*s.rbegin()));
        s.insert(0);

        FOR(j, 1, arr[i]){
            int k = *s.begin();
            s.erase(s.begin());
            s.insert(k + 1);
        }
    }
    res = max(res, *s.rbegin());

    cout << res << endl;

    int k = -1;
    FOR(i, 1, n){
        int j = 1;
        while(j <= res && (k + 1 < m) && (req[k + 1].first <= i && i <= req[k + 1].first + d)){
            cout << req[k + 1].second << " ";
            j++, k++;
        }

        cout << "0" << endl;
    }
}

Subtask #1
40.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 3420 KB Output is correct
2 Correct 29 ms 3412 KB Output is correct
3 Correct 29 ms 3512 KB Output is correct
4 Correct 29 ms 3592 KB Output is correct
5 Correct 39 ms 3420 KB Output is correct
6 Correct 31 ms 3412 KB Output is correct
7 Correct 31 ms 3416 KB Output is correct
8 Correct 29 ms 3416 KB Output is correct
9 Incorrect 125 ms 3912 KB Output isn't correct
10 Incorrect 124 ms 3920 KB Output isn't correct
11 Incorrect 29 ms 3412 KB Output isn't correct
12 Incorrect 56 ms 4568 KB Output isn't correct
13 Incorrect 85 ms 7764 KB Output isn't correct
14 Incorrect 138 ms 9296 KB Output isn't correct
15 Incorrect 145 ms 9812 KB Output isn't correct
16 Incorrect 192 ms 13760 KB Output isn't correct
17 Incorrect 223 ms 14928 KB Output isn't correct
18 Incorrect 240 ms 15184 KB Output isn't correct
19 Incorrect 360 ms 17484 KB Output isn't correct
20 Incorrect 226 ms 14976 KB Output isn't correct