#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> a;
vector<int> b;
void solve_bf() {
}
void solve_bequal() {
int x = b[1];
int last = 0;
bool ok = false;
int ans = 0;
a.push_back(x + 1);
for(int i = 1; i <= (n + 1); ++i) {
if(a[i] > x) {
if(ok) {
ans += i - last - 1;
ok = false;
}
last = i;
} else if(a[i] == x) {
ok = true;
}
}
cout << ans << "\n";
}
void solve_astrictlyincreasing() {
}
void solve() {
cin >> n;
a.assign(1 + n, 0);
b.assign(1 + n, 0);
for(int i = 1; i <= n; ++i) cin >> a[i];
for(int i = 1; i <= n; ++i) cin >> b[i];
set<int> b_set;
for(int i = 1; i <= n; ++i) {
b_set.insert(b[i]);
}
/*if(n <= 10) {
solve_bf();
} else */if(b_set.size() == 1) {
solve_bequal();
} else {
solve_astrictlyincreasing();
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
solve();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
6 ms |
460 KB |
Output is correct |
3 |
Correct |
19 ms |
2372 KB |
Output is correct |
4 |
Correct |
18 ms |
1856 KB |
Output is correct |
5 |
Correct |
29 ms |
3396 KB |
Output is correct |
6 |
Correct |
20 ms |
1884 KB |
Output is correct |
7 |
Correct |
21 ms |
1988 KB |
Output is correct |
8 |
Correct |
31 ms |
3532 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
3 ms |
460 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |