# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
416750 | winstonyin | Job Scheduling (CEOI12_jobs) | C++11 | 639 ms | 21036 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 <string>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cmath>
#include <array>
#include <map>
#include <set>
#include <fstream>
#include <unordered_map>
#include <queue>
using namespace std;
using pi = pair<int, int>;
using pd = pair<double, double>;
#define ll long long
#define all(x) (x).begin(), (x).end()
ll days, delay, requests;
vector<pair<ll,ll>> seq;
bool works(ll machines) {
if(days*machines < requests) {
return false;
}
ll cur_day = 0; ll cur_req = 0;
while(cur_day < days && cur_req < requests) {
for(ll j = 0; j < machines; j++) {
if(cur_req == requests) {
break;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |