#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 = m;
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 |
30 ms |
2380 KB |
Output isn't correct |
2 |
Incorrect |
30 ms |
2400 KB |
Output isn't correct |
3 |
Incorrect |
31 ms |
2396 KB |
Output isn't correct |
4 |
Incorrect |
31 ms |
2400 KB |
Output isn't correct |
5 |
Incorrect |
31 ms |
2456 KB |
Output isn't correct |
6 |
Incorrect |
32 ms |
2508 KB |
Output isn't correct |
7 |
Incorrect |
31 ms |
2444 KB |
Output isn't correct |
8 |
Incorrect |
31 ms |
2396 KB |
Output isn't correct |
9 |
Correct |
40 ms |
2648 KB |
Output is correct |
10 |
Correct |
41 ms |
2628 KB |
Output is correct |
11 |
Correct |
38 ms |
2388 KB |
Output is correct |
12 |
Correct |
83 ms |
4644 KB |
Output is correct |
13 |
Correct |
120 ms |
6924 KB |
Output is correct |
14 |
Correct |
170 ms |
9252 KB |
Output is correct |
15 |
Incorrect |
203 ms |
11460 KB |
Output isn't correct |
16 |
Correct |
248 ms |
13816 KB |
Output is correct |
17 |
Correct |
308 ms |
16008 KB |
Output is correct |
18 |
Correct |
351 ms |
18372 KB |
Output is correct |
19 |
Correct |
383 ms |
20816 KB |
Output is correct |
20 |
Correct |
303 ms |
16068 KB |
Output is correct |