Submission #833161

#TimeUsernameProblemLanguageResultExecution timeMemory
833161vjudge1Exam (eJOI20_exam)C++17
12 / 100
72 ms3148 KiB
#include<bits/stdc++.h> #define ll long long #define pll pair<ll,ll> #define pb push_back #define fi first #define se second using namespace std; int n, h[100010], t[100010]; bool vis[100010]; int main(){ cin >> n; for(int i=1; i<=n; i++){ cin >> h[i]; } vector<int> tmp; for(int i=1; i<=n; i++){ cin >> t[i]; if(t[i]==h[i]){ tmp.pb(i); } } int ans=0; for(auto i : tmp){ // cout << "i " << i << endl; vis[i]=1; ans++; int l=i, r=i; while(l-1>=1 && !vis[l-1]){ l--; // cout << l << endl; vis[l]=1; if(h[l]>=h[i]) break; ans++; } while(r+1<=n && !vis[r+1]){ r++; // cout << r << endl; vis[r]=1; if(h[r]>=h[i]) break; ans++; } } cout << ans << endl; return 0; }
#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...