#include <bits/stdc++.h>
using namespace std;
vector<int>h, t;
vector<bool>vis;
int n;
int d[] = {-1, 1};
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
h.resize(n + 1);
t.resize(n + 1);
vis.resize(n + 1, 0);
for(int i = 1; i <= n; i++) cin >> h[i];
for(int i = 1; i <= n; i++) cin >> t[i];
queue<int>q;
int x = t[1];
int ans = 0;
for(int i = 1; i <= n; i++){
if(h[i] == x){
q.push(i);
ans++;
vis[i] = true;
}
}
while(!q.empty()){
int cur = q.front(); q.pop();
for(int i = 0; i < 2; i++){
int nxt = cur + d[i];
if(nxt > 0 && nxt <= n && h[nxt] < x && !vis[nxt]){
vis[nxt] = true;
q.push(nxt);
ans++;
}
}
}
cout << ans << '\n';
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
4 ms |
468 KB |
Output is correct |
3 |
Correct |
11 ms |
980 KB |
Output is correct |
4 |
Correct |
9 ms |
1108 KB |
Output is correct |
5 |
Correct |
17 ms |
1060 KB |
Output is correct |
6 |
Correct |
9 ms |
1220 KB |
Output is correct |
7 |
Correct |
11 ms |
1132 KB |
Output is correct |
8 |
Correct |
15 ms |
1108 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |