oj.uz

답안 #105129

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
105129 2019-04-10T15:58:40 Z leonarda Jarvis (COCI19_jarvis) C++14
42 / 70
 69 ms 2068 KB 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
typedef pair<int, int> pi;
typedef long long int lint;
const int inf = 0x3f3f3f3f;
const int maxn = 1e5 + 10;

int n, maki;
int a[maxn], b[maxn];
map<int, int> m;

int main ()
{
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	
	cin >> n;
	for(int i = 0; i < n; ++i)
		cin >> a[i];
	for(int i = 0; i < n; ++i)
		cin >> b[i];
		
	for(int i = 0; i < n; ++i) {
		if(a[i] - b[i] != b[i] - a[i]) {
			m[a[i] - b[i]]++;
			m[b[i] - a[i]]++;
		} else
			m[a[i] - b[i]]++;
	}
	
	for(map<int, int>::iterator it = m.begin(); it != m.end(); ++it) {
		maki = max(maki, it -> second);
	}
	
	cout << maki;

return 0;
}

Subtask #1
42.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Incorrect 27 ms 1152 KB Output isn't correct
3 Incorrect 18 ms 1024 KB Output isn't correct
4 Incorrect 16 ms 1152 KB Output isn't correct
5 Correct 24 ms 1152 KB Output is correct
6 Correct 26 ms 1152 KB Output is correct
7 Correct 36 ms 1152 KB Output is correct
8 Correct 49 ms 1104 KB Output is correct
9 Correct 69 ms 1996 KB Output is correct
10 Correct 64 ms 2068 KB Output is correct