oj.uz

Submission #321040

# Submission time Handle Problem Language Result Execution time Memory
321040 2020-11-10T17:27:40 Z ssense Climbers (RMI18_climbers) C++14
0 / 100
 2 ms 492 KB 
#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef unsigned long long ull;
typedef long long  ll;
using namespace std;
#define FOR(n) for(int i=0;i<n;i++)
#define vt vector
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define sz(a) (int)a.size()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define NMAX 100005
#define MXL 1000000000000000000
#define PI 3.14159265
#define pb push_back
#define pf push_front
#define sc second
#define endl '\n'
#define fr first
#define int ll
#define ld long double


int ceildiv(int one, int two) {
	if (one % two == 0) {return one / two;}
	else {return one / two + 1;}
} int power(int n, int pow, int m) {
	if (pow == 0) return 1;
	if (pow % 2 == 0) {
		ll x = power(n, pow / 2, m);
		return (x * x) % m;
	}
	else return (power(n, pow - 1, m) * n) % m;
} int gcd(int a, int b) {
	if (!b)return a;
	return gcd(b, a % b);
} int factorial(int n, int mod) {
	if (n > 1)
		return (n * factorial(n - 1, mod)) % mod;
	else
		return 1;
} int lcm(int a, int b) {
	return (a * b) / gcd(a, b);
} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}

void solve() {
	int n;
	cin >> n;
	vint a = read(n);
	int ans = 0;
	int x = *max_element(all(a));
	for (int i = 1; i < n; i++)
	{
		ans += abs(a[i] - a[i - 1]);
		if (a[i] == x)
		{
			break;
		}
	}
	cout << ans << endl;
}


int32_t main() {
//#ifndef ONLINE_JUDGE
//	freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);
//#endif
	solve();
}

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Incorrect 1 ms 364 KB Output isn't correct
4 Incorrect 1 ms 364 KB Output isn't correct
5 Incorrect 2 ms 492 KB Output isn't correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Incorrect 0 ms 364 KB Output isn't correct
3 Incorrect 1 ms 364 KB Output isn't correct
4 Incorrect 1 ms 384 KB Output isn't correct
5 Incorrect 1 ms 364 KB Output isn't correct

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Incorrect 1 ms 360 KB Output isn't correct
3 Incorrect 1 ms 364 KB Output isn't correct
4 Incorrect 1 ms 364 KB Output isn't correct
5 Incorrect 2 ms 364 KB Output isn't correct
6 Incorrect 2 ms 364 KB Output isn't correct
7 Incorrect 2 ms 364 KB Output isn't correct
8 Incorrect 2 ms 492 KB Output isn't correct
9 Incorrect 2 ms 492 KB Output isn't correct
10 Incorrect 2 ms 492 KB Output isn't correct