# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1000091 | codexistent | Job Scheduling (CEOI12_jobs) | C++14 | 354 ms | 14256 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;
#define FOR(i, a, b) for(int i = a; i <= b; i++)
#define MAXN 100005
int n, d, m, arr[MAXN], res = 0;
vector<pair<int, int>> req;
int main(){
cin >> n >> d >> m;
FOR(i, 1, n) arr[i] = 0;
FOR(i, 1, m){
int x; cin >> x;
arr[x]++;
req.push_back({x, i});
}
sort(req.begin(), req.end());
multiset<int> s; s.insert(0);
FOR(i, 1, 1 + d) s.insert(0);
FOR(i, 1, n){
res = max(res, *s.rbegin());
s.erase(s.find(*s.rbegin()));
FOR(j, 1, arr[i]){
int k = *s.begin();
s.erase(s.begin());
s.insert(k + 1);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |