# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
54495 | Bruteforceman | Job Scheduling (CEOI12_jobs) | C++11 | 428 ms | 24348 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 pair <int, int> pii;
vector <int> g[100010];
int n, m, d;
int a[1000010];
bool good(int x) {
queue <int> Q;
for(int i = 1; i <= n; i++) {
for(auto j : g[i]) {
Q.push(j);
}
for(int j = 0; j < x && !Q.empty(); j++) {
int u = Q.front();
Q.pop();
if(i - a[u] > d) return false;
}
}
return Q.empty();
}
void print(int x) {
printf("%d\n", x);
queue <int> Q;
for(int i = 1; i <= n; i++) {
for(auto j : g[i]) {
Q.push(j);
}
for(int j = 0; j < x && !Q.empty(); j++) {
int u = Q.front();
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |