QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #594061 | #9320. Find the Easiest Problem | Hansen | WA | 35ms | 4600kb | C++14 | 1.2kb | 2024-09-27 18:40:29 | 2024-09-27 18:40:31 |
Judging History
answer
#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
#include<math.h>
#include<string>
#include<iostream>
#include<stdlib.h>
#include<cstring>
#include<string.h>
#include<time.h>
#include<ctype.h>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<numeric>
#include<assert.h>
#include<stack>
#include<queue>
#include<deque>
#include<unordered_map>
#include<vector>
#include<map>
#include<bitset>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
int main() {
int t;
cin >> t;
while (t--)
{
unordered_map<string, int> hash1;
int dui[200][1005] = { 0 },cnt=0,imax=0;
char ans='A';
int n;
cin >> n;
string team, s;
char q;
for (int i = 1; i <= n; i++)
{
cin >> team >> q >> s;
if (hash1[team] == 0)
{
hash1[team] = ++cnt;
}
if (s == "accepted" && dui[q][hash1[team]] == 0)
dui[q][hash1[team]]++;
}
for (int i =65; i <= 65+25; i++)
{
int sum = 0;
for (int j = 1; j <= n; j++)
{
if (dui[i][j] == 1)
sum++;
}
if (sum > imax)
{
imax=sum;
ans = i;
}
}
cout << ans << endl;
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 4600kb
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: 0
Accepted
time: 35ms
memory: 4376kb
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 I B I G H S 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 R C U V W P A O J E A B U M C T L G V A Z N E O Q F B G J I E M A A E A K J J S E W Z K F I S P M H G G H W I P T D O A F N C S 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:
ok 1000 lines
Test #3:
score: 0
Accepted
time: 35ms
memory: 4388kb
input:
1000 39 OnYbTl Y accepted m I accepted NJN T accepted lTGE D accepted mi K accepted ttcHrVD W accepted hvGveRIr J rejected zTwvbWhhQT S rejected VlAcLAHas E accepted hM H accepted wltR G rejected JJWtQ H accepted zVwBtj L rejected ZVqAWCsj I rejected BwuM B accepted IpUXa R rejected OdSv D rejected ...
output:
H R M I S J D D A E X S I D D A I N G O F G G B A J E H D I G M O N C G F L V D C S B U H W L J C O B D L N D V K M Z C T H K U I T R R Q D B E F A Q O F M C T M E Y L K Q K E A O E J O B N R A E D I A Q W A M A Z W K M I J B F L X E R G A I H Q P T E K L Q U C A F C A S N G G U L J J A A J A B A E ...
result:
ok 1000 lines
Test #4:
score: 0
Accepted
time: 34ms
memory: 4384kb
input:
1000 15 vCproSIO G rejected vCproSIO H rejected ySoEaGKbVz R rejected ySoEaGKbVz M accepted vCproSIO Z rejected ySoEaGKbVz C rejected YVCmuO H accepted XHHVYm Y rejected YVCmuO H rejected vCproSIO S accepted ySoEaGKbVz J accepted YVCmuO P rejected ySoEaGKbVz E rejected XHHVYm O accepted vCproSIO T r...
output:
H A F A N J B C H T B L G Z J H F A B H A O V E B O L B J D I Y M B Q B F E T B T C C X E P S M A Q G D A A H I H E D C A A V C B C D E B F I D C M J P N F V K E K K B B F Q L B E Q A R E V C Y D I C H N H G G M A H E D U N N M R K C B F O H V I A U R Y D A A A G E N N L C A E C B Z P W K U D H D V ...
result:
ok 1000 lines
Test #5:
score: -100
Wrong Answer
time: 7ms
memory: 4444kb
input:
1 27400 RPRPRNWL O accepted UTqhXsDpY R rejected BabD A rejected eNM Y rejected HzIyx S accepted phWEJVQ N rejected NbisS Q accepted cTIsPKm Y rejected sElDxdT T accepted BJuQR Q rejected vfPJs W rejected eF Z accepted KyOHzFtXm B accepted wZlyz T accepted acDVjN C accepted M X rejected sW A accepte...
output:
A
result:
wrong answer 1st lines differ - expected: 'P', found: 'A'