# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
96659 | 2019-02-10T16:25:48 Z | noneTP | Jarvis (COCI19_jarvis) | C++14 | 44 ms | 1544 KB |
#include <bits/stdc++.h> using namespace std; typedef tuple<int, int, int> tp; typedef long long LL; typedef long double LD; typedef pair<int, int> pii; typedef pair<int, LL> pil; typedef pair<LL, int> pli; typedef pair<LL, LL> pll; typedef pair<pii, int> piipi; typedef pair<int, pii> pipii; typedef pair<pii, pii> piipii; typedef pair<LL, pii> plpii; typedef pair<LD, LD> pdd; typedef pair<LD, int> pdi; typedef pair<LD, LL> pdl; typedef pair<int, LD> pid; typedef pair<LL, LD> pld; const int mod = 1e9 + 7; const int hf = 999983; const int N = 1e6; int a[100005], b[100005]; map<int, int> df; int main(){ int n; scanf("%d", &n); for(int i=1;i<=n;i++) scanf("%d", &a[i]); for(int i=1;i<=n;i++) scanf("%d", &b[i]); for(int i=1;i<=n;i++) df[a[i]-b[i]]++; int ans = 0; for(auto its:df) ans = max(ans, its.second); printf("%d\n", ans); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 22 ms | 1144 KB | Output is correct |
3 | Correct | 20 ms | 1144 KB | Output is correct |
4 | Correct | 19 ms | 1144 KB | Output is correct |
5 | Correct | 28 ms | 1144 KB | Output is correct |
6 | Correct | 30 ms | 1144 KB | Output is correct |
7 | Correct | 31 ms | 1144 KB | Output is correct |
8 | Correct | 34 ms | 1144 KB | Output is correct |
9 | Correct | 42 ms | 1528 KB | Output is correct |
10 | Correct | 44 ms | 1544 KB | Output is correct |