QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#594063	#9320. Find the Easiest Problem	Hansen	TL	8ms	42632kb	C++14	1.2kb	2024-09-27 18:41:31	2024-09-27 18:41:31

Judging History

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

[2024-09-27 18:41:31]
评测

测评结果：TL
用时：8ms
内存：42632kb

查看

[2024-09-27 18:41:31]
提交

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[100][100005] = { 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;
}

源文件, 语言: C++14

详细

Test #1:

score: 100

Accepted

time: 8ms

memory: 42632kb

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

Time Limit Exceeded

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
...