oj.uz

Submission #1104216

# Submission time Handle Problem Language Result Execution time Memory
1104216 2024-10-23T09:08:35 Z SalihSahin COVID tests (CEOI24_covid) C++14
10 / 100
 2964 ms 504 KB 
#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.
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.
vector<bool> find_positive(){
    vector<bool> answer(N);
    
    vector<int> p(N);
    for(int i = 0; i < N; i++){
        p[i] = i;
    }
    random_shuffle(p.begin(), p.end());

    int G = 1;
    vector<int> res(N/G);
    vector<bool> msk(N);
    for(int i = 0; i < N; i += G){
        for(int j = i; j < i + G; j++){
            msk[p[j]] = 1;
        }
        res[i/G] = test_students(msk); 
        for(int j = i; j < i + G; j++){
            msk[p[j]] = 0;
        }
    }

    for(int i = 0; i < N/G; i++){
        if(res[i] == 1){
            answer[p[i]] = 1;
            /*
            for(int j = i*G; j < i*G + G; j++){
                msk[p[j]] = 1;
                bool ok = test_students(msk);
                if(ok) answer[p[j]] = 1;
                msk[p[j]] = 0;
            }
            */
        }
    }

    return answer;
}

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:27:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |     scanf(" %c", &answer);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:78:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   78 |     scanf("%d %lf %d", &N, &P, &T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:94:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   94 |         scanf(" %c", &verdict);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 336 KB Output is correct
2 Correct 9 ms 336 KB Output is correct
3 Correct 9 ms 336 KB Output is correct
4 Correct 13 ms 336 KB Output is correct
5 Correct 8 ms 336 KB Output is correct
6 Correct 8 ms 336 KB Output is correct
7 Correct 9 ms 504 KB Output is correct
8 Correct 9 ms 504 KB Output is correct
9 Correct 10 ms 336 KB Output is correct
10 Correct 9 ms 336 KB Output is correct
11 Correct 8 ms 336 KB Output is correct
12 Correct 10 ms 336 KB Output is correct
13 Correct 8 ms 336 KB Output is correct
14 Correct 8 ms 336 KB Output is correct
15 Correct 10 ms 336 KB Output is correct
16 Correct 8 ms 336 KB Output is correct
17 Correct 8 ms 336 KB Output is correct

Subtask #2
0.0 / 90.0

# Verdict Execution time Memory Grader output
1 Incorrect 2964 ms 336 KB Incorrect
2 Halted 0 ms 0 KB -