CSES - Datatähti 2024 alku - Results
Submission details
Task:Laskettelukeskus
Sender:onokk
Submission time:2023-10-31 10:45:08 +0200
Language:C++ (C++20)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2details
#20.00 s1, 2details
#30.00 s1, 2details
#40.00 s2details
#50.00 s2details
#60.00 s1, 2details
#70.00 s2details
#80.00 s1, 2details
#90.00 s2details
#100.00 s1, 2details
#110.00 s2details
#120.00 s1, 2details
#130.00 s2details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:38:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |     for (int i = 0; i < temp.length(); i += 2)
      |                     ~~^~~~~~~~~~~~~~~
In copy constructor 'slope::slope(const slope&)',
    inlined from 'constexpr std::pair<_T1, _T2>::pair(_U1&&, _U2&&) [with _U1 = int&; _U2 = slope&; typename std::enable_if<(std::_PCC<true, _T1, _T2>::_MoveConstructiblePair<_U1, _U2>() && std::_PCC<true, _T1, _T2>::_ImplicitlyMoveConvertiblePair<_U1, _U2>()), bool>::type <anonymous> = true; _T1 = const int; _T2 = slope]' at /usr/include/c++/11/bits/stl_pair.h:353:35,
    inlined from 'int main()' at input/code.cpp:33:26:
input/code.cpp:6:8: warning: 'cur.slope::plows' may be used uninitialized [-Wmaybe-uninitialized]
    6 | struct slope
      |        ^~~~~
input/code.cpp: In function 'int main()':
input/cod...

Code

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

struct slope
{
    int plows;
    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 < 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 details

Test 1

Group: 1, 2

Verdict: ACCEPTED

input
5
1 2
1 3
3 4
3 5
...

correct output
6

user output
6

Test 2

Group: 1, 2

Verdict:

input
100
1 73
1 64
64 23
1 88
...

correct output
2675

user output
8

Test 3

Group: 1, 2

Verdict:

input
100
1 36
36 56
56 59
36 97
...

correct output
2808

user output
4

Test 4

Group: 2

Verdict:

input
100000
1 45452
1 74209
45452 78960
45452 79820
...

correct output
28399367694319

user output
11

Test 5

Group: 2

Verdict:

input
100000
1 31165
1 23263
31165 89516
31165 53122
...

correct output
28546840313799

user output
10

Test 6

Group: 1, 2

Verdict:

input
100
1 79
79 9
79 45
45 10
...

correct output
0

user output
8

Test 7

Group: 2

Verdict:

input
100000
1 66038
1 56789
56789 7403
66038 69542
...

correct output
0

user output
15

Test 8

Group: 1, 2

Verdict:

input
100
1 2
2 3
3 4
4 5
...

correct output
100

user output
3

Test 9

Group: 2

Verdict:

input
100000
1 2
2 3
3 4
4 5
...

correct output
1000000000

user output
3

Test 10

Group: 1, 2

Verdict:

input
100
1 2
1 3
2 4
2 5
...

correct output
2809

user output
3

Test 11

Group: 2

Verdict:

input
100000
1 2
1 3
2 4
2 5
...

correct output
26053917212428

user output
3

Test 12

Group: 1, 2

Verdict:

input
100
1 2
1 3
2 4
2 5
...

correct output
5000

user output
3

Test 13

Group: 2

Verdict:

input
100000
1 2
1 3
2 4
2 5
...

correct output
50000000000000

user output
3