oj.uz

답안 #1069122

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1069122 2024-08-21T16:10:17 Z huutuan COVID tests (CEOI24_covid) C++14
60.15 / 100
 1776 ms 344 KB 
#include <cassert>
#include <cstdio>
#include <string>
#include <vector>

#include <bits/stdc++.h>

using namespace std;

/// 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.
int test_students(const std::vector<int> &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<int> find_positive() {
   vector<int> ans(N);
   vector<int> order(N);
   mt19937 rng(69420);
   iota(order.begin(), order.end(), 0);
   shuffle(order.begin(), order.end(), rng);
   auto query=[&](int l, int r) -> int {
      if (l>r) return 0;
      vector<int> test(N);
      for (int i=l; i<=r; ++i) test[order[i]]=1;
      return test_students(test);
   };
   int avg=P*N;
   avg=max(avg, 1);
   int size=1, best=1e9;
   for (int i=1; i<=N; ++i){
      // int qry=(N+i-1)/i+avg*ceil(log2(i))+avg;
      int qry=((N+i-1)/i+avg)*ceil(log2(i+1));
      if (best>qry){
         best=qry;
         size=i;
      }
   }
   for (int ll=0, rr=size-1; ll<N; ll+=size, rr+=size){
      rr=min(rr, N-1);
      // if (query(ll, rr)){
      //    int st=ll;
      //    do{
      //       int l=st, r=rr-1;
      //       while (l<=r){
      //          int mid=(l+r)>>1;
      //          if (query(st, mid)) r=mid-1;
      //          else l=mid+1;
      //       }
      //       ans[order[l]]=1;
      //       st=l+1;
      //    }while (query(st, rr));
      // }
      int st=ll;
      while (st<=rr){
         int l=st, r=rr;
         while (l<=r){
            int mid=(l+r)>>1;
            if (query(st, mid)) r=mid-1;
            else l=mid+1;
         }
         if (l<=rr) ans[order[l]]=1;
         st=l+1;
      }
   }
   return ans;
}

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<int> 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 'int test_students(const std::vector<int>&)':
Main.cpp:33:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |    scanf(" %c", &answer);
      |    ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:98:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   98 |    scanf("%d %lf %d", &N, &P, &T);
      |    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:114:12: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  114 |       scanf(" %c", &verdict);
      |       ~~~~~^~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
10.0 / 10.0

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

Subtask #2
50.149999998 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 344 KB Output is correct (P=0.001, F=15.1, Q=18.1) -> 50.15 points
2 Correct 137 ms 344 KB Output is correct (P=0.005256, F=51.1, Q=54.1) -> 72.88 points
3 Correct 269 ms 344 KB Output is correct (P=0.011546, F=94.9, Q=105.1) -> 62.94 points
4 Correct 500 ms 344 KB Output is correct (P=0.028545, F=191.5, Q=217.4) -> 58.40 points
5 Correct 719 ms 344 KB Output is correct (P=0.039856, F=246.3, Q=283.0) -> 56.39 points
6 Correct 1042 ms 344 KB Output is correct (P=0.068648, F=366.2, Q=418.2) -> 57.40 points
7 Correct 1382 ms 344 KB Output is correct (P=0.104571, F=490.3, Q=562.3) -> 56.70 points
8 Correct 1717 ms 344 KB Output is correct (P=0.158765, F=639.1, Q=702.4) -> 64.46 points
9 Correct 1776 ms 344 KB Output is correct (P=0.2, F=731.4, Q=795.6) -> 66.61 points