# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
462396 | bigo | Exam (eJOI20_exam) | C++14 | 7 ms | 332 KiB |
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;
#define ll long long
typedef pair<int, int> pii;
int main() {
int n;
cin >> n;
vector<int>a(n), b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
vector<pii>vec;
for (int i = 0; i < n; i++) {
if (a[i] < b[i]) {
for (int j = i + 1; j < n; j++) {
if (a[j] == b[i]) {
vec.push_back({ j,i });
break;
}
}
}
else if (a[i] == b[i])
vec.push_back({ i,i });
}
sort(vec.begin(), vec.end());
int ans = 0, l = 0;
for (int i = 0; i < vec.size(); i++) {
if (vec[i].second >= l) {
++ans;
l = vec[i].first;
}
}
cout << ans;
}
Compilation message (stderr)
# | 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... |