#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++;
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
22 ms |
3160 KB |
Expected EOLN |
2 |
Incorrect |
22 ms |
3164 KB |
Expected EOLN |
3 |
Incorrect |
26 ms |
3332 KB |
Expected EOLN |
4 |
Incorrect |
22 ms |
3180 KB |
Expected EOLN |
5 |
Incorrect |
22 ms |
3164 KB |
Expected EOLN |
6 |
Incorrect |
22 ms |
3160 KB |
Expected EOLN |
7 |
Incorrect |
22 ms |
3164 KB |
Expected EOLN |
8 |
Incorrect |
22 ms |
3164 KB |
Expected EOLN |
9 |
Incorrect |
31 ms |
3096 KB |
Expected EOLN |
10 |
Incorrect |
28 ms |
3156 KB |
Expected EOLN |
11 |
Incorrect |
33 ms |
3156 KB |
Expected EOLN |
12 |
Incorrect |
63 ms |
3920 KB |
Expected EOLN |
13 |
Incorrect |
92 ms |
4712 KB |
Expected EOLN |
14 |
Incorrect |
53 ms |
2648 KB |
Output isn't correct |
15 |
Incorrect |
44 ms |
2648 KB |
Output isn't correct |
16 |
Incorrect |
51 ms |
2656 KB |
Output isn't correct |
17 |
Incorrect |
72 ms |
2652 KB |
Output isn't correct |
18 |
Incorrect |
44 ms |
2664 KB |
Output isn't correct |
19 |
Incorrect |
50 ms |
2660 KB |
Output isn't correct |
20 |
Incorrect |
57 ms |
2652 KB |
Output isn't correct |