# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
934709 | 2024-02-27T20:27:16 Z | Isam | Cipele (COCI18_cipele) | C++17 | 28 ms | 2944 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'; int get(int l){ int tmp(0); for(register int i = 1; i <= N; ++i){ tmp = max(tmp, 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); int l(1), r{M - N}, mid, best(1); while(l <= r){ mid = l + ((r - l) >> 1); long long gc = get(mid); if(gc <= ans){ ans = gc; r = mid - 1; }else{ l = mid + 1; } } cout << ans << '\n'; return 0; } /* 5 5 7 6 1 2 10 9 11 6 3 12 */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 16 ms | 2640 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 28 ms | 2944 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 2 ms | 604 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 600 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 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 | 2 ms | 604 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 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 | 24 ms | 2396 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 26 ms | 2644 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 27 ms | 2508 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |