#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)
{
for (int64_t i = 0; i * k < m; i++)
{
if (i >= a[i * k].first + d || i >= n)
return false;
}
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;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
15 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 |
3164 KB |
Output isn't correct |
5 |
Incorrect |
12 ms |
3164 KB |
Output isn't correct |
6 |
Incorrect |
12 ms |
3164 KB |
Output isn't correct |
7 |
Incorrect |
12 ms |
3160 KB |
Output isn't correct |
8 |
Incorrect |
12 ms |
3164 KB |
Output isn't correct |
9 |
Correct |
23 ms |
3420 KB |
Output is correct |
10 |
Correct |
24 ms |
3420 KB |
Output is correct |
11 |
Correct |
18 ms |
3164 KB |
Output is correct |
12 |
Correct |
38 ms |
5980 KB |
Output is correct |
13 |
Correct |
65 ms |
8584 KB |
Output is correct |
14 |
Correct |
80 ms |
9304 KB |
Output is correct |
15 |
Incorrect |
95 ms |
12112 KB |
Output isn't correct |
16 |
Correct |
118 ms |
14976 KB |
Output is correct |
17 |
Correct |
143 ms |
17748 KB |
Output is correct |
18 |
Correct |
157 ms |
20360 KB |
Output is correct |
19 |
Correct |
189 ms |
21332 KB |
Output is correct |
20 |
Correct |
138 ms |
17744 KB |
Output is correct |