CSES - Datatähti 2023 alku

CSES - Datatähti 2023 alku - Results

Submission details
Task:	Sadonkorjuu
Sender:	chaotic
Submission time:	2022-11-05 16:24:39 +0200
Language:	C++17
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.00 s	1, 2	details
#2	ACCEPTED	0.00 s	1, 2	details
#3	ACCEPTED	0.00 s	1, 2	details
#4	ACCEPTED	0.00 s	1, 2	details
#5	ACCEPTED	0.00 s	1, 2	details
#6	WRONG ANSWER	0.00 s	1, 2	details
#7	WRONG ANSWER	0.11 s	2	details
#8	WRONG ANSWER	0.00 s	1, 2	details
#9	WRONG ANSWER	0.11 s	2	details
#10	WRONG ANSWER	0.00 s	1, 2	details
#11	WRONG ANSWER	0.12 s	2	details
#12	ACCEPTED	0.11 s	2	details
#13	ACCEPTED	0.13 s	2	details
#14	ACCEPTED	0.12 s	2	details
#15	ACCEPTED	0.00 s	1, 2	details
#16	ACCEPTED	0.00 s	1, 2	details
#17	ACCEPTED	0.00 s	1, 2	details
#18	ACCEPTED	0.00 s	1, 2	details
#19	ACCEPTED	0.00 s	1, 2	details
#20	ACCEPTED	0.00 s	1, 2	details
#21	ACCEPTED	0.10 s	2	details
#22	ACCEPTED	0.10 s	2	details
#23	ACCEPTED	0.10 s	2	details
#24	ACCEPTED	0.01 s	1, 2	details
#25	ACCEPTED	0.10 s	2	details
#26	ACCEPTED	0.00 s	1, 2	details
#27	ACCEPTED	0.09 s	2	details
#28	ACCEPTED	0.00 s	1, 2	details
#29	ACCEPTED	0.09 s	2	details
#30	ACCEPTED	0.00 s	1, 2	details
#31	ACCEPTED	0.10 s	2	details

Compiler report

input/code.cpp: In lambda function:
input/code.cpp:37:9: warning: control reaches end of non-void function [-Wreturn-type]
   37 |         };
      |         ^
input/code.cpp: In member function 'City::Dir City::get_dir(City*)':
input/code.cpp:52:5: warning: control reaches end of non-void function [-Wreturn-type]
   52 |     }
      |     ^
input/code.cpp: In member function 'll City::shortest_not_in(City::Dir)':
input/code.cpp:93:5: warning: control reaches end of non-void function [-Wreturn-type]
   93 |     }
      |     ^

Code

#include <algorithm>
#include <cassert>
#include <chrono>
#include <climits>
#include <iostream>
#include <memory>
#include <numeric>
#include <sstream>
#include <thread>
#include <vector>

using ll = long long;

struct City {
    enum class Dir {
        Up,
        Left,
        Right,
        None
    };

    City* up    = nullptr;
    City* left  = nullptr;
    City* right = nullptr;
    ll up_d     = LLONG_MAX;
    ll left_d   = LLONG_MAX;
    ll right_d  = LLONG_MAX;

    bool port;

    void connect(City& o, ll dist) {
        auto choose = [](City& c) {
            if (!c.up) return std::pair{ &c.up, &c.up_d };
            if (!c.left) return std::pair{ &c.left, &c.left_d };
            if (!c.right) return std::pair{ &c.right, &c.right_d };
            //            assert(false);
        };

        auto tgt = choose(*this);
        auto src = choose(o);

        *tgt.first  = &o;
        *tgt.second = dist;
        *src.first  = this;
        *src.second = dist;
    }
    Dir get_dir(City* c) {
        if (c == up) return Dir::Up;
        if (c == left) return Dir::Left;
        if (c == right) return Dir::Right;
        //        assert(false);
    }

    static ll add(ll a, ll b) {
        if (a == LLONG_MAX || b == LLONG_MAX) return LLONG_MAX;
        return a + b;
    }

