Submission #833311

#TimeUsernameProblemLanguageResultExecution timeMemory
833311vjudge1Exam (eJOI20_exam)C++17
12 / 100
18 ms1536 KiB
#include <bits/stdc++.h> using namespace std; #define pb push_back #define mp make_pair #define ll long long #define pii pair<int, int> #define pll pair<ll, ll> const int INF = 2147483645; const int maxN = (int)5e5+5; const ll LLINF = LLONG_MAX; //const ll mod = 998244353; const ll mod = 1000000007; void solv() { int n, a, ans=0; vector<int> h, t; cin>>n; for (int i=0;i<n;i++) cin>>a, h.pb(a); for (int i=0;i<n;i++) cin>>a, t.pb(a); for (int i=0;i<n;i++) { if (h[i] != a) continue; int tmp = i-1; while (tmp >= 0 && h[tmp] <= a) { ans++, tmp--; } while (i < n && h[i] <= a) { ans++, i++; } } cout<<ans<<'\n'; } int main() { ios::sync_with_stdio(0); cin.tie(0); int t=1; // cin>>t; while (t--) solv(); }
#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...