# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97851 | RezwanArefin01 | Job Scheduling (CEOI12_jobs) | C++17 | 430 ms | 20296 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.
///usr/bin/g++ -O2 $0 -o ${0%.cpp} && echo "----------" && ./${0%.cpp}; exit;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 1e5 + 10;
vector<int> p[N], ans[N];
int n, d, m;
bool check(int x) {
for(int i = 1; i <= n; i++) ans[i].clear();
for(int i = 1, idx = 1; i <= n; idx = max(idx, ++i)) {
for(int id : p[i]) {
if(ans[idx].size() == x) ++idx;
if(idx > i + d) return 0;
ans[idx].push_back(id);
}
} return 1;
}
int main() {
scanf("%d %d %d", &n, &d, &m);
for(int i = 1; i <= m; i++) {
int x; scanf("%d", &x);
p[x].push_back(i);
}
int lo = 1, hi = m, idx;
while(lo <= hi) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |