제출 #1044460

#제출 시각아이디문제언어결과실행 시간메모리
1044460imarnSprinklers (CEOI24_sprinklers)C++14
0 / 100
12 ms2396 KiB
#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 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...