| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 655951 | rarex | Job Scheduling (CEOI12_jobs) | C++14 | 434 ms | 20836 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 <iostream>
#include <algorithm>
using namespace std;
const int nmax = 1e6 + 7;
long long n, m, d;
struct nr
{
long long x;
long long poz;
}v[nmax];
bool cmp(nr a, nr b)
{
return a.x < b.x;
}
long long solve(long long m)
{
long long ok = 1, i;
for(i=1; i<=n; i++)
if(i > (v[i].x + d) * m)
ok = 0;
return ok;
}
int main()
{
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||