QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#364712 | #5422. Perfect Palindrome | yyppcc | AC ✓ | 30ms | 3864kb | C++14 | 615b | 2024-03-24 16:11:52 | 2024-03-24 16:11:53 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
#define forn(i,n) for(int i=0;i<n;i++)
#define sst(n) setprecision(n)
#define INF 4e18
#define lowBit(n) ((n)&(-n))
#define pl (p*2)
#define pr (p*2+1)
const int N=1000010;
void dd(){
std::string st;
std::cin>>st;
int ans=0;
std::map<int,int>map;
for(auto &i:st){
map[i]++;
ans=std::max(ans,map[i]);
}
std::cout<<st.size()-ans<<'\n';
}
signed main(){
std::ios::sync_with_stdio(false);std::cin.tie(nullptr);std::cout.tie(nullptr);
int _=1;
std::cin>>_;
while(_--)dd();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3600kb
input:
2 abcb xxx
output:
2 0
result:
ok 2 number(s): "2 0"
Test #2:
score: 0
Accepted
time: 30ms
memory: 3864kb
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