# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
50311 | MatheusLealV | Job Scheduling (CEOI12_jobs) | C++17 | 423 ms | 43212 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>
#define N 100050
#define f first
#define s second
using namespace std;
typedef pair<int, int> pii;
int n, d, m, day[10*N];
vector<int> v[N], ans[N];
int atendido[N];
bool solve(int k)
{
queue<int> fila;
for(int dia = 1; dia <= n; dia ++)
{
for(auto x: v[dia]) fila.push(x);
int cnt = 0;
while(!fila.empty() and day[fila.front()] + d >= dia and cnt < k)
{
cnt ++;
fila.pop();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |