oj.uz

답안 #1091145

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1091145 2024-09-19T23:35:50 Z Pajaraja Sprinklers (CEOI24_sprinklers) C++17
26 / 100
 81 ms 3452 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 && s[d+1]<=f[i]) d++;
        if(d>=0 && d<n && 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Correct
2 Correct 0 ms 348 KB Correct

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Correct
2 Correct 23 ms 1372 KB Correct
3 Correct 0 ms 348 KB Correct
4 Correct 33 ms 1576 KB Correct
5 Correct 24 ms 1600 KB Correct
6 Correct 1 ms 348 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 5 ms 676 KB Correct
9 Correct 0 ms 348 KB Correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Correct
2 Correct 26 ms 1800 KB Correct
3 Correct 5 ms 604 KB Correct
4 Correct 73 ms 3312 KB Correct
5 Correct 65 ms 3156 KB Correct
6 Correct 0 ms 344 KB Correct
7 Correct 0 ms 344 KB Correct
8 Correct 53 ms 3188 KB Correct
9 Correct 56 ms 3156 KB Correct
10 Correct 58 ms 3148 KB Correct
11 Correct 34 ms 2136 KB Correct
12 Correct 37 ms 2228 KB Correct
13 Correct 42 ms 2396 KB Correct
14 Correct 48 ms 2640 KB Correct
15 Correct 54 ms 2644 KB Correct
16 Correct 39 ms 2392 KB Correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Correct
2 Correct 0 ms 348 KB Correct
3 Correct 1 ms 344 KB Correct
4 Correct 0 ms 348 KB Correct
5 Correct 1 ms 348 KB Correct
6 Correct 1 ms 356 KB Correct
7 Correct 1 ms 348 KB Correct
8 Correct 1 ms 344 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 1 ms 448 KB Correct
14 Correct 0 ms 344 KB Correct
15 Correct 1 ms 348 KB Correct
16 Correct 0 ms 348 KB Correct
17 Correct 0 ms 348 KB Correct
18 Correct 0 ms 344 KB Correct
19 Correct 1 ms 348 KB Correct
20 Correct 1 ms 348 KB Correct

Subtask #4
0.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Correct
2 Correct 30 ms 1880 KB Correct
3 Correct 81 ms 3152 KB Correct
4 Correct 77 ms 3384 KB Correct
5 Correct 77 ms 3340 KB Correct
6 Correct 78 ms 3412 KB Correct
7 Correct 76 ms 3356 KB Correct
8 Correct 73 ms 3408 KB Correct
9 Correct 75 ms 3408 KB Correct
10 Correct 75 ms 3452 KB Correct
11 Correct 79 ms 3412 KB Correct
12 Correct 0 ms 344 KB Correct
13 Correct 0 ms 344 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Correct
2 Correct 0 ms 348 KB Correct
3 Correct 23 ms 1372 KB Correct
4 Correct 0 ms 348 KB Correct
5 Correct 33 ms 1576 KB Correct
6 Correct 24 ms 1600 KB Correct
7 Correct 1 ms 348 KB Correct
8 Correct 0 ms 348 KB Correct
9 Correct 5 ms 676 KB Correct
10 Correct 0 ms 348 KB Correct
11 Correct 26 ms 1800 KB Correct
12 Correct 5 ms 604 KB Correct
13 Correct 73 ms 3312 KB Correct
14 Correct 65 ms 3156 KB Correct
15 Correct 0 ms 344 KB Correct
16 Correct 0 ms 344 KB Correct
17 Correct 53 ms 3188 KB Correct
18 Correct 56 ms 3156 KB Correct
19 Correct 58 ms 3148 KB Correct
20 Correct 34 ms 2136 KB Correct
21 Correct 37 ms 2228 KB Correct
22 Correct 42 ms 2396 KB Correct
23 Correct 48 ms 2640 KB Correct
24 Correct 54 ms 2644 KB Correct
25 Correct 39 ms 2392 KB Correct
26 Correct 1 ms 344 KB Correct
27 Correct 0 ms 348 KB Correct
28 Correct 1 ms 348 KB Correct
29 Correct 1 ms 356 KB Correct
30 Correct 1 ms 348 KB Correct
31 Correct 1 ms 344 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 1 ms 448 KB Correct
37 Correct 0 ms 344 KB Correct
38 Correct 1 ms 348 KB Correct
39 Correct 0 ms 348 KB Correct
40 Correct 0 ms 348 KB Correct
41 Correct 0 ms 344 KB Correct
42 Correct 1 ms 348 KB Correct
43 Correct 1 ms 348 KB Correct
44 Correct 30 ms 1880 KB Correct
45 Correct 81 ms 3152 KB Correct
46 Correct 77 ms 3384 KB Correct
47 Correct 77 ms 3340 KB Correct
48 Correct 78 ms 3412 KB Correct
49 Correct 76 ms 3356 KB Correct
50 Correct 73 ms 3408 KB Correct
51 Correct 75 ms 3408 KB Correct
52 Correct 75 ms 3452 KB Correct
53 Correct 79 ms 3412 KB Correct
54 Correct 0 ms 344 KB Correct
55 Correct 0 ms 344 KB Correct
56 Incorrect 33 ms 1892 KB User solution is worse than jury's solution
57 Halted 0 ms 0 KB -