Submission #1156883

#	Time	Username	Problem	Language	Result	Execution time	Memory
1156883		goulthen	Job Scheduling (CEOI12_jobs)	C++20	100 / 100	185 ms	21852 KiB

jobs

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define dl long double
#define rep(i,a,b) for (auto i = a; i <= b; ++i)
#define per(i,a,b) for (auto i = a; i >= b; --i)
#define pii pair<int,int>
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define fi first
#define se second
const int MAXN = 1e5 + 10;
int a[MAXN], pfx[MAXN];

void solve() {
    int n,m,d;
    cin >> n >> d >> m;
    vector<pii> t;
    rep(i,1,m) {
        int x;
        cin >> x;
        a[x]++;
        t.pb({x,i});
    }
    rep(i,1,n) pfx[i] = pfx[i-1] + a[i];
    sort(all(t));
    int l = 1, r = m, ans = 0;
    while (l <= r) {
        int mid = r-(r-l)/2;
        bool ok = true;
        int i = 0;
        rep(cur,1,n) {
            rep(j,1,mid) {
                if (i == m  || t[i].fi > cur) break;
                ok &= t[i].fi >= cur-d;
                i++;
            }
        }

        if (ok && i == m) {
            ans = mid;
            r = mid - 1;
        } else {
            l = mid + 1;
        }
    }
    cout << ans << '\n';
    int i = 0;
    rep(cur,1,n) {
        rep(j,1,ans) {
            if (i == m  || t[i].fi > cur) break;
            cout <<t[i].se << ' ';
            i++;
        }
        cout << "0\n";
    }
}

int32_t main() {
	ios_base::sync_with_stdio(0);cin.tie(nullptr);
    int tt = 1;
    //cin >> tt;
    while (tt--) solve();
}

• Subtask 1: 100 / 100