#include<bits/stdc++.h>
using namespace std;
#define int long long
int INF = numeric_limits<int>::max()/2;
int32_t main(){
int n,m;
cin >> n >> m;
vector<int> spr(n);
vector<int> flow(m);
for(int i = 0; i < n; i++){
cin >> spr[i];
}
for(int i = 0; i < m; i++){
cin >> flow[i];
}
set<int> sprS;
for(int i = 0; i < n; i++){
sprS.insert(spr[i]);
}
vector<int> pos(sprS.begin(),sprS.end());
int pt = 0;
int ma = 0;
for(int i = 0; i < m; i++){
while(pt+1 < pos.size() && pos[pt+1] < flow[i]){
pt++;
}
int r = abs(pos[pt]- flow[i]);
if(pt+1 < n){
r = min(r, abs(pos[pt+1]-flow[i]));
}
ma = max(ma,r);
}
cout << ma << endl;
for(int i = 0; i < (n/3); i++){
cout << "LLR" << endl;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |