# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1243582 | inkvizytor | Job Scheduling (CEOI12_jobs) | C++17 | 38 ms | 8004 KiB |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, d, m;
cin >> n >> d >> m;
vector<int> v (n+1, 0), sp (n+1, 0);
vector<vector<int>> c (n+1);
for (int i = 1; i < m+1; i++) {
int x;
cin >> x;
v[x]++;
c[x].push_back(i);
}
for (int i = 1; i <= n; i++) {
sp[i] = sp[i-1]+v[i];
}
int k = 0;
for (int i = 1; i <= n; i++) {
k = max(k, (sp[i]+i+d-1)/(i+d));
}
cout << k << '\n';
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |