이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define ub(a,b) upper_bound(a.begin(),a.end(),b)-a.begin();
#define lb(a,b) lower_bound(a.begin(),a.end(),b)-a.begin();
#define vi vector<int>
#define vll vector<ll>
#define pll pair<ll,ll>
#define sz(x) x.size()
#define T pair<double,string>
using namespace std;
const int mxn=2e5+5;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int n,m;cin>>n>>m;
ll s[n+1],f[m+1];
for(int i=1;i<=n;i++)cin>>s[i];
for(int i=1;i<=m;i++)cin>>f[i];
for(int j=0;j<=8;j++){
int idx=1;int lr[n+1]={0};
for(int i=1;i<=n;i++){
while(idx<=m&&s[i]-j<=f[idx]&&f[idx]<s[i])lr[i]=1,idx++;
while(idx<=m&&s[i]==f[idx])idx++;
while(idx<=m&&s[i]<=f[idx]&&f[idx]<=s[i]+j&&lr[i]!=1)lr[i]=2,idx++;
}
if(idx==m+1){
cout<<j<<'\n';for(int i=1;i<=n;i++)cout<<(lr[i]==1?'L':'R');return 0;
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |