oj.uz

답안 #1101753

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1101753 2024-10-16T18:09:19 Z rayan_bd Jarvis (COCI19_jarvis) C++17
70 / 70
 17 ms 2384 KB 
#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];
		a[i]+=mxN;
	}
	for(ll i=0;i<n;++i){
		cin>>b[i];
		a[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);
}

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

Subtask #1
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 15 ms 1872 KB Output is correct
3 Correct 11 ms 1872 KB Output is correct
4 Correct 11 ms 1872 KB Output is correct
5 Correct 14 ms 2040 KB Output is correct
6 Correct 15 ms 1872 KB Output is correct
7 Correct 14 ms 1872 KB Output is correct
8 Correct 15 ms 1872 KB Output is correct
9 Correct 17 ms 2384 KB Output is correct
10 Correct 16 ms 2384 KB Output is correct