# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
257207 | Lawliet | Job Scheduling (CEOI12_jobs) | C++17 | 207 ms | 13816 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 int lli;
const int MAXN = 100010;
const int MAXM = 1000010;
int n, m, d;
int sQtd[MAXN];
vector<int> day[MAXN];
bool test(lli k)
{
lli mn = 0;
for(int i = 1 ; i <= n ; i++)
{
lli curValue = sQtd[i] - k*i - k*d;
if( curValue > mn ) return false;
mn = min( mn , sQtd[i] - k*i );
}
return true;
}
int bs()
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |