CSES - Datatähti 2024 loppu - Results
Submission details
Task:Sukat
Sender:ToukoP
Submission time:2024-01-20 16:03:58 +0200
Language:C++11
Status:READY
Result:28
Feedback
groupverdictscore
#1ACCEPTED28
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2, 3details
#2ACCEPTED0.00 s1, 2, 3details
#3ACCEPTED0.00 s1, 2, 3details
#4ACCEPTED0.00 s1, 2, 3details
#5ACCEPTED0.00 s1, 2, 3details
#6ACCEPTED0.00 s1, 2, 3details
#7ACCEPTED0.00 s1, 2, 3details
#8ACCEPTED0.00 s2, 3details
#9ACCEPTED0.00 s2, 3details
#10ACCEPTED0.00 s2, 3details
#11ACCEPTED0.00 s2, 3details
#12ACCEPTED0.00 s2, 3details
#130.00 s2, 3details
#14ACCEPTED0.00 s2, 3details
#150.03 s3details
#16ACCEPTED0.01 s3details
#17ACCEPTED0.03 s3details
#18ACCEPTED0.03 s3details
#19ACCEPTED0.03 s3details
#200.03 s3details
#21ACCEPTED0.02 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:19:9: warning: unused variable 'last' [-Wunused-variable]
   19 |     int last = -1;
      |         ^~~~
input/code.cpp:20:10: warning: unused variable 'g' [-Wunused-variable]
   20 |     bool g = true;
      |          ^

Code

#include <bits/stdc++.h>

using namespace std;

int main() {
    const int Z = 30;
    string str;
    cin >> str;
    
    vector<int> sukat;

    for (int i = 0; i < (int) str.length(); i++) {
        sukat.push_back((int) str[i]);
    }
    sort(sukat.begin(), sukat.end());

    map<int, int> m;

    int last = -1;
    bool g = true;
    for (int i = 0; i < (int) sukat.size(); i++) {
        //cout << sukat[i] << " ";
        int c = ((int) sukat[i]) - 65;
        if (m.count(c) == 0) {
            m[c] = 0;
        }
        m[c] += 1;
        c++;
    }
    
    int c = sukat.size();

    //cout << s1[0] << s1[1] << s1[2] << endl;
    //cout << s2[0] << s2[1] << s2[2] << endl;

    vector<pair<char, char>> res;

    while (c > 0) {
        int max1 = -1;
        int index1 = -1;
        int max2 = -1;
        int index2 = -1;
        for (int i = 0; i < Z; i++) {
            int c = m[i];
            if (c > max1) {
                max2 = max1;
                index2 = index1;
                max1 = c;
                index1 = i;
            } else if (c > max2) {
                max2 = c;
                index2 = i;
            }
        }

        //cout << (char) (index1 + 65) << " " << m[index1] << "   " << (char) (index2 + 65) << " " << m[index2] << endl;

        //cout << "i1: " << index1 << " i2: " << index2 << endl;

        if (index1 == -1 || index2 == -1) {
            break;
        }

        int a = min(max1, max2);
        m[index1] -= a;
        m[index2] -= a;
        c -= a * 2;

        if (a == 0) {
            break;
        }
        
        for (int i = 0; i < a; i++) {
            res.push_back({ (char) (index1 + 65), (char) (index2 + 65)});
        }
    }

    cout << res.size() << "\n";
    for (int i = 0; i < (int) res.size(); i++) {
        cout << res[i].first << res[i].second << "\n"; 
    }
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
QBAXGXJZJS

correct output
5
XJ
ZX
SQ
JG
...

user output
5
JX
JX
AB
GQ
...

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
ET
...

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
SSMRSSSSKR

correct output
4
SR
SR
SM
SK

user output
4
SR
SR
SK
SM

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
BIIILIIRRL

correct output
5
IR
IL
IR
IL
...

user output
5
IL
IL
IR
IR
...

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
YYGEYTDSTY

correct output
5
YT
YT
YS
YG
...

user output
5
YT
YT
YD
EG
...

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:

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:

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:

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