This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, M;
cin >> N >> M;
vector<int> sprinks(N);
vector<int> flowers(M);
for (int i=0; i<N; i++)
cin >> sprinks[i];
for (int i=0; i<M; i++)
cin >> flowers[i];
if (N==1)
{
int left = flowers[0]-sprinks[0];
int righ = flowers[M-1]-sprinks[0];
if ((left<0) and (righ>0))
cout << "-1\n";
else
{
cout << max(abs(left), abs(righ)) << '\n';
if (left<0)
cout << "L\n";
else
cout << "R\n";
}
}
}
# | 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... |