제출 #1140756

#제출 시각아이디문제언어결과실행 시간메모리
1140756MuhammadSaramSprinklers (CEOI24_sprinklers)C++20
9 / 100
65 ms1188 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n,m; cin>>n>>m; int a[n],b[m]; for (int i=0;i<n;i++) cin>>a[i]; for (int i=0;i<m;i++) cin>>b[i]; int s=-1,e=1e9+1; while (s+1<e) { int mid=(s+e)/2; int id=0; for (int i=0;i<n && id<m;i++) { if (b[id]<a[i]) { while (id<m && b[id]>=a[i]-mid && b[id]<=a[i]) id++; } else { while (id<m && b[id]<=a[i]+mid) id++; } } if (id==m) e=mid; else s=mid; } if (e==1e9+1) e=-1; cout<<e<<endl; if (e!=-1) { int id=0; for (int i=0;i<n;i++) { if (id<m && b[id]<a[i]) { cout<<'L'; while (id<m && b[id]<=a[i]) id++; } else { cout<<'R'; while (id<m && b[id]<=a[i]+e) id++; } } cout<<endl; } return 0; }
#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...