# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
732183 | LKR__enjoyer | Job Scheduling (CEOI12_jobs) | C++17 | 372 ms | 22208 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<vector>
#include <iostream>
#include<algorithm>
#include<queue>
#include<map>
#include<bitset>
#include<set>
#include<cstdlib>
#define f first
#define sec second
#define pb push_back
typedef long long ll;
using namespace std;
int n,d,m;
vector<pair<int,int>> arr;
int zlicz[100005];
int zlicz2[100005];
bool spr(int x)
{ for(int i=1;i<=n-d;i++)zlicz2[i]=zlicz[i];
int curr=1;
for(int i=1;i<=n;i++)
{
if(i-curr>d)return 0;
int ile=0;
while(ile<x&&curr<=i)
{
int od=min(zlicz2[curr],x-ile); ile+=od;
zlicz2[curr]-=od; if(!zlicz2[curr])curr++;
}
if(curr>n-d)return 1;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |