oj.uz

Submission #1075458

# Submission time Handle Problem Language Result Execution time Memory
1075458 2024-08-26T06:30:53 Z ProtonDecay314 Sprinklers (CEOI24_sprinklers) C++17
0 / 100
 13 ms 1884 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<bool> vb;
typedef set<ll> sll;
#define IOS cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false)
#define INF(dtype) numeric_limits<dtype>::max()
#define NINF(dtype) numeric_limits<dtype>::min()
#define fi first
#define se second

typedef pair<int, vb> pib;

pib solve(int n, int m, const vi& s, const vi& f) {
    vb config(n, false);
    for(int i = 0; i * 3 < n; i++) {
        config[3 * i] = false;
        config[3 * i + 2] = true;
    }
    int ans = 0;

    for(int i = 0; i < m; i++) {
        int l = -1, r = n / 3;

        while(r - l > 1) {
            int mid = (l + r) >> 1;

            if(s[mid * 3] <= f[i]) l = mid;
            else r = mid;
        }

        if(l == -1) ans = max(ans, s[0] - f[i]);
        else if(r == n / 3) ans = max(ans, f[i] - s[n / 3 - 1]);
        else ans = max(ans, min(f[i] - s[l * 3], s[r * 3] - f[i]));
    }

    return {ans, config};
}

int main() {
    IOS;

    int n, m;
    cin >> n >> m;

    vi s(n, 0);
    vi f(m, 0);

    for(int& sv : s) cin >> sv;
    for(int& fv : f) cin >> fv;

    auto [ans, config] = solve(n, m, s, f);

    cout << ans << "\n";

    if(ans != -1) {
        for(const bool& b : config) cout << (b ? 'R' : 'L');
        cout << "\n";
    }
    cout << flush;

    return 0;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Correct
2 Incorrect 0 ms 348 KB User solution is incorrect
3 Halted 0 ms 0 KB -

Subtask #1
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB User solution is incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 6.0

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

Subtask #3
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Correct
2 Incorrect 0 ms 348 KB User solution is incorrect
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 27.0

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

Subtask #5
0.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Correct
2 Incorrect 0 ms 348 KB User solution is incorrect
3 Halted 0 ms 0 KB -