# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
784903 | raphaelp | Job Scheduling (CEOI12_jobs) | C++14 | 156 ms | 10848 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;
bool pos(int nb, vector<int> &Jcount, int D)
{
int j = 0, b = 0;
for (int i = 0; i < Jcount.size(); i++)
{
if (i - j > D)
return false;
int a = nb;
while (a > 0 && j <= i)
{
if (a >= Jcount[j] - b)
{
a -= Jcount[j] - b;
j++;
b = 0;
}
else
{
b += a;
a = 0;
}
}
}
return true;
}
int dico(int left, int right, vector<int> &Jcount, int D)
{
int mil = (left + right) / 2;
if (mil == left)
if (pos(mil, Jcount, D))
return mil;
else
return mil + 1;
if (pos(mil, Jcount, D))
{
return dico(left, mil, Jcount, D);
}
else
return dico(mil, right, Jcount, D);
}
int main()
{
int N, D, M;
cin >> N >> D >> M;
vector<vector<int>> jobs(N);
vector<int> Jcount(N);
for (int i = 0; i < M; i++)
{
int temp;
cin >> temp;
Jcount[temp - 1]++;
jobs[temp - 1].push_back(i);
}
int nbMach = dico(1, M + 1, Jcount, D);
cout << nbMach << endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |