| Task: | Sukat |
| Sender: | maweiyin24562 |
| Submission time: | 2024-01-20 13:55:41 +0200 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | 28 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 28 |
| #2 | WRONG ANSWER | 0 |
| #3 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #2 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #3 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #4 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #5 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #6 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #7 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #8 | ACCEPTED | 0.00 s | 2, 3 | details |
| #9 | ACCEPTED | 0.00 s | 2, 3 | details |
| #10 | ACCEPTED | 0.00 s | 2, 3 | details |
| #11 | ACCEPTED | 0.00 s | 2, 3 | details |
| #12 | ACCEPTED | 0.00 s | 2, 3 | details |
| #13 | WRONG ANSWER | 0.00 s | 2, 3 | details |
| #14 | ACCEPTED | 0.00 s | 2, 3 | details |
| #15 | WRONG ANSWER | 0.15 s | 3 | details |
| #16 | ACCEPTED | 0.01 s | 3 | details |
| #17 | ACCEPTED | 0.15 s | 3 | details |
| #18 | ACCEPTED | 0.15 s | 3 | details |
| #19 | ACCEPTED | 0.15 s | 3 | details |
| #20 | WRONG ANSWER | 0.15 s | 3 | details |
| #21 | ACCEPTED | 0.04 s | 3 | details |
Compiler report
input/code.cpp: In function 'int main()':
input/code.cpp:37:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
37 | for(int i=0;i<s.size();i++){
| ~^~~~~~~~~Code
#include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<queue>
using namespace std;
typedef long long ll;
typedef long double ld;
string s;
int idx[30];
int ans;
char anslist[200009][2];
struct Node{
int cnt,id;
};
Node MaxList(){
Node ret;
ret.id=0;
ret.cnt=0;
for(int i=1;i<=26;i++){
if(idx[i]>=ret.cnt){
ret.cnt=idx[i];
ret.id=i;
}
}
return ret;
}
int main(){
cin>>s;
for(int i=0;i<s.size();i++){
idx[s[i]-'A'+1]++;
}
Node a1=MaxList();
while(a1.cnt>0){
idx[a1.id]=0;
Node a2=MaxList();
if(a2.cnt==0)break;
a1.cnt=a1.cnt-a2.cnt;
idx[a1.id]=a1.cnt;
for(int i=1;i<=a2.cnt;i++){
ans++;
anslist[ans][0]=(char)(a1.id-1+'A');
anslist[ans][1]=(char)(a2.id-1+'A');
}
idx[a2.id]=0;
a1=MaxList();
}
cout<<ans<<endl;
for(int i=1;i<=ans;i++){
cout<<anslist[i][0]<<anslist[i][1]<<endl;
}
return 0;
}Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| QBAXGXJZJS |
| correct output |
|---|
| 5 XJ ZX SQ JG ... |
| user output |
|---|
| 5 XJ XJ ZS QG ... |
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| SSSSSSSSSS |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 3
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| SETTSESEEE |
| correct output |
|---|
| 5 ES ET ES ET ... |
| user output |
|---|
| 5 ES ES ES TE ... |
Test 4
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| SSMRSSSSKR |
| correct output |
|---|
| 4 SR SR SM SK |
| user output |
|---|
| 4 SR SR SM SK |
Test 5
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| BIIILIIRRL |
| correct output |
|---|
| 5 IR IL IR IL ... |
| user output |
|---|
| 5 IR IR IL IL ... |
Test 6
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| YYGEYTDSTY |
| correct output |
|---|
| 5 YT YT YS YG ... |
| user output |
|---|
| 5 YT YT YS YG ... |
Test 7
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| MMMMMMMMMN |
| correct output |
|---|
| 1 MN |
| user output |
|---|
| 1 MN |
Test 8
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| XQQZJQDDJOWXDFVQUIODDJIZIQDQIW... |
| correct output |
|---|
| 500 DQ DQ DQ DQ ... |
| user output |
|---|
| 500 DQ DQ DQ DQ ... Truncated |
Test 9
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| IIIIIIIIIIIIIIIIIIIIIIIIIIIIII... |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 10
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| KEOHHYHHAIHLLHEKIHKAHHHHOHEHHE... |
| correct output |
|---|
| 493 HA HA HA HA ... |
| user output |
|---|
| 493 HA HA HA HA ... Truncated |
Test 11
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| WNNFXQNODQFSQVQQPNLQNQNNVVNXHN... |
| correct output |
|---|
| 499 NQ NQ NQ NQ ... |
| user output |
|---|
| 499 NQ NQ NQ NQ ... Truncated |
Test 12
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| VGAHMMMXMMVXAAMMMOMMMXVMMMYMXT... |
| correct output |
|---|
| 500 MH MH MH MH ... |
| user output |
|---|
| 500 MH MH MH MH ... Truncated |
Test 13
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| KKKKUUAKKAUKKKKFKKSVKCWKKKCVOJ... |
| correct output |
|---|
| 500 KI KI KI KI ... |
| user output |
|---|
| 499 KI KI KI KI ... Truncated |
Test 14
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| VVVVVVVVVVVVVVVVVVVVVVVVVVVVVV... |
| correct output |
|---|
| 100 VP VP VP VP ... |
| user output |
|---|
| 100 VP VP VP VP ... Truncated |
Test 15
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| FKKJJBWTSFCDEKFPOKIPWZSVKHACMC... |
| correct output |
|---|
| 100000 CK CK CK CK ... |
| user output |
|---|
| 99999 CK CK CK CK ... Truncated |
Test 16
Group: 3
Verdict: ACCEPTED
| input |
|---|
| RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR... |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 17
Group: 3
Verdict: ACCEPTED
| input |
|---|
| WVKKVVADNVCVKLVYVVZVKVCTNKVLVV... |
| correct output |
|---|
| 99925 VC VC VC VC ... |
| user output |
|---|
| 99925 VC VC VC VC ... Truncated |
Test 18
Group: 3
Verdict: ACCEPTED
| input |
|---|
| BBBBBDNXDZQXBBYBBWBSBTMADXBBVZ... |
| correct output |
|---|
| 99999 BE BE BE BE ... |
| user output |
|---|
| 99999 BE BE BE BE ... Truncated |
Test 19
Group: 3
Verdict: ACCEPTED
| input |
|---|
| FBRDPLUMLZMLLLUFUCLEMCMULLZLFL... |
| correct output |
|---|
| 100000 LU LU LU LU ... |
| user output |
|---|
| 100000 LU LU LU LU ... Truncated |
Test 20
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| UUBUBUTUJSLUVBUXTUUMUXUXTMXUXS... |
| correct output |
|---|
| 100000 UX UX UX UX ... |
| user output |
|---|
| 99999 UX UX UX UX ... Truncated |
Test 21
Group: 3
Verdict: ACCEPTED
| input |
|---|
| PPPPPPPPPPEPPPPPPPPPPBOPPPPPPP... |
| correct output |
|---|
| 20000 PB PB PB PB ... |
| user output |
|---|
| 20000 PB PB PB PB ... Truncated |
