# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
382844 | aris12345678 | Exam (eJOI20_exam) | C++14 | 3 ms | 620 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;
const int mxN = 1e6+5;
int a[mxN], b[mxN];
int main() {
int n;
scanf("%d", &n);
unordered_set<int> s;
for(int i = 0; i < n; i++) {
scanf("%d", &a[i]);
s.insert(a[i]);
}
bool check = false;
for(int i = 0; i < n; i++) {
scanf("%d", &b[i]);
if(s.find(b[i]) != s.end())
check = true;
}
if(check)
printf("%d\n", n);
else
printf("0\n");
return 0;
}
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... |