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
| #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 1010
#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 solve(vvll& A) {
for(auto& a : A)
sort(all(a));
ll inc = 0, dec = 0, mi = 0, ma = 0;
for(auto& a : A) {
sort(all(a));
ll ninc, ndec, gap = a.back() - a[0];
ninc = min(inc + abs(ma - a[0]), dec + abs(mi - a[0])) + gap;
ndec = min(inc + abs(ma - a.back()), dec + abs(mi - a.back())) + gap;
mi = a[0], ma = a.back();
inc = ninc, dec = ndec;
}
return min(inc, dec);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.setf(ios::fixed);
cout.precision(6);
ll tc, n, p;
cin>>tc;
for(ll i = 1; i <= tc; i++) {
cin>>n>>p;
vvll A(n, vll(p));
for(ll i = 0; i < n; i++)
for(ll j = 0; j < p; j++)
cin>>A[i][j];
cout<<"Case #"<<i<<": "<<solve(A)<<'\n';
}
return 0;
}
|