    ll fdist_port;
    Dir fdir_from;
    ll ud = LLONG_MAX;
    ll ld = LLONG_MAX;
    ll rd = LLONG_MAX;

    void first_pass(Dir dir) {
        ll pd = port ? 0 : LLONG_MAX;

        fdir_from = dir;
        if (dir != Dir::Up && up) {
            auto d = up->get_dir(this);
            up->first_pass(d);
            ud = add(up->fdist_port, up_d);
        }
        if (dir != Dir::Right && right) {
            auto d = right->get_dir(this);
            right->first_pass(d);
            rd = add(right->fdist_port, right_d);
        }
        if (dir != Dir::Left && left) {
            auto d = left->get_dir(this);
            left->first_pass(d);
            ld = add(left->fdist_port, left_d);
        }
        fdist_port = std::min({ ud, ld, rd, pd });
    }

    ll shortest_not_in(Dir d) {
        if (port) return 0;
        if (d == Dir::Left) return std::min(ud, rd);
        if (d == Dir::Right) return std::min(ud, ld);
        if (d == Dir::Up) return std::min(ld, rd);
        //        assert(false);
    }

    inline static ll res = 0;
    ll shortest          = LLONG_MAX;
    void second_pass() {
        if (fdir_from == Dir::None) {
            // Root
            res += fdist_port;
            shortest = fdist_port;
            if (up) up->second_pass();
            if (right) right->second_pass();
            if (left) left->second_pass();
            return;
        }
        if (fdir_from == Dir::Up) {
            ll sd    = shortest_not_in(fdir_from);
            shortest = std::min(add(up->shortest, up_d), sd);
            res += shortest;
            if (left) left->second_pass();
            if (right) right->second_pass();
        }
        if (fdir_from == Dir::Left) {
            ll sd    = shortest_not_in(fdir_from);
            shortest = std::min(add(left->shortest, left_d), sd);
            res += shortest;
            if (up) up->second_pass();
            if (right) right->second_pass();
        }
        if (fdir_from == Dir::Right) {
            ll sd    = shortest_not_in(fdir_from);
            shortest = std::min(add(right->shortest, right_d), sd);
            res += shortest;
            if (up) up->second_pass();
            if (left) left->second_pass();
        }
    }
};

int main() {
    std::cin.sync_with_stdio(false);
    auto& stream = std::cin;

    //    std::stringstream ss{
    //        R"(6
    //            1 0 0 0 1 1
    //            2 1 20
    //            2 3 30
    //            2 5 50
    //            6 3 60
    //            1 4 10
    //                                          )"
    //    };
    //    ss.copyfmt(std::cin);
    //    ss.exceptions(ss.badbit | ss.failbit);
    //    auto& stream = ss;

    int n;
    stream >> n;

    std::vector<City> cities;
    cities.reserve(n);
    for (int i = 0; i < n; ++i) {
        //
        int v;
        stream >> v;
        City nw{};
        nw.port = v == 0 ? true : false;
        cities.push_back(nw);
    }
    for (int i = 0; i < n - 1; ++i) {
        int a, b, c;
        stream >> a >> b >> c;
        cities[a - 1].connect(cities[b - 1], c);
    }

    cities[0].first_pass(City::Dir::None);

    //    for (auto& c : cities) { std::cout << c.fdist_port << "\n"; }
    cities[0].second_pass();
    std::cout << City::res;
}

Test details

Test 1

Group: 1, 2

Verdict: ACCEPTED

input
`1 0` view save

correct output
`0` view save

user output
`0` view save

Test 2

Group: 1, 2

Verdict: ACCEPTED

input
`5 0 0 0 0 0 1 2 1 2 3 2 3 4 3 ...` view save

correct output
`0` view save

user output
`0` view save

Test 3

Group: 1, 2

Verdict: ACCEPTED

