# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
48456 | IvanC | Job Scheduling (CEOI12_jobs) | C++17 | 367 ms | 14060 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;
typedef pair<int,int> ii;
vector<ii> pares;
int N,D,M;
int checa(int X){
int disponivel = X;
int dia = 1;
for(int i = 0;i<M;i++){
if(disponivel == 0){
dia++;
disponivel = X;
}
while(dia < pares[i].first){
dia++;
disponivel = X;
}
if(pares[i].first + D < dia) return 0;
disponivel--;
}
return 1;
}
int main(){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |