Submission #410603

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
410603	2021-05-23 06:59:52	four_specks	Job Scheduling (CEOI12_jobs)	C++17	100 / 100	483 ms	29816 KiB

jobs

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
void solve()
{
    int n, d;
    int m;
    cin >> n >> d >> m;
    vector<pair<int, int>> jobs(m);
    for (int j = 0; j < m; j++)
        cin >> jobs[j].first, jobs[j].second = j;
    sort(jobs.begin(), jobs.end());
    auto valid = [&](const int &w) -> pair<bool, vector<vector<int>>>
    {
        vector<vector<int>> sc(n);
        for (int i = 0, j = 0; i < n && j < m; i++)
        {
            for (int c = w; j < m && c > 0 && jobs[j].first <= i + 1; c--)
            {
                if (i + 1 - jobs[j].first > d)
                    return {0, {}};
                else
                {
                    sc[i].push_back(jobs[j].second + 1);
                    j++;
                }
            }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 100 / 100