# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
415376 | HadiHosseini | Job Scheduling (CEOI12_jobs) | C++14 | 356 ms | 21324 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;
void show(long long cur, vector<pair<int, int>> v, int n, int d, int m) {
int j = 0;
for(int day = 1 ; day <= n ; day++){
long long rev = cur;
while(j < m && rev && v[j].first <= day){
if(v[j].first <= day + d){
cout << v[j].second << " ";
rev--;
j++;
}
}
cout << "0\n";
}
}
bool f(long long cur, vector<pair<int, int>> v, int n, int d, int m) {
int j = 0;
for(int day = 1 ; day <= n ; day++){
long long rev = cur;
while(j < m && rev && v[j].first <= day){
if(v[j].first <= day + d && v[j].first >= day - d){
rev--;
j++;
}
else {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |