oj.uz

답안 #1070226

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1070226 2024-08-22T12:20:04 Z naneosmic Sprinklers (CEOI24_sprinklers) C++14
3 / 100
 66 ms 6708 KB 
#include <bits/stdc++.h>
#define int long long
#define endl "\n"
using namespace std;
signed main(){
    int n,m;
    cin>>n>>m;
    set<int>nums;
    vector<int>sprinklers(n);
    vector<int>flowers(m);
    for(int i=0;i<n;i++)cin>>sprinklers[i];
    for(int i=0;i<m;i++)cin>>flowers[i];
    for(int i=0;i<n;i++)nums.insert(sprinklers[i]);
    for(int i=0;i<m;i++)nums.insert(flowers[i]);
    int maxdistance=-1;
    bool flag=false;
    auto it1=nums.begin();
    auto it2=nums.end();it2--;
    if(n==1){
        if((sprinklers[0]!=(*it1)&&sprinklers[0]!=(*it2))){
            cout<<-1<<endl;
            flag=true;
        }
    }
    if(!flag){
        for(int i=0;i<m;i++){
            int mindistance=INT_MAX;
            for(int j=0;j<n;j++){
                mindistance=min(mindistance,abs(sprinklers[j]-flowers[i]));
            }
            maxdistance=max(maxdistance,mindistance);
        }
        cout<<maxdistance<<endl;
        if(n==1){
            if(sprinklers[0]==(*it1)){
                cout<<'R'<<endl;
            }else{
                cout<<'L'<<endl;
            }
        }else{
            for(int i=0;i<n;i++){
                if(n%3==2)cout<<'R';
                else cout<<'L';
            }
            cout<<endl;
        }
    }
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB User solution is incorrect
2 Halted 0 ms 0 KB -

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Correct
2 Correct 35 ms 4688 KB Correct
3 Correct 1 ms 344 KB Correct
4 Correct 42 ms 6664 KB Correct
5 Correct 66 ms 6708 KB Correct
6 Correct 1 ms 344 KB Correct
7 Correct 1 ms 344 KB Correct
8 Correct 13 ms 1472 KB Correct
9 Correct 1 ms 348 KB Correct

Subtask #2
0.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB User solution is incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB User solution is incorrect
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB User solution is incorrect
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB User solution is incorrect
2 Halted 0 ms 0 KB -