QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#562626#5422. Perfect Palindromegogo11#AC ✓3ms3836kbC++20781b2024-09-13 19:31:022024-09-13 19:31:02

Judging History

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

  • [2024-09-13 19:31:02]
  • 评测
  • 测评结果:AC
  • 用时:3ms
  • 内存:3836kb
  • [2024-09-13 19:31:02]
  • 提交

answer

 #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
constexpr int N = 5e5 + 5;
constexpr int M = 2e5 + 5;
constexpr int INF = 0x3f3f3f3f;
constexpr ll LNF = 0x3f3f3f3f3f3f3f3f;
constexpr int Mod = 1000000007;
constexpr ll Base = 131;
constexpr int MaXBIT = 30;
constexpr double eps = 1e-9;

void solve()
{
    string s;
    cin>>s;
    int cnt[26]{},mx=0;
    for(auto c: s) {
        cnt[c-'a']+=1;
        mx=max(mx,cnt[c-'a']);
    }
    cout<<s.size()-mx<<"\n";
}
int main()
{
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cout<<fixed<<setprecision(2);
    int _=1;
    cin>>_;
    while(_--)
        solve();
    return 0;
}

详细

Test #1:

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

input:

2
abcb
xxx

output:

2
0

result:

ok 2 number(s): "2 0"

Test #2:

score: 0
Accepted
time: 3ms
memory: 3836kb

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