Submission #1168033

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1168033	2025-03-17 02:53:20	akuyga	Job Scheduling (CEOI12_jobs)	C++20	40 / 100	178 ms	19764 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;
#define ii pair<int,int>
#define f first
#define s second
#define mp make_pair
int main(){
    int N,D,M;
    int c=0;
    cin>>N>>D>>M;
    vector<int> A[N+1];
    for(int i=1;i<=M;i++){
        int x;
        cin>>x;
        A[x].push_back(i);
    }
    vector<int> day[N+1];
    stack<int> s;
    for(int i=1;i<=N;i++){
        for(auto j:A[i])s.push(j);
        while(!s.empty()){
            for(int d=i;d<=i+D&&!s.empty();d++)
                while(day[d].size()<c&&!s.empty()){day[d].push_back(s.top()); s.pop();}
            if(!s.empty())c++;
        }
    }
    cout<<c<<'\n';
    for(int i=1;i<=N;i++){
        for(auto j:day[i])cout<<j<<' ';
        cout<<0<<'\n';
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 40 / 100