-
Notifications
You must be signed in to change notification settings - Fork 34
/
Copy pathC.java
66 lines (59 loc) · 2.04 KB
/
C.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
import java.io.PrintStream;
import java.util.*;
import java.util.stream.Collectors;
/**
* Codejam 2012 Round 1B
* Problem C. Equal Sums
*/
public class Main {
private String solve(Scanner scanner) {
int n=scanner.nextInt();
long[] val=new long[n];
for (int i=0;i<n;i++) val[i]=scanner.nextLong();
Arrays.sort(val);
HashMap<Long, String> map=new HashMap<>();
Random random=new Random();
for (int i=0;i<30000000;i++) {
long[] next=generate(random, n, val);
String s=String.join(" ",
Arrays.stream(next).boxed().map(String::valueOf).collect(Collectors.toList()));
long sum=Arrays.stream(next).sum();
if (!s.equals(map.getOrDefault(sum, s)))
return "\n"+s+"\n"+map.get(sum);
map.put(sum, s);
}
return "Impossible";
}
private long[] generate(Random random, int n, long[] val) {
while (true) {
long[] x=new long[6];
for (int i=0;i<6;i++) x[i]=val[random.nextInt(n)];
Arrays.sort(x);
boolean able=true;
for (int i=0;i<6;i++)
for (int j=i+1;j<6;j++)
if (x[i]==x[j]) {
able=false;
break;
}
if (able) return x;
}
}
public static void main(String[] args) throws Exception {
System.setOut(new PrintStream("output.txt"));
Scanner scanner=new Scanner(System.in);
int times=scanner.nextInt();
long start=System.currentTimeMillis();
for (int t=1;t<=times;t++) {
try {
System.out.println(String.format("Case #%d: %s", t, new Main().solve(scanner)));
}
catch (Throwable e) {
System.err.println("ERROR in case #"+t);
e.printStackTrace();
}
}
long end=System.currentTimeMillis();
System.err.println(String.format("Time used: %.3fs", (end-start)/1000.0));
}
}