답안 #1091131

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1091131	2024-09-19T22:34:11 Z	Pajaraja	Sprinklers (CEOI24_sprinklers)	C++17	6 / 100	63 ms	3528 KB

Main

#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!=m-1 && s[d+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(s[d+1]>=f[i]) d++;
        if(d>=0 && s[d]!=f[i]) bt[i]=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	348 KB	Correct
2	Incorrect	348 KB	Incorrect string length
3	Halted	0 KB	-

Subtask #1
0.0 / 3.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	348 KB	Incorrect string length
2	Halted	0 ms	0 KB	-

Subtask #2
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Correct
2	Correct	26 ms	1872 KB	Correct
3	Correct	8 ms	604 KB	Correct
4	Correct	61 ms	3412 KB	Correct
5	Correct	63 ms	3408 KB	Correct
6	Correct	0 ms	348 KB	Correct
7	Correct	0 ms	348 KB	Correct
8	Correct	54 ms	3528 KB	Correct
9	Correct	53 ms	3408 KB	Correct
10	Correct	57 ms	3404 KB	Correct
11	Correct	38 ms	1876 KB	Correct
12	Correct	37 ms	2352 KB	Correct
13	Correct	54 ms	2384 KB	Correct
14	Correct	45 ms	2620 KB	Correct
15	Correct	49 ms	2716 KB	Correct
16	Correct	39 ms	2388 KB	Correct