Submission #1046028

#TimeUsernameProblemLanguageResultExecution timeMemory
1046028gagik_2007Sprinklers (CEOI24_sprinklers)C++17
0 / 100
2061 ms1392 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; typedef pair<int, int> pii; typedef pair<ll, ll> pll; #define ff first #define ss second ll ttt; const ll INF=1e18; const ll MOD=1e9+7; const ll N=100007; ll n,m,k; int f[N],s[N]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); // freopen("Finput.txt","r",stdin); // freopen("Foutput.txt","w",stdout); cin>>n>>m; for(int i=0;i<n;i++){ cin>>s[i]; } for(int i=0;i<m;i++){ cin>>f[i]; } int ans=MOD; int ansmsk=0; for(int msk=0;msk<(1<<n);msk++){ int curmax=0; for(int j=0;j<m;j++){ int cur=MOD; for(int i=0;i<n;i++){ if(((msk&(1<<i))&&s[i]<f[j])|| (!(msk&(1<<i))&&s[i]>f[j])){ cur=min(cur,abs(s[i]-f[j])); } } curmax=max(curmax, cur); } if(ans>curmax){ ans=curmax; ansmsk=msk; } } if(ans==MOD){ cout<<-1<<endl; return 0; } cout<<ans<<endl; for(int i=0;i<n;i++){ if(ansmsk&(1<<i)){ cout<<"R"; } else{ cout<<"L"; } } cout<<endl; }
#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...