QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #588660 | #9320. Find the Easiest Problem | C0pyCat | WA | 42ms | 10576kb | Python3 | 673b | 2024-09-25 13:53:58 | 2024-09-25 13:53:58 |
Judging History
answer
# 在这里写上你的代码 :-)
T = int(input())
for t in range(T):
n = int(input())
team_name = {}
problem_id = {}
ans = ''
max_accepted = 0
for i in range(n):
inp = input().split()
if not inp[1] in problem_id:
problem_id[inp[1]] = 0
if inp[2] == 'accepted' and not inp[0] in team_name:
team_name[inp[0]] = 1
problem_id[inp[1]] += 1
if max_accepted < problem_id[inp[1]]:
max_accepted = problem_id[inp[1]]
ans = inp[1]
if inp[1] < ans and max_accepted == problem_id[inp[1]]:
ans = inp[1]
print(ans)
詳細信息
Test #1:
score: 100
Accepted
time: 11ms
memory: 10576kb
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: 42ms
memory: 10520kb
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:
O P P A B I N H V A T I F R E C N F I V A B S B A O A E F O F A Y O H G K Z B F F D R C U T W I A I J A K L I M C C B A V O F A E A H R B G J O F H D B E A B W H M O I B E F W A E P H F N J Y K P V X O B P I K X L Z H Q B D B T F C B U F L A H T I G A C R G V A N O N K I M R H N J K F K A G N F B H ...
result:
wrong answer 1st lines differ - expected: 'Z', found: 'O'