| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1119538 | johu | Job Scheduling (CEOI12_jobs) | Java | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
import java.io.*;
import java.util.*;
public class Jobs {
public static void main(String[] args) throws IOException {
FastInputReader reader = new FastInputReader(System.in);
int n = reader.nextInt();
int d = reader.nextInt();
int m = reader.nextInt();
if (m <= 300000) {
handleSmallCases(reader, n, d, m);
} else {
handleLargeCases(reader, n, d, m);
}
}
private static void handleSmallCases(FastInputReader reader, int n, int d, int m) throws IOException {
List<Pair> a = new ArrayList<>();
for (int i = 1; i <= m; i++) {
a.add(new Pair(reader.nextInt(), i));
}
a.add(new Pair(1000000000, 0));
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 {
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;
}
quickSort(fr, sc, 1, m);
int l = 0, r = m;
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;
}
}
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();
}
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 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);
}
}
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];
bufferPointer = bytesRead = 0;
}
private void fillBuffer() throws IOException {
bytesRead = din.read(buffer, 0, buffer.length);
bufferPointer = 0;
if (bytesRead == -1) buffer[0] = -1;
}
public int nextInt() throws IOException {
int ret = 0;
byte c = skipToDigit();
boolean neg = (c == '-');
if (neg) c = read();
do {
ret = ret * 10 + c - '0';
} while ((c = read()) >= '0' && c <= '9');
return neg ? -ret : ret;
}
private byte skipToDigit() throws IOException {
byte c;
while ((c = read()) < '0' || c > '9') {
if (c == '-') return c;
}
return c;
}
private byte read() throws IOException {
if (bufferPointer == bytesRead) fillBuffer();
return buffer[bufferPointer++];
}
}
}