| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 375277 | YJU | Job Scheduling (CEOI12_jobs) | C++14 | 926 ms | 35180 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>
#pragma GCC optimize("unroll-loops,no-stack-protector,Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef long double ld;
const ll N=1e6+5;
const ll MOD=1e9+7;
const ld pi=acos(-1);
#define REP(i,n) for(int i=0;i<n;++i)
#define REP1(i,n) for(int i=1;i<=n;++i)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()
ll n,st[N],d,m,ans[N],lis[N];
ll que[N];
bool ck(ll k){
ll nl=0,nr=0;
for(int i=1,id=1;i<=n;i++){
while(id<=m&&st[lis[id]]==i)que[nr++]=(lis[id]),++id;
REP(j,k){
if(nr-nl==0)break;
ans[que[nl++]]=i;
}
if(nr-nl&&st[que[nl]]+d<=i)return 0;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||