topcoder/src/SRMRoomAssignmentPhase.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
importjava.util.Arrays;

// Paste me into the FileEdit configuration dialog
// SRM 520 DIV 2 - 250.0
publicclassSRMRoomAssignmentPhase {
publicintcountCompetitors(int[] ratings, intK) {
intmyScore = ratings[0];
//まずソートする。
Arrays.sort(ratings);
// グループごとのスコアを計算
for (inti = 0; i < ratings.length; i++) {
// 配列の最後からi番目をみることでスコアが高い順にみてる
intlastIndex = ratings.length - i - 1;
// 自分の場所をみつけたらグループ内で何番目かを返す。
if (ratings[lastIndex] == myScore) {
returni / K;
 }
 }
return -1;
	}

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

// BEGIN CUT HERE
classSRMRoomAssignmentPhaseHarness {
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(intexpected, intresult) {
returnexpected == result;
	}

staticStringformatResult(intres) {
returnString.format("%d", res);
	}

staticintverifyCase(intcasenum, intexpected, intreceived) {
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: {
int[] ratings = { 491, 981, 1199, 763, 994, 879, 888 };
intK = 3;
intexpected__ = 2;

returnverifyCase(casenum__, expected__,
newSRMRoomAssignmentPhase().countCompetitors(ratings, K));
 }
case1: {
int[] ratings = { 1024, 1000, 600 };
intK = 1;
intexpected__ = 0;

returnverifyCase(casenum__, expected__,
newSRMRoomAssignmentPhase().countCompetitors(ratings, K));
 }
case2: {
int[] ratings = { 505, 679, 900, 1022 };
intK = 2;
intexpected__ = 1;

returnverifyCase(casenum__, expected__,
newSRMRoomAssignmentPhase().countCompetitors(ratings, K));
 }
case3: {
int[] ratings = { 716, 58, 1000, 1004, 912, 822, 453, 1100, 558 };
intK = 3;
intexpected__ = 1;

returnverifyCase(casenum__, expected__,
newSRMRoomAssignmentPhase().countCompetitors(ratings, K));
 }
case4: {
int[] ratings = { 422, 623, 1023, 941, 882, 776, 852, 495, 803,
622, 618, 532, 751, 500 };
intK = 4;
intexpected__ = 3;

returnverifyCase(casenum__, expected__,
newSRMRoomAssignmentPhase().countCompetitors(ratings, K));
 }
case5: {
int[] ratings = { 1197, 1198, 1196, 1195, 1199 };
intK = 1;
intexpected__ = 2;

returnverifyCase(casenum__, expected__,
newSRMRoomAssignmentPhase().countCompetitors(ratings, K));
 }

// custom cases

/*
 * case 6: { int[] ratings = ; int K = ; int expected__ = ;
 *
 * return verifyCase(casenum__, expected__, new
 * SRMRoomAssignmentPhase().countCompetitors(ratings, K)); }
 */
/*
 * case 7: { int[] ratings = ; int K = ; int expected__ = ;
 *
 * return verifyCase(casenum__, expected__, new
 * SRMRoomAssignmentPhase().countCompetitors(ratings, K)); }
 */
/*
 * case 8: { int[] ratings = ; int K = ; int expected__ = ;
 *
 * return verifyCase(casenum__, expected__, new
 * SRMRoomAssignmentPhase().countCompetitors(ratings, K)); }
 */
default:
return -1;
 }
	}
}

// END CUT HERE