Codeforces Round 577 (Div. 2)

Solutions are presented as using the least memory and the fastest execution time. It also takes the top 10 most recent solutions from each language. If you want to limit to a specific index, click the "Solved" button and go to that problem.

ContestId
Name
Phase
Frozen
Duration (Seconds)
Relative Time
Start Time
1201 Codeforces Round 577 (Div. 2) FINISHED False 7200 172502687 Aug. 4, 2019, 4:35 p.m.

Problems

Solved$
Index
Name
Type
Tags
Community Tag
Rating
( 15880 ) A Important Exam PROGRAMMING implementation strings 900

B'A class of students wrote a multiple-choice test. There are n students in the class. The test had m questions, each of them had 5 possible answers (A, B, C, D or E). There is exactly one correct answer for each question. The correct answer for question i worth a_i points. Incorrect answers are graded with zero points. The students remember what answers they gave on the exam, but they don 't know what are the correct answers. They are very optimistic, so they want to know what is the maximum possible total score of all students in the class. The first line contains integers n and m ( 1 <= n, m <= 1000 ) -- the number of students in the class and the number of questions in the test. Each of the next n lines contains string s_i ( |s_i| = m ), describing an answer of the i -th student. The j -th character represents the student answer (A, B, C, D or E) on the j -th question. The last line contains m integers a_1, a_2, ldots, a_m ( 1 <= a_i <= 1000 ) -- the number of points for the correct answer for every question. Print a single integer -- the maximum possible total score of the class. In the first example, one of the most optimal test answers is "ABCD", this way the total number of points will be 16 . In the second example, one of the most optimal test answers is "CCC", this way each question will be answered by exactly one student and the total number of points is 5 + 4 + 12 = 21 . '...

Tutorials

Codeforces Round #577 (Div 2) Editorial

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
58287447 Artemy1337 A Aug. 4, 2019, 5:22 p.m. OK Delphi TESTS 34 46 1331200 900
58277333 ruban A Aug. 4, 2019, 4:53 p.m. OK Delphi TESTS 34 61 69324800 900
58275887 pavel-afonkin A Aug. 4, 2019, 4:50 p.m. OK Delphi TESTS 34 62 1331200 900
58290837 Nartov_dima A Aug. 4, 2019, 5:35 p.m. OK Delphi TESTS 34 62 5324800 900
58282732 PAG A Aug. 4, 2019, 5:07 p.m. OK FPC TESTS 34 46 1126400 900
58280586 romanporsh A Aug. 4, 2019, 5:01 p.m. OK FPC TESTS 34 46 1126400 900
58278691 Lord_Davros A Aug. 4, 2019, 4:56 p.m. OK FPC TESTS 34 46 1126400 900
58274678 Craspedacusta A Aug. 4, 2019, 4:47 p.m. OK FPC TESTS 34 46 1126400 900
58271194 LaSWeeG A Aug. 4, 2019, 4:40 p.m. OK FPC TESTS 34 46 1126400 900
58277751 ti19_btvan A Aug. 4, 2019, 4:54 p.m. OK FPC TESTS 34 46 1638400 900
58274540 naranja011223 A Aug. 4, 2019, 4:47 p.m. OK FPC TESTS 34 93 102400 900
58286329 Nickel_Angel A Aug. 4, 2019, 5:18 p.m. OK GNU C++11 TESTS 34 31 0 900
58279684 yizr_cnyali A Aug. 4, 2019, 4:59 p.m. OK GNU C++11 TESTS 34 31 0 900
58278321 amosji A Aug. 4, 2019, 4:56 p.m. OK GNU C++11 TESTS 34 31 0 900
58277998 _Teemo A Aug. 4, 2019, 4:55 p.m. OK GNU C++11 TESTS 34 31 0 900
58277301 johnson10024 A Aug. 4, 2019, 4:53 p.m. OK GNU C++11 TESTS 34 31 0 900
58277232 harlequen A Aug. 4, 2019, 4:53 p.m. OK GNU C++11 TESTS 34 31 0 900
58276900 _October_ A Aug. 4, 2019, 4:52 p.m. OK GNU C++11 TESTS 34 31 0 900
58276099 zzzmy A Aug. 4, 2019, 4:50 p.m. OK GNU C++11 TESTS 34 31 0 900
58275505 tamtr1998 A Aug. 4, 2019, 4:49 p.m. OK GNU C++11 TESTS 34 31 0 900
58275422 M_theory A Aug. 4, 2019, 4:49 p.m. OK GNU C++11 TESTS 34 31 0 900

remove filters

Back to search problems