제출 #1279409

#제출 시각아이디문제언어결과실행 시간메모리
1279409ducanh0811Growing Vegetables is Fun 4 (JOI21_ho_t1)C++20
0 / 100
1 ms572 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 pref[MAXN]; int suff[MAXN]; int lastpre[MAXN]; int lastsuf[MAXN]; int a[MAXN]; int b[MAXN]; int n; void solve(){ cin >> n; FOR(i, 1, n){ cin >> a[i]; b[i] = a[i]; } int sum = 0; FOR(i, 2, n){ b[i] += sum; pref[i] += pref[i - 1]; lastpre[i] = lastpre[i - 1]; if (b[i] <= b[i - 1]){ int val = (b[i - 1] - b[i] + 1); b[i] += val; sum += val; pref[i] += val; lastpre[i] = val; } } FOR(i, 1, n) b[i] = a[i]; sum = 0; REV(i, n - 1, 1){ b[i] += sum; suff[i] += suff[i + 1]; lastsuf[i] = lastsuf[i + 1]; if (b[i] <= b[i + 1]) { int val = (b[i + 1] - b[i] + 1); b[i] += val; sum += val; suff[i] += val; lastsuf[i] = val; } } int res = 1e15; FOR(i, 1, n - 1){ res = min(res, pref[i] + suff[i + 1] - min(lastpre[i], lastsuf[i + 1])); } cout << res; } #define task "" 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; }

컴파일 시 표준 에러 (stderr) 메시지

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