-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathMUHImportantThings.java
72 lines (70 loc) · 2.31 KB
/
MUHImportantThings.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
71
72
/** https://codeforces.com/problemset/problem/471/B #sorting */
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Scanner;
class MUHImportantThings {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
HashMap<Integer, ArrayList<Integer>> hashMap = new HashMap<>();
int key;
int sameDifficultycount = 0;
for (int i = 1; i < n + 1; i++) {
key = sc.nextInt();
if (!hashMap.containsKey(key)) {
hashMap.put(key, new ArrayList<Integer>());
} else {
sameDifficultycount++;
}
hashMap.get(key).add(i);
}
if (sameDifficultycount <= 1) {
System.out.println("NO");
} else {
System.out.println("YES");
int selectedKey = -1;
int selectedPos = -1;
for (int i = 0; i < 3; i++) {
for (int keyMap : hashMap.keySet()) {
if (hashMap.get(keyMap).size() > 1) {
if (selectedKey == keyMap) {
if (selectedPos >= hashMap.get(keyMap).size() - 1) {
selectedPos = 0;
selectedKey = -1;
for (int val : hashMap.get(keyMap)) {
System.out.print(val + " ");
}
} else {
selectedPos++;
System.out.print(hashMap.get(keyMap).get(selectedPos) + " ");
for (int k = 0; k < hashMap.get(keyMap).size(); k++) {
if (k != selectedPos) {
System.out.print(hashMap.get(keyMap).get(k) + " ");
}
}
}
} else {
if (selectedKey == -1) {
selectedKey = keyMap;
selectedPos++;
System.out.print(hashMap.get(keyMap).get(selectedPos) + " ");
for (int k = 0; k < hashMap.get(keyMap).size(); k++) {
if (k != selectedPos) {
System.out.print(hashMap.get(keyMap).get(k) + " ");
}
}
} else {
for (int val : hashMap.get(keyMap)) {
System.out.print(val + " ");
}
}
}
} else {
System.out.print(hashMap.get(keyMap).get(0) + " ");
}
}
System.out.println();
}
}
}
}