Submission #4705630
Source Code Expand
# -*- coding: utf-8 -*- import numpy as np N = int(input()) S = [] for i in range(N): S.append(input()) Sn = [1] * N for i in range(N): if S[i] != '': for j in range(1, N-i): if S[i] == S[i+j]: Sn[i] += 1 S[i+j] = '' print(S[np.argmax(Sn)])
Submission Info
Submission Time | |
---|---|
Task | B - 投票 |
User | fukujusohko |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 315 Byte |
Status | AC |
Exec Time | 151 ms |
Memory | 14288 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, case_01.txt, case_02.txt, case_03.txt, case_04.txt, case_05.txt, case_06.txt, case_07.txt, case_08.txt, case_09.txt, case_10.txt, case_11.txt, case_12.txt, case_13.txt, case_14.txt, case_15.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
case_01.txt | AC | 150 ms | 14288 KB |
case_02.txt | AC | 151 ms | 12240 KB |
case_03.txt | AC | 149 ms | 12396 KB |
case_04.txt | AC | 149 ms | 12396 KB |
case_05.txt | AC | 148 ms | 12396 KB |
case_06.txt | AC | 149 ms | 12396 KB |
case_07.txt | AC | 148 ms | 12396 KB |
case_08.txt | AC | 149 ms | 12240 KB |
case_09.txt | AC | 149 ms | 12396 KB |
case_10.txt | AC | 149 ms | 12396 KB |
case_11.txt | AC | 149 ms | 12396 KB |
case_12.txt | AC | 149 ms | 12396 KB |
case_13.txt | AC | 150 ms | 12392 KB |
case_14.txt | AC | 149 ms | 12240 KB |
case_15.txt | AC | 149 ms | 12396 KB |
sample_01.txt | AC | 149 ms | 12240 KB |
sample_02.txt | AC | 149 ms | 12396 KB |
sample_03.txt | AC | 150 ms | 12396 KB |