oj.uz

답안 #1071872

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1071872 2024-08-23T12:01:39 Z _8_8_ COVID tests (CEOI24_covid) C++17
76.25 / 100
 1770 ms 344 KB 
#include <cassert>
#include <cstdio>
#include <string>
#include <vector>
#include <bits/stdc++.h>
using namespace std;;
/// You may use:
string s;
// 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 loc = 0;
bool test_students(std::vector<bool> mask) {
    if(loc) {
        bool ans = false;
        for(int i = 0; i < N; i++) {
            if(mask[i] && s[i] == '1') {
                ans = 1;
            }
        }
        return ans;
    }
    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:

mt19937 rng(123321);
// 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 as(int l,int r) {
    vector<bool> ask(N,0);
    for(int i = l;i <= min(N - 1,r);i++) {
        ask[i] = 1;
    }
    return test_students(ask);
}
std::vector<bool> find_positive() {
    vector<bool> answer(N),ask(N,0);
    function<int(int,int)>go = [&](int l,int r) {
        if(l == r) {
            answer[l] = 1;
            return l;
        }
        int mid = (l + r) >> 1;
        if(as(l,mid)) {
            return go(l,mid);
        }
        return go(mid+1,r);
    };
    function<void(int,int,int)>solve = [&](int l,int r,int b){
        int i = l;
        while(i < r) {
            int r = min(N - 1,i + b);
            if(as(i,r)) {
                // cout << i << ' ' << r << '\n';
                if(b == 31) {
                    solve(i,r,7);
                } else {
                    go(i,r);
                }
            }
            i = r + 1;
        }
    };
    if(P > 0.2){
        solve(0,N-1,170);
        return answer;
    } 
    int b = 0.5 / P + 1;
    int i = 0;
    while(i < N) {
        int r = min(i + b,N - 1);
        if(as(i,r)) {
            i = go(i,r)+1;
        } else {
            i = r + 1;
        }
    }
    return answer;
}

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

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB translate:wrong
2 Halted 0 ms 0 KB -

Subtask #1
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB translate:wrong
2 Halted 0 ms 0 KB -

Subtask #2
76.249999998 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 344 KB Output is correct (P=0.001, F=15.1, Q=10.9) -> 90.00 points
2 Correct 111 ms 344 KB Output is correct (P=0.005256, F=51.1, Q=47.3) -> 90.00 points
3 Correct 271 ms 344 KB Output is correct (P=0.011546, F=94.9, Q=92.5) -> 90.00 points
4 Correct 492 ms 344 KB Output is correct (P=0.028545, F=191.5, Q=191.5) -> 90.00 points
5 Correct 626 ms 344 KB Output is correct (P=0.039856, F=246.3, Q=247.3) -> 88.56 points
6 Correct 884 ms 344 KB Output is correct (P=0.068648, F=366.2, Q=372.2) -> 84.46 points
7 Correct 1074 ms 344 KB Output is correct (P=0.104571, F=490.3, Q=499.5) -> 83.72 points
8 Correct 1556 ms 344 KB Output is correct (P=0.158765, F=639.1, Q=667.9) -> 76.25 points
9 Correct 1770 ms 344 KB Output is correct (P=0.2, F=731.4, Q=740.9) -> 85.55 points