# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
132242 | Atalasion | Job Scheduling (CEOI12_jobs) | C++14 | 946 ms | 21116 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 all(x) x.begin(), x.end()
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef pair<ll, ll> pll;
typedef string str;
const ll MOD = 1e9 + 7;
const ll N = 1e6 + 10;
const ll INF = 1e18;
ll n, d, m;
pll a[N];
bool isval(ll x){
queue <pll> q;
ll pnt = 1;
//cout << x << '\n';
for (int i = 1; i <= n; i++){
if (pnt != m + 1){
while ((pnt != m + 1) && (a[pnt].F == i)) q.push(a[pnt]), pnt ++;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |