CSES - Datatähti 2024 alku - Results
Submission details
Task:Lumimyrsky
Sender:Pikaksi
Submission time:2023-10-31 22:18:08 +0200
Language:C++20
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED100
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#11ACCEPTED0.00 sdetails

Compiler report

input/code.cpp: In function 'int GetHeight(std::vector<int>)':
input/code.cpp:47:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |     for (int i = 0; i < path.size() - 1; ++i) {
      |                     ~~^~~~~~~~~~~~~~~~~

Code

#include <iostream>
#include <math.h>
#include <sstream>
#include <vector>
#include <algorithm>
using namespace std;

int GetHeight(vector<int> path);

int main()
{
    string input1;
    string input2;
    getline(cin, input1);
    getline(cin, input2);

    vector<int> firstPath = vector<int>();
    vector<int> secondPath = vector<int>();
    
    string output;

    stringstream ss(input1);
    while (getline(ss, output, ' ')) {
        firstPath.push_back(stoi(output));
    }

    stringstream ss2(input2);
    while (getline(ss2, output, ' ')) {
        secondPath.push_back(stoi(output));
    }

    int firstPathHeight = GetHeight(firstPath);
    int secondPathHeight = GetHeight(secondPath);

    if (firstPathHeight < secondPathHeight) {
        cout << 1;
    }
    else {
        cout << 2;
    }
}

int GetHeight(vector<int> path)
{
    int height = 0;

    for (int i = 0; i < path.size() - 1; ++i) {
        height += clamp(path[i + 1] - path[i], 0, 555);
    }

    return height;
}

Test details

Test 1

Verdict: ACCEPTED

input
0 0 1 1 1 2 2 2 1 0
0 1 2 3 2 2 3 0 1 1

correct output
1

user output
1

Test 2

Verdict: ACCEPTED

input
1 1 1 1 1 1 1 1 0 1
1 0 0 0 1 0 1 0 0 0

correct output
1

user output
1

Test 3

Verdict: ACCEPTED

input
1 2 2 2 0 0 0 2 0 0
0 1 0 1 1 2 1 2 1 2

correct output
1

user output
1

Test 4

Verdict: ACCEPTED

input
4 2 0 10 6 10 4 5 4 3
3 1 2 7 6 1 3 5 2 6

correct output
2

user output
2

Test 5

Verdict: ACCEPTED

input
6 0 7 9 3 1 5 6 9 4
9 0 1 0 2 2 0 1 4 7

correct output
2

user output
2

Test 6

Verdict: ACCEPTED

input
10 9 6 1 10 9 7 6 7 6
2 1 10 2 0 7 2 9 4 6

correct output
1

user output
1

Test 7

Verdict: ACCEPTED

input
22 5 87 83 20 36 92 98 49 9
61 40 77 35 52 49 29 100 18 81

correct output
1

user output
1

Test 8

Verdict: ACCEPTED

input
90 95 33 21 82 6 4 37 10 99
60 10 53 61 42 53 33 48 62 83

correct output
2

user output
2

Test 9

Verdict: ACCEPTED

input
7 22 78 32 44 98 73 46 98 31
54 26 50 8 7 42 27 1 50 53

correct output
2

user output
2

Test 10

Verdict: ACCEPTED

input
88 1 97 24 87 38 53 82 23 42
1 61 43 77 40 40 52 88 48 93

correct output
2

user output
2

Test 11

Verdict: ACCEPTED

input
1 36 50 50 50 0 13 31 14 1
22 88 42 13 25 13 8 39 34 49

correct output
1

user output
1