Submission #791968

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
791968	2023-07-24T13:11:15 Z	matu	Job Scheduling (CEOI12_jobs)	C++14	55 / 100	182 ms	14548 KB

jobs

#include <bits/stdc++.h>
using namespace std;
const int M = 1e6 + 1;
int n, d, m;
vector<pair<int, int>> v(M);

int main(){
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> d >> m;
    for(int i = 1; i <= m; i++){
        cin >> v[i].first;
        v[i].second = i;
    }
    sort(v.begin() + 1, v.begin() + 1 + m);
    auto ok =  [&](int nrb){
        vector<int> zd;
        int st = 1, dr = 1;
        for(int i = 1; i <= n; i++){
            while(dr <= m && v[dr].first == i){
                dr++;
            }
            dr--;
           
            st += nrb;
            if(st > m){
                return 1;
            }
            if(v[st].first + d <= i){
                return 0;
            }
            dr = max(dr, st);
           
        }
        return 1;
    };
    auto pr =  [&](int nrb, int pl){
        vector<int> zd;
        int st = 1, dr = 1;
        for(int i = 1; i <= n; i++){
            while(dr <= m && v[dr].first == i){
                dr++;
            }
            dr--;
            for(int j = st; j < st + nrb; j++){
                if(j > m) break;
                cout << v[j].second << " ";
            }
            cout << 0 << '\n';
            st += nrb;
            dr = max(dr, st);
        }
        return;
    };
    int st = 0, dr = 1e9;
    while(st <= dr){
        int tm = (st + dr) / 2;
        if(ok(tm)){
            dr = tm - 1;
        }else st = tm + 1;
    }

    cout << st << '\n';
    pr(st, 1);
}

// 8 2 12 
// 1 2 4 2 1 3 5 6 2 3 6 4

Subtask #1

55.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	16 ms	8680 KB	Output isn't correct
2	Incorrect	16 ms	8676 KB	Output isn't correct
3	Incorrect	16 ms	8660 KB	Output isn't correct
4	Incorrect	16 ms	8660 KB	Output isn't correct
5	Incorrect	16 ms	8724 KB	Output isn't correct
6	Incorrect	16 ms	8672 KB	Output isn't correct
7	Incorrect	16 ms	8656 KB	Output isn't correct
8	Incorrect	16 ms	8672 KB	Output isn't correct
9	Correct	26 ms	8924 KB	Output is correct
10	Correct	27 ms	8936 KB	Output is correct
11	Correct	22 ms	8676 KB	Output is correct
12	Correct	48 ms	9376 KB	Output is correct
13	Correct	60 ms	10072 KB	Output is correct
14	Correct	82 ms	10840 KB	Output is correct
15	Incorrect	106 ms	11448 KB	Output isn't correct
16	Correct	125 ms	12240 KB	Output is correct
17	Correct	143 ms	12892 KB	Output is correct
18	Correct	161 ms	13648 KB	Output is correct
19	Correct	182 ms	14548 KB	Output is correct
20	Correct	143 ms	12876 KB	Output is correct