input
`4 1 0 1 1 1 2 10 2 3 20 2 4 30` view save

correct output
`60` view save

user output
`60` view save

Test 4

Group: 1, 2

Verdict: ACCEPTED

input
`5 0 1 1 1 0 1 2 10 2 3 20 3 4 30 ...` view save

correct output
`80` view save

user output
`80` view save

Test 5

Group: 1, 2

Verdict: ACCEPTED

input
`5 0 1 0 1 1 1 2 1 2 3 5 3 4 3 ...` view save

correct output
`6` view save

user output
`6` view save

Test 6

Group: 1, 2

Verdict: WRONG ANSWER

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`5506363` view save

user output
`9223372036854775777` view save

Test 7

Group: 2

Verdict: WRONG ANSWER

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1795118520` view save

user output
`-84` view save

Test 8

Group: 1, 2

Verdict: WRONG ANSWER

input
`1000 0 0 1 0 1 1 0 1 0 1 1 0 0 0 1 ...` view save

correct output
`293576` view save

user output
`7340` view save

Test 9

Group: 2

Verdict: WRONG ANSWER

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`816932444` view save

user output
`-56` view save

Test 10

Group: 1, 2

Verdict: WRONG ANSWER

input
`1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`3089` view save

user output
`0` view save

Test 11

Group: 2

Verdict: WRONG ANSWER

input
`200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`40839` view save

user output
`0` view save

Test 12

Group: 2

Verdict: ACCEPTED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`5683983203973` view save

user output
`5683983203973` view save

Test 13

Group: 2

Verdict: ACCEPTED

input
`200000 0 1 1 1 1 1 1 0 0 0 1 1 0 1 0 ...` view save

correct output
`58572993` view save

user output
`58572993` view save

Test 14

Group: 2

Verdict: ACCEPTED

input
`200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`32755` view save

user output
`32755` view save

Test 15

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`126238345` view save

user output
`126238345` view save

Test 16

Group: 1, 2

Verdict: ACCEPTED

input
`1000 0 0 0 1 0 1 1 1 0 0 1 0 1 1 0 ...` view save

correct output
`278678` view save

user output
`278678` view save

Test 17

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 ...` view save

correct output
`34929` view save

user output
`34929` view save

Test 18

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1543963` view save

user output
`1543963` view save

Test 19

Group: 1, 2

Verdict: ACCEPTED

input
`1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`39606` view save

user output
`39606` view save

Test 20

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 0 1 0 1 0 0 0 0 1 1 0 0 0 1 ...` view save

correct output
`321598` view save

user output
`321598` view save

Test 21

Group: 2

Verdict: ACCEPTED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`978670626` view save

user output
`978670626` view save

Test 22

Group: 2

Verdict: ACCEPTED

input
`200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`375218` view save

user output
`375218` view save

Test 23

Group: 2

Verdict: ACCEPTED

input
`200000 1 1 1 1 0 0 0 0 0 1 0 1 0 1 1 ...` view save

correct output
`60422556` view save

user output
`60422556` view save

Test 24

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`291990` view save

user output
`291990` view save

Test 25

Group: 2

Verdict: ACCEPTED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`59607954` view save

user output
`59607954` view save

Test 26

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`990` view save

user output
`990` view save

Test 27

Group: 2

Verdict: ACCEPTED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`199982` view save

user output
`199982` view save

Test 28

Group: 1, 2

Verdict: ACCEPTED

input
`1000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`7987` view save

user output
`7987` view save

Test 29

Group: 2

Verdict: ACCEPTED

input
`200000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`3137875` view save

user output
`3137875` view save

Test 30

Group: 1, 2

Verdict: ACCEPTED

input
`1000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`4657693` view save

user output
`4657693` view save

Test 31

Group: 2

Verdict: ACCEPTED

input
`200000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1652889357` view save

user output
`1652889357` view save

Datatähti 2023 alku

Sadonkorjuu

Compiler report

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

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Tasks

Submissions (chaotic)