# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
480679 | Olympia | Job Scheduling (CEOI12_jobs) | C++17 | 521 ms | 22856 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.
/*
* 8 2 12
1 2 4 2 1 3 5 6 2 3 6 4
*/
#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <map>
#include <queue>
using namespace std;
int N, D, M;
vector<vector<int>> myMap;
vector<int> days;
pair<bool, vector<vector<int>>> valid (int machines) {
queue<pair<int,int>> q;
vector<vector<int>> ans;
for (int i = 1; i <= N; i++) {
int k = machines;
ans.push_back((vector<int>){});
for (int j = 0; j < myMap[i].size(); j++) {
q.push({i, myMap[i][j]});
}
while(k--) {
if (q.empty()) {
break;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |