1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
| #include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#define MAX_N 2020
#define ll long long
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vll vector<ll>
#define vvll vector<vll>
#define all(a) begin(a), end(a)
using namespace std;
ll dp[401][401][2];
ll helper(vll& pad, ll& d, ll n, ll l, ll r, bool bi) {
if(l > r) return 0;
if(dp[l][r][bi] != -1) return dp[l][r][bi];
ll k = 0;
if(!bi and l > 0) k = d - pad[l-1];
else if(bi and r < n) k = d - pad[r+1];
ll vl = (pad[l] + k) % d;
ll vr = (pad[r] + k) % d;
dp[l][r][bi] = min(
helper(pad,d,n,l+1,r,0) + min(vl, d - vl),
helper(pad, d, n, l, r - 1, 1) + min(vr, d - vr)
);
return dp[l][r][bi];
}
ll solve(vll& pad, ll& n, ll& d) {
ll nn = 1;
memset(dp,-1,sizeof dp);
for(ll i = 1; i < n; i++) {
if(pad[i] == pad[nn - 1]) continue;
pad[nn++] = pad[i];
}
return helper(pad, d, nn-1, 0, nn-1, false);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll tc, n, d;
cin>>tc;
for(ll i = 1; i <= tc; i++) {
cin>>n>>d;
vll pad(n);
for(ll j = 0; j < n; j++) cin>>pad[j];
cout<<"Case #"<<i<<": "<<solve(pad, n, d)<<'\n';
}
return 0;
}
|
