# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1162296 | PikachudoraEHE | Job Scheduling (CEOI12_jobs) | C++20 | 1094 ms | 23484 KiB |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e6+5;
int mem[N];vector<int>a;int n,d,m,ma2=0;
bool chk(int vv){
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> q;
for(int i=1;i<=m;i++){
q.push({a[i-1],i});
}
for(int i=1;i<=n;i++){
int dd=0;
if(q.top().first<i-d)return false;
while(!q.empty() && q.top().first<=i && dd<vv){
q.pop();
dd++;
}
}
if(!q.empty())return false;
return true;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
cin>>n>>d>>m;int ma = 0;
a.resize(m);
for(int i=0;i<m;i++){
cin>>a[i];
mem[a[i]]++;
ma=max(ma,mem[a[i]]);
ma2=max(ma2,a[i]);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |