oj.uz

답안 #1114471

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1114471 2024-11-19T00:18:23 Z dynam1c Sprinklers (CEOI24_sprinklers) C++17
26 / 100
 116 ms 3196 KB 
#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m;
  cin >> n >> m;
  vector<int> s(n), f(m);
  for (int& e : s)
    cin >> e;
  for (int& e : f)
    cin >> e;

  vector<char> d(n);
  auto check = [&](int k) {
    d.assign(n, 0);
    int x = -1;
    int j = 0;
    int li = -1, lj;
    for (int i = 0; i < n; i++) {
      if (s[i] <= x)
        x = s[i]+k, d[i] = 'R';
      else if (j < m && f[j] < s[i]) {
        if (s[i]-f[j] > k)
          return false;
        x = s[i], d[i] = 'L';
        if (li >= 0 && s[i]-k <= f[lj]) {
          x = s[li]+k;
          d[li] = 'R';
        }
        li = i, lj = j;
      } else
        x = s[i]+k, d[i] = 'R';
      while (j < m && f[j] <= x)
        j++;
    }
    return j == m;
  };

  if (!check(1e9)) {
    cout << -1 << endl;
    return 0;
  }

  int l = -1, r = 1e9;
  while (r-l > 1) {
    int m = (l+r)/2;
    if (check(m))
      r = m;
    else
      l = m;
  }

  check(r);

  for (int i = 0; i < n; i++)
    if (d[i] == 'L')
      s[i] -= r;
  sort(s.begin(), s.end());
  int j = 0;
  for (int e : s) {
    if (j == m)
      break;
    assert(e <= f[j]);
    while (j < m && f[j] <= e+r)
      j++;
  }
  assert(j == m);

  cout << r << endl;
  for (char c : d)
    cout << c;
  cout << endl;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Correct
2 Correct 1 ms 336 KB Correct

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Correct
2 Correct 21 ms 592 KB Correct
3 Correct 1 ms 336 KB Correct
4 Correct 27 ms 1788 KB Correct
5 Correct 35 ms 1616 KB Correct
6 Correct 1 ms 336 KB Correct
7 Correct 1 ms 336 KB Correct
8 Correct 7 ms 592 KB Correct
9 Correct 1 ms 336 KB Correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Correct
2 Correct 27 ms 592 KB Correct
3 Correct 7 ms 336 KB Correct
4 Correct 70 ms 1212 KB Correct
5 Correct 92 ms 1212 KB Correct
6 Correct 1 ms 336 KB Correct
7 Correct 1 ms 336 KB Correct
8 Correct 65 ms 1212 KB Correct
9 Correct 65 ms 3196 KB Correct
10 Correct 68 ms 3024 KB Correct
11 Correct 43 ms 1824 KB Correct
12 Correct 44 ms 928 KB Correct
13 Correct 53 ms 1096 KB Correct
14 Correct 67 ms 1080 KB Correct
15 Correct 61 ms 1104 KB Correct
16 Correct 46 ms 1104 KB Correct

Subtask #3
17.0 / 17.0

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

Subtask #4
0.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Correct
2 Correct 34 ms 856 KB Correct
3 Correct 88 ms 1212 KB Correct
4 Correct 92 ms 1352 KB Correct
5 Correct 89 ms 1216 KB Correct
6 Correct 93 ms 1352 KB Correct
7 Correct 116 ms 1212 KB Correct
8 Correct 89 ms 1208 KB Correct
9 Correct 96 ms 1208 KB Correct
10 Correct 86 ms 1340 KB Correct
11 Correct 93 ms 1352 KB Correct
12 Correct 1 ms 336 KB Correct
13 Correct 1 ms 336 KB Correct
14 Correct 43 ms 928 KB Correct
15 Correct 38 ms 840 KB Correct
16 Correct 39 ms 996 KB Correct
17 Correct 32 ms 1360 KB Correct
18 Correct 35 ms 1352 KB Correct
19 Correct 42 ms 1316 KB Correct
20 Correct 79 ms 1212 KB Correct
21 Runtime error 74 ms 2120 KB Execution killed with signal 6
22 Halted 0 ms 0 KB -

Subtask #5
0.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Correct
2 Correct 1 ms 336 KB Correct
3 Correct 21 ms 592 KB Correct
4 Correct 1 ms 336 KB Correct
5 Correct 27 ms 1788 KB Correct
6 Correct 35 ms 1616 KB Correct
7 Correct 1 ms 336 KB Correct
8 Correct 1 ms 336 KB Correct
9 Correct 7 ms 592 KB Correct
10 Correct 1 ms 336 KB Correct
11 Correct 27 ms 592 KB Correct
12 Correct 7 ms 336 KB Correct
13 Correct 70 ms 1212 KB Correct
14 Correct 92 ms 1212 KB Correct
15 Correct 1 ms 336 KB Correct
16 Correct 1 ms 336 KB Correct
17 Correct 65 ms 1212 KB Correct
18 Correct 65 ms 3196 KB Correct
19 Correct 68 ms 3024 KB Correct
20 Correct 43 ms 1824 KB Correct
21 Correct 44 ms 928 KB Correct
22 Correct 53 ms 1096 KB Correct
23 Correct 67 ms 1080 KB Correct
24 Correct 61 ms 1104 KB Correct
25 Correct 46 ms 1104 KB Correct
26 Correct 1 ms 336 KB Correct
27 Correct 1 ms 336 KB Correct
28 Correct 1 ms 336 KB Correct
29 Correct 2 ms 336 KB Correct
30 Correct 1 ms 440 KB Correct
31 Correct 1 ms 336 KB Correct
32 Correct 1 ms 336 KB Correct
33 Correct 1 ms 336 KB Correct
34 Correct 1 ms 336 KB Correct
35 Correct 1 ms 336 KB Correct
36 Correct 1 ms 336 KB Correct
37 Correct 1 ms 336 KB Correct
38 Correct 1 ms 336 KB Correct
39 Correct 1 ms 592 KB Correct
40 Correct 1 ms 336 KB Correct
41 Correct 1 ms 336 KB Correct
42 Correct 1 ms 336 KB Correct
43 Correct 1 ms 336 KB Correct
44 Correct 34 ms 856 KB Correct
45 Correct 88 ms 1212 KB Correct
46 Correct 92 ms 1352 KB Correct
47 Correct 89 ms 1216 KB Correct
48 Correct 93 ms 1352 KB Correct
49 Correct 116 ms 1212 KB Correct
50 Correct 89 ms 1208 KB Correct
51 Correct 96 ms 1208 KB Correct
52 Correct 86 ms 1340 KB Correct
53 Correct 93 ms 1352 KB Correct
54 Correct 1 ms 336 KB Correct
55 Correct 1 ms 336 KB Correct
56 Correct 43 ms 928 KB Correct
57 Correct 38 ms 840 KB Correct
58 Correct 39 ms 996 KB Correct
59 Correct 32 ms 1360 KB Correct
60 Correct 35 ms 1352 KB Correct
61 Correct 42 ms 1316 KB Correct
62 Correct 79 ms 1212 KB Correct
63 Runtime error 74 ms 2120 KB Execution killed with signal 6
64 Halted 0 ms 0 KB -