oj.uz

답안 #1076756

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1076756 2024-08-26T16:13:14 Z oscar1f COVID tests (CEOI24_covid) C++17
52.27 / 100
 3126 ms 596 KB 
#include<bits/stdc++.h>
#include <cassert>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;

/// You may use:

// The number of students
int N;
vector<bool> rep;

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

bool dicho(int deb,int fin,bool assure) {
    bool ans;
    if (!assure) {
        vector<bool> quest;
        for (int i=0;i<N;i++) {
            if (i>=deb and i<=fin) {
                quest.push_back(true);
            }
            else {
                quest.push_back(false);
            }
        }
        ans=test_students(quest);
    }
    else {
        ans=true;
    }
    if (ans) {
        if (deb==fin) {
            rep[deb]=true;
        }
        else {
            int mid=(deb+fin)/2;
            if (dicho(deb,mid,false)) {
                dicho(mid+1,fin,false);
            }
            else {
                dicho(mid+1,fin,true);
            }
        }

    }
    return ans;
}

/// 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> find_positive() {
    vector<bool> quest(N,true);
    rep.clear();
    rep.resize(N,false);
    dicho(0,N-1,false);
    return rep;
}

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

Subtask #0
0.0 / 0.0

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

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 344 KB Output is correct
2 Correct 20 ms 596 KB Output is correct
3 Correct 20 ms 344 KB Output is correct
4 Correct 14 ms 596 KB Output is correct
5 Correct 16 ms 344 KB Output is correct
6 Correct 16 ms 344 KB Output is correct
7 Correct 15 ms 344 KB Output is correct
8 Correct 15 ms 344 KB Output is correct
9 Correct 22 ms 344 KB Output is correct
10 Correct 9 ms 344 KB Output is correct
11 Correct 14 ms 344 KB Output is correct
12 Correct 11 ms 344 KB Output is correct
13 Correct 14 ms 344 KB Output is correct
14 Correct 11 ms 344 KB Output is correct
15 Correct 14 ms 344 KB Output is correct
16 Correct 15 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct

Subtask #2
42.270000003 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 344 KB Output is correct (P=0.001, F=15.1, Q=13.9) -> 90.00 points
2 Correct 211 ms 344 KB Output is correct (P=0.005256, F=51.1, Q=61.5) -> 49.61 points
3 Correct 422 ms 344 KB Output is correct (P=0.011546, F=94.9, Q=119.1) -> 44.55 points
4 Correct 813 ms 344 KB Output is correct (P=0.028545, F=191.5, Q=242.3) -> 43.67 points
5 Correct 1041 ms 344 KB Output is correct (P=0.039856, F=246.3, Q=313.1) -> 43.17 points
6 Correct 1518 ms 344 KB Output is correct (P=0.068648, F=366.2, Q=462.9) -> 43.77 points
7 Correct 2151 ms 344 KB Output is correct (P=0.104571, F=490.3, Q=619.0) -> 43.90 points
8 Correct 2987 ms 344 KB Output is correct (P=0.158765, F=639.1, Q=807.6) -> 43.80 points
9 Correct 3126 ms 344 KB Output is correct (P=0.2, F=731.4, Q=937.9) -> 42.27 points