oj.uz

Submission #1070181

# Submission time Handle Problem Language Result Execution time Memory
1070181 2024-08-22T12:07:37 Z vjudge1 Sprinklers (CEOI24_sprinklers) C++17
0 / 100
 15 ms 3208 KB 
#include <bits/stdc++.h>
#define int long long

using namespace std;

void solve() {
   int n, m;
   cin >> n >> m;
   int s[n], f[m];
   for(int i=0; i<n; ++i) cin >> s[i];
   for(int i=0; i<m; ++i) cin >> f[i];
   for(int k=0; k<=8; ++k) {
       bool imp = 0;
       int last = 0, R = -1, L = -1;
       vector<char>ans(n, 'L');
       for(int i=0; i<m; ++i) {
            if(f[i] <= R or L >= f[i]) continue;
            if(last == n) {
                imp = 1;
                break;
            }
            while(last<n && s[last]+k < f[i]) ++last;
            if(last == n) {
                imp = 1;
                break;
            }
            if(s[last] <= f[i]) {
                ans[last] = 'R';
                R = s[last] + k;
            } else if((s[last] - k) > f[i]) {
                imp = 1;
                break;
            } else L = s[last];
            ++last;
        }
        if(imp) continue;
        cout << k << endl;
        for(int i=0; i<n; ++i) cout << ans[i];
        cout << endl;
        return;
    }
    cout << -1 << endl;
}


signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    int t = 1;
    while(t--) solve();
}

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct
2 Incorrect 6 ms 1628 KB User solution is worse than jury's solution
3 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 7 ms 1884 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 Correct 0 ms 348 KB Correct
3 Incorrect 0 ms 348 KB User solution is worse than jury's solution
4 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 Correct 9 ms 2136 KB Correct
3 Incorrect 15 ms 3208 KB User solution is worse than jury's solution
4 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 Correct 0 ms 348 KB Correct
3 Incorrect 6 ms 1628 KB User solution is worse than jury's solution
4 Halted 0 ms 0 KB -