| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1346551 | MrAndria | Sprinklers (CEOI24_sprinklers) | C++20 | 40 ms | 1152 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];
signed main(){
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>a[i];
}
curr=1;
a[n+1]=3e9;
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";
}
cout<<endl;
}| # | 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... | ||||
