#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdint>
using namespace std;
using Pair = pair<int64_t, int64_t>;
constexpr int64_t maxn = 1000000;
int64_t n, d, m;
Pair a[maxn];
int main()
{
ios_base::sync_with_stdio(false);
cin >> n >> d >> m;
for (int64_t i = 0; i < m; i++)
{
cin >> a[i].first;
a[i].second = i + 1;
}
sort(a, a + m);
int64_t l = ceil((float)m / (float)n), r = m;
while (l < r)
{
int64_t k = (l + r) / 2;
bool result = true;
for (int64_t i = 0; i * k < m; i++)
{
if (a[i * k].first + d <= i)
{
result = false;
break;
}
}
if (result)
r = k;
else
l = k + 1;
}
cout << l << '\n';
for (int64_t i = 0; i < n; i++)
{
for (int64_t j = i * l; j < min(m, (i + 1) * l); j++)
cout << a[j].second << ' ';
cout << "0\n";
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
20 ms |
3164 KB |
Output isn't correct |
2 |
Incorrect |
12 ms |
3264 KB |
Output isn't correct |
3 |
Incorrect |
13 ms |
3132 KB |
Output isn't correct |
4 |
Incorrect |
12 ms |
3160 KB |
Output isn't correct |
5 |
Incorrect |
11 ms |
3164 KB |
Output isn't correct |
6 |
Incorrect |
14 ms |
3164 KB |
Output isn't correct |
7 |
Incorrect |
12 ms |
3164 KB |
Output isn't correct |
8 |
Incorrect |
14 ms |
3120 KB |
Output isn't correct |
9 |
Correct |
20 ms |
3420 KB |
Output is correct |
10 |
Correct |
20 ms |
3420 KB |
Output is correct |
11 |
Correct |
22 ms |
3164 KB |
Output is correct |
12 |
Correct |
39 ms |
6016 KB |
Output is correct |
13 |
Correct |
57 ms |
8580 KB |
Output is correct |
14 |
Correct |
91 ms |
9412 KB |
Output is correct |
15 |
Incorrect |
108 ms |
12160 KB |
Output isn't correct |
16 |
Correct |
128 ms |
14940 KB |
Output is correct |
17 |
Correct |
154 ms |
17532 KB |
Output is correct |
18 |
Correct |
167 ms |
20356 KB |
Output is correct |
19 |
Correct |
185 ms |
21332 KB |
Output is correct |
20 |
Correct |
158 ms |
17536 KB |
Output is correct |