# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
833344 | vjudge1 | Exam (eJOI20_exam) | C++17 | 16 ms | 1876 KiB |
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 endl '\n'
#define ll long long
int main(){
ios::sync_with_stdio(0); cin.tie(0);
int n;
cin>>n;
int a[n+5];
int b[n+5];
bool sub2 = true;
for(int i=1; i<=n; i++) cin>>a[i];
for(int i=1; i<=n; i++){
cin>>b[i];
if(i > 1 && b[i] != b[1]) sub2 = false;
}
vector<int> id;
int on[n+5];
memset(on, 0, sizeof(on));
for(int i=1; i<=n; i++){
if(a[i] == b[i]) id.push_back(i);
}
for(auto z: id){
if(!on[z]){
on[z] = 1;
int x = z+1;
while(x <= n && a[x] <= a[z] && on[x] == 0){
on[x] = 1;
x++;
}
x = z-1;
while(x >= 1 && a[x] <= a[z] && on[x] == 0){
on[x] = 1;
x--;
}
}
}
int cnt = 0;
for(int i=1; i<=n; i++){
if(on[i]) cnt++;
}
cout<<cnt<<endl;
return 0;
}
Compilation message (stderr)
# | 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... |