| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 744055 | vjudge1 | Job Scheduling (CEOI12_jobs) | C++17 | 28 ms | 2252 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;
using ll = long long ;
using pii = pair<ll , ll> ;
using i3 = tuple<ll , ll , ll> ;
const int N = 1e5+5 ;
const int MOD = 1e9+7 ;
ll n , d , m ;
pii S[N] ;
bool solve(ll mid){
ll day = 1 , cnt = 0 ;
for(int i=1;i<=m;i++){
if(day < S[i].first){
day = S[i].first ;
cnt = 0 ;
}
if(cnt == mid){
day++;
cnt = 0 ;
}
if(day > S[i].first + d){
return false ;
}
cnt++;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||