Submission #1000091

# Submission time Handle Problem Language Result Execution time Memory
1000091 2024-06-16T15:56:23 Z codexistent Job Scheduling (CEOI12_jobs) C++14
16 / 100
354 ms 14256 KB
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = a; i <= b; i++)
#define MAXN 100005

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

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

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

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

        FOR(j, 1, arr[i]){
            int k = *s.begin();
            s.erase(s.begin());
            s.insert(k + 1);
        }
        s.insert(0);
    }
    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 && req[k + 1].first + d <= i)){
            cout << req[k + 1].second << " ";
            j++, k++;
        }

        cout << "0" << endl;
    }
}
/*
8 2 12
1 2 4 2 1 3 5 6 2 3 6 4
*/
# Verdict Execution time Memory Grader output
1 Partially correct 41 ms 1932 KB Partially correct
2 Partially correct 31 ms 2000 KB Partially correct
3 Partially correct 35 ms 2000 KB Partially correct
4 Partially correct 30 ms 1996 KB Partially correct
5 Partially correct 39 ms 1992 KB Partially correct
6 Partially correct 33 ms 1996 KB Partially correct
7 Partially correct 30 ms 2000 KB Partially correct
8 Partially correct 30 ms 2000 KB Partially correct
9 Incorrect 123 ms 2496 KB Output isn't correct
10 Incorrect 121 ms 2496 KB Output isn't correct
11 Incorrect 29 ms 1744 KB Output isn't correct
12 Incorrect 66 ms 3264 KB Output isn't correct
13 Incorrect 92 ms 5568 KB Output isn't correct
14 Incorrect 137 ms 6584 KB Output isn't correct
15 Incorrect 142 ms 7864 KB Output isn't correct
16 Incorrect 197 ms 9652 KB Output isn't correct
17 Incorrect 231 ms 11436 KB Output isn't correct
18 Incorrect 249 ms 13748 KB Output isn't correct
19 Incorrect 354 ms 14256 KB Output isn't correct
20 Incorrect 257 ms 12844 KB Output isn't correct