CSES - Aalto Competitive Programming 2024 - wk8 - Wed - Results
Submission details
Task:Trading NFTs
Sender:aalto2024i_004
Submission time:2024-10-30 16:45:32 +0200
Language:C++ (C++17)
Status:READY
Result:ACCEPTED
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
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.00 sdetails
#15ACCEPTED0.00 sdetails
#16ACCEPTED0.00 sdetails
#17ACCEPTED0.01 sdetails
#18ACCEPTED0.00 sdetails
#19ACCEPTED0.00 sdetails
#20ACCEPTED0.00 sdetails
#21ACCEPTED0.00 sdetails
#22ACCEPTED0.00 sdetails
#23ACCEPTED0.00 sdetails
#24ACCEPTED0.00 sdetails
#25ACCEPTED0.00 sdetails
#26ACCEPTED0.00 sdetails
#27ACCEPTED0.00 sdetails
#28ACCEPTED0.00 sdetails
#29ACCEPTED0.00 sdetails
#30ACCEPTED0.00 sdetails
#31ACCEPTED0.00 sdetails
#32ACCEPTED0.00 sdetails
#33ACCEPTED0.00 sdetails
#34ACCEPTED0.00 sdetails
#35ACCEPTED0.00 sdetails
#36ACCEPTED0.00 sdetails
#37ACCEPTED0.00 sdetails
#38ACCEPTED0.00 sdetails
#39ACCEPTED0.00 sdetails
#40ACCEPTED0.00 sdetails
#41ACCEPTED0.00 sdetails
#42ACCEPTED0.00 sdetails
#43ACCEPTED0.00 sdetails
#44ACCEPTED0.00 sdetails
#45ACCEPTED0.00 sdetails
#46ACCEPTED0.00 sdetails
#47ACCEPTED0.00 sdetails
#48ACCEPTED0.00 sdetails
#49ACCEPTED0.00 sdetails
#50ACCEPTED0.00 sdetails
#51ACCEPTED0.00 sdetails
#52ACCEPTED0.00 sdetails
#53ACCEPTED0.01 sdetails
#54ACCEPTED0.00 sdetails
#55ACCEPTED0.00 sdetails
#56ACCEPTED0.00 sdetails
#57ACCEPTED0.00 sdetails
#58ACCEPTED0.00 sdetails
#59ACCEPTED0.00 sdetails
#60ACCEPTED0.02 sdetails
#61ACCEPTED0.02 sdetails
#62ACCEPTED0.02 sdetails
#63ACCEPTED0.02 sdetails
#64ACCEPTED0.02 sdetails

Code

// ~/.vim/cpp_template.cpp
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <limits>

#define REP(i,a,b) for (int i = a; i < b; i++)

// Type Aliases for 1D and 2D vectors with initialization
#define vi(n, val) vector<int>(n, val) // 1D vector of ints with size n, initialized to val
#define vll(n, val) vector<long long>(n, val) // 1D vector of long longs with size n, initialized to val
#define ll long long
#define vvi(n, m, val) vector<vector<int>>(n, vector<int>(m, val)) // 2D vector of ints (n x m), initialized to val
#define vvll(n, m, val) vector<vector<long long>>(n, vector<long long>(m, val)) // 2D vector of long longs (n x m), initialized to val

#define LL_INF std::numeric_limits<long long int>::max()
#define INF std::numeric_limits<int>::max()


using namespace std;


template <typename T>
void pV(const std::vector<T>& vec, const std::string& label = "Vector") {
    std::cout << label << ": [ ";
    for (const auto& elem : vec) {
        std::cout << elem << " ";
    }
    std::cout << "]" << std::endl;
}


void dfs(int s, vector<bool> *visited, vector<int> (*adj)[]) {
    if ((*visited)[s]) return;
    (*visited)[s] = true;
    // process node s


    for (auto u: (*adj)[s]) {
        dfs(u, visited, adj);
    }
}
/*
// DEPTH-FRIRST-SEARCH
vector<int> adj[N];                                                          
vector<bool> visited(N, false);
int u, v;
for(int i = 0; i < M;i++){
    cin >> u >> v;
    u--;
    v--;
    adj[u].push_back(v);
    adj[v].push_back(u);
}
*/

