oj.uz

Submission #1046136

# Submission time Handle Problem Language Result Execution time Memory
1046136 2024-08-06T10:26:26 Z Mher777 Sprinklers (CEOI24_sprinklers) C++17
20 / 100
 2000 ms 1236 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <cassert>
#include <fstream>
using namespace std;
mt19937_64 rnd(7069);

/* -------------------- Typedefs -------------------- */

typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
typedef long double ld;

/* -------------------- Usings -------------------- */

using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

/* -------------------- Defines -------------------- */

#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define all(x) (x).begin(), (x).end()
#define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout);

/* -------------------- Constants -------------------- */

const int dx[8] = { -1, 0, 1, 0, -1, -1, 1, 1 };
const int dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18) + 5ll;
const ll MOD = ll(1000000007);
const ll MOD2 = ll(998244353);

/* -------------------- Functions -------------------- */

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

void precision(int x) {
    cout.setf(ios::fixed | ios::showpoint);
    cout.precision(x);
}

ll gcd(ll a, ll b) {
    if (a == 0 || b == 0) return(max(a, b));
    while (b) {
        a %= b;
        swap(a, b);
    }
    return a;
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

ll range_sum(ll a, ll b) {
    if (a > b) return 0ll;
    ll dif = a - 1, cnt = b - a + 1;
    ll ans = ((b - a + 1) * (b - a + 2)) / 2;
    ans += ((b - a + 1) * dif);
    return ans;
}

string dec_to_bin(ll a) {
    string s = "";
    for (ll i = a; i > 0; ) {
        ll k = i % 2;
        i /= 2;
        char c = k + 48;
        s += c;
    }
    if (a == 0) {
        s = "0";
    }
    reverse(all(s));
    return s;
}

ll bin_to_dec(string s) {
    ll num = 0;
    for (int i = 0; i < s.size(); i++) {
        num *= 2ll;
        num += (s[i] - '0');
    }
    return num;
}

ll factorial_by_mod(ll n, ll mod) {
    ll ans = 1;
    ll num;
    for (ll i = 1; i <= n; ++i) {
        num = i % mod;
        ans *= num;
        ans %= mod;
    }
    return ans;
}

bool isPrime(ll a) {
    if (a == 1) return false;
    for (ll i = 2; i * i <= a; i++) {
        if (a % i == 0) return false;
    }
    return true;
}

ll binpow(ll a, ll b) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
        }
        b >>= 1;
        a *= a;
    }
    return ans;
}

ll binpow_by_mod(ll a, ll b, ll mod) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
            ans %= mod;
        }
        b >>= 1;
        a *= a;
        a %= mod;
    }
    return ans;
}

/* -------------------- Solution -------------------- */

const int N = 100005;
int n, m;

void slv() {
    cin >> n >> m;
    vi s(n), f(m);
    for (int i = 0; i < n; ++i) {
        cin >> s[i];
    }
    for (int i = 0; i < m; ++i) {
        cin >> f[i];
    }
    if (n == 1) {
        if (f[m - 1] > s[0] && f[0] < s[0]) {
            cout << -1;
            return;
        }
        cout << max(abs(f[m - 1] - s[0]), abs(f[0] - s[0])) << '\n';
        if (f[m - 1] > s[0]) {
            cout << "R";
            return;
        }
        cout << "L";
        return;
    }
    string str, ans;  
    int answ = MAX;
    for (int mask = 0; mask < (1 << n); ++mask) {
        str = "";
        for (int i = 0; i < n; ++i) {
            if ((1 << i) & mask) {
                str += "R";
            }
            else {
                str += "L";
            }
        }
        int l = 0, r = MAX, mid, ind = MAX;
        while (l <= r) {
            mid = (l + r) / 2;
            vi bit(m + 5);
            for (int i = 0; i < n; ++i) {
                int lx, rx;
                if (str[i] == 'L') {
                    lx = s[i] - mid;
                    rx = s[i];
                }
                else {
                    lx = s[i];
                    rx = s[i] + mid;
                }
                int ind1 = lower_bound(all(f), lx) - f.begin();
                int ind2 = upper_bound(all(f), rx) - f.begin() - 1;
                for (int j = ind1; j <= ind2; ++j) {
                    bit[j] = 1;
                }
            }
            bool flag = true;
            for (int i = 0; i < m; ++i) {
                if (!bit[i]) {
                    flag = false;
                    break;
                }
            }
            if (flag) {
                r = mid - 1;
                ind = mid;
            }
            else {
                l = mid + 1;
            }
        }
        if (ind < answ) {
            answ = ind;
            ans = str;
        }
    }
    cout << answ << '\n' << ans;
}

void cs() {
    int tstc = 1;
    //cin >> tstc;
    while (tstc--) {
        slv();
    }
}

void precalc() {
    return;
}

int main() {
    fastio();
    precalc();
    //precision(0);
    cs();
    return 0;
}

Compilation message

Main.cpp: In function 'll range_sum(ll, ll)':
Main.cpp:97:21: warning: unused variable 'cnt' [-Wunused-variable]
   97 |     ll dif = a - 1, cnt = b - a + 1;
      |                     ^~~
Main.cpp: In function 'll bin_to_dec(std::string)':
Main.cpp:120:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct
2 Correct 0 ms 348 KB Correct

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct
2 Correct 4 ms 604 KB Correct
3 Correct 0 ms 348 KB Correct
4 Correct 5 ms 604 KB Correct
5 Correct 7 ms 604 KB Correct
6 Correct 1 ms 344 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 1 ms 348 KB Correct
9 Correct 0 ms 348 KB Correct

Subtask #2
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct
2 Execution timed out 2090 ms 1236 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct
2 Correct 0 ms 348 KB Correct
3 Correct 25 ms 348 KB Correct
4 Correct 2 ms 348 KB Correct
5 Correct 46 ms 348 KB Correct
6 Correct 43 ms 348 KB Correct
7 Correct 1 ms 344 KB Correct
8 Correct 68 ms 344 KB Correct
9 Correct 62 ms 348 KB Correct
10 Correct 72 ms 452 KB Correct
11 Correct 8 ms 348 KB Correct
12 Correct 50 ms 444 KB Correct
13 Correct 46 ms 348 KB Correct
14 Correct 4 ms 348 KB Correct
15 Correct 44 ms 348 KB Correct
16 Correct 41 ms 348 KB Correct
17 Correct 36 ms 348 KB Correct
18 Correct 57 ms 348 KB Correct
19 Correct 0 ms 344 KB Correct
20 Correct 0 ms 348 KB Correct

Subtask #4
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct
2 Execution timed out 2096 ms 1184 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct
2 Correct 0 ms 348 KB Correct
3 Correct 4 ms 604 KB Correct
4 Correct 0 ms 348 KB Correct
5 Correct 5 ms 604 KB Correct
6 Correct 7 ms 604 KB Correct
7 Correct 1 ms 344 KB Correct
8 Correct 0 ms 348 KB Correct
9 Correct 1 ms 348 KB Correct
10 Correct 0 ms 348 KB Correct
11 Execution timed out 2090 ms 1236 KB Time limit exceeded
12 Halted 0 ms 0 KB -