# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
763188 | KN200711 | Job Scheduling (CEOI12_jobs) | C++14 | 215 ms | 17072 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>
using namespace std;
int arr[1000001];
vector<int> pos[100001];
int N, D, M;
bool cek(int a) {
deque<pair<int, int> > d;
d.clear();
for(int c=1;c<=N;c++) {
d.push_front(make_pair(pos[c].size(), c));
int V = a;
while(d.size() && d.back().first <= V) {
// if(a == 2) cout<<"V : "<<V<<endl;
V -= d.back().first;
d.pop_back();
}
if(d.size() && d.back().first > V) {
d.back().first -= V;
}
// if(a == 2) cout<<c<<" "<<d.size()<<" "<<d.back().second<<endl;
if(d.size() > 0 && d.back().second + D <= c) return 0;
}
return 1;
}
int main() {
scanf("%d %d %d", &N, &D, &M);
for(int i=0;i<M;i++) {
scanf("%d", &arr[i]);
pos[arr[i]].push_back(i);
}
int lf = 0, rg = 1e6, ans = -1;
// cout<<cek(2)<<endl;
while(lf <= rg) {
int mid = (lf + rg) / 2;
if(cek(mid)) {
ans = mid;
rg = mid - 1;
} else lf = mid + 1;
}
printf("%d\n", ans);
priority_queue< pair<int, int> > PQ;
for(int i=1;i<=N;i++) {
// cout<<i<<endl;
for(int k=0;k<pos[i].size();k++) {
PQ.push(make_pair(-i, pos[i][k]));
}
int V = ans;
while(PQ.size() && V) {
printf("%d ", PQ.top().second + 1);
PQ.pop();
V--;
}
printf("0\n");
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |