oj.uz

Submission #1000095

# Submission time Handle Problem Language Result Execution time Memory
1000095 2024-06-16T16:06:16 Z codexistent Job Scheduling (CEOI12_jobs) C++14
40 / 100
 381 ms 15332 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 && i <= req[k + 1].first + d)){
            cout << req[k + 1].second << " ";
            j++, k++;
        }

        cout << "0" << endl;
    }

    if(k != m - 1){
        while(true){
            cout << "Fdsaf " << endl;
        }
    }
}
/*
8 2 12
1 2 4 2 1 3 5 6 2 3 6 4
*/

Subtask #1
40.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 1920 KB Output is correct
2 Correct 30 ms 1896 KB Output is correct
3 Correct 30 ms 1996 KB Output is correct
4 Correct 30 ms 1920 KB Output is correct
5 Correct 30 ms 1996 KB Output is correct
6 Correct 29 ms 1988 KB Output is correct
7 Correct 30 ms 1992 KB Output is correct
8 Correct 30 ms 1852 KB Output is correct
9 Incorrect 122 ms 2512 KB Output isn't correct
10 Incorrect 126 ms 2376 KB Output isn't correct
11 Incorrect 30 ms 1884 KB Output isn't correct
12 Incorrect 59 ms 3260 KB Output isn't correct
13 Incorrect 85 ms 5056 KB Output isn't correct
14 Incorrect 136 ms 6736 KB Output isn't correct
15 Incorrect 141 ms 7864 KB Output isn't correct
16 Incorrect 192 ms 10416 KB Output isn't correct
17 Incorrect 224 ms 11948 KB Output isn't correct
18 Incorrect 250 ms 14064 KB Output isn't correct
19 Incorrect 381 ms 15332 KB Output isn't correct
20 Incorrect 260 ms 11184 KB Output isn't correct