oj.uz

답안 #232515

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
232515 2020-05-17T09:08:03 Z Vimmer Jarvis (COCI19_jarvis) C++14
70 / 70
 49 ms 2936 KB 
#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.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 21 ms 1536 KB Output is correct
3 Correct 21 ms 1664 KB Output is correct
4 Correct 20 ms 1532 KB Output is correct
5 Correct 33 ms 2560 KB Output is correct
6 Correct 33 ms 2552 KB Output is correct
7 Correct 35 ms 2552 KB Output is correct
8 Correct 36 ms 2552 KB Output is correct
9 Correct 44 ms 2936 KB Output is correct
10 Correct 49 ms 2936 KB Output is correct