Submission #1279537

#TimeUsernameProblemLanguageResultExecution timeMemory
1279537ducanh0811Growing Vegetables is Fun 4 (JOI21_ho_t1)C++20
0 / 100
1 ms712 KiB
#include <bits/stdc++.h> #define int long long #define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i) #define REV(i, a, b) for (int i = (a), _b = (b); i >= _b; --i) using namespace std; #define MAXN 200002 int a[MAXN]; int n; int sum = 0; void DQ(int l, int r){ int fl = l, fr = r; while (a[fl] + (fl != l) * sum > a[fl - 1]){ if (fl != l) a[fl] += sum; fl++; } while (a[fr] + (fr != r) * sum > a[fr + 1]){ if (fr != r) a[fr] += sum; fr--; } // cout << "test: "; // FOR(i, 1, n) cout << setw(3) << a[i] << " "; // cout << '\n'; // cout << "find: " << fl << " " << fr << " " << sum << '\n'; if (fl > fr) { if (a[fl] == a[fr]) sum++; return; } int mi = min(a[fl - 1] + 1 - a[fl], a[fr + 1] + 1 - a[fr]); sum += mi; a[fl] += sum; a[fr] += sum; DQ(fl, fr); } void solve(){ cin >> n; FOR(i, 1, n){ cin >> a[i]; } DQ(1, n); cout << sum; } #define task "test" int32_t main(){ if (fopen(task".inp","r")){ freopen(task".inp","r",stdin); freopen(task".out","w",stdout); } ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); solve(); return 0; }

Compilation message (stderr)

Main.cpp: In function 'int32_t main()':
Main.cpp:49:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |         freopen(task".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
Main.cpp:50:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |         freopen(task".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...