oj.uz

답안 #1037918

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1037918 2024-07-29T10:04:20 Z MilosMilutinovic COVID tests (CEOI24_covid) C++14
72.97 / 100
 1929 ms 344 KB 
#include <bits/stdc++.h>

using namespace std;

const double prob[] = {0.001, 0.005256, 0.011546, 0.028545, 0.039856, 0.068648, 0.104571, 0.158765, 0.2};
const int bs[] = {1000, 190, 86, 23, 17, 9, 7, 5, 5};

/// You may use:

// The number of students
int N;

// The probability any given student is positive
double P;

// This function performs a test on a subset of samples.
// Its argument is a vector of Booleans of length N,
// where the i-th element is true if the i-th sample should be added to the mix.
// It returns true if (and only if) at least one of the samples in the mix is positive.

bool test_students(std::vector<bool> mask) {
    assert(mask.size() == (size_t)N);

    std::string mask_str(N, ' ');
    for (int i = 0; i < N; i++)
        mask_str[i] = mask[i] ? '1' : '0';

    printf("Q %s\n", mask_str.c_str());
    fflush(stdout);

    char answer;
    scanf(" %c", &answer);
    return answer == 'P';
}

/// You should implement:

// This function will be called once for each test instance.
// It should use test_students to determine which samples are positive.
// It must return a vector of Booleans of length N,
// where the i-th element is true if and only if the i-th sample is positive.
std::vector<bool> find_positive() {
  vector<int> ids(N);
  iota(ids.begin(), ids.end(), 0);
  vector<bool> res(N);
  int B = 1;
  for (int i = 0; i < 9; i++) {
    if (P == prob[i]) {
      B = bs[i];
    }
  }
  while (!ids.empty()) {
    int n = (int) ids.size();
    vector<bool> qv(N);
    for (int i = 0; i < min(n, B); i++) {
      qv[ids[i]] = true;
    }
    if (!test_students(qv)) {
      vector<int> new_vec;
      for (int i = min(n, B); i < n; i++) {
        new_vec.push_back(ids[i]);
      }
      ids = new_vec;
      continue;
    }
    int low = 0, high = min(n, B) - 1, pos = -1;
    while (low <= high) {
      int mid = (low + high) >> 1;
      qv = vector<bool>(N, false);
      for (int i = 0; i <= mid; i++) {
        qv[ids[i]] = true;
      }
      if (test_students(qv)) {
        pos = mid;
        high = mid - 1;
      } else {
        low = mid + 1;
      }
    }
    assert(pos != -1);
    res[ids[pos]] = true;
    vector<int> new_vec;
    for (int i = pos + 1; i < n; i++) {
      new_vec.push_back(ids[i]);
    }
    ids = new_vec;
  }
  return res;
}

int main() {
    int T;
    scanf("%d %lf %d", &N, &P, &T);

    // You may perform any extra initialization here.

    for (int i = 0; i < T; i++) {
        std::vector<bool> answer = find_positive();
        assert(answer.size() == (size_t)N);

        std::string answer_str(N, ' ');
        for (int j = 0; j < N; j++)
            answer_str[j] = answer[j] ? '1' : '0';

        printf("A %s\n", answer_str.c_str());
        fflush(stdout);

        char verdict;
        scanf(" %c", &verdict);
        if (verdict == 'W')
            exit(0);
    }

    return 0;
}

Compilation message

Main.cpp: In function 'bool test_students(std::vector<bool>)':
Main.cpp:32:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |     scanf(" %c", &answer);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:93:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   93 |     scanf("%d %lf %d", &N, &P, &T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:109:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  109 |         scanf(" %c", &verdict);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 344 KB Output is correct
2 Correct 13 ms 344 KB Output is correct
3 Correct 11 ms 344 KB Output is correct
4 Correct 11 ms 344 KB Output is correct
5 Correct 9 ms 344 KB Output is correct
6 Correct 11 ms 344 KB Output is correct
7 Correct 9 ms 344 KB Output is correct
8 Correct 7 ms 344 KB Output is correct
9 Correct 9 ms 344 KB Output is correct
10 Correct 10 ms 344 KB Output is correct
11 Correct 8 ms 344 KB Output is correct
12 Correct 10 ms 344 KB Output is correct
13 Correct 8 ms 344 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 12 ms 344 KB Output is correct
17 Correct 5 ms 344 KB Output is correct

Subtask #2
62.970000003 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 344 KB Output is correct (P=0.001, F=15.1, Q=10.7) -> 90.00 points
2 Correct 97 ms 344 KB Output is correct (P=0.005256, F=51.1, Q=47.3) -> 90.00 points
3 Correct 189 ms 344 KB Output is correct (P=0.011546, F=94.9, Q=92.4) -> 90.00 points
4 Correct 434 ms 344 KB Output is correct (P=0.028545, F=191.5, Q=191.1) -> 90.00 points
5 Correct 648 ms 344 KB Output is correct (P=0.039856, F=246.3, Q=247.0) -> 88.99 points
6 Correct 865 ms 344 KB Output is correct (P=0.068648, F=366.2, Q=374.0) -> 82.93 points
7 Correct 1150 ms 344 KB Output is correct (P=0.104571, F=490.3, Q=509.4) -> 77.87 points
8 Correct 1638 ms 344 KB Output is correct (P=0.158765, F=639.1, Q=677.7) -> 72.49 points
9 Correct 1929 ms 344 KB Output is correct (P=0.2, F=731.4, Q=809.9) -> 62.97 points