# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
392795 | nicolaalexandra | Job Scheduling (CEOI12_jobs) | C++14 | 506 ms | 20124 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.
#include <bits/stdc++.h>
#define DIM 1000010
#define DIMN 100010
using namespace std;
pair <int,int> v[DIM];
vector <int> ans[DIMN];
int n,d,m,i;
int verif (int val){
for (int i=1;i<=m;i++)
ans[i].clear();
int pos = 1;
for (int i=1;i<=m;i++){
/// ce fac in ziua i?
int cnt = 0;
while (pos <= n && v[pos].first <= i && cnt < val){
if (v[pos].first + d < i)
return 0;
ans[i].push_back(v[pos].second);
cnt++;
pos++;
}
}
return 1;
}
int main (){
//ifstream cin ("date.in");
//ofstream cout ("date.out");
cin>>m>>d>>n;
for (i=1;i<=n;i++){
cin>>v[i].first;
v[i].second = i;
}
sort (v+1,v+n+1);
int st = 1, dr = n, sol;
while (st <= dr){
int mid = (st+dr)>>1;
if (verif(mid)){
sol = mid;
dr = mid-1;
} else st = mid+1;
}
cout<<sol<<"\n";
verif (sol);
for (i=1;i<=m;i++){
for (auto it : ans[i])
cout<<it<<" ";
cout<<"0\n";
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |