This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0);
#define int long long
#define pb push_back
#define fi first
#define se second
#define mp make_pair
const int mod = 1e9 + 7;
const int maxn = 2e6 + 5;
int32_t main()
{
IOS
int n; cin >> n;
int h[n + 1], t[n + 1];
for(int i = 1; i <= n; i++){
cin >> h[i];
}
bool sama = true;
cin >> t[1];
for(int i = 2; i <= n; i++){
cin >> t[i];
if(t[i] != t[i - 1])sama = false;
}
if(sama){
int tmp = t[1];
int ada = 0, kurang = 0, lebih = 0;
vector<int> idx;
for(int i = 1; i <= n; i++){
if(h[i] == tmp){
ada++;
idx.pb(i);
}else if(h[i] < tmp){
kurang++;
}else{
lebih++;
}
}
int ans = ada;
for(auto i : idx){
int idx = i - 1;
if(idx > 0){
while(h[i] >= h[idx]){
ans++;
idx--;
}
}
idx = i + 1;
if(idx <= n){
while(h[i] >= h[idx]){
ans++;
idx++;
}
}
}
cout << ans << endl;
// if(ada == 0){
// cout << 0 << endl;
// }else{
// cout << ada + kurang << endl;
// }
//cout << kurang << " " << lebih << " " << ada << endl;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |