# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
769955 | raysh07 | Growing Vegetables is Fun 4 (JOI21_ho_t1) | C++17 | 22 ms | 5408 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
void Solve()
{
int n; cin >> n;
vector <int> a(n), d(n);
int a1 = 0, a2 = 0;
for (int i = 0; i < n; i++){
cin >> a[i];
if (i != 0) {
d[i] = a[i] - a[i - 1];
d[i] = -d[i];
if (d[i] <= 0) a1 += 1 - d[i];
}
}
int ans = a1;
for (int i = 1; i < n; i++){
int x = d[i];
if (x <= 0) a1 -= 1 - x;
if (x >= 0) a2 += 1 + x;
// cout << a1 << " " << a2 << "\n";
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |