QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#105963#5422. Perfect Palindromeliangzexian2#AC ✓9ms3808kbC++14523b2023-05-16 08:35:412023-05-16 08:35:43

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-05-16 08:35:43]
  • 评测
  • 测评结果:AC
  • 用时:9ms
  • 内存:3808kb
  • [2023-05-16 08:35:41]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int read() {
	int x=0, sg=1; char c=getchar();
	while (c!='-'&&!isdigit(c)) c=getchar();
	if (c=='-') sg=-1, c=getchar();
	while (isdigit(c)) x=x*10+c-'0', c=getchar();
	return x*sg;
}
int cnt[30];
char s[1000005];
int main() {
	int nc=read(); while (nc--) {
		scanf("%s", s);
		int a=0;
		for (int i=0; s[i]; i++) a=max(a, ++cnt[s[i]-'0']);
		for (int i=0; s[i]; i++) --cnt[s[i]-'0'];
		printf("%d\n", strlen(s)-a);
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 2ms
memory: 3716kb

input:

2
abcb
xxx

output:

2
0

result:

ok 2 number(s): "2 0"

Test #2:

score: 0
Accepted
time: 9ms
memory: 3808kb

input:

11107
lfpbavjsm
pdtlkfwn
fmb
hptdswsoul
bhyjhp
pscfliuqn
nej
nxolzbd
z
clzb
zqomviosz
u
ek
vco
oymonrq
rjd
ktsqti
mdcvserv
x
birnpfu
gsgk
ftchwlm
bzqgar
ovj
nsgiegk
dbolme
nvr
rpsc
fprodu
eqtidwto
j
qty
o
jknssmabwl
qjfv
wrd
aa
ejsf
i
npmmhkef
dzvyon
p
zww
dp
ru
qmwm
sc
wnnjyoepxo
hc
opvfepiko
inuxx...

output:

8
7
2
8
4
8
2
6
0
3
7
0
1
2
5
2
4
6
0
6
2
6
5
2
5
5
2
3
5
6
0
2
0
8
3
2
0
3
0
6
5
0
1
1
1
2
1
8
1
7
5
3
4
4
1
8
5
5
8
8
6
3
0
2
3
2
1
5
0
0
9
3
3
4
8
4
0
4
2
6
6
0
8
7
4
3
9
3
4
2
5
8
8
8
6
1
4
4
2
7
2
8
6
4
4
8
7
8
4
9
3
8
0
7
7
2
6
0
0
5
4
0
7
5
4
2
1
6
7
5
2
4
4
7
3
3
2
5
4
8
5
0
3
5
1
2
3
0
4
7
...

result:

ok 11107 numbers