-
Notifications
You must be signed in to change notification settings - Fork 0
/
rabbit_house.cpp
60 lines (59 loc) · 1.65 KB
/
rabbit_house.cpp
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
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ll t;
cin>>t;
for(ll x=1;x<=t;x++){
ll r,c,k;
cin>>r>>c;
ll mat[r][c];
for(ll i=0;i<r;i++){
for(ll j=0;j<c;j++){
cin>>mat[i][j];
}
}
ll z=10;
ll ans=0;
while(z>0){
z=0;
for(ll i=0;i<r;i++){
for(ll j=0;j<c-1;j++){
if(mat[i][j+1]>(mat[i][j]+1)){
k=((mat[i][j+1]-mat[i][j])-1);
ans+=k;
mat[i][j]+=k;
z++;
}
}
for(ll j=c-1;j>0;j--){
if(mat[i][j-1]>(mat[i][j]+1)){
k=((mat[i][j-1]-mat[i][j])-1);
ans+=k;
mat[i][j]+=k;
z++;
}
}
}
for(ll j=0;j<c;j++){
for(ll i=0;i<r-1;i++){
if(mat[i+1][j]>(mat[i][j]+1)){
k=((mat[i+1][j]-mat[i][j])-1);
ans+=k;
mat[i][j]+=k;
z++;
}
}
for(ll i=r-1;i>0;i--){
if(mat[i-1][j]>(mat[i][j]+1)){
k=((mat[i-1][j]-mat[i][j])-1);
ans+=k;
mat[i][j]+=k;
z++;
}
}
}
}
cout<<"Case #"<<x<<": "<<ans<<endl;
}
}