oj.uz

Submission #1053094

# Submission time Handle Problem Language Result Execution time Memory
1053094 2024-08-11T08:43:10 Z elazarkoren Sprinklers (CEOI24_sprinklers) C++17
26 / 100
 47 ms 4808 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] = f[j] - s[i] <= k ? j : -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 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 (Solve(mid)) end = mid;
        else begin = mid + 1;
    }
    if (!Solve(end)) {
        cout << -1 << '\n';
        return 0;
    }
    cout << end << '\n';
    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 0 ms 344 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 1112 KB Correct
3 Correct 0 ms 348 KB Correct
4 Correct 6 ms 1004 KB Correct
5 Correct 8 ms 1112 KB Correct
6 Correct 0 ms 344 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 2 ms 604 KB Correct
9 Correct 0 ms 348 KB Correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 7 ms 1112 KB Correct
3 Correct 3 ms 740 KB Correct
4 Correct 24 ms 4756 KB Correct
5 Correct 26 ms 4808 KB Correct
6 Correct 0 ms 348 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 14 ms 4308 KB Correct
9 Correct 14 ms 4304 KB Correct
10 Correct 21 ms 4648 KB Correct
11 Correct 15 ms 3104 KB Correct
12 Correct 14 ms 3016 KB Correct
13 Correct 19 ms 3536 KB Correct
14 Correct 31 ms 3796 KB Correct
15 Correct 21 ms 4052 KB Correct
16 Correct 19 ms 3540 KB Correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory 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 1 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 1 ms 348 KB Correct
13 Correct 0 ms 480 KB Correct
14 Correct 0 ms 348 KB Correct
15 Correct 0 ms 348 KB Correct
16 Correct 0 ms 464 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
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 9 ms 1372 KB Correct
3 Correct 39 ms 4756 KB Correct
4 Correct 36 ms 4636 KB Correct
5 Correct 43 ms 4808 KB Correct
6 Correct 34 ms 4748 KB Correct
7 Correct 46 ms 4796 KB Correct
8 Correct 35 ms 4800 KB Correct
9 Correct 47 ms 4796 KB Correct
10 Correct 35 ms 4700 KB Correct
11 Correct 36 ms 4808 KB Correct
12 Correct 0 ms 348 KB Correct
13 Correct 0 ms 396 KB Correct
14 Correct 13 ms 3040 KB Correct
15 Correct 15 ms 3028 KB Correct
16 Correct 13 ms 3028 KB Correct
17 Correct 11 ms 3296 KB Correct
18 Correct 12 ms 3536 KB Correct
19 Correct 15 ms 3796 KB Correct
20 Incorrect 30 ms 4308 KB User solution is worse than jury's solution
21 Halted 0 ms 0 KB -

Subtask #5
0.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 0 ms 348 KB Correct
3 Correct 6 ms 1112 KB Correct
4 Correct 0 ms 348 KB Correct
5 Correct 6 ms 1004 KB Correct
6 Correct 8 ms 1112 KB Correct
7 Correct 0 ms 344 KB Correct
8 Correct 0 ms 348 KB Correct
9 Correct 2 ms 604 KB Correct
10 Correct 0 ms 348 KB Correct
11 Correct 7 ms 1112 KB Correct
12 Correct 3 ms 740 KB Correct
13 Correct 24 ms 4756 KB Correct
14 Correct 26 ms 4808 KB Correct
15 Correct 0 ms 348 KB Correct
16 Correct 0 ms 348 KB Correct
17 Correct 14 ms 4308 KB Correct
18 Correct 14 ms 4304 KB Correct
19 Correct 21 ms 4648 KB Correct
20 Correct 15 ms 3104 KB Correct
21 Correct 14 ms 3016 KB Correct
22 Correct 19 ms 3536 KB Correct
23 Correct 31 ms 3796 KB Correct
24 Correct 21 ms 4052 KB Correct
25 Correct 19 ms 3540 KB Correct
26 Correct 0 ms 348 KB Correct
27 Correct 0 ms 348 KB Correct
28 Correct 1 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 1 ms 348 KB Correct
36 Correct 0 ms 480 KB Correct
37 Correct 0 ms 348 KB Correct
38 Correct 0 ms 348 KB Correct
39 Correct 0 ms 464 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 9 ms 1372 KB Correct
45 Correct 39 ms 4756 KB Correct
46 Correct 36 ms 4636 KB Correct
47 Correct 43 ms 4808 KB Correct
48 Correct 34 ms 4748 KB Correct
49 Correct 46 ms 4796 KB Correct
50 Correct 35 ms 4800 KB Correct
51 Correct 47 ms 4796 KB Correct
52 Correct 35 ms 4700 KB Correct
53 Correct 36 ms 4808 KB Correct
54 Correct 0 ms 348 KB Correct
55 Correct 0 ms 396 KB Correct
56 Correct 13 ms 3040 KB Correct
57 Correct 15 ms 3028 KB Correct
58 Correct 13 ms 3028 KB Correct
59 Correct 11 ms 3296 KB Correct
60 Correct 12 ms 3536 KB Correct
61 Correct 15 ms 3796 KB Correct
62 Incorrect 30 ms 4308 KB User solution is worse than jury's solution
63 Halted 0 ms 0 KB -