QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #571526 | #9320. Find the Easiest Problem | Brilliant | WA | 7ms | 3640kb | C++23 | 870b | 2024-09-18 00:05:36 | 2024-09-18 00:05:36 |
Judging History
answer
#include <bits/stdc++.h>
#define lowbit(x) ((x)&(-x))
#define fs first
#define sc second
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 5;
const ll inf = 2e18;
const ll MOD = 998244353;
int a[40];
void solve(int Count_T) {
int n;
cin >> n;
vector<int> c(30);
map<string,int> mp;
for (int i = 1; i <= n; i++)
{
string t, p, s;
cin >> t >> p >> s;
if (s[0] == 'a')
if (!mp[t])
{
mp[t] = 1;
c[p[0] - 'A']++;
}
}
int ma = 0, ans = 0;
for (int i = 0; i < 26; i++)
if (c[i] > ma)
ma = c[i], ans = i;
cout << char(ans + 'A') << '\n';
}
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
int T = 1;
cin >> T;
for (int i = 1; i <= T; i++)
solve(i);
return 0;
}
/*
2
6
1 2
2 3
3 4
5 3
3 6
?0????
5
1 2
1 3
1 4
1 5
11?1?
*/
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3640kb
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: 7ms
memory: 3580kb
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:
O P P A B I N H V A T I F R E C N F I V A B S B A O A E F O F A Y O H G K Z B F F D R C U T W I A I J A K L I M C C B A V O F A E A H R B G J O F H D B E A B W H M O I B E F W A E P H F N J Y K P V X O B P I K X L Z H Q B D B T F C B U F L A H T I G A C R G V A N O N K I M R H N J K F K A G N F B H ...
result:
wrong answer 1st lines differ - expected: 'Z', found: 'O'