import java.io.*;
import java.util.*;
import java.util.function.Predicate;
// https://oj.uz/problem/view/CEOI12_jobs
public class jobs {
static List<List<Job>> result;
public static void main(String[] args) throws IOException {
Kattio io = new Kattio();
// Kattio io = new Kattio("test");
int N = io.nextInt(), D = io.nextInt(), M = io.nextInt();
Job[] jobs = new Job[M];
for (int i = 0; i < M; ++i)
jobs[i] = new Job(i + 1, io.nextInt());
Arrays.sort(jobs, Comparator.comparingInt(j -> j.requestDay));
io.println(firstTrue(1, M, x -> can(x, N, D, jobs)));
for (int i = 0; i < N; ++i) {
if (i < result.size()) {
StringBuilder s = new StringBuilder();
for (Job job : result.get(i))
s.append(job.id + " ");
s.append("0");
io.println(s.toString());
} else
io.println("0");
}
io.close();
}
static boolean can(int maxMachine, int nDay, int nRunningDay, Job[] jobs) {
List<List<Job>> jobSchedule = new ArrayList<>();
List<Job> processingJobs = new LinkedList<>();
int today = 1, i = 0;
while (today <= nDay && i < jobs.length) {
if (processingJobs.size() > maxMachine)
return false;
else {
// remove finished jobs
while (processingJobs.size() > 0 && today - processingJobs.get(0).requestDay + 1 >= nRunningDay)
processingJobs.remove(0);
// add new jobs
while (processingJobs.size() < maxMachine && i < jobs.length && jobs[i].requestDay <= today)
processingJobs.add(jobs[i++]);
}
jobSchedule.add(new ArrayList<>(processingJobs));
today++;
}
boolean isValid = today <= nDay && i == jobs.length;
if (isValid)
result = jobSchedule;
return isValid;
}
static int firstTrue(int l, int r, Predicate<Integer> f) {
r++;
while (l < r) {
int m = l + (r - l) / 2;
if (f.test(m))
r = m;
else
l = m + 1;
}
return l;
}
static class Job {
int id, requestDay;
Job(int id, int day) {
this.id = id;
this.requestDay = day;
}
}
}
// 8 2 12
// 1 2 4 2 1 3 5 6 2 3 6 4
class Kattio extends PrintWriter {
BufferedReader r;
StringTokenizer st;
public Kattio() {
super(System.out);
r = new BufferedReader(new InputStreamReader(System.in));
}
public Kattio(String problemName) throws IOException {
super(problemName + ".out");
r = new BufferedReader(new FileReader(problemName + ".in"));
}
public String next() {
try {
while (st == null || !st.hasMoreTokens())
st = new StringTokenizer(r.readLine());
return st.nextToken();
} catch (Exception e) {
}
return null;
}
public int nextInt() {
return Integer.parseInt(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public long nextLong() {
return Long.parseLong(next());
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
517 ms |
29768 KB |
Output isn't correct |
2 |
Incorrect |
528 ms |
29904 KB |
Output isn't correct |
3 |
Incorrect |
525 ms |
29656 KB |
Output isn't correct |
4 |
Incorrect |
502 ms |
29684 KB |
Output isn't correct |
5 |
Incorrect |
521 ms |
27376 KB |
Output isn't correct |
6 |
Incorrect |
517 ms |
30216 KB |
Output isn't correct |
7 |
Incorrect |
498 ms |
29832 KB |
Output isn't correct |
8 |
Incorrect |
528 ms |
29836 KB |
Output isn't correct |
9 |
Execution timed out |
1056 ms |
34664 KB |
Time limit exceeded |
10 |
Execution timed out |
1062 ms |
34636 KB |
Time limit exceeded |
11 |
Execution timed out |
1060 ms |
43256 KB |
Time limit exceeded |
12 |
Execution timed out |
1059 ms |
40728 KB |
Time limit exceeded |
13 |
Execution timed out |
1059 ms |
31940 KB |
Time limit exceeded |
14 |
Execution timed out |
1067 ms |
56176 KB |
Time limit exceeded |
15 |
Execution timed out |
1068 ms |
43144 KB |
Time limit exceeded |
16 |
Execution timed out |
1070 ms |
50116 KB |
Time limit exceeded |
17 |
Execution timed out |
1060 ms |
51360 KB |
Time limit exceeded |
18 |
Execution timed out |
1076 ms |
51888 KB |
Time limit exceeded |
19 |
Execution timed out |
1053 ms |
61644 KB |
Time limit exceeded |
20 |
Execution timed out |
1074 ms |
53204 KB |
Time limit exceeded |