# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
928062 | megaminion | Job Scheduling (CEOI12_jobs) | C++17 | 175 ms | 27248 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 pb push_back
#define ins insert
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
#define endl '\n'
using namespace std;
const int M = 1e6;
const int N = 1e5;
int n, d, m;
int a[M], mp[N+1];
vector<int> v[N+1];
vector<int> p[N+1];
bool ok(int x, bool flag)
{
bool ret = true;
deque<int> dq;
for(int i = 1; i <= n; ++i)
{
if(flag)
v[i].clear();
for(int j = 0; j < mp[i]; ++j)
{
dq.pb(i);
}
for(int j = 0; j < x; ++j)
{
if(dq.empty()) break;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |