QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#573077#9320. Find the Easiest Problem_habiWA 5ms3572kbC++17671b2024-09-18 17:15:172024-09-18 17:15:18

Judging History

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

  • [2024-09-18 17:15:18]
  • 评测
  • 测评结果:WA
  • 用时:5ms
  • 内存:3572kb
  • [2024-09-18 17:15:17]
  • 提交

answer

#include<iostream>
#include<set>
#include<algorithm>
#include<vector>
#include<map>
using namespace std;
typedef pair<char,char>PII;
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t;cin>>t;
	while(t--)
	{
		int n;
		cin>>n;
		set<PII>s;
		while(n--)
		{
			string a,b,c;
			cin>>a>>b>>c;
			if(c=="accepted") 
			 s.insert(make_pair(a[4],b[0]));
		}
		map<char,int>m;
		for(auto x:s)
		 m[x.second]++;
		long long ans=-1;
		for(auto x:m)
		 if(ans<x.second)ans=x.second;
		vector<char>temp;
		for(auto x:m)
		 if(x.second==ans) temp.push_back(x.first);
		sort(temp.begin(),temp.end());
		cout<<temp[0]<<endl;
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 5ms
memory: 3572kb

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'