Submission #361203

#TimeUsernameProblemLanguageResultExecution timeMemory
361203daringtriflesCipele (COCI18_cipele)C++17
45 / 90
1099 ms19180 KiB
#include <bits/stdc++.h> using namespace std; #define pb push_back #define ll long long #define pll pair<ll, ll> #define FOR(i, a, b) for (signed ll i = (signed ll)(a); i < (signed ll)(b); i++) #define NEGFOR(i, a, b) for (ll i = (a); i > (b); i--) #define vll vector<ll> #define sll set<ll> #define ld long double #define inf 1000000000000000000 #define mll multiset<ll> #define vpll vector<pll> #define nn << "\n" #define ss << " " //10^8 operations per second //greatest int is 2,147,483,647 //greates long long is 9.22337204e18 ll l, r; mll le, ri; bool check(ll n) { mll x=le; mll y=ri; if (l > r) { swap(l, r); swap(x, y); } for (auto i:x){ auto it=y.lower_bound(i-n); // cout<<"bye" <<endl; // if (n==0) cout<<*--y.end() ss; // if if (abs(*it-i)<=n){ // if (n==0) cout<<*it-i ss; y.erase(it); } else return 0; } return 1; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> l >> r; FOR(i, 0, l) { ll a; cin >> a; le.insert(a); } FOR(i, 0, r) { ll a; cin >> a; ri.insert(a); } ll l=-1, r=inf; while (check(r)){ ll mid=l+(r-l)/2; //cout<<mid <<endl; if (check(mid)){ r=mid-1; //if (r==0) cout<<"yes"; } else{ l=mid+1; } } cout<<r+1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...