이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("O2")
#pragma GCC optimize ("O1")
#define ezurect int T; cin >> T; while(T--){solve();}
#pragma optimize ("")
const int N = 1e6 + 1, mod = 1e9 + 7;
int n, m;
vector<int> v(N), w(N);
int main(){
cin.tie(0)->sync_with_stdio(0);
cin >> n >> m;
for(int i = 1; i <= n; i++) cin >> v[i];
for(int i = 1; i <= m; i++) cin >> w[i];
sort(v.begin() + 1, v.begin() + 1 + n);
sort(w.begin() + 1, w.begin() + 1 + m);
if(n > m){
swap(v, w);
swap(n, m);
}
long long ans = 1e17;
for(int i = 1; i <= m - n + 1; i++){
long long res = 0;
for(int j = 1; j <= n; j++){
res = max(res, 1LL * abs(w[i + j - 1] - v[j]));
}
ans = min(ans, res);
}
cout << ans;
}
컴파일 시 표준 에러 (stderr) 메시지
cipele.cpp:8: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
8 | #pragma optimize ("")
|
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |