#include<bits/stdc++.h>
using namespace std;
vector<pair<int, int>> arr;
int n, m, d;
vector<vector<int>> day;
bool f(int mm){
int del = 0;
day.clear();
day.resize(n+1);
queue<int> mac;
for(int i=0;i<mm;i++) mac.push(1);
for(int i=0;i<m;i++){
int r = mac.front();
del = max(r - arr[i].first, del);
if(del > d) return false;
day[r].push_back(arr[i].second);
mac.pop();
mac.push(r+1);
}
return true;
}
int main(){
cin>>n>>d>>m;
arr.resize(m);
for(int i=0;i<m;i++){
arr[i].second = i;
cin>>arr[i].first;
}
sort(arr.begin(), arr.end());
int mm;
int r = m;
int l = 1;
int ans = -1;
while(r >= l){
mm = l + (r - l)/2;
if(f(mm)){
r = mm - 1;
ans = mm;
}
else{
l = mm + 1;
}
}
f(ans);
cout<<ans<<endl;
for(int i=1;i<n+1;i++){
for(auto t : day[i]) cout<<t+1<<" ";
cout<<"0\n";
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
34 ms |
2824 KB |
Output isn't correct |
2 |
Incorrect |
31 ms |
2568 KB |
Output isn't correct |
3 |
Incorrect |
29 ms |
2580 KB |
Output isn't correct |
4 |
Incorrect |
30 ms |
2692 KB |
Output isn't correct |
5 |
Incorrect |
30 ms |
2480 KB |
Output isn't correct |
6 |
Incorrect |
37 ms |
2952 KB |
Output isn't correct |
7 |
Incorrect |
30 ms |
2636 KB |
Output isn't correct |
8 |
Incorrect |
29 ms |
2700 KB |
Output isn't correct |
9 |
Correct |
41 ms |
4912 KB |
Output is correct |
10 |
Correct |
42 ms |
4744 KB |
Output is correct |
11 |
Correct |
38 ms |
2280 KB |
Output is correct |
12 |
Correct |
78 ms |
4644 KB |
Output is correct |
13 |
Correct |
120 ms |
6852 KB |
Output is correct |
14 |
Correct |
170 ms |
9148 KB |
Output is correct |
15 |
Incorrect |
194 ms |
9888 KB |
Output isn't correct |
16 |
Correct |
255 ms |
13916 KB |
Output is correct |
17 |
Correct |
312 ms |
16152 KB |
Output is correct |
18 |
Correct |
339 ms |
17944 KB |
Output is correct |
19 |
Correct |
359 ms |
20280 KB |
Output is correct |
20 |
Correct |
301 ms |
16152 KB |
Output is correct |