oj.uz

답안 #1094537

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1094537 2024-09-29T19:54:12 Z epicci23 Sprinklers (CEOI24_sprinklers) C++17
26 / 100
 89 ms 6052 KB 
#include "bits/stdc++.h"
#define int long long
#define all(v) v.begin() , v.end()
#define sz(a) (int)a.size()
using namespace std;


int n,m;
vector<int> a,b;

void _(){
  cin >> n >> m;
  for(int i=0;i<n;i++){
  	int x; cin >> x;
  	a.push_back(x);
  }
  for(int i=0;i<m;i++){
  	int x;cin >> x;
  	b.push_back(x);
  }

  auto check = [&](int pow)->pair<bool,vector<char>>{

    int p=0;
    vector<char> res(n,'L');

    for(int i=0;i<m;){

      if(p==n) return {0,res};
      int lol=-1;
      while(p<n && a[p]<=b[i]){
        res[p]='R';
        lol=max(lol,a[p]+pow);
        p++;
      }

      if(lol>=b[i]){
       while(i<m && lol>=b[i]) i++;
       continue;
      }

      if(i==m) return {1,res};
      if(p==n) return {0,res};
      
      vector<int> f; 
      while(p<n && a[p]-pow<=b[i]) f.push_back(p++);

      if(sz(f)==0) return {0,res};

      if(sz(f)==1){
        while(i<m && b[i]<=a[f[0]]) i++;
        continue;
      }

      if(sz(f)>=3){
        for(int j=0;j<sz(f);j++){
          if(j==sz(f)-2) continue;
          res[f[j]]='R';
        }
        while(i<m && b[i]<=a[f.back()]+pow) i++;
        continue;
      }

      while(i<m && b[i]<=a[f[0]]) i++;
      if(i==m) return {1,res};
      if(b[i]>=a[f[1]]){
        p--;
        continue;
      }
      else{
        res[f[0]]='R';
        while(i<m && b[i]<=a[f[0]]+pow) i++;
      }
    }
    return {1,res};
  };

  auto check2 = [&](int pow)->pair<bool,vector<char>>{
    int p=n-1;
    vector<char> res(n,'R');

    for(int i=m-1;i>=0;){

      if(p<0) return {0,res};
      int lol=(int)1e18;
      while(p>=0 && a[p]>=b[i]){
        res[p]='L';
        lol=min(lol,a[p]-pow);
        p--;
      }

      if(lol<=b[i]){
       while(i>=0 && lol<=b[i]) i--;
       continue;
      }

      if(i<0) return {1,res};
      if(p<0) return {0,res};
      
      vector<int> f; 
      while(p>=0 && a[p]+pow>=b[i]) f.push_back(p--);

      if(sz(f)==0) return {0,res};

      if(sz(f)==1){
        while(i>=0 && b[i]>=a[f[0]]) i--;
        continue;
      }

      if(sz(f)>=3){
        for(int j=0;j<sz(f);j++){
          if(j==sz(f)-2) continue;
          res[f[j]]='L';
        }
        while(i>=0 && b[i]>=a[f.back()]-pow) i--;
        continue;
      }

      while(i>=0 && b[i]>=a[f[0]]) i--;
      if(i==0) return {1,res};
      if(b[i]<=a[f[1]]){
        p++;
        continue;
      }
      else{
        res[f[0]]='L';
        while(i>=0 && b[i]>=a[f[0]]-pow) i--;
      }
    }
    return {1,res};
  };


  int l=0,r=(int)1e18;
  while(l<r){
    int m=(l+r)/2;
    if(check(m).first || check2(m).first) r=m;
    else l=m+1;
  }  
  if(r==(int)1e18) cout << -1 << '\n';
  else if(check2(m).first){
    auto X = check2(l);
    cout << l << '\n';
    for(char x:X.second) cout << x;
    cout << '\n';
  }
  else{
    auto X = check(l);
    cout << l << '\n';
    for(char x:X.second) cout << x;
    cout << '\n';
  }
}

int32_t main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int tc=1;//cin >> tc;
  while(tc--) _();
  return 0;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 9 ms 2268 KB Correct
