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>
#define ll long long
using namespace std;
ll N,A[100005],B[100005];
bool case2=true;
int main(){
   cin>>N;
   for(int i=1;i<=N;i++)
      cin>>A[i];
   for(int i=1;i<=N;i++)
      cin>>B[i];
   for(int i=2;i<=N;i++)
      if(B[i]!=B[i-1])
         case2=false;
   if(case2){
      int pv=0,res=0;
      int imam=0;
      for(int i=1;i<=N;i++){
         if(A[i]==B[i])
            imam=1;
         if(A[i]>B[i]){
            res+=imam*(i-1-pv);
            pv=i;
            imam=0;
         }
      }
      res+=imam*(N-pv);
      cout<<res<<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... |