# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
441765 | Yuisuyuno | Job Scheduling (CEOI12_jobs) | C++14 | 500 ms | 24992 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//Nguyen Huu Hoang Minh
#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define N 1000001
#define ii pair<int, int>
#define vi vector<int>
using namespace std;
const int minf = -1e9;
vector<int> res[100012];
int n, m, d;
bool ok(int machine, vector<ii> a){
int delays=0;
int en[machine] = {0};
for(int i=0, cur=0; i<m; i++, cur++){
if (cur==machine) cur=0;
if (en[cur] + 1 > a[i].fi){
en[cur]++;
delays = max(delays,en[cur]-a[i].fi);
}
else en[cur] = a[i].fi;
}
return delays <= d;
}
int main()
{
vector<ii> a;
cin >> n >> d >> m;
a.resize(m);
for(int i=0; i<m; i++){
cin >> a[i].fi;
a[i].se = i+1;
}
sort(a.begin(),a.end());
int l = 0, r = m;
int ans;
while (r-l > 0){
int mid = (l+r)/2;
if (ok(mid,a)){
r = mid;
}
else l = mid+1;
}
cout<<l<<'\n';
int endT[l]={0};
for(int i=0, cur=0; i<m; i++, cur++){
if (cur==l) cur=0;
endT[cur] = max(endT[cur]+1,a[i].fi);
res[endT[cur]].pb(a[i].se);
}
for(int i=1; i<=n; i++){
for(int x : res[i]) cout << x << ' ';
cout << "0\n";
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |