# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
934715 | 2024-02-27T20:43:13 Z | Isam | Cipele (COCI18_cipele) | C++17 | 1000 ms | 2908 KB |
#include<bits/stdc++.h> using namespace std; int N, M, L[100001], R[100001]; long long ans = 1e15; // comma operator // int p = 11; // p = (1, 2, 3); // cout << p << '\n'; long long get(int l){ long long tmp(0); for(register int i = 1; i <= N; ++i) tmp = max(tmp, (long long)abs(L[i] - R[l++])); return tmp; } signed main(){ ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> N >> M; if(N > M){ swap(N, M); for(register int i = 1; i <= M; ++i) cin >> R[i]; for(register int i = 1; i <= N; ++i) cin >> L[i]; }else{ for(register int i = 1; i <= N; ++i) cin >> L[i]; for(register int i = 1; i <= M; ++i) cin >> R[i]; } sort(L+1,L+N+1), sort(R+1,R+M+1); if(N == M && N == 1){ cout << abs(L[1] - R[1]) << '\n'; return 0; } for(register int l = 1; l + N - 1 <= M; ++l) ans = min(ans, get(l)); cout << ans << '\n'; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 18 ms | 1112 KB | Output is correct |
2 | Correct | 30 ms | 2848 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 27 ms | 1116 KB | Output is correct |
2 | Correct | 28 ms | 2908 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 2 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 7 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 7 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1067 ms | 1052 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 803 ms | 1140 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1044 ms | 860 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |