# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
426304 | apotosaurus | Job Scheduling (CEOI12_jobs) | C++11 | 629 ms | 13780 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;
#define DEBUG false
#define cdbg if (!DEBUG) {} else cerr
#define INFILE "jobs.in"
#define OUTFILE "jobs.out"
int N,D,M;
vector<pair<int,int>> inpt;
void readInput(){
cin >> N >> D >> M;
inpt.resize(M);
for (int i = 0; i < M; i++){
cin >> inpt[i].first;
inpt[i].second = i+1;
}
sort(inpt.begin(), inpt.end());
}
bool works(int m){
int curDay = 1;
int curPerDay = 0;
for (int i = 0; i < M; i++){
if (inpt[i].first > curDay){
curDay = inpt[i].first;
curPerDay = 1;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |