제출 #1168033

#제출 시각아이디문제언어결과실행 시간메모리
1168033akuygaJob Scheduling (CEOI12_jobs)C++20
40 / 100
178 ms19764 KiB
#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';
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...