# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
98970 | figter001 | Job Scheduling (CEOI12_jobs) | C++14 | 403 ms | 17424 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;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int nax = 1e5+50;
vector<pair<int,int>> j;
vector<int> w;
int n,d,m;
queue<int> tmp;
bool can(int md){
queue<int> q = tmp;
int cur = 1,u = 0;
while(q.size()){
int v = q.front();
if(v - d > cur){
cur = v-d;
u = 0;
}
q.pop();
if(cur > v)return 0;
u++;
if(u == md){
u = 0;
cur++;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |