Submission #1238969

#TimeUsernameProblemLanguageResultExecution timeMemory
1238969PlayVoltzJarvis (COCI19_jarvis)C++20
56 / 70
28 ms2628 KiB
#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
#include <random>
#include <chrono>
#include <fstream>
using namespace std;

#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, ans=0, mx=0;
	cin>>n;
	map<int, int> m;
	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];
	for (int i=0; i<n; ++i){
		if (a[i]==b[i])++ans;
		else ++m[a[i]-b[i]+2000005], mx=max(mx, m[a[i]-b[i]+2000005]);
	}
	cout<<ans+mx;
}
#Verdict Execution timeMemoryGrader output
Fetching results...