Submission #480481

#TimeUsernameProblemLanguageResultExecution timeMemory
480481imaginary_unitJob Scheduling (CEOI12_jobs)C++17
0 / 100
339 ms21172 KiB
#include <bits/stdc++.h> #define ll long long #define fi first #define se second using namespace std; int n, d, m, a[1'000'000]; bool ok(int mch) { priority_queue<int> pq; for(int i=0; i<mch; i++){ pq.push(-1); } for(int i=0; i<m; i++){ int cur=pq.top(); pq.pop(); cur*= -1; if(a[i]-cur-1 > d){ return 0; } pq.push(-cur-1); } return 1; } int minMachines(int l, int r) { while(r-l>1){ int m=(l+r)/2; if(ok(m)){ r=m; } else{ l=m; } } return r; } int main() { //freopen("angry.in", "r", stdin); //freopen("angry.out", "w", stdout); scanf("%d %d %d", &n, &d, &m); for(int i=0; i<m; i++){ scanf("%d", &a[i]); } sort(a, a+m); int ans=minMachines(1, n); cout << ans << '\n'; vector<int> tasks[n]; priority_queue<pair<int, int> > pq; for(int i=0; i<ans; i++){ pq.push({-1, i}); } for(int i=0; i<m; i++){ pair<int, int> cur=pq.top(); /// {-1*day free, #} pq.pop(); tasks[cur.se].push_back(i+1); cur.fi--; pq.push(cur); } for(int i=0; i<n; i++){ for(int j=0; j<tasks[i].size(); j++){ cout << tasks[i][j] << ' '; } cout << 0 << '\n'; } return 0; }

Compilation message (stderr)

jobs.cpp: In function 'int main()':
jobs.cpp:66:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |         for(int j=0; j<tasks[i].size(); j++){
      |                      ~^~~~~~~~~~~~~~~~
jobs.cpp:46:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |     scanf("%d %d %d", &n, &d, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
jobs.cpp:48:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |         scanf("%d", &a[i]);
      |         ~~~~~^~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...