QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#603023	#9320. Find the Easiest Problem	Totoro^#	AC ✓	11ms	6184kb	C++14	2.1kb	2024-10-01 14:13:38	2024-10-01 14:13:45

Judging History

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

[2024-10-01 14:13:45]
评测

测评结果：AC
用时：11ms
内存：6184kb

查看

[2024-10-01 14:13:38]
提交

answer

#include<bits/stdc++.h>
using namespace std;
namespace gza{
	#define int long long
	#define pb push_back
	#define MT int TTT=R;while(TTT--)
	#define pc putchar
	#define R read()
	#define fo(i,a,b) for(int i=a;i<=b;i++)
	#define rep(i,a,b) for(int i=a;i>=b;i--)
	#define m1(a,b) memset(a,b,sizeof a)
	namespace IO
	{
		inline int read()
		{
		    int x=0;
		    char ch=getchar();
		    bool f=0;
		    while(!isdigit(ch)){if(ch=='-') f=1;ch=getchar();}
		    while(isdigit(ch)) x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
		    if(f) x=-x;
		    return x;    
		}
		template<typename T> inline void write(T x)
		{
		    if(x<0) pc('-'),x=-x;
		    if(x>9) write(x/10);
		    pc(x%10+'0');
		}
	};
	namespace math
	{
		inline int gcd(int a,int b)
		{
			int az=__builtin_ctz(a),bz=__builtin_ctz(b),z=(az>bz)?bz:az,t;
		    b>>=bz;
		    while(a) a>>=az,t=a-b,b=a,az=__builtin_ctz(t<0?-t:t),a=t<0?-t:t;
		    return b<<z;
		}
		inline int qmi(int a,int b,int p)
		{
			int res=1;
			while(b)
			{
				if(b&1) res=res*a%p;
				a=a*a%p;
				b>>=1;
			}
			return res;
		}
		const int MAXN=2e6+10;
		int my_fac[MAXN],my_inv[MAXN];
		void init_binom(int mod)
		{
			my_fac[0]=1;fo(i,1,min(MAXN,mod)-1) my_fac[i]=my_fac[i-1]*i%mod;
			my_inv[min(MAXN,mod)-1]=qmi(my_fac[min(MAXN,mod)-1],mod-2,mod);rep(i,min(MAXN,mod)-2,0) my_inv[i]=my_inv[i+1]*(i+1)%mod;
		}
		int binom(int a,int b,int mod)
		{
			return my_fac[a]*my_inv[b]%mod*my_inv[a-b]%mod;
		}
	};
	using namespace IO;
	using namespace math;
	
	const int N=1e5+10;
	int n;
	map<string,int> ma[26];
	void solve(){
		fo(i,0,25) ma[i].clear();
		cin>>n;
		fo(i,1,n)
		{
			string a,b,c;
			cin>>a>>b>>c;
			// cout<<a<<' '<<b<<' '<<c<<endl;
			if(c=="accepted") ma[b[0]-'A'][a]=1;
		}
		int maxx=0;
		char ans=0;
		fo(i,0,25)
		{
			int val=ma[i].size();
			// cout<<i<<' '<<val<<endl;
			if(maxx<val) maxx=val,ans=i+'A';
		}
		cout<<ans<<endl;
	}
	void main(){
		ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
		int t;
		cin>>t;
		while(t--) solve();
	}
}
signed main(){
	
	gza::main();
}

源文件, 语言: C++14

这程序好像有点Bug，我给组数据试试？

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3752kb

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: 4ms

memory: 3604kb

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: 8ms

memory: 3532kb

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: 3ms

memory: 3828kb

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: 0

Accepted

time: 6ms

memory: 4380kb

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:

result:

ok single line: 'P'

Test #6:

score: 0

Accepted

time: 3ms

memory: 3616kb

input:

1
29702
Wsfzx N rejected
yZkJOvtRG B rejected
Wsfzx A accepted
yZkJOvtRG C rejected
F G accepted
kyUxIv U accepted
li R rejected
F Q rejected
F Y accepted
F I accepted
yZkJOvtRG J rejected
Wsfzx C rejected
Wsfzx V accepted
yZkJOvtRG L rejected
F X rejected
kyUxIv K accepted
li G accepted
Wsfzx Z acc...

output:

result:

ok single line: 'A'

Test #7:

score: 0

Accepted

time: 2ms

memory: 3592kb

input:

1
99584
I Y rejected
I F accepted
I Z rejected
I G accepted
I J rejected
I A rejected
I C rejected
I R rejected
I J accepted
I L rejected
I A rejected
I L accepted
I E rejected
I O accepted
I P accepted
I F rejected
I O accepted
I E accepted
I W accepted
I X rejected
I G accepted
I R rejected
I A re...

output:

result:

ok single line: 'A'

Test #8:

score: 0

Accepted

time: 6ms

memory: 4604kb

input:

1
26160
QmDDKxIel A rejected
gmxZDM O rejected
thXodr Z accepted
sznPsL Z accepted
VynmaLp B rejected
MfJQRamC T rejected
W W accepted
WFqnF T accepted
QRys Y accepted
Q H accepted
XUiMDH H accepted
fPcwpz U rejected
oEqrrOAv D rejected
aeW O accepted
M B accepted
JYzynly O accepted
JJqNf G rejected...

output:

result:

ok single line: 'E'

Test #9:

score: 0

Accepted

time: 5ms

memory: 3820kb

input:

1000
81
pnnCvDUIH B rejected
rdcJWGYGhk B accepted
VBFvmoYLn B accepted
jdMRRJuIpZ B rejected
WLewtGWJw A rejected
zGAkWsrfG A accepted
MDzQocBGr A rejected
XufUaIWaKT A accepted
JachfkiYL A rejected
zvDlkMINf B rejected
NMfFDEVhG A rejected
axiTyJnXu B accepted
wLkSOTqqV A rejected
amkUqtOyMB B rej...

output:

B
B
B
B
B
A
B
A
A
A
B
B
B
A
A
B
B
A
B
A
A
A
B
A
A
B
B
B
A
A
A
B
B
A
A
B
A
B
B
B
A
B
A
B
B
A
B
A
A
A
A
A
B
A
B
B
A
A
A
A
B
A
B
A
A
A
B
A
A
B
B
A
A
A
B
B
A
A
B
B
B
A
A
A
A
A
A
B
A
B
B
B
B
A
A
B
B
B
B
B
A
B
A
A
B
A
A
B
A
A
B
A
B
A
A
A
B
B
A
A
B
A
B
B
A
B
A
B
A
A
A
B
B
A
A
A
B
B
A
A
A
A
B
A
B
A
A
A
A
A
...

result:

ok 1000 lines

Test #10:

score: 0

Accepted

time: 11ms

memory: 6184kb

input:

1
61839
BGQriOTlZ B rejected
ZIqGhTsmH B rejected
DxIVjUqBr A rejected
afbRvvloO A accepted
LskKGrpIx A rejected
zGnHxzKmA B rejected
bHSaQfYtu A rejected
xPTMHyQgD B rejected
xWrkTqLhH B accepted
tGUVjSpmjI A accepted
bBBZKwbsw A accepted
IAaiNrLMLe B accepted
bglBZRQuk B accepted
DtLTczAkJo A reje...

output:

result:

ok single line: 'B'

Extra Test:

score: 0

Extra Test Passed