# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
521121 | it111 | Job Scheduling (CEOI12_jobs) | C++14 | 355 ms | 17320 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;
struct uzsakymas{
int diena;
int eilesNr;
int priimtas;
};
uzsakymas uzsakymai[1000005];
int n,d,m;
bool rikiavimas (uzsakymas a, uzsakymas b){
return a.diena<b.diena;
}
bool tinka(int dirba){
int dabarDiena = 1;
for(int i = 0; i<m; i++){
for(int j = 0; j<dirba; j++){
if(dabarDiena-uzsakymai[i].diena<0){
break;
}
if(dabarDiena-uzsakymai[i].diena>d){
return false;
}
uzsakymai[i].priimtas = dabarDiena;
i++;
if(i==m){
return true;
}
}
i--;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |