Submission #742648

#	Time	Username	Problem	Language	Result	Execution time	Memory
742648		matu	Cipele (COCI18_cipele)	C++14	27 / 90	1068 ms	8276 KiB

cipele

#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;
}

Compilation message (stderr)

cipele.cpp:8: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    8 | #pragma optimize ("")
      |

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 9
• Subtask 8: 0 / 9
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9