QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#577114#9320. Find the Easiest ProblemzhangyushuWA 0ms3532kbC++14773b2024-09-20 08:10:482024-09-20 08:10:48

Judging History

你现在查看的是最新测评结果

  • [2024-09-20 08:10:48]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3532kb
  • [2024-09-20 08:10:48]
  • 提交

answer

# include<iostream>
using namespace std;
# include<unordered_set>
unordered_set<int> p[30];
void sol() {
	int n;
	cin >> n;
	string team, pro, sta;
	for (int i = 0; i < 26; ++i)
		p[i].clear();
	while (n--) {
		cin >> team >> pro >> sta;
		int id = pro[0] - 'A';
		if (sta[0] == 'a') p[id].insert(team[4] - 'A');
		//cout << sta[0] << id << team[4] - 'A' << endl;
	}
	int maxn = 0, ans = 1e8;
	for (int i = 0; i < 26; ++i) {
		//cout << i << ' ' << p[i].size() << endl;
		if (p[i].size() > maxn) maxn = p[i].size(), ans = i;
		else if (p[i].size() == maxn) ans = min(ans, i);
	}
	cout << char(ans + 'A') << endl;
}
int main() {
	int t;
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	cin >> t;
	while (t--) {
		sol();
	}
	return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3480kb

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: 0ms
memory: 3532kb

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
T
K
J
I
H
R
Z
C
K
O
I
P
A
B
I
A
A
N
A
B
A
O
F
O
R
T
H
G
K
E
S
D
F
D
O
C
U
V
W
P
A
O
J
E
A
B
U
M
C
T
B
Y
V
A
O
N
E
O
H
F
B
G
J
I
E
M
A
A
E
A
K
W
J
P
E
W
Z
K
F
I
S
P
M
H
G
G
H
W
I
P
T
D
O
A
F
N
C
L
Y
Z
S
G
J
F
Q
F
O
C
B
B
U
C
I
A
E
I
P
K
C
R
X
N
D
N
L
Q
L
I
X
I
H
U
J
Z
D
K
G
F
T
F
B
H
...

result:

wrong answer 4th lines differ - expected: 'I', found: 'O'