oj.uz

답안 #232463

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
232463 2020-05-17T06:47:22 Z kartel Jarvis (COCI19_jarvis) C++14
70 / 70
 54 ms 1536 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +2000500
//#define N1 +1001000
//#define M ll(998244353)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int n, i, x, a[N], ans, b[N];
map <int, int> mp;

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

//    getline(cin, st);
    cin >> n;
    for (i = 1; i <= n; i++) cin >> a[i];
    for (i = 1; i <= n; i++) cin >> b[i];
    for (i = 1; i <= n; i++)
    {
        mp[b[i] - a[i]]++;
        ans = max(ans, mp[b[i] - a[i]]);
    }
    cout << ans;
}


//3 - 4
//4 - 5
//y < z + x < y + 2 * x

Subtask #1
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 20 ms 1152 KB Output is correct
3 Correct 23 ms 1152 KB Output is correct
4 Correct 19 ms 1152 KB Output is correct
5 Correct 32 ms 1148 KB Output is correct
6 Correct 33 ms 1152 KB Output is correct
7 Correct 36 ms 1152 KB Output is correct
8 Correct 37 ms 1084 KB Output is correct
9 Correct 54 ms 1536 KB Output is correct
10 Correct 53 ms 1528 KB Output is correct