# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
230748 | Ruxandra985 | Job Scheduling (CEOI12_jobs) | C++14 | 344 ms | 17144 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;
int d , n , m;
pair <int,int> v[1000010];
int check (int x , int type){
int today , days , put , i , sol = 0;
if (type)
printf ("%d\n",x);
today = 0;
days = 1;
for (i = 1 ; i <= n ; i++){
put = 0;
if (days >= v[i].first && today + 1 <= x){
today++;
sol = max(sol , days - v[i].first);
if (type == 1)
printf ("%d " ,v[i].second);
put = 1;
}
else if (today + 1 > x){
today = 0;
days++;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |