QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #593558 | #9320. Find the Easiest Problem | C0pyCat | RE | 0ms | 0kb | Python3 | 652b | 2024-09-27 14:37:25 | 2024-09-27 14:37:26 |
answer
T = int(input())
for t in range(T):
n = int(input())
ans = 'Z'
problem_id = {}
max_accepted = 0
for i in range(n):
inp = input().split()
if not inp[1] in problem_id:
problem_id = {'num':0,'team':{}}
if inp[2] == 'accepted' and not inp[0] in problem_id[inp[1]]['team']:
problem_id[inp[1]]['team'][inp[0]] = 1
problem_id[inp[1]]['num'] += 1
if problem_id[inp[1]]['num'] > max_accepted or problem_id[inp[1]]['num'] == max_accepted and inp[1]<ans:
max_accepted = problem_id[inp[1]]['num']
ans = inp[1]
print(ans)
詳細信息
Test #1:
score: 0
Dangerous Syscalls
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