| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1109003 | yazansh | Job Scheduling (CEOI12_jobs) | C++17 | 0 ms | 0 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.
/*************
the author:
shimutski_zoro
************ */
#include <bits/stdc++.h>
using namespace std;
#define yon(x) cout<<((x)?"YES":"NO");
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define ff first
#define ss second
#define em emplace_back
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define per(i,j,k) for(int i=k;i>=j;i--)
#define forp(x,y,a) for(auto &[x,y]:(a))
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<pll> vpl;
typedef vector<vl> vvl;
typedef vector<vpl> vvpl;
typedef vector<string> vs;
typedef deque<ll> dl;
const int mod=1e9+7;
ll inf =1e18+1;
const int M=1e6;
const int N=1e3+1;
const ll dx[]={1,0,-1,0},dy[]={0,1,0,-1};
void solve(){
ll n,m,d;
cin>>n>>d>>m;
vpl a(m);
rep(i,0,m-1)cin>>a[i].ff , a[i].ss=i;
sort(all(a));
//forp(x,y,a)cout<<x<<" "<<y<<"\n";
vvl tmp(n);
function<bool(ll)>check=[&](ll r)->bool{
tmp=vvl (n);
ll cnt=0;
rep(i,1,n){
rep(j,1,r){
if(a[cnt].ff>i)
break;
if(a[cnt].ff+d<i){
return 0;
}else{
tmp[i-1].em(a[cnt].ss);
cnt++;
}
if(cnt>=m)return 1;
}
}
return 0;
};
vvl v;
ll lo=1,hi=m+1;
while(lo<=hi){
ll mid= lo + (hi-lo)/2;
if(check(mid)){
hi=mid-1;
v=tmp;
}else{
lo=mid+1;
}
}
cout<<lo<<endl;
//vvl v(n+1);
rep(i,0,n-1){
for(auto &it:v[i]){
cout<<it+1<<" ";
}
cout<<0<<"\n";
}
}