oj.uz

답안 #1076754

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1076754 2024-08-26T16:12:04 Z anton COVID tests (CEOI24_covid) C++17
31.39 / 100
 7000 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;

int group_sz =1;
// 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.
bool test_single(int u){
    vector<bool> mask(N, false);
    mask[u] = true;
    return test_students(mask);
}

bool test_inter(int l, int r){
    vector<bool> mask(N, false);
    for(int i = l; i<=r; i++){
        mask[i] = true;
    }
    return test_students(mask);
}
void find_positive(int l, int r, vector<bool>& res){
    if(l==r){
        res[l] = true;
        return;
    }
    int mid = (l+r)/2;
    if(test_inter(l, mid)){
        find_positive(l, mid, res);
    }
    if(test_inter(mid+1, r)){
        find_positive(mid+1, r, res);
    }
}
std::vector<bool> find_positive() {
    std::vector<bool> answer(N);

    int K = (N+group_sz-1)/group_sz;
    
    for(int nb_g= 0; nb_g<K; nb_g++){
        int l = nb_g * group_sz;
        int r= (nb_g+1)*group_sz-1;
        if(test_inter(l, min(r, N-1))){
            find_positive(l, min(r, N-1), answer);
        }
    }
    
    /*for(int i = 0; i<N; i+=group_sz){
        vector<bool>cur_mask (N, false);

        vector<int> order;
        for(int j = i; j<min(i+group_sz, N); j++){
            cur_mask[j] = true;
        }    
        
        if(test_students(cur_mask)){
            bool found = false;
            for(int j = i; j<min(i+group_sz, N); j++){
                answer[j] = test_single(j);
                cur_mask[j] = false;
                if(answer[j] && j<min(i+group_sz, N)-1){
                    if(!test_students(cur_mask)){
                        break;
                    }
                }
            }
        }
    }*/


    return answer;
}

int get_sz(double p, double target){
    int res = 1;
    double cur_p = p;
    while(cur_p>0.5){
        res ++;
        cur_p*=p;
    }
    return res;
}

int main() {
    int T;
    scanf("%d %lf %d", &N, &P, &T);

    // You may perform any extra initialization here.
    group_sz= min(max(get_sz((1.-P), 0.5), 1), N/2);
    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:115:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  115 |     scanf("%d %lf %d", &N, &P, &T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:131:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  131 |         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 8 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 7 ms 344 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 7 ms 344 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 6 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 10 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 6 ms 344 KB Output is correct
17 Execution timed out 7064 ms 344 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #2
31.390000002 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 344 KB Output is correct (P=0.001, F=15.1, Q=17.7) -> 53.29 points
2 Correct 177 ms 344 KB Output is correct (P=0.005256, F=51.1, Q=73.6) -> 32.59 points
3 Correct 326 ms 344 KB Output is correct (P=0.011546, F=94.9, Q=139.2) -> 31.39 points
4 Correct 657 ms 344 KB Output is correct (P=0.028545, F=191.5, Q=278.6) -> 31.92 points
5 Correct 838 ms 344 KB Output is correct (P=0.039856, F=246.3, Q=351.5) -> 33.23 points
6 Correct 1184 ms 344 KB Output is correct (P=0.068648, F=366.2, Q=506.0) -> 35.61 points
7 Correct 1577 ms 344 KB Output is correct (P=0.104571, F=490.3, Q=650.2) -> 39.05 points
8 Correct 1984 ms 344 KB Output is correct (P=0.158765, F=639.1, Q=822.8) -> 41.87 points
9 Correct 2207 ms 344 KB Output is correct (P=0.2, F=731.4, Q=907.2) -> 45.88 points