Submission #1101750

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1101750	2024-10-16T18:08:23 Z	rayan_bd	Jarvis (COCI19_jarvis)	C++17	56 / 70	17 ms	2384 KB

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;

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

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    solve();
    return 0;
}

Subtask #1

56.0 / 70.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	336 KB	Output isn't correct
2	Correct	10 ms	1872 KB	Output is correct
3	Incorrect	10 ms	1872 KB	Output isn't correct
4	Correct	10 ms	1872 KB	Output is correct
5	Correct	13 ms	2024 KB	Output is correct
6	Correct	14 ms	2032 KB	Output is correct
7	Correct	14 ms	2188 KB	Output is correct
8	Correct	14 ms	1872 KB	Output is correct
9	Correct	15 ms	2384 KB	Output is correct
10	Correct	17 ms	2292 KB	Output is correct