import java.io.*;
import java.util.*;
public class jobs {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
int n = Integer.parseInt(st.nextToken());
int d = Integer.parseInt(st.nextToken());
int m = Integer.parseInt(st.nextToken());
if (m <= 300000) {
// Use the ArrayList-based implementation for smaller cases
handleSmallCases(br, n, d, m);
} else {
// Use the provided large case code without any changes
handleLargeCases(new FastInputReader(System.in), n, d, m);
}
}
private static void handleSmallCases(BufferedReader br, int n, int d, int m) throws IOException {
List<Pair> a = new ArrayList<>(m + 2);
StringTokenizer st = new StringTokenizer(br.readLine());
for (int i = 1; i <= m; i++) {
a.add(new Pair(Integer.parseInt(st.nextToken()), i));
}
a.add(new Pair(1000000000, 0)); // Dummy pair for boundary
// Sort using built-in sort with natural order
a.sort(Comparator.naturalOrder());
int l = 0, r = m;
while (r - l > 1) {
int mid = (l + r) / 2;
int p = 0;
for (int i = 1; i <= n; i++) {
if (a.get(p).fr + d < i) {
break;
}
int cnt = 0;
while (cnt < mid && p < m && a.get(p).fr <= i) {
cnt++;
p++;
}
}
if (p >= m) {
r = mid;
} else {
l = mid;
}
}
System.out.println(r);
StringBuilder sb = new StringBuilder();
int p = 0;
for (int i = 1; i <= n; i++) {
int cnt = 0;
while (cnt < r && p < m && a.get(p).fr <= i) {
sb.append(a.get(p).sc).append(" ");
cnt++;
p++;
}
sb.append("0\n");
}
System.out.print(sb);
}
private static void handleLargeCases(FastInputReader reader, int n, int d, int m) throws IOException {
// Provided large case code, unchanged
int[] fr = new int[m + 1];
int[] sc = new int[m + 1];
for (int i = 1; i <= m; i++) {
fr[i] = reader.nextInt();
sc[i] = i;
}
// Sort `fr` and rearrange `sc` accordingly
quickSort(fr, sc, 1, m);
int l = 0, r = m;
// Binary search for the minimum value of `r`
while (r - l > 1) {
int mid = (l + r) / 2;
int p = 1;
for (int i = 1; i <= n; i++) {
if (p > m || fr[p] + d < i) break;
int cnt = 0;
while (cnt < mid && p <= m && fr[p] <= i) {
cnt++;
p++;
}
}
if (p > m) {
r = mid;
} else {
l = mid;
}
}
// Output results
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
bw.write(r + "\n");
int p = 1;
for (int i = 1; i <= n; i++) {
int cnt = 0;
while (cnt < r && p <= m && fr[p] <= i) {
bw.write(sc[p] + " ");
cnt++;
p++;
}
bw.write("0\n");
}
bw.flush();
}
// Custom quicksort to sort `fr` and rearrange `sc` accordingly
private static void quickSort(int[] fr, int[] sc, int low, int high) {
if (low < high) {
int pivotIndex = partition(fr, sc, low, high);
quickSort(fr, sc, low, pivotIndex - 1);
quickSort(fr, sc, pivotIndex + 1, high);
}
}
private static int partition(int[] fr, int[] sc, int low, int high) {
int pivot = fr[high];
int i = low - 1;
for (int j = low; j < high; j++) {
if (fr[j] <= pivot) {
i++;
swap(fr, sc, i, j);
}
}
swap(fr, sc, i + 1, high);
return i + 1;
}
private static void swap(int[] fr, int[] sc, int i, int j) {
int tempFr = fr[i];
fr[i] = fr[j];
fr[j] = tempFr;
int tempSc = sc[i];
sc[i] = sc[j];
sc[j] = tempSc;
}
static class FastInputReader {
private final DataInputStream din;
private final byte[] buffer;
private int bufferPointer, bytesRead;
public FastInputReader(InputStream in) {
din = new DataInputStream(in);
buffer = new byte[1 << 16]; // 64 KB buffer
bufferPointer = bytesRead = 0;
}
private byte read() throws IOException {
if (bufferPointer == bytesRead) {
bytesRead = din.read(buffer, 0, buffer.length);
bufferPointer = 0;
if (bytesRead == -1) return -1; // End of stream
}
return buffer[bufferPointer++];
}
public int nextInt() throws IOException {
int ret = 0;
byte c = read();
while (c <= ' ') c = read(); // Skip whitespace
boolean neg = (c == '-');
if (neg) c = read();
do {
ret = ret * 10 + c - '0';
} while ((c = read()) >= '0' && c <= '9');
if (neg) return -ret;
return ret;
}
}
static class Pair implements Comparable<Pair> {
int fr, sc;
Pair(int fr, int sc) {
this.fr = fr;
this.sc = sc;
}
@Override
public int compareTo(Pair other) {
return Integer.compare(this.fr, other.fr);
}
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
343 ms |
18860 KB |
Output is correct |
| 2 |
Correct |
359 ms |
19128 KB |
Output is correct |
| 3 |
Correct |
344 ms |
19052 KB |
Output is correct |
| 4 |
Correct |
339 ms |
19240 KB |
Output is correct |
| 5 |
Correct |
357 ms |
19152 KB |
Output is correct |
| 6 |
Correct |
355 ms |
18848 KB |
Output is correct |
| 7 |
Correct |
348 ms |
18932 KB |
Output is correct |
| 8 |
Correct |
338 ms |
19136 KB |
Output is correct |
| 9 |
Correct |
580 ms |
19488 KB |
Output is correct |
| 10 |
Correct |
463 ms |
19432 KB |
Output is correct |
| 11 |
Correct |
550 ms |
20828 KB |
Output is correct |
| 12 |
Correct |
499 ms |
25508 KB |
Output is correct |
| 13 |
Correct |
657 ms |
30504 KB |
Output is correct |
| 14 |
Partially correct |
354 ms |
20424 KB |
Partially correct |
| 15 |
Partially correct |
691 ms |
22152 KB |
Partially correct |
| 16 |
Partially correct |
395 ms |
23736 KB |
Partially correct |
| 17 |
Partially correct |
437 ms |
26332 KB |
Partially correct |
| 18 |
Partially correct |
942 ms |
28416 KB |
Partially correct |
| 19 |
Execution timed out |
1044 ms |
29552 KB |
Time limit exceeded |
| 20 |
Partially correct |
424 ms |
25776 KB |
Partially correct |
