/
TamingTheHerd2.java
58 lines (57 loc) · 1.7 KB
/
TamingTheHerd2.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
import java.util.*;
import java.io.*;
public class TamingTheHerd2 {
public static void main(String[] args) throws IOException {
Scanner scan = new Scanner(new BufferedReader(new FileReader("taming.in")));
PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter("taming.out")));
int n = scan.nextInt();
int[] log = new int[n];
for (int i = 0; i < n; i++) {
log[i] = scan.nextInt();
}
if (log[0] != -1 && log[0] != 0) {
pw.println(-1);
scan.close();
pw.close();
return;
}
log[0] = 0;
for (int i = n - 2; i >= 0; i--) {
// list cases
// -1 2
// 2 3
// 1 3
// -1 -1
// 0 1 2 3 0
if (log[i] == -1 && log[i+1] != -1) {
log[i] = log[i+1] -1;
}
else if (log[i] != -1 && log[i+1] != -1) {
if (log[i] == log[i+1]-1) {
} else {
// add another if here
if (log[i+1] != 0) {
pw.println(-1);
pw.close();
scan.close();
return;
}
}
}
}
int minBreakout = 0;
int maxBreakout = 0;
for (int i = 0; i < n; i++) {
if (log[i] == 0) {
minBreakout++;
maxBreakout++;
}
else if (log[i] == -1) {
maxBreakout++;
}
}
pw.println(minBreakout + " " + maxBreakout);
scan.close();
pw.close();
}
}