Stations

input/code.cpp: In function 'bool solve3(ll, std::string&)':
input/code.cpp:57:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |         while (fi < f.size() && l <= f[fi] && f[fi] <= r) {
      |                ~~~^~~~~~~~~~
input/code.cpp:61:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<bool>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |     for (int i = 0; i < fk.size(); i++) {
      |                     ~~^~~~~~~~~~~
input/code.cpp: In function 'void rec(std::string&, int)':
input/code.cpp:88:18: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   88 |     if (s.size() < sz) {
      |         ~~~~~~~~~^~~~
input/code.cpp: In function 'void solve()':
input/code.cpp:120:23: warning: comparis...

#pragma GCC optimize("O3")
#pragma GCC target("arch=skylake")
 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> ll2;
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
void solve(); int main() {
    cin.tie(0); ios_base::sync_with_stdio(0);
    solve();
}

int n, m;

void solve1()
{
    int loc;
    cin >> loc;
    int locmin = loc, locmax = loc;
    for (int i = 0; i < m; i++) {
        int a;
        cin >> a;
        locmin = min(locmin, a);
        locmax = max(locmax, a);
    }
    if (locmin < loc && locmax > loc) {
        cout << -1;
    }
    else {
        cout << max(abs(locmin - loc), abs(locmax - loc)) << "\n";
        if (locmin < loc) cout << "L";
        else cout << "R";
    }
}

vector<int> s;
vector<int> f;

bool solve3(ll ans, string& rotation)
{
    vector<bool> fk(m);
    
    int fi = 0;
    for (int i = 0; i < n; i++) {
        int l, r;
        if (rotation[i] == 'L') {
            l = s[i] - ans;
            r = s[i];
        }
        else {
            l = s[i];
            r = s[i] + ans;
        }
        //cout << "flower = " << f[fi] << " l&r = " << l << " " << r << endl;
        while (fi < f.size() && l <= f[fi] && f[fi] <= r) {
            fk[fi++] = true;
        }
    }
    for (int i = 0; i < fk.size(); i++) {
        if (!fk[i]) return false;
    }

    return true;
}

int solve2(string& s)
{
    ll l = 1, r = INT_MAX / 2;
    while (l < r) {
        ll mid = (l + r) / 2;
        if (solve3(mid, s)) {
            r = mid;
        }
        else {
            l = mid + 1;
        }
    }
    return r;
}

string gsans;
int gans = INT_MAX;

void rec(string& s, int sz)
{
    if (s.size() < sz) {
        s.push_back('L');
        rec(s, sz);
        s.pop_back();
        s.push_back('R');
        rec(s, sz);
        s.pop_back();
    }
    else {
        int ans = solve2(s);
        if (gans > ans) {
            gans = ans;
            gsans = s;
        }
        return;
    }
}


void solve()
{
    cin >> n >> m;
    if (n == 1) {
        solve1();
        return;
    }
    s.resize(n);
    f.resize(m);
    for (int i = 0; i < n; i++) cin >> s[i];
    for (int i = 0; i < m; i++) cin >> f[i];

    bool yes = true;
    for (int i = 0; i < s.size(); i += 3) {
        yes &= s[i] == s[i + 1] && s[i] == s[i + 2];
    }
    if (yes) {
        string s;
        int ans = 0;
        for (int i = 0; i < n / 3; i++) {
            s.append("LLR");
        }
        cout << ans << "\n";
        cout << s;
    }
    else {
        string s;
        rec(s, n);
        if (gans < INT_MAX / 2) {
            cout << gans << "\n";
            cout << gsans;
        }
        else cout << -1;
    }
}

Test 1

Group: 1, 6

Verdict: TIME LIMIT EXCEEDED

Test 2

Group: 1, 6

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 1, 6

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 1, 3, 6

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 1, 3, 6

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 1, 3, 6

Verdict: WRONG ANSWER

Test 7

Group: 1, 6

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 1, 6

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 1, 6

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 1, 6

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 1, 6

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 1, 6

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 1, 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 14

Group: 2, 3, 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3, 6

Verdict: RUNTIME ERROR

Test 16

Group: 3, 6

Verdict: RUNTIME ERROR

Test 17

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 18

Group: 3, 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 19

Group: 3, 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 20

Group: 1, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 21

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 22

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 23

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 24

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 25

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 26

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 27

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 28

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 29

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 30

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 31

Group: 6

Verdict: RUNTIME ERROR

Test 32

Group: 6

Verdict: RUNTIME ERROR

Test 33

Group: 6

Verdict: RUNTIME ERROR

Test 34

Group: 6

Verdict: RUNTIME ERROR

Test 35

Group: 6

Verdict: RUNTIME ERROR

Test 36

Group: 6

Verdict: RUNTIME ERROR

Test 37

Group: 6

Verdict: RUNTIME ERROR

Test 38

Group: 6

Verdict: RUNTIME ERROR