topcoder/src/SurveillanceSystem.java at master · yuki2006/topcoder · GitHub

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
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
importjava.util.Arrays;
importjava.util.HashMap;

// Paste me into the FileEdit configuration dialog
// Single Round Match 581 - Round 1 500.0
/**
 * @author yuki
 *
 */
publicclassSurveillanceSystem {
publicStringgetContainerInfo(Stringcontainers, int[] reports, intL) {
intlength = containers.length();
// Containerをフォーカスしてる数を連想配列でまとめる
HashMap<Integer, Integer> map = newHashMap<Integer, Integer>();
for (intreport : reports) {
Integervalue = 0;
if (map.containsKey(report)) {
value = map.get(report);
 }
map.put(report, value + 1);
 }
// カメラをおいた時のフォーカスの数を求める配列。
int[] focusContainers = newint[length];
for (inti = 0; i <= length - L; i++) {
intcontainer = 0;
for (intj = 0; j < L; j++) {
if (i + j < length && containers.charAt(i + j) == 'X') {
container++;
 }
 }
focusContainers[i] = container;
 }
char[] c = newchar[length];
// 結果のchar配列をすべて – で初期化しておく。
Arrays.fill(c, '-');
for (Integerfocus : map.keySet()) {
int[] focuses = newint[length];
intm = map.get(focus);
// カメラのポジションの候補探す（候補がn 箇所）
intn = 0;
for (inti = 0; i <= length - L; i++) {
if (focusContainers[i] == focus) {
n++;
for (intj = 0; j < L; j++) {
focuses[i + j]++;
 }
 }
 }
for (inti = 0; i < focuses.length; i++) {
if (focuses[i] >= n - m + 1) {
// (n-m)+1個以上フォーカスされている時 その配列の場所は＋に書き換える。
c[i] = '+';
 } elseif (focuses[i] >= 1 && c[i] == '-') {
// 1個以上フォーカスされている時
// 配列のその場所が–のときは？に書き換える。
c[i] = '?';
 }
 }
 }
returnnewString(c);
	}

// BEGIN CUT HERE
publicstaticvoidmain(String[] args) {
if (args.length == 0) {
SurveillanceSystemHarness.run_test(-1);
 } else {
for (inti = 0; i < args.length; ++i)
SurveillanceSystemHarness.run_test(Integer.valueOf(args[i]));
 }
	}
// END CUT HERE
}

// BEGIN CUT HERE
classSurveillanceSystemHarness {
publicstaticvoidrun_test(intcasenum) {
if (casenum != -1) {
if (runTestCase(casenum) == -1)
System.err.println("Illegal input! Test case " + casenum + " does not exist.");
return;
 }

intcorrect = 0, total = 0;
for (inti = 0;; ++i) {
intx = runTestCase(i);
if (x == -1) {
if (i >= 100)
break;
continue;
 }
correct += x;
 ++total;
 }

if (total == 0) {
System.err.println("No test cases run.");
 } elseif (correct < total) {
System.err.println("Some cases FAILED (passed " + correct + " of " + total + ").");
 } else {
System.err.println("All " + total + " tests passed!");
 }
	}

staticbooleancompareOutput(Stringexpected, Stringresult) {
returnexpected.equals(result);
	}

staticStringformatResult(Stringres) {
returnString.format("\"%s\"", res);
	}

staticintverifyCase(intcasenum, Stringexpected, Stringreceived) {
System.err.print("Example " + casenum + "... ");
if (compareOutput(expected, received)) {
System.err.println("PASSED");
return1;
 } else {
System.err.println("FAILED");
System.err.println(" Expected: " + formatResult(expected));
System.err.println(" Received: " + formatResult(received));
return0;
 }
	}

staticintrunTestCase(intcasenum__) {
switch (casenum__) {
case0: {
Stringcontainers = "-X--XX";
int[] reports = { 1, 2 };
intL = 3;
Stringexpected__ = "??++++";

returnverifyCase(casenum__, expected__, newSurveillanceSystem().getContainerInfo(containers, reports, L));
 }
case1: {
Stringcontainers = "-XXXXX-";
int[] reports = { 2 };
intL = 3;
Stringexpected__ = "???-???";

returnverifyCase(casenum__, expected__, newSurveillanceSystem().getContainerInfo(containers, reports, L));
 }
case2: {
Stringcontainers = "------X-XX-";
int[] reports = { 3, 0, 2, 0 };
intL = 5;
Stringexpected__ = "++++++++++?";

returnverifyCase(casenum__, expected__, newSurveillanceSystem().getContainerInfo(containers, reports, L));
 }
case3: {
Stringcontainers = "-XXXXX---X--";
int[] reports = { 2, 1, 0, 1 };
intL = 3;
Stringexpected__ = "???-??++++??";

returnverifyCase(casenum__, expected__, newSurveillanceSystem().getContainerInfo(containers, reports, L));
 }
case4: {
Stringcontainers = "-XX--X-XX-X-X--X---XX-X---XXXX-----X";
int[] reports = { 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3 };
intL = 7;
Stringexpected__ = "???++++?++++++++++++++++++++??????--";

returnverifyCase(casenum__, expected__, newSurveillanceSystem().getContainerInfo(containers, reports, L));
 }

// custom cases

/*
 * case 5: {
 * String containers = ;
 * int[] reports = ;
 * int L = ;
 * String expected__ = ;
 *
 * return verifyCase(casenum__, expected__, new
 * SurveillanceSystem().getContainerInfo(containers, reports, L));
 * }
 */
/*
 * case 6: {
 * String containers = ;
 * int[] reports = ;
 * int L = ;
 * String expected__ = ;
 *
 * return verifyCase(casenum__, expected__, new
 * SurveillanceSystem().getContainerInfo(containers, reports, L));
 * }
 */
/*
 * case 7: {
 * String containers = ;
 * int[] reports = ;
 * int L = ;
 * String expected__ = ;
 *
 * return verifyCase(casenum__, expected__, new
 * SurveillanceSystem().getContainerInfo(containers, reports, L));
 * }
 */
default:
return -1;
 }
	}
}

// END CUT HERE