2025 SCPC 2-4

1
#include <bits/stdc++.h>
2
#define fIO ios_base::sync_with_stdio(false); cin.tie(NULL);
3
using namespace std;
4

5
int main()
6
{
7
    fIO
8

9
    int T;
10
    cin >> T;
11

12
    for (int testcase = 1; testcase <= T; testcase++)
13
    {
14
        int N, L;
15
        cin >> N >> L;
16
        vector<int> bomb(N);
17
        for (int i = 0; i < N; i++)
18
            cin >> bomb[i];
19

20

21
        long long mdistance0 = 0, mdistanceL = 0;
22
        int prev0 = 0, prevL = 0;
23

24
        for (int i = 0; i < N; i++)
25
        {
26
            int b = bomb[i];
27
            long long totaldistance0 = min(mdistance0 + abs(prev0 - b) + abs(b - 0),
28
                                mdistanceL + abs(prevL - b) + abs(b - 0));
29
            long long totaldistanceL = min(mdistance0 + abs(prev0 - b) + abs(b - L),
30
                                mdistanceL + abs(prevL - b) + abs(b - L));
31

32
            mdistance0 = totaldistance0;
33
            mdistanceL = totaldistanceL;
34
            prev0 = 0;
35
            prevL = L;
36
        }
37

38
        cout << "Case #" << testcase << endl;
39
        cout << min(mdistance0, mdistanceL) << endl;
40
    }
41

42
    return 0;
43
}