oj.uz

답안 #1119894

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1119894 2024-11-27T14:49:28 Z Tenis0206 COVID tests (CEOI24_covid) C++11
10 / 100
 65 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 < 0.01)
    {
        int poz = 0;
        while(poz < N)
        {
            if(my_test_students(poz + 1, N) == false)
            {
                break;
            }
            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
    {
        int poz = 0;
        while(poz < N)
        {
            int st = poz;
            int dr = min(N - 1, (int)(poz + 3 * (1 / P)));
            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)
            {
                st = poz;
                dr = N - 1;
                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;
        }
    }
}

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

Subtask #0
0.0 / 0.0

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

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 336 KB Output is correct
2 Correct 24 ms 336 KB Output is correct
3 Correct 31 ms 336 KB Output is correct
4 Correct 28 ms 336 KB Output is correct
5 Correct 34 ms 336 KB Output is correct
6 Correct 35 ms 336 KB Output is correct
7 Correct 24 ms 508 KB Output is correct
8 Correct 26 ms 336 KB Output is correct
9 Correct 27 ms 336 KB Output is correct
10 Correct 14 ms 336 KB Output is correct
11 Correct 24 ms 504 KB Output is correct
12 Correct 24 ms 336 KB Output is correct
13 Correct 27 ms 336 KB Output is correct
14 Correct 25 ms 336 KB Output is correct
15 Correct 21 ms 336 KB Output is correct
16 Correct 32 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct

Subtask #2
0.0 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 336 KB Output is correct (P=0.001, F=15.1, Q=10.7) -> 90.00 points
2 Incorrect 52 ms 336 KB translate:wrong
3 Halted 0 ms 0 KB -