# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
62689 | eriksuenderhauf | Job Scheduling (CEOI12_jobs) | C++11 | 393 ms | 23008 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.
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define enl printf("\n")
#define ni(n) scanf("%d", &(n))
#define pri(n) printf("%d\n", (n))
#define pii pair<int, int>
#define vi vector<int>
#define pb push_back
#define fi first
#define se second
using namespace std;
const int INF = 1e9 + 7;
const int MAXN = 1e6 + 50;
pii a[MAXN];
vi ans[MAXN / 10];
int n, m, d;
bitset<MAXN> vis;
bool ok(int mi)
{
int r = 1;
for (int i = 1; i <= n; i++)
{
int tmp = min(m - r + 1, mi);
for (int j = 0; j < mi && j + r <= m; j++)
{
if (a[j + r].fi + d < i)
return false;
if (a[j + r].fi > i)
{
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |