Submission #1101758

#	Time	Username	Problem	Language	Result	Execution time	Memory
1101758		rayan_bd	Jarvis (COCI19_jarvis)	C++17	56 / 70	51 ms	2388 KiB

jarvis

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds; 


#define getar(ar,n) for(ll i=0;i<n;++i) cin>>ar[i]
#define show(n) cout<<n<<'\n'
#define all(v) v.begin(), v.end()
#define br cout<<"\n"
#define pb push_back
#define nl '\n'
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define ret return
#define ll long long
#define ld long double
#define sza(x) ((int)x.size())

const int mxN = 1e6 + 5;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
const ld EPS = 1e-9;

unordered_map<ll,ll> mp;


signed main() {
   ll n;cin>>n;
    vector<ll> a(n),b(n);
	for(ll i=0;i<n;++i){
		cin>>a[i];
		a[i]+=mxN;
	}
	for(ll i=0;i<n;++i){
		cin>>b[i];
		b[i]+=mxN;
	}
	ll ans=0,mx=0;
	for(ll i=0;i<n;++i){
		if(b[i]==a[i])++ans;
		else mx=max(++mp[b[i]-a[i]],mx);
	}
	show(ans+mx);
}

• Subtask 1: 56 / 70