CSES - Datatähti 2023 alku

CSES - Datatähti 2023 alku - Results

Submission details
Task:	Kertoma
Sender:	cppbetter
Submission time:	2022-11-06 15:35:00 +0200
Language:	C++ (C++17)
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	22
#2	ACCEPTED	24
#3	ACCEPTED	54

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.01 s	1, 2, 3	details
#5	ACCEPTED	0.01 s	1, 2, 3	details
#6	ACCEPTED	0.01 s	1, 2, 3	details
#7	ACCEPTED	0.01 s	2, 3	details
#8	ACCEPTED	0.01 s	2, 3	details
#9	ACCEPTED	0.01 s	2, 3	details
#10	ACCEPTED	0.01 s	2, 3	details
#11	ACCEPTED	0.01 s	3	details
#12	ACCEPTED	0.01 s	3	details
#13	ACCEPTED	0.01 s	3	details
#14	ACCEPTED	0.01 s	3	details
#15	ACCEPTED	0.01 s	3	details
#16	ACCEPTED	0.01 s	3	details

Code

#include <iostream>
#include <array>
#include <cmath>
#include <algorithm>

#define PI 3.14159265358979323846

// Length of factorial
// Improved approximation (x2)

uint32_t StirlingAprox(double n)
{
    return (uint32_t) floor(floor((log(2.0 * PI * n)/2.0 + n * (log(n)-1.0))/log(10.0)) + 1);
}

int main()
{
    std::array<uint32_t, 10> frequency = {};
    uint32_t length = 0;

    for(auto& i : frequency)
    {
        std::cin >> i;
        length += i;
    }

    // Check special cases that share the same factorial length
    std::array<uint32_t, 10> factorialSpecial = {0, 0, 1, 0, 0, 0, 0, 0, 0, 0};
    if(frequency == factorialSpecial)
    {
        std::cout << "2\n";
        return 0;
    }
    factorialSpecial = {0, 0, 0, 0, 0, 0, 1, 0, 0, 0};
    if(frequency == factorialSpecial)
    {
        std::cout << "3\n";
        return 0;
    }
    factorialSpecial = {0, 0, 1, 0, 1, 0, 0, 0, 0, 0};
    if(frequency == factorialSpecial)
    {
        std::cout << "4\n";
        return 0;
    }
    factorialSpecial = {1, 1, 1, 0, 0, 0, 0, 0, 0, 0};
    if(frequency == factorialSpecial)
    {
        std::cout << "5\n";
        return 0;
    }
    factorialSpecial = {1, 0, 0, 0, 0, 1, 0, 1, 0, 0};
    if(frequency == factorialSpecial)
    {
        std::cout << "6\n";
        return 0;
    }
    factorialSpecial = {2, 0, 0, 0, 1, 1, 0, 0, 0, 0};
    if(frequency == factorialSpecial)
    {
        std::cout << "7\n";
        return 0;
    }
    // Use Stirling’s approximation to get a table of values during compile time and check if there is a hit
    // Have to check until 10^5

    // Overkill :)
    std::array<uint32_t, 200000> lengths = {};
    for(int i = 0; i < 200000; i++) // 100000 != 10000
        lengths[i] = StirlingAprox(i + 1);

    auto loc = std::find(lengths.begin(), lengths.end(), length);
    if (loc != std::end(lengths))
    {
        std::cout << std::distance(lengths.begin(), loc) + 1 << "\n";
    }
    else
    {
        // Stirling’s approximation doesn't work anymore :C
        std::cout << "-1\n";
    }

}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
`0 0 1 0 0 0 0 0 0 0` view save

correct output
`2` view save

user output
`2` view save

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
`0 0 0 0 0 0 1 0 0 0` view save

correct output
`3` view save

user output
`3` view save

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
`0 0 1 0 1 0 0 0 0 0` view save

correct output
`4` view save

user output
`4` view save

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
`2 0 1 1 0 0 1 0 2 0` view save

correct output
`10` view save

user output
`10` view save

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
`9 3 1 1 2 2 3 1 6 1` view save

correct output
`27` view save

user output
`27` view save

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
`10 4 3 4 3 2 2 4 3 7` view save

correct output
`36` view save

user output
`36` view save

Test 7

Group: 2, 3

Verdict: ACCEPTED

input
`71 53 36 30 25 29 42 24 34 29` view save

correct output
`199` view save

user output
`199` view save

Test 8

Group: 2, 3

Verdict: ACCEPTED

input
`71 33 46 38 27 45 36 21 35 35` view save

correct output
`205` view save

user output
`205` view save

Test 9

Group: 2, 3

Verdict: ACCEPTED

input
`93 38 35 26 43 54 38 25 41 34` view save

correct output
`222` view save

user output
`222` view save

Test 10

Group: 2, 3

Verdict: ACCEPTED

input
`100 33 33 45 36 43 38 54 56 36` view save

correct output
`242` view save

user output
`242` view save

Test 11

Group: 3

Verdict: ACCEPTED

input
`3419 1797 1845 1849 1879 1791 ...` view save

correct output
`5959` view save

user output
`5959` view save

Test 12

Group: 3

Verdict: ACCEPTED

input
`4776 2695 2709 2781 2616 2753 ...` view save

correct output
`8391` view save

user output
`8391` view save

Test 13

Group: 3

Verdict: ACCEPTED

input
`20097 12282 12229 12214 12406 ...` view save

correct output
`32001` view save

user output
`32001` view save

Test 14

Group: 3

Verdict: ACCEPTED

input
`47934 29918 29878 29713 29984 ...` view save

correct output
`71718` view save

user output
`71718` view save

Test 15

Group: 3

Verdict: ACCEPTED

input
`84691 54156 54277 54533 54296 ...` view save

correct output
`123123` view save

user output
`123123` view save

Test 16

Group: 3

Verdict: ACCEPTED

input
`99098 63339 63878 64182 63904 ...` view save

correct output
`142663` view save

user output
`142663` view save

Datatähti 2023 alku

Kertoma

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

Tasks

Submissions (cppbetter)