# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
673787 | Alihan_8 | Job Scheduling (CEOI12_jobs) | C++17 | 199 ms | 40532 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_equal<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(NULL);
int n, d, m; cin >> n >> d >> m;
vector <pair<int,int>> p(m);
int it = 0;
for ( auto &[i, itr]: p ) cin >> i, itr = it++;
vector <int> g[n+1];
for ( auto [l, r]: p ) g[l].pb(r+1);
auto ok = [&](int x){
vector <int> mp(n+1);
for ( auto [l, r]: p ) mp[l]++;
int cnt = 0;
for ( int day = 1; day+d <= n; day++ ){
cnt += mp[day];
cnt = max(0ll, cnt-x);
}
return !cnt;
};
int l = 0, r = m;
while ( l < r ){
int md = (l+r)>>1;
if ( !ok(md) ) l = md+1;
else r = md;
}
cout << l << ln;
queue <int> q;
for ( int day = 1; day <= n; day++ ){
for ( auto i: g[day] ) q.push(i);
int k = l;
while ( !q.empty() and k > 0 ){
cout << q.front() << ' ';
q.pop(); k--;
}
cout << "0\n";
}
cout << '\n';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |