oj.uz

Submission #1091146

# Submission time Handle Problem Language Result Execution time Memory
1091146 2024-09-20T00:18:16 Z Pajaraja Sprinklers (CEOI24_sprinklers) C++17
26 / 100
 79 ms 3500 KB 
#include <bits/stdc++.h>
#define MAXN 100007
using namespace std;
string res;
bool bt[MAXN];
int s[MAXN],f[MAXN],n,m;
bool check(int k){
    res.clear();
    int d=0;
    for(int i=0;i<n;i++) {
        if(d==m) {
            res+='L';
            continue;
        }
        if(f[d]<s[i]) {
            if(f[d]<s[i]-k) return false;
            if(i!=n-1 && s[i+1]-k<=f[d] && bt[i])
            {
                res+="RL";
                while(d<m && f[d]<=s[i]+k) d++;
                i++;
                continue;
            }
            res+='L';
            while(d<m && f[d]<=s[i]) d++;
            continue;
        }
        if(f[d]>=s[i]){
            res+='R';
            while(d<m && f[d]<=s[i]+k) d++;
        }
    }
    if(d==m) return true;
    return false;
}
int binarna(int l,int r)
{
    if(l==r) return l;
    int s=(l+r)/2;
    if(check(s)) return binarna(l,s);
    return binarna(s+1,r);
}
int main() {
    cin>>n>>m;
    for(int i=0;i<n;i++) cin>>s[i];
    for(int i=0;i<m;i++) cin>>f[i];
    int d=-1;
    for(int i=0;i<m;i++) {
        while(d<n-1 && s[d+1]<=f[i]) d++;
        if(d>=0 && s[d]!=f[i]) bt[d]=true;
    }
    int ans=binarna(1,1000000000);
    if(!check(ans)) {
        cout<<-1;
        return 0;
    }
    cout<<ans<<endl<<res<<endl;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 22 ms 1404 KB Correct
3 Correct 0 ms 344 KB Correct
4 Correct 26 ms 1740 KB Correct
5 Correct 26 ms 1628 KB Correct
6 Correct 0 ms 348 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 5 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 348 KB Correct
2 Correct 26 ms 1628 KB Correct
3 Correct 5 ms 604 KB Correct
4 Correct 79 ms 3412 KB Correct
5 Correct 73 ms 3500 KB Correct
6 Correct 1 ms 348 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 55 ms 3224 KB Correct
9 Correct 54 ms 3444 KB Correct
10 Correct 61 ms 3412 KB Correct
11 Correct 32 ms 1956 KB Correct
12 Correct 38 ms 2088 KB Correct
13 Correct 53 ms 2384 KB Correct
14 Correct 48 ms 2644 KB Correct
15 Correct 53 ms 2792 KB Correct
16 Correct 41 ms 2376 KB Correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct
2 Correct 0 ms 348 KB Correct
3 Correct 1 ms 348 KB Correct
4 Correct 0 ms 348 KB Correct
5 Correct 1 ms 344 KB Correct
6 Correct 1 ms 348 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 1 ms 348 KB Correct
9 Correct 1 ms 348 KB Correct
10 Correct 1 ms 348 KB Correct
11 Correct 0 ms 348 KB Correct
12 Correct 1 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 1 ms 344 KB Correct
17 Correct 1 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 348 KB Correct
2 Correct 32 ms 1876 KB Correct
3 Correct 76 ms 3440 KB Correct
4 Correct 75 ms 3408 KB Correct
5 Correct 79 ms 3440 KB Correct
6 Correct 76 ms 3412 KB Correct
7 Correct 78 ms 3348 KB Correct
8 Correct 77 ms 3412 KB Correct
9 Correct 76 ms 3356 KB Correct
10 Correct 76 ms 3448 KB Correct
11 Correct 78 ms 3416 KB Correct
12 Correct 0 ms 352 KB Correct
13 Correct 0 ms 352 KB Correct
14 Incorrect 33 ms 1892 KB User solution is worse than jury's solution
15 Halted 0 ms 0 KB -

Subtask #5
0.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct
2 Correct 0 ms 348 KB Correct
3 Correct 22 ms 1404 KB Correct
4 Correct 0 ms 344 KB Correct
5 Correct 26 ms 1740 KB Correct
6 Correct 26 ms 1628 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 0 ms 348 KB Correct
9 Correct 5 ms 604 KB Correct
10 Correct 0 ms 348 KB Correct
11 Correct 26 ms 1628 KB Correct
12 Correct 5 ms 604 KB Correct
13 Correct 79 ms 3412 KB Correct
14 Correct 73 ms 3500 KB Correct
15 Correct 1 ms 348 KB Correct
16 Correct 0 ms 348 KB Correct
17 Correct 55 ms 3224 KB Correct
18 Correct 54 ms 3444 KB Correct
19 Correct 61 ms 3412 KB Correct
20 Correct 32 ms 1956 KB Correct
21 Correct 38 ms 2088 KB Correct
22 Correct 53 ms 2384 KB Correct
23 Correct 48 ms 2644 KB Correct
24 Correct 53 ms 2792 KB Correct
25 Correct 41 ms 2376 KB Correct
26 Correct 1 ms 348 KB Correct
27 Correct 0 ms 348 KB Correct
28 Correct 1 ms 344 KB Correct
29 Correct 1 ms 348 KB Correct
30 Correct 0 ms 348 KB Correct
31 Correct 1 ms 348 KB Correct
32 Correct 1 ms 348 KB Correct
33 Correct 1 ms 348 KB Correct
34 Correct 0 ms 348 KB Correct
35 Correct 1 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 1 ms 344 KB Correct
40 Correct 1 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 32 ms 1876 KB Correct
45 Correct 76 ms 3440 KB Correct
46 Correct 75 ms 3408 KB Correct
47 Correct 79 ms 3440 KB Correct
48 Correct 76 ms 3412 KB Correct
49 Correct 78 ms 3348 KB Correct
50 Correct 77 ms 3412 KB Correct
51 Correct 76 ms 3356 KB Correct
52 Correct 76 ms 3448 KB Correct
53 Correct 78 ms 3416 KB Correct
54 Correct 0 ms 352 KB Correct
55 Correct 0 ms 352 KB Correct
56 Incorrect 33 ms 1892 KB User solution is worse than jury's solution
57 Halted 0 ms 0 KB -