QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#567205 | #9320. Find the Easiest Problem | mikrokosmos | WA | 13ms | 10608kb | Python3 | 532b | 2024-09-16 10:00:50 | 2024-09-16 10:00:50 |
Judging History
answer
for _ in range(int(input())):
ans = {}
for _ in range(int(input())):
s = list(input().split())
if s[2] == "accepted":
if not s[1] in ans:
ans[s[1]] = [1,{s[0]}]
else:
if not s[0] in ans[s[1]][1]:
ans[s[1]][1].add(s[0])
ans[s[1]][0] += 1
k = sorted(ans.keys(),key=lambda x: ans[x][0], reverse=True)
t = [x for x in k if ans[x][0] == ans[k[0]][0]]
t.sort()
print(t)
print(t[0])
详细
Test #1:
score: 0
Wrong Answer
time: 13ms
memory: 10608kb
input:
2 5 teamA A accepted teamB B rejected teamC A accepted teamB B accepted teamD C accepted 4 teamA A rejected teamB A accepted teamC B accepted teamC B accepted
output:
['A'] A ['A', 'B'] A
result:
wrong answer 1st lines differ - expected: 'A', found: '['A']'