QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#566834#9320. Find the Easiest ProblemrlaaaTL 0ms0kbC++23863b2024-09-16 02:13:322024-09-16 02:13:33

Judging History

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

  • [2024-09-16 02:13:33]
  • 评测
  • 测评结果:TL
  • 用时:0ms
  • 内存:0kb
  • [2024-09-16 02:13:32]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    while (t--) {
        unordered_map <string, int[26]> mp;//队名
        int k,co[26]={0};
        cin >> k;
        int maxx = -1;char maxname;
        for (int i = 0; i < k; k++) {
            string team, answer;
            char qus;
            cin >> team >> qus >> answer;
            if (answer == "accepted") {
                if (mp[team][qus-'A'] == 0) {
                    mp[team][qus-'A']++;
                    co[qus-'A']++;
                    if(maxx<co[qus-'A']){
                        maxx=co[qus-'A'];
                        maxname=qus;
                    }
                }
            }
        }
       cout<<maxname<<endl;
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Time Limit Exceeded

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:


result: