제출 #1235018

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1235018		laurra	COVID tests (CEOI24_covid)	C++20	87.57 / 100	806 ms	396 KiB

Main

#include <cassert>
#include <cstdio>
#include <string>
#include <vector>

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(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';
}

/// 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> answer;
int next_poz;
bool sem;
bool divide(int st,int dr,bool keep)
{
    if(sem==true)
        return 0;
    if(st==dr)
    {
        vector<bool> ask(N,0);
        if(keep==false)
        {
            ask[st]=1;
            answer[st]=test_students(ask);
        }
        else
        {
            answer[st]=1;
        }
        if(answer[st]==1)
        {
            next_poz=st+1;
            sem=true;
        }
        return answer[st];
    }
    if(keep==false)
    {
        vector<bool> ask(N,0);
        for(int i=st;i<=dr;i++)
        {
            ask[i]=1;
        }
        bool rasp=test_students(ask);
        if(rasp==0)
        {
            return 0;
        }
    }   
    int mijl=(st+dr)/2;
    bool pozitiv=divide(st,mijl,false);
    if(pozitiv==0)
        keep=true;
    else
        keep=false;
    if(sem==true)
        return 0;
    divide(mijl+1,dr,keep);
    return 1;
}
vector<bool> find_positive() 
{
    int block_size=1.0*(0.5/P),i;
    answer=vector<bool>(N,0);
    if (P == 0) return answer;
	if (P >= 1.0) {
		for (int i = 0; i < N; ++i) answer[i] = 1;
		return answer;
	}
    i=0;
    while(i<N)
    {
        next_poz=i+block_size+1;
        sem=false;
        divide(i,min(i+block_size,N-1),false);
        i=next_poz;
    }
    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++) {
        vector<bool> answer = find_positive();
        assert(answer.size() == (size_t)N);

        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;
}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In function 'bool test_students(std::vector<bool>)':
Main.cpp:31:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |     scanf(" %c", &answer);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:113:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  113 |     scanf("%d %lf %d", &N, &P, &T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:129:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  129 |         scanf(" %c", &verdict);
      |         ~~~~~^~~~~~~~~~~~~~~~~

• Subtask 0: 0 / 0
• Subtask 1: 10 / 10
• Subtask 2: 77.57 / 90