Submission #1070226

#	Time	Username	Problem	Language	Result	Execution time	Memory
1070226		naneosmic	Sprinklers (CEOI24_sprinklers)	C++14	3 / 100	66 ms	6708 KiB

Main

#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
• Subtask 1: 3 / 3
• Subtask 2: 0 / 6
• Subtask 3: 0 / 17
• Subtask 4: 0 / 27
• Subtask 5: 0 / 47