#include<bits/stdc++.h>
using namespace std;
#define INIT ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
#define int ll
/*ifstream fin("climbers.in");
#define cin fin
*/
int n,h[5010];
int d[5010][5010];
multiset<pair<int, pii>> ms;
bool vr[5010][5010];
bool btwn(int p1, int p2, int p3){
return ( (h[p1]<=max(h[p2], h[p3])) && (h[p1]>=min(h[p2], h[p3]) ) );
}
void add_edge(int p, int l, int d0){
if( ((l>=n) || (p<=0))|| (vr[p][l]==true) || (!btwn(p, l, l+1)) || (l<=0) || (p>n) ){return;}
auto it=ms.find({d[p][l], {p, l} });
if(it!=ms.end()){if(d0<d[p][l] ){d[p][l]=d0;ms.erase(it); ms.insert({d[p][l], {p, l} }); } }
else{d[p][l]=d0;ms.insert({d[p][l], {p, l} }); }
}
void edges(int p, int l){
if( (h[p]==h[l]) ){
add_edge(p+1, l-1, d[p][l]+abs(h[p+1]-h[p]) );
add_edge(l-1, p, d[p][l]+abs(h[l-1]-h[p]));
add_edge(p-1, l-1, d[p][l]+abs(h[p-1]-h[p]));
add_edge(l-1, p-1, d[p][l]+abs(h[l-1]-h[p]));
}
if(h[p]==h[l+1]){
add_edge(p+1, l+1, d[p][l]+abs(h[p+1]-h[p]));
add_edge(l+2, p, d[p][l]+abs(h[l+2]-h[p]));
add_edge(p-1, l+1, d[p][l]+abs(h[p-1]-h[p]));
add_edge(l+2, p-1, d[p][l]+abs(h[l+2]-h[p]));
}
if(p==l){
add_edge(p-1, l, d[p][l]+abs(h[p-1]-h[p]));
add_edge(l+1, p-1, d[p][l]+abs(h[l+1]-h[p]));
return;
}
add_edge(p+1, l, d[p][l]+abs(h[p+1]-h[p]));
add_edge(l+1, p, d[p][l]+abs(h[l+1]-h[p]));
add_edge(l, p, d[p][l]+abs(h[l]-h[p]));
add_edge(p-1, l, d[p][l]+abs(h[p-1]-h[p]));
add_edge(l+1, p-1, d[p][l]+abs(h[l+1]-h[p]));
add_edge(l, p-1, d[p][l]+abs(h[l]-h[p]));
}
void dijkstra(){
d[n][1]=0;
ms.insert({0, {n, 1} } );
while(!ms.empty()){
auto f=*ms.begin(); ms.erase(ms.begin());
int x=f.sc.ft, y=f.sc.sc;
d[x][y]=f.ft;
vr[x][y]=true;
edges(x, y);
}
return;
}
int32_t main(){
INIT
cin>>n;
for(int i=1; i<=n; i++){
cin>>h[i];
for(int j=1; j<=n;j++){
d[i][j]=-1;
}
}
int res=((int)1e17);
cout<<res<<"\n"<<flush;
dijkstra();
for(int i=1; i<=n; i++){
if(d[i][i]!=(-1) ){
res=min(res, d[i][i]);
}
}
if(res==((int)1e17) ){cout<<"-1"; return 0;}
cout<<res;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
1280 KB |
Output isn't correct |
| 2 |
Incorrect |
4 ms |
3584 KB |
Output isn't correct |
| 3 |
Incorrect |
23 ms |
17016 KB |
Output isn't correct |
| 4 |
Incorrect |
109 ms |
97640 KB |
Output isn't correct |
| 5 |
Incorrect |
279 ms |
220920 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
640 KB |
Output isn't correct |
| 2 |
Incorrect |
1 ms |
896 KB |
Output isn't correct |
| 3 |
Incorrect |
3 ms |
1792 KB |
Output isn't correct |
| 4 |
Incorrect |
2 ms |
1280 KB |
Output isn't correct |
| 5 |
Incorrect |
8 ms |
4992 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
1280 KB |
Output isn't correct |
| 2 |
Incorrect |
10 ms |
3584 KB |
Output isn't correct |
| 3 |
Incorrect |
446 ms |
17300 KB |
Output isn't correct |
| 4 |
Execution timed out |
1052 ms |
97752 KB |
Time limit exceeded |
| 5 |
Execution timed out |
1059 ms |
97784 KB |
Time limit exceeded |
| 6 |
Execution timed out |
1100 ms |
161432 KB |
Time limit exceeded |
| 7 |
Execution timed out |
1101 ms |
161020 KB |
Time limit exceeded |
| 8 |
Execution timed out |
1106 ms |
221176 KB |
Time limit exceeded |
| 9 |
Execution timed out |
1102 ms |
220572 KB |
Time limit exceeded |
| 10 |
Execution timed out |
1103 ms |
221176 KB |
Time limit exceeded |
