#include <bits/stdc++.h>
using namespace std;
void quit() {
cout.flush();
exit(0);
}
long long n, d, m;
vector <pair<long long ,long long>> requests;
bool good(long long machines){
for(long long i = 0; i < m; i++){
if((i/machines+1)-requests[i].first>d){
return false;
}
}
return true;
}
int main(void){
//freopen("qwer.in", "r", stdin);
//freopen("qwer.out", "w", stdout);
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> d >> m;
requests.resize(m);
for(long long i = 0; i < m; i++){
cin >> requests[i].first;
requests[i].second = i+1;
}
sort(requests.begin(), requests.end());
long long s = 0, e = 1000000000;
while(s!=e){
long long mid = (s+e)/2;
if(good(mid)){
e=mid;
}
else{
s=mid+1;
}
}
cout << e << "\n";
long long num_left = n;
for(long long i = 0; i < m; i+=e){
for(long long j = i; j < min(m, i+e); j++){
cout << requests[j].second << " ";
}
num_left--;
cout << "0\n";
}
for(long long i = 0; i < num_left; i++){
cout << "0\n";
}
quit();
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
38 ms |
2756 KB |
Output isn't correct |
2 |
Incorrect |
38 ms |
2756 KB |
Output isn't correct |
3 |
Incorrect |
38 ms |
2788 KB |
Output isn't correct |
4 |
Incorrect |
38 ms |
2704 KB |
Output isn't correct |
5 |
Incorrect |
41 ms |
2696 KB |
Output isn't correct |
6 |
Incorrect |
38 ms |
2696 KB |
Output isn't correct |
7 |
Incorrect |
38 ms |
2684 KB |
Output isn't correct |
8 |
Incorrect |
39 ms |
2756 KB |
Output isn't correct |
9 |
Correct |
46 ms |
2884 KB |
Output is correct |
10 |
Correct |
48 ms |
2904 KB |
Output is correct |
11 |
Correct |
45 ms |
2756 KB |
Output is correct |
12 |
Correct |
92 ms |
5504 KB |
Output is correct |
13 |
Correct |
140 ms |
8120 KB |
Output is correct |
14 |
Correct |
193 ms |
11164 KB |
Output is correct |
15 |
Incorrect |
232 ms |
13376 KB |
Output isn't correct |
16 |
Correct |
292 ms |
16660 KB |
Output is correct |
17 |
Correct |
335 ms |
19396 KB |
Output is correct |
18 |
Correct |
383 ms |
21400 KB |
Output is correct |
19 |
Correct |
424 ms |
24188 KB |
Output is correct |
20 |
Correct |
339 ms |
19340 KB |
Output is correct |