Skip to content

Commit 99909cd

Browse files
authored
Merge pull request #366 from AlgorithmWithGod/lkhyun
[20250617] BOJ / P5 / 상남자 곽철용 / 이강현
2 parents 277cebb + 1654fdb commit 99909cd

File tree

1 file changed

+60
-0
lines changed

1 file changed

+60
-0
lines changed
Lines changed: 60 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,60 @@
1+
```java
2+
import java.io.*;
3+
import java.util.*;
4+
5+
public class Main {
6+
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
7+
static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
8+
static StringTokenizer st;
9+
static int N,M,K;
10+
static HashSet<Integer> chosen;
11+
static int cheolyoung;
12+
static int answer = 0;
13+
14+
public static void main(String[] args) throws IOException {
15+
st = new StringTokenizer(br.readLine());
16+
N = Integer.parseInt(st.nextToken());
17+
M = Integer.parseInt(st.nextToken());
18+
K = Integer.parseInt(st.nextToken());
19+
chosen = new HashSet<>();
20+
21+
for (int i = 0; i < M; i++) {
22+
st = new StringTokenizer(br.readLine());
23+
chosen.add(Integer.parseInt(st.nextToken()));
24+
chosen.add(Integer.parseInt(st.nextToken()));
25+
}
26+
st = new StringTokenizer(br.readLine());
27+
int a = Integer.parseInt(st.nextToken());
28+
int b = Integer.parseInt(st.nextToken());
29+
cheolyoung = Math.abs(a%K - b%K);
30+
31+
List<Integer> remainders = new ArrayList<>();
32+
for (int i = 1; i <= 4*N; i++) {
33+
if(!chosen.contains(i) && i != a && i != b) {
34+
remainders.add(i % K);
35+
}
36+
}
37+
Collections.sort(remainders);
38+
39+
int size = remainders.size();
40+
int mid = size / 2;
41+
int left = 0;
42+
int right = mid;
43+
44+
while (left < mid && right < size) {
45+
int diff = remainders.get(right) - remainders.get(left);
46+
47+
if (diff > cheolyoung) {
48+
answer++;
49+
left++;
50+
right++;
51+
} else {
52+
right++;
53+
}
54+
}
55+
56+
bw.write(Math.min(answer, M - 1) + "\n");
57+
bw.close();
58+
}
59+
}
60+
```

0 commit comments

Comments
 (0)