QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#668198#5422. Perfect PalindromenageingAC ✓24ms3812kbC++20575b2024-10-23 12:23:432024-10-23 12:23:45

Judging History

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

  • [2024-10-23 12:23:45]
  • 评测
  • 测评结果:AC
  • 用时:24ms
  • 内存:3812kb
  • [2024-10-23 12:23:43]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
bool chmin(int &x, int y) {
	if (x > y) {
		x = y;
		return 1;
	}
	return 0;
}
void solve() {
	string s;
	cin >> s;
	map<char, int> cnt;
	for (int i = 0; s[i]; i ++) {
		cnt[s[i]] ++;
	}
	int n = s.size();
	int ans = n;
	for (auto [x, y] : cnt) {
		chmin(ans, n - y);
	}
	cout << ans << '\n';

}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr); cout.tie(nullptr);
	int t = 1;
	cin >> t;
	while (t --) {
		solve();
	}

	return 0;
}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3812kb

input:

2
abcb
xxx

output:

2
0

result:

ok 2 number(s): "2 0"

Test #2:

score: 0
Accepted
time: 24ms
memory: 3788kb

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