답안 #1044352

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1044352 2024-08-05T09:01:28 Z imarn Sprinklers (CEOI24_sprinklers) C++14
6 / 100
38 ms 2652 KB
#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];
    ll l=0,r=1e12+1;
    int lr[n+1]={0};
    while(l<r){
        ll k=(l+r)>>1;
        int idx=1;memset(lr,0,sizeof lr);
        for(int i=1;i<=n;i++){
            while(idx<=m&&s[i]-k<=f[idx]&&f[idx]<s[i])idx++,lr[i]=1;
            while(idx<=m&&s[i]<=f[idx]&&f[idx]<=s[i]+k&&lr[i]!=1)idx++,lr[i]=2;
        }if(idx!=m+1)l=k+1;
        else r=k;
    }if(l==1e12){cout<<-1;return 0;}
    memset(lr,0,sizeof lr);int idx=1;
    for(int i=1;i<=n;i++){
        while(idx<=m&&s[i]-l<=f[idx]&&f[idx]<=s[i])idx++,lr[i]=1;
        while(idx<=m&&s[i]<=f[idx]&&f[idx]<=s[i]+l&&lr[i]!=1)idx++,lr[i]=2;
    }cout<<l<<'\n';
    for(int i=1;i<=n;i++)cout<<(lr[i]==1?"L":"R");
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Correct
2 Incorrect 0 ms 348 KB Expected int32, but "1000000000001" found
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Expected int32, but "1000000000001" found
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 8 ms 1244 KB Correct
3 Correct 2 ms 604 KB Correct
4 Correct 28 ms 2400 KB Correct
5 Correct 29 ms 2652 KB Correct
6 Correct 0 ms 348 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 18 ms 2396 KB Correct
9 Correct 22 ms 2396 KB Correct
10 Correct 38 ms 2400 KB Correct
11 Correct 14 ms 1628 KB Correct
12 Correct 25 ms 1620 KB Correct
13 Correct 34 ms 2140 KB Correct
14 Correct 22 ms 2144 KB Correct
15 Correct 37 ms 2140 KB Correct
16 Correct 23 ms 2136 KB Correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Correct
2 Incorrect 0 ms 348 KB Expected int32, but "1000000000001" found
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Correct
2 Incorrect 11 ms 1316 KB Expected int32, but "1000000000001" found
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Correct
2 Incorrect 0 ms 348 KB Expected int32, but "1000000000001" found
3 Halted 0 ms 0 KB -