| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1223327 | Aisha | Exam (eJOI20_exam) | C++20 | 4 ms | 580 KiB |
#include "bits/stdc++.h"
using namespace std;
#define int long long
signed 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];
map <int, int> mp;
int mx = 0, ind = 0;
for (int i = 0; i < n; i ++) {
mp[b[i]] ++;
if (mx < mp[a[i]]) {
ind = i;
mx = mp[a[i]];
}
}
int ans = mx;
for (int i = ind + 1; i < n; i ++) ans += (a[i] == b[i]);
cout << ans << endl;
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... | ||||
