QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#576650#9320. Find the Easiest ProblemquxaimenkanhaiAC ✓20ms10080kbC++142.1kb2024-09-19 21:25:342024-09-19 21:25:34

Judging History

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

  • [2024-09-19 21:25:34]
  • 评测
  • 测评结果:AC
  • 用时:20ms
  • 内存:10080kb
  • [2024-09-19 21:25:34]
  • 提交

answer

#include<bits/stdc++.h> 
#define lson p<<1
#define rson p<<1|1
#define int	long long
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define ANS cout<<ans<<"\n";
#define forn for(int i=1;i<=n;i++)
#define form for(int i=1;i<=m;i++)
#define forq for(int i=1;i<=q;i++)
#define fornj for(int j=1;j<=n;j++)
#define formj for(int j=1;j<=m;j++)
#define forqj for(int j=1;j<=q;j++)
#define fornn for(int i=n;i>=1;i--)
#define formm for(int i=m;i>=1;i--)
#define forqq for(int i=q;i>=1;i--)
using namespace std;
const int nnu=2e5+10;
const int mod=1e9+7;
const double eps = 1e-5;
int qpow(int a,int m){
	if(a==0)return 0;
	int s=1;
	while(m){
		if(m&1) s=(s*a)%mod;
		m>>=1;a=(a*a)%mod;
	}
	return s;
}
int prime[nnu],cntPrime=0;
bool meoPrime[nnu];
bool judgePrime(int x){
	if(x==1)return false ;
	for(int i=2;i*i<=x;i++){
		if(x%i==0)return false;
	}
	return true;
}
void initPrime(){
	int maxn=1e5;
	for(int i=2;i<=maxn;i++){
		if(meoPrime[i]==0)prime[++cntPrime]=i;
		for(int j=1;j<=cntPrime&&prime[j]*i<=maxn;j++){
			meoPrime[prime[j]*i]=1;
			if(i%prime[j]==0)break;
		}
	} 
} 
void add(int &t,int a){
	t=(t%mod+a%mod+mod)%mod;
}
int dx[]={0,0,0,-1,1};
int dy[]={0,1,-1,0,0};
int tt=1,ttt=1;
int n,q,m,k;
int ans=0;
int arr[nnu],brr[nnu],f[nnu],g[nnu];

int C(int n,int m){
	return f[n]*g[n-m]%mod*g[m]%mod;
}
void initC(){
	f[0]=g[0]=1;
	int maxn=2e5;
	for(int i=1;i<=maxn;i++){
		f[i]=(f[i-1]*i)%mod;
		g[i]=(g[i-1]*qpow(i,mod-2))%mod;
	}
}

void solve(){
	//wipe data
	ans=0;m++;q=0;
	//solve
	cin>>n;
	map<string,int> mp[30];
	for(int i=0;i<=25;i++)arr[i]=0; 
	char minn='Z'+1;
	forn {
		string name,op,s;cin>>name>>op>>s;
		minn=min(minn,op[0]);
		if(s[0]=='r')continue;
		int num=(int)(op[0]-'A');
		if(mp[num][name])continue;
		mp[num][name]++;
		m++;
		arr[num]++;
	}
	if(!m)cout<<minn<<"\n";
	else {
		for(int i=0;i<26;i++)q=max(q,arr[i]);
		for(int i=0;i<26;i++){
			if(arr[i]==q){
				char o='A'+i;
				cout<<o<<"\n";
				return ;
			}
		}
	}
}
signed main(void)
{
	ios::sync_with_stdio(false);cin.tie(0),cout.tie(0);

	cin>>ttt;
	for(tt=1;tt<=ttt;tt++)solve();return 0;
}

这程序好像有点Bug,我给组数据试试?

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 5932kb

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: 3ms
memory: 7692kb

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: 7948kb

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: 7ms
memory: 7696kb

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: 7ms
memory: 6484kb

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:

P

result:

ok single line: 'P'

Test #6:

score: 0
Accepted
time: 4ms
memory: 7760kb

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:

A

result:

ok single line: 'A'

Test #7:

score: 0
Accepted
time: 4ms
memory: 5864kb

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:

A

result:

ok single line: 'A'

Test #8:

score: 0
Accepted
time: 4ms
memory: 8892kb

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:

E

result:

ok single line: 'E'

Test #9:

score: 0
Accepted
time: 8ms
memory: 5700kb

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: 20ms
memory: 10080kb

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:

B

result:

ok single line: 'B'

Extra Test:

score: 0
Extra Test Passed