CSES - Datatähti 2024 loppu

Submission details
Task:	Sukat
Sender:	adex720
Submission time:	2024-01-20 13:15:19 +0200
Language:	C++ (C++11)
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	28
#2	ACCEPTED	37
#3	ACCEPTED	35

Test results
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	ACCEPTED	0.00 s	2, 3	details
#14	ACCEPTED	0.00 s	2, 3	details
#15	ACCEPTED	0.02 s	3	details
#16	ACCEPTED	0.01 s	3	details
#17	ACCEPTED	0.02 s	3	details
#18	ACCEPTED	0.02 s	3	details
#19	ACCEPTED	0.02 s	3	details
#20	ACCEPTED	0.02 s	3	details
#21	ACCEPTED	0.01 s	3	details

Code

#include <bits/stdc++.h>
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    string s;
    cin >> s;
    int n = s.length();

    int maarat[26];
    fill(maarat, maarat + 26, 0);

    for (int i = 0; i < n; i++)
    {
        maarat[s[i] - 'A']++;
    }

    vector<pair<int, int>> parit;

    while (true)
    {
        int suurin = 0;
        int suurin2 = 0;

        int suurin_ind = -1;
        int suurin2_ind = -1;

        for (int i = 0; i < 26; i++)
        {
            int arvo = maarat[i];

            if (arvo > suurin)
            {
                suurin2 = suurin;
                suurin2_ind = suurin_ind;

                suurin = arvo;
                suurin_ind = i;
            }
            else if (arvo > suurin2)
            {
                suurin2 = arvo;
                suurin2_ind = i;
            }
        }

        if (suurin2 == 0)
        {
            break;
        }

        maarat[suurin_ind]--;
        maarat[suurin2_ind]--;

        parit.push_back(make_pair(suurin_ind, suurin2_ind));
    }

    int maara = parit.size();
    cout << maara;

    for (auto p : parit)
    {
        cout << "\n"
             << (char)(p.first + 'A') << (char)(p.second + 'A');
    }
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
`QBAXGXJZJS` view save

correct output
`5 XJ ZX SQ JG ...` view save

user output
`5 JX AB GJ QS ...` view save

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
`SSSSSSSSSS` view save

correct output
`0` view save

user output
`0` view save

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
`SETTSESEEE` view save

correct output
`5 ES ET ES ET ...` view save

user output
`5 ES ES ET ES ...` view save

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
`SSMRSSSSKR` view save

correct output
`4 SR SR SM SK` view save

user output
`4 SR SK SM SR` view save

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
`BIIILIIRRL` view save

correct output
`5 IR IL IR IL ...` view save

user output
`5 IL IR IB IL ...` view save

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
`YYGEYTDSTY` view save

correct output
`5 YT YT YS YG ...` view save

user output
`5 YT YD YE GS ...` view save

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

input
`MMMMMMMMMN` view save

correct output
`1 MN` view save

user output
`1 MN` view save

Test 8

Group: 2, 3

Verdict: ACCEPTED

input
`XQQZJQDDJOWXDFVQUIODDJIZIQDQIW...` view save

correct output
`500 DQ DQ DQ DQ ...` view save

user output
`500 DQ DQ DQ DQ ...` Truncated

Test 9

Group: 2, 3

Verdict: ACCEPTED

input
`IIIIIIIIIIIIIIIIIIIIIIIIIIIIII...` view save

correct output
`0` view save

user output
`0` view save

Test 10

Group: 2, 3

Verdict: ACCEPTED

input
`KEOHHYHHAIHLLHEKIHKAHHHHOHEHHE...` view save

correct output
`493 HA HA HA HA ...` view save

user output
`493 HA HA HA HA ...` Truncated

Test 11

Group: 2, 3

Verdict: ACCEPTED

input
`WNNFXQNODQFSQVQQPNLQNQNNVVNXHN...` view save

correct output
`499 NQ NQ NQ NQ ...` view save

user output
`499 NQ NQ NQ NQ ...` Truncated

Test 12

Group: 2, 3

Verdict: ACCEPTED

input
`VGAHMMMXMMVXAAMMMOMMMXVMMMYMXT...` view save

correct output
`500 MH MH MH MH ...` view save

user output
`500 MH MH MH MH ...` Truncated

Test 13

Group: 2, 3

Verdict: ACCEPTED

input
`KKKKUUAKKAUKKKKFKKSVKCWKKKCVOJ...` view save

correct output
`500 KI KI KI KI ...` view save

user output
`500 KI KI KI KI ...` Truncated

Test 14

Group: 2, 3

Verdict: ACCEPTED

input
`VVVVVVVVVVVVVVVVVVVVVVVVVVVVVV...` view save

correct output
`100 VP VP VP VP ...` view save

user output
`100 VP VP VP VP ...` Truncated

Test 15

Group: 3

Verdict: ACCEPTED

input
`FKKJJBWTSFCDEKFPOKIPWZSVKHACMC...` view save

correct output
`100000 CK CK CK CK ...` view save

user output
`100000 CK CK CK CK ...` Truncated

Test 16

Group: 3

Verdict: ACCEPTED

input
`RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...` view save

correct output
`0` view save

user output
`0` view save

Test 17

Group: 3

Verdict: ACCEPTED

input
`WVKKVVADNVCVKLVYVVZVKVCTNKVLVV...` view save

correct output
`99925 VC VC VC VC ...` view save

user output
`99925 VC VC VC VC ...` Truncated

Test 18

Group: 3

Verdict: ACCEPTED

input
`BBBBBDNXDZQXBBYBBWBSBTMADXBBVZ...` view save

correct output
`99999 BE BE BE BE ...` view save

user output
`99999 BE BE BE BE ...` Truncated

Test 19

Group: 3

Verdict: ACCEPTED

input
`FBRDPLUMLZMLLLUFUCLEMCMULLZLFL...` view save

correct output
`100000 LU LU LU LU ...` view save

user output
`100000 LU LU LU LU ...` Truncated

Test 20

Group: 3

Verdict: ACCEPTED

input
`UUBUBUTUJSLUVBUXTUUMUXUXTMXUXS...` view save

correct output
`100000 UX UX UX UX ...` view save

user output
`100000 UX UX UX UX ...` Truncated

Test 21

Group: 3

Verdict: ACCEPTED

input
`PPPPPPPPPPEPPPPPPPPPPBOPPPPPPP...` view save

correct output
`20000 PB PB PB PB ...` view save

user output
`20000 PB PB PB PB ...` Truncated

Datatähti 2024 loppu

Sukat

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Tasks

Submissions (adex720)