oj.uz

답안 #1000093

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1000093 2024-06-16T16:01:47 Z codexistent Job Scheduling (CEOI12_jobs) C++14
40 / 100
 349 ms 14900 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;
    }
}
/*
8 2 12
1 2 4 2 1 3 5 6 2 3 6 4
*/

Subtask #1
40.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 2000 KB Output is correct
2 Correct 42 ms 1996 KB Output is correct
3 Correct 34 ms 1920 KB Output is correct
4 Correct 30 ms 2244 KB Output is correct
5 Correct 30 ms 1996 KB Output is correct
6 Correct 31 ms 1776 KB Output is correct
7 Correct 30 ms 1992 KB Output is correct
8 Correct 31 ms 1996 KB Output is correct
9 Incorrect 121 ms 2496 KB Output isn't correct
10 Incorrect 128 ms 2508 KB Output isn't correct
11 Incorrect 29 ms 1992 KB Output isn't correct
12 Incorrect 67 ms 3264 KB Output isn't correct
13 Incorrect 84 ms 6600 KB Output isn't correct
14 Incorrect 135 ms 7140 KB Output isn't correct
15 Incorrect 144 ms 7684 KB Output isn't correct
16 Incorrect 190 ms 10932 KB Output isn't correct
17 Incorrect 228 ms 11688 KB Output isn't correct
18 Incorrect 245 ms 12972 KB Output isn't correct
19 Incorrect 349 ms 14900 KB Output isn't correct
20 Incorrect 224 ms 12204 KB Output isn't correct