Submission #1346548

#TimeUsernameProblemLanguageResultExecution timeMemory
1346548MrAndriaSprinklers (CEOI24_sprinklers)C++20
0 / 100
38 ms864 KiB
#include <bits/stdc++.h>
using namespace std;
#define ff first;
#define ss second
#define pb push_back
//#define int long long
int n,m,x,curr,ans,a[1000005];
int main(){
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }

    curr=1;
    a[n+1]=INT_MAX;
    ans=0;
    for(int i=1;i<=m;i++){
        cin>>x;
        while(x>=a[curr]){
            curr++;
        }
        ans=max(ans,min(abs(x-a[curr-1]),abs(x-a[curr])));
    }
    cout<<ans<<endl;
    for(int i=1;i<=n/3;i++){
        cout<<"LLR";
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...