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;
const int maxn = 100005;
int h[maxn];
int t[maxn];
int main() {
int n;
cin >> n;
bool tc2 = true;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
for (int i = 1; i <= n; i++) {
cin >> t[i];
if (i != 1 && t[i] != t[i-1]) {
tc2 = false;
}
}
if (tc2) {
int accu = 0;
int req = t[1];
int status = 0;
for (int i = 1; i <= n; i++) {
if (h[i] > req) status = 0;
else if (h[i] < req) {
if (status == -1) {
accu++;
} else {
status++;
}
}
else if (h[i] == req) {
accu += status + 1;
status = -1;
}
}
cout << accu;
}
return 0;
}
# | 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... |