oj.uz

답안 #1047290

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1047290 2024-08-07T11:43:21 Z Mher777 Sprinklers (CEOI24_sprinklers) C++17
100 / 100
 74 ms 2648 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 s[N], f[N], dp[N], from[N], type[N];
int n, m;
// 1 -> L, 2 -> R, 3 -> RL

void slv() {
    cin >> n >> m;
    ++n;
    for (int i = 2; i <= n; ++i) {
        cin >> s[i];
    }
    for (int i = 1; i <= m; ++i) {
        cin >> f[i];
    }
    int l = 0, r = 1e9, mid, lx, rx, ans = MAX;
    string answ;
    while (l <= r) {
        mid = (l + r) / 2;
        for (int i = 2; i <= n; ++i) {
            dp[i] = 0;
            lx = s[i] - mid, rx = s[i];
            int ind = dp[i - 1] + 1;
            while (ind <= m && f[ind] >= lx && f[ind] <= rx) {
                ++ind;
            }
            if (ind - 1 > dp[i]) {
                dp[i] = ind - 1;
                type[i] = 1;
                from[i] = i - 1;
            }
            ind = dp[i - 1] + 1;
            lx = s[i], rx = s[i] + mid;
            while (ind <= m && f[ind] >= lx && f[ind] <= rx) {
                ++ind;
            }
            if (ind - 1 > dp[i]) {
                dp[i] = ind - 1;
                type[i] = 2;
                from[i] = i - 1;
            }
            if (i == 2 || (s[i] - mid) >= s[i - 1] || (s[i - 1] + mid) <= s[i]) continue;
            ind = dp[i - 2] + 1;
            lx = s[i] - mid, rx = s[i - 1] + mid;
            while (ind <= m && f[ind] >= lx && f[ind] <= rx) {
                ++ind;
            }
            if (ind - 1 > dp[i]) {
                dp[i] = ind - 1;
                type[i] = 3;
                from[i] = i - 2;
            }
        }
        if (dp[n] == m) {
            r = mid - 1;
            ans = mid;
            answ = "";
            int ind = n;
            while (ind >= 2) {
                if (type[ind] == 1) {
                    answ += "L";
                }
                else if (type[ind] == 2) {
                    answ += "R";
                }
                else {
                    answ += "LR";
                }
                ind = from[ind];
            }
            reverse(all(answ));
        }
        else {
            l = mid + 1;
        }
    }
    if (ans == MAX) {
        int x = 1;
        cout << -1;
        return;
    }
    cout << ans << '\n' << answ;
}

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++) {
      |                     ~~^~~~~~~~~~
Main.cpp: In function 'void slv()':
Main.cpp:252:13: warning: unused variable 'x' [-Wunused-variable]
  252 |         int x = 1;
      |             ^

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 0 ms 348 KB Correct

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Correct
2 Correct 5 ms 604 KB Correct
3 Correct 0 ms 348 KB Correct
4 Correct 6 ms 860 KB Correct
5 Correct 6 ms 860 KB Correct
6 Correct 0 ms 348 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 2 ms 348 KB Correct
9 Correct 0 ms 348 KB Correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 10 ms 860 KB Correct
3 Correct 4 ms 600 KB Correct
4 Correct 41 ms 2624 KB Correct
5 Correct 45 ms 2644 KB Correct
6 Correct 0 ms 348 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 31 ms 2628 KB Correct
9 Correct 30 ms 2556 KB Correct
10 Correct 36 ms 2648 KB Correct
11 Correct 28 ms 2140 KB Correct
12 Correct 21 ms 1372 KB Correct
13 Correct 40 ms 2500 KB Correct
14 Correct 41 ms 2396 KB Correct
15 Correct 44 ms 2392 KB Correct
16 Correct 37 ms 2496 KB Correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 0 ms 348 KB Correct
3 Correct 0 ms 348 KB Correct
4 Correct 0 ms 348 KB Correct
5 Correct 0 ms 348 KB Correct
6 Correct 0 ms 348 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 0 ms 348 KB Correct
9 Correct 0 ms 348 KB Correct
10 Correct 0 ms 348 KB Correct
11 Correct 0 ms 348 KB Correct
12 Correct 0 ms 348 KB Correct
13 Correct 0 ms 348 KB Correct
14 Correct 0 ms 348 KB Correct
15 Correct 0 ms 348 KB Correct
16 Correct 0 ms 348 KB Correct
17 Correct 0 ms 348 KB Correct
18 Correct 0 ms 348 KB Correct
19 Correct 0 ms 348 KB Correct
20 Correct 0 ms 348 KB Correct

Subtask #4
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 14 ms 860 KB Correct
3 Correct 64 ms 2648 KB Correct
4 Correct 74 ms 2640 KB Correct
5 Correct 65 ms 2620 KB Correct
6 Correct 63 ms 2640 KB Correct
7 Correct 64 ms 2644 KB Correct
8 Correct 66 ms 2620 KB Correct
9 Correct 62 ms 2612 KB Correct
10 Correct 62 ms 2644 KB Correct
11 Correct 64 ms 2640 KB Correct
12 Correct 0 ms 348 KB Correct
13 Correct 0 ms 348 KB Correct
14 Correct 34 ms 2236 KB Correct
15 Correct 35 ms 2248 KB Correct
16 Correct 30 ms 2136 KB Correct
17 Correct 33 ms 2628 KB Correct
18 Correct 32 ms 2632 KB Correct
19 Correct 35 ms 2644 KB Correct
20 Correct 55 ms 2624 KB Correct
21 Correct 55 ms 2484 KB Correct
22 Correct 52 ms 2628 KB Correct
23 Correct 55 ms 2644 KB Correct
24 Correct 50 ms 2644 KB Correct
25 Correct 50 ms 2640 KB Correct
26 Correct 27 ms 1948 KB Correct
27 Correct 22 ms 1112 KB Correct
28 Correct 45 ms 2500 KB Correct
29 Correct 42 ms 2392 KB Correct
30 Correct 44 ms 2396 KB Correct
31 Correct 37 ms 2384 KB Correct

Subtask #5
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 0 ms 348 KB Correct
3 Correct 5 ms 604 KB Correct
4 Correct 0 ms 348 KB Correct
5 Correct 6 ms 860 KB Correct
6 Correct 6 ms 860 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 0 ms 348 KB Correct
9 Correct 2 ms 348 KB Correct
10 Correct 0 ms 348 KB Correct
11 Correct 10 ms 860 KB Correct
12 Correct 4 ms 600 KB Correct
13 Correct 41 ms 2624 KB Correct
14 Correct 45 ms 2644 KB Correct
15 Correct 0 ms 348 KB Correct
16 Correct 0 ms 348 KB Correct
17 Correct 31 ms 2628 KB Correct
18 Correct 30 ms 2556 KB Correct
19 Correct 36 ms 2648 KB Correct
20 Correct 28 ms 2140 KB Correct
21 Correct 21 ms 1372 KB Correct
22 Correct 40 ms 2500 KB Correct
23 Correct 41 ms 2396 KB Correct
24 Correct 44 ms 2392 KB Correct
25 Correct 37 ms 2496 KB Correct
26 Correct 0 ms 348 KB Correct
27 Correct 0 ms 348 KB Correct
28 Correct 0 ms 348 KB Correct
29 Correct 0 ms 348 KB Correct
30 Correct 0 ms 348 KB Correct
31 Correct 0 ms 348 KB Correct
32 Correct 0 ms 348 KB Correct
33 Correct 0 ms 348 KB Correct
34 Correct 0 ms 348 KB Correct
35 Correct 0 ms 348 KB Correct
36 Correct 0 ms 348 KB Correct
37 Correct 0 ms 348 KB Correct
38 Correct 0 ms 348 KB Correct
39 Correct 0 ms 348 KB Correct
40 Correct 0 ms 348 KB Correct
41 Correct 0 ms 348 KB Correct
42 Correct 0 ms 348 KB Correct
43 Correct 0 ms 348 KB Correct
44 Correct 14 ms 860 KB Correct
45 Correct 64 ms 2648 KB Correct
46 Correct 74 ms 2640 KB Correct
47 Correct 65 ms 2620 KB Correct
48 Correct 63 ms 2640 KB Correct
49 Correct 64 ms 2644 KB Correct
50 Correct 66 ms 2620 KB Correct
51 Correct 62 ms 2612 KB Correct
52 Correct 62 ms 2644 KB Correct
53 Correct 64 ms 2640 KB Correct
54 Correct 0 ms 348 KB Correct
55 Correct 0 ms 348 KB Correct
56 Correct 34 ms 2236 KB Correct
57 Correct 35 ms 2248 KB Correct
58 Correct 30 ms 2136 KB Correct
59 Correct 33 ms 2628 KB Correct
60 Correct 32 ms 2632 KB Correct
61 Correct 35 ms 2644 KB Correct
62 Correct 55 ms 2624 KB Correct
63 Correct 55 ms 2484 KB Correct
64 Correct 52 ms 2628 KB Correct
65 Correct 55 ms 2644 KB Correct
66 Correct 50 ms 2644 KB Correct
67 Correct 50 ms 2640 KB Correct
68 Correct 27 ms 1948 KB Correct
69 Correct 22 ms 1112 KB Correct
70 Correct 45 ms 2500 KB Correct
71 Correct 42 ms 2392 KB Correct
72 Correct 44 ms 2396 KB Correct
73 Correct 37 ms 2384 KB Correct
74 Correct 9 ms 860 KB Correct
75 Correct 57 ms 2644 KB Correct
76 Correct 63 ms 2644 KB Correct
77 Correct 0 ms 348 KB Correct
78 Correct 30 ms 2628 KB Correct
79 Correct 35 ms 2644 KB Correct
80 Correct 28 ms 2608 KB Correct
81 Correct 28 ms 2136 KB Correct
82 Correct 31 ms 2136 KB Correct
83 Correct 29 ms 2244 KB Correct
84 Correct 8 ms 644 KB Correct
85 Correct 48 ms 2480 KB Correct
86 Correct 61 ms 2392 KB Correct
87 Correct 41 ms 2392 KB Correct
88 Correct 7 ms 860 KB Correct
89 Correct 8 ms 860 KB Correct