-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathGearsDiv2.java
167 lines (144 loc) · 3.73 KB
/
GearsDiv2.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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
import java.util.Arrays;
// Paste me into the FileEdit configuration dialog
// Single Round Match 589 - Round 1500.0
public class GearsDiv2 {
private char[] charArrays;
private int r(int p) {
return p % charArrays.length;
}
//アイデアの参考: http://snuke.hatenablog.com/entry/2013/08/27/214629
public int getmin(String Directions) {
int min = Integer.MAX_VALUE;
for (int j = 0; j < 2; j++) {
charArrays = Directions.toCharArray();
int count = 0;
//最初と最後の文字が同じときは空白にする
if (j == 1) {
charArrays[0] = 0;
count++;
}
for (int i = 0; i < charArrays.length; i++) {
if (charArrays[i] == charArrays[r(i + 1)] && charArrays[i] != 0) {
charArrays[r(i + 1)] = 0;
count++;
}
}
min = Math.min(count, min);
}
return min;
}
// BEGIN CUT HERE
public static void main(String[] args) {
if (args.length == 0) {
GearsDiv2Harness.run_test(-1);
} else {
for (int i = 0; i < args.length; ++i)
GearsDiv2Harness.run_test(Integer.valueOf(args[i]));
}
}
// END CUT HERE
}
// BEGIN CUT HERE
class GearsDiv2Harness {
public static void run_test(int casenum) {
if (casenum != -1) {
if (runTestCase(casenum) == -1)
System.err.println("Illegal input! Test case " + casenum
+ " does not exist.");
return;
}
int correct = 0, total = 0;
for (int i = 0;; ++i) {
int x = runTestCase(i);
if (x == -1) {
if (i >= 100)
break;
continue;
}
correct += x;
++total;
}
if (total == 0) {
System.err.println("No test cases run.");
} else if (correct < total) {
System.err.println("Some cases FAILED (passed " + correct + " of "
+ total + ").");
} else {
System.err.println("All " + total + " tests passed!");
}
}
static boolean compareOutput(int expected, int result) {
return expected == result;
}
static String formatResult(int res) {
return String.format("%d", res);
}
static int verifyCase(int casenum, int expected, int received) {
System.err.print("Example " + casenum + "... ");
if (compareOutput(expected, received)) {
System.err.println("PASSED");
return 1;
} else {
System.err.println("FAILED");
System.err.println(" Expected: " + formatResult(expected));
System.err.println(" Received: " + formatResult(received));
return 0;
}
}
static int runTestCase(int casenum__) {
switch (casenum__) {
case 0: {
String Directions = "LRRR";
int expected__ = 1;
return verifyCase(casenum__, expected__,
new GearsDiv2().getmin(Directions));
}
case 1: {
String Directions = "RRR";
int expected__ = 2;
return verifyCase(casenum__, expected__,
new GearsDiv2().getmin(Directions));
}
case 2: {
String Directions = "LRLR";
int expected__ = 0;
return verifyCase(casenum__, expected__,
new GearsDiv2().getmin(Directions));
}
case 3: {
String Directions = "LRLLRRLLLRRRLLLL";
int expected__ = 6;
return verifyCase(casenum__, expected__,
new GearsDiv2().getmin(Directions));
}
case 4: {
String Directions = "RRRRRRRLRRRRRRRLRLRLLRLRLRLRRLRLRLLLRLRLLRLLRRLRRR";
int expected__ = 14;
return verifyCase(casenum__, expected__,
new GearsDiv2().getmin(Directions));
}
// custom cases
case 5: {
String Directions = "RRLLRR";
int expected__ = 3;
return verifyCase(casenum__, expected__,
new GearsDiv2().getmin(Directions));
}
case 6: {
String Directions = "RRRRLLLRLLR";
int expected__ = 4;
return verifyCase(casenum__, expected__,
new GearsDiv2().getmin(Directions));
}
/*
* case 7: { String Directions = ; int expected__ = ;
*
* return verifyCase(casenum__, expected__, new
* GearsDiv2().getmin(Directions)); }
*/
default:
return -1;
}
}
}
// END CUT HERE