Lumimyrsky

input/code.cpp: In function 'auto solve()':
input/code.cpp:45:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     for (int i = 0; i < a.size()-1; i++){
      |                     ~~^~~~~~~~~~~~
input/code.cpp:50:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |     for (int i = 0; i < b.size()-1; i++){
      |                     ~~^~~~~~~~~~~~
input/code.cpp: In instantiation of 'void print(auto:47, std::string, bool) [with auto:47 = int; std::string = std::__cxx11::basic_string<char>]':
input/code.cpp:64:10:   required from here
input/code.cpp:13:50: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 | #d...

#include <bits/stdc++.h>

using namespace std;

// Shorter types
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
typedef vector<vll> adjList;
typedef vector<vector<pll>> adjwList;

// Macros
#define LOOP(i, start, end) for (ll i = start; i <= end; i++)
#define FE_LOOP(i, collection) LOOP(i, 0, collection.size())
#define SORT(v) sort(v.begin(), v.end())
#define REV_SORT(v) sort(v.rbegin(), v.rend())

// Variables
vll a = vll(10), b = vll(10);

void read_input(){
    for (int i = 0; i < 10; i++) cin >> a[i];
    for (int i = 0; i < 10; i++) cin >> b[i];
}

void print(auto toPrint, const string clazz, bool newLines){
    if (clazz == "vector<ll>"){
        vll toPrintVec = (vll)toPrint;

        FE_LOOP(i, toPrintVec){
            cout << toPrintVec[i] << (newLines ? "\n" : " ");
        }
        cout << (newLines ? "" : "\n");
        return;
    }
    cout << toPrint << (newLines ? "\n" : "");
}

// Libs


// Solution
auto solve(){
    ll ascent1 = 0;
    for (int i = 0; i < a.size()-1; i++){
        ll curAscent = a[i+1] - a[i];
        if (curAscent > 0) ascent1 += curAscent;
    }
    ll ascent2 = 0;
    for (int i = 0; i < b.size()-1; i++){
        ll curAscent = b[i+1] - b[i];
        if (curAscent > 0) ascent2 += curAscent;
    }

    return ascent1 < ascent2 ? 1 : 2;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    read_input();
    auto result = solve();
    print(result, "", true);

    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED