-
Notifications
You must be signed in to change notification settings - Fork 6
/
Seonghun.java
70 lines (59 loc) · 1.82 KB
/
Seonghun.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.PriorityQueue;
import java.util.StringTokenizer;
class Lecture {
int num;
int begin;
int end;
Lecture(int num, int begin, int end) {
this.num = num;
this.begin = begin;
this.end = end;
}
}
public class Seonghun {
static int N; // 강의 개수
static Lecture[] lectures; // 강의 정보
static int[] room; // 각 강의에 배정된 강의실 번호 저장
static PriorityQueue<Lecture> inClass = new PriorityQueue<>((o1, o2) -> o1.end - o2.end);
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = null;
// initialize
N = Integer.parseInt(br.readLine());
lectures = new Lecture[N];
room = new int[N + 1];
for (int i = 0; i < N; i++) {
st = new StringTokenizer(br.readLine());
int num = Integer.parseInt(st.nextToken());
int begin = Integer.parseInt(st.nextToken());
int end = Integer.parseInt(st.nextToken());
lectures[i] = new Lecture(num, begin, end);
}
// 가장 빠른 강의부터 배정
Arrays.sort(lectures, (o1, o2) -> o1.begin - o2.begin);
inClass.add(lectures[0]);
room[lectures[0].num] = 1;
// 강의실 배정
for (int i = 1; i < N; i++) {
// 강의하려는데 남는 강의실이 없네?
if (lectures[i].begin < inClass.peek().end) {
inClass.add(lectures[i]);
room[lectures[i].num] = inClass.size(); // 강의실 늘려줭
}
// 그 강의실 다썼지?
else {
inClass.add(lectures[i]);
room[lectures[i].num] = room[inClass.poll().num]; // 강의할거니까 나와줄래?
}
}
// result
System.out.println(inClass.size());
for (int i = 1; i <= N; i++) {
System.out.println(room[i]);
}
}
}