vector<long long> dijkstra(int N, int x, vector<vector<pair<int,int>>> *adj){
    vector<bool> processed(N, false);
    vector<long long> distance(N, LL_INF);
    priority_queue<pair<long long,int>> q;
    //for (int i = 1; i <= n; i++) distance[i] = INF;
    distance[x] = 0;
    q.push({0,x});
    while (!q.empty()) {
        int a = q.top().second; q.pop();
        if (processed[a]) continue;
        processed[a] = true;
        for (auto u : (*adj)[a]) {
            int b = u.first, w = u.second;
            if (distance[a]+w < distance[b]) {
                distance[b] = distance[a]+w;
                q.push({-distance[b],b});
            }
        }
    }
    return distance;


}


/*
DIJKSTRA
//vector<vector<pair<int,int>>> adj(N, vector<pair<int, int>>(N));
*/



int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    // Your code starts here
    int n;
    cin >> n;
    vector<int> prices(n, 0);
    REP(i, 0, n){
        cin >> prices[i];
    }
    int lmin = prices[0];
    int lmax = prices[0];
    long long res = 0;
  
    int i = 0;
    while(i < n - 1){
      
        while(i < n - 1 && prices[i] >= prices[i + 1])
            i++;
        lmin = prices[i];
       
        while (i < n - 1 && prices[i] <= prices[i + 1])
            i++;
        lmax = prices[i];
      
        res = res + (lmax - lmin);
    }    
    cout << res << endl;


    return 0;
}


Test details

Test 1

Verdict: ACCEPTED

input
1

correct output
0

user output
0

Test 2

Verdict: ACCEPTED

input
2
6 9 

correct output
3

user output
3

Test 3

Verdict: ACCEPTED

input
2
7 3 

correct output
0

user output
0

Test 4

Verdict: ACCEPTED

input
3
8 8 3 

correct output
0

user output
0

Test 5

Verdict: ACCEPTED

input
3
7 7 3 

correct output
0

user output
0

Test 6

Verdict: ACCEPTED

input
4
3 4 10 0 

correct output
7

user output
7

Test 7

Verdict: ACCEPTED

input
4
6 2 1 7 

correct output
6

user output
6

Test 8

Verdict: ACCEPTED

input
4
7 10 10 5 

correct output
3

user output
3

Test 9

Verdict: ACCEPTED

input
4
7 6 3 1 

correct output
0

user output
0

Test 10

Verdict: ACCEPTED

input
5
6 6 7 9 6 

correct output
3

user output
3

Test 11

Verdict: ACCEPTED

input
5
10 4 7 10 0 

correct output
6

user output
6

Test 12

Verdict: ACCEPTED

input
5
4 2 0 10 6 

correct output
10

user output
10

Test 13

Verdict: ACCEPTED

input
5
7 6 0 3 9 

correct output
9

user output
9

Test 14

Verdict: ACCEPTED

input
5
10 9 6 1 10 

correct output
9

user output
9

Test 15

Verdict: ACCEPTED

input
5
9 9 2 2 0 

correct output
0

user output
0

Test 16

Verdict: ACCEPTED

input
5
9 10 2 3 9 

correct output
8

user output
8

Test 17

Verdict: ACCEPTED

input
5
0 2 8 3 4 

correct output
9

user output
9

Test 18

Verdict: ACCEPTED

input
5
10 9 0 2 9 

correct output
9

user output
9

Test 19

Verdict: ACCEPTED

input
5
0 4 5 5 5 

correct output
5

user output
5

Test 20

Verdict: ACCEPTED

input
10
6 6 7 9 6 9 5 9 4 6 

correct output
12

user output
12

Test 21

Verdict: ACCEPTED

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

correct output
18

user output
18

Test 22

Verdict: ACCEPTED

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

correct output
12

user output
12

Test 23

Verdict: ACCEPTED

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

correct output
17

user output
17

Test 24

Verdict: ACCEPTED

input
10
10 9 1 6 6 7 7 9 10 6 

correct output
9

user output
9

Test 25

Verdict: ACCEPTED

input
10
2 0 9 9 2 4 10 10 5 0 

correct output
17

user output
17

Test 26

Verdict: ACCEPTED

input
10
9 0 0 2 3 9 10 1 4 10 

correct output
19

user output
19

Test 27

Verdict: ACCEPTED

input
10
8 2 0 3 4 7 10 5 10 3 

correct output
15

user output
15

Test 28

Verdict: ACCEPTED

input
10
0 2 4 5 9 9 10 2 4 8 

correct output
16

user output
16

Test 29

Verdict: ACCEPTED

input
10
0 0 1 1 3 4 5 5 5 0 

correct output
5

user output
5

Test 30

Verdict: ACCEPTED

input
100
21709340 60895094 76274387 935...

correct output
972142477

user output
972142477

Test 31

Verdict: ACCEPTED

input
100
122815 99147812 137572578 1575...

