oj.uz

Submission #1053134

# Submission time Handle Problem Language Result Execution time Memory
1053134 2024-08-11T09:03:35 Z elazarkoren Sprinklers (CEOI24_sprinklers) C++17
20 / 100
 2000 ms 1548 KB 
#include <bits/stdc++.h>
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define chkmin(a, b) a = min(a, b)
#define chkmax(a, b) a = max(a, b)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vii;

const int MAX_N = 1e5 + 5;

ll s[MAX_N], f[MAX_N];
int ri[MAX_N];
int n, m;

bool Solve(int k) {
    int i = 0, j = 0;
    vi leftest(n);
    while (i < n && j < m) {
        if (f[j] >= s[i]) {
            leftest[i] = -1;
            while (j < m && f[j] - s[i] <= k) j++;
            ri[i] = 1;
            i++;
            continue;
        }
        if (s[i] - f[j] > k) return 0;
        ri[i] = 0;
        if (i && leftest[i - 1] != -1 && s[i] - f[leftest[i - 1]] <= k) {
            leftest[i] = leftest[i - 1];
            while (j < m && f[j] - s[i - 1] <= k) j++;
            ri[i - 1] = 1;
        } else {
            leftest[i] = j;
        }
        while (j < m && f[j] <= s[i] && s[i] - f[j] <= k) j++;
        i++;
    }
    return j == m;
}

int Solve2(int k) {
    for (int i = 0; i < (1 << n); i++) {
        vii ranges;
        for (int j = 0; j < n; j++) {
            if ((i >> j) & 1) ranges.push_back({s[j], s[j] + k});
            else ranges.push_back({s[j] - k, s[j]});
        }
        sort(all(ranges));
        int a = 0, b = 0;
        while (a < n && b < m) {
            if (ranges[a].x <= f[b] && f[b] <= ranges[a].y) b++;
            else a++;
        }
        if (b == m) {
            return i + 1;
        }
    }
    return 0;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    for (int i = 0; i < n; i++) cin >> s[i];
    for (int i = 0; i < m; i++) cin >> f[i];
    int begin = 0, end = 1e9 + 1;
    while (begin < end) {
        int mid = (begin + end) >> 1;
        if (Solve2(mid)) end = mid;
        else begin = mid + 1;
    }
//    int end;
//    for (end = 0; end <= 8; end++) {
//        if (Solve(end)) break;
//    }
    int x = Solve2(end);
    if (!x) {
        cout << -1 << '\n';
        return 0;
    }
    cout << end << '\n';
    x--;
    for (int i = 0; i < n; i++) {
        cout << ((x >> i) & 1 ? 'R' : 'L');
    }
//    for (int i = 0; i < n; i++) {
//        cout << (ri[i] ? 'R' : 'L');
//    }
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 6 ms 1116 KB Correct
3 Correct 0 ms 348 KB Correct
4 Correct 6 ms 1152 KB Correct
5 Correct 7 ms 1116 KB Correct
6 Correct 0 ms 348 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 1 ms 604 KB Correct
9 Correct 0 ms 348 KB Correct

Subtask #2
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Correct
2 Incorrect 58 ms 1112 KB User solution is worse than jury's solution
3 Halted 0 ms 0 KB -

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Correct
2 Correct 0 ms 348 KB Correct
3 Correct 5 ms 348 KB Correct
4 Correct 0 ms 348 KB Correct
5 Correct 4 ms 484 KB Correct
6 Correct 7 ms 348 KB Correct
7 Correct 1 ms 348 KB Correct
8 Correct 15 ms 476 KB Correct
9 Correct 16 ms 480 KB Correct
10 Correct 4 ms 348 KB Correct
11 Correct 8 ms 468 KB Correct
12 Correct 4 ms 600 KB Correct
13 Correct 4 ms 348 KB Correct
14 Correct 1 ms 348 KB Correct
15 Correct 1 ms 344 KB Correct
16 Correct 2 ms 348 KB Correct
17 Correct 3 ms 480 KB Correct
18 Correct 1 ms 348 KB Correct
19 Correct 0 ms 348 KB Correct
20 Correct 0 ms 348 KB Correct

Subtask #4
0.0 / 27.0

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

Subtask #5
0.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Correct
2 Correct 0 ms 348 KB Correct
3 Correct 6 ms 1116 KB Correct
4 Correct 0 ms 348 KB Correct
5 Correct 6 ms 1152 KB Correct
6 Correct 7 ms 1116 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 0 ms 348 KB Correct
9 Correct 1 ms 604 KB Correct
10 Correct 0 ms 348 KB Correct
11 Incorrect 58 ms 1112 KB User solution is worse than jury's solution
12 Halted 0 ms 0 KB -