Submission #871350

#	Time	Username	Problem	Language	Result	Execution time	Memory
871350		hvmegy	Cipele (COCI18_cipele)	C++17	90 / 90	37 ms	4064 KiB

cipele

// [ нvмegy ]
// OLPCHUYENTIN2023 GOTOHUE
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
 
#define int long long
#define all(c) c.begin(), c.end()
#ifdef hvmegy
#define dbg(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {
        cerr << "[" << vars << " : ";
        string delim = "";
        (..., (cerr << delim << values, delim = ", "));
        cerr << "]" << '\n'; 
}
#else
#define dbg(...)
#endif
 
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
 
int GOTOHUE();
void init(); 
 
int32_t main()
{
        cin.tie(0) -> sync_with_stdio(0); 
        cout << fixed << setprecision(15);
        
        #ifdef hvmegy
        freopen("input.txt", "r", stdin); 
        freopen("output.txt", "w", stdout); 
        freopen("log.txt", "w", stderr);
        #endif



        // =============================
                bool MULTITEST = 0; 
        // =============================
        
        init(); 
        int OLPCHUYENTIN2023 = 1; 
        if (MULTITEST) cin >> OLPCHUYENTIN2023; 
        for (int i = 1; i <= OLPCHUYENTIN2023; i++) {
                if (GOTOHUE()) break;
                #ifdef hvmegy
                        cout << "--ENDTEST--" << '\n';
                        cerr << "--ENDTEST--" << '\n';
                #endif
        }

        #ifdef hvmegy
                cerr << '\n' << clock() * 1000.0 / CLOCKS_PER_SEC << "ms" << '\n';
        #endif

        return 0;
}

void init() { 
}

int GOTOHUE() { 
        int n, m; 
        cin >> n >> m; 
        vector<int> a(n + 1), b(m + 1); 
        for (int i = 1; i <= n; i++) { 
                cin >> a[i]; 
        }
        for (int i = 1; i <= m; i++) { 
                cin >> b[i]; 
        }

        sort(1 + all(a)); 
        sort(1 + all(b)); 

        auto ck = [&](int mx) { 
                int i = 1; 
                int j = 1; 
                int cnt = 0; 
                while (i <= n && j <= m) { 
                        if (abs(a[i] - b[j]) <= mx) { 
                                cnt++; 
                                i++; 
                                j++; 
                        }
                        else { 
                                a[i] < b[j] ? i++ : j++; 
                        }
                }
                return cnt >= min(n, m); 
        }; 

        int lo = -1, hi = INT_MAX; 
        while (lo + 1 < hi) { 
                int mi = (lo + hi) >> 1; 
                if (ck(mi)) hi = mi; 
                else lo = mi; 
        }
        cout << hi; 
        return 0; 
}

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