Submission #232515

#	Time	Username	Problem	Language	Result	Execution time	Memory
232515		Vimmer	Jarvis (COCI19_jarvis)	C++14	70 / 70	49 ms	2936 KiB

jarvis

#include <bits/stdc++.h>

//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 100005
#define MOD ll(1e9 + 7)
#define block 500

using namespace std;

//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;

typedef short int si;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;


map <int, int> mp;

int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n;

    cin >> n;

    int a[n];

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

    int b[n];

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

    int ans = 0;

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

    for (auto it : mp) ans = max(ans, it.S);

    cout << ans << endl;
}

• Subtask 1: 70 / 70