oj.uz

답안 #1044434

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1044434 2024-08-05T09:40:22 Z imarn Sprinklers (CEOI24_sprinklers) C++14
9 / 100
 36 ms 4424 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(f[idx]==s[i])idx++;
            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+1){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])idx++;
        while(idx<=m&&s[i]<=f[idx]&&f[idx]<=s[i]+l&&lr[i]!=1)idx++,lr[i]=2;
        if(idx==m+1&&!lr[i])lr[i]=2;
    }cout<<l<<'\n';
    for(int i=1;i<=n;i++)cout<<(lr[i]==1?"L":"R");
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Correct
2 Correct 0 ms 348 KB Correct

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Correct
2 Correct 6 ms 860 KB Correct
3 Correct 0 ms 348 KB Correct
4 Correct 7 ms 1024 KB Correct
5 Correct 8 ms 1116 KB Correct
6 Correct 0 ms 344 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 2 ms 604 KB Correct
9 Correct 0 ms 348 KB Correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Correct
2 Correct 8 ms 1116 KB Correct
3 Correct 2 ms 604 KB Correct
4 Correct 33 ms 2524 KB Correct
5 Correct 32 ms 2388 KB Correct
6 Correct 0 ms 348 KB Correct
7 Correct 0 ms 344 KB Correct
8 Correct 20 ms 2392 KB Correct
9 Correct 25 ms 2400 KB Correct
10 Correct 25 ms 2400 KB Correct
11 Correct 16 ms 1612 KB Correct
12 Correct 21 ms 1628 KB Correct
13 Correct 22 ms 2140 KB Correct
14 Correct 23 ms 2140 KB Correct
15 Correct 26 ms 2140 KB Correct
16 Correct 27 ms 2136 KB Correct

Subtask #3
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Correct
2 Correct 0 ms 348 KB Correct
3 Correct 0 ms 344 KB Correct
4 Correct 0 ms 348 KB Correct
5 Incorrect 0 ms 348 KB User solution is worse than jury's solution
6 Halted 0 ms 0 KB -

Subtask #4
0.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Correct
2 Correct 12 ms 1116 KB Correct
3 Incorrect 36 ms 4424 KB User solution is worse than jury's solution
4 Halted 0 ms 0 KB -

Subtask #5
0.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Correct
2 Correct 0 ms 348 KB Correct
3 Correct 6 ms 860 KB Correct
4 Correct 0 ms 348 KB Correct
5 Correct 7 ms 1024 KB Correct
6 Correct 8 ms 1116 KB Correct
7 Correct 0 ms 344 KB Correct
8 Correct 0 ms 348 KB Correct
9 Correct 2 ms 604 KB Correct
10 Correct 0 ms 348 KB Correct
11 Correct 8 ms 1116 KB Correct
12 Correct 2 ms 604 KB Correct
13 Correct 33 ms 2524 KB Correct
14 Correct 32 ms 2388 KB Correct
15 Correct 0 ms 348 KB Correct
16 Correct 0 ms 344 KB Correct
17 Correct 20 ms 2392 KB Correct
18 Correct 25 ms 2400 KB Correct
19 Correct 25 ms 2400 KB Correct
20 Correct 16 ms 1612 KB Correct
21 Correct 21 ms 1628 KB Correct
22 Correct 22 ms 2140 KB Correct
23 Correct 23 ms 2140 KB Correct
24 Correct 26 ms 2140 KB Correct
25 Correct 27 ms 2136 KB Correct
26 Correct 0 ms 344 KB Correct
27 Correct 0 ms 348 KB Correct
28 Incorrect 0 ms 348 KB User solution is worse than jury's solution
29 Halted 0 ms 0 KB -