QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#567951 | #9320. Find the Easiest Problem | pose | WA | 24ms | 3632kb | C++23 | 633b | 2024-09-16 14:47:23 | 2024-09-16 14:47:24 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
int a[2000005];
int b[2000005];
int c[2000005];
string s[1005];
void sl()
{
int n;
cin >> n;
string ans;
int ans1=0;
map<pair<string,string>,int>mp;
map<string,int>mp1;
for(int i=0;i<n;i++)
{
string s1="",s2="",s3="";
cin >> s1 >> s2 >> s3;
if(s3=="accepted")
{
mp[{s1,s2}]++;
if(mp[{s1,s2}]==1)mp1[s2]++;
if(ans1<mp1[s2])ans=s2,ans1=mp1[s2];
}
}
cout << ans << '\n';
}
signed main()
{
int t=1;
cin >> t;
while(t--)
{
sl();
}
}
/*
9
ejibmyyju
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3624kb
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: 24ms
memory: 3632kb
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 X W O I V I Y I P A O A Z F O F O R T H G K E S D H D R Y U V W P Z O T E A U U M J T L Y V W Z N E O Q H B G J O O M D Z J K K W J S E W Z K X I S P O H L Z H W I P T D O P F N X S Y Z S G J H Q T O C O X U L O Y E J P S Q R X N D N O Q L M X R H Z J Z Y K G F V N B K ...
result:
wrong answer 4th lines differ - expected: 'I', found: 'O'