# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
225792 | Andrei_Cotor | Job Scheduling (CEOI12_jobs) | C++11 | 331 ms | 27000 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<iostream>
#include<algorithm>
#include<deque>
#include<vector>
using namespace std;
vector<int> Jobs[100005];
vector<int> Rez[100005];
int Day[1000005];
int n,d;
bool possible(int capacity)
{
deque<int> Pending;
for(int i=1; i<=n; i++)
{
Rez[i].clear();
for(auto job:Jobs[i])
Pending.push_back(job);
for(int j=1; j<=capacity; j++)
{
if(Pending.empty())
break;
if(i-Day[Pending.front()]>d)
return 0;
Rez[i].push_back(Pending.front());
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |