# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
941488 | leshin | Job Scheduling (CEOI12_jobs) | C++17 | 246 ms | 18108 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>
#include <cmath>
using namespace std;
using ll = long long;
bool check(ll m, const vector<vector<ll>> &requests, ll N, ll D, ll M){
deque<ll> tasks;
for (ll i = 0; i < N; i++){
for (auto val: requests[i]){
tasks.push_back(i);
}
/*
for (auto val: tasks){
cout << val << " ";
} cout << endl;
*/
for (ll j = 0; j < m; j++){
if (tasks.empty()){
break;
} else {
if (tasks.front() + D < i){
//cout << "failed" << endl;
return false;
}
tasks.pop_front();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |