# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
741206 | bleu | Job Scheduling (CEOI12_jobs) | C++14 | 247 ms | 30064 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 <vector>
#define pb push_back
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, d, m;
cin >> n >> d >> m;
vector<vector<int>> J(n);
for(int i=0; i<m; i++) {
int c; cin >> c;
J[c-1].pb(i+1);
}
int lo=0, hi=m;
vector<vector<int>> A(n);
while(lo < hi) {
vector<vector<int>> S(n);
int mid = (lo + hi) / 2;
int t = 0;
bool works=true;
for(int i=0; i<n && works; i++) {
t=max(t,i);
for(auto j : J[i]) {
if(S[t].size()>=mid) t++;
S[t].pb(j);
}
if(t-i>d) works=false;
}
if(works) {hi = mid; A=S;}
else lo = mid+1;
}
cout << lo << "\n";
for(int i=0; i<n; i++) {
for(auto j : A[i]) cout << j << " ";
cout << "0" << "\n";
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |