oj.uz

Submission #1068643

# Submission time Handle Problem Language Result Execution time Memory
1068643 2024-08-21T11:06:21 Z faruk COVID tests (CEOI24_covid) C++17
10 / 100
 4030 ms 344 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.
int T;
std::vector<bool> find_positive() {
    std::vector<bool> answer(N);

    if (T == 1) {
        for (int i = 0; i < N; i++) {
            vector<bool> query(N);
            query[i] = 1;
            if (test_students(query))
                answer[i] = 1;
        }
        return answer;
    }

    int last = -1;
    vector<bool> query(N);
    for (int i = 0; i < N; i++) {
        int l = last + 1, r = N, ans = -1;
        while (l < r) {
            int mid = (l + r) / 2;
            
            fill(query.begin() + l, query.begin() + mid + 1, true);
            if (test_students(query)) {
                fill(query.begin() + l, query.begin() + mid + 1, false);
                ans = mid, r = mid;
            }
            else
            {
                fill(query.begin() + l, query.begin() + mid + 1, false);
                l = mid + 1;
            }
        }
        if (ans == -1)
            break;
        answer[ans] = true;
        last = ans;
    }

    return answer;
}

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

Subtask #0
0.0 / 0.0

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 9 ms 344 KB Output is correct
3 Correct 6 ms 344 KB Output is correct
4 Correct 8 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 6 ms 344 KB Output is correct
10 Correct 6 ms 344 KB Output is correct
11 Correct 6 ms 344 KB Output is correct
12 Correct 6 ms 344 KB Output is correct
13 Correct 6 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 10 ms 344 KB Output is correct
17 Correct 11 ms 344 KB Output is correct

Subtask #2
0.0 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 344 KB Output is correct (P=0.001, F=15.1, Q=17.1) -> 58.83 points
2 Correct 131 ms 344 KB Output is correct (P=0.005256, F=51.1, Q=53.3) -> 76.78 points
3 Correct 262 ms 344 KB Output is correct (P=0.011546, F=94.9, Q=107.5) -> 58.78 points
4 Correct 607 ms 344 KB Output is correct (P=0.028545, F=191.5, Q=253.8) -> 39.11 points
5 Correct 918 ms 344 KB Output is correct (P=0.039856, F=246.3, Q=355.3) -> 32.49 points
6 Correct 1433 ms 340 KB Output is correct (P=0.068648, F=366.2, Q=606.4) -> 24.84 points
7 Correct 2138 ms 344 KB Output is correct (P=0.104571, F=490.3, Q=920.9) -> 19.94 points
8 Correct 3162 ms 344 KB Output is correct (P=0.158765, F=639.1, Q=1385.1) -> 15.88 points
9 Execution timed out 4030 ms 344 KB Time limit exceeded (wall clock)
10 Halted 0 ms 0 KB -