oj.uz

Submission #232450

# Submission time Handle Problem Language Result Execution time Memory
232450 2020-05-17T06:30:42 Z VEGAnn Jarvis (COCI19_jarvis) C++14
70 / 70
 37 ms 2944 KB 
#include <bits/stdc++.h>
#define ft first
#define sd second
using namespace std;
const int N = 100100;
unordered_map<int, int> mp;
int ans = 0, n, a[N], b[N];

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> n;

    for (int i = 0; i < n; i++)
        cin >> a[i];

    for (int i = 0; i < n; i++) {
        cin >> b[i];
        mp[b[i] - a[i]]++;
    }

    for (auto cr : mp)
        ans = max(ans, cr.sd);

    cout << ans;

    return 0;
}

Subtask #1
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 19 ms 1664 KB Output is correct
3 Correct 21 ms 1536 KB Output is correct
4 Correct 20 ms 1536 KB Output is correct
5 Correct 31 ms 2552 KB Output is correct
6 Correct 32 ms 2424 KB Output is correct
7 Correct 31 ms 2560 KB Output is correct
8 Correct 31 ms 2552 KB Output is correct
9 Correct 37 ms 2944 KB Output is correct
10 Correct 36 ms 2944 KB Output is correct