oj.uz

답안 #1076830

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1076830 2024-08-26T17:01:21 Z abouton COVID tests (CEOI24_covid) C++17
30.19 / 100
 2268 ms 596 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;
int K = 2;
vector<bool> answer;

// 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);
    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';
}
void tester(int a, int b)
{
    //printf("%d %d\n", a, b);
    if (b <= a) return;
    if (b==a+1)
    {
        vector<bool> quest(N);
        quest[a] = true;
        answer[a] = test_students(quest);
        return;
    }
    vector<bool> quest(N);
    for (int i = a; i < b; i ++) quest[i] = true;
    if (!test_students(quest)) return; 
    int t = (b-a)/K;
    int r = (b-a)%K;
    int nbit = 0, cur = a;
    while (cur < b)
    {
        int deb = cur;
        cur += t;
        cur += (nbit<r);
        nbit++;
        //printf("%d a %d\n", deb, cur);
        tester(deb, cur);
    }
}

/// 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() {
    answer.clear();
    answer.resize(N);
    int taille;
    if (P >= 0.5) taille = 1;
    else taille = ceil(log(0.4)/log(1-P));
    int i = 0;
    //cout << taille;
    while (i < N)
    {
        int deb = i;
        i += taille;
        i = min(i, N);
        vector<bool> quest(N);
        for (int j = deb ; j< i; j ++) quest[j] = true;
        tester(deb, i);
    }
    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:86:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   86 |     scanf("%d %lf %d", &N, &P, &T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:101:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  101 |         scanf(" %c", &verdict);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 9 ms 344 KB Output is correct
4 Correct 6 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 9 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 7 ms 344 KB Output is correct
12 Correct 7 ms 344 KB Output is correct
13 Correct 6 ms 344 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 6 ms 344 KB Output is correct
17 Runtime error 0 ms 344 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -

Subtask #2
30.189999996 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 436 KB Output is correct (P=0.001, F=15.1, Q=18.3) -> 48.71 points
2 Correct 189 ms 344 KB Output is correct (P=0.005256, F=51.1, Q=74.5) -> 31.78 points
3 Correct 340 ms 344 KB Output is correct (P=0.011546, F=94.9, Q=141.9) -> 30.19 points
4 Correct 643 ms 596 KB Output is correct (P=0.028545, F=191.5, Q=278.2) -> 32.02 points
5 Correct 837 ms 344 KB Output is correct (P=0.039856, F=246.3, Q=359.0) -> 31.80 points
6 Correct 1276 ms 344 KB Output is correct (P=0.068648, F=366.2, Q=513.6) -> 34.48 points
7 Correct 1593 ms 344 KB Output is correct (P=0.104571, F=490.3, Q=664.8) -> 37.13 points
8 Correct 2111 ms 344 KB Output is correct (P=0.158765, F=639.1, Q=842.1) -> 39.64 points
9 Correct 2268 ms 344 KB Output is correct (P=0.2, F=731.4, Q=954.3) -> 40.56 points