# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
708323 | Alihan_8 | Job Scheduling (CEOI12_jobs) | C++17 | 284 ms | 20984 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>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, D, m; cin >> n >> D >> m;
vector <pair<int,int>> p;
for ( int i = 0; i < m; i++ ){
int x; cin >> x;
p.pb({x, i});
}
sort(all(p));
auto ok = [&](int x){
int i = 0, j = 0;
for ( int day = 1; day <= n; day++ ){
int K = x; j = i;
while ( K > 0 and j < m and p[j].first <= day ){
if ( p[j].first+D < day ) return false;
j++; K--;
}
i = j;
}
return i == m;
};
int l = 1, r = 1e15;
while ( l < r ){
int md = (l+r) >> 1;
if ( ok(md) ) r = md;
else l = md+1;
}
cout << l << ln;
int i = 0, j = 0;
for ( int day = 1; day <= n; day++ ){
int K = l; j = i;
while ( j < m and K > 0 and p[j].first <= day ){
cout << p[j].second+1 << ' ';
j++; K--;
}
i = j;
cout << "0\n";
}
cout << '\n';
}
/*
8 2 12
1 2 4 2 1 3 5 6 2 3 6 4
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |