| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 726268 | jnjwnwnw | Job Scheduling (CEOI12_jobs) | Java | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
import java.util.*;
import java.io.*;
public class jobs{
class Pairr{
int ind, v;
public Pairr(int index, int val){
this.ind = index;
this.v = val;
}
public int compareTo(Pair p){
return this.v - p.v;
}
}
public static void main(String[] args){
new jobs();
}
public jobs(){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int d = sc.nextInt();
int m = sc.nextInt();
Pair[] arr = new Pair[m];
for (int i = 0; i < m; i++) { arr[i] = new Pairr(i, sc.nextInt()); }
Arrays.sort(arr, (a, b) -> a.compareTo(b));
int ans = (int) Math.ceil(m/(double)(n-d));
System.out.println(ans);
int j = 0;
for(int i = 0; i < n; i++){
int end = Math.min(m, j + ans);
for(; j < end; j++){
if (arr[j].v > i+1){break;}
System.out.print(arr[j].ind + 1 + " ");
}
System.out.println(0);
}
}
}