3 Correct 0 ms 348 KB Correct
4 Correct 9 ms 2460 KB Correct
5 Correct 10 ms 2268 KB Correct
6 Correct 0 ms 348 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 2 ms 860 KB Correct
9 Correct 0 ms 348 KB Correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 10 ms 2272 KB Correct
3 Correct 6 ms 984 KB Correct
4 Correct 58 ms 5936 KB Correct
5 Correct 58 ms 5924 KB Correct
6 Correct 0 ms 348 KB Correct
7 Correct 0 ms 452 KB Correct
8 Correct 80 ms 6036 KB Correct
9 Correct 78 ms 6052 KB Correct
10 Correct 89 ms 5976 KB Correct
11 Correct 13 ms 2580 KB Correct
12 Correct 30 ms 3548 KB Correct
13 Correct 66 ms 4832 KB Correct
14 Correct 66 ms 5040 KB Correct
15 Correct 29 ms 4056 KB Correct
16 Correct 65 ms 4740 KB Correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 0 ms 348 KB Correct
3 Correct 1 ms 348 KB Correct
4 Correct 0 ms 348 KB Correct
5 Correct 0 ms 348 KB Correct
6 Correct 0 ms 348 KB Correct
7 Correct 1 ms 348 KB Correct
8 Correct 0 ms 464 KB Correct
9 Correct 0 ms 348 KB Correct
10 Correct 1 ms 348 KB Correct
11 Correct 0 ms 348 KB Correct
12 Correct 0 ms 348 KB Correct
13 Correct 1 ms 348 KB Correct
14 Correct 0 ms 348 KB Correct
15 Correct 0 ms 348 KB Correct
16 Correct 0 ms 348 KB Correct
17 Correct 0 ms 348 KB Correct
18 Correct 0 ms 348 KB Correct
19 Correct 0 ms 348 KB Correct
20 Correct 0 ms 348 KB Correct

Subtask #4
0.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 21 ms 2516 KB Correct
3 Correct 46 ms 4564 KB Correct
4 Correct 43 ms 4340 KB Correct
5 Correct 43 ms 4568 KB Correct
6 Correct 49 ms 4564 KB Correct
7 Correct 77 ms 5852 KB Correct
8 Correct 46 ms 4568 KB Correct
9 Correct 45 ms 4564 KB Correct
10 Incorrect 80 ms 5920 KB User solution is incorrect
11 Halted 0 ms 0 KB -

Subtask #5
0.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 0 ms 348 KB Correct
3 Correct 9 ms 2268 KB Correct
4 Correct 0 ms 348 KB Correct
5 Correct 9 ms 2460 KB Correct
6 Correct 10 ms 2268 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 0 ms 348 KB Correct
9 Correct 2 ms 860 KB Correct
10 Correct 0 ms 348 KB Correct
11 Correct 10 ms 2272 KB Correct
12 Correct 6 ms 984 KB Correct
13 Correct 58 ms 5936 KB Correct
14 Correct 58 ms 5924 KB Correct
15 Correct 0 ms 348 KB Correct
16 Correct 0 ms 452 KB Correct
17 Correct 80 ms 6036 KB Correct
18 Correct 78 ms 6052 KB Correct
19 Correct 89 ms 5976 KB Correct
20 Correct 13 ms 2580 KB Correct
21 Correct 30 ms 3548 KB Correct
22 Correct 66 ms 4832 KB Correct
23 Correct 66 ms 5040 KB Correct
24 Correct 29 ms 4056 KB Correct
25 Correct 65 ms 4740 KB Correct
26 Correct 1 ms 348 KB Correct
27 Correct 0 ms 348 KB Correct
28 Correct 0 ms 348 KB Correct
29 Correct 0 ms 348 KB Correct
30 Correct 1 ms 348 KB Correct
31 Correct 0 ms 464 KB Correct
32 Correct 0 ms 348 KB Correct
33 Correct 1 ms 348 KB Correct
34 Correct 0 ms 348 KB Correct
35 Correct 0 ms 348 KB Correct
36 Correct 1 ms 348 KB Correct
37 Correct 0 ms 348 KB Correct
38 Correct 0 ms 348 KB Correct
39 Correct 0 ms 348 KB Correct
40 Correct 0 ms 348 KB Correct
41 Correct 0 ms 348 KB Correct
42 Correct 0 ms 348 KB Correct
43 Correct 0 ms 348 KB Correct
44 Correct 21 ms 2516 KB Correct
45 Correct 46 ms 4564 KB Correct
46 Correct 43 ms 4340 KB Correct
47 Correct 43 ms 4568 KB Correct
48 Correct 49 ms 4564 KB Correct
49 Correct 77 ms 5852 KB Correct
50 Correct 46 ms 4568 KB Correct
51 Correct 45 ms 4564 KB Correct
52 Incorrect 80 ms 5920 KB User solution is incorrect
53 Halted 0 ms 0 KB -