Submission #546034

#TimeUsernameProblemLanguageResultExecution timeMemory
546034tmn2005Growing Vegetables is Fun 4 (JOI21_ho_t1)C++17
0 / 100
1 ms340 KiB
#include<ext/pb_ds/assoc_container.hpp> #include<ext/pb_ds/tree_policy.hpp> #include<bits/stdc++.h> using namespace __gnu_pbds; using namespace std; typedef long long ll; #define fr first #define sc second #define mk make_pair #define pb push_back #define pob pop_back #define pf push_front #define pof pop_front #define int long long #define pii pair<int,int> #define piii pair<int,pii> #define all(s) s.begin(), s.end() #define allr(s) s.rbegin(), s.rend() #define NeedForSpeed ios::sync_with_stdio(0), cin.tie(0) #define ordered_set tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> const int N = 2e5 + 12; int n, m, k, a[N], b[N], c, d, pref[N], suff[N]; void solve(){ cin>>n; for(int i=1; i<=n; i++){ cin>>a[i]; b[i] = a[i]; } for(int i=1; i<=n; i++){ if(a[i] > a[i-1])continue; if(a[i-1] == a[i]){ if(pref[i-1] == pref[i]){ a[i]++; pref[i]++; } else pref[i] = pref[i-1]; } else{ int tmp = a[i-1] - a[i] + 1; pref[i] = tmp; a[i] += tmp; } } for(int i=1; i<=n; i++)a[i] = b[i]; for(int i=n; i>=1; i--){ if(a[i] > a[i+1])continue; if(a[i] == a[i+1]){ if(suff[i] == suff[i+1]){ a[i]++; suff[i]++; } else suff[i] = suff[i+1]; } else{ int tmp = a[i+1] - a[i] + 1; suff[i] = tmp; a[i] += tmp; } } int res = 1e18; for(int i=0; i<=n; i++){ res= min(res, pref[i] + suff[i+1] + (b[i] == b[i+1] ? 1 : 0)); } cout<<res<<endl; } main(){ NeedForSpeed; int T = 1; // cin >> T; while(T--){ solve(); } return 0; }

Compilation message (stderr)

Main.cpp:76:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   76 | main(){
      | ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...