Submission #463422

#TimeUsernameProblemLanguageResultExecution timeMemory
463422amunduzbaevExam (eJOI20_exam)C++14
77 / 100
196 ms1112 KiB
#include "bits/stdc++.h" using namespace std; //~ #define int long long void solve1(int n, vector<int>& a, vector<int>& b){ vector<int> dp(n); int res = 0; for(int i=0;i<n;i++){ int s = i, e = i; while(s + 1 < n && a[s + 1] <= a[i]) s++; while(e && a[e - 1] <= a[i]) e--; vector<int> cnt(n); for(int j=0;j<n;j++){ if(j) cnt[j] = cnt[j-1]; cnt[j] += (b[j] == a[i]); } vector<int> pref(n, -1e9); for(int j=e;j<n;j++){ if(j) pref[j] = pref[j-1]; pref[j] = max(pref[j], (j ? - cnt[j-1] + dp[j-1] : 0)); } for(int r=s;r>=e;r--){ //~ int mx = -1e9; //~ for(int l=r;l>=e;l--){ //~ mx = max((l ? - cnt[l-1] + dp[l-1] : 0), mx); //~ mx = max(mx, (l ? - cnt[l-1] + dp[l-1] : 0)); //~ } dp[r] = max(dp[r], cnt[r] + pref[r]); } } for(int i=0;i<n;i++) res = max(res, dp[i]); cout<<res<<"\n"; } void solve2(int n, vector<int>& a, vector<int>& b){ int mn = 1e9, mx = 0; for(auto x : b) mn = min(mn, x), mx = max(mx, x); if(mx == mn){ int last = 0, cnt = 0, res = 0; for(int i=0;i<n;i++){ if(a[i] > b[0]){ if(cnt){ res += (i - last); } cnt = 0, last = i + 1; } else { cnt |= (a[i] == b[i]); } } if(cnt){ res += (n - last); } cout<<res<<"\n"; return; } } void solve(){ int n; cin>>n; vector<int> a(n), b(n); for(auto& x : a) cin>>x; for(auto& x : b) cin>>x; if(n <= 5005){ solve1(n, a, b); } else { solve2(n, a, b); } } /* 3 1 2 3 2 2 2 */ signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); int t = 1; //~ cin>>t; while(t--) solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...