correct output
4604249565

user output
4604249565

Test 32

Verdict: ACCEPTED

input
100
27838075 198730371 467423860 4...

correct output
5968879174

user output
5968879174

Test 33

Verdict: ACCEPTED

input
100
980649967 962387378 958794495 ...

correct output
3338942575

user output
3338942575

Test 34

Verdict: ACCEPTED

input
100
587586157 967034923 969780558 ...

correct output
3901827208

user output
3901827208

Test 35

Verdict: ACCEPTED

input
100
59249203 221963001 238363352 3...

correct output
5618403578

user output
5618403578

Test 36

Verdict: ACCEPTED

input
100
958701282 356460600 224848373 ...

correct output
13822815556

user output
13822815556

Test 37

Verdict: ACCEPTED

input
100
17083618 26735341 70798610 773...

correct output
3327534770

user output
3327534770

Test 38

Verdict: ACCEPTED

input
100
937837680 11934037 257096282 9...

correct output
15276203568

user output
15276203568

Test 39

Verdict: ACCEPTED

input
100
8099342 11139167 14304400 4160...

correct output
3600585409

user output
3600585409

Test 40

Verdict: ACCEPTED

input
200
589284011 636562059 767928733 ...

correct output
33586949170

user output
33586949170

Test 41

Verdict: ACCEPTED

input
200
447773961 773442531 122815 137...

correct output
32881219020

user output
32881219020

Test 42

Verdict: ACCEPTED

input
200
27838075 165814380 198730371 2...

correct output
8854147317

user output
8854147317

Test 43

Verdict: ACCEPTED

input
200
591414746 75940262 760367934 9...

correct output
29427504978

user output
29427504978

Test 44

Verdict: ACCEPTED

input
200
967034923 918715994 767527829 ...

correct output
10337652892

user output
10337652892

Test 45

Verdict: ACCEPTED

input
200
995683002 995017887 993902125 ...

correct output
2165105185

user output
2165105185

Test 46

Verdict: ACCEPTED

input
200
958701282 886061723 881788058 ...

correct output
2469034633

user output
2469034633

Test 47

Verdict: ACCEPTED

input
200
81935403 244103473 837431430 3...

correct output
29954939049

user output
29954939049

Test 48

Verdict: ACCEPTED

input
200
937837680 11934037 257096282 9...

correct output
31589834039

user output
31589834039

Test 49

Verdict: ACCEPTED

input
200
998298460 993451116 993426019 ...

correct output
1492242772

user output
1492242772

Test 50

Verdict: ACCEPTED

input
1000
921212094 909729625 906523440 ...

correct output
53453101665

user output
53453101665

Test 51

Verdict: ACCEPTED

input
1000
447773961 773442531 122815 137...

correct output
168890114732

user output
168890114732

Test 52

Verdict: ACCEPTED

input
1000
916948986 908988479 878564253 ...

correct output
4480030569

user output
4480030569

Test 53

Verdict: ACCEPTED

input
1000
999247240 996968045 996364069 ...

correct output
4201826090

user output
4201826090

Test 54

Verdict: ACCEPTED

input
1000
967034923 587586157 185430193 ...

correct output
165301071885

user output
165301071885

Test 55

Verdict: ACCEPTED

input
1000
238363352 59249203 934941691 8...

correct output
164615942063

user output
164615942063

Test 56

Verdict: ACCEPTED

input
1000
958701282 881788058 653343571 ...

correct output
56392971596

user output
56392971596

Test 57

Verdict: ACCEPTED

input
1000
81935403 244103473 837431430 3...

correct output
160939345542

user output
160939345542

Test 58

Verdict: ACCEPTED

input
1000
937837680 933290529 876668628 ...

correct output
3903860846

user output
3903860846

Test 59

Verdict: ACCEPTED

input
1000
11139167 391337047 538883743 5...

correct output
177362129341

user output
177362129341

Test 60

Verdict: ACCEPTED

input
100000
589284011 636562059 767928733 ...

correct output
16723625891645

user output
16723625891645

Test 61

Verdict: ACCEPTED

input
100000
999962171 999912371 999862119 ...

correct output
9220956790

user output
9220956790

Test 62

Verdict: ACCEPTED

input
100000
26016 76911 117593 132697 1908...

correct output
6853130410

user output
6853130410

Test 63

Verdict: ACCEPTED

input
100000
591414746 75940262 760367934 9...

correct output
16637307295604

user output
16637307295604

Test 64

Verdict: ACCEPTED

input
100000
967034923 587586157 185430193 ...

correct output
16655555368186

user output
16655555368186