Submission #265017

#TimeUsernameProblemLanguageResultExecution timeMemory
265017fadi57Job Scheduling (CEOI12_jobs)C++14
40 / 100
1089 ms632 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long using namespace std; const int mx=1000009; int sum[mx]; int ans[mx]; int main() { int n,d,m; cin>>n>>d>>m; for(int i=0;i<m;i++){ int x;cin>>x; sum[x]++; } //return 0; for(int i=1;i<=n;i++){ if(sum[i]){ multiset<pair<int,int>> q; for(int j=i;j<=i+d;j++){ q.insert({ans[j],j}); } while(sum[i]--){ auto o=q.begin(); int z=(*o).first; q.erase(q.find(*o)); ans[(*o).second]++; z++; q.insert({z,(*o).second}); } } }int anss=0; for(int i=1;i<=n;i++){ anss=max(ans[i],anss); } cout<<anss<<endl; for (int i = 0; i < n; i++) cout << "0\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...