oj.uz

답안 #1119874

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1119874 2024-11-27T14:22:33 Z Tenis0206 COVID tests (CEOI24_covid) C++11
0 / 100
 4898 ms 508 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.

std::vector<bool> answer;

bool my_test_students(int st, int dr)
{
    vector<bool> mask(N);
    for(int i=st;i<=dr;i++)
    {
        mask[i] = true;
    }
    return test_students(mask);
}

void divide(int st, int dr)
{
    if(st == dr)
    {
        answer[st] = true;
        return;
    }
    int mij = (st + dr) >> 1;
    bool ok_st = my_test_students(st, mij);
    bool ok_dr = my_test_students(mij + 1, dr);
    if(ok_st)
    {
        divide(st, mij);
    }
    if(ok_dr)
    {
        divide(mij + 1, dr);
    }
}

void find_positive() {

    if(P < 2)
    {
        int poz = 0;
        while(poz < N)
        {
            int st = poz;
            int dr = N - 1;
            int rez = -1;
            while(st <= dr)
            {
                int mij = (st + dr) >> 1;
                bool ok = my_test_students(poz, mij);
                if(ok)
                {
                    rez = mij;
                    dr = mij - 1;
                }
                else
                {
                    st = mij + 1;
                }
            }
            if(rez == -1)
            {
                break;
            }
            answer[rez] = true;
            poz = rez + 1;
        }
    }
    else
    {
        vector<bool> mask(N);
        for(int i=0;i<N;i++)
        {
            mask[i] = false;
        }
        for(int i=0;i<N;i++)
        {
            mask[i] = true;
            bool ok = test_students(mask);
            answer[i] = ok;
            mask[i] = false;
        }
    }
}

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++) {
        answer.resize(N);
        for(int j=0;j<N;j++)
        {
            answer[j] = false;
        }
        find_positive();

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

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 109 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 113 ms 336 KB Output is correct (P=0.001, F=15.1, Q=18.1) -> 50.15 points
2 Correct 300 ms 336 KB Output is correct (P=0.005256, F=51.1, Q=54.2) -> 72.43 points
3 Correct 610 ms 336 KB Output is correct (P=0.011546, F=94.9, Q=108.0) -> 57.98 points
4 Correct 1461 ms 336 KB Output is correct (P=0.028545, F=191.5, Q=253.0) -> 39.39 points
5 Correct 1974 ms 336 KB Output is correct (P=0.039856, F=246.3, Q=352.5) -> 33.03 points
6 Correct 3502 ms 508 KB Output is correct (P=0.068648, F=366.2, Q=597.4) -> 25.53 points
7 Execution timed out 4898 ms 336 KB Time limit exceeded (wall clock)
8 Halted 0 ms 0 KB -