# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
382844 | 2021-03-28T10:01:25 Z | aris12345678 | Exam (eJOI20_exam) | C++14 | 3 ms | 620 KB |
#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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 620 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |