oj.uz

답안 #1040570

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1040570 2024-08-01T07:30:18 Z 우민규(#10996) How to Avoid Disqualification in 75 Easy Steps (CEOI23_avoid) C++17
5 / 100
 1 ms 456 KB 
#include "avoid.h"
#include <bits/stdc++.h>
using namespace std;

const int n = 1000;

void my_send(function<bool(int)> f) {
  vector<int> to_send;
  for (int i = 0; i < n; ++i) {
    if (f(i)) to_send.push_back(i + 1);
  }
  send(to_send);
}

std::pair<int, int> scout(int R, int H) {
  int g1 = 0;
  for (int bit = 0; bit < 10; ++bit) {
    my_send([&](int x) { if ((x & g1) != g1) return false; return (bool)(x & (1 << bit)); });
    if (wait()[0]) {
      g1 |= 1 << bit;
    }
  }
  for (int bit = 0; bit < 10; ++bit) {
    my_send([&](int x) { return (x != g1) && ((x + 1) & (1 << bit));});
  }
  auto p = wait();
  int g2 = 0;
  for (int i = 0; i < p.size(); ++i) {
    if (p[i]) g2 |= 1 << i;
  }
  if (g2 == 0) {
    return {g1 + 1, g1 + 1};
  } else {
    return {g1 + 1, g2};
  }
}

#ifndef EVAL
#include "sample_grader.cpp"
#endif

Compilation message

avoid.cpp: In function 'std::pair<int, int> scout(int, int)':
avoid.cpp:28:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |   for (int i = 0; i < p.size(); ++i) {
      |                   ~~^~~~~~~~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed

Subtask #1
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 440 KB Correct: 20 robot(s) used, 11 hour(s) passed
2 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
3 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
4 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
5 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
6 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
7 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
8 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
9 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
10 Correct 1 ms 444 KB Correct: 20 robot(s) used, 11 hour(s) passed
11 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
12 Correct 1 ms 444 KB Correct: 20 robot(s) used, 11 hour(s) passed
13 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
14 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
15 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
16 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
17 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
18 Correct 1 ms 444 KB Correct: 20 robot(s) used, 11 hour(s) passed
19 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
20 Correct 0 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
21 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
22 Correct 1 ms 340 KB Correct: 20 robot(s) used, 11 hour(s) passed
23 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
24 Correct 0 ms 440 KB Correct: 20 robot(s) used, 11 hour(s) passed
25 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
26 Correct 1 ms 444 KB Correct: 20 robot(s) used, 11 hour(s) passed
27 Correct 1 ms 356 KB Correct: 20 robot(s) used, 11 hour(s) passed
28 Correct 1 ms 456 KB Correct: 20 robot(s) used, 11 hour(s) passed
29 Correct 1 ms 448 KB Correct: 20 robot(s) used, 11 hour(s) passed
30 Correct 1 ms 352 KB Correct: 20 robot(s) used, 11 hour(s) passed
31 Correct 0 ms 356 KB Correct: 20 robot(s) used, 11 hour(s) passed
32 Correct 1 ms 352 KB Correct: 20 robot(s) used, 11 hour(s) passed
33 Correct 1 ms 352 KB Correct: 20 robot(s) used, 11 hour(s) passed
34 Correct 1 ms 452 KB Correct: 20 robot(s) used, 11 hour(s) passed
35 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
36 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
37 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
38 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
39 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
40 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
41 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
42 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
43 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
44 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
45 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
46 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
47 Correct 0 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
48 Correct 0 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
49 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
50 Correct 0 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
51 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
52 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
53 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
54 Correct 1 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed
55 Correct 0 ms 344 KB Correct: 20 robot(s) used, 11 hour(s) passed

Subtask #3
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Not correct
2 Halted 0 ms 0 KB -