Submission #1309423

#TimeUsernameProblemLanguageResultExecution timeMemory
1309423ayuxhkumxr22Cipele (COCI18_cipele)C++20
0 / 90
19 ms2076 KiB
/* Author : ayuxh */ #include <bits/stdc++.h> using namespace std; #define INF (int)2e9 #define INFL (long long)2e18 #define int long long const int mod = 998244353; void Solve() { int n,m; cin>>n>>m; vector<int> ls(n),rs(m); for(int i=0;i<n;i++){ cin>>ls[i]; } for(int i=0;i<m;i++){ cin>>rs[i]; } if(n>m){ swap(n,m); swap(ls,rs); } int ans=INFL; int l=0,r=1e9,mid; while(l<=r){ mid=l+(r-l)/2; int j=0; for(int i=0;i<n;i++){ j++; while(j<m && abs(ls[i]-rs[j])>mid) j++; } if(j<m){ ans=mid; r=mid-1; }else{ l=mid+1; } } cout<<ans<<"\n"; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); int t=1; // cin >> t; while (t--) Solve(); return 0; }
#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...