Submission #1070170

#TimeUsernameProblemLanguageResultExecution timeMemory
1070170naneosmicSprinklers (CEOI24_sprinklers)C++14
0 / 100
32 ms3900 KiB
#include <bits/stdc++.h> #define int long long #define endl "\n" using namespace std; signed main(){ int n,m; cin>>n>>m; set<int>nums; vector<int>sprinklers(n); vector<int>flowers(m); for(int i=0;i<n;i++)cin>>sprinklers[i]; for(int i=0;i<m;i++)cin>>flowers[i]; for(int i=0;i<n;i++)nums.insert(sprinklers[i]); for(int i=0;i<m;i++)nums.insert(flowers[i]); int maxdistance=-1; if(n==1){ auto it1=nums.begin(); auto it2=nums.end();it2--; if(sprinklers[0]!=*it1&&sprinklers[0]!=*it2){ cout<<-1; return 0; } } for(int i=0;i<n;i++){ int mindistance=LLONG_MAX; for(int j=0;j<m;j++){ mindistance=min(mindistance,abs(sprinklers[i]-flowers[j])); } maxdistance=max(maxdistance,mindistance); } cout<<maxdistance; }
#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...