Laskettelukeskus

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

struct slope
{
    int plows = 0;
    vector<int> connections;
};

int main()
{
    int count;
    string temp;
    getline(cin, temp);
    count = temp[0] - '0';
    map<int, slope> slopes;
    for (int i = 0 ; i < count - 1; i++)
    {
        getline(cin, temp);
        int num = temp[0] - '0';
        int connection = temp[2] - '0';

        slope cur;
        if (slopes.find(num) != slopes.end())
        {
            slopes[num].connections.push_back(connection);
        }
        else
        {
            cur.connections = {connection};
            slopes.insert({num, cur});
        }
    }
    getline(cin, temp);

    for (int i = 0; i < int(temp.length()); i += 2)
    {

        slopes[i / 2 + 1].plows = temp[i] - '0';
    }
    int result = 0;
    for (auto s : slopes)
    {
        if (s.second.connections.size() == 0)
        {
            result += s.second.plows;
        }
    }
    cout << result << endl;
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: WRONG ANSWER

Test 3

Group: 1, 2

Verdict: WRONG ANSWER

Test 4

Group: 2

Verdict: WRONG ANSWER

Test 5

Group: 2

Verdict: WRONG ANSWER

Test 6

Group: 1, 2

Verdict: WRONG ANSWER

Test 7

Group: 2

Verdict: WRONG ANSWER

Test 8

Group: 1, 2

Verdict: WRONG ANSWER

Test 9

Group: 2

Verdict: WRONG ANSWER

Test 10

Group: 1, 2

Verdict: WRONG ANSWER

Test 11

Group: 2

Verdict: WRONG ANSWER

Test 12

Group: 1, 2

Verdict: WRONG ANSWER

Test 13

Group: 2

Verdict: WRONG ANSWER