#include <iostream>
#include <algorithm>
#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 = 1, r = n;
while (l < r)
{
int64_t k = (l + r) / 2;
bool result = true;
for (int64_t i = 0; i * k < n; 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 |
12 ms |
3164 KB |
Output isn't correct |
2 |
Incorrect |
12 ms |
3208 KB |
Output isn't correct |
3 |
Incorrect |
12 ms |
3164 KB |
Output isn't correct |
4 |
Incorrect |
12 ms |
3264 KB |
Output isn't correct |
5 |
Incorrect |
12 ms |
3164 KB |
Output isn't correct |
6 |
Incorrect |
12 ms |
3276 KB |
Output isn't correct |
7 |
Incorrect |
12 ms |
3160 KB |
Output isn't correct |
8 |
Incorrect |
12 ms |
3276 KB |
Output isn't correct |
9 |
Incorrect |
20 ms |
3420 KB |
Output isn't correct |
10 |
Incorrect |
20 ms |
3420 KB |
Output isn't correct |
11 |
Incorrect |
16 ms |
2908 KB |
Output isn't correct |
12 |
Incorrect |
29 ms |
4736 KB |
Output isn't correct |
13 |
Incorrect |
47 ms |
7000 KB |
Output isn't correct |
14 |
Incorrect |
63 ms |
7284 KB |
Output isn't correct |
15 |
Incorrect |
82 ms |
10360 KB |
Output isn't correct |
16 |
Incorrect |
118 ms |
14716 KB |
Output isn't correct |
17 |
Incorrect |
125 ms |
15748 KB |
Output isn't correct |
18 |
Incorrect |
156 ms |
20304 KB |
Output isn't correct |
19 |
Incorrect |
183 ms |
21328 KB |
Output isn't correct |
20 |
Incorrect |
127 ms |
16000 KB |
Output isn't correct |