CSES - Datatähti 2023 alku

Submission details
Task:	Sadonkorjuu
Sender:	okkokko
Submission time:	2022-11-11 16:35:37 +0200
Language:	C++ (C++11)
Status:	READY
Result:	33

Feedback
group	verdict	score
#1	ACCEPTED	33
#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	ACCEPTED	0.01 s	1, 2	details
#7	ACCEPTED	0.38 s	2	details
#8	ACCEPTED	0.01 s	1, 2	details
#9	ACCEPTED	0.39 s	2	details
#10	ACCEPTED	0.01 s	1, 2	details
#11	ACCEPTED	0.38 s	2	details
#12	WRONG ANSWER	0.29 s	2	details
#13	ACCEPTED	0.29 s	2	details
#14	ACCEPTED	0.29 s	2	details
#15	ACCEPTED	0.01 s	1, 2	details
#16	ACCEPTED	0.01 s	1, 2	details
#17	ACCEPTED	0.01 s	1, 2	details
#18	ACCEPTED	0.01 s	1, 2	details
#19	ACCEPTED	0.01 s	1, 2	details
#20	ACCEPTED	0.01 s	1, 2	details
#21	ACCEPTED	0.28 s	2	details
#22	ACCEPTED	0.28 s	2	details
#23	ACCEPTED	0.29 s	2	details
#24	ACCEPTED	0.01 s	1, 2	details
#25	ACCEPTED	0.28 s	2	details
#26	ACCEPTED	0.01 s	1, 2	details
#27	ACCEPTED	0.27 s	2	details
#28	ACCEPTED	0.01 s	1, 2	details
#29	ACCEPTED	0.27 s	2	details
#30	ACCEPTED	0.01 s	1, 2	details
#31	ACCEPTED	0.28 s	2	details

Code

#include <iostream>
#include <vector>
#include <map>
using namespace std;

vector<int> cities;
vector<map<int, int>> connections;
/* see if you can determine how much length is reduced when a child is shortened*/
class Node
{
public:
    bool is_root;
    Node *parent;
    vector<Node> children;
    int distance;
    int city_type;
    int id;
    int closest;
    bool closest_is_infinity;
    bool checked;
    uint marker = 0;
    Node()
    {
    }
    Node(Node &parent_, bool is_root_, int id_, int distance_, int city_type_)
    {
        is_root = is_root_;
        parent = &parent_;
        id = id_;
        distance = distance_;
        city_type = city_type_;
        closest = 0;
        closest_is_infinity = city_type_;
        checked = false;
    }
    void form_children()
    {
        map<int, int>::iterator itr;
        for (itr = connections[id].begin(); itr != connections[id].end(); ++itr)
        {
            if (itr->first != parent->id)
            {
                children.push_back(Node(*this, false, itr->first, itr->second, (int)(cities[itr->first])));
            }
        }
    }
    Node *next()
    {
        if (marker < children.size())
        {
            marker += 1;
            return &(children[marker - 1]);
        }
        else
        {
            marker = 0;
            return parent;
        }
    }
};

int main()
{
    int n;
    cin >> n;
    cities.reserve(n);
    connections = vector<map<int, int>>(n);
    int a, b, c;
    for (int i = 0; i < n; i++)
    {
        cin >> a;
        cities.push_back(a);
    }

    for (int i = 0; i < n - 1; i++)
    {
        cin >> a >> b >> c;
        connections[a - 1][b - 1] = c;
        connections[b - 1][a - 1] = c;
    }
    Node ghost;
    Node head = Node(ghost, true, 0, 0, cities[0]);
    Node *city = &head;
    city->form_children();
    Node *neue;
    while (city != &ghost)
    {
        neue = city->next();
        if (neue == &ghost)
        {
            break;
        }
        if (city->marker == 0)
        {
            if ((!city->closest_is_infinity) and (neue->closest_is_infinity or (neue->closest > city->closest + city->distance)))
            {
                neue->closest = city->closest + city->distance;
                neue->closest_is_infinity = false;
                neue->marker = 0;
            }
            city = neue;
        }
        else
        {

            if ((!city->closest_is_infinity) and (neue->closest_is_infinity or (neue->closest > city->closest + neue->distance)))
            {
                neue->closest = city->closest + neue->distance;
                neue->closest_is_infinity = false;
                city = neue;
            }
            if (!neue->checked)
            {
                neue->checked = true;
                city = neue;
                city->form_children();
            }
        }
    }

    int total = 0;
    city = &head;
    while (city != &ghost)
    {
        neue = city->next();
        if (city->marker == 0)
        {
            total += city->closest;
        }
        city = neue;
    }
    cout << total << "\n";

    return 0;
}

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: ACCEPTED

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
`5506363` view save

Test 7

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
`1795118520` view save

user output
`1795118520` view save

Test 8

Group: 1, 2

Verdict: ACCEPTED

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
`293576` view save

Test 9

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
`816932444` view save

user output
`816932444` view save

Test 10

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
`3089` view save

user output
`3089` view save

Test 11

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
`40839` view save

user output
`40839` view save

Test 12

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
`5683983203973` view save

user output
`1741471365` 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

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 (okkokko)