oj.uz

Submission #1051565

# Submission time Handle Problem Language Result Execution time Memory
1051565 2024-08-10T08:11:15 Z MercubytheFirst How to Avoid Disqualification in 75 Easy Steps (CEOI23_avoid) C++17
5 / 100
 1 ms 596 KB 
#include "avoid.h"
#include <bits/stdc++.h>
using namespace std;


std::pair<int, int> scout(int R, int H) {
  int l = 1, r = 1000, ans = -1;
  while(l <= r) {
    int m = (l + r) / 2;
    vector<int> query;
    for(int i = l; i <= m; ++i) {
      query.push_back(i);
    }
    send(query);
    bool ok = wait()[0];
    if(ok) {
      ans = m;
      r = m - 1;
    }
    else {
      l = m + 1;
    }
  }
  const int a = ans;
  l = a+1, r = 1000, ans = -1;
  while(l <= r) {
    int m = (l + r) / 2;
    vector<int> query;
    for(int i = l; i <= m; ++i) {
      query.push_back(i);
    }
    send(query);
    bool ok = wait()[0];
    if(ok) {
      ans = m;
      r = m - 1;
    }
    else {
      l = m + 1;
    }
  }
  const int b = (ans == -1 ? a : ans);
  assert(a != -1 and b != -1);
  return {a, b};
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed

Subtask #1
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Correct: 16 robot(s) used, 16 hour(s) passed
2 Correct 1 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
3 Correct 0 ms 344 KB Correct: 18 robot(s) used, 18 hour(s) passed
4 Correct 1 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
5 Correct 0 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
6 Correct 1 ms 344 KB Correct: 18 robot(s) used, 18 hour(s) passed
7 Correct 0 ms 344 KB Correct: 18 robot(s) used, 18 hour(s) passed
8 Correct 0 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
9 Correct 1 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
10 Correct 0 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
11 Correct 1 ms 344 KB Correct: 17 robot(s) used, 17 hour(s) passed
12 Correct 1 ms 344 KB Correct: 18 robot(s) used, 18 hour(s) passed
13 Correct 1 ms 344 KB Correct: 18 robot(s) used, 18 hour(s) passed
14 Correct 1 ms 344 KB Correct: 18 robot(s) used, 18 hour(s) passed
15 Correct 0 ms 344 KB Correct: 14 robot(s) used, 14 hour(s) passed
16 Correct 0 ms 344 KB Correct: 17 robot(s) used, 17 hour(s) passed
17 Correct 0 ms 344 KB Correct: 17 robot(s) used, 17 hour(s) passed
18 Correct 1 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
19 Correct 0 ms 344 KB Correct: 17 robot(s) used, 17 hour(s) passed
20 Correct 0 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
21 Correct 1 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
22 Correct 1 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
23 Correct 1 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
24 Correct 0 ms 344 KB Correct: 13 robot(s) used, 13 hour(s) passed
25 Correct 1 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
26 Correct 1 ms 344 KB Correct: 18 robot(s) used, 18 hour(s) passed
27 Correct 0 ms 344 KB Correct: 17 robot(s) used, 17 hour(s) passed
28 Correct 1 ms 344 KB Correct: 16 robot(s) used, 16 hour(s) passed
29 Correct 0 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
30 Correct 1 ms 344 KB Correct: 18 robot(s) used, 18 hour(s) passed
31 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
32 Correct 0 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
33 Correct 1 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
34 Correct 1 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
35 Correct 1 ms 344 KB Correct: 18 robot(s) used, 18 hour(s) passed
36 Correct 0 ms 344 KB Correct: 15 robot(s) used, 15 hour(s) passed
37 Correct 1 ms 344 KB Correct: 12 robot(s) used, 12 hour(s) passed
38 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
39 Correct 1 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
40 Correct 0 ms 344 KB Correct: 18 robot(s) used, 18 hour(s) passed
41 Correct 1 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
42 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
43 Correct 1 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
44 Correct 1 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
45 Correct 0 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
46 Correct 1 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
47 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
48 Correct 0 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
49 Correct 0 ms 596 KB Correct: 19 robot(s) used, 19 hour(s) passed
50 Correct 0 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
51 Correct 0 ms 344 KB Correct: 10 robot(s) used, 10 hour(s) passed
52 Correct 1 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
53 Correct 1 ms 344 KB Correct: 20 robot(s) used, 20 hour(s) passed
54 Correct 0 ms 344 KB Correct: 19 robot(s) used, 19 hour(s) passed
55 Correct 0 ms 344 KB Correct: 11 robot(s) used, 11 hour(s) passed

Subtask #3
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 75.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Not correct
2 Halted 0 ms 0 KB -