#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main()
{
int n,m;
cin>>n>>m;
vector<int> spr(n),flo(m);
for(int i=0;i<n;i++)
{
cin>>spr[i];
}
int mn=LLONG_MAX;
int mx=0;
for(int i=0;i<m;i++)
{
cin>>flo[i];
mn=min(mn,flo[i]);
mx=max(mx,flo[i]);
}
if(spr[0]>=mx&&n==1)
{
cout<<spr[0]-mn;
cout<<endl;
cout<<"L";
}
else if(spr[0]<=mn&&n==1)
{
cout<<mx-spr[0];
cout<<endl;
cout<<"R";
}
else if(n==1){
cout<<"-1";
return 0;
}
int dif=0;
for(int i=0;i<m;i++)
{
auto it= lower_bound(spr.begin(),spr.end(),flo[i]);
if(*it==flo[i])
continue;
if(it!=spr.end())
dif=max(dif,abs(*it-flo[i]));
if(it!=spr.begin())
{
it--;
dif=max(dif,abs(*it-flo[i]));
}
}
cout<<dif<<endl;
for(int i=0;i<n;i+=3)
{
cout<<"LRR";
}
;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Correct |
2 |
Correct |
1 ms |
336 KB |
Correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Correct |
2 |
Incorrect |
22 ms |
848 KB |
Incorrect string length |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Correct |
2 |
Incorrect |
27 ms |
2128 KB |
User solution is worse than jury's solution |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Correct |
2 |
Correct |
1 ms |
336 KB |
Correct |
3 |
Incorrect |
1 ms |
336 KB |
Incorrect string length |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Correct |
2 |
Incorrect |
33 ms |
2140 KB |
Incorrect string length |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Correct |
2 |
Correct |
1 ms |
336 KB |
Correct |
3 |
Incorrect |
22 ms |
848 KB |
Incorrect string length |
4 |
Halted |
0 ms |
0 KB |
- |