제출 #792372

#제출 시각아이디문제언어결과실행 시간메모리
792372MONJob Scheduling (CEOI12_jobs)C++14
55 / 100
100 ms17112 KiB
#include<iostream>
#include<cmath>
#include<vector>
using namespace std;

constexpr int NMAX = 1e5 + 1;

vector<int> t[NMAX];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);

    int n,d,m,ti; cin >> n >> d >> m;
    for(int i = 1; i <= m ; i++)
        {
            cin >> ti;
            int id = min(n,ti + d);
            t[id].emplace_back(i);
        }

    int ans = 0,sp = 0;
    for(int i = 1; i <= n ; i++)
        {
            sp += t[i].size();
            ans = max(ans,(int)ceil(1.0 * sp / i));
        }

    cout << ans << '\n'; vector<int> v;
    for(int i = 1; i <= n ; i++)
        for(auto &it : t[i]) v.emplace_back(it);

    int now = 0; for(int i = 1; i <= n ; i++)
    {
        for(int j = 1; j <= ans ; j++)
            {
                if(now >= m) break;
                cout << v[now++] << " ";
            }

        cout << "0\n";
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...