# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
439490 | sksusha8853 | Job Scheduling (CEOI12_jobs) | C++17 | 474 ms | 25804 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;
#define ll long long int
int mod=1000000007;
bool check(vector<int>&a,int n,int d,int m,int M){
vector<int>v1(n+1,0);
int z=n;
for(int i=m;i>=1;i--){
if(v1[z]==M){
z--;
}
z=min(z,a[i]+d);
if(z<a[i]){
return false;
}
else
v1[z]++;
}
return true;
}
void solve(){
int n,d,m;
cin>>n>>d>>m;
vector<int>a(m+1);
vector<pair<int,int>>b(m+1);
int x,y;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |