# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
487218 | 2021-11-14T20:19:57 Z | Karuk | Climbers (RMI18_climbers) | C++14 | 2 ms | 332 KB |
#include<bits/stdc++.h> using namespace std; void solve() { int n; cin>>n; vector<int>a; int maxi=0,sum=0; for(int i=0;i<n;i++) { int x; cin>>x; if(a.size()>0 && a.size()%2 && x>a[a.size()-1])a[a.size()-1]=x; else if(a.size()>0 && a.size()%2==0 && x<a[a.size()-1])a[a.size()-1]=x; else a.push_back(x); } for(int i=0;i<a.size();i++) { if(i>0) { sum+=abs(a[i]-a[i-1]); maxi=max(maxi,abs(a[i]-a[i-1])); } } cout<<sum-maxi<<endl; } int main() { solve(); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Output isn't correct |
2 | Incorrect | 0 ms | 204 KB | Output isn't correct |
3 | Incorrect | 0 ms | 204 KB | Output isn't correct |
4 | Incorrect | 1 ms | 204 KB | Output isn't correct |
5 | Incorrect | 2 ms | 332 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Output isn't correct |
2 | Incorrect | 0 ms | 204 KB | Output isn't correct |
3 | Incorrect | 0 ms | 204 KB | Output isn't correct |
4 | Incorrect | 0 ms | 204 KB | Output isn't correct |
5 | Incorrect | 0 ms | 204 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Output isn't correct |
2 | Incorrect | 1 ms | 288 KB | Output isn't correct |
3 | Incorrect | 1 ms | 204 KB | Output isn't correct |
4 | Incorrect | 1 ms | 204 KB | Output isn't correct |
5 | Incorrect | 1 ms | 204 KB | Output isn't correct |
6 | Incorrect | 2 ms | 204 KB | Output isn't correct |
7 | Incorrect | 1 ms | 204 KB | Output isn't correct |
8 | Incorrect | 2 ms | 332 KB | Output isn't correct |
9 | Incorrect | 2 ms | 332 KB | Output isn't correct |
10 | Incorrect | 2 ms | 332 KB | Output isn't correct |