Submission #858420

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
858420	2023-10-08T13:20:19 Z	ilef	Job Scheduling (CEOI12_jobs)	C++14	0 / 100	98 ms	4592 KB

jobs

#include <bits/stdc++.h>
using namespace std;
const int M=3e5+12;
int n,d,m;
 pair<int,int>a[M];
bool good(int num) {
     int i=0;
     int day=1;
     int cnt=0;
     while(i<m){
         if(cnt==num){
             cnt=0;
             day++;
         }
         if(a[i].first>day){
             day=a[i].first;
         }
         if(a[i].first+d<day){
             return false;
         }
         i++;
         cnt++;
     }
     return true;
}

int main() {
	cin>>n>>d>>m;
   
	for(int i=0;i<m;i++){
	    cin>>a[i].first;
	    a[i].second=i;
	}
	sort(a,a+m);
	int l=0;
	int r=m;
	while(l+1<r){
	    int mid=(l+r)/2;
	    if(good(mid)){
	        r=mid;
	    }
	    else{
	        l=mid;
	    }
	}
	int cnt=0;
	cout<<r<<endl;
	for(int i=0;i<m;i++){
	    if(cnt==r){
	        cout<<0<<" "<<endl;
	        cnt=0;
	    }
	    cout<<a[i].second+1<<" ";
	    cnt++;
	}
	cout<<endl;
	cout<<0<<endl;
	return 0;
}

Subtask #1

0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	29 ms	3092 KB	Expected EOLN
2	Incorrect	24 ms	3164 KB	Expected EOLN
3	Incorrect	23 ms	3152 KB	Expected EOLN
4	Incorrect	24 ms	3152 KB	Expected EOLN
5	Incorrect	23 ms	3164 KB	Expected EOLN
6	Incorrect	23 ms	3180 KB	Expected EOLN
7	Incorrect	23 ms	3224 KB	Expected EOLN
8	Incorrect	23 ms	3164 KB	Expected EOLN
9	Incorrect	31 ms	3164 KB	Expected EOLN
10	Incorrect	30 ms	3164 KB	Expected EOLN
11	Incorrect	34 ms	3152 KB	Expected EOLN
12	Incorrect	65 ms	3924 KB	Expected EOLN
13	Incorrect	98 ms	4592 KB	Expected EOLN
14	Incorrect	62 ms	2656 KB	Output isn't correct
15	Incorrect	43 ms	2652 KB	Output isn't correct
16	Incorrect	51 ms	2656 KB	Output isn't correct
17	Incorrect	56 ms	2652 KB	Output isn't correct
18	Incorrect	44 ms	2648 KB	Output isn't correct
19	Incorrect	47 ms	2652 KB	Output isn't correct
20	Incorrect	56 ms	2852 KB	Output isn't correct