# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
833804 |
2023-08-22T08:44:39 Z |
vjudge1 |
Exam (eJOI20_exam) |
C++17 |
|
1 ms |
340 KB |
#include<bits/stdc++.h>
#define ll long long
#define endl "\n"
#define pb push_back
#define pf push_front
#define p push
#define q queue
#define popf pop_front()
#define popb pop_back()
#define dq deque
#define fi first
#define se second
#define ve vector
#define lb lower_bound
#define ub upper_bound
#define pq priority_queue
#define st stack
#define rep(i,a,b) for (ll i=a; i<b; i++)
#define rept(i,a,b) for (ll i=a; i<=b; i++)
#define repr(i,a,b) for (ll i=a; i>=b; i--)
#define ppi pair<ll,ll>
#define test cout<<"A"<<endl
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
// cin.tie(NULL);
ll n;
cin>>n;
ve<ll> H(n);
ve<ll> T(n);
ll sta, end;
sta = n;
end = 0;
rep(i,0,n){
cin>>H[i];
}
ll ans = 0;
rep(i,0,n){
cin>>T[i];
if (T[i] == H[i]){
sta = min(sta, i);
end = max(end, i);
}
}
rept(i, sta, end){
if (H[i] <= T[i]){
ans++;
}
}
repr(i, sta-1, 0){
if (H[i] <= T[i]){
ans++;
} else{
break;
}
}
rep(i, end+1, n){
if (H[i] <= T[i]){
ans++;
} else {
break;
}
}
cout<<ans<<endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |