#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef vector<char> VC;
typedef vector<VC> VVC;
typedef vector<bool> VB;
typedef vector<VB> VVB;
void solve() {
int n, m;
cin >> n >> m;
VI a(n);
/* jur */
VI b(m);
/* caxik */
for (int& x : a) cin >> x;
for (int& x : b) cin >> x;
string ans(n, 'L');
auto can = [&](ll d) {
int j = 0;
// verjin chjrac caxik@
rep(i, n) {
if (b[j] < a[i] - d) return false;
if (b[j] < a[i]) {
// a[i]-n pti dzax naye
ans[i] = 'L';
while (j < m && b[j] <= a[i]) j++;
} else {
// a[i]-n pti aj naye
ans[i] = 'R';
while (j < m && b[j] <= a[i]+d) j++;
}
if (j == m) break;
}
return j == m;
};
replr(i, 0, 200) cout << can(i); cout << endl;
ll l = 0, r = 2e9;
while (l + 1 < r) {
ll m = (l + r) / 2;
if (can(m)) r = m;
else l = m;
}
if (r == 2e9) cout << -1 << endl;
else {
can(r);
cout << r << endl;
cout << ans << endl;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
/*freopen("mincross.in", "r", stdin); */
/*freopen("test.out", "w", stdout); */
int t = 1;
/*cin >> t; */
while (t--) solve();
}
Compilation message
Main.cpp: In function 'void solve()':
Main.cpp:7:24: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
7 | #define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
| ^~~
Main.cpp:68:5: note: in expansion of macro 'replr'
68 | replr(i, 0, 200) cout << can(i); cout << endl;
| ^~~~~
Main.cpp:68:38: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
68 | replr(i, 0, 200) cout << can(i); cout << endl;
| ^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
348 KB |
Expected integer, but "000000111111111111111111111111...1111111111111111111111111111111" found |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Expected integer, but "000000000000000000000000000000...0000000000000000000000000000000" found |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
348 KB |
Expected integer, but "000000111111111111111111111111...1111111111111111111111111111111" found |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
348 KB |
Expected integer, but "000000111111111111111111111111...1111111111111111111111111111111" found |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
348 KB |
Expected integer, but "000000111111111111111111111111...1111111111111111111111111111111" found |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
348 KB |
Expected integer, but "000000111111111111111111111111...1111111111111111111111111111111" found |
| 2 |
Halted |
0 ms |
0 KB |
- |
