#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
ll N, D, M;
pair<ll, ll> A[100007];
void initialize() {
ios_base :: sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> N >> D >> M;
for(int i = 1; i <= M; ++i) {
cin >> A[i].first;
A[i].second = i;
}
sort(A + 1, A + 1 + M);
}
bool check(ll MachinesCnt) {
int idx = 1;
for(int day = 1; day <= N; ++day) {
ll used_machines_in_day = 0;
while(idx <= M && used_machines_in_day < MachinesCnt) {
if (A[idx].first + D < day) return 0;
if (day < A[idx].first) break;
used_machines_in_day++;
idx++;
}
}
return idx > M;
}
void construct(ll MachinesCnt) {
int idx = 1;
for(int day = 1; day <= N; ++day) {
ll used_machines_in_day = 0;
while(idx <= M && used_machines_in_day < MachinesCnt) {
if (day < A[idx].first) break;
cout << A[idx].second << " ";
used_machines_in_day++;
idx++;
}
cout << 0 << endl;
}
}
void process() {
ll l = 1, r = 1e9;
while(l < r) {
ll mid = (l + r) / 2;
if (check(mid)) r = mid;
else l = mid + 1;
}
cout << l << endl;
construct(l);
}
int main() {
initialize();
process();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
2392 KB |
Output is correct |
2 |
Correct |
15 ms |
2408 KB |
Output is correct |
3 |
Correct |
16 ms |
2396 KB |
Output is correct |
4 |
Correct |
16 ms |
2396 KB |
Output is correct |
5 |
Correct |
15 ms |
2396 KB |
Output is correct |
6 |
Correct |
15 ms |
2396 KB |
Output is correct |
7 |
Correct |
16 ms |
2392 KB |
Output is correct |
8 |
Correct |
15 ms |
2396 KB |
Output is correct |
9 |
Correct |
28 ms |
2640 KB |
Output is correct |
10 |
Correct |
28 ms |
2648 KB |
Output is correct |
11 |
Correct |
22 ms |
2384 KB |
Output is correct |
12 |
Incorrect |
5 ms |
1880 KB |
Output isn't correct |
13 |
Incorrect |
6 ms |
1884 KB |
Output isn't correct |
14 |
Incorrect |
8 ms |
1884 KB |
Output isn't correct |
15 |
Incorrect |
6 ms |
1884 KB |
Output isn't correct |
16 |
Incorrect |
7 ms |
1880 KB |
Output isn't correct |
17 |
Incorrect |
9 ms |
1884 KB |
Output isn't correct |
18 |
Incorrect |
6 ms |
1880 KB |
Output isn't correct |
19 |
Incorrect |
16 ms |
2140 KB |
Output isn't correct |
20 |
Incorrect |
10 ms |
2084 KB |
Output isn't correct |