#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];
bool Check(int64_t k)
{
int64_t current = 0;
for (int64_t i = 1; i <= n; i++)
{
if (current >= m)
return true;
if (a[current].first + d < i)
return false;
for (int64_t j = 0; j < k && a[current].first <= i; j++)
current++;
}
return true;
}
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 = 1, r = m;
while (l < r)
{
int64_t k = (l + r) / 2;
if (Check(k))
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;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
13 ms |
3164 KB |
Output is correct |
2 |
Correct |
17 ms |
3208 KB |
Output is correct |
3 |
Correct |
13 ms |
3160 KB |
Output is correct |
4 |
Correct |
14 ms |
3164 KB |
Output is correct |
5 |
Correct |
15 ms |
3164 KB |
Output is correct |
6 |
Correct |
13 ms |
3164 KB |
Output is correct |
7 |
Correct |
13 ms |
3164 KB |
Output is correct |
8 |
Correct |
13 ms |
3164 KB |
Output is correct |
9 |
Correct |
21 ms |
3420 KB |
Output is correct |
10 |
Correct |
21 ms |
3408 KB |
Output is correct |
11 |
Correct |
20 ms |
3208 KB |
Output is correct |
12 |
Correct |
41 ms |
5832 KB |
Output is correct |
13 |
Correct |
61 ms |
8532 KB |
Output is correct |
14 |
Correct |
86 ms |
9332 KB |
Output is correct |
15 |
Correct |
106 ms |
12208 KB |
Output is correct |
16 |
Correct |
128 ms |
14980 KB |
Output is correct |
17 |
Correct |
152 ms |
17748 KB |
Output is correct |
18 |
Correct |
170 ms |
20456 KB |
Output is correct |
19 |
Correct |
193 ms |
21380 KB |
Output is correct |
20 |
Correct |
155 ms |
17776 KB |
Output is correct |