QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #567194 | #9320. Find the Easiest Problem | mikrokosmos | WA | 66ms | 10728kb | Python3 | 581b | 2024-09-16 09:54:55 | 2024-09-16 09:54:56 |
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
maxx = 0
max_submission = None
for submission, (count, users) in ans.items():
if count > maxx:
maxx = count
max_submission = submission
print(max_submission)
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 15ms
memory: 10604kb
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
result:
ok 2 lines
Test #2:
score: -100
Wrong Answer
time: 66ms
memory: 10728kb
input:
1000 44 WaiooyIXa O accepted WaiooyIXa P accepted ZYYsNWag P accepted DPIawQg D rejected IzPdjnM Z rejected Ra D rejected kwQyGxLo I rejected DPIawQg L accepted kwQyGxLo I accepted mmWxDuADCB D rejected PXwVAOgwiz P rejected ZYYsNWag U accepted IzPdjnM Z accepted TgBNO P rejected kwQyGxLo J accepted...
output:
Z E Z O B I G H S T J I H R Z X W O Q V P M I B A O A Z F O L O R Z H G W E S U O D R Y U V W P Z O T E A U U N J T L Y V A Z N E O Q I S G J O O O D J J K K J J S E W Z K X W S P M Q L N J W I P T D O P X N K V Y Z S G W H Q T P C O U U C O Y E K P S Q R X V D N O Q L M X R H U J Z D K G F T N B K ...
result:
wrong answer 4th lines differ - expected: 'I', found: 'O'