UV problem solution: 10258-contest scoreboard

Understanding the problem specification is the very key to solve it:
1)... penalty time is computed... submission specified ed prior to the correct solution:
So if the AC submission (c) is before any other submission, you can ignore the later submissions to count penalty stuffs.
2)... lines of input are In the orderIn which submissions were inclued:
So for the input

1 1 10 C

1 1 10 I

You shoshould not count penalty... while

1 1 10 I

1 1 10 C

You shoshould count penalty.

Code:

1. /*************************************** **********************************
2. * Copyright (c) 2008 by liukaipeng *
3. * Liukaipeng at gmail dot com *
4. **************************************** *********************************/
6. /* @ Judge_id 00000 10258 C ++ "contest scoreboard "*/
8. # Include <algorithm>
9. # Include <iostream>
10. # Include <iterator>
11. # Include <limits>
12. # Include <string>
13. # Include <sstream>
14. # Include <vector>
16. Using namespace STD;
18. Struct submission
19. {
20. Int contestant;
21. Int problem;
22. Int time;
23. Char status;
24. };
26. Bool operator> (istream & is, submission & SBM)
27. {
28. String line;
29. Getline (is, line );
30. If (! Line. Empty ()){
31. Stringstream SS;
32. SS <line;
33. SS> SBM. contestant
34. > SBM. Problem
35. > SBM. Time
36. > SBM. status;
37. Return true;
38. } Else {
39. Return false;
40. }
41. }
43. Struct submissioncmp
44. {
45. Bool operator () (submission const & S1, submission const & S2)
46. {
47. Return s1.contestant <s2.contestant? True:
48. S1.contestant> s2.contestant? False:
49. S1.problem <s2.problem? True:
50. S1.problem> s2.problem? False:
51. S1.time <s2.time;
52. }
53. };
55. Struct score
56. {
57. Int contestant;
58. Int solved;
59. Int penalty;
60. };
62. Void operator <(ostream & OS, score const & SCR)
63. {
64. Cout <SCR. Contestant <''
65. <SCR. Solved <''
66. <SCR. Penalty <'/N ';
67. }
69. Struct scorecmp
70. {
71. Bool operator () (score const & S1, score const & S2)
72. {
73. Return s1.solved> s2.solved? True:
74. S1.solved <s2.solved? False:
75. S1.penalty <s2.penalty? True:
76. S1.penalty> s2.penalty? False:
77. S1.contestant <s2.contestant;
78. }
79. };
81. Void compute_scores (vector <submission> & submissions,
82. Vector <score> & scores)
83. {
84. Stable_sort (submissions. Begin (), submissions. End (), submissioncmp ());
85. For (INT I = 0, size = submissions. Size (); I <size ;){
86. Score scr = {submissions [I]. contestant, 0, 0 };
87. For (; I <size & SCR. Contestant = submissions [I]. Contestant ;){
88. Int problem = submissions [I]. problem;
89. Int penalty = 0;
90. Bool solved = false;
91. For (; I <size & SCR. Contestant = submissions [I]. Contestant &&
92. Problem = submissions [I]. problem; ++ I ){
93. Char status = submissions [I]. status;
94. If (! Solved ){
95. If (status = 'C '){
96. Solved = true;
97. Penalty + = submissions [I]. time;
98. } Else if (status = 'I '){
99. Penalty + = 20;
100. }
101. }
102. }
103. If (solved ){
104. SCR. Solved + = 1;
105. SCR. Penalty + = penalty;
106. }
107. }
108. Scores. push_back (SCR );
109. }
110. Sort (scores. Begin (), scores. End (), scorecmp ());
111. }
113. Int main (INT argc, char * argv [])
114. {
115. # Ifndef online_judge
116. String name = argv [0];
117. Freopen (name + ". In"). c_str (), "r", stdin );
118. Freopen (name + ". Out"). c_str (), "W", stdout );
119. # Endif
121. Int ncases;
122. Cin> ncases;
123. Cin. Ignore (numeric_limits <streamsize>: max (), '/N ');
124. Cin. Ignore (numeric_limits <streamsize>: max (), '/N ');
125. While (ncases --> 0 ){
126. Submission SBM;
127. Vector <submission> submissions;
128. While (CIN> SBM) submissions. push_back (SBM );
130. Vector <score> scores;
131. Compute_scores (submissions, scores );
133. Copy (scores. Begin (), scores. End (), ostream_iterator <score> (cout ));
134. If (ncases> 0) cout <'/N ';
135. }
137. Return 0;
138. }
139.