| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 869811 | amirhoseinfar1385 | Job Scheduling (CEOI12_jobs) | C++17 | 147 ms | 7260 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;
int n,d,m;
vector<pair<int,int>>all;
bool check(int mid){
int ret=1,now=0;
for(int i=0;i<m;i++){
if(all[i].first>ret){
ret++;
now=0;
continue;
}
if(ret>all[i].first+d){
return 0;
}
now++;
if(now==mid){
ret++;
now=0;
}
}
return 1;
}
void co(int mid){
int ret=1,now=0;
vector<vector<int>>mainres(n+1);
for(int i=0;i<m;i++){
if(all[i].first>ret